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
|
#
# diffoscope: in-depth comparison of files, archives, and directories
#
# Copyright © 2021 Zbigniew Jędrzejewski-Szmek <zbyszek@in.waw.pl>
# Copyright © 2021-2023 Chris Lamb <lamby@debian.org>
#
# diffoscope 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 3 of the License, or
# (at your option) any later version.
#
# diffoscope 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 diffoscope. If not, see <https://www.gnu.org/licenses/>.
import itertools
import functools
import string
@functools.total_ordering
class Version(str):
CHARS = string.ascii_letters + string.digits + "~^"
_ALPHA_ORD = {
"~": -1,
"^": +1,
None: 0,
**{c: ord(c) for c in string.ascii_letters},
}
@staticmethod
def _len_prefix(s, chars, matching=True):
for i in range(len(s)):
if (s[i] in chars) != matching:
return i
return len(s)
@classmethod
def _cmp_alphabetical(cls, string_a, string_b):
len_a = cls._len_prefix(string_a, string.ascii_letters + "~^")
len_b = cls._len_prefix(string_b, string.ascii_letters + "~^")
for i in range(max(len_a, len_b)):
a = string_a[i] if i < len_a else None
b = string_b[i] if i < len_b else None
c = cls._ALPHA_ORD[a] - cls._ALPHA_ORD[b]
if c:
return i, c
return len_a, 0
def _cmp(self, other):
I, J = len(self), len(other)
i = j = 0
k = 20
while i < I or j < J:
# print(f'{i=} {j=} {self[i:]=!r} {other[j:]=!r}')
i += self._len_prefix(self[i:], self.CHARS, matching=False)
j += self._len_prefix(other[j:], self.CHARS, matching=False)
# print(f'{i=} {j=} {self[i:]=!r} {other[j:]=!r}')
if (i < I and self[i] in string.digits) or (
j < J and other[j] in string.digits
):
ii = i + self._len_prefix(self[i:], string.digits)
jj = j + self._len_prefix(other[j:], string.digits)
c = (ii == i) - (jj == j)
# print(f'digits: {c=}')
if c:
return -c
c = int(self[i:ii]) - int(other[j:jj])
# print(f'digits: {c=}')
i, j = ii, jj
else:
skip, c = self._cmp_alphabetical(self[i:], other[j:])
# print(f'alphas: {c=}')
i += skip
j += skip
if c:
return -1 if c < 0 else +1
k -= 1
assert k >= 0
return 0
def __eq__(self, other):
return self._cmp(other) == 0
def __lt__(self, other):
return self._cmp(other) < 0
|
