Namespaces |
namespace | adobe |
Functions |
template<class ForwardRange1 , class ForwardRange2 > |
boost::range_const_iterator
< ForwardRange1 >::type | search (const ForwardRange1 &range1, const ForwardRange2 &range2) |
template<class ForwardRange1 , class ForwardRange2 > |
boost::range_iterator
< ForwardRange1 >::type | search (ForwardRange1 &range1, const ForwardRange2 &range2) |
template<class ForwardRange1 , class ForwardRange2 , class BinaryPredicate > |
boost::range_iterator
< ForwardRange1 >::type | search (ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate pred) |
template<class ForwardRange1 , class ForwardRange2 , class BinaryPredicate > |
boost::range_const_iterator
< ForwardRange1 >::type | search (const ForwardRange1 &range1, const ForwardRange2 &range2, BinaryPredicate pred) |
template<class ForwardIterator1 , class ForwardIterator2 , class BinaryPredicate > |
ForwardIterator1 | search (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred) |
template<class ForwardRange , class Size , class T > |
boost::range_iterator
< ForwardRange >::type | search_n (ForwardRange &range, Size count, const T &value) |
template<class ForwardRange , class Size , class T , class BinaryPredicate > |
boost::range_iterator
< ForwardRange >::type | search_n (ForwardRange &range, Size count, const T &value, BinaryPredicate pred) |
template<class ForwardRange , class Size , class T , class BinaryPredicate > |
boost::range_const_iterator
< ForwardRange >::type | search_n (const ForwardRange &range, Size count, const T &value, BinaryPredicate pred) |
template<class ForwardRange , class Size , class T > |
boost::range_const_iterator
< ForwardRange >::type | search_n (const ForwardRange &range, Size count, const T &value) |
template<class ForwardIterator , class Size , class T , class BinaryPredicate > |
ForwardIterator | search_n (ForwardIterator first, ForwardIterator last, Size count, const T &value, BinaryPredicate pred) |