reference& operator=(bool t) {
if (t)
- *WordRef |= 1 << BitPos;
+ *WordRef |= 1L << BitPos;
else
- *WordRef &= ~(1 << BitPos);
- return *this;
- }
-
- reference& operator=(const reference& rhs) {
- if (*rhs.WordRef & (1 << rhs.BitPos))
- *WordRef |= 1 << BitPos;
- else
- *WordRef &= ~(1 << BitPos);
+ *WordRef &= ~(1L << BitPos);
return *this;
}
operator bool() const {
- return (*WordRef) & (1 << BitPos);
+ return (*WordRef) & (1L << BitPos);
}
};
/// BitVector default ctor - Creates an empty bitvector.
BitVector() : Size(0), Capacity(0) {
- Bits = new BitWord[0];
- }
-
- /// BitVector ctor - Creates a bitvector of specified number of bits. All
- /// bits are initialized to false;
- BitVector(unsigned s) : Size(s) {
- Capacity = NumBitWords(s);
- Bits = new BitWord[Capacity];
- init_words(Bits, Capacity, false);
+ Bits = NULL;
}
/// BitVector ctor - Creates a bitvector of specified number of bits. All
/// bits are initialized to the specified value.
- BitVector(unsigned s, bool t) : Size(s) {
+ explicit BitVector(unsigned s, bool t = false) : Size(s) {
Capacity = NumBitWords(s);
Bits = new BitWord[Capacity];
init_words(Bits, Capacity, t);
- clear_unused_bits();
+ if (t)
+ clear_unused_bits();
}
/// BitVector copy ctor.
BitVector(const BitVector &RHS) : Size(RHS.size()) {
+ if (Size == 0) {
+ Bits = NULL;
+ Capacity = 0;
+ return;
+ }
+
Capacity = NumBitWords(RHS.size());
Bits = new BitWord[Capacity];
std::copy(RHS.Bits, &RHS.Bits[Capacity], Bits);
unsigned count() const {
unsigned NumBits = 0;
for (unsigned i = 0; i < NumBitWords(size()); ++i)
- NumBits = CountPopulation_32(Bits[i]);
+ if (sizeof(BitWord) == 4)
+ NumBits += CountPopulation_32(Bits[i]);
+ else if (sizeof(BitWord) == 8)
+ NumBits += CountPopulation_64(Bits[i]);
+ else
+ assert(0 && "Unsupported!");
return NumBits;
}
/// of the bits are set.
int find_first() const {
for (unsigned i = 0; i < NumBitWords(size()); ++i)
- if (Bits[i] != 0)
- return i * BITS_PER_WORD + CountTrailingZeros_32(Bits[i]);
+ if (Bits[i] != 0) {
+ if (sizeof(BitWord) == 4)
+ return i * BITS_PER_WORD + CountTrailingZeros_32(Bits[i]);
+ else if (sizeof(BitWord) == 8)
+ return i * BITS_PER_WORD + CountTrailingZeros_64(Bits[i]);
+ else
+ assert(0 && "Unsupported!");
+ }
return -1;
}
unsigned BitPos = Prev % BITS_PER_WORD;
BitWord Copy = Bits[WordPos];
// Mask off previous bits.
- Copy &= ~0 << BitPos;
+ Copy &= ~0L << BitPos;
- if (Copy != 0)
- return WordPos * BITS_PER_WORD + CountTrailingZeros_32(Copy);
+ if (Copy != 0) {
+ if (sizeof(BitWord) == 4)
+ return WordPos * BITS_PER_WORD + CountTrailingZeros_32(Copy);
+ else if (sizeof(BitWord) == 8)
+ return WordPos * BITS_PER_WORD + CountTrailingZeros_64(Copy);
+ else
+ assert(0 && "Unsupported!");
+ }
// Check subsequent words.
for (unsigned i = WordPos+1; i < NumBitWords(size()); ++i)
- if (Bits[i] != 0)
- return i * BITS_PER_WORD + CountTrailingZeros_32(Bits[i]);
+ if (Bits[i] != 0) {
+ if (sizeof(BitWord) == 4)
+ return i * BITS_PER_WORD + CountTrailingZeros_32(Bits[i]);
+ else if (sizeof(BitWord) == 8)
+ return i * BITS_PER_WORD + CountTrailingZeros_64(Bits[i]);
+ else
+ assert(0 && "Unsupported!");
+ }
return -1;
}
/// clear - Clear all bits.
void clear() {
- delete[] Bits;
- Bits = new BitWord[0];
- Size = Capacity = 0;
+ Size = 0;
}
/// resize - Grow or shrink the bitvector.
- void resize(unsigned N) {
- if (N > Capacity * BITS_PER_WORD) {
- unsigned OldCapacity = Capacity;
- grow(N);
- init_words(&Bits[OldCapacity], (Capacity-OldCapacity), false);
- }
- Size = N;
- }
-
- void resize(unsigned N, bool t) {
+ void resize(unsigned N, bool t = false) {
if (N > Capacity * BITS_PER_WORD) {
unsigned OldCapacity = Capacity;
grow(N);
}
BitVector &set(unsigned Idx) {
- Bits[Idx / BITS_PER_WORD] |= 1 << (Idx % BITS_PER_WORD);
+ Bits[Idx / BITS_PER_WORD] |= 1L << (Idx % BITS_PER_WORD);
return *this;
}
}
BitVector &reset(unsigned Idx) {
- Bits[Idx / BITS_PER_WORD] &= ~(1 << (Idx % BITS_PER_WORD));
+ Bits[Idx / BITS_PER_WORD] &= ~(1L << (Idx % BITS_PER_WORD));
return *this;
}
}
BitVector &flip(unsigned Idx) {
- Bits[Idx / BITS_PER_WORD] ^= 1 << (Idx % BITS_PER_WORD);
+ Bits[Idx / BITS_PER_WORD] ^= 1L << (Idx % BITS_PER_WORD);
return *this;
}
}
bool operator[](unsigned Idx) const {
- BitWord Mask = 1 << (Idx % BITS_PER_WORD);
+ BitWord Mask = 1L << (Idx % BITS_PER_WORD);
return (Bits[Idx / BITS_PER_WORD] & Mask) != 0;
}
// Comparison operators.
bool operator==(const BitVector &RHS) const {
- assert(Size == RHS.Size && "Illegal operation!");
+ if (Size != RHS.Size)
+ return false;
+
for (unsigned i = 0; i < NumBitWords(size()); ++i)
if (Bits[i] != RHS.Bits[i])
return false;
// Clear the unused top bits in the high word.
void clear_unused_bits() {
unsigned ExtraBits = Size % BITS_PER_WORD;
- Bits[Size / BITS_PER_WORD] &= ~(~0 << ExtraBits);
+ if (ExtraBits) {
+ unsigned index = Size / BITS_PER_WORD;
+ Bits[index] &= ~(~0L << ExtraBits);
+ }
}
void grow(unsigned NewSize) {