Standard library header - cppreference.com (original) (raw)

This header is part of the containers library.

[edit] Synopsis

#include #include   namespace std { // class template queue template<class T, class Container = deque> class queue;   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 operator<=>(const queue<T, Container>& x, const queue<T, Container>& y);   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, class Alloc> struct uses_allocator<queue<T, Container>, Alloc>;   // formatter specialization for queue template<class CharT, class T, formattable Container> struct formatter<queue<T, Container>, CharT>;   // class template priority_queue template<class T, class Container = vector, class Compare = less> class priority_queue;   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))); template<class T, class Container, class Compare, class Alloc> struct uses_allocator<priority_queue<T, Container, Compare>, Alloc>;   // formatter specialization for priority_queue template<class CharT, class T, formattable Container, class Compare> struct formatter<priority_queue<T, Container, Compare>, CharT>; }

[edit] Class template std::queue

namespace std { template<class T, class Container = deque> class queue { public: using value_type = typename Container::value_type; using reference = typename Container::reference; using const_reference = typename Container::const_reference; using size_type = typename Container::size_type; using container_type = Container;   protected: Container c;   public: queue() : queue(Container()) { } explicit queue(const Container&); explicit queue(Container&&); template queue(InputIter first, InputIter last); template<container-compatible-range R> queue(from_range_t, R&& rg); template explicit queue(const Alloc&); template queue(const Container&, const Alloc&); template queue(Container&&, const Alloc&); template queue(const queue&, const Alloc&); template queue(queue&&, const Alloc&); template<class InputIter, class Alloc> queue(InputIter first, InputIter last, const Alloc&); template<container-compatible-range R, class Alloc> queue(from_range_t, R&& rg, const Alloc&);   bool empty() const { return c.empty(); } size_type size() const { return c.size(); } reference front() { return c.front(); } const_reference front() const { return c.front(); } reference back() { return c.back(); } const_reference back() const { return c.back(); } void push(const value_type& x) { c.push_back(x); } void push(value_type&& x) { c.push_back(std::move(x)); } template<container-compatible-range R> void push_range(R&& rg); template<class... Args> decltype(auto) emplace(Args&&... args) { return c.emplace_back(std::forward(args)...); } void pop() { c.pop_front(); } void swap(queue& q) noexcept(is_nothrow_swappable_v) { using std::swap; swap(c, q.c); } };   template queue(Container) -> queue<typename Container::value_type, Container>;   template queue(InputIter, InputIter) -> queue</*iter-value-type*/>;   template<ranges::input_range R> queue(from_range_t, R&&) -> queue<ranges::range_value_t>;   template<class Container, class Allocator> queue(Container, Allocator) -> queue<typename Container::value_type, Container>;   template<class InputIter, class Allocator> queue(InputIter, InputIter, Allocator) -> queue</*iter-value-type*/, deque</*iter-value-type*/, Allocator>>;   template<ranges::input_range R, class Allocator> queue(from_range_t, R&&, Allocator) -> queue<ranges::range_value_t, deque<ranges::range_value_t, Allocator>>;   template<class T, class Container, class Alloc> struct uses_allocator<queue<T, Container>, Alloc> : uses_allocator<Container, Alloc>::type {}; }

[edit] Class template std::priority_queue

namespace std { template<class T, class Container = vector, class Compare = less> class priority_queue { public: using value_type = typename Container::value_type; using reference = typename Container::reference; using const_reference = typename Container::const_reference; using size_type = typename Container::size_type; using container_type = Container; using value_compare = Compare;   protected: Container c; Compare comp;   public: priority_queue() : priority_queue(Compare()) { } explicit priority_queue(const Compare& x) : priority_queue(x, Container()) { } priority_queue(const Compare& x, const Container&); priority_queue(const Compare& x, Container&&); template priority_queue(InputIter first, InputIter last, const Compare& x = Compare()); template priority_queue(InputIter first, InputIter last, const Compare& x, const Container&); template priority_queue(InputIter first, InputIter last, const Compare& x, Container&&); template<container-compatible-range R> priority_queue(from_range_t, R&& rg, const Compare& x = Compare()); template explicit priority_queue(const Alloc&); template priority_queue(const Compare&, const Alloc&); template priority_queue(const Compare&, const Container&, const Alloc&); template priority_queue(const Compare&, Container&&, const Alloc&); template priority_queue(const priority_queue&, const Alloc&); template priority_queue(priority_queue&&, const Alloc&); template<class InputIter, class Alloc> priority_queue(InputIter, InputIter, const Alloc&); template<class InputIter, class Alloc> priority_queue(InputIter, InputIter, const Compare&, const Alloc&); template<class InputIter, class Alloc> priority_queue(InputIter, InputIter, const Compare&, const Container&, const Alloc&); template<class InputIter, class Alloc> priority_queue(InputIter, InputIter, const Compare&, Container&&, const Alloc&); template<container-compatible-range R, class Alloc> priority_queue(from_range_t, R&& rg, const Compare&, const Alloc&); template<container-compatible-range R, class Alloc> priority_queue(from_range_t, R&& rg, const Alloc&);   bool empty() const { return c.empty(); } size_type size() const { return c.size(); } const_reference top() const { return c.front(); } void push(const value_type& x); void push(value_type&& x); template<container-compatible-range R> void push_range(R&& rg); template<class... Args> void emplace(Args&&... args); void pop(); void swap(priority_queue& q) noexcept( is_nothrow_swappable_v&& is_nothrow_swappable_v) { using std::swap; swap(c, q.c); swap(comp, q.comp); } };   template<class Compare, class Container> priority_queue(Compare, Container) -> priority_queue<typename Container::value_type, Container, Compare>;   template<class InputIter, class Compare = less</*iter-value-type*/>, class Container = vector</*iter-value-type*/>> priority_queue(InputIter, InputIter, Compare = Compare(), Container = Container()) -> priority_queue</*iter-value-type*/, Container, Compare>;   template<ranges::input_range R, class Compare = less<ranges::range_value_t>> priority_queue(from_range_t, R&&, Compare = Compare()) -> priority_queue<ranges::range_value_t, vector<ranges::range_value_t>, Compare>;   template<class Compare, class Container, class Allocator> priority_queue(Compare, Container, Allocator) -> priority_queue<typename Container::value_type, Container, Compare>;   template<class InputIter, class Allocator> priority_queue(InputIter, InputIter, Allocator) -> priority_queue</*iter-value-type*/, vector</*iter-value-type*/, Allocator>, less</*iter-value-type*/>>;   template<class InputIter, class Compare, class Allocator> priority_queue(InputIter, InputIter, Compare, Allocator) -> priority_queue</*iter-value-type*/, vector</*iter-value-type*/, Allocator>, Compare>;   template<class InputIter, class Compare, class Container, class Allocator> priority_queue(InputIter, InputIter, Compare, Container, Allocator) -> priority_queue<typename Container::value_type, Container, Compare>;   template<ranges::input_range R, class Compare, class Allocator> priority_queue(from_range_t, R&&, Compare, Allocator) -> priority_queue<ranges::range_value_t, vector<ranges::range_value_t, Allocator>, Compare>;   template<ranges::input_range R, class Allocator> priority_queue(from_range_t, R&&, Allocator) -> priority_queue<ranges::range_value_t, vector<ranges::range_value_t, Allocator>>;   // no equality is provided   template<class T, class Container, class Compare, class Alloc> struct uses_allocator<priority_queue<T, Container, Compare>, Alloc> : uses_allocator<Container, Alloc>::type {}; }