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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
|
// slang-semantic-version.cpp
#include "slang-semantic-version.h"
#include "../core/slang-string-util.h"
#include "slang-com-helper.h"
namespace Slang
{
// !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! SemanticVersion !!!!!!!!!!!!!!!!!!!!!!!!!!!!!
SlangResult SemanticVersion::parse(
const UnownedStringSlice& value,
char separatorChar,
SemanticVersion& outVersion)
{
outVersion.reset();
UnownedStringSlice slices[3];
Index splitCount;
SLANG_RETURN_ON_FAIL(StringUtil::split(value, separatorChar, 3, slices, splitCount));
if (splitCount <= 0)
{
return SLANG_FAIL;
}
Int ints[3] = {0, 0, 0};
for (Index i = 0; i < splitCount; i++)
{
SLANG_RETURN_ON_FAIL(StringUtil::parseInt(slices[i], ints[i]));
const Int max = (i == 2) ? 0x7fffffff : 0xffff;
if (ints[i] < 0 || ints[i] > max)
{
return SLANG_FAIL;
}
}
outVersion.m_major = uint16_t(ints[0]);
outVersion.m_minor = uint16_t(ints[1]);
outVersion.m_patch = uint32_t(ints[2]);
return SLANG_OK;
}
SlangResult SemanticVersion::parse(const UnownedStringSlice& value, SemanticVersion& outVersion)
{
return parse(value, '.', outVersion);
}
void SemanticVersion::append(StringBuilder& buf) const
{
buf << Int32(m_major) << "." << Int32(m_minor);
if (m_patch != 0)
{
buf << "." << UInt32(m_patch);
}
}
/* static */ SemanticVersion SemanticVersion::getEarliest(const ThisType* versions, Count count)
{
if (count <= 0)
{
return SemanticVersion();
}
SemanticVersion bestVersion = versions[0];
for (const auto version : makeConstArrayView(versions + 1, count - 1))
{
if (version < bestVersion)
{
bestVersion = version;
}
}
return bestVersion;
}
/* static */ SemanticVersion SemanticVersion::getLatest(const ThisType* versions, Count count)
{
if (count <= 0)
{
return SemanticVersion();
}
SemanticVersion bestVersion = versions[0];
for (const auto version : makeConstArrayView(versions + 1, count - 1))
{
if (version > bestVersion)
{
bestVersion = version;
}
}
return bestVersion;
}
bool SemanticVersion::isBackwardsCompatibleWith(const ThisType& otherVersion) const
{
// Compatibility is not guaranteed across major revisions.
//
if (m_major != otherVersion.m_major)
return false;
// Within a given major revision, a version with a higher
// minor revision is backwards-compatible with one that
// has a lower minor revision, but not vice-versa.
//
if (m_minor < otherVersion.m_minor)
return false;
// If the major and minor revisions pass our check, then
// we consider it a match. Note that this intentionally
// doesn't check the path version at all.
//
return true;
}
// !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! MatchSemanticVersion !!!!!!!!!!!!!!!!!!!!!!!!!!!!!
/* static */ SemanticVersion MatchSemanticVersion::findAnyBest(
const SemanticVersion* versions,
Count count,
const ThisType& matchVersion)
{
// If there aren't any we are done
if (count <= 0)
{
return SemanticVersion();
}
// If there is only one it must be the best
if (count == 1)
{
return versions[0];
}
// Define a version range [start, end)
SemanticVersion start, end;
switch (matchVersion.m_kind)
{
case Kind::Past:
{
return SemanticVersion::getEarliest(versions, count);
}
case Kind::Unknown:
case Kind::Future:
{
// If it's unknown, we just get the latest
return SemanticVersion::getLatest(versions, count);
}
case Kind::Major:
{
start = SemanticVersion(matchVersion.m_version.m_major, 0, 0);
end = SemanticVersion(matchVersion.m_version.m_major + 1, 0, 0);
break;
}
case Kind::MajorMinor:
{
start =
SemanticVersion(matchVersion.m_version.m_major, matchVersion.m_version.m_minor, 0);
end = SemanticVersion(
matchVersion.m_version.m_major,
matchVersion.m_version.m_minor + 1,
0);
break;
}
case Kind::MajorMinorPatch:
{
start = SemanticVersion(matchVersion.m_version);
end = SemanticVersion(
matchVersion.m_version.m_major,
matchVersion.m_version.m_minor,
matchVersion.m_version.m_patch + 1);
break;
}
default:
break;
}
List<SemanticVersion> sortedVersions;
sortedVersions.addRange(versions, count);
// Sort into increasing values
sortedVersions.sort(
[&](const SemanticVersion& a, const SemanticVersion& b) -> bool { return a < b; });
Index startIndex = 0;
for (; startIndex < count && sortedVersions[startIndex] < start; ++startIndex)
;
Index endIndex = startIndex;
for (; endIndex < count && sortedVersions[endIndex] < end; ++endIndex)
;
// If we have a span of versions, get the last in the span
if (startIndex < endIndex)
{
// Get the last one
return sortedVersions[endIndex - 1];
}
// Get the next greatest if there is one
if (endIndex < count)
{
return sortedVersions[endIndex];
}
// Get the prior prior to the start
if (startIndex > 0)
{
return sortedVersions[startIndex - 1];
}
// All cases should be covered, but return the last one
return sortedVersions[count - 1];
}
void MatchSemanticVersion::append(StringBuilder& buf) const
{
switch (m_kind)
{
default:
case Kind::Unknown:
buf << "unknown";
break;
case Kind::Past:
buf << "past";
break;
case Kind::Future:
buf << "future";
break;
case Kind::Major:
{
buf << m_version.m_major;
break;
}
case Kind::MajorMinor:
{
buf << m_version.m_major << "." << m_version.m_minor;
break;
}
case Kind::MajorMinorPatch:
{
m_version.append(buf);
break;
}
}
}
} // namespace Slang
|
