1998-08-09 08:43:13 +08:00
|
|
|
/* testavl.c - Test Tim Howes AVL code */
|
1999-09-09 03:06:24 +08:00
|
|
|
/* $OpenLDAP$ */
|
1999-12-13 12:53:59 +08:00
|
|
|
/*
|
2003-01-04 04:20:47 +08:00
|
|
|
* Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
|
1999-12-13 12:53:59 +08:00
|
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
|
|
*/
|
1998-08-09 08:43:13 +08:00
|
|
|
|
1998-10-25 09:41:42 +08:00
|
|
|
#include "portable.h"
|
1998-08-09 08:43:13 +08:00
|
|
|
|
1998-10-25 09:41:42 +08:00
|
|
|
#include <stdio.h>
|
1998-08-09 08:43:13 +08:00
|
|
|
|
1999-06-03 08:37:44 +08:00
|
|
|
#include <ac/stdlib.h>
|
1998-10-25 09:41:42 +08:00
|
|
|
#include <ac/string.h>
|
1998-08-09 08:43:13 +08:00
|
|
|
|
1999-06-01 04:40:42 +08:00
|
|
|
#define AVL_INTERNAL
|
1999-06-01 04:32:21 +08:00
|
|
|
#define AVL_NONREENTRANT
|
1998-10-25 09:41:42 +08:00
|
|
|
#include "avl.h"
|
|
|
|
|
|
|
|
static void ravl_print LDAP_P(( Avlnode *root, int depth ));
|
|
|
|
static void myprint LDAP_P(( Avlnode *root ));
|
2002-12-15 06:25:52 +08:00
|
|
|
static int avl_strcmp LDAP_P(( const void *s, const void *t ));
|
1998-08-09 08:43:13 +08:00
|
|
|
|
Protoized, moved extern definitions to .h files, fixed related bugs.
Most function and variable definitions are now preceded by its extern
definition, for error checking. Retyped a number of functions, usually
to return void. Fixed a number of printf format errors.
API changes (in ldap/include):
Added avl_dup_ok, avl_prefixapply, removed ber_fatten (probably typo
for ber_flatten), retyped ldap_sort_strcasecmp, grew lutil.h.
A number of `extern' declarations are left (some added by protoize), to
be cleaned away later. Mostly strdup(), strcasecmp(), mktemp(), optind,
optarg, errno.
1998-11-16 06:40:11 +08:00
|
|
|
int
|
|
|
|
main( int argc, char **argv )
|
1998-08-09 08:43:13 +08:00
|
|
|
{
|
1999-06-01 04:40:42 +08:00
|
|
|
Avlnode *tree = NULL;
|
1998-08-09 08:43:13 +08:00
|
|
|
char command[ 10 ];
|
|
|
|
char name[ 80 ];
|
|
|
|
char *p;
|
|
|
|
|
|
|
|
printf( "> " );
|
|
|
|
while ( fgets( command, sizeof( command ), stdin ) != NULL ) {
|
|
|
|
switch( *command ) {
|
|
|
|
case 'n': /* new tree */
|
2002-12-16 20:02:54 +08:00
|
|
|
( void ) avl_free( tree, free );
|
1999-06-01 04:40:42 +08:00
|
|
|
tree = NULL;
|
1998-08-09 08:43:13 +08:00
|
|
|
break;
|
|
|
|
case 'p': /* print */
|
|
|
|
( void ) myprint( tree );
|
|
|
|
break;
|
|
|
|
case 't': /* traverse with first, next */
|
1999-06-01 04:32:21 +08:00
|
|
|
#ifdef AVL_NONREENTRANT
|
1998-08-09 08:43:13 +08:00
|
|
|
printf( "***\n" );
|
|
|
|
for ( p = (char * ) avl_getfirst( tree );
|
1999-06-01 04:32:21 +08:00
|
|
|
p != NULL;
|
|
|
|
p = (char *) avl_getnext())
|
1998-08-09 08:43:13 +08:00
|
|
|
printf( "%s\n", p );
|
|
|
|
printf( "***\n" );
|
1999-06-01 04:32:21 +08:00
|
|
|
#else
|
|
|
|
printf( "*** reentrant interface not implemented ***" );
|
|
|
|
#endif
|
1998-08-09 08:43:13 +08:00
|
|
|
break;
|
|
|
|
case 'f': /* find */
|
|
|
|
printf( "data? " );
|
|
|
|
if ( fgets( name, sizeof( name ), stdin ) == NULL )
|
1999-08-04 02:14:24 +08:00
|
|
|
exit( EXIT_SUCCESS );
|
1998-08-09 08:43:13 +08:00
|
|
|
name[ strlen( name ) - 1 ] = '\0';
|
2002-12-15 06:25:52 +08:00
|
|
|
if ( (p = (char *) avl_find( tree, name, avl_strcmp ))
|
1998-08-09 08:43:13 +08:00
|
|
|
== NULL )
|
|
|
|
printf( "Not found.\n\n" );
|
|
|
|
else
|
|
|
|
printf( "%s\n\n", p );
|
|
|
|
break;
|
|
|
|
case 'i': /* insert */
|
|
|
|
printf( "data? " );
|
|
|
|
if ( fgets( name, sizeof( name ), stdin ) == NULL )
|
1999-08-04 02:14:24 +08:00
|
|
|
exit( EXIT_SUCCESS );
|
1998-08-09 08:43:13 +08:00
|
|
|
name[ strlen( name ) - 1 ] = '\0';
|
2002-12-15 06:25:52 +08:00
|
|
|
if ( avl_insert( &tree, strdup( name ), avl_strcmp,
|
1998-10-25 09:41:42 +08:00
|
|
|
avl_dup_error ) != 0 )
|
1998-08-09 08:43:13 +08:00
|
|
|
printf( "\nNot inserted!\n" );
|
|
|
|
break;
|
|
|
|
case 'd': /* delete */
|
|
|
|
printf( "data? " );
|
|
|
|
if ( fgets( name, sizeof( name ), stdin ) == NULL )
|
1999-08-04 02:14:24 +08:00
|
|
|
exit( EXIT_SUCCESS );
|
1998-08-09 08:43:13 +08:00
|
|
|
name[ strlen( name ) - 1 ] = '\0';
|
2002-12-15 06:25:52 +08:00
|
|
|
if ( avl_delete( &tree, name, avl_strcmp ) == NULL )
|
1998-08-09 08:43:13 +08:00
|
|
|
printf( "\nNot found!\n" );
|
|
|
|
break;
|
|
|
|
case 'q': /* quit */
|
1999-08-04 02:14:24 +08:00
|
|
|
exit( EXIT_SUCCESS );
|
1998-08-09 08:43:13 +08:00
|
|
|
break;
|
|
|
|
case '\n':
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
printf("Commands: insert, delete, print, new, quit\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
printf( "> " );
|
|
|
|
}
|
1999-03-04 01:30:55 +08:00
|
|
|
|
|
|
|
return( 0 );
|
1998-08-09 08:43:13 +08:00
|
|
|
}
|
|
|
|
|
1998-10-25 09:41:42 +08:00
|
|
|
static void ravl_print( Avlnode *root, int depth )
|
1998-08-09 08:43:13 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if ( root == 0 )
|
|
|
|
return;
|
|
|
|
|
|
|
|
ravl_print( root->avl_right, depth+1 );
|
|
|
|
|
|
|
|
for ( i = 0; i < depth; i++ )
|
|
|
|
printf( " " );
|
1999-03-04 01:32:26 +08:00
|
|
|
printf( "%s %d\n", (char *) root->avl_data, root->avl_bf );
|
1998-08-09 08:43:13 +08:00
|
|
|
|
|
|
|
ravl_print( root->avl_left, depth+1 );
|
|
|
|
}
|
|
|
|
|
1998-10-25 09:41:42 +08:00
|
|
|
static void myprint( Avlnode *root )
|
1998-08-09 08:43:13 +08:00
|
|
|
{
|
|
|
|
printf( "********\n" );
|
|
|
|
|
|
|
|
if ( root == 0 )
|
|
|
|
printf( "\tNULL\n" );
|
|
|
|
else
|
1998-10-25 09:41:42 +08:00
|
|
|
ravl_print( root, 0 );
|
1998-08-09 08:43:13 +08:00
|
|
|
|
|
|
|
printf( "********\n" );
|
|
|
|
}
|
2002-12-15 06:25:52 +08:00
|
|
|
|
|
|
|
static int avl_strcmp( const void *s, const void *t )
|
|
|
|
{
|
|
|
|
return strcmp( s, t );
|
|
|
|
}
|