#include <bitset.h>
Protected Member Functions | |
| BitSetBase () | |
| BitSetBase (unsigned long b) | |
| ~BitSetBase () | |
| template<size_t m> | |
| BitSetBase (const BitSet< m > &b) | |
| Copies from another bitset size by truncating at the end of the first word. | |
| template<size_t m> | |
| BitSetBase< 1 > & | operator= (const BitSet< m > &b) |
| Assigns from another bitset size by truncating at the end of the first word. | |
| bool | operator== (const BitSetBase< 1 > &b) const |
| bool | operator!= (const BitSetBase< 1 > &b) const |
| bool | operator< (const BitSetBase< 1 > &b) const |
| bool | operator[] (size_t j) const |
| Returns the value of bit j in the BitSet. | |
| bool | any () const |
| Returns 1 if any bit of the BitSet is 1, and 0 otherwise. | |
| bool | any (const BitSetBase< 1 > &b) const |
| iterator | begin () const |
| bool | contains (const BitSetBase< 1 > &b) const |
| Tests whether this bitset contains b. | |
| size_t | count () const |
| Number of set bits in BitSet. | |
| size_t | firstBit () const |
| size_t | lastBit () const |
| bool | none () const |
| size_t | position (size_t j) const |
| bool | scalarProduct (const BitSetBase< 1 > &b) const |
| Number of set bits in position < j. | |
| bool | test (size_t j) const |
| unsigned long | to_ulong () const |
| unsigned long | to_ulong1 () const |
| BitSetBase< 1 > & | operator^= (const BitSetBase< 1 > &b) |
| BitSetBase< 1 > & | operator|= (const BitSetBase< 1 > &b) |
| BitSetBase< 1 > & | operator &= (const BitSetBase< 1 > &b) |
| BitSetBase< 1 > & | operator<<= (size_t c) |
| BitSetBase< 1 > & | operator>>= (size_t c) |
| BitSetBase< 1 > & | andnot (const BitSetBase< 1 > &b) |
| BitSetBase< 1 > & | flip () |
| BitSetBase< 1 > & | flip (size_t j) |
| BitSetBase< 1 > & | permute (const setutils::Permutation &a) |
| BitSetBase< 1 > & | reset () |
| BitSetBase< 1 > & | reset (size_t j) |
| BitSetBase< 1 > & | set () |
| BitSetBase< 1 > & | set (size_t j) |
| BitSetBase< 1 > & | set (size_t j, bool b) |
| BitSetBase< 1 > & | slice (const BitSetBase< 1 > &c) |
| void | swap (BitSetBase< 1 > &source) |
| BitSetBase< 1 > & | truncate (size_t m) |
Private Attributes | |
| unsigned long | d_bits |
| Word that holds the BitSet. | |
With RANK_MAX=16, this template should be the only one instantiated on a 32-bit machine.
The BitSet class BitSet<n>, for n between 1 and the machine word length (more precisely, the constant longBits), is a derived class of BitSetBase<1>.
Definition at line 99 of file bitset.h.
|
|
|
|
|
|
|
|
|
|
|
Returns 1 if any bit of the BitSet is 1, and 0 otherwise.
|
|
|
Synopsis : returns an iterator pointing to the first set bit; this is essentially just d_bits itself. Definition at line 26 of file bitset.cpp. |
|
||||||||||
|
Copies from another bitset size by truncating at the end of the first word. For each BitSet size, to_ulong is the word holding the first longBits (machine word size) of the BitSet. This copy constructor therefore truncates b at the end of its first word. |
|
|
|
|
|
|
|
|
Tests whether this bitset contains b. Returns whether if every set bit of b is also set in this BitSet. |
|
|
Number of set bits in BitSet.
Definition at line 192 of file bitset.h. References atlas::bits::bitCount(). |
|
|
Definition at line 196 of file bitset.h. References atlas::bits::firstBit(). |
|
|
|
|
|
|
|
|
Definition at line 200 of file bitset.h. References atlas::bits::lastBit(). |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
We have to make sure that shift by constants::longBits yields 0. |
|
||||||||||
|
Assigns from another bitset size by truncating at the end of the first word. For each BitSet size, to_ulong is the word holding the first longBits (machine word size) of the BitSet. This assignment operator therefore truncates b at the end of its first word. Definition at line 144 of file bitset.h. References atlas::bitset::BitSet< n >::to_ulong(). |
|
|
|
|
|
We have to make sure that shift by constants::longBits yields 0. |
|
|
Returns the value of bit j in the BitSet.
|
|
|
|
|
|
|
|
|
Definition at line 285 of file bitset.h. References atlas::bits::permute(). |
|
|
If j is set, this is the position of j in the collection of set bits. Definition at line 208 of file bitset.h. References atlas::bits::bitCount(). |
|
|
|
|
|
|
|
|
Number of set bits in position < j. Synopsis: returns the parity of *this & b. Definition at line 37 of file bitset.cpp. References atlas::bits::bitCount(). |
|
||||||||||||
|
Definition at line 310 of file bitset.h. References atlas::bitset::set(). |
|
|
|
|
|
|
|
|
Definition at line 50 of file bitset.cpp. References atlas::bitset::set(), and test(). |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Word that holds the BitSet.
|
1.3.9.1