From Cppreference
|
|
|
|
|
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.
[edit] 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
|
[edit] Member functions
|
|
constructs the queue (public member function)
|
|
|
destructs the queue (public member function)
|
|
|
assigns values to the container adaptor (public member function)
|
Element access
|
|
|
access the first element (public member function)
|
|
|
access the last element (public member function)
|
Capacity
|
|
|
checks whether the underlying container is empty (public member function)
|
|
|
returns the number of elements (public member function)
|
Modifiers
|
|
|
inserts element at the end (public member function)
|
|
|
constructs element in-place at the end (public member function)
|
|
|
removes the first element (public member function)
|
|
|
swaps the contents (public member function)
|
Member objects
|
|
c
|
the underlying container (protected member object)
|
[edit] Non-member functions
|
|
lexicographically compares the values in the container (function)
|
|
|
specializes the std::swap() algorithm (function template)
|