aboutsummaryrefslogtreecommitdiffstats
path: root/widgets/table/e-table-sorter.c
blob: 8c530dca9032131d3b26fb9d6b4d995729575649 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
/*
 * e-table-sorter.c
 * Copyright 2000, 2001, Ximian, Inc.
 *
 * Authors:
 *   Chris Lahey <clahey@ximian.com>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License, version 2, as published by the Free Software Foundation.
 *
 * This library is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
 * 02111-1307, USA.
 */

#include <config.h>
#include <stdlib.h>
#include <string.h>
#include <gtk/gtksignal.h>
#include "gal/util/e-util.h"
#include "e-table-sorter.h"

#define d(x)

/* The arguments we take */
enum {
    ARG_0,
    ARG_SORT_INFO
};

#define PARENT_TYPE e_sorter_get_type()

#define INCREMENT_AMOUNT 100

static ESorterClass *parent_class;

static void     ets_model_changed      (ETableModel *etm, ETableSorter *ets);
static void     ets_model_row_changed  (ETableModel *etm, int row, ETableSorter *ets);
static void     ets_model_cell_changed (ETableModel *etm, int col, int row, ETableSorter *ets);
static void     ets_model_rows_inserted (ETableModel *etm, int row, int count, ETableSorter *ets);
static void     ets_model_rows_deleted (ETableModel *etm, int row, int count, ETableSorter *ets);
static void     ets_sort_info_changed  (ETableSortInfo *info, ETableSorter *ets);
static void     ets_clean              (ETableSorter *ets);
static void     ets_sort               (ETableSorter *ets);
static void     ets_backsort           (ETableSorter *ets);

static gint     ets_model_to_sorted           (ESorter *sorter, int row);
static gint     ets_sorted_to_model           (ESorter *sorter, int row);
static void     ets_get_model_to_sorted_array (ESorter *sorter, int **array, int *count);
static void     ets_get_sorted_to_model_array (ESorter *sorter, int **array, int *count);
static gboolean ets_needs_sorting             (ESorter *ets);

static void
ets_destroy (GtkObject *object)
{
    ETableSorter *ets = E_TABLE_SORTER (object);

    gtk_signal_disconnect (GTK_OBJECT (ets->source),
                   ets->table_model_changed_id);
    gtk_signal_disconnect (GTK_OBJECT (ets->source),
                   ets->table_model_row_changed_id);
    gtk_signal_disconnect (GTK_OBJECT (ets->source),
                   ets->table_model_cell_changed_id);
    gtk_signal_disconnect (GTK_OBJECT (ets->source),
                   ets->table_model_rows_inserted_id);
    gtk_signal_disconnect (GTK_OBJECT (ets->source),
                   ets->table_model_rows_deleted_id);
    gtk_signal_disconnect (GTK_OBJECT (ets->sort_info),
                   ets->sort_info_changed_id);
    gtk_signal_disconnect (GTK_OBJECT (ets->sort_info),
                   ets->group_info_changed_id);

    ets->table_model_changed_id = 0;
    ets->table_model_row_changed_id = 0;
    ets->table_model_cell_changed_id = 0;
    ets->table_model_rows_inserted_id = 0;
    ets->table_model_rows_deleted_id = 0;
    ets->sort_info_changed_id = 0;
    ets->group_info_changed_id = 0;
    
    if (ets->sort_info)
        gtk_object_unref(GTK_OBJECT(ets->sort_info));
    ets->sort_info = NULL;

    if (ets->full_header)
        gtk_object_unref(GTK_OBJECT(ets->full_header));
    ets->full_header = NULL;

    if (ets->source)
        gtk_object_unref(GTK_OBJECT(ets->source));
    ets->source = NULL;

    GTK_OBJECT_CLASS (parent_class)->destroy (object);
}

static void
ets_set_arg (GtkObject *object, GtkArg *arg, guint arg_id)
{
    ETableSorter *ets = E_TABLE_SORTER (object);

    switch (arg_id) {
    case ARG_SORT_INFO:
        if (ets->sort_info) {
            if (ets->sort_info_changed_id)
                gtk_signal_disconnect(GTK_OBJECT(ets->sort_info), ets->sort_info_changed_id);
            if (ets->group_info_changed_id)
                gtk_signal_disconnect(GTK_OBJECT(ets->sort_info), ets->group_info_changed_id);
            gtk_object_unref(GTK_OBJECT(ets->sort_info));
        }

        ets->sort_info = E_TABLE_SORT_INFO(GTK_VALUE_OBJECT (*arg));
        gtk_object_ref(GTK_OBJECT(ets->sort_info));
        ets->sort_info_changed_id = gtk_signal_connect (GTK_OBJECT (ets->sort_info), "sort_info_changed",
                                GTK_SIGNAL_FUNC (ets_sort_info_changed), ets);
        ets->group_info_changed_id = gtk_signal_connect (GTK_OBJECT (ets->sort_info), "group_info_changed",
                                GTK_SIGNAL_FUNC (ets_sort_info_changed), ets);

        ets_clean (ets);
        break;
    default:
        break;
    }
}

