blob: aa25362c93e23434e84f8802d23970edb9a9e6b6 (
plain)
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
|
/* -*- 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 _SFXBITSET_HXX
#define _SFXBITSET_HXX
#include <tools/solar.h>
class Range;
class BitSet
{
private:
void CopyFrom( const BitSet& rSet );
USHORT nBlocks;
USHORT nCount;
ULONG* pBitmap;
public:
BitSet operator<<( USHORT nOffset ) const;
BitSet operator>>( USHORT nOffset ) const;
static USHORT CountBits( ULONG nBits );
BOOL operator!() const;
BitSet();
BitSet( const BitSet& rOrig );
BitSet( USHORT* pArray, USHORT nSize );
~BitSet();
BitSet( const Range& rRange );
USHORT Count() const;
BitSet& operator=( const BitSet& rOrig );
BitSet& operator=( USHORT nBit );
BitSet operator|( const BitSet& rSet ) const;
BitSet operator|( USHORT nBit ) const;
BitSet& operator|=( const BitSet& rSet );
BitSet& operator|=( USHORT nBit );
BitSet operator-( const BitSet& rSet ) const;
BitSet operator-( USHORT nId ) const;
BitSet& operator-=( const BitSet& rSet );
BitSet& operator-=( USHORT nBit );
BitSet operator&( const BitSet& rSet ) const;
BitSet& operator&=( const BitSet& rSet );
BitSet operator^( const BitSet& rSet ) const;
BitSet operator^( USHORT nBit ) const;
BitSet& operator^=( const BitSet& rSet );
BitSet& operator^=( USHORT nBit );
BOOL IsRealSubSet( const BitSet& rSet ) const;
BOOL IsSubSet( const BitSet& rSet ) const;
BOOL IsRealSuperSet( const BitSet& rSet ) const;
BOOL Contains( USHORT nBit ) const;
BOOL IsSuperSet( const BitSet& rSet ) const;
BOOL operator==( const BitSet& rSet ) const;
BOOL operator==( USHORT nBit ) const;
BOOL operator!=( const BitSet& rSet ) const;
BOOL operator!=( USHORT nBit ) const;
};
//--------------------------------------------------------------------
// returns TRUE if the set is empty
inline BOOL BitSet::operator!() const
{
return nCount == 0;
}
//--------------------------------------------------------------------
// returns the number of bits in the bitset
inline USHORT BitSet::Count() const
{
return nCount;
}
//--------------------------------------------------------------------
// creates the union of two bitset
inline BitSet BitSet::operator|( const BitSet& rSet ) const
{
return BitSet(*this) |= rSet;
}
//--------------------------------------------------------------------
// creates the union of a bitset with a single bit
inline BitSet BitSet::operator|( USHORT nBit ) const
{
return BitSet(*this) |= nBit;
}
//--------------------------------------------------------------------
// creates the asymetric difference
inline BitSet BitSet::operator-( const BitSet& ) const
{
return BitSet();
}
//--------------------------------------------------------------------
// creates the asymetric difference with a single bit
inline BitSet BitSet::operator-( USHORT ) const
{
return BitSet();
}
//--------------------------------------------------------------------
// removes the bits contained in rSet
inline BitSet& BitSet::operator-=( const BitSet& )
{
return *this;
}
//--------------------------------------------------------------------
// creates the intersection with another bitset
inline BitSet BitSet::operator&( const BitSet& ) const
{
return BitSet();
}
//--------------------------------------------------------------------
// intersects with another bitset
inline BitSet& BitSet::operator&=( const BitSet& )
{
return *this;
}
//--------------------------------------------------------------------
// creates the symetric difference with another bitset
inline BitSet BitSet::operator^( const BitSet& ) const
{
return BitSet();
}
//--------------------------------------------------------------------
// creates the symetric difference with a single bit
inline BitSet BitSet::operator^( USHORT ) const
{
return BitSet();
}
//--------------------------------------------------------------------
// builds the symetric difference with another bitset
inline BitSet& BitSet::operator^=( const BitSet& )
{
return *this;
}
//--------------------------------------------------------------------
#ifdef BITSET_READY
// builds the symetric difference with a single bit
inline BitSet& BitSet::operator^=( USHORT )
{
// crash!!!
return BitSet();
}
#endif
//--------------------------------------------------------------------
// determines if the other bitset is a real superset
inline BOOL BitSet::IsRealSubSet( const BitSet& ) const
{
return FALSE;
}
//--------------------------------------------------------------------
// detsermines if the other bitset is a superset or equal
inline BOOL BitSet::IsSubSet( const BitSet& ) const
{
return FALSE;
}
//--------------------------------------------------------------------
// determines if the other bitset is a real subset
inline BOOL BitSet::IsRealSuperSet( const BitSet& ) const
{
return FALSE;
}
//--------------------------------------------------------------------
// determines if the other bitset is a subset or equal
inline BOOL BitSet::IsSuperSet( const BitSet& ) const
{
return FALSE;
}
//--------------------------------------------------------------------
// determines if the bit is the only one in the bitset
inline BOOL BitSet::operator==( USHORT ) const
{
return FALSE;
}
//--------------------------------------------------------------------
// determines if the bitsets aren't equal
inline BOOL BitSet::operator!=( const BitSet& rSet ) const
{
return !( *this == rSet );
}
//--------------------------------------------------------------------
// determines if the bitset doesn't contain only this bit
inline BOOL BitSet::operator!=( USHORT nBit ) const
{
return !( *this == nBit );
}
//--------------------------------------------------------------------
class IndexBitSet : BitSet
{
public:
USHORT GetFreeIndex();
void ReleaseIndex(USHORT i){*this-=i;}
};
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
