2 * Copyright (C) 2009-2011 Free Software Foundation, Inc.
3 * Written by Jim Meyering
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 3 of the License, or
8 * (at your option) any later version.
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.
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see <http://www.gnu.org/licenses/>. */
32 #define STREQ(a, b) (strcmp (a, b) == 0)
33 #define ARRAY_CARDINALITY(Array) (sizeof (Array) / sizeof *(Array))
36 hash_compare_strings (void const *x, void const *y)
39 return STREQ (x, y) ? true : false;
49 insert_new (Hash_table *ht, const void *ent)
51 void *e = hash_insert (ht, ent);
56 walk (void *ent, void *data)
59 unsigned int *map = data;
62 case 'a': *map |= 1; return true;
63 case 'b': *map |= 2; return true;
64 case 'c': *map |= 4; return true;
71 get_seed (char const *str, unsigned int *seed)
73 size_t len = strlen (str);
74 if (len == 0 || strspn (str, "0123456789") != len || 10 < len)
82 main (int argc, char **argv)
86 unsigned int table_size[] = {1, 2, 3, 4, 5, 23, 53};
90 hash_reset_tuning (&tuning);
91 tuning.shrink_threshold = 0.3;
92 tuning.shrink_factor = 0.707;
93 tuning.growth_threshold = 1.5;
94 tuning.growth_factor = 2.0;
95 tuning.is_n_buckets = true;
100 if (get_seed (argv[1], &seed) != 0)
102 fprintf (stderr, "invalid seed: %s\n", argv[1]);
109 for (i = 0; i < ARRAY_CARDINALITY (table_size); i++)
111 size_t sz = table_size[i];
112 ht = hash_initialize (sz, NULL, hash_pjw, hash_compare_strings, NULL);
114 insert_new (ht, "a");
116 char *str1 = strdup ("a");
119 str2 = hash_insert (ht, str1);
120 ASSERT (str1 != str2);
121 ASSERT (STREQ (str1, str2));
124 insert_new (ht, "b");
125 insert_new (ht, "c");
127 ASSERT (hash_do_for_each (ht, walk, &i) == 3);
130 void *buf[5] = { NULL };
131 ASSERT (hash_get_entries (ht, NULL, 0) == 0);
132 ASSERT (hash_get_entries (ht, buf, 5) == 3);
133 ASSERT (STREQ (buf[0], "a") || STREQ (buf[0], "b") || STREQ (buf[0], "c"));
135 ASSERT (hash_delete (ht, "a"));
136 ASSERT (hash_delete (ht, "a") == NULL);
137 ASSERT (hash_delete (ht, "b"));
138 ASSERT (hash_delete (ht, "c"));
140 ASSERT (hash_rehash (ht, 47));
141 ASSERT (hash_rehash (ht, 467));
143 /* Free an empty table. */
147 ht = hash_initialize (sz, NULL, hash_pjw, hash_compare_strings, NULL);
150 insert_new (ht, "z");
151 insert_new (ht, "y");
152 insert_new (ht, "x");
153 insert_new (ht, "w");
154 insert_new (ht, "v");
155 insert_new (ht, "u");
158 ASSERT (hash_get_n_entries (ht) == 0);
161 /* Test pointer hashing. */
162 ht = hash_initialize (sz, NULL, NULL, NULL, NULL);
165 char *str = strdup ("a");
167 insert_new (ht, "a");
168 insert_new (ht, str);
169 ASSERT (hash_lookup (ht, str) == str);
175 hash_reset_tuning (&tuning);
176 tuning.shrink_threshold = 0.3;
177 tuning.shrink_factor = 0.707;
178 tuning.growth_threshold = 1.5;
179 tuning.growth_factor = 2.0;
180 tuning.is_n_buckets = true;
181 /* Invalid tuning. */
182 ht = hash_initialize (4651, &tuning, hash_pjw, hash_compare_strings,
186 /* Alternate tuning. */
187 tuning.growth_threshold = 0.89;
189 /* Run with default tuning, then with custom tuning settings. */
190 for (k = 0; k < 2; k++)
192 Hash_tuning const *tune = (k == 0 ? NULL : &tuning);
193 /* Now, each entry is malloc'd. */
194 ht = hash_initialize (4651, tune, hash_pjw,
195 hash_compare_strings, hash_freer);
197 for (i = 0; i < 10000; i++)
199 unsigned int op = rand () % 10;
210 char const *p = uinttostr (i, buf);
211 char *p_dup = strdup (p);
213 insert_new (ht, p_dup);
219 size_t n = hash_get_n_entries (ht);
220 ASSERT (hash_rehash (ht, n + rand () % 20));
226 size_t n = hash_get_n_entries (ht);
227 size_t delta = rand () % 20;
229 ASSERT (hash_rehash (ht, n - delta));
236 /* Delete a random entry. */
237 size_t n = hash_get_n_entries (ht);
240 size_t kk = rand () % n;
243 for (p = hash_get_first (ht); kk;
244 --kk, p = hash_get_next (ht, p))
249 v = hash_delete (ht, p);
256 ASSERT (hash_table_ok (ht));