2 PSPPIRE --- A Graphical User Interface for PSPP
3 Copyright (C) 2004 Free Software Foundation
4 Written by John Darrington
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
25 #include "psppire-object.h"
26 #include "psppire-case-array.h"
28 #include <gtksheet/gtkextra-marshal.h>
30 #include <data/case.h>
32 /* --- prototypes --- */
33 static void psppire_case_array_class_init (PsppireCaseArrayClass *class);
34 static void psppire_case_array_init (PsppireCaseArray *case_array);
35 static void psppire_case_array_finalize (GObject *object);
38 /* --- variables --- */
39 static GObjectClass *parent_class = NULL;
46 static guint signal[n_SIGNALS];
49 /* --- functions --- */
51 * psppire_case_array_get_type:
52 * @returns: the type ID for accelerator groups.
55 psppire_case_array_get_type (void)
57 static GType object_type = 0;
61 static const GTypeInfo object_info = {
62 sizeof (PsppireCaseArrayClass),
64 (GBaseFinalizeFunc) NULL,
65 (GClassInitFunc) psppire_case_array_class_init,
66 NULL, /* class_finalize */
67 NULL, /* class_data */
68 sizeof (PsppireCaseArray),
70 (GInstanceInitFunc) psppire_case_array_init,
73 object_type = g_type_register_static (G_TYPE_PSPPIRE_OBJECT, "PsppireCaseArray",
82 psppire_case_array_class_init (PsppireCaseArrayClass *class)
84 GObjectClass *object_class = G_OBJECT_CLASS (class);
86 parent_class = g_type_class_peek_parent (class);
88 object_class->finalize = psppire_case_array_finalize;
90 signal[CASE_CHANGED] =
91 g_signal_new ("case_changed",
92 G_TYPE_FROM_CLASS(class),
96 g_cclosure_marshal_VOID__INT,
102 signal[CASE_INSERTED] =
103 g_signal_new ("case_inserted",
104 G_TYPE_FROM_CLASS(class),
108 g_cclosure_marshal_VOID__INT,
114 signal[CASES_DELETED] =
115 g_signal_new ("cases_deleted",
116 G_TYPE_FROM_CLASS(class),
120 gtkextra_VOID__INT_INT,
128 psppire_case_array_finalize (GObject *object)
130 PsppireCaseArray *ca = PSPPIRE_CASE_ARRAY (object);
133 for (i = 0 ; i < ca->size; ++i )
134 case_destroy(&ca->cases[i]);
138 G_OBJECT_CLASS (parent_class)->finalize (object);
142 psppire_case_array_init (PsppireCaseArray *ca)
149 * psppire_case_array_new:
150 * @returns: a new #PsppireCaseArray object
152 * Creates a new #PsppireCaseArray.
155 psppire_case_array_new (gint capacity, gint width)
157 PsppireCaseArray *ca = g_object_new (G_TYPE_PSPPIRE_CASE_ARRAY, NULL);
159 ca->capacity = capacity;
162 ca->cases = g_new0(struct ccase, capacity);
169 psppire_case_array_resize(PsppireCaseArray *ca, gint new_size)
173 for (c = 0 ; c < ca->size ; ++c )
174 case_resize(&ca->cases[c], ca->width, new_size);
176 ca->width = new_size;
179 /* FIXME: add_case and insert_case need to be merged/refactored */
181 psppire_case_array_add_case(PsppireCaseArray *ca,
182 psppire_case_array_fill_case_func fill_case_func,
185 g_return_val_if_fail(ca->size < ca->capacity, FALSE);
187 case_create(&ca->cases[ca->size], ca->width);
189 if ( !fill_case_func(&ca->cases[ca->size], aux))
194 g_signal_emit(ca, signal[CASE_INSERTED], 0, ca->size - 1);
201 psppire_case_array_iterate_case(PsppireCaseArray *ca,
202 psppire_case_array_use_case_func use_case_func,
206 g_return_val_if_fail(ca->size < ca->capacity, FALSE);
208 for (i = 0 ; i < ca->size ; ++i )
210 if ( !use_case_func(&ca->cases[i], aux))
219 psppire_case_array_insert_case(PsppireCaseArray *ca, gint posn)
221 g_return_if_fail(posn >= 0);
222 g_return_if_fail(posn <= ca->size);
224 g_assert(ca->size + 1 <= ca->capacity);
228 for(i = ca->size; i > posn ; --i)
229 case_move(&ca->cases[i], &ca->cases[i - 1]);
231 case_create(&ca->cases[posn], ca->width);
234 g_signal_emit(ca, signal[CASE_INSERTED], 0, posn);
238 psppire_case_array_delete_cases(PsppireCaseArray *ca, gint first, gint n_cases)
240 g_return_if_fail(n_cases > 0);
241 g_return_if_fail(first >= 0);
242 g_return_if_fail(first + n_cases < ca->size);
246 /* FIXME: Is this right ?? */
247 for ( i = first; i < first + n_cases ; ++i )
248 case_destroy(&ca->cases[i]);
250 for ( ; i < ca->size; ++i )
251 case_move(&ca->cases[i - n_cases], &ca->cases[i]);
254 g_signal_emit(ca, signal[CASES_DELETED], 0, first, n_cases);
259 psppire_case_array_get_n_cases(const PsppireCaseArray *ca)
264 /* Clears the contents of CA */
266 psppire_case_array_clear(PsppireCaseArray *ca)
269 for (c = 0 ; c < ca->size ; ++c )
270 case_destroy(&ca->cases[c]);
274 g_signal_emit(ca, signal[CASES_DELETED], 0, 0, c);
277 /* Return the IDXth value from case C */
279 psppire_case_array_get_value(const PsppireCaseArray *ca, gint c, gint idx)
281 g_return_val_if_fail(c < ca->size, NULL);
283 return case_data(&ca->cases[c], idx);
287 /* Set the IDXth value of case C using FF and DATA */
289 psppire_case_array_set_value(PsppireCaseArray *ca, gint c, gint idx,
290 value_fill_func_t ff,
293 g_return_if_fail(c < ca->size);
295 struct ccase *cc = &ca->cases[c];
297 union value *val = case_data_rw(cc, idx);
299 gboolean changed = ff(val, data);
304 g_signal_emit(ca, signal[CASE_CHANGED], 0, c);