std::queue

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

The std::queue class is a container adapter that gives the programmer the functionality of a queue - specifically, a FIFO (first-in, first-out) data structure.

Member types

Member type	Definition
container_type	Container
value_type	Container::value_type
size_type	Container::size_type
reference	Container::reference
const_reference	Container::const_reference

Member functions

(constructor)	constructs the queue  (public member function)
(destructor)	destructs the queue  (public member function)
operator=	assigns values to the container adaptor  (public member function)
Element access
front	access the first element  (public member function)
back	access the last element  (public member function)
Capacity
empty	checks whether the underlying container is empty  (public member function)
size	returns the number of elements  (public member function)
Modifiers
push	inserts element at the end  (public member function)
emplace (C++11)	constructs element in-place at the end  (public member function)
pop	removes the first element  (public member function)
swap	swaps the contents  (public member function)
Member objects
Container c	the underlying container  (protected member object)

Non-member functions

operator== operator!= operator< operator<= operator> operator>=	lexicographically compares the values in the queue  (function template)
std::swap(std::queue)	specializes the std::swap algorithm  (function template)

Helper classes

std::uses_allocator<std::queue> (C++11)	specializes the std::uses_allocator type trait  (function template)