forked from nlehuen/ctst
-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.c
176 lines (142 loc) · 4.88 KB
/
main.c
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
/*
ctst - (c) 2007 Nicolas Lehuen
This is released under the LGPL - see http://www.gnu.org/licenses/lgpl.html
$Id: $
Main test file.
*/
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <ctst.h>
void load_test(ctst_ctst* ctst) {
int i=0,l=0,c=10000;
double f;
char dest[1024];
printf("Load test pass 0...");
for(i=0;i<c;i++) {
l = sprintf(dest,"%d",i%317);
assert(ctst_get(ctst,dest,0,l)==0);
}
printf("OK\n");
printf("Load test pass 1...");
for(i=0;i<c;i++) {
l = sprintf(dest,"%d",i%317);
ctst_set(ctst,dest,0,l,i%317);
assert(ctst_get(ctst,dest,0,l)==i%317);
}
printf(" OK\n");
printf("Load test pass 2...");
for(i=0;i<c;i++) {
l = sprintf(dest,"%d",i%317);
assert(ctst_get(ctst,dest,0,l)==i%317);
}
printf("OK\n");
printf("Load test pass 3...");
srand(1);
for(i=0;i<c;i++) {
f = 10000.0/(rand()%10000+1);
l = sprintf(dest,"%f",f);
ctst_set(ctst,dest,0,l,i+1);
assert(ctst_get(ctst,dest,0,l)==i+1);
}
printf("OK\n");
printf("Load test pass 4...");
srand(1);
for(i=0;i<c;i++) {
f = 10000.0/(rand()%10000+1);
l = sprintf(dest,"%f",f);
assert(ctst_get(ctst,dest,0,l)!=0);
}
printf("OK\n");
printf("Load test pass 5...");
for(i=0;i<c;i++) {
l = sprintf(dest,"%d",i);
ctst_set(ctst,dest,0,l,i);
assert(ctst_get(ctst,dest,0,l)==i);
}
printf("OK\n");
printf("Load test pass 6...");
srand(1);
for(i=0;i<c;i++) {
f = 10000.0/(rand()%10000+1);
l = sprintf(dest,"%f",f);
if(i%2==0) {
l = ctst_remove(ctst,dest,0,l);
assert(ctst_get(ctst,dest,0,l)==0);
}
}
printf("OK\n");
printf("Load test pass 7...");
srand(1);
for(i=0;i<c;i++) {
f = 10000.0/(rand()%10000+1);
l = sprintf(dest,"%f",f);
if(i%2==0) {
assert(ctst_get(ctst,dest,0,l)==0);
}
}
printf("OK\n");
}
ctst_data printer_visitor(void* context, char *key_bytes, size_t key_length, ctst_data data, size_t distance) {
printf("\"%*s\" : %d (length=%d,distance=%d)\n",key_length,key_bytes,data,key_length,distance);
return 0;
}
int main(int argc, char** argv) {
ctst_ctst* ctst = ctst_alloc();
ctst_data data;
data = ctst_set(ctst,"The answer to your question is",0,30,42);
printf("%*s %d (was %d)\n",30,"The answer to your question is",ctst_get(ctst,"The answer to your question is",0,30),data);
data = ctst_set(ctst,"Hello, world!",0,13,57);
printf("%*s %d (was %d)\n",13,"Hello, world!",ctst_get(ctst,"Hello, world!",0,13),data);
data = ctst_set(ctst,"Hello, world!",0,13,62);
printf("%*s %d (was %d)\n",13,"Hello, world!",ctst_get(ctst,"Hello, world!",0,13),data);
data = ctst_set(ctst,"The answer to your question is",0,30,11);
printf("%*s %d (was %d)\n",30,"The answer to your question is",ctst_get(ctst,"The answer to your question is",0,30),data);
data = ctst_set(ctst,"There is something rotten in the kingdom of Denmark",0,51,1122);
printf("DUMP OF THE TREE\n");
ctst_visit_all(ctst, &printer_visitor, 0);
printf("END DUMP OF THE TREE\n");
printf("DUMP OF THE TREE, only H*\n");
ctst_visit_all_from_key(ctst, &printer_visitor, 0, "**Hello", 2, 1);
printf("END DUMP OF THE TREE\n");
printf("DUMP OF THE TREE, only The*\n");
ctst_visit_all_from_key(ctst, &printer_visitor, 0, "The", 0, 3);
printf("END DUMP OF THE TREE\n");
printf("DUMP OF THE TREE, only There*\n");
ctst_visit_all_from_key(ctst, &printer_visitor, 0, "--There", 2, 5);
printf("END DUMP OF THE TREE\n");
printf("Number of entries: %d\nTotal length of keys: %d\nTotal node count: %d\nMemory usage: %d\nRatio: %f\n",
ctst_get_size(ctst),
ctst_get_total_key_length(ctst),
ctst_get_node_count(ctst),
ctst_get_memory_usage(ctst),
ctst_get_ratio(ctst)
);
printf("Removing a key\n");
data = ctst_remove(ctst,"Hello, world!",0,13);
printf("%*s %d (was %d)\n",13,"Hello, world!",ctst_get(ctst,"Hello, world!",0,13),data);
printf("Number of entries: %d\nTotal length of keys: %d\nTotal node count: %d\nMemory usage: %d\nRatio: %f\n",
ctst_get_size(ctst),
ctst_get_total_key_length(ctst),
ctst_get_node_count(ctst),
ctst_get_memory_usage(ctst),
ctst_get_ratio(ctst)
);
printf("DUMP OF THE TREE\n");
ctst_visit_all(ctst, &printer_visitor, 0);
printf("END DUMP OF THE TREE\n");
printf("LOAD TEST\n");
load_test(ctst);
printf("DUMP OF THE TREE\n");
ctst_visit_all(ctst, &printer_visitor, 0);
printf("END DUMP OF THE TREE\n");
printf("Number of entries: %d\nTotal length of keys: %d\nTotal node count: %d\nMemory usage: %d\nRatio: %f\n",
ctst_get_size(ctst),
ctst_get_total_key_length(ctst),
ctst_get_node_count(ctst),
ctst_get_memory_usage(ctst),
ctst_get_ratio(ctst)
);
ctst_free(ctst);
return 0;
}