Difference between revisions of "cpp/container/stack"
From cppreference.com
m (typo) |
m |
||
| Line 21: | Line 21: | ||
* {{tt|pop_back()}} | * {{tt|pop_back()}} | ||
| − | The standard containers {{lc|std::vector}}, {{lc|std::deque}} and {{lc|std::list}} satisfy these requirements. | + | The standard containers {{lc|std::vector}}, {{lc|std::deque}} and {{lc|std::list}} satisfy these requirements. By default, if no container class is specified for a particular stack class instantiation, the standard container {{lc|std::deque}} is used. |
}}{{par end}} | }}{{par end}} | ||
Revision as of 22:57, 5 May 2018
| 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 FILO (first-in, last-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 Template:concept. 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 of two stacks (function template) | |
| (C++11) |
specializes the std::swap algorithm (function template) |
Helper classes
| specializes the std::uses_allocator type trait (class template specialization) |
