2 a talloc based red-black tree
4 Copyright (C) Ronnie Sahlberg 2007
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, see <http://www.gnu.org/licenses/>.
23 #define TRBT_BLACK 0x01
24 typedef struct _trbt_node_t {
25 struct _trbt_tree_t *tree;
26 struct _trbt_node_t *parent;
27 struct _trbt_node_t *left;
28 struct _trbt_node_t *right;
34 typedef struct _trbt_tree_t {
36 /* automatically free the tree when the last node has been deleted */
37 #define TRBT_AUTOFREE 0x00000001
43 /* Create a RB tree */
44 trbt_tree_t *trbt_create(TALLOC_CTX *memctx, uint32_t flags);
46 /* Lookup a node in the tree and return a pointer to data or NULL */
47 void *trbt_lookup32(trbt_tree_t *tree, uint32_t key);
49 /* Insert a new node into the tree. If there was already a node with this
50 key the pointer to the previous data is returned.
51 The tree will talloc_steal() the data inserted into the tree .
53 void *trbt_insert32(trbt_tree_t *tree, uint32_t key, void *data);
55 /* Insert a new node into the tree.
56 If this is a new node:
57 callback is called with data==NULL and param=param
58 the returned value from the callback is talloc_stolen and inserted in the
60 If a node already exists for this key then:
61 callback is called with data==existing data and param=param
62 the returned calue is talloc_stolen and inserted in the tree
64 void trbt_insert32_callback(trbt_tree_t *tree, uint32_t key, void *(*callback)(void *param, void *data), void *param);
66 /* Delete a node from the tree and free all data associated with it */
67 void trbt_delete32(trbt_tree_t *tree, uint32_t key);
70 /* insert into the tree with a key based on an array of uint32 */
71 void trbt_insertarray32_callback(trbt_tree_t *tree, uint32_t keylen, uint32_t *key, void *(*callback)(void *param, void *data), void *param);
73 /* Lookup a node in the tree with a key based on an array of uint32
74 and return a pointer to data or NULL */
75 void *trbt_lookuparray32(trbt_tree_t *tree, uint32_t keylen, uint32_t *key);
77 /* Traverse a tree with a key based on an array of uint32 */
78 void trbt_traversearray32(trbt_tree_t *tree, uint32_t keylen, void (*callback)(void *param, void *data), void *param);
80 /* Lookup the first node in the tree with a key based on an array of uint32
81 and return a pointer to data or NULL */
82 void *trbt_findfirstarray32(trbt_tree_t *tree, uint32_t keylen);