boxsort.h File Reference

#include <vector>

Go to the source code of this file.

Classes
class	ug::BoxPriorityQueue< T >
	updateable priority queue class. this priority queue works on an external array of elements T. More...

Namespaces
namespace	ug
	the ug namespace

Macros
#define	MYASSERT(a, b)   assert(a && ##b)

Functions
template<typename T >
size_t	ug::get_val (const T &t)
size_t	ug::get_val (size_t i)

Variables
const int	ug::BOXPRIORITYQUEUE_MAXIMAL_VALUE = 500
	maximal value for T::get_val(). Keep in mind that memory requirements are O(max get_val()).

Macro Definition Documentation

MYASSERT

#define MYASSERT	(		a,
			b
	)		assert(a && ##b)