[Overview][Constants][Types][Classes][Procedures and functions][Variables] |
[Properties (by Name)] [Methods (by Name)] [Events (by Name)]
Class to store collections of bits (binary values that can be 0 or 1)
|
Creates a new bits collection. |
|
|
Destroys a bit collection |
|
|
Returns the number of records used to store the bits. |
|
|
Turn a particular bit on. |
|
|
Clears a particular bit. |
|
|
Clears all bits in the array. |
|
|
Performs an and operation on the bits. |
|
|
Performs an or operation on the bits. |
|
|
Performs a xor operation on the bits. |
|
|
Performs a not operation on the bits. |
|
|
Retrieve the value of a particular bit |
|
|
Expands the bits array to the requested size. |
|
|
Determines whether the bits of 2 arrays are equal. |
|
|
Sets the start position for FindNextBit and FindPrevBit |
|
|
Find first bit with a particular value |
|
|
Searches the next bit with a particular value. |
|
|
Searches the previous bit with a particular value. |
|
|
Returns the position of the first bit that is set to False. |
|
|
Access to all bits in the array. |
|
|
Current size of the array of bits. |
|
|
Class to store collections of bits (binary values that can be 0 or 1) |
|
| | ||
TBits can be used to store collections of bits in an indexed array. This is especially useful for storing collections of booleans: Normally the size of a boolean is the size of the smallest enumerated type, i.e. 1 byte. Since a bit can take 2 values it can be used to store a boolean as well. Since TBits can store 8 bits in a byte, it takes 8 times less space to store an array of booleans in a TBits class then it would take to stoe them in a conventional array.
TBits introduces methods to store and retrieve bit values, apply masks, and search for bits.