std::queue<T,Container>::pop
From cppreference.com
C++
Containers library
(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::queue| Member functions | ||||
| Element access | ||||
| Capacity | ||||
| Modifiers | ||||
(C++23) | ||||
(C++11) | ||||
queue::pop | ||||
(C++11) | ||||
| Non-member functions | ||||
(C++11) | ||||
| Helper classes | ||||
(C++11) | ||||
(C++23) | ||||
| Deduction guides(C++17) |
| void pop(); |
|
Removes an element from the front of the queue. Effectively calls c.pop_front().
Contents |
[edit] Parameters
(none)
[edit] Return value
(none)
[edit] Complexity
Equal to the complexity of Container::pop_front.
[edit] Example
[edit] See also
| (C++11) |
constructs element in-place at the end (public member function) [edit] |
| inserts element at the end (public member function) [edit] | |
| access the first element (public member function) [edit] |