39   if (length_ < capacity_) {  in Add()
40     data_[length_++] = element;  in Add()
55   int result_length = length_ + other.length();  in AddAll()
58     data_[length_ + i] = other.at(i);  in AddAll()
60   length_ = result_length;  in AddAll()
74   ASSERT(length_ >= capacity_);  in ResizeAddInternal()
82   data_[length_++] = temp;  in ResizeAddInternal()
98   int start = length_;  in AddBlock()
106   ASSERT(index >= 0 && index <= length_);  in InsertAt()
108   for (int i = length_ - 1; i > index; --i) {  in InsertAt()
118   length_--;  in Remove()
119   while (i < length_) {  in Remove()
129   for (int i = 0; i < length_; i++) {  in RemoveElement()
148   length_ = pos;  in Rewind()
154   for (int i = 0; i < length_; i++) callback(&data_[i]);  in Iterate()
161   for (int i = 0; i < length_; i++) visitor->Apply(&data_[i]);  in Iterate()
167   for (int i = 0; i < length_; i++) {  in Contains()
189   for (int i = 1; i < length_; i++)  in Sort()
206   length_ = 0;  in Initialize()