
- 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::contains() Function
The std::flat_set::contains() function in C++, is used to check whether the specified element in the flat_set. It returns a Boolean value true if the element is found, or else it returns false.
Unlike the find(), which returns an iterator , contains() offers a more direct and readable approach for testing. The time complexity of this function is O(log n).
Syntax
Following is the syntax for std::flat_set::contains() function.
bool contains( const Key& key ) const;
Parameters
- key − It indicates the key value of the element to search for.
Return Value
This function returns the true if the element is found otherwise false.
Example 1
Let's look at the following example, where we are going to consider the basic usage of the contains() function.
#include <iostream> #include <boost/container/flat_set.hpp> int main() { boost::container::flat_set < int > a = {2,4,6,8}; int x = 4; if (a.contains(x)) { std::cout << "Element is found in the set.\n"; } else { std::cout << "Element is not found.\n"; } return 0; }
Output
Output of the above code is as follows −
Element is found in the set.
Example 2
Consider the following example, where we are going to search for the element that does not exist and observing the output.
#include <iostream> #include <boost/container/flat_set.hpp> int main() { boost::container::flat_set < int > x = {1,3,5,7}; int a = 2; if (x.contains(a)) { std::cout << "Element exists in the set.\n"; } else { std::cout << "Element is not found.\n"; } return 0; }
Output
Following is the output of the above code −
Element is not found.
Example 3
In the following example, we are going to iterate over multiple numbers and use teh contains() to verfity their presence in the flat_set.
#include <iostream> #include <boost/container/flat_set.hpp> int main() { boost::container::flat_set < int > x = {2,4,6,8}; int test_values[] = {1,2,3,4}; for (int a: test_values) { std::cout << "Checking " << a << ": " << (x.contains(a) ? "Found\n" : "Not Found\n"); } return 0; }
Output
If we run the above code it will generate the following output −
Checking 1: Not Found Checking 2: Found Checking 3: Not Found Checking 4: Found