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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
/* settest.c -- Test program for Khepera set routines
* Created: Wed Nov 9 15:04:25 1994 by faith@cs.unc.edu
* Revised: Wed Sep 25 10:43:44 1996 by faith@cs.unc.edu
* Copyright 1994, 1995, 1996 Rickard E. Faith (faith@cs.unc.edu)
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 1, or (at your option) any
* later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 675 Mass Ave, Cambridge, MA 02139, USA.
*
* $Id: settest.c,v 1.8 1996/09/25 14:46:20 faith Exp $
*/
#include "maaP.h"
extern void init_rand( void );
extern int get_rand( int ll, int ul );
static int iterator( const void *key )
{
printf( "%s\n", (const char *)key );
return 0;
}
static int freer( const void *key )
{
xfree( (void *)key );
return 0;
}
int main( int argc, char **argv )
{
set_Set t;
set_Set t1;
set_Set t2;
int i;
int j;
int count;
set_Position p;
const void *k;
if (argc == 1) {
count = 100;
} else if (argc != 2 ) {
fprintf( stderr, "usage: settest count\n" );
return 1;
} else {
count = atoi( argv[1] );
}
printf( "Running test for count of %d\n", count );
/* Test sequential keys */
t = set_create( NULL, NULL );
for (i = 0; i < count; i++) {
char *key = xmalloc( 20 );
sprintf( key, "key%d", i );
set_insert( t, key );
}
for (i = count; i >= 0; i--) {
char key[100];
sprintf( key, "key%d", i );
if (!set_member( t, key ))
printf( "\"%s\" is not a member of the set\n", key );
}
if (count <= 200) set_iterate( t, iterator );
set_print_stats( t, stdout );
set_iterate( t, freer );
set_destroy( t );
/* Test random keys */
t = set_create( NULL, NULL );
init_rand();
for (i = 0; i < count; i++) {
int len = get_rand( 2, 32 );
char *key = xmalloc( len + 1 );
for (j = 0; j < len; j++) key[j] = get_rand( 32, 128 );
key[ len ] = '\0';
set_insert( t, key );
printf( "item%d = %s\n", i, key );
}
init_rand();
for (i = 0; i < count; i++) {
int len = get_rand( 2, 32 );
char *key = xmalloc( len + 1 );
for (j = 0; j < len; j++) key[j] = get_rand( 32, 128 );
key[ len ] = '\0';
printf( "lookup%d = %s\n", i, key );
if (!set_member( t, key ))
printf( "\"%s\" is not a member of the set", key );
xfree( key );
}
set_print_stats( t, stdout );
set_iterate( t, freer );
set_destroy( t );
/* Test (random) integer keys */
t = set_create( hsh_pointer_hash, hsh_pointer_compare );
init_rand();
for (i = 0; i < count; i++) {
int key = get_rand( 1, 16777216 );
set_insert( t, (void *)key );
printf( "int%d = %d\n", i, key );
}
init_rand();
for (i = 0; i < count; i++) {
int key = get_rand( 1, 16777216 );
printf( "intlookup%d = %d\n", i, key );
if (!set_member( t, (void *)key ))
printf( "%d is not a member of the set", key );
}
set_print_stats( t, stdout );
set_destroy( t );
/* Test set operations */
t1 = set_create( NULL, NULL );
t2 = set_create( NULL, NULL );
set_insert( t1, "foo" );
set_insert( t1, "bar" );
set_insert( t2, "t2-foo" );
set_insert( t2, "bar" );
printf( "\nSet 1:\n" );
set_iterate( t1, iterator );
printf( "\nSet 1 (again):\n" );
SET_ITERATE(t1,p,k) printf( "%s\n", (const char *)k );
printf( "\nSet 2:\n" );
set_iterate( t2, iterator );
printf( "Set 1 == Set 2 ? ===> %d\n", set_equal( t1, t2 ) );
printf( "Set 1 == Set 1 ? ===> %d\n", set_equal( t1, t1 ) );
printf( "\nUnion:\n");
t = set_union( t1, t2 );
set_iterate( t, iterator );
set_destroy( t );
printf( "\nIntersection:\n");
t = set_inter( t1, t2 );
set_iterate( t, iterator );
set_destroy( t );
printf( "\nDifference:\n");
t = set_diff( t1, t2 );
set_iterate( t, iterator );
set_destroy( t );
set_destroy( t1 );
set_destroy( t2 );
return 0;
}
|
