Commit | Line | Data |
---|---|---|
b90f122b RK |
1 | /* |
2 | * This file is part of DisOrder. | |
3 | * Copyright (C) 2005, 2007, 2008 Richard Kettlewell | |
4 | * | |
e7eb3a27 | 5 | * This program is free software: you can redistribute it and/or modify |
b90f122b | 6 | * it under the terms of the GNU General Public License as published by |
e7eb3a27 | 7 | * the Free Software Foundation, either version 3 of the License, or |
b90f122b | 8 | * (at your option) any later version. |
e7eb3a27 RK |
9 | * |
10 | * This program is distributed in the hope that it will be useful, | |
11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 | * GNU General Public License for more details. | |
14 | * | |
b90f122b | 15 | * You should have received a copy of the GNU General Public License |
e7eb3a27 | 16 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
b90f122b RK |
17 | */ |
18 | #include "test.h" | |
19 | ||
ae3a68fa RK |
20 | static int count; |
21 | ||
22 | static int test_hash_callback(const char attribute((unused)) *key, | |
23 | void attribute((unused)) *value, | |
24 | void attribute((unused)) *u) { | |
25 | if(u) | |
26 | insist(count < 100); | |
27 | ++count; | |
28 | if(u) | |
29 | return count >= 100 ? 99 : 0; | |
30 | else | |
31 | return 0; | |
32 | } | |
33 | ||
c68d8eba | 34 | static void test_hash(void) { |
b90f122b RK |
35 | hash *h; |
36 | int i, *ip; | |
37 | char **keys; | |
38 | ||
b90f122b RK |
39 | h = hash_new(sizeof(int)); |
40 | for(i = 0; i < 10000; ++i) | |
41 | insist(hash_add(h, do_printf("%d", i), &i, HASH_INSERT) == 0); | |
42 | check_integer(hash_count(h), 10000); | |
ae3a68fa RK |
43 | i = hash_foreach(h, test_hash_callback, NULL); |
44 | check_integer(i, 0); | |
45 | check_integer(count, 10000); | |
46 | count = 0; | |
47 | i = hash_foreach(h, test_hash_callback, h); | |
48 | check_integer(i, 99); | |
49 | check_integer(count, 100); | |
50 | ||
b90f122b RK |
51 | for(i = 0; i < 10000; ++i) { |
52 | insist((ip = hash_find(h, do_printf("%d", i))) != 0); | |
53 | check_integer(*ip, i); | |
54 | insist(hash_add(h, do_printf("%d", i), &i, HASH_REPLACE) == 0); | |
55 | } | |
56 | check_integer(hash_count(h), 10000); | |
57 | keys = hash_keys(h); | |
58 | for(i = 0; i < 10000; ++i) | |
59 | insist(keys[i] != 0); | |
60 | insist(keys[10000] == 0); | |
61 | for(i = 0; i < 10000; ++i) | |
62 | insist(hash_remove(h, do_printf("%d", i)) == 0); | |
63 | check_integer(hash_count(h), 0); | |
64 | } | |
65 | ||
c68d8eba RK |
66 | TEST(hash); |
67 | ||
b90f122b RK |
68 | /* |
69 | Local Variables: | |
70 | c-basic-offset:2 | |
71 | comment-column:40 | |
72 | fill-column:79 | |
73 | indent-tabs-mode:nil | |
74 | End: | |
75 | */ |