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 3 Create an AVL which stores integer values and we check 
 * mavl_get_ext.
 */


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

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

        /*
         * 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));
        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 = 0; i < NUMVALS; i+=2) {
                insval = i;
                (void)mavl_insert(t, &insval, &exists);
        }

        search = 3;
        result =
        mavl_get_ext(t , &search, MAVL_FIND_LAST);

        printf("Resul is %d\n",*result);

        mavl_destroy(t);
        return 0;
}