blob: fdc17e14bb40de6b42695f08d8bb11b52b7139f2 (
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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0 .
*/
#ifndef INCLUDED_SFX2_INC_BITSET_HXX
#define INCLUDED_SFX2_INC_BITSET_HXX
class BitSet
{
private:
void CopyFrom( const BitSet& rSet );
sal_uInt16 nBlocks;
sal_uInt16 nCount;
sal_uIntPtr* pBitmap;
public:
BitSet operator<<( sal_uInt16 nOffset ) const;
BitSet operator>>( sal_uInt16 nOffset ) const;
static sal_uInt16 CountBits( sal_uIntPtr nBits );
bool operator!() const;
BitSet();
BitSet( const BitSet& rOrig );
~BitSet();
sal_uInt16 Count() const;
BitSet& operator=( const BitSet& rOrig );
BitSet& operator=( sal_uInt16 nBit );
BitSet operator|( const BitSet& rSet ) const;
BitSet operator|( sal_uInt16 nBit ) const;
BitSet& operator|=( const BitSet& rSet );
BitSet& operator|=( sal_uInt16 nBit );
BitSet operator-( const BitSet& rSet ) const;
BitSet operator-( sal_uInt16 nId ) const;
BitSet& operator-=( const BitSet& rSet );
BitSet& operator-=( sal_uInt16 nBit );
BitSet operator&( const BitSet& rSet ) const;
BitSet& operator&=( const BitSet& rSet );
BitSet operator^( const BitSet& rSet ) const;
BitSet operator^( sal_uInt16 nBit ) const;
BitSet& operator^=( const BitSet& rSet );
BitSet& operator^=( sal_uInt16 nBit );
bool IsRealSubSet( const BitSet& rSet ) const;
bool IsSubSet( const BitSet& rSet ) const;
bool IsRealSuperSet( const BitSet& rSet ) const;
bool Contains( sal_uInt16 nBit ) const;
bool IsSuperSet( const BitSet& rSet ) const;
bool operator==( const BitSet& rSet ) const;
bool operator==( sal_uInt16 nBit ) const;
bool operator!=( const BitSet& rSet ) const;
bool operator!=( sal_uInt16 nBit ) const;
};
// returns sal_True if the set is empty
inline bool BitSet::operator!() const
{
return nCount == 0;
}
// returns the number of bits in the bitset
inline sal_uInt16 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|( sal_uInt16 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-( sal_uInt16 ) 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^( sal_uInt16 ) 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^=( sal_uInt16 )
{
// crash!!!
return BitSet();
}
#endif
// determines if the other bitset is a real superset
inline bool BitSet::IsRealSubSet( const BitSet& ) const
{
return false;
}
// determines 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==( sal_uInt16 ) 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!=( sal_uInt16 nBit ) const
{
return !( *this == nBit );
}
class IndexBitSet : BitSet
{
public:
sal_uInt16 GetFreeIndex();
void ReleaseIndex(sal_uInt16 i){*this-=i;}
};
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
