include/util/prefix_sum_tools.hpp File Reference

Basic prefix sum operations on arrays. More...

#include "prefix2d.hpp"
#include "rect_list.hpp"
#include "prefix_sum_tools_impl.hpp"

Go to the source code of this file.

---

Detailed Description

Basic prefix sum operations on arrays.

Author:

erdeniz <erdeniz@bmi.osu.edu>

Date:

Mon Jun 14 13:03:59 2010

Classes
class	util::Aggreg2Dto1D< T, Pr, row >
	1D representation of a section of a prefix sum array by summing its element row-wise or column-wise. More...
class	util::AggregMax2Dto1D< T, Pr, row >
	Reduces a 2D matrix with stripes into 1D dimension by returning the load of the most loaded stripe. More...
Namespaces
namespace	util
	This namespace provides multiple utilitarian classes and function used in 1D and 2D partitioning algorithm (for instance as input and output).
Functions
template<typename T , typename Pr >
int	util::extractXDim (const util::RectList< T, Pr > &currentP, int *cuts, std::vector< int > procs[])
template<typename T , typename Pr >
int	util::extractXDim (const util::RectList< T, Pr > &currentP, int *cuts)
template<typename T >
void	util::prefixsum (const T *array, T *result, int length)
	Assembles 1d prefix sum array.
template<typename T , typename Pr >
int	util::binarySearch (const Pr &prefixSumArray, int low, int high, T prefixSumBottleneck)
	search for prefixSumBottleneck inside a sorted array between l and h
template<typename T , typename Pr >
int	util::binarySearch_interval (const Pr &prefixSumArray, int low, int high, T prefixSumBottleneck, int base)
	search for the largest interval rooted at base inside prefixSumArray finishing between low and high whose value is less then prefixSumBottlneck using a binary search.
template<typename T , typename Pr >
int	util::binarySearchLeft (const Pr &prefixSumArray, int low, int high, T prefixSumBottleneck)
	TODO: this function is un documented in doxygen.