Lines Matching refs:is_inline
29 current_value_(target->is_inline() ? target->data_.inline_ in Iterator()
78 if (!is_inline()) { in BitVector()
89 if (!is_inline()) { in BitVector()
130 uintptr_t block = is_inline() ? data_.inline_ : data_.ptr_[i / kDataBits]; in Contains()
136 if (is_inline()) { in Add()
147 if (is_inline()) { in AddAll()
156 if (is_inline()) { in Remove()
165 if (is_inline()) { in Union()
166 DCHECK(other.is_inline()); in Union()
177 if (is_inline()) { in UnionIsChanged()
178 DCHECK(other.is_inline()); in UnionIsChanged()
195 if (is_inline()) { in Intersect()
196 DCHECK(other.is_inline()); in Intersect()
207 if (is_inline()) { in IntersectIsChanged()
208 DCHECK(other.is_inline()); in IntersectIsChanged()
225 if (is_inline()) { in Subtract()
226 DCHECK(other.is_inline()); in Subtract()
236 if (is_inline()) { in Clear()
246 if (is_inline()) { in IsEmpty()
258 if (is_inline()) { in Equals()
259 DCHECK(other.is_inline()); in Equals()
282 bool is_inline() const { return data_length_ == kDataLengthForInline; } in is_inline() function
287 if (is_inline()) { in CopyFrom()