Lines Matching refs:Container

19 template <class T, class Container = deque<T>>
23     typedef Container                                container_type;
72     void swap(queue& q) noexcept(is_nothrow_swappable_v<Container>)
75 template<class Container>
76   queue(Container) -> queue<typename Container::value_type, Container>; // C++17
81 template<class Container, class Allocator>
82   queue(Container, Allocator) -> queue<typename Container::value_type, Container>; // C++17
89 template <class T, class Container>
90   bool operator==(const queue<T, Container>& x,const queue<T, Container>& y);
92 template <class T, class Container>
93   bool operator< (const queue<T, Container>& x,const queue<T, Container>& y);
95 template <class T, class Container>
96   bool operator!=(const queue<T, Container>& x,const queue<T, Container>& y);
98 template <class T, class Container>
99   bool operator> (const queue<T, Container>& x,const queue<T, Container>& y);
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   void swap(queue<T, Container>& x, queue<T, Container>& y)
111 template <class T, class Container = vector<T>,
112           class Compare = less<typename Container::value_type>>
116     typedef Container                                container_type;
128     explicit priority_queue(const Compare& x) : priority_queue(x, Container()) {}
129     priority_queue(const Compare& x, const Container&);
130 …  explicit priority_queue(const Compare& x = Compare(), Container&& = Container()); // before C++20
131     priority_queue(const Compare& x, Container&&); // C++20
137                        const Compare& comp, const Container& c);
140                        const Compare& comp, Container&& c);
146         priority_queue(const Compare& comp, const Container& c,
149         priority_queue(const Compare& comp, Container&& c,
159                        const Compare& comp, const Container& c, const Alloc& a);
162                        const Compare& comp, Container&& c, const Alloc& a);
178         noexcept(is_nothrow_swappable_v<Container> &&
182 template <class Compare, class Container>
183 priority_queue(Compare, Container)
184     -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
188          class Container = vector<iter-value-type<InputIterator>>>
189 priority_queue(InputIterator, InputIterator, Compare = Compare(), Container = Container())
190     -> priority_queue<iter-value-type<InputIterator>, Container, Compare>; // C++17
192 template<class Compare, class Container, class Allocator>
193 priority_queue(Compare, Container, Allocator)
194     -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
207 template<class InputIterator, class Compare, class Container, class Allocator>
208 priority_queue(InputIterator, InputIterator, Compare, Container, Allocator)
209     -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
211 template <class T, class Container, class Compare>
212   void swap(priority_queue<T, Container, Compare>& x,
213             priority_queue<T, Container, Compare>& y)