#include <bitset.h>
Specialized version of Bitset64 that allows to query the last bit set more efficiently.
Definition at line 749 of file bitset.h.
◆ BitQueue64() [1/3]
operations_research::BitQueue64::BitQueue64 |
( |
| ) |
|
|
inline |
◆ BitQueue64() [2/3]
operations_research::BitQueue64::BitQueue64 |
( |
int | size | ) |
|
|
inlineexplicit |
◆ BitQueue64() [3/3]
operations_research::BitQueue64::BitQueue64 |
( |
const BitQueue64 & | | ) |
|
|
delete |
This type is neither copyable nor movable.
◆ ClearAndResize()
void operations_research::BitQueue64::ClearAndResize |
( |
int | size | ) |
|
|
inline |
◆ ClearTop()
void operations_research::BitQueue64::ClearTop |
( |
| ) |
|
|
inline |
Clears the Top() bit and recomputes the position of the next Top().
Note(user): I experimented with reversing the bit order in a bucket to use LeastSignificantBitPosition64() and it is only slightly faster at the cost of a lower Set() speed. So I preferred this version.
Definition at line 794 of file bitset.h.
◆ IncreaseSize()
void operations_research::BitQueue64::IncreaseSize |
( |
int | size | ) |
|
|
inline |
◆ operator=()
◆ Set()
void operations_research::BitQueue64::Set |
( |
int | i | ) |
|
|
inline |
◆ SetAllBefore()
void operations_research::BitQueue64::SetAllBefore |
( |
int | i | ) |
|
|
inline |
Sets all the bits from 0 up to i-1 to 1.
Definition at line 779 of file bitset.h.
◆ Top()
int operations_research::BitQueue64::Top |
( |
| ) |
const |
|
inline |
Returns the position of the highest bit set in O(1) or -1 if no bit is set.
Definition at line 791 of file bitset.h.
The documentation for this class was generated from the following file: