ParallelSTL.h File Reference

Parallel STL equivalents -*- C++ -*-This is the only file to include for basic Galois functionality. More...

#include "Galois/UserContext.h"
#include "Galois/NoDerefIterator.h"
#include "Galois/WorkList/WorkList.h"
#include "Galois/Runtime/ParallelWork.h"
#include "Galois/Runtime/DoAll.h"

Go to the source code of this file.

Classes
struct	Galois::ParallelSTL::count_if_helper< Predicate >
struct	Galois::ParallelSTL::count_if_reducer
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
struct	Galois::ParallelSTL::accumulate_helper< T, BinOp >
struct	Galois::ParallelSTL::accumulate_helper_reduce< BinOp >
struct	Galois::ParallelSTL::map_reduce_helper< T, MapFn, ReduceFn >
Namespaces
namespace	Galois
	Main Galois namespace.
namespace	Galois::ParallelSTL
	Parallel versions of STL library algorithms.
Functions
template<class InputIterator , class Predicate >
ptrdiff_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, T init, BinaryOperation binary_op)
template<class InputIterator , class T >
T	Galois::ParallelSTL::accumulate (InputIterator first, InputIterator last, T init)
template<class InputIterator , class MapFn , class T , class ReduceFn >
T	Galois::ParallelSTL::map_reduce (InputIterator first, InputIterator last, MapFn fn, T init, ReduceFn reduce)

---

Detailed Description

Parallel STL equivalents -*- C++ -*-

This is the only file to include for basic Galois functionality.

License

Galois, a framework to exploit amorphous data-parallelism in irregular programs.

Copyright (C) 2012, The University of Texas at Austin. All rights reserved. UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS SOFTWARE AND DOCUMENTATION, INCLUDING ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR ANY PARTICULAR PURPOSE, NON-INFRINGEMENT AND WARRANTIES OF PERFORMANCE, AND ANY WARRANTY THAT MIGHT OTHERWISE ARISE FROM COURSE OF DEALING OR USAGE OF TRADE. NO WARRANTY IS EITHER EXPRESS OR IMPLIED WITH RESPECT TO THE USE OF THE SOFTWARE OR DOCUMENTATION. Under no circumstances shall University be liable for incidental, special, indirect, direct or consequential damages or loss of profits, interruption of business, or related expenses which may arise from use of Software or Documentation, including but not limited to those resulting from defects in Software and/or Documentation, or loss or inaccuracy of data of any kind.