150   UniqueSet() : size_(0), capacity_(0), array_(NULL) { }  in UniqueSet()
155         array_(zone->NewArray<Unique<T> >(capacity)) {  in UniqueSet()
161       : size_(1), capacity_(1), array_(zone->NewArray<Unique<T> >(1)) {  in UniqueSet()
162     array_[0] = uniq;  in UniqueSet()
170       if (array_[i] == uniq) return;  in Add()
171       if (array_[i].raw_address_ > uniq.raw_address_) {  in Add()
174         for (int j = size_ - 1; j >= i; j--) array_[j + 1] = array_[j];  in Add()
175         array_[i] = uniq;  in Add()
182     array_[size_++] = uniq;  in Add()
188       if (array_[i] == uniq) {  in Remove()
189         while (++i < size_) array_[i - 1] = array_[i];  in Remove()
200       if (this->array_[i] != that->array_[i]) return false;  in Equals()
210       Unique<T> cand = this->array_[i];  in Contains()
223       Unique<T> sought = this->array_[i];  in IsSubset()
225         if (sought == that->array_[j++]) break;  in IsSubset()
243       Unique<T> a = this->array_[i];  in Intersect()
244       Unique<T> b = that->array_[j];  in Intersect()
246         out->array_[k++] = a;  in Intersect()
271       Unique<T> a = this->array_[i];  in Union()
272       Unique<T> b = that->array_[j];  in Union()
274         out->array_[k++] = a;  in Union()
278         out->array_[k++] = a;  in Union()
281         out->array_[k++] = b;  in Union()
286     while (i < this->size_) out->array_[k++] = this->array_[i++];  in Union()
287     while (j < that->size_) out->array_[k++] = that->array_[j++];  in Union()
302       Unique<T> cand = this->array_[i];  in Subtract()
304         out->array_[j++] = cand;  in Subtract()
317     memcpy(copy->array_, this->array_, this->size_ * sizeof(Unique<T>));  in Copy()
331     return array_[index];  in at()
341   Unique<T>* array_;  variable
351         memcpy(new_array, array_, size_ * sizeof(Unique<T>));  in Grow()
354       array_ = new_array;  in Grow()