mirror of
https://git.openldap.org/openldap/openldap.git
synced 2025-12-20 22:59:34 -05:00
118 lines
2.3 KiB
C
118 lines
2.3 KiB
C
|
|
/* testavl.c - Test Tim Howes AVL code */
|
||
|
|
#include <sys/types.h>
|
||
|
|
#include <stdio.h>
|
||
|
|
#include "avl.h"
|
||
|
|
|
||
|
|
char *strdup( s )
|
||
|
|
char *s;
|
||
|
|
{
|
||
|
|
char *new;
|
||
|
|
|
||
|
|
if ( (new = (char *) malloc( strlen( s ) + 1 )) == NULL )
|
||
|
|
return( NULL );
|
||
|
|
|
||
|
|
strcpy( new, s );
|
||
|
|
|
||
|
|
return( new );
|
||
|
|
}
|
||
|
|
|
||
|
|
main( argc, argv )
|
||
|
|
int argc;
|
||
|
|
char **argv;
|
||
|
|
{
|
||
|
|
Avlnode *tree = NULLAVL;
|
||
|
|
char command[ 10 ];
|
||
|
|
char name[ 80 ];
|
||
|
|
char *p;
|
||
|
|
int free(), strcmp();
|
||
|
|
|
||
|
|
printf( "> " );
|
||
|
|
while ( fgets( command, sizeof( command ), stdin ) != NULL ) {
|
||
|
|
switch( *command ) {
|
||
|
|
case 'n': /* new tree */
|
||
|
|
( void ) avl_free( tree, free );
|
||
|
|
tree = NULLAVL;
|
||
|
|
break;
|
||
|
|
case 'p': /* print */
|
||
|
|
( void ) myprint( tree );
|
||
|
|
break;
|
||
|
|
case 't': /* traverse with first, next */
|
||
|
|
printf( "***\n" );
|
||
|
|
for ( p = (char * ) avl_getfirst( tree );
|
||
|
|
p != NULL; p = (char *) avl_getnext( tree, p ) )
|
||
|
|
printf( "%s\n", p );
|
||
|
|
printf( "***\n" );
|
||
|
|
break;
|
||
|
|
case 'f': /* find */
|
||
|
|
printf( "data? " );
|
||
|
|
if ( fgets( name, sizeof( name ), stdin ) == NULL )
|
||
|
|
exit( 0 );
|
||
|
|
name[ strlen( name ) - 1 ] = '\0';
|
||
|
|
if ( (p = (char *) avl_find( tree, name, strcmp ))
|
||
|
|
== 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 )
|
||
|
|
exit( 0 );
|
||
|
|
name[ strlen( name ) - 1 ] = '\0';
|
||
|
|
if ( avl_insert( &tree, strdup( name ), strcmp,
|
||
|
|
avl_dup_error ) != OK )
|
||
|
|
printf( "\nNot inserted!\n" );
|
||
|
|
break;
|
||
|
|
case 'd': /* delete */
|
||
|
|
printf( "data? " );
|
||
|
|
if ( fgets( name, sizeof( name ), stdin ) == NULL )
|
||
|
|
exit( 0 );
|
||
|
|
name[ strlen( name ) - 1 ] = '\0';
|
||
|
|
if ( avl_delete( &tree, name, strcmp ) == NULL )
|
||
|
|
printf( "\nNot found!\n" );
|
||
|
|
break;
|
||
|
|
case 'q': /* quit */
|
||
|
|
exit( 0 );
|
||
|
|
break;
|
||
|
|
case '\n':
|
||
|
|
break;
|
||
|
|
default:
|
||
|
|
printf("Commands: insert, delete, print, new, quit\n");
|
||
|
|
}
|
||
|
|
|
||
|
|
printf( "> " );
|
||
|
|
}
|
||
|
|
/* NOTREACHED */
|
||
|
|
}
|
||
|
|
|
||
|
|
static ravl_print( root, depth )
|
||
|
|
Avlnode *root;
|
||
|
|
int depth;
|
||
|
|
{
|
||
|
|
int i;
|
||
|
|
|
||
|
|
if ( root == 0 )
|
||
|
|
return;
|
||
|
|
|
||
|
|
ravl_print( root->avl_right, depth+1 );
|
||
|
|
|
||
|
|
for ( i = 0; i < depth; i++ )
|
||
|
|
printf( " " );
|
||
|
|
printf( "%s %d\n", root->avl_data, root->avl_bf );
|
||
|
|
|
||
|
|
ravl_print( root->avl_left, depth+1 );
|
||
|
|
}
|
||
|
|
|
||
|
|
myprint( root )
|
||
|
|
Avlnode *root;
|
||
|
|
{
|
||
|
|
printf( "********\n" );
|
||
|
|
|
||
|
|
if ( root == 0 )
|
||
|
|
printf( "\tNULL\n" );
|
||
|
|
else
|
||
|
|
( void ) ravl_print( root, 0 );
|
||
|
|
|
||
|
|
printf( "********\n" );
|
||
|
|
}
|