__gnu_parallel::adjacent_find_selector Struct Reference

Test predicate on two adjacent elements. More...

Inheritance diagram for __gnu_parallel::adjacent_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)

Test predicate on two adjacent elements.

Definition at line 80 of file find_selectors.h.

template<typename RandomAccessIterator1 , typename RandomAccessIterator2 , typename Pred >

bool __gnu_parallel::adjacent_find_selector::operator()	(	RandomAccessIterator1	i1,
		RandomAccessIterator2	i2,
		Pred	pred
	)			`[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	(	RandomAccessIterator1	begin1,
		RandomAccessIterator1	end1,
		RandomAccessIterator2	begin2,
		Pred	pred
	)			`[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.

The documentation for this struct was generated from the following file: