Login Register

std::queue::back

reference back();
const_reference back() const;

Returns reference to the last element in the queue. This is the most recently pushed element. Effectively calls c.back().

Parameters

(none).

Return value

reference to the last element.

Complexity

Constant.

See also

front	access the first element (public member function)
push	inserts element at the end (public member function)

Links:

http://en.cppreference.com/w/cpp/container/queue/back

doc_CPP

2025-01-10 15:47:30

Comments

Leave a Comment

Please login to continue.

Popular Articles

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

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

std::queue::swap void swap( queue& other ); (since C++11) Exchanges the contents of the container adaptor with those of other. Effectively calls using std

std::queue::pop void pop(); Removes an element from the front of the queue. Effectively calls c.pop_front(). Parameters (none). Return value (none).

std::queue::size size_type size() const; Returns the number of elements in the underlying container, that is, c.size(). Parameters (none). Return value