Fixed‐size block of bits stored as a contiguous array of BitWords.
Synopsis
Declared in <llvm/ADT/SparseBitVector.h>
template<unsigned int ElementSize = 128>
struct SparseBitVectorElement;
Description
Each element represents ElementSize consecutive bit indices starting at ElementIndex * ElementSize. Empty (all‐zero) elements are not retained by SparseBitVector.
Type Aliases
Name |
Description |
Unsigned word type used to store bits inside this element. |
|
Type used for counts of set bits in this element. |
Enums
Name |
Description |
Layout constants for a SparseBitVector element. |
Member Functions
Name |
Description |
|
Construct an all‐zero element at element index |
Return the number of bits set in this element. |
|
Return true if every bit in this element is clear. |
|
find_first ‐ Returns the index of the first set bit. |
|
find_last ‐ Returns the index of the last set bit. |
|
find_next ‐ Returns the index of the next set bit starting from the "Curr" bit. Returns ‐1 if the next set bit is not found. |
|
Return the element index of this block in the sparse vector. |
|
Bitwise‐and this element's bits with |
|
|
|
Return true if this element and |
|
Clear the bit at local index |
|
Set the bit at local index |
|
Return true if the bit at local index |
|
Set the bit at local index |
|
Bitwise‐or this element's bits with |
|
Return the BitWord at local word index |
|
Return true if this element has the same index and bit pattern as |
|
Return true if this element differs from |
Created with MrDocs