nuclear@7: /*
nuclear@7: rbtree - simple balanced binary search tree (red-black tree) library.
nuclear@7: Copyright (C) 2011-2014  John Tsiombikas <nuclear@member.fsf.org>
nuclear@7: 
nuclear@7: rbtree is free software, feel free to use, modify, and redistribute it, under
nuclear@7: the terms of the 3-clause BSD license. See COPYING for details.
nuclear@7:  */
nuclear@7: #ifndef RBTREE_H_
nuclear@7: #define RBTREE_H_
nuclear@7: 
nuclear@7: struct rbtree;
nuclear@7: 
nuclear@7: 
nuclear@7: struct rbnode {
nuclear@7: 	void *key, *data;
nuclear@7: 	int red;
nuclear@7: 	struct rbnode *left, *right;
nuclear@7: 	struct rbnode *next;	/* for iterator stack */
nuclear@7: };
nuclear@7: 
nuclear@7: 
nuclear@7: typedef void *(*rb_alloc_func_t)(size_t);
nuclear@7: typedef void (*rb_free_func_t)(void*);
nuclear@7: 
nuclear@7: typedef int (*rb_cmp_func_t)(const void*, const void*);
nuclear@7: typedef void (*rb_del_func_t)(struct rbnode*, void*);
nuclear@7: 
nuclear@7: #define RB_KEY_ADDR		(rb_cmp_func_t)(0)
nuclear@7: #define RB_KEY_INT		(rb_cmp_func_t)(1)
nuclear@7: #define RB_KEY_STRING	(rb_cmp_func_t)(3)
nuclear@7: 
nuclear@7: 
nuclear@7: #ifdef __cplusplus
nuclear@7: extern "C" {
nuclear@7: #endif
nuclear@7: 
nuclear@7: struct rbtree *rb_create(rb_cmp_func_t cmp_func);
nuclear@7: void rb_free(struct rbtree *rb);
nuclear@7: 
nuclear@7: int rb_init(struct rbtree *rb, rb_cmp_func_t cmp_func);
nuclear@7: void rb_destroy(struct rbtree *rb);
nuclear@7: 
nuclear@7: void rb_set_allocator(struct rbtree *rb, rb_alloc_func_t alloc, rb_free_func_t free);
nuclear@7: void rb_set_compare_func(struct rbtree *rb, rb_cmp_func_t func);
nuclear@7: void rb_set_delete_func(struct rbtree *rb, rb_del_func_t func, void *cls);
nuclear@7: /* TODO add user deep copy function */
nuclear@7: 
nuclear@7: void rb_clear(struct rbtree *rb);
nuclear@7: int rb_copy(struct rbtree *dest, struct rbtree *src);
nuclear@7: 
nuclear@7: int rb_size(struct rbtree *rb);
nuclear@7: 
nuclear@7: int rb_insert(struct rbtree *rb, void *key, void *data);
nuclear@7: int rb_inserti(struct rbtree *rb, int key, void *data);
nuclear@7: 
nuclear@7: int rb_delete(struct rbtree *rb, void *key);
nuclear@7: int rb_deletei(struct rbtree *rb, int key);
nuclear@7: 
nuclear@7: void *rb_find(struct rbtree *rb, void *key);
nuclear@7: void *rb_findi(struct rbtree *rb, int key);
nuclear@7: 
nuclear@7: void rb_foreach(struct rbtree *rb, void (*func)(struct rbnode*, void*), void *cls);
nuclear@7: 
nuclear@7: struct rbnode *rb_root(struct rbtree *rb);
nuclear@7: 
nuclear@7: void rb_begin(struct rbtree *rb);
nuclear@7: struct rbnode *rb_next(struct rbtree *rb);
nuclear@7: 
nuclear@7: void *rb_node_key(struct rbnode *node);
nuclear@7: int rb_node_keyi(struct rbnode *node);
nuclear@7: void *rb_node_data(struct rbnode *node);
nuclear@7: 
nuclear@7: #ifdef __cplusplus
nuclear@7: }
nuclear@7: #endif
nuclear@7: 
nuclear@7: 
nuclear@7: #endif	/* RBTREE_H_ */