18   if (length_ < capacity_) {  in Add()
19     data_[length_++] = element;  in Add()
34   int result_length = length_ + other.length();  in AddAll()
37     data_[length_ + i] = other.at(i);  in AddAll()
39   length_ = result_length;  in AddAll()
53   DCHECK(length_ >= capacity_);  in ResizeAddInternal()
61   data_[length_++] = temp;  in ResizeAddInternal()
67   DCHECK_LE(length_, new_capacity);  in Resize()
69   MemCopy(new_data, data_, length_ * sizeof(T));  in Resize()
78   int start = length_;  in AddBlock()
86   DCHECK(index >= 0 && index <= length_);  in Set()
93   DCHECK(index >= 0 && index <= length_);  in InsertAt()
95   for (int i = length_ - 1; i > index; --i) {  in InsertAt()
105   length_--;  in Remove()
106   while (i < length_) {  in Remove()
116   for (int i = 0; i < length_; i++) {  in RemoveElement()
130   length_ = length;  in Allocate()
141   length_ = 0;  in Clear()
147   DCHECK(0 <= pos && pos <= length_);  in Rewind()
148   length_ = pos;  in Rewind()
154   if (length_ < capacity_ / 4) {  in Trim()
162   for (int i = 0; i < length_; i++) callback(&data_[i]);  in Iterate()
169   for (int i = 0; i < length_; i++) visitor->Apply(&data_[i]);  in Iterate()
175   for (int i = 0; i < length_; i++) {  in Contains()
197   for (int i = 1; i < length_; i++)  in Sort()
214   length_ = 0;  in Initialize()