17     uintptr_t* ptr_;    // valid if data_length_ > 1  member
30                                              : target->data_.ptr_[0]),  in Iterator()
79       data_.ptr_ = zone->NewArray<uintptr_t>(data_length_);  in BitVector()
90       data_.ptr_ = zone->NewArray<uintptr_t>(data_length_);  in BitVector()
92         data_.ptr_[i] = other.data_.ptr_[i];  in BitVector()
121       data_.ptr_ = zone->NewArray<uintptr_t>(new_data_length);  in Resize()
130     uintptr_t block = is_inline() ? data_.inline_ : data_.ptr_[i / kDataBits];  in Contains()
139       data_.ptr_[i / kDataBits] |= (kOne << (i % kDataBits));  in Add()
150       memset(data_.ptr_, -1, sizeof(uintptr_t) * data_length_);  in AddAll()
159       data_.ptr_[i / kDataBits] &= ~(kOne << (i % kDataBits));  in Remove()
170         data_.ptr_[i] |= other.data_.ptr_[i];  in Union()
185         uintptr_t old_data = data_.ptr_[i];  in UnionIsChanged()
186         data_.ptr_[i] |= other.data_.ptr_[i];  in UnionIsChanged()
187         if (data_.ptr_[i] != old_data) changed = true;  in UnionIsChanged()
200         data_.ptr_[i] &= other.data_.ptr_[i];  in Intersect()
215         uintptr_t old_data = data_.ptr_[i];  in IntersectIsChanged()
216         data_.ptr_[i] &= other.data_.ptr_[i];  in IntersectIsChanged()
217         if (data_.ptr_[i] != old_data) changed = true;  in IntersectIsChanged()
230         data_.ptr_[i] &= ~other.data_.ptr_[i];  in Subtract()
240         data_.ptr_[i] = 0;  in Clear()
250         if (data_.ptr_[i] != 0) return false;  in IsEmpty()
263         if (data_.ptr_[i] != other.data_.ptr_[i]) return false;  in Equals()
291       data_.ptr_[0] = other_data.inline_;  in CopyFrom()
293         data_.ptr_[i] = 0;  in CopyFrom()
297         data_.ptr_[i] = other_data.ptr_[i];  in CopyFrom()
300         data_.ptr_[i] = 0;  in CopyFrom()