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
|
/*
Arbitrary Sorting Filter(s)
Copyright (C) 2004 Robert Lipe, robertlipe@usa.net
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111 USA
*/
#include "defs.h"
extern queue waypt_head;
typedef enum {
sm_unknown = 0,
sm_gcid,
sm_shortname,
sm_description
} sort_mode_;
sort_mode_ sort_mode = sm_shortname; /* How are we sorting these? */
static char *opt_sm_gcid, *opt_sm_shortname, *opt_sm_description;
static
arglist_t sort_args[] = {
{"gcid", &opt_sm_gcid, "Sort by numeric geocache ID",
NULL, ARGTYPE_BOOL },
{"shortname", &opt_sm_shortname, "Sort by waypoint short name",
NULL, ARGTYPE_BOOL },
{"description", &opt_sm_description, "Sort by waypoint description",
NULL, ARGTYPE_BOOL },
{0, 0, 0, 0, 0}
};
static int
sort_comp(const void * a, const void * b)
{
const waypoint *x1 = *(waypoint **)a;
const waypoint *x2 = *(waypoint **)b;
switch (sort_mode) {
case sm_gcid: return x1->gc_data.id > x2->gc_data.id;
case sm_shortname: return strcmp (x1->shortname, x2->shortname);
case sm_description: return strcmp (x1->description, x2->description);
default: abort(); /* Internal caller error. */
}
}
void
sort_process(void)
{
queue * elem, * tmp;
waypoint ** comp;
int i = 0, wc;
wc = waypt_count();
comp = (waypoint **) xcalloc(wc, sizeof(*comp));
QUEUE_FOR_EACH(&waypt_head, elem, tmp) {
comp[i] = (waypoint *)elem;
waypt_del(comp[i]); /* Pop this waypoint off the master Q */
i++;
}
qsort(comp, wc, sizeof(waypoint *), sort_comp);
/*
* Now re-add the list back.
*/
for (i = 0; i < wc ; i++) {
waypt_add(comp[i]);
}
if (comp)
xfree(comp);
}
void
sort_init(const char *args)
{
if (opt_sm_gcid)
sort_mode = sm_gcid;
if (opt_sm_shortname)
sort_mode = sm_shortname;
if (opt_sm_description)
sort_mode = sm_description;
}
filter_vecs_t sort_vecs = {
sort_init,
sort_process,
NULL,
NULL,
sort_args
};
|
