Lines Matching refs:Container

19 template <class T, class Container = deque<T>>
23     typedef Container                                container_type;
68     void swap(queue& q) noexcept(is_nothrow_swappable_v<Container>)
71 template<class Container>
72   queue(Container) -> queue<typename Container::value_type, Container>; // C++17
74 template<class Container, class Allocator>
75   queue(Container, Allocator) -> queue<typename Container::value_type, Container>; // C++17
77 template <class T, class Container>
78   bool operator==(const queue<T, Container>& x,const queue<T, Container>& y);
80 template <class T, class Container>
81   bool operator< (const queue<T, Container>& x,const queue<T, Container>& y);
83 template <class T, class Container>
84   bool operator!=(const queue<T, Container>& x,const queue<T, Container>& y);
86 template <class T, class Container>
87   bool operator> (const queue<T, Container>& x,const queue<T, Container>& y);
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   void swap(queue<T, Container>& x, queue<T, Container>& y)
99 template <class T, class Container = vector<T>,
100           class Compare = less<typename Container::value_type>>
104     typedef Container                                container_type;
116     explicit priority_queue(const Compare& x) : priority_queue(x, Container()) {}
117     priority_queue(const Compare& x, const Container&);
118     explicit priority_queue(const Compare& x = Compare(), Container&&= Container()); // before C++20
119     priority_queue(const Compare& x, Container&&); // C++20
154         noexcept(is_nothrow_swappable_v<Container> &&
158 template <class Compare, class Container>
159 priority_queue(Compare, Container)
160     -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
164          class Container = vector<typename iterator_traits<InputIterator>::value_type>>
165 priority_queue(InputIterator, InputIterator, Compare = Compare(), Container = Container())
166 …-> priority_queue<typename iterator_traits<InputIterator>::value_type, Container, Compare>; // C++…
168 template<class Compare, class Container, class Allocator>
169 priority_queue(Compare, Container, Allocator)
170     -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
172 template <class T, class Container, class Compare>
173   void swap(priority_queue<T, Container, Compare>& x,
174             priority_queue<T, Container, Compare>& y)