1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Library General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Library General Public License for more details.
14 * You should have received a copy of the GNU Library General Public
15 * License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
26 gboolean failed = FALSE;
28 #define TEST(m,cond) G_STMT_START { failed = !(cond); \
31 g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \
33 g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)m); \
36 g_print ("."); fflush (stdout); \
39 #define C2P(c) ((gpointer) ((long) (c)))
40 #define P2C(p) ((gchar) ((long) (p)))
42 #define GLIB_TEST_STRING "el dorado "
43 #define GLIB_TEST_STRING_5 "el do"
52 my_compare (gconstpointer a,
62 my_traverse (gpointer key,
79 tree = g_tree_new (my_compare);
81 for (j = 0; j < 10; j++, i++)
84 g_tree_insert (tree, &chars[i], &chars[i]);
86 for (j = 0; j < 26; j++, i++)
89 g_tree_insert (tree, &chars[i], &chars[i]);
91 for (j = 0; j < 26; j++, i++)
94 g_tree_insert (tree, &chars[i], &chars[i]);
97 g_tree_traverse (tree, my_traverse, G_IN_ORDER, NULL);
99 g_assert (g_tree_nnodes (tree) == (10 + 26 + 26));
101 for (i = 0; i < 10; i++)
102 g_tree_remove (tree, &chars[i]);
104 g_tree_traverse (tree, my_traverse, G_IN_ORDER, NULL);