139   circular_deque_const_iterator() : parent_deque_(nullptr), index_(0) {  in circular_deque_const_iterator()
148     parent_deque_->CheckValidIndex(index_);
149     return parent_deque_->buffer_[index_];
153     parent_deque_->CheckValidIndex(index_);
154     return &parent_deque_->buffer_[index_];
212     return lhs.index_ == rhs.index_;
241       : parent_deque_(parent), index_(index) {  in circular_deque_const_iterator()
250     if (index_ >= parent_deque_->begin_)  in OffsetFromBegin()
251       return index_ - parent_deque_->begin_;  // On the same side as begin.  in OffsetFromBegin()
252     return parent_deque_->buffer_.capacity() - parent_deque_->begin_ + index_;  in OffsetFromBegin()
258     parent_deque_->CheckValidIndex(index_);  in Increment()
259     index_++;  in Increment()
260     if (index_ == parent_deque_->buffer_.capacity())  in Increment()
261       index_ = 0;  in Increment()
265     parent_deque_->CheckValidIndexOrEnd(index_);  in Decrement()
266     if (index_ == 0)  in Decrement()
267       index_ = parent_deque_->buffer_.capacity() - 1;  in Decrement()
269       index_--;  in Decrement()
275       parent_deque_->CheckValidIndexOrEnd(index_);  in Add()
277       parent_deque_->CheckValidIndex(index_);  in Add()
289     index_ = (new_offset + parent_deque_->begin_) %  in Add()
316   size_t index_;  variable
696     iterator insert_cur(this, pos.index_);  in insert()
700       new (&buffer_[insert_cur.index_]) T(value);  in insert()
731       insert_cur = iterator(this, pos.index_);  in insert()
737       new (&buffer_[insert_cur.index_]) T(*first);  in insert()
766     iterator insert_begin(this, pos.index_);  in emplace()
769     new (&buffer_[insert_begin.index_]) T(std::forward<Args>(args)...);  in emplace()
788     if (first.index_ == last.index_) {  in erase()
791       return iterator(this, first.index_);  in erase()
792     } else if (first.index_ < last.index_) {  in erase()
794       buffer_.DestructRange(&buffer_[first.index_], &buffer_[last.index_]);  in erase()
797       buffer_.DestructRange(&buffer_[first.index_],  in erase()
799       buffer_.DestructRange(&buffer_[0], &buffer_[last.index_]);  in erase()
802     if (first.index_ == begin_) {  in erase()
805       begin_ = last.index_;  in erase()
806       return iterator(this, last.index_);  in erase()
811     iterator move_src(this, last.index_);  in erase()
813     iterator move_dest(this, first.index_);  in erase()
815       buffer_.MoveRange(&buffer_[move_src.index_],  in erase()
816                         &buffer_[move_src.index_ + 1],  in erase()
817                         &buffer_[move_dest.index_]);  in erase()
820     end_ = move_dest.index_;  in erase()
825     return iterator(this, first.index_);  in erase()
1022     insert_begin->index_ = (begin_ + begin_offset) % buffer_.capacity();  in MakeRoomFor()
1024         iterator(this, (insert_begin->index_ + count) % buffer_.capacity());  in MakeRoomFor()
1038       buffer_.MoveRange(&buffer_[src.index_], &buffer_[src.index_ + 1],  in MakeRoomFor()
1039                         &buffer_[dest.index_]);  in MakeRoomFor()