CH_Tools Namespace Reference

Some convenient inline tools like a clock for timing, a random number generator, a heapsort template sorting indices. More...

Classes
class	BoxPlot
	for generating LaTeX figures with successive box plots and corresponding tables More...
class	Clock
	allows measuring time difference to its initialization time in Microseconds More...
class	GB_rand
	device independent random number generator based on long int with seed More...
class	Microseconds
	extra long integer number for expressing and computing time measurements in microseconds. More...

Functions
Microseconds	wall_clock (void)
	returns the wall clock time since Epoch
template<class I , class V >
void	heapify (int i, int n, I &ind, const V &val, bool non_decreasing=true)
	Heapify element i (in 0,...,n-1) in ind, so that afterwards val[ind[j]]>=max(val[ind[2*j+1]],val[ind[2*j+2]] for the subtree with root i. More...
template<class I , class V >
void	build_heap (int n, I &ind, const V &val, bool non_decreasing=true)
	Build a heap out of ind[0] to ind[n-1], so that val[ind[j]]>=max(val[ind[2*j+1]],val[ind[2*j+2]] for all j. More...
template<class I , class V >
void	heapsort (int n, I &ind, const V &val, bool non_decreasing=true)
	Sort ind[0]...ind[n-1] so that val[ind[i]]<=val[ind[j]] for 0<=i<j<n. More...
template<class I , class V >
void	heapify (int i, int n, I *ind, const V *val, bool non_decreasing=true)
	More efficient variant for pointers to indices and values: Heapify element i (in 0,...,n-1) in ind, so that afterwards val[ind[j]]>=max(val[ind[2*j+1]],val[ind[2*j+2]] for the subtree with root i. More...
template<class I , class V >
void	build_heap (int n, I *ind, const V *val, bool non_decreasing=true)
	More efficient variant for pointers to indices and values: Build a heap out of ind[0] to ind[n-1], so that val[ind[j]]>=max(val[ind[2*j+1]],val[ind[2*j+2]] for all j. More...
template<class I , class V >
void	heapsort (int n, I *ind, const V *val, bool non_decreasing=true)
	More efficient variant for pointers to indices and values: Sort ind[0]...ind[n-1] so that val[ind[i]]<=val[ind[j]] for 0<=i<j<n. More...

Detailed Description

Some convenient inline tools like a clock for timing, a random number generator, a heapsort template sorting indices.