Lines Matching refs:buffer_
126 // capacity on the comment above the buffer_ variable below.
148 return parent_deque_->buffer_[index_];
153 return &parent_deque_->buffer_[index_];
251 return parent_deque_->buffer_.capacity() - parent_deque_->begin_ + index_;
259 if (index_ == parent_deque_->buffer_.capacity())
266 index_ = parent_deque_->buffer_.capacity() - 1;
289 parent_deque_->buffer_.capacity();
432 circular_deque(const circular_deque& other) : buffer_(other.size() + 1) {
436 : buffer_(std::move(other.buffer_)),
467 buffer_ = std::move(other.buffer_);
517 size_t right_size = buffer_.capacity() - begin_;
519 return buffer_[begin_ + i];
520 return buffer_[i - right_size];
534 return buffer_[begin_];
538 return buffer_[begin_];
591 return buffer_.capacity() == 0 ? 0 : buffer_.capacity() - 1;
598 if (buffer_.capacity())
599 buffer_ = VectorBuffer();
613 buffer_ = VectorBuffer();
621 return buffer_.capacity() - begin_ + end_;
646 size_t new_end = (begin_ + count) % buffer_.capacity();
661 size_t new_end = (begin_ + count) % buffer_.capacity();
699 new (&buffer_[insert_cur.index_]) T(value);
727 (begin_ + buffer_.capacity() - inserted_items) % buffer_.capacity();
736 new (&buffer_[insert_cur.index_]) T(*first);
768 new (&buffer_[insert_begin.index_]) T(std::forward<Args>(args)...);
793 buffer_.DestructRange(&buffer_[first.index_], &buffer_[last.index_]);
796 buffer_.DestructRange(&buffer_[first.index_],
797 &buffer_[buffer_.capacity()]);
798 buffer_.DestructRange(&buffer_[0], &buffer_[last.index_]);
814 buffer_.MoveRange(&buffer_[move_src.index_],
815 &buffer_[move_src.index_ + 1],
816 &buffer_[move_dest.index_]);
840 begin_ = buffer_.capacity() - 1;
844 new (&buffer_[begin_]) T(std::forward<Args>(args)...);
851 new (&buffer_[end_]) T(std::forward<Args>(args)...);
852 if (end_ == buffer_.capacity() - 1)
862 buffer_.DestructRange(&buffer_[begin_], &buffer_[begin_ + 1]);
864 if (begin_ == buffer_.capacity())
878 end_ = buffer_.capacity() - 1;
881 buffer_.DestructRange(&buffer_[end_], &buffer_[end_ + 1]);
893 std::swap(buffer_, other.buffer_);
941 // empty and full (see definition of buffer_ below).
943 MoveBuffer(buffer_, begin_, end_, &new_buffer, &begin_, &end_);
944 buffer_ = std::move(new_buffer);
1000 buffer_.DestructRange(&buffer_[begin], &buffer_[end]);
1002 buffer_.DestructRange(&buffer_[begin], &buffer_[buffer_.capacity()]);
1003 buffer_.DestructRange(&buffer_[0], &buffer_[end]);
1021 insert_begin->index_ = (begin_ + begin_offset) % buffer_.capacity();
1023 iterator(this, (insert_begin->index_ + count) % buffer_.capacity());
1027 end_ = (end_ + count) % buffer_.capacity();
1037 buffer_.MoveRange(&buffer_[src.index_], &buffer_[src.index_ + 1],
1038 &buffer_[dest.index_]);
1050 DCHECK((i >= begin_ && i < buffer_.capacity()) || i < end_);
1074 // Danger, the buffer_.capacity() is the "internal capacity" which is
1082 // Container internal code will want to use buffer_.capacity() for offset
1084 VectorBuffer buffer_;