ParallelSTL.h File Reference

#include "galois/config.h"
#include "galois/GaloisForwardDecl.h"
#include "galois/NoDerefIterator.h"
#include "galois/runtime/Range.h"
#include "galois/Reduction.h"
#include "galois/Traits.h"
#include "galois/UserContext.h"
#include "galois/Threads.h"
#include "galois/worklists/Chunk.h"

Go to the source code of this file.

Classes
struct	galois::ParallelSTL::find_if_helper< InputIterator, Predicate >
struct	galois::ParallelSTL::sort_helper< Compare >
struct	galois::ParallelSTL::sort_helper< Compare >::neq_to< value_type >
	Not equal in terms of less-than. More...
struct	galois::ParallelSTL::partition_helper< RandomAccessIterator, Predicate >
struct	galois::ParallelSTL::partition_helper< RandomAccessIterator, Predicate >::partition_helper_state
struct	galois::ParallelSTL::pair_dist

Namespaces
	galois
	The Galois namespace containing all Galois structures and functions.
	galois::ParallelSTL
	Parallel versions of STL library algorithms.

Functions
template<class InputIterator , class Predicate >
size_t	galois::ParallelSTL::count_if (InputIterator first, InputIterator last, Predicate pred)
template<class InputIterator , class Predicate >
InputIterator	galois::ParallelSTL::find_if (InputIterator first, InputIterator last, Predicate pred)
template<class Iterator >
Iterator	galois::ParallelSTL::choose_rand (Iterator first, Iterator last)
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 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)
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 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<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<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. More...