Lines Matching refs:size_
150 UniqueSet() : size_(0), capacity_(0), array_(NULL) { }
154 : size_(0), capacity_(capacity),
161 : size_(1), capacity_(1), array_(zone->NewArray<Unique<T> >(1)) {
169 for (int i = 0; i < size_; i++) {
173 Grow(size_ + 1, zone);
174 for (int j = size_ - 1; j >= i; j--) array_[j + 1] = array_[j];
176 size_++;
181 Grow(size_ + 1, zone);
182 array_[size_++] = uniq;
187 for (int i = 0; i < size_; i++) {
189 while (++i < size_) array_[i - 1] = array_[i];
190 size_--;
198 if (that->size_ != this->size_) return false;
199 for (int i = 0; i < this->size_; i++) {
209 for (int i = 0; i < this->size_; ++i) {
220 if (that->size_ < this->size_) return false;
222 for (int i = 0; i < this->size_; i++) {
227 if ((this->size_ - i) > (that->size_ - j)) return false;
236 if (that->size_ == 0 || this->size_ == 0) return new(zone) UniqueSet<T>();
239 Min(this->size_, that->size_), zone);
242 while (i < this->size_ && j < that->size_) {
256 out->size_ = k;
263 if (that->size_ == 0) return this->Copy(zone);
264 if (this->size_ == 0) return that->Copy(zone);
267 this->size_ + that->size_, zone);
270 while (i < this->size_ && j < that->size_) {
286 while (i < this->size_) out->array_[k++] = this->array_[i++];
287 while (j < that->size_) out->array_[k++] = that->array_[j++];
289 out->size_ = k;
296 if (that->size_ == 0) return this->Copy(zone);
298 UniqueSet<T>* out = new(zone) UniqueSet<T>(this->size_, zone);
301 while (i < this->size_) {
309 out->size_ = j;
315 UniqueSet<T>* copy = new(zone) UniqueSet<T>(this->size_, zone);
316 copy->size_ = this->size_;
317 memcpy(copy->array_, this->array_, this->size_ * sizeof(Unique<T>));
322 size_ = 0;
326 return size_;
330 DCHECK(index >= 0 && index < size_);
339 uint16_t size_;
350 if (size_ > 0) {
351 memcpy(new_array, array_, size_ * sizeof(Unique<T>));
