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 Lesser 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 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser 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.
21 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
24 * GLib at ftp://ftp.gtk.org/pub/gtk/.
34 gboolean failed = FALSE;
36 #define TEST(m,cond) G_STMT_START { failed = !(cond); \
39 g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \
41 g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)m); \
44 g_print ("."); fflush (stdout); \
47 #define C2P(c) ((gpointer) ((long) (c)))
48 #define P2C(p) ((gchar) ((long) (p)))
50 #define GLIB_TEST_STRING "el dorado "
51 #define GLIB_TEST_STRING_5 "el do"
60 my_compare (gconstpointer a,
70 my_traverse (gpointer key,
87 tree = g_tree_new (my_compare);
89 for (j = 0; j < 10; j++, i++)
92 g_tree_insert (tree, &chars[i], &chars[i]);
94 for (j = 0; j < 26; j++, i++)
97 g_tree_insert (tree, &chars[i], &chars[i]);
99 for (j = 0; j < 26; j++, i++)
102 g_tree_insert (tree, &chars[i], &chars[i]);
105 g_tree_traverse (tree, my_traverse, G_IN_ORDER, NULL);
107 g_assert (g_tree_nnodes (tree) == (10 + 26 + 26));
109 for (i = 0; i < 10; i++)
110 g_tree_remove (tree, &chars[i]);
112 g_tree_traverse (tree, my_traverse, G_IN_ORDER, NULL);