Scribd
Upload
18 views2 pages

STD Queue

Uploaded by

jordan1412
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views2 pages

STD Queue

Uploaded by

jordan1412
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

std::queue

Defined in header <queue>


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

The std::queue class is a container adaptor 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.

Template parameters

T - The type of the stored elements. The behavior is undefined if T is not the same type as
Container::value_type.
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.

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

constructs the queue


(constructor)
(public member function)
destructs the queue
(destructor)
(public member function)
assigns values to the container adaptor
operator=
(public member function)

Element access

access the first element


front (public member function)
access the last element
back
(public member function)

Capacity

checks whether the underlying container is empty


empty
(public member function)
returns the number of elements
size
(public member function)

Modifiers

inserts element at the end


push
(public member function)
constructs element in-place at the end
emplace (C++11) (public member function)
inserts a range of elements at the end
push_range (C++23)
(public member function)
removes the first element
pop
(public member function)
swaps the contents
swap (C++11)
(public member function)

Member objects

the underlying container


Container c
(protected member object)

Non-member functions

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

Helper classes

specializes the std::uses_allocator type trait


std::uses_allocator<std::queue> (C++11) (class template specialization)

(since C++17)
Deduction guides

Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++
standards.

DR Applied to Behavior as published Correct behavior


std::queue did not support containers using proxy
LWG 307 (https://cplusplus.github.io/LWG/issue307) C++98 supported
reference types[1] in place of (const) value_type&

1. ↑ Such as containers similar to std::vector<bool> with additional support of pop_front(). The resolution of this
DR added support of std::vector<bool> for std::stack and std::priority_queue. The changes involving
std::queue are for maintaining consistency.

See also

double-ended queue
deque
(class template)
doubly-linked list
list (class template)

Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/queue&oldid=149245"

You might also like