nexmon – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | office | 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, see <http://www.gnu.org/licenses/>. |
||
16 | */ |
||
17 | |||
18 | /* |
||
19 | * Modified by the GLib Team and others 1997-2000. See the AUTHORS |
||
20 | * file for a list of people on the GLib Team. See the ChangeLog |
||
21 | * files for a list of changes. These files are distributed with |
||
22 | * GLib at ftp://ftp.gtk.org/pub/gtk/. |
||
23 | */ |
||
24 | |||
25 | #undef G_DISABLE_ASSERT |
||
26 | #undef G_LOG_DOMAIN |
||
27 | |||
28 | #include <stdio.h> |
||
29 | #include <string.h> |
||
30 | #include "glib.h" |
||
31 | |||
32 | int array[10000]; |
||
33 | gboolean failed = FALSE; |
||
34 | |||
35 | #define TEST(m,cond) G_STMT_START { failed = !(cond); \ |
||
36 | if (failed) \ |
||
37 | { if (!m) \ |
||
38 | g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \ |
||
39 | else \ |
||
40 | g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)m); \ |
||
41 | } \ |
||
42 | else \ |
||
43 | g_print ("."); fflush (stdout); \ |
||
44 | } G_STMT_END |
||
45 | |||
46 | #define C2P(c) ((gpointer) ((long) (c))) |
||
47 | #define P2C(p) ((gchar) ((long) (p))) |
||
48 | |||
49 | #define GLIB_TEST_STRING "el dorado " |
||
50 | #define GLIB_TEST_STRING_5 "el do" |
||
51 | |||
52 | typedef struct { |
||
53 | guint age; |
||
54 | gchar name[40]; |
||
55 | } GlibTestInfo; |
||
56 | |||
57 | |||
58 | |||
59 | int |
||
60 | main (int argc, |
||
61 | char *argv[]) |
||
62 | { |
||
63 | gint i; |
||
64 | GRelation *relation; |
||
65 | GTuples *tuples; |
||
66 | gint data [1024]; |
||
67 | |||
68 | |||
69 | relation = g_relation_new (2); |
||
70 | |||
71 | g_relation_index (relation, 0, g_int_hash, g_int_equal); |
||
72 | g_relation_index (relation, 1, g_int_hash, g_int_equal); |
||
73 | |||
74 | for (i = 0; i < 1024; i += 1) |
||
75 | data[i] = i; |
||
76 | |||
77 | for (i = 1; i < 1023; i += 1) |
||
78 | { |
||
79 | g_relation_insert (relation, data + i, data + i + 1); |
||
80 | g_relation_insert (relation, data + i, data + i - 1); |
||
81 | } |
||
82 | |||
83 | for (i = 2; i < 1022; i += 1) |
||
84 | { |
||
85 | g_assert (! g_relation_exists (relation, data + i, data + i)); |
||
86 | g_assert (! g_relation_exists (relation, data + i, data + i + 2)); |
||
87 | g_assert (! g_relation_exists (relation, data + i, data + i - 2)); |
||
88 | } |
||
89 | |||
90 | for (i = 1; i < 1023; i += 1) |
||
91 | { |
||
92 | g_assert (g_relation_exists (relation, data + i, data + i + 1)); |
||
93 | g_assert (g_relation_exists (relation, data + i, data + i - 1)); |
||
94 | } |
||
95 | |||
96 | for (i = 2; i < 1022; i += 1) |
||
97 | { |
||
98 | g_assert (g_relation_count (relation, data + i, 0) == 2); |
||
99 | g_assert (g_relation_count (relation, data + i, 1) == 2); |
||
100 | } |
||
101 | |||
102 | g_assert (g_relation_count (relation, data, 0) == 0); |
||
103 | |||
104 | g_assert (g_relation_count (relation, data + 42, 0) == 2); |
||
105 | g_assert (g_relation_count (relation, data + 43, 1) == 2); |
||
106 | g_assert (g_relation_count (relation, data + 41, 1) == 2); |
||
107 | g_relation_delete (relation, data + 42, 0); |
||
108 | g_assert (g_relation_count (relation, data + 42, 0) == 0); |
||
109 | g_assert (g_relation_count (relation, data + 43, 1) == 1); |
||
110 | g_assert (g_relation_count (relation, data + 41, 1) == 1); |
||
111 | |||
112 | tuples = g_relation_select (relation, data + 200, 0); |
||
113 | |||
114 | g_assert (tuples->len == 2); |
||
115 | |||
116 | #if 0 |
||
117 | for (i = 0; i < tuples->len; i += 1) |
||
118 | { |
||
119 | printf ("%d %d\n", |
||
120 | *(gint*) g_tuples_index (tuples, i, 0), |
||
121 | *(gint*) g_tuples_index (tuples, i, 1)); |
||
122 | } |
||
123 | #endif |
||
124 | |||
125 | g_assert (g_relation_exists (relation, data + 300, data + 301)); |
||
126 | g_relation_delete (relation, data + 300, 0); |
||
127 | g_assert (!g_relation_exists (relation, data + 300, data + 301)); |
||
128 | |||
129 | g_tuples_destroy (tuples); |
||
130 | |||
131 | g_relation_destroy (relation); |
||
132 | |||
133 | relation = NULL; |
||
134 | |||
135 | return 0; |
||
136 | } |
||
137 |