diff options
Diffstat (limited to 'third_party/libcxx/include/c++/v1/queue')
| -rw-r--r-- | third_party/libcxx/include/c++/v1/queue | 981 |
1 files changed, 981 insertions, 0 deletions
diff --git a/third_party/libcxx/include/c++/v1/queue b/third_party/libcxx/include/c++/v1/queue new file mode 100644 index 0000000..a1686bc --- /dev/null +++ b/third_party/libcxx/include/c++/v1/queue @@ -0,0 +1,981 @@ +// -*- C++ -*- +//===----------------------------------------------------------------------===// +// +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. +// See https://llvm.org/LICENSE.txt for license information. +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception +// +//===----------------------------------------------------------------------===// + +#ifndef _LIBCPP_QUEUE +#define _LIBCPP_QUEUE + +/* + queue synopsis + +namespace std +{ + +template <class T, class Container = deque<T>> +class queue +{ +public: + typedef Container container_type; + typedef typename container_type::value_type value_type; + typedef typename container_type::reference reference; + typedef typename container_type::const_reference const_reference; + typedef typename container_type::size_type size_type; + +protected: + container_type c; + +public: + queue() = default; + ~queue() = default; + + queue(const queue& q) = default; + queue(queue&& q) = default; + + queue& operator=(const queue& q) = default; + queue& operator=(queue&& q) = default; + + explicit queue(const container_type& c); + explicit queue(container_type&& c) + template<class InputIterator> + queue(InputIterator first, InputIterator last); // since C++23 + template<container-compatible-range<T> R> queue(from_range_t, R&& rg); // since C++23 + template <class Alloc> + explicit queue(const Alloc& a); + template <class Alloc> + queue(const container_type& c, const Alloc& a); + template <class Alloc> + queue(container_type&& c, const Alloc& a); + template <class Alloc> + queue(const queue& q, const Alloc& a); + template <class Alloc> + queue(queue&& q, const Alloc& a); + template <class InputIterator, class Alloc> + queue(InputIterator first, InputIterator last, const Alloc&); // since C++23 + template<container-compatible-range<T> R, class Alloc> + queue(from_range_t, R&& rg, const Alloc&); // since C++23 + + bool empty() const; + size_type size() const; + + reference front(); + const_reference front() const; + reference back(); + const_reference back() const; + + void push(const value_type& v); + void push(value_type&& v); + template<container-compatible-range<T> R> + void push_range(R&& rg); // C++23 + template <class... Args> reference emplace(Args&&... args); // reference in C++17 + void pop(); + + void swap(queue& q) noexcept(is_nothrow_swappable_v<Container>) +}; + +template<class Container> + queue(Container) -> queue<typename Container::value_type, Container>; // C++17 + +template<class InputIterator> + queue(InputIterator, InputIterator) -> queue<iter-value-type<InputIterator>>; // since C++23 + +template<ranges::input_range R> + queue(from_range_t, R&&) -> queue<ranges::range_value_t<R>>; // since C++23 + +template<class Container, class Allocator> + queue(Container, Allocator) -> queue<typename Container::value_type, Container>; // C++17 + +template<class InputIterator, class Allocator> + queue(InputIterator, InputIterator, Allocator) + -> queue<iter-value-type<InputIterator>, + deque<iter-value-type<InputIterator>, Allocator>>; // since C++23 + +template<ranges::input_range R, class Allocator> + queue(from_range_t, R&&, Allocator) + -> queue<ranges::range_value_t<R>, deque<ranges::range_value_t<R>, Allocator>>; // since C++23 + +template <class T, class Container> + bool operator==(const queue<T, Container>& x,const queue<T, Container>& y); + +template <class T, class Container> + bool operator< (const queue<T, Container>& x,const queue<T, Container>& y); + +template <class T, class Container> + bool operator!=(const queue<T, Container>& x,const queue<T, Container>& y); + +template <class T, class Container> + bool operator> (const queue<T, Container>& x,const queue<T, Container>& y); + +template <class T, class Container> + bool operator>=(const queue<T, Container>& x,const queue<T, Container>& y); + +template <class T, class Container> + bool operator<=(const queue<T, Container>& x,const queue<T, Container>& y); + +template<class T, three_way_comparable Container> + compare_three_way_result_t<Container> + operator<=>(const queue<T, Container>& x, const queue<T, Container>& y); // since C++20 + +template <class T, class Container> + void swap(queue<T, Container>& x, queue<T, Container>& y) + noexcept(noexcept(x.swap(y))); + +template <class T, class Container = vector<T>, + class Compare = less<typename Container::value_type>> +class priority_queue +{ +public: + typedef Container container_type; + typedef typename container_type::value_type value_type; + typedef typename container_type::reference reference; + typedef typename container_type::const_reference const_reference; + typedef typename container_type::size_type size_type; + +protected: + container_type c; + Compare comp; + +public: + priority_queue() : priority_queue(Compare()) {} // C++20 + explicit priority_queue(const Compare& x) : priority_queue(x, Container()) {} + priority_queue(const Compare& x, const Container&); + explicit priority_queue(const Compare& x = Compare(), Container&& = Container()); // before C++20 + priority_queue(const Compare& x, Container&&); // C++20 + template <class InputIterator> + priority_queue(InputIterator first, InputIterator last, + const Compare& comp = Compare()); + template <class InputIterator> + priority_queue(InputIterator first, InputIterator last, + const Compare& comp, const Container& c); + template <class InputIterator> + priority_queue(InputIterator first, InputIterator last, + const Compare& comp, Container&& c); + template <container-compatible-range<T> R> + priority_queue(from_range_t, R&& rg, const Compare& x = Compare()); // since C++23 + template <class Alloc> + explicit priority_queue(const Alloc& a); + template <class Alloc> + priority_queue(const Compare& comp, const Alloc& a); + template <class Alloc> + priority_queue(const Compare& comp, const Container& c, + const Alloc& a); + template <class Alloc> + priority_queue(const Compare& comp, Container&& c, + const Alloc& a); + template <class InputIterator> + priority_queue(InputIterator first, InputIterator last, + const Alloc& a); + template <class InputIterator> + priority_queue(InputIterator first, InputIterator last, + const Compare& comp, const Alloc& a); + template <class InputIterator> + priority_queue(InputIterator first, InputIterator last, + const Compare& comp, const Container& c, const Alloc& a); + template <class InputIterator> + priority_queue(InputIterator first, InputIterator last, + const Compare& comp, Container&& c, const Alloc& a); + template <container-compatible-range<T> R, class Alloc> + priority_queue(from_range_t, R&& rg, const Compare&, const Alloc&); // since C++23 + template <container-compatible-range<T> R, class Alloc> + priority_queue(from_range_t, R&& rg, const Alloc&); // since C++23 + template <class Alloc> + priority_queue(const priority_queue& q, const Alloc& a); + template <class Alloc> + priority_queue(priority_queue&& q, const Alloc& a); + + bool empty() const; + size_type size() const; + const_reference top() const; + + void push(const value_type& v); + void push(value_type&& v); + template<container-compatible-range<T> R> + void push_range(R&& rg); // C++23 + template <class... Args> void emplace(Args&&... args); + void pop(); + + void swap(priority_queue& q) + noexcept(is_nothrow_swappable_v<Container> && + is_nothrow_swappable_v<Comp>) +}; + +template <class Compare, class Container> +priority_queue(Compare, Container) + -> priority_queue<typename Container::value_type, Container, Compare>; // C++17 + +template<class InputIterator, + class Compare = less<iter-value-type<InputIterator>>, + class Container = vector<iter-value-type<InputIterator>>> +priority_queue(InputIterator, InputIterator, Compare = Compare(), Container = Container()) + -> priority_queue<iter-value-type<InputIterator>, Container, Compare>; // C++17 + +template<ranges::input_range R, class Compare = less<ranges::range_value_t<R>>> + priority_queue(from_range_t, R&&, Compare = Compare()) + -> priority_queue<ranges::range_value_t<R>, vector<ranges::range_value_t<R>>, Compare>; // C++23 + +template<class Compare, class Container, class Allocator> +priority_queue(Compare, Container, Allocator) + -> priority_queue<typename Container::value_type, Container, Compare>; // C++17 + +template<class InputIterator, class Allocator> +priority_queue(InputIterator, InputIterator, Allocator) + -> priority_queue<iter-value-type<InputIterator>, + vector<iter-value-type<InputIterator>, Allocator>, + less<iter-value-type<InputIterator>>>; // C++17 + +template<class InputIterator, class Compare, class Allocator> +priority_queue(InputIterator, InputIterator, Compare, Allocator) + -> priority_queue<iter-value-type<InputIterator>, + vector<iter-value-type<InputIterator>, Allocator>, Compare>; // C++17 + +template<class InputIterator, class Compare, class Container, class Allocator> +priority_queue(InputIterator, InputIterator, Compare, Container, Allocator) + -> priority_queue<typename Container::value_type, Container, Compare>; // C++17 + +template<ranges::input_range R, class Compare, class Allocator> + priority_queue(from_range_t, R&&, Compare, Allocator) + -> priority_queue<ranges::range_value_t<R>, vector<ranges::range_value_t<R>, Allocator>, + Compare>; // C++23 + +template<ranges::input_range R, class Allocator> + priority_queue(from_range_t, R&&, Allocator) + -> priority_queue<ranges::range_value_t<R>, vector<ranges::range_value_t<R>, Allocator>>; // C++23 + +template <class T, class Container, class Compare> + void swap(priority_queue<T, Container, Compare>& x, + priority_queue<T, Container, Compare>& y) + noexcept(noexcept(x.swap(y))); + +} // std + +*/ + +#if __cplusplus < 201103L && defined(_LIBCPP_USE_FROZEN_CXX03_HEADERS) +# include <__cxx03/queue> +#else +# include <__algorithm/make_heap.h> +# include <__algorithm/pop_heap.h> +# include <__algorithm/push_heap.h> +# include <__algorithm/ranges_copy.h> +# include <__config> +# include <__functional/operations.h> +# include <__fwd/deque.h> +# include <__fwd/queue.h> +# include <__iterator/back_insert_iterator.h> +# include <__iterator/iterator_traits.h> +# include <__memory/uses_allocator.h> +# include <__ranges/access.h> +# include <__ranges/concepts.h> +# include <__ranges/container_compatible_range.h> +# include <__ranges/from_range.h> +# include <__utility/forward.h> +# include <deque> +# include <vector> +# include <version> + +// standard-mandated includes + +// [queue.syn] +# include <compare> +# include <initializer_list> + +# if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) +# pragma GCC system_header +# endif + +_LIBCPP_PUSH_MACROS +# include <__undef_macros> + +_LIBCPP_BEGIN_NAMESPACE_STD + +template <class _Tp, class _Container> +_LIBCPP_HIDE_FROM_ABI bool operator==(const queue<_Tp, _Container>& __x, const queue<_Tp, _Container>& __y); + +template <class _Tp, class _Container> +_LIBCPP_HIDE_FROM_ABI bool operator<(const queue<_Tp, _Container>& __x, const queue<_Tp, _Container>& __y); + +template <class _Tp, class _Container /*= deque<_Tp>*/> +class queue { +public: + typedef _Container container_type; + typedef typename container_type::value_type value_type; + typedef typename container_type::reference reference; + typedef typename container_type::const_reference const_reference; + typedef typename container_type::size_type size_type; + static_assert(is_same<_Tp, value_type>::value, ""); + +protected: + container_type c; + +public: + _LIBCPP_HIDE_FROM_ABI queue() _NOEXCEPT_(is_nothrow_default_constructible<container_type>::value) : c() {} + + _LIBCPP_HIDE_FROM_ABI queue(const queue& __q) : c(__q.c) {} + +# if _LIBCPP_STD_VER >= 23 + template <class _InputIterator, __enable_if_t<__has_input_iterator_category<_InputIterator>::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI queue(_InputIterator __first, _InputIterator __last) : c(__first, __last) {} + + template <_ContainerCompatibleRange<_Tp> _Range> + _LIBCPP_HIDE_FROM_ABI queue(from_range_t, _Range&& __range) : c(from_range, std::forward<_Range>(__range)) {} + + template <class _InputIterator, + class _Alloc, + __enable_if_t<__has_input_iterator_category<_InputIterator>::value, int> = 0, + __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI queue(_InputIterator __first, _InputIterator __second, const _Alloc& __alloc) + : c(__first, __second, __alloc) {} + + template <_ContainerCompatibleRange<_Tp> _Range, + class _Alloc, + __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI queue(from_range_t, _Range&& __range, const _Alloc& __alloc) + : c(from_range, std::forward<_Range>(__range), __alloc) {} + +# endif + + _LIBCPP_HIDE_FROM_ABI queue& operator=(const queue& __q) { + c = __q.c; + return *this; + } + +# ifndef _LIBCPP_CXX03_LANG + _LIBCPP_HIDE_FROM_ABI queue(queue&& __q) noexcept(is_nothrow_move_constructible<container_type>::value) + : c(std::move(__q.c)) {} + + _LIBCPP_HIDE_FROM_ABI queue& operator=(queue&& __q) noexcept(is_nothrow_move_assignable<container_type>::value) { + c = std::move(__q.c); + return *this; + } +# endif // _LIBCPP_CXX03_LANG + + _LIBCPP_HIDE_FROM_ABI explicit queue(const container_type& __c) : c(__c) {} +# ifndef _LIBCPP_CXX03_LANG + _LIBCPP_HIDE_FROM_ABI explicit queue(container_type&& __c) : c(std::move(__c)) {} +# endif // _LIBCPP_CXX03_LANG + + template <class _Alloc, __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI explicit queue(const _Alloc& __a) : c(__a) {} + + template <class _Alloc, __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI queue(const queue& __q, const _Alloc& __a) : c(__q.c, __a) {} + + template <class _Alloc, __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI queue(const container_type& __c, const _Alloc& __a) : c(__c, __a) {} + +# ifndef _LIBCPP_CXX03_LANG + template <class _Alloc, __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI queue(container_type&& __c, const _Alloc& __a) : c(std::move(__c), __a) {} + + template <class _Alloc, __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI queue(queue&& __q, const _Alloc& __a) : c(std::move(__q.c), __a) {} +# endif // _LIBCPP_CXX03_LANG + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI bool empty() const { return c.empty(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI size_type size() const { return c.size(); } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI reference front() { return c.front(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_reference front() const { return c.front(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI reference back() { return c.back(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_reference back() const { return c.back(); } + + _LIBCPP_HIDE_FROM_ABI void push(const value_type& __v) { c.push_back(__v); } +# ifndef _LIBCPP_CXX03_LANG + _LIBCPP_HIDE_FROM_ABI void push(value_type&& __v) { c.push_back(std::move(__v)); } + +# if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange<_Tp> _Range> + _LIBCPP_HIDE_FROM_ABI void push_range(_Range&& __range) { + if constexpr (requires(container_type& __c) { __c.append_range(std::forward<_Range>(__range)); }) { + c.append_range(std::forward<_Range>(__range)); + } else { + ranges::copy(std::forward<_Range>(__range), std::back_inserter(c)); + } + } +# endif + + template <class... _Args> + _LIBCPP_HIDE_FROM_ABI +# if _LIBCPP_STD_VER >= 17 + decltype(auto) + emplace(_Args&&... __args) { + return c.emplace_back(std::forward<_Args>(__args)...); + } +# else + void + emplace(_Args&&... __args) { + c.emplace_back(std::forward<_Args>(__args)...); + } +# endif +# endif // _LIBCPP_CXX03_LANG + _LIBCPP_HIDE_FROM_ABI void pop() { c.pop_front(); } + + _LIBCPP_HIDE_FROM_ABI void swap(queue& __q) _NOEXCEPT_(__is_nothrow_swappable_v<container_type>) { + using std::swap; + swap(c, __q.c); + } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const _Container& __get_container() const { return c; } + + template <class _T1, class _OtherContainer> + friend _LIBCPP_HIDE_FROM_ABI bool + operator==(const queue<_T1, _OtherContainer>& __x, const queue<_T1, _OtherContainer>& __y); + + template <class _T1, class _OtherContainer> + friend _LIBCPP_HIDE_FROM_ABI bool + operator<(const queue<_T1, _OtherContainer>& __x, const queue<_T1, _OtherContainer>& __y); + +# if _LIBCPP_STD_VER >= 20 + template <class _T1, three_way_comparable _OtherContainer> + friend _LIBCPP_HIDE_FROM_ABI compare_three_way_result_t<_OtherContainer> + operator<=>(const queue<_T1, _OtherContainer>& __x, const queue<_T1, _OtherContainer>& __y); +# endif +}; + +# if _LIBCPP_STD_VER >= 17 +template <class _Container, class = enable_if_t<!__is_allocator_v<_Container>>> +queue(_Container) -> queue<typename _Container::value_type, _Container>; + +template <class _Container, + class _Alloc, + class = enable_if_t<!__is_allocator_v<_Container>>, + class = enable_if_t<uses_allocator<_Container, _Alloc>::value> > +queue(_Container, _Alloc) -> queue<typename _Container::value_type, _Container>; +# endif + +# if _LIBCPP_STD_VER >= 23 +template <class _InputIterator, __enable_if_t<__has_input_iterator_category<_InputIterator>::value, int> = 0> +queue(_InputIterator, _InputIterator) -> queue<__iterator_value_type<_InputIterator>>; + +template <ranges::input_range _Range> +queue(from_range_t, _Range&&) -> queue<ranges::range_value_t<_Range>>; + +template <class _InputIterator, + class _Alloc, + __enable_if_t<__has_input_iterator_category<_InputIterator>::value, int> = 0, + __enable_if_t<__is_allocator_v<_Alloc>, int> = 0> +queue(_InputIterator, _InputIterator, _Alloc) + -> queue<__iterator_value_type<_InputIterator>, deque<__iterator_value_type<_InputIterator>, _Alloc>>; + +template <ranges::input_range _Range, class _Alloc, __enable_if_t<__is_allocator_v<_Alloc>, int> = 0> +queue(from_range_t, _Range&&, _Alloc) + -> queue<ranges::range_value_t<_Range>, deque<ranges::range_value_t<_Range>, _Alloc>>; +# endif + +template <class _Tp, class _Container> +inline _LIBCPP_HIDE_FROM_ABI bool operator==(const queue<_Tp, _Container>& __x, const queue<_Tp, _Container>& __y) { + return __x.c == __y.c; +} + +template <class _Tp, class _Container> +inline _LIBCPP_HIDE_FROM_ABI bool operator<(const queue<_Tp, _Container>& __x, const queue<_Tp, _Container>& __y) { + return __x.c < __y.c; +} + +template <class _Tp, class _Container> +inline _LIBCPP_HIDE_FROM_ABI bool operator!=(const queue<_Tp, _Container>& __x, const queue<_Tp, _Container>& __y) { + return !(__x == __y); +} + +template <class _Tp, class _Container> +inline _LIBCPP_HIDE_FROM_ABI bool operator>(const queue<_Tp, _Container>& __x, const queue<_Tp, _Container>& __y) { + return __y < __x; +} + +template <class _Tp, class _Container> +inline _LIBCPP_HIDE_FROM_ABI bool operator>=(const queue<_Tp, _Container>& __x, const queue<_Tp, _Container>& __y) { + return !(__x < __y); +} + +template <class _Tp, class _Container> +inline _LIBCPP_HIDE_FROM_ABI bool operator<=(const queue<_Tp, _Container>& __x, const queue<_Tp, _Container>& __y) { + return !(__y < __x); +} + +# if _LIBCPP_STD_VER >= 20 + +template <class _Tp, three_way_comparable _Container> +_LIBCPP_HIDE_FROM_ABI compare_three_way_result_t<_Container> +operator<=>(const queue<_Tp, _Container>& __x, const queue<_Tp, _Container>& __y) { + return __x.c <=> __y.c; +} + +# endif + +template <class _Tp, class _Container, __enable_if_t<__is_swappable_v<_Container>, int> = 0> +inline _LIBCPP_HIDE_FROM_ABI void swap(queue<_Tp, _Container>& __x, queue<_Tp, _Container>& __y) + _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) { + __x.swap(__y); +} + +template <class _Tp, class _Container, class _Alloc> +struct uses_allocator<queue<_Tp, _Container>, _Alloc> : public uses_allocator<_Container, _Alloc> {}; + +template <class _Tp, class _Container, class _Compare> +class priority_queue { +public: + typedef _Container container_type; + typedef _Compare value_compare; + typedef typename container_type::value_type value_type; + typedef typename container_type::reference reference; + typedef typename container_type::const_reference const_reference; + typedef typename container_type::size_type size_type; + static_assert(is_same<_Tp, value_type>::value, ""); + +protected: + container_type c; + value_compare comp; + +public: + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI priority_queue() _NOEXCEPT_( + is_nothrow_default_constructible<container_type>::value&& is_nothrow_default_constructible<value_compare>::value) + : c(), comp() {} + + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI priority_queue(const priority_queue& __q) + : c(__q.c), comp(__q.comp) {} + + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI priority_queue& operator=(const priority_queue& __q) { + c = __q.c; + comp = __q.comp; + return *this; + } + +# ifndef _LIBCPP_CXX03_LANG + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI priority_queue(priority_queue&& __q) noexcept( + is_nothrow_move_constructible<container_type>::value && is_nothrow_move_constructible<value_compare>::value) + : c(std::move(__q.c)), comp(std::move(__q.comp)) {} + + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI priority_queue& operator=(priority_queue&& __q) noexcept( + is_nothrow_move_assignable<container_type>::value && is_nothrow_move_assignable<value_compare>::value) { + c = std::move(__q.c); + comp = std::move(__q.comp); + return *this; + } +# endif // _LIBCPP_CXX03_LANG + + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI explicit priority_queue(const value_compare& __comp) + : c(), comp(__comp) {} + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI + priority_queue(const value_compare& __comp, const container_type& __c); +# ifndef _LIBCPP_CXX03_LANG + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI priority_queue(const value_compare& __comp, container_type&& __c); +# endif + template <class _InputIter, __enable_if_t<__has_input_iterator_category<_InputIter>::value, int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI + priority_queue(_InputIter __f, _InputIter __l, const value_compare& __comp = value_compare()); + + template <class _InputIter, __enable_if_t<__has_input_iterator_category<_InputIter>::value, int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI + priority_queue(_InputIter __f, _InputIter __l, const value_compare& __comp, const container_type& __c); + +# ifndef _LIBCPP_CXX03_LANG + template <class _InputIter, __enable_if_t<__has_input_iterator_category<_InputIter>::value, int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI + priority_queue(_InputIter __f, _InputIter __l, const value_compare& __comp, container_type&& __c); +# endif // _LIBCPP_CXX03_LANG + +# if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange<_Tp> _Range> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI + priority_queue(from_range_t, _Range&& __range, const value_compare& __comp = value_compare()) + : c(from_range, std::forward<_Range>(__range)), comp(__comp) { + std::make_heap(c.begin(), c.end(), comp); + } +# endif + + template <class _Alloc, __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI explicit priority_queue(const _Alloc& __a); + + template <class _Alloc, __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI priority_queue(const value_compare& __comp, const _Alloc& __a); + + template <class _Alloc, __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI + priority_queue(const value_compare& __comp, const container_type& __c, const _Alloc& __a); + + template <class _Alloc, __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI priority_queue(const priority_queue& __q, const _Alloc& __a); + +# ifndef _LIBCPP_CXX03_LANG + template <class _Alloc, __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI + priority_queue(const value_compare& __comp, container_type&& __c, const _Alloc& __a); + + template <class _Alloc, __enable_if_t<uses_allocator<container_type, _Alloc>::value, int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI priority_queue(priority_queue&& __q, const _Alloc& __a); +# endif // _LIBCPP_CXX03_LANG + + template < + class _InputIter, + class _Alloc, + __enable_if_t<__has_input_iterator_category<_InputIter>::value && uses_allocator<container_type, _Alloc>::value, + int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI priority_queue(_InputIter __f, _InputIter __l, const _Alloc& __a); + + template < + class _InputIter, + class _Alloc, + __enable_if_t<__has_input_iterator_category<_InputIter>::value && uses_allocator<container_type, _Alloc>::value, + int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI + priority_queue(_InputIter __f, _InputIter __l, const value_compare& __comp, const _Alloc& __a); + + template < + class _InputIter, + class _Alloc, + __enable_if_t<__has_input_iterator_category<_InputIter>::value && uses_allocator<container_type, _Alloc>::value, + int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI priority_queue( + _InputIter __f, _InputIter __l, const value_compare& __comp, const container_type& __c, const _Alloc& __a); + +# ifndef _LIBCPP_CXX03_LANG + template < + class _InputIter, + class _Alloc, + __enable_if_t<__has_input_iterator_category<_InputIter>::value && uses_allocator<container_type, _Alloc>::value, + int> = 0> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI + priority_queue(_InputIter __f, _InputIter __l, const value_compare& __comp, container_type&& __c, const _Alloc& __a); +# endif // _LIBCPP_CXX03_LANG + +# if _LIBCPP_STD_VER >= 23 + + template <_ContainerCompatibleRange<_Tp> _Range, + class _Alloc, + class = enable_if_t<uses_allocator<_Container, _Alloc>::value>> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI + priority_queue(from_range_t, _Range&& __range, const value_compare& __comp, const _Alloc& __a) + : c(from_range, std::forward<_Range>(__range), __a), comp(__comp) { + std::make_heap(c.begin(), c.end(), comp); + } + + template <_ContainerCompatibleRange<_Tp> _Range, + class _Alloc, + class = enable_if_t<uses_allocator<_Container, _Alloc>::value>> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI priority_queue(from_range_t, _Range&& __range, const _Alloc& __a) + : c(from_range, std::forward<_Range>(__range), __a), comp() { + std::make_heap(c.begin(), c.end(), comp); + } + +# endif + + [[__nodiscard__]] _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI bool empty() const { return c.empty(); } + [[__nodiscard__]] _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI size_type size() const { return c.size(); } + [[__nodiscard__]] _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI const_reference top() const { + return c.front(); + } + + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI void push(const value_type& __v); +# ifndef _LIBCPP_CXX03_LANG + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI void push(value_type&& __v); + +# if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange<_Tp> _Range> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI void push_range(_Range&& __range) { + if constexpr (requires(container_type& __c) { __c.append_range(std::forward<_Range>(__range)); }) { + c.append_range(std::forward<_Range>(__range)); + } else { + ranges::copy(std::forward<_Range>(__range), std::back_inserter(c)); + } + + std::make_heap(c.begin(), c.end(), comp); + } +# endif + + template <class... _Args> + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI void emplace(_Args&&... __args); +# endif // _LIBCPP_CXX03_LANG + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI void pop(); + + _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI void swap(priority_queue& __q) + _NOEXCEPT_(__is_nothrow_swappable_v<container_type>&& __is_nothrow_swappable_v<value_compare>); + + [[__nodiscard__]] _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI const _Container& __get_container() const { + return c; + } +}; + +# if _LIBCPP_STD_VER >= 17 +template <class _Compare, + class _Container, + class = enable_if_t<!__is_allocator_v<_Compare>>, + class = enable_if_t<!__is_allocator_v<_Container>>> +priority_queue(_Compare, _Container) -> priority_queue<typename _Container::value_type, _Container, _Compare>; + +template <class _InputIterator, + class _Compare = less<__iterator_value_type<_InputIterator>>, + class _Container = vector<__iterator_value_type<_InputIterator>>, + class = enable_if_t<__has_input_iterator_category<_InputIterator>::value>, + class = enable_if_t<!__is_allocator_v<_Compare>>, + class = enable_if_t<!__is_allocator_v<_Container>>> +priority_queue(_InputIterator, _InputIterator, _Compare = _Compare(), _Container = _Container()) + -> priority_queue<__iterator_value_type<_InputIterator>, _Container, _Compare>; + +template <class _Compare, + class _Container, + class _Alloc, + class = enable_if_t<!__is_allocator_v<_Compare>>, + class = enable_if_t<!__is_allocator_v<_Container>>, + class = enable_if_t<uses_allocator<_Container, _Alloc>::value>> +priority_queue(_Compare, _Container, _Alloc) -> priority_queue<typename _Container::value_type, _Container, _Compare>; + +template <class _InputIterator, + class _Allocator, + class = enable_if_t<__has_input_iterator_category<_InputIterator>::value>, + class = enable_if_t<__is_allocator_v<_Allocator>>> +priority_queue(_InputIterator, _InputIterator, _Allocator) + -> priority_queue<__iterator_value_type<_InputIterator>, + vector<__iterator_value_type<_InputIterator>, _Allocator>, + less<__iterator_value_type<_InputIterator>>>; + +template <class _InputIterator, + class _Compare, + class _Allocator, + class = enable_if_t<__has_input_iterator_category<_InputIterator>::value>, + class = enable_if_t<!__is_allocator_v<_Compare>>, + class = enable_if_t<__is_allocator_v<_Allocator>>> +priority_queue(_InputIterator, _InputIterator, _Compare, _Allocator) + -> priority_queue<__iterator_value_type<_InputIterator>, + vector<__iterator_value_type<_InputIterator>, _Allocator>, + _Compare>; + +template <class _InputIterator, + class _Compare, + class _Container, + class _Alloc, + class = enable_if_t<__has_input_iterator_category<_InputIterator>::value>, + class = enable_if_t<!__is_allocator_v<_Compare>>, + class = enable_if_t<!__is_allocator_v<_Container>>, + class = enable_if_t<uses_allocator<_Container, _Alloc>::value> > +priority_queue(_InputIterator, _InputIterator, _Compare, _Container, _Alloc) + -> priority_queue<typename _Container::value_type, _Container, _Compare>; +# endif + +# if _LIBCPP_STD_VER >= 23 + +template <ranges::input_range _Range, + class _Compare = less<ranges::range_value_t<_Range>>, + class = enable_if_t<!__is_allocator_v<_Compare>>> +priority_queue(from_range_t, _Range&&, _Compare = _Compare()) + -> priority_queue<ranges::range_value_t<_Range>, vector<ranges::range_value_t<_Range>>, _Compare>; + +template <ranges::input_range _Range, + class _Compare, + class _Alloc, + class = enable_if_t<!__is_allocator_v<_Compare>>, + class = enable_if_t<__is_allocator_v<_Alloc>>> +priority_queue(from_range_t, _Range&&, _Compare, _Alloc) + -> priority_queue<ranges::range_value_t<_Range>, vector<ranges::range_value_t<_Range>, _Alloc>, _Compare>; + +template <ranges::input_range _Range, class _Alloc, class = enable_if_t<__is_allocator_v<_Alloc>>> +priority_queue(from_range_t, _Range&&, _Alloc) + -> priority_queue<ranges::range_value_t<_Range>, vector<ranges::range_value_t<_Range>, _Alloc>>; + +# endif + +template <class _Tp, class _Container, class _Compare> +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + const _Compare& __comp, const container_type& __c) + : c(__c), comp(__comp) { + std::make_heap(c.begin(), c.end(), comp); +} + +# ifndef _LIBCPP_CXX03_LANG + +template <class _Tp, class _Container, class _Compare> +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + const value_compare& __comp, container_type&& __c) + : c(std::move(__c)), comp(__comp) { + std::make_heap(c.begin(), c.end(), comp); +} + +# endif // _LIBCPP_CXX03_LANG + +template <class _Tp, class _Container, class _Compare> +template <class _InputIter, __enable_if_t<__has_input_iterator_category<_InputIter>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + _InputIter __f, _InputIter __l, const value_compare& __comp) + : c(__f, __l), comp(__comp) { + std::make_heap(c.begin(), c.end(), comp); +} + +template <class _Tp, class _Container, class _Compare> +template <class _InputIter, __enable_if_t<__has_input_iterator_category<_InputIter>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + _InputIter __f, _InputIter __l, const value_compare& __comp, const container_type& __c) + : c(__c), comp(__comp) { + c.insert(c.end(), __f, __l); + std::make_heap(c.begin(), c.end(), comp); +} + +# ifndef _LIBCPP_CXX03_LANG + +template <class _Tp, class _Container, class _Compare> +template <class _InputIter, __enable_if_t<__has_input_iterator_category<_InputIter>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + _InputIter __f, _InputIter __l, const value_compare& __comp, container_type&& __c) + : c(std::move(__c)), comp(__comp) { + c.insert(c.end(), __f, __l); + std::make_heap(c.begin(), c.end(), comp); +} + +# endif // _LIBCPP_CXX03_LANG + +template <class _Tp, class _Container, class _Compare> +template <class _Alloc, __enable_if_t<uses_allocator<_Container, _Alloc>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue(const _Alloc& __a) + : c(__a) {} + +template <class _Tp, class _Container, class _Compare> +template <class _Alloc, __enable_if_t<uses_allocator<_Container, _Alloc>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + const value_compare& __comp, const _Alloc& __a) + : c(__a), comp(__comp) {} + +template <class _Tp, class _Container, class _Compare> +template <class _Alloc, __enable_if_t<uses_allocator<_Container, _Alloc>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + const value_compare& __comp, const container_type& __c, const _Alloc& __a) + : c(__c, __a), comp(__comp) { + std::make_heap(c.begin(), c.end(), comp); +} + +template <class _Tp, class _Container, class _Compare> +template <class _Alloc, __enable_if_t<uses_allocator<_Container, _Alloc>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + const priority_queue& __q, const _Alloc& __a) + : c(__q.c, __a), comp(__q.comp) {} + +# ifndef _LIBCPP_CXX03_LANG + +template <class _Tp, class _Container, class _Compare> +template <class _Alloc, __enable_if_t<uses_allocator<_Container, _Alloc>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + const value_compare& __comp, container_type&& __c, const _Alloc& __a) + : c(std::move(__c), __a), comp(__comp) { + std::make_heap(c.begin(), c.end(), comp); +} + +template <class _Tp, class _Container, class _Compare> +template <class _Alloc, __enable_if_t<uses_allocator<_Container, _Alloc>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + priority_queue&& __q, const _Alloc& __a) + : c(std::move(__q.c), __a), comp(std::move(__q.comp)) {} + +# endif // _LIBCPP_CXX03_LANG + +template <class _Tp, class _Container, class _Compare> +template < + class _InputIter, + class _Alloc, + __enable_if_t<__has_input_iterator_category<_InputIter>::value && uses_allocator<_Container, _Alloc>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + _InputIter __f, _InputIter __l, const _Alloc& __a) + : c(__f, __l, __a), comp() { + std::make_heap(c.begin(), c.end(), comp); +} + +template <class _Tp, class _Container, class _Compare> +template < + class _InputIter, + class _Alloc, + __enable_if_t<__has_input_iterator_category<_InputIter>::value && uses_allocator<_Container, _Alloc>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + _InputIter __f, _InputIter __l, const value_compare& __comp, const _Alloc& __a) + : c(__f, __l, __a), comp(__comp) { + std::make_heap(c.begin(), c.end(), comp); +} + +template <class _Tp, class _Container, class _Compare> +template < + class _InputIter, + class _Alloc, + __enable_if_t<__has_input_iterator_category<_InputIter>::value && uses_allocator<_Container, _Alloc>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + _InputIter __f, _InputIter __l, const value_compare& __comp, const container_type& __c, const _Alloc& __a) + : c(__c, __a), comp(__comp) { + c.insert(c.end(), __f, __l); + std::make_heap(c.begin(), c.end(), comp); +} + +# ifndef _LIBCPP_CXX03_LANG +template <class _Tp, class _Container, class _Compare> +template < + class _InputIter, + class _Alloc, + __enable_if_t<__has_input_iterator_category<_InputIter>::value && uses_allocator<_Container, _Alloc>::value, int> > +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline priority_queue<_Tp, _Container, _Compare>::priority_queue( + _InputIter __f, _InputIter __l, const value_compare& __comp, container_type&& __c, const _Alloc& __a) + : c(std::move(__c), __a), comp(__comp) { + c.insert(c.end(), __f, __l); + std::make_heap(c.begin(), c.end(), comp); +} +# endif // _LIBCPP_CXX03_LANG + +template <class _Tp, class _Container, class _Compare> +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline void priority_queue<_Tp, _Container, _Compare>::push(const value_type& __v) { + c.push_back(__v); + std::push_heap(c.begin(), c.end(), comp); +} + +# ifndef _LIBCPP_CXX03_LANG + +template <class _Tp, class _Container, class _Compare> +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline void priority_queue<_Tp, _Container, _Compare>::push(value_type&& __v) { + c.push_back(std::move(__v)); + std::push_heap(c.begin(), c.end(), comp); +} + +template <class _Tp, class _Container, class _Compare> +template <class... _Args> +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline void priority_queue<_Tp, _Container, _Compare>::emplace(_Args&&... __args) { + c.emplace_back(std::forward<_Args>(__args)...); + std::push_heap(c.begin(), c.end(), comp); +} + +# endif // _LIBCPP_CXX03_LANG + +template <class _Tp, class _Container, class _Compare> +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline void priority_queue<_Tp, _Container, _Compare>::pop() { + std::pop_heap(c.begin(), c.end(), comp); + c.pop_back(); +} + +template <class _Tp, class _Container, class _Compare> +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline void priority_queue<_Tp, _Container, _Compare>::swap(priority_queue& __q) + _NOEXCEPT_(__is_nothrow_swappable_v<container_type>&& __is_nothrow_swappable_v<value_compare>) { + using std::swap; + swap(c, __q.c); + swap(comp, __q.comp); +} + +template <class _Tp, + class _Container, + class _Compare, + __enable_if_t<__is_swappable_v<_Container> && __is_swappable_v<_Compare>, int> = 0> +_LIBCPP_CONSTEXPR_SINCE_CXX26 inline _LIBCPP_HIDE_FROM_ABI void +swap(priority_queue<_Tp, _Container, _Compare>& __x, priority_queue<_Tp, _Container, _Compare>& __y) + _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) { + __x.swap(__y); +} + +template <class _Tp, class _Container, class _Compare, class _Alloc> +struct uses_allocator<priority_queue<_Tp, _Container, _Compare>, _Alloc> : public uses_allocator<_Container, _Alloc> {}; + +_LIBCPP_END_NAMESPACE_STD + +_LIBCPP_POP_MACROS + +# if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20 +# include <concepts> +# include <cstdlib> +# include <functional> +# include <type_traits> +# endif +#endif // __cplusplus < 201103L && defined(_LIBCPP_USE_FROZEN_CXX03_HEADERS) + +#endif // _LIBCPP_QUEUE |