std::queue

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

The class template acts as a wrapper to the underlying container - only a specific set of functions is provided. The queue pushes the elements on the back of the underlying container and pops them from the front.

Contents

[edit] Template parameters

T - The type of the stored elements. The behavior is undefined if T is not the same type as Container::value_type. (since C++17)
Container - The type of the underlying container to use to store the elements. The container must satisfy the requirements of SequenceContainer. Additionally, it must provide the following functions with the usual semantics:
  • back()
  • front()
  • push_back()
  • pop_front()

The standard containers std::deque and std::list satisfy these requirements.

[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)
(C++11)
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

Container c
the underlying container
(protected member object)

[edit] Non-member functions

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

[edit] Helper classes

specializes the std::uses_allocator type trait
(function template)