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
|
/*
* "$Id$"
*
* Numeric sorting routine for the Fast Light Tool Kit (FLTK).
*
* Copyright 1998-2018 by Bill Spitzak and others.
*
* This library is free software. Distribution and use rights are outlined in
* the file "COPYING" which should have been included with this file. If this
* file is missing or damaged, see the license at:
*
* http://www.fltk.org/COPYING.php
*
* Please report all bugs and problems on the following page:
*
* http://www.fltk.org/str.php
*/
#include <ctype.h>
#include <stdlib.h>
#include <FL/platform_types.h>
#include <FL/filename.H>
/**
\file numericsort.c
*/
/*
numericsort() - Compare two directory entries, possibly with a
case-insensitive comparison...
*FIXME* This is not UTF-8 aware -- particularly case-insensitive comparison.
*FIXME* If you fix it, don't forget to update the documentation below.
*/
static int numericsort(struct dirent **A, struct dirent **B, int cs) {
const char* a = (*A)->d_name;
const char* b = (*B)->d_name;
int ret = 0;
for (;;) {
if (isdigit(*a & 255) && isdigit(*b & 255)) {
int diff,magdiff;
while (*a == '0') a++;
while (*b == '0') b++;
while (isdigit(*a & 255) && *a == *b) {a++; b++;}
diff = (isdigit(*a & 255) && isdigit(*b & 255)) ? *a - *b : 0;
magdiff = 0;
while (isdigit(*a & 255)) {magdiff++; a++;}
while (isdigit(*b & 255)) {magdiff--; b++;}
if (magdiff) {ret = magdiff; break;} /* compare # of significant digits */
if (diff) {ret = diff; break;} /* compare first non-zero digit */
} else {
if (cs) {
/* compare case-sensitive */
if ((ret = *a-*b)) break;
} else {
/* compare case-insensitive */
if ((ret = tolower(*a & 255)-tolower(*b & 255))) break;
}
if (!*a) break;
a++; b++;
}
}
if (!ret) return 0;
else return (ret < 0) ? -1 : 1;
}
/**
Compares directory entries alphanumerically (case-insensitive).
\note This comparison is not (yet) UTF-8 aware.
\todo Make comparison UTF-8 aware.
\see fl_numericsort()
*/
int fl_casenumericsort(struct dirent **A, struct dirent **B) {
return numericsort(A, B, 0);
}
/**
Compares directory entries alphanumerically (case-sensitive).
Numbers are compared without sign, i.e. "-" is not taken as a sign of
following numerical values. The following list of files would be in
ascending order (examples are ASCII and numbers only for simplicity):
-# 1zzz.txt
-# 2xxx.txt
-# 19uuu.txt
-# 100aaa.txt
-# file1z.txt
-# file5a.txt
-# file5z.txt
-# file30z.txt
-# file200a.txt
-# temp+5.txt ('+' is lexically lower than '-')
-# temp-5.txt ('-' is not a sign)
-# temp-100.txt (100 is bigger than 5, no sign)
\param[in] A first directory entry
\param[in] B second directory entry
\returns comparison result (-1, 0, or +1)
\retval -1 A \< B
\retval 0 A == B
\retval +1 A \> B
\note This comparison is not (yet) UTF-8 aware:
- UTF-8 characters are compared according to their binary values.
- Locale settings may influence the result in unexpected ways.
- The latter is particularly true for fl_casenumericsort().
This may be changed in a future release.
\todo Make comparison UTF-8 aware.
\see fl_casenumericsort()
*/
int fl_numericsort(struct dirent **A, struct dirent **B) {
return numericsort(A, B, 1);
}
/*
* End of "$Id$".
*/
|
