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