|
|
template<class InputIterator , class T , class Compare > |
InputIterator | find_match (InputIterator first, InputIterator last, const T &value, Compare comp) |
|
template<class InputRange , class T , class Compare > |
boost::range_iterator
< InputRange >::type | find_match (InputRange &range, const T &value, Compare comp) |
|
template<class InputRange , class T , class Compare > |
boost::range_const_iterator
< InputRange >::type | find_match (const InputRange &range, const T &value, Compare comp) |
|
template<class InputIterator , class T , class Compare > |
InputIterator | find_match (InputIterator first, InputIterator last, const T &value) |
|
template<class InputRange , class T , class Compare > |
boost::range_iterator
< InputRange >::type | find_match (InputRange &range, const T &value) |
|
template<class InputRange , class T , class Compare > |
boost::range_const_iterator
< InputRange >::type | find_match (const InputRange &range, const T &value) |
|
Returns the first iterator i in the range [first, last) such that comp(value, *i) return true. Returns last if no such iterator exists.
- Complexity Guarantees:
- Linear: at most
last - first applications of comp .
InputIterator adobe::find_match |
( |
InputIterator |
first, |
|
|
InputIterator |
last, |
|
|
const T & |
value, |
|
|
Compare |
comp |
|
) |
| |
boost::range_iterator<InputRange>::type adobe::find_match |
( |
InputRange & |
range, |
|
|
const T & |
value, |
|
|
Compare |
comp |
|
) |
| |
boost::range_const_iterator<InputRange>::type adobe::find_match |
( |
const InputRange & |
range, |
|
|
const T & |
value, |
|
|
Compare |
comp |
|
) |
| |
InputIterator adobe::find_match |
( |
InputIterator |
first, |
|
|
InputIterator |
last, |
|
|
const T & |
value |
|
) |
| |
boost::range_iterator<InputRange>::type adobe::find_match |
( |
InputRange & |
range, |
|
|
const T & |
value |
|
) |
| |
boost::range_const_iterator<InputRange>::type adobe::find_match |
( |
const InputRange & |
range, |
|
|
const T & |
value |
|
) |
| |
|