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 set_check (gpointer key,
496 g_assert_not_reached ();
498 g_assert_cmpint (atoi (key) % 7, ==, 2);
506 GHashTable *hash_table =
507 g_hash_table_new_full (g_str_hash, g_str_equal, g_free, NULL);
510 for (i = 2; i < 5000; i += 7)
512 char *s = g_strdup_printf ("%d", i);
513 g_hash_table_insert (hash_table, s, s);
517 g_hash_table_foreach (hash_table, set_check, &i);
518 g_assert_cmpint (i, ==, g_hash_table_size (hash_table));
520 /* this will cause the hash table to loose set nature */
521 g_hash_table_insert (hash_table, g_strdup ("a"), "b");
523 g_assert_cmpstr (g_hash_table_lookup (hash_table, "2"), ==, "2");
524 g_assert_cmpstr (g_hash_table_lookup (hash_table, "a"), ==, "b");
526 g_hash_table_destroy (hash_table);
531 test_hash_misc (void)
533 GHashTable *hash_table;
537 GList *keys, *values;
538 gint keys_len, values_len;
540 gpointer ikey, ivalue;
541 int result_array[10000];
544 hash_table = g_hash_table_new (my_hash, my_hash_equal);
545 fill_hash_table_and_array (hash_table);
546 pvalue = g_hash_table_find (hash_table, find_first, &value);
547 if (!pvalue || *pvalue != value)
548 g_assert_not_reached();
550 keys = g_hash_table_get_keys (hash_table);
552 g_assert_not_reached ();
554 values = g_hash_table_get_values (hash_table);
556 g_assert_not_reached ();
558 keys_len = g_list_length (keys);
559 values_len = g_list_length (values);
560 if (values_len != keys_len && keys_len != g_hash_table_size (hash_table))
561 g_assert_not_reached ();
564 g_list_free (values);
566 init_result_array (result_array);
567 g_hash_table_iter_init (&iter, hash_table);
568 for (i = 0; i < 10000; i++)
570 g_assert (g_hash_table_iter_next (&iter, &ikey, &ivalue));
572 handle_pair (ikey, ivalue, result_array);
575 g_hash_table_iter_remove (&iter);
577 g_assert (! g_hash_table_iter_next (&iter, &ikey, &ivalue));
578 g_assert (g_hash_table_size (hash_table) == 5000);
579 verify_result_array (result_array);
581 fill_hash_table_and_array (hash_table);
583 init_result_array (result_array);
584 g_hash_table_foreach (hash_table, my_hash_callback, result_array);
585 verify_result_array (result_array);
587 for (i = 0; i < 10000; i++)
588 g_hash_table_remove (hash_table, &array[i]);
590 fill_hash_table_and_array (hash_table);
592 if (g_hash_table_foreach_remove (hash_table, my_hash_callback_remove, NULL) != 5000 ||
593 g_hash_table_size (hash_table) != 5000)
594 g_assert_not_reached();
596 g_hash_table_foreach (hash_table, my_hash_callback_remove_test, NULL);
597 g_hash_table_destroy (hash_table);
599 hash_table = g_hash_table_new (my_hash, my_hash_equal);
600 fill_hash_table_and_array (hash_table);
604 g_hash_table_iter_init (&iter, hash_table);
605 for (i = 0; i < 10000; i++)
607 g_assert (g_hash_table_iter_next (&iter, &ikey, &ivalue));
608 g_hash_table_iter_replace (&iter, &n_array[0]);
611 g_hash_table_iter_init (&iter, hash_table);
612 for (i = 0; i < 10000; i++)
614 g_assert (g_hash_table_iter_next (&iter, &ikey, &ivalue));
616 g_assert (ivalue == &n_array[0]);
619 g_hash_table_destroy (hash_table);
622 static gint destroy_counter;
625 value_destroy (gpointer value)
636 gboolean abc_seen = FALSE;
637 gboolean cde_seen = FALSE;
638 gboolean xyz_seen = FALSE;
640 h = g_hash_table_new_full (g_str_hash, g_str_equal, NULL, value_destroy);
641 g_hash_table_insert (h, "abc", "ABC");
642 g_hash_table_insert (h, "cde", "CDE");
643 g_hash_table_insert (h, "xyz", "XYZ");
645 g_assert_cmpint (g_hash_table_size (h), == , 3);
647 g_hash_table_iter_init (&iter, h);
649 while (g_hash_table_iter_next (&iter, (gpointer*)&key, (gpointer*)&value))
651 if (strcmp (key, "abc") == 0)
653 g_assert_cmpstr (value, ==, "ABC");
655 g_hash_table_iter_steal (&iter);
657 else if (strcmp (key, "cde") == 0)
659 g_assert_cmpstr (value, ==, "CDE");
662 else if (strcmp (key, "xyz") == 0)
664 g_assert_cmpstr (value, ==, "XYZ");
668 g_assert_cmpint (destroy_counter, ==, 0);
670 g_assert (g_hash_table_iter_get_hash_table (&iter) == h);
671 g_assert (abc_seen && cde_seen && xyz_seen);
672 g_assert_cmpint (g_hash_table_size (h), == , 2);
674 g_hash_table_ref (h);
675 g_hash_table_destroy (h);
676 g_assert_cmpint (g_hash_table_size (h), == , 0);
677 g_assert_cmpint (destroy_counter, ==, 2);
678 g_hash_table_insert (h, "uvw", "UVW");
679 g_hash_table_unref (h);
680 g_assert_cmpint (destroy_counter, ==, 3);
684 null_safe_str_hash (gconstpointer key)
689 return g_str_hash (key);
693 null_safe_str_equal (gconstpointer a, gconstpointer b)
695 return g_strcmp0 (a, b) == 0;
699 test_lookup_null_key (void)
706 g_test_bug ("642944");
708 h = g_hash_table_new (null_safe_str_hash, null_safe_str_equal);
709 g_hash_table_insert (h, "abc", "ABC");
711 res = g_hash_table_lookup_extended (h, NULL, &key, &value);
714 g_hash_table_insert (h, NULL, "NULL");
716 res = g_hash_table_lookup_extended (h, NULL, &key, &value);
718 g_assert_cmpstr (value, ==, "NULL");
720 g_hash_table_unref (h);
723 static gint destroy_key_counter;
726 key_destroy (gpointer key)
728 destroy_key_counter++;
732 test_remove_all (void)
737 h = g_hash_table_new_full (g_str_hash, g_str_equal, key_destroy, value_destroy);
738 g_hash_table_insert (h, "abc", "ABC");
739 g_hash_table_insert (h, "cde", "CDE");
740 g_hash_table_insert (h, "xyz", "XYZ");
743 destroy_key_counter = 0;
745 g_hash_table_steal_all (h);
746 g_assert_cmpint (destroy_counter, ==, 0);
747 g_assert_cmpint (destroy_key_counter, ==, 0);
749 g_hash_table_insert (h, "abc", "ABC");
750 g_hash_table_insert (h, "cde", "CDE");
751 g_hash_table_insert (h, "xyz", "XYZ");
753 res = g_hash_table_steal (h, "nosuchkey");
755 g_assert_cmpint (destroy_counter, ==, 0);
756 g_assert_cmpint (destroy_key_counter, ==, 0);
758 res = g_hash_table_steal (h, "xyz");
760 g_assert_cmpint (destroy_counter, ==, 0);
761 g_assert_cmpint (destroy_key_counter, ==, 0);
763 g_hash_table_remove_all (h);
764 g_assert_cmpint (destroy_counter, ==, 2);
765 g_assert_cmpint (destroy_key_counter, ==, 2);
767 g_hash_table_unref (h);
776 hash_func (gconstpointer key)
778 const RefCountedKey *rkey = key;
780 return g_str_hash (rkey->key);
784 eq_func (gconstpointer a, gconstpointer b)
786 const RefCountedKey *aa = a;
787 const RefCountedKey *bb = b;
789 return g_strcmp0 (aa->key, bb->key) == 0;
793 key_unref (gpointer data)
795 RefCountedKey *key = data;
797 g_assert (key->ref_count > 0);
801 if (key->ref_count == 0)
805 static RefCountedKey *
806 key_ref (RefCountedKey *key)
813 static RefCountedKey *
814 key_new (const gchar *key)
818 rkey = g_new (RefCountedKey, 1);
827 set_ref_hash_test (void)
833 h = g_hash_table_new_full (hash_func, eq_func, key_unref, key_unref);
835 key1 = key_new ("a");
836 key2 = key_new ("a");
838 g_assert_cmpint (key1->ref_count, ==, 1);
839 g_assert_cmpint (key2->ref_count, ==, 1);
841 g_hash_table_insert (h, key_ref (key1), key_ref (key1));
843 g_assert_cmpint (key1->ref_count, ==, 3);
844 g_assert_cmpint (key2->ref_count, ==, 1);
846 g_hash_table_replace (h, key_ref (key2), key_ref (key2));
848 g_assert_cmpint (key1->ref_count, ==, 1);
849 g_assert_cmpint (key2->ref_count, ==, 3);
851 g_hash_table_remove (h, key1);
853 g_assert_cmpint (key1->ref_count, ==, 1);
854 g_assert_cmpint (key2->ref_count, ==, 1);
856 g_hash_table_unref (h);
865 value_destroy_insert (gpointer value)
867 g_hash_table_remove_all (h);
871 test_destroy_modify (void)
873 g_test_bug ("650459");
875 h = g_hash_table_new_full (g_str_hash, g_str_equal, g_free, value_destroy_insert);
877 g_hash_table_insert (h, g_strdup ("a"), g_strdup ("b"));
878 g_hash_table_insert (h, g_strdup ("c"), g_strdup ("d"));
879 g_hash_table_insert (h, g_strdup ("e"), g_strdup ("f"));
880 g_hash_table_insert (h, g_strdup ("g"), g_strdup ("h"));
881 g_hash_table_insert (h, g_strdup ("h"), g_strdup ("k"));
882 g_hash_table_insert (h, g_strdup ("a"), g_strdup ("c"));
884 g_hash_table_remove (h, "c");
885 g_hash_table_remove (h, "e");
887 g_hash_table_unref (h);
891 find_str (gpointer key, gpointer value, gpointer data)
893 return g_str_equal (key, data);
902 hash = g_hash_table_new (g_str_hash, g_str_equal);
904 g_hash_table_insert (hash, "a", "A");
905 g_hash_table_insert (hash, "b", "B");
906 g_hash_table_insert (hash, "c", "C");
907 g_hash_table_insert (hash, "d", "D");
908 g_hash_table_insert (hash, "e", "E");
909 g_hash_table_insert (hash, "f", "F");
911 value = g_hash_table_find (hash, find_str, "a");
912 g_assert_cmpstr (value, ==, "A");
914 value = g_hash_table_find (hash, find_str, "b");
915 g_assert_cmpstr (value, ==, "B");
917 value = g_hash_table_find (hash, find_str, "c");
918 g_assert_cmpstr (value, ==, "C");
920 value = g_hash_table_find (hash, find_str, "d");
921 g_assert_cmpstr (value, ==, "D");
923 value = g_hash_table_find (hash, find_str, "e");
924 g_assert_cmpstr (value, ==, "E");
926 value = g_hash_table_find (hash, find_str, "f");
927 g_assert_cmpstr (value, ==, "F");
929 value = g_hash_table_find (hash, find_str, "0");
930 g_assert (value == NULL);
932 g_hash_table_unref (hash);
935 gboolean seen_key[6];
938 foreach_func (gpointer key, gpointer value, gpointer data)
940 seen_key[((char*)key)[0] - 'a'] = TRUE;
949 hash = g_hash_table_new (g_str_hash, g_str_equal);
951 g_hash_table_insert (hash, "a", "A");
952 g_hash_table_insert (hash, "b", "B");
953 g_hash_table_insert (hash, "c", "C");
954 g_hash_table_insert (hash, "d", "D");
955 g_hash_table_insert (hash, "e", "E");
956 g_hash_table_insert (hash, "f", "F");
958 for (i = 0; i < 6; i++)
961 g_hash_table_foreach (hash, foreach_func, NULL);
963 for (i = 0; i < 6; i++)
964 g_assert (seen_key[i]);
966 g_hash_table_unref (hash);
975 gint noccupied; /* nnodes + tombstones */
982 GEqualFunc key_equal_func;
983 volatile gint ref_count;
985 #ifndef G_DISABLE_ASSERT
988 GDestroyNotify key_destroy_func;
989 GDestroyNotify value_destroy_func;
993 count_keys (GHashTable *h, gint *unused, gint *occupied, gint *tombstones)
1000 for (i = 0; i < h->size; i++)
1002 if (h->hashes[i] == 0)
1004 else if (h->hashes[i] == 1)
1012 check_data (GHashTable *h)
1016 for (i = 0; i < h->size; i++)
1018 if (h->hashes[i] < 2)
1020 g_assert (h->keys[i] == NULL);
1021 g_assert (h->values[i] == NULL);
1025 g_assert_cmpint (h->hashes[i], ==, h->hash_func (h->keys[i]));
1031 check_consistency (GHashTable *h)
1037 count_keys (h, &unused, &occupied, &tombstones);
1039 g_assert_cmpint (occupied, ==, h->nnodes);
1040 g_assert_cmpint (occupied + tombstones, ==, h->noccupied);
1041 g_assert_cmpint (occupied + tombstones + unused, ==, h->size);
1047 check_counts (GHashTable *h, gint occupied, gint tombstones)
1049 g_assert_cmpint (occupied, ==, h->nnodes);
1050 g_assert_cmpint (occupied + tombstones, ==, h->noccupied);
1054 trivial_key_destroy (gpointer key)
1059 test_internal_consistency (void)
1063 h = g_hash_table_new_full (g_str_hash, g_str_equal, trivial_key_destroy, NULL);
1065 check_counts (h, 0, 0);
1066 check_consistency (h);
1068 g_hash_table_insert (h, "a", "A");
1069 g_hash_table_insert (h, "b", "B");
1070 g_hash_table_insert (h, "c", "C");
1071 g_hash_table_insert (h, "d", "D");
1072 g_hash_table_insert (h, "e", "E");
1073 g_hash_table_insert (h, "f", "F");
1075 check_counts (h, 6, 0);
1076 check_consistency (h);
1078 g_hash_table_remove (h, "a");
1079 check_counts (h, 5, 1);
1080 check_consistency (h);
1082 g_hash_table_remove (h, "b");
1083 check_counts (h, 4, 2);
1084 check_consistency (h);
1086 g_hash_table_insert (h, "c", "c");
1087 check_counts (h, 4, 2);
1088 check_consistency (h);
1090 g_hash_table_insert (h, "a", "A");
1091 check_counts (h, 5, 1);
1092 check_consistency (h);
1094 g_hash_table_remove_all (h);
1095 check_counts (h, 0, 0);
1096 check_consistency (h);
1098 g_hash_table_unref (h);
1102 my_key_free (gpointer v)
1105 g_assert (s[0] != 'x');
1111 my_value_free (gpointer v)
1114 g_assert (s[0] != 'y');
1120 test_iter_replace (void)
1123 GHashTableIter iter;
1127 g_test_bug ("662544");
1129 h = g_hash_table_new_full (g_str_hash, g_str_equal, my_key_free, my_value_free);
1131 g_hash_table_insert (h, g_strdup ("A"), g_strdup ("a"));
1132 g_hash_table_insert (h, g_strdup ("B"), g_strdup ("b"));
1133 g_hash_table_insert (h, g_strdup ("C"), g_strdup ("c"));
1135 g_hash_table_iter_init (&iter, h);
1137 while (g_hash_table_iter_next (&iter, &k, &v))
1140 g_assert (g_ascii_islower (s[0]));
1141 g_hash_table_iter_replace (&iter, g_strdup (k));
1144 g_hash_table_unref (h);
1148 main (int argc, char *argv[])
1150 g_test_init (&argc, &argv, NULL);
1152 g_test_bug_base ("http://bugzilla.gnome.org/");
1154 g_test_add_func ("/hash/misc", test_hash_misc);
1155 g_test_add_data_func ("/hash/one", GINT_TO_POINTER (TRUE), second_hash_test);
1156 g_test_add_data_func ("/hash/honeyman", GINT_TO_POINTER (FALSE), second_hash_test);
1157 g_test_add_func ("/hash/direct", direct_hash_test);
1158 g_test_add_func ("/hash/int64", int64_hash_test);
1159 g_test_add_func ("/hash/double", double_hash_test);
1160 g_test_add_func ("/hash/string", string_hash_test);
1161 g_test_add_func ("/hash/set", set_hash_test);
1162 g_test_add_func ("/hash/set-ref", set_ref_hash_test);
1163 g_test_add_func ("/hash/ref", test_hash_ref);
1164 g_test_add_func ("/hash/remove-all", test_remove_all);
1165 g_test_add_func ("/hash/find", test_find);
1166 g_test_add_func ("/hash/foreach", test_foreach);
1168 /* tests for individual bugs */
1169 g_test_add_func ("/hash/lookup-null-key", test_lookup_null_key);
1170 g_test_add_func ("/hash/destroy-modify", test_destroy_modify);
1171 g_test_add_func ("/hash/consistency", test_internal_consistency);
1172 g_test_add_func ("/hash/iter-replace", test_iter_replace);
1174 return g_test_run ();