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
|
/*
* This file is part of the PulseView project.
*
* Copyright (C) 2000, 2004 by Martin Pool <mbp sourcefrog net>
*
* This software is provided 'as-is', without any express or implied
* warranty. In no event will the authors be held liable for any damages
* arising from the use of this software.
*
* Permission is granted to anyone to use this software for any purpose,
* including commercial applications, and to alter it and redistribute it
* freely, subject to the following restrictions:
*
* 1. The origin of this software must not be misrepresented; you must not
* claim that you wrote the original software. If you use this software
* in a product, an acknowledgment in the product documentation would be
* appreciated but is not required.
* 2. Altered source versions must be plainly marked as such, and must not be
* misrepresented as being the original software.
* 3. This notice may not be removed or altered from any source distribution.
*/
// strnatcmp.c -- Perform 'natural order' comparisons of strings in C.
// This file has been modified for C++ compatibility.
// Original at https://github.com/sourcefrog/natsort/blob/master/strnatcmp.c
#ifndef PULSEVIEW_PV_STRNATCMP_HPP
#define PULSEVIEW_PV_STRNATCMP_HPP
#include <cctype>
#include <cstddef> /* size_t */
#include <string>
using std::string;
static int compare_right(char const *a, char const *b)
{
int bias = 0;
// The longest run of digits wins. That aside, the greatest
// value wins, but we can't know that it will until we've scanned
// both numbers to know that they have the same magnitude, so we
// remember it in bias.
for (;; a++, b++) {
if (!isdigit(*a) && !isdigit(*b))
return bias;
if (!isdigit(*a))
return -1;
if (!isdigit(*b))
return +1;
if (*a < *b) {
if (!bias)
bias = -1;
} else if (*a > *b) {
if (!bias)
bias = +1;
} else if (!*a && !*b)
return bias;
}
return 0;
}
static int compare_left(char const *a, char const *b)
{
// Compare two left-aligned numbers: the first to have a
// different value wins.
for (;; a++, b++) {
if (!isdigit(*a) && !isdigit(*b))
return 0;
if (!isdigit(*a))
return -1;
if (!isdigit(*b))
return +1;
if (*a < *b)
return -1;
if (*a > *b)
return +1;
}
return 0;
}
static int strnatcmp0(char const *a, char const *b, int fold_case)
{
int ai, bi, fractional, result;
char ca, cb;
ai = bi = 0;
while (true) {
ca = a[ai];
cb = b[bi];
// Skip over leading spaces or zeroes
while (isspace(ca))
ca = a[++ai];
while (isspace(cb))
cb = b[++bi];
// Process run of digits
if (isdigit(ca) && isdigit(cb)) {
fractional = (ca == '0' || cb == '0');
if (fractional) {
if ((result = compare_left(a + ai, b + bi)) != 0)
return result;
} else {
if ((result = compare_right(a + ai, b + bi)) != 0)
return result;
}
}
if (!ca && !cb) {
// The strings compare the same. Perhaps the caller
// will want to call strcmp to break the tie
return 0;
}
if (fold_case) {
ca = toupper(ca);
cb = toupper(cb);
}
if (ca < cb)
return -1;
if (ca > cb)
return +1;
++ai;
++bi;
}
}
// Compare, recognizing numeric strings and being case sensitive
int strnatcmp(char const *a, char const *b)
{
return strnatcmp0(a, b, 0);
}
int strnatcmp(const string a, const string b)
{
return strnatcmp0(a.c_str(), b.c_str(), 0);
}
// Compare, recognizing numeric strings and ignoring case
int strnatcasecmp(char const *a, char const *b)
{
return strnatcmp0(a, b, 1);
}
int strnatcasecmp(const string a, const string b)
{
return strnatcmp0(a.c_str(), b.c_str(), 1);
}
#endif // PULSEVIEW_PV_STRNATCMP_HPP
|
