test-avl.c File Reference

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "avl.h"
#include "avl-cmp.h"
#include "utils.h"

Go to the source code of this file.

Data Structures
struct	node

Macros
#define	OUT(fmt, ...)

Functions
static void	test_basics ()
int	main ()

Macro Definition Documentation

OUT

#define OUT	(		fmt,
			...
	)

Value:

        do { \
        fprintf(stdout, "%s: " fmt, __func__, ## __VA_ARGS__); \
} while (0);

Definition at line 9 of file test-avl.c.

Function Documentation

main()

int main

(

)

Definition at line 83 of file test-avl.c.

{
        test_basics();
        return 0;
}

test_basics()

static void test_basics ( )

static

Definition at line 17 of file test-avl.c.

{
        size_t i;
        struct avl_tree t;
        struct node *temp;
        struct node *elem;
        struct node *last;
        struct node *first;
        const char *vals[] = {
                "zero", "one", "two", "three", "four", "five", "six",
                "seven", "eight", "nine", "ten", "eleven", "twelve"
        };
 
        avl_init(&t, avl_strcmp, false, NULL);
 
        OUT("insert: ");
        for (i=0; i<ARRAY_SIZE(vals); i++) {
                struct node *n = malloc(sizeof(struct node));
                n->avl.key = vals[i];
 
                int r = avl_insert(&t, &n->avl);
                fprintf(stdout, "%d=%s ", r, (char *)n->avl.key);
        }
        fprintf(stdout, "\n");
 
        OUT("insert duplicate: ");
        for (i=0; i<ARRAY_SIZE(vals); i++) {
                struct node *n = malloc(sizeof(struct node));
                n->avl.key = vals[i];
 
                int r = avl_insert(&t, &n->avl);
                fprintf(stdout, "%d=%s ", r, (char *)n->avl.key);
 
                if (r)
                        free(n);
        }
        fprintf(stdout, "\n");
 
        first = avl_first_element(&t, first, avl);
        last = avl_last_element(&t, last, avl);
        OUT("first=%s last=%s\n", (char*)first->avl.key, (char*)last->avl.key);
 
        OUT("for each element: ");
        avl_for_each_element(&t, elem, avl) {
                fprintf(stdout, "%s ", (char*)elem->avl.key);
        }
        fprintf(stdout, "\n");
 
        OUT("delete 'one' element\n");
        elem = avl_find_element(&t, "one", elem, avl);
        avl_delete(&t, &elem->avl);
        free(elem);
 
        OUT("for each element reverse: ");
        avl_for_each_element_reverse(&t, elem, avl) {
                fprintf(stdout, "%s ", (char*)elem->avl.key);
        }
        fprintf(stdout, "\n");
 
        OUT("delete all elements\n");
        avl_for_each_element_safe(&t, elem, avl, temp) {
                avl_delete(&t, &elem->avl);
                free(elem);
        }
}

Here is the call graph for this function: