Lines Matching refs:length_
20 if (length_ < capacity_) {
21 data_[length_++] = element;
36 int result_length = length_ + other.length();
39 memcpy(data_ + length_, other.start(), sizeof(*data_) * other.length());
41 for (int i = 0; i < other.length(); i++) data_[length_ + i] = other.at(i);
43 length_ = result_length;
57 DCHECK(length_ >= capacity_);
65 data_[length_++] = temp;
71 DCHECK_LE(length_, new_capacity);
73 MemCopy(new_data, data_, length_ * sizeof(T));
82 int start = length_;
90 DCHECK(index >= 0 && index <= length_);
97 DCHECK(index >= 0 && index <= length_);
99 for (int i = length_ - 1; i > index; --i) {
109 length_--;
110 while (i < length_) {
120 for (int i = 0; i < length_; i++) {
132 std::swap(length_, list->length_);
140 length_ = length;
151 length_ = 0;
157 DCHECK(0 <= pos && pos <= length_);
158 length_ = pos;
164 if (length_ < capacity_ / 4) {
172 for (int i = 0; i < length_; i++) callback(&data_[i]);
179 for (int i = 0; i < length_; i++) visitor->Apply(&data_[i]);
185 for (int i = 0; i < length_; i++) {
206 Sort(cmp, 0, length_);
229 StableSort(cmp, 0, length_);
