#include <mi32/bitset.h>
Inheritance diagram for BITSET_UNOWNED:

Public Member Functions | |
| virtual ERRVALUE | Assign (UINT8 *set, UINT32 NumEntries) |
| ITERATOR | Begin (bool value=true) const |
| BITSET_UNOWNED (UINT8 *set, UINT32 NumEntries) | |
| BITSET_UNOWNED () | |
| void | Clear (UINT32 posn) |
| void | ClearAll () |
| void | ClearRange (UINT32 min, UINT32 max) |
| void | CopyBit (UINT32 DestPosn, UINT32 SourcePosn) |
| INT32 | CountValues (bool value=true) const |
| ITERATOR | End () const |
| bool | GetBit (UINT32 posn) const |
| UINT32 | GetNumEntries () const |
| bool | GetRange (UINT32 StartPosn, UINT32 MaxEnd, UINT32 &EndPosn) const |
| bool | HasEntries () const |
| bool | HasMultiple (bool value) const |
| bool | HasValue (bool value) const |
| void | Invert (UINT32 posn) |
| void | InvertAll () |
| void | InvertRange (UINT32 min, UINT32 max) |
| BITSET_UNOWNED & | operator &= (const BITSET_UNOWNED &rhs) |
| operator const UINT8 * () const | |
| operator UINT8 * () | |
| BITSET_UNOWNED & | operator^= (const BITSET_UNOWNED &rhs) |
| BITSET_UNOWNED & | operator|= (const BITSET_UNOWNED &rhs) |
| void | Set (UINT32 posn) |
| void | SetAll () |
| void | SetBit (UINT32 posn, bool value) |
| void | SetRange (UINT32 min, UINT32 max) |
| virtual | ~BITSET_UNOWNED () |
Protected Attributes | |
| UINT8 * | m_Array |
| UINT32 | m_ArraySize |
| UINT32 | m_NumEntries |
Definition at line 190 of file bitset.h.
|
|
Default constructor.
|
|
||||||||||||
|
Constructor to convert old bit-array's into BITSET_UNOWNEDs.
|
|
|
Destructor.
|
|
||||||||||||
|
Assign from old type bit arrays.
Reimplemented in BITSET, and BITSET_SHARED. |
|
|
Initialize iterator with first set or unset item in the bit set. Returns iterator to first set entry, otherwise the last+1 item if no matching item.
|
|
|
Clear value at specified position.
|
|
|
Clear bit array with false. Makes all the entries in the bit set 'false'. |
|
||||||||||||
|
Set range of entries to "false".
|
|
||||||||||||
|
Transfer value from source to dest entry. Replaces putbit(set, DestPosn, getbit(set, SourcePosn)).
|
|
|
Count the values in the set. Iterates through the set, so should not be used in time-critical code. |
|
|
Initialize iterator with last+1 item in the bit set. Returns iterator to last+1 item |
|
|
Retrieve value at the requested position, true or false. Returns 'false' if the position given is outside the range of the BITSET
|
|
|
Return the number of valid entries.
|
|
||||||||||||||||
|
Get a range of entries that are set continuously in the bitset.
|
|
|
Does bit set have any entries?
|
|
|
Determine if has multiple entries with specified value.
|
|
|
Determine if has at least one entry with specified value;.
|
|
|
Invert value at specified position.
|
|
|
Invert all entries in bit set.
|
|
||||||||||||
|
Set range of entries to inverse.
|
|
|
Bitwise AND. If the bit sets are not the same size the set will be unaltered. |
|
|
Conversion to old bit-array style for legacy code.
|
|
|
Conversion to old bit-array style for legacy code.
|
|
|
Bitwise XOR. If the bit sets are not the same size the set will be unaltered. |
|
|
Bitwise OR. If the bit sets are not the same size the set will be unaltered. |
|
|
Set a value at the requested position to "true". Does nothing if the position given is outside range.
|
|
|
Set all entries to true, opposite of ClearAll(). Turn all bit positions to true. |
|
||||||||||||
|
Set a value at the requested position, true or false. Does nothing if the position given is outside range.
|
|
||||||||||||
|
Set range of entries to "true".
|
|
|
Memory containing the bit array.
|
|
|
Array size in bytes.
|
|
|
Actual number of bits used.
|
1.3.8-20040913