Lines Matching full:container

19 template <class T, class Container = deque<T>>
23     typedef Container                                container_type;
46     template<container-compatible-range<T> R> queue(from_range_t, R&& rg); // since C++23
59     template<container-compatible-range<T> R, class Alloc>
72     template<container-compatible-range<T> R>
77     void swap(queue& q) noexcept(is_nothrow_swappable_v<Container>)
80 template<class Container>
81   queue(Container) -> queue<typename Container::value_type, Container>; // C++17
89 template<class Container, class Allocator>
90   queue(Container, Allocator) -> queue<typename Container::value_type, Container>; // C++17
101 template <class T, class Container>
102   bool operator==(const queue<T, Container>& x,const queue<T, Container>& y);
104 template <class T, class Container>
105   bool operator< (const queue<T, Container>& x,const queue<T, Container>& y);
107 template <class T, class Container>
108   bool operator!=(const queue<T, Container>& x,const queue<T, Container>& y);
110 template <class T, class Container>
111   bool operator> (const queue<T, Container>& x,const queue<T, Container>& y);
113 template <class T, class Container>
114   bool operator>=(const queue<T, Container>& x,const queue<T, Container>& y);
116 template <class T, class Container>
117   bool operator<=(const queue<T, Container>& x,const queue<T, Container>& y);
119 template<class T, three_way_comparable Container>
120   compare_three_way_result_t<Container>
121     operator<=>(const queue<T, Container>& x, const queue<T, Container>& y);  // since C++20
123 template <class T, class Container>
124   void swap(queue<T, Container>& x, queue<T, Container>& y)
127 template <class T, class Container = vector<T>,
128           class Compare = less<typename Container::value_type>>
132     typedef Container                                container_type;
144     explicit priority_queue(const Compare& x) : priority_queue(x, Container()) {}
145     priority_queue(const Compare& x, const Container&);
146 …  explicit priority_queue(const Compare& x = Compare(), Container&& = Container()); // before C++20
147     priority_queue(const Compare& x, Container&&); // C++20
153                        const Compare& comp, const Container& c);
156                        const Compare& comp, Container&& c);
157     template <container-compatible-range<T> R>
164         priority_queue(const Compare& comp, const Container& c,
167         priority_queue(const Compare& comp, Container&& c,
177                        const Compare& comp, const Container& c, const Alloc& a);
180                        const Compare& comp, Container&& c, const Alloc& a);
181     template <container-compatible-range<T> R, class Alloc>
183     template <container-compatible-range<T> R, class Alloc>
196     template<container-compatible-range<T> R>
202         noexcept(is_nothrow_swappable_v<Container> &&
206 template <class Compare, class Container>
207 priority_queue(Compare, Container)
208     -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
212          class Container = vector<iter-value-type<InputIterator>>>
213 priority_queue(InputIterator, InputIterator, Compare = Compare(), Container = Container())
214     -> priority_queue<iter-value-type<InputIterator>, Container, Compare>; // C++17
220 template<class Compare, class Container, class Allocator>
221 priority_queue(Compare, Container, Allocator)
222     -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
235 template<class InputIterator, class Compare, class Container, class Allocator>
236 priority_queue(InputIterator, InputIterator, Compare, Container, Allocator)
237     -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
248 template <class T, class Container, class Compare>
249   void swap(priority_queue<T, Container, Compare>& x,
250             priority_queue<T, Container, Compare>& y)