22           current_value_(target->data_[0]),  in Iterator()
68         data_(zone->NewArray<uintptr_t>(data_length_)) {  in BitVector()
76         data_(zone->NewArray<uintptr_t>(data_length_)) {  in BitVector()
88       data_[i] = other.data_[i];  in CopyFrom()
91       data_[i] = 0;  in CopyFrom()
97     uintptr_t block = data_[i / kDataBits];  in Contains()
103     data_[i / kDataBits] |= (kOne << (i % kDataBits));  in Add()
106   void AddAll() { memset(data_, -1, sizeof(uintptr_t) * data_length_); }  in AddAll()
110     data_[i / kDataBits] &= ~(kOne << (i % kDataBits));  in Remove()
116       data_[i] |= other.data_[i];  in Union()
124       uintptr_t old_data = data_[i];  in UnionIsChanged()
125       data_[i] |= other.data_[i];  in UnionIsChanged()
126       if (data_[i] != old_data) changed = true;  in UnionIsChanged()
134       data_[i] &= other.data_[i];  in Intersect()
142       uintptr_t old_data = data_[i];  in IntersectIsChanged()
143       data_[i] &= other.data_[i];  in IntersectIsChanged()
144       if (data_[i] != old_data) changed = true;  in IntersectIsChanged()
152       data_[i] &= ~other.data_[i];  in Subtract()
158       data_[i] = 0;  in Clear()
164       if (data_[i] != 0) return false;  in IsEmpty()
171       if (data_[i] != other.data_[i]) return false;  in Equals()
187   uintptr_t* const data_;  variable