std::find, std::find_if, std::find_if_not

 

C++

Language

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

 

Algorithm library

Functions
Non-modifying sequence operations
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
Modifying sequence operations
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
Partitioning operations
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
Sorting operations (on sorted ranges)
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
Binary search operations (on sorted ranges)
lower_bound upper_bound	binary_search equal_range
Set operations (on sorted ranges)
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
Heap operations
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
Minimum/maximum operations
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
Numeric operations
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
C library
qsort	bsearch

 

Defined in header <algorithm>
template< class InputIterator, class T > InputIterator find( InputIterator first, InputIterator last,                     const T& value );	(1)
template< class InputIterator, class UnaryPredicate > InputIterator find_if( InputIterator first, InputIterator last,                        UnaryPredicate p );	(2)
template< class InputIterator, class UnaryPredicate > InputIterator find_if_not( InputIterator first, InputIterator last,                            UnaryPredicate q );	(3)	(since C++11)

These functions find the first element in the range [first, last) that satisfies specific criteria:

1. find searches for an element equal to value

2. find_if searches for an element for which predicate p returns true

3. find_if_not searches for element for which predicate q returns false

Parameters

first, last	-	the range of elements to examine
value	-	value to compare the elements to
p	-	unary predicate which returns ​true for the required element. The signature of the predicate function should be equivalent to the following: bool pred(const Type &a); The signature does not need to have const &, but the function must not modify the objects passed to it. The type Type must be such that an object of type InputIterator can be dereferenced and then implicitly converted to Type. ​
q	-	unary predicate which returns ​false for the required element. The signature of the predicate function should be equivalent to the following: bool pred(const Type &a); The signature does not need to have const &, but the function must not modify the objects passed to it. The type Type must be such that an object of type InputIterator can be dereferenced and then implicitly converted to Type. ​

Return value

iterator to the first element satisfying the condition or last if no such element is found.

Complexity

At most last - first applications of the predicate

Possible implementation

First version
template<class InputIterator, class T> InputIterator find(InputIterator first, InputIterator last, const T& value) { for (; first != last; ++first) { if (*first == value) { return first; } } return last; }
Second version
template<class InputIterator, class UnaryPredicate> InputIterator find_if(InputIterator first, InputIterator last, UnaryPredicate p) { for (; first != last; ++first) { if (p(*first)) { return first; } } return last; }
Third version
template<class InputIterator, class UnaryPredicate> InputIterator find_if_not(InputIterator first, InputIterator last, UnaryPredicate q) { for (; first != last; ++first) { if (!q(*first)) { return first; } } return last; }

If you do not have C++11, an equivalent to std::find_if_not is to use std::find_if with the negated predicate.

template<class InputIterator, class UnaryPredicate> InputIterator find_if_not(InputIterator first, InputIterator last, UnaryPredicate q) { return std::find_if(first, last, std::not1(q)); }

Example

The following example finds an integer in a vector of integers.

#include <iostream>
#include <algorithm>
#include <vector>
 
int main()
{
    int n1 = 3;
    int n2 = 5;
 
    std::vector<int> v{0, 1, 2, 3, 4};
 
    auto result1 = std::find(v.begin(), v.end(), n1);
    auto result2 = std::find(v.begin(), v.end(), n2);
 
    if (result1 != v.end()) {
        std::cout << "v contains: " << n1 << '\n';
    } else {
        std::cout << "v does not contain: " << n1 << '\n';
    }
 
    if (result2 != v.end()) {
        std::cout << "v contains: " << n2 << '\n';
    } else {
        std::cout << "v does not contain: " << n2 << '\n';
    }
}

Output:

v contains: 3
v does not contain: 5

See also

adjacent_find	finds two identical (or some other relationship) items adjacent to each other (function template)
find_end	finds the last sequence of elements in a certain range (function template)
find_first_of	searches for any one of a set of elements (function template)
mismatch	finds the first position where two ranges differ (function template)
search	searches for a range of elements (function template)