RBTManager that uses memory pools to allocate memory and compares the keys as sequence numbers. More...

#include <rbt.hh>

Public Member Functions
int	compareKeys (const void first, const void second)

void	printKey (const void *first)

void	printInfo (void *first)

rb_red_blk_node *	allocateNode (void)

rb_red_blk_tree *	allocateTree (void)

void	freeNode (rb_red_blk_node *node)

void	freeKey (void *key)

void	freeInfo (void *info)

void	freeTree (rb_red_blk_tree *tree)

uint32_t *	allocateKey (void)

int *	allocateInfo (void)

Detailed Description

RBTManager that uses memory pools to allocate memory and compares the keys as sequence numbers.

The keys are sequence numbers (uint32_t) The info are offsets (int)

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

Public Member Functions