Galois::ParallelSTL Namespace Reference

Parallel versions of STL library algorithms. More...

Classes
struct	count_if_helper
struct	count_if_reducer
struct	find_if_helper
struct	sort_helper
struct	partition_helper
struct	pair_dist
struct	accumulate_helper
struct	accumulate_helper_reduce
struct	map_reduce_helper
Functions
template<class InputIterator , class Predicate >
ptrdiff_t	count_if (InputIterator first, InputIterator last, Predicate pred)
template<class InputIterator , class Predicate >
InputIterator	find_if (InputIterator first, InputIterator last, Predicate pred)
template<class Iterator >
Iterator	choose_rand (Iterator first, Iterator last)
template<typename RandomAccessIterator , class Predicate >
std::pair < RandomAccessIterator, RandomAccessIterator >	dual_partition (RandomAccessIterator first1, RandomAccessIterator last1, RandomAccessIterator first2, RandomAccessIterator last2, Predicate pred)
template<class RandomAccessIterator , class Predicate >
RandomAccessIterator	partition (RandomAccessIterator first, RandomAccessIterator last, Predicate pred)
template<class RandomAccessIterator , class Compare >
void	sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
template<class RandomAccessIterator >
void	sort (RandomAccessIterator first, RandomAccessIterator last)
template<class InputIterator , class T , typename BinaryOperation >
T	accumulate (InputIterator first, InputIterator last, T init, BinaryOperation binary_op)
template<class InputIterator , class T >
T	accumulate (InputIterator first, InputIterator last, T init)
template<class InputIterator , class MapFn , class T , class ReduceFn >
T	map_reduce (InputIterator first, InputIterator last, MapFn fn, T init, ReduceFn reduce)

---

Detailed Description

Parallel versions of STL library algorithms.

---

Function Documentation

template<class InputIterator , class T >

T Galois::ParallelSTL::accumulate	(	InputIterator	first,
		InputIterator	last,
		T	init
	)			[inline]

template<class InputIterator , class T , typename BinaryOperation >

T Galois::ParallelSTL::accumulate	(	InputIterator	first,
		InputIterator	last,
		T	init,
		BinaryOperation	binary_op
	)			[inline]

template<class Iterator >

Iterator Galois::ParallelSTL::choose_rand	(	Iterator	first,
		Iterator	last
	)			[inline]

template<class InputIterator , class Predicate >

ptrdiff_t Galois::ParallelSTL::count_if	(	InputIterator	first,
		InputIterator	last,
		Predicate	pred
	)			[inline]

template<typename RandomAccessIterator , class Predicate >

std::pair<RandomAccessIterator, RandomAccessIterator> Galois::ParallelSTL::dual_partition	(	RandomAccessIterator	first1,
		RandomAccessIterator	last1,
		RandomAccessIterator	first2,
		RandomAccessIterator	last2,
		Predicate	pred
	)			[inline]

template<class InputIterator , class Predicate >

InputIterator Galois::ParallelSTL::find_if	(	InputIterator	first,
		InputIterator	last,
		Predicate	pred
	)			[inline]

template<class InputIterator , class MapFn , class T , class ReduceFn >

T Galois::ParallelSTL::map_reduce	(	InputIterator	first,
		InputIterator	last,
		MapFn	fn,
		T	init,
		ReduceFn	reduce
	)			[inline]

template<class RandomAccessIterator , class Predicate >

RandomAccessIterator Galois::ParallelSTL::partition	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Predicate	pred
	)			[inline]

template<class RandomAccessIterator >

void Galois::ParallelSTL::sort	(	RandomAccessIterator	first,
		RandomAccessIterator	last
	)			[inline]

template<class RandomAccessIterator , class Compare >

void Galois::ParallelSTL::sort	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)			[inline]