Difference between revisions of "cpp/container/stack"
From cppreference.com
(actually a stack should be considered as LIFO instead of FILO, since an element can be poped immediately aftered pushed, so FI does not lead to LO.) |
(Remove (until C++20) marks from comparison operators) |
||
| Line 60: | Line 60: | ||
===Non-member functions=== | ===Non-member functions=== | ||
{{dsc begin}} | {{dsc begin}} | ||
| − | {{dsc | + | {{dsc tfun | cpp/container/stack/operator_cmp | title=operator==<br>operator!=<br>operator<<br>operator<=<br>operator><br>operator>=<br>operator<=> | notes=<br><br><br><br><br><br>{{mark c++20}} | lexicographically compares the values in the stack }} |
{{dsc inc | cpp/container/dsc swap2 | stack}} | {{dsc inc | cpp/container/dsc swap2 | stack}} | ||
{{dsc end}} | {{dsc end}} | ||
Revision as of 09:20, 5 May 2020
| Defined in header <stack>
|
||
| template< class T, |
||
The std::stack class is a container adapter that gives the programmer the functionality of a stack - specifically, a LIFO (last-in, first-out) data structure.
The class template acts as a wrapper to the underlying container - only a specific set of functions is provided. The stack pushes and pops the element from the back of the underlying container, known as the top of the stack.
Contents |
Template parameters
| T | - | The type of the stored elements. The behavior is undefined if T is not the same type as Container::value_type.(since C++17)
|
| Container | - | The type of the underlying container to use to store the elements. The container must satisfy the requirements of SequenceContainer. Additionally, it must provide the following functions with the usual semantics:
The standard containers std::vector, std::deque and std::list satisfy these requirements. By default, if no container class is specified for a particular stack class instantiation, the standard container std::deque is used. |
Member types
| Member type | Definition |
container_type
|
Container
|
value_type
|
Container::value_type
|
size_type
|
Container::size_type |
reference
|
Container::reference
|
const_reference
|
Container::const_reference
|
Member functions
constructs the stack (public member function) | |
destructs the stack (public member function) | |
| assigns values to the container adaptor (public member function) | |
Element access | |
| accesses the top element (public member function) | |
Capacity | |
| checks whether the container adaptor is empty (public member function) | |
| returns the number of elements (public member function) | |
Modifiers | |
| inserts element at the top (public member function) | |
| (C++11) |
constructs element in-place at the top (public member function) |
| removes the top element (public member function) | |
| (C++11) |
swaps the contents (public member function) |
Member objects | |
| Container c |
the underlying container (protected member object) |
Non-member functions
| lexicographically compares the values in the stack (function template) | |
| (C++11) |
specializes the std::swap algorithm (function template) |
Helper classes
| specializes the std::uses_allocator type trait (class template specialization) |
