|
LLVM
4.0.0
|
SparseBitVector is an implementation of a bitvector that is sparse by only storing the elements that have non-zero bits set. More...
#include <SparseBitVector.h>
Public Types | |
| enum | { BITWORD_SIZE = sizeof(BitWord) * CHAR_BIT, BITWORDS_PER_ELEMENT = (ElementSize + BITWORD_SIZE - 1) / BITWORD_SIZE, BITS_PER_ELEMENT = ElementSize } |
| typedef unsigned long | BitWord |
| typedef unsigned | size_type |
Public Member Functions | |
| SparseBitVectorElement (unsigned Idx) | |
| bool | operator== (const SparseBitVectorElement &RHS) const |
| bool | operator!= (const SparseBitVectorElement &RHS) const |
| BitWord | word (unsigned Idx) const |
| unsigned | index () const |
| bool | empty () const |
| void | set (unsigned Idx) |
| bool | test_and_set (unsigned Idx) |
| void | reset (unsigned Idx) |
| bool | test (unsigned Idx) const |
| size_type | count () const |
| int | find_first () const |
| find_first - Returns the index of the first set bit. More... | |
| int | find_next (unsigned Curr) const |
| find_next - Returns the index of the next set bit starting from the "Curr" bit. More... | |
| bool | unionWith (const SparseBitVectorElement &RHS) |
| bool | intersects (const SparseBitVectorElement &RHS) const |
| bool | intersectWith (const SparseBitVectorElement &RHS, bool &BecameZero) |
| bool | intersectWithComplement (const SparseBitVectorElement &RHS, bool &BecameZero) |
| void | intersectWithComplement (const SparseBitVectorElement &RHS1, const SparseBitVectorElement &RHS2, bool &BecameZero) |
SparseBitVector is an implementation of a bitvector that is sparse by only storing the elements that have non-zero bits set.
In order to make this fast for the most common cases, SparseBitVector is implemented as a linked list of SparseBitVectorElements. We maintain a pointer to the last SparseBitVectorElement accessed (in the form of a list iterator), in order to make multiple in-order test/set constant time after the first one is executed. Note that using vectors to store SparseBitVectorElement's does not work out very well because it causes insertion in the middle to take enormous amounts of time with a large amount of bits. Other structures that have better worst cases for insertion in the middle (various balanced trees, etc) do not perform as well in practice as a linked list with this iterator kept up to date. They are also significantly more memory intensive.
Definition at line 42 of file SparseBitVector.h.
| typedef unsigned long llvm::SparseBitVectorElement< ElementSize >::BitWord |
Definition at line 44 of file SparseBitVector.h.
| typedef unsigned llvm::SparseBitVectorElement< ElementSize >::size_type |
Definition at line 45 of file SparseBitVector.h.
| anonymous enum |
| Enumerator | |
|---|---|
| BITWORD_SIZE | |
| BITWORDS_PER_ELEMENT | |
| BITS_PER_ELEMENT | |
Definition at line 46 of file SparseBitVector.h.
|
inlineexplicit |
Definition at line 63 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORDS_PER_ELEMENT.
|
inline |
Definition at line 120 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORDS_PER_ELEMENT, llvm::countPopulation(), and i.
|
inline |
Definition at line 92 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORDS_PER_ELEMENT, and i.
|
inline |
find_first - Returns the index of the first set bit.
Definition at line 128 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORD_SIZE, llvm::SparseBitVectorElement< ElementSize >::BITWORDS_PER_ELEMENT, llvm::countTrailingZeros(), i, and llvm_unreachable.
Referenced by llvm::SparseBitVector< ElementSize >::find_first().
|
inline |
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.
Definition at line 137 of file SparseBitVector.h.
References assert(), llvm::SparseBitVectorElement< ElementSize >::BITS_PER_ELEMENT, llvm::SparseBitVectorElement< ElementSize >::BITWORD_SIZE, llvm::SparseBitVectorElement< ElementSize >::BITWORDS_PER_ELEMENT, llvm::countTrailingZeros(), and i.
|
inline |
Definition at line 88 of file SparseBitVector.h.
Referenced by llvm::SparseBitVector< ElementSize >::find_first().
|
inline |
Definition at line 174 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORDS_PER_ELEMENT, and i.
|
inline |
Definition at line 184 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORDS_PER_ELEMENT, and i.
|
inline |
Definition at line 207 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORDS_PER_ELEMENT, and i.
|
inline |
Definition at line 229 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORDS_PER_ELEMENT, and i.
|
inline |
Definition at line 78 of file SparseBitVector.h.
|
inline |
Definition at line 69 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORDS_PER_ELEMENT, and i.
|
inline |
Definition at line 112 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORD_SIZE, and L.
|
inline |
Definition at line 99 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORD_SIZE, and L.
Referenced by llvm::SparseBitVectorElement< ElementSize >::test_and_set().
|
inline |
Definition at line 116 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORD_SIZE, and L.
Referenced by llvm::SparseBitVectorElement< ElementSize >::test_and_set().
|
inline |
Definition at line 103 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::set(), and llvm::SparseBitVectorElement< ElementSize >::test().
|
inline |
Definition at line 161 of file SparseBitVector.h.
References llvm::SparseBitVectorElement< ElementSize >::BITWORDS_PER_ELEMENT, and i.
|
inline |
Definition at line 83 of file SparseBitVector.h.
References assert(), and llvm::SparseBitVectorElement< ElementSize >::BITWORDS_PER_ELEMENT.
1.8.6