2 * Copyright (C) 2009 Free Software Foundation
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/>. */
31 #define STREQ(a, b) (strcmp (a, b) == 0)
32 #define ARRAY_CARDINALITY(Array) (sizeof (Array) / sizeof *(Array))
34 #define ASSERT(expr) \
39 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
47 hash_compare_strings (void const *x, void const *y)
50 return STREQ (x, y) ? true : false;
60 insert_new (Hash_table *ht, const void *ent)
62 void *e = hash_insert (ht, ent);
67 walk (void *ent, void *data)
70 unsigned int *map = data;
73 case 'a': *map |= 1; return true;
74 case 'b': *map |= 2; return true;
75 case 'c': *map |= 4; return true;
82 get_seed (char const *str, unsigned int *seed)
84 size_t len = strlen (str);
85 if (len == 0 || strspn (str, "0123456789") != len || 10 < len)
93 main (int argc, char **argv)
97 unsigned int table_size[] = {1, 2, 3, 4, 5, 23, 53};
101 hash_reset_tuning (&tuning);
102 tuning.shrink_threshold = 0.3;
103 tuning.shrink_factor = 0.707;
104 tuning.growth_threshold = 1.5;
105 tuning.growth_factor = 2.0;
106 tuning.is_n_buckets = true;
111 if (get_seed (argv[1], &seed) != 0)
113 fprintf (stderr, "invalid seed: %s\n", argv[1]);
120 for (i = 0; i < ARRAY_CARDINALITY (table_size); i++)
122 size_t sz = table_size[i];
123 ht = hash_initialize (sz, NULL, hash_pjw, hash_compare_strings, NULL);
125 insert_new (ht, "a");
127 char *str1 = xstrdup ("a");
128 char *str2 = hash_insert (ht, str1);
129 ASSERT (str1 != str2);
130 ASSERT (STREQ (str1, str2));
133 insert_new (ht, "b");
134 insert_new (ht, "c");
136 ASSERT (hash_do_for_each (ht, walk, &i) == 3);
139 void *buf[5] = { NULL };
140 ASSERT (hash_get_entries (ht, NULL, 0) == 0);
141 ASSERT (hash_get_entries (ht, buf, 5) == 3);
142 ASSERT (STREQ (buf[0], "a") || STREQ (buf[0], "b") || STREQ (buf[0], "c"));
144 ASSERT (hash_delete (ht, "a"));
145 ASSERT (hash_delete (ht, "a") == NULL);
146 ASSERT (hash_delete (ht, "b"));
147 ASSERT (hash_delete (ht, "c"));
149 ASSERT (hash_rehash (ht, 47));
150 ASSERT (hash_rehash (ht, 467));
152 /* Free an empty table. */
156 ht = hash_initialize (sz, NULL, hash_pjw, hash_compare_strings, NULL);
159 insert_new (ht, "z");
160 insert_new (ht, "y");
161 insert_new (ht, "x");
162 insert_new (ht, "w");
163 insert_new (ht, "v");
164 insert_new (ht, "u");
167 ASSERT (hash_get_n_entries (ht) == 0);
170 /* Test pointer hashing. */
171 ht = hash_initialize (sz, NULL, NULL, NULL, NULL);
174 char *str = xstrdup ("a");
175 insert_new (ht, "a");
176 insert_new (ht, str);
177 ASSERT (hash_lookup (ht, str) == str);
183 hash_reset_tuning (&tuning);
184 tuning.shrink_threshold = 0.3;
185 tuning.shrink_factor = 0.707;
186 tuning.growth_threshold = 1.5;
187 tuning.growth_factor = 2.0;
188 tuning.is_n_buckets = true;
189 /* Invalid tuning. */
190 ht = hash_initialize (4651, &tuning, hash_pjw, hash_compare_strings,
194 /* Alternate tuning. */
195 tuning.growth_threshold = 0.89;
197 /* Run with default tuning, then with custom tuning settings. */
198 for (k = 0; k < 2; k++)
200 Hash_tuning const *tune = (k == 0 ? NULL : &tuning);
201 /* Now, each entry is malloc'd. */
202 ht = hash_initialize (4651, tune, hash_pjw,
203 hash_compare_strings, hash_freer);
205 for (i = 0; i < 10000; i++)
207 unsigned int op = rand () % 10;
218 char const *p = uinttostr (i, buf);
219 insert_new (ht, xstrdup (p));
225 size_t n = hash_get_n_entries (ht);
226 ASSERT (hash_rehash (ht, n + rand () % 20));
232 size_t n = hash_get_n_entries (ht);
233 size_t delta = rand () % 20;
235 ASSERT (hash_rehash (ht, n - delta));
242 /* Delete a random entry. */
243 size_t n = hash_get_n_entries (ht);
246 size_t kk = rand () % n;
249 for (p = hash_get_first (ht); kk;
250 --kk, p = hash_get_next (ht, p))
255 v = hash_delete (ht, p);
262 ASSERT (hash_table_ok (ht));