aboutsummaryrefslogtreecommitdiffstats
path: root/e-util/e-sorter-array.c
blob: 6098efef0394757de07fdbd05a2a9d22f1bf9988 (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
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
/*
 * e-sorter-array.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., 51 Franklin Street, Fifth Floor, Boston, MA
 * 02110-1301, USA.
 */

#include <config.h>

#include <stdlib.h>
#include <string.h>

#include "e-sorter-array.h"
#include "e-util.h"

#define d(x)

#define INCREMENT_AMOUNT 100

G_DEFINE_TYPE (ESorterArray, e_sorter_array, E_SORTER_TYPE)

static void     esa_sort               (ESorterArray *esa);
static void     esa_backsort           (ESorterArray *esa);

static gint     esa_model_to_sorted           (ESorter *sorter, int row);
static gint     esa_sorted_to_model           (ESorter *sorter, int row);
static void     esa_get_model_to_sorted_array (ESorter *sorter, int **array, int *count);
static void     esa_get_sorted_to_model_array (ESorter *sorter, int **array, int *count);
static gboolean esa_needs_sorting             (ESorter *esa);

#define ESA_NEEDS_SORTING(esa) (((ESorterArray *) (esa))->compare != NULL)

static int
esort_callback(const void *data1, const void *data2, gpointer user_data)
{
    ESorterArray *esa = user_data;
    int ret_val;
    int int1, int2;

    int1 = *(int *)data1;
    int2 = *(int *)data2;

    ret_val = esa->compare (int1, int2, esa->closure);
    if (ret_val != 0)
        return ret_val;

    if (int1 < int2)
        return -1;
    if (int1 > int2)
        return 1;
    return 0;
}

static void
esa_sort(ESorterArray *esa)
{
    int rows;
    int i;

    if (esa->sorted)
        return;

    rows = esa->rows;

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

    if (esa->compare)
        g_qsort_with_data (
            esa->sorted, rows, sizeof(int),
            esort_callback, esa);
}

static void
esa_backsort(ESorterArray *esa)
{
    int i, rows;

    if (esa->backsorted)
        return;

    esa_sort(esa);

    rows = esa->rows;

    esa->backsorted = g_new0(int, rows);

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


static gint
esa_model_to_sorted (ESorter *es, int row)
{
    ESorterArray *esa = E_SORTER_ARRAY(es);

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

    if (ESA_NEEDS_SORTING(es))
        esa_backsort(esa);

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

static gint
esa_sorted_to_model (ESorter *es, int row)
{
    ESorterArray *esa = (ESorterArray *) es;

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

    if (ESA_NEEDS_SORTING(es))
        esa_sort(esa);

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

static void
esa_get_model_to_sorted_array (ESorter *es, int **array, int *count)
{
    ESorterArray *esa = E_SORTER_ARRAY(es);
    if (array || count) {
        esa_backsort(esa);

        if (array)
            *array = esa->backsorted;
        if (count)
            *count = esa->rows;
    }
}

static void
esa_get_sorted_to_model_array (ESorter *es, int **array, int *count)
{
    ESorterArray *esa = E_SORTER_ARRAY(es);
    if (array || count) {
        esa_sort(esa);

        if (array)
            *array = esa->sorted;
        if (count)
            *count = esa->rows;
    }
}

static gboolean
esa_needs_sorting(ESorter *es)
{
    ESorterArray *esa = E_SORTER_ARRAY(es);
    return esa->compare != NULL;
}

void
e_sorter_array_clean(ESorterArray *esa)
{
    g_free(esa->sorted);
    esa->sorted = NULL;

    g_free(esa->backsorted);
    esa->backsorted = NULL;
}

void
e_sorter_array_set_count  (ESorterArray *esa, int count)
{
    e_sorter_array_clean (esa);
    esa->rows = count;
}

void
e_sorter_array_append  (ESorterArray *esa, int count)
{
    int i;
    g_free(esa->backsorted);
    esa->backsorted = NULL;

    if (esa->sorted) {
        esa->sorted = g_renew(int, esa->sorted, esa->rows + count);
        for (i = 0; i < count; i++) {
            int value = esa->rows;
            size_t pos;
            e_bsearch (&value, esa->sorted, esa->rows, sizeof (int), esort_callback, esa, &pos, NULL);
            memmove (esa->sorted + pos + 1, esa->sorted + pos, sizeof (int) * (esa->rows - pos));
            esa->sorted[pos] = value;
            esa->rows ++;
        }
    } else {
        esa->rows += count;
    }
}

ESorterArray *
e_sorter_array_construct  (ESorterArray *esa,
               ECompareRowsFunc  compare,
               gpointer      closure)
{
    esa->compare = compare;
    esa->closure = closure;
    return esa;
}

ESorterArray *
e_sorter_array_new (ECompareRowsFunc compare, gpointer closure)
{
    ESorterArray *esa = g_object_new (E_SORTER_ARRAY_TYPE, NULL);

    return e_sorter_array_construct (esa, compare, closure);
}

static void
e_sorter_array_class_init (ESorterArrayClass *klass)
{
    ESorterClass *sorter_class = E_SORTER_CLASS(klass);

    sorter_class->model_to_sorted           = esa_model_to_sorted           ;
    sorter_class->sorted_to_model           = esa_sorted_to_model           ;
    sorter_class->get_model_to_sorted_array = esa_get_model_to_sorted_array ;
    sorter_class->get_sorted_to_model_array = esa_get_sorted_to_model_array ;       
    sorter_class->needs_sorting             = esa_needs_sorting             ;
}

static void
e_sorter_array_init (ESorterArray *esa)
{
    esa->rows       = 0;
    esa->compare    = NULL;
    esa->closure    = NULL;
    esa->sorted     = NULL;
    esa->backsorted = NULL;
}