Lines Matching refs:size_
255 Vector() : elements_(NULL), capacity_(0), size_(0) {}
263 for (int i = 0; i < size_; i++) {
269 capacity_ = size_ = 0;
274 int size() const { return size_; }
280 void PushBack(const E& element) { Insert(element, size_); }
290 if (size_ == 0)
305 MoveElements(index, size_ - index, index + 1);
307 size_++;
313 GTEST_CHECK_(0 <= index && index < size_)
315 << (size_ - 1) << "].";
318 MoveElements(index + 1, size_ - index - 1, index);
319 size_--;
328 for (int i = 0; i < size_; i++) {
343 for (int i = 0; i < size_; i++) {
354 for (int i = 0; i < size_; i++) {
364 for (int i = 0; i < size_; i++) {
375 GTEST_CHECK_(0 <= i && i < size_)
377 << (size_ - 1) << "].";
385 GTEST_CHECK_(0 <= i && i < size_)
387 << (size_ - 1) << "].";
395 return (i < 0 || i >= size_) ? default_value : *(elements_[i]);
401 GTEST_CHECK_(0 <= i && i < size_)
403 << (size_ - 1) << "].";
404 GTEST_CHECK_(0 <= j && j < size_)
406 << (size_ - 1) << "].";
418 GTEST_CHECK_(0 <= begin && begin <= size_)
420 << size_ << "].";
421 GTEST_CHECK_(begin <= end && end <= size_)
423 << begin << ", " << size_ << "].";
442 clone->Reserve(size_);
443 for (int i = 0; i < size_; i++) {
462 if (size_ < capacity_)
481 int size_; // The number of elements; in the range [0, capacity_].
