unordered_set empty() function in C++ STL

unordered_set size() function in C++ STL

Last Updated : 05 Jun, 2023

The unordered_set::size() method is a builtin function in C++ STL which is used to return the number of elements in the unordered_set container.

Syntax:

unordered_set_name.size()

Parameter: It does not accepts any parameter.

Return Value: The function returns the number of elements in the container. Below programs illustrate the unordered_set::size() function:

Program 1:

CPP

// C++ program to illustrate the 
// unordered_set.size() function 
#include <iostream> 
#include <unordered_set> 

using namespace std; 

int main() 
{ 

    unordered_set<int> arr1 = { 1, 2, 3, 4, 5 }; 

    // prints the size of arr1 
    cout << "size of arr1:" << arr1.size(); 

    // prints the element 
    cout << "\nThe elements are: "; 
    for (auto it = arr1.begin(); it != arr1.end(); it++) 
        cout << *it << " "; 

    return 0; 
}

Output:

size of arr1:5
The elements are: 5 1 2 3 4

Program 2:

CPP

// C++ program to illustrate the 
// unordered_set::size() function 
// when container is empty 
#include <iostream> 
#include <unordered_set> 

using namespace std; 

int main() 
{ 

    unordered_set<int> arr2 = {}; 

    // prints the size 
    cout << "Size of arr2 : " << arr2.size(); 

    return 0; 
}

Output:

Size of arr2 : 0

Time complexity: O(1)

unordered_set empty() function in C++ STL

B

barykrg

Improve

Article Tags :

Practice Tags :

Similar Reads

Unordered Sets in C++ STL

In C++, unordered_set is an unordered associative container that stores unique elements. Unlike set, it stores its elements using hashing. This provides average constant-time O(1) search, insert, and delete operations but the elements are not sorted in any particular order.Example:C++#include <io

Different Ways to Initialize an unordered_set in C++

An unordered_set is an associated container available in the C++ Standard Template Library(STL) that is used for unique elements without any specific ordering, it internally uses the working principle of a hashtable to store elements. Different ways to Initialize an unordered_set in C++ Initializati

unordered set of Vectors in C++ with Examples

What is an unordered set? In C++, an unordered set is an unordered container that can hold a number of unique elements. Unlike a set, elements in an unordered set are not arranged in any particular order. Internally, an unordered set is implemented using a hash table where keys are hashed into indic

unordered set of Pairs in C++ with Examples

What is pair? Utility header in C++ provides us pair container. A pair consists of two data elements or objects. The first element is referenced as â€˜firstâ€™ and the second element as â€˜secondâ€™ and the order is fixed (first, second).Pair is used to combine together two values that may be different in t

How to create an unordered_set of user defined class or struct in C++?

The unordered_set internally implements a hash table to store elements. By default we can store only predefined type as int, string, float etc. If we want to store the element of user defined type as structure then compiler will show an error because before storing elements into unordered_set compil

set vs unordered_set in C++ STL

Differences : | set | unordered_set --------------------------------------------------------- Ordering | increasing order | no ordering | (by default) | Implementation | Self balancing BST | Hash Table | like Red-Black Tree | search time | log(n) | O(1) -> Average | | O(n) -> Worst Case Insert