std::swap(std::queue)

 

哋它亢++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros (哋它亢++20)

Language support library

Concepts library (哋它亢++20)

Metaprogramming library (哋它亢++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (哋它亢++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (哋它亢++17)

Regular expressions library (哋它亢++11)

Concurrency support library (哋它亢++11)

Technical specifications

Symbols index

External libraries

 

Containers library

Sequence

array (哋它亢++11)

vector

vector<bool>

deque

forward_list (哋它亢++11)

list

Associative

set

multiset

map

multimap

Unordered associative

unordered_set (哋它亢++11)

unordered_multiset (哋它亢++11)

unordered_map (哋它亢++11)

unordered_multimap (哋它亢++11)

Adaptors

stack

queue

priority_queue

flat_set (哋它亢++23)

flat_multiset (哋它亢++23)

flat_map (哋它亢++23)

flat_multimap (哋它亢++23)

Views

span (哋它亢++20)

mdspan (哋它亢++23)

Iterator invalidation

Member function table

Non-member function table

 

std::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 (哋它亢++23)

queue::emplace (哋它亢++11)

queue::pop

queue::swap (哋它亢++11)

Non-member functions

swap(std::queue) (哋它亢++11)

operator==operator!=operator<operator>operator<=operator>=operator<=> (哋它亢++20)

Helper classes

uses_allocator<std::queue> (哋它亢++11)

formatter<std::queue> (哋它亢++23)

Deduction guides(哋它亢++17)

 

Defined in header <queue>
template< class T, class Container > void swap( std::queue<T, Container>& lhs,            std::queue<T, Container>& rhs );		(since 哋它亢++11) (until 哋它亢++17)
template< class T, class Container > void swap( std::queue<T, Container>& lhs,            std::queue<T, Container>& rhs )                noexcept(/* see below */);		(since 哋它亢++17)

Specializes the std::swap algorithm for std::queue. Swaps the contents of lhs and rhs. Calls lhs.swap(rhs).

This overload participates in overload resolution only if std::is_swappable_v<Container> is true.

(since 哋它亢++17)

Parameters

lhs, rhs

-

containers whose contents to swap

Return value

(none)

Complexity

Same as swapping the underlying container.

Exceptions

noexcept specification:   noexcept(noexcept(lhs.swap(rhs)))

(since 哋它亢++17)

Notes

Although the overloads of std::swap for container adaptors are introduced in 哋它亢++11, container adaptors can already be swapped by std::swap in 哋它亢++98. Such calls to std::swap usually have linear time complexity, but better complexity may be provided.

Example

Run this code

#include <algorithm>
#include <iostream>
#include <queue>
 
int main()
{
    std::queue<int> alice;
    std::queue<int> bob;
 
    auto print = [](const auto& title, const auto& cont)
    {
        std::cout << title << " size=" << cont.size();
        std::cout << " front=" << cont.front();
        std::cout << " back=" << cont.back() << '\n';
    };
 
    for (int i = 1; i < 4; ++i)
        alice.push(i);
    for (int i = 7; i < 11; ++i)
        bob.push(i);
 
    // Print state before swap
    print("Alice:", alice);
    print("Bob  :", bob);
 
    std::cout << "-- SWAP\n";
    std::swap(alice, bob);
 
    // Print state after swap
    print("Alice:", alice);
    print("Bob  :", bob);
}

Output:

Alice: size=3 front=1 back=3
Bob  : size=4 front=7 back=10
-- SWAP
Alice: size=4 front=7 back=10
Bob  : size=3 front=1 back=3

See also

swap (哋它亢++11)

swaps the contents (public member function)