bbq
.
More...
#include <bitsets.h>
Public Member Functions | |
uint64_bitset () | |
bool | subseteq (const uint64_bitset &) |
bool | operator< (const uint64_bitset &) const |
We obtain a canonical order on subsets of [1:k] by considering such a set as a number between 0 and 2^k-1. | |
bool | operator== (const uint64_bitset &) const |
Two sets are considered equivalent iff they contain the same elements, not regarding their weights. | |
int | cardinality () |
void | intersect (const uint64_bitset &b) |
void | set (const int &j) |
void | remove (const int &j) |
Static Public Attributes | |
int | k = 64 |
Friends | |
std::ostream & | operator<< (std::ostream &o, const uint64_bitset &) |
bbq
.
This class particularly supports unweighted sets whose cardinality is limited to 64 elements; it supports neither weighing nor multiset capabilities, but is very memory efficient.
For a brief documentation of the individual members, we refer to uint_bitset
.
|
|
|
|
|
|
|
We obtain a canonical order on subsets of [1:k] by considering such a set as a number between 0 and 2^k-1.
This order is needed for inserting weighted sets into (multi-)sets for the |
|
Two sets are considered equivalent iff they contain the same elements, not regarding their weights.
this is needed for inserting weighted sets into (multi-)sets for the |
|
|
|
|
|
|
|
|
|
|