Lines Matching defs:array_
135 UniqueSet() : size_(0), capacity_(0), array_(NULL) { }
140 array_(zone->NewArray<Unique<T> >(capacity)) {
146 : size_(1), capacity_(1), array_(zone->NewArray<Unique<T> >(1)) {
147 array_[0] = uniq;
155 if (array_[i] == uniq) return;
156 if (array_[i].raw_address_ > uniq.raw_address_) {
159 for (int j = size_ - 1; j >= i; j--) array_[j + 1] = array_[j];
160 array_[i] = uniq;
167 array_[size_++] = uniq;
173 if (array_[i] == uniq) {
174 while (++i < size_) array_[i - 1] = array_[i];
185 if (this->array_[i] != that->array_[i]) return false;
195 Unique<T> cand = this->array_[i];
208 Unique<T> sought = this->array_[i];
210 if (sought == that->array_[j++]) break;
228 Unique<T> a = this->array_[i];
229 Unique<T> b = that->array_[j];
231 out->array_[k++] = a;
256 Unique<T> a = this->array_[i];
257 Unique<T> b = that->array_[j];
259 out->array_[k++] = a;
263 out->array_[k++] = a;
266 out->array_[k++] = b;
271 while (i < this->size_) out->array_[k++] = this->array_[i++];
272 while (j < that->size_) out->array_[k++] = that->array_[j++];
287 Unique<T> cand = this->array_[i];
289 out->array_[j++] = cand;
302 memcpy(copy->array_, this->array_, this->size_ * sizeof(Unique<T>));
316 return array_[index];
326 Unique<T>* array_;
336 memcpy(new_array, array_, size_ * sizeof(Unique<T>));
339 array_ = new_array;
