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"
59 my_list_compare_one (gconstpointer a, gconstpointer b)
61 gint one = *((const gint*)a);
62 gint two = *((const gint*)b);
67 my_list_compare_two (gconstpointer a, gconstpointer b)
69 gint one = *((const gint*)a);
70 gint two = *((const gint*)b);
79 gint nums[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
80 gint morenums[10] = { 8, 9, 7, 0, 3, 2, 5, 1, 4, 6};
84 for (i = 0; i < 10; i++)
85 list = g_list_append (list, &nums[i]);
86 list = g_list_reverse (list);
88 for (i = 0; i < 10; i++)
90 t = g_list_nth (list, i);
91 g_assert (*((gint*) t->data) == (9 - i));
94 for (i = 0; i < 10; i++)
95 g_assert (g_list_position(list, g_list_nth (list, i)) == i);
100 for (i = 0; i < 10; i++)
101 list = g_list_insert_sorted (list, &morenums[i], my_list_compare_one);
105 g_list_foreach (list, my_list_print, NULL);
108 for (i = 0; i < 10; i++)
110 t = g_list_nth (list, i);
111 g_assert (*((gint*) t->data) == i);
117 for (i = 0; i < 10; i++)
118 list = g_list_insert_sorted (list, &morenums[i], my_list_compare_two);
122 g_list_foreach (list, my_list_print, NULL);
125 for (i = 0; i < 10; i++)
127 t = g_list_nth (list, i);
128 g_assert (*((gint*) t->data) == (9 - i));
134 for (i = 0; i < 10; i++)
135 list = g_list_prepend (list, &morenums[i]);
137 list = g_list_sort (list, my_list_compare_two);
141 g_list_foreach (list, my_list_print, NULL);
144 for (i = 0; i < 10; i++)
146 t = g_list_nth (list, i);
147 g_assert (*((gint*) t->data) == (9 - i));