Standard library header <stack> - cppreference.com
From cppreference.com
This header is part of the containers library.
Includes | |
(C++20) |
Three-way comparison operator support[edit] |
(C++11) |
std::initializer_list class template[edit] |
Classes | |
| adapts a container to provide stack (LIFO data structure) (class template) [edit] | |
| specializes the std::uses_allocator type trait (class template specialization) [edit] | |
Functions | |
lexicographically compares the values of two stacks (function template) [edit] | |
(C++11) |
specializes the std::swap algorithm (function template) [edit] |
Synopsis
#include <compare> #include <initializer_list> namespace std { // class template stack template<class T, class Container = deque<T>> class stack; template<class T, class Container> constexpr bool operator==(const stack<T, Container>& x, const stack<T, Container>& y); template<class T, class Container> constexpr bool operator!=(const stack<T, Container>& x, const stack<T, Container>& y); template<class T, class Container> constexpr bool operator<(const stack<T, Container>& x, const stack<T, Container>& y); template<class T, class Container> constexpr bool operator>(const stack<T, Container>& x, const stack<T, Container>& y); template<class T, class Container> constexpr bool operator<=(const stack<T, Container>& x, const stack<T, Container>& y); template<class T, class Container> constexpr bool operator>=(const stack<T, Container>& x, const stack<T, Container>& y); template<class T, three_way_comparable Container> constexpr compare_three_way_result_t<Container> operator<=>( const stack<T, Container>& x, const stack<T, Container>& y); template<class T, class Container> constexpr void swap(stack<T, Container>& x, stack<T, Container>& y) noexcept(noexcept(x.swap(y))); template<class T, class Container, class Alloc> struct uses_allocator<stack<T, Container>, Alloc>; // formatter specialization for stack template<class CharT, class T, formattable<CharT> Container> struct formatter<stack<T, Container>, CharT>; template<class T, class Container> constexpr bool enable_nonlocking_formatter_optimization<stack<T, Container>> = false; }
Class template std::stack
namespace std { template<class T, class Container = deque<T>> class stack { public: using value_type = Container::value_type; using reference = Container::reference; using const_reference = Container::const_reference; using size_type = Container::size_type; using container_type = Container; protected: Container c; public: constexpr stack() : stack(Container()) { } constexpr explicit stack(const Container&); constexpr explicit stack(Container&&); template<class InputIter> constexpr stack(InputIter first, InputIter last); template<container-compatible-range<T> R> constexpr stack(from_range_t, R&& rg); template<class Alloc> constexpr explicit stack(const Alloc&); template<class Alloc> constexpr stack(const Container&, const Alloc&); template<class Alloc> constexpr stack(Container&&, const Alloc&); template<class Alloc> constexpr stack(const stack&, const Alloc&); template<class Alloc> constexpr stack(stack&&, const Alloc&); template<class InputIter, class Alloc> constexpr stack(InputIter first, InputIter last, const Alloc&); template<container-compatible-range<T> R, class Alloc> constexpr stack(from_range_t, R&& rg, const Alloc&); constexpr bool empty() const { return c.empty(); } constexpr size_type size() const { return c.size(); } constexpr reference top() { return c.back(); } constexpr const_reference top() const { return c.back(); } constexpr void push(const value_type& x) { c.push_back(x); } constexpr void push(value_type&& x) { c.push_back(std::move(x)); } template<container-compatible-range<T> R> constexpr void push_range(R&& rg); template<class... Args> constexpr decltype(auto) emplace(Args&&... args) { return c.emplace_back(std::forward<Args>(args)...); } constexpr void pop() { c.pop_back(); } constexpr void swap(stack& s) noexcept(is_nothrow_swappable_v<Container>) { using std::swap; swap(c, s.c); } }; template<class Container> stack(Container) -> stack<typename Container::value_type, Container>; template<class InputIter> stack(InputIter, InputIter) -> stack</*iter-value-type*/<InputIter>>; template<ranges::input_range R> stack(from_range_t, R&&) -> stack<ranges::range_value_t<R>>; template<class Container, class Allocator> stack(Container, Allocator) -> stack<typename Container::value_type, Container>; template<class InputIter, class Allocator> stack(InputIter, InputIter, Allocator) -> stack</*iter-value-type*/<InputIter>, deque</*iter-value-type*/<InputIter>, Allocator>>; template<ranges::input_range R, class Allocator> stack(from_range_t, R&&, Allocator) -> stack<ranges::range_value_t<R>, deque<ranges::range_value_t<R>, Allocator>>; template<class T, class Container, class Alloc> struct uses_allocator<stack<T, Container>, Alloc> : uses_allocator<Container, Alloc>::type {}; }