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
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
|
// file : butl/standard-version.cxx -*- C++ -*-
// copyright : Copyright (c) 2014-2017 Code Synthesis Ltd
// license : MIT; see accompanying LICENSE file
#include <butl/standard-version>
#include <cassert>
#include <cstdlib> // strtoull()
#include <cstddef> // size_t
#include <utility> // move()
#include <stdexcept> // invalid_argument
#include <butl/utility> // alnum()
using namespace std;
namespace butl
{
// Utility functions
//
static uint64_t
parse_num (const string& s, size_t& p,
const char* m,
uint64_t min = 0, uint64_t max = 999)
{
if (s[p] == '-' || s[p] == '+') // strtoull() allows these.
throw invalid_argument (m);
const char* b (s.c_str () + p);
char* e (nullptr);
uint64_t r (strtoull (b, &e, 10));
if (b == e || r < min || r > max)
throw invalid_argument (m);
p = e - s.c_str ();
return static_cast<uint64_t> (r);
}
static void
check_version (uint64_t vr, bool sn, standard_version::flags fl)
{
bool r;
if (vr == uint64_t (~0) && (fl & standard_version::allow_stub) != 0)
{
// Stub.
//
// Check that the snapshot flag is false.
//
r = !sn;
}
else
{
// Check that the version isn't too large, unless represents stub.
//
// AAABBBCCCDDDE
r = vr < 10000000000000ULL;
// Check that E version component is consistent with the snapshot flag.
// Note that if the allow_earliest flag is set, then E can be 1 for the
// snapshot flag being false, denoting the earliest pre-release of the
// version.
//
if (r)
{
uint64_t e (vr % 10);
if ((fl & standard_version::allow_earliest) == 0)
r = e == (sn ? 1 : 0);
else
r = e == 1 || (e == 0 && !sn);
}
// Check that pre-release number is consistent with the snapshot flag.
//
if (r)
{
uint64_t ab (vr / 10 % 1000);
// Note that if ab is 0, it can either mean non-pre-release version in
// the absence of snapshot number, or 'a.0' pre-release otherwise. If
// ab is 500, it can only mean 'b.0', that must be followed by a
// snapshot number.
//
if (ab != 0)
r = ab != 500 || sn;
}
// Check that the major, the minor and the patch versions are not
// simultaneously zeros.
//
if (r)
r = (vr / 10000) != 0;
}
if (!r)
throw invalid_argument ("invalid project version");
}
// standard_version
//
standard_version::
standard_version (const std::string& s, flags f)
{
auto bail = [] (const char* m) {throw invalid_argument (m);};
// Pre-parse the first component to see if the version starts with epoch,
// to keep the subsequent parsing straightforward.
//
bool ep (false);
{
char* e (nullptr);
strtoull (s.c_str (), &e, 10);
ep = *e == '~';
}
// Note that here and below p is less or equal n, and so s[p] is always
// valid.
//
size_t p (0), n (s.size ());
if (ep)
{
epoch = parse_num (s, p, "invalid epoch", 1, uint16_t (~0));
++p; // Skip '~'.
}
uint16_t ma, mi, bf, ab (0);
bool earliest (false);
ma = parse_num (s, p, "invalid major version");
// The only valid version that has no epoch, contains only the major
// version being equal to zero, that is optionally followed by the plus
// character, is the stub version, unless forbidden.
//
bool stub ((f & allow_stub) != 0 && !ep && ma == 0 &&
(p == n || s[p] == '+'));
if (stub)
version = uint64_t (~0);
else
{
if (s[p] != '.')
bail ("'.' expected after major version");
mi = parse_num (s, ++p, "invalid minor version");
if (s[p] != '.')
bail ("'.' expected after minor version");
bf = parse_num (s, ++p, "invalid patch version");
// AAABBBCCCDDDE
version = ma * 10000000000ULL +
mi * 10000000ULL +
bf * 10000ULL;
if (version == 0)
bail ("0.0.0 version");
// Parse the pre-release component if present.
//
if (s[p] == '-')
{
char k (s[++p]);
// If the last character in the string is dash, then this is the
// earliest version pre-release, unless forbidden.
//
if (k == '\0' && (f & allow_earliest) != 0)
earliest = true;
else
{
if (k != 'a' && k != 'b')
bail ("'a' or 'b' expected in pre-release");
if (s[++p] != '.')
bail ("'.' expected after pre-release letter");
ab = parse_num (s, ++p, "invalid pre-release", 0, 499);
if (k == 'b')
ab += 500;
// Parse the snapshot components if present. Note that pre-release
// number can't be zero for the final pre-release.
//
if (s[p] == '.')
parse_snapshot (s, ++p);
else if (ab == 0 || ab == 500)
bail ("invalid final pre-release");
}
}
}
if (s[p] == '+')
{
assert (!earliest); // Would bail out earlier (a or b expected after -).
revision = parse_num (s, ++p, "invalid revision", 1, uint16_t (~0));
}
if (p != n)
bail ("junk after version");
if (ab != 0 || snapshot_sn != 0 || earliest)
version -= 10000 - ab * 10;
if (snapshot_sn != 0 || earliest)
version += 1;
}
standard_version::
standard_version (uint64_t v, flags f)
: version (v)
{
check_version (v, false, f);
}
standard_version::
standard_version (uint64_t v, const std::string& s, flags f)
: version (v)
{
bool snapshot (!s.empty ());
check_version (version, snapshot, f);
if (snapshot)
{
size_t p (0);
parse_snapshot (s, p);
if (p != s.size ())
throw invalid_argument ("junk after snapshot");
}
}
standard_version::
standard_version (uint16_t e,
uint64_t v,
const std::string& s,
uint16_t r,
flags f)
: standard_version (v, s, f)
{
if (stub () && e != 0)
throw invalid_argument ("epoch for stub");
// Can't initialize above due to ctor delegating.
//
epoch = e;
revision = r;
}
standard_version::
standard_version (uint16_t ep,
uint64_t vr,
uint64_t sn,
std::string si,
uint16_t rv,
flags fl)
: epoch (ep),
version (vr),
snapshot_sn (sn),
snapshot_id (move (si)),
revision (rv)
{
check_version (vr, true, fl);
if (stub ())
{
if (ep != 0)
throw invalid_argument ("epoch for stub");
if (sn != 0)
throw invalid_argument ("snapshot for stub");
}
if (!snapshot_id.empty () && (snapshot_id.size () > 16 ||
snapshot_sn == 0 ||
snapshot_sn == latest_sn))
throw invalid_argument ("invalid snapshot");
}
void standard_version::
parse_snapshot (const std::string& s, size_t& p)
{
// Note that snapshot id must be empty for 'z' snapshot number.
//
if (s[p] == 'z')
{
snapshot_sn = latest_sn;
++p;
return;
}
uint64_t sn (parse_num (s,
p,
"invalid snapshot number",
1, latest_sn - 1));
std::string id;
if (s[p] == '.')
{
char c;
for (++p; alnum (c = s[p]); ++p)
id += c;
if (id.empty () || id.size () > 16)
throw invalid_argument ("invalid snapshot id");
}
snapshot_sn = sn;
snapshot_id = move (id);
}
string standard_version::
string_pre_release () const
{
std::string r;
if ((alpha () && !earliest ()) || beta ())
{
uint64_t ab (version / 10 % 1000);
if (ab < 500)
{
r += "a.";
r += to_string (ab);
}
else
{
r += "b.";
r += to_string (ab - 500);
}
}
return r;
}
string standard_version::
string_version () const
{
if (empty ())
return "";
if (stub ())
return "0";
std::string r (to_string (major ()) + '.' + to_string (minor ()) + '.' +
to_string (patch ()));
if (alpha () || beta ())
{
r += '-';
r += string_pre_release ();
if (snapshot ())
r += '.';
}
return r;
}
string standard_version::
string_snapshot () const
{
std::string r;
if (snapshot ())
{
r = snapshot_sn == latest_sn ? "z" : to_string (snapshot_sn);
if (!snapshot_id.empty ())
{
r += '.';
r += snapshot_id;
}
}
return r;
}
string standard_version::
string_project () const
{
std::string r (string_version ());
if (snapshot ())
r += string_snapshot (); // string_version() includes trailing dot.
return r;
}
string standard_version::
string_project_id () const
{
std::string r (string_version ());
if (snapshot ()) // Trailing dot already in id.
{
r += (snapshot_sn == latest_sn ? "z" :
snapshot_id.empty () ? to_string (snapshot_sn) :
snapshot_id);
}
return r;
}
string standard_version::
string () const
{
std::string r;
if (epoch != 0)
{
r = to_string (epoch);
r += '~';
}
r += string_project ();
if (revision != 0)
{
r += '+';
r += to_string (revision);
}
return r;
}
// standard_version_constraint
//
standard_version_constraint::
standard_version_constraint (const std::string& s)
{
using std::string; // Not to confuse with string().
auto bail = [] (const string& m) {throw invalid_argument (m);};
const char* spaces (" \t");
size_t p (0);
char c (s[p]);
if (c == '(' || c == '[') // Can be '\0'.
{
bool min_open = c == '(';
p = s.find_first_not_of (spaces, ++p);
if (p == string::npos)
bail ("no min version");
size_t e (s.find_first_of (spaces, p));
standard_version min_version;
try
{
min_version = standard_version (s.substr (p, e - p),
standard_version::allow_earliest);
}
catch (const invalid_argument& e)
{
bail (string ("invalid min version: ") + e.what ());
}
p = s.find_first_not_of (spaces, e);
if (p == string::npos)
bail ("no max version");
e = s.find_first_of (" \t])", p);
standard_version max_version;
try
{
max_version = standard_version (s.substr (p, e - p),
standard_version::allow_earliest);
}
catch (const invalid_argument& e)
{
bail (string ("invalid max version: ") + e.what ());
}
p = s.find_first_of ("])", e);
if (p == string::npos)
bail ("no closing bracket");
bool max_open = s[p] == ')';
if (++p != s.size ())
bail ("junk after constraint");
// Verify and copy the constraint.
//
*this = standard_version_constraint (min_version, min_open,
max_version, max_open);
}
else
{
enum comparison {eq, lt, gt, le, ge};
comparison operation (eq); // Uninitialized warning.
if (s.compare (0, p = 2, "==") == 0)
operation = eq;
else if (s.compare (0, p = 2, ">=") == 0)
operation = ge;
else if (s.compare (0, p = 2, "<=") == 0)
operation = le;
else if (s.compare (0, p = 1, ">") == 0)
operation = gt;
else if (s.compare (0, p = 1, "<") == 0)
operation = lt;
else
bail ("invalid constraint");
p = s.find_first_not_of (spaces, p);
if (p == string::npos)
bail ("no version");
standard_version v;
try
{
v = standard_version (s.substr (p),
operation != comparison::eq
? standard_version::allow_earliest
: standard_version::none);
}
catch (const invalid_argument& e)
{
bail (string ("invalid version: ") + e.what ());
}
// Verify and copy the constraint.
//
switch (operation)
{
case comparison::eq:
*this = standard_version_constraint (v);
break;
case comparison::lt:
*this = standard_version_constraint (nullopt, true, move (v), true);
break;
case comparison::le:
*this = standard_version_constraint (nullopt, true, move (v), false);
break;
case comparison::gt:
*this = standard_version_constraint (move (v), true, nullopt, true);
break;
case comparison::ge:
*this = standard_version_constraint (move (v), false, nullopt, true);
break;
}
}
}
standard_version_constraint::
standard_version_constraint (optional<standard_version> mnv, bool mno,
optional<standard_version> mxv, bool mxo)
: min_version (move (mnv)),
max_version (move (mxv)),
min_open (mno),
max_open (mxo)
{
assert (
// Min and max versions can't both be absent.
//
(min_version || max_version) &&
// Version should be non-empty and not a stub.
//
(!min_version || (!min_version->empty () && !min_version->stub ())) &&
(!max_version || (!max_version->empty () && !max_version->stub ())) &&
// Absent version endpoint (infinity) should be open.
//
(min_version || min_open) && (max_version || max_open));
if (min_version && max_version)
{
if (*min_version > *max_version)
throw invalid_argument ("min version is greater than max version");
if (*min_version == *max_version)
{
if (min_open || max_open)
throw invalid_argument ("equal version endpoints not closed");
if (min_version->earliest ())
throw invalid_argument ("equal version endpoints are earliest");
}
}
}
string standard_version_constraint::
string () const
{
assert (!empty ());
if (!min_version)
return (max_open ? "< " : "<= ") + max_version->string ();
if (!max_version)
return (min_open ? "> " : ">= ") + min_version->string ();
if (*min_version == *max_version)
return "== " + min_version->string ();
return (min_open ? '(' : '[') + min_version->string () + ' ' +
max_version->string () + (max_open ? ')' : ']');
}
bool standard_version_constraint::
satisfies (const standard_version& v) const noexcept
{
bool s (true);
if (min_version)
{
int i (v.compare (*min_version));
s = min_open ? i > 0 : i >= 0;
}
if (s && max_version)
{
int i (v.compare (*max_version));
s = max_open ? i < 0 : i <= 0;
}
return s;
}
}
|