mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2024-11-23 13:50:11 +00:00
9783f28cbb
This patch runs clang-format on all of libcxx/include and libcxx/src, in
accordance with the RFC discussed at [1]. Follow-up patches will format
the benchmarks, the test suite and remaining parts of the code. I'm
splitting this one into its own patch so the diff is a bit easier to
review.
This patch was generated with:
find libcxx/include libcxx/src -type f \
| grep -v 'module.modulemap.in' \
| grep -v 'CMakeLists.txt' \
| grep -v 'README.txt' \
| grep -v 'libcxx.imp' \
| grep -v '__config_site.in' \
| xargs clang-format -i
A Git merge driver is available in libcxx/utils/clang-format-merge-driver.sh
to help resolve merge and rebase issues across these formatting changes.
[1]: https://discourse.llvm.org/t/rfc-clang-formatting-all-of-libc-once-and-for-all
982 lines
39 KiB
C++
982 lines
39 KiB
C++
// -*- 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
|
|
|
|
*/
|
|
|
|
#include <__algorithm/make_heap.h>
|
|
#include <__algorithm/pop_heap.h>
|
|
#include <__algorithm/push_heap.h>
|
|
#include <__algorithm/ranges_copy.h>
|
|
#include <__assert> // all public C++ headers provide the assertion handler
|
|
#include <__config>
|
|
#include <__functional/operations.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_BEGIN_NAMESPACE_STD
|
|
|
|
template <class _Tp, class _Container = deque<_Tp> >
|
|
class _LIBCPP_TEMPLATE_VIS queue;
|
|
|
|
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 _LIBCPP_TEMPLATE_VIS 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, class = __enable_if_t<__has_input_iterator_category<_InputIterator>::value>>
|
|
_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,
|
|
class = __enable_if_t<__has_input_iterator_category<_InputIterator>::value>,
|
|
class = __enable_if_t<uses_allocator<container_type, _Alloc>::value>>
|
|
_LIBCPP_HIDE_FROM_ABI queue(_InputIterator __first, _InputIterator __second, const _Alloc& __alloc)
|
|
: c(__first, __second, __alloc) {}
|
|
|
|
template <_ContainerCompatibleRange<_Tp> _Range,
|
|
class _Alloc,
|
|
class = __enable_if_t<uses_allocator<container_type, _Alloc>::value>>
|
|
_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>
|
|
_LIBCPP_HIDE_FROM_ABI explicit queue(const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
|
|
: c(__a) {}
|
|
template <class _Alloc>
|
|
_LIBCPP_HIDE_FROM_ABI
|
|
queue(const queue& __q, const _Alloc& __a, __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
|
|
: c(__q.c, __a) {}
|
|
template <class _Alloc>
|
|
_LIBCPP_HIDE_FROM_ABI
|
|
queue(const container_type& __c, const _Alloc& __a, __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
|
|
: c(__c, __a) {}
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
template <class _Alloc>
|
|
_LIBCPP_HIDE_FROM_ABI
|
|
queue(container_type&& __c, const _Alloc& __a, __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
|
|
: c(std::move(__c), __a) {}
|
|
template <class _Alloc>
|
|
_LIBCPP_HIDE_FROM_ABI
|
|
queue(queue&& __q, const _Alloc& __a, __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0)
|
|
: c(std::move(__q.c), __a) {}
|
|
|
|
#endif // _LIBCPP_CXX03_LANG
|
|
|
|
_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI bool empty() const { return c.empty(); }
|
|
_LIBCPP_HIDE_FROM_ABI size_type size() const { return c.size(); }
|
|
|
|
_LIBCPP_HIDE_FROM_ABI reference front() { return c.front(); }
|
|
_LIBCPP_HIDE_FROM_ABI const_reference front() const { return c.front(); }
|
|
_LIBCPP_HIDE_FROM_ABI reference back() { return c.back(); }
|
|
_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<container_type>::value) {
|
|
using std::swap;
|
|
swap(c, __q.c);
|
|
}
|
|
|
|
_LIBCPP_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 >= 17
|
|
template <class _Container, class = enable_if_t<!__is_allocator<_Container>::value> >
|
|
queue(_Container) -> queue<typename _Container::value_type, _Container>;
|
|
|
|
template <class _Container,
|
|
class _Alloc,
|
|
class = enable_if_t<!__is_allocator<_Container>::value>,
|
|
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, class = __enable_if_t<__has_input_iterator_category<_InputIterator>::value>>
|
|
queue(_InputIterator, _InputIterator) -> queue<__iter_value_type<_InputIterator>>;
|
|
|
|
template <ranges::input_range _Range>
|
|
queue(from_range_t, _Range&&) -> queue<ranges::range_value_t<_Range>>;
|
|
|
|
template <class _InputIterator,
|
|
class _Alloc,
|
|
class = __enable_if_t<__has_input_iterator_category<_InputIterator>::value>,
|
|
class = __enable_if_t<__is_allocator<_Alloc>::value>>
|
|
queue(_InputIterator, _InputIterator, _Alloc)
|
|
-> queue<__iter_value_type<_InputIterator>, deque<__iter_value_type<_InputIterator>, _Alloc>>;
|
|
|
|
template <ranges::input_range _Range, class _Alloc, class = __enable_if_t<__is_allocator<_Alloc>::value>>
|
|
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) {
|
|
// clang 16 bug: declaring `friend operator<=>` causes "use of overloaded operator '*' is ambiguous" errors
|
|
return __x.__get_container() <=> __y.__get_container();
|
|
}
|
|
|
|
#endif
|
|
|
|
template <class _Tp, class _Container, __enable_if_t<__is_swappable<_Container>::value, 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 _LIBCPP_TEMPLATE_VIS uses_allocator<queue<_Tp, _Container>, _Alloc> : public uses_allocator<_Container, _Alloc> {
|
|
};
|
|
|
|
template <class _Tp, class _Container = vector<_Tp>, class _Compare = less<typename _Container::value_type> >
|
|
class _LIBCPP_TEMPLATE_VIS 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_HIDE_FROM_ABI priority_queue() _NOEXCEPT_(
|
|
is_nothrow_default_constructible<container_type>::value&& is_nothrow_default_constructible<value_compare>::value)
|
|
: c(), comp() {}
|
|
|
|
_LIBCPP_HIDE_FROM_ABI priority_queue(const priority_queue& __q) : c(__q.c), comp(__q.comp) {}
|
|
|
|
_LIBCPP_HIDE_FROM_ABI priority_queue& operator=(const priority_queue& __q) {
|
|
c = __q.c;
|
|
comp = __q.comp;
|
|
return *this;
|
|
}
|
|
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
_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_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_HIDE_FROM_ABI explicit priority_queue(const value_compare& __comp) : c(), comp(__comp) {}
|
|
_LIBCPP_HIDE_FROM_ABI priority_queue(const value_compare& __comp, const container_type& __c);
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
_LIBCPP_HIDE_FROM_ABI priority_queue(const value_compare& __comp, container_type&& __c);
|
|
#endif
|
|
template <class _InputIter, class = __enable_if_t<__has_input_iterator_category<_InputIter>::value> >
|
|
_LIBCPP_HIDE_FROM_ABI priority_queue(_InputIter __f, _InputIter __l, const value_compare& __comp = value_compare());
|
|
template <class _InputIter, class = __enable_if_t<__has_input_iterator_category<_InputIter>::value> >
|
|
_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, class = __enable_if_t<__has_input_iterator_category<_InputIter>::value> >
|
|
_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_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>
|
|
_LIBCPP_HIDE_FROM_ABI explicit priority_queue(const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
|
|
template <class _Alloc>
|
|
_LIBCPP_HIDE_FROM_ABI
|
|
priority_queue(const value_compare& __comp,
|
|
const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
|
|
template <class _Alloc>
|
|
_LIBCPP_HIDE_FROM_ABI
|
|
priority_queue(const value_compare& __comp,
|
|
const container_type& __c,
|
|
const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
|
|
template <class _Alloc>
|
|
_LIBCPP_HIDE_FROM_ABI priority_queue(
|
|
const priority_queue& __q, const _Alloc& __a, __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
template <class _Alloc>
|
|
_LIBCPP_HIDE_FROM_ABI
|
|
priority_queue(const value_compare& __comp,
|
|
container_type&& __c,
|
|
const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
|
|
template <class _Alloc>
|
|
_LIBCPP_HIDE_FROM_ABI priority_queue(
|
|
priority_queue&& __q, const _Alloc& __a, __enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
|
|
#endif // _LIBCPP_CXX03_LANG
|
|
|
|
template <class _InputIter, class _Alloc, class = __enable_if_t<__has_input_iterator_category<_InputIter>::value> >
|
|
_LIBCPP_HIDE_FROM_ABI
|
|
priority_queue(_InputIter __f,
|
|
_InputIter __l,
|
|
const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
|
|
|
|
template <class _InputIter, class _Alloc, class = __enable_if_t<__has_input_iterator_category<_InputIter>::value> >
|
|
_LIBCPP_HIDE_FROM_ABI priority_queue(
|
|
_InputIter __f,
|
|
_InputIter __l,
|
|
const value_compare& __comp,
|
|
const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
|
|
|
|
template <class _InputIter, class _Alloc, class = __enable_if_t<__has_input_iterator_category<_InputIter>::value> >
|
|
_LIBCPP_HIDE_FROM_ABI priority_queue(
|
|
_InputIter __f,
|
|
_InputIter __l,
|
|
const value_compare& __comp,
|
|
const container_type& __c,
|
|
const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
|
|
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
template <class _InputIter, class _Alloc, class = __enable_if_t<__has_input_iterator_category<_InputIter>::value> >
|
|
_LIBCPP_HIDE_FROM_ABI priority_queue(
|
|
_InputIter __f,
|
|
_InputIter __l,
|
|
const value_compare& __comp,
|
|
container_type&& __c,
|
|
const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>* = 0);
|
|
#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_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_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
|
|
|
|
_LIBCPP_NODISCARD_AFTER_CXX17 _LIBCPP_HIDE_FROM_ABI bool empty() const { return c.empty(); }
|
|
_LIBCPP_HIDE_FROM_ABI size_type size() const { return c.size(); }
|
|
_LIBCPP_HIDE_FROM_ABI const_reference top() const { return c.front(); }
|
|
|
|
_LIBCPP_HIDE_FROM_ABI void push(const value_type& __v);
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
_LIBCPP_HIDE_FROM_ABI void push(value_type&& __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));
|
|
}
|
|
|
|
std::make_heap(c.begin(), c.end(), comp);
|
|
}
|
|
# endif
|
|
|
|
template <class... _Args>
|
|
_LIBCPP_HIDE_FROM_ABI void emplace(_Args&&... __args);
|
|
#endif // _LIBCPP_CXX03_LANG
|
|
_LIBCPP_HIDE_FROM_ABI void pop();
|
|
|
|
_LIBCPP_HIDE_FROM_ABI void swap(priority_queue& __q)
|
|
_NOEXCEPT_(__is_nothrow_swappable<container_type>::value&& __is_nothrow_swappable<value_compare>::value);
|
|
|
|
_LIBCPP_NODISCARD _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<_Compare>::value>,
|
|
class = enable_if_t<!__is_allocator<_Container>::value> >
|
|
priority_queue(_Compare, _Container) -> priority_queue<typename _Container::value_type, _Container, _Compare>;
|
|
|
|
template <class _InputIterator,
|
|
class _Compare = less<__iter_value_type<_InputIterator>>,
|
|
class _Container = vector<__iter_value_type<_InputIterator>>,
|
|
class = enable_if_t<__has_input_iterator_category<_InputIterator>::value>,
|
|
class = enable_if_t<!__is_allocator<_Compare>::value>,
|
|
class = enable_if_t<!__is_allocator<_Container>::value> >
|
|
priority_queue(_InputIterator, _InputIterator, _Compare = _Compare(), _Container = _Container())
|
|
-> priority_queue<__iter_value_type<_InputIterator>, _Container, _Compare>;
|
|
|
|
template <class _Compare,
|
|
class _Container,
|
|
class _Alloc,
|
|
class = enable_if_t<!__is_allocator<_Compare>::value>,
|
|
class = enable_if_t<!__is_allocator<_Container>::value>,
|
|
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<_Allocator>::value> >
|
|
priority_queue(_InputIterator, _InputIterator, _Allocator)
|
|
-> priority_queue<__iter_value_type<_InputIterator>,
|
|
vector<__iter_value_type<_InputIterator>, _Allocator>,
|
|
less<__iter_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<_Compare>::value>,
|
|
class = enable_if_t<__is_allocator<_Allocator>::value> >
|
|
priority_queue(_InputIterator, _InputIterator, _Compare, _Allocator)
|
|
-> priority_queue<__iter_value_type<_InputIterator>,
|
|
vector<__iter_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<_Compare>::value>,
|
|
class = enable_if_t<!__is_allocator<_Container>::value>,
|
|
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<_Compare>::value>>
|
|
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<_Compare>::value>,
|
|
class = enable_if_t<__is_allocator<_Alloc>::value>>
|
|
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<_Alloc>::value>>
|
|
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>
|
|
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>
|
|
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, class>
|
|
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, class>
|
|
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, class>
|
|
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>
|
|
inline priority_queue<_Tp, _Container, _Compare>::priority_queue(
|
|
const _Alloc& __a, __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
|
|
: c(__a) {}
|
|
|
|
template <class _Tp, class _Container, class _Compare>
|
|
template <class _Alloc>
|
|
inline priority_queue<_Tp, _Container, _Compare>::priority_queue(
|
|
const value_compare& __comp, const _Alloc& __a, __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
|
|
: c(__a), comp(__comp) {}
|
|
|
|
template <class _Tp, class _Container, class _Compare>
|
|
template <class _Alloc>
|
|
inline priority_queue<_Tp, _Container, _Compare>::priority_queue(
|
|
const value_compare& __comp,
|
|
const container_type& __c,
|
|
const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
|
|
: c(__c, __a), comp(__comp) {
|
|
std::make_heap(c.begin(), c.end(), comp);
|
|
}
|
|
|
|
template <class _Tp, class _Container, class _Compare>
|
|
template <class _Alloc>
|
|
inline priority_queue<_Tp, _Container, _Compare>::priority_queue(
|
|
const priority_queue& __q, const _Alloc& __a, __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
|
|
: c(__q.c, __a), comp(__q.comp) {}
|
|
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
|
|
template <class _Tp, class _Container, class _Compare>
|
|
template <class _Alloc>
|
|
inline priority_queue<_Tp, _Container, _Compare>::priority_queue(
|
|
const value_compare& __comp,
|
|
container_type&& __c,
|
|
const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
|
|
: 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>
|
|
inline priority_queue<_Tp, _Container, _Compare>::priority_queue(
|
|
priority_queue&& __q, const _Alloc& __a, __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
|
|
: 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, class>
|
|
inline priority_queue<_Tp, _Container, _Compare>::priority_queue(
|
|
_InputIter __f, _InputIter __l, const _Alloc& __a, __enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
|
|
: 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, class>
|
|
inline priority_queue<_Tp, _Container, _Compare>::priority_queue(
|
|
_InputIter __f,
|
|
_InputIter __l,
|
|
const value_compare& __comp,
|
|
const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
|
|
: 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, class>
|
|
inline priority_queue<_Tp, _Container, _Compare>::priority_queue(
|
|
_InputIter __f,
|
|
_InputIter __l,
|
|
const value_compare& __comp,
|
|
const container_type& __c,
|
|
const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
|
|
: 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, class>
|
|
inline priority_queue<_Tp, _Container, _Compare>::priority_queue(
|
|
_InputIter __f,
|
|
_InputIter __l,
|
|
const value_compare& __comp,
|
|
container_type&& __c,
|
|
const _Alloc& __a,
|
|
__enable_if_t<uses_allocator<container_type, _Alloc>::value>*)
|
|
: 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>
|
|
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>
|
|
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>
|
|
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>
|
|
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>
|
|
inline void priority_queue<_Tp, _Container, _Compare>::swap(priority_queue& __q)
|
|
_NOEXCEPT_(__is_nothrow_swappable<container_type>::value&& __is_nothrow_swappable<value_compare>::value) {
|
|
using std::swap;
|
|
swap(c, __q.c);
|
|
swap(comp, __q.comp);
|
|
}
|
|
|
|
template <class _Tp,
|
|
class _Container,
|
|
class _Compare,
|
|
__enable_if_t<__is_swappable<_Container>::value && __is_swappable<_Compare>::value, int> = 0>
|
|
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 _LIBCPP_TEMPLATE_VIS uses_allocator<priority_queue<_Tp, _Container, _Compare>, _Alloc>
|
|
: public uses_allocator<_Container, _Alloc> {};
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
|
|
# include <concepts>
|
|
# include <cstdlib>
|
|
# include <functional>
|
|
# include <type_traits>
|
|
#endif
|
|
|
|
#endif // _LIBCPP_QUEUE
|