blob: f626377e50a2e2f9e0c6f15b24ef5117210e8e83 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
|
#ifndef __NR_MATRIX_H__
#define __NR_MATRIX_H__
/** \file
* Definition of NR::Matrix type.
*
* \note Operator functions (e.g. Matrix * Matrix etc.) are mostly in
* libnr/nr-matrix-ops.h. See end of file for discussion.
*
* Main authors:
* Lauris Kaplinski <lauris@kaplinski.com>:
* Original NRMatrix definition and related macros.
*
* Nathan Hurst <njh@mail.csse.monash.edu.au>:
* NR::Matrix class version of the above.
*
* This code is in public domain.
*/
#include <glib.h> // g_assert()
#include <glib/gmessages.h>
#include "libnr/nr-coord.h"
#include "libnr/nr-values.h"
#include <libnr/nr-rotate.h>
#include <libnr/nr-scale.h>
#include <libnr/nr-translate.h>
namespace NR {
/**
* The Matrix class.
*
* For purposes of multiplication, points should be thought of as row vectors
*
* p = ( p[X] p[Y] 1 )
*
* to be right-multiplied by transformation matrices
* \verbatim
c[] = | c[0] c[1] 0 |
| c[2] c[3] 0 |
| c[4] c[5] 1 | \endverbatim
*
* (so the columns of the matrix correspond to the columns (elements) of the result,
* and the rows of the matrix correspond to columns (elements) of the "input").
*/
class Matrix {
public:
/**
* Various forms of constructor
*/
/**
*
*/
explicit Matrix() { }
/**
*
*/
Matrix(Matrix const &m) {
NR::Coord const *src = m._c;
NR::Coord *dest = _c;
*dest++ = *src++; //0
*dest++ = *src++; //1
*dest++ = *src++; //2
*dest++ = *src++; //3
*dest++ = *src++; //4
*dest = *src ; //5
}
/**
*
*/
Matrix(double c0, double c1,
double c2, double c3,
double c4, double c5) {
NR::Coord *dest = _c;
*dest++ = c0; //0
*dest++ = c1; //1
*dest++ = c2; //2
*dest++ = c3; //3
*dest++ = c4; //4
*dest = c5; //5
}
/**
*
*/
Matrix &operator=(Matrix const &m) {
NR::Coord const *src = m._c;
NR::Coord *dest = _c;
*dest++ = *src++; //0
*dest++ = *src++; //1
*dest++ = *src++; //2
*dest++ = *src++; //3
*dest++ = *src++; //4
*dest = *src ; //5
return *this;
}
/**
*
*/
explicit Matrix(scale const &sm) {
NR::Coord *dest = _c;
*dest++ = sm[X]; //0
*dest++ = 0.0; //1
*dest++ = 0.0; //2
*dest++ = sm[Y]; //3
*dest++ = 0.0; //4
*dest = 0.0; //5
}
/**
*
*/
explicit Matrix(rotate const &r) {
NR::Coord *dest = _c;
*dest++ = r.vec[X]; //0
*dest++ = r.vec[Y]; //1
*dest++ = -r.vec[Y]; //2
*dest++ = r.vec[X]; //3
*dest++ = 0.0; //4
*dest = 0.0; //5
}
/**
*
*/
explicit Matrix(translate const &tm) {
NR::Coord *dest = _c;
*dest++ = 1.0; //0
*dest++ = 0.0; //1
*dest++ = 0.0; //2
*dest++ = 1.0; //3
*dest++ = tm[X]; //4
*dest = tm[Y]; //5
}
/**
*
*/
bool test_identity() const;
/**
*
*/
bool is_translation(Coord const eps = 1e-6) const;
/**
*
*/
bool is_scale(Coord const eps = 1e-6) const;
/**
*
*/
bool is_rotation(Coord const eps = 1e-6) const;
/**
*
*/
Matrix inverse() const;
/**
*
*/
inline Coord &operator[](int const i) {
return _c[i];
}
/**
*
*/
inline Coord operator[](int const i) const {
return _c[i];
}
/**
*
*/
void set_identity();
/**
*
*/
Coord det() const;
/**
*
*/
Coord descrim2() const;
/**
*
*/
Coord descrim() const;
private:
NR::Coord _c[6];
};
/** A function to print out the Matrix (for debugging) */
inline std::ostream &operator<< (std::ostream &out_file, const NR::Matrix &m) {
out_file << "A: " << m[0] << " C: " << m[2] << " E: " << m[4] << "\n";
out_file << "B: " << m[1] << " D: " << m[3] << " F: " << m[5] << "\n";
return out_file;
}
} /* namespace NR */
/** \note
* Discussion of splitting up nr-matrix.h into lots of little files:
*
* Advantages:
*
* - Reducing amount of recompilation necessary when anything changes.
*
* - Hopefully also reducing compilation time by reducing the number of inline
* function definitions encountered by the compiler for a given .o file.
* (No timing comparisons done yet. On systems without much memory available
* for caching, this may be outweighed by additional I/O costs.)
*
* Disadvantages:
*
* - More #include lines necessary per file. If a compile fails due to
* not having all the necessary #include lines, then the developer needs
* to spend some time working out what #include to add.
*/
#endif /* !__NR_MATRIX_H__ */
/*
Local Variables:
mode:c++
c-file-style:"stroustrup"
c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
indent-tabs-mode:nil
fill-column:99
End:
*/
// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:encoding=utf-8:textwidth=99 :
|