Lines Matching refs:this
2 // Use of this source code is governed by a BSD-style license that can be
123 // Start allocating nonempty buffers with this many entries. This is the
155 const value_type& operator[](difference_type i) const { return *(*this + i); }
160 return *this;
163 circular_deque_const_iterator ret = *this;
169 return *this;
172 circular_deque_const_iterator ret = *this;
187 return *this;
198 return *this;
281 // this case explicitly.
296 // dereference this iterator after a mutation (i.e. the generation doesn't
305 // If this fires, the container was mutated between generating the two
318 // The generation of the parent deque when this iterator was created. The
357 return *this;
367 return *this;
373 return *this;
376 circular_deque_iterator ret = *this;
382 return *this;
385 circular_deque_iterator ret = *this;
453 if (&other == this)
454 return *this;
458 return *this;
461 if (&other == this)
462 return *this;
475 return *this;
480 return *this;
513 // Since this class assumes no exceptions, at() and operator[] are equivalent.
524 const_cast<const circular_deque*>(this)->at(i));
529 return const_cast<circular_deque*>(this)->at(i);
553 iterator begin() { return iterator(this, begin_); }
554 const_iterator begin() const { return const_iterator(this, begin_); }
555 const_iterator cbegin() const { return const_iterator(this, begin_); }
557 iterator end() { return iterator(this, end_); }
558 const_iterator end() const { return const_iterator(this, end_); }
559 const_iterator cend() const { return const_iterator(this, end_); }
636 // SEE BELOW VERSION if you change this. The code is mostly the same.
655 // SEE ABOVE VERSION if you change this. The code is mostly the same.
680 // and means less generated templatized code. Since this is an uncommon
682 // the benefit to optimize this.
695 iterator insert_cur(this, pos.index_);
706 // This enable_if keeps this call from getting confused with the (pos, count,
730 insert_cur = iterator(this, pos.index_);
762 // Do this before we make the new iterators we return.
765 iterator insert_begin(this, pos.index_);
790 return iterator(this, first.index_);
805 return iterator(this, last.index_);
810 iterator move_src(this, last.index_);
812 iterator move_dest(this, first.index_);
824 return iterator(this, first.index_);
885 // See pop_front comment about why this is here.
963 // Don't auto-shrink below this size.
1023 iterator(this, (insert_begin->index_ + count) % buffer_.capacity());
1060 DCHECK(i.parent_deque_ == this);