Namespaces
Variants
Views
Actions

std::queue

From cppreference.com
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.

Contents

[edit] Member types

Member type Definition
container_type Container [edit]
value_type Container::value_type [edit]
size_type Container::size_type [edit]
reference Container::reference [edit]
const_reference Container::const_reference [edit]

[edit] Member functions

constructs the queue
(public member function) [edit]
destructs the queue
(public member function) [edit]
assigns values to the container adaptor
(public member function) [edit]
Element access
access the first element
(public member function) [edit]
access the last element
(public member function) [edit]
Capacity
checks whether the underlying container is empty
(public member function) [edit]
returns the number of elements
(public member function) [edit]
Modifiers
inserts element at the end
(public member function) [edit]
(C++11)
constructs element in-place at the end
(public member function) [edit]
removes the first element
(public member function) [edit]
swaps the contents
(public member function) [edit]

Member objects

Container c
the underlying container
(protected member object) [edit]

[edit] Non-member functions

lexicographically compares the values in the queue
(function template) [edit]
specializes the std::swap algorithm
(function template) [edit]

[edit] Helper classes

specializes the std::uses_allocator type trait
(function template) [edit]