Login Register

std::queue::front

reference front();
const_reference front() const;

Returns reference to the first element in the queue. This element will be the first element to be removed on a call to pop(). Effectively calls c.front().

Parameters

(none).

Return value

Reference to the first element.

Complexity

Constant.

See also

back	access the last element (public member function)
pop	removes the first element (public member function)

Links:

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

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::push void push( const T& value ); void push( T&& value ); (since C++11) Pushes the given element value to the end of the queue.

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