Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <bitset.h>
Public Member Functions | |
BitQueue64 () | |
BitQueue64 (int size) | |
BitQueue64 (const BitQueue64 &)=delete | |
This type is neither copyable nor movable. | |
BitQueue64 & | operator= (const BitQueue64 &)=delete |
void | IncreaseSize (int size) |
void | ClearAndResize (int size) |
void | Set (int i) |
void | SetAllBefore (int i) |
Sets all the bits from 0 up to i-1 to 1. | |
int | Top () const |
Returns the position of the highest bit set in O(1) or -1 if no bit is set. | |
void | ClearTop () |
Clears the Top() bit and recomputes the position of the next Top(). | |
Specialized version of Bitset64 that allows to query the last bit set more efficiently.
|
inlineexplicit |
|
delete |
This type is neither copyable nor movable.
|
inline |
|
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.
|
inline |
|
delete |
|
inline |
|
inline |