154   UniqueSet() : size_(0), capacity_(0), array_(NULL) { }  in UniqueSet()
161       if (array_[i] == uniq) return;  in Add()
162       if (array_[i].raw_address_ > uniq.raw_address_) {  in Add()
165         for (int j = size_ - 1; j >= i; j--) array_[j + 1] = array_[j];  in Add()
166         array_[i] = uniq;  in Add()
173     array_[size_++] = uniq;  in Add()
179       if (array_[i] == uniq) {  in Remove()
180         while (++i < size_) array_[i - 1] = array_[i];  in Remove()
191       if (this->array_[i] != that->array_[i]) return false;  in Equals()
201       if (this->array_[i] == elem) return true;  in Contains()
211       Unique<T> sought = this->array_[i];  in IsSubset()
213         if (sought == that->array_[j++]) break;  in IsSubset()
231       Unique<T> a = this->array_[i];  in Intersect()
232       Unique<T> b = that->array_[j];  in Intersect()
234         out->array_[k++] = a;  in Intersect()
259       Unique<T> a = this->array_[i];  in Union()
260       Unique<T> b = that->array_[j];  in Union()
262         out->array_[k++] = a;  in Union()
266         out->array_[k++] = a;  in Union()
269         out->array_[k++] = b;  in Union()
274     while (i < this->size_) out->array_[k++] = this->array_[i++];  in Union()
275     while (j < that->size_) out->array_[k++] = that->array_[j++];  in Union()
286     copy->array_ = zone->NewArray<Unique<T> >(this->size_);  in Copy()
287     memcpy(copy->array_, this->array_, this->size_ * sizeof(Unique<T>));  in Copy()
301     return array_[index];  in at()
311   Unique<T>* array_;  variable
321         memcpy(new_array, array_, size_ * sizeof(Unique<T>));  in Grow()
324       array_ = new_array;  in Grow()