Information
The topic you requested is included in another documentation set. For convenience, it's displayed below. Choose Switch to see the topic in its original location.

swap Function (unordered_multiset)

 

Swaps the contents of two containers.

template<class Key, class Hash, class Pred, class Alloc>
    void swap(
        unordered_multiset <Key, Hash, Pred, Alloc>& left,
        unordered_multiset <Key, Hash, Pred, Alloc>& right);

Key

The key type.

Hash

The hash function object type.

Pred

The equality comparison function object type.

Alloc

The allocator class.

left

The first container to swap.

right

The second container to swap.

The template function executes left.unordered_multiset::swap(right).

Example

 

// std_tr1__unordered_set__u_ms_swap.cpp 
// compile with: /EHsc 
#include <unordered_set> 
#include <iostream> 

typedef std::unordered_multiset<char> Myset; 
int main() 
    { 
    Myset c1; 

    c1.insert('a'); 
    c1.insert('b'); 
    c1.insert('c'); 

// display contents " [c] [b] [a]" 
    for (Myset::const_iterator it = c1.begin(); 
        it != c1.end(); ++it) 
        std::cout << " [" << *it << "]"; 
    std::cout << std::endl; 

    Myset c2; 

    c2.insert('d'); 
    c2.insert('e'); 
    c2.insert('f'); 

    c1.swap(c2); 

// display contents " [f] [e] [d]" 
    for (Myset::const_iterator it = c1.begin(); 
        it != c1.end(); ++it) 
        std::cout << " [" << *it << "]"; 
    std::cout << std::endl; 

    swap(c1, c2); 

// display contents " [c] [b] [a]" 
    for (Myset::const_iterator it = c1.begin(); 
        it != c1.end(); ++it) 
        std::cout << " [" << *it << "]"; 
    std::cout << std::endl; 

    return (0); 
    } 

[c] [b] [a]
[f] [e] [d]
[c] [b] [a]

Requirements

Header: <unordered_set>

Namespace: std

Show: