Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/header/deque"

From cppreference.com
< cpp‎ | header
m (→‎Synopsis)
(move synopsis to template)
 
(5 intermediate revisions by 4 users not shown)
Line 3: Line 3:
 
This header is part of the [[cpp/container|containers]] library.
 
This header is part of the [[cpp/container|containers]] library.
 
{{dsc begin}}
 
{{dsc begin}}
 +
{{dsc h1|Includes}}
 +
{{dsc inc|cpp/header/dsc compare}}
 +
{{dsc inc|cpp/header/dsc initializer_list}}
 
{{dsc h1|Classes}}
 
{{dsc h1|Classes}}
−
{{dsc inc | cpp/container/dsc deque}}
+
{{dsc inc|cpp/container/dsc deque}}
 
{{dsc h1|Functions}}
 
{{dsc h1|Functions}}
−
{{dsc inc | cpp/container/dsc operator_cmp | deque}}
+
{{dsc inc|cpp/container/dsc operator_cmp|deque}}
−
{{dsc inc | cpp/container/dsc swap2 | deque}}
+
{{dsc inc|cpp/container/dsc swap2|deque}}
 +
{{dsc inc|cpp/container/dsc erase seq|deque}}
 +
{{dsc h2|Range access}}
 +
{{dsc inc|cpp/iterator/dsc begin}}
 +
{{dsc inc|cpp/iterator/dsc end}}
 +
{{dsc inc|cpp/iterator/dsc rbegin}}
 +
{{dsc inc|cpp/iterator/dsc rend}}
 +
{{dsc inc|cpp/iterator/dsc size}}
 +
{{dsc inc|cpp/iterator/dsc empty}}
 +
{{dsc inc|cpp/iterator/dsc data}}
 
{{dsc end}}
 
{{dsc end}}
  
 
===Synopsis===
 
