libstdc++
|
Public Member Functions | |
stack (const _Sequence &__c) | |
Public Attributes | |
__pad0__: c(std::move(__c)) { } template<typename _Alloc | |
Protected Attributes | |
_Sequence | c |
Friends | |
template<typename _Tp1 , typename _Seq1 > | |
bool | operator< (const stack< _Tp1, _Seq1 > &, const stack< _Tp1, _Seq1 > &) |
template<typename _Tp1 , typename _Seq1 > | |
bool | operator== (const stack< _Tp1, _Seq1 > &, const stack< _Tp1, _Seq1 > &) |
A standard container giving FILO behavior.
_Tp | Type of element. |
_Sequence | Type of underlying sequence, defaults to deque<_Tp>. |
Meets many of the requirements of a container, but does not define anything to do with iterators. Very few of the other standard container interfaces are defined.
This is not a true container, but an adaptor. It holds another container, and provides a wrapper interface to that container. The wrapper is what enforces strict first-in-last-out stack behavior.
The second template parameter defines the type of the underlying sequence/container. It defaults to std::deque, but it can be any type that supports back
, push_back
, and pop_front
, such as std::list, std::vector, or an appropriate user-defined type.
Members not found in normal containers are container_type
, which is a typedef for the second Sequence parameter, and push
, pop
, and top
, which are standard stack/FILO operations.
Definition at line 99 of file stl_stack.h.
|
inlineexplicit |
Default constructor creates no elements.
Definition at line 145 of file stl_stack.h.