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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: basicrange.hxx,v $
* $Revision: 1.14 $
*
* 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_RANGE_BASICRANGE_HXX
#define _BGFX_RANGE_BASICRANGE_HXX
#include <sal/types.h>
#ifndef _INC_FLOAT
#include <float.h>
#endif
#include <basegfx/numeric/ftools.hxx>
namespace basegfx
{
template< typename T, typename Traits > class BasicRange
{
protected:
T mnMinimum;
T mnMaximum;
public:
typedef T ValueType;
typedef Traits TraitsType;
BasicRange() :
mnMinimum(Traits::initMin()),
mnMaximum(Traits::initMax())
{
}
BasicRange( T nValue ) :
mnMinimum(nValue),
mnMaximum(nValue)
{
}
BasicRange(const BasicRange& rRange) :
mnMinimum(rRange.mnMinimum),
mnMaximum(rRange.mnMaximum)
{
}
void reset()
{
mnMinimum = Traits::initMin();
mnMaximum = Traits::initMax();
}
bool isEmpty() const
{
return Traits::initMin() == mnMinimum;
}
T getMinimum() const { return mnMinimum; }
T getMaximum() const { return mnMaximum; }
double getCenter() const
{
if(isEmpty())
{
return 0.0;
}
else
{
return ((mnMaximum + mnMinimum) / 2.0);
}
}
bool isInside(T nValue) const
{
if(isEmpty())
{
return false;
}
else
{
return (nValue >= mnMinimum) && (nValue <= mnMaximum);
}
}
bool isInside(const BasicRange& rRange) const
{
if(isEmpty())
{
return false;
}
else
{
if(rRange.isEmpty())
{
return false;
}
else
{
return (rRange.mnMinimum >= mnMinimum) && (rRange.mnMaximum <= mnMaximum);
}
}
}
bool overlaps(const BasicRange& rRange) const
{
if(isEmpty())
{
return false;
}
else
{
if(rRange.isEmpty())
{
return false;
}
else
{
return !((rRange.mnMaximum < mnMinimum) || (rRange.mnMinimum > mnMaximum));
}
}
}
bool operator==( const BasicRange& rRange ) const
{
return (mnMinimum == rRange.mnMinimum && mnMaximum == rRange.mnMaximum);
}
bool operator!=( const BasicRange& rRange ) const
{
return (mnMinimum != rRange.mnMinimum || mnMaximum != rRange.mnMaximum);
}
void operator=(const BasicRange& rRange)
{
mnMinimum = rRange.mnMinimum;
mnMaximum = rRange.mnMaximum;
}
bool equal(const BasicRange& rRange) const
{
return (
fTools::equal(mnMinimum, rRange.mnMinimum) &&
fTools::equal(mnMaximum, rRange.mnMaximum));
}
void expand(T nValue)
{
if(isEmpty())
{
mnMinimum = mnMaximum = nValue;
}
else
{
if(nValue < mnMinimum)
{
mnMinimum = nValue;
}
if(nValue > mnMaximum)
{
mnMaximum = nValue;
}
}
}
void expand(const BasicRange& rRange)
{
if(isEmpty())
{
mnMinimum = rRange.mnMinimum;
mnMaximum = rRange.mnMaximum;
}
else
{
if(!rRange.isEmpty())
{
if(rRange.mnMinimum < mnMinimum)
{
mnMinimum = rRange.mnMinimum;
}
if(rRange.mnMaximum > mnMaximum)
{
mnMaximum = rRange.mnMaximum;
}
}
}
}
void intersect(const BasicRange& rRange)
{
// here, overlaps also tests all isEmpty() conditions already.
if( !overlaps( rRange ) )
{
reset();
}
else
{
if(rRange.mnMinimum > mnMinimum)
{
mnMinimum = rRange.mnMinimum;
}
if(rRange.mnMaximum < mnMaximum)
{
mnMaximum = rRange.mnMaximum;
}
}
}
void grow(T nValue)
{
if(!isEmpty())
{
bool bLessThanZero(nValue < 0);
if(nValue > 0 || bLessThanZero)
{
mnMinimum -= nValue;
mnMaximum += nValue;
if(bLessThanZero)
{
// test if range did collapse
if(mnMinimum > mnMaximum)
{
// if yes, collapse to center
mnMinimum = mnMaximum = (mnMinimum + mnMaximum) / 2;
}
}
}
}
}
typename Traits::DifferenceType getRange() const
{
if(isEmpty())
{
return Traits::neutral();
}
else
{
return (mnMaximum - mnMinimum);
}
}
};
// some pre-fabricated traits
struct DoubleTraits
{
static double initMin() { return DBL_MAX; };
static double initMax() { return DBL_MIN; };
static double neutral() { return 0.0; };
typedef double DifferenceType;
};
struct Int32Traits
{
static sal_Int32 initMin() { return 0x7FFFFFFFL; };
static sal_Int32 initMax() { return 0x80000000UL; };
static sal_Int32 neutral() { return 0L; };
typedef sal_Int64 DifferenceType;
};
} // end of namespace basegfx
#endif /* _BGFX_RANGE_BASICRANGE_HXX */
|
