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
|
/*************************************************************************
*
* $RCSfile: b2ituple.hxx,v $
*
* $Revision: 1.4 $
*
* last change: $Author: hjs $ $Date: 2004-06-25 17:16:41 $
*
* The Contents of this file are made available subject to the terms of
* either of the following licenses
*
* - GNU Lesser General Public License Version 2.1
* - Sun Industry Standards Source License Version 1.1
*
* Sun Microsystems Inc., October, 2000
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2000 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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 for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
*
* Sun Industry Standards Source License Version 1.1
* =================================================
* The contents of this file are subject to the Sun Industry Standards
* Source License Version 1.1 (the "License"); You may not use this file
* except in compliance with the License. You may obtain a copy of the
* License at http://www.openoffice.org/license.html.
*
* Software provided under this License is provided on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
* See the License for the specific provisions governing your rights and
* obligations concerning the Software.
*
* The Initial Developer of the Original Code is: Sun Microsystems, Inc.
*
* Copyright: 2000 by Sun Microsystems, Inc.
*
* All Rights Reserved.
*
* Contributor(s): _______________________________________
*
*
************************************************************************/
#ifndef _BGFX_TUPLE_B2ITUPLE_HXX
#define _BGFX_TUPLE_B2ITUPLE_HXX
#ifndef _SAL_TYPES_H_
#include <sal/types.h>
#endif
namespace basegfx
{
/** Base class for all Points/Vectors with two sal_Int32 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_Int32 values
*/
class B2ITuple
{
protected:
sal_Int32 mnX;
sal_Int32 mnY;
public:
/** Create a 2D Tuple
The tuple is initialized to (0, 0)
*/
B2ITuple()
: 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.
*/
B2ITuple(sal_Int32 fX, sal_Int32 fY)
: mnX( fX ),
mnY( fY )
{}
/** Create a copy of a 2D Tuple
@param rTup
The 2D Tuple which will be copied.
*/
B2ITuple(const B2ITuple& rTup)
: mnX( rTup.mnX ),
mnY( rTup.mnY )
{}
~B2ITuple()
{}
/// Get X-Coordinate of 2D Tuple
sal_Int32 getX() const
{
return mnX;
}
/// Get Y-Coordinate of 2D Tuple
sal_Int32 getY() const
{
return mnY;
}
/// Set X-Coordinate of 2D Tuple
void setX(sal_Int32 fX)
{
mnX = fX;
}
/// Set Y-Coordinate of 2D Tuple
void setY(sal_Int32 fY)
{
mnY = fY;
}
/// Array-access to 2D Tuple
const sal_Int32& operator[] (int nPos) const
{
// Here, normally one if(...) should be used. In the assumption that
// both sal_Int32 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_Int32& operator[] (int nPos)
{
// Here, normally one if(...) should be used. In the assumption that
// both sal_Int32 members can be accessed as an array a shortcut is used here.
// if(0 == nPos) return mnX; return mnY;
return *((&mnX) + nPos);
}
// operators
//////////////////////////////////////////////////////////////////////
B2ITuple& operator+=( const B2ITuple& rTup )
{
mnX += rTup.mnX;
mnY += rTup.mnY;
return *this;
}
B2ITuple& operator-=( const B2ITuple& rTup )
{
mnX -= rTup.mnX;
mnY -= rTup.mnY;
return *this;
}
B2ITuple& operator/=( const B2ITuple& rTup )
{
mnX /= rTup.mnX;
mnY /= rTup.mnY;
return *this;
}
B2ITuple& operator*=( const B2ITuple& rTup )
{
mnX *= rTup.mnX;
mnY *= rTup.mnY;
return *this;
}
B2ITuple& operator*=(sal_Int32 t)
{
mnX *= t;
mnY *= t;
return *this;
}
B2ITuple& operator/=(sal_Int32 t)
{
mnX /= t;
mnY /= t;
return *this;
}
B2ITuple operator-(void) const
{
return B2ITuple(-mnX, -mnY);
}
bool equalZero() const { return mnX == 0 && mnY == 0; }
bool operator==( const B2ITuple& rTup ) const
{
return rTup.mnX == mnX && rTup.mnY == mnY;
}
bool operator!=( const B2ITuple& rTup ) const
{
return !(*this == rTup);
}
B2ITuple& operator=( const B2ITuple& rTup )
{
mnX = rTup.mnX;
mnY = rTup.mnY;
return *this;
}
static const B2ITuple& getEmptyTuple();
};
// external operators
//////////////////////////////////////////////////////////////////////////
class B2DTuple;
B2ITuple minimum(const B2ITuple& rTupA, const B2ITuple& rTupB);
B2ITuple maximum(const B2ITuple& rTupA, const B2ITuple& rTupB);
B2ITuple absolute(const B2ITuple& rTup);
B2DTuple interpolate(const B2ITuple& rOld1, const B2ITuple& rOld2, double t);
B2DTuple average(const B2ITuple& rOld1, const B2ITuple& rOld2);
B2DTuple average(const B2ITuple& rOld1, const B2ITuple& rOld2, const B2ITuple& rOld3);
B2ITuple operator+(const B2ITuple& rTupA, const B2ITuple& rTupB);
B2ITuple operator-(const B2ITuple& rTupA, const B2ITuple& rTupB);
B2ITuple operator/(const B2ITuple& rTupA, const B2ITuple& rTupB);
B2ITuple operator*(const B2ITuple& rTupA, const B2ITuple& rTupB);
B2ITuple operator*(const B2ITuple& rTup, sal_Int32 t);
B2ITuple operator*(sal_Int32 t, const B2ITuple& rTup);
B2ITuple operator/(const B2ITuple& rTup, sal_Int32 t);
B2ITuple operator/(sal_Int32 t, const B2ITuple& rTup);
} // end of namespace basegfx
#endif /* _BGFX_TUPLE_B2ITUPLE_HXX */
|
