Regina Calculation Engine
|
A small but extremely fast "base 4 bitmask" class that can store up to 8 * sizeof(T) + 8 * sizeof(U) "qits", each equal to 0, 1, 2 or 3. More...
#include <utilities/qitmask.h>
Public Member Functions | |
Qitmask2 () | |
Creates a new qitmask with all qits set to 0. More... | |
Qitmask2 (const Qitmask2< T, U > &cloneMe) | |
Creates a clone of the given qitmask. More... | |
void | reset () |
Sets all qits of this qitmask to 0. More... | |
Qitmask2< T, U > & | operator= (const Qitmask2< T, U > &other) |
Sets this qitmask to a copy of the given qitmask. More... | |
char | get (unsigned index) const |
Returns the value of the given qit in this qitmask. More... | |
void | set (unsigned index, char value) |
Sets the given qit of this qitmask to the given value. More... | |
bool | empty () const |
Determines whether this qitmask contains all zeroes. More... | |
bool | nonEmpty () const |
Determines whether this qitmask contains at least one non-zero qit. More... | |
bool | has3 () const |
Determines whether this qitmask contains at least one qit with value 3. More... | |
Qitmask2< T, U > & | operator+= (const Qitmask2< T, U > &rhs) |
Sets this to the sum of this and the given qitmask. More... | |
Qitmask2< T, U > & | operator-= (const Qitmask2< T, U > &rhs) |
Sets this to the difference of this and the given qitmask. More... | |
bool | operator== (const Qitmask2< T, U > &other) const |
Determines whether this and the given qitmask are identical. More... | |
bool | hasNonZeroMatch (const Qitmask2< T, U > &other) const |
Determines whether there is some index at which both this and the given qitmask both have non-zero qits. More... | |
Friends | |
std::ostream & | operator (std::ostream &out, const Qitmask2< T, U > &mask) |
A small but extremely fast "base 4 bitmask" class that can store up to 8 * sizeof(T) + 8 * sizeof(U) "qits", each equal to 0, 1, 2 or 3.
This qitmask packs all of the qits together into two variables of type T and two variables of type U. This means that operations on entire qitmasks are extremely fast, because all of the qits can be processed in just a few native CPU operations.
The downside of course is that the number of qits that can be stored is limited to 8 * sizeof(T) + 8 * sizeof(U), where T and U must be native unsigned integer types (such as unsigned char, unsigned int, or unsigned long long).
For an even faster qitmask class that can only store half as many qits, see Qitmask1. At present there is no qitmask class in Regina that can store arbitrarily many qits.