aboutsummaryrefslogtreecommitdiffstats
path: root/widgets/table/e-table-sorter.c
blob: eb2391b0d02eb0622de9a065dd4e1cefbf68f1e4 (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
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
/*
 * E-table-sorted.c: Implements a table that sorts another table
 *
 * Author:
 *   Miguel de Icaza (miguel@gnu.org)
 *
 * (C) 1999 Helix Code, Inc.
 */
#include <config.h>
#include <stdlib.h>
#include <gtk/gtksignal.h>
#include <string.h>
#include "e-util/e-util.h"
#include "e-table-sorter.h"

#define PARENT_TYPE gtk_object_get_type()

#define INCREMENT_AMOUNT 100

static GtkObjectClass *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_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 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->sort_info),
                   ets->sort_info_changed_id);

    ets->table_model_changed_id = 0;
    ets->table_model_row_changed_id = 0;
    ets->table_model_cell_changed_id = 0;
    ets->sort_info_changed_id = 0;
    
    if (ets->sort_info)
        gtk_object_unref(GTK_OBJECT(ets->sort_info));
    if (ets->full_header)
        gtk_object_unref(GTK_OBJECT(ets->full_header));
    if (ets->source)
        gtk_object_unref(GTK_OBJECT(ets->source));

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

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

    parent_class = gtk_type_class (PARENT_TYPE);

    object_class->destroy = ets_destroy;
}

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->sort_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->sort_info_changed_id = gtk_signal_connect (GTK_OBJECT (sort_info), "sort_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_sort_info_changed (ETableSortInfo *info, ETableSorter *ets)
{
    ets_clean(ets);
}

static ETableSorter *ets_closure;
void **vals_closure;
int cols_closure;
int *ascending_closure;
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);

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

        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;
    }
}

gboolean
e_table_sorter_needs_sorting(ETableSorter *ets)
{
    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;
}


gint
e_table_sorter_model_to_sorted (ETableSorter *sorter, int row)
{
    int rows = e_table_model_row_count(sorter->source);

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

    if (e_table_sorter_needs_sorting(sorter)) {
        ets_backsort(sorter);
        return sorter->backsorted[row];
    } else
        return row;
}

gint
e_table_sorter_sorted_to_model (ETableSorter *sorter, int row)
{
    int rows = e_table_model_row_count(sorter->source);

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

    if (e_table_sorter_needs_sorting(sorter)) {
        ets_sort(sorter);
        return sorter->sorted[row];
    } else
        return row;
}