| 0,0 → 1,127 |
|---|
| /* |
| * 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 3L |
| |
| extern void * |
| mav_insert(struct mavl *t, const void *data, int *exists); |
| |
| static void pcb(char*dst,struct mavlnode *n) |
| { |
| int *d = mavlnode_dataptr(n); |
| (void) sprintf(dst,"%d",*d); |
| } |
| |
| |
| |
| int |
| main(void) |
| { |
| int i,val,prevval; |
| int insval; |
| int exists; |
| struct mavl *t; |
| void *data; |
| struct mavliter it; |
| |
| /* |
| * 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++) { |
| /*insval = rand();*/ |
| insval = i; |
| (void)mavl_insert(t, &insval, &exists); |
| (void)printf("%d. -----------------------------------------\n",i); |
| 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; |
| } |