1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
/****************************************************************************
* NCSA HDF *
* Software Development Group *
* National Center for Supercomputing Applications *
* University of Illinois at Urbana-Champaign *
* 605 E. Springfield, Champaign IL 61820 *
* *
* For conditions of distribution and use, see the accompanying *
* hdf/COPYING file. *
* *
****************************************************************************/
/* $Id$ */
/*
FILE
tbbt.c
Test HDF Threaded-Balanced-Binary Tree (tbbt) routines.
REMARKS
DESIGN
BUGS/LIMITATIONS
EXPORTED ROUTINES
AUTHOR
Quincey Koziol
MODIFICATION HISTORY
4/22/00 - Converted from HDF4 test routine.
*/
#include <time.h>
#include "testhdf5.h"
#include "H5TBprivate.h"
#define MAX_TEST_SIZE 31 /* maximum number of elements to insert */
#define NUM_TEST_RUNS 100 /* number of times to insert & remove each size */
#define RandInt(a,b) ((rand()%(((b)-(a))+1))+(a))
intn tcompare (void * k1, void * k2, intn cmparg);
static void swap_arr(int *arr, intn a, intn b)
{
int t;
if (a != b)
{
t = arr[a];
arr[a] = arr[b];
arr[b] = t;
} /* end if */
} /* end swap_arr() */
intn
tcompare(void * k1, void * k2, intn cmparg)
{
/* shut compiler up */
cmparg=cmparg;
return ((intn) ((*(int *) k1) - (*(int *) k2)));
}
void
test_tbbt(void)
{
intn test_size;
intn i, j;
int ins_arr[MAX_TEST_SIZE];
int rem_arr[MAX_TEST_SIZE];
intn t;
H5TB_TREE *tree;
void * *r;
t = (intn)time(NULL);
srand((uintn)t);
for (test_size = 3; test_size <= MAX_TEST_SIZE; test_size++)
{
MESSAGE(7, ("\nTesting trees with %d elements\n", test_size));
MESSAGE(8, ("Testing tree #:"));
for (j = 0; j < NUM_TEST_RUNS; j++)
{
MESSAGE(8, (" %d", j));
for (i = 0; i < test_size; i++)
{ /* initialize the arrays */
ins_arr[i] = i;
rem_arr[i] = i;
} /* end for */
for (i = 0; i < test_size; i++)
{ /* shuffle the arrays */
t = RandInt(i, test_size - 1);
swap_arr(ins_arr, i, t);
t = RandInt(i, test_size - 1);
swap_arr(rem_arr, i, t);
} /* end for */
if (Verbosity > 9)
{
printf("ins_arr: \n");
for (i = 0; i < test_size; i++) /* print the arrays */
printf("%d \n", (int) ins_arr[i]);
printf("\nrem_arr: \n");
for (i = 0; i < test_size; i++) /* print the arrays */
printf("%d \n", (int) rem_arr[i]);
printf("\n");
} /* end if */
tree = H5TB_dmake(tcompare, sizeof(int),0);
for (i = 0; i < test_size; i++)
{
MESSAGE(9, ("inserting %d\n", (int) ins_arr[i]));
H5TB_dins(tree, (void *) &ins_arr[i], NULL);
#ifdef H5TB_DEBUG
if(Verbosity>9)
H5TB_dump(tree, -1);
#endif /* H5TB_DEBUG */
}
#ifdef H5TB_DEBUG
if(Verbosity>9)
H5TB_dump(tree, -1);
#endif /* H5TB_DEBUG */
for (i = 0; i < test_size; i++)
{
int key;
key = rem_arr[i];
r = (void * *) H5TB_dfind(tree, (void *) &key, NULL);
MESSAGE(9, ("removing %d\n", (int) key));
H5TB_rem((H5TB_NODE **) tree, (H5TB_NODE *) r, NULL);
#ifdef H5TB_DEBUG
if(Verbosity>9)
H5TB_dump(tree, -1);
#endif /* H5TB_DEBUG */
} /* end for */
H5TB_dfree(tree, NULL, NULL);
} /* end for */
} /* end for */
} /* end test_tbbt() */
|
