Lines Matching refs:priority_queue

102 class priority_queue
116     priority_queue() = default;
117     ~priority_queue() = default;
119     priority_queue(const priority_queue& q) = default;
120     priority_queue(priority_queue&& q) = default;
122     priority_queue& operator=(const priority_queue& q) = default;
123     priority_queue& operator=(priority_queue&& q) = default;
125     explicit priority_queue(const Compare& comp);
126     priority_queue(const Compare& comp, const container_type& c);
127     explicit priority_queue(const Compare& comp, container_type&& c);
129         priority_queue(InputIterator first, InputIterator last,
132         priority_queue(InputIterator first, InputIterator last,
135         priority_queue(InputIterator first, InputIterator last,
138         explicit priority_queue(const Alloc& a);
140         priority_queue(const Compare& comp, const Alloc& a);
142         priority_queue(const Compare& comp, const container_type& c,
145         priority_queue(const Compare& comp, container_type&& c,
148         priority_queue(const priority_queue& q, const Alloc& a);
150         priority_queue(priority_queue&& q, const Alloc& a);
161     void swap(priority_queue& q)
167 priority_queue(Compare, Container)
168     -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
173 priority_queue(InputIterator, InputIterator, Compare = Compare(), Container = Container())
174 …-> priority_queue<typename iterator_traits<InputIterator>::value_type, Container, Compare>; // C++…
177 priority_queue(Compare, Container, Allocator)
178     -> priority_queue<typename Container::value_type, Container, Compare>; // C++17
181   void swap(priority_queue<T, Container, Compare>& x,
182             priority_queue<T, Container, Compare>& y)
428 class _LIBCPP_TEMPLATE_VIS priority_queue
445     priority_queue()
451     priority_queue(const priority_queue& __q) : c(__q.c), comp(__q.comp) {}
454     priority_queue& operator=(const priority_queue& __q)
459     priority_queue(priority_queue&& __q)
465     priority_queue& operator=(priority_queue&& __q)
472     explicit priority_queue(const value_compare& __comp)
475     priority_queue(const value_compare& __comp, const container_type& __c);
478     explicit priority_queue(const value_compare& __comp, container_type&& __c);
482         priority_queue(_InputIter __f, _InputIter __l,
486         priority_queue(_InputIter __f, _InputIter __l,
491         priority_queue(_InputIter __f, _InputIter __l,
496         explicit priority_queue(const _Alloc& __a,
501         priority_queue(const value_compare& __comp, const _Alloc& __a,
506         priority_queue(const value_compare& __comp, const container_type& __c,
512         priority_queue(const priority_queue& __q, const _Alloc& __a,
518         priority_queue(const value_compare& __comp, container_type&& __c,
524         priority_queue(priority_queue&& __q, const _Alloc& __a,
549     void swap(priority_queue& __q)
560 priority_queue(_Compare, _Container)
561     -> priority_queue<typename _Container::value_type, _Container, _Compare>;
570 priority_queue(_InputIterator, _InputIterator, _Compare = _Compare(), _Container = _Container())
571     -> priority_queue<typename iterator_traits<_InputIterator>::value_type, _Container, _Compare>;
580 priority_queue(_Compare, _Container, _Alloc)
581     -> priority_queue<typename _Container::value_type, _Container, _Compare>;
586 priority_queue<_Tp, _Container, _Compare>::priority_queue(const _Compare& __comp,
598 priority_queue<_Tp, _Container, _Compare>::priority_queue(const value_compare& __comp,
611 priority_queue<_Tp, _Container, _Compare>::priority_queue(_InputIter __f, _InputIter __l,
622 priority_queue<_Tp, _Container, _Compare>::priority_queue(_InputIter __f, _InputIter __l,
637 priority_queue<_Tp, _Container, _Compare>::priority_queue(_InputIter __f, _InputIter __l,
652 priority_queue<_Tp, _Container, _Compare>::priority_queue(const _Alloc& __a,
662 priority_queue<_Tp, _Container, _Compare>::priority_queue(const value_compare& __comp,
674 priority_queue<_Tp, _Container, _Compare>::priority_queue(const value_compare& __comp,
688 priority_queue<_Tp, _Container, _Compare>::priority_queue(const priority_queue& __q,
703 priority_queue<_Tp, _Container, _Compare>::priority_queue(const value_compare& __comp,
717 priority_queue<_Tp, _Container, _Compare>::priority_queue(priority_queue&& __q,
732 priority_queue<_Tp, _Container, _Compare>::push(const value_type& __v)
743 priority_queue<_Tp, _Container, _Compare>::push(value_type&& __v)
753 priority_queue<_Tp, _Container, _Compare>::emplace(_Args&&... __args)
764 priority_queue<_Tp, _Container, _Compare>::pop()
773 priority_queue<_Tp, _Container, _Compare>::swap(priority_queue& __q)
789 swap(priority_queue<_Tp, _Container, _Compare>& __x,
790      priority_queue<_Tp, _Container, _Compare>& __y)
797 struct _LIBCPP_TEMPLATE_VIS uses_allocator<priority_queue<_Tp, _Container, _Compare>, _Alloc>