Difference between revisions of "cpp/container/stack"
(expand) |
m (fmt.) |
||
(36 intermediate revisions by 20 users not shown) | |||
Line 1: | Line 1: | ||
{{cpp/title|stack}} | {{cpp/title|stack}} | ||
{{cpp/container/stack/navbar}} | {{cpp/container/stack/navbar}} | ||
− | {{ddcl | header=stack | | + | {{ddcl|header=stack|1= |
template< | template< | ||
class T, | class T, | ||
− | class Container | + | class Container = std::deque<T> |
> class stack; | > class stack; | ||
− | }} | + | }} |
− | The {{tt|std::stack}} class is a container | + | The {{tt|std::stack}} class is a [[cpp/container#Container adaptors|container adaptor]] that gives the programmer the functionality of a {{enwiki|Stack (abstract data type)|stack}} - specifically, a LIFO (last-in, first-out) data structure. |
− | The underlying container | + | 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. |
− | * {{tt|back()}} | + | ===Template parameters=== |
− | * {{tt|push_back()}} | + | {{par begin}} |
− | * {{tt|pop_back()}} | + | {{par|T|The type of the stored elements. The program is ill-formed if {{tt|T}} is not the same type as {{tt|Container::value_type}}.}} |
+ | {{par|Container|The type of the underlying container to use to store the elements. The container must satisfy the requirements of {{named req|SequenceContainer}}. Additionally, it must provide the following functions with the [[cpp/named req/SequenceContainer#Optional operations|usual semantics]]: | ||
+ | * {{tt|back()}}, e.g., {{lc|std::vector::back()}}, | ||
+ | * {{tt|push_back()}}, e.g., {{lc|std::deque::push_back()}}, | ||
+ | * {{tt|pop_back()}}, e.g., {{lc|std::list::pop_back()}}. | ||
− | The standard containers {{ | + | The standard containers {{lc|std::vector}} (including {{ltt|cpp/container/vector_bool|std::vector<bool>}}), {{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}} | ||
===Member types=== | ===Member types=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc hitem|Type|Definition}} |
− | {{ | + | {{dsc inc|cpp/container/dsc container_type|stack}} |
− | {{ | + | {{dsc inc|cpp/container/dsc value_type|stack}} |
− | {{ | + | {{dsc inc|cpp/container/dsc size_type|stack}} |
− | {{ | + | {{dsc inc|cpp/container/dsc reference|stack}} |
− | {{ | + | {{dsc inc|cpp/container/dsc const_reference|stack}} |
− | {{ | + | {{dsc end}} |
+ | |||
+ | ===Member objects=== | ||
+ | {{dsc begin}} | ||
+ | {{dsc hitem|Member|Description}} | ||
+ | {{dsc inc|cpp/container/dsc c|stack}} | ||
+ | {{dsc end}} | ||
===Member functions=== | ===Member functions=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc inc|cpp/container/dsc constructor|stack}} |
− | {{ | + | {{dsc inc|cpp/container/dsc destructor|stack}} |
− | {{ | + | {{dsc inc|cpp/container/dsc operator{{=}}|stack}} |
− | {{ | + | {{dsc h2|Element access}} |
− | {{ | + | {{dsc inc|cpp/container/dsc top|stack}} |
− | {{ | + | {{dsc h2|Capacity}} |
− | {{ | + | {{dsc inc|cpp/container/dsc empty|stack}} |
− | {{ | + | {{dsc inc|cpp/container/dsc size|stack}} |
− | {{ | + | {{dsc h2|Modifiers}} |
− | {{ | + | {{dsc inc|cpp/container/dsc push|stack}} |
− | {{ | + | {{dsc inc|cpp/container/dsc push_range|stack}} |
− | {{ | + | {{dsc inc|cpp/container/dsc emplace|stack}} |
− | {{ | + | {{dsc inc|cpp/container/dsc pop|stack}} |
− | + | {{dsc inc|cpp/container/dsc swap|stack}} | |
− | {{ | + | {{dsc end}} |
− | + | ||
− | + | ||
− | {{ | + | |
===Non-member functions=== | ===Non-member functions=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc inc|cpp/container/dsc operator_cmp|stack}} |
− | {{ | + | {{dsc inc|cpp/container/dsc swap2|stack}} |
− | {{ | + | {{dsc end}} |
===Helper classes=== | ===Helper classes=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc inc|cpp/container/dsc uses_allocator|stack}} |
− | {{ | + | {{dsc inc|cpp/container/dsc adaptor_formatter|stack}} |
+ | {{dsc end}} | ||
+ | |||
+ | {{rrev|since=c++17| | ||
+ | ==={{rl|deduction guides|Deduction guides}}=== | ||
+ | }} | ||
+ | |||
+ | ===Notes=== | ||
+ | {{ftm begin|std=1|comment=1}} | ||
+ | {{ftm|__cpp_lib_containers_ranges|value=202202L|std=C++23|Ranges construction and insertion for containers}} | ||
+ | {{ftm end}} | ||
+ | |||
+ | ===Example=== | ||
+ | {{example | ||
+ | |Comment | ||
+ | |code= | ||
+ | |output= | ||
+ | }} | ||
+ | |||
+ | ===Defect reports=== | ||
+ | {{dr list begin}} | ||
+ | {{dr list item|wg=lwg|dr=307|std=C++98|before={{tt|Container}} could not be {{tt|std::vector<bool>}}|after=allowed}} | ||
+ | {{dr list item|wg=lwg|dr=2566|std=C++98|before=Missing the requirement for {{tt|Container::value_type}} |after=ill-formed if {{tt|T}} is not the same type as {{tt|Container::value_type}}}} | ||
+ | {{dr list end}} | ||
+ | |||
+ | ===See also=== | ||
+ | {{dsc begin}} | ||
+ | {{dsc inc|cpp/container/dsc vector}} | ||
+ | {{dsc inc|cpp/container/dsc vector bool}} | ||
+ | {{dsc inc|cpp/container/dsc deque}} | ||
+ | {{dsc inc|cpp/container/dsc list}} | ||
+ | {{dsc end}} | ||
− | + | {{langlinks|cs|de|es|fr|it|ja|pl|pt|ru|tr|zh}} | |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + |
Latest revision as of 15:41, 1 November 2024
Defined in header <stack>
|
||
template< class T, |
||
The std::stack
class is a container adaptor 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 |
[edit] Template parameters
T | - | The type of the stored elements. The program is ill-formed if T is not the same type as Container::value_type .
|
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 (including std::vector<bool>), 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. |
[edit] Member types
Type | Definition |
container_type
|
Container
|
value_type
|
Container::value_type
|
size_type
|
Container::size_type |
reference
|
Container::reference
|
const_reference
|
Container::const_reference
|
[edit] Member objects
Member | Description |
Container c |
the underlying container (protected member object) |
[edit] 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++23) |
inserts a range of elements 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) |
[edit] Non-member functions
lexicographically compares the values of two stack s (function template) | |
(C++11) |
specializes the std::swap algorithm (function template) |
[edit] Helper classes
specializes the std::uses_allocator type trait (class template specialization) | |
(C++23) |
formatting support for std::stack (class template specialization) |
Deduction guides |
(since C++17) |
[edit] Notes
Feature-test macro | Value | Std | Feature |
---|---|---|---|
__cpp_lib_containers_ranges |
202202L | (C++23) | Ranges construction and insertion for containers |
[edit] Example
This section is incomplete Reason: no example |
[edit] Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 307 | C++98 | Container could not be std::vector<bool>
|
allowed |
LWG 2566 | C++98 | Missing the requirement for Container::value_type
|
ill-formed if T is not the same type as Container::value_type
|
[edit] See also
dynamic contiguous array (class template) | |
space-efficient dynamic bitset (class template specialization) | |
double-ended queue (class template) | |
doubly-linked list (class template) |