static void
ets_get_arg (GtkObject *object, GtkArg *arg, guint arg_id)
{
    ETableSorter *ets = E_TABLE_SORTER (object);
    switch (arg_id) {
    case ARG_SORT_INFO:
        GTK_VALUE_OBJECT (*arg) = GTK_OBJECT(ets->sort_info);
        break;
    }
}

static void
ets_class_init (ETableSorterClass *klass)
{
    GtkObjectClass *object_class = GTK_OBJECT_CLASS(klass);
    ESorterClass *sorter_class = E_SORTER_CLASS(klass);

    parent_class                            = gtk_type_class (PARENT_TYPE);

    object_class->destroy                   = ets_destroy;
    object_class->set_arg                   = ets_set_arg;
    object_class->get_arg                   = ets_get_arg;

    sorter_class->model_to_sorted           = ets_model_to_sorted           ;
    sorter_class->sorted_to_model           = ets_sorted_to_model           ;
    sorter_class->get_model_to_sorted_array = ets_get_model_to_sorted_array ;
    sorter_class->get_sorted_to_model_array = ets_get_sorted_to_model_array ;       
    sorter_class->needs_sorting             = ets_needs_sorting             ;

    gtk_object_add_arg_type ("ETableSorter::sort_info", GTK_TYPE_OBJECT, 
                 GTK_ARG_READWRITE, ARG_SORT_INFO); 
}

static void
ets_init (ETableSorter *ets)
{
    ets->full_header = NULL;
    ets->sort_info = NULL;
    ets->source = NULL;

    ets->needs_sorting = -1;

    ets->table_model_changed_id = 0;
    ets->table_model_row_changed_id = 0;
    ets->table_model_cell_changed_id = 0;
    ets->table_model_rows_inserted_id = 0;
    ets->table_model_rows_deleted_id = 0;
    ets->sort_info_changed_id = 0;
    ets->group_info_changed_id = 0;
}

E_MAKE_TYPE(e_table_sorter, "ETableSorter", ETableSorter, ets_class_init, ets_init, PARENT_TYPE)

ETableSorter *
e_table_sorter_new (ETableModel *source, ETableHeader *full_header, ETableSortInfo *sort_info)
{
    ETableSorter *ets = gtk_type_new (E_TABLE_SORTER_TYPE);
    
    ets->sort_info = sort_info;
    gtk_object_ref(GTK_OBJECT(ets->sort_info));
    ets->full_header = full_header;
    gtk_object_ref(GTK_OBJECT(ets->full_header));
    ets->source = source;
    gtk_object_ref(GTK_OBJECT(ets->source));

    ets->table_model_changed_id = gtk_signal_connect (GTK_OBJECT (source), "model_changed",
                               GTK_SIGNAL_FUNC (ets_model_changed), ets);
    ets->table_model_row_changed_id = gtk_signal_connect (GTK_OBJECT (source), "model_row_changed",
                                   GTK_SIGNAL_FUNC (ets_model_row_changed), ets);
    ets->table_model_cell_changed_id = gtk_signal_connect (GTK_OBJECT (source), "model_cell_changed",
                                GTK_SIGNAL_FUNC (ets_model_cell_changed), ets);
    ets->table_model_rows_inserted_id = gtk_signal_connect (GTK_OBJECT (source), "model_rows_inserted",
                                GTK_SIGNAL_FUNC (ets_model_rows_inserted), ets);
    ets->table_model_rows_deleted_id = gtk_signal_connect (GTK_OBJECT (source), "model_rows_deleted",
                                   GTK_SIGNAL_FUNC (ets_model_rows_deleted), ets);
    ets->sort_info_changed_id = gtk_signal_connect (GTK_OBJECT (sort_info), "sort_info_changed",
                             GTK_SIGNAL_FUNC (ets_sort_info_changed), ets);
    ets->group_info_changed_id = gtk_signal_connect (GTK_OBJECT (sort_info), "group_info_changed",
                             GTK_SIGNAL_FUNC (ets_sort_info_changed), ets);
    
    return ets;
}

static void
ets_model_changed (ETableModel *etm, ETableSorter *ets)
{
    ets_clean(ets);
}

static void
ets_model_row_changed (ETableModel *etm, int row, ETableSorter *ets)
{
    ets_clean(ets);
}

static void
ets_model_cell_changed (ETableModel *etm, int col, int row, ETableSorter *ets)
{
    ets_clean(ets);
}

static void
ets_model_rows_inserted (ETableModel *etm, int row, int count, ETableSorter *ets)
{
    ets_clean(ets);
}

static void
ets_model_rows_deleted (ETableModel *etm, int row, int count, ETableSorter *ets)
{
    ets_clean(ets);
}

static void
ets_sort_info_changed (ETableSortInfo *info, ETableSorter *ets)
{
    d(g_print ("sort info changed\n"));
    ets_clean(ets);
}

static ETableSorter *ets_closure;
static void **vals_closure;
static int cols_closure;
static int *ascending_closure;
static GCompareFunc *compare_closure;

/* FIXME: Make it not cache the second and later columns (as if anyone cares.) */

