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
192
193
194
195
196
197
198
199
200
201
|
/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* libdatrie - Double-Array Trie Library
* Copyright (C) 2013 Theppitak Karoonboonyanan <theppitak@gmail.com>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/*
* test_store-retrieve.c - Test for datrie store/retrieve operations
* Created: 2013-10-16
* Author: Theppitak Karoonboonyanan <theppitak@gmail.com>
*/
#include <datrie/trie.h>
#include "utils.h"
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int
main ()
{
Trie *test_trie;
DictRec *dict_p;
TrieData trie_data;
Bool is_failed;
int n_entries, n_dels, i;
TrieState *trie_root_state;
TrieIterator *trie_it;
msg_step ("Preparing trie");
test_trie = en_trie_new ();
if (!test_trie) {
fprintf (stderr, "Fail to create test trie\n");
goto err_trie_not_created;
}
/* store */
msg_step ("Adding data to trie");
for (dict_p = dict_src; dict_p->key; dict_p++) {
if (!trie_store (test_trie, dict_p->key, dict_p->data)) {
printf ("Failed to add key '%ls', data %d.\n",
dict_p->key, dict_p->data);
goto err_trie_created;
}
}
/* retrieve */
msg_step ("Retrieving data from trie");
is_failed = FALSE;
for (dict_p = dict_src; dict_p->key; dict_p++) {
if (!trie_retrieve (test_trie, dict_p->key, &trie_data)) {
printf ("Failed to retrieve key '%ls'.\n", dict_p->key);
is_failed = TRUE;
}
if (trie_data != dict_p->data) {
printf ("Wrong data for key '%ls'; expected %d, got %d.\n",
dict_p->key, dict_p->data, trie_data);
is_failed = TRUE;
}
}
if (is_failed) {
printf ("Trie store/retrieval test failed.\n");
goto err_trie_created;
}
/* delete */
msg_step ("Deleting some entries from trie");
n_entries = dict_src_n_entries ();
srand (time (NULL));
for (n_dels = n_entries/3 + 1; n_dels > 0; n_dels--) {
/* pick an undeleted entry */
do {
i = rand () % n_entries;
} while (TRIE_DATA_READ == dict_src[i].data);
printf ("Deleting '%ls'\n", dict_src[i].key);
if (!trie_delete (test_trie, dict_src[i].key)) {
printf ("Failed to delete '%ls'\n", dict_src[i].key);
is_failed = TRUE;
}
dict_src[i].data = TRIE_DATA_READ;
}
if (is_failed) {
printf ("Trie deletion test failed.\n");
goto err_trie_created;
}
/* retrieve */
msg_step ("Retrieving data from trie again after deletions");
for (dict_p = dict_src; dict_p->key; dict_p++) {
/* skip deleted entries */
if (TRIE_DATA_READ == dict_p->data)
continue;
if (!trie_retrieve (test_trie, dict_p->key, &trie_data)) {
printf ("Failed to retrieve key '%ls'.\n", dict_p->key);
is_failed = TRUE;
}
if (trie_data != dict_p->data) {
printf ("Wrong data for key '%ls'; expected %d, got %d.\n",
dict_p->key, dict_p->data, trie_data);
is_failed = TRUE;
}
}
if (is_failed) {
printf ("Trie retrival-after-deletion test failed.\n");
goto err_trie_created;
}
/* enumerate & check */
msg_step ("Iterating trie contents after deletions");
trie_root_state = trie_root (test_trie);
if (!trie_root_state) {
printf ("Failed to get trie root state\n");
goto err_trie_created;
}
trie_it = trie_iterator_new (trie_root_state);
if (!trie_it) {
printf ("Failed to get trie iterator\n");
goto err_trie_root_created;
}
while (trie_iterator_next (trie_it)) {
AlphaChar *key;
TrieData key_data, src_data;
key = trie_iterator_get_key (trie_it);
if (!key) {
printf ("Failed to get key from trie iterator\n");
is_failed = TRUE;
continue;
}
key_data = trie_iterator_get_data (trie_it);
if (TRIE_DATA_ERROR == key_data) {
printf ("Failed to get data from trie iterator for key '%ls'\n",
key);
is_failed = TRUE;
}
/* mark entries found in trie */
src_data = dict_src_get_data (key);
if (TRIE_DATA_ERROR == src_data) {
printf ("Extra entry in trie: key '%ls', data %d.\n",
key, key_data);
is_failed = TRUE;
} else if (src_data != key_data) {
printf ("Data mismatch for: key '%ls', expected %d, got %d.\n",
key, src_data, key_data);
is_failed = TRUE;
} else {
dict_src_set_data (key, TRIE_DATA_READ);
}
free (key);
}
/* check for unmarked entries, (i.e. missed in trie) */
for (dict_p = dict_src; dict_p->key; dict_p++) {
if (dict_p->data != TRIE_DATA_READ) {
printf ("Entry missed in trie: key '%ls', data %d.\n",
dict_p->key, dict_p->data);
is_failed = TRUE;
}
}
if (is_failed) {
printf ("Errors found in trie iteration after deletions.\n");
goto err_trie_it_created;
}
trie_iterator_free (trie_it);
trie_state_free (trie_root_state);
trie_free (test_trie);
return 0;
err_trie_it_created:
trie_iterator_free (trie_it);
err_trie_root_created:
trie_state_free (trie_root_state);
err_trie_created:
trie_free (test_trie);
err_trie_not_created:
return 1;
}
/*
vi:ts=4:ai:expandtab
*/
|
