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