set::size() in C++ STL
Sets are containers that store unique elements following a specific order. Internally, the elements in a set are always sorted. Sets are typically implemented as binary search trees.
set::size()
size() function is used to return the size of the set container or the number of elements in the set container.
Syntax:
set_name.size()
Return Value: It returns the number of elements in the set container.
Examples:
Input : set1{'a', 'b', 'c', 'd'};
set1.size();
Output : 4
Input : set2{};
set2.size();
Output : 0
Errors and Exceptions
1. It has a no exception throw guarantee.
2. Shows error when a parameter is passed.
// C++ program to illustrate // size() function on set #include <bits/stdc++.h> using namespace std; int main() { // Take any two sets set<char> set1, set2; for (int i = 0; i < 4; i++) { set1.insert('a' + i); } // Printing the size of sets cout << "set1 size: " << set1.size(); cout << endl; cout << "set2 size: " << set2.size(); return 0; } |
chevron_right
filter_none
Output:
set1 size: 4 set2 size: 0
Time complexity: Constant
Recommended Posts:
- Vector of Vectors in C++ STL with Examples
- Array of Vectors in C++ STL
- Difference between Virtual function and Pure virtual function in C++
- cin get() in C++ with Examples
- Difference between Increment and Decrement Operators
- Map of Vectors in C++ STL with Examples
- Problem in comparing Floating point numbers and how to compare them correctly?
- exit(0) vs exit(1) in C/C++ with Examples
- C++ program to print all Even and Odd numbers from 1 to N
- Reverse the content of a file and store it in another
- Minimum cells to be flipped to get a 2*2 submatrix with equal elements
- Nested Loops in C++ with Examples
- _Find_first() function in C++ bitset with Examples
- _Find_next() function in C++ bitset with Examples
- Left-Right traversal of all the levels of N-ary tree
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
