138   circular_deque_const_iterator() : parent_deque_(nullptr), index_(0) {  in circular_deque_const_iterator()
147     parent_deque_->CheckValidIndex(index_);
148     return parent_deque_->buffer_[index_];
152     parent_deque_->CheckValidIndex(index_);
153     return &parent_deque_->buffer_[index_];
211     return lhs.index_ == rhs.index_;
240       : parent_deque_(parent), index_(index) {  in circular_deque_const_iterator()
249     if (index_ >= parent_deque_->begin_)  in OffsetFromBegin()
250       return index_ - parent_deque_->begin_;  // On the same side as begin.  in OffsetFromBegin()
251     return parent_deque_->buffer_.capacity() - parent_deque_->begin_ + index_;  in OffsetFromBegin()
257     parent_deque_->CheckValidIndex(index_);  in Increment()
258     index_++;  in Increment()
259     if (index_ == parent_deque_->buffer_.capacity())  in Increment()
260       index_ = 0;  in Increment()
264     parent_deque_->CheckValidIndexOrEnd(index_);  in Decrement()
265     if (index_ == 0)  in Decrement()
266       index_ = parent_deque_->buffer_.capacity() - 1;  in Decrement()
268       index_--;  in Decrement()
274       parent_deque_->CheckValidIndexOrEnd(index_);  in Add()
276       parent_deque_->CheckValidIndex(index_);  in Add()
288     index_ = (new_offset + parent_deque_->begin_) %  in Add()
315   size_t index_;  variable
695     iterator insert_cur(this, pos.index_);  in insert()
699       new (&buffer_[insert_cur.index_]) T(value);  in insert()
730       insert_cur = iterator(this, pos.index_);  in insert()
736       new (&buffer_[insert_cur.index_]) T(*first);  in insert()
765     iterator insert_begin(this, pos.index_);  in emplace()
768     new (&buffer_[insert_begin.index_]) T(std::forward<Args>(args)...);  in emplace()
787     if (first.index_ == last.index_) {  in erase()
790       return iterator(this, first.index_);  in erase()
791     } else if (first.index_ < last.index_) {  in erase()
793       buffer_.DestructRange(&buffer_[first.index_], &buffer_[last.index_]);  in erase()
796       buffer_.DestructRange(&buffer_[first.index_],  in erase()
798       buffer_.DestructRange(&buffer_[0], &buffer_[last.index_]);  in erase()
801     if (first.index_ == begin_) {  in erase()
804       begin_ = last.index_;  in erase()
805       return iterator(this, last.index_);  in erase()
810     iterator move_src(this, last.index_);  in erase()
812     iterator move_dest(this, first.index_);  in erase()
814       buffer_.MoveRange(&buffer_[move_src.index_],  in erase()
815                         &buffer_[move_src.index_ + 1],  in erase()
816                         &buffer_[move_dest.index_]);  in erase()
819     end_ = move_dest.index_;  in erase()
824     return iterator(this, first.index_);  in erase()
1021     insert_begin->index_ = (begin_ + begin_offset) % buffer_.capacity();  in MakeRoomFor()
1023         iterator(this, (insert_begin->index_ + count) % buffer_.capacity());  in MakeRoomFor()
1037       buffer_.MoveRange(&buffer_[src.index_], &buffer_[src.index_ + 1],  in MakeRoomFor()
1038                         &buffer_[dest.index_]);  in MakeRoomFor()