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.
 */

static float 
calc_depth(int numvals)
{
        int i;
        unsigned int r=1;
        for (i=0; i<64; i++){
                if (r>(unsigned int)numvals)
                        return (float)((double)i*1.44);
                r=r<<1;
        }
        return (float)0.0;
}


/* 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
 */



static void pcb(char*dst,struct mavlnode *n)
{
        int *d = mavlnode_dataptr(n);
        (void) sprintf(dst,"(%d) %d ",n->bal,*d);
}

struct mavl * the_t;
void the_print()
{
        mavl_print(the_t,pcb,150);
}

int
main(int argc,char ** argv)
{
        int i,val,prevval;
        int insval;
        int exists;
        struct mavl *t;
        void *data;
        struct mavliter it;

        int numvals = 3;
        const char * alg = "mav";
        int del=-1;

        if (argc>1) {
                numvals = atoi(argv[1]);
                if (argc >2){
                        alg = argv[2];
                }

                if (argc > 3){
                        del = atoi(argv[3]);
                }
        }


        /*
         * Create a MAVL object which store object of size of int . Because
         * we do not have to free any memory, wo don't need to define free
         * function, so second argument to mavl_create is NULL.
         */
        t = mavl_create(cmp, NULL, sizeof(int));
        the_t = t;
        if (t == NULL) {
                (void)fprintf(stderr,
                              "Can't create struct mavl*: %s\n",
                              strerror(errno));
                return errno;
        }

        /* Seed the random generator with current time stamp */
        srand((unsigned int)time(NULL));

        /* Put some random values into our MAVL tree */
        for (i = 1; i < argc; i++) {
                /*insval = rand();*/
                if (strcmp(argv[i],"d")==0)
                        break;
                insval = atoi( argv[i] );
                (void)mavl_insert(t, &insval, &exists);

                (void)printf("%d. -----------------------------------------\n",i);
                mavl_print(t,pcb,150);
        }

        for(i=i+1; i<argc; i++){
                del = atoi(argv[i]);
                mavl_del(t,&del);
                mavl_print(t,pcb,150);
        }

        printf("Real Depth: %d, Max Depth: %f (n:%d)\n",
                        mavl_get_depth(t),
                        calc_depth(t->count),t->count);
/*
        if (del!=-1){
                mavl_del(t,&del);
                mavl_print(t,pcb,80);
        }
*/

        /* Init the iterator */
        mavliter_init(&it, t);

        /*
         * Move the iteratyor to the beginning of the MAVL tree. This is not
         * implied by mavliter_init and will cause your program to crash if
         * you don't do it.
         */
        (void)mavliter_seek_set(&it);

        prevval=-1;

        /* 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){
                        (void)printf("%d ", val); 
                }
                else {
                        (void)printf("ERROR: %d ", val);
                }
                prevval = val;
                (void)mavliter_next(&it);
        }
        (void)printf("\n");

        return 0;
}