|
libstdc++
|

Public Member Functions | |
| template<typename RandomAccessIterator1 , typename RandomAccessIterator2 , typename Pred > | |
| bool | operator() (RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred) |
| template<typename RandomAccessIterator1 , typename RandomAccessIterator2 , typename Pred > | |
| std::pair < RandomAccessIterator1, RandomAccessIterator2 > | sequential_algorithm (RandomAccessIterator1 begin1, RandomAccessIterator1 end1, RandomAccessIterator2 begin2, Pred pred) |
Test predicate on a single element, used for std::find() and std::find_if ().
Definition at line 50 of file find_selectors.h.
|
inline |
Test on one position.
| i1 | Iterator on first sequence. |
| i2 | Iterator on second sequence (unused). |
| pred | Find predicate. |
Definition at line 60 of file find_selectors.h.
|
inline |
Corresponding sequential algorithm on a sequence.
| begin1 | Begin iterator of first sequence. |
| end1 | End iterator of first sequence. |
| begin2 | Begin iterator of second sequence. |
| pred | Find predicate. |
Definition at line 72 of file find_selectors.h.