Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/container/queue"

From cppreference.com
< cpp‎ | container
m (Shorten template names. Use {{lc}} where appropriate.)
m (Update links.)
Line 28: Line 28:
 
{{dsc begin}}
 
{{dsc begin}}
 
{{dsc hitem | Member type | Definition}}
 
{{dsc hitem | Member type | Definition}}
−
{{dsc inc | cpp/container/dcl list container_type | queue}}
+
{{dsc inc | cpp/container/dsc container_type | queue}}
−
{{dsc inc | cpp/container/dcl list value_type | queue}}
+
{{dsc inc | cpp/container/dsc value_type | queue}}
−
{{dsc inc | cpp/container/dcl list size_type | queue}}
+
{{dsc inc | cpp/container/dsc size_type | queue}}
−
{{dsc inc | cpp/container/dcl list reference | queue}}
+
{{dsc inc | cpp/container/dsc reference | queue}}
−
{{dsc inc | cpp/container/dcl list const_reference | queue}}
+
{{dsc inc | cpp/container/dsc const_reference | queue}}
 
{{dsc end}}
 
{{dsc end}}
  
 
===Member functions===
 
===Member functions===
 
{{dsc begin}}
 
{{dsc begin}}
−
{{dsc inc | cpp/container/dcl list constructor | queue}}
+
{{dsc inc | cpp/container/dsc constructor | queue}}
−
{{dsc inc | cpp/container/dcl list destructor | queue}}
+
{{dsc inc | cpp/container/dsc destructor | queue}}
−
{{dsc inc | cpp/container/dcl list operator{{=}} | queue}}
+
{{dsc inc | cpp/container/dsc operator{{=}} | queue}}
  
 
{{dsc h2 | Element access}}
 
{{dsc h2 | Element access}}
−
{{dsc inc | cpp/container/dcl list front | queue}}
+
{{dsc inc | cpp/container/dsc front | queue}}
−
{{dsc inc | cpp/container/dcl list back | queue}}
+
{{dsc inc | cpp/container/dsc back | queue}}
  
 
{{dsc h2 | Capacity}}
 
{{dsc h2 | Capacity}}
−
{{dsc inc | cpp/container/dcl list empty | queue}}
+
{{dsc inc | cpp/container/dsc empty | queue}}
−
{{dsc inc | cpp/container/dcl list size | queue}}
+
{{dsc inc | cpp/container/dsc size | queue}}
  
 
{{dsc h2 | Modifiers}}
 
{{dsc h2 | Modifiers}}
−
{{dsc inc | cpp/container/dcl list push | queue}}
+
{{dsc inc | cpp/container/dsc push | queue}}
−
{{dsc inc | cpp/container/dcl list emplace | queue}}
+
{{dsc inc | cpp/container/dsc emplace | queue}}
−
{{dsc inc | cpp/container/dcl list pop | queue}}
+
{{dsc inc | cpp/container/dsc pop | queue}}
−
{{dsc inc | cpp/container/dcl list swap | queue}}
+
{{dsc inc | cpp/container/dsc swap | queue}}
  
 
{{dsc h1 | Member objects}}
 
{{dsc h1 | Member objects}}
−
{{dsc inc | cpp/container/dcl list c | queue}}
+
{{dsc inc | cpp/container/dsc c | queue}}
 
{{dsc end}}
 
{{dsc end}}
  
 
===Non-member functions===
 
===Non-member functions===
 
{{dsc begin}}
 
{{dsc begin}}
−
{{dsc inc | cpp/container/dcl list operator_cmp | queue}}
+
{{dsc inc | cpp/container/dsc operator_cmp | queue}}
−
{{dsc inc | cpp/container/dcl list swap2 | queue}}
+
{{dsc inc | cpp/container/dsc swap2 | queue}}
 
{{dsc end}}
 
{{dsc end}}
  
 
===Helper classes===
 
===Helper classes===
 
{{dsc begin}}
 
{{dsc begin}}
−
{{dsc inc | cpp/container/dcl list uses_allocator | queue}}
+
{{dsc inc | cpp/container/dsc uses_allocator | queue}}
 
{{dsc end}}
 
{{dsc end}}
  

Revision as of 21:51, 31 May 2013

 
C++
 
Containers library
 
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.

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

Template parameters

T - The type of the stored elements.
Container - The type of the underlying container to use to store the elements. The container must satisfy the requirements of Template:concept. Additionally, it must provide the following functions with the usual semantics:
  • back()
  • front()
  • push_back()
  • pop_front()

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

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]

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 container adaptor 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]
(C++11)
 swaps the contents
(public member function) [edit]

Member objects

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

Non-member functions

(C++20)
 lexicographically compares the values of two queues
(function template) [edit]
(C++11)
 specializes the std::swap algorithm
(function template) [edit]

Helper classes

(C++11)
 specializes the std::uses_allocator type trait
(class template specialization) [edit]
Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/queue&oldid=57296"