find [Non-Mutating Algorithms]

Modules
	find_not
	find_if_not
Functions
template<class ForwardRange >
boost::range_iterator < ForwardRange >::type	adjacent_find (ForwardRange &range)
template<class ForwardRange , class BinaryPredicate >
boost::range_iterator < ForwardRange >::type	adjacent_find (ForwardRange &range, BinaryPredicate pred)
template<class ForwardRange , class BinaryPredicate >
boost::range_const_iterator < ForwardRange >::type	adjacent_find (const ForwardRange &range, BinaryPredicate pred)
template<class ForwardRange >
boost::range_const_iterator < ForwardRange >::type	adjacent_find (const ForwardRange &range)
template<class ForwardIterator , class BinaryPredicate >
ForwardIterator	adjacent_find (ForwardIterator first, ForwardIterator last, BinaryPredicate pred)
template<class InputRange , class T >
boost::range_const_iterator < InputRange >::type	find (const InputRange &range, const T &value)
template<class InputRange , class T >
boost::range_iterator < InputRange >::type	find (InputRange &range, const T &value)
template<class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >
boost::range_iterator < ForwardRange1 >::type	find_end (ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate comp)
template<class ForwardRange1 , class ForwardRange2 >
boost::range_iterator < ForwardRange1 >::type	find_end (ForwardRange1 &range1, const ForwardRange2 &range2)
template<class ForwardRange1 , class ForwardRange2 >
boost::range_const_iterator < ForwardRange1 >::type	find_end (const ForwardRange1 &range1, const ForwardRange2 &range2)
template<class ForwardIterator1 , class ForwardIterator2 , class BinaryPredicate >
ForwardIterator1	find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate comp)
template<class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >
boost::range_const_iterator < ForwardRange1 >::type	find_end (const ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate comp)
template<class InputRange , class Predicate >
boost::range_iterator < InputRange >::type	find_if (InputRange &range, Predicate pred)
template<class InputIterator , class Predicate >
InputIterator	find_if (InputIterator first, InputIterator last, Predicate pred)
template<class InputRange , class Predicate >
boost::range_const_iterator < InputRange >::type	find_if (const InputRange &range, Predicate pred)
template<typename I , typename T >
std::pair< I, I >	find_range (I f, I l, const T &x)
template<typename I , typename P >
std::pair< I, I >	find_range_if (I f, I l, P p)

---

Detailed Description

See also:

• STL documentation for find
• STL documentation for find_if
• STL documentation for find_end
• STL documentation for find_first_of
• STL documentation for adjacent_find

---

Function Documentation

boost::range_iterator<ForwardRange>::type adobe::adjacent_find

(

ForwardRange &

range )

find implementation

Definition at line 376 of file find.hpp.

boost::range_iterator<ForwardRange>::type adobe::adjacent_find	(	ForwardRange &	range,
		BinaryPredicate	pred
	)

find implementation

Definition at line 412 of file find.hpp.

boost::range_const_iterator<ForwardRange>::type adobe::adjacent_find	(	const ForwardRange &	range,
		BinaryPredicate	pred
	)

find implementation

Definition at line 424 of file find.hpp.

boost::range_const_iterator<ForwardRange>::type adobe::adjacent_find

(

const ForwardRange &

range )

find implementation

Definition at line 388 of file find.hpp.

ForwardIterator adobe::adjacent_find	(	ForwardIterator	first,
		ForwardIterator	last,
		BinaryPredicate	pred
	)

find implementation

Definition at line 400 of file find.hpp.

boost::range_const_iterator<InputRange>::type adobe::find	(	const InputRange &	range,
		const T &	value
	)

find implementation

Definition at line 163 of file find.hpp.

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

find implementation

Definition at line 151 of file find.hpp.

boost::range_iterator<ForwardRange1>::type adobe::find_end	(	ForwardRange1 &	range1,
		const ForwardRange2 &	range2,
		BinaryPredicate	comp
	)

find implementation

Definition at line 275 of file find.hpp.

boost::range_iterator<ForwardRange1>::type adobe::find_end	(	ForwardRange1 &	range1,
		const ForwardRange2 &	range2
	)

find implementation

Definition at line 236 of file find.hpp.

boost::range_const_iterator<ForwardRange1>::type adobe::find_end	(	const ForwardRange1 &	range1,
		const ForwardRange2 &	range2
	)

find implementation

Definition at line 249 of file find.hpp.

ForwardIterator1 adobe::find_end	(	ForwardIterator1	first1,
		ForwardIterator1	last1,
		ForwardIterator2	first2,
		ForwardIterator2	last2,
		BinaryPredicate	comp
	)

find implementation

Definition at line 261 of file find.hpp.

boost::range_const_iterator<ForwardRange1>::type adobe::find_end	(	const ForwardRange1 &	range1,
		const ForwardRange2 &	range2,
		BinaryPredicate	comp
	)

find implementation

Definition at line 289 of file find.hpp.

boost::range_iterator<InputRange>::type adobe::find_if	(	InputRange &	range,
		Predicate	pred
	)

find implementation

Definition at line 186 of file find.hpp.

InputIterator adobe::find_if	(	InputIterator	first,
		InputIterator	last,
		Predicate	pred
	)

find implementation

Definition at line 174 of file find.hpp.

boost::range_const_iterator<InputRange>::type adobe::find_if	(	const InputRange &	range,
		Predicate	pred
	)

find implementation

Definition at line 198 of file find.hpp.

std::pair<I, I> adobe::find_range	(	I	f,
		I	l,
		const T &	x
	)

Definition at line 209 of file find.hpp.

std::pair<I, I> adobe::find_range_if	(	I	f,
		I	l,
		P	p
	)

Definition at line 222 of file find.hpp.