|
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 __SYMBIAN32__ |
|
35 #include "mrt2_glib2_test.h" |
|
36 #endif /*__SYMBIAN32__*/ |
|
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 { if (!m) \ |
|
45 g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \ |
|
46 else \ |
|
47 g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)m); \ |
|
48 } \ |
|
49 else \ |
|
50 g_print ("."); fflush (stdout); \ |
|
51 } G_STMT_END |
|
52 |
|
53 #define C2P(c) ((gpointer) ((long) (c))) |
|
54 #define P2C(p) ((gchar) ((long) (p))) |
|
55 |
|
56 #define GLIB_TEST_STRING "el dorado " |
|
57 #define GLIB_TEST_STRING_5 "el do" |
|
58 |
|
59 typedef struct { |
|
60 guint age; |
|
61 gchar name[40]; |
|
62 } GlibTestInfo; |
|
63 |
|
64 |
|
65 |
|
66 int |
|
67 main (int argc, |
|
68 char *argv[]) |
|
69 { |
|
70 gint i; |
|
71 GRelation *relation; |
|
72 GTuples *tuples; |
|
73 gint data [1024]; |
|
74 |
|
75 |
|
76 #ifdef __SYMBIAN32__ |
|
77 |
|
78 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); |
|
79 g_set_print_handler(mrtPrintHandler); |
|
80 #endif /*__SYMBIAN32__*/ |
|
81 |
|
82 |
|
83 relation = g_relation_new (2); |
|
84 |
|
85 g_relation_index (relation, 0, g_int_hash, g_int_equal); |
|
86 g_relation_index (relation, 1, g_int_hash, g_int_equal); |
|
87 |
|
88 for (i = 0; i < 1024; i += 1) |
|
89 data[i] = i; |
|
90 |
|
91 for (i = 1; i < 1023; i += 1) |
|
92 { |
|
93 g_relation_insert (relation, data + i, data + i + 1); |
|
94 g_relation_insert (relation, data + i, data + i - 1); |
|
95 } |
|
96 |
|
97 for (i = 2; i < 1022; i += 1) |
|
98 { |
|
99 g_assert (! g_relation_exists (relation, data + i, data + i)); |
|
100 g_assert (! g_relation_exists (relation, data + i, data + i + 2)); |
|
101 g_assert (! g_relation_exists (relation, data + i, data + i - 2)); |
|
102 } |
|
103 |
|
104 for (i = 1; i < 1023; i += 1) |
|
105 { |
|
106 g_assert (g_relation_exists (relation, data + i, data + i + 1)); |
|
107 g_assert (g_relation_exists (relation, data + i, data + i - 1)); |
|
108 } |
|
109 |
|
110 for (i = 2; i < 1022; i += 1) |
|
111 { |
|
112 g_assert (g_relation_count (relation, data + i, 0) == 2); |
|
113 g_assert (g_relation_count (relation, data + i, 1) == 2); |
|
114 } |
|
115 |
|
116 g_assert (g_relation_count (relation, data, 0) == 0); |
|
117 |
|
118 g_assert (g_relation_count (relation, data + 42, 0) == 2); |
|
119 g_assert (g_relation_count (relation, data + 43, 1) == 2); |
|
120 g_assert (g_relation_count (relation, data + 41, 1) == 2); |
|
121 g_relation_delete (relation, data + 42, 0); |
|
122 g_assert (g_relation_count (relation, data + 42, 0) == 0); |
|
123 g_assert (g_relation_count (relation, data + 43, 1) == 1); |
|
124 g_assert (g_relation_count (relation, data + 41, 1) == 1); |
|
125 |
|
126 tuples = g_relation_select (relation, data + 200, 0); |
|
127 |
|
128 g_assert (tuples->len == 2); |
|
129 |
|
130 #if 0 |
|
131 for (i = 0; i < tuples->len; i += 1) |
|
132 { |
|
133 printf ("%d %d\n", |
|
134 *(gint*) g_tuples_index (tuples, i, 0), |
|
135 *(gint*) g_tuples_index (tuples, i, 1)); |
|
136 } |
|
137 #endif |
|
138 |
|
139 g_assert (g_relation_exists (relation, data + 300, data + 301)); |
|
140 g_relation_delete (relation, data + 300, 0); |
|
141 g_assert (!g_relation_exists (relation, data + 300, data + 301)); |
|
142 |
|
143 g_tuples_destroy (tuples); |
|
144 |
|
145 g_relation_destroy (relation); |
|
146 |
|
147 relation = NULL; |
|
148 #ifdef __SYMBIAN32__ |
|
149 testResultXml("relation-test"); |
|
150 #endif /* EMULATOR */ |
|
151 return 0; |
|
152 } |
|
153 |