Subversion Repositories PlanixRsrch.SVN

/*

 * Copyright 2019, The PLANIX Project

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions are

 * met:

 *

 * 1. Redistributions of source code must retain the above copyright notice,

 * this list of conditions and the following disclaimer.

 *

 * 2. Redistributions in binary form must reproduce the above copyright

 * notice, this list of conditions and the following disclaimer in the

 * documentation and/or other materials provided with the distribution.

 *

 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS

 * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,

 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR

 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,

 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,

 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR

 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF

 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING

 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS

 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

 */

#include <stdio.h>

#include <string.h>

#include <errno.h>

#include <stdlib.h>

#include <time.h>

#include "mavl.h"

/*

 * EXAMPLE 1 Create an AVL which stores just integer values.

 */

/* Compare function to compare integers */

static int

cmp(const void *v1, const void *v2)

{

	return *((int *)v1) - *((int *)v2);

}

/*

 * Number of integer values we want to put into our tree

 */

#define NUMVALS 15000000L

/* #define NUMVALS 60L */

void print(struct mavlnode *n, int dir)

{

	int v;

}

static int

verify(struct mavl *t)

{

	int prevval, val;

	struct mavliter it;

	void *data;

	prevval = -1;

	mavliter_init(&it, t);

	(void)mavliter_seek_set(&it);

	/* print out all integers stored in the MAVL tree */

	while ((data = mavliter_get(&it)) != NULL) {

		val = *((int *)data);

		/* Check if values are sorted */

		if (val <= prevval) {

			return 0;

		}

		prevval = val;

		(void)mavliter_next(&it);

	}

	return 1;

}

int

main(void)

{

	int i;

	int insval;

	int exists;

	struct mavl *t;

	clock_t clk;

	int rc;

	/*

	 * Create a MAVL object for integers.

	 */

	t = mavl_create(cmp, NULL, sizeof(int));

	if (t == NULL) {

		(void)fprintf(stderr,

			      "Can't create struct mavl*: %s\n",

			      strerror(errno));

		return errno;

	}

	(void)printf("Inserting %d sorted intergers ...\n", NUMVALS);

	clk = clock();

	for (i = 0; i < NUMVALS; i++) {

		insval = NUMVALS-i;

		(void)mavl_insert(t, &insval, &exists);

	}

	clk = clock() - clk;

	(void)printf("TIME: %0.2f SECONDS\n", (double)clk / (double)CLOCKS_PER_SEC);

	(void)printf("ELEMENTS IN TREE: %d\n", t->count);

	(void)printf("DEPTH = %d\n", mavl_get_depth(t));

	(void)printf("Verifying ... ");

	clk = clock();

	rc = mavl_verify(t);

	clk = clock() - clk;

	if (rc)

		(void)printf("ok\n");

	else

		(void)printf("error\n");

	(void)printf("VERIFYING TOOK: %0.2f SECONDS\n", (double)clk / (double)CLOCKS_PER_SEC);

	(void)printf("Deleting all values ... ");

	clk = clock();

	mavl_del_all(t);

	clk = clock() - clk;

	(void)printf("DELETION TOOK: %0.2f SECONDS\n", (double)clk / (double)CLOCKS_PER_SEC);

	(void)printf("ELEMENTS IN TREE: %d\n", t->count);

	(void)printf("DEPTH = %d\n", mavl_get_depth(t));

	(void)printf("Inserting %d random intergers ...\n", NUMVALS);

	/*srand(time(NULL));*/

	srand(1941);

	clk = clock();

	for (i = 0; i < NUMVALS; i++) {

		insval = rand();

		(void)mavl_insert(t, &insval, &exists);

	}

	clk = clock() - clk;

	(void)printf("TIME: %0.2f SECONDS\n", (double)clk / (double)CLOCKS_PER_SEC);

	(void)printf("ELEMENTS IN TREE: %d\n", t->count);

	(void)printf("DEPTH = %d\n", mavl_get_depth(t));

	(void)printf("Verifying ... ");

	clk = clock();

	rc = mavl_verify(t);

	clk = clock() - clk;

	if (rc)

		(void)printf("ok\n");

	else

		(void)printf("error\n");

	(void)printf("VERIFYING TOOK: %0.2f SECONDS\n", (double)clk / (double)CLOCKS_PER_SEC);

	(void)printf("Deleting all values ... \n");

	clk = clock();

	mavl_del_all(t);

	clk = clock() - clk;

	(void)printf("DELETION TOOK: %0.2f SECONDS\n", (double)clk / (double)CLOCKS_PER_SEC);

	(void)printf("ELEMENTS IN TREE: %d\n", t->count);

	(void)printf("DEPTH = %d\n", mavl_get_depth(t));

	return 0;

}