===Synopsis===
−
{{source|
+
{{cpp/synopsis/deque}}
−
#include <initializer_list>
+
  
−
namespace std {
+
{{langlinks|es|ja|zh}}
−
    template <class T, class Allocator {{=}} allocator<T> > class deque;
+
−
   
+
−
    template <class T, class Allocator>
+
−
        bool operator{{==}}(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+
−
    template <class T, class Allocator>
+
−
        bool operator<(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+
−
    template <class T, class Allocator>
+
−
        bool operator!{{=}}(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+
−
    template <class T, class Allocator>
+
−
        bool operator>(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+
−
    template <class T, class Allocator>
+
−
        bool operator>{{=}}(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+
−
    template <class T, class Allocator>
+
−
        bool operator<{{=}}(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+
−
       
+
−
    template <class T, class Allocator>
+
−
        void swap(deque<T,Allocator>& x, deque<T,Allocator>& y);
+
−
}
+
−
 
+
−
}}
+
−
 
+
−
===Class {{lc|std::deque}}===
+
−
{{source|
+
−
 
+
−
template <class T, class Allocator {{=}} allocator<T> >
+
−
class deque {
+
−
public:
+
−
    // types:
+
−
    typedef value_type&                                        reference;
+
−
    typedef const value_type&                                  const_reference;
+
−
    typedef /*implementation-defined*/                          iterator;
+
−
    typedef /*implementation-defined*/                          const_iterator;
+
−
    typedef /*implementation-defined*/                          size_type;
+
−
    typedef /*implementation-defined*/                          difference_type;
+
−
    typedef T                                                  value_type;
+
−
    typedef Allocator                                          allocator_type;
+
−
    typedef typename allocator_traits<Allocator>::pointer      pointer;
+
−
    typedef typename allocator_traits<Allocator>::const_pointer const_pointer;
+
−
    typedef std::reverse_iterator<iterator>                    reverse_iterator;
+
−
    typedef std::reverse_iterator<const_iterator>              const_reverse_iterator;
+
−
   
+
−
    // construct/copy/destroy:
+
−
    explicit deque(const Allocator& {{=}} Allocator());
+
−
    explicit deque(size_type n);
+
−
    deque(size_type n, const T& value,const Allocator& {{=}} Allocator());
+
−
    template <class InputIterator>
+
−
        deque(InputIterator first, InputIterator last,const Allocator& {{=}} Allocator());
+
−
    deque(const deque<T,Allocator>& x);
+
−
    deque(deque&&);
+
−
    deque(const deque&, const Allocator&);
+
−
    deque(deque&&, const Allocator&);
+
−
    deque(initializer_list<T>, const Allocator& {{=}} Allocator());
+
−
   
+
−
    ~deque();
+
−
    deque<T,Allocator>& operator{{=}}(const deque<T,Allocator>& x);
+
−
    deque<T,Allocator>& operator{{=}}(deque<T,Allocator>&& x);
+
−
    deque& operator{{=}}(initializer_list<T>);
+
−
    template <class InputIterator>
+
−
    void assign(InputIterator first, InputIterator last);
+
−
    void assign(size_type n, const T& t);
+
−
    void assign(initializer_list<T>);
+
−
    allocator_type get_allocator() const noexcept;
+
−
 
+
−
    // iterators:
+
−
    iterator                begin() noexcept;
+
−
    const_iterator          begin() const noexcept;
+
−
    iterator                end() noexcept;
+
−
    const_iterator          end() const noexcept;
+
−
   
+
−
    reverse_iterator        rbegin() noexcept;
+
−
    const_reverse_iterator  rbegin() const noexcept;
+
−
    reverse_iterator        rend() noexcept;
+
−
    const_reverse_iterator  rend() const noexcept;
+
−
   
+
−
    const_iterator          cbegin() noexcept;
+
−
    const_iterator          cend() noexcept;
+
−
    const_reverse_iterator  crbegin() const noexcept;
+
−
    const_reverse_iterator  crend() const noexcept;
+
−
   
+
−
    // capacity:
+
−
    size_type size() const noexcept;
+
−
    size_type max_size() const noexcept;
+
−
    void      resize(size_type sz);
+
−
    void      resize(size_type sz, const T& c);
+
−
    void      shrink_to_fit();
+
−
    bool      empty() const noexcept;
+
−
   
+
−
    // element access:
+
−
    reference      operator[](size_type n);
+
−
    const_reference operator[](size_type n) const;
+
−
    reference      at(size_type n);
+
−
    const_reference at(size_type n) const;
+
−
    reference      front();
+
−
    const_reference front() const;
+
−
    reference      back();
+
−
    const_reference back() const;
+
−
   
+
−
    // modifiers:
+
−
    template <class... Args> void emplace_front(Args&&... args);
+
−
    template <class... Args> void emplace_back(Args&&... args);
+
−
    template <class... Args> iterator emplace(const_iterator position, Args&&... args);
+
−
   
+
−
    void push_front(const T& x);
+
−
    void push_front(T&& x);
+
−
    void push_back(const T& x);
+
−
    void push_back(T&& x);
+
−
 
+
−
    iterator insert(const_iterator position, const T& x);
+
−
    iterator insert(const_iterator position, T&& x);
+
−
    iterator insert(const_iterator position, size_type n, const T& x);
+
−
    template <class InputIterator>
+
−
        iterator insert (const_iterator position, InputIterator first,
+
−
                        InputIterator last);
+
−
    iterator insert(const_iterator position, initializer_list<T>);
+
−
 
+
−
    void pop_front();
+
−
    void pop_back();
+
−
 
+
−
    iterator erase(const_iterator position);
+
−
    iterator erase(const_iterator first, const_iterator last);
+
−
    void    swap(deque<T,Allocator>&);
+
−
    void    clear() noexcept;
+
−
};
+
−
 
+
−
}}
+

Latest revision as of 03:54, 29 November 2023

 
C++
 
Standard library headers
 

This header is part of the containers library.

Contents

Includes

(C++20)
 Three-way comparison operator support[edit]
(C++11)
 std::initializer_list class template[edit]

Classes

 double-ended queue
(class template) [edit]

Functions

(removed in C++20)(removed in C++20)(removed in C++20)(removed in C++20)(removed in C++20)(C++20)
 lexicographically compares the values of two deques
(function template) [edit]
specializes the std::swap algorithm
(function template) [edit]
(C++20)
 erases all elements satisfying specific criteria
(function template) [edit]
Range access
(C++11)(C++14)
 returns an iterator to the beginning of a container or array
(function template) [edit]
(C++11)(C++14)
 returns an iterator to the end of a container or array
(function template) [edit]
(C++14)
 returns a reverse iterator to the beginning of a container or array
(function template) [edit]
(C++14)
 returns a reverse end iterator for a container or array
(function template) [edit]
(C++17)(C++20)
 returns the size of a container or array
(function template) [edit]
(C++17)
 checks whether the container is empty
(function template) [edit]
(C++17)
 obtains the pointer to the underlying array
(function template) [edit]

[edit] Synopsis

#include <compare>
#include <initializer_list>
 
namespace std {
  // class template deque
  template<class T, class Allocator = allocator<T>>
  class deque;
 
  template<class T, class Allocator>
  bool operator==(const deque<T, Allocator>& x, const deque<T, Allocator>& y);
  template<class T, class Allocator>
  /*synth-three-way-result*/<T> operator<=>(const deque<T, Allocator>& x,
                                            const deque<T, Allocator>& y);
 
  template<class T, class Allocator>
  void swap(deque<T, Allocator>& x, deque<T, Allocator>& y) noexcept(noexcept(x.swap(y)));
 
  // erasure
  template<class T, class Allocator, class U = T>
  typename deque<T, Allocator>::size_type erase(deque<T, Allocator>& c, const U& value);
  template<class T, class Allocator, class Predicate>
  typename deque<T, Allocator>::size_type erase_if(deque<T, Allocator>& c,
                                                   Predicate pred);
 
  namespace pmr {
    template<class T>
    using deque = std::deque<T, polymorphic_allocator<T>>;
  }
}

[edit] Class template std::deque

namespace std {
  template<class T, class Allocator = allocator<T>>
  class deque
  {
  public:
    // types
    using value_type             = T;
    using allocator_type         = Allocator;
    using pointer                = typename allocator_traits<Allocator>::pointer;
    using const_pointer          = typename allocator_traits<Allocator>::const_pointer;
    using reference              = value_type&;
    using const_reference        = const value_type&;
    using size_type              = /* implementation-defined */;
    using difference_type        = /* implementation-defined */;
    using iterator               = /* implementation-defined */;
    using const_iterator         = /* implementation-defined */;
    using reverse_iterator       = std::reverse_iterator<iterator>;
    using const_reverse_iterator = std::reverse_iterator<const_iterator>;
 
    // construct/copy/destroy
    deque()
      : deque(Allocator())
    {
    }
    explicit deque(const Allocator&);
    explicit deque(size_type n, const Allocator& = Allocator());
    deque(size_type n, const T& value, const Allocator& = Allocator());
    template<class InputIter>
    deque(InputIter first, InputIter last, const Allocator& = Allocator());
    template<container-compatible-range<T> R>
    deque(from_range_t, R&& rg, const Allocator& = Allocator());
    deque(const deque& x);
    deque(deque&&);
    deque(const deque&, const type_identity_t<Allocator>&);
    deque(deque&&, const type_identity_t<Allocator>&);
    deque(initializer_list<T>, const Allocator& = Allocator());
 
    ~deque();
    deque& operator=(const deque& x);
    deque& operator=(deque&& x) noexcept(
      allocator_traits<Allocator>::is_always_equal::value);
    deque& operator=(initializer_list<T>);
    template<class InputIter>
    void assign(InputIter first, InputIter last);
    template<container-compatible-range<T> R>
    void assign_range(R&& rg);
    void assign(size_type n, const T& t);
    void assign(initializer_list<T>);
    allocator_type get_allocator() const noexcept;
 
    // iterators
    iterator begin() noexcept;
    const_iterator begin() const noexcept;
    iterator end() noexcept;
    const_iterator end() const noexcept;
    reverse_iterator rbegin() noexcept;
    const_reverse_iterator rbegin() const noexcept;
    reverse_iterator rend() noexcept;
    const_reverse_iterator rend() const noexcept;
 
    const_iterator cbegin() const noexcept;
    const_iterator cend() const noexcept;
    const_reverse_iterator crbegin() const noexcept;
    const_reverse_iterator crend() const noexcept;
 
    // capacity
    bool empty() const noexcept;
    size_type size() const noexcept;
    size_type max_size() const noexcept;
    void resize(size_type sz);
    void resize(size_type sz, const T& c);
    void shrink_to_fit();
 
    // element access
    reference operator[](size_type n);
    const_reference operator[](size_type n) const;
    reference at(size_type n);
    const_reference at(size_type n) const;
    reference front();
    const_reference front() const;
    reference back();
    const_reference back() const;
 
    // modifiers
    template<class... Args>
    reference emplace_front(Args&&... args);
    template<class... Args>
    reference emplace_back(Args&&... args);
    template<class... Args>
    iterator emplace(const_iterator position, Args&&... args);
 
    void push_front(const T& x);
    void push_front(T&& x);
    template<container-compatible-range<T> R>
    void prepend_range(R&& rg);
    void push_back(const T& x);
    void push_back(T&& x);
    template<container-compatible-range<T> R>
    void append_range(R&& rg);
 
    iterator insert(const_iterator position, const T& x);
    iterator insert(const_iterator position, T&& x);
    iterator insert(const_iterator position, size_type n, const T& x);
    template<class InputIter>
    iterator insert(const_iterator position, InputIter first, InputIter last);
    template<container-compatible-range<T> R>
    iterator insert_range(const_iterator position, R&& rg);
    iterator insert(const_iterator position, initializer_list<T>);
 
    void pop_front();
    void pop_back();
 
    iterator erase(const_iterator position);
    iterator erase(const_iterator first, const_iterator last);
    void swap(deque&) noexcept(allocator_traits<Allocator>::is_always_equal::value);
    void clear() noexcept;
  };
 
  template<class InputIter, class Allocator = allocator</*iter-value-type*/<InputIter>>>
  deque(InputIter, InputIter, Allocator = Allocator())
    -> deque</*iter-value-type*/<InputIter>, Allocator>;
 
  template<ranges::input_range R, class Allocator = allocator<ranges::range_value_t<R>>>
  deque(from_range_t, R&&, Allocator = Allocator())
    -> deque<ranges::range_value_t<R>, Allocator>;
}
Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/header/deque&oldid=164389"