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
|
/*************************************************************************
*
* 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: bigrange.hxx,v $
* $Revision: 1.5 $
*
* 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 SC_BIGRANGE_HXX
#define SC_BIGRANGE_HXX
#include "global.hxx"
#include "document.hxx"
static const INT32 nInt32Min = 0x80000000;
static const INT32 nInt32Max = 0x7fffffff;
class ScBigAddress
{
INT32 nRow;
INT32 nCol;
INT32 nTab;
public:
ScBigAddress() : nRow(0), nCol(0), nTab(0) {}
ScBigAddress( INT32 nColP, INT32 nRowP, INT32 nTabP )
: nRow( nRowP ), nCol( nColP ), nTab( nTabP ) {}
ScBigAddress( const ScBigAddress& r )
: nRow( r.nRow ), nCol( r.nCol ), nTab( r.nTab ) {}
ScBigAddress( const ScAddress& r )
: nRow( r.Row() ), nCol( r.Col() ), nTab( r.Tab() ) {}
INT32 Col() const { return nCol; }
INT32 Row() const { return nRow; }
INT32 Tab() const { return nTab; }
void Set( INT32 nColP, INT32 nRowP, INT32 nTabP )
{ nCol = nColP; nRow = nRowP; nTab = nTabP; }
void SetCol( INT32 nColP ) { nCol = nColP; }
void SetRow( INT32 nRowP ) { nRow = nRowP; }
void SetTab( INT32 nTabP ) { nTab = nTabP; }
void IncCol( INT32 n = 1 ) { nCol += n; }
void IncRow( INT32 n = 1 ) { nRow += n; }
void IncTab( INT32 n = 1 ) { nTab += n; }
void GetVars( INT32& nColP, INT32& nRowP, INT32& nTabP ) const
{ nColP = nCol; nRowP = nRow; nTabP = nTab; }
inline void PutInOrder( ScBigAddress& r );
inline BOOL IsValid( const ScDocument* ) const;
inline ScAddress MakeAddress() const;
ScBigAddress& operator=( const ScBigAddress& r )
{ nCol = r.nCol; nRow = r.nRow; nTab = r.nTab; return *this; }
ScBigAddress& operator=( const ScAddress& r )
{ nCol = r.Col(); nRow = r.Row(); nTab = r.Tab(); return *this; }
int operator==( const ScBigAddress& r ) const
{ return nCol == r.nCol && nRow == r.nRow && nTab == r.nTab; }
int operator!=( const ScBigAddress& r ) const
{ return !operator==( r ); }
friend inline SvStream& operator<< ( SvStream& rStream, const ScBigAddress& rAdr );
friend inline SvStream& operator>> ( SvStream& rStream, ScBigAddress& rAdr );
};
inline void ScBigAddress::PutInOrder( ScBigAddress& r )
{
INT32 nTmp;
if ( r.nCol < nCol )
{
nTmp = r.nCol;
r.nCol = nCol;
nCol = nTmp;
}
if ( r.nRow < nRow )
{
nTmp = r.nRow;
r.nRow = nRow;
nRow = nTmp;
}
if ( r.nTab < nTab )
{
nTmp = r.nTab;
r.nTab = nTab;
nTab = nTmp;
}
}
inline BOOL ScBigAddress::IsValid( const ScDocument* pDoc ) const
{ //! Min/Max sind ok, kennzeichnen ganze Col/Row/Tab
return
((0 <= nCol && nCol <= MAXCOL)
|| nCol == nInt32Min || nCol == nInt32Max) &&
((0 <= nRow && nRow <= MAXROW)
|| nRow == nInt32Min || nRow == nInt32Max) &&
((0 <= nTab && nTab < pDoc->GetTableCount())
|| nTab == nInt32Min || nTab == nInt32Max)
;
}
inline ScAddress ScBigAddress::MakeAddress() const
{
SCCOL nColA;
SCROW nRowA;
SCTAB nTabA;
if ( nCol < 0 )
nColA = 0;
else if ( nCol > MAXCOL )
nColA = MAXCOL;
else
nColA = (SCCOL) nCol;
if ( nRow < 0 )
nRowA = 0;
else if ( nRow > MAXROW )
nRowA = MAXROW;
else
nRowA = (SCROW) nRow;
if ( nTab < 0 )
nTabA = 0;
else if ( nTab > MAXTAB )
nTabA = MAXTAB;
else
nTabA = (SCTAB) nTab;
return ScAddress( nColA, nRowA, nTabA );
}
inline SvStream& operator<< ( SvStream& rStream, const ScBigAddress& rAdr )
{
rStream << rAdr.nCol << rAdr.nRow << rAdr.nTab;
return rStream;
}
inline SvStream& operator>> ( SvStream& rStream, ScBigAddress& rAdr )
{
rStream >> rAdr.nCol >> rAdr.nRow >> rAdr.nTab;
return rStream;
}
class ScBigRange
{
public:
ScBigAddress aStart;
ScBigAddress aEnd;
ScBigRange() : aStart(), aEnd() {}
ScBigRange( const ScBigAddress& s, const ScBigAddress& e )
: aStart( s ), aEnd( e ) { aStart.PutInOrder( aEnd ); }
ScBigRange( const ScBigRange& r )
: aStart( r.aStart ), aEnd( r.aEnd ) {}
ScBigRange( const ScRange& r )
: aStart( r.aStart ), aEnd( r.aEnd ) {}
ScBigRange( const ScBigAddress& r )
: aStart( r ), aEnd( r ) {}
ScBigRange( const ScAddress& r )
: aStart( r ), aEnd( r ) {}
ScBigRange( INT32 nCol, INT32 nRow, INT32 nTab )
: aStart( nCol, nRow, nTab ), aEnd( aStart ) {}
ScBigRange( INT32 nCol1, INT32 nRow1, INT32 nTab1,
INT32 nCol2, INT32 nRow2, INT32 nTab2 )
: aStart( nCol1, nRow1, nTab1 ),
aEnd( nCol2, nRow2, nTab2 ) {}
void Set( INT32 nCol1, INT32 nRow1, INT32 nTab1,
INT32 nCol2, INT32 nRow2, INT32 nTab2 )
{ aStart.Set( nCol1, nRow1, nTab1 );
aEnd.Set( nCol2, nRow2, nTab2 ); }
void GetVars( INT32& nCol1, INT32& nRow1, INT32& nTab1,
INT32& nCol2, INT32& nRow2, INT32& nTab2 ) const
{ aStart.GetVars( nCol1, nRow1, nTab1 );
aEnd.GetVars( nCol2, nRow2, nTab2 ); }
BOOL IsValid( const ScDocument* pDoc ) const
{ return aStart.IsValid( pDoc ) && aEnd.IsValid( pDoc ); }
inline ScRange MakeRange() const
{ return ScRange( aStart.MakeAddress(),
aEnd.MakeAddress() ); }
inline BOOL In( const ScBigAddress& ) const; // ist Address& in Range?
inline BOOL In( const ScBigRange& ) const; // ist Range& in Range?
inline BOOL Intersects( const ScBigRange& ) const; // ueberschneiden sich zwei Ranges?
ScBigRange& operator=( const ScBigRange& r )
{ aStart = r.aStart; aEnd = r.aEnd; return *this; }
int operator==( const ScBigRange& r ) const
{ return (aStart == r.aStart) && (aEnd == r.aEnd); }
int operator!=( const ScBigRange& r ) const
{ return !operator==( r ); }
friend inline SvStream& operator<< ( SvStream& rStream, const ScBigRange& rRange );
friend inline SvStream& operator>> ( SvStream& rStream, ScBigRange& rRange );
};
inline BOOL ScBigRange::In( const ScBigAddress& rAddr ) const
{
return
aStart.Col() <= rAddr.Col() && rAddr.Col() <= aEnd.Col() &&
aStart.Row() <= rAddr.Row() && rAddr.Row() <= aEnd.Row() &&
aStart.Tab() <= rAddr.Tab() && rAddr.Tab() <= aEnd.Tab();
}
inline BOOL ScBigRange::In( const ScBigRange& r ) const
{
return
aStart.Col() <= r.aStart.Col() && r.aEnd.Col() <= aEnd.Col() &&
aStart.Row() <= r.aStart.Row() && r.aEnd.Row() <= aEnd.Row() &&
aStart.Tab() <= r.aStart.Tab() && r.aEnd.Tab() <= aEnd.Tab();
}
inline BOOL ScBigRange::Intersects( const ScBigRange& r ) const
{
return !(
Min( aEnd.Col(), r.aEnd.Col() ) < Max( aStart.Col(), r.aStart.Col() )
|| Min( aEnd.Row(), r.aEnd.Row() ) < Max( aStart.Row(), r.aStart.Row() )
|| Min( aEnd.Tab(), r.aEnd.Tab() ) < Max( aStart.Tab(), r.aStart.Tab() )
);
}
inline SvStream& operator<< ( SvStream& rStream, const ScBigRange& rRange )
{
rStream << rRange.aStart;
rStream << rRange.aEnd;
return rStream;
}
inline SvStream& operator>> ( SvStream& rStream, ScBigRange& rRange )
{
rStream >> rRange.aStart;
rStream >> rRange.aEnd;
return rStream;
}
#endif
|
