unordered_map hash_function() function in C++ STL

// C++ program to illustrate the
// unordered_map::hash_function()

#include <bits/stdc++.h>
using namespace std;

int main()
{

    // declaration
    unordered_map<string, string> sample;

    // inserts key and elements
    sample.insert({ "Ankit", "MNNIT" });
    sample.insert({ "Ram", "MNNIT" });
    sample.insert({ "Manoj", "Trichy" });
    sample.insert({ "geeks", "geeks" });

    // use of hash_function
    unordered_map<string, string>::hasher fn
        = sample.hash_function();

    cout << fn("geeks") << endl;

    // print the key and elements

    cout << "Key and Elements: ";
    for (auto it = sample.begin(); it != sample.end(); it++) {
        cout << "\n{" << it->first << ":"
             << it->second << "}, ";
    }
    return 0;
}

// C++ program to illustrate the
// unordered_map::hash_function()

#include <bits/stdc++.h>
using namespace std;

int main()
{

    // declaration
    unordered_map<int, int> sample;

    // inserts key and elements
    sample.insert({ 1, 5 });
    sample.insert({ 2, 6 });
    sample.insert({ 3, 6 });
    sample.insert({ 4, 7 });

    // use of hash_function
    unordered_map<int, int>::hasher fn
        = sample.hash_function();

    cout << fn(4) << endl;

    // print the key and elements

    cout << "Key and Elements: ";
    for (auto it = sample.begin(); it != sample.end(); it++) {
        cout << "\n{" << it->first << ":"
             << it->second << "}, ";
    }
    return 0;
}