función unordered_multimap swap() en C++ STL

Unordered_multimap ::swap() es una función integrada en C++ STL que intercambia el contenido de dos contenedores unordered_multimap. Los tamaños pueden diferir de ambos contenedores.

Sintaxis:

unordered_multimap_name1.swap(unordered_multimap_name2)

Parámetros: La función acepta un solo parámetro obligatorio unordered_multimap_name2 que especifica el unordered_multimap con el que se debe realizar el intercambio de unordered_multimap_name1 .

Valor devuelto: No devuelve nada.

Los siguientes programas ilustran la función anterior:

Programa 1:

// C++ program to illustrate the
// unordered_multimap::swap()
#include <bits/stdc++.h>
using namespace std;
  
int main()
{
  
    // declaration
    unordered_multimap<int, int> sample1, sample2;
  
    // inserts key and element
    // in sample1
    sample1.insert({ 10, 100 });
    sample1.insert({ 50, 500 });
  
    // inserts key and element
    // in sample1
    sample2.insert({ 20, 200 });
    sample2.insert({ 30, 300 });
    sample2.insert({ 30, 150 });
  
    cout << "Key and Elements of Sample1 before swap are:";
    for (auto it = sample1.begin(); it != sample1.end(); it++) {
        cout << "{" << it->first << ", " << it->second << "} ";
    }
  
    cout << "\nKey and Elements of Sample2 before swap are:";
    for (auto it = sample2.begin(); it != sample2.end(); it++) {
        cout << "{" << it->first << ", " << it->second << "} ";
    }
  
    // performs swap of two
    // unordered_multimaps
    sample1.swap(sample2);
  
    cout << "\n\nKey and Elements of Sample1 after swap are:";
    for (auto it = sample1.begin(); it != sample1.end(); it++) {
        cout << "{" << it->first << ", " << it->second << "} ";
    }
  
    cout << "\nKey and Elements of Sample2 after swap are:";
    for (auto it = sample2.begin(); it != sample2.end(); it++) {
        cout << "{" << it->first << ", " << it->second << "} ";
    }
  
    return 0;
}
Producción:

Key and Elements of Sample1 before swap are:{50, 500} {10, 100} 
Key and Elements of Sample2 before swap are:{20, 200} {30, 150} {30, 300} 

Key and Elements of Sample1 after swap are:{20, 200} {30, 150} {30, 300} 
Key and Elements of Sample2 after swap are:{50, 500} {10, 100}

Programa 2:

// C++ program to illustrate the
// unordered_multimap::swap()
#include <bits/stdc++.h>
using namespace std;
  
int main()
{
  
    // declaration
    unordered_multimap<char, char> sample1, sample2;
  
    // inserts key and element
    // in sample1
    sample1.insert({ 'a', 'A' });
    sample1.insert({ 'g', 'G' });
  
    // inserts key and element
    // in sample1
    sample2.insert({ 'b', 'B' });
    sample2.insert({ 'c', 'C' });
    sample2.insert({ 'd', 'D' });
  
    cout << "Key and Elements of Sample1 before swap are:";
    for (auto it = sample1.begin(); it != sample1.end(); it++) {
        cout << "{" << it->first << ", " << it->second << "} ";
    }
  
    cout << "\nKey and Elements of Sample2 before swap are:";
    for (auto it = sample2.begin(); it != sample2.end(); it++) {
        cout << "{" << it->first << ", " << it->second << "} ";
    }
  
    // performs swap of two
    // unordered_multimaps
    sample1.swap(sample2);
  
    cout << "\n\nKey and Elements of Sample1 after swap are:";
    for (auto it = sample1.begin(); it != sample1.end(); it++) {
        cout << "{" << it->first << ", " << it->second << "} ";
    }
  
    cout << "\nKey and Elements of Sample2 after swap are:";
    for (auto it = sample2.begin(); it != sample2.end(); it++) {
        cout << "{" << it->first << ", " << it->second << "} ";
    }
  
    return 0;
}
Producción:

Key and Elements of Sample1 before swap are:{g, G} {a, A} 
Key and Elements of Sample2 before swap are:{d, D} {b, B} {c, C} 

Key and Elements of Sample1 after swap are:{d, D} {b, B} {c, C} 
Key and Elements of Sample2 after swap are:{g, G} {a, A}

Publicación traducida automáticamente

Artículo escrito por gopaldave y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA

Deja una respuesta

Tu dirección de correo electrónico no será publicada. Los campos obligatorios están marcados con *