find.hpp File Reference

#include <adobe/config.hpp>
#include <algorithm>
#include <utility>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/next_prior.hpp>
#include <boost/bind.hpp>

Go to the source code of this file.

Namespaces
namespace	adobe
Functions
template<class ForwardRange >
boost::range_iterator < ForwardRange >::type	adjacent_find (ForwardRange &range)
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 ForwardRange , class BinaryPredicate >
boost::range_iterator < ForwardRange >::type	adjacent_find (ForwardRange &range, 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 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 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 InputIterator , class Predicate >
InputIterator	find_if (InputIterator first, InputIterator last, Predicate pred)
template<class InputRange , class Predicate >
boost::range_iterator < InputRange >::type	find_if (InputRange &range, Predicate pred)
template<class InputRange , class Predicate >
boost::range_const_iterator < InputRange >::type	find_if (const InputRange &range, Predicate pred)
template<class InputIterator , class Predicate >
InputIterator	find_if_not (InputIterator first, InputIterator last, Predicate pred)
template<class InputRange , class Predicate >
boost::range_iterator < InputRange >::type	find_if_not (InputRange &range, Predicate pred)
template<class InputRange , class Predicate >
boost::range_const_iterator < InputRange >::type	find_if_not (const InputRange &range, Predicate pred)
template<class InputRange , class T >
boost::range_iterator < InputRange >::type	find_not (InputRange &range, const T &value)
template<class InputIterator , class T >
InputIterator	find_not (InputIterator first, InputIterator last, const T &value)
template<class InputRange , class T >
boost::range_const_iterator < InputRange >::type	find_not (const InputRange &range, const T &value)
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)