136   UniqueSet() : size_(0), capacity_(0), array_(NULL) { }  in UniqueSet()
141         array_(zone->NewArray<Unique<T> >(capacity)) {  in UniqueSet()
147       : size_(1), capacity_(1), array_(zone->NewArray<Unique<T> >(1)) {  in UniqueSet()
148     array_[0] = uniq;  in UniqueSet()
156       if (array_[i] == uniq) return;  in Add()
157       if (array_[i].raw_address_ > uniq.raw_address_) {  in Add()
160         for (int j = size_ - 1; j >= i; j--) array_[j + 1] = array_[j];  in Add()
161         array_[i] = uniq;  in Add()
168     array_[size_++] = uniq;  in Add()
174       if (array_[i] == uniq) {  in Remove()
175         while (++i < size_) array_[i - 1] = array_[i];  in Remove()
186       if (this->array_[i] != that->array_[i]) return false;  in Equals()
196       Unique<T> cand = this->array_[i];  in Contains()
209       Unique<T> sought = this->array_[i];  in IsSubset()
211         if (sought == that->array_[j++]) break;  in IsSubset()
229       Unique<T> a = this->array_[i];  in Intersect()
230       Unique<T> b = that->array_[j];  in Intersect()
232         out->array_[k++] = a;  in Intersect()
257       Unique<T> a = this->array_[i];  in Union()
258       Unique<T> b = that->array_[j];  in Union()
260         out->array_[k++] = a;  in Union()
264         out->array_[k++] = a;  in Union()
267         out->array_[k++] = b;  in Union()
272     while (i < this->size_) out->array_[k++] = this->array_[i++];  in Union()
273     while (j < that->size_) out->array_[k++] = that->array_[j++];  in Union()
288       Unique<T> cand = this->array_[i];  in Subtract()
290         out->array_[j++] = cand;  in Subtract()
303     memcpy(copy->array_, this->array_, this->size_ * sizeof(Unique<T>));  in Copy()
317     return array_[index];  in at()
327   Unique<T>* array_;  variable
337         memcpy(new_array, array_, size_ * sizeof(Unique<T>));  in Grow()
340       array_ = new_array;  in Grow()