Gecode::Int::Extensional::TinyBitSet< _size > Class Template Reference
Tiny bit-set. More...
#include <extensional.hh>
Public Member Functions | |
| TinyBitSet (Space &home, unsigned int n) | |
| Initialize sparse bit set for a number of words n. | |
| template<unsigned int largersize> | |
| TinyBitSet (Space &home, const TinyBitSet< largersize > &tbs) | |
| Initialize during cloning. | |
| template<class IndexType > | |
| TinyBitSet (Space &home, const BitSet< IndexType > &bs) | |
| Initialize during cloning. | |
| int | limit (void) const |
| Get the limit. | |
| bool | empty (void) const |
| Check whether the set is empty. | |
| unsigned int | width (void) const |
| Return the highest active index. | |
| void | clear_mask (BitSetData *mask) |
| Clear the first limit words in mask. | |
| void | add_to_mask (const BitSetData *b, BitSetData *mask) const |
| Add to mask. | |
| template<bool sparse> | |
| void | intersect_with_mask (const BitSetData *mask) |
| Intersect with mask, sparse mask if sparse is true. | |
| void | intersect_with_masks (const BitSetData *a, const BitSetData *b) |
| Intersect with the "or" of and b. | |
| bool | intersects (const BitSetData *b) |
| Check if has a non-empty intersection with the set. | |
| void | nand_with_mask (const BitSetData *b) |
| Perform "nand" with b. | |
| void | nand_with_masks (const BitSetData *a, const BitSetData *b) |
| Perform "nand" with and the "or" of a and b. | |
| unsigned int | words (void) const |
| Return the number of required bit set words. | |
| unsigned int | size (void) const |
| Return the total number of words. | |
Protected Attributes | |
| BitSetData | bits [_size] |
| Words. | |
Detailed Description
template<unsigned int _size>
class Gecode::Int::Extensional::TinyBitSet< _size >
Tiny bit-set.
Definition at line 295 of file extensional.hh.
Constructor & Destructor Documentation
| Gecode::Int::Extensional::TinyBitSet< sz >::TinyBitSet | ( | Space & | home, | |
| unsigned int | n | |||
| ) | [inline] |
Initialize sparse bit set for a number of words n.
Set the active bits
Clear unused suffix bits
Definition at line 46 of file tiny-bit-set.hpp.
| Gecode::Int::Extensional::TinyBitSet< sz >::TinyBitSet | ( | Space & | home, | |
| const TinyBitSet< largersz > & | tbs | |||
| ) | [inline] |
Initialize during cloning.
Definition at line 59 of file tiny-bit-set.hpp.
| Gecode::Int::Extensional::TinyBitSet< sz >::TinyBitSet | ( | Space & | home, | |
| const BitSet< IndexType > & | bs | |||
| ) | [inline] |
Initialize during cloning.
Definition at line 70 of file tiny-bit-set.hpp.
Member Function Documentation
| int Gecode::Int::Extensional::TinyBitSet< _size >::limit | ( | void | ) | const |
Get the limit.
| bool Gecode::Int::Extensional::TinyBitSet< sz >::empty | ( | void | ) | const [inline] |
Check whether the set is empty.
Definition at line 130 of file tiny-bit-set.hpp.
| unsigned int Gecode::Int::Extensional::TinyBitSet< sz >::width | ( | void | ) | const [inline] |
Return the highest active index.
Find the index of the last non-zero word
Definition at line 139 of file tiny-bit-set.hpp.
| void Gecode::Int::Extensional::TinyBitSet< sz >::clear_mask | ( | BitSetData * | mask | ) | [inline] |
Clear the first limit words in mask.
Definition at line 83 of file tiny-bit-set.hpp.
| void Gecode::Int::Extensional::TinyBitSet< sz >::add_to_mask | ( | const BitSetData * | b, | |
| BitSetData * | mask | |||
| ) | const [inline] |
Add to mask.
Definition at line 92 of file tiny-bit-set.hpp.
| void Gecode::Int::Extensional::TinyBitSet< sz >::intersect_with_mask | ( | const BitSetData * | mask | ) | [inline] |
Intersect with mask, sparse mask if sparse is true.
Definition at line 100 of file tiny-bit-set.hpp.
| void Gecode::Int::Extensional::TinyBitSet< sz >::intersect_with_masks | ( | const BitSetData * | a, | |
| const BitSetData * | b | |||
| ) | [inline] |
Intersect with the "or" of and b.
Definition at line 107 of file tiny-bit-set.hpp.
| bool Gecode::Int::Extensional::TinyBitSet< sz >::intersects | ( | const BitSetData * | b | ) | [inline] |
Check if has a non-empty intersection with the set.
Definition at line 121 of file tiny-bit-set.hpp.
| void Gecode::Int::Extensional::TinyBitSet< sz >::nand_with_mask | ( | const BitSetData * | b | ) | [inline] |
Perform "nand" with b.
Definition at line 114 of file tiny-bit-set.hpp.
| void Gecode::Int::Extensional::TinyBitSet< _size >::nand_with_masks | ( | const BitSetData * | a, | |
| const BitSetData * | b | |||
| ) |
Perform "nand" with and the "or" of a and b.
| unsigned int Gecode::Int::Extensional::TinyBitSet< sz >::words | ( | void | ) | const [inline] |
Return the number of required bit set words.
Definition at line 151 of file tiny-bit-set.hpp.
| unsigned int Gecode::Int::Extensional::TinyBitSet< sz >::size | ( | void | ) | const [inline] |
Return the total number of words.
Definition at line 157 of file tiny-bit-set.hpp.
Member Data Documentation
BitSetData Gecode::Int::Extensional::TinyBitSet< _size >::bits[_size] [protected] |
Words.
Definition at line 299 of file extensional.hh.
The documentation for this class was generated from the following files:
- gecode/int/extensional.hh
- gecode/int/extensional/tiny-bit-set.hpp