std::queue<T,Container>::queue - cppreference.com ([original](https://en.cppreference.com/w/cpp/container/queue/queue.html)) (raw)
| node-handle(C++17) |
|---|
| Sequence |
| array(C++11) |
| vector |
| vector |
| inplace_vector(C++26) |
| hive(C++26) |
| deque |
| forward_list(C++11) |
| list |
| Associative |
| set |
| multiset |
| map |
| multimap |
| Unordered associative |
| unordered_set(C++11) |
| unordered_multiset(C++11) |
| unordered_map(C++11) |
| unordered_multimap(C++11) |
| Adaptors |
| stack |
| queue |
| priority_queue |
| flat_set(C++23) |
| flat_multiset(C++23) |
| flat_map(C++23) |
| flat_multimap(C++23) |
| Views |
| span(C++20) |
| mdspan(C++23) |
| Tables |
| Iterator invalidation |
| Member function table |
| Non-member function table |
[std::queue](../queue.html "cpp/container/queue")
| Member functions |
|---|
| queue::queue |
| queue::~queue |
| queue::operator= |
| Element access |
| queue::front |
| queue::back |
| Capacity |
| queue::empty |
| queue::size |
| Modifiers |
| queue::push |
| queue::push_range(C++23) |
| queue::emplace(C++11) |
| queue::pop |
| queue::swap(C++11) |
| Non-member functions |
| swap(std::queue)(C++11) |
| operator==operator!=operatoroperator<=operator>=operator<=>(C++20) |
| Helper classes |
| uses_allocatorstd::queue(C++11) |
| formatterstd::queue(C++23) |
| Deduction guides(C++17) |
| ~queue(); | | (constexpr since C++26) | | ---------- | | ----------------------- |
Destructs the queue. The destructors of the elements are called and the used storage is deallocated.
[edit] Complexity
Linear in the size of *this.
[edit] Notes
If the elements are pointers, the pointed-to objects are not destroyed.