galois::ParallelSTL Namespace Reference

Parallel versions of STL library algorithms. More...

Classes
struct	find_if_helper
struct	sort_helper
struct	partition_helper
struct	pair_dist

Functions
template<class InputIterator , class Predicate >
size_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, const T &identity, const BinaryOperation &binary_op)
template<class InputIterator , class T >
T	accumulate (InputIterator first, InputIterator last, const T &identity=T())
template<class InputIterator , class MapFn , class T , class ReduceFn >
T	map_reduce (InputIterator first, InputIterator last, MapFn map_fn, ReduceFn reduce_fn, const T &identity)
template<typename I >
std::enable_if_t <!std::is_scalar < internal::Val_ty< I > >::value >	destroy (I first, I last)
template<class I >
std::enable_if_t < std::is_scalar < internal::Val_ty< I > >::value >	destroy (I, I)
template<class InputIt , class OutputIt >
OutputIt	partial_sum (InputIt first, InputIt last, OutputIt d_first)
	Does a partial sum from first -> last and writes the results to the d_first iterator. More...

Detailed Description

Parallel versions of STL library algorithms.

Function Documentation

template<class InputIterator , class T , typename BinaryOperation >

T galois::ParallelSTL::accumulate	(	InputIterator	first,
		InputIterator	last,
		const T &	identity,
		const BinaryOperation &	binary_op
	)

template<class InputIterator , class T >

T galois::ParallelSTL::accumulate	(	InputIterator	first,
		InputIterator	last,
		const T &	identity = T()
	)

template<class Iterator >

Iterator galois::ParallelSTL::choose_rand	(	Iterator	first,
		Iterator	last
	)

template<class InputIterator , class Predicate >

size_t galois::ParallelSTL::count_if	(	InputIterator	first,
		InputIterator	last,
		Predicate	pred
	)

template<typename I >

std::enable_if_t<!std::is_scalar<internal::Val_ty<I> >::value> galois::ParallelSTL::destroy	(	I	first,
		I	last
	)

template<class I >

std::enable_if_t<std::is_scalar<internal::Val_ty<I> >::value> galois::ParallelSTL::destroy	(	I	,
		I
	)

template<typename RandomAccessIterator , class Predicate >

std::pair<RandomAccessIterator, RandomAccessIterator> galois::ParallelSTL::dual_partition	(	RandomAccessIterator	first1,
		RandomAccessIterator	last1,
		RandomAccessIterator	first2,
		RandomAccessIterator	last2,
		Predicate	pred
	)

template<class InputIterator , class Predicate >

InputIterator galois::ParallelSTL::find_if	(	InputIterator	first,
		InputIterator	last,
		Predicate	pred
	)

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

T galois::ParallelSTL::map_reduce	(	InputIterator	first,
		InputIterator	last,
		MapFn	map_fn,
		ReduceFn	reduce_fn,
		const T &	identity
	)

template<class InputIt , class OutputIt >

OutputIt galois::ParallelSTL::partial_sum	(	InputIt	first,
		InputIt	last,
		OutputIt	d_first
	)

Does a partial sum from first -> last and writes the results to the d_first iterator.

template<class RandomAccessIterator , class Predicate >

RandomAccessIterator galois::ParallelSTL::partition	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Predicate	pred
	)

template<class RandomAccessIterator , class Compare >

void galois::ParallelSTL::sort	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

template<class RandomAccessIterator >

void galois::ParallelSTL::sort	(	RandomAccessIterator	first,
		RandomAccessIterator	last
	)