This class represents a reversible bitset.
This class is useful to maintain supports.
Definition at line 435 of file constraint_solveri.h.
◆ RevBitSet()
| operations_research::RevBitSet::RevBitSet |
( |
int64 |
size | ) |
|
|
explicit |
◆ ~RevBitSet()
| operations_research::RevBitSet::~RevBitSet |
( |
| ) |
|
◆ Cardinality()
| int64 operations_research::RevBitSet::Cardinality |
( |
| ) |
const |
Returns the number of bits set to one.
◆ ClearAll()
| void operations_research::RevBitSet::ClearAll |
( |
Solver *const |
solver | ) |
|
◆ GetFirstBit()
| int64 operations_research::RevBitSet::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 operations_research::RevBitSet::IsCardinalityOne |
( |
| ) |
const |
Does it contains only one bit set?
◆ IsCardinalityZero()
| bool operations_research::RevBitSet::IsCardinalityZero |
( |
| ) |
const |
◆ IsSet()
| bool operations_research::RevBitSet::IsSet |
( |
int64 |
index | ) |
const |
Returns whether the 'index' bit is set.
◆ SetToOne()
| void operations_research::RevBitSet::SetToOne |
( |
Solver *const |
solver, |
|
|
int64 |
index |
|
) |
| |
◆ SetToZero()
| void operations_research::RevBitSet::SetToZero |
( |
Solver *const |
solver, |
|
|
int64 |
index |
|
) |
| |
◆ RevBitMatrix
The documentation for this class was generated from the following file: