
- C++ Library - Home
- C++ Library - <fstream>
- C++ Library - <iomanip>
- C++ Library - <ios>
- C++ Library - <iosfwd>
- C++ Library - <iostream>
- C++ Library - <istream>
- C++ Library - <ostream>
- C++ Library - <sstream>
- C++ Library - <streambuf>
- C++ Library - <atomic>
- C++ Library - <complex>
- C++ Library - <exception>
- C++ Library - <functional>
- C++ Library - <limits>
- C++ Library - <locale>
- C++ Library - <memory>
- C++ Library - <new>
- C++ Library - <numeric>
- C++ Library - <regex>
- C++ Library - <stdexcept>
- C++ Library - <string>
- C++ Library - <thread>
- C++ Library - <tuple>
- C++ Library - <typeinfo>
- C++ Library - <utility>
- C++ Library - <valarray>
- The C++ STL Library
- C++ Library - <array>
- C++ Library - <bitset>
- C++ Library - <deque>
- C++ Library - <forward_list>
- C++ Library - <list>
- C++ Library - <map>
- C++ Library - <multimap>
- C++ Library - <queue>
- C++ Library - <priority_queue>
- C++ Library - <set>
- C++ Library - <stack>
- C++ Library - <unordered_map>
- C++ Library - <unordered_set>
- C++ Library - <vector>
- C++ Library - <algorithm>
- C++ Library - <iterator>
- The C++ Advanced Library
- C++ Library - <any>
- C++ Library - <barrier>
- C++ Library - <bit>
- C++ Library - <chrono>
- C++ Library - <cinttypes>
- C++ Library - <clocale>
- C++ Library - <condition_variable>
- C++ Library - <coroutine>
- C++ Library - <cstdlib>
- C++ Library - <cstring>
- C++ Library - <cuchar>
- C++ Library - <charconv>
- C++ Library - <cfenv>
- C++ Library - <cmath>
- C++ Library - <ccomplex>
- C++ Library - <expected>
- C++ Library - <format>
- C++ Library - <future>
- C++ Library - <flat_set>
- C++ Library - <flat_map>
- C++ Library - <filesystem>
- C++ Library - <generator>
- C++ Library - <initializer_list>
- C++ Library - <latch>
- C++ Library - <memory_resource>
- C++ Library - <mutex>
- C++ Library - <mdspan>
- C++ Library - <optional>
- C++ Library - <print>
- C++ Library - <ratio>
- C++ Library - <scoped_allocator>
- C++ Library - <semaphore>
- C++ Library - <source_location>
- C++ Library - <span>
- C++ Library - <spanstream>
- C++ Library - <stacktrace>
- C++ Library - <stop_token>
- C++ Library - <syncstream>
- C++ Library - <system_error>
- C++ Library - <string_view>
- C++ Library - <stdatomic>
- C++ Library - <variant>
- C++ STL Library Cheat Sheet
- C++ STL - Cheat Sheet
- C++ Programming Resources
- C++ Programming Tutorial
- C++ Useful Resources
- C++ Discussion
C++ flat_set::size() Function
The std::flat_set::size() function in C++, is used to determine the number of elements in a flat_set. It returns the total count of elements stored in the container.
It is used for checking the container current size, helping in capacity management and iteration limits. This function operates in constant time, making it efficient for frequent queries.
Syntax
Following is the syntax for std::flat_set::size() function.
size() const noexcept;
Parameters
It does not accepts any parameter.
Return Value
This function returns the number of elements in the container adaptor.
Example 1
Let's look at the following example, where we are going to consider the basic usage of the size() function.
#include <iostream> #include <boost/container/flat_set.hpp> int main() { boost::container::flat_set < int > a = {12,23,34}; std::cout << "Result : " << a.size() << std::endl; return 0; }
Output
Output of the above code is as follows −
Result : 3
Example 2
Consider the following example, where we are going to check the size of the flat_set after erasing the elements using the erase().
#include <iostream> #include <boost/container/flat_set.hpp> int main() { boost::container::flat_set < int > x = {1,23,43,2}; std::cout << "Size Before Erasing: " << x.size() << std::endl; x.erase(1); x.erase(43); std::cout << "Size After Erasing: " << x.size() << std::endl; return 0; }
Output
Output of the above code is as follows −
Size Before Erasing: 4 Size After Erasing: 2
Example 3
In the following example, We are going to check the size of the flat_set before and after the insertion of elements.
#include <iostream> #include <boost/container/flat_set.hpp> int main() { boost::container::flat_set < int > x; std::cout << "Size Before Insertion: " << x.size() << std::endl; x.insert(12); x.insert(23); x.insert(34); std::cout << "Size After Insertion: " << x.size() << std::endl; return 0; }
Output
If we run the above code it will generate the following output −
Size Before Insertion: 0 Size After Insertion: 3