std::set<Key,Compare,Allocator>::contains

 

C++

Language

Standard Library Headers

Freestanding and hosted implementations

Named requirements

Language support library

Concepts library (C++20)

Diagnostics library

Utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Filesystem library (C++17)

Technical Specifications

 

Containers library

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

span (C++20)

 

std::set

Member functions

set::set

set::~set

set::operator=

set::get_allocator

Iterators

set::beginset::cbegin (C++11)

set::endset::cend (C++11)

set::rbeginset::crbegin (C++11)

set::rendset::crend (C++11)

Capacity

set::empty

set::size

set::max_size

Modifiers

set::clear

set::insert

set::emplace (C++11)

set::emplace_hint (C++11)

set::erase

set::swap

set::extract (C++17)

set::merge (C++17)

Lookup

set::count

set::find

set::contains (C++20)

set::equal_range

set::lower_bound

set::upper_bound

Observers

set::key_comp

set::value_comp

Deduction guides(C++17)

 

bool contains( const Key& key ) const;	(1)	(since C++20)
template< class K > bool contains( const K& x ) const;	(2)	(since C++20)

1) Checks if there is an element with key equivalent to key in the container.

2) Checks if there is an element with key that compares equivalent to the value x. This overload only participates in overload resolution if the qualified-id Compare::is_transparent is valid and denotes a type. It allows calling this function without constructing an instance of Key.

Parameters

key	-	key value of the element to search for
x	-	a value of any type that can be transparently compared with a key

Return value

true if there is such an element, otherwise false.

Complexity

Logarithmic in the size of the container.

Example

Run this code

#include <iostream>
#include <set>
 
int main()
{
    std::set<int> example = {1, 2, 3, 4};
 
    if(example.contains(2)) {
        std::cout << "Found\n";
    } else {
        std::cout << "Not found\n";
    }
}

Output:

Found

See also

find	finds element with specific key (public member function)
count	returns the number of elements matching specific key (public member function)
equal_range	returns range of elements matching a specific key (public member function)