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
143
|
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* *
* This file is part of HDF5. The full HDF5 copyright notice, including *
* terms governing use, modification, and redistribution, is contained in *
* the files COPYING and Copyright.html. COPYING can be found at the root *
* of the source code distribution tree; Copyright.html can be found at the *
* root level of an installed copy of the electronic HDF5 document set and *
* is linked from the top-level documents page. It can also be found at *
* http://hdf.ncsa.uiuc.edu/HDF5/doc/Copyright.html. If you do not have *
* access to either file, you may request a copy from hdfhelp@ncsa.uiuc.edu. *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/*
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))
int tcompare (const void * k1, const void * k2, int cmparg);
static void swap_arr(int *arr, int a, int b)
{
int t;
if (a != b)
{
t = arr[a];
arr[a] = arr[b];
arr[b] = t;
} /* end if */
} /* end swap_arr() */
int
tcompare(const void * k1, const void * k2, int cmparg)
{
/* shut compiler up */
cmparg=cmparg;
return ((int) ((*(const int *) k1) - (*(const int *) k2)));
}
void
test_tbbt(void)
{
int test_size;
int i, j;
int ins_arr[MAX_TEST_SIZE];
int rem_arr[MAX_TEST_SIZE];
int t;
H5TB_TREE *tree;
void * *r;
t = (int)time(NULL);
srand((unsigned)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 (GetTestVerbosity() >= VERBO_HI)
{
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(GetTestVerbosity() >= VERBO_HI)
H5TB_dump(tree, -1);
#endif /* H5TB_DEBUG */
}
#ifdef H5TB_DEBUG
if(GetTestVerbosity() >= VERBO_HI)
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(GetTestVerbosity() >= VERBO_HI)
H5TB_dump(tree, -1);
#endif /* H5TB_DEBUG */
} /* end for */
H5TB_dfree(tree, NULL, NULL);
} /* end for */
} /* end for */
} /* end test_tbbt() */
|
