| libstdc++
    | 
| Public Member Functions | |
| template<typename _RAIter1 , typename _RAIter2 , typename _Pred > | |
| std::pair< _RAIter1, _RAIter2 > | _M_sequential_algorithm (_RAIter1 __begin1, _RAIter1 __end1, _RAIter2 __begin2, _Pred __pred) | 
| template<typename _RAIter1 , typename _RAIter2 , typename _Pred > | |
| bool | operator() (_RAIter1 __i1, _RAIter2 __i2, _Pred __pred) | 
Test predicate on two adjacent elements.
Definition at line 80 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 105 of file find_selectors.h.
References std::make_pair().
| 
 | inline | 
Test on one position.
| __i1 | _Iterator on first sequence. | 
| __i2 | _Iterator on second sequence (unused). | 
| __pred | Find predicate. | 
Definition at line 90 of file find_selectors.h.