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
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifndef _BGFX_TUPLE_B2I64TUPLE_HXX
#define _BGFX_TUPLE_B2I64TUPLE_HXX
#include <sal/types.h>
#include <basegfx/tuple/b2dtuple.hxx>
#include <basegfx/basegfxdllapi.h>
namespace basegfx
{
/** Base class for all Points/Vectors with two sal_Int64 values
This class provides all methods common to Point
avd Vector classes which are derived from here.
@derive Use this class to implement Points or Vectors
which are based on two sal_Int64 values
*/
class BASEGFX_DLLPUBLIC B2I64Tuple
{
protected:
sal_Int64 mnX;
sal_Int64 mnY;
public:
/** Create a 2D Tuple
The tuple is initialized to (0, 0)
*/
B2I64Tuple()
: mnX(0),
mnY(0)
{}
/** Create a 2D Tuple
@param fX
This parameter is used to initialize the X-coordinate
of the 2D Tuple.
@param fY
This parameter is used to initialize the Y-coordinate
of the 2D Tuple.
*/
B2I64Tuple(sal_Int64 fX, sal_Int64 fY)
: mnX( fX ),
mnY( fY )
{}
/** Create a copy of a 2D Tuple
@param rTup
The 2D Tuple which will be copied.
*/
B2I64Tuple(const B2I64Tuple& rTup)
: mnX( rTup.mnX ),
mnY( rTup.mnY )
{}
~B2I64Tuple()
{}
/// Get X-Coordinate of 2D Tuple
sal_Int64 getX() const
{
return mnX;
}
/// Get Y-Coordinate of 2D Tuple
sal_Int64 getY() const
{
return mnY;
}
/// Set X-Coordinate of 2D Tuple
void setX(sal_Int64 fX)
{
mnX = fX;
}
/// Set Y-Coordinate of 2D Tuple
void setY(sal_Int64 fY)
{
mnY = fY;
}
/// Array-access to 2D Tuple
const sal_Int64& operator[] (int nPos) const
{
// Here, normally one if(...) should be used. In the assumption that
// both sal_Int64 members can be accessed as an array a shortcut is used here.
// if(0 == nPos) return mnX; return mnY;
return *((&mnX) + nPos);
}
/// Array-access to 2D Tuple
sal_Int64& operator[] (int nPos)
{
// Here, normally one if(...) should be used. In the assumption that
// both sal_Int64 members can be accessed as an array a shortcut is used here.
// if(0 == nPos) return mnX; return mnY;
return *((&mnX) + nPos);
}
// operators
//////////////////////////////////////////////////////////////////////
B2I64Tuple& operator+=( const B2I64Tuple& rTup )
{
mnX += rTup.mnX;
mnY += rTup.mnY;
return *this;
}
B2I64Tuple& operator-=( const B2I64Tuple& rTup )
{
mnX -= rTup.mnX;
mnY -= rTup.mnY;
return *this;
}
B2I64Tuple& operator/=( const B2I64Tuple& rTup )
{
mnX /= rTup.mnX;
mnY /= rTup.mnY;
return *this;
}
B2I64Tuple& operator*=( const B2I64Tuple& rTup )
{
mnX *= rTup.mnX;
mnY *= rTup.mnY;
return *this;
}
B2I64Tuple& operator*=(sal_Int64 t)
{
mnX *= t;
mnY *= t;
return *this;
}
B2I64Tuple& operator/=(sal_Int64 t)
{
mnX /= t;
mnY /= t;
return *this;
}
B2I64Tuple operator-(void) const
{
return B2I64Tuple(-mnX, -mnY);
}
bool equalZero() const { return mnX == 0 && mnY == 0; }
bool operator==( const B2I64Tuple& rTup ) const
{
return this == &rTup || (rTup.mnX == mnX && rTup.mnY == mnY);
}
bool operator!=( const B2I64Tuple& rTup ) const
{
return !(*this == rTup);
}
B2I64Tuple& operator=( const B2I64Tuple& rTup )
{
mnX = rTup.mnX;
mnY = rTup.mnY;
return *this;
}
};
// external operators
//////////////////////////////////////////////////////////////////////////
inline B2I64Tuple minimum(const B2I64Tuple& rTupA, const B2I64Tuple& rTupB)
{
B2I64Tuple aMin(
(rTupB.getX() < rTupA.getX()) ? rTupB.getX() : rTupA.getX(),
(rTupB.getY() < rTupA.getY()) ? rTupB.getY() : rTupA.getY());
return aMin;
}
inline B2I64Tuple maximum(const B2I64Tuple& rTupA, const B2I64Tuple& rTupB)
{
B2I64Tuple aMax(
(rTupB.getX() > rTupA.getX()) ? rTupB.getX() : rTupA.getX(),
(rTupB.getY() > rTupA.getY()) ? rTupB.getY() : rTupA.getY());
return aMax;
}
inline B2I64Tuple absolute(const B2I64Tuple& rTup)
{
B2I64Tuple aAbs(
(0 > rTup.getX()) ? -rTup.getX() : rTup.getX(),
(0 > rTup.getY()) ? -rTup.getY() : rTup.getY());
return aAbs;
}
inline B2DTuple interpolate(const B2I64Tuple& rOld1, const B2I64Tuple& rOld2, double t)
{
B2DTuple aInt(
((rOld2.getX() - rOld1.getX()) * t) + rOld1.getX(),
((rOld2.getY() - rOld1.getY()) * t) + rOld1.getY());
return aInt;
}
inline B2DTuple average(const B2I64Tuple& rOld1, const B2I64Tuple& rOld2)
{
B2DTuple aAvg(
(rOld1.getX() + rOld2.getX()) * 0.5,
(rOld1.getY() + rOld2.getY()) * 0.5);
return aAvg;
}
inline B2DTuple average(const B2I64Tuple& rOld1, const B2I64Tuple& rOld2, const B2I64Tuple& rOld3)
{
B2DTuple aAvg(
(rOld1.getX() + rOld2.getX() + rOld3.getX()) * (1.0 / 3.0),
(rOld1.getY() + rOld2.getY() + rOld3.getY()) * (1.0 / 3.0));
return aAvg;
}
inline B2I64Tuple operator+(const B2I64Tuple& rTupA, const B2I64Tuple& rTupB)
{
B2I64Tuple aSum(rTupA);
aSum += rTupB;
return aSum;
}
inline B2I64Tuple operator-(const B2I64Tuple& rTupA, const B2I64Tuple& rTupB)
{
B2I64Tuple aSub(rTupA);
aSub -= rTupB;
return aSub;
}
inline B2I64Tuple operator/(const B2I64Tuple& rTupA, const B2I64Tuple& rTupB)
{
B2I64Tuple aDiv(rTupA);
aDiv /= rTupB;
return aDiv;
}
inline B2I64Tuple operator*(const B2I64Tuple& rTupA, const B2I64Tuple& rTupB)
{
B2I64Tuple aMul(rTupA);
aMul *= rTupB;
return aMul;
}
inline B2I64Tuple operator*(const B2I64Tuple& rTup, sal_Int64 t)
{
B2I64Tuple aNew(rTup);
aNew *= t;
return aNew;
}
inline B2I64Tuple operator*(sal_Int64 t, const B2I64Tuple& rTup)
{
B2I64Tuple aNew(rTup);
aNew *= t;
return aNew;
}
inline B2I64Tuple operator/(const B2I64Tuple& rTup, sal_Int64 t)
{
B2I64Tuple aNew(rTup);
aNew /= t;
return aNew;
}
inline B2I64Tuple operator/(sal_Int64 t, const B2I64Tuple& rTup)
{
B2I64Tuple aNew(t, t);
B2I64Tuple aTmp(rTup);
aNew /= aTmp;
return aNew;
}
} // end of namespace basegfx
#endif /* _BGFX_TUPLE_B2I64TUPLE_HXX */
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|