Showing content from https://cplusplus.com/queue below:
class template
<queue>
std::queue
template <class T, class Container = deque<T> > class queue;
FIFO queue
queues are a type of container adaptor, specifically designed to operate in a FIFO context (first-in first-out), where elements are inserted into one end of the container and extracted from the other.
queues are implemented as containers adaptors, which are classes that use an encapsulated object of a specific container class as its underlying container, providing a specific set of member functions to access its elements. Elements are pushed into the "back" of the specific container and popped from its "front".
The underlying container may be one of the standard container class template or some other specifically designed container class. This underlying container shall support at least the following operations:
- empty
- size
- front
- back
- push_back
- pop_front
The standard container classes deque and list fulfill these requirements. By default, if no container class is specified for a particular queue class instantiation, the standard container deque is used.
Template parameters
-
T
-
Type of the elements.
Aliased as member type queue::value_type.
-
Container
-
Type of the internal underlying container object where the elements are stored.
Its value_type shall be T.
Aliased as member type queue::container_type.
Member types member type definition notes value_type The first template parameter (T) Type of the elements container_type The second template parameter (Container) Type of the underlying container size_type an unsigned integral type usually the same as size_t member type definition notes value_type The first template parameter (T) Type of the elements container_type The second template parameter (Container) Type of the underlying container reference container_type::reference usually, value_type& const_reference container_type::const_reference usually, const value_type& size_type an unsigned integral type usually, the same as size_t
Member functions
-
(constructor)
-
Construct queue (public member function)
-
empty
-
Test whether container is empty (public member function)
-
size
-
Return size (public member function)
-
front
-
Access next element (public member function)
-
back
-
Access last element (public member function)
-
push
-
Insert element (public member function)
-
emplace
-
Construct and insert element (public member function)
-
pop
-
Remove next element (public member function)
-
swap
-
Swap contents (public member function)
Non-member function overloads
-
relational operators
-
Relational operators for queue (function)
-
swap (queue)
-
Exchange contents of queues (public member function)
Non-member class specializations
-
uses_allocator<queue>
-
Uses allocator for queue (class template)
RetroSearch is an open source project built by @garambo
| Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4