bit-set.hpp
Go to the documentation of this file.
171 : _active_words(0U), _word_capacity(0U), _word_index(nullptr), _word_bits(nullptr), _active_position(nullptr) {
177 : _active_words(0U), _word_capacity(0U), _word_index(nullptr), _word_bits(nullptr), _active_position(nullptr) {
183 : _active_words(0U), _word_capacity(0U), _word_index(nullptr), _word_bits(nullptr), _active_position(nullptr) {
189 : _active_words(0U), _word_capacity(0U), _word_index(nullptr), _word_bits(nullptr), _active_position(nullptr) {
unsigned long long int bits(void) const
Return an upper bound on the number of bits.
Definition bit-set.hpp:478
void add_to_mask(const BitSetData *support, BitSetData *mask) const
Add support to mask.
Definition bit-set.hpp:229
bool intersects(const BitSetData *mask) const
Check if has a non-empty intersection with the set.
Definition bit-set.hpp:394
void intersect_with_mask(const BitSetData *mask)
Intersect with mask, sparse mask if sparse is true.
Definition bit-set.hpp:265
void intersect_with_masks(const BitSetData *a, const BitSetData *b)
Intersect with the "or" of a and b.
Definition bit-set.hpp:308
IndexType * _word_index
Original word index for each active word position.
Definition extensional.hh:265
void replace_and_decrease(IndexType active_pos, BitSetData word)
Replace active word active_pos, dropping it if word is zero.
Definition bit-set.hpp:195
IndexType * _active_position
Reverse map from word index to active position+1 (optional).
Definition extensional.hh:269
Compressed tuple-word support list.
Definition extensional.hh:53
const TupleSet::CSupportWord * end(void) const
Return one past last support word.
Definition bit-set.hpp:55
Compressed support data for one tuple-word block.
Definition int.hh:2832
const TupleSet::BitSetData * find_support_word(const CompressedSupport &s, unsigned int widx)
Definition bit-set.hpp:65
Gecode toplevel namespace
void count(Home home, const IntVarArgs &x, int n, IntRelType irt, int m, IntPropLevel ipl=IPL_DEF)
Post propagator for .
Definition count.cpp:40
