Structure to represent skiplists that keep the current state of an aggregation. More...

Data Fields
int	capacity
	Maximum number of elements. More...

int(*	comp_fn )(void , void )
	Comparison function for the elements. More...

SkipListElem *	elems
	Array of elements. More...

void *	extra
	Pointer to additional data needed for processing. More...

size_t	extrasize
	Size of additional data needed for processing. More...

int	freecap
	Maximum number of deleted elements. More...

int	freecount
	Number of deleted elements. More...

int *	freed
	Array of index values of deleted elements. More...

size_t	key_size
	Size in bytes of the keys. More...

int	length
	Number of elements. More...

void (	merge_fn )(void , void )
	Merge function for the elements. More...

int	next
	Index of the next free element. More...

int	tail
	Index of the tail element More...

size_t	value_size
	Size in bytes of the values. More...

Detailed Description

Structure to represent skiplists that keep the current state of an aggregation.

The documentation for this struct was generated from the following file:

Data Fields