2 * Copyright (c) 2004, 2007, 2010 Todd C. Miller <Todd.Miller@courtesan.com>
4 * Permission to use, copy, modify, and distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
8 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17 #ifndef _SUDO_REDBLACK_H
18 #define _SUDO_REDBLACK_H
32 struct rbnode *left, *right, *parent;
38 int (*compar)(const void *, const void *);
43 #define rbapply(t, f, c, o) rbapply_node((t), (t)->root.left, (f), (c), (o))
44 #define rbisempty(t) ((t)->root.left == &(t)->nil && (t)->root.right == &(t)->nil)
45 #define rbfirst(t) ((t)->root.left)
46 #define rbroot(t) (&(t)->root)
47 #define rbnil(t) (&(t)->nil)
49 void *rbdelete(struct rbtree *, struct rbnode *);
50 int rbapply_node(struct rbtree *, struct rbnode *,
51 int (*)(void *, void *), void *, enum rbtraversal);
52 struct rbnode *rbfind(struct rbtree *, void *);
53 struct rbnode *rbinsert(struct rbtree *, void *);
54 struct rbtree *rbcreate(int (*)(const void *, const void *));
55 void rbdestroy(struct rbtree *, void (*)(void *));
57 #endif /* _SUDO_REDBLACK_H */