1 /* avl.h - avl tree definitions */
3 * Copyright (c) 1993 Regents of the University of Michigan.
6 * Redistribution and use in source and binary forms are permitted
7 * provided that this notice is preserved and that due credit is given
8 * to the University of Michigan at Ann Arbor. The name of the University
9 * may not be used to endorse or promote products derived from this
10 * software without specific prior written permission. This software
11 * is provided ``as is'' without express or implied warranty.
18 #include <ldap_cdefs.h>
21 * this structure represents a generic avl tree node.
26 typedef struct avlnode {
29 struct avlnode *avl_left;
30 struct avlnode *avl_right;
33 #define NULLAVL ((Avlnode *) NULL)
35 /* balance factor values */
41 #define avl_getone(x) ((x) == 0 ? 0 : (x)->avl_data)
42 #define avl_onenode(x) ((x) == 0 || ((x)->avl_left == 0 && (x)->avl_right == 0))
44 /* looks like this function pointer is not used consistently */
45 /* typedef int (*IFP)LDAP_P((caddr_t, caddr_t)); */
49 avl_free LDAP_P(( Avlnode *root, IFP dfree ));
52 avl_insert LDAP_P((Avlnode **, caddr_t, IFP, IFP));
55 avl_delete LDAP_P((Avlnode **, caddr_t, IFP));
58 avl_find LDAP_P((Avlnode *, caddr_t, IFP));
61 avl_find_lin LDAP_P((Avlnode *, caddr_t, IFP));
64 avl_getfirst LDAP_P((Avlnode *));
67 /* ??? avl.c does not provide this version ??? */
69 avl_getnext LDAP_P((Avlnode *, caddr_t ));
72 avl_getnext LDAP_P((void));
76 avl_dup_error LDAP_P((void));
79 avl_dup_ok LDAP_P((void));
82 avl_apply LDAP_P((Avlnode *, IFP, caddr_t, int, int));
85 avl_prefixapply LDAP_P((Avlnode *, caddr_t, IFP, caddr_t, IFP, caddr_t, int));
87 /* apply traversal types */
88 #define AVL_PREORDER 1
90 #define AVL_POSTORDER 3
91 /* what apply returns if it ran out of nodes */
92 #define AVL_NOMORE (-6)