Functions
template<class InputIterator, class T>
InputIterator	find_not (InputIterator first, InputIterator last, const T &value)
template<class InputRange, class T>
boost::range_iterator< InputRange >::type	find_not (InputRange &range, const T &value)
	find_not implementation
template<class InputRange, class T>
boost::range_const_iterator< InputRange >::type	find_not (const InputRange &range, const T &value)
	find_not implementation

Detailed Description

find_not is similar to find, except find_not will return the first iterator i in the range [first, last) for which *i is not equal to value. Returns last if no such iterator exists.

Requirements

Same as for find_if

Complexity Guarantee(s)

Same as for find_if

Function Documentation

◆ find_not() [1/3]

template<class InputIterator, class T>

InputIterator find_not	(	InputIterator	first,
		InputIterator	last,
		const T &	value )

Definition at line 111 of file find.hpp.

◆ find_not() [2/3]

template<class InputRange, class T>

boost::range_iterator< InputRange >::type find_not	(	InputRange &	range,
		const T &	value )

Definition at line 122 of file find.hpp.

◆ find_not() [3/3]