static int
qsort_callback(const void *data1, const void *data2)
{
    gint row1 = *(int *)data1;
    gint row2 = *(int *)data2;
    int j;
    int sort_count = e_table_sort_info_sorting_get_count(ets_closure->sort_info) + e_table_sort_info_grouping_get_count(ets_closure->sort_info);
    int comp_val = 0;
    int ascending = 1;
    for (j = 0; j < sort_count; j++) {
        comp_val = (*(compare_closure[j]))(vals_closure[cols_closure * row1 + j], vals_closure[cols_closure * row2 + j]);
        ascending = ascending_closure[j];
        if (comp_val != 0)
            break;
    }
    if (comp_val == 0) {
        if (row1 < row2)
            comp_val = -1;
        if (row1 > row2)
            comp_val = 1;
    }
    if (!ascending)
        comp_val = -comp_val;
    return comp_val;
}

static void
ets_clean(ETableSorter *ets)
{
    g_free(ets->sorted);
    ets->sorted = NULL;

    g_free(ets->backsorted);
    ets->backsorted = NULL;

    ets->needs_sorting = -1;
}


static void
ets_sort(ETableSorter *ets)
{
    int rows;
    int i;
    int j;
    int cols;
    int group_cols;

    if (ets->sorted)
        return;

    rows = e_table_model_row_count(ets->source);
    group_cols = e_table_sort_info_grouping_get_count(ets->sort_info);
    cols = e_table_sort_info_sorting_get_count(ets->sort_info) + group_cols;

    ets->sorted = g_new(int, rows);
    for (i = 0; i < rows; i++)
        ets->sorted[i] = i;

    cols_closure = cols;
    ets_closure = ets;

    vals_closure = g_new(void *, rows * cols);
    ascending_closure = g_new(int, cols);
    compare_closure = g_new(GCompareFunc, cols);

    for (j = 0; j < cols; j++) {
        ETableSortColumn column;
        ETableCol *col;

        if (j < group_cols)
            column = e_table_sort_info_grouping_get_nth(ets->sort_info, j);
        else
            column = e_table_sort_info_sorting_get_nth(ets->sort_info, j - group_cols);

        col = e_table_header_get_column_by_col_idx(ets->full_header, column.column);
        if (col == NULL)
            col = e_table_header_get_column (ets->full_header, e_table_header_count (ets->full_header) - 1);

        for (i = 0; i < rows; i++) {
            vals_closure[i * cols + j] = e_table_model_value_at (ets->source, col->col_idx, i);
        }

        compare_closure[j] = col->compare;
        ascending_closure[j] = column.ascending;
    }

        qsort(ets->sorted, rows, sizeof(int), qsort_callback);

    g_free(vals_closure);
    g_free(ascending_closure);
    g_free(compare_closure);
}

static void
ets_backsort(ETableSorter *ets)
{
    int i, rows;

    if (ets->backsorted)
        return;

    ets_sort(ets);

    rows = e_table_model_row_count(ets->source);
    ets->backsorted = g_new0(int, rows);

    for (i = 0; i < rows; i++) {
        ets->backsorted[ets->sorted[i]] = i;
    }
}


static gint
ets_model_to_sorted (ESorter *es, int row)
{
    ETableSorter *ets = E_TABLE_SORTER(es);
    int rows = e_table_model_row_count(ets->source);

    g_return_val_if_fail(row >= 0, -1);
    g_return_val_if_fail(row < rows, -1);

    if (ets_needs_sorting(es))
        ets_backsort(ets);

    if (ets->backsorted)
        return ets->backsorted[row];
    else
        return row;
}

static gint
ets_sorted_to_model (ESorter *es, int row)
{
    ETableSorter *ets = E_TABLE_SORTER(es);
    int rows = e_table_model_row_count(ets->source);

    g_return_val_if_fail(row >= 0, -1);
    g_return_val_if_fail(row < rows, -1);

    if (ets_needs_sorting(es))
        ets_sort(ets);

    if (ets->sorted)
        return ets->sorted[row];
    else
        return row;
}

static void
ets_get_model_to_sorted_array (ESorter *es, int **array, int *count)
{
    ETableSorter *ets = E_TABLE_SORTER(es);
    if (array || count) {
        ets_backsort(ets);

        if (array)
            *array = ets->backsorted;
        if (count)
            *count = e_table_model_row_count(ets->source);
    }
}

static void
ets_get_sorted_to_model_array (ESorter *es, int **array, int *count)
{
    ETableSorter *ets = E_TABLE_SORTER(es);
    if (array || count) {
        ets_sort(ets);

        if (array)
            *array = ets->sorted;
        if (count)
            *count = e_table_model_row_count(ets->source);
    }
}


static gboolean
ets_needs_sorting(ESorter *es)
{
    ETableSorter *ets = E_TABLE_SORTER(es);
    if (ets->needs_sorting < 0) {
        if (e_table_sort_info_sorting_get_count(ets->sort_info) + e_table_sort_info_grouping_get_count(ets->sort_info))
            ets->needs_sorting = 1;
        else
            ets->needs_sorting = 0;
    }
    return ets->needs_sorting;
}