A bitset implementation backed by a single integer of type I.
Synopsis
Declared in <util/bitset.h>
template<typename I>
class IntBitSet;
Member Functions
Name |
Description |
|
Constructors |
Assignment operators |
|
Check if any bits are 1. |
|
Compute the number of 1 bits in the bitset. |
|
Find the first element (requires Any()). |
|
Check if bitset a is a subset of bitset b (= every 1 bit in a is also in b). |
|
Check if bitset a is a superset of bitset b (= every 1 bit in b is also in a). |
|
Find the last element (requires Any()). |
|
Check if all bits are 0. |
|
Check if the intersection between two sets is non‐empty. |
|
Set a bit to 0. |
|
|
|
Return an object that iterates over all 1 bits (++ and * only allowed when != end()). |
|
Return a dummy object to compare Iterators with. |
|
Set this object's bits to be the binary AND between respective bits from this and a. |
|
Set this object's bits to be the binary AND NOT between respective bits from this and a. |
|
Retrieve a bit at the given position. |
|
Set this object's bits to be the binary XOR between respective bits from this and a. |
|
Set this object's bits to be the binary OR between respective bits from this and a. |
Static Member Functions
Friends
Name |
Description |
Swap two bitsets. |
|
Check if bitset a and bitset b are identical. |
|
Return an object with the binary XOR between respective bits from a and b. |
|
Return an object with the binary AND NOT between respective bits from a and b. |
|
Return an object with the binary OR between respective bits from a and b. |
|
Return an object with the binary AND between respective bits from a and b. |
Created with MrDocs