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
|
/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: index.hxx,v $
*
* $Revision: 1.5 $
*
* last change: $Author: rt $ $Date: 2005-09-09 01:58:34 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 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
*
************************************************************************/
#ifndef _INDEX_HXX
#define _INDEX_HXX
#include <limits.h>
#ifndef _SOLAR_H
#include <tools/solar.h>
#endif
#ifndef _RTTI_HXX
#include <tools/rtti.hxx> // for RTTI of SwIndexReg
#endif
#ifndef _STRING_HXX
#include <tools/string.hxx> // for xub_StrLen
#endif
#define INVALID_INDEX STRING_NOTFOUND
// Maximale Anzahl von Indizies im IndexArray (zum Abtesten auf Ueberlaeufe)
class SwIndex;
class SwIndexReg;
#ifdef PRODUCT
#define INLINE inline
#else
#define INLINE
#endif
class SwIndex
{
friend class SwIndexReg;
#ifndef PRODUCT
static int nSerial;
int MySerial;
#endif
xub_StrLen nIndex;
SwIndexReg* pArray;
SwIndex *pNext, *pPrev;
SwIndex& ChgValue( const SwIndex& rIdx, xub_StrLen nNewValue );
void Remove(); // Ausketten
public:
SwIndex( SwIndexReg * pReg, xub_StrLen nIdx = 0 );
SwIndex( const SwIndex & );
SwIndex( const SwIndex &, short nDiff );
~SwIndex() { Remove(); }
INLINE xub_StrLen operator++();
INLINE xub_StrLen operator--();
#ifndef CFRONT
INLINE xub_StrLen operator++(int);
INLINE xub_StrLen operator--(int);
#endif
INLINE xub_StrLen operator+=( xub_StrLen );
INLINE xub_StrLen operator-=( xub_StrLen );
INLINE xub_StrLen operator+=( const SwIndex& );
INLINE xub_StrLen operator-=( const SwIndex& );
INLINE BOOL operator<( const SwIndex& ) const;
INLINE BOOL operator<=( const SwIndex& ) const;
INLINE BOOL operator>( const SwIndex& ) const;
INLINE BOOL operator>=( const SwIndex& ) const;
BOOL operator==( const SwIndex& rSwIndex ) const
{ return (nIndex == rSwIndex.nIndex) && (pArray == rSwIndex.pArray); }
BOOL operator!=( const SwIndex& rSwIndex ) const
{ return (nIndex != rSwIndex.nIndex) || (pArray != rSwIndex.pArray); }
BOOL operator<( xub_StrLen nWert ) const { return nIndex < nWert; }
BOOL operator<=( xub_StrLen nWert ) const { return nIndex <= nWert; }
BOOL operator>( xub_StrLen nWert ) const { return nIndex > nWert; }
BOOL operator>=( xub_StrLen nWert ) const { return nIndex >= nWert; }
BOOL operator==( xub_StrLen nWert ) const { return nIndex == nWert; }
BOOL operator!=( xub_StrLen nWert ) const { return nIndex != nWert; }
INLINE SwIndex& operator=( xub_StrLen );
SwIndex& operator=( const SwIndex & );
// gebe den Wert vom Index als xub_StrLen zurueck
xub_StrLen GetIndex() const { return nIndex; }
// ermoeglicht Zuweisungen ohne Erzeugen eines temporaeren
// Objektes
SwIndex &Assign(SwIndexReg *,xub_StrLen);
// Herausgabe des Pointers auf das IndexArray,
// (fuers RTTI am SwIndexReg)
const SwIndexReg* GetIdxReg() const { return pArray; }
};
#undef INLINE
class SwIndexReg
{
friend class SwIndex;
const SwIndex *pFirst, *pLast, *pMiddle;
// ein globales Array, in das Indizies verschoben werden, die mal
// temporaer "ausgelagert" werden muessen; oder die zum Zeitpunkt des
// anlegens kein gueltiges Array kennen (SwPaM/SwPosition!)
friend void _InitCore();
friend void _FinitCore();
static SwIndexReg* pEmptyIndexArray;
protected:
virtual void Update( const SwIndex & aPos, xub_StrLen nLen,
BOOL bNegativ = FALSE, BOOL bDelete = FALSE );
void ChkArr();
BOOL HasAnyIndex() const { return 0 != pFirst; }
public:
SwIndexReg();
#ifndef PRODUCT
~SwIndexReg();
#endif
// rtti, abgeleitete moegens gleichtun oder nicht. Wenn sie es gleichtun
// kann ueber das SwIndexReg typsicher gecastet werden.
TYPEINFO();
void SetDefMiddle( const SwIndex* pIdx ) { pMiddle = pIdx; }
void MoveTo( SwIndexReg& rArr );
};
#ifdef PRODUCT
inline xub_StrLen SwIndex::operator++()
{
return ChgValue( *this, nIndex+1 ).nIndex;
}
inline xub_StrLen SwIndex::operator--()
{
return ChgValue( *this, nIndex-1 ).nIndex;
}
#ifndef CFRONT
inline xub_StrLen SwIndex::operator++(int)
{
xub_StrLen nOldIndex = nIndex;
ChgValue( *this, nIndex+1 );
return nOldIndex;
}
inline xub_StrLen SwIndex::operator--(int)
{
xub_StrLen nOldIndex = nIndex;
ChgValue( *this, nIndex-1 );
return nOldIndex;
}
#endif
inline xub_StrLen SwIndex::operator+=( xub_StrLen nWert )
{
return ChgValue( *this, nIndex + nWert ).nIndex;
}
inline xub_StrLen SwIndex::operator-=( xub_StrLen nWert )
{
return ChgValue( *this, nIndex - nWert ).nIndex;
}
inline xub_StrLen SwIndex::operator+=( const SwIndex& rIndex )
{
return ChgValue( *this, nIndex + rIndex.nIndex ).nIndex;
}
inline xub_StrLen SwIndex::operator-=( const SwIndex& rIndex )
{
return ChgValue( *this, nIndex - rIndex.nIndex ).nIndex;
}
inline BOOL SwIndex::operator<( const SwIndex& rIndex ) const
{
return nIndex < rIndex.nIndex;
}
inline BOOL SwIndex::operator<=( const SwIndex& rIndex ) const
{
return nIndex <= rIndex.nIndex;
}
inline BOOL SwIndex::operator>( const SwIndex& rIndex ) const
{
return nIndex > rIndex.nIndex;
}
inline BOOL SwIndex::operator>=( const SwIndex& rIndex ) const
{
return nIndex >= rIndex.nIndex;
}
inline SwIndex& SwIndex::operator=( xub_StrLen nWert )
{
if( nIndex != nWert )
ChgValue( *this, nWert );
return *this;
}
// PRODUCT
#endif
#endif
|
