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
|
/*
Released under the MIT License - https://opensource.org/licenses/MIT
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
USE OR OTHER DEALINGS IN THE SOFTWARE.
Modified from http://www.davekoelle.com/files/alphanum.hpp
*/
#include <ctype.h>
int alphanum_isdigit(const char c) {
return c>='0' && c<='9';
}
int alphanum_cmp(const char *l, const char *r) {
enum mode_t { STRING, NUMBER } mode=STRING;
while(*l && *r) {
if(mode == STRING) {
char l_char, r_char;
while((l_char=*l) && (r_char=*r)) {
// check if these are digit characters
const int l_digit = alphanum_isdigit(l_char);
const int r_digit = alphanum_isdigit(r_char);
// if both characters are digits, we continue in NUMBER mode
if(l_digit && r_digit) {
mode=NUMBER;
break;
}
// if only the left character is a digit, we have a result
if(l_digit)
return -1;
// if only the right character is a digit, we have a result
if(r_digit)
return +1;
// compute the difference of both characters
l_char = toupper(l_char);
r_char = toupper(r_char);
const int diff = l_char - r_char;
// if they differ we have a result
if(diff != 0)
return diff;
// otherwise process the next characters
++l;
++r;
}
} else { // mode==NUMBER
// get the left number
unsigned long l_int = 0;
while(*l && alphanum_isdigit(*l)) {
// TODO: this can overflow
l_int = l_int*10 + *l-'0';
++l;
}
// get the right number
unsigned long r_int = 0;
while(*r && alphanum_isdigit(*r)) {
// TODO: this can overflow
r_int = r_int*10 + *r-'0';
++r;
}
// if the difference is not equal to zero, we have a comparison result
const long diff = l_int - r_int;
if(diff != 0)
return diff;
// otherwise we process the next substring in STRING mode
mode=STRING;
}
}
if(*r)
return -1;
if(*l)
return +1;
return 0;
}
|
