19   if (length_ < capacity_) {  in Add()
20     data_[length_++] = element;  in Add()
33   int result_length = length_ + other.length();  in AddAll()
37     memcpy(data_ + length_, other.start(), sizeof(*data_) * other.length());  in AddAll()
39     for (int i = 0; i < other.length(); i++) data_[length_ + i] = other.at(i);  in AddAll()
41   length_ = result_length;  in AddAll()
54   DCHECK(length_ >= capacity_);  in ResizeAddInternal()
62   data_[length_++] = temp;  in ResizeAddInternal()
67   DCHECK_LE(length_, new_capacity);  in Resize()
69   MemCopy(new_data, data_, length_ * sizeof(T));  in Resize()
77   int start = length_;  in AddBlock()
84   DCHECK(index >= 0 && index <= length_);  in Set()
90   DCHECK(index >= 0 && index <= length_);  in InsertAt()
92   for (int i = length_ - 1; i > index; --i) {  in InsertAt()
101   length_--;  in Remove()
102   while (i < length_) {  in Remove()
116   length_ = 0;  in Clear()
121   DCHECK(0 <= pos && pos <= length_);  in Rewind()
122   length_ = pos;  in Rewind()
128   for (int i = 0; i < length_; i++) visitor->Apply(&data_[i]);  in Iterate()
133   for (int i = 0; i < length_; i++) {  in Contains()
142   ToVector().Sort(cmp, 0, length_);  in Sort()
144   for (int i = 1; i < length_; i++) {  in Sort()