1 | /* GLIB - Library of useful routines for C programming |
---|
2 | * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald |
---|
3 | * |
---|
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. |
---|
8 | * |
---|
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. |
---|
13 | * |
---|
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. |
---|
18 | */ |
---|
19 | |
---|
20 | /* |
---|
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/. |
---|
25 | */ |
---|
26 | |
---|
27 | #undef G_DISABLE_ASSERT |
---|
28 | #undef G_LOG_DOMAIN |
---|
29 | |
---|
30 | #include <stdio.h> |
---|
31 | #include <string.h> |
---|
32 | #include "glib.h" |
---|
33 | |
---|
34 | int array[10000]; |
---|
35 | gboolean failed = FALSE; |
---|
36 | |
---|
37 | #define TEST(m,cond) G_STMT_START { failed = !(cond); \ |
---|
38 | if (failed) \ |
---|
39 | { if (!m) \ |
---|
40 | g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \ |
---|
41 | else \ |
---|
42 | g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)m); \ |
---|
43 | } \ |
---|
44 | else \ |
---|
45 | g_print ("."); fflush (stdout); \ |
---|
46 | } G_STMT_END |
---|
47 | |
---|
48 | #define C2P(c) ((gpointer) ((long) (c))) |
---|
49 | #define P2C(p) ((gchar) ((long) (p))) |
---|
50 | |
---|
51 | #define GLIB_TEST_STRING "el dorado " |
---|
52 | #define GLIB_TEST_STRING_5 "el do" |
---|
53 | |
---|
54 | typedef struct { |
---|
55 | guint age; |
---|
56 | gchar name[40]; |
---|
57 | } GlibTestInfo; |
---|
58 | |
---|
59 | static gint |
---|
60 | my_list_compare_one (gconstpointer a, gconstpointer b) |
---|
61 | { |
---|
62 | gint one = *((const gint*)a); |
---|
63 | gint two = *((const gint*)b); |
---|
64 | return one-two; |
---|
65 | } |
---|
66 | |
---|
67 | static gint |
---|
68 | my_list_compare_two (gconstpointer a, gconstpointer b) |
---|
69 | { |
---|
70 | gint one = *((const gint*)a); |
---|
71 | gint two = *((const gint*)b); |
---|
72 | return two-one; |
---|
73 | } |
---|
74 | |
---|
75 | int |
---|
76 | main (int argc, |
---|
77 | char *argv[]) |
---|
78 | { |
---|
79 | GSList *slist, *st; |
---|
80 | gint nums[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }; |
---|
81 | gint morenums[10] = { 8, 9, 7, 0, 3, 2, 5, 1, 4, 6}; |
---|
82 | gint i; |
---|
83 | |
---|
84 | slist = NULL; |
---|
85 | for (i = 0; i < 10; i++) |
---|
86 | slist = g_slist_append (slist, &nums[i]); |
---|
87 | slist = g_slist_reverse (slist); |
---|
88 | |
---|
89 | for (i = 0; i < 10; i++) |
---|
90 | { |
---|
91 | st = g_slist_nth (slist, i); |
---|
92 | g_assert (*((gint*) st->data) == (9 - i)); |
---|
93 | } |
---|
94 | |
---|
95 | g_slist_free (slist); |
---|
96 | slist = NULL; |
---|
97 | |
---|
98 | for (i = 0; i < 10; i++) |
---|
99 | slist = g_slist_insert_sorted (slist, &morenums[i], my_list_compare_one); |
---|
100 | |
---|
101 | /* |
---|
102 | g_print("\n"); |
---|
103 | g_slist_foreach (slist, my_list_print, NULL); |
---|
104 | */ |
---|
105 | |
---|
106 | for (i = 0; i < 10; i++) |
---|
107 | { |
---|
108 | st = g_slist_nth (slist, i); |
---|
109 | g_assert (*((gint*) st->data) == i); |
---|
110 | } |
---|
111 | |
---|
112 | g_slist_free(slist); |
---|
113 | slist = NULL; |
---|
114 | |
---|
115 | for (i = 0; i < 10; i++) |
---|
116 | slist = g_slist_insert_sorted (slist, &morenums[i], my_list_compare_two); |
---|
117 | |
---|
118 | /* |
---|
119 | g_print("\n"); |
---|
120 | g_slist_foreach (slist, my_list_print, NULL); |
---|
121 | */ |
---|
122 | |
---|
123 | for (i = 0; i < 10; i++) |
---|
124 | { |
---|
125 | st = g_slist_nth (slist, i); |
---|
126 | g_assert (*((gint*) st->data) == (9 - i)); |
---|
127 | } |
---|
128 | |
---|
129 | g_slist_free(slist); |
---|
130 | slist = NULL; |
---|
131 | |
---|
132 | for (i = 0; i < 10; i++) |
---|
133 | slist = g_slist_prepend (slist, &morenums[i]); |
---|
134 | |
---|
135 | slist = g_slist_sort (slist, my_list_compare_two); |
---|
136 | |
---|
137 | /* |
---|
138 | g_print("\n"); |
---|
139 | g_slist_foreach (slist, my_list_print, NULL); |
---|
140 | */ |
---|
141 | |
---|
142 | for (i = 0; i < 10; i++) |
---|
143 | { |
---|
144 | st = g_slist_nth (slist, i); |
---|
145 | g_assert (*((gint*) st->data) == (9 - i)); |
---|
146 | } |
---|
147 | |
---|
148 | g_slist_free(slist); |
---|
149 | |
---|
150 | return 0; |
---|
151 | } |
---|