#include <BitSet.H>
◆ BitSet() [1/3]
◆ BitSet() [2/3]
BitSet::BitSet |
( |
int |
bits, |
|
|
bool |
init |
|
) |
| |
◆ BitSet() [3/3]
BitSet::BitSet |
( |
const BitSet & |
rhs | ) |
|
◆ ~BitSet()
◆ define()
void BitSet::define |
( |
int |
bits, |
|
|
bool |
init |
|
) |
| |
◆ operator=()
◆ operator<()
bool BitSet::operator< |
( |
const BitSet & |
rhs | ) |
const |
Primary criterion: m_length. Secondary criterion: BITSETWORD-by-BITSETWORD lexicographic comparison of *m_bits.
◆ operator[]()
bool BitSet::operator[] |
( |
int |
i | ) |
const |
|
inline |
◆ setTrue()
void BitSet::setTrue |
( |
int |
i | ) |
|
◆ setFalse()
void BitSet::setFalse |
( |
int |
i | ) |
|
◆ setAllTrue()
void BitSet::setAllTrue |
( |
| ) |
|
◆ setAllFalse()
void BitSet::setAllFalse |
( |
| ) |
|
◆ isEmpty()
bool BitSet::isEmpty |
( |
| ) |
const |
returns 'true' if the entire bitset is zero
◆ isFull()
bool BitSet::isFull |
( |
| ) |
const |
returns 'true' if entire bitset is 1
◆ size()
int BitSet::size |
( |
| ) |
const |
|
inline |
◆ initialize()
static int BitSet::initialize |
( |
| ) |
|
|
static |
◆ linearSize()
int BitSet::linearSize |
( |
| ) |
const |
◆ linearIn()
void BitSet::linearIn |
( |
const void *const |
inBuf | ) |
|
◆ linearOut()
void BitSet::linearOut |
( |
void *const |
a_outBuf | ) |
const |
◆ BitSetIterator
◆ BitSetTrueIterator
◆ bytes
◆ peak
◆ m_bits
◆ m_size
◆ m_length
◆ trueMasks
The documentation for this class was generated from the following file: