src/avl/avl_bench1.c File Reference

#include <stdio.h>
#include "array.h"
#include "avl.h"
#include "util.h"

Include dependency graph for avl_bench1.c:

Go to the source code of this file.

Defines
#define	MAX_WORD   1024
Functions
long	random ()
	main (argc, char *argv)

---

Define Documentation

#define MAX_WORD   1024

Definition at line 15 of file avl_bench1.c.

---

Function Documentation

main	(	argc	,
		char *	argv
	)

Definition at line 20 of file avl_bench1.c.

{
    array_t *words;
    avl_tree *table;
    char word[MAX_WORD], *tempi, *tempj;
    register int i, j;
    long time;
#ifdef TEST
    avl_generator *gen;
    char *key;
#endif

    /* read the words */
    words = array_alloc(char *, 1000);
    while (gets(word) != NIL(char)) {
        array_insert_last(char *, words, util_strsav(word));
        if (array_n(words) == 100000) break;
    }

    /* scramble them */
    for(i = array_n(words)-1; i >= 1; i--) {
        j = random() % i;
        tempi = array_fetch(char *, words, i);
        tempj = array_fetch(char *, words, j);
        array_insert(char *, words, i, tempj);
        array_insert(char *, words, j, tempi);
    }

#ifdef TEST
    (void) printf("Initial data is\n");
    for(i = array_n(words)-1; i >= 0; i--) {
        (void) printf("%s\n", array_fetch(char *, words, i));
    }
#endif

    /* time putting them into an avl tree */
    time = util_cpu_time();
    table = avl_init_table(strcmp);
    for(i = array_n(words)-1; i >= 0; i--) {
        (void) avl_insert(table, array_fetch(char *, words, i), NIL(char));
    }
    (void) printf("Elapsed time for insert of %d objects was %s\n",
        array_n(words), util_print_time(util_cpu_time() - time));

#ifdef TEST
    (void) printf("Sorted data is\n");
    avl_foreach_item(table, gen, AVL_FORWARD, &key, NIL(char *)) {
        (void) printf("%s\n", key);
    }
#endif
    return 0;
}

long random

(

)