cppdraft_translate/cppdraft/stack.md

[stack]

23 Containers library [containers]

23.6 Container adaptors [container.adaptors]

23.6.6 Class template stack [stack]

23.6.6.1 General [stack.general]

1

#

Any sequence container supporting operationsback(),push_back() andpop_back() can be used to instantiatestack.

In particular,, and can be used.

23.6.6.2 Definition [stack.defn]

namespace std {template<class T, class Container = deque>class stack {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:constexpr stack() : stack(Container()) {}constexpr explicit stack(const Container&); constexpr explicit stack(Container&&); template constexpr stack(InputIterator first, InputIterator last); template<container-compatible-range R>constexpr stack(from_range_t, R&& rg); template constexpr explicit stack(const Alloc&); template constexpr stack(const Container&, const Alloc&); template constexpr stack(Container&&, const Alloc&); template constexpr stack(const stack&, const Alloc&); template constexpr stack(stack&&, const Alloc&); template<class InputIterator, class Alloc>constexpr stack(InputIterator first, InputIterator last, const Alloc&); template<container-compatible-range 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 R>constexpr void push_range(R&& rg); template<class... Args>constexpr decltype(auto) emplace(Args&&... args){ return c.emplace_back(std::forward(args)...); }constexpr void pop() { c.pop_back(); }constexpr void swap(stack& s) noexcept(is_nothrow_swappable_v){ using std::swap; swap(c, s.c); }}; template stack(Container) -> stack<typename Container::value_type, Container>; template stack(InputIterator, InputIterator) -> stack<iter-value-type>; template<ranges::input_range R> stack(from_range_t, R&&) -> stack<ranges::range_value_t>; template<class Container, class Allocator> stack(Container, Allocator) -> stack<typename Container::value_type, Container>; template<class InputIterator, class Allocator> stack(InputIterator, InputIterator, Allocator)-> stack<iter-value-type, deque<iter-value-type, Allocator>>; template<ranges::input_range R, class Allocator> stack(from_range_t, R&&, Allocator)-> stack<ranges::range_value_t, deque<ranges::range_value_t, Allocator>>; template<class T, class Container, class Alloc>struct uses_allocator<stack<T, Container>, Alloc>: uses_allocator<Container, Alloc>::type { };}

23.6.6.3 Constructors [stack.cons]

🔗

constexpr explicit stack(const Container& cont);

1

#

Effects: Initializes c with cont.

🔗

constexpr explicit stack(Container&& cont);

2

#

Effects: Initializes c with std​::​move(cont).

🔗

template<class InputIterator> constexpr stack(InputIterator first, InputIterator last);

3

#

Effects: Initializes c withfirst as the first argument and last as the second argument.

🔗

template<[container-compatible-range](container.intro.reqmts#concept:container-compatible-range "23.2.2.1 Introduction [container.intro.reqmts]")<T> R> constexpr stack(from_range_t, R&& rg);

4

#

Effects: Initializes c with ranges​::​to(std​::​forward(rg)).

23.6.6.4 Constructors with allocators [stack.cons.alloc]

1

#

If uses_allocator_v<container_type, Alloc> is false the constructors in this subclause shall not participate in overload resolution.

🔗

template<class Alloc> constexpr explicit stack(const Alloc& a);

2

#

Effects: Initializes c with a.

🔗

template<class Alloc> constexpr stack(const container_type& cont, const Alloc& a);

3

#

Effects: Initializes c with cont as the first argument and a as the second argument.

🔗

template<class Alloc> constexpr stack(container_type&& cont, const Alloc& a);

4

#

Effects: Initializes c with std​::​move(cont) as the first argument and a as the second argument.

🔗

template<class Alloc> constexpr stack(const stack& s, const Alloc& a);

5

#

Effects: Initializes c with s.c as the first argument and a as the second argument.

🔗

template<class Alloc> constexpr stack(stack&& s, const Alloc& a);

6

#

Effects: Initializes c with std​::​move(s.c) as the first argument and a as the second argument.

🔗

template<class InputIterator, class Alloc> constexpr stack(InputIterator first, InputIterator last, const Alloc& alloc);

7

#

Effects: Initializes c withfirst as the first argument,last as the second argument, andalloc as the third argument.

🔗

template<[container-compatible-range](container.intro.reqmts#concept:container-compatible-range "23.2.2.1 Introduction [container.intro.reqmts]")<T> R, class Alloc> constexpr stack(from_range_t, R&& rg, const Alloc& a);

8

#

Effects: Initializesc with ranges​::​to(std​::​forward(rg), a).

23.6.6.5 Modifiers [stack.mod]

🔗

template<[container-compatible-range](container.intro.reqmts#concept:container-compatible-range "23.2.2.1 Introduction [container.intro.reqmts]")<T> R> constexpr void push_range(R&& rg);

1

#

Effects: Equivalent to c.append_range(std​::​forward(rg)) if that is a valid expression, otherwise ranges​::​copy(rg, back_inserter(c)).

23.6.6.6 Operators [stack.ops]

🔗

template<class T, class Container> constexpr bool operator==(const stack<T, Container>& x, const stack<T, Container>& y);

1

#

Returns: x.c == y.c.

🔗

template<class T, class Container> constexpr bool operator!=(const stack<T, Container>& x, const stack<T, Container>& y);

2

#

Returns: x.c != y.c.

🔗

template<class T, class Container> constexpr bool operator< (const stack<T, Container>& x, const stack<T, Container>& y);

3

#

Returns: x.c < y.c.

🔗

template<class T, class Container> constexpr bool operator> (const stack<T, Container>& x, const stack<T, Container>& y);

4

#

Returns: x.c > y.c.

🔗

template<class T, class Container> constexpr bool operator<=(const stack<T, Container>& x, const stack<T, Container>& y);

5

#

Returns: x.c <= y.c.

🔗

template<class T, class Container> constexpr bool operator>=(const stack<T, Container>& x, const stack<T, Container>& y);

6

#

Returns: x.c >= y.c.

🔗

template<class T, [three_way_comparable](cmp.concept#concept:three_way_comparable "17.12.4 Concept three_­way_­comparable [cmp.concept]") Container> constexpr compare_three_way_result_t<Container> operator<=>(const stack<T, Container>& x, const stack<T, Container>& y);

7

#

Returns: x.c <=> y.c.

23.6.6.7 Specialized algorithms [stack.special]

🔗

template<class T, class Container> constexpr void swap(stack<T, Container>& x, stack<T, Container>& y) noexcept(noexcept(x.swap(y)));

1

#

Constraints: is_swappable_v is true.

2

#

Effects: As if by x.swap(y).