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
|
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
/*
* e-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 "gal/util/e-util.h"
#include "e-sorter.h"
#define d(x)
#define PARENT_TYPE G_TYPE_OBJECT
static GObjectClass *parent_class;
static gint es_model_to_sorted (ESorter *es, int row);
static gint es_sorted_to_model (ESorter *es, int row);
static void es_get_model_to_sorted_array (ESorter *es, int **array, int *count);
static void es_get_sorted_to_model_array (ESorter *es, int **array, int *count);
static gboolean es_needs_sorting(ESorter *es);
static void
es_class_init (ESorterClass *klass)
{
parent_class = g_type_class_ref (PARENT_TYPE);
klass->model_to_sorted = es_model_to_sorted;
klass->sorted_to_model = es_sorted_to_model;
klass->get_model_to_sorted_array = es_get_model_to_sorted_array;
klass->get_sorted_to_model_array = es_get_sorted_to_model_array;
klass->needs_sorting = es_needs_sorting;
}
static void
es_init (ESorter *es)
{
}
E_MAKE_TYPE(e_sorter, "ESorter", ESorter, es_class_init, es_init, PARENT_TYPE)
ESorter *
e_sorter_new (void)
{
ESorter *es = g_object_new (E_SORTER_TYPE, NULL);
return es;
}
static gint
es_model_to_sorted (ESorter *es, int row)
{
return row;
}
static gint
es_sorted_to_model (ESorter *es, int row)
{
return row;
}
static void
es_get_model_to_sorted_array (ESorter *es, int **array, int *count)
{
}
static void
es_get_sorted_to_model_array (ESorter *es, int **array, int *count)
{
}
static gboolean
es_needs_sorting(ESorter *es)
{
return FALSE;
}
gint
e_sorter_model_to_sorted (ESorter *es, int row)
{
g_return_val_if_fail(es != NULL, -1);
g_return_val_if_fail(row >= 0, -1);
if (E_SORTER_GET_CLASS(es)->model_to_sorted)
return E_SORTER_GET_CLASS(es)->model_to_sorted (es, row);
else
return -1;
}
gint
e_sorter_sorted_to_model (ESorter *es, int row)
{
g_return_val_if_fail(es != NULL, -1);
g_return_val_if_fail(row >= 0, -1);
if (E_SORTER_GET_CLASS(es)->sorted_to_model)
return E_SORTER_GET_CLASS(es)->sorted_to_model (es, row);
else
return -1;
}
void
e_sorter_get_model_to_sorted_array (ESorter *es, int **array, int *count)
{
g_return_if_fail(es != NULL);
if (E_SORTER_GET_CLASS(es)->get_model_to_sorted_array)
E_SORTER_GET_CLASS(es)->get_model_to_sorted_array (es, array, count);
}
void
e_sorter_get_sorted_to_model_array (ESorter *es, int **array, int *count)
{
g_return_if_fail(es != NULL);
if (E_SORTER_GET_CLASS(es)->get_sorted_to_model_array)
E_SORTER_GET_CLASS(es)->get_sorted_to_model_array (es, array, count);
}
gboolean
e_sorter_needs_sorting(ESorter *es)
{
g_return_val_if_fail (es != NULL, FALSE);
if (E_SORTER_GET_CLASS(es)->needs_sorting)
return E_SORTER_GET_CLASS(es)->needs_sorting (es);
else
return FALSE;
}
|
