C++ Reference
C++ Reference: Routing
RevBitSet
Detailed Description
This class represents a reversible bitset.
This class is useful to maintain supports.
Definition at line 428 of file constraint_solveri.h.
Public Member Functions | |
RevBitSet (int64 size) | |
~RevBitSet () | |
void | SetToOne (Solver *const solver, int64 index) |
Sets the 'index' bit. More... | |
void | SetToZero (Solver *const solver, int64 index) |
Erases the 'index' bit. More... | |
bool | IsSet (int64 index) const |
Returns whether the 'index' bit is set. More... | |
int64 | Cardinality () const |
Returns the number of bits set to one. More... | |
bool | IsCardinalityZero () const |
Is bitset null? More... | |
bool | IsCardinalityOne () const |
Does it contains only one bit set? More... | |
int64 | GetFirstBit (int start) const |
Gets the index of the first bit set starting from start. More... | |
void | ClearAll (Solver *const solver) |
Cleans all bits. More... | |
Constructor & Destructor Documentation
◆ RevBitSet()
|
explicit |
◆ ~RevBitSet()
~RevBitSet | ( | ) |
Member Function Documentation
◆ Cardinality()
int64 Cardinality | ( | ) | const |
Returns the number of bits set to one.
◆ ClearAll()
void ClearAll | ( | Solver *const | solver | ) |
Cleans all bits.
◆ GetFirstBit()
int64 GetFirstBit | ( | int | start | ) | const |
Gets the index of the first bit set starting from start.
It returns -1 if the bitset is empty after start.
◆ IsCardinalityOne()
bool IsCardinalityOne | ( | ) | const |
Does it contains only one bit set?
◆ IsCardinalityZero()
bool IsCardinalityZero | ( | ) | const |
Is bitset null?
◆ IsSet()
bool IsSet | ( | int64 | index | ) | const |
Returns whether the 'index' bit is set.
◆ SetToOne()
void SetToOne | ( | Solver *const | solver, |
int64 | index | ||
) |
Sets the 'index' bit.
◆ SetToZero()
void SetToZero | ( | Solver *const | solver, |
int64 | index | ||
) |
Erases the 'index' bit.
The documentation for this class was generated from the following file: