rbtree.h File Reference

#include "tm.h"
#include "types.h"
#include "lehigh.h"

Include dependency graph for rbtree.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros
#define	TMRBTREE_ALLOC(cmp)   TMrbtree_alloc(TM_ARG_ALONE, cmp)
#define	TMRBTREE_FREE(r)   TMrbtree_free(TM_ARG r)
#define	TMRBTREE_INSERT(r, k, v)   TMrbtree_insert(TM_ARG r, (void*)(k), (void*)(v))
#define	TMRBTREE_DELETE(r, k)   TMrbtree_delete(TM_ARG r, (void*)(k))
#define	TMRBTREE_UPDATE(r, k, v)   TMrbtree_update(TM_ARG r, (void*)(k), (void*)(v))
#define	TMRBTREE_GET(r, k)   TMrbtree_get(TM_ARG r, (void*)(k))
#define	TMRBTREE_CONTAINS(r, k)   TMrbtree_contains(TM_ARG r, (void*)(k))

Typedefs
typedef struct rbtree	rbtree_t

Functions
long	rbtree_verify (rbtree_t *s, long verbose)
rbtree_t *	rbtree_alloc (comparator_t *compare)
rbtree_t *	TMrbtree_alloc (TM_ARGDECL comparator_t *compare)
void	rbtree_free (rbtree_t *r)
void	TMrbtree_free (TM_ARGDECL rbtree_t *r)
bool_t	rbtree_insert (rbtree_t *r, void *key, void *val)
TM_CALLABLE bool_t	TMrbtree_insert (TM_ARGDECL rbtree_t *r, void *key, void *val)
bool_t	rbtree_delete (rbtree_t *r, void *key)
TM_CALLABLE bool_t	TMrbtree_delete (TM_ARGDECL rbtree_t *r, void *key)
bool_t	rbtree_update (rbtree_t *r, void *key, void *val)
TM_CALLABLE bool_t	TMrbtree_update (TM_ARGDECL rbtree_t *r, void *key, void *val)
void *	rbtree_get (rbtree_t *r, void *key)
TM_CALLABLE void *	TMrbtree_get (TM_ARGDECL rbtree_t *r, void *key)
bool_t	rbtree_contains (rbtree_t *r, void *key)
TM_CALLABLE bool_t	TMrbtree_contains (TM_ARGDECL rbtree_t *r, void *key)

Macro Definition Documentation

#define TMRBTREE_ALLOC

(

cmp

)

TMrbtree_alloc(TM_ARG_ALONE, cmp)

#define TMRBTREE_CONTAINS	(		r,
			k
	)		TMrbtree_contains(TM_ARG r, (void*)(k))

#define TMRBTREE_DELETE	(		r,
			k
	)		TMrbtree_delete(TM_ARG r, (void*)(k))

#define TMRBTREE_FREE

(

r

)

TMrbtree_free(TM_ARG r)

#define TMRBTREE_GET	(		r,
			k
	)		TMrbtree_get(TM_ARG r, (void*)(k))

#define TMRBTREE_INSERT	(		r,
			k,
			v
	)		TMrbtree_insert(TM_ARG r, (void*)(k), (void*)(v))

#define TMRBTREE_UPDATE	(		r,
			k,
			v
	)		TMrbtree_update(TM_ARG r, (void*)(k), (void*)(v))

Typedef Documentation

typedef struct rbtree rbtree_t

Function Documentation

rbtree_t* rbtree_alloc

(

comparator_t *

compare

)

bool_t rbtree_contains	(	rbtree_t *	r,
		void *	key
	)

bool_t rbtree_delete	(	rbtree_t *	r,
		void *	key
	)

Here is the call graph for this function:

void rbtree_free

(

rbtree_t *

r

)

Here is the call graph for this function:

void* rbtree_get	(	rbtree_t *	r,
		void *	key
	)

bool_t rbtree_insert	(	rbtree_t *	r,
		void *	key,
		void *	val
	)

Here is the call graph for this function:

bool_t rbtree_update	(	rbtree_t *	r,
		void *	key,
		void *	val
	)

Here is the call graph for this function:

long rbtree_verify	(	rbtree_t *	s,
		long	verbose
	)

Here is the call graph for this function:

rbtree_t* TMrbtree_alloc

(

TM_ARGDECL comparator_t *

compare

)

TM_CALLABLE bool_t TMrbtree_contains	(	TM_ARGDECL rbtree_t *	r,
		void *	key
	)

TM_CALLABLE bool_t TMrbtree_delete	(	TM_ARGDECL rbtree_t *	r,
		void *	key
	)

Here is the call graph for this function:

void TMrbtree_free

(

TM_ARGDECL rbtree_t *

r

)

Here is the call graph for this function:

TM_CALLABLE void* TMrbtree_get	(	TM_ARGDECL rbtree_t *	r,
		void *	key
	)

TM_CALLABLE bool_t TMrbtree_insert	(	TM_ARGDECL rbtree_t *	r,
		void *	key,
		void *	val
	)

Here is the call graph for this function:

TM_CALLABLE bool_t TMrbtree_update	(	TM_ARGDECL rbtree_t *	r,
		void *	key,
		void *	val
	)

Here is the call graph for this function: