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 Library 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 * Library General Public License for more details.
14 * You should have received a copy of the GNU Library 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.
26 gboolean failed = FALSE;
28 #define TEST(m,cond) G_STMT_START { failed = !(cond); \
31 g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \
33 g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)m); \
36 g_print ("."); fflush (stdout); \
39 #define C2P(c) ((gpointer) ((long) (c)))
40 #define P2C(p) ((gchar) ((long) (p)))
42 #define GLIB_TEST_STRING "el dorado "
43 #define GLIB_TEST_STRING_5 "el do"
62 relation = g_relation_new (2);
64 g_relation_index (relation, 0, g_int_hash, g_int_equal);
65 g_relation_index (relation, 1, g_int_hash, g_int_equal);
67 for (i = 0; i < 1024; i += 1)
70 for (i = 1; i < 1023; i += 1)
72 g_relation_insert (relation, data + i, data + i + 1);
73 g_relation_insert (relation, data + i, data + i - 1);
76 for (i = 2; i < 1022; i += 1)
78 g_assert (! g_relation_exists (relation, data + i, data + i));
79 g_assert (! g_relation_exists (relation, data + i, data + i + 2));
80 g_assert (! g_relation_exists (relation, data + i, data + i - 2));
83 for (i = 1; i < 1023; i += 1)
85 g_assert (g_relation_exists (relation, data + i, data + i + 1));
86 g_assert (g_relation_exists (relation, data + i, data + i - 1));
89 for (i = 2; i < 1022; i += 1)
91 g_assert (g_relation_count (relation, data + i, 0) == 2);
92 g_assert (g_relation_count (relation, data + i, 1) == 2);
95 g_assert (g_relation_count (relation, data, 0) == 0);
97 g_assert (g_relation_count (relation, data + 42, 0) == 2);
98 g_assert (g_relation_count (relation, data + 43, 1) == 2);
99 g_assert (g_relation_count (relation, data + 41, 1) == 2);
100 g_relation_delete (relation, data + 42, 0);
101 g_assert (g_relation_count (relation, data + 42, 0) == 0);
102 g_assert (g_relation_count (relation, data + 43, 1) == 1);
103 g_assert (g_relation_count (relation, data + 41, 1) == 1);
105 tuples = g_relation_select (relation, data + 200, 0);
107 g_assert (tuples->len == 2);
110 for (i = 0; i < tuples->len; i += 1)
113 *(gint*) g_tuples_index (tuples, i, 0),
114 *(gint*) g_tuples_index (tuples, i, 1));
118 g_assert (g_relation_exists (relation, data + 300, data + 301));
119 g_relation_delete (relation, data + 300, 0);
120 g_assert (!g_relation_exists (relation, data + 300, data + 301));
122 g_tuples_destroy (tuples);
124 g_relation_destroy (relation);