bbq
.
More...
#include <bitsets.h>
Public Member Functions | |
variable_bitset (const variable_bitset &) | |
copy constructor | |
variable_bitset & | operator= (const variable_bitset &vb) |
assignment operator | |
variable_bitset () | |
default constructor | |
~variable_bitset () | |
destrcutor | |
bool | subseteq (const variable_bitset &) const |
int | cardinality () |
returns the number of elements contained in the set | |
void | intersect (const variable_bitset &b) |
void | set (const int &j) |
void | remove (const int &j) |
bool | operator< (const variable_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. | |
bool | operator== (const variable_bitset &) |
Two sets are considered equivalent iff they contain the same elements, not regarding their weights. | |
Static Public Attributes | |
int | k = 128 |
Friends | |
std::ostream & | operator<< (std::ostream &o, const variable_bitset &) |
bbq
.
This class particularly supports unweighted sets whose cardinality is unlimited. It supports neither weighing nor multiset capabilities, but is more memory efficient than the weighted versions.
For a brief documentation of the individual members, we refer to uint_bitset
.
|
copy constructor
|
|
default constructor
|
|
destrcutor
|
|
returns the number of elements contained in the set
|
|
|
|
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 |
|
assignment operator
|
|
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 |
|
|
|
|
|
|
|
|
|
|