#include <capd/homAux/RangeAlgorithms.h>

Public Member Functions
	RangeAlgorithms (bool isStd=true)

template<typename Rng , typename Cmp = std::less<typename Rng::value_type>>
void	sort (Rng &rng, Cmp cmp=Cmp())

template<typename Func , typename Rng >
void	forEach (Rng &rng, Func func=Func())

template<typename Func , typename T1 , typename T2 >
void	forLoop (T1 _begin, T2 end, Func func=Func())

template<typename Rng , typename OutRng >
void	partialSum (const Rng &rng, OutRng &out)

template<class Rng >
boost::range_iterator< Rng >::type	maxElement (const Rng &rng)

template<typename Rng , typename Value , typename Op = std::plus<Value>>
Value	accumulate (const Rng &rng, Value init, Op op=Op())

Constructor & Destructor Documentation

capd::homAux::RangeAlgorithms< StdComputationalModel >::RangeAlgorithms ( bool isStd = true )

inline

Member Function Documentation

template<typename Rng , typename Value , typename Op = std::plus<Value>>

Value capd::homAux::RangeAlgorithms< StdComputationalModel >::accumulate	(	const Rng &	rng,
		Value	init,
		Op	op = `Op()`
	)

inline

template<typename Func , typename Rng >

void capd::homAux::RangeAlgorithms< StdComputationalModel >::forEach	(	Rng &	rng,
		Func	func = `Func()`
	)

inline

template<typename Func , typename T1 , typename T2 >

void capd::homAux::RangeAlgorithms< StdComputationalModel >::forLoop	(	T1	_begin,
		T2	end,
		Func	func = `Func()`
	)

inline

template<class Rng >

boost::range_iterator<Rng>::type capd::homAux::RangeAlgorithms< StdComputationalModel >::maxElement ( const Rng & rng )

inline

template<typename Rng , typename OutRng >

void capd::homAux::RangeAlgorithms< StdComputationalModel >::partialSum	(	const Rng &	rng,
		OutRng &	out
	)

inline

template<typename Rng , typename Cmp = std::less<typename Rng::value_type>>

void capd::homAux::RangeAlgorithms< StdComputationalModel >::sort	(	Rng &	rng,
		Cmp	cmp = `Cmp()`
	)

inline