Login Register

std::deque::pop_front

void pop_front();

Removes the first element of the container.

Iterators and references to the erased element are invalidated. It is unspecified whether the past-the-end iterator is invalidated if the element is the last element in the container. Other references and iterators are not affected.	(since C++11)
Iterators and references to the erased element are invalidated. If the element is the last element in the container, the past-the-end iterator is also invalidated. Other references and iterators are not affected.	(until C++11)

Parameters

(none).

Return value

(none).

Complexity

Constant.

Exceptions

Does not throw.

See also

pop_back	removes the last element (public member function)
push_front	inserts an element to the beginning (public member function)

Links:

http://en.cppreference.com/w/cpp/container/deque/pop_front

doc_CPP

2016-10-11 10:02:21

Comments

Leave a Comment

Please login to continue.

Popular Articles

std::deque::pop_back void pop_back(); Removes the last element of the container. Calling pop_back on an empty container is undefined. Iterators and references to

std::deque::front reference front(); const_reference front() const; Returns a reference to the first element in the container. Calling front on an empty

std::deque::push_front void push_front( const T& value ); void push_front( T&& value ); (since C++11) Prepends the given element value to the begi

std::deque::emplace_front template< class... Args > void emplace_front( Args&&... args ); (since C++11) Inserts a new element to the beginning of the con

collections.deque.pop() pop() Remove and return an element from the right side of the deque. If no elements are present, raises an IndexError.