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
|
/* -*- mode: c; c-file-style: "k&r" -*-
Modified for PHP by Andrei Zmievski <andrei@ispi.net>
strnatcmp.c -- Perform 'natural order' comparisons of strings in C.
Copyright (C) 2000 by Martin Pool <mbp@humbug.org.au>
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.
*/
#include <ctype.h>
#include <string.h>
#include <assert.h>
#include <stdio.h>
#include "php.h"
#include "php_string.h"
#if defined(__GNUC__)
# define UNUSED __attribute__((__unused__))
#else
# define UNUSED
#endif
static char const *version UNUSED =
"$Id$";
PHPAPI int strnatcmp_ex(char const *a, size_t a_len, char const *b, size_t b_len, int fold_case)
{
int ai, bi;
char ca, cb;
const char *aend = a + a_len,
*bend = b + b_len;
if (a_len == 0 || b_len == 0)
return a_len - b_len;
/*
assert(a && b);
*/
ai = bi = 0;
while (1) {
ca = a[ai]; cb = b[bi];
/* skip over leading spaces or zeros */
while (isspace(ca) || ca == '0')
ca = a[++ai];
while (isspace(cb) || cb == '0')
cb = b[++bi];
/* process run of digits */
if (isdigit(ca) && isdigit(cb)) {
int bias = 0;
/* The longest run of digits (stripping off leading
zeros) 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. */
while (1) {
if (!isdigit(ca) && !isdigit(cb))
goto done_number;
else if (!isdigit(ca))
return -1;
else if (!isdigit(cb))
return +1;
else if (ca < cb) {
if (!bias)
bias = -1;
} else if (ca > cb) {
if (!bias)
bias = +1;
}
++ai; ++bi;
if (a + ai == aend && b + bi == bend)
/* Return the current bias if at the end of both strings. */
return bias;
else if (a + ai == aend)
return -1;
else if (b + bi == bend)
return 1;
ca = a[ai]; cb = b[bi];
}
done_number:
if (bias)
return bias;
}
if (fold_case) {
ca = toupper(ca);
cb = toupper(cb);
}
if (ca < cb)
return -1;
else if (ca > cb)
return +1;
++ai; ++bi;
if (a + ai == aend && b + bi == bend)
/* The strings compare the same. Perhaps the caller
will want to call strcmp to break the tie. */
return 0;
else if (a + ai == aend)
return -1;
else if (b + bi == bend)
return 1;
}
}
|
