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