Lines Matching refs:circular_deque
18 // base::circular_deque is similar to std::deque. Unlike std::deque, the
39 // circular_deque();
40 // circular_deque(size_t count);
41 // circular_deque(size_t count, const T& value);
42 // circular_deque(InputIterator first, InputIterator last);
43 // circular_deque(const circular_deque&);
44 // circular_deque(circular_deque&&);
45 // circular_deque(std::initializer_list<value_type>);
48 // circular_deque& operator=(const circular_deque&);
49 // circular_deque& operator=(circular_deque&&);
50 // circular_deque& operator=(std::initializer_list<T>);
114 // void swap(circular_deque&);
119 class circular_deque;
237 friend class circular_deque<T>;
239 circular_deque_const_iterator(const circular_deque<T>* parent, size_t index)
295 // Since circular_deque doesn't guarantee stability, any attempt to
299 << "circular_deque iterator dereferenced after mutation.";
303 // Since circular_deque doesn't guarantee stability, two iterators that
314 const circular_deque<T>* parent_deque_;
330 friend class circular_deque<T>;
391 circular_deque_iterator(const circular_deque<T>* parent, size_t index)
398 class circular_deque {
419 constexpr circular_deque() = default;
422 circular_deque(size_type count) { resize(count); }
423 circular_deque(size_type count, const T& value) { resize(count, value); }
427 circular_deque(InputIterator first, InputIterator last) {
432 circular_deque(const circular_deque& other) : buffer_(other.size() + 1) {
435 circular_deque(circular_deque&& other) noexcept
443 circular_deque(std::initializer_list<value_type> init) { assign(init); }
445 ~circular_deque() { DestructRange(begin_, end_); }
452 circular_deque& operator=(const circular_deque& other) {
460 circular_deque& operator=(circular_deque&& other) noexcept {
477 circular_deque& operator=(std::initializer_list<value_type> ilist) {
524 const_cast<const circular_deque*>(this)->at(i));
529 return const_cast<circular_deque*>(this)->at(i);
892 void swap(circular_deque& other) {
899 friend void swap(circular_deque& lhs, circular_deque& rhs) { lhs.swap(rhs); }
1097 void Erase(circular_deque<T>& container, const Value& value) {
1103 void EraseIf(circular_deque<T>& container, Predicate pred) {