openldap/include/avl.h

110 lines
2.7 KiB
C
Raw Normal View History

1999-08-31 09:17:01 +08:00
/* $OpenLDAP$ */
1998-08-09 08:43:13 +08:00
/*
2002-01-05 04:40:29 +08:00
* Copyright 1998-2002 The OpenLDAP Foundation, Redwood City, California, USA
1998-12-29 03:51:35 +08:00
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted only as authorized by the OpenLDAP
* Public License. A copy of this license is available at
* http://www.OpenLDAP.org/license.html or in file LICENSE in the
* top-level directory of the distribution.
1998-12-29 03:51:35 +08:00
*/
/* Portions
1998-08-09 08:43:13 +08:00
* Copyright (c) 1993 Regents of the University of Michigan.
* All rights reserved.
*
* Redistribution and use in source and binary forms are permitted
* provided that this notice is preserved and that due credit is given
* to the University of Michigan at Ann Arbor. The name of the University
* may not be used to endorse or promote products derived from this
* software without specific prior written permission. This software
* is provided ``as is'' without express or implied warranty.
*/
1998-12-29 03:51:35 +08:00
/* avl.h - avl tree definitions */
1998-08-09 08:43:13 +08:00
#ifndef _AVL
#define _AVL
1998-10-25 09:41:42 +08:00
#include <ldap_cdefs.h>
1998-08-09 08:43:13 +08:00
/*
* this structure represents a generic avl tree node.
*/
1998-10-25 09:41:42 +08:00
LDAP_BEGIN_DECL
1999-06-01 04:40:42 +08:00
typedef struct avlnode Avlnode;
#ifdef AVL_INTERNAL
struct avlnode {
void* avl_data;
signed int avl_bf;
1998-08-09 08:43:13 +08:00
struct avlnode *avl_left;
struct avlnode *avl_right;
1999-06-01 04:40:42 +08:00
};
1998-08-09 08:43:13 +08:00
#define NULLAVL ((Avlnode *) NULL)
/* balance factor values */
1998-10-24 07:10:49 +08:00
#define LH (-1)
1998-08-09 08:43:13 +08:00
#define EH 0
#define RH 1
/* avl routines */
1998-10-24 07:10:49 +08:00
#define avl_getone(x) ((x) == 0 ? 0 : (x)->avl_data)
#define avl_onenode(x) ((x) == 0 || ((x)->avl_left == 0 && (x)->avl_right == 0))
1998-10-25 09:41:42 +08:00
#endif /* AVL_INTERNALS */
typedef int (*AVL_APPLY) LDAP_P((void *, void*));
typedef int (*AVL_CMP) LDAP_P((const void*, const void*));
typedef int (*AVL_DUP) LDAP_P((void*, void*));
typedef void (*AVL_FREE) LDAP_P((void*));
1998-10-25 09:41:42 +08:00
LDAP_AVL_F( int )
avl_free LDAP_P(( Avlnode *root, AVL_FREE dfree ));
1998-10-25 09:41:42 +08:00
LDAP_AVL_F( int )
avl_insert LDAP_P((Avlnode **, void*, AVL_CMP, AVL_DUP));
1998-10-25 09:41:42 +08:00
LDAP_AVL_F( void* )
avl_delete LDAP_P((Avlnode **, void*, AVL_CMP));
1998-10-25 09:41:42 +08:00
LDAP_AVL_F( void* )
avl_find LDAP_P((Avlnode *, const void*, AVL_CMP));
1998-10-25 09:41:42 +08:00
LDAP_AVL_F( void* )
avl_find_lin LDAP_P((Avlnode *, const void*, AVL_CMP));
#ifdef AVL_NONREENTRANT
LDAP_AVL_F( void* )
1998-10-25 09:41:42 +08:00
avl_getfirst LDAP_P((Avlnode *));
LDAP_AVL_F( void* )
1998-10-25 09:41:42 +08:00
avl_getnext LDAP_P((void));
#endif
LDAP_AVL_F( int )
avl_dup_error LDAP_P((void*, void*));
1998-10-25 09:41:42 +08:00
LDAP_AVL_F( int )
avl_dup_ok LDAP_P((void*, void*));
LDAP_AVL_F( int )
avl_apply LDAP_P((Avlnode *, AVL_APPLY, void*, int, int));
1998-08-09 08:43:13 +08:00
LDAP_AVL_F( int )
avl_prefixapply LDAP_P((Avlnode *, void*, AVL_CMP, void*, AVL_CMP, void*, int));
1998-08-09 08:43:13 +08:00
/* apply traversal types */
#define AVL_PREORDER 1
#define AVL_INORDER 2
#define AVL_POSTORDER 3
/* what apply returns if it ran out of nodes */
1998-10-24 07:10:49 +08:00
#define AVL_NOMORE (-6)
1998-08-09 08:43:13 +08:00
1998-10-25 09:41:42 +08:00
LDAP_END_DECL
1998-08-09 08:43:13 +08:00
#endif /* _AVL */