#include <stl_stack.h>
Public Types | |
typedef _Sequence::value_type | value_type |
typedef _Sequence::reference | reference |
typedef _Sequence::const_reference | const_reference |
typedef _Sequence::size_type | size_type |
typedef _Sequence | container_type |
Public Member Functions | |
stack (const _Sequence &__c=_Sequence()) | |
Default constructor creates no elements. | |
bool | empty () const |
size_type | size () const |
reference | top () |
const_reference | top () const |
void | push (const value_type &__x) |
Add data to the top of the stack. | |
void | pop () |
Removes first element. | |
Protected Attributes | |
_Sequence | c |
Private Types | |
typedef _Sequence::value_type | _Sequence_value_type |
Private Member Functions | |
__glibcxx_class_requires (_Tp, _SGIAssignableConcept) __glibcxx_class_requires(_Sequence | |
_BackInsertionSequenceConcept | __glibcxx_class_requires2 (_Tp, _Sequence_value_type, _SameTypeConcept) template< typename _Tp1 |
Friends | |
_BackInsertionSequenceConcept _Seq1 friend 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 > &) |
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 110 of file stl_stack.h.
typedef _Sequence::value_type std::stack< _Tp, _Sequence >::_Sequence_value_type [private] |
Definition at line 113 of file stl_stack.h.
typedef _Sequence::const_reference std::stack< _Tp, _Sequence >::const_reference |
Definition at line 129 of file stl_stack.h.
typedef _Sequence std::stack< _Tp, _Sequence >::container_type |
Definition at line 131 of file stl_stack.h.
typedef _Sequence::reference std::stack< _Tp, _Sequence >::reference |
Definition at line 128 of file stl_stack.h.
typedef _Sequence::size_type std::stack< _Tp, _Sequence >::size_type |
Definition at line 130 of file stl_stack.h.
typedef _Sequence::value_type std::stack< _Tp, _Sequence >::value_type |
Definition at line 127 of file stl_stack.h.
std::stack< _Tp, _Sequence >::stack | ( | const _Sequence & | __c = _Sequence() |
) | [inline, explicit] |
std::stack< _Tp, _Sequence >::__glibcxx_class_requires | ( | _Tp | , | |
_SGIAssignableConcept | ||||
) | [private] |
_BackInsertionSequenceConcept std::stack< _Tp, _Sequence >::__glibcxx_class_requires2 | ( | _Tp | , | |
_Sequence_value_type | , | |||
_SameTypeConcept | ||||
) | [private] |
bool std::stack< _Tp, _Sequence >::empty | ( | ) | const [inline] |
Returns true if the stack is empty.
Definition at line 150 of file stl_stack.h.
References std::stack< _Tp, _Sequence >::c.
void std::stack< _Tp, _Sequence >::pop | ( | ) | [inline] |
Removes first element.
This is a typical stack operation. It shrinks the stack by one. The time complexity of the operation depends on the underlying sequence.
Note that no data is returned, and if the first element's data is needed, it should be retrieved before pop() is called.
Definition at line 205 of file stl_stack.h.
References __glibcxx_requires_nonempty, and std::stack< _Tp, _Sequence >::c.
void std::stack< _Tp, _Sequence >::push | ( | const value_type & | __x | ) | [inline] |
Add data to the top of the stack.
x | Data to be added. |
Definition at line 190 of file stl_stack.h.
References std::stack< _Tp, _Sequence >::c.
size_type std::stack< _Tp, _Sequence >::size | ( | ) | const [inline] |
Returns the number of elements in the stack.
Definition at line 155 of file stl_stack.h.
References std::stack< _Tp, _Sequence >::c.
const_reference std::stack< _Tp, _Sequence >::top | ( | ) | const [inline] |
Returns a read-only (constant) reference to the data at the first element of the stack.
Definition at line 174 of file stl_stack.h.
References __glibcxx_requires_nonempty, and std::stack< _Tp, _Sequence >::c.
reference std::stack< _Tp, _Sequence >::top | ( | ) | [inline] |
Returns a read/write reference to the data at the first element of the stack.
Definition at line 163 of file stl_stack.h.
References __glibcxx_requires_nonempty, and std::stack< _Tp, _Sequence >::c.
bool operator< | ( | const stack< _Tp1, _Seq1 > & | , | |
const stack< _Tp1, _Seq1 > & | ||||
) | [friend] |
_BackInsertionSequenceConcept _Seq1 friend bool operator== | ( | const stack< _Tp1, _Seq1 > & | , | |
const stack< _Tp1, _Seq1 > & | ||||
) | [friend] |
_Sequence std::stack< _Tp, _Sequence >::c [protected] |
Definition at line 135 of file stl_stack.h.
Referenced by std::stack< _Tp, _Sequence >::empty(), std::operator==(), std::stack< _Tp, _Sequence >::pop(), std::stack< _Tp, _Sequence >::push(), std::stack< _Tp, _Sequence >::size(), and std::stack< _Tp, _Sequence >::top().