Index: runtime/vm/bit_vector.cc |
diff --git a/runtime/vm/bit_vector.cc b/runtime/vm/bit_vector.cc |
index cc38df316d4cd57ce2364a2949234b820c836c84..bb1df4dda81193adcba1bc3138fbf721e8ff189a 100644 |
--- a/runtime/vm/bit_vector.cc |
+++ b/runtime/vm/bit_vector.cc |
@@ -32,7 +32,6 @@ void BitVector::Iterator::Advance() { |
current_word_ = current_word_ >> 1; |
} |
- |
bool BitVector::Equals(const BitVector& other) const { |
if (length_ != other.length_) return false; |
intptr_t i = 0; |
@@ -48,7 +47,6 @@ bool BitVector::Equals(const BitVector& other) const { |
return true; |
} |
- |
bool BitVector::AddAll(const BitVector* from) { |
ASSERT(data_length_ == from->data_length_); |
bool changed = false; |
@@ -63,7 +61,6 @@ bool BitVector::AddAll(const BitVector* from) { |
return changed; |
} |
- |
bool BitVector::RemoveAll(const BitVector* from) { |
ASSERT(data_length_ == from->data_length_); |
bool changed = false; |
@@ -91,7 +88,6 @@ bool BitVector::KillAndAdd(BitVector* kill, BitVector* gen) { |
return changed; |
} |
- |
void BitVector::Intersect(const BitVector* other) { |
ASSERT(other->length() == length()); |
for (intptr_t i = 0; i < data_length_; i++) { |
@@ -99,7 +95,6 @@ void BitVector::Intersect(const BitVector* other) { |
} |
} |
- |
bool BitVector::IsEmpty() const { |
for (intptr_t i = 0; i < data_length_; i++) { |
if (data_[i] != 0) { |
@@ -109,7 +104,6 @@ bool BitVector::IsEmpty() const { |
return true; |
} |
- |
void BitVector::Print() const { |
OS::Print("["); |
for (intptr_t i = 0; i < length_; i++) { |