|
1 /* GLIB - Library of useful routines for C programming |
|
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald |
|
3 * Portion Copyright © 2008-09 Nokia Corporation and/or its subsidiary(-ies). All rights reserved. |
|
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 #ifdef SYMBIAN |
|
35 #include "mrt2_glib2_test.h" |
|
36 #endif /*SYMBIAN*/ |
|
37 |
|
38 |
|
39 int array[10000]; |
|
40 gboolean failed = FALSE; |
|
41 |
|
42 #define TEST(m,cond) G_STMT_START { failed = !(cond); \ |
|
43 if (failed) \ |
|
44 { assert_failed = TRUE;\ |
|
45 if (!m) \ |
|
46 g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \ |
|
47 else \ |
|
48 g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)m); \ |
|
49 } \ |
|
50 else \ |
|
51 g_print ("."); fflush (stdout); \ |
|
52 } G_STMT_END |
|
53 |
|
54 #define C2P(c) ((gpointer) ((long) (c))) |
|
55 #define P2C(p) ((gchar) ((long) (p))) |
|
56 |
|
57 #define GLIB_TEST_STRING "el dorado " |
|
58 #define GLIB_TEST_STRING_5 "el do" |
|
59 |
|
60 typedef struct { |
|
61 guint age; |
|
62 gchar name[40]; |
|
63 } GlibTestInfo; |
|
64 |
|
65 static gint |
|
66 my_list_compare_one (gconstpointer a, gconstpointer b) |
|
67 { |
|
68 gint one = *((const gint*)a); |
|
69 gint two = *((const gint*)b); |
|
70 return one-two; |
|
71 } |
|
72 |
|
73 static gint |
|
74 my_list_compare_two (gconstpointer a, gconstpointer b) |
|
75 { |
|
76 gint one = *((const gint*)a); |
|
77 gint two = *((const gint*)b); |
|
78 return two-one; |
|
79 } |
|
80 |
|
81 int |
|
82 main (int argc, |
|
83 char *argv[]) |
|
84 { |
|
85 GList *list, *t; |
|
86 gint nums[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }; |
|
87 gint morenums[10] = { 8, 9, 7, 0, 3, 2, 5, 1, 4, 6}; |
|
88 gint i; |
|
89 |
|
90 list = NULL; |
|
91 |
|
92 #ifdef SYMBIAN |
|
93 g_log_set_handler (NULL, G_LOG_FLAG_FATAL| G_LOG_FLAG_RECURSION | G_LOG_LEVEL_CRITICAL | G_LOG_LEVEL_WARNING | G_LOG_LEVEL_MESSAGE | G_LOG_LEVEL_INFO | G_LOG_LEVEL_DEBUG, &mrtLogHandler, NULL); |
|
94 g_set_print_handler(mrtPrintHandler); |
|
95 #endif /*SYMBIAN*/ |
|
96 |
|
97 |
|
98 for (i = 0; i < 10; i++) |
|
99 list = g_list_append (list, &nums[i]); |
|
100 list = g_list_reverse (list); |
|
101 |
|
102 for (i = 0; i < 10; i++) |
|
103 { |
|
104 t = g_list_nth (list, i); |
|
105 g_assert (*((gint*) t->data) == (9 - i)); |
|
106 } |
|
107 |
|
108 for (i = 0; i < 10; i++) |
|
109 g_assert (g_list_position(list, g_list_nth (list, i)) == i); |
|
110 |
|
111 g_list_free (list); |
|
112 list = NULL; |
|
113 |
|
114 for (i = 0; i < 10; i++) |
|
115 list = g_list_insert_sorted (list, &morenums[i], my_list_compare_one); |
|
116 |
|
117 /* |
|
118 g_print("\n"); |
|
119 g_list_foreach (list, my_list_print, NULL); |
|
120 */ |
|
121 |
|
122 for (i = 0; i < 10; i++) |
|
123 { |
|
124 t = g_list_nth (list, i); |
|
125 g_assert (*((gint*) t->data) == i); |
|
126 } |
|
127 |
|
128 g_list_free (list); |
|
129 list = NULL; |
|
130 |
|
131 for (i = 0; i < 10; i++) |
|
132 list = g_list_insert_sorted (list, &morenums[i], my_list_compare_two); |
|
133 |
|
134 /* |
|
135 g_print("\n"); |
|
136 g_list_foreach (list, my_list_print, NULL); |
|
137 */ |
|
138 |
|
139 for (i = 0; i < 10; i++) |
|
140 { |
|
141 t = g_list_nth (list, i); |
|
142 g_assert (*((gint*) t->data) == (9 - i)); |
|
143 } |
|
144 |
|
145 g_list_free (list); |
|
146 list = NULL; |
|
147 |
|
148 for (i = 0; i < 10; i++) |
|
149 list = g_list_prepend (list, &morenums[i]); |
|
150 |
|
151 list = g_list_sort (list, my_list_compare_two); |
|
152 |
|
153 /* |
|
154 g_print("\n"); |
|
155 g_list_foreach (list, my_list_print, NULL); |
|
156 */ |
|
157 |
|
158 for (i = 0; i < 10; i++) |
|
159 { |
|
160 t = g_list_nth (list, i); |
|
161 g_assert (*((gint*) t->data) == (9 - i)); |
|
162 } |
|
163 |
|
164 g_list_free (list); |
|
165 |
|
166 #ifdef SYMBIAN |
|
167 testResultXml("list-test"); |
|
168 #endif /* EMULATOR */ |
|
169 |
|
170 return 0; |
|
171 } |
|
172 |