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"
70 relation
= g_relation_new (2);
72 g_relation_index (relation
, 0, g_int_hash
, g_int_equal
);
73 g_relation_index (relation
, 1, g_int_hash
, g_int_equal
);
75 for (i
= 0; i
< 1024; i
+= 1)
78 for (i
= 1; i
< 1023; i
+= 1)
80 g_relation_insert (relation
, data
+ i
, data
+ i
+ 1);
81 g_relation_insert (relation
, data
+ i
, data
+ i
- 1);
84 for (i
= 2; i
< 1022; i
+= 1)
86 g_assert (! g_relation_exists (relation
, data
+ i
, data
+ i
));
87 g_assert (! g_relation_exists (relation
, data
+ i
, data
+ i
+ 2));
88 g_assert (! g_relation_exists (relation
, data
+ i
, data
+ i
- 2));
91 for (i
= 1; i
< 1023; i
+= 1)
93 g_assert (g_relation_exists (relation
, data
+ i
, data
+ i
+ 1));
94 g_assert (g_relation_exists (relation
, data
+ i
, data
+ i
- 1));
97 for (i
= 2; i
< 1022; i
+= 1)
99 g_assert (g_relation_count (relation
, data
+ i
, 0) == 2);
100 g_assert (g_relation_count (relation
, data
+ i
, 1) == 2);
103 g_assert (g_relation_count (relation
, data
, 0) == 0);
105 g_assert (g_relation_count (relation
, data
+ 42, 0) == 2);
106 g_assert (g_relation_count (relation
, data
+ 43, 1) == 2);
107 g_assert (g_relation_count (relation
, data
+ 41, 1) == 2);
108 g_relation_delete (relation
, data
+ 42, 0);
109 g_assert (g_relation_count (relation
, data
+ 42, 0) == 0);
110 g_assert (g_relation_count (relation
, data
+ 43, 1) == 1);
111 g_assert (g_relation_count (relation
, data
+ 41, 1) == 1);
113 tuples
= g_relation_select (relation
, data
+ 200, 0);
115 g_assert (tuples
->len
== 2);
118 for (i
= 0; i
< tuples
->len
; i
+= 1)
121 *(gint
*) g_tuples_index (tuples
, i
, 0),
122 *(gint
*) g_tuples_index (tuples
, i
, 1));
126 g_assert (g_relation_exists (relation
, data
+ 300, data
+ 301));
127 g_relation_delete (relation
, data
+ 300, 0);
128 g_assert (!g_relation_exists (relation
, data
+ 300, data
+ 301));
130 g_tuples_destroy (tuples
);
132 g_relation_destroy (relation
);