Public Member Functions | |
| BitSet () | |
| number | size () |
| number | count () |
| computes the number of set bits in the whole set | |
| boolean | empty () |
| boolean | test (number n) |
| void | set (number n, boolean val) |
| void | resize (number numBits, boolean fillValue) |
| number | find_first () |
| return the smallest index i such that bit i is set, or npos if *this has no on bits. | |
| number | find_last () |
| return the highest index i such that bit i is set, or npos if *this has no on bits. | |
| Uint32Array | toIndices () |
Static Public Member Functions | |
| static BitSet | fromIndices (readonly number indices) |
std::vector<bool> like container (random-access, size_t - index type, bool - value type) with all bits after size() considered off during testing
| BitSet::BitSet | ( | ) |
| number BitSet::count | ( | ) |
computes the number of set bits in the whole set
| boolean BitSet::empty | ( | ) |
| number BitSet::find_first | ( | ) |
return the smallest index i such that bit i is set, or npos if *this has no on bits.
| number BitSet::find_last | ( | ) |
return the highest index i such that bit i is set, or npos if *this has no on bits.
|
static |
| void BitSet::resize | ( | number | numBits, |
| boolean | fillValue ) |
| void BitSet::set | ( | number | n, |
| boolean | val ) |
| number BitSet::size | ( | ) |
| boolean BitSet::test | ( | number | n | ) |
| Uint32Array BitSet::toIndices | ( | ) |