1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
3 * Copyright (C) 1999 The Free Software Foundation
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Lesser General Public
7 * License as published by the Free Software Foundation; either
8 * version 2 of the License, or (at your option) any later version.
10 * This library 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 GNU
13 * Lesser General Public License for more details.
15 * You should have received a copy of the GNU Lesser General Public
16 * License along with this library; if not, write to the
17 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 * Boston, MA 02111-1307, USA.
22 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
23 * file for a list of people on the GLib Team. See the ChangeLog
24 * files for a list of changes. These files are distributed with
25 * GLib at ftp://ftp.gtk.org/pub/gtk/.
28 #undef G_DISABLE_ASSERT
48 fill_hash_table_and_array (GHashTable *hash_table)
52 for (i = 0; i < 10000; i++)
55 g_hash_table_insert (hash_table, &array[i], &array[i]);
60 init_result_array (int result_array[10000])
64 for (i = 0; i < 10000; i++)
69 verify_result_array (int array[10000])
73 for (i = 0; i < 10000; i++)
74 g_assert (array[i] == i);
78 handle_pair (gpointer key, gpointer value, int result_array[10000])
82 g_assert (key == value);
86 g_assert (n >= 0 && n < 10000);
87 g_assert (result_array[n] == -1);
93 my_hash_callback_remove (gpointer key,
106 my_hash_callback_remove_test (gpointer key,
113 g_assert_not_reached ();
117 my_hash_callback (gpointer key,
121 handle_pair (key, value, user_data);
125 my_hash (gconstpointer key)
127 return (guint) *((const gint*) key);
131 my_hash_equal (gconstpointer a,
134 return *((const gint*) a) == *((const gint*) b);
140 * This is a simplified version of the pathalias hashing function.
141 * Thanks to Steve Belovin and Peter Honeyman
143 * hash a string into a long int. 31 bit crc (from andrew appel).
144 * the crc table is computed at run time by crcinit() -- we could
145 * precompute, but it takes 1 clock tick on a 750.
147 * This fast table calculation works only if POLY is a prime polynomial
148 * in the field of integers modulo 2. Since the coefficients of a
149 * 32-bit polynomial won't fit in a 32-bit word, the high-order bit is
150 * implicit. IT MUST ALSO BE THE CASE that the coefficients of orders
151 * 31 down to 25 are zero. Happily, we have candidates, from
152 * E. J. Watson, "Primitive Polynomials (Mod 2)", Math. Comp. 16 (1962):
153 * x^32 + x^7 + x^5 + x^3 + x^2 + x^1 + x^0
156 * We reverse the bits to get:
157 * 111101010000000000000000000000001 but drop the last 1
159 * 010010000000000000000000000000001 ditto, for 31-bit crc
163 #define POLY 0x48000000L /* 31-bit polynomial (avoids sign problems) */
165 static guint CrcTable[128];
168 - crcinit - initialize tables for hash function
170 static void crcinit(void)
175 for (i = 0; i < 128; ++i)
178 for (j = 7 - 1; j >= 0; --j)
186 - hash - Honeyman's nice hashing function
189 honeyman_hash (gconstpointer key)
191 const gchar *name = (const gchar *) key;
195 g_assert (name != NULL);
196 g_assert (*name != 0);
198 size = strlen (name);
201 sum = (sum >> 7) ^ CrcTable[(sum ^ (*name++)) & 0x7f];
208 second_hash_cmp (gconstpointer a, gconstpointer b)
210 return strcmp (a, b) == 0;
216 one_hash (gconstpointer key)
223 not_even_foreach (gpointer key,
227 const char *_key = (const char *) key;
228 const char *_value = (const char *) value;
232 g_assert (_key != NULL);
233 g_assert (*_key != 0);
234 g_assert (_value != NULL);
235 g_assert (*_value != 0);
239 sprintf (val, "%d value", i);
240 g_assert (strcmp (_value, val) == 0);
242 g_assert ((i % 2) != 0);
248 remove_even_foreach (gpointer key,
252 const char *_key = (const char *) key;
253 const char *_value = (const char *) value;
257 g_assert (_key != NULL);
258 g_assert (*_key != 0);
259 g_assert (_value != NULL);
260 g_assert (*_value != 0);
264 sprintf (val, "%d value", i);
265 g_assert (strcmp (_value, val) == 0);
267 return ((i % 2) == 0) ? TRUE : FALSE;
274 second_hash_test (gconstpointer d)
276 gboolean simple_hash = GPOINTER_TO_INT (d);
279 char key[20] = "", val[20]="", *v, *orig_key, *orig_val;
285 h = g_hash_table_new_full (simple_hash ? one_hash : honeyman_hash,
288 g_assert (h != NULL);
289 for (i = 0; i < 20; i++)
291 sprintf (key, "%d", i);
292 g_assert (atoi (key) == i);
294 sprintf (val, "%d value", i);
295 g_assert (atoi (val) == i);
297 g_hash_table_insert (h, g_strdup (key), g_strdup (val));
300 g_assert (g_hash_table_size (h) == 20);
302 for (i = 0; i < 20; i++)
304 sprintf (key, "%d", i);
305 g_assert (atoi(key) == i);
307 v = (char *) g_hash_table_lookup (h, key);
309 g_assert (v != NULL);
311 g_assert (atoi (v) == i);
314 sprintf (key, "%d", 3);
315 g_hash_table_remove (h, key);
316 g_assert (g_hash_table_size (h) == 19);
317 g_hash_table_foreach_remove (h, remove_even_foreach, NULL);
318 g_assert (g_hash_table_size (h) == 9);
319 g_hash_table_foreach (h, not_even_foreach, NULL);
321 for (i = 0; i < 20; i++)
323 sprintf (key, "%d", i);
324 g_assert (atoi(key) == i);
326 sprintf (val, "%d value", i);
327 g_assert (atoi (val) == i);
329 orig_key = orig_val = NULL;
330 found = g_hash_table_lookup_extended (h, key,
332 (gpointer)&orig_val);
333 if ((i % 2) == 0 || i == 3)
341 g_assert (orig_key != NULL);
342 g_assert (strcmp (key, orig_key) == 0);
344 g_assert (orig_val != NULL);
345 g_assert (strcmp (val, orig_val) == 0);
348 g_hash_table_destroy (h);
352 find_first (gpointer key,
357 gint *test = user_data;
358 return (*v == *test);
363 direct_hash_test (void)
368 h = g_hash_table_new (NULL, NULL);
369 g_assert (h != NULL);
370 for (i = 1; i <= 20; i++)
371 g_hash_table_insert (h, GINT_TO_POINTER (i),
372 GINT_TO_POINTER (i + 42));
374 g_assert (g_hash_table_size (h) == 20);
376 for (i = 1; i <= 20; i++)
378 rc = GPOINTER_TO_INT (g_hash_table_lookup (h, GINT_TO_POINTER (i)));
381 g_assert ((rc - 42) == i);
384 g_hash_table_destroy (h);
388 int64_hash_test (void)
395 h = g_hash_table_new (g_int64_hash, g_int64_equal);
396 g_assert (h != NULL);
397 for (i = 0; i < 20; i++)
400 g_hash_table_insert (h, &values[i], GINT_TO_POINTER (i + 42));
403 g_assert (g_hash_table_size (h) == 20);
405 for (i = 0; i < 20; i++)
408 rc = GPOINTER_TO_INT (g_hash_table_lookup (h, &key));
410 g_assert_cmpint (rc, ==, i + 42);
413 g_hash_table_destroy (h);
417 double_hash_test (void)
424 h = g_hash_table_new (g_double_hash, g_double_equal);
425 g_assert (h != NULL);
426 for (i = 0; i < 20; i++)
428 values[i] = i + 42.5;
429 g_hash_table_insert (h, &values[i], GINT_TO_POINTER (i + 42));
432 g_assert (g_hash_table_size (h) == 20);
434 for (i = 0; i < 20; i++)
437 rc = GPOINTER_TO_INT (g_hash_table_lookup (h, &key));
439 g_assert_cmpint (rc, ==, i + 42);
442 g_hash_table_destroy (h);
446 string_free (gpointer data)
450 g_string_free (s, TRUE);
454 string_hash_test (void)
460 h = g_hash_table_new_full ((GHashFunc)g_string_hash, (GEqualFunc)g_string_equal, string_free, NULL);
461 g_assert (h != NULL);
462 for (i = 0; i < 20; i++)
464 s = g_string_new ("");
465 g_string_append_printf (s, "%d", i + 42);
466 g_string_append_c (s, '.');
467 g_string_prepend_unichar (s, 0x2301);
468 g_hash_table_insert (h, s, GINT_TO_POINTER (i + 42));
471 g_assert (g_hash_table_size (h) == 20);
473 s = g_string_new ("");
474 for (i = 0; i < 20; i++)
476 g_string_assign (s, "");
477 g_string_append_printf (s, "%d", i + 42);
478 g_string_append_c (s, '.');
479 g_string_prepend_unichar (s, 0x2301);
480 rc = GPOINTER_TO_INT (g_hash_table_lookup (h, s));
482 g_assert_cmpint (rc, ==, i + 42);
485 g_string_free (s, TRUE);
486 g_hash_table_destroy (h);
490 test_hash_misc (void)
492 GHashTable *hash_table;
496 GList *keys, *values;
497 gint keys_len, values_len;
499 gpointer ikey, ivalue;
500 int result_array[10000];
502 hash_table = g_hash_table_new (my_hash, my_hash_equal);
503 fill_hash_table_and_array (hash_table);
504 pvalue = g_hash_table_find (hash_table, find_first, &value);
505 if (!pvalue || *pvalue != value)
506 g_assert_not_reached();
508 keys = g_hash_table_get_keys (hash_table);
510 g_assert_not_reached ();
512 values = g_hash_table_get_values (hash_table);
514 g_assert_not_reached ();
516 keys_len = g_list_length (keys);
517 values_len = g_list_length (values);
518 if (values_len != keys_len && keys_len != g_hash_table_size (hash_table))
519 g_assert_not_reached ();
522 g_list_free (values);
524 init_result_array (result_array);
525 g_hash_table_iter_init (&iter, hash_table);
526 for (i = 0; i < 10000; i++)
528 g_assert (g_hash_table_iter_next (&iter, &ikey, &ivalue));
530 handle_pair (ikey, ivalue, result_array);
533 g_hash_table_iter_remove (&iter);
535 g_assert (! g_hash_table_iter_next (&iter, &ikey, &ivalue));
536 g_assert (g_hash_table_size (hash_table) == 5000);
537 verify_result_array (result_array);
539 fill_hash_table_and_array (hash_table);
541 init_result_array (result_array);
542 g_hash_table_foreach (hash_table, my_hash_callback, result_array);
543 verify_result_array (result_array);
545 for (i = 0; i < 10000; i++)
546 g_hash_table_remove (hash_table, &array[i]);
548 fill_hash_table_and_array (hash_table);
550 if (g_hash_table_foreach_remove (hash_table, my_hash_callback_remove, NULL) != 5000 ||
551 g_hash_table_size (hash_table) != 5000)
552 g_assert_not_reached();
554 g_hash_table_foreach (hash_table, my_hash_callback_remove_test, NULL);
555 g_hash_table_destroy (hash_table);
558 static gint destroy_counter;
561 value_destroy (gpointer value)
572 gboolean abc_seen = FALSE;
573 gboolean cde_seen = FALSE;
574 gboolean xyz_seen = FALSE;
576 h = g_hash_table_new_full (g_str_hash, g_str_equal, NULL, value_destroy);
577 g_hash_table_insert (h, "abc", "ABC");
578 g_hash_table_insert (h, "cde", "CDE");
579 g_hash_table_insert (h, "xyz", "XYZ");
581 g_assert_cmpint (g_hash_table_size (h), == , 3);
583 g_hash_table_iter_init (&iter, h);
585 while (g_hash_table_iter_next (&iter, (gpointer*)&key, (gpointer*)&value))
587 if (strcmp (key, "abc") == 0)
589 g_assert_cmpstr (value, ==, "ABC");
591 g_hash_table_iter_steal (&iter);
593 else if (strcmp (key, "cde") == 0)
595 g_assert_cmpstr (value, ==, "CDE");
598 else if (strcmp (key, "xyz") == 0)
600 g_assert_cmpstr (value, ==, "XYZ");
604 g_assert_cmpint (destroy_counter, ==, 0);
606 g_assert (g_hash_table_iter_get_hash_table (&iter) == h);
607 g_assert (abc_seen && cde_seen && xyz_seen);
608 g_assert_cmpint (g_hash_table_size (h), == , 2);
610 g_hash_table_ref (h);
611 g_hash_table_destroy (h);
612 g_assert_cmpint (g_hash_table_size (h), == , 0);
613 g_assert_cmpint (destroy_counter, ==, 2);
614 g_hash_table_insert (h, "uvw", "UVW");
615 g_hash_table_unref (h);
616 g_assert_cmpint (destroy_counter, ==, 3);
620 null_safe_str_hash (gconstpointer key)
625 return g_str_hash (key);
629 null_safe_str_equal (gconstpointer a, gconstpointer b)
631 return g_strcmp0 (a, b) == 0;
635 test_lookup_null_key (void)
642 g_test_bug ("642944");
644 h = g_hash_table_new (null_safe_str_hash, null_safe_str_equal);
645 g_hash_table_insert (h, "abc", "ABC");
647 res = g_hash_table_lookup_extended (h, NULL, &key, &value);
650 g_hash_table_insert (h, NULL, "NULL");
652 res = g_hash_table_lookup_extended (h, NULL, &key, &value);
654 g_assert_cmpstr (value, ==, "NULL");
656 g_hash_table_unref (h);
659 static gint destroy_key_counter;
662 key_destroy (gpointer key)
664 destroy_key_counter++;
668 test_remove_all (void)
672 h = g_hash_table_new_full (g_str_hash, g_str_equal, key_destroy, value_destroy);
673 g_hash_table_insert (h, "abc", "ABC");
674 g_hash_table_insert (h, "cde", "CDE");
675 g_hash_table_insert (h, "xyz", "XYZ");
678 destroy_key_counter = 0;
680 g_hash_table_steal_all (h);
681 g_assert_cmpint (destroy_counter, ==, 0);
682 g_assert_cmpint (destroy_key_counter, ==, 0);
684 g_hash_table_insert (h, "abc", "ABC");
685 g_hash_table_insert (h, "cde", "CDE");
686 g_hash_table_insert (h, "xyz", "XYZ");
688 g_hash_table_remove_all (h);
689 g_assert_cmpint (destroy_counter, ==, 3);
690 g_assert_cmpint (destroy_key_counter, ==, 3);
692 g_hash_table_unref (h);
696 main (int argc, char *argv[])
698 g_test_init (&argc, &argv, NULL);
700 g_test_bug_base ("http://bugzilla.gnome.org/");
702 g_test_add_func ("/hash/misc", test_hash_misc);
703 g_test_add_data_func ("/hash/one", GINT_TO_POINTER (TRUE), second_hash_test);
704 g_test_add_data_func ("/hash/honeyman", GINT_TO_POINTER (FALSE), second_hash_test);
705 g_test_add_func ("/hash/direct", direct_hash_test);
706 g_test_add_func ("/hash/int64", int64_hash_test);
707 g_test_add_func ("/hash/double", double_hash_test);
708 g_test_add_func ("/hash/string", string_hash_test);
709 g_test_add_func ("/hash/ref", test_hash_ref);
710 g_test_add_func ("/hash/remove-all", test_remove_all);
712 /* tests for individual bugs */
713 g_test_add_func ("/hash/lookup-null-key", test_lookup_null_key);
715 return g_test_run ();