Bit-set. More...
#include <extensional.hh>
Public Member Functions | |
BitSet (Space &home, unsigned int n) | |
Initialize bit set for a number of words n. More... | |
template<class OldIndexType > | |
BitSet (Space &home, const BitSet< OldIndexType > &bs) | |
Initialize during cloning. More... | |
BitSet (Space &home, const TinyBitSet< 1U > &tbs) | |
Initialize during cloning (unused) More... | |
BitSet (Space &home, const TinyBitSet< 2U > &tbs) | |
Initialize during cloning (unused) More... | |
BitSet (Space &home, const TinyBitSet< 3U > &tbs) | |
Initialize during cloning (unused) More... | |
BitSet (Space &home, const TinyBitSet< 4U > &tbs) | |
Initialize during cloning (unused) More... | |
unsigned int | limit (void) const |
Get the limit. More... | |
bool | empty (void) const |
Check whether the set is empty. More... | |
unsigned int | width (void) const |
Return the highest active index. More... | |
void | clear_mask (BitSetData *mask) const |
Clear the first limit words in mask. More... | |
void | add_to_mask (const BitSetData *b, BitSetData *mask) const |
Add to mask. More... | |
template<bool sparse> | |
void | intersect_with_mask (const BitSetData *mask) |
Intersect with mask, sparse mask if sparse is true. More... | |
void | intersect_with_masks (const BitSetData *a, const BitSetData *b) |
Intersect with the "or" of and b. More... | |
bool | intersects (const BitSetData *b) const |
Check if has a non-empty intersection with the set. More... | |
void | nand_with_mask (const BitSetData *b) |
Perform "nand" with b. More... | |
unsigned int | words (void) const |
Return the number of required bit set words. More... | |
unsigned int | size (void) const |
Return the number of required bit set words. More... | |
Protected Member Functions | |
void | replace_and_decrease (IndexType i, BitSetData w) |
Replace the i th word with w, decrease limit if w is zero. More... | |
Protected Attributes | |
IndexType | _limit |
Limit. More... | |
IndexType * | index |
Indices. More... | |
BitSetData * | bits |
Words. More... | |
Bit-set.
Definition at line 240 of file extensional.hh.
|
inline |
Initialize bit set for a number of words n.
Definition at line 46 of file bit-set.hpp.
|
inline |
Initialize during cloning.
Definition at line 60 of file bit-set.hpp.
|
inline |
Initialize during cloning (unused)
Definition at line 74 of file bit-set.hpp.
|
inline |
Initialize during cloning (unused)
Definition at line 79 of file bit-set.hpp.
|
inline |
Initialize during cloning (unused)
Definition at line 84 of file bit-set.hpp.
|
inline |
Initialize during cloning (unused)
Definition at line 89 of file bit-set.hpp.
|
inlineprotected |
Replace the i th word with w, decrease limit if w is zero.
Definition at line 95 of file bit-set.hpp.
|
inline |
Get the limit.
Definition at line 191 of file bit-set.hpp.
|
inline |
Check whether the set is empty.
Definition at line 197 of file bit-set.hpp.
|
inline |
Return the highest active index.
Definition at line 215 of file bit-set.hpp.
|
inline |
Clear the first limit words in mask.
Definition at line 111 of file bit-set.hpp.
|
inline |
Add to mask.
Definition at line 121 of file bit-set.hpp.
|
inline |
Intersect with mask, sparse mask if sparse is true.
Definition at line 130 of file bit-set.hpp.
|
inline |
Intersect with the "or" of and b.
Definition at line 153 of file bit-set.hpp.
|
inline |
Check if has a non-empty intersection with the set.
Definition at line 181 of file bit-set.hpp.
|
inline |
Perform "nand" with b.
Definition at line 169 of file bit-set.hpp.
|
inline |
Return the number of required bit set words.
Definition at line 203 of file bit-set.hpp.
|
inline |
Return the number of required bit set words.
Definition at line 209 of file bit-set.hpp.
|
protected |
Limit.
Definition at line 245 of file extensional.hh.
|
protected |
Indices.
Definition at line 247 of file extensional.hh.
|
protected |
Words.
Definition at line 249 of file extensional.hh.