Searched refs:SparseBitVector (Results 1 – 6 of 6) sorted by relevance
283 class SparseBitVector {332 const SparseBitVector<ElementSize> *BitVector;438 SparseBitVectorIterator(const SparseBitVector<ElementSize> *RHS,451 SparseBitVector () {455 ~SparseBitVector() {459 SparseBitVector(const SparseBitVector &RHS) {475 SparseBitVector& operator=(const SparseBitVector& RHS) {564 bool operator!=(const SparseBitVector &RHS) const {568 bool operator==(const SparseBitVector &RHS) const {581 bool operator|=(const SparseBitVector &RHS) {[all …]
29 template <unsigned Element> class SparseBitVector; variable30 typedef SparseBitVector<128> LiveVirtRegBitSet;
84 SparseBitVector<> AliveBlocks;125 SparseBitVector<> PHIJoins;
18 SparseBitVector<> Vec; in TEST()
70 for (SparseBitVector<>::iterator I = AliveBlocks.begin(), in dump()
1491 Bit storage containers (BitVector, SparseBitVector)1531 SparseBitVector argument1534 The SparseBitVector container is much like BitVector, with one major difference:1535 Only the bits that are set, are stored. This makes the SparseBitVector much1538 downside to the SparseBitVector is that setting and testing of random bits is1543 testing/setting bits in a SparseBitVector is O(distance away from last set bit).