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

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.

Sequence c

typedef Sequence::value_type Sequence_value_type

A standard container giving FILO behavior.

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 stack.

Default constructor creates no elements.

Definition at line 143 of file stack.

Returns true if the stack is empty.

Definition at line 150 of file stack.

References std::stack< Type, Sequence >::c.

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 stack.

References std::stack< Type, Sequence >::c.

Add data to the top of the stack.

Parameters: x Data to be added.

This is a typical stack operation. The function creates an element at the top of the stack and assigns the given data to it. The time complexity of the operation depends on the underlying sequence.

Definition at line 190 of file stack.

References std::stack< Type, Sequence >::c.

Returns the number of elements in the stack.

Definition at line 155 of file stack.

References std::stack< Type, Sequence >::c.

Returns a read-only (constant) reference to the data at the first element of the stack.

Definition at line 174 of file stack.

References std::stack< Type, Sequence >::c.

Returns a read/write reference to the data at the first element of the stack.

Definition at line 163 of file stack.

References std::stack< Type, Sequence >::c.