Lines Matching defs:begin
68 // iterator begin();
69 // const_iterator begin() const;
250 return index_ - parent_deque_->begin_; // On the same side as begin.
433 assign(other.begin(), other.end());
457 assign(other.begin(), other.end());
479 assign(std::begin(ilist), std::end(ilist));
506 reserve(std::distance(value.begin(), value.end()));
507 assign(value.begin(), value.end());
553 iterator begin() { return iterator(this, begin_); }
554 const_iterator begin() const { return const_iterator(this, begin_); }
567 reverse_iterator rend() { return reverse_iterator(begin()); }
569 return const_reverse_iterator(begin());
688 if (pos == begin()) {
721 if (pos == begin()) {
725 insert_end = begin();
728 insert_cur = begin();
759 return begin();
920 to_buf->begin());
925 to_buf->begin());
993 // Calls destructors for the given begin->end indices. The indices may wrap
996 void DestructRange(size_t begin, size_t end) {
997 if (end == begin) {
999 } else if (end > begin) {
1000 buffer_.DestructRange(&buffer_[begin], &buffer_[end]);
1002 buffer_.DestructRange(&buffer_[begin], &buffer_[buffer_.capacity()]);
1045 // begin.
1076 // being completely empty and completely full are indistinguishable (begin ==
1098 container.erase(std::remove(container.begin(), container.end(), value),
1104 container.erase(std::remove_if(container.begin(), container.end(), pred),