Provided by: libstdc++6-4.4-doc_4.4.7-8ubuntu1_all
NAME
__gnu_parallel::adjacent_find_selector -
SYNOPSIS
Inherits __gnu_parallel::generic_find_selector. 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)"
Detailed Description
Test predicate on two adjacent elements. Definition at line 80 of file find_selectors.h.
Member Function Documentation
template<typename RandomAccessIterator1 , typename RandomAccessIterator2 , typename Pred > bool __gnu_parallel::adjacent_find_selector::operator() (RandomAccessIterator1i1, RandomAccessIterator2i2, Predpred) [inline] Test on one position. Parameters: i1 Iterator on first sequence. i2 Iterator on second sequence (unused). pred Find predicate. Definition at line 90 of file find_selectors.h. template<typename RandomAccessIterator1 , typename RandomAccessIterator2 , typename Pred > std::pair<RandomAccessIterator1, RandomAccessIterator2> __gnu_parallel::adjacent_find_selector::sequential_algorithm (RandomAccessIterator1begin1, RandomAccessIterator1end1, RandomAccessIterator2begin2, Predpred) [inline] Corresponding sequential algorithm on a sequence. Parameters: begin1 Begin iterator of first sequence. end1 End iterator of first sequence. begin2 Begin iterator of second sequence. pred Find predicate. Definition at line 105 of file find_selectors.h.
Author
Generated automatically by Doxygen for libstdc++ from the source code. libstdc++ Thu Mar 20 201gnu_parallel::adjacent_find_selector(3cxx)