Definition at line 86 of file find_selectors.h.
bool __gnu_parallel::adjacent_find_selector::operator() | ( | RandomAccessIterator1 | i1, | |
RandomAccessIterator2 | i2, | |||
Pred | pred | |||
) | [inline] |
Test on one position.
i1 | Iterator on first sequence. | |
i2 | Iterator on second sequence (unused). | |
pred | Find predicate. |
Definition at line 96 of file find_selectors.h.
std::pair<RandomAccessIterator1, RandomAccessIterator2> __gnu_parallel::adjacent_find_selector::sequential_algorithm | ( | RandomAccessIterator1 | begin1, | |
RandomAccessIterator1 | end1, | |||
RandomAccessIterator2 | begin2, | |||
Pred | pred | |||
) | [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 111 of file find_selectors.h.
References std::make_pair().