Lines Matching full:compare

128           class Compare = less<typename Container::value_type>>
140     Compare comp;
143     priority_queue() : priority_queue(Compare()) {} // C++20
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
150                        const Compare& comp = Compare());
153                        const Compare& comp, const Container& c);
156                        const Compare& comp, Container&& c);
158         priority_queue(from_range_t, R&& rg, const Compare& x = Compare()); // since C++23
162         priority_queue(const Compare& comp, const Alloc& a);
164         priority_queue(const Compare& comp, const Container& c,
167         priority_queue(const Compare& comp, Container&& c,
174                        const Compare& comp, const Alloc& a);
177                        const Compare& comp, const Container& c, const Alloc& a);
180                        const Compare& comp, Container&& c, const Alloc& a);
182       priority_queue(from_range_t, R&& rg, const Compare&, const Alloc&); // since C++23
206 template <class Compare, class Container>
207 priority_queue(Compare, Container)
208     -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
211          class Compare = less<iter-value-type<InputIterator>>,
213 priority_queue(InputIterator, InputIterator, Compare = Compare(), Container = Container())
214     -> priority_queue<iter-value-type<InputIterator>, Container, Compare>; // C++17
216 template<ranges::input_range R, class Compare = less<ranges::range_value_t<R>>>
217   priority_queue(from_range_t, R&&, Compare = Compare())
218     -> priority_queue<ranges::range_value_t<R>, vector<ranges::range_value_t<R>>, Compare>; // C++23
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
230 template<class InputIterator, class Compare, class Allocator>
231 priority_queue(InputIterator, InputIterator, Compare, Allocator)
233                       vector<iter-value-type<InputIterator>, Allocator>, 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
239 template<ranges::input_range R, class Compare, class Allocator>
240   priority_queue(from_range_t, R&&, Compare, Allocator)
242                         Compare>; // C++23
248 template <class T, class Container, class Compare>
249   void swap(priority_queue<T, Container, Compare>& x,
250             priority_queue<T, Container, Compare>& y)
280 #include <compare>