Login Register

std::stack::pop

void pop();

Removes the top element from the stack. Effectively calls c.pop_back().

Parameters

(none).

Return value

(none).

Complexity

Equal to the complexity of Container::pop_back.

See also

emplace (C++11)	constructs element in-place at the top (public member function)
push	inserts element at the top (public member function)
top	accesses the top element (public member function)

Links:

http://en.cppreference.com/w/cpp/container/stack/pop

doc_CPP

2016-10-11 10:06:51

Comments

Leave a Comment

Please login to continue.

Popular Articles

std::stack Defined in header <stack> template< class T, class Container = std::deque<T> > class stack; The std::stack c

std::stack::stack (1) explicit stack( const Container& cont = Container() ); (until C++11) explicit stack( const Container& cont ); (since C++11)

operators (std::stack) template< class T, class Container > bool operator==( stack<T,Container>& lhs, stack<T,Container>& rhs );

std::stack::emplace template< class... Args > void emplace( Args&&... args ); (since C++11) Pushes new element on top of the stack. The element is

std::stack::empty bool empty() const; Checks if the underlying container has no elements, i.e. whether c.empty(). Parameters (none). Return value true if