unordered_set clear() function in C++ STL

unordered_set key_eq() function in C++ STL

Last Updated : 26 Oct, 2018

The unordered_set key_eq() is a built-in function in C++ STL which returns a boolean value according to the comparison. It returns the key equivalence comparison predicate used by the unordered_set. The key equivalence comparison is a predicate that takes two arguments and returns a bool value indicating whether they are equal. Syntax:

key_equal key_eq() const

Return Value: This method returns the key equality comparison object. Time Complexity: O(1) Example 1:

CPP

#include <iostream>
#include <string>
#include <unordered_set>
using namespace std;

int main()
{

    // unordered_set ms is created
    unordered_set<string> ms;

    bool res = ms.key_eq()("a", "A");

    cout << "ms.key_eq() is ";

    if (res == 1) {

        cout << "case insensitive";
    }
    else {

        // res is 0 as arguments are not equivalent
        cout << "case sensitive";
    }

    cout << "\n";

    return 0;
}

Output:

ms.key_eq() is case sensitive

Example 2:

CPP

#include <iostream>
#include <string>
#include <unordered_set>
using namespace std;

int main()
{

    // unordered_set mp is created
    unordered_set<string> mp;

    // the 2 strings are compared
    bool
        r
        = mp.key_eq()(
            "1000 is a huge number",
            "2000 is a huge number");

    cout << "strings are ";

    if (r == 1) {

        cout << "same";
    }
    else {

        // the strings are not same so r=0
        cout << "not same";
    }

    cout << "\n";

    return 0;
}

Output:

strings are not same

unordered_set clear() function in C++ STL

L

lakshita

Improve

Article Tags :

Practice Tags :

CPP

Similar Reads

unordered_map key_eq() function in C++ STL

unordered_map::key_eq() is a built-in function in C++ STL which returns a boolean value according to the comparison. It depends on the key equivalence comparison predicate used by the unordered_map container. The key equivalence comparison is a predicate which takes two arguments and returns a boole

unordered_multimap key_eq() function in C++ STL

unordered_multimap::key_eq() is a built-in function in C++ STL which returns a boolean value according to the comparison. It depends on the key equivalence comparison predicate used by the unordered_multimap container. The key equivalence comparison is a predicate which takes two arguments and retur

unordered_set cend() function in C++ STL

The unordered_set::cend() method is a built-in function in C++ STL which is used to return a const_iterator pointing to past-the-end element in the unordered_set container or in one of it's bucket. This function does not directly point to any element in the container. It is only used to denote the e

unordered_set empty() function in C++ STL

The unordered_set::empty is a built-in function in C++ STL which is used to check if an unordered_set container is empty or not. It returns True if the unordered_set container is empty, otherwise it returns False. Syntax: set_name.empty()Parameters: This function does not accepts any parameter. Retu

unordered_set clear() function in C++ STL

The unordered_set::clear() function is a built-in function in C++ STL which is used to clear an unordered_set container. That is, this function removes all of the elements from an unordered_set and empties it. All of the iterators, pointers, and references to the container are invalidated. This redu

unordered_set erase() function in C++ STL

The unordered_set::erase() function is a built-in function in C++ STL which is used to remove either a single element or a group of elements ranging from start(inclusive) to end(exclusive). This decreases the size of a container by the number of elements removed.Note: Buckets in unordered_set are nu

unordered_set insert() function in C++ STL

The unordered_set::insert() is a built-in function in C++ STL which is used to insert a new {element} in the unordered_set container. Each element is inserted only if it is not already present in the container (elements in an unordered_set have unique values). The insertion is done automatically at

unordered_set rehash() function in C++ STL

The unordered_set::rehash() is a built-in function in C++ STL which is used to set the number of buckets in the container of unordered_set to given size or more. If size is greater than the current size of the container, then rehash is called. If it is lower than the current size, then the function

unordered_set cbegin() function in C++ STL

The unordered_set::cbegin() method is a built-in function in C++ STL which is used to return a const_iterator pointing to the first element in the unordered_set container. This iterator can point to either the very the first element or first element of any specified bucket in the unordered_set conta

unordered_set reserve() function in C++ STL

The unordered_set::reserve() method is a builtin function in C++ STL which is used to request capacity change of unordered_set. It sets the number of buckets in the container to contain at least n elements. If n is greater than the current bucket_count multiplied by the max_load_factor, the containe