@wise/wds-codemods 1.2.0-experimental-1b969bf → 1.2.0-experimental-e723c4b

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (6) hide show
  1. package/dist/{helpers-DieQS_ke.js → helpers-Cj5geKJl.js} +46 -46
  2. package/dist/helpers-Cj5geKJl.js.map +1 -0
  3. package/dist/index.js +1 -1
  4. package/dist/transforms/button/transformer.js +1 -1
  5. package/package.json +13 -13
  6. package/dist/helpers-DieQS_ke.js.map +0 -1
package/dist/{helpers-DieQS_ke.js → helpers-Cj5geKJl.js} RENAMED
@@ -9,7 +9,7 @@ let node_fs = require("node:fs");
9
9
  node_fs = require_common.__toESM(node_fs);
10
10
  let node_util = require("node:util");
11
11
 
12
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/constants.js
12
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/constants.js
13
13
  var require_constants = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
14
14
  const SEMVER_SPEC_VERSION = "2.0.0";
15
15
  const MAX_LENGTH = 256;
@@ -38,14 +38,14 @@ var require_constants = /* @__PURE__ */ require_common.__commonJSMin(((exports,
38
38
  }));
39
39
 
40
40
  //#endregion
41
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/debug.js
41
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/debug.js
42
42
  var require_debug = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
43
43
  const debug = typeof process === "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...args) => console.error("SEMVER", ...args) : () => {};
44
44
  module.exports = debug;
45
45
  }));
46
46
 
47
47
  //#endregion
48
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/re.js
48
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/re.js
49
49
  var require_re = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
50
50
  const { MAX_SAFE_COMPONENT_LENGTH, MAX_SAFE_BUILD_LENGTH, MAX_LENGTH } = require_constants();
51
51
  const debug = require_debug();
@@ -125,7 +125,7 @@ var require_re = /* @__PURE__ */ require_common.__commonJSMin(((exports, module)
125
125
  }));
126
126
 
127
127
  //#endregion
128
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/parse-options.js
128
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/parse-options.js
129
129
  var require_parse_options = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
130
130
  const looseOption = Object.freeze({ loose: true });
131
131
  const emptyOpts = Object.freeze({});
@@ -138,7 +138,7 @@ var require_parse_options = /* @__PURE__ */ require_common.__commonJSMin(((expor
138
138
  }));
139
139
 
140
140
  //#endregion
141
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/identifiers.js
141
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/identifiers.js
142
142
  var require_identifiers = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
143
143
  const numeric = /^[0-9]+$/;
144
144
  const compareIdentifiers = (a, b) => {
@@ -159,7 +159,7 @@ var require_identifiers = /* @__PURE__ */ require_common.__commonJSMin(((exports
159
159
  }));
160
160
 
161
161
  //#endregion
162
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/classes/semver.js
162
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/semver.js
163
163
  var require_semver$1 = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
164
164
  const debug = require_debug();
165
165
  const { MAX_LENGTH, MAX_SAFE_INTEGER } = require_constants();
@@ -339,7 +339,7 @@ var require_semver$1 = /* @__PURE__ */ require_common.__commonJSMin(((exports, m
339
339
  }));
340
340
 
341
341
  //#endregion
342
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/parse.js
342
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/parse.js
343
343
  var require_parse = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
344
344
  const SemVer = require_semver$1();
345
345
  const parse = (version, options, throwErrors = false) => {
@@ -355,7 +355,7 @@ var require_parse = /* @__PURE__ */ require_common.__commonJSMin(((exports, modu
355
355
  }));
356
356
 
357
357
  //#endregion
358
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/valid.js
358
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/valid.js
359
359
  var require_valid$1 = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
360
360
  const parse = require_parse();
361
361
  const valid = (version, options) => {
@@ -366,7 +366,7 @@ var require_valid$1 = /* @__PURE__ */ require_common.__commonJSMin(((exports, mo
366
366
  }));
367
367
 
368
368
  //#endregion
369
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/clean.js
369
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/clean.js
370
370
  var require_clean = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
371
371
  const parse = require_parse();
372
372
  const clean = (version, options) => {
@@ -377,7 +377,7 @@ var require_clean = /* @__PURE__ */ require_common.__commonJSMin(((exports, modu
377
377
  }));
378
378
 
379
379
  //#endregion
380
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/inc.js
380
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/inc.js
381
381
  var require_inc = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
382
382
  const SemVer = require_semver$1();
383
383
  const inc = (version, release, options, identifier, identifierBase) => {
@@ -396,7 +396,7 @@ var require_inc = /* @__PURE__ */ require_common.__commonJSMin(((exports, module
396
396
  }));
397
397
 
398
398
  //#endregion
399
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/diff.js
399
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/diff.js
400
400
  var require_diff = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
401
401
  const parse = require_parse();
402
402
  const diff = (version1, version2) => {
@@ -425,7 +425,7 @@ var require_diff = /* @__PURE__ */ require_common.__commonJSMin(((exports, modul
425
425
  }));
426
426
 
427
427
  //#endregion
428
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/major.js
428
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/major.js
429
429
  var require_major = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
430
430
  const SemVer = require_semver$1();
431
431
  const major = (a, loose) => new SemVer(a, loose).major;
@@ -433,7 +433,7 @@ var require_major = /* @__PURE__ */ require_common.__commonJSMin(((exports, modu
433
433
  }));
434
434
 
435
435
  //#endregion
436
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/minor.js
436
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/minor.js
437
437
  var require_minor = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
438
438
  const SemVer = require_semver$1();
439
439
  const minor = (a, loose) => new SemVer(a, loose).minor;
@@ -441,7 +441,7 @@ var require_minor = /* @__PURE__ */ require_common.__commonJSMin(((exports, modu
441
441
  }));
442
442
 
443
443
  //#endregion
444
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/patch.js
444
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/patch.js
445
445
  var require_patch = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
446
446
  const SemVer = require_semver$1();
447
447
  const patch = (a, loose) => new SemVer(a, loose).patch;
@@ -449,7 +449,7 @@ var require_patch = /* @__PURE__ */ require_common.__commonJSMin(((exports, modu
449
449
  }));
450
450
 
451
451
  //#endregion
452
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/prerelease.js
452
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/prerelease.js
453
453
  var require_prerelease = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
454
454
  const parse = require_parse();
455
455
  const prerelease = (version, options) => {
@@ -460,7 +460,7 @@ var require_prerelease = /* @__PURE__ */ require_common.__commonJSMin(((exports,
460
460
  }));
461
461
 
462
462
  //#endregion
463
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/compare.js
463
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/compare.js
464
464
  var require_compare = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
465
465
  const SemVer = require_semver$1();
466
466
  const compare = (a, b, loose) => new SemVer(a, loose).compare(new SemVer(b, loose));
@@ -468,7 +468,7 @@ var require_compare = /* @__PURE__ */ require_common.__commonJSMin(((exports, mo
468
468
  }));
469
469
 
470
470
  //#endregion
471
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/rcompare.js
471
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/rcompare.js
472
472
  var require_rcompare = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
473
473
  const compare = require_compare();
474
474
  const rcompare = (a, b, loose) => compare(b, a, loose);
@@ -476,7 +476,7 @@ var require_rcompare = /* @__PURE__ */ require_common.__commonJSMin(((exports, m
476
476
  }));
477
477
 
478
478
  //#endregion
479
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/compare-loose.js
479
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/compare-loose.js
480
480
  var require_compare_loose = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
481
481
  const compare = require_compare();
482
482
  const compareLoose = (a, b) => compare(a, b, true);
@@ -484,7 +484,7 @@ var require_compare_loose = /* @__PURE__ */ require_common.__commonJSMin(((expor
484
484
  }));
485
485
 
486
486
  //#endregion
487
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/compare-build.js
487
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/compare-build.js
488
488
  var require_compare_build = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
489
489
  const SemVer = require_semver$1();
490
490
  const compareBuild = (a, b, loose) => {
@@ -496,7 +496,7 @@ var require_compare_build = /* @__PURE__ */ require_common.__commonJSMin(((expor
496
496
  }));
497
497
 
498
498
  //#endregion
499
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/sort.js
499
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/sort.js
500
500
  var require_sort = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
501
501
  const compareBuild = require_compare_build();
502
502
  const sort = (list$1, loose) => list$1.sort((a, b) => compareBuild(a, b, loose));
@@ -504,7 +504,7 @@ var require_sort = /* @__PURE__ */ require_common.__commonJSMin(((exports, modul
504
504
  }));
505
505
 
506
506
  //#endregion
507
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/rsort.js
507
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/rsort.js
508
508
  var require_rsort = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
509
509
  const compareBuild = require_compare_build();
510
510
  const rsort = (list$1, loose) => list$1.sort((a, b) => compareBuild(b, a, loose));
@@ -512,7 +512,7 @@ var require_rsort = /* @__PURE__ */ require_common.__commonJSMin(((exports, modu
512
512
  }));
513
513
 
514
514
  //#endregion
515
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/gt.js
515
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/gt.js
516
516
  var require_gt = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
517
517
  const compare = require_compare();
518
518
  const gt = (a, b, loose) => compare(a, b, loose) > 0;
@@ -520,7 +520,7 @@ var require_gt = /* @__PURE__ */ require_common.__commonJSMin(((exports, module)
520
520
  }));
521
521
 
522
522
  //#endregion
523
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/lt.js
523
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/lt.js
524
524
  var require_lt = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
525
525
  const compare = require_compare();
526
526
  const lt = (a, b, loose) => compare(a, b, loose) < 0;
@@ -528,7 +528,7 @@ var require_lt = /* @__PURE__ */ require_common.__commonJSMin(((exports, module)
528
528
  }));
529
529
 
530
530
  //#endregion
531
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/eq.js
531
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/eq.js
532
532
  var require_eq = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
533
533
  const compare = require_compare();
534
534
  const eq = (a, b, loose) => compare(a, b, loose) === 0;
@@ -536,7 +536,7 @@ var require_eq = /* @__PURE__ */ require_common.__commonJSMin(((exports, module)
536
536
  }));
537
537
 
538
538
  //#endregion
539
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/neq.js
539
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/neq.js
540
540
  var require_neq = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
541
541
  const compare = require_compare();
542
542
  const neq = (a, b, loose) => compare(a, b, loose) !== 0;
@@ -544,7 +544,7 @@ var require_neq = /* @__PURE__ */ require_common.__commonJSMin(((exports, module
544
544
  }));
545
545
 
546
546
  //#endregion
547
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/gte.js
547
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/gte.js
548
548
  var require_gte = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
549
549
  const compare = require_compare();
550
550
  const gte = (a, b, loose) => compare(a, b, loose) >= 0;
@@ -552,7 +552,7 @@ var require_gte = /* @__PURE__ */ require_common.__commonJSMin(((exports, module
552
552
  }));
553
553
 
554
554
  //#endregion
555
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/lte.js
555
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/lte.js
556
556
  var require_lte = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
557
557
  const compare = require_compare();
558
558
  const lte = (a, b, loose) => compare(a, b, loose) <= 0;
@@ -560,7 +560,7 @@ var require_lte = /* @__PURE__ */ require_common.__commonJSMin(((exports, module
560
560
  }));
561
561
 
562
562
  //#endregion
563
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/cmp.js
563
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/cmp.js
564
564
  var require_cmp = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
565
565
  const eq = require_eq();
566
566
  const neq = require_neq();
@@ -593,7 +593,7 @@ var require_cmp = /* @__PURE__ */ require_common.__commonJSMin(((exports, module
593
593
  }));
594
594
 
595
595
  //#endregion
596
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/coerce.js
596
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/coerce.js
597
597
  var require_coerce = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
598
598
  const SemVer = require_semver$1();
599
599
  const parse = require_parse();
@@ -622,7 +622,7 @@ var require_coerce = /* @__PURE__ */ require_common.__commonJSMin(((exports, mod
622
622
  }));
623
623
 
624
624
  //#endregion
625
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/lrucache.js
625
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/lrucache.js
626
626
  var require_lrucache = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
627
627
  var LRUCache = class {
628
628
  constructor() {
@@ -656,7 +656,7 @@ var require_lrucache = /* @__PURE__ */ require_common.__commonJSMin(((exports, m
656
656
  }));
657
657
 
658
658
  //#endregion
659
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/classes/range.js
659
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/range.js
660
660
  var require_range = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
661
661
  const SPACE_CHARACTERS = /\s+/g;
662
662
  var Range = class Range {
@@ -930,7 +930,7 @@ var require_range = /* @__PURE__ */ require_common.__commonJSMin(((exports, modu
930
930
  }));
931
931
 
932
932
  //#endregion
933
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/classes/comparator.js
933
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/comparator.js
934
934
  var require_comparator = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
935
935
  const ANY = Symbol("SemVer ANY");
936
936
  var Comparator = class Comparator {
@@ -1002,7 +1002,7 @@ var require_comparator = /* @__PURE__ */ require_common.__commonJSMin(((exports,
1002
1002
  }));
1003
1003
 
1004
1004
  //#endregion
1005
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/satisfies.js
1005
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/satisfies.js
1006
1006
  var require_satisfies = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1007
1007
  const Range = require_range();
1008
1008
  const satisfies = (version, range, options) => {
@@ -1017,7 +1017,7 @@ var require_satisfies = /* @__PURE__ */ require_common.__commonJSMin(((exports,
1017
1017
  }));
1018
1018
 
1019
1019
  //#endregion
1020
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/to-comparators.js
1020
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/to-comparators.js
1021
1021
  var require_to_comparators = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1022
1022
  const Range = require_range();
1023
1023
  const toComparators = (range, options) => new Range(range, options).set.map((comp) => comp.map((c) => c.value).join(" ").trim().split(" "));
@@ -1025,7 +1025,7 @@ var require_to_comparators = /* @__PURE__ */ require_common.__commonJSMin(((expo
1025
1025
  }));
1026
1026
 
1027
1027
  //#endregion
1028
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/max-satisfying.js
1028
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/max-satisfying.js
1029
1029
  var require_max_satisfying = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1030
1030
  const SemVer = require_semver$1();
1031
1031
  const Range = require_range();
@@ -1052,7 +1052,7 @@ var require_max_satisfying = /* @__PURE__ */ require_common.__commonJSMin(((expo
1052
1052
  }));
1053
1053
 
1054
1054
  //#endregion
1055
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/min-satisfying.js
1055
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-satisfying.js
1056
1056
  var require_min_satisfying = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1057
1057
  const SemVer = require_semver$1();
1058
1058
  const Range = require_range();
@@ -1079,7 +1079,7 @@ var require_min_satisfying = /* @__PURE__ */ require_common.__commonJSMin(((expo
1079
1079
  }));
1080
1080
 
1081
1081
  //#endregion
1082
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/min-version.js
1082
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-version.js
1083
1083
  var require_min_version = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1084
1084
  const SemVer = require_semver$1();
1085
1085
  const Range = require_range();
@@ -1119,7 +1119,7 @@ var require_min_version = /* @__PURE__ */ require_common.__commonJSMin(((exports
1119
1119
  }));
1120
1120
 
1121
1121
  //#endregion
1122
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/valid.js
1122
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/valid.js
1123
1123
  var require_valid = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1124
1124
  const Range = require_range();
1125
1125
  const validRange = (range, options) => {
@@ -1133,7 +1133,7 @@ var require_valid = /* @__PURE__ */ require_common.__commonJSMin(((exports, modu
1133
1133
  }));
1134
1134
 
1135
1135
  //#endregion
1136
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/outside.js
1136
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/outside.js
1137
1137
  var require_outside = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1138
1138
  const SemVer = require_semver$1();
1139
1139
  const Comparator = require_comparator();
@@ -1187,7 +1187,7 @@ var require_outside = /* @__PURE__ */ require_common.__commonJSMin(((exports, mo
1187
1187
  }));
1188
1188
 
1189
1189
  //#endregion
1190
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/gtr.js
1190
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/gtr.js
1191
1191
  var require_gtr = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1192
1192
  const outside = require_outside();
1193
1193
  const gtr = (version, range, options) => outside(version, range, ">", options);
@@ -1195,7 +1195,7 @@ var require_gtr = /* @__PURE__ */ require_common.__commonJSMin(((exports, module
1195
1195
  }));
1196
1196
 
1197
1197
  //#endregion
1198
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/ltr.js
1198
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/ltr.js
1199
1199
  var require_ltr = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1200
1200
  const outside = require_outside();
1201
1201
  const ltr = (version, range, options) => outside(version, range, "<", options);
@@ -1203,7 +1203,7 @@ var require_ltr = /* @__PURE__ */ require_common.__commonJSMin(((exports, module
1203
1203
  }));
1204
1204
 
1205
1205
  //#endregion
1206
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/intersects.js
1206
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/intersects.js
1207
1207
  var require_intersects = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1208
1208
  const Range = require_range();
1209
1209
  const intersects = (r1, r2, options) => {
@@ -1215,7 +1215,7 @@ var require_intersects = /* @__PURE__ */ require_common.__commonJSMin(((exports,
1215
1215
  }));
1216
1216
 
1217
1217
  //#endregion
1218
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/simplify.js
1218
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/simplify.js
1219
1219
  var require_simplify = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1220
1220
  const satisfies = require_satisfies();
1221
1221
  const compare = require_compare();
@@ -1246,7 +1246,7 @@ var require_simplify = /* @__PURE__ */ require_common.__commonJSMin(((exports, m
1246
1246
  }));
1247
1247
 
1248
1248
  //#endregion
1249
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/subset.js
1249
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/subset.js
1250
1250
  var require_subset = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1251
1251
  const Range = require_range();
1252
1252
  const Comparator = require_comparator();
@@ -1342,7 +1342,7 @@ var require_subset = /* @__PURE__ */ require_common.__commonJSMin(((exports, mod
1342
1342
  }));
1343
1343
 
1344
1344
  //#endregion
1345
- //#region node_modules/.pnpm/semver@7.7.4/node_modules/semver/index.js
1345
+ //#region node_modules/.pnpm/semver@7.7.3/node_modules/semver/index.js
1346
1346
  var require_semver = /* @__PURE__ */ require_common.__commonJSMin(((exports, module) => {
1347
1347
  const internalRe = require_re();
1348
1348
  const constants = require_constants();
@@ -2050,4 +2050,4 @@ Object.defineProperty(exports, 'validateClaudeConfig', {
2050
2050
  return validateClaudeConfig;
2051
2051
  }
2052
2052
  });
2053
- //# sourceMappingURL=helpers-DieQS_ke.js.map
2053
+ //# sourceMappingURL=helpers-Cj5geKJl.js.map
package/dist/helpers-Cj5geKJl.js.map ADDED
@@ -0,0 +1 @@
1
+ {"version":3,"file":"helpers-Cj5geKJl.js","names":["list","list","exec","path","tableData: string[][]","semver","CONSOLE_ICONS","comparisons: Record<string, Record<string, string>>","failedTargetsNoPackage: string[]","list","path","ignorePattern: string | undefined","userPatterns: string","transformModules: Record<string, unknown>","fs","path","path","fs","answers: Answers","path","fs","CONSOLE_ICONS"],"sources":["../node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/constants.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/debug.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/re.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/parse-options.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/identifiers.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/semver.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/parse.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/valid.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/clean.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/inc.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/diff.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/major.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/minor.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/patch.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/prerelease.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/compare.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/rcompare.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/compare-loose.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/compare-build.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/sort.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/rsort.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/gt.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/lt.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/eq.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/neq.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/gte.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/lte.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/cmp.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/coerce.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/lrucache.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/range.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/comparator.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/satisfies.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/to-comparators.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/max-satisfying.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-satisfying.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-version.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/valid.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/outside.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/gtr.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/ltr.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/intersects.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/simplify.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/subset.js","../node_modules/.pnpm/semver@7.7.3/node_modules/semver/index.js","../src/controller/helpers/getCodemodConfig.ts","../src/controller/helpers/repository.ts","../src/controller/helpers/table.ts","../src/controller/helpers/dependencyChecks.ts","../src/controller/helpers/getOptions.ts","../src/controller/helpers/loadTransformModules.ts","../src/controller/helpers/reportManualReview.ts","../src/controller/helpers/runTransformPrompts.ts","../src/controller/helpers/validateClaudeConfig.ts"],"sourcesContent":["'use strict'\n\n// Note: this is the semver.org version of the spec that it implements\n// Not necessarily the package version of this code.\nconst SEMVER_SPEC_VERSION = '2.0.0'\n\nconst MAX_LENGTH = 256\nconst MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||\n/* istanbul ignore next */ 9007199254740991\n\n// Max safe segment length for coercion.\nconst MAX_SAFE_COMPONENT_LENGTH = 16\n\n// Max safe length for a build identifier. The max length minus 6 characters for\n// the shortest version with a build 0.0.0+BUILD.\nconst MAX_SAFE_BUILD_LENGTH = MAX_LENGTH - 6\n\nconst RELEASE_TYPES = [\n 'major',\n 'premajor',\n 'minor',\n 'preminor',\n 'patch',\n 'prepatch',\n 'prerelease',\n]\n\nmodule.exports = {\n MAX_LENGTH,\n MAX_SAFE_COMPONENT_LENGTH,\n MAX_SAFE_BUILD_LENGTH,\n MAX_SAFE_INTEGER,\n RELEASE_TYPES,\n SEMVER_SPEC_VERSION,\n FLAG_INCLUDE_PRERELEASE: 0b001,\n FLAG_LOOSE: 0b010,\n}\n","'use strict'\n\nconst debug = (\n typeof process === 'object' &&\n process.env &&\n process.env.NODE_DEBUG &&\n /\\bsemver\\b/i.test(process.env.NODE_DEBUG)\n) ? (...args) => console.error('SEMVER', ...args)\n : () => {}\n\nmodule.exports = debug\n","'use strict'\n\nconst {\n MAX_SAFE_COMPONENT_LENGTH,\n MAX_SAFE_BUILD_LENGTH,\n MAX_LENGTH,\n} = require('./constants')\nconst debug = require('./debug')\nexports = module.exports = {}\n\n// The actual regexps go on exports.re\nconst re = exports.re = []\nconst safeRe = exports.safeRe = []\nconst src = exports.src = []\nconst safeSrc = exports.safeSrc = []\nconst t = exports.t = {}\nlet R = 0\n\nconst LETTERDASHNUMBER = '[a-zA-Z0-9-]'\n\n// Replace some greedy regex tokens to prevent regex dos issues. These regex are\n// used internally via the safeRe object since all inputs in this library get\n// normalized first to trim and collapse all extra whitespace. The original\n// regexes are exported for userland consumption and lower level usage. A\n// future breaking change could export the safer regex only with a note that\n// all input should have extra whitespace removed.\nconst safeRegexReplacements = [\n ['\\\\s', 1],\n ['\\\\d', MAX_LENGTH],\n [LETTERDASHNUMBER, MAX_SAFE_BUILD_LENGTH],\n]\n\nconst makeSafeRegex = (value) => {\n for (const [token, max] of safeRegexReplacements) {\n value = value\n .split(`${token}*`).join(`${token}{0,${max}}`)\n .split(`${token}+`).join(`${token}{1,${max}}`)\n }\n return value\n}\n\nconst createToken = (name, value, isGlobal) => {\n const safe = makeSafeRegex(value)\n const index = R++\n debug(name, index, value)\n t[name] = index\n src[index] = value\n safeSrc[index] = safe\n re[index] = new RegExp(value, isGlobal ? 'g' : undefined)\n safeRe[index] = new RegExp(safe, isGlobal ? 'g' : undefined)\n}\n\n// The following Regular Expressions can be used for tokenizing,\n// validating, and parsing SemVer version strings.\n\n// ## Numeric Identifier\n// A single `0`, or a non-zero digit followed by zero or more digits.\n\ncreateToken('NUMERICIDENTIFIER', '0|[1-9]\\\\d*')\ncreateToken('NUMERICIDENTIFIERLOOSE', '\\\\d+')\n\n// ## Non-numeric Identifier\n// Zero or more digits, followed by a letter or hyphen, and then zero or\n// more letters, digits, or hyphens.\n\ncreateToken('NONNUMERICIDENTIFIER', `\\\\d*[a-zA-Z-]${LETTERDASHNUMBER}*`)\n\n// ## Main Version\n// Three dot-separated numeric identifiers.\n\ncreateToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version Identifier\n// A numeric identifier, or a non-numeric identifier.\n// Non-numberic identifiers include numberic identifiers but can be longer.\n// Therefore non-numberic identifiers must go first.\n\ncreateToken('PRERELEASEIDENTIFIER', `(?:${src[t.NONNUMERICIDENTIFIER]\n}|${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NONNUMERICIDENTIFIER]\n}|${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version\n// Hyphen, followed by one or more dot-separated pre-release version\n// identifiers.\n\ncreateToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIER]})*))`)\n\ncreateToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`)\n\n// ## Build Metadata Identifier\n// Any combination of digits, letters, or hyphens.\n\ncreateToken('BUILDIDENTIFIER', `${LETTERDASHNUMBER}+`)\n\n// ## Build Metadata\n// Plus sign, followed by one or more period-separated build metadata\n// identifiers.\n\ncreateToken('BUILD', `(?:\\\\+(${src[t.BUILDIDENTIFIER]\n}(?:\\\\.${src[t.BUILDIDENTIFIER]})*))`)\n\n// ## Full Version String\n// A main version, followed optionally by a pre-release version and\n// build metadata.\n\n// Note that the only major, minor, patch, and pre-release sections of\n// the version string are capturing groups. The build metadata is not a\n// capturing group, because it should not ever be used in version\n// comparison.\n\ncreateToken('FULLPLAIN', `v?${src[t.MAINVERSION]\n}${src[t.PRERELEASE]}?${\n src[t.BUILD]}?`)\n\ncreateToken('FULL', `^${src[t.FULLPLAIN]}$`)\n\n// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.\n// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty\n// common in the npm registry.\ncreateToken('LOOSEPLAIN', `[v=\\\\s]*${src[t.MAINVERSIONLOOSE]\n}${src[t.PRERELEASELOOSE]}?${\n src[t.BUILD]}?`)\n\ncreateToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`)\n\ncreateToken('GTLT', '((?:<|>)?=?)')\n\n// Something like \"2.*\" or \"1.2.x\".\n// Note that \"x.x\" is a valid xRange identifer, meaning \"any version\"\n// Only the first item is strictly required.\ncreateToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\\\*`)\ncreateToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\\\*`)\n\ncreateToken('XRANGEPLAIN', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIER]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n `(?:${src[t.PRERELEASE]})?${\n src[t.BUILD]}?` +\n `)?)?`)\n\ncreateToken('XRANGEPLAINLOOSE', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:${src[t.PRERELEASELOOSE]})?${\n src[t.BUILD]}?` +\n `)?)?`)\n\ncreateToken('XRANGE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAIN]}$`)\ncreateToken('XRANGELOOSE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Coercion.\n// Extract anything that could conceivably be a part of a valid semver\ncreateToken('COERCEPLAIN', `${'(^|[^\\\\d])' +\n '(\\\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +\n `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?`)\ncreateToken('COERCE', `${src[t.COERCEPLAIN]}(?:$|[^\\\\d])`)\ncreateToken('COERCEFULL', src[t.COERCEPLAIN] +\n `(?:${src[t.PRERELEASE]})?` +\n `(?:${src[t.BUILD]})?` +\n `(?:$|[^\\\\d])`)\ncreateToken('COERCERTL', src[t.COERCE], true)\ncreateToken('COERCERTLFULL', src[t.COERCEFULL], true)\n\n// Tilde ranges.\n// Meaning is \"reasonably at or greater than\"\ncreateToken('LONETILDE', '(?:~>?)')\n\ncreateToken('TILDETRIM', `(\\\\s*)${src[t.LONETILDE]}\\\\s+`, true)\nexports.tildeTrimReplace = '$1~'\n\ncreateToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Caret ranges.\n// Meaning is \"at least and backwards compatible with\"\ncreateToken('LONECARET', '(?:\\\\^)')\n\ncreateToken('CARETTRIM', `(\\\\s*)${src[t.LONECARET]}\\\\s+`, true)\nexports.caretTrimReplace = '$1^'\n\ncreateToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// A simple gt/lt/eq thing, or just \"\" to indicate \"any version\"\ncreateToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\\\s*(${src[t.LOOSEPLAIN]})$|^$`)\ncreateToken('COMPARATOR', `^${src[t.GTLT]}\\\\s*(${src[t.FULLPLAIN]})$|^$`)\n\n// An expression to strip any whitespace between the gtlt and the thing\n// it modifies, so that `> 1.2.3` ==> `>1.2.3`\ncreateToken('COMPARATORTRIM', `(\\\\s*)${src[t.GTLT]\n}\\\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true)\nexports.comparatorTrimReplace = '$1$2$3'\n\n// Something like `1.2.3 - 1.2.4`\n// Note that these all use the loose form, because they'll be\n// checked against either the strict or loose comparator form\n// later.\ncreateToken('HYPHENRANGE', `^\\\\s*(${src[t.XRANGEPLAIN]})` +\n `\\\\s+-\\\\s+` +\n `(${src[t.XRANGEPLAIN]})` +\n `\\\\s*$`)\n\ncreateToken('HYPHENRANGELOOSE', `^\\\\s*(${src[t.XRANGEPLAINLOOSE]})` +\n `\\\\s+-\\\\s+` +\n `(${src[t.XRANGEPLAINLOOSE]})` +\n `\\\\s*$`)\n\n// Star ranges basically just allow anything at all.\ncreateToken('STAR', '(<|>)?=?\\\\s*\\\\*')\n// >=0.0.0 is like a star\ncreateToken('GTE0', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0\\\\s*$')\ncreateToken('GTE0PRE', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0-0\\\\s*$')\n","'use strict'\n\n// parse out just the options we care about\nconst looseOption = Object.freeze({ loose: true })\nconst emptyOpts = Object.freeze({ })\nconst parseOptions = options => {\n if (!options) {\n return emptyOpts\n }\n\n if (typeof options !== 'object') {\n return looseOption\n }\n\n return options\n}\nmodule.exports = parseOptions\n","'use strict'\n\nconst numeric = /^[0-9]+$/\nconst compareIdentifiers = (a, b) => {\n if (typeof a === 'number' && typeof b === 'number') {\n return a === b ? 0 : a < b ? -1 : 1\n }\n\n const anum = numeric.test(a)\n const bnum = numeric.test(b)\n\n if (anum && bnum) {\n a = +a\n b = +b\n }\n\n return a === b ? 0\n : (anum && !bnum) ? -1\n : (bnum && !anum) ? 1\n : a < b ? -1\n : 1\n}\n\nconst rcompareIdentifiers = (a, b) => compareIdentifiers(b, a)\n\nmodule.exports = {\n compareIdentifiers,\n rcompareIdentifiers,\n}\n","'use strict'\n\nconst debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n constructor (version, options) {\n options = parseOptions(options)\n\n if (version instanceof SemVer) {\n if (version.loose === !!options.loose &&\n version.includePrerelease === !!options.includePrerelease) {\n return version\n } else {\n version = version.version\n }\n } else if (typeof version !== 'string') {\n throw new TypeError(`Invalid version. Must be a string. Got type \"${typeof version}\".`)\n }\n\n if (version.length > MAX_LENGTH) {\n throw new TypeError(\n `version is longer than ${MAX_LENGTH} characters`\n )\n }\n\n debug('SemVer', version, options)\n this.options = options\n this.loose = !!options.loose\n // this isn't actually relevant for versions, but keep it so that we\n // don't run into trouble passing this.options around.\n this.includePrerelease = !!options.includePrerelease\n\n const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n if (!m) {\n throw new TypeError(`Invalid Version: ${version}`)\n }\n\n this.raw = version\n\n // these are actually numbers\n this.major = +m[1]\n this.minor = +m[2]\n this.patch = +m[3]\n\n if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n throw new TypeError('Invalid major version')\n }\n\n if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n throw new TypeError('Invalid minor version')\n }\n\n if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n throw new TypeError('Invalid patch version')\n }\n\n // numberify any prerelease numeric ids\n if (!m[4]) {\n this.prerelease = []\n } else {\n this.prerelease = m[4].split('.').map((id) => {\n if (/^[0-9]+$/.test(id)) {\n const num = +id\n if (num >= 0 && num < MAX_SAFE_INTEGER) {\n return num\n }\n }\n return id\n })\n }\n\n this.build = m[5] ? m[5].split('.') : []\n this.format()\n }\n\n format () {\n this.version = `${this.major}.${this.minor}.${this.patch}`\n if (this.prerelease.length) {\n this.version += `-${this.prerelease.join('.')}`\n }\n return this.version\n }\n\n toString () {\n return this.version\n }\n\n compare (other) {\n debug('SemVer.compare', this.version, this.options, other)\n if (!(other instanceof SemVer)) {\n if (typeof other === 'string' && other === this.version) {\n return 0\n }\n other = new SemVer(other, this.options)\n }\n\n if (other.version === this.version) {\n return 0\n }\n\n return this.compareMain(other) || this.comparePre(other)\n }\n\n compareMain (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n if (this.major < other.major) {\n return -1\n }\n if (this.major > other.major) {\n return 1\n }\n if (this.minor < other.minor) {\n return -1\n }\n if (this.minor > other.minor) {\n return 1\n }\n if (this.patch < other.patch) {\n return -1\n }\n if (this.patch > other.patch) {\n return 1\n }\n return 0\n }\n\n comparePre (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n // NOT having a prerelease is > having one\n if (this.prerelease.length && !other.prerelease.length) {\n return -1\n } else if (!this.prerelease.length && other.prerelease.length) {\n return 1\n } else if (!this.prerelease.length && !other.prerelease.length) {\n return 0\n }\n\n let i = 0\n do {\n const a = this.prerelease[i]\n const b = other.prerelease[i]\n debug('prerelease compare', i, a, b)\n if (a === undefined && b === undefined) {\n return 0\n } else if (b === undefined) {\n return 1\n } else if (a === undefined) {\n return -1\n } else if (a === b) {\n continue\n } else {\n return compareIdentifiers(a, b)\n }\n } while (++i)\n }\n\n compareBuild (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n let i = 0\n do {\n const a = this.build[i]\n const b = other.build[i]\n debug('build compare', i, a, b)\n if (a === undefined && b === undefined) {\n return 0\n } else if (b === undefined) {\n return 1\n } else if (a === undefined) {\n return -1\n } else if (a === b) {\n continue\n } else {\n return compareIdentifiers(a, b)\n }\n } while (++i)\n }\n\n // preminor will bump the version up to the next minor release, and immediately\n // down to pre-release. premajor and prepatch work the same way.\n inc (release, identifier, identifierBase) {\n if (release.startsWith('pre')) {\n if (!identifier && identifierBase === false) {\n throw new Error('invalid increment argument: identifier is empty')\n }\n // Avoid an invalid semver results\n if (identifier) {\n const match = `-${identifier}`.match(this.options.loose ? re[t.PRERELEASELOOSE] : re[t.PRERELEASE])\n if (!match || match[1] !== identifier) {\n throw new Error(`invalid identifier: ${identifier}`)\n }\n }\n }\n\n switch (release) {\n case 'premajor':\n this.prerelease.length = 0\n this.patch = 0\n this.minor = 0\n this.major++\n this.inc('pre', identifier, identifierBase)\n break\n case 'preminor':\n this.prerelease.length = 0\n this.patch = 0\n this.minor++\n this.inc('pre', identifier, identifierBase)\n break\n case 'prepatch':\n // If this is already a prerelease, it will bump to the next version\n // drop any prereleases that might already exist, since they are not\n // relevant at this point.\n this.prerelease.length = 0\n this.inc('patch', identifier, identifierBase)\n this.inc('pre', identifier, identifierBase)\n break\n // If the input is a non-prerelease version, this acts the same as\n // prepatch.\n case 'prerelease':\n if (this.prerelease.length === 0) {\n this.inc('patch', identifier, identifierBase)\n }\n this.inc('pre', identifier, identifierBase)\n break\n case 'release':\n if (this.prerelease.length === 0) {\n throw new Error(`version ${this.raw} is not a prerelease`)\n }\n this.prerelease.length = 0\n break\n\n case 'major':\n // If this is a pre-major version, bump up to the same major version.\n // Otherwise increment major.\n // 1.0.0-5 bumps to 1.0.0\n // 1.1.0 bumps to 2.0.0\n if (\n this.minor !== 0 ||\n this.patch !== 0 ||\n this.prerelease.length === 0\n ) {\n this.major++\n }\n this.minor = 0\n this.patch = 0\n this.prerelease = []\n break\n case 'minor':\n // If this is a pre-minor version, bump up to the same minor version.\n // Otherwise increment minor.\n // 1.2.0-5 bumps to 1.2.0\n // 1.2.1 bumps to 1.3.0\n if (this.patch !== 0 || this.prerelease.length === 0) {\n this.minor++\n }\n this.patch = 0\n this.prerelease = []\n break\n case 'patch':\n // If this is not a pre-release version, it will increment the patch.\n // If it is a pre-release it will bump up to the same patch version.\n // 1.2.0-5 patches to 1.2.0\n // 1.2.0 patches to 1.2.1\n if (this.prerelease.length === 0) {\n this.patch++\n }\n this.prerelease = []\n break\n // This probably shouldn't be used publicly.\n // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n case 'pre': {\n const base = Number(identifierBase) ? 1 : 0\n\n if (this.prerelease.length === 0) {\n this.prerelease = [base]\n } else {\n let i = this.prerelease.length\n while (--i >= 0) {\n if (typeof this.prerelease[i] === 'number') {\n this.prerelease[i]++\n i = -2\n }\n }\n if (i === -1) {\n // didn't increment anything\n if (identifier === this.prerelease.join('.') && identifierBase === false) {\n throw new Error('invalid increment argument: identifier already exists')\n }\n this.prerelease.push(base)\n }\n }\n if (identifier) {\n // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n let prerelease = [identifier, base]\n if (identifierBase === false) {\n prerelease = [identifier]\n }\n if (compareIdentifiers(this.prerelease[0], identifier) === 0) {\n if (isNaN(this.prerelease[1])) {\n this.prerelease = prerelease\n }\n } else {\n this.prerelease = prerelease\n }\n }\n break\n }\n default:\n throw new Error(`invalid increment argument: ${release}`)\n }\n this.raw = this.format()\n if (this.build.length) {\n this.raw += `+${this.build.join('.')}`\n }\n return this\n }\n}\n\nmodule.exports = SemVer\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst parse = (version, options, throwErrors = false) => {\n if (version instanceof SemVer) {\n return version\n }\n try {\n return new SemVer(version, options)\n } catch (er) {\n if (!throwErrors) {\n return null\n }\n throw er\n }\n}\n\nmodule.exports = parse\n","'use strict'\n\nconst parse = require('./parse')\nconst valid = (version, options) => {\n const v = parse(version, options)\n return v ? v.version : null\n}\nmodule.exports = valid\n","'use strict'\n\nconst parse = require('./parse')\nconst clean = (version, options) => {\n const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n return s ? s.version : null\n}\nmodule.exports = clean\n","'use strict'\n\nconst SemVer = require('../classes/semver')\n\nconst inc = (version, release, options, identifier, identifierBase) => {\n if (typeof (options) === 'string') {\n identifierBase = identifier\n identifier = options\n options = undefined\n }\n\n try {\n return new SemVer(\n version instanceof SemVer ? version.version : version,\n options\n ).inc(release, identifier, identifierBase).version\n } catch (er) {\n return null\n }\n}\nmodule.exports = inc\n","'use strict'\n\nconst parse = require('./parse.js')\n\nconst diff = (version1, version2) => {\n const v1 = parse(version1, null, true)\n const v2 = parse(version2, null, true)\n const comparison = v1.compare(v2)\n\n if (comparison === 0) {\n return null\n }\n\n const v1Higher = comparison > 0\n const highVersion = v1Higher ? v1 : v2\n const lowVersion = v1Higher ? v2 : v1\n const highHasPre = !!highVersion.prerelease.length\n const lowHasPre = !!lowVersion.prerelease.length\n\n if (lowHasPre && !highHasPre) {\n // Going from prerelease -> no prerelease requires some special casing\n\n // If the low version has only a major, then it will always be a major\n // Some examples:\n // 1.0.0-1 -> 1.0.0\n // 1.0.0-1 -> 1.1.1\n // 1.0.0-1 -> 2.0.0\n if (!lowVersion.patch && !lowVersion.minor) {\n return 'major'\n }\n\n // If the main part has no difference\n if (lowVersion.compareMain(highVersion) === 0) {\n if (lowVersion.minor && !lowVersion.patch) {\n return 'minor'\n }\n return 'patch'\n }\n }\n\n // add the `pre` prefix if we are going to a prerelease version\n const prefix = highHasPre ? 'pre' : ''\n\n if (v1.major !== v2.major) {\n return prefix + 'major'\n }\n\n if (v1.minor !== v2.minor) {\n return prefix + 'minor'\n }\n\n if (v1.patch !== v2.patch) {\n return prefix + 'patch'\n }\n\n // high and low are preleases\n return 'prerelease'\n}\n\nmodule.exports = diff\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst major = (a, loose) => new SemVer(a, loose).major\nmodule.exports = major\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst minor = (a, loose) => new SemVer(a, loose).minor\nmodule.exports = minor\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst patch = (a, loose) => new SemVer(a, loose).patch\nmodule.exports = patch\n","'use strict'\n\nconst parse = require('./parse')\nconst prerelease = (version, options) => {\n const parsed = parse(version, options)\n return (parsed && parsed.prerelease.length) ? parsed.prerelease : null\n}\nmodule.exports = prerelease\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst compare = (a, b, loose) =>\n new SemVer(a, loose).compare(new SemVer(b, loose))\n\nmodule.exports = compare\n","'use strict'\n\nconst compare = require('./compare')\nconst rcompare = (a, b, loose) => compare(b, a, loose)\nmodule.exports = rcompare\n","'use strict'\n\nconst compare = require('./compare')\nconst compareLoose = (a, b) => compare(a, b, true)\nmodule.exports = compareLoose\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst compareBuild = (a, b, loose) => {\n const versionA = new SemVer(a, loose)\n const versionB = new SemVer(b, loose)\n return versionA.compare(versionB) || versionA.compareBuild(versionB)\n}\nmodule.exports = compareBuild\n","'use strict'\n\nconst compareBuild = require('./compare-build')\nconst sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose))\nmodule.exports = sort\n","'use strict'\n\nconst compareBuild = require('./compare-build')\nconst rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose))\nmodule.exports = rsort\n","'use strict'\n\nconst compare = require('./compare')\nconst gt = (a, b, loose) => compare(a, b, loose) > 0\nmodule.exports = gt\n","'use strict'\n\nconst compare = require('./compare')\nconst lt = (a, b, loose) => compare(a, b, loose) < 0\nmodule.exports = lt\n","'use strict'\n\nconst compare = require('./compare')\nconst eq = (a, b, loose) => compare(a, b, loose) === 0\nmodule.exports = eq\n","'use strict'\n\nconst compare = require('./compare')\nconst neq = (a, b, loose) => compare(a, b, loose) !== 0\nmodule.exports = neq\n","'use strict'\n\nconst compare = require('./compare')\nconst gte = (a, b, loose) => compare(a, b, loose) >= 0\nmodule.exports = gte\n","'use strict'\n\nconst compare = require('./compare')\nconst lte = (a, b, loose) => compare(a, b, loose) <= 0\nmodule.exports = lte\n","'use strict'\n\nconst eq = require('./eq')\nconst neq = require('./neq')\nconst gt = require('./gt')\nconst gte = require('./gte')\nconst lt = require('./lt')\nconst lte = require('./lte')\n\nconst cmp = (a, op, b, loose) => {\n switch (op) {\n case '===':\n if (typeof a === 'object') {\n a = a.version\n }\n if (typeof b === 'object') {\n b = b.version\n }\n return a === b\n\n case '!==':\n if (typeof a === 'object') {\n a = a.version\n }\n if (typeof b === 'object') {\n b = b.version\n }\n return a !== b\n\n case '':\n case '=':\n case '==':\n return eq(a, b, loose)\n\n case '!=':\n return neq(a, b, loose)\n\n case '>':\n return gt(a, b, loose)\n\n case '>=':\n return gte(a, b, loose)\n\n case '<':\n return lt(a, b, loose)\n\n case '<=':\n return lte(a, b, loose)\n\n default:\n throw new TypeError(`Invalid operator: ${op}`)\n }\n}\nmodule.exports = cmp\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst parse = require('./parse')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst coerce = (version, options) => {\n if (version instanceof SemVer) {\n return version\n }\n\n if (typeof version === 'number') {\n version = String(version)\n }\n\n if (typeof version !== 'string') {\n return null\n }\n\n options = options || {}\n\n let match = null\n if (!options.rtl) {\n match = version.match(options.includePrerelease ? re[t.COERCEFULL] : re[t.COERCE])\n } else {\n // Find the right-most coercible string that does not share\n // a terminus with a more left-ward coercible string.\n // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'\n // With includePrerelease option set, '1.2.3.4-rc' wants to coerce '2.3.4-rc', not '2.3.4'\n //\n // Walk through the string checking with a /g regexp\n // Manually set the index so as to pick up overlapping matches.\n // Stop when we get a match that ends at the string end, since no\n // coercible string can be more right-ward without the same terminus.\n const coerceRtlRegex = options.includePrerelease ? re[t.COERCERTLFULL] : re[t.COERCERTL]\n let next\n while ((next = coerceRtlRegex.exec(version)) &&\n (!match || match.index + match[0].length !== version.length)\n ) {\n if (!match ||\n next.index + next[0].length !== match.index + match[0].length) {\n match = next\n }\n coerceRtlRegex.lastIndex = next.index + next[1].length + next[2].length\n }\n // leave it in a clean state\n coerceRtlRegex.lastIndex = -1\n }\n\n if (match === null) {\n return null\n }\n\n const major = match[2]\n const minor = match[3] || '0'\n const patch = match[4] || '0'\n const prerelease = options.includePrerelease && match[5] ? `-${match[5]}` : ''\n const build = options.includePrerelease && match[6] ? `+${match[6]}` : ''\n\n return parse(`${major}.${minor}.${patch}${prerelease}${build}`, options)\n}\nmodule.exports = coerce\n","'use strict'\n\nclass LRUCache {\n constructor () {\n this.max = 1000\n this.map = new Map()\n }\n\n get (key) {\n const value = this.map.get(key)\n if (value === undefined) {\n return undefined\n } else {\n // Remove the key from the map and add it to the end\n this.map.delete(key)\n this.map.set(key, value)\n return value\n }\n }\n\n delete (key) {\n return this.map.delete(key)\n }\n\n set (key, value) {\n const deleted = this.delete(key)\n\n if (!deleted && value !== undefined) {\n // If cache is full, delete the least recently used item\n if (this.map.size >= this.max) {\n const firstKey = this.map.keys().next().value\n this.delete(firstKey)\n }\n\n this.map.set(key, value)\n }\n\n return this\n }\n}\n\nmodule.exports = LRUCache\n","'use strict'\n\nconst SPACE_CHARACTERS = /\\s+/g\n\n// hoisted class for cyclic dependency\nclass Range {\n constructor (range, options) {\n options = parseOptions(options)\n\n if (range instanceof Range) {\n if (\n range.loose === !!options.loose &&\n range.includePrerelease === !!options.includePrerelease\n ) {\n return range\n } else {\n return new Range(range.raw, options)\n }\n }\n\n if (range instanceof Comparator) {\n // just put it in the set and return\n this.raw = range.value\n this.set = [[range]]\n this.formatted = undefined\n return this\n }\n\n this.options = options\n this.loose = !!options.loose\n this.includePrerelease = !!options.includePrerelease\n\n // First reduce all whitespace as much as possible so we do not have to rely\n // on potentially slow regexes like \\s*. This is then stored and used for\n // future error messages as well.\n this.raw = range.trim().replace(SPACE_CHARACTERS, ' ')\n\n // First, split on ||\n this.set = this.raw\n .split('||')\n // map the range to a 2d array of comparators\n .map(r => this.parseRange(r.trim()))\n // throw out any comparator lists that are empty\n // this generally means that it was not a valid range, which is allowed\n // in loose mode, but will still throw if the WHOLE range is invalid.\n .filter(c => c.length)\n\n if (!this.set.length) {\n throw new TypeError(`Invalid SemVer Range: ${this.raw}`)\n }\n\n // if we have any that are not the null set, throw out null sets.\n if (this.set.length > 1) {\n // keep the first one, in case they're all null sets\n const first = this.set[0]\n this.set = this.set.filter(c => !isNullSet(c[0]))\n if (this.set.length === 0) {\n this.set = [first]\n } else if (this.set.length > 1) {\n // if we have any that are *, then the range is just *\n for (const c of this.set) {\n if (c.length === 1 && isAny(c[0])) {\n this.set = [c]\n break\n }\n }\n }\n }\n\n this.formatted = undefined\n }\n\n get range () {\n if (this.formatted === undefined) {\n this.formatted = ''\n for (let i = 0; i < this.set.length; i++) {\n if (i > 0) {\n this.formatted += '||'\n }\n const comps = this.set[i]\n for (let k = 0; k < comps.length; k++) {\n if (k > 0) {\n this.formatted += ' '\n }\n this.formatted += comps[k].toString().trim()\n }\n }\n }\n return this.formatted\n }\n\n format () {\n return this.range\n }\n\n toString () {\n return this.range\n }\n\n parseRange (range) {\n // memoize range parsing for performance.\n // this is a very hot path, and fully deterministic.\n const memoOpts =\n (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |\n (this.options.loose && FLAG_LOOSE)\n const memoKey = memoOpts + ':' + range\n const cached = cache.get(memoKey)\n if (cached) {\n return cached\n }\n\n const loose = this.options.loose\n // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n debug('hyphen replace', range)\n\n // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n debug('comparator trim', range)\n\n // `~ 1.2.3` => `~1.2.3`\n range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n debug('tilde trim', range)\n\n // `^ 1.2.3` => `^1.2.3`\n range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n debug('caret trim', range)\n\n // At this point, the range is completely trimmed and\n // ready to be split into comparators.\n\n let rangeList = range\n .split(' ')\n .map(comp => parseComparator(comp, this.options))\n .join(' ')\n .split(/\\s+/)\n // >=0.0.0 is equivalent to *\n .map(comp => replaceGTE0(comp, this.options))\n\n if (loose) {\n // in loose mode, throw out any that are not valid comparators\n rangeList = rangeList.filter(comp => {\n debug('loose invalid filter', comp, this.options)\n return !!comp.match(re[t.COMPARATORLOOSE])\n })\n }\n debug('range list', rangeList)\n\n // if any comparators are the null set, then replace with JUST null set\n // if more than one comparator, remove any * comparators\n // also, don't include the same comparator more than once\n const rangeMap = new Map()\n const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n for (const comp of comparators) {\n if (isNullSet(comp)) {\n return [comp]\n }\n rangeMap.set(comp.value, comp)\n }\n if (rangeMap.size > 1 && rangeMap.has('')) {\n rangeMap.delete('')\n }\n\n const result = [...rangeMap.values()]\n cache.set(memoKey, result)\n return result\n }\n\n intersects (range, options) {\n if (!(range instanceof Range)) {\n throw new TypeError('a Range is required')\n }\n\n return this.set.some((thisComparators) => {\n return (\n isSatisfiable(thisComparators, options) &&\n range.set.some((rangeComparators) => {\n return (\n isSatisfiable(rangeComparators, options) &&\n thisComparators.every((thisComparator) => {\n return rangeComparators.every((rangeComparator) => {\n return thisComparator.intersects(rangeComparator, options)\n })\n })\n )\n })\n )\n })\n }\n\n // if ANY of the sets match ALL of its comparators, then pass\n test (version) {\n if (!version) {\n return false\n }\n\n if (typeof version === 'string') {\n try {\n version = new SemVer(version, this.options)\n } catch (er) {\n return false\n }\n }\n\n for (let i = 0; i < this.set.length; i++) {\n if (testSet(this.set[i], version, this.options)) {\n return true\n }\n }\n return false\n }\n}\n\nmodule.exports = Range\n\nconst LRU = require('../internal/lrucache')\nconst cache = new LRU()\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n safeRe: re,\n t,\n comparatorTrimReplace,\n tildeTrimReplace,\n caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n let result = true\n const remainingComparators = comparators.slice()\n let testComparator = remainingComparators.pop()\n\n while (result && remainingComparators.length) {\n result = remainingComparators.every((otherComparator) => {\n return testComparator.intersects(otherComparator, options)\n })\n\n testComparator = remainingComparators.pop()\n }\n\n return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n comp = comp.replace(re[t.BUILD], '')\n debug('comp', comp, options)\n comp = replaceCarets(comp, options)\n debug('caret', comp)\n comp = replaceTildes(comp, options)\n debug('tildes', comp)\n comp = replaceXRanges(comp, options)\n debug('xrange', comp)\n comp = replaceStars(comp, options)\n debug('stars', comp)\n return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) => {\n return comp\n .trim()\n .split(/\\s+/)\n .map((c) => replaceTilde(c, options))\n .join(' ')\n}\n\nconst replaceTilde = (comp, options) => {\n const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n return comp.replace(r, (_, M, m, p, pr) => {\n debug('tilde', comp, _, M, m, p, pr)\n let ret\n\n if (isX(M)) {\n ret = ''\n } else if (isX(m)) {\n ret = `>=${M}.0.0 <${+M + 1}.0.0-0`\n } else if (isX(p)) {\n // ~1.2 == >=1.2.0 <1.3.0-0\n ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`\n } else if (pr) {\n debug('replaceTilde pr', pr)\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${+m + 1}.0-0`\n } else {\n // ~1.2.3 == >=1.2.3 <1.3.0-0\n ret = `>=${M}.${m}.${p\n } <${M}.${+m + 1}.0-0`\n }\n\n debug('tilde return', ret)\n return ret\n })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) => {\n return comp\n .trim()\n .split(/\\s+/)\n .map((c) => replaceCaret(c, options))\n .join(' ')\n}\n\nconst replaceCaret = (comp, options) => {\n debug('caret', comp, options)\n const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n const z = options.includePrerelease ? '-0' : ''\n return comp.replace(r, (_, M, m, p, pr) => {\n debug('caret', comp, _, M, m, p, pr)\n let ret\n\n if (isX(M)) {\n ret = ''\n } else if (isX(m)) {\n ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n } else if (isX(p)) {\n if (M === '0') {\n ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n } else {\n ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n }\n } else if (pr) {\n debug('replaceCaret pr', pr)\n if (M === '0') {\n if (m === '0') {\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${m}.${+p + 1}-0`\n } else {\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${+m + 1}.0-0`\n }\n } else {\n ret = `>=${M}.${m}.${p}-${pr\n } <${+M + 1}.0.0-0`\n }\n } else {\n debug('no pr')\n if (M === '0') {\n if (m === '0') {\n ret = `>=${M}.${m}.${p\n }${z} <${M}.${m}.${+p + 1}-0`\n } else {\n ret = `>=${M}.${m}.${p\n }${z} <${M}.${+m + 1}.0-0`\n }\n } else {\n ret = `>=${M}.${m}.${p\n } <${+M + 1}.0.0-0`\n }\n }\n\n debug('caret return', ret)\n return ret\n })\n}\n\nconst replaceXRanges = (comp, options) => {\n debug('replaceXRanges', comp, options)\n return comp\n .split(/\\s+/)\n .map((c) => replaceXRange(c, options))\n .join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n comp = comp.trim()\n const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n debug('xRange', comp, ret, gtlt, M, m, p, pr)\n const xM = isX(M)\n const xm = xM || isX(m)\n const xp = xm || isX(p)\n const anyX = xp\n\n if (gtlt === '=' && anyX) {\n gtlt = ''\n }\n\n // if we're including prereleases in the match, then we need\n // to fix this to -0, the lowest possible prerelease value\n pr = options.includePrerelease ? '-0' : ''\n\n if (xM) {\n if (gtlt === '>' || gtlt === '<') {\n // nothing is allowed\n ret = '<0.0.0-0'\n } else {\n // nothing is forbidden\n ret = '*'\n }\n } else if (gtlt && anyX) {\n // we know patch is an x, because we have any x at all.\n // replace X with 0\n if (xm) {\n m = 0\n }\n p = 0\n\n if (gtlt === '>') {\n // >1 => >=2.0.0\n // >1.2 => >=1.3.0\n gtlt = '>='\n if (xm) {\n M = +M + 1\n m = 0\n p = 0\n } else {\n m = +m + 1\n p = 0\n }\n } else if (gtlt === '<=') {\n // <=0.7.x is actually <0.8.0, since any 0.7.x should\n // pass. Similarly, <=7.x is actually <8.0.0, etc.\n gtlt = '<'\n if (xm) {\n M = +M + 1\n } else {\n m = +m + 1\n }\n }\n\n if (gtlt === '<') {\n pr = '-0'\n }\n\n ret = `${gtlt + M}.${m}.${p}${pr}`\n } else if (xm) {\n ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n } else if (xp) {\n ret = `>=${M}.${m}.0${pr\n } <${M}.${+m + 1}.0-0`\n }\n\n debug('xRange return', ret)\n\n return ret\n })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n debug('replaceStars', comp, options)\n // Looseness is ignored here. star is always as loose as it gets!\n return comp\n .trim()\n .replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n debug('replaceGTE0', comp, options)\n return comp\n .trim()\n .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\n// TODO build?\nconst hyphenReplace = incPr => ($0,\n from, fM, fm, fp, fpr, fb,\n to, tM, tm, tp, tpr) => {\n if (isX(fM)) {\n from = ''\n } else if (isX(fm)) {\n from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n } else if (isX(fp)) {\n from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n } else if (fpr) {\n from = `>=${from}`\n } else {\n from = `>=${from}${incPr ? '-0' : ''}`\n }\n\n if (isX(tM)) {\n to = ''\n } else if (isX(tm)) {\n to = `<${+tM + 1}.0.0-0`\n } else if (isX(tp)) {\n to = `<${tM}.${+tm + 1}.0-0`\n } else if (tpr) {\n to = `<=${tM}.${tm}.${tp}-${tpr}`\n } else if (incPr) {\n to = `<${tM}.${tm}.${+tp + 1}-0`\n } else {\n to = `<=${to}`\n }\n\n return `${from} ${to}`.trim()\n}\n\nconst testSet = (set, version, options) => {\n for (let i = 0; i < set.length; i++) {\n if (!set[i].test(version)) {\n return false\n }\n }\n\n if (version.prerelease.length && !options.includePrerelease) {\n // Find the set of versions that are allowed to have prereleases\n // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n // That should allow `1.2.3-pr.2` to pass.\n // However, `1.2.4-alpha.notready` should NOT be allowed,\n // even though it's within the range set by the comparators.\n for (let i = 0; i < set.length; i++) {\n debug(set[i].semver)\n if (set[i].semver === Comparator.ANY) {\n continue\n }\n\n if (set[i].semver.prerelease.length > 0) {\n const allowed = set[i].semver\n if (allowed.major === version.major &&\n allowed.minor === version.minor &&\n allowed.patch === version.patch) {\n return true\n }\n }\n }\n\n // Version has a -pre, but it's not one of the ones we like.\n return false\n }\n\n return true\n}\n","'use strict'\n\nconst ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n static get ANY () {\n return ANY\n }\n\n constructor (comp, options) {\n options = parseOptions(options)\n\n if (comp instanceof Comparator) {\n if (comp.loose === !!options.loose) {\n return comp\n } else {\n comp = comp.value\n }\n }\n\n comp = comp.trim().split(/\\s+/).join(' ')\n debug('comparator', comp, options)\n this.options = options\n this.loose = !!options.loose\n this.parse(comp)\n\n if (this.semver === ANY) {\n this.value = ''\n } else {\n this.value = this.operator + this.semver.version\n }\n\n debug('comp', this)\n }\n\n parse (comp) {\n const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n const m = comp.match(r)\n\n if (!m) {\n throw new TypeError(`Invalid comparator: ${comp}`)\n }\n\n this.operator = m[1] !== undefined ? m[1] : ''\n if (this.operator === '=') {\n this.operator = ''\n }\n\n // if it literally is just '>' or '' then allow anything.\n if (!m[2]) {\n this.semver = ANY\n } else {\n this.semver = new SemVer(m[2], this.options.loose)\n }\n }\n\n toString () {\n return this.value\n }\n\n test (version) {\n debug('Comparator.test', version, this.options.loose)\n\n if (this.semver === ANY || version === ANY) {\n return true\n }\n\n if (typeof version === 'string') {\n try {\n version = new SemVer(version, this.options)\n } catch (er) {\n return false\n }\n }\n\n return cmp(version, this.operator, this.semver, this.options)\n }\n\n intersects (comp, options) {\n if (!(comp instanceof Comparator)) {\n throw new TypeError('a Comparator is required')\n }\n\n if (this.operator === '') {\n if (this.value === '') {\n return true\n }\n return new Range(comp.value, options).test(this.value)\n } else if (comp.operator === '') {\n if (comp.value === '') {\n return true\n }\n return new Range(this.value, options).test(comp.semver)\n }\n\n options = parseOptions(options)\n\n // Special cases where nothing can possibly be lower\n if (options.includePrerelease &&\n (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {\n return false\n }\n if (!options.includePrerelease &&\n (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {\n return false\n }\n\n // Same direction increasing (> or >=)\n if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {\n return true\n }\n // Same direction decreasing (< or <=)\n if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {\n return true\n }\n // same SemVer and both sides are inclusive (<= or >=)\n if (\n (this.semver.version === comp.semver.version) &&\n this.operator.includes('=') && comp.operator.includes('=')) {\n return true\n }\n // opposite directions less than\n if (cmp(this.semver, '<', comp.semver, options) &&\n this.operator.startsWith('>') && comp.operator.startsWith('<')) {\n return true\n }\n // opposite directions greater than\n if (cmp(this.semver, '>', comp.semver, options) &&\n this.operator.startsWith('<') && comp.operator.startsWith('>')) {\n return true\n }\n return false\n }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { safeRe: re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n","'use strict'\n\nconst Range = require('../classes/range')\nconst satisfies = (version, range, options) => {\n try {\n range = new Range(range, options)\n } catch (er) {\n return false\n }\n return range.test(version)\n}\nmodule.exports = satisfies\n","'use strict'\n\nconst Range = require('../classes/range')\n\n// Mostly just for testing and legacy API reasons\nconst toComparators = (range, options) =>\n new Range(range, options).set\n .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))\n\nmodule.exports = toComparators\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\n\nconst maxSatisfying = (versions, range, options) => {\n let max = null\n let maxSV = null\n let rangeObj = null\n try {\n rangeObj = new Range(range, options)\n } catch (er) {\n return null\n }\n versions.forEach((v) => {\n if (rangeObj.test(v)) {\n // satisfies(v, range, options)\n if (!max || maxSV.compare(v) === -1) {\n // compare(max, v, true)\n max = v\n maxSV = new SemVer(max, options)\n }\n }\n })\n return max\n}\nmodule.exports = maxSatisfying\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst minSatisfying = (versions, range, options) => {\n let min = null\n let minSV = null\n let rangeObj = null\n try {\n rangeObj = new Range(range, options)\n } catch (er) {\n return null\n }\n versions.forEach((v) => {\n if (rangeObj.test(v)) {\n // satisfies(v, range, options)\n if (!min || minSV.compare(v) === 1) {\n // compare(min, v, true)\n min = v\n minSV = new SemVer(min, options)\n }\n }\n })\n return min\n}\nmodule.exports = minSatisfying\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst gt = require('../functions/gt')\n\nconst minVersion = (range, loose) => {\n range = new Range(range, loose)\n\n let minver = new SemVer('0.0.0')\n if (range.test(minver)) {\n return minver\n }\n\n minver = new SemVer('0.0.0-0')\n if (range.test(minver)) {\n return minver\n }\n\n minver = null\n for (let i = 0; i < range.set.length; ++i) {\n const comparators = range.set[i]\n\n let setMin = null\n comparators.forEach((comparator) => {\n // Clone to avoid manipulating the comparator's semver object.\n const compver = new SemVer(comparator.semver.version)\n switch (comparator.operator) {\n case '>':\n if (compver.prerelease.length === 0) {\n compver.patch++\n } else {\n compver.prerelease.push(0)\n }\n compver.raw = compver.format()\n /* fallthrough */\n case '':\n case '>=':\n if (!setMin || gt(compver, setMin)) {\n setMin = compver\n }\n break\n case '<':\n case '<=':\n /* Ignore maximum versions */\n break\n /* istanbul ignore next */\n default:\n throw new Error(`Unexpected operation: ${comparator.operator}`)\n }\n })\n if (setMin && (!minver || gt(minver, setMin))) {\n minver = setMin\n }\n }\n\n if (minver && range.test(minver)) {\n return minver\n }\n\n return null\n}\nmodule.exports = minVersion\n","'use strict'\n\nconst Range = require('../classes/range')\nconst validRange = (range, options) => {\n try {\n // Return '*' instead of '' so that truthiness works.\n // This will throw if it's invalid anyway\n return new Range(range, options).range || '*'\n } catch (er) {\n return null\n }\n}\nmodule.exports = validRange\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Comparator = require('../classes/comparator')\nconst { ANY } = Comparator\nconst Range = require('../classes/range')\nconst satisfies = require('../functions/satisfies')\nconst gt = require('../functions/gt')\nconst lt = require('../functions/lt')\nconst lte = require('../functions/lte')\nconst gte = require('../functions/gte')\n\nconst outside = (version, range, hilo, options) => {\n version = new SemVer(version, options)\n range = new Range(range, options)\n\n let gtfn, ltefn, ltfn, comp, ecomp\n switch (hilo) {\n case '>':\n gtfn = gt\n ltefn = lte\n ltfn = lt\n comp = '>'\n ecomp = '>='\n break\n case '<':\n gtfn = lt\n ltefn = gte\n ltfn = gt\n comp = '<'\n ecomp = '<='\n break\n default:\n throw new TypeError('Must provide a hilo val of \"<\" or \">\"')\n }\n\n // If it satisfies the range it is not outside\n if (satisfies(version, range, options)) {\n return false\n }\n\n // From now on, variable terms are as if we're in \"gtr\" mode.\n // but note that everything is flipped for the \"ltr\" function.\n\n for (let i = 0; i < range.set.length; ++i) {\n const comparators = range.set[i]\n\n let high = null\n let low = null\n\n comparators.forEach((comparator) => {\n if (comparator.semver === ANY) {\n comparator = new Comparator('>=0.0.0')\n }\n high = high || comparator\n low = low || comparator\n if (gtfn(comparator.semver, high.semver, options)) {\n high = comparator\n } else if (ltfn(comparator.semver, low.semver, options)) {\n low = comparator\n }\n })\n\n // If the edge version comparator has a operator then our version\n // isn't outside it\n if (high.operator === comp || high.operator === ecomp) {\n return false\n }\n\n // If the lowest version comparator has an operator and our version\n // is less than it then it isn't higher than the range\n if ((!low.operator || low.operator === comp) &&\n ltefn(version, low.semver)) {\n return false\n } else if (low.operator === ecomp && ltfn(version, low.semver)) {\n return false\n }\n }\n return true\n}\n\nmodule.exports = outside\n","'use strict'\n\n// Determine if version is greater than all the versions possible in the range.\nconst outside = require('./outside')\nconst gtr = (version, range, options) => outside(version, range, '>', options)\nmodule.exports = gtr\n","'use strict'\n\nconst outside = require('./outside')\n// Determine if version is less than all the versions possible in the range\nconst ltr = (version, range, options) => outside(version, range, '<', options)\nmodule.exports = ltr\n","'use strict'\n\nconst Range = require('../classes/range')\nconst intersects = (r1, r2, options) => {\n r1 = new Range(r1, options)\n r2 = new Range(r2, options)\n return r1.intersects(r2, options)\n}\nmodule.exports = intersects\n","'use strict'\n\n// given a set of versions and a range, create a \"simplified\" range\n// that includes the same versions that the original range does\n// If the original range is shorter than the simplified one, return that.\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\nmodule.exports = (versions, range, options) => {\n const set = []\n let first = null\n let prev = null\n const v = versions.sort((a, b) => compare(a, b, options))\n for (const version of v) {\n const included = satisfies(version, range, options)\n if (included) {\n prev = version\n if (!first) {\n first = version\n }\n } else {\n if (prev) {\n set.push([first, prev])\n }\n prev = null\n first = null\n }\n }\n if (first) {\n set.push([first, null])\n }\n\n const ranges = []\n for (const [min, max] of set) {\n if (min === max) {\n ranges.push(min)\n } else if (!max && min === v[0]) {\n ranges.push('*')\n } else if (!max) {\n ranges.push(`>=${min}`)\n } else if (min === v[0]) {\n ranges.push(`<=${max}`)\n } else {\n ranges.push(`${min} - ${max}`)\n }\n }\n const simplified = ranges.join(' || ')\n const original = typeof range.raw === 'string' ? range.raw : String(range)\n return simplified.length < original.length ? simplified : range\n}\n","'use strict'\n\nconst Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n// some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n// - If C is only the ANY comparator, return true\n// - Else if in prerelease mode, return false\n// - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n// - if in prerelease mode, return true\n// - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n// - If GT, and EQ does not satisfy GT, return true (null set)\n// - If LT, and EQ does not satisfy LT, return true (null set)\n// - If EQ satisfies every C, return true\n// - Else return false\n// - If GT\n// - If GT.semver is lower than any > or >= comp in C, return false\n// - If GT is >=, and GT.semver does not satisfy every C, return false\n// - If GT.semver has a prerelease, and not in prerelease mode\n// - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n// - If LT.semver is greater than any < or <= comp in C, return false\n// - If LT is <=, and LT.semver does not satisfy every C, return false\n// - If GT.semver has a prerelease, and not in prerelease mode\n// - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n if (sub === dom) {\n return true\n }\n\n sub = new Range(sub, options)\n dom = new Range(dom, options)\n let sawNonNull = false\n\n OUTER: for (const simpleSub of sub.set) {\n for (const simpleDom of dom.set) {\n const isSub = simpleSubset(simpleSub, simpleDom, options)\n sawNonNull = sawNonNull || isSub !== null\n if (isSub) {\n continue OUTER\n }\n }\n // the null set is a subset of everything, but null simple ranges in\n // a complex range should be ignored. so if we saw a non-null range,\n // then we know this isn't a subset, but if EVERY simple range was null,\n // then it is a subset.\n if (sawNonNull) {\n return false\n }\n }\n return true\n}\n\nconst minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]\nconst minimumVersion = [new Comparator('>=0.0.0')]\n\nconst simpleSubset = (sub, dom, options) => {\n if (sub === dom) {\n return true\n }\n\n if (sub.length === 1 && sub[0].semver === ANY) {\n if (dom.length === 1 && dom[0].semver === ANY) {\n return true\n } else if (options.includePrerelease) {\n sub = minimumVersionWithPreRelease\n } else {\n sub = minimumVersion\n }\n }\n\n if (dom.length === 1 && dom[0].semver === ANY) {\n if (options.includePrerelease) {\n return true\n } else {\n dom = minimumVersion\n }\n }\n\n const eqSet = new Set()\n let gt, lt\n for (const c of sub) {\n if (c.operator === '>' || c.operator === '>=') {\n gt = higherGT(gt, c, options)\n } else if (c.operator === '<' || c.operator === '<=') {\n lt = lowerLT(lt, c, options)\n } else {\n eqSet.add(c.semver)\n }\n }\n\n if (eqSet.size > 1) {\n return null\n }\n\n let gtltComp\n if (gt && lt) {\n gtltComp = compare(gt.semver, lt.semver, options)\n if (gtltComp > 0) {\n return null\n } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n return null\n }\n }\n\n // will iterate one or zero times\n for (const eq of eqSet) {\n if (gt && !satisfies(eq, String(gt), options)) {\n return null\n }\n\n if (lt && !satisfies(eq, String(lt), options)) {\n return null\n }\n\n for (const c of dom) {\n if (!satisfies(eq, String(c), options)) {\n return false\n }\n }\n\n return true\n }\n\n let higher, lower\n let hasDomLT, hasDomGT\n // if the subset has a prerelease, we need a comparator in the superset\n // with the same tuple and a prerelease, or it's not a subset\n let needDomLTPre = lt &&\n !options.includePrerelease &&\n lt.semver.prerelease.length ? lt.semver : false\n let needDomGTPre = gt &&\n !options.includePrerelease &&\n gt.semver.prerelease.length ? gt.semver : false\n // exception: <1.2.3-0 is the same as <1.2.3\n if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n needDomLTPre = false\n }\n\n for (const c of dom) {\n hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n if (gt) {\n if (needDomGTPre) {\n if (c.semver.prerelease && c.semver.prerelease.length &&\n c.semver.major === needDomGTPre.major &&\n c.semver.minor === needDomGTPre.minor &&\n c.semver.patch === needDomGTPre.patch) {\n needDomGTPre = false\n }\n }\n if (c.operator === '>' || c.operator === '>=') {\n higher = higherGT(gt, c, options)\n if (higher === c && higher !== gt) {\n return false\n }\n } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {\n return false\n }\n }\n if (lt) {\n if (needDomLTPre) {\n if (c.semver.prerelease && c.semver.prerelease.length &&\n c.semver.major === needDomLTPre.major &&\n c.semver.minor === needDomLTPre.minor &&\n c.semver.patch === needDomLTPre.patch) {\n needDomLTPre = false\n }\n }\n if (c.operator === '<' || c.operator === '<=') {\n lower = lowerLT(lt, c, options)\n if (lower === c && lower !== lt) {\n return false\n }\n } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {\n return false\n }\n }\n if (!c.operator && (lt || gt) && gtltComp !== 0) {\n return false\n }\n }\n\n // if there was a < or >, and nothing in the dom, then must be false\n // UNLESS it was limited by another range in the other direction.\n // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n if (gt && hasDomLT && !lt && gtltComp !== 0) {\n return false\n }\n\n if (lt && hasDomGT && !gt && gtltComp !== 0) {\n return false\n }\n\n // we needed a prerelease range in a specific tuple, but didn't get one\n // then this isn't a subset. eg >=1.2.3-pre is not a subset of >=1.0.0,\n // because it includes prereleases in the 1.2.3 tuple\n if (needDomGTPre || needDomLTPre) {\n return false\n }\n\n return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n if (!a) {\n return b\n }\n const comp = compare(a.semver, b.semver, options)\n return comp > 0 ? a\n : comp < 0 ? b\n : b.operator === '>' && a.operator === '>=' ? b\n : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n if (!a) {\n return b\n }\n const comp = compare(a.semver, b.semver, options)\n return comp < 0 ? a\n : comp > 0 ? b\n : b.operator === '<' && a.operator === '<=' ? b\n : a\n}\n\nmodule.exports = subset\n","'use strict'\n\n// just pre-load all the stuff that index.js lazily exports\nconst internalRe = require('./internal/re')\nconst constants = require('./internal/constants')\nconst SemVer = require('./classes/semver')\nconst identifiers = require('./internal/identifiers')\nconst parse = require('./functions/parse')\nconst valid = require('./functions/valid')\nconst clean = require('./functions/clean')\nconst inc = require('./functions/inc')\nconst diff = require('./functions/diff')\nconst major = require('./functions/major')\nconst minor = require('./functions/minor')\nconst patch = require('./functions/patch')\nconst prerelease = require('./functions/prerelease')\nconst compare = require('./functions/compare')\nconst rcompare = require('./functions/rcompare')\nconst compareLoose = require('./functions/compare-loose')\nconst compareBuild = require('./functions/compare-build')\nconst sort = require('./functions/sort')\nconst rsort = require('./functions/rsort')\nconst gt = require('./functions/gt')\nconst lt = require('./functions/lt')\nconst eq = require('./functions/eq')\nconst neq = require('./functions/neq')\nconst gte = require('./functions/gte')\nconst lte = require('./functions/lte')\nconst cmp = require('./functions/cmp')\nconst coerce = require('./functions/coerce')\nconst Comparator = require('./classes/comparator')\nconst Range = require('./classes/range')\nconst satisfies = require('./functions/satisfies')\nconst toComparators = require('./ranges/to-comparators')\nconst maxSatisfying = require('./ranges/max-satisfying')\nconst minSatisfying = require('./ranges/min-satisfying')\nconst minVersion = require('./ranges/min-version')\nconst validRange = require('./ranges/valid')\nconst outside = require('./ranges/outside')\nconst gtr = require('./ranges/gtr')\nconst ltr = require('./ranges/ltr')\nconst intersects = require('./ranges/intersects')\nconst simplifyRange = require('./ranges/simplify')\nconst subset = require('./ranges/subset')\nmodule.exports = {\n parse,\n valid,\n clean,\n inc,\n diff,\n major,\n minor,\n patch,\n prerelease,\n compare,\n rcompare,\n compareLoose,\n compareBuild,\n sort,\n rsort,\n gt,\n lt,\n eq,\n neq,\n gte,\n lte,\n cmp,\n coerce,\n Comparator,\n Range,\n satisfies,\n toComparators,\n maxSatisfying,\n minSatisfying,\n minVersion,\n validRange,\n outside,\n gtr,\n ltr,\n intersects,\n simplifyRange,\n subset,\n SemVer,\n re: internalRe.re,\n src: internalRe.src,\n tokens: internalRe.t,\n SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,\n RELEASE_TYPES: constants.RELEASE_TYPES,\n compareIdentifiers: identifiers.compareIdentifiers,\n rcompareIdentifiers: identifiers.rcompareIdentifiers,\n}\n","import { readFileSync } from 'node:fs';\nimport { dirname, join } from 'node:path';\n\nimport type { TransformerConfig } from '../types';\n\n/** Retrieves a JSON object from a file path, returning null if the file does not exist */\nexport const getJsonFromPath = <T>(baseDir: string, fileName: string): T => {\n const jsonPath = join(baseDir, fileName);\n\n try {\n const jsonContent = readFileSync(jsonPath, 'utf8');\n return JSON.parse(jsonContent) as T;\n } catch {\n throw new Error(`Error reading ${jsonPath}`);\n }\n};\n\nexport function getCodemodConfig(codemodPath: string): TransformerConfig {\n try {\n return getJsonFromPath<TransformerConfig>(dirname(codemodPath), 'config.json');\n } catch {\n throw new Error(`Error reading codemod config for ${codemodPath}`);\n }\n}\n","import { exec, execSync } from 'node:child_process';\nimport { existsSync } from 'node:fs';\nimport path from 'node:path';\nimport { promisify } from 'node:util';\n\nconst execAsync = promisify(exec);\n\n/**\n * Finds the root of the project by looking for the `.git` directory.\n */\nexport function findProjectRoot(): string {\n try {\n const gitRoot = execSync('git rev-parse --show-toplevel', {\n cwd: process.cwd(),\n encoding: 'utf8',\n stdio: ['ignore', 'pipe', 'ignore'],\n }).trim();\n\n return gitRoot && existsSync(gitRoot) ? gitRoot : '';\n } catch {\n return '';\n }\n}\n\n/**\n * Quick and dirty way of determining package roots based on\n * the presence of `package.json` files and them optimistically\n * containing a `@transferwise/components` string.\n * */\nexport async function findPackages(): Promise<string[]> {\n try {\n const { stdout } = await execAsync(\n [\n 'find ./',\n '-type f',\n '-name \"package.json\"',\n '-not -path \"*/node_modules/*\"',\n '|',\n 'xargs grep -l \"@transferwise/components\"',\n ].join(' '),\n {\n cwd: findProjectRoot(),\n encoding: 'utf8',\n },\n );\n\n const packages = stdout.trim().split('\\n').filter(Boolean).map(path.dirname);\n\n if (packages.length === 0) {\n throw new Error();\n }\n\n return packages;\n } catch {\n throw new Error('No suitable package roots found in the repository.');\n }\n}\n","/**\n * Renders an object as a table in terminal\n */\nexport const renderTable = (\n data: Record<string, Record<string, string>>,\n indexHeading = 'index',\n): void => {\n const firstEntry = Object.values(data)[0];\n if (!firstEntry) {\n console.info('No data to display');\n return;\n }\n\n const headings = [indexHeading, ...Object.keys(firstEntry)];\n const tableData: string[][] = [];\n\n Object.entries(data).forEach(([packageName, details]) => {\n tableData.push([packageName, ...Object.values(details)]);\n });\n\n const getDisplayWidth = (str: string): number => {\n // eslint-disable-next-line regexp/no-control-character\n return str.replace(/\\x1b\\[[0-9;]*m/gu, '').length;\n };\n\n const columnWidths = headings.map((heading, index) => {\n const maxDataWidth = Math.max(...tableData.map((row) => getDisplayWidth(row[index] || '')));\n return Math.max(heading.length, maxDataWidth);\n });\n\n const firstCellLine = '─'.repeat(columnWidths[0] + 2);\n const remainingLines = columnWidths.slice(1).map((width) => '─'.repeat(width + 2));\n const topSeparator = `┌${firstCellLine}┬${remainingLines.join('┬')}┐`;\n const midSeparator = `├${firstCellLine}┼${remainingLines.join('┼')}┤`;\n const endSeparator = `└${firstCellLine}┴${remainingLines.join('┴')}┘`;\n\n const formatRow = (cells: string[]) => {\n const formattedCells = cells.map((cell, index) => {\n const width = columnWidths[index];\n const displayWidth = getDisplayWidth(cell);\n const padding = width - displayWidth;\n return ` ${cell}${' '.repeat(Math.max(0, padding))} `;\n });\n return `│${formattedCells.join('│')}│`;\n };\n\n console.info(topSeparator);\n console.info(formatRow(headings));\n console.info(midSeparator);\n tableData.forEach((row) => {\n console.info(formatRow(row));\n });\n console.info(endSeparator);\n};\n","import { existsSync, readFileSync } from 'node:fs';\nimport { dirname, join, resolve } from 'node:path';\n\nimport semver from 'semver';\nimport type Spinnies from 'spinnies';\n\nimport { CONSOLE_ICONS } from '../../constants/common';\nimport { getCodemodConfig, getJsonFromPath } from './getCodemodConfig';\nimport { findProjectRoot } from './repository';\nimport { renderTable } from './table';\n\ninterface PackageJson {\n version?: string;\n dependencies?: Record<string, string>;\n peerDependencies?: Record<string, string>;\n [key: string]: Record<string, string> | string | undefined;\n}\n\n/**\n * Checks if the installed version satisfies the given version requirement.\n */\nfunction isVersionSatisfied(installedVersion: string, versionRequirement: string): boolean {\n if (!installedVersion) return false;\n\n if (semver.valid(installedVersion) && semver.satisfies(installedVersion, versionRequirement)) {\n return true;\n }\n\n const cleanVersion = semver.coerce(installedVersion);\n return cleanVersion ? semver.satisfies(cleanVersion.version, versionRequirement) : false;\n}\n\n/**\n * Retrieves the version of a dependency from node_modules of a specific package.\n */\nfunction getVersionFromNodeModules(packagePath: string, packageName: string): string {\n try {\n const nodeModulesPackageJson = join(packagePath, 'node_modules', packageName, 'package.json');\n if (!existsSync(nodeModulesPackageJson)) return '';\n\n const packageJson = JSON.parse(readFileSync(nodeModulesPackageJson, 'utf8')) as PackageJson;\n return packageJson.version || '';\n } catch {\n return '';\n }\n}\n\n/**\n * Finds the closest package.json by traversing up the directory tree\n */\nfunction findClosestPackageJson(currentPath: string): string | null {\n const resolvedPath = resolve(currentPath);\n const projectRoot = findProjectRoot();\n\n const packageJsonPath = join(resolvedPath, 'package.json');\n if (existsSync(packageJsonPath)) {\n return resolvedPath;\n }\n\n if (projectRoot && resolvedPath === projectRoot) {\n return null;\n }\n\n const parentPath = dirname(resolvedPath);\n if (parentPath === resolvedPath) {\n // Reached the root of the filesystem\n return null;\n }\n\n return findClosestPackageJson(parentPath);\n}\n\n/**\n * Assesses whether the given package meets the prerequisites defined in the codemod's config.json.\n */\nexport const assessPrerequisites = (packagePath: string, codemodPath: string): boolean => {\n try {\n const codemodConfig = getCodemodConfig(codemodPath);\n const resolvedPackagePath = resolve(process.cwd(), packagePath);\n\n const actualPackagePath = existsSync(join(resolvedPackagePath, 'package.json'))\n ? resolvedPackagePath\n : findClosestPackageJson(resolvedPackagePath);\n\n if (!actualPackagePath) {\n console.error(\n `${CONSOLE_ICONS.error} \\x1b[1mCould not find a package.json in or above ${packagePath}\\x1b[0m`,\n );\n return false;\n }\n\n if (actualPackagePath !== resolvedPackagePath) {\n console.info(\n `${CONSOLE_ICONS.info} Using package.json from ${actualPackagePath} for dependency checks`,\n );\n }\n\n const packageJson = getJsonFromPath<PackageJson>(actualPackagePath, 'package.json');\n\n if (!packageJson) {\n return false;\n }\n\n const { dependencies = {}, peerDependencies = {} } = packageJson;\n\n const comparisons: Record<string, Record<string, string>> = {};\n let isCompliant = true;\n\n if (codemodConfig?.prerequisites) {\n Object.entries(codemodConfig.prerequisites).forEach(([name, versionRequirement]) => {\n const nodeModulesVersion = getVersionFromNodeModules(actualPackagePath, name);\n const isDependencySatisfied = isVersionSatisfied(dependencies[name], versionRequirement);\n const isPeerDependencySatisfied = isVersionSatisfied(\n peerDependencies[name],\n versionRequirement,\n );\n const isInstalledSatisfied = isVersionSatisfied(nodeModulesVersion, versionRequirement);\n\n if ((!isDependencySatisfied && !isPeerDependencySatisfied) || !isInstalledSatisfied) {\n isCompliant = false;\n\n comparisons[name] = {\n required: versionRequirement,\n dependencies: isDependencySatisfied\n ? CONSOLE_ICONS.success\n : `${CONSOLE_ICONS.error} ${dependencies[name] || 'N/A'}`,\n peerDependencies: isPeerDependencySatisfied\n ? CONSOLE_ICONS.success\n : `${CONSOLE_ICONS.error} ${peerDependencies[name] || 'N/A'}`,\n node_modules: isInstalledSatisfied\n ? CONSOLE_ICONS.success\n : `${CONSOLE_ICONS.error} ${nodeModulesVersion || 'N/A'}`,\n };\n }\n });\n }\n\n if (!isCompliant) {\n console.info(\n `${CONSOLE_ICONS.error} \\x1b[31mPrerequisite check failed -\\x1b[0m \\x1b[2m${packagePath}\\x1b[0m`,\n );\n renderTable(comparisons, 'package');\n\n return false;\n }\n\n return true;\n } catch (error) {\n console.error('Cannot assess the state of prerequisites:', error);\n return false;\n }\n};\n\n/**\n * Batch prerequisite assessment across multiple target paths.\n * - Resolves each target to its effective package root (closest package.json)\n * - Deduplicates by package root and checks each unique root once\n * - Logs a concise summary; detailed table is logged by assessPrerequisites on failure\n */\nexport const assessPrerequisitesBatch = (\n targetPaths: string[],\n codemodPath: string,\n spinnies: Spinnies,\n): {\n allPassed: boolean;\n results: Map<string, boolean>;\n packageRootToTargets: Map<string, string[]>;\n failedPackageRoots: string[];\n failedTargetsNoPackage: string[];\n} => {\n const packageRootToTargets = new Map<string, string[]>();\n const failedTargetsNoPackage: string[] = [];\n\n for (const target of targetPaths) {\n const resolved = resolve(process.cwd(), target);\n const actual = existsSync(join(resolved, 'package.json'))\n ? resolved\n : findClosestPackageJson(resolved);\n if (actual) {\n const list = packageRootToTargets.get(actual) ?? [];\n list.push(target);\n packageRootToTargets.set(target, list);\n } else {\n failedTargetsNoPackage.push(target);\n }\n }\n\n let allPassed = true;\n const results = new Map<string, boolean>();\n\n for (const [pkgRoot] of packageRootToTargets.entries()) {\n // Run the existing single-check once per unique package root\n const passed = assessPrerequisites(pkgRoot, codemodPath);\n results.set(pkgRoot, passed);\n if (!passed) allPassed = false;\n }\n\n const totalTargets = targetPaths.length;\n const uniquePackages = packageRootToTargets.size;\n const passedCount = Array.from(results.values()).filter(Boolean).length;\n const failedCount = uniquePackages - passedCount;\n\n if (failedTargetsNoPackage.length || !passedCount) {\n if (!passedCount) {\n spinnies.fail('prerequisite-check', { text: 'All targets failed prerequisite checks' });\n } else {\n spinnies.fail('prerequisite-check', {\n text: `No package.json found for ${failedTargetsNoPackage.length} target${\n failedTargetsNoPackage.length !== 1 ? 's' : ''\n } (searching upwards to project root).`,\n });\n failedTargetsNoPackage.forEach((t) => console.error(`- ${t}`));\n }\n } else {\n const failedPart = failedCount > 0 ? `, \\x1b[31m${failedCount} failed\\x1b[0m` : '';\n\n spinnies.succeed('prerequisite-check', {\n text: `\\x1b[0mChecked ${totalTargets} target${totalTargets !== 1 ? 's' : ''} across ${uniquePackages} package${\n uniquePackages !== 1 ? 's' : ''\n }:\\x1b[0m \\x1b[32m${passedCount} passed\\x1b[0m${failedPart}`,\n });\n }\n\n const failedPackageRoots = Array.from(results.entries())\n .filter(([, ok]) => !ok)\n .map(([root]) => root);\n\n return { allPassed, results, packageRootToTargets, failedPackageRoots, failedTargetsNoPackage };\n};\n","import { existsSync, readdirSync, statSync } from 'node:fs';\nimport { join, relative } from 'node:path';\n\nimport { checkbox, confirm, input, search, select as list } from '@inquirer/prompts';\n\nimport type { CodemodOptions, TransformerConfig } from '../types';\n\n/**\n * if args are provided via CLI, log them to the console in\n * a formatted way matching Inquirer's style\n */\nexport const logToInquirer = (label: string, value?: string) => {\n const checkmark = '\\x1b[32m✔\\x1b[0m'; // Green checkmark\n const boldLabel = `\\x1b[1m${label}\\x1b[0m`; // Bold label\n const greenValue = `\\x1b[32m${value}\\x1b[0m`; // Green value\n\n console.info(`${checkmark} ${boldLabel} ${greenValue}`);\n};\n\n/**\n * Get all directories recursively for autocomplete\n */\nconst getDirectoryChoices = (rootPath: string, currentInput = '', maxDepth = 3): string[] => {\n const MAX_FILTERED_CHOICES = 10;\n const MAX_DEFAULT_CHOICES = 20;\n const SKIP_DIRS = new Set([\n 'node_modules',\n 'dist',\n 'build',\n 'coverage',\n '.git',\n '.next',\n '.nuxt',\n '.vscode',\n '.idea',\n ]);\n\n const choices = new Set<string>();\n choices.add('.');\n\n const scanDirectory = (dirPath: string, depth = 0): void => {\n if (depth >= maxDepth) return;\n\n try {\n const items = readdirSync(dirPath, { withFileTypes: true });\n\n for (const item of items) {\n if (!item.name.startsWith('.') && !SKIP_DIRS.has(item.name)) {\n if (item.isDirectory()) {\n const fullPath = join(dirPath, item.name);\n const relativePath = relative(rootPath, fullPath);\n\n if (relativePath && !relativePath.startsWith('..') && !relativePath.includes('..')) {\n choices.add(relativePath);\n scanDirectory(fullPath, depth + 1);\n }\n }\n }\n }\n } catch {\n // Silently ignore directories we can't read (permissions, etc.)\n }\n };\n\n scanDirectory(rootPath);\n\n const allChoices = Array.from(choices).sort();\n\n if (currentInput.trim()) {\n const inputLower = currentInput.toLowerCase();\n return allChoices\n .filter((choice) => choice.toLowerCase().includes(inputLower))\n .slice(0, MAX_FILTERED_CHOICES);\n }\n\n return allChoices.slice(0, MAX_DEFAULT_CHOICES);\n};\n\n/**\n * Lets user pick from available packages to run the codemod on\n */\nconst queryPackages = async (packages: string[]) => {\n const message = 'Path to run codemod on:';\n const nonRootPackages = packages.filter((pkg) => pkg !== '.' && pkg !== './');\n\n // root package only (single repo scenario)\n // This handles [\".\"], [\"./\"], and cases where only root exists\n if (packages.length === 1 && (packages[0] === '.' || packages[0] === './')) {\n const useCustomPath = await confirm({\n message: 'Do you want to target a specific folder instead of the entire project?',\n default: false,\n });\n\n if (useCustomPath) {\n const customPath = await search({\n message: 'Enter the folder path (relative to project root):',\n source: async (searchInput) => {\n const rootPath = process.cwd();\n const choices = getDirectoryChoices(rootPath, searchInput || '');\n\n return choices.map((choice) => ({\n name: choice === '.' ? '. (entire project)' : choice,\n value: choice,\n description:\n choice === '.' ? 'Target the entire project' : `Target ${choice} directory`,\n }));\n },\n validate: (path) => {\n if (!path?.trim()) return 'Path cannot be empty';\n const fullPath = join(process.cwd(), path);\n if (!existsSync(fullPath)) return 'Folder does not exist';\n if (!statSync(fullPath).isDirectory()) return 'Path must be a directory';\n return true;\n },\n });\n\n logToInquirer(message, customPath);\n return [customPath];\n }\n\n logToInquirer(message, packages[0] === './' ? '.' : packages[0]);\n return [packages[0] === './' ? '.' : packages[0]];\n }\n\n // multiple non-root packages (monorepo scenario)\n if (nonRootPackages.length >= 1) {\n return checkbox({\n required: true,\n message: 'Select packages to transform:',\n choices: nonRootPackages.map((file) => ({\n name: file,\n value: file,\n checked: true,\n })),\n });\n }\n\n return ['.'];\n};\n\n/**\n * Determine user choice between CLI arg and Inquirer prompt: codemod\n */\nconst determineTransformer = async ({\n candidate,\n transformFiles,\n}: {\n candidate: string;\n transformFiles: string[];\n}): Promise<string> => {\n const codemodMessage = 'Select codemod to run:';\n\n if (candidate && transformFiles.includes(candidate)) {\n logToInquirer(codemodMessage, candidate);\n return candidate;\n }\n\n return list({\n message: codemodMessage,\n choices: transformFiles.map((file) => ({ name: file, value: file })),\n });\n};\n\n/**\n * Determine user choice between CLI arg and Inquirer prompt: paths/packages to process\n */\nconst determinePaths = async ({\n candidate,\n root,\n packages,\n}: {\n candidate: string;\n root: string;\n packages: string[];\n}): Promise<string[]> => {\n const targetPaths = [];\n\n if (candidate && existsSync(join(root, candidate))) {\n logToInquirer('Path to run codemod on', candidate);\n targetPaths.push(candidate);\n }\n\n if (!targetPaths.length) {\n const packagesToProcess = await queryPackages(packages);\n targetPaths.push(...(packagesToProcess ?? []));\n }\n\n return targetPaths;\n};\n\n/**\n * Determine user choice between CLI arg and Inquirer prompt: dry mode\n */\nconst determineIsDryMode = async (args: string[]) => {\n const message = 'Run in dry mode (no changes written to files)?';\n if (args.includes('--dry') || args.includes('--dry-run')) {\n logToInquirer(message, 'Yes');\n return true;\n }\n\n return confirm({ message, default: false });\n};\n\n/**\n * Determine user choice between CLI arg and Inquirer prompt: print to CLI\n */\nconst determineIsPrint = async (args: string[]) => {\n const message = 'Print transformed source to console?';\n\n if (args.includes('--print')) {\n logToInquirer(message, 'Yes');\n return true;\n }\n\n return confirm({ message, default: false });\n};\n\nconst ALWAYS_IGNORED_FOLDERS = ['node_modules/**', '.next/**'];\n\n/**\n * Determine user choice between CLI arg and Inquirer prompt: ignore patterns\n */\nconst determineIgnorePatterns = async (args: string[]) => {\n const message = 'Enter ignore pattern(s) (comma separated) or leave empty:';\n const ignorePatternIndex = args.findIndex((arg) => arg === '--ignore-pattern');\n\n let ignorePattern: string | undefined;\n\n if (ignorePatternIndex !== -1 && args.length > ignorePatternIndex + 1) {\n ignorePattern = args[ignorePatternIndex + 1];\n }\n\n let userPatterns: string;\n if (ignorePattern) {\n logToInquirer(message, ignorePattern);\n userPatterns = ignorePattern;\n } else {\n userPatterns = await input({\n message,\n validate: () => true,\n });\n }\n\n const allPatterns = [...ALWAYS_IGNORED_FOLDERS];\n if (userPatterns?.trim()) {\n allPatterns.push(...userPatterns.split(',').map((p) => p.trim()));\n }\n\n return allPatterns.join(',');\n};\n\n/**\n * Determine user choice between CLI arg and Inquirer prompt: gitignore\n */\nconst determineGitIgnore = async (args: string[]) => {\n const message = 'Respect .gitignore files?';\n\n if (args.includes('--gitignore')) {\n logToInquirer(message, 'Yes');\n return true;\n }\n\n if (args.includes('--no-gitignore')) {\n logToInquirer(message, 'No');\n return false;\n }\n\n return confirm({ message, default: true });\n};\n\nexport interface OptionsParams {\n transformFiles: string[];\n packages: string[];\n root: string;\n transformerType: TransformerConfig['type'];\n preselectedTransformFile?: string;\n}\n\nasync function getOptions({\n transformFiles,\n transformerType,\n packages,\n root,\n preselectedTransformFile,\n}: OptionsParams): Promise<CodemodOptions> {\n const args = process.argv.slice(2);\n\n if (preselectedTransformFile && args[0] === preselectedTransformFile) {\n args.shift();\n }\n\n const transformFile =\n preselectedTransformFile ||\n (await determineTransformer({ candidate: args[0] ?? '', transformFiles }));\n\n const pathCandidate = preselectedTransformFile ? (args[0] ?? '') : (args[1] ?? '');\n const targetPaths = await determinePaths({\n candidate: pathCandidate,\n root,\n packages,\n });\n\n const isDry = transformerType === 'jscodeshift' ? await determineIsDryMode(args) : false;\n const isPrint = transformerType === 'jscodeshift' ? await determineIsPrint(args) : false;\n const ignorePatterns =\n transformerType === 'claude'\n ? ALWAYS_IGNORED_FOLDERS.join(',')\n : await determineIgnorePatterns(args);\n const useGitIgnore = transformerType === 'jscodeshift' ? await determineGitIgnore(args) : true;\n\n return {\n transformFile,\n targetPaths,\n isDry,\n isPrint,\n ignorePatterns,\n useGitIgnore,\n };\n}\n\nexport default getOptions;\n","import { promises as fs, readdirSync } from 'node:fs';\nimport path from 'node:path';\n\ninterface TransformModule {\n default: {\n default: unknown;\n };\n}\n\n/**\n * Get list of available transform names without loading them\n */\nexport function listTransforms(transformsDir: string): string[] {\n const transformers = readdirSync(transformsDir);\n return transformers;\n}\n\nasync function loadTransformModules(transformsDir: string) {\n let transformModules: Record<string, unknown> = {};\n const transformers = await fs.readdir(transformsDir);\n\n const transformFiles = await Promise.all(\n transformers.map(async (name) => {\n const transformPath = path.join(transformsDir, name, 'transformer.js');\n const transformModule = (await import(transformPath)) as TransformModule;\n transformModules = { ...transformModules, [name]: transformModule.default.default };\n return name;\n }),\n );\n\n return { transformModules, transformFiles };\n}\n\nexport default loadTransformModules;\n","import fs from 'node:fs/promises';\nimport path from 'node:path';\n\nconst REPORT_PATH = path.resolve(process.cwd(), 'codemod-report.txt');\n\nconst reportManualReview = async (filePath: string, message: string): Promise<void> => {\n const lineMatch = /at line (\\d+)/u.exec(message);\n const lineNumber = lineMatch?.[1];\n\n const cleanMessage = message.replace(/ at line \\d+/u, '');\n const lineInfo = lineNumber ? `:${lineNumber}` : '';\n\n let isFirstEntry = false;\n let currentTransform: string | undefined;\n\n try {\n await fs.access(REPORT_PATH);\n const existingContent = await fs.readFile(REPORT_PATH, 'utf8');\n isFirstEntry = existingContent.trim() === '';\n } catch {\n isFirstEntry = true;\n }\n\n // Try to determine the current transform from the process arguments\n const args = process.argv;\n const transformIndex = args.findIndex((arg) => arg.endsWith('transformer.js'));\n if (transformIndex >= 0) {\n const transformPath = args[transformIndex];\n const transformDir = path.dirname(transformPath);\n currentTransform = path.basename(transformDir);\n }\n\n const content = `[${filePath}${lineInfo}] ${cleanMessage}\\n`;\n await fs.appendFile(REPORT_PATH, content, 'utf8');\n};\n\nexport default reportManualReview;\n","import { confirm, input, select } from '@inquirer/prompts';\n\nimport type { TransformerPrompt } from '../types';\nimport { getCodemodConfig } from './getCodemodConfig';\n\ntype Answers = Record<string, string | boolean>;\n\nasync function askPrompt(p: TransformerPrompt): Promise<string | boolean> {\n switch (p.type) {\n case 'select':\n return select({\n message: p.message,\n choices: (p.choices ?? []).map((c) => ({ name: c.name, value: c.value })),\n default: p.default as string | undefined,\n });\n case 'confirm':\n return confirm({\n message: p.message,\n default: typeof p.default === 'boolean' ? p.default : false,\n });\n case 'input':\n default:\n return input({\n message: p.message,\n default: (p.default as string) ?? '',\n });\n }\n}\n\nexport async function runTransformPrompts(codemodPath: string): Promise<Answers> {\n const config = getCodemodConfig(codemodPath);\n if (!config?.prompts?.length) return {};\n\n const answers: Answers = {};\n\n for (const prompt of config.prompts) {\n try {\n answers[prompt.key] = await askPrompt(prompt);\n } catch (error) {\n console.warn(\n `Failed to execute prompt \"${prompt.key}\": ${error instanceof Error ? error.message : String(error)}`,\n );\n\n if (prompt.default !== undefined) {\n console.info(`Using default value for \"${prompt.key}\": ${prompt.default}`);\n answers[prompt.key] = prompt.default;\n } else {\n console.info(`Skipping prompt \"${prompt.key}\" - no default value available`);\n }\n }\n }\n return answers;\n}\n","import fs from 'node:fs';\nimport path from 'node:path';\n\nimport { CONSOLE_ICONS } from '../../constants/common';\n\nconst CLAUDE_SETTINGS_FILE = '.claude/settings.json';\n\nexport function validateClaudeConfig(): void {\n const claudeSettingsPath = path.resolve(process.env.HOME || '', CLAUDE_SETTINGS_FILE);\n\n if (!fs.existsSync(claudeSettingsPath)) {\n throw new Error(\n `${CONSOLE_ICONS.error} Claude Code is not configured. Expected settings file at: ${claudeSettingsPath}. Please follow the setup instructions:\\n` +\n ` https://transferwise.atlassian.net/wiki/spaces/GenAIP/pages/3709765113/Configuring+Claude+Code\\n`,\n );\n }\n}\n"],"x_google_ignoreList":[0,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],"mappings":";;;;;;;;;;;;;CAIA,MAAM,sBAAsB;CAE5B,MAAM,aAAa;CACnB,MAAM,mBAAmB,OAAO,oBACL;CAG3B,MAAM,4BAA4B;CAIlC,MAAM,wBAAwB,aAAa;CAE3C,MAAM,gBAAgB;EACpB;EACA;EACA;EACA;EACA;EACA;EACA;EACD;AAED,QAAO,UAAU;EACf;EACA;EACA;EACA;EACA;EACA;EACA,yBAAyB;EACzB,YAAY;EACb;;;;;;CClCD,MAAM,QACJ,OAAO,YAAY,YACnB,QAAQ,OACR,QAAQ,IAAI,cACZ,cAAc,KAAK,QAAQ,IAAI,WAAW,IACvC,GAAG,SAAS,QAAQ,MAAM,UAAU,GAAG,KAAK,SACvC;AAEV,QAAO,UAAU;;;;;;CCRjB,MAAM,EACJ,2BACA,uBACA;CAEF,MAAM;AACN,WAAU,OAAO,UAAU,EAAE;CAG7B,MAAM,KAAK,QAAQ,KAAK,EAAE;CAC1B,MAAM,SAAS,QAAQ,SAAS,EAAE;CAClC,MAAM,MAAM,QAAQ,MAAM,EAAE;CAC5B,MAAM,UAAU,QAAQ,UAAU,EAAE;CACpC,MAAM,IAAI,QAAQ,IAAI,EAAE;CACxB,IAAI,IAAI;CAER,MAAM,mBAAmB;CAQzB,MAAM,wBAAwB;EAC5B,CAAC,OAAO,EAAE;EACV,CAAC,OAAO,WAAW;EACnB,CAAC,kBAAkB,sBAAsB;EAC1C;CAED,MAAM,iBAAiB,UAAU;AAC/B,OAAK,MAAM,CAAC,OAAO,QAAQ,sBACzB,SAAQ,MACL,MAAM,GAAG,MAAM,GAAG,CAAC,KAAK,GAAG,MAAM,KAAK,IAAI,GAAG,CAC7C,MAAM,GAAG,MAAM,GAAG,CAAC,KAAK,GAAG,MAAM,KAAK,IAAI,GAAG;AAElD,SAAO;;CAGT,MAAM,eAAe,MAAM,OAAO,aAAa;EAC7C,MAAM,OAAO,cAAc,MAAM;EACjC,MAAM,QAAQ;AACd,QAAM,MAAM,OAAO,MAAM;AACzB,IAAE,QAAQ;AACV,MAAI,SAAS;AACb,UAAQ,SAAS;AACjB,KAAG,SAAS,IAAI,OAAO,OAAO,WAAW,MAAM,OAAU;AACzD,SAAO,SAAS,IAAI,OAAO,MAAM,WAAW,MAAM,OAAU;;AAS9D,aAAY,qBAAqB,cAAc;AAC/C,aAAY,0BAA0B,OAAO;AAM7C,aAAY,wBAAwB,gBAAgB,iBAAiB,GAAG;AAKxE,aAAY,eAAe,IAAI,IAAI,EAAE,mBAAmB,OACjC,IAAI,EAAE,mBAAmB,OACzB,IAAI,EAAE,mBAAmB,GAAG;AAEnD,aAAY,oBAAoB,IAAI,IAAI,EAAE,wBAAwB,OACtC,IAAI,EAAE,wBAAwB,OAC9B,IAAI,EAAE,wBAAwB,GAAG;AAO7D,aAAY,wBAAwB,MAAM,IAAI,EAAE,sBAC/C,GAAG,IAAI,EAAE,mBAAmB,GAAG;AAEhC,aAAY,6BAA6B,MAAM,IAAI,EAAE,sBACpD,GAAG,IAAI,EAAE,wBAAwB,GAAG;AAMrC,aAAY,cAAc,QAAQ,IAAI,EAAE,sBACvC,QAAQ,IAAI,EAAE,sBAAsB,MAAM;AAE3C,aAAY,mBAAmB,SAAS,IAAI,EAAE,2BAC7C,QAAQ,IAAI,EAAE,2BAA2B,MAAM;AAKhD,aAAY,mBAAmB,GAAG,iBAAiB,GAAG;AAMtD,aAAY,SAAS,UAAU,IAAI,EAAE,iBACpC,QAAQ,IAAI,EAAE,iBAAiB,MAAM;AAWtC,aAAY,aAAa,KAAK,IAAI,EAAE,eACjC,IAAI,EAAE,YAAY,GACnB,IAAI,EAAE,OAAO,GAAG;AAElB,aAAY,QAAQ,IAAI,IAAI,EAAE,WAAW,GAAG;AAK5C,aAAY,cAAc,WAAW,IAAI,EAAE,oBACxC,IAAI,EAAE,iBAAiB,GACxB,IAAI,EAAE,OAAO,GAAG;AAElB,aAAY,SAAS,IAAI,IAAI,EAAE,YAAY,GAAG;AAE9C,aAAY,QAAQ,eAAe;AAKnC,aAAY,yBAAyB,GAAG,IAAI,EAAE,wBAAwB,UAAU;AAChF,aAAY,oBAAoB,GAAG,IAAI,EAAE,mBAAmB,UAAU;AAEtE,aAAY,eAAe,YAAY,IAAI,EAAE,kBAAkB,UAClC,IAAI,EAAE,kBAAkB,UACxB,IAAI,EAAE,kBAAkB,MAC5B,IAAI,EAAE,YAAY,IACtB,IAAI,EAAE,OAAO,OACR;AAE1B,aAAY,oBAAoB,YAAY,IAAI,EAAE,uBAAuB,UACvC,IAAI,EAAE,uBAAuB,UAC7B,IAAI,EAAE,uBAAuB,MACjC,IAAI,EAAE,iBAAiB,IAC3B,IAAI,EAAE,OAAO,OACR;AAE/B,aAAY,UAAU,IAAI,IAAI,EAAE,MAAM,MAAM,IAAI,EAAE,aAAa,GAAG;AAClE,aAAY,eAAe,IAAI,IAAI,EAAE,MAAM,MAAM,IAAI,EAAE,kBAAkB,GAAG;AAI5E,aAAY,eAAe,oBACD,0BAA0B,iBACtB,0BAA0B,mBAC1B,0BAA0B,MAAM;AAC9D,aAAY,UAAU,GAAG,IAAI,EAAE,aAAa,cAAc;AAC1D,aAAY,cAAc,IAAI,EAAE,eAClB,MAAM,IAAI,EAAE,YAAY,OAClB,IAAI,EAAE,OAAO,gBACJ;AAC7B,aAAY,aAAa,IAAI,EAAE,SAAS,KAAK;AAC7C,aAAY,iBAAiB,IAAI,EAAE,aAAa,KAAK;AAIrD,aAAY,aAAa,UAAU;AAEnC,aAAY,aAAa,SAAS,IAAI,EAAE,WAAW,OAAO,KAAK;AAC/D,SAAQ,mBAAmB;AAE3B,aAAY,SAAS,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,aAAa,GAAG;AAClE,aAAY,cAAc,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,kBAAkB,GAAG;AAI5E,aAAY,aAAa,UAAU;AAEnC,aAAY,aAAa,SAAS,IAAI,EAAE,WAAW,OAAO,KAAK;AAC/D,SAAQ,mBAAmB;AAE3B,aAAY,SAAS,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,aAAa,GAAG;AAClE,aAAY,cAAc,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,kBAAkB,GAAG;AAG5E,aAAY,mBAAmB,IAAI,IAAI,EAAE,MAAM,OAAO,IAAI,EAAE,YAAY,OAAO;AAC/E,aAAY,cAAc,IAAI,IAAI,EAAE,MAAM,OAAO,IAAI,EAAE,WAAW,OAAO;AAIzE,aAAY,kBAAkB,SAAS,IAAI,EAAE,MAC5C,OAAO,IAAI,EAAE,YAAY,GAAG,IAAI,EAAE,aAAa,IAAI,KAAK;AACzD,SAAQ,wBAAwB;AAMhC,aAAY,eAAe,SAAS,IAAI,EAAE,aAAa,aAEhC,IAAI,EAAE,aAAa,QACf;AAE3B,aAAY,oBAAoB,SAAS,IAAI,EAAE,kBAAkB,aAErC,IAAI,EAAE,kBAAkB,QACpB;AAGhC,aAAY,QAAQ,kBAAkB;AAEtC,aAAY,QAAQ,4BAA4B;AAChD,aAAY,WAAW,8BAA8B;;;;;;CC3NrD,MAAM,cAAc,OAAO,OAAO,EAAE,OAAO,MAAM,CAAC;CAClD,MAAM,YAAY,OAAO,OAAO,EAAG,CAAC;CACpC,MAAM,gBAAe,YAAW;AAC9B,MAAI,CAAC,QACH,QAAO;AAGT,MAAI,OAAO,YAAY,SACrB,QAAO;AAGT,SAAO;;AAET,QAAO,UAAU;;;;;;CCdjB,MAAM,UAAU;CAChB,MAAM,sBAAsB,GAAG,MAAM;AACnC,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SACxC,QAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK;EAGpC,MAAM,OAAO,QAAQ,KAAK,EAAE;EAC5B,MAAM,OAAO,QAAQ,KAAK,EAAE;AAE5B,MAAI,QAAQ,MAAM;AAChB,OAAI,CAAC;AACL,OAAI,CAAC;;AAGP,SAAO,MAAM,IAAI,IACZ,QAAQ,CAAC,OAAQ,KACjB,QAAQ,CAAC,OAAQ,IAClB,IAAI,IAAI,KACR;;CAGN,MAAM,uBAAuB,GAAG,MAAM,mBAAmB,GAAG,EAAE;AAE9D,QAAO,UAAU;EACf;EACA;EACD;;;;;;CC1BD,MAAM;CACN,MAAM,EAAE,YAAY;CACpB,MAAM,EAAE,QAAQ,IAAI;CAEpB,MAAM;CACN,MAAM,EAAE;CACR,IAAM,SAAN,MAAM,OAAO;EACX,YAAa,SAAS,SAAS;AAC7B,aAAU,aAAa,QAAQ;AAE/B,OAAI,mBAAmB,OACrB,KAAI,QAAQ,UAAU,CAAC,CAAC,QAAQ,SAC9B,QAAQ,sBAAsB,CAAC,CAAC,QAAQ,kBACxC,QAAO;OAEP,WAAU,QAAQ;YAEX,OAAO,YAAY,SAC5B,OAAM,IAAI,UAAU,gDAAgD,OAAO,QAAQ,IAAI;AAGzF,OAAI,QAAQ,SAAS,WACnB,OAAM,IAAI,UACR,0BAA0B,WAAW,aACtC;AAGH,SAAM,UAAU,SAAS,QAAQ;AACjC,QAAK,UAAU;AACf,QAAK,QAAQ,CAAC,CAAC,QAAQ;AAGvB,QAAK,oBAAoB,CAAC,CAAC,QAAQ;GAEnC,MAAM,IAAI,QAAQ,MAAM,CAAC,MAAM,QAAQ,QAAQ,GAAG,EAAE,SAAS,GAAG,EAAE,MAAM;AAExE,OAAI,CAAC,EACH,OAAM,IAAI,UAAU,oBAAoB,UAAU;AAGpD,QAAK,MAAM;AAGX,QAAK,QAAQ,CAAC,EAAE;AAChB,QAAK,QAAQ,CAAC,EAAE;AAChB,QAAK,QAAQ,CAAC,EAAE;AAEhB,OAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,EAChD,OAAM,IAAI,UAAU,wBAAwB;AAG9C,OAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,EAChD,OAAM,IAAI,UAAU,wBAAwB;AAG9C,OAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,EAChD,OAAM,IAAI,UAAU,wBAAwB;AAI9C,OAAI,CAAC,EAAE,GACL,MAAK,aAAa,EAAE;OAEpB,MAAK,aAAa,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,OAAO;AAC5C,QAAI,WAAW,KAAK,GAAG,EAAE;KACvB,MAAM,MAAM,CAAC;AACb,SAAI,OAAO,KAAK,MAAM,iBACpB,QAAO;;AAGX,WAAO;KACP;AAGJ,QAAK,QAAQ,EAAE,KAAK,EAAE,GAAG,MAAM,IAAI,GAAG,EAAE;AACxC,QAAK,QAAQ;;EAGf,SAAU;AACR,QAAK,UAAU,GAAG,KAAK,MAAM,GAAG,KAAK,MAAM,GAAG,KAAK;AACnD,OAAI,KAAK,WAAW,OAClB,MAAK,WAAW,IAAI,KAAK,WAAW,KAAK,IAAI;AAE/C,UAAO,KAAK;;EAGd,WAAY;AACV,UAAO,KAAK;;EAGd,QAAS,OAAO;AACd,SAAM,kBAAkB,KAAK,SAAS,KAAK,SAAS,MAAM;AAC1D,OAAI,EAAE,iBAAiB,SAAS;AAC9B,QAAI,OAAO,UAAU,YAAY,UAAU,KAAK,QAC9C,QAAO;AAET,YAAQ,IAAI,OAAO,OAAO,KAAK,QAAQ;;AAGzC,OAAI,MAAM,YAAY,KAAK,QACzB,QAAO;AAGT,UAAO,KAAK,YAAY,MAAM,IAAI,KAAK,WAAW,MAAM;;EAG1D,YAAa,OAAO;AAClB,OAAI,EAAE,iBAAiB,QACrB,SAAQ,IAAI,OAAO,OAAO,KAAK,QAAQ;AAGzC,OAAI,KAAK,QAAQ,MAAM,MACrB,QAAO;AAET,OAAI,KAAK,QAAQ,MAAM,MACrB,QAAO;AAET,OAAI,KAAK,QAAQ,MAAM,MACrB,QAAO;AAET,OAAI,KAAK,QAAQ,MAAM,MACrB,QAAO;AAET,OAAI,KAAK,QAAQ,MAAM,MACrB,QAAO;AAET,OAAI,KAAK,QAAQ,MAAM,MACrB,QAAO;AAET,UAAO;;EAGT,WAAY,OAAO;AACjB,OAAI,EAAE,iBAAiB,QACrB,SAAQ,IAAI,OAAO,OAAO,KAAK,QAAQ;AAIzC,OAAI,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,OAC9C,QAAO;YACE,CAAC,KAAK,WAAW,UAAU,MAAM,WAAW,OACrD,QAAO;YACE,CAAC,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,OACtD,QAAO;GAGT,IAAI,IAAI;AACR,MAAG;IACD,MAAM,IAAI,KAAK,WAAW;IAC1B,MAAM,IAAI,MAAM,WAAW;AAC3B,UAAM,sBAAsB,GAAG,GAAG,EAAE;AACpC,QAAI,MAAM,UAAa,MAAM,OAC3B,QAAO;aACE,MAAM,OACf,QAAO;aACE,MAAM,OACf,QAAO;aACE,MAAM,EACf;QAEA,QAAO,mBAAmB,GAAG,EAAE;YAE1B,EAAE;;EAGb,aAAc,OAAO;AACnB,OAAI,EAAE,iBAAiB,QACrB,SAAQ,IAAI,OAAO,OAAO,KAAK,QAAQ;GAGzC,IAAI,IAAI;AACR,MAAG;IACD,MAAM,IAAI,KAAK,MAAM;IACrB,MAAM,IAAI,MAAM,MAAM;AACtB,UAAM,iBAAiB,GAAG,GAAG,EAAE;AAC/B,QAAI,MAAM,UAAa,MAAM,OAC3B,QAAO;aACE,MAAM,OACf,QAAO;aACE,MAAM,OACf,QAAO;aACE,MAAM,EACf;QAEA,QAAO,mBAAmB,GAAG,EAAE;YAE1B,EAAE;;EAKb,IAAK,SAAS,YAAY,gBAAgB;AACxC,OAAI,QAAQ,WAAW,MAAM,EAAE;AAC7B,QAAI,CAAC,cAAc,mBAAmB,MACpC,OAAM,IAAI,MAAM,kDAAkD;AAGpE,QAAI,YAAY;KACd,MAAM,QAAQ,IAAI,aAAa,MAAM,KAAK,QAAQ,QAAQ,GAAG,EAAE,mBAAmB,GAAG,EAAE,YAAY;AACnG,SAAI,CAAC,SAAS,MAAM,OAAO,WACzB,OAAM,IAAI,MAAM,uBAAuB,aAAa;;;AAK1D,WAAQ,SAAR;IACE,KAAK;AACH,UAAK,WAAW,SAAS;AACzB,UAAK,QAAQ;AACb,UAAK,QAAQ;AACb,UAAK;AACL,UAAK,IAAI,OAAO,YAAY,eAAe;AAC3C;IACF,KAAK;AACH,UAAK,WAAW,SAAS;AACzB,UAAK,QAAQ;AACb,UAAK;AACL,UAAK,IAAI,OAAO,YAAY,eAAe;AAC3C;IACF,KAAK;AAIH,UAAK,WAAW,SAAS;AACzB,UAAK,IAAI,SAAS,YAAY,eAAe;AAC7C,UAAK,IAAI,OAAO,YAAY,eAAe;AAC3C;IAGF,KAAK;AACH,SAAI,KAAK,WAAW,WAAW,EAC7B,MAAK,IAAI,SAAS,YAAY,eAAe;AAE/C,UAAK,IAAI,OAAO,YAAY,eAAe;AAC3C;IACF,KAAK;AACH,SAAI,KAAK,WAAW,WAAW,EAC7B,OAAM,IAAI,MAAM,WAAW,KAAK,IAAI,sBAAsB;AAE5D,UAAK,WAAW,SAAS;AACzB;IAEF,KAAK;AAKH,SACE,KAAK,UAAU,KACf,KAAK,UAAU,KACf,KAAK,WAAW,WAAW,EAE3B,MAAK;AAEP,UAAK,QAAQ;AACb,UAAK,QAAQ;AACb,UAAK,aAAa,EAAE;AACpB;IACF,KAAK;AAKH,SAAI,KAAK,UAAU,KAAK,KAAK,WAAW,WAAW,EACjD,MAAK;AAEP,UAAK,QAAQ;AACb,UAAK,aAAa,EAAE;AACpB;IACF,KAAK;AAKH,SAAI,KAAK,WAAW,WAAW,EAC7B,MAAK;AAEP,UAAK,aAAa,EAAE;AACpB;IAGF,KAAK,OAAO;KACV,MAAM,OAAO,OAAO,eAAe,GAAG,IAAI;AAE1C,SAAI,KAAK,WAAW,WAAW,EAC7B,MAAK,aAAa,CAAC,KAAK;UACnB;MACL,IAAI,IAAI,KAAK,WAAW;AACxB,aAAO,EAAE,KAAK,EACZ,KAAI,OAAO,KAAK,WAAW,OAAO,UAAU;AAC1C,YAAK,WAAW;AAChB,WAAI;;AAGR,UAAI,MAAM,IAAI;AAEZ,WAAI,eAAe,KAAK,WAAW,KAAK,IAAI,IAAI,mBAAmB,MACjE,OAAM,IAAI,MAAM,wDAAwD;AAE1E,YAAK,WAAW,KAAK,KAAK;;;AAG9B,SAAI,YAAY;MAGd,IAAI,aAAa,CAAC,YAAY,KAAK;AACnC,UAAI,mBAAmB,MACrB,cAAa,CAAC,WAAW;AAE3B,UAAI,mBAAmB,KAAK,WAAW,IAAI,WAAW,KAAK,GACzD;WAAI,MAAM,KAAK,WAAW,GAAG,CAC3B,MAAK,aAAa;YAGpB,MAAK,aAAa;;AAGtB;;IAEF,QACE,OAAM,IAAI,MAAM,+BAA+B,UAAU;;AAE7D,QAAK,MAAM,KAAK,QAAQ;AACxB,OAAI,KAAK,MAAM,OACb,MAAK,OAAO,IAAI,KAAK,MAAM,KAAK,IAAI;AAEtC,UAAO;;;AAIX,QAAO,UAAU;;;;;;CC1UjB,MAAM;CACN,MAAM,SAAS,SAAS,SAAS,cAAc,UAAU;AACvD,MAAI,mBAAmB,OACrB,QAAO;AAET,MAAI;AACF,UAAO,IAAI,OAAO,SAAS,QAAQ;WAC5B,IAAI;AACX,OAAI,CAAC,YACH,QAAO;AAET,SAAM;;;AAIV,QAAO,UAAU;;;;;;CCfjB,MAAM;CACN,MAAM,SAAS,SAAS,YAAY;EAClC,MAAM,IAAI,MAAM,SAAS,QAAQ;AACjC,SAAO,IAAI,EAAE,UAAU;;AAEzB,QAAO,UAAU;;;;;;CCLjB,MAAM;CACN,MAAM,SAAS,SAAS,YAAY;EAClC,MAAM,IAAI,MAAM,QAAQ,MAAM,CAAC,QAAQ,UAAU,GAAG,EAAE,QAAQ;AAC9D,SAAO,IAAI,EAAE,UAAU;;AAEzB,QAAO,UAAU;;;;;;CCLjB,MAAM;CAEN,MAAM,OAAO,SAAS,SAAS,SAAS,YAAY,mBAAmB;AACrE,MAAI,OAAQ,YAAa,UAAU;AACjC,oBAAiB;AACjB,gBAAa;AACb,aAAU;;AAGZ,MAAI;AACF,UAAO,IAAI,OACT,mBAAmB,SAAS,QAAQ,UAAU,SAC9C,QACD,CAAC,IAAI,SAAS,YAAY,eAAe,CAAC;WACpC,IAAI;AACX,UAAO;;;AAGX,QAAO,UAAU;;;;;;CClBjB,MAAM;CAEN,MAAM,QAAQ,UAAU,aAAa;EACnC,MAAM,KAAK,MAAM,UAAU,MAAM,KAAK;EACtC,MAAM,KAAK,MAAM,UAAU,MAAM,KAAK;EACtC,MAAM,aAAa,GAAG,QAAQ,GAAG;AAEjC,MAAI,eAAe,EACjB,QAAO;EAGT,MAAM,WAAW,aAAa;EAC9B,MAAM,cAAc,WAAW,KAAK;EACpC,MAAM,aAAa,WAAW,KAAK;EACnC,MAAM,aAAa,CAAC,CAAC,YAAY,WAAW;AAG5C,MAFkB,CAAC,CAAC,WAAW,WAAW,UAEzB,CAAC,YAAY;AAQ5B,OAAI,CAAC,WAAW,SAAS,CAAC,WAAW,MACnC,QAAO;AAIT,OAAI,WAAW,YAAY,YAAY,KAAK,GAAG;AAC7C,QAAI,WAAW,SAAS,CAAC,WAAW,MAClC,QAAO;AAET,WAAO;;;EAKX,MAAM,SAAS,aAAa,QAAQ;AAEpC,MAAI,GAAG,UAAU,GAAG,MAClB,QAAO,SAAS;AAGlB,MAAI,GAAG,UAAU,GAAG,MAClB,QAAO,SAAS;AAGlB,MAAI,GAAG,UAAU,GAAG,MAClB,QAAO,SAAS;AAIlB,SAAO;;AAGT,QAAO,UAAU;;;;;;CCzDjB,MAAM;CACN,MAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,MAAM,CAAC;AACjD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,MAAM,CAAC;AACjD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,MAAM,CAAC;AACjD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,cAAc,SAAS,YAAY;EACvC,MAAM,SAAS,MAAM,SAAS,QAAQ;AACtC,SAAQ,UAAU,OAAO,WAAW,SAAU,OAAO,aAAa;;AAEpE,QAAO,UAAU;;;;;;CCLjB,MAAM;CACN,MAAM,WAAW,GAAG,GAAG,UACrB,IAAI,OAAO,GAAG,MAAM,CAAC,QAAQ,IAAI,OAAO,GAAG,MAAM,CAAC;AAEpD,QAAO,UAAU;;;;;;CCJjB,MAAM;CACN,MAAM,YAAY,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM;AACtD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,gBAAgB,GAAG,MAAM,QAAQ,GAAG,GAAG,KAAK;AAClD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,gBAAgB,GAAG,GAAG,UAAU;EACpC,MAAM,WAAW,IAAI,OAAO,GAAG,MAAM;EACrC,MAAM,WAAW,IAAI,OAAO,GAAG,MAAM;AACrC,SAAO,SAAS,QAAQ,SAAS,IAAI,SAAS,aAAa,SAAS;;AAEtE,QAAO,UAAU;;;;;;CCNjB,MAAM;CACN,MAAM,QAAQ,QAAM,UAAUA,OAAK,MAAM,GAAG,MAAM,aAAa,GAAG,GAAG,MAAM,CAAC;AAC5E,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,SAAS,QAAM,UAAUC,OAAK,MAAM,GAAG,MAAM,aAAa,GAAG,GAAG,MAAM,CAAC;AAC7E,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM,GAAG;AACnD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM,GAAG;AACnD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM,KAAK;AACrD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM,KAAK;AACtD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM,IAAI;AACrD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM,IAAI;AACrD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CAEN,MAAM,OAAO,GAAG,IAAI,GAAG,UAAU;AAC/B,UAAQ,IAAR;GACE,KAAK;AACH,QAAI,OAAO,MAAM,SACf,KAAI,EAAE;AAER,QAAI,OAAO,MAAM,SACf,KAAI,EAAE;AAER,WAAO,MAAM;GAEf,KAAK;AACH,QAAI,OAAO,MAAM,SACf,KAAI,EAAE;AAER,QAAI,OAAO,MAAM,SACf,KAAI,EAAE;AAER,WAAO,MAAM;GAEf,KAAK;GACL,KAAK;GACL,KAAK,KACH,QAAO,GAAG,GAAG,GAAG,MAAM;GAExB,KAAK,KACH,QAAO,IAAI,GAAG,GAAG,MAAM;GAEzB,KAAK,IACH,QAAO,GAAG,GAAG,GAAG,MAAM;GAExB,KAAK,KACH,QAAO,IAAI,GAAG,GAAG,MAAM;GAEzB,KAAK,IACH,QAAO,GAAG,GAAG,GAAG,MAAM;GAExB,KAAK,KACH,QAAO,IAAI,GAAG,GAAG,MAAM;GAEzB,QACE,OAAM,IAAI,UAAU,qBAAqB,KAAK;;;AAGpD,QAAO,UAAU;;;;;;CCnDjB,MAAM;CACN,MAAM;CACN,MAAM,EAAE,QAAQ,IAAI;CAEpB,MAAM,UAAU,SAAS,YAAY;AACnC,MAAI,mBAAmB,OACrB,QAAO;AAGT,MAAI,OAAO,YAAY,SACrB,WAAU,OAAO,QAAQ;AAG3B,MAAI,OAAO,YAAY,SACrB,QAAO;AAGT,YAAU,WAAW,EAAE;EAEvB,IAAI,QAAQ;AACZ,MAAI,CAAC,QAAQ,IACX,SAAQ,QAAQ,MAAM,QAAQ,oBAAoB,GAAG,EAAE,cAAc,GAAG,EAAE,QAAQ;OAC7E;GAUL,MAAM,iBAAiB,QAAQ,oBAAoB,GAAG,EAAE,iBAAiB,GAAG,EAAE;GAC9E,IAAI;AACJ,WAAQ,OAAO,eAAe,KAAK,QAAQ,MACtC,CAAC,SAAS,MAAM,QAAQ,MAAM,GAAG,WAAW,QAAQ,SACvD;AACA,QAAI,CAAC,SACC,KAAK,QAAQ,KAAK,GAAG,WAAW,MAAM,QAAQ,MAAM,GAAG,OAC3D,SAAQ;AAEV,mBAAe,YAAY,KAAK,QAAQ,KAAK,GAAG,SAAS,KAAK,GAAG;;AAGnE,kBAAe,YAAY;;AAG7B,MAAI,UAAU,KACZ,QAAO;EAGT,MAAM,QAAQ,MAAM;AAMpB,SAAO,MAAM,GAAG,MAAM,GALR,MAAM,MAAM,IAKK,GAJjB,MAAM,MAAM,MACP,QAAQ,qBAAqB,MAAM,KAAK,IAAI,MAAM,OAAO,KAC9D,QAAQ,qBAAqB,MAAM,KAAK,IAAI,MAAM,OAAO,MAEP,QAAQ;;AAE1E,QAAO,UAAU;;;;;;CC3DjB,IAAM,WAAN,MAAe;EACb,cAAe;AACb,QAAK,MAAM;AACX,QAAK,sBAAM,IAAI,KAAK;;EAGtB,IAAK,KAAK;GACR,MAAM,QAAQ,KAAK,IAAI,IAAI,IAAI;AAC/B,OAAI,UAAU,OACZ;QACK;AAEL,SAAK,IAAI,OAAO,IAAI;AACpB,SAAK,IAAI,IAAI,KAAK,MAAM;AACxB,WAAO;;;EAIX,OAAQ,KAAK;AACX,UAAO,KAAK,IAAI,OAAO,IAAI;;EAG7B,IAAK,KAAK,OAAO;AAGf,OAAI,CAFY,KAAK,OAAO,IAAI,IAEhB,UAAU,QAAW;AAEnC,QAAI,KAAK,IAAI,QAAQ,KAAK,KAAK;KAC7B,MAAM,WAAW,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC;AACxC,UAAK,OAAO,SAAS;;AAGvB,SAAK,IAAI,IAAI,KAAK,MAAM;;AAG1B,UAAO;;;AAIX,QAAO,UAAU;;;;;;CCvCjB,MAAM,mBAAmB;CAGzB,IAAM,QAAN,MAAM,MAAM;EACV,YAAa,OAAO,SAAS;AAC3B,aAAU,aAAa,QAAQ;AAE/B,OAAI,iBAAiB,MACnB,KACE,MAAM,UAAU,CAAC,CAAC,QAAQ,SAC1B,MAAM,sBAAsB,CAAC,CAAC,QAAQ,kBAEtC,QAAO;OAEP,QAAO,IAAI,MAAM,MAAM,KAAK,QAAQ;AAIxC,OAAI,iBAAiB,YAAY;AAE/B,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,CAAC,CAAC,MAAM,CAAC;AACpB,SAAK,YAAY;AACjB,WAAO;;AAGT,QAAK,UAAU;AACf,QAAK,QAAQ,CAAC,CAAC,QAAQ;AACvB,QAAK,oBAAoB,CAAC,CAAC,QAAQ;AAKnC,QAAK,MAAM,MAAM,MAAM,CAAC,QAAQ,kBAAkB,IAAI;AAGtD,QAAK,MAAM,KAAK,IACb,MAAM,KAAK,CAEX,KAAI,MAAK,KAAK,WAAW,EAAE,MAAM,CAAC,CAAC,CAInC,QAAO,MAAK,EAAE,OAAO;AAExB,OAAI,CAAC,KAAK,IAAI,OACZ,OAAM,IAAI,UAAU,yBAAyB,KAAK,MAAM;AAI1D,OAAI,KAAK,IAAI,SAAS,GAAG;IAEvB,MAAM,QAAQ,KAAK,IAAI;AACvB,SAAK,MAAM,KAAK,IAAI,QAAO,MAAK,CAAC,UAAU,EAAE,GAAG,CAAC;AACjD,QAAI,KAAK,IAAI,WAAW,EACtB,MAAK,MAAM,CAAC,MAAM;aACT,KAAK,IAAI,SAAS,GAE3B;UAAK,MAAM,KAAK,KAAK,IACnB,KAAI,EAAE,WAAW,KAAK,MAAM,EAAE,GAAG,EAAE;AACjC,WAAK,MAAM,CAAC,EAAE;AACd;;;;AAMR,QAAK,YAAY;;EAGnB,IAAI,QAAS;AACX,OAAI,KAAK,cAAc,QAAW;AAChC,SAAK,YAAY;AACjB,SAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;AACxC,SAAI,IAAI,EACN,MAAK,aAAa;KAEpB,MAAM,QAAQ,KAAK,IAAI;AACvB,UAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAI,IAAI,EACN,MAAK,aAAa;AAEpB,WAAK,aAAa,MAAM,GAAG,UAAU,CAAC,MAAM;;;;AAIlD,UAAO,KAAK;;EAGd,SAAU;AACR,UAAO,KAAK;;EAGd,WAAY;AACV,UAAO,KAAK;;EAGd,WAAY,OAAO;GAMjB,MAAM,YAFH,KAAK,QAAQ,qBAAqB,4BAClC,KAAK,QAAQ,SAAS,eACE,MAAM;GACjC,MAAM,SAAS,MAAM,IAAI,QAAQ;AACjC,OAAI,OACF,QAAO;GAGT,MAAM,QAAQ,KAAK,QAAQ;GAE3B,MAAM,KAAK,QAAQ,GAAG,EAAE,oBAAoB,GAAG,EAAE;AACjD,WAAQ,MAAM,QAAQ,IAAI,cAAc,KAAK,QAAQ,kBAAkB,CAAC;AACxE,SAAM,kBAAkB,MAAM;AAG9B,WAAQ,MAAM,QAAQ,GAAG,EAAE,iBAAiB,sBAAsB;AAClE,SAAM,mBAAmB,MAAM;AAG/B,WAAQ,MAAM,QAAQ,GAAG,EAAE,YAAY,iBAAiB;AACxD,SAAM,cAAc,MAAM;AAG1B,WAAQ,MAAM,QAAQ,GAAG,EAAE,YAAY,iBAAiB;AACxD,SAAM,cAAc,MAAM;GAK1B,IAAI,YAAY,MACb,MAAM,IAAI,CACV,KAAI,SAAQ,gBAAgB,MAAM,KAAK,QAAQ,CAAC,CAChD,KAAK,IAAI,CACT,MAAM,MAAM,CAEZ,KAAI,SAAQ,YAAY,MAAM,KAAK,QAAQ,CAAC;AAE/C,OAAI,MAEF,aAAY,UAAU,QAAO,SAAQ;AACnC,UAAM,wBAAwB,MAAM,KAAK,QAAQ;AACjD,WAAO,CAAC,CAAC,KAAK,MAAM,GAAG,EAAE,iBAAiB;KAC1C;AAEJ,SAAM,cAAc,UAAU;GAK9B,MAAM,2BAAW,IAAI,KAAK;GAC1B,MAAM,cAAc,UAAU,KAAI,SAAQ,IAAI,WAAW,MAAM,KAAK,QAAQ,CAAC;AAC7E,QAAK,MAAM,QAAQ,aAAa;AAC9B,QAAI,UAAU,KAAK,CACjB,QAAO,CAAC,KAAK;AAEf,aAAS,IAAI,KAAK,OAAO,KAAK;;AAEhC,OAAI,SAAS,OAAO,KAAK,SAAS,IAAI,GAAG,CACvC,UAAS,OAAO,GAAG;GAGrB,MAAM,SAAS,CAAC,GAAG,SAAS,QAAQ,CAAC;AACrC,SAAM,IAAI,SAAS,OAAO;AAC1B,UAAO;;EAGT,WAAY,OAAO,SAAS;AAC1B,OAAI,EAAE,iBAAiB,OACrB,OAAM,IAAI,UAAU,sBAAsB;AAG5C,UAAO,KAAK,IAAI,MAAM,oBAAoB;AACxC,WACE,cAAc,iBAAiB,QAAQ,IACvC,MAAM,IAAI,MAAM,qBAAqB;AACnC,YACE,cAAc,kBAAkB,QAAQ,IACxC,gBAAgB,OAAO,mBAAmB;AACxC,aAAO,iBAAiB,OAAO,oBAAoB;AACjD,cAAO,eAAe,WAAW,iBAAiB,QAAQ;QAC1D;OACF;MAEJ;KAEJ;;EAIJ,KAAM,SAAS;AACb,OAAI,CAAC,QACH,QAAO;AAGT,OAAI,OAAO,YAAY,SACrB,KAAI;AACF,cAAU,IAAI,OAAO,SAAS,KAAK,QAAQ;YACpC,IAAI;AACX,WAAO;;AAIX,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,IACnC,KAAI,QAAQ,KAAK,IAAI,IAAI,SAAS,KAAK,QAAQ,CAC7C,QAAO;AAGX,UAAO;;;AAIX,QAAO,UAAU;CAGjB,MAAM,QAAQ,0BAAS;CAEvB,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM,EACJ,QAAQ,IACR,GACA,uBACA,kBACA;CAEF,MAAM,EAAE,yBAAyB;CAEjC,MAAM,aAAY,MAAK,EAAE,UAAU;CACnC,MAAM,SAAQ,MAAK,EAAE,UAAU;CAI/B,MAAM,iBAAiB,aAAa,YAAY;EAC9C,IAAI,SAAS;EACb,MAAM,uBAAuB,YAAY,OAAO;EAChD,IAAI,iBAAiB,qBAAqB,KAAK;AAE/C,SAAO,UAAU,qBAAqB,QAAQ;AAC5C,YAAS,qBAAqB,OAAO,oBAAoB;AACvD,WAAO,eAAe,WAAW,iBAAiB,QAAQ;KAC1D;AAEF,oBAAiB,qBAAqB,KAAK;;AAG7C,SAAO;;CAMT,MAAM,mBAAmB,MAAM,YAAY;AACzC,SAAO,KAAK,QAAQ,GAAG,EAAE,QAAQ,GAAG;AACpC,QAAM,QAAQ,MAAM,QAAQ;AAC5B,SAAO,cAAc,MAAM,QAAQ;AACnC,QAAM,SAAS,KAAK;AACpB,SAAO,cAAc,MAAM,QAAQ;AACnC,QAAM,UAAU,KAAK;AACrB,SAAO,eAAe,MAAM,QAAQ;AACpC,QAAM,UAAU,KAAK;AACrB,SAAO,aAAa,MAAM,QAAQ;AAClC,QAAM,SAAS,KAAK;AACpB,SAAO;;CAGT,MAAM,OAAM,OAAM,CAAC,MAAM,GAAG,aAAa,KAAK,OAAO,OAAO;CAS5D,MAAM,iBAAiB,MAAM,YAAY;AACvC,SAAO,KACJ,MAAM,CACN,MAAM,MAAM,CACZ,KAAK,MAAM,aAAa,GAAG,QAAQ,CAAC,CACpC,KAAK,IAAI;;CAGd,MAAM,gBAAgB,MAAM,YAAY;EACtC,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,cAAc,GAAG,EAAE;AAClD,SAAO,KAAK,QAAQ,IAAI,GAAG,GAAG,GAAG,GAAG,OAAO;AACzC,SAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG;GACpC,IAAI;AAEJ,OAAI,IAAI,EAAE,CACR,OAAM;YACG,IAAI,EAAE,CACf,OAAM,KAAK,EAAE,QAAQ,CAAC,IAAI,EAAE;YACnB,IAAI,EAAE,CAEf,OAAM,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE;YAC3B,IAAI;AACb,UAAM,mBAAmB,GAAG;AAC5B,UAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;SAGjB,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;AAGnB,SAAM,gBAAgB,IAAI;AAC1B,UAAO;IACP;;CAWJ,MAAM,iBAAiB,MAAM,YAAY;AACvC,SAAO,KACJ,MAAM,CACN,MAAM,MAAM,CACZ,KAAK,MAAM,aAAa,GAAG,QAAQ,CAAC,CACpC,KAAK,IAAI;;CAGd,MAAM,gBAAgB,MAAM,YAAY;AACtC,QAAM,SAAS,MAAM,QAAQ;EAC7B,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,cAAc,GAAG,EAAE;EAClD,MAAM,IAAI,QAAQ,oBAAoB,OAAO;AAC7C,SAAO,KAAK,QAAQ,IAAI,GAAG,GAAG,GAAG,GAAG,OAAO;AACzC,SAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG;GACpC,IAAI;AAEJ,OAAI,IAAI,EAAE,CACR,OAAM;YACG,IAAI,EAAE,CACf,OAAM,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE;YACvB,IAAI,EAAE,CACf,KAAI,MAAM,IACR,OAAM,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;OAExC,OAAM,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE;YAE5B,IAAI;AACb,UAAM,mBAAmB,GAAG;AAC5B,QAAI,MAAM,IACR,KAAI,MAAM,IACR,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE;QAEtB,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;QAGnB,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,CAAC,IAAI,EAAE;UAET;AACL,UAAM,QAAQ;AACd,QAAI,MAAM,IACR,KAAI,MAAM,IACR,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,IAClB,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE;QAE1B,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,IAClB,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;QAGvB,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,CAAC,IAAI,EAAE;;AAIhB,SAAM,gBAAgB,IAAI;AAC1B,UAAO;IACP;;CAGJ,MAAM,kBAAkB,MAAM,YAAY;AACxC,QAAM,kBAAkB,MAAM,QAAQ;AACtC,SAAO,KACJ,MAAM,MAAM,CACZ,KAAK,MAAM,cAAc,GAAG,QAAQ,CAAC,CACrC,KAAK,IAAI;;CAGd,MAAM,iBAAiB,MAAM,YAAY;AACvC,SAAO,KAAK,MAAM;EAClB,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,eAAe,GAAG,EAAE;AACnD,SAAO,KAAK,QAAQ,IAAI,KAAK,MAAM,GAAG,GAAG,GAAG,OAAO;AACjD,SAAM,UAAU,MAAM,KAAK,MAAM,GAAG,GAAG,GAAG,GAAG;GAC7C,MAAM,KAAK,IAAI,EAAE;GACjB,MAAM,KAAK,MAAM,IAAI,EAAE;GACvB,MAAM,KAAK,MAAM,IAAI,EAAE;GACvB,MAAM,OAAO;AAEb,OAAI,SAAS,OAAO,KAClB,QAAO;AAKT,QAAK,QAAQ,oBAAoB,OAAO;AAExC,OAAI,GACF,KAAI,SAAS,OAAO,SAAS,IAE3B,OAAM;OAGN,OAAM;YAEC,QAAQ,MAAM;AAGvB,QAAI,GACF,KAAI;AAEN,QAAI;AAEJ,QAAI,SAAS,KAAK;AAGhB,YAAO;AACP,SAAI,IAAI;AACN,UAAI,CAAC,IAAI;AACT,UAAI;AACJ,UAAI;YACC;AACL,UAAI,CAAC,IAAI;AACT,UAAI;;eAEG,SAAS,MAAM;AAGxB,YAAO;AACP,SAAI,GACF,KAAI,CAAC,IAAI;SAET,KAAI,CAAC,IAAI;;AAIb,QAAI,SAAS,IACX,MAAK;AAGP,UAAM,GAAG,OAAO,EAAE,GAAG,EAAE,GAAG,IAAI;cACrB,GACT,OAAM,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE;YACxB,GACT,OAAM,KAAK,EAAE,GAAG,EAAE,IAAI,GACrB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;AAGnB,SAAM,iBAAiB,IAAI;AAE3B,UAAO;IACP;;CAKJ,MAAM,gBAAgB,MAAM,YAAY;AACtC,QAAM,gBAAgB,MAAM,QAAQ;AAEpC,SAAO,KACJ,MAAM,CACN,QAAQ,GAAG,EAAE,OAAO,GAAG;;CAG5B,MAAM,eAAe,MAAM,YAAY;AACrC,QAAM,eAAe,MAAM,QAAQ;AACnC,SAAO,KACJ,MAAM,CACN,QAAQ,GAAG,QAAQ,oBAAoB,EAAE,UAAU,EAAE,OAAO,GAAG;;CASpE,MAAM,iBAAgB,WAAU,IAC9B,MAAM,IAAI,IAAI,IAAI,KAAK,IACvB,IAAI,IAAI,IAAI,IAAI,QAAQ;AACxB,MAAI,IAAI,GAAG,CACT,QAAO;WACE,IAAI,GAAG,CAChB,QAAO,KAAK,GAAG,MAAM,QAAQ,OAAO;WAC3B,IAAI,GAAG,CAChB,QAAO,KAAK,GAAG,GAAG,GAAG,IAAI,QAAQ,OAAO;WAC/B,IACT,QAAO,KAAK;MAEZ,QAAO,KAAK,OAAO,QAAQ,OAAO;AAGpC,MAAI,IAAI,GAAG,CACT,MAAK;WACI,IAAI,GAAG,CAChB,MAAK,IAAI,CAAC,KAAK,EAAE;WACR,IAAI,GAAG,CAChB,MAAK,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE;WACd,IACT,MAAK,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;WACnB,MACT,MAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE;MAE7B,MAAK,KAAK;AAGZ,SAAO,GAAG,KAAK,GAAG,KAAK,MAAM;;CAG/B,MAAM,WAAW,KAAK,SAAS,YAAY;AACzC,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,KAAI,CAAC,IAAI,GAAG,KAAK,QAAQ,CACvB,QAAO;AAIX,MAAI,QAAQ,WAAW,UAAU,CAAC,QAAQ,mBAAmB;AAM3D,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,IAAI,GAAG,OAAO;AACpB,QAAI,IAAI,GAAG,WAAW,WAAW,IAC/B;AAGF,QAAI,IAAI,GAAG,OAAO,WAAW,SAAS,GAAG;KACvC,MAAM,UAAU,IAAI,GAAG;AACvB,SAAI,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,MAC5B,QAAO;;;AAMb,UAAO;;AAGT,SAAO;;;;;;;CCziBT,MAAM,MAAM,OAAO,aAAa;CAEhC,IAAM,aAAN,MAAM,WAAW;EACf,WAAW,MAAO;AAChB,UAAO;;EAGT,YAAa,MAAM,SAAS;AAC1B,aAAU,aAAa,QAAQ;AAE/B,OAAI,gBAAgB,WAClB,KAAI,KAAK,UAAU,CAAC,CAAC,QAAQ,MAC3B,QAAO;OAEP,QAAO,KAAK;AAIhB,UAAO,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,IAAI;AACzC,SAAM,cAAc,MAAM,QAAQ;AAClC,QAAK,UAAU;AACf,QAAK,QAAQ,CAAC,CAAC,QAAQ;AACvB,QAAK,MAAM,KAAK;AAEhB,OAAI,KAAK,WAAW,IAClB,MAAK,QAAQ;OAEb,MAAK,QAAQ,KAAK,WAAW,KAAK,OAAO;AAG3C,SAAM,QAAQ,KAAK;;EAGrB,MAAO,MAAM;GACX,MAAM,IAAI,KAAK,QAAQ,QAAQ,GAAG,EAAE,mBAAmB,GAAG,EAAE;GAC5D,MAAM,IAAI,KAAK,MAAM,EAAE;AAEvB,OAAI,CAAC,EACH,OAAM,IAAI,UAAU,uBAAuB,OAAO;AAGpD,QAAK,WAAW,EAAE,OAAO,SAAY,EAAE,KAAK;AAC5C,OAAI,KAAK,aAAa,IACpB,MAAK,WAAW;AAIlB,OAAI,CAAC,EAAE,GACL,MAAK,SAAS;OAEd,MAAK,SAAS,IAAI,OAAO,EAAE,IAAI,KAAK,QAAQ,MAAM;;EAItD,WAAY;AACV,UAAO,KAAK;;EAGd,KAAM,SAAS;AACb,SAAM,mBAAmB,SAAS,KAAK,QAAQ,MAAM;AAErD,OAAI,KAAK,WAAW,OAAO,YAAY,IACrC,QAAO;AAGT,OAAI,OAAO,YAAY,SACrB,KAAI;AACF,cAAU,IAAI,OAAO,SAAS,KAAK,QAAQ;YACpC,IAAI;AACX,WAAO;;AAIX,UAAO,IAAI,SAAS,KAAK,UAAU,KAAK,QAAQ,KAAK,QAAQ;;EAG/D,WAAY,MAAM,SAAS;AACzB,OAAI,EAAE,gBAAgB,YACpB,OAAM,IAAI,UAAU,2BAA2B;AAGjD,OAAI,KAAK,aAAa,IAAI;AACxB,QAAI,KAAK,UAAU,GACjB,QAAO;AAET,WAAO,IAAI,MAAM,KAAK,OAAO,QAAQ,CAAC,KAAK,KAAK,MAAM;cAC7C,KAAK,aAAa,IAAI;AAC/B,QAAI,KAAK,UAAU,GACjB,QAAO;AAET,WAAO,IAAI,MAAM,KAAK,OAAO,QAAQ,CAAC,KAAK,KAAK,OAAO;;AAGzD,aAAU,aAAa,QAAQ;AAG/B,OAAI,QAAQ,sBACT,KAAK,UAAU,cAAc,KAAK,UAAU,YAC7C,QAAO;AAET,OAAI,CAAC,QAAQ,sBACV,KAAK,MAAM,WAAW,SAAS,IAAI,KAAK,MAAM,WAAW,SAAS,EACnE,QAAO;AAIT,OAAI,KAAK,SAAS,WAAW,IAAI,IAAI,KAAK,SAAS,WAAW,IAAI,CAChE,QAAO;AAGT,OAAI,KAAK,SAAS,WAAW,IAAI,IAAI,KAAK,SAAS,WAAW,IAAI,CAChE,QAAO;AAGT,OACG,KAAK,OAAO,YAAY,KAAK,OAAO,WACrC,KAAK,SAAS,SAAS,IAAI,IAAI,KAAK,SAAS,SAAS,IAAI,CAC1D,QAAO;AAGT,OAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,QAAQ,IAC7C,KAAK,SAAS,WAAW,IAAI,IAAI,KAAK,SAAS,WAAW,IAAI,CAC9D,QAAO;AAGT,OAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,QAAQ,IAC7C,KAAK,SAAS,WAAW,IAAI,IAAI,KAAK,SAAS,WAAW,IAAI,CAC9D,QAAO;AAET,UAAO;;;AAIX,QAAO,UAAU;CAEjB,MAAM;CACN,MAAM,EAAE,QAAQ,IAAI;CACpB,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;;;;;;CC5IN,MAAM;CACN,MAAM,aAAa,SAAS,OAAO,YAAY;AAC7C,MAAI;AACF,WAAQ,IAAI,MAAM,OAAO,QAAQ;WAC1B,IAAI;AACX,UAAO;;AAET,SAAO,MAAM,KAAK,QAAQ;;AAE5B,QAAO,UAAU;;;;;;CCTjB,MAAM;CAGN,MAAM,iBAAiB,OAAO,YAC5B,IAAI,MAAM,OAAO,QAAQ,CAAC,IACvB,KAAI,SAAQ,KAAK,KAAI,MAAK,EAAE,MAAM,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC;AAEpE,QAAO,UAAU;;;;;;CCPjB,MAAM;CACN,MAAM;CAEN,MAAM,iBAAiB,UAAU,OAAO,YAAY;EAClD,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,IAAI,WAAW;AACf,MAAI;AACF,cAAW,IAAI,MAAM,OAAO,QAAQ;WAC7B,IAAI;AACX,UAAO;;AAET,WAAS,SAAS,MAAM;AACtB,OAAI,SAAS,KAAK,EAAE,EAElB;QAAI,CAAC,OAAO,MAAM,QAAQ,EAAE,KAAK,IAAI;AAEnC,WAAM;AACN,aAAQ,IAAI,OAAO,KAAK,QAAQ;;;IAGpC;AACF,SAAO;;AAET,QAAO,UAAU;;;;;;CCxBjB,MAAM;CACN,MAAM;CACN,MAAM,iBAAiB,UAAU,OAAO,YAAY;EAClD,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,IAAI,WAAW;AACf,MAAI;AACF,cAAW,IAAI,MAAM,OAAO,QAAQ;WAC7B,IAAI;AACX,UAAO;;AAET,WAAS,SAAS,MAAM;AACtB,OAAI,SAAS,KAAK,EAAE,EAElB;QAAI,CAAC,OAAO,MAAM,QAAQ,EAAE,KAAK,GAAG;AAElC,WAAM;AACN,aAAQ,IAAI,OAAO,KAAK,QAAQ;;;IAGpC;AACF,SAAO;;AAET,QAAO,UAAU;;;;;;CCvBjB,MAAM;CACN,MAAM;CACN,MAAM;CAEN,MAAM,cAAc,OAAO,UAAU;AACnC,UAAQ,IAAI,MAAM,OAAO,MAAM;EAE/B,IAAI,SAAS,IAAI,OAAO,QAAQ;AAChC,MAAI,MAAM,KAAK,OAAO,CACpB,QAAO;AAGT,WAAS,IAAI,OAAO,UAAU;AAC9B,MAAI,MAAM,KAAK,OAAO,CACpB,QAAO;AAGT,WAAS;AACT,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;GACzC,MAAM,cAAc,MAAM,IAAI;GAE9B,IAAI,SAAS;AACb,eAAY,SAAS,eAAe;IAElC,MAAM,UAAU,IAAI,OAAO,WAAW,OAAO,QAAQ;AACrD,YAAQ,WAAW,UAAnB;KACE,KAAK;AACH,UAAI,QAAQ,WAAW,WAAW,EAChC,SAAQ;UAER,SAAQ,WAAW,KAAK,EAAE;AAE5B,cAAQ,MAAM,QAAQ,QAAQ;KAEhC,KAAK;KACL,KAAK;AACH,UAAI,CAAC,UAAU,GAAG,SAAS,OAAO,CAChC,UAAS;AAEX;KACF,KAAK;KACL,KAAK,KAEH;KAEF,QACE,OAAM,IAAI,MAAM,yBAAyB,WAAW,WAAW;;KAEnE;AACF,OAAI,WAAW,CAAC,UAAU,GAAG,QAAQ,OAAO,EAC1C,UAAS;;AAIb,MAAI,UAAU,MAAM,KAAK,OAAO,CAC9B,QAAO;AAGT,SAAO;;AAET,QAAO,UAAU;;;;;;CC5DjB,MAAM;CACN,MAAM,cAAc,OAAO,YAAY;AACrC,MAAI;AAGF,UAAO,IAAI,MAAM,OAAO,QAAQ,CAAC,SAAS;WACnC,IAAI;AACX,UAAO;;;AAGX,QAAO,UAAU;;;;;;CCVjB,MAAM;CACN,MAAM;CACN,MAAM,EAAE,QAAQ;CAChB,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CAEN,MAAM,WAAW,SAAS,OAAO,MAAM,YAAY;AACjD,YAAU,IAAI,OAAO,SAAS,QAAQ;AACtC,UAAQ,IAAI,MAAM,OAAO,QAAQ;EAEjC,IAAI,MAAM,OAAO,MAAM,MAAM;AAC7B,UAAQ,MAAR;GACE,KAAK;AACH,WAAO;AACP,YAAQ;AACR,WAAO;AACP,WAAO;AACP,YAAQ;AACR;GACF,KAAK;AACH,WAAO;AACP,YAAQ;AACR,WAAO;AACP,WAAO;AACP,YAAQ;AACR;GACF,QACE,OAAM,IAAI,UAAU,4CAAwC;;AAIhE,MAAI,UAAU,SAAS,OAAO,QAAQ,CACpC,QAAO;AAMT,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;GACzC,MAAM,cAAc,MAAM,IAAI;GAE9B,IAAI,OAAO;GACX,IAAI,MAAM;AAEV,eAAY,SAAS,eAAe;AAClC,QAAI,WAAW,WAAW,IACxB,cAAa,IAAI,WAAW,UAAU;AAExC,WAAO,QAAQ;AACf,UAAM,OAAO;AACb,QAAI,KAAK,WAAW,QAAQ,KAAK,QAAQ,QAAQ,CAC/C,QAAO;aACE,KAAK,WAAW,QAAQ,IAAI,QAAQ,QAAQ,CACrD,OAAM;KAER;AAIF,OAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,MAC9C,QAAO;AAKT,QAAK,CAAC,IAAI,YAAY,IAAI,aAAa,SACnC,MAAM,SAAS,IAAI,OAAO,CAC5B,QAAO;YACE,IAAI,aAAa,SAAS,KAAK,SAAS,IAAI,OAAO,CAC5D,QAAO;;AAGX,SAAO;;AAGT,QAAO,UAAU;;;;;;CC9EjB,MAAM;CACN,MAAM,OAAO,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,QAAQ;AAC9E,QAAO,UAAU;;;;;;CCHjB,MAAM;CAEN,MAAM,OAAO,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,QAAQ;AAC9E,QAAO,UAAU;;;;;;CCHjB,MAAM;CACN,MAAM,cAAc,IAAI,IAAI,YAAY;AACtC,OAAK,IAAI,MAAM,IAAI,QAAQ;AAC3B,OAAK,IAAI,MAAM,IAAI,QAAQ;AAC3B,SAAO,GAAG,WAAW,IAAI,QAAQ;;AAEnC,QAAO,UAAU;;;;;;CCHjB,MAAM;CACN,MAAM;AACN,QAAO,WAAW,UAAU,OAAO,YAAY;EAC7C,MAAM,MAAM,EAAE;EACd,IAAI,QAAQ;EACZ,IAAI,OAAO;EACX,MAAM,IAAI,SAAS,MAAM,GAAG,MAAM,QAAQ,GAAG,GAAG,QAAQ,CAAC;AACzD,OAAK,MAAM,WAAW,EAEpB,KADiB,UAAU,SAAS,OAAO,QAAQ,EACrC;AACZ,UAAO;AACP,OAAI,CAAC,MACH,SAAQ;SAEL;AACL,OAAI,KACF,KAAI,KAAK,CAAC,OAAO,KAAK,CAAC;AAEzB,UAAO;AACP,WAAQ;;AAGZ,MAAI,MACF,KAAI,KAAK,CAAC,OAAO,KAAK,CAAC;EAGzB,MAAM,SAAS,EAAE;AACjB,OAAK,MAAM,CAAC,KAAK,QAAQ,IACvB,KAAI,QAAQ,IACV,QAAO,KAAK,IAAI;WACP,CAAC,OAAO,QAAQ,EAAE,GAC3B,QAAO,KAAK,IAAI;WACP,CAAC,IACV,QAAO,KAAK,KAAK,MAAM;WACd,QAAQ,EAAE,GACnB,QAAO,KAAK,KAAK,MAAM;MAEvB,QAAO,KAAK,GAAG,IAAI,KAAK,MAAM;EAGlC,MAAM,aAAa,OAAO,KAAK,OAAO;EACtC,MAAM,WAAW,OAAO,MAAM,QAAQ,WAAW,MAAM,MAAM,OAAO,MAAM;AAC1E,SAAO,WAAW,SAAS,SAAS,SAAS,aAAa;;;;;;;CC7C5D,MAAM;CACN,MAAM;CACN,MAAM,EAAE,QAAQ;CAChB,MAAM;CACN,MAAM;CAsCN,MAAM,UAAU,KAAK,KAAK,UAAU,EAAE,KAAK;AACzC,MAAI,QAAQ,IACV,QAAO;AAGT,QAAM,IAAI,MAAM,KAAK,QAAQ;AAC7B,QAAM,IAAI,MAAM,KAAK,QAAQ;EAC7B,IAAI,aAAa;AAEjB,QAAO,MAAK,MAAM,aAAa,IAAI,KAAK;AACtC,QAAK,MAAM,aAAa,IAAI,KAAK;IAC/B,MAAM,QAAQ,aAAa,WAAW,WAAW,QAAQ;AACzD,iBAAa,cAAc,UAAU;AACrC,QAAI,MACF,UAAS;;AAOb,OAAI,WACF,QAAO;;AAGX,SAAO;;CAGT,MAAM,+BAA+B,CAAC,IAAI,WAAW,YAAY,CAAC;CAClE,MAAM,iBAAiB,CAAC,IAAI,WAAW,UAAU,CAAC;CAElD,MAAM,gBAAgB,KAAK,KAAK,YAAY;AAC1C,MAAI,QAAQ,IACV,QAAO;AAGT,MAAI,IAAI,WAAW,KAAK,IAAI,GAAG,WAAW,IACxC,KAAI,IAAI,WAAW,KAAK,IAAI,GAAG,WAAW,IACxC,QAAO;WACE,QAAQ,kBACjB,OAAM;MAEN,OAAM;AAIV,MAAI,IAAI,WAAW,KAAK,IAAI,GAAG,WAAW,IACxC,KAAI,QAAQ,kBACV,QAAO;MAEP,OAAM;EAIV,MAAM,wBAAQ,IAAI,KAAK;EACvB,IAAI,IAAI;AACR,OAAK,MAAM,KAAK,IACd,KAAI,EAAE,aAAa,OAAO,EAAE,aAAa,KACvC,MAAK,SAAS,IAAI,GAAG,QAAQ;WACpB,EAAE,aAAa,OAAO,EAAE,aAAa,KAC9C,MAAK,QAAQ,IAAI,GAAG,QAAQ;MAE5B,OAAM,IAAI,EAAE,OAAO;AAIvB,MAAI,MAAM,OAAO,EACf,QAAO;EAGT,IAAI;AACJ,MAAI,MAAM,IAAI;AACZ,cAAW,QAAQ,GAAG,QAAQ,GAAG,QAAQ,QAAQ;AACjD,OAAI,WAAW,EACb,QAAO;YACE,aAAa,MAAM,GAAG,aAAa,QAAQ,GAAG,aAAa,MACpE,QAAO;;AAKX,OAAK,MAAM,MAAM,OAAO;AACtB,OAAI,MAAM,CAAC,UAAU,IAAI,OAAO,GAAG,EAAE,QAAQ,CAC3C,QAAO;AAGT,OAAI,MAAM,CAAC,UAAU,IAAI,OAAO,GAAG,EAAE,QAAQ,CAC3C,QAAO;AAGT,QAAK,MAAM,KAAK,IACd,KAAI,CAAC,UAAU,IAAI,OAAO,EAAE,EAAE,QAAQ,CACpC,QAAO;AAIX,UAAO;;EAGT,IAAI,QAAQ;EACZ,IAAI,UAAU;EAGd,IAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;EAC5C,IAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAE5C,MAAI,gBAAgB,aAAa,WAAW,WAAW,KACnD,GAAG,aAAa,OAAO,aAAa,WAAW,OAAO,EACxD,gBAAe;AAGjB,OAAK,MAAM,KAAK,KAAK;AACnB,cAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,cAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,OAAI,IAAI;AACN,QAAI,cACF;SAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,MAClC,gBAAe;;AAGnB,QAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,cAAS,SAAS,IAAI,GAAG,QAAQ;AACjC,SAAI,WAAW,KAAK,WAAW,GAC7B,QAAO;eAEA,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,EAAE,EAAE,QAAQ,CAC1E,QAAO;;AAGX,OAAI,IAAI;AACN,QAAI,cACF;SAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,MAClC,gBAAe;;AAGnB,QAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,aAAQ,QAAQ,IAAI,GAAG,QAAQ;AAC/B,SAAI,UAAU,KAAK,UAAU,GAC3B,QAAO;eAEA,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,EAAE,EAAE,QAAQ,CAC1E,QAAO;;AAGX,OAAI,CAAC,EAAE,aAAa,MAAM,OAAO,aAAa,EAC5C,QAAO;;AAOX,MAAI,MAAM,YAAY,CAAC,MAAM,aAAa,EACxC,QAAO;AAGT,MAAI,MAAM,YAAY,CAAC,MAAM,aAAa,EACxC,QAAO;AAMT,MAAI,gBAAgB,aAClB,QAAO;AAGT,SAAO;;CAIT,MAAM,YAAY,GAAG,GAAG,YAAY;AAClC,MAAI,CAAC,EACH,QAAO;EAET,MAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,QAAQ;AACjD,SAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;;CAIN,MAAM,WAAW,GAAG,GAAG,YAAY;AACjC,MAAI,CAAC,EACH,QAAO;EAET,MAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,QAAQ;AACjD,SAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;;AAGN,QAAO,UAAU;;;;;;CCrPjB,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;AACN,QAAO,UAAU;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,IAAI,WAAW;EACf,KAAK,WAAW;EAChB,QAAQ,WAAW;EACnB,qBAAqB,UAAU;EAC/B,eAAe,UAAU;EACzB,oBAAoB,YAAY;EAChC,qBAAqB,YAAY;EAClC;;;;;;ACpFD,MAAa,mBAAsB,SAAiB,aAAwB;CAC1E,MAAM,+BAAgB,SAAS,SAAS;AAExC,KAAI;EACF,MAAM,wCAA2B,UAAU,OAAO;AAClD,SAAO,KAAK,MAAM,YAAY;SACxB;AACN,QAAM,IAAI,MAAM,iBAAiB,WAAW;;;AAIhD,SAAgB,iBAAiB,aAAwC;AACvE,KAAI;AACF,SAAO,uCAA2C,YAAY,EAAE,cAAc;SACxE;AACN,QAAM,IAAI,MAAM,oCAAoC,cAAc;;;;;;AChBtE,MAAM,qCAAsBC,wBAAK;;;;AAKjC,SAAgB,kBAA0B;AACxC,KAAI;EACF,MAAM,2CAAmB,iCAAiC;GACxD,KAAK,QAAQ,KAAK;GAClB,UAAU;GACV,OAAO;IAAC;IAAU;IAAQ;IAAS;GACpC,CAAC,CAAC,MAAM;AAET,SAAO,mCAAsB,QAAQ,GAAG,UAAU;SAC5C;AACN,SAAO;;;;;;;;AASX,eAAsB,eAAkC;AACtD,KAAI;EACF,MAAM,EAAE,WAAW,MAAM,UACvB;GACE;GACA;GACA;GACA;GACA;GACA;GACD,CAAC,KAAK,IAAI,EACX;GACE,KAAK,iBAAiB;GACtB,UAAU;GACX,CACF;EAED,MAAM,WAAW,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,QAAQ,CAAC,IAAIC,kBAAK,QAAQ;AAE5E,MAAI,SAAS,WAAW,EACtB,OAAM,IAAI,OAAO;AAGnB,SAAO;SACD;AACN,QAAM,IAAI,MAAM,qDAAqD;;;;;;;;;ACnDzE,MAAa,eACX,MACA,eAAe,YACN;CACT,MAAM,aAAa,OAAO,OAAO,KAAK,CAAC;AACvC,KAAI,CAAC,YAAY;AACf,UAAQ,KAAK,qBAAqB;AAClC;;CAGF,MAAM,WAAW,CAAC,cAAc,GAAG,OAAO,KAAK,WAAW,CAAC;CAC3D,MAAMC,YAAwB,EAAE;AAEhC,QAAO,QAAQ,KAAK,CAAC,SAAS,CAAC,aAAa,aAAa;AACvD,YAAU,KAAK,CAAC,aAAa,GAAG,OAAO,OAAO,QAAQ,CAAC,CAAC;GACxD;CAEF,MAAM,mBAAmB,QAAwB;AAE/C,SAAO,IAAI,QAAQ,oBAAoB,GAAG,CAAC;;CAG7C,MAAM,eAAe,SAAS,KAAK,SAAS,UAAU;EACpD,MAAM,eAAe,KAAK,IAAI,GAAG,UAAU,KAAK,QAAQ,gBAAgB,IAAI,UAAU,GAAG,CAAC,CAAC;AAC3F,SAAO,KAAK,IAAI,QAAQ,QAAQ,aAAa;GAC7C;CAEF,MAAM,gBAAgB,IAAI,OAAO,aAAa,KAAK,EAAE;CACrD,MAAM,iBAAiB,aAAa,MAAM,EAAE,CAAC,KAAK,UAAU,IAAI,OAAO,QAAQ,EAAE,CAAC;CAClF,MAAM,eAAe,IAAI,cAAc,GAAG,eAAe,KAAK,IAAI,CAAC;CACnE,MAAM,eAAe,IAAI,cAAc,GAAG,eAAe,KAAK,IAAI,CAAC;CACnE,MAAM,eAAe,IAAI,cAAc,GAAG,eAAe,KAAK,IAAI,CAAC;CAEnE,MAAM,aAAa,UAAoB;AAOrC,SAAO,IANgB,MAAM,KAAK,MAAM,UAAU;GAGhD,MAAM,UAFQ,aAAa,SACN,gBAAgB,KAAK;AAE1C,UAAO,IAAI,OAAO,IAAI,OAAO,KAAK,IAAI,GAAG,QAAQ,CAAC,CAAC;IACnD,CACwB,KAAK,IAAI,CAAC;;AAGtC,SAAQ,KAAK,aAAa;AAC1B,SAAQ,KAAK,UAAU,SAAS,CAAC;AACjC,SAAQ,KAAK,aAAa;AAC1B,WAAU,SAAS,QAAQ;AACzB,UAAQ,KAAK,UAAU,IAAI,CAAC;GAC5B;AACF,SAAQ,KAAK,aAAa;;;;;;;;;AC/B5B,SAAS,mBAAmB,kBAA0B,oBAAqC;AACzF,KAAI,CAAC,iBAAkB,QAAO;AAE9B,KAAIC,sBAAO,MAAM,iBAAiB,IAAIA,sBAAO,UAAU,kBAAkB,mBAAmB,CAC1F,QAAO;CAGT,MAAM,eAAeA,sBAAO,OAAO,iBAAiB;AACpD,QAAO,eAAeA,sBAAO,UAAU,aAAa,SAAS,mBAAmB,GAAG;;;;;AAMrF,SAAS,0BAA0B,aAAqB,aAA6B;AACnF,KAAI;EACF,MAAM,6CAA8B,aAAa,gBAAgB,aAAa,eAAe;AAC7F,MAAI,yBAAY,uBAAuB,CAAE,QAAO;AAGhD,SADoB,KAAK,gCAAmB,wBAAwB,OAAO,CAAC,CACzD,WAAW;SACxB;AACN,SAAO;;;;;;AAOX,SAAS,uBAAuB,aAAoC;CAClE,MAAM,sCAAuB,YAAY;CACzC,MAAM,cAAc,iBAAiB;AAGrC,iDAD6B,cAAc,eAAe,CAC3B,CAC7B,QAAO;AAGT,KAAI,eAAe,iBAAiB,YAClC,QAAO;CAGT,MAAM,oCAAqB,aAAa;AACxC,KAAI,eAAe,aAEjB,QAAO;AAGT,QAAO,uBAAuB,WAAW;;;;;AAM3C,MAAa,uBAAuB,aAAqB,gBAAiC;AACxF,KAAI;EACF,MAAM,gBAAgB,iBAAiB,YAAY;EACnD,MAAM,6CAA8B,QAAQ,KAAK,EAAE,YAAY;EAE/D,MAAM,gEAAoC,qBAAqB,eAAe,CAAC,GAC3E,sBACA,uBAAuB,oBAAoB;AAE/C,MAAI,CAAC,mBAAmB;AACtB,WAAQ,MACN,GAAGC,6BAAc,MAAM,oDAAoD,YAAY,SACxF;AACD,UAAO;;AAGT,MAAI,sBAAsB,oBACxB,SAAQ,KACN,GAAGA,6BAAc,KAAK,2BAA2B,kBAAkB,wBACpE;EAGH,MAAM,cAAc,gBAA6B,mBAAmB,eAAe;AAEnF,MAAI,CAAC,YACH,QAAO;EAGT,MAAM,EAAE,eAAe,EAAE,EAAE,mBAAmB,EAAE,KAAK;EAErD,MAAMC,cAAsD,EAAE;EAC9D,IAAI,cAAc;AAElB,MAAI,eAAe,cACjB,QAAO,QAAQ,cAAc,cAAc,CAAC,SAAS,CAAC,MAAM,wBAAwB;GAClF,MAAM,qBAAqB,0BAA0B,mBAAmB,KAAK;GAC7E,MAAM,wBAAwB,mBAAmB,aAAa,OAAO,mBAAmB;GACxF,MAAM,4BAA4B,mBAChC,iBAAiB,OACjB,mBACD;GACD,MAAM,uBAAuB,mBAAmB,oBAAoB,mBAAmB;AAEvF,OAAK,CAAC,yBAAyB,CAAC,6BAA8B,CAAC,sBAAsB;AACnF,kBAAc;AAEd,gBAAY,QAAQ;KAClB,UAAU;KACV,cAAc,wBACVD,6BAAc,UACd,GAAGA,6BAAc,MAAM,GAAG,aAAa,SAAS;KACpD,kBAAkB,4BACdA,6BAAc,UACd,GAAGA,6BAAc,MAAM,GAAG,iBAAiB,SAAS;KACxD,cAAc,uBACVA,6BAAc,UACd,GAAGA,6BAAc,MAAM,GAAG,sBAAsB;KACrD;;IAEH;AAGJ,MAAI,CAAC,aAAa;AAChB,WAAQ,KACN,GAAGA,6BAAc,MAAM,qDAAqD,YAAY,SACzF;AACD,eAAY,aAAa,UAAU;AAEnC,UAAO;;AAGT,SAAO;UACA,OAAO;AACd,UAAQ,MAAM,6CAA6C,MAAM;AACjE,SAAO;;;;;;;;;AAUX,MAAa,4BACX,aACA,aACA,aAOG;CACH,MAAM,uCAAuB,IAAI,KAAuB;CACxD,MAAME,yBAAmC,EAAE;AAE3C,MAAK,MAAM,UAAU,aAAa;EAChC,MAAM,kCAAmB,QAAQ,KAAK,EAAE,OAAO;EAC/C,MAAM,qDAAyB,UAAU,eAAe,CAAC,GACrD,WACA,uBAAuB,SAAS;AACpC,MAAI,QAAQ;GACV,MAAMC,SAAO,qBAAqB,IAAI,OAAO,IAAI,EAAE;AACnD,UAAK,KAAK,OAAO;AACjB,wBAAqB,IAAI,QAAQA,OAAK;QAEtC,wBAAuB,KAAK,OAAO;;CAIvC,IAAI,YAAY;CAChB,MAAM,0BAAU,IAAI,KAAsB;AAE1C,MAAK,MAAM,CAAC,YAAY,qBAAqB,SAAS,EAAE;EAEtD,MAAM,SAAS,oBAAoB,SAAS,YAAY;AACxD,UAAQ,IAAI,SAAS,OAAO;AAC5B,MAAI,CAAC,OAAQ,aAAY;;CAG3B,MAAM,eAAe,YAAY;CACjC,MAAM,iBAAiB,qBAAqB;CAC5C,MAAM,cAAc,MAAM,KAAK,QAAQ,QAAQ,CAAC,CAAC,OAAO,QAAQ,CAAC;CACjE,MAAM,cAAc,iBAAiB;AAErC,KAAI,uBAAuB,UAAU,CAAC,YACpC,KAAI,CAAC,YACH,UAAS,KAAK,sBAAsB,EAAE,MAAM,0CAA0C,CAAC;MAClF;AACL,WAAS,KAAK,sBAAsB,EAClC,MAAM,6BAA6B,uBAAuB,OAAO,SAC/D,uBAAuB,WAAW,IAAI,MAAM,GAC7C,wCACF,CAAC;AACF,yBAAuB,SAAS,MAAM,QAAQ,MAAM,KAAK,IAAI,CAAC;;MAE3D;EACL,MAAM,aAAa,cAAc,IAAI,aAAa,YAAY,kBAAkB;AAEhF,WAAS,QAAQ,sBAAsB,EACrC,MAAM,kBAAkB,aAAa,SAAS,iBAAiB,IAAI,MAAM,GAAG,UAAU,eAAe,UACnG,mBAAmB,IAAI,MAAM,GAC9B,mBAAmB,YAAY,gBAAgB,cACjD,CAAC;;CAGJ,MAAM,qBAAqB,MAAM,KAAK,QAAQ,SAAS,CAAC,CACrD,QAAQ,GAAG,QAAQ,CAAC,GAAG,CACvB,KAAK,CAAC,UAAU,KAAK;AAExB,QAAO;EAAE;EAAW;EAAS;EAAsB;EAAoB;EAAwB;;;;;;;;;ACxNjG,MAAa,iBAAiB,OAAe,UAAmB;CAC9D,MAAM,YAAY;CAClB,MAAM,YAAY,UAAU,MAAM;CAClC,MAAM,aAAa,WAAW,MAAM;AAEpC,SAAQ,KAAK,GAAG,UAAU,GAAG,UAAU,GAAG,aAAa;;;;;AAMzD,MAAM,uBAAuB,UAAkB,eAAe,IAAI,WAAW,MAAgB;CAC3F,MAAM,uBAAuB;CAC7B,MAAM,sBAAsB;CAC5B,MAAM,YAAY,IAAI,IAAI;EACxB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACD,CAAC;CAEF,MAAM,0BAAU,IAAI,KAAa;AACjC,SAAQ,IAAI,IAAI;CAEhB,MAAM,iBAAiB,SAAiB,QAAQ,MAAY;AAC1D,MAAI,SAAS,SAAU;AAEvB,MAAI;GACF,MAAM,iCAAoB,SAAS,EAAE,eAAe,MAAM,CAAC;AAE3D,QAAK,MAAM,QAAQ,MACjB,KAAI,CAAC,KAAK,KAAK,WAAW,IAAI,IAAI,CAAC,UAAU,IAAI,KAAK,KAAK,EACzD;QAAI,KAAK,aAAa,EAAE;KACtB,MAAM,+BAAgB,SAAS,KAAK,KAAK;KACzC,MAAM,uCAAwB,UAAU,SAAS;AAEjD,SAAI,gBAAgB,CAAC,aAAa,WAAW,KAAK,IAAI,CAAC,aAAa,SAAS,KAAK,EAAE;AAClF,cAAQ,IAAI,aAAa;AACzB,oBAAc,UAAU,QAAQ,EAAE;;;;UAKpC;;AAKV,eAAc,SAAS;CAEvB,MAAM,aAAa,MAAM,KAAK,QAAQ,CAAC,MAAM;AAE7C,KAAI,aAAa,MAAM,EAAE;EACvB,MAAM,aAAa,aAAa,aAAa;AAC7C,SAAO,WACJ,QAAQ,WAAW,OAAO,aAAa,CAAC,SAAS,WAAW,CAAC,CAC7D,MAAM,GAAG,qBAAqB;;AAGnC,QAAO,WAAW,MAAM,GAAG,oBAAoB;;;;;AAMjD,MAAM,gBAAgB,OAAO,aAAuB;CAClD,MAAM,UAAU;CAChB,MAAM,kBAAkB,SAAS,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,KAAK;AAI7E,KAAI,SAAS,WAAW,MAAM,SAAS,OAAO,OAAO,SAAS,OAAO,OAAO;AAM1E,MALsB,qCAAc;GAClC,SAAS;GACT,SAAS;GACV,CAAC,EAEiB;GACjB,MAAM,aAAa,oCAAa;IAC9B,SAAS;IACT,QAAQ,OAAO,gBAAgB;AAI7B,YAFgB,oBADC,QAAQ,KAAK,EACgB,eAAe,GAAG,CAEjD,KAAK,YAAY;MAC9B,MAAM,WAAW,MAAM,uBAAuB;MAC9C,OAAO;MACP,aACE,WAAW,MAAM,8BAA8B,UAAU,OAAO;MACnE,EAAE;;IAEL,WAAW,WAAS;AAClB,SAAI,CAACC,QAAM,MAAM,CAAE,QAAO;KAC1B,MAAM,+BAAgB,QAAQ,KAAK,EAAEA,OAAK;AAC1C,SAAI,yBAAY,SAAS,CAAE,QAAO;AAClC,SAAI,uBAAU,SAAS,CAAC,aAAa,CAAE,QAAO;AAC9C,YAAO;;IAEV,CAAC;AAEF,iBAAc,SAAS,WAAW;AAClC,UAAO,CAAC,WAAW;;AAGrB,gBAAc,SAAS,SAAS,OAAO,OAAO,MAAM,SAAS,GAAG;AAChE,SAAO,CAAC,SAAS,OAAO,OAAO,MAAM,SAAS,GAAG;;AAInD,KAAI,gBAAgB,UAAU,EAC5B,wCAAgB;EACd,UAAU;EACV,SAAS;EACT,SAAS,gBAAgB,KAAK,UAAU;GACtC,MAAM;GACN,OAAO;GACP,SAAS;GACV,EAAE;EACJ,CAAC;AAGJ,QAAO,CAAC,IAAI;;;;;AAMd,MAAM,uBAAuB,OAAO,EAClC,WACA,qBAIqB;CACrB,MAAM,iBAAiB;AAEvB,KAAI,aAAa,eAAe,SAAS,UAAU,EAAE;AACnD,gBAAc,gBAAgB,UAAU;AACxC,SAAO;;AAGT,sCAAY;EACV,SAAS;EACT,SAAS,eAAe,KAAK,UAAU;GAAE,MAAM;GAAM,OAAO;GAAM,EAAE;EACrE,CAAC;;;;;AAMJ,MAAM,iBAAiB,OAAO,EAC5B,WACA,MACA,eAKuB;CACvB,MAAM,cAAc,EAAE;AAEtB,KAAI,yDAA6B,MAAM,UAAU,CAAC,EAAE;AAClD,gBAAc,0BAA0B,UAAU;AAClD,cAAY,KAAK,UAAU;;AAG7B,KAAI,CAAC,YAAY,QAAQ;EACvB,MAAM,oBAAoB,MAAM,cAAc,SAAS;AACvD,cAAY,KAAK,GAAI,qBAAqB,EAAE,CAAE;;AAGhD,QAAO;;;;;AAMT,MAAM,qBAAqB,OAAO,SAAmB;CACnD,MAAM,UAAU;AAChB,KAAI,KAAK,SAAS,QAAQ,IAAI,KAAK,SAAS,YAAY,EAAE;AACxD,gBAAc,SAAS,MAAM;AAC7B,SAAO;;AAGT,uCAAe;EAAE;EAAS,SAAS;EAAO,CAAC;;;;;AAM7C,MAAM,mBAAmB,OAAO,SAAmB;CACjD,MAAM,UAAU;AAEhB,KAAI,KAAK,SAAS,UAAU,EAAE;AAC5B,gBAAc,SAAS,MAAM;AAC7B,SAAO;;AAGT,uCAAe;EAAE;EAAS,SAAS;EAAO,CAAC;;AAG7C,MAAM,yBAAyB,CAAC,mBAAmB,WAAW;;;;AAK9D,MAAM,0BAA0B,OAAO,SAAmB;CACxD,MAAM,UAAU;CAChB,MAAM,qBAAqB,KAAK,WAAW,QAAQ,QAAQ,mBAAmB;CAE9E,IAAIC;AAEJ,KAAI,uBAAuB,MAAM,KAAK,SAAS,qBAAqB,EAClE,iBAAgB,KAAK,qBAAqB;CAG5C,IAAIC;AACJ,KAAI,eAAe;AACjB,gBAAc,SAAS,cAAc;AACrC,iBAAe;OAEf,gBAAe,mCAAY;EACzB;EACA,gBAAgB;EACjB,CAAC;CAGJ,MAAM,cAAc,CAAC,GAAG,uBAAuB;AAC/C,KAAI,cAAc,MAAM,CACtB,aAAY,KAAK,GAAG,aAAa,MAAM,IAAI,CAAC,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC;AAGnE,QAAO,YAAY,KAAK,IAAI;;;;;AAM9B,MAAM,qBAAqB,OAAO,SAAmB;CACnD,MAAM,UAAU;AAEhB,KAAI,KAAK,SAAS,cAAc,EAAE;AAChC,gBAAc,SAAS,MAAM;AAC7B,SAAO;;AAGT,KAAI,KAAK,SAAS,iBAAiB,EAAE;AACnC,gBAAc,SAAS,KAAK;AAC5B,SAAO;;AAGT,uCAAe;EAAE;EAAS,SAAS;EAAM,CAAC;;AAW5C,eAAe,WAAW,EACxB,gBACA,iBACA,UACA,MACA,4BACyC;CACzC,MAAM,OAAO,QAAQ,KAAK,MAAM,EAAE;AAElC,KAAI,4BAA4B,KAAK,OAAO,yBAC1C,MAAK,OAAO;AAsBd,QAAO;EACL,eAnBA,4BACC,MAAM,qBAAqB;GAAE,WAAW,KAAK,MAAM;GAAI;GAAgB,CAAC;EAmBzE,aAhBkB,MAAM,eAAe;GACvC,WAFoB,2BAA4B,KAAK,MAAM,KAAO,KAAK,MAAM;GAG7E;GACA;GACD,CAAC;EAaA,OAXY,oBAAoB,gBAAgB,MAAM,mBAAmB,KAAK,GAAG;EAYjF,SAXc,oBAAoB,gBAAgB,MAAM,iBAAiB,KAAK,GAAG;EAYjF,gBAVA,oBAAoB,WAChB,uBAAuB,KAAK,IAAI,GAChC,MAAM,wBAAwB,KAAK;EASvC,cARmB,oBAAoB,gBAAgB,MAAM,mBAAmB,KAAK,GAAG;EASzF;;AAGH,yBAAe;;;;AC/Sf,eAAe,qBAAqB,eAAuB;CACzD,IAAIC,mBAA4C,EAAE;CAClD,MAAM,eAAe,MAAMC,iBAAG,QAAQ,cAAc;CAEpD,MAAM,iBAAiB,MAAM,QAAQ,IACnC,aAAa,IAAI,OAAO,SAAS;EAE/B,MAAM,kBAAmB,MAAM,OADTC,kBAAK,KAAK,eAAe,MAAM,iBAAiB;AAEtE,qBAAmB;GAAE,GAAG;IAAmB,OAAO,gBAAgB,QAAQ;GAAS;AACnF,SAAO;GACP,CACH;AAED,QAAO;EAAE;EAAkB;EAAgB;;AAG7C,mCAAe;;;;AC9Bf,MAAM,cAAcC,kBAAK,QAAQ,QAAQ,KAAK,EAAE,qBAAqB;AAErE,MAAM,qBAAqB,OAAO,UAAkB,YAAmC;CAErF,MAAM,aADY,iBAAiB,KAAK,QAAQ,GACjB;CAE/B,MAAM,eAAe,QAAQ,QAAQ,iBAAiB,GAAG;CACzD,MAAM,WAAW,aAAa,IAAI,eAAe;AAKjD,KAAI;AACF,QAAMC,yBAAG,OAAO,YAAY;AAE5B,GADwB,MAAMA,yBAAG,SAAS,aAAa,OAAO,EAC/B,MAAM;SAC/B;CAKR,MAAM,OAAO,QAAQ;CACrB,MAAM,iBAAiB,KAAK,WAAW,QAAQ,IAAI,SAAS,iBAAiB,CAAC;AAC9E,KAAI,kBAAkB,GAAG;EACvB,MAAM,gBAAgB,KAAK;EAC3B,MAAM,eAAeD,kBAAK,QAAQ,cAAc;AAChD,EAAmBA,kBAAK,SAAS,aAAa;;CAGhD,MAAM,UAAU,IAAI,WAAW,SAAS,IAAI,aAAa;AACzD,OAAMC,yBAAG,WAAW,aAAa,SAAS,OAAO;;AAGnD,iCAAe;;;;AC7Bf,eAAe,UAAU,GAAiD;AACxE,SAAQ,EAAE,MAAV;EACE,KAAK,SACH,sCAAc;GACZ,SAAS,EAAE;GACX,UAAU,EAAE,WAAW,EAAE,EAAE,KAAK,OAAO;IAAE,MAAM,EAAE;IAAM,OAAO,EAAE;IAAO,EAAE;GACzE,SAAS,EAAE;GACZ,CAAC;EACJ,KAAK,UACH,uCAAe;GACb,SAAS,EAAE;GACX,SAAS,OAAO,EAAE,YAAY,YAAY,EAAE,UAAU;GACvD,CAAC;EACJ,KAAK;EACL,QACE,qCAAa;GACX,SAAS,EAAE;GACX,SAAU,EAAE,WAAsB;GACnC,CAAC;;;AAIR,eAAsB,oBAAoB,aAAuC;CAC/E,MAAM,SAAS,iBAAiB,YAAY;AAC5C,KAAI,CAAC,QAAQ,SAAS,OAAQ,QAAO,EAAE;CAEvC,MAAMC,UAAmB,EAAE;AAE3B,MAAK,MAAM,UAAU,OAAO,QAC1B,KAAI;AACF,UAAQ,OAAO,OAAO,MAAM,UAAU,OAAO;UACtC,OAAO;AACd,UAAQ,KACN,6BAA6B,OAAO,IAAI,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,MAAM,GACpG;AAED,MAAI,OAAO,YAAY,QAAW;AAChC,WAAQ,KAAK,4BAA4B,OAAO,IAAI,KAAK,OAAO,UAAU;AAC1E,WAAQ,OAAO,OAAO,OAAO;QAE7B,SAAQ,KAAK,oBAAoB,OAAO,IAAI,gCAAgC;;AAIlF,QAAO;;;;;AC9CT,MAAM,uBAAuB;AAE7B,SAAgB,uBAA6B;CAC3C,MAAM,qBAAqBC,kBAAK,QAAQ,QAAQ,IAAI,QAAQ,IAAI,qBAAqB;AAErF,KAAI,CAACC,gBAAG,WAAW,mBAAmB,CACpC,OAAM,IAAI,MACR,GAAGC,6BAAc,MAAM,6DAA6D,mBAAmB,8IAExG"}
package/dist/index.js CHANGED
@@ -1,6 +1,6 @@
1
1
  #!/usr/bin/env node
2
2
  const require_common = require('./common-DdEQmI2h.js');
3
- const require_helpers = require('./helpers-DieQS_ke.js');
3
+ const require_helpers = require('./helpers-Cj5geKJl.js');
4
4
  let node_child_process = require("node:child_process");
5
5
  let node_fs_promises = require("node:fs/promises");
6
6
  node_fs_promises = require_common.__toESM(node_fs_promises);
package/dist/transforms/button/transformer.js CHANGED
@@ -1,5 +1,5 @@
1
1
  Object.defineProperty(exports, '__esModule', { value: true });
2
- const require_helpers = require('../../helpers-DieQS_ke.js');
2
+ const require_helpers = require('../../helpers-Cj5geKJl.js');
3
3
 
4
4
  //#region src/helpers/jscodeshift/addImport.ts
5
5
  /**
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@wise/wds-codemods",
3
- "version": "1.2.0-experimental-1b969bf",
3
+ "version": "1.2.0-experimental-e723c4b",
4
4
  "license": "UNLICENSED",
5
5
  "author": "Wise Payments Ltd.",
6
6
  "repository": {
@@ -34,7 +34,7 @@
34
34
  "test:watch": "jest --watch"
35
35
  },
36
36
  "dependencies": {
37
- "@anthropic-ai/claude-agent-sdk": "^0.1.73",
37
+ "@anthropic-ai/claude-agent-sdk": "^0.2.87",
38
38
  "@inquirer/prompts": "^7.10.1",
39
39
  "@listr2/manager": "^3.0.5",
40
40
  "@types/spinnies": "^0.5.3",
@@ -44,30 +44,30 @@
44
44
  },
45
45
  "devDependencies": {
46
46
  "@anthropic-ai/sdk": "^0.71.2",
47
- "@babel/core": "^7.29.0",
47
+ "@babel/core": "^7.28.5",
48
48
  "@babel/plugin-syntax-import-meta": "^7.10.4",
49
- "@babel/preset-env": "^7.29.2",
49
+ "@babel/preset-env": "^7.28.5",
50
50
  "@babel/preset-typescript": "^7.28.5",
51
51
  "@changesets/changelog-github": "^0.5.2",
52
52
  "@changesets/cli": "^2.29.8",
53
- "@commitlint/cli": "^20.5.0",
54
- "@commitlint/config-conventional": "^20.5.0",
53
+ "@commitlint/cli": "^20.2.0",
54
+ "@commitlint/config-conventional": "^20.2.0",
55
55
  "@inquirer/testing": "^2.1.53",
56
- "@jest/globals": "^30.3.0",
56
+ "@jest/globals": "^30.2.0",
57
57
  "@transferwise/components": "^46.118.0",
58
58
  "@types/jest": "^30.0.0",
59
59
  "@types/jscodeshift": "^17.3.0",
60
- "@types/node": "^24.12.0",
60
+ "@types/node": "^24.10.4",
61
61
  "@types/semver": "^7.7.1",
62
62
  "@wise/eslint-config": "^13.3.0",
63
- "babel-jest": "^30.3.0",
63
+ "babel-jest": "^30.2.0",
64
64
  "babel-plugin-transform-import-meta": "^2.3.3",
65
65
  "eslint": "^9.39.2",
66
66
  "husky": "^9.1.7",
67
- "jest": "^30.3.0",
67
+ "jest": "^30.2.0",
68
68
  "jest-file-snapshot": "^0.7.0",
69
- "prettier": "^3.8.1",
70
- "semver": "^7.7.4",
69
+ "prettier": "^3.7.4",
70
+ "semver": "^7.7.3",
71
71
  "ts-jest": "^29.4.6",
72
72
  "ts-node": "^10.9.2",
73
73
  "tsdown": "^0.18.1",
@@ -76,7 +76,7 @@
76
76
  "publishConfig": {
77
77
  "access": "public"
78
78
  },
79
- "packageManager": "pnpm@10.33.0",
79
+ "packageManager": "pnpm@10.24.0",
80
80
  "engines": {
81
81
  "node": "^24"
82
82
  }
package/dist/helpers-DieQS_ke.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"file":"helpers-DieQS_ke.js","names":["list","list","exec","path","tableData: string[][]","semver","CONSOLE_ICONS","comparisons: Record<string, Record<string, string>>","failedTargetsNoPackage: string[]","list","path","ignorePattern: string | undefined","userPatterns: string","transformModules: Record<string, unknown>","fs","path","path","fs","answers: Answers","path","fs","CONSOLE_ICONS"],"sources":["../node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/constants.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/debug.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/re.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/parse-options.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/identifiers.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/classes/semver.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/parse.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/valid.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/clean.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/inc.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/diff.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/major.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/minor.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/patch.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/prerelease.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/compare.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/rcompare.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/compare-loose.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/compare-build.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/sort.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/rsort.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/gt.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/lt.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/eq.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/neq.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/gte.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/lte.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/cmp.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/coerce.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/lrucache.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/classes/range.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/classes/comparator.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/satisfies.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/to-comparators.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/max-satisfying.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/min-satisfying.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/min-version.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/valid.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/outside.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/gtr.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/ltr.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/intersects.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/simplify.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/subset.js","../node_modules/.pnpm/semver@7.7.4/node_modules/semver/index.js","../src/controller/helpers/getCodemodConfig.ts","../src/controller/helpers/repository.ts","../src/controller/helpers/table.ts","../src/controller/helpers/dependencyChecks.ts","../src/controller/helpers/getOptions.ts","../src/controller/helpers/loadTransformModules.ts","../src/controller/helpers/reportManualReview.ts","../src/controller/helpers/runTransformPrompts.ts","../src/controller/helpers/validateClaudeConfig.ts"],"sourcesContent":["'use strict'\n\n// Note: this is the semver.org version of the spec that it implements\n// Not necessarily the package version of this code.\nconst SEMVER_SPEC_VERSION = '2.0.0'\n\nconst MAX_LENGTH = 256\nconst MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||\n/* istanbul ignore next */ 9007199254740991\n\n// Max safe segment length for coercion.\nconst MAX_SAFE_COMPONENT_LENGTH = 16\n\n// Max safe length for a build identifier. The max length minus 6 characters for\n// the shortest version with a build 0.0.0+BUILD.\nconst MAX_SAFE_BUILD_LENGTH = MAX_LENGTH - 6\n\nconst RELEASE_TYPES = [\n 'major',\n 'premajor',\n 'minor',\n 'preminor',\n 'patch',\n 'prepatch',\n 'prerelease',\n]\n\nmodule.exports = {\n MAX_LENGTH,\n MAX_SAFE_COMPONENT_LENGTH,\n MAX_SAFE_BUILD_LENGTH,\n MAX_SAFE_INTEGER,\n RELEASE_TYPES,\n SEMVER_SPEC_VERSION,\n FLAG_INCLUDE_PRERELEASE: 0b001,\n FLAG_LOOSE: 0b010,\n}\n","'use strict'\n\nconst debug = (\n typeof process === 'object' &&\n process.env &&\n process.env.NODE_DEBUG &&\n /\\bsemver\\b/i.test(process.env.NODE_DEBUG)\n) ? (...args) => console.error('SEMVER', ...args)\n : () => {}\n\nmodule.exports = debug\n","'use strict'\n\nconst {\n MAX_SAFE_COMPONENT_LENGTH,\n MAX_SAFE_BUILD_LENGTH,\n MAX_LENGTH,\n} = require('./constants')\nconst debug = require('./debug')\nexports = module.exports = {}\n\n// The actual regexps go on exports.re\nconst re = exports.re = []\nconst safeRe = exports.safeRe = []\nconst src = exports.src = []\nconst safeSrc = exports.safeSrc = []\nconst t = exports.t = {}\nlet R = 0\n\nconst LETTERDASHNUMBER = '[a-zA-Z0-9-]'\n\n// Replace some greedy regex tokens to prevent regex dos issues. These regex are\n// used internally via the safeRe object since all inputs in this library get\n// normalized first to trim and collapse all extra whitespace. The original\n// regexes are exported for userland consumption and lower level usage. A\n// future breaking change could export the safer regex only with a note that\n// all input should have extra whitespace removed.\nconst safeRegexReplacements = [\n ['\\\\s', 1],\n ['\\\\d', MAX_LENGTH],\n [LETTERDASHNUMBER, MAX_SAFE_BUILD_LENGTH],\n]\n\nconst makeSafeRegex = (value) => {\n for (const [token, max] of safeRegexReplacements) {\n value = value\n .split(`${token}*`).join(`${token}{0,${max}}`)\n .split(`${token}+`).join(`${token}{1,${max}}`)\n }\n return value\n}\n\nconst createToken = (name, value, isGlobal) => {\n const safe = makeSafeRegex(value)\n const index = R++\n debug(name, index, value)\n t[name] = index\n src[index] = value\n safeSrc[index] = safe\n re[index] = new RegExp(value, isGlobal ? 'g' : undefined)\n safeRe[index] = new RegExp(safe, isGlobal ? 'g' : undefined)\n}\n\n// The following Regular Expressions can be used for tokenizing,\n// validating, and parsing SemVer version strings.\n\n// ## Numeric Identifier\n// A single `0`, or a non-zero digit followed by zero or more digits.\n\ncreateToken('NUMERICIDENTIFIER', '0|[1-9]\\\\d*')\ncreateToken('NUMERICIDENTIFIERLOOSE', '\\\\d+')\n\n// ## Non-numeric Identifier\n// Zero or more digits, followed by a letter or hyphen, and then zero or\n// more letters, digits, or hyphens.\n\ncreateToken('NONNUMERICIDENTIFIER', `\\\\d*[a-zA-Z-]${LETTERDASHNUMBER}*`)\n\n// ## Main Version\n// Three dot-separated numeric identifiers.\n\ncreateToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version Identifier\n// A numeric identifier, or a non-numeric identifier.\n// Non-numeric identifiers include numeric identifiers but can be longer.\n// Therefore non-numeric identifiers must go first.\n\ncreateToken('PRERELEASEIDENTIFIER', `(?:${src[t.NONNUMERICIDENTIFIER]\n}|${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NONNUMERICIDENTIFIER]\n}|${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version\n// Hyphen, followed by one or more dot-separated pre-release version\n// identifiers.\n\ncreateToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIER]})*))`)\n\ncreateToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`)\n\n// ## Build Metadata Identifier\n// Any combination of digits, letters, or hyphens.\n\ncreateToken('BUILDIDENTIFIER', `${LETTERDASHNUMBER}+`)\n\n// ## Build Metadata\n// Plus sign, followed by one or more period-separated build metadata\n// identifiers.\n\ncreateToken('BUILD', `(?:\\\\+(${src[t.BUILDIDENTIFIER]\n}(?:\\\\.${src[t.BUILDIDENTIFIER]})*))`)\n\n// ## Full Version String\n// A main version, followed optionally by a pre-release version and\n// build metadata.\n\n// Note that the only major, minor, patch, and pre-release sections of\n// the version string are capturing groups. The build metadata is not a\n// capturing group, because it should not ever be used in version\n// comparison.\n\ncreateToken('FULLPLAIN', `v?${src[t.MAINVERSION]\n}${src[t.PRERELEASE]}?${\n src[t.BUILD]}?`)\n\ncreateToken('FULL', `^${src[t.FULLPLAIN]}$`)\n\n// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.\n// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty\n// common in the npm registry.\ncreateToken('LOOSEPLAIN', `[v=\\\\s]*${src[t.MAINVERSIONLOOSE]\n}${src[t.PRERELEASELOOSE]}?${\n src[t.BUILD]}?`)\n\ncreateToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`)\n\ncreateToken('GTLT', '((?:<|>)?=?)')\n\n// Something like \"2.*\" or \"1.2.x\".\n// Note that \"x.x\" is a valid xRange identifer, meaning \"any version\"\n// Only the first item is strictly required.\ncreateToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\\\*`)\ncreateToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\\\*`)\n\ncreateToken('XRANGEPLAIN', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIER]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n `(?:${src[t.PRERELEASE]})?${\n src[t.BUILD]}?` +\n `)?)?`)\n\ncreateToken('XRANGEPLAINLOOSE', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:${src[t.PRERELEASELOOSE]})?${\n src[t.BUILD]}?` +\n `)?)?`)\n\ncreateToken('XRANGE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAIN]}$`)\ncreateToken('XRANGELOOSE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Coercion.\n// Extract anything that could conceivably be a part of a valid semver\ncreateToken('COERCEPLAIN', `${'(^|[^\\\\d])' +\n '(\\\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +\n `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?`)\ncreateToken('COERCE', `${src[t.COERCEPLAIN]}(?:$|[^\\\\d])`)\ncreateToken('COERCEFULL', src[t.COERCEPLAIN] +\n `(?:${src[t.PRERELEASE]})?` +\n `(?:${src[t.BUILD]})?` +\n `(?:$|[^\\\\d])`)\ncreateToken('COERCERTL', src[t.COERCE], true)\ncreateToken('COERCERTLFULL', src[t.COERCEFULL], true)\n\n// Tilde ranges.\n// Meaning is \"reasonably at or greater than\"\ncreateToken('LONETILDE', '(?:~>?)')\n\ncreateToken('TILDETRIM', `(\\\\s*)${src[t.LONETILDE]}\\\\s+`, true)\nexports.tildeTrimReplace = '$1~'\n\ncreateToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Caret ranges.\n// Meaning is \"at least and backwards compatible with\"\ncreateToken('LONECARET', '(?:\\\\^)')\n\ncreateToken('CARETTRIM', `(\\\\s*)${src[t.LONECARET]}\\\\s+`, true)\nexports.caretTrimReplace = '$1^'\n\ncreateToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// A simple gt/lt/eq thing, or just \"\" to indicate \"any version\"\ncreateToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\\\s*(${src[t.LOOSEPLAIN]})$|^$`)\ncreateToken('COMPARATOR', `^${src[t.GTLT]}\\\\s*(${src[t.FULLPLAIN]})$|^$`)\n\n// An expression to strip any whitespace between the gtlt and the thing\n// it modifies, so that `> 1.2.3` ==> `>1.2.3`\ncreateToken('COMPARATORTRIM', `(\\\\s*)${src[t.GTLT]\n}\\\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true)\nexports.comparatorTrimReplace = '$1$2$3'\n\n// Something like `1.2.3 - 1.2.4`\n// Note that these all use the loose form, because they'll be\n// checked against either the strict or loose comparator form\n// later.\ncreateToken('HYPHENRANGE', `^\\\\s*(${src[t.XRANGEPLAIN]})` +\n `\\\\s+-\\\\s+` +\n `(${src[t.XRANGEPLAIN]})` +\n `\\\\s*$`)\n\ncreateToken('HYPHENRANGELOOSE', `^\\\\s*(${src[t.XRANGEPLAINLOOSE]})` +\n `\\\\s+-\\\\s+` +\n `(${src[t.XRANGEPLAINLOOSE]})` +\n `\\\\s*$`)\n\n// Star ranges basically just allow anything at all.\ncreateToken('STAR', '(<|>)?=?\\\\s*\\\\*')\n// >=0.0.0 is like a star\ncreateToken('GTE0', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0\\\\s*$')\ncreateToken('GTE0PRE', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0-0\\\\s*$')\n","'use strict'\n\n// parse out just the options we care about\nconst looseOption = Object.freeze({ loose: true })\nconst emptyOpts = Object.freeze({ })\nconst parseOptions = options => {\n if (!options) {\n return emptyOpts\n }\n\n if (typeof options !== 'object') {\n return looseOption\n }\n\n return options\n}\nmodule.exports = parseOptions\n","'use strict'\n\nconst numeric = /^[0-9]+$/\nconst compareIdentifiers = (a, b) => {\n if (typeof a === 'number' && typeof b === 'number') {\n return a === b ? 0 : a < b ? -1 : 1\n }\n\n const anum = numeric.test(a)\n const bnum = numeric.test(b)\n\n if (anum && bnum) {\n a = +a\n b = +b\n }\n\n return a === b ? 0\n : (anum && !bnum) ? -1\n : (bnum && !anum) ? 1\n : a < b ? -1\n : 1\n}\n\nconst rcompareIdentifiers = (a, b) => compareIdentifiers(b, a)\n\nmodule.exports = {\n compareIdentifiers,\n rcompareIdentifiers,\n}\n","'use strict'\n\nconst debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n constructor (version, options) {\n options = parseOptions(options)\n\n if (version instanceof SemVer) {\n if (version.loose === !!options.loose &&\n version.includePrerelease === !!options.includePrerelease) {\n return version\n } else {\n version = version.version\n }\n } else if (typeof version !== 'string') {\n throw new TypeError(`Invalid version. Must be a string. Got type \"${typeof version}\".`)\n }\n\n if (version.length > MAX_LENGTH) {\n throw new TypeError(\n `version is longer than ${MAX_LENGTH} characters`\n )\n }\n\n debug('SemVer', version, options)\n this.options = options\n this.loose = !!options.loose\n // this isn't actually relevant for versions, but keep it so that we\n // don't run into trouble passing this.options around.\n this.includePrerelease = !!options.includePrerelease\n\n const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n if (!m) {\n throw new TypeError(`Invalid Version: ${version}`)\n }\n\n this.raw = version\n\n // these are actually numbers\n this.major = +m[1]\n this.minor = +m[2]\n this.patch = +m[3]\n\n if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n throw new TypeError('Invalid major version')\n }\n\n if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n throw new TypeError('Invalid minor version')\n }\n\n if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n throw new TypeError('Invalid patch version')\n }\n\n // numberify any prerelease numeric ids\n if (!m[4]) {\n this.prerelease = []\n } else {\n this.prerelease = m[4].split('.').map((id) => {\n if (/^[0-9]+$/.test(id)) {\n const num = +id\n if (num >= 0 && num < MAX_SAFE_INTEGER) {\n return num\n }\n }\n return id\n })\n }\n\n this.build = m[5] ? m[5].split('.') : []\n this.format()\n }\n\n format () {\n this.version = `${this.major}.${this.minor}.${this.patch}`\n if (this.prerelease.length) {\n this.version += `-${this.prerelease.join('.')}`\n }\n return this.version\n }\n\n toString () {\n return this.version\n }\n\n compare (other) {\n debug('SemVer.compare', this.version, this.options, other)\n if (!(other instanceof SemVer)) {\n if (typeof other === 'string' && other === this.version) {\n return 0\n }\n other = new SemVer(other, this.options)\n }\n\n if (other.version === this.version) {\n return 0\n }\n\n return this.compareMain(other) || this.comparePre(other)\n }\n\n compareMain (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n if (this.major < other.major) {\n return -1\n }\n if (this.major > other.major) {\n return 1\n }\n if (this.minor < other.minor) {\n return -1\n }\n if (this.minor > other.minor) {\n return 1\n }\n if (this.patch < other.patch) {\n return -1\n }\n if (this.patch > other.patch) {\n return 1\n }\n return 0\n }\n\n comparePre (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n // NOT having a prerelease is > having one\n if (this.prerelease.length && !other.prerelease.length) {\n return -1\n } else if (!this.prerelease.length && other.prerelease.length) {\n return 1\n } else if (!this.prerelease.length && !other.prerelease.length) {\n return 0\n }\n\n let i = 0\n do {\n const a = this.prerelease[i]\n const b = other.prerelease[i]\n debug('prerelease compare', i, a, b)\n if (a === undefined && b === undefined) {\n return 0\n } else if (b === undefined) {\n return 1\n } else if (a === undefined) {\n return -1\n } else if (a === b) {\n continue\n } else {\n return compareIdentifiers(a, b)\n }\n } while (++i)\n }\n\n compareBuild (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n let i = 0\n do {\n const a = this.build[i]\n const b = other.build[i]\n debug('build compare', i, a, b)\n if (a === undefined && b === undefined) {\n return 0\n } else if (b === undefined) {\n return 1\n } else if (a === undefined) {\n return -1\n } else if (a === b) {\n continue\n } else {\n return compareIdentifiers(a, b)\n }\n } while (++i)\n }\n\n // preminor will bump the version up to the next minor release, and immediately\n // down to pre-release. premajor and prepatch work the same way.\n inc (release, identifier, identifierBase) {\n if (release.startsWith('pre')) {\n if (!identifier && identifierBase === false) {\n throw new Error('invalid increment argument: identifier is empty')\n }\n // Avoid an invalid semver results\n if (identifier) {\n const match = `-${identifier}`.match(this.options.loose ? re[t.PRERELEASELOOSE] : re[t.PRERELEASE])\n if (!match || match[1] !== identifier) {\n throw new Error(`invalid identifier: ${identifier}`)\n }\n }\n }\n\n switch (release) {\n case 'premajor':\n this.prerelease.length = 0\n this.patch = 0\n this.minor = 0\n this.major++\n this.inc('pre', identifier, identifierBase)\n break\n case 'preminor':\n this.prerelease.length = 0\n this.patch = 0\n this.minor++\n this.inc('pre', identifier, identifierBase)\n break\n case 'prepatch':\n // If this is already a prerelease, it will bump to the next version\n // drop any prereleases that might already exist, since they are not\n // relevant at this point.\n this.prerelease.length = 0\n this.inc('patch', identifier, identifierBase)\n this.inc('pre', identifier, identifierBase)\n break\n // If the input is a non-prerelease version, this acts the same as\n // prepatch.\n case 'prerelease':\n if (this.prerelease.length === 0) {\n this.inc('patch', identifier, identifierBase)\n }\n this.inc('pre', identifier, identifierBase)\n break\n case 'release':\n if (this.prerelease.length === 0) {\n throw new Error(`version ${this.raw} is not a prerelease`)\n }\n this.prerelease.length = 0\n break\n\n case 'major':\n // If this is a pre-major version, bump up to the same major version.\n // Otherwise increment major.\n // 1.0.0-5 bumps to 1.0.0\n // 1.1.0 bumps to 2.0.0\n if (\n this.minor !== 0 ||\n this.patch !== 0 ||\n this.prerelease.length === 0\n ) {\n this.major++\n }\n this.minor = 0\n this.patch = 0\n this.prerelease = []\n break\n case 'minor':\n // If this is a pre-minor version, bump up to the same minor version.\n // Otherwise increment minor.\n // 1.2.0-5 bumps to 1.2.0\n // 1.2.1 bumps to 1.3.0\n if (this.patch !== 0 || this.prerelease.length === 0) {\n this.minor++\n }\n this.patch = 0\n this.prerelease = []\n break\n case 'patch':\n // If this is not a pre-release version, it will increment the patch.\n // If it is a pre-release it will bump up to the same patch version.\n // 1.2.0-5 patches to 1.2.0\n // 1.2.0 patches to 1.2.1\n if (this.prerelease.length === 0) {\n this.patch++\n }\n this.prerelease = []\n break\n // This probably shouldn't be used publicly.\n // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n case 'pre': {\n const base = Number(identifierBase) ? 1 : 0\n\n if (this.prerelease.length === 0) {\n this.prerelease = [base]\n } else {\n let i = this.prerelease.length\n while (--i >= 0) {\n if (typeof this.prerelease[i] === 'number') {\n this.prerelease[i]++\n i = -2\n }\n }\n if (i === -1) {\n // didn't increment anything\n if (identifier === this.prerelease.join('.') && identifierBase === false) {\n throw new Error('invalid increment argument: identifier already exists')\n }\n this.prerelease.push(base)\n }\n }\n if (identifier) {\n // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n let prerelease = [identifier, base]\n if (identifierBase === false) {\n prerelease = [identifier]\n }\n if (compareIdentifiers(this.prerelease[0], identifier) === 0) {\n if (isNaN(this.prerelease[1])) {\n this.prerelease = prerelease\n }\n } else {\n this.prerelease = prerelease\n }\n }\n break\n }\n default:\n throw new Error(`invalid increment argument: ${release}`)\n }\n this.raw = this.format()\n if (this.build.length) {\n this.raw += `+${this.build.join('.')}`\n }\n return this\n }\n}\n\nmodule.exports = SemVer\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst parse = (version, options, throwErrors = false) => {\n if (version instanceof SemVer) {\n return version\n }\n try {\n return new SemVer(version, options)\n } catch (er) {\n if (!throwErrors) {\n return null\n }\n throw er\n }\n}\n\nmodule.exports = parse\n","'use strict'\n\nconst parse = require('./parse')\nconst valid = (version, options) => {\n const v = parse(version, options)\n return v ? v.version : null\n}\nmodule.exports = valid\n","'use strict'\n\nconst parse = require('./parse')\nconst clean = (version, options) => {\n const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n return s ? s.version : null\n}\nmodule.exports = clean\n","'use strict'\n\nconst SemVer = require('../classes/semver')\n\nconst inc = (version, release, options, identifier, identifierBase) => {\n if (typeof (options) === 'string') {\n identifierBase = identifier\n identifier = options\n options = undefined\n }\n\n try {\n return new SemVer(\n version instanceof SemVer ? version.version : version,\n options\n ).inc(release, identifier, identifierBase).version\n } catch (er) {\n return null\n }\n}\nmodule.exports = inc\n","'use strict'\n\nconst parse = require('./parse.js')\n\nconst diff = (version1, version2) => {\n const v1 = parse(version1, null, true)\n const v2 = parse(version2, null, true)\n const comparison = v1.compare(v2)\n\n if (comparison === 0) {\n return null\n }\n\n const v1Higher = comparison > 0\n const highVersion = v1Higher ? v1 : v2\n const lowVersion = v1Higher ? v2 : v1\n const highHasPre = !!highVersion.prerelease.length\n const lowHasPre = !!lowVersion.prerelease.length\n\n if (lowHasPre && !highHasPre) {\n // Going from prerelease -> no prerelease requires some special casing\n\n // If the low version has only a major, then it will always be a major\n // Some examples:\n // 1.0.0-1 -> 1.0.0\n // 1.0.0-1 -> 1.1.1\n // 1.0.0-1 -> 2.0.0\n if (!lowVersion.patch && !lowVersion.minor) {\n return 'major'\n }\n\n // If the main part has no difference\n if (lowVersion.compareMain(highVersion) === 0) {\n if (lowVersion.minor && !lowVersion.patch) {\n return 'minor'\n }\n return 'patch'\n }\n }\n\n // add the `pre` prefix if we are going to a prerelease version\n const prefix = highHasPre ? 'pre' : ''\n\n if (v1.major !== v2.major) {\n return prefix + 'major'\n }\n\n if (v1.minor !== v2.minor) {\n return prefix + 'minor'\n }\n\n if (v1.patch !== v2.patch) {\n return prefix + 'patch'\n }\n\n // high and low are prereleases\n return 'prerelease'\n}\n\nmodule.exports = diff\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst major = (a, loose) => new SemVer(a, loose).major\nmodule.exports = major\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst minor = (a, loose) => new SemVer(a, loose).minor\nmodule.exports = minor\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst patch = (a, loose) => new SemVer(a, loose).patch\nmodule.exports = patch\n","'use strict'\n\nconst parse = require('./parse')\nconst prerelease = (version, options) => {\n const parsed = parse(version, options)\n return (parsed && parsed.prerelease.length) ? parsed.prerelease : null\n}\nmodule.exports = prerelease\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst compare = (a, b, loose) =>\n new SemVer(a, loose).compare(new SemVer(b, loose))\n\nmodule.exports = compare\n","'use strict'\n\nconst compare = require('./compare')\nconst rcompare = (a, b, loose) => compare(b, a, loose)\nmodule.exports = rcompare\n","'use strict'\n\nconst compare = require('./compare')\nconst compareLoose = (a, b) => compare(a, b, true)\nmodule.exports = compareLoose\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst compareBuild = (a, b, loose) => {\n const versionA = new SemVer(a, loose)\n const versionB = new SemVer(b, loose)\n return versionA.compare(versionB) || versionA.compareBuild(versionB)\n}\nmodule.exports = compareBuild\n","'use strict'\n\nconst compareBuild = require('./compare-build')\nconst sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose))\nmodule.exports = sort\n","'use strict'\n\nconst compareBuild = require('./compare-build')\nconst rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose))\nmodule.exports = rsort\n","'use strict'\n\nconst compare = require('./compare')\nconst gt = (a, b, loose) => compare(a, b, loose) > 0\nmodule.exports = gt\n","'use strict'\n\nconst compare = require('./compare')\nconst lt = (a, b, loose) => compare(a, b, loose) < 0\nmodule.exports = lt\n","'use strict'\n\nconst compare = require('./compare')\nconst eq = (a, b, loose) => compare(a, b, loose) === 0\nmodule.exports = eq\n","'use strict'\n\nconst compare = require('./compare')\nconst neq = (a, b, loose) => compare(a, b, loose) !== 0\nmodule.exports = neq\n","'use strict'\n\nconst compare = require('./compare')\nconst gte = (a, b, loose) => compare(a, b, loose) >= 0\nmodule.exports = gte\n","'use strict'\n\nconst compare = require('./compare')\nconst lte = (a, b, loose) => compare(a, b, loose) <= 0\nmodule.exports = lte\n","'use strict'\n\nconst eq = require('./eq')\nconst neq = require('./neq')\nconst gt = require('./gt')\nconst gte = require('./gte')\nconst lt = require('./lt')\nconst lte = require('./lte')\n\nconst cmp = (a, op, b, loose) => {\n switch (op) {\n case '===':\n if (typeof a === 'object') {\n a = a.version\n }\n if (typeof b === 'object') {\n b = b.version\n }\n return a === b\n\n case '!==':\n if (typeof a === 'object') {\n a = a.version\n }\n if (typeof b === 'object') {\n b = b.version\n }\n return a !== b\n\n case '':\n case '=':\n case '==':\n return eq(a, b, loose)\n\n case '!=':\n return neq(a, b, loose)\n\n case '>':\n return gt(a, b, loose)\n\n case '>=':\n return gte(a, b, loose)\n\n case '<':\n return lt(a, b, loose)\n\n case '<=':\n return lte(a, b, loose)\n\n default:\n throw new TypeError(`Invalid operator: ${op}`)\n }\n}\nmodule.exports = cmp\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst parse = require('./parse')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst coerce = (version, options) => {\n if (version instanceof SemVer) {\n return version\n }\n\n if (typeof version === 'number') {\n version = String(version)\n }\n\n if (typeof version !== 'string') {\n return null\n }\n\n options = options || {}\n\n let match = null\n if (!options.rtl) {\n match = version.match(options.includePrerelease ? re[t.COERCEFULL] : re[t.COERCE])\n } else {\n // Find the right-most coercible string that does not share\n // a terminus with a more left-ward coercible string.\n // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'\n // With includePrerelease option set, '1.2.3.4-rc' wants to coerce '2.3.4-rc', not '2.3.4'\n //\n // Walk through the string checking with a /g regexp\n // Manually set the index so as to pick up overlapping matches.\n // Stop when we get a match that ends at the string end, since no\n // coercible string can be more right-ward without the same terminus.\n const coerceRtlRegex = options.includePrerelease ? re[t.COERCERTLFULL] : re[t.COERCERTL]\n let next\n while ((next = coerceRtlRegex.exec(version)) &&\n (!match || match.index + match[0].length !== version.length)\n ) {\n if (!match ||\n next.index + next[0].length !== match.index + match[0].length) {\n match = next\n }\n coerceRtlRegex.lastIndex = next.index + next[1].length + next[2].length\n }\n // leave it in a clean state\n coerceRtlRegex.lastIndex = -1\n }\n\n if (match === null) {\n return null\n }\n\n const major = match[2]\n const minor = match[3] || '0'\n const patch = match[4] || '0'\n const prerelease = options.includePrerelease && match[5] ? `-${match[5]}` : ''\n const build = options.includePrerelease && match[6] ? `+${match[6]}` : ''\n\n return parse(`${major}.${minor}.${patch}${prerelease}${build}`, options)\n}\nmodule.exports = coerce\n","'use strict'\n\nclass LRUCache {\n constructor () {\n this.max = 1000\n this.map = new Map()\n }\n\n get (key) {\n const value = this.map.get(key)\n if (value === undefined) {\n return undefined\n } else {\n // Remove the key from the map and add it to the end\n this.map.delete(key)\n this.map.set(key, value)\n return value\n }\n }\n\n delete (key) {\n return this.map.delete(key)\n }\n\n set (key, value) {\n const deleted = this.delete(key)\n\n if (!deleted && value !== undefined) {\n // If cache is full, delete the least recently used item\n if (this.map.size >= this.max) {\n const firstKey = this.map.keys().next().value\n this.delete(firstKey)\n }\n\n this.map.set(key, value)\n }\n\n return this\n }\n}\n\nmodule.exports = LRUCache\n","'use strict'\n\nconst SPACE_CHARACTERS = /\\s+/g\n\n// hoisted class for cyclic dependency\nclass Range {\n constructor (range, options) {\n options = parseOptions(options)\n\n if (range instanceof Range) {\n if (\n range.loose === !!options.loose &&\n range.includePrerelease === !!options.includePrerelease\n ) {\n return range\n } else {\n return new Range(range.raw, options)\n }\n }\n\n if (range instanceof Comparator) {\n // just put it in the set and return\n this.raw = range.value\n this.set = [[range]]\n this.formatted = undefined\n return this\n }\n\n this.options = options\n this.loose = !!options.loose\n this.includePrerelease = !!options.includePrerelease\n\n // First reduce all whitespace as much as possible so we do not have to rely\n // on potentially slow regexes like \\s*. This is then stored and used for\n // future error messages as well.\n this.raw = range.trim().replace(SPACE_CHARACTERS, ' ')\n\n // First, split on ||\n this.set = this.raw\n .split('||')\n // map the range to a 2d array of comparators\n .map(r => this.parseRange(r.trim()))\n // throw out any comparator lists that are empty\n // this generally means that it was not a valid range, which is allowed\n // in loose mode, but will still throw if the WHOLE range is invalid.\n .filter(c => c.length)\n\n if (!this.set.length) {\n throw new TypeError(`Invalid SemVer Range: ${this.raw}`)\n }\n\n // if we have any that are not the null set, throw out null sets.\n if (this.set.length > 1) {\n // keep the first one, in case they're all null sets\n const first = this.set[0]\n this.set = this.set.filter(c => !isNullSet(c[0]))\n if (this.set.length === 0) {\n this.set = [first]\n } else if (this.set.length > 1) {\n // if we have any that are *, then the range is just *\n for (const c of this.set) {\n if (c.length === 1 && isAny(c[0])) {\n this.set = [c]\n break\n }\n }\n }\n }\n\n this.formatted = undefined\n }\n\n get range () {\n if (this.formatted === undefined) {\n this.formatted = ''\n for (let i = 0; i < this.set.length; i++) {\n if (i > 0) {\n this.formatted += '||'\n }\n const comps = this.set[i]\n for (let k = 0; k < comps.length; k++) {\n if (k > 0) {\n this.formatted += ' '\n }\n this.formatted += comps[k].toString().trim()\n }\n }\n }\n return this.formatted\n }\n\n format () {\n return this.range\n }\n\n toString () {\n return this.range\n }\n\n parseRange (range) {\n // memoize range parsing for performance.\n // this is a very hot path, and fully deterministic.\n const memoOpts =\n (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |\n (this.options.loose && FLAG_LOOSE)\n const memoKey = memoOpts + ':' + range\n const cached = cache.get(memoKey)\n if (cached) {\n return cached\n }\n\n const loose = this.options.loose\n // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n debug('hyphen replace', range)\n\n // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n debug('comparator trim', range)\n\n // `~ 1.2.3` => `~1.2.3`\n range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n debug('tilde trim', range)\n\n // `^ 1.2.3` => `^1.2.3`\n range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n debug('caret trim', range)\n\n // At this point, the range is completely trimmed and\n // ready to be split into comparators.\n\n let rangeList = range\n .split(' ')\n .map(comp => parseComparator(comp, this.options))\n .join(' ')\n .split(/\\s+/)\n // >=0.0.0 is equivalent to *\n .map(comp => replaceGTE0(comp, this.options))\n\n if (loose) {\n // in loose mode, throw out any that are not valid comparators\n rangeList = rangeList.filter(comp => {\n debug('loose invalid filter', comp, this.options)\n return !!comp.match(re[t.COMPARATORLOOSE])\n })\n }\n debug('range list', rangeList)\n\n // if any comparators are the null set, then replace with JUST null set\n // if more than one comparator, remove any * comparators\n // also, don't include the same comparator more than once\n const rangeMap = new Map()\n const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n for (const comp of comparators) {\n if (isNullSet(comp)) {\n return [comp]\n }\n rangeMap.set(comp.value, comp)\n }\n if (rangeMap.size > 1 && rangeMap.has('')) {\n rangeMap.delete('')\n }\n\n const result = [...rangeMap.values()]\n cache.set(memoKey, result)\n return result\n }\n\n intersects (range, options) {\n if (!(range instanceof Range)) {\n throw new TypeError('a Range is required')\n }\n\n return this.set.some((thisComparators) => {\n return (\n isSatisfiable(thisComparators, options) &&\n range.set.some((rangeComparators) => {\n return (\n isSatisfiable(rangeComparators, options) &&\n thisComparators.every((thisComparator) => {\n return rangeComparators.every((rangeComparator) => {\n return thisComparator.intersects(rangeComparator, options)\n })\n })\n )\n })\n )\n })\n }\n\n // if ANY of the sets match ALL of its comparators, then pass\n test (version) {\n if (!version) {\n return false\n }\n\n if (typeof version === 'string') {\n try {\n version = new SemVer(version, this.options)\n } catch (er) {\n return false\n }\n }\n\n for (let i = 0; i < this.set.length; i++) {\n if (testSet(this.set[i], version, this.options)) {\n return true\n }\n }\n return false\n }\n}\n\nmodule.exports = Range\n\nconst LRU = require('../internal/lrucache')\nconst cache = new LRU()\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n safeRe: re,\n t,\n comparatorTrimReplace,\n tildeTrimReplace,\n caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n let result = true\n const remainingComparators = comparators.slice()\n let testComparator = remainingComparators.pop()\n\n while (result && remainingComparators.length) {\n result = remainingComparators.every((otherComparator) => {\n return testComparator.intersects(otherComparator, options)\n })\n\n testComparator = remainingComparators.pop()\n }\n\n return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n comp = comp.replace(re[t.BUILD], '')\n debug('comp', comp, options)\n comp = replaceCarets(comp, options)\n debug('caret', comp)\n comp = replaceTildes(comp, options)\n debug('tildes', comp)\n comp = replaceXRanges(comp, options)\n debug('xrange', comp)\n comp = replaceStars(comp, options)\n debug('stars', comp)\n return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) => {\n return comp\n .trim()\n .split(/\\s+/)\n .map((c) => replaceTilde(c, options))\n .join(' ')\n}\n\nconst replaceTilde = (comp, options) => {\n const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n return comp.replace(r, (_, M, m, p, pr) => {\n debug('tilde', comp, _, M, m, p, pr)\n let ret\n\n if (isX(M)) {\n ret = ''\n } else if (isX(m)) {\n ret = `>=${M}.0.0 <${+M + 1}.0.0-0`\n } else if (isX(p)) {\n // ~1.2 == >=1.2.0 <1.3.0-0\n ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`\n } else if (pr) {\n debug('replaceTilde pr', pr)\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${+m + 1}.0-0`\n } else {\n // ~1.2.3 == >=1.2.3 <1.3.0-0\n ret = `>=${M}.${m}.${p\n } <${M}.${+m + 1}.0-0`\n }\n\n debug('tilde return', ret)\n return ret\n })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) => {\n return comp\n .trim()\n .split(/\\s+/)\n .map((c) => replaceCaret(c, options))\n .join(' ')\n}\n\nconst replaceCaret = (comp, options) => {\n debug('caret', comp, options)\n const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n const z = options.includePrerelease ? '-0' : ''\n return comp.replace(r, (_, M, m, p, pr) => {\n debug('caret', comp, _, M, m, p, pr)\n let ret\n\n if (isX(M)) {\n ret = ''\n } else if (isX(m)) {\n ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n } else if (isX(p)) {\n if (M === '0') {\n ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n } else {\n ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n }\n } else if (pr) {\n debug('replaceCaret pr', pr)\n if (M === '0') {\n if (m === '0') {\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${m}.${+p + 1}-0`\n } else {\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${+m + 1}.0-0`\n }\n } else {\n ret = `>=${M}.${m}.${p}-${pr\n } <${+M + 1}.0.0-0`\n }\n } else {\n debug('no pr')\n if (M === '0') {\n if (m === '0') {\n ret = `>=${M}.${m}.${p\n }${z} <${M}.${m}.${+p + 1}-0`\n } else {\n ret = `>=${M}.${m}.${p\n }${z} <${M}.${+m + 1}.0-0`\n }\n } else {\n ret = `>=${M}.${m}.${p\n } <${+M + 1}.0.0-0`\n }\n }\n\n debug('caret return', ret)\n return ret\n })\n}\n\nconst replaceXRanges = (comp, options) => {\n debug('replaceXRanges', comp, options)\n return comp\n .split(/\\s+/)\n .map((c) => replaceXRange(c, options))\n .join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n comp = comp.trim()\n const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n debug('xRange', comp, ret, gtlt, M, m, p, pr)\n const xM = isX(M)\n const xm = xM || isX(m)\n const xp = xm || isX(p)\n const anyX = xp\n\n if (gtlt === '=' && anyX) {\n gtlt = ''\n }\n\n // if we're including prereleases in the match, then we need\n // to fix this to -0, the lowest possible prerelease value\n pr = options.includePrerelease ? '-0' : ''\n\n if (xM) {\n if (gtlt === '>' || gtlt === '<') {\n // nothing is allowed\n ret = '<0.0.0-0'\n } else {\n // nothing is forbidden\n ret = '*'\n }\n } else if (gtlt && anyX) {\n // we know patch is an x, because we have any x at all.\n // replace X with 0\n if (xm) {\n m = 0\n }\n p = 0\n\n if (gtlt === '>') {\n // >1 => >=2.0.0\n // >1.2 => >=1.3.0\n gtlt = '>='\n if (xm) {\n M = +M + 1\n m = 0\n p = 0\n } else {\n m = +m + 1\n p = 0\n }\n } else if (gtlt === '<=') {\n // <=0.7.x is actually <0.8.0, since any 0.7.x should\n // pass. Similarly, <=7.x is actually <8.0.0, etc.\n gtlt = '<'\n if (xm) {\n M = +M + 1\n } else {\n m = +m + 1\n }\n }\n\n if (gtlt === '<') {\n pr = '-0'\n }\n\n ret = `${gtlt + M}.${m}.${p}${pr}`\n } else if (xm) {\n ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n } else if (xp) {\n ret = `>=${M}.${m}.0${pr\n } <${M}.${+m + 1}.0-0`\n }\n\n debug('xRange return', ret)\n\n return ret\n })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n debug('replaceStars', comp, options)\n // Looseness is ignored here. star is always as loose as it gets!\n return comp\n .trim()\n .replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n debug('replaceGTE0', comp, options)\n return comp\n .trim()\n .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\n// TODO build?\nconst hyphenReplace = incPr => ($0,\n from, fM, fm, fp, fpr, fb,\n to, tM, tm, tp, tpr) => {\n if (isX(fM)) {\n from = ''\n } else if (isX(fm)) {\n from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n } else if (isX(fp)) {\n from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n } else if (fpr) {\n from = `>=${from}`\n } else {\n from = `>=${from}${incPr ? '-0' : ''}`\n }\n\n if (isX(tM)) {\n to = ''\n } else if (isX(tm)) {\n to = `<${+tM + 1}.0.0-0`\n } else if (isX(tp)) {\n to = `<${tM}.${+tm + 1}.0-0`\n } else if (tpr) {\n to = `<=${tM}.${tm}.${tp}-${tpr}`\n } else if (incPr) {\n to = `<${tM}.${tm}.${+tp + 1}-0`\n } else {\n to = `<=${to}`\n }\n\n return `${from} ${to}`.trim()\n}\n\nconst testSet = (set, version, options) => {\n for (let i = 0; i < set.length; i++) {\n if (!set[i].test(version)) {\n return false\n }\n }\n\n if (version.prerelease.length && !options.includePrerelease) {\n // Find the set of versions that are allowed to have prereleases\n // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n // That should allow `1.2.3-pr.2` to pass.\n // However, `1.2.4-alpha.notready` should NOT be allowed,\n // even though it's within the range set by the comparators.\n for (let i = 0; i < set.length; i++) {\n debug(set[i].semver)\n if (set[i].semver === Comparator.ANY) {\n continue\n }\n\n if (set[i].semver.prerelease.length > 0) {\n const allowed = set[i].semver\n if (allowed.major === version.major &&\n allowed.minor === version.minor &&\n allowed.patch === version.patch) {\n return true\n }\n }\n }\n\n // Version has a -pre, but it's not one of the ones we like.\n return false\n }\n\n return true\n}\n","'use strict'\n\nconst ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n static get ANY () {\n return ANY\n }\n\n constructor (comp, options) {\n options = parseOptions(options)\n\n if (comp instanceof Comparator) {\n if (comp.loose === !!options.loose) {\n return comp\n } else {\n comp = comp.value\n }\n }\n\n comp = comp.trim().split(/\\s+/).join(' ')\n debug('comparator', comp, options)\n this.options = options\n this.loose = !!options.loose\n this.parse(comp)\n\n if (this.semver === ANY) {\n this.value = ''\n } else {\n this.value = this.operator + this.semver.version\n }\n\n debug('comp', this)\n }\n\n parse (comp) {\n const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n const m = comp.match(r)\n\n if (!m) {\n throw new TypeError(`Invalid comparator: ${comp}`)\n }\n\n this.operator = m[1] !== undefined ? m[1] : ''\n if (this.operator === '=') {\n this.operator = ''\n }\n\n // if it literally is just '>' or '' then allow anything.\n if (!m[2]) {\n this.semver = ANY\n } else {\n this.semver = new SemVer(m[2], this.options.loose)\n }\n }\n\n toString () {\n return this.value\n }\n\n test (version) {\n debug('Comparator.test', version, this.options.loose)\n\n if (this.semver === ANY || version === ANY) {\n return true\n }\n\n if (typeof version === 'string') {\n try {\n version = new SemVer(version, this.options)\n } catch (er) {\n return false\n }\n }\n\n return cmp(version, this.operator, this.semver, this.options)\n }\n\n intersects (comp, options) {\n if (!(comp instanceof Comparator)) {\n throw new TypeError('a Comparator is required')\n }\n\n if (this.operator === '') {\n if (this.value === '') {\n return true\n }\n return new Range(comp.value, options).test(this.value)\n } else if (comp.operator === '') {\n if (comp.value === '') {\n return true\n }\n return new Range(this.value, options).test(comp.semver)\n }\n\n options = parseOptions(options)\n\n // Special cases where nothing can possibly be lower\n if (options.includePrerelease &&\n (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {\n return false\n }\n if (!options.includePrerelease &&\n (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {\n return false\n }\n\n // Same direction increasing (> or >=)\n if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {\n return true\n }\n // Same direction decreasing (< or <=)\n if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {\n return true\n }\n // same SemVer and both sides are inclusive (<= or >=)\n if (\n (this.semver.version === comp.semver.version) &&\n this.operator.includes('=') && comp.operator.includes('=')) {\n return true\n }\n // opposite directions less than\n if (cmp(this.semver, '<', comp.semver, options) &&\n this.operator.startsWith('>') && comp.operator.startsWith('<')) {\n return true\n }\n // opposite directions greater than\n if (cmp(this.semver, '>', comp.semver, options) &&\n this.operator.startsWith('<') && comp.operator.startsWith('>')) {\n return true\n }\n return false\n }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { safeRe: re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n","'use strict'\n\nconst Range = require('../classes/range')\nconst satisfies = (version, range, options) => {\n try {\n range = new Range(range, options)\n } catch (er) {\n return false\n }\n return range.test(version)\n}\nmodule.exports = satisfies\n","'use strict'\n\nconst Range = require('../classes/range')\n\n// Mostly just for testing and legacy API reasons\nconst toComparators = (range, options) =>\n new Range(range, options).set\n .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))\n\nmodule.exports = toComparators\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\n\nconst maxSatisfying = (versions, range, options) => {\n let max = null\n let maxSV = null\n let rangeObj = null\n try {\n rangeObj = new Range(range, options)\n } catch (er) {\n return null\n }\n versions.forEach((v) => {\n if (rangeObj.test(v)) {\n // satisfies(v, range, options)\n if (!max || maxSV.compare(v) === -1) {\n // compare(max, v, true)\n max = v\n maxSV = new SemVer(max, options)\n }\n }\n })\n return max\n}\nmodule.exports = maxSatisfying\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst minSatisfying = (versions, range, options) => {\n let min = null\n let minSV = null\n let rangeObj = null\n try {\n rangeObj = new Range(range, options)\n } catch (er) {\n return null\n }\n versions.forEach((v) => {\n if (rangeObj.test(v)) {\n // satisfies(v, range, options)\n if (!min || minSV.compare(v) === 1) {\n // compare(min, v, true)\n min = v\n minSV = new SemVer(min, options)\n }\n }\n })\n return min\n}\nmodule.exports = minSatisfying\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst gt = require('../functions/gt')\n\nconst minVersion = (range, loose) => {\n range = new Range(range, loose)\n\n let minver = new SemVer('0.0.0')\n if (range.test(minver)) {\n return minver\n }\n\n minver = new SemVer('0.0.0-0')\n if (range.test(minver)) {\n return minver\n }\n\n minver = null\n for (let i = 0; i < range.set.length; ++i) {\n const comparators = range.set[i]\n\n let setMin = null\n comparators.forEach((comparator) => {\n // Clone to avoid manipulating the comparator's semver object.\n const compver = new SemVer(comparator.semver.version)\n switch (comparator.operator) {\n case '>':\n if (compver.prerelease.length === 0) {\n compver.patch++\n } else {\n compver.prerelease.push(0)\n }\n compver.raw = compver.format()\n /* fallthrough */\n case '':\n case '>=':\n if (!setMin || gt(compver, setMin)) {\n setMin = compver\n }\n break\n case '<':\n case '<=':\n /* Ignore maximum versions */\n break\n /* istanbul ignore next */\n default:\n throw new Error(`Unexpected operation: ${comparator.operator}`)\n }\n })\n if (setMin && (!minver || gt(minver, setMin))) {\n minver = setMin\n }\n }\n\n if (minver && range.test(minver)) {\n return minver\n }\n\n return null\n}\nmodule.exports = minVersion\n","'use strict'\n\nconst Range = require('../classes/range')\nconst validRange = (range, options) => {\n try {\n // Return '*' instead of '' so that truthiness works.\n // This will throw if it's invalid anyway\n return new Range(range, options).range || '*'\n } catch (er) {\n return null\n }\n}\nmodule.exports = validRange\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Comparator = require('../classes/comparator')\nconst { ANY } = Comparator\nconst Range = require('../classes/range')\nconst satisfies = require('../functions/satisfies')\nconst gt = require('../functions/gt')\nconst lt = require('../functions/lt')\nconst lte = require('../functions/lte')\nconst gte = require('../functions/gte')\n\nconst outside = (version, range, hilo, options) => {\n version = new SemVer(version, options)\n range = new Range(range, options)\n\n let gtfn, ltefn, ltfn, comp, ecomp\n switch (hilo) {\n case '>':\n gtfn = gt\n ltefn = lte\n ltfn = lt\n comp = '>'\n ecomp = '>='\n break\n case '<':\n gtfn = lt\n ltefn = gte\n ltfn = gt\n comp = '<'\n ecomp = '<='\n break\n default:\n throw new TypeError('Must provide a hilo val of \"<\" or \">\"')\n }\n\n // If it satisfies the range it is not outside\n if (satisfies(version, range, options)) {\n return false\n }\n\n // From now on, variable terms are as if we're in \"gtr\" mode.\n // but note that everything is flipped for the \"ltr\" function.\n\n for (let i = 0; i < range.set.length; ++i) {\n const comparators = range.set[i]\n\n let high = null\n let low = null\n\n comparators.forEach((comparator) => {\n if (comparator.semver === ANY) {\n comparator = new Comparator('>=0.0.0')\n }\n high = high || comparator\n low = low || comparator\n if (gtfn(comparator.semver, high.semver, options)) {\n high = comparator\n } else if (ltfn(comparator.semver, low.semver, options)) {\n low = comparator\n }\n })\n\n // If the edge version comparator has a operator then our version\n // isn't outside it\n if (high.operator === comp || high.operator === ecomp) {\n return false\n }\n\n // If the lowest version comparator has an operator and our version\n // is less than it then it isn't higher than the range\n if ((!low.operator || low.operator === comp) &&\n ltefn(version, low.semver)) {\n return false\n } else if (low.operator === ecomp && ltfn(version, low.semver)) {\n return false\n }\n }\n return true\n}\n\nmodule.exports = outside\n","'use strict'\n\n// Determine if version is greater than all the versions possible in the range.\nconst outside = require('./outside')\nconst gtr = (version, range, options) => outside(version, range, '>', options)\nmodule.exports = gtr\n","'use strict'\n\nconst outside = require('./outside')\n// Determine if version is less than all the versions possible in the range\nconst ltr = (version, range, options) => outside(version, range, '<', options)\nmodule.exports = ltr\n","'use strict'\n\nconst Range = require('../classes/range')\nconst intersects = (r1, r2, options) => {\n r1 = new Range(r1, options)\n r2 = new Range(r2, options)\n return r1.intersects(r2, options)\n}\nmodule.exports = intersects\n","'use strict'\n\n// given a set of versions and a range, create a \"simplified\" range\n// that includes the same versions that the original range does\n// If the original range is shorter than the simplified one, return that.\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\nmodule.exports = (versions, range, options) => {\n const set = []\n let first = null\n let prev = null\n const v = versions.sort((a, b) => compare(a, b, options))\n for (const version of v) {\n const included = satisfies(version, range, options)\n if (included) {\n prev = version\n if (!first) {\n first = version\n }\n } else {\n if (prev) {\n set.push([first, prev])\n }\n prev = null\n first = null\n }\n }\n if (first) {\n set.push([first, null])\n }\n\n const ranges = []\n for (const [min, max] of set) {\n if (min === max) {\n ranges.push(min)\n } else if (!max && min === v[0]) {\n ranges.push('*')\n } else if (!max) {\n ranges.push(`>=${min}`)\n } else if (min === v[0]) {\n ranges.push(`<=${max}`)\n } else {\n ranges.push(`${min} - ${max}`)\n }\n }\n const simplified = ranges.join(' || ')\n const original = typeof range.raw === 'string' ? range.raw : String(range)\n return simplified.length < original.length ? simplified : range\n}\n","'use strict'\n\nconst Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n// some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n// - If C is only the ANY comparator, return true\n// - Else if in prerelease mode, return false\n// - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n// - if in prerelease mode, return true\n// - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n// - If GT, and EQ does not satisfy GT, return true (null set)\n// - If LT, and EQ does not satisfy LT, return true (null set)\n// - If EQ satisfies every C, return true\n// - Else return false\n// - If GT\n// - If GT.semver is lower than any > or >= comp in C, return false\n// - If GT is >=, and GT.semver does not satisfy every C, return false\n// - If GT.semver has a prerelease, and not in prerelease mode\n// - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n// - If LT.semver is greater than any < or <= comp in C, return false\n// - If LT is <=, and LT.semver does not satisfy every C, return false\n// - If LT.semver has a prerelease, and not in prerelease mode\n// - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n if (sub === dom) {\n return true\n }\n\n sub = new Range(sub, options)\n dom = new Range(dom, options)\n let sawNonNull = false\n\n OUTER: for (const simpleSub of sub.set) {\n for (const simpleDom of dom.set) {\n const isSub = simpleSubset(simpleSub, simpleDom, options)\n sawNonNull = sawNonNull || isSub !== null\n if (isSub) {\n continue OUTER\n }\n }\n // the null set is a subset of everything, but null simple ranges in\n // a complex range should be ignored. so if we saw a non-null range,\n // then we know this isn't a subset, but if EVERY simple range was null,\n // then it is a subset.\n if (sawNonNull) {\n return false\n }\n }\n return true\n}\n\nconst minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]\nconst minimumVersion = [new Comparator('>=0.0.0')]\n\nconst simpleSubset = (sub, dom, options) => {\n if (sub === dom) {\n return true\n }\n\n if (sub.length === 1 && sub[0].semver === ANY) {\n if (dom.length === 1 && dom[0].semver === ANY) {\n return true\n } else if (options.includePrerelease) {\n sub = minimumVersionWithPreRelease\n } else {\n sub = minimumVersion\n }\n }\n\n if (dom.length === 1 && dom[0].semver === ANY) {\n if (options.includePrerelease) {\n return true\n } else {\n dom = minimumVersion\n }\n }\n\n const eqSet = new Set()\n let gt, lt\n for (const c of sub) {\n if (c.operator === '>' || c.operator === '>=') {\n gt = higherGT(gt, c, options)\n } else if (c.operator === '<' || c.operator === '<=') {\n lt = lowerLT(lt, c, options)\n } else {\n eqSet.add(c.semver)\n }\n }\n\n if (eqSet.size > 1) {\n return null\n }\n\n let gtltComp\n if (gt && lt) {\n gtltComp = compare(gt.semver, lt.semver, options)\n if (gtltComp > 0) {\n return null\n } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n return null\n }\n }\n\n // will iterate one or zero times\n for (const eq of eqSet) {\n if (gt && !satisfies(eq, String(gt), options)) {\n return null\n }\n\n if (lt && !satisfies(eq, String(lt), options)) {\n return null\n }\n\n for (const c of dom) {\n if (!satisfies(eq, String(c), options)) {\n return false\n }\n }\n\n return true\n }\n\n let higher, lower\n let hasDomLT, hasDomGT\n // if the subset has a prerelease, we need a comparator in the superset\n // with the same tuple and a prerelease, or it's not a subset\n let needDomLTPre = lt &&\n !options.includePrerelease &&\n lt.semver.prerelease.length ? lt.semver : false\n let needDomGTPre = gt &&\n !options.includePrerelease &&\n gt.semver.prerelease.length ? gt.semver : false\n // exception: <1.2.3-0 is the same as <1.2.3\n if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n needDomLTPre = false\n }\n\n for (const c of dom) {\n hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n if (gt) {\n if (needDomGTPre) {\n if (c.semver.prerelease && c.semver.prerelease.length &&\n c.semver.major === needDomGTPre.major &&\n c.semver.minor === needDomGTPre.minor &&\n c.semver.patch === needDomGTPre.patch) {\n needDomGTPre = false\n }\n }\n if (c.operator === '>' || c.operator === '>=') {\n higher = higherGT(gt, c, options)\n if (higher === c && higher !== gt) {\n return false\n }\n } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {\n return false\n }\n }\n if (lt) {\n if (needDomLTPre) {\n if (c.semver.prerelease && c.semver.prerelease.length &&\n c.semver.major === needDomLTPre.major &&\n c.semver.minor === needDomLTPre.minor &&\n c.semver.patch === needDomLTPre.patch) {\n needDomLTPre = false\n }\n }\n if (c.operator === '<' || c.operator === '<=') {\n lower = lowerLT(lt, c, options)\n if (lower === c && lower !== lt) {\n return false\n }\n } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {\n return false\n }\n }\n if (!c.operator && (lt || gt) && gtltComp !== 0) {\n return false\n }\n }\n\n // if there was a < or >, and nothing in the dom, then must be false\n // UNLESS it was limited by another range in the other direction.\n // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n if (gt && hasDomLT && !lt && gtltComp !== 0) {\n return false\n }\n\n if (lt && hasDomGT && !gt && gtltComp !== 0) {\n return false\n }\n\n // we needed a prerelease range in a specific tuple, but didn't get one\n // then this isn't a subset. eg >=1.2.3-pre is not a subset of >=1.0.0,\n // because it includes prereleases in the 1.2.3 tuple\n if (needDomGTPre || needDomLTPre) {\n return false\n }\n\n return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n if (!a) {\n return b\n }\n const comp = compare(a.semver, b.semver, options)\n return comp > 0 ? a\n : comp < 0 ? b\n : b.operator === '>' && a.operator === '>=' ? b\n : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n if (!a) {\n return b\n }\n const comp = compare(a.semver, b.semver, options)\n return comp < 0 ? a\n : comp > 0 ? b\n : b.operator === '<' && a.operator === '<=' ? b\n : a\n}\n\nmodule.exports = subset\n","'use strict'\n\n// just pre-load all the stuff that index.js lazily exports\nconst internalRe = require('./internal/re')\nconst constants = require('./internal/constants')\nconst SemVer = require('./classes/semver')\nconst identifiers = require('./internal/identifiers')\nconst parse = require('./functions/parse')\nconst valid = require('./functions/valid')\nconst clean = require('./functions/clean')\nconst inc = require('./functions/inc')\nconst diff = require('./functions/diff')\nconst major = require('./functions/major')\nconst minor = require('./functions/minor')\nconst patch = require('./functions/patch')\nconst prerelease = require('./functions/prerelease')\nconst compare = require('./functions/compare')\nconst rcompare = require('./functions/rcompare')\nconst compareLoose = require('./functions/compare-loose')\nconst compareBuild = require('./functions/compare-build')\nconst sort = require('./functions/sort')\nconst rsort = require('./functions/rsort')\nconst gt = require('./functions/gt')\nconst lt = require('./functions/lt')\nconst eq = require('./functions/eq')\nconst neq = require('./functions/neq')\nconst gte = require('./functions/gte')\nconst lte = require('./functions/lte')\nconst cmp = require('./functions/cmp')\nconst coerce = require('./functions/coerce')\nconst Comparator = require('./classes/comparator')\nconst Range = require('./classes/range')\nconst satisfies = require('./functions/satisfies')\nconst toComparators = require('./ranges/to-comparators')\nconst maxSatisfying = require('./ranges/max-satisfying')\nconst minSatisfying = require('./ranges/min-satisfying')\nconst minVersion = require('./ranges/min-version')\nconst validRange = require('./ranges/valid')\nconst outside = require('./ranges/outside')\nconst gtr = require('./ranges/gtr')\nconst ltr = require('./ranges/ltr')\nconst intersects = require('./ranges/intersects')\nconst simplifyRange = require('./ranges/simplify')\nconst subset = require('./ranges/subset')\nmodule.exports = {\n parse,\n valid,\n clean,\n inc,\n diff,\n major,\n minor,\n patch,\n prerelease,\n compare,\n rcompare,\n compareLoose,\n compareBuild,\n sort,\n rsort,\n gt,\n lt,\n eq,\n neq,\n gte,\n lte,\n cmp,\n coerce,\n Comparator,\n Range,\n satisfies,\n toComparators,\n maxSatisfying,\n minSatisfying,\n minVersion,\n validRange,\n outside,\n gtr,\n ltr,\n intersects,\n simplifyRange,\n subset,\n SemVer,\n re: internalRe.re,\n src: internalRe.src,\n tokens: internalRe.t,\n SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,\n RELEASE_TYPES: constants.RELEASE_TYPES,\n compareIdentifiers: identifiers.compareIdentifiers,\n rcompareIdentifiers: identifiers.rcompareIdentifiers,\n}\n","import { readFileSync } from 'node:fs';\nimport { dirname, join } from 'node:path';\n\nimport type { TransformerConfig } from '../types';\n\n/** Retrieves a JSON object from a file path, returning null if the file does not exist */\nexport const getJsonFromPath = <T>(baseDir: string, fileName: string): T => {\n const jsonPath = join(baseDir, fileName);\n\n try {\n const jsonContent = readFileSync(jsonPath, 'utf8');\n return JSON.parse(jsonContent) as T;\n } catch {\n throw new Error(`Error reading ${jsonPath}`);\n }\n};\n\nexport function getCodemodConfig(codemodPath: string): TransformerConfig {\n try {\n return getJsonFromPath<TransformerConfig>(dirname(codemodPath), 'config.json');\n } catch {\n throw new Error(`Error reading codemod config for ${codemodPath}`);\n }\n}\n","import { exec, execSync } from 'node:child_process';\nimport { existsSync } from 'node:fs';\nimport path from 'node:path';\nimport { promisify } from 'node:util';\n\nconst execAsync = promisify(exec);\n\n/**\n * Finds the root of the project by looking for the `.git` directory.\n */\nexport function findProjectRoot(): string {\n try {\n const gitRoot = execSync('git rev-parse --show-toplevel', {\n cwd: process.cwd(),\n encoding: 'utf8',\n stdio: ['ignore', 'pipe', 'ignore'],\n }).trim();\n\n return gitRoot && existsSync(gitRoot) ? gitRoot : '';\n } catch {\n return '';\n }\n}\n\n/**\n * Quick and dirty way of determining package roots based on\n * the presence of `package.json` files and them optimistically\n * containing a `@transferwise/components` string.\n * */\nexport async function findPackages(): Promise<string[]> {\n try {\n const { stdout } = await execAsync(\n [\n 'find ./',\n '-type f',\n '-name \"package.json\"',\n '-not -path \"*/node_modules/*\"',\n '|',\n 'xargs grep -l \"@transferwise/components\"',\n ].join(' '),\n {\n cwd: findProjectRoot(),\n encoding: 'utf8',\n },\n );\n\n const packages = stdout.trim().split('\\n').filter(Boolean).map(path.dirname);\n\n if (packages.length === 0) {\n throw new Error();\n }\n\n return packages;\n } catch {\n throw new Error('No suitable package roots found in the repository.');\n }\n}\n","/**\n * Renders an object as a table in terminal\n */\nexport const renderTable = (\n data: Record<string, Record<string, string>>,\n indexHeading = 'index',\n): void => {\n const firstEntry = Object.values(data)[0];\n if (!firstEntry) {\n console.info('No data to display');\n return;\n }\n\n const headings = [indexHeading, ...Object.keys(firstEntry)];\n const tableData: string[][] = [];\n\n Object.entries(data).forEach(([packageName, details]) => {\n tableData.push([packageName, ...Object.values(details)]);\n });\n\n const getDisplayWidth = (str: string): number => {\n // eslint-disable-next-line regexp/no-control-character\n return str.replace(/\\x1b\\[[0-9;]*m/gu, '').length;\n };\n\n const columnWidths = headings.map((heading, index) => {\n const maxDataWidth = Math.max(...tableData.map((row) => getDisplayWidth(row[index] || '')));\n return Math.max(heading.length, maxDataWidth);\n });\n\n const firstCellLine = '─'.repeat(columnWidths[0] + 2);\n const remainingLines = columnWidths.slice(1).map((width) => '─'.repeat(width + 2));\n const topSeparator = `┌${firstCellLine}┬${remainingLines.join('┬')}┐`;\n const midSeparator = `├${firstCellLine}┼${remainingLines.join('┼')}┤`;\n const endSeparator = `└${firstCellLine}┴${remainingLines.join('┴')}┘`;\n\n const formatRow = (cells: string[]) => {\n const formattedCells = cells.map((cell, index) => {\n const width = columnWidths[index];\n const displayWidth = getDisplayWidth(cell);\n const padding = width - displayWidth;\n return ` ${cell}${' '.repeat(Math.max(0, padding))} `;\n });\n return `│${formattedCells.join('│')}│`;\n };\n\n console.info(topSeparator);\n console.info(formatRow(headings));\n console.info(midSeparator);\n tableData.forEach((row) => {\n console.info(formatRow(row));\n });\n console.info(endSeparator);\n};\n","import { existsSync, readFileSync } from 'node:fs';\nimport { dirname, join, resolve } from 'node:path';\n\nimport semver from 'semver';\nimport type Spinnies from 'spinnies';\n\nimport { CONSOLE_ICONS } from '../../constants/common';\nimport { getCodemodConfig, getJsonFromPath } from './getCodemodConfig';\nimport { findProjectRoot } from './repository';\nimport { renderTable } from './table';\n\ninterface PackageJson {\n version?: string;\n dependencies?: Record<string, string>;\n peerDependencies?: Record<string, string>;\n [key: string]: Record<string, string> | string | undefined;\n}\n\n/**\n * Checks if the installed version satisfies the given version requirement.\n */\nfunction isVersionSatisfied(installedVersion: string, versionRequirement: string): boolean {\n if (!installedVersion) return false;\n\n if (semver.valid(installedVersion) && semver.satisfies(installedVersion, versionRequirement)) {\n return true;\n }\n\n const cleanVersion = semver.coerce(installedVersion);\n return cleanVersion ? semver.satisfies(cleanVersion.version, versionRequirement) : false;\n}\n\n/**\n * Retrieves the version of a dependency from node_modules of a specific package.\n */\nfunction getVersionFromNodeModules(packagePath: string, packageName: string): string {\n try {\n const nodeModulesPackageJson = join(packagePath, 'node_modules', packageName, 'package.json');\n if (!existsSync(nodeModulesPackageJson)) return '';\n\n const packageJson = JSON.parse(readFileSync(nodeModulesPackageJson, 'utf8')) as PackageJson;\n return packageJson.version || '';\n } catch {\n return '';\n }\n}\n\n/**\n * Finds the closest package.json by traversing up the directory tree\n */\nfunction findClosestPackageJson(currentPath: string): string | null {\n const resolvedPath = resolve(currentPath);\n const projectRoot = findProjectRoot();\n\n const packageJsonPath = join(resolvedPath, 'package.json');\n if (existsSync(packageJsonPath)) {\n return resolvedPath;\n }\n\n if (projectRoot && resolvedPath === projectRoot) {\n return null;\n }\n\n const parentPath = dirname(resolvedPath);\n if (parentPath === resolvedPath) {\n // Reached the root of the filesystem\n return null;\n }\n\n return findClosestPackageJson(parentPath);\n}\n\n/**\n * Assesses whether the given package meets the prerequisites defined in the codemod's config.json.\n */\nexport const assessPrerequisites = (packagePath: string, codemodPath: string): boolean => {\n try {\n const codemodConfig = getCodemodConfig(codemodPath);\n const resolvedPackagePath = resolve(process.cwd(), packagePath);\n\n const actualPackagePath = existsSync(join(resolvedPackagePath, 'package.json'))\n ? resolvedPackagePath\n : findClosestPackageJson(resolvedPackagePath);\n\n if (!actualPackagePath) {\n console.error(\n `${CONSOLE_ICONS.error} \\x1b[1mCould not find a package.json in or above ${packagePath}\\x1b[0m`,\n );\n return false;\n }\n\n if (actualPackagePath !== resolvedPackagePath) {\n console.info(\n `${CONSOLE_ICONS.info} Using package.json from ${actualPackagePath} for dependency checks`,\n );\n }\n\n const packageJson = getJsonFromPath<PackageJson>(actualPackagePath, 'package.json');\n\n if (!packageJson) {\n return false;\n }\n\n const { dependencies = {}, peerDependencies = {} } = packageJson;\n\n const comparisons: Record<string, Record<string, string>> = {};\n let isCompliant = true;\n\n if (codemodConfig?.prerequisites) {\n Object.entries(codemodConfig.prerequisites).forEach(([name, versionRequirement]) => {\n const nodeModulesVersion = getVersionFromNodeModules(actualPackagePath, name);\n const isDependencySatisfied = isVersionSatisfied(dependencies[name], versionRequirement);\n const isPeerDependencySatisfied = isVersionSatisfied(\n peerDependencies[name],\n versionRequirement,\n );\n const isInstalledSatisfied = isVersionSatisfied(nodeModulesVersion, versionRequirement);\n\n if ((!isDependencySatisfied && !isPeerDependencySatisfied) || !isInstalledSatisfied) {\n isCompliant = false;\n\n comparisons[name] = {\n required: versionRequirement,\n dependencies: isDependencySatisfied\n ? CONSOLE_ICONS.success\n : `${CONSOLE_ICONS.error} ${dependencies[name] || 'N/A'}`,\n peerDependencies: isPeerDependencySatisfied\n ? CONSOLE_ICONS.success\n : `${CONSOLE_ICONS.error} ${peerDependencies[name] || 'N/A'}`,\n node_modules: isInstalledSatisfied\n ? CONSOLE_ICONS.success\n : `${CONSOLE_ICONS.error} ${nodeModulesVersion || 'N/A'}`,\n };\n }\n });\n }\n\n if (!isCompliant) {\n console.info(\n `${CONSOLE_ICONS.error} \\x1b[31mPrerequisite check failed -\\x1b[0m \\x1b[2m${packagePath}\\x1b[0m`,\n );\n renderTable(comparisons, 'package');\n\n return false;\n }\n\n return true;\n } catch (error) {\n console.error('Cannot assess the state of prerequisites:', error);\n return false;\n }\n};\n\n/**\n * Batch prerequisite assessment across multiple target paths.\n * - Resolves each target to its effective package root (closest package.json)\n * - Deduplicates by package root and checks each unique root once\n * - Logs a concise summary; detailed table is logged by assessPrerequisites on failure\n */\nexport const assessPrerequisitesBatch = (\n targetPaths: string[],\n codemodPath: string,\n spinnies: Spinnies,\n): {\n allPassed: boolean;\n results: Map<string, boolean>;\n packageRootToTargets: Map<string, string[]>;\n failedPackageRoots: string[];\n failedTargetsNoPackage: string[];\n} => {\n const packageRootToTargets = new Map<string, string[]>();\n const failedTargetsNoPackage: string[] = [];\n\n for (const target of targetPaths) {\n const resolved = resolve(process.cwd(), target);\n const actual = existsSync(join(resolved, 'package.json'))\n ? resolved\n : findClosestPackageJson(resolved);\n if (actual) {\n const list = packageRootToTargets.get(actual) ?? [];\n list.push(target);\n packageRootToTargets.set(target, list);\n } else {\n failedTargetsNoPackage.push(target);\n }\n }\n\n let allPassed = true;\n const results = new Map<string, boolean>();\n\n for (const [pkgRoot] of packageRootToTargets.entries()) {\n // Run the existing single-check once per unique package root\n const passed = assessPrerequisites(pkgRoot, codemodPath);\n results.set(pkgRoot, passed);\n if (!passed) allPassed = false;\n }\n\n const totalTargets = targetPaths.length;\n const uniquePackages = packageRootToTargets.size;\n const passedCount = Array.from(results.values()).filter(Boolean).length;\n const failedCount = uniquePackages - passedCount;\n\n if (failedTargetsNoPackage.length || !passedCount) {\n if (!passedCount) {\n spinnies.fail('prerequisite-check', { text: 'All targets failed prerequisite checks' });\n } else {\n spinnies.fail('prerequisite-check', {\n text: `No package.json found for ${failedTargetsNoPackage.length} target${\n failedTargetsNoPackage.length !== 1 ? 's' : ''\n } (searching upwards to project root).`,\n });\n failedTargetsNoPackage.forEach((t) => console.error(`- ${t}`));\n }\n } else {\n const failedPart = failedCount > 0 ? `, \\x1b[31m${failedCount} failed\\x1b[0m` : '';\n\n spinnies.succeed('prerequisite-check', {\n text: `\\x1b[0mChecked ${totalTargets} target${totalTargets !== 1 ? 's' : ''} across ${uniquePackages} package${\n uniquePackages !== 1 ? 's' : ''\n }:\\x1b[0m \\x1b[32m${passedCount} passed\\x1b[0m${failedPart}`,\n });\n }\n\n const failedPackageRoots = Array.from(results.entries())\n .filter(([, ok]) => !ok)\n .map(([root]) => root);\n\n return { allPassed, results, packageRootToTargets, failedPackageRoots, failedTargetsNoPackage };\n};\n","import { existsSync, readdirSync, statSync } from 'node:fs';\nimport { join, relative } from 'node:path';\n\nimport { checkbox, confirm, input, search, select as list } from '@inquirer/prompts';\n\nimport type { CodemodOptions, TransformerConfig } from '../types';\n\n/**\n * if args are provided via CLI, log them to the console in\n * a formatted way matching Inquirer's style\n */\nexport const logToInquirer = (label: string, value?: string) => {\n const checkmark = '\\x1b[32m✔\\x1b[0m'; // Green checkmark\n const boldLabel = `\\x1b[1m${label}\\x1b[0m`; // Bold label\n const greenValue = `\\x1b[32m${value}\\x1b[0m`; // Green value\n\n console.info(`${checkmark} ${boldLabel} ${greenValue}`);\n};\n\n/**\n * Get all directories recursively for autocomplete\n */\nconst getDirectoryChoices = (rootPath: string, currentInput = '', maxDepth = 3): string[] => {\n const MAX_FILTERED_CHOICES = 10;\n const MAX_DEFAULT_CHOICES = 20;\n const SKIP_DIRS = new Set([\n 'node_modules',\n 'dist',\n 'build',\n 'coverage',\n '.git',\n '.next',\n '.nuxt',\n '.vscode',\n '.idea',\n ]);\n\n const choices = new Set<string>();\n choices.add('.');\n\n const scanDirectory = (dirPath: string, depth = 0): void => {\n if (depth >= maxDepth) return;\n\n try {\n const items = readdirSync(dirPath, { withFileTypes: true });\n\n for (const item of items) {\n if (!item.name.startsWith('.') && !SKIP_DIRS.has(item.name)) {\n if (item.isDirectory()) {\n const fullPath = join(dirPath, item.name);\n const relativePath = relative(rootPath, fullPath);\n\n if (relativePath && !relativePath.startsWith('..') && !relativePath.includes('..')) {\n choices.add(relativePath);\n scanDirectory(fullPath, depth + 1);\n }\n }\n }\n }\n } catch {\n // Silently ignore directories we can't read (permissions, etc.)\n }\n };\n\n scanDirectory(rootPath);\n\n const allChoices = Array.from(choices).sort();\n\n if (currentInput.trim()) {\n const inputLower = currentInput.toLowerCase();\n return allChoices\n .filter((choice) => choice.toLowerCase().includes(inputLower))\n .slice(0, MAX_FILTERED_CHOICES);\n }\n\n return allChoices.slice(0, MAX_DEFAULT_CHOICES);\n};\n\n/**\n * Lets user pick from available packages to run the codemod on\n */\nconst queryPackages = async (packages: string[]) => {\n const message = 'Path to run codemod on:';\n const nonRootPackages = packages.filter((pkg) => pkg !== '.' && pkg !== './');\n\n // root package only (single repo scenario)\n // This handles [\".\"], [\"./\"], and cases where only root exists\n if (packages.length === 1 && (packages[0] === '.' || packages[0] === './')) {\n const useCustomPath = await confirm({\n message: 'Do you want to target a specific folder instead of the entire project?',\n default: false,\n });\n\n if (useCustomPath) {\n const customPath = await search({\n message: 'Enter the folder path (relative to project root):',\n source: async (searchInput) => {\n const rootPath = process.cwd();\n const choices = getDirectoryChoices(rootPath, searchInput || '');\n\n return choices.map((choice) => ({\n name: choice === '.' ? '. (entire project)' : choice,\n value: choice,\n description:\n choice === '.' ? 'Target the entire project' : `Target ${choice} directory`,\n }));\n },\n validate: (path) => {\n if (!path?.trim()) return 'Path cannot be empty';\n const fullPath = join(process.cwd(), path);\n if (!existsSync(fullPath)) return 'Folder does not exist';\n if (!statSync(fullPath).isDirectory()) return 'Path must be a directory';\n return true;\n },\n });\n\n logToInquirer(message, customPath);\n return [customPath];\n }\n\n logToInquirer(message, packages[0] === './' ? '.' : packages[0]);\n return [packages[0] === './' ? '.' : packages[0]];\n }\n\n // multiple non-root packages (monorepo scenario)\n if (nonRootPackages.length >= 1) {\n return checkbox({\n required: true,\n message: 'Select packages to transform:',\n choices: nonRootPackages.map((file) => ({\n name: file,\n value: file,\n checked: true,\n })),\n });\n }\n\n return ['.'];\n};\n\n/**\n * Determine user choice between CLI arg and Inquirer prompt: codemod\n */\nconst determineTransformer = async ({\n candidate,\n transformFiles,\n}: {\n candidate: string;\n transformFiles: string[];\n}): Promise<string> => {\n const codemodMessage = 'Select codemod to run:';\n\n if (candidate && transformFiles.includes(candidate)) {\n logToInquirer(codemodMessage, candidate);\n return candidate;\n }\n\n return list({\n message: codemodMessage,\n choices: transformFiles.map((file) => ({ name: file, value: file })),\n });\n};\n\n/**\n * Determine user choice between CLI arg and Inquirer prompt: paths/packages to process\n */\nconst determinePaths = async ({\n candidate,\n root,\n packages,\n}: {\n candidate: string;\n root: string;\n packages: string[];\n}): Promise<string[]> => {\n const targetPaths = [];\n\n if (candidate && existsSync(join(root, candidate))) {\n logToInquirer('Path to run codemod on', candidate);\n targetPaths.push(candidate);\n }\n\n if (!targetPaths.length) {\n const packagesToProcess = await queryPackages(packages);\n targetPaths.push(...(packagesToProcess ?? []));\n }\n\n return targetPaths;\n};\n\n/**\n * Determine user choice between CLI arg and Inquirer prompt: dry mode\n */\nconst determineIsDryMode = async (args: string[]) => {\n const message = 'Run in dry mode (no changes written to files)?';\n if (args.includes('--dry') || args.includes('--dry-run')) {\n logToInquirer(message, 'Yes');\n return true;\n }\n\n return confirm({ message, default: false });\n};\n\n/**\n * Determine user choice between CLI arg and Inquirer prompt: print to CLI\n */\nconst determineIsPrint = async (args: string[]) => {\n const message = 'Print transformed source to console?';\n\n if (args.includes('--print')) {\n logToInquirer(message, 'Yes');\n return true;\n }\n\n return confirm({ message, default: false });\n};\n\nconst ALWAYS_IGNORED_FOLDERS = ['node_modules/**', '.next/**'];\n\n/**\n * Determine user choice between CLI arg and Inquirer prompt: ignore patterns\n */\nconst determineIgnorePatterns = async (args: string[]) => {\n const message = 'Enter ignore pattern(s) (comma separated) or leave empty:';\n const ignorePatternIndex = args.findIndex((arg) => arg === '--ignore-pattern');\n\n let ignorePattern: string | undefined;\n\n if (ignorePatternIndex !== -1 && args.length > ignorePatternIndex + 1) {\n ignorePattern = args[ignorePatternIndex + 1];\n }\n\n let userPatterns: string;\n if (ignorePattern) {\n logToInquirer(message, ignorePattern);\n userPatterns = ignorePattern;\n } else {\n userPatterns = await input({\n message,\n validate: () => true,\n });\n }\n\n const allPatterns = [...ALWAYS_IGNORED_FOLDERS];\n if (userPatterns?.trim()) {\n allPatterns.push(...userPatterns.split(',').map((p) => p.trim()));\n }\n\n return allPatterns.join(',');\n};\n\n/**\n * Determine user choice between CLI arg and Inquirer prompt: gitignore\n */\nconst determineGitIgnore = async (args: string[]) => {\n const message = 'Respect .gitignore files?';\n\n if (args.includes('--gitignore')) {\n logToInquirer(message, 'Yes');\n return true;\n }\n\n if (args.includes('--no-gitignore')) {\n logToInquirer(message, 'No');\n return false;\n }\n\n return confirm({ message, default: true });\n};\n\nexport interface OptionsParams {\n transformFiles: string[];\n packages: string[];\n root: string;\n transformerType: TransformerConfig['type'];\n preselectedTransformFile?: string;\n}\n\nasync function getOptions({\n transformFiles,\n transformerType,\n packages,\n root,\n preselectedTransformFile,\n}: OptionsParams): Promise<CodemodOptions> {\n const args = process.argv.slice(2);\n\n if (preselectedTransformFile && args[0] === preselectedTransformFile) {\n args.shift();\n }\n\n const transformFile =\n preselectedTransformFile ||\n (await determineTransformer({ candidate: args[0] ?? '', transformFiles }));\n\n const pathCandidate = preselectedTransformFile ? (args[0] ?? '') : (args[1] ?? '');\n const targetPaths = await determinePaths({\n candidate: pathCandidate,\n root,\n packages,\n });\n\n const isDry = transformerType === 'jscodeshift' ? await determineIsDryMode(args) : false;\n const isPrint = transformerType === 'jscodeshift' ? await determineIsPrint(args) : false;\n const ignorePatterns =\n transformerType === 'claude'\n ? ALWAYS_IGNORED_FOLDERS.join(',')\n : await determineIgnorePatterns(args);\n const useGitIgnore = transformerType === 'jscodeshift' ? await determineGitIgnore(args) : true;\n\n return {\n transformFile,\n targetPaths,\n isDry,\n isPrint,\n ignorePatterns,\n useGitIgnore,\n };\n}\n\nexport default getOptions;\n","import { promises as fs, readdirSync } from 'node:fs';\nimport path from 'node:path';\n\ninterface TransformModule {\n default: {\n default: unknown;\n };\n}\n\n/**\n * Get list of available transform names without loading them\n */\nexport function listTransforms(transformsDir: string): string[] {\n const transformers = readdirSync(transformsDir);\n return transformers;\n}\n\nasync function loadTransformModules(transformsDir: string) {\n let transformModules: Record<string, unknown> = {};\n const transformers = await fs.readdir(transformsDir);\n\n const transformFiles = await Promise.all(\n transformers.map(async (name) => {\n const transformPath = path.join(transformsDir, name, 'transformer.js');\n const transformModule = (await import(transformPath)) as TransformModule;\n transformModules = { ...transformModules, [name]: transformModule.default.default };\n return name;\n }),\n );\n\n return { transformModules, transformFiles };\n}\n\nexport default loadTransformModules;\n","import fs from 'node:fs/promises';\nimport path from 'node:path';\n\nconst REPORT_PATH = path.resolve(process.cwd(), 'codemod-report.txt');\n\nconst reportManualReview = async (filePath: string, message: string): Promise<void> => {\n const lineMatch = /at line (\\d+)/u.exec(message);\n const lineNumber = lineMatch?.[1];\n\n const cleanMessage = message.replace(/ at line \\d+/u, '');\n const lineInfo = lineNumber ? `:${lineNumber}` : '';\n\n let isFirstEntry = false;\n let currentTransform: string | undefined;\n\n try {\n await fs.access(REPORT_PATH);\n const existingContent = await fs.readFile(REPORT_PATH, 'utf8');\n isFirstEntry = existingContent.trim() === '';\n } catch {\n isFirstEntry = true;\n }\n\n // Try to determine the current transform from the process arguments\n const args = process.argv;\n const transformIndex = args.findIndex((arg) => arg.endsWith('transformer.js'));\n if (transformIndex >= 0) {\n const transformPath = args[transformIndex];\n const transformDir = path.dirname(transformPath);\n currentTransform = path.basename(transformDir);\n }\n\n const content = `[${filePath}${lineInfo}] ${cleanMessage}\\n`;\n await fs.appendFile(REPORT_PATH, content, 'utf8');\n};\n\nexport default reportManualReview;\n","import { confirm, input, select } from '@inquirer/prompts';\n\nimport type { TransformerPrompt } from '../types';\nimport { getCodemodConfig } from './getCodemodConfig';\n\ntype Answers = Record<string, string | boolean>;\n\nasync function askPrompt(p: TransformerPrompt): Promise<string | boolean> {\n switch (p.type) {\n case 'select':\n return select({\n message: p.message,\n choices: (p.choices ?? []).map((c) => ({ name: c.name, value: c.value })),\n default: p.default as string | undefined,\n });\n case 'confirm':\n return confirm({\n message: p.message,\n default: typeof p.default === 'boolean' ? p.default : false,\n });\n case 'input':\n default:\n return input({\n message: p.message,\n default: (p.default as string) ?? '',\n });\n }\n}\n\nexport async function runTransformPrompts(codemodPath: string): Promise<Answers> {\n const config = getCodemodConfig(codemodPath);\n if (!config?.prompts?.length) return {};\n\n const answers: Answers = {};\n\n for (const prompt of config.prompts) {\n try {\n answers[prompt.key] = await askPrompt(prompt);\n } catch (error) {\n console.warn(\n `Failed to execute prompt \"${prompt.key}\": ${error instanceof Error ? error.message : String(error)}`,\n );\n\n if (prompt.default !== undefined) {\n console.info(`Using default value for \"${prompt.key}\": ${prompt.default}`);\n answers[prompt.key] = prompt.default;\n } else {\n console.info(`Skipping prompt \"${prompt.key}\" - no default value available`);\n }\n }\n }\n return answers;\n}\n","import fs from 'node:fs';\nimport path from 'node:path';\n\nimport { CONSOLE_ICONS } from '../../constants/common';\n\nconst CLAUDE_SETTINGS_FILE = '.claude/settings.json';\n\nexport function validateClaudeConfig(): void {\n const claudeSettingsPath = path.resolve(process.env.HOME || '', CLAUDE_SETTINGS_FILE);\n\n if (!fs.existsSync(claudeSettingsPath)) {\n throw new Error(\n `${CONSOLE_ICONS.error} Claude Code is not configured. Expected settings file at: ${claudeSettingsPath}. Please follow the setup instructions:\\n` +\n ` https://transferwise.atlassian.net/wiki/spaces/GenAIP/pages/3709765113/Configuring+Claude+Code\\n`,\n );\n }\n}\n"],"x_google_ignoreList":[0,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],"mappings":";;;;;;;;;;;;;CAIA,MAAM,sBAAsB;CAE5B,MAAM,aAAa;CACnB,MAAM,mBAAmB,OAAO,oBACL;CAG3B,MAAM,4BAA4B;CAIlC,MAAM,wBAAwB,aAAa;CAE3C,MAAM,gBAAgB;EACpB;EACA;EACA;EACA;EACA;EACA;EACA;EACD;AAED,QAAO,UAAU;EACf;EACA;EACA;EACA;EACA;EACA;EACA,yBAAyB;EACzB,YAAY;EACb;;;;;;CClCD,MAAM,QACJ,OAAO,YAAY,YACnB,QAAQ,OACR,QAAQ,IAAI,cACZ,cAAc,KAAK,QAAQ,IAAI,WAAW,IACvC,GAAG,SAAS,QAAQ,MAAM,UAAU,GAAG,KAAK,SACvC;AAEV,QAAO,UAAU;;;;;;CCRjB,MAAM,EACJ,2BACA,uBACA;CAEF,MAAM;AACN,WAAU,OAAO,UAAU,EAAE;CAG7B,MAAM,KAAK,QAAQ,KAAK,EAAE;CAC1B,MAAM,SAAS,QAAQ,SAAS,EAAE;CAClC,MAAM,MAAM,QAAQ,MAAM,EAAE;CAC5B,MAAM,UAAU,QAAQ,UAAU,EAAE;CACpC,MAAM,IAAI,QAAQ,IAAI,EAAE;CACxB,IAAI,IAAI;CAER,MAAM,mBAAmB;CAQzB,MAAM,wBAAwB;EAC5B,CAAC,OAAO,EAAE;EACV,CAAC,OAAO,WAAW;EACnB,CAAC,kBAAkB,sBAAsB;EAC1C;CAED,MAAM,iBAAiB,UAAU;AAC/B,OAAK,MAAM,CAAC,OAAO,QAAQ,sBACzB,SAAQ,MACL,MAAM,GAAG,MAAM,GAAG,CAAC,KAAK,GAAG,MAAM,KAAK,IAAI,GAAG,CAC7C,MAAM,GAAG,MAAM,GAAG,CAAC,KAAK,GAAG,MAAM,KAAK,IAAI,GAAG;AAElD,SAAO;;CAGT,MAAM,eAAe,MAAM,OAAO,aAAa;EAC7C,MAAM,OAAO,cAAc,MAAM;EACjC,MAAM,QAAQ;AACd,QAAM,MAAM,OAAO,MAAM;AACzB,IAAE,QAAQ;AACV,MAAI,SAAS;AACb,UAAQ,SAAS;AACjB,KAAG,SAAS,IAAI,OAAO,OAAO,WAAW,MAAM,OAAU;AACzD,SAAO,SAAS,IAAI,OAAO,MAAM,WAAW,MAAM,OAAU;;AAS9D,aAAY,qBAAqB,cAAc;AAC/C,aAAY,0BAA0B,OAAO;AAM7C,aAAY,wBAAwB,gBAAgB,iBAAiB,GAAG;AAKxE,aAAY,eAAe,IAAI,IAAI,EAAE,mBAAmB,OACjC,IAAI,EAAE,mBAAmB,OACzB,IAAI,EAAE,mBAAmB,GAAG;AAEnD,aAAY,oBAAoB,IAAI,IAAI,EAAE,wBAAwB,OACtC,IAAI,EAAE,wBAAwB,OAC9B,IAAI,EAAE,wBAAwB,GAAG;AAO7D,aAAY,wBAAwB,MAAM,IAAI,EAAE,sBAC/C,GAAG,IAAI,EAAE,mBAAmB,GAAG;AAEhC,aAAY,6BAA6B,MAAM,IAAI,EAAE,sBACpD,GAAG,IAAI,EAAE,wBAAwB,GAAG;AAMrC,aAAY,cAAc,QAAQ,IAAI,EAAE,sBACvC,QAAQ,IAAI,EAAE,sBAAsB,MAAM;AAE3C,aAAY,mBAAmB,SAAS,IAAI,EAAE,2BAC7C,QAAQ,IAAI,EAAE,2BAA2B,MAAM;AAKhD,aAAY,mBAAmB,GAAG,iBAAiB,GAAG;AAMtD,aAAY,SAAS,UAAU,IAAI,EAAE,iBACpC,QAAQ,IAAI,EAAE,iBAAiB,MAAM;AAWtC,aAAY,aAAa,KAAK,IAAI,EAAE,eACjC,IAAI,EAAE,YAAY,GACnB,IAAI,EAAE,OAAO,GAAG;AAElB,aAAY,QAAQ,IAAI,IAAI,EAAE,WAAW,GAAG;AAK5C,aAAY,cAAc,WAAW,IAAI,EAAE,oBACxC,IAAI,EAAE,iBAAiB,GACxB,IAAI,EAAE,OAAO,GAAG;AAElB,aAAY,SAAS,IAAI,IAAI,EAAE,YAAY,GAAG;AAE9C,aAAY,QAAQ,eAAe;AAKnC,aAAY,yBAAyB,GAAG,IAAI,EAAE,wBAAwB,UAAU;AAChF,aAAY,oBAAoB,GAAG,IAAI,EAAE,mBAAmB,UAAU;AAEtE,aAAY,eAAe,YAAY,IAAI,EAAE,kBAAkB,UAClC,IAAI,EAAE,kBAAkB,UACxB,IAAI,EAAE,kBAAkB,MAC5B,IAAI,EAAE,YAAY,IACtB,IAAI,EAAE,OAAO,OACR;AAE1B,aAAY,oBAAoB,YAAY,IAAI,EAAE,uBAAuB,UACvC,IAAI,EAAE,uBAAuB,UAC7B,IAAI,EAAE,uBAAuB,MACjC,IAAI,EAAE,iBAAiB,IAC3B,IAAI,EAAE,OAAO,OACR;AAE/B,aAAY,UAAU,IAAI,IAAI,EAAE,MAAM,MAAM,IAAI,EAAE,aAAa,GAAG;AAClE,aAAY,eAAe,IAAI,IAAI,EAAE,MAAM,MAAM,IAAI,EAAE,kBAAkB,GAAG;AAI5E,aAAY,eAAe,oBACD,0BAA0B,iBACtB,0BAA0B,mBAC1B,0BAA0B,MAAM;AAC9D,aAAY,UAAU,GAAG,IAAI,EAAE,aAAa,cAAc;AAC1D,aAAY,cAAc,IAAI,EAAE,eAClB,MAAM,IAAI,EAAE,YAAY,OAClB,IAAI,EAAE,OAAO,gBACJ;AAC7B,aAAY,aAAa,IAAI,EAAE,SAAS,KAAK;AAC7C,aAAY,iBAAiB,IAAI,EAAE,aAAa,KAAK;AAIrD,aAAY,aAAa,UAAU;AAEnC,aAAY,aAAa,SAAS,IAAI,EAAE,WAAW,OAAO,KAAK;AAC/D,SAAQ,mBAAmB;AAE3B,aAAY,SAAS,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,aAAa,GAAG;AAClE,aAAY,cAAc,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,kBAAkB,GAAG;AAI5E,aAAY,aAAa,UAAU;AAEnC,aAAY,aAAa,SAAS,IAAI,EAAE,WAAW,OAAO,KAAK;AAC/D,SAAQ,mBAAmB;AAE3B,aAAY,SAAS,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,aAAa,GAAG;AAClE,aAAY,cAAc,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,kBAAkB,GAAG;AAG5E,aAAY,mBAAmB,IAAI,IAAI,EAAE,MAAM,OAAO,IAAI,EAAE,YAAY,OAAO;AAC/E,aAAY,cAAc,IAAI,IAAI,EAAE,MAAM,OAAO,IAAI,EAAE,WAAW,OAAO;AAIzE,aAAY,kBAAkB,SAAS,IAAI,EAAE,MAC5C,OAAO,IAAI,EAAE,YAAY,GAAG,IAAI,EAAE,aAAa,IAAI,KAAK;AACzD,SAAQ,wBAAwB;AAMhC,aAAY,eAAe,SAAS,IAAI,EAAE,aAAa,aAEhC,IAAI,EAAE,aAAa,QACf;AAE3B,aAAY,oBAAoB,SAAS,IAAI,EAAE,kBAAkB,aAErC,IAAI,EAAE,kBAAkB,QACpB;AAGhC,aAAY,QAAQ,kBAAkB;AAEtC,aAAY,QAAQ,4BAA4B;AAChD,aAAY,WAAW,8BAA8B;;;;;;CC3NrD,MAAM,cAAc,OAAO,OAAO,EAAE,OAAO,MAAM,CAAC;CAClD,MAAM,YAAY,OAAO,OAAO,EAAG,CAAC;CACpC,MAAM,gBAAe,YAAW;AAC9B,MAAI,CAAC,QACH,QAAO;AAGT,MAAI,OAAO,YAAY,SACrB,QAAO;AAGT,SAAO;;AAET,QAAO,UAAU;;;;;;CCdjB,MAAM,UAAU;CAChB,MAAM,sBAAsB,GAAG,MAAM;AACnC,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SACxC,QAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK;EAGpC,MAAM,OAAO,QAAQ,KAAK,EAAE;EAC5B,MAAM,OAAO,QAAQ,KAAK,EAAE;AAE5B,MAAI,QAAQ,MAAM;AAChB,OAAI,CAAC;AACL,OAAI,CAAC;;AAGP,SAAO,MAAM,IAAI,IACZ,QAAQ,CAAC,OAAQ,KACjB,QAAQ,CAAC,OAAQ,IAClB,IAAI,IAAI,KACR;;CAGN,MAAM,uBAAuB,GAAG,MAAM,mBAAmB,GAAG,EAAE;AAE9D,QAAO,UAAU;EACf;EACA;EACD;;;;;;CC1BD,MAAM;CACN,MAAM,EAAE,YAAY;CACpB,MAAM,EAAE,QAAQ,IAAI;CAEpB,MAAM;CACN,MAAM,EAAE;CACR,IAAM,SAAN,MAAM,OAAO;EACX,YAAa,SAAS,SAAS;AAC7B,aAAU,aAAa,QAAQ;AAE/B,OAAI,mBAAmB,OACrB,KAAI,QAAQ,UAAU,CAAC,CAAC,QAAQ,SAC9B,QAAQ,sBAAsB,CAAC,CAAC,QAAQ,kBACxC,QAAO;OAEP,WAAU,QAAQ;YAEX,OAAO,YAAY,SAC5B,OAAM,IAAI,UAAU,gDAAgD,OAAO,QAAQ,IAAI;AAGzF,OAAI,QAAQ,SAAS,WACnB,OAAM,IAAI,UACR,0BAA0B,WAAW,aACtC;AAGH,SAAM,UAAU,SAAS,QAAQ;AACjC,QAAK,UAAU;AACf,QAAK,QAAQ,CAAC,CAAC,QAAQ;AAGvB,QAAK,oBAAoB,CAAC,CAAC,QAAQ;GAEnC,MAAM,IAAI,QAAQ,MAAM,CAAC,MAAM,QAAQ,QAAQ,GAAG,EAAE,SAAS,GAAG,EAAE,MAAM;AAExE,OAAI,CAAC,EACH,OAAM,IAAI,UAAU,oBAAoB,UAAU;AAGpD,QAAK,MAAM;AAGX,QAAK,QAAQ,CAAC,EAAE;AAChB,QAAK,QAAQ,CAAC,EAAE;AAChB,QAAK,QAAQ,CAAC,EAAE;AAEhB,OAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,EAChD,OAAM,IAAI,UAAU,wBAAwB;AAG9C,OAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,EAChD,OAAM,IAAI,UAAU,wBAAwB;AAG9C,OAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,EAChD,OAAM,IAAI,UAAU,wBAAwB;AAI9C,OAAI,CAAC,EAAE,GACL,MAAK,aAAa,EAAE;OAEpB,MAAK,aAAa,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,OAAO;AAC5C,QAAI,WAAW,KAAK,GAAG,EAAE;KACvB,MAAM,MAAM,CAAC;AACb,SAAI,OAAO,KAAK,MAAM,iBACpB,QAAO;;AAGX,WAAO;KACP;AAGJ,QAAK,QAAQ,EAAE,KAAK,EAAE,GAAG,MAAM,IAAI,GAAG,EAAE;AACxC,QAAK,QAAQ;;EAGf,SAAU;AACR,QAAK,UAAU,GAAG,KAAK,MAAM,GAAG,KAAK,MAAM,GAAG,KAAK;AACnD,OAAI,KAAK,WAAW,OAClB,MAAK,WAAW,IAAI,KAAK,WAAW,KAAK,IAAI;AAE/C,UAAO,KAAK;;EAGd,WAAY;AACV,UAAO,KAAK;;EAGd,QAAS,OAAO;AACd,SAAM,kBAAkB,KAAK,SAAS,KAAK,SAAS,MAAM;AAC1D,OAAI,EAAE,iBAAiB,SAAS;AAC9B,QAAI,OAAO,UAAU,YAAY,UAAU,KAAK,QAC9C,QAAO;AAET,YAAQ,IAAI,OAAO,OAAO,KAAK,QAAQ;;AAGzC,OAAI,MAAM,YAAY,KAAK,QACzB,QAAO;AAGT,UAAO,KAAK,YAAY,MAAM,IAAI,KAAK,WAAW,MAAM;;EAG1D,YAAa,OAAO;AAClB,OAAI,EAAE,iBAAiB,QACrB,SAAQ,IAAI,OAAO,OAAO,KAAK,QAAQ;AAGzC,OAAI,KAAK,QAAQ,MAAM,MACrB,QAAO;AAET,OAAI,KAAK,QAAQ,MAAM,MACrB,QAAO;AAET,OAAI,KAAK,QAAQ,MAAM,MACrB,QAAO;AAET,OAAI,KAAK,QAAQ,MAAM,MACrB,QAAO;AAET,OAAI,KAAK,QAAQ,MAAM,MACrB,QAAO;AAET,OAAI,KAAK,QAAQ,MAAM,MACrB,QAAO;AAET,UAAO;;EAGT,WAAY,OAAO;AACjB,OAAI,EAAE,iBAAiB,QACrB,SAAQ,IAAI,OAAO,OAAO,KAAK,QAAQ;AAIzC,OAAI,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,OAC9C,QAAO;YACE,CAAC,KAAK,WAAW,UAAU,MAAM,WAAW,OACrD,QAAO;YACE,CAAC,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,OACtD,QAAO;GAGT,IAAI,IAAI;AACR,MAAG;IACD,MAAM,IAAI,KAAK,WAAW;IAC1B,MAAM,IAAI,MAAM,WAAW;AAC3B,UAAM,sBAAsB,GAAG,GAAG,EAAE;AACpC,QAAI,MAAM,UAAa,MAAM,OAC3B,QAAO;aACE,MAAM,OACf,QAAO;aACE,MAAM,OACf,QAAO;aACE,MAAM,EACf;QAEA,QAAO,mBAAmB,GAAG,EAAE;YAE1B,EAAE;;EAGb,aAAc,OAAO;AACnB,OAAI,EAAE,iBAAiB,QACrB,SAAQ,IAAI,OAAO,OAAO,KAAK,QAAQ;GAGzC,IAAI,IAAI;AACR,MAAG;IACD,MAAM,IAAI,KAAK,MAAM;IACrB,MAAM,IAAI,MAAM,MAAM;AACtB,UAAM,iBAAiB,GAAG,GAAG,EAAE;AAC/B,QAAI,MAAM,UAAa,MAAM,OAC3B,QAAO;aACE,MAAM,OACf,QAAO;aACE,MAAM,OACf,QAAO;aACE,MAAM,EACf;QAEA,QAAO,mBAAmB,GAAG,EAAE;YAE1B,EAAE;;EAKb,IAAK,SAAS,YAAY,gBAAgB;AACxC,OAAI,QAAQ,WAAW,MAAM,EAAE;AAC7B,QAAI,CAAC,cAAc,mBAAmB,MACpC,OAAM,IAAI,MAAM,kDAAkD;AAGpE,QAAI,YAAY;KACd,MAAM,QAAQ,IAAI,aAAa,MAAM,KAAK,QAAQ,QAAQ,GAAG,EAAE,mBAAmB,GAAG,EAAE,YAAY;AACnG,SAAI,CAAC,SAAS,MAAM,OAAO,WACzB,OAAM,IAAI,MAAM,uBAAuB,aAAa;;;AAK1D,WAAQ,SAAR;IACE,KAAK;AACH,UAAK,WAAW,SAAS;AACzB,UAAK,QAAQ;AACb,UAAK,QAAQ;AACb,UAAK;AACL,UAAK,IAAI,OAAO,YAAY,eAAe;AAC3C;IACF,KAAK;AACH,UAAK,WAAW,SAAS;AACzB,UAAK,QAAQ;AACb,UAAK;AACL,UAAK,IAAI,OAAO,YAAY,eAAe;AAC3C;IACF,KAAK;AAIH,UAAK,WAAW,SAAS;AACzB,UAAK,IAAI,SAAS,YAAY,eAAe;AAC7C,UAAK,IAAI,OAAO,YAAY,eAAe;AAC3C;IAGF,KAAK;AACH,SAAI,KAAK,WAAW,WAAW,EAC7B,MAAK,IAAI,SAAS,YAAY,eAAe;AAE/C,UAAK,IAAI,OAAO,YAAY,eAAe;AAC3C;IACF,KAAK;AACH,SAAI,KAAK,WAAW,WAAW,EAC7B,OAAM,IAAI,MAAM,WAAW,KAAK,IAAI,sBAAsB;AAE5D,UAAK,WAAW,SAAS;AACzB;IAEF,KAAK;AAKH,SACE,KAAK,UAAU,KACf,KAAK,UAAU,KACf,KAAK,WAAW,WAAW,EAE3B,MAAK;AAEP,UAAK,QAAQ;AACb,UAAK,QAAQ;AACb,UAAK,aAAa,EAAE;AACpB;IACF,KAAK;AAKH,SAAI,KAAK,UAAU,KAAK,KAAK,WAAW,WAAW,EACjD,MAAK;AAEP,UAAK,QAAQ;AACb,UAAK,aAAa,EAAE;AACpB;IACF,KAAK;AAKH,SAAI,KAAK,WAAW,WAAW,EAC7B,MAAK;AAEP,UAAK,aAAa,EAAE;AACpB;IAGF,KAAK,OAAO;KACV,MAAM,OAAO,OAAO,eAAe,GAAG,IAAI;AAE1C,SAAI,KAAK,WAAW,WAAW,EAC7B,MAAK,aAAa,CAAC,KAAK;UACnB;MACL,IAAI,IAAI,KAAK,WAAW;AACxB,aAAO,EAAE,KAAK,EACZ,KAAI,OAAO,KAAK,WAAW,OAAO,UAAU;AAC1C,YAAK,WAAW;AAChB,WAAI;;AAGR,UAAI,MAAM,IAAI;AAEZ,WAAI,eAAe,KAAK,WAAW,KAAK,IAAI,IAAI,mBAAmB,MACjE,OAAM,IAAI,MAAM,wDAAwD;AAE1E,YAAK,WAAW,KAAK,KAAK;;;AAG9B,SAAI,YAAY;MAGd,IAAI,aAAa,CAAC,YAAY,KAAK;AACnC,UAAI,mBAAmB,MACrB,cAAa,CAAC,WAAW;AAE3B,UAAI,mBAAmB,KAAK,WAAW,IAAI,WAAW,KAAK,GACzD;WAAI,MAAM,KAAK,WAAW,GAAG,CAC3B,MAAK,aAAa;YAGpB,MAAK,aAAa;;AAGtB;;IAEF,QACE,OAAM,IAAI,MAAM,+BAA+B,UAAU;;AAE7D,QAAK,MAAM,KAAK,QAAQ;AACxB,OAAI,KAAK,MAAM,OACb,MAAK,OAAO,IAAI,KAAK,MAAM,KAAK,IAAI;AAEtC,UAAO;;;AAIX,QAAO,UAAU;;;;;;CC1UjB,MAAM;CACN,MAAM,SAAS,SAAS,SAAS,cAAc,UAAU;AACvD,MAAI,mBAAmB,OACrB,QAAO;AAET,MAAI;AACF,UAAO,IAAI,OAAO,SAAS,QAAQ;WAC5B,IAAI;AACX,OAAI,CAAC,YACH,QAAO;AAET,SAAM;;;AAIV,QAAO,UAAU;;;;;;CCfjB,MAAM;CACN,MAAM,SAAS,SAAS,YAAY;EAClC,MAAM,IAAI,MAAM,SAAS,QAAQ;AACjC,SAAO,IAAI,EAAE,UAAU;;AAEzB,QAAO,UAAU;;;;;;CCLjB,MAAM;CACN,MAAM,SAAS,SAAS,YAAY;EAClC,MAAM,IAAI,MAAM,QAAQ,MAAM,CAAC,QAAQ,UAAU,GAAG,EAAE,QAAQ;AAC9D,SAAO,IAAI,EAAE,UAAU;;AAEzB,QAAO,UAAU;;;;;;CCLjB,MAAM;CAEN,MAAM,OAAO,SAAS,SAAS,SAAS,YAAY,mBAAmB;AACrE,MAAI,OAAQ,YAAa,UAAU;AACjC,oBAAiB;AACjB,gBAAa;AACb,aAAU;;AAGZ,MAAI;AACF,UAAO,IAAI,OACT,mBAAmB,SAAS,QAAQ,UAAU,SAC9C,QACD,CAAC,IAAI,SAAS,YAAY,eAAe,CAAC;WACpC,IAAI;AACX,UAAO;;;AAGX,QAAO,UAAU;;;;;;CClBjB,MAAM;CAEN,MAAM,QAAQ,UAAU,aAAa;EACnC,MAAM,KAAK,MAAM,UAAU,MAAM,KAAK;EACtC,MAAM,KAAK,MAAM,UAAU,MAAM,KAAK;EACtC,MAAM,aAAa,GAAG,QAAQ,GAAG;AAEjC,MAAI,eAAe,EACjB,QAAO;EAGT,MAAM,WAAW,aAAa;EAC9B,MAAM,cAAc,WAAW,KAAK;EACpC,MAAM,aAAa,WAAW,KAAK;EACnC,MAAM,aAAa,CAAC,CAAC,YAAY,WAAW;AAG5C,MAFkB,CAAC,CAAC,WAAW,WAAW,UAEzB,CAAC,YAAY;AAQ5B,OAAI,CAAC,WAAW,SAAS,CAAC,WAAW,MACnC,QAAO;AAIT,OAAI,WAAW,YAAY,YAAY,KAAK,GAAG;AAC7C,QAAI,WAAW,SAAS,CAAC,WAAW,MAClC,QAAO;AAET,WAAO;;;EAKX,MAAM,SAAS,aAAa,QAAQ;AAEpC,MAAI,GAAG,UAAU,GAAG,MAClB,QAAO,SAAS;AAGlB,MAAI,GAAG,UAAU,GAAG,MAClB,QAAO,SAAS;AAGlB,MAAI,GAAG,UAAU,GAAG,MAClB,QAAO,SAAS;AAIlB,SAAO;;AAGT,QAAO,UAAU;;;;;;CCzDjB,MAAM;CACN,MAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,MAAM,CAAC;AACjD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,MAAM,CAAC;AACjD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,MAAM,CAAC;AACjD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,cAAc,SAAS,YAAY;EACvC,MAAM,SAAS,MAAM,SAAS,QAAQ;AACtC,SAAQ,UAAU,OAAO,WAAW,SAAU,OAAO,aAAa;;AAEpE,QAAO,UAAU;;;;;;CCLjB,MAAM;CACN,MAAM,WAAW,GAAG,GAAG,UACrB,IAAI,OAAO,GAAG,MAAM,CAAC,QAAQ,IAAI,OAAO,GAAG,MAAM,CAAC;AAEpD,QAAO,UAAU;;;;;;CCJjB,MAAM;CACN,MAAM,YAAY,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM;AACtD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,gBAAgB,GAAG,MAAM,QAAQ,GAAG,GAAG,KAAK;AAClD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,gBAAgB,GAAG,GAAG,UAAU;EACpC,MAAM,WAAW,IAAI,OAAO,GAAG,MAAM;EACrC,MAAM,WAAW,IAAI,OAAO,GAAG,MAAM;AACrC,SAAO,SAAS,QAAQ,SAAS,IAAI,SAAS,aAAa,SAAS;;AAEtE,QAAO,UAAU;;;;;;CCNjB,MAAM;CACN,MAAM,QAAQ,QAAM,UAAUA,OAAK,MAAM,GAAG,MAAM,aAAa,GAAG,GAAG,MAAM,CAAC;AAC5E,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,SAAS,QAAM,UAAUC,OAAK,MAAM,GAAG,MAAM,aAAa,GAAG,GAAG,MAAM,CAAC;AAC7E,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM,GAAG;AACnD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM,GAAG;AACnD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM,KAAK;AACrD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM,KAAK;AACtD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM,IAAI;AACrD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,MAAM,IAAI;AACrD,QAAO,UAAU;;;;;;CCFjB,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CAEN,MAAM,OAAO,GAAG,IAAI,GAAG,UAAU;AAC/B,UAAQ,IAAR;GACE,KAAK;AACH,QAAI,OAAO,MAAM,SACf,KAAI,EAAE;AAER,QAAI,OAAO,MAAM,SACf,KAAI,EAAE;AAER,WAAO,MAAM;GAEf,KAAK;AACH,QAAI,OAAO,MAAM,SACf,KAAI,EAAE;AAER,QAAI,OAAO,MAAM,SACf,KAAI,EAAE;AAER,WAAO,MAAM;GAEf,KAAK;GACL,KAAK;GACL,KAAK,KACH,QAAO,GAAG,GAAG,GAAG,MAAM;GAExB,KAAK,KACH,QAAO,IAAI,GAAG,GAAG,MAAM;GAEzB,KAAK,IACH,QAAO,GAAG,GAAG,GAAG,MAAM;GAExB,KAAK,KACH,QAAO,IAAI,GAAG,GAAG,MAAM;GAEzB,KAAK,IACH,QAAO,GAAG,GAAG,GAAG,MAAM;GAExB,KAAK,KACH,QAAO,IAAI,GAAG,GAAG,MAAM;GAEzB,QACE,OAAM,IAAI,UAAU,qBAAqB,KAAK;;;AAGpD,QAAO,UAAU;;;;;;CCnDjB,MAAM;CACN,MAAM;CACN,MAAM,EAAE,QAAQ,IAAI;CAEpB,MAAM,UAAU,SAAS,YAAY;AACnC,MAAI,mBAAmB,OACrB,QAAO;AAGT,MAAI,OAAO,YAAY,SACrB,WAAU,OAAO,QAAQ;AAG3B,MAAI,OAAO,YAAY,SACrB,QAAO;AAGT,YAAU,WAAW,EAAE;EAEvB,IAAI,QAAQ;AACZ,MAAI,CAAC,QAAQ,IACX,SAAQ,QAAQ,MAAM,QAAQ,oBAAoB,GAAG,EAAE,cAAc,GAAG,EAAE,QAAQ;OAC7E;GAUL,MAAM,iBAAiB,QAAQ,oBAAoB,GAAG,EAAE,iBAAiB,GAAG,EAAE;GAC9E,IAAI;AACJ,WAAQ,OAAO,eAAe,KAAK,QAAQ,MACtC,CAAC,SAAS,MAAM,QAAQ,MAAM,GAAG,WAAW,QAAQ,SACvD;AACA,QAAI,CAAC,SACC,KAAK,QAAQ,KAAK,GAAG,WAAW,MAAM,QAAQ,MAAM,GAAG,OAC3D,SAAQ;AAEV,mBAAe,YAAY,KAAK,QAAQ,KAAK,GAAG,SAAS,KAAK,GAAG;;AAGnE,kBAAe,YAAY;;AAG7B,MAAI,UAAU,KACZ,QAAO;EAGT,MAAM,QAAQ,MAAM;AAMpB,SAAO,MAAM,GAAG,MAAM,GALR,MAAM,MAAM,IAKK,GAJjB,MAAM,MAAM,MACP,QAAQ,qBAAqB,MAAM,KAAK,IAAI,MAAM,OAAO,KAC9D,QAAQ,qBAAqB,MAAM,KAAK,IAAI,MAAM,OAAO,MAEP,QAAQ;;AAE1E,QAAO,UAAU;;;;;;CC3DjB,IAAM,WAAN,MAAe;EACb,cAAe;AACb,QAAK,MAAM;AACX,QAAK,sBAAM,IAAI,KAAK;;EAGtB,IAAK,KAAK;GACR,MAAM,QAAQ,KAAK,IAAI,IAAI,IAAI;AAC/B,OAAI,UAAU,OACZ;QACK;AAEL,SAAK,IAAI,OAAO,IAAI;AACpB,SAAK,IAAI,IAAI,KAAK,MAAM;AACxB,WAAO;;;EAIX,OAAQ,KAAK;AACX,UAAO,KAAK,IAAI,OAAO,IAAI;;EAG7B,IAAK,KAAK,OAAO;AAGf,OAAI,CAFY,KAAK,OAAO,IAAI,IAEhB,UAAU,QAAW;AAEnC,QAAI,KAAK,IAAI,QAAQ,KAAK,KAAK;KAC7B,MAAM,WAAW,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC;AACxC,UAAK,OAAO,SAAS;;AAGvB,SAAK,IAAI,IAAI,KAAK,MAAM;;AAG1B,UAAO;;;AAIX,QAAO,UAAU;;;;;;CCvCjB,MAAM,mBAAmB;CAGzB,IAAM,QAAN,MAAM,MAAM;EACV,YAAa,OAAO,SAAS;AAC3B,aAAU,aAAa,QAAQ;AAE/B,OAAI,iBAAiB,MACnB,KACE,MAAM,UAAU,CAAC,CAAC,QAAQ,SAC1B,MAAM,sBAAsB,CAAC,CAAC,QAAQ,kBAEtC,QAAO;OAEP,QAAO,IAAI,MAAM,MAAM,KAAK,QAAQ;AAIxC,OAAI,iBAAiB,YAAY;AAE/B,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,CAAC,CAAC,MAAM,CAAC;AACpB,SAAK,YAAY;AACjB,WAAO;;AAGT,QAAK,UAAU;AACf,QAAK,QAAQ,CAAC,CAAC,QAAQ;AACvB,QAAK,oBAAoB,CAAC,CAAC,QAAQ;AAKnC,QAAK,MAAM,MAAM,MAAM,CAAC,QAAQ,kBAAkB,IAAI;AAGtD,QAAK,MAAM,KAAK,IACb,MAAM,KAAK,CAEX,KAAI,MAAK,KAAK,WAAW,EAAE,MAAM,CAAC,CAAC,CAInC,QAAO,MAAK,EAAE,OAAO;AAExB,OAAI,CAAC,KAAK,IAAI,OACZ,OAAM,IAAI,UAAU,yBAAyB,KAAK,MAAM;AAI1D,OAAI,KAAK,IAAI,SAAS,GAAG;IAEvB,MAAM,QAAQ,KAAK,IAAI;AACvB,SAAK,MAAM,KAAK,IAAI,QAAO,MAAK,CAAC,UAAU,EAAE,GAAG,CAAC;AACjD,QAAI,KAAK,IAAI,WAAW,EACtB,MAAK,MAAM,CAAC,MAAM;aACT,KAAK,IAAI,SAAS,GAE3B;UAAK,MAAM,KAAK,KAAK,IACnB,KAAI,EAAE,WAAW,KAAK,MAAM,EAAE,GAAG,EAAE;AACjC,WAAK,MAAM,CAAC,EAAE;AACd;;;;AAMR,QAAK,YAAY;;EAGnB,IAAI,QAAS;AACX,OAAI,KAAK,cAAc,QAAW;AAChC,SAAK,YAAY;AACjB,SAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;AACxC,SAAI,IAAI,EACN,MAAK,aAAa;KAEpB,MAAM,QAAQ,KAAK,IAAI;AACvB,UAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAI,IAAI,EACN,MAAK,aAAa;AAEpB,WAAK,aAAa,MAAM,GAAG,UAAU,CAAC,MAAM;;;;AAIlD,UAAO,KAAK;;EAGd,SAAU;AACR,UAAO,KAAK;;EAGd,WAAY;AACV,UAAO,KAAK;;EAGd,WAAY,OAAO;GAMjB,MAAM,YAFH,KAAK,QAAQ,qBAAqB,4BAClC,KAAK,QAAQ,SAAS,eACE,MAAM;GACjC,MAAM,SAAS,MAAM,IAAI,QAAQ;AACjC,OAAI,OACF,QAAO;GAGT,MAAM,QAAQ,KAAK,QAAQ;GAE3B,MAAM,KAAK,QAAQ,GAAG,EAAE,oBAAoB,GAAG,EAAE;AACjD,WAAQ,MAAM,QAAQ,IAAI,cAAc,KAAK,QAAQ,kBAAkB,CAAC;AACxE,SAAM,kBAAkB,MAAM;AAG9B,WAAQ,MAAM,QAAQ,GAAG,EAAE,iBAAiB,sBAAsB;AAClE,SAAM,mBAAmB,MAAM;AAG/B,WAAQ,MAAM,QAAQ,GAAG,EAAE,YAAY,iBAAiB;AACxD,SAAM,cAAc,MAAM;AAG1B,WAAQ,MAAM,QAAQ,GAAG,EAAE,YAAY,iBAAiB;AACxD,SAAM,cAAc,MAAM;GAK1B,IAAI,YAAY,MACb,MAAM,IAAI,CACV,KAAI,SAAQ,gBAAgB,MAAM,KAAK,QAAQ,CAAC,CAChD,KAAK,IAAI,CACT,MAAM,MAAM,CAEZ,KAAI,SAAQ,YAAY,MAAM,KAAK,QAAQ,CAAC;AAE/C,OAAI,MAEF,aAAY,UAAU,QAAO,SAAQ;AACnC,UAAM,wBAAwB,MAAM,KAAK,QAAQ;AACjD,WAAO,CAAC,CAAC,KAAK,MAAM,GAAG,EAAE,iBAAiB;KAC1C;AAEJ,SAAM,cAAc,UAAU;GAK9B,MAAM,2BAAW,IAAI,KAAK;GAC1B,MAAM,cAAc,UAAU,KAAI,SAAQ,IAAI,WAAW,MAAM,KAAK,QAAQ,CAAC;AAC7E,QAAK,MAAM,QAAQ,aAAa;AAC9B,QAAI,UAAU,KAAK,CACjB,QAAO,CAAC,KAAK;AAEf,aAAS,IAAI,KAAK,OAAO,KAAK;;AAEhC,OAAI,SAAS,OAAO,KAAK,SAAS,IAAI,GAAG,CACvC,UAAS,OAAO,GAAG;GAGrB,MAAM,SAAS,CAAC,GAAG,SAAS,QAAQ,CAAC;AACrC,SAAM,IAAI,SAAS,OAAO;AAC1B,UAAO;;EAGT,WAAY,OAAO,SAAS;AAC1B,OAAI,EAAE,iBAAiB,OACrB,OAAM,IAAI,UAAU,sBAAsB;AAG5C,UAAO,KAAK,IAAI,MAAM,oBAAoB;AACxC,WACE,cAAc,iBAAiB,QAAQ,IACvC,MAAM,IAAI,MAAM,qBAAqB;AACnC,YACE,cAAc,kBAAkB,QAAQ,IACxC,gBAAgB,OAAO,mBAAmB;AACxC,aAAO,iBAAiB,OAAO,oBAAoB;AACjD,cAAO,eAAe,WAAW,iBAAiB,QAAQ;QAC1D;OACF;MAEJ;KAEJ;;EAIJ,KAAM,SAAS;AACb,OAAI,CAAC,QACH,QAAO;AAGT,OAAI,OAAO,YAAY,SACrB,KAAI;AACF,cAAU,IAAI,OAAO,SAAS,KAAK,QAAQ;YACpC,IAAI;AACX,WAAO;;AAIX,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,IACnC,KAAI,QAAQ,KAAK,IAAI,IAAI,SAAS,KAAK,QAAQ,CAC7C,QAAO;AAGX,UAAO;;;AAIX,QAAO,UAAU;CAGjB,MAAM,QAAQ,0BAAS;CAEvB,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM,EACJ,QAAQ,IACR,GACA,uBACA,kBACA;CAEF,MAAM,EAAE,yBAAyB;CAEjC,MAAM,aAAY,MAAK,EAAE,UAAU;CACnC,MAAM,SAAQ,MAAK,EAAE,UAAU;CAI/B,MAAM,iBAAiB,aAAa,YAAY;EAC9C,IAAI,SAAS;EACb,MAAM,uBAAuB,YAAY,OAAO;EAChD,IAAI,iBAAiB,qBAAqB,KAAK;AAE/C,SAAO,UAAU,qBAAqB,QAAQ;AAC5C,YAAS,qBAAqB,OAAO,oBAAoB;AACvD,WAAO,eAAe,WAAW,iBAAiB,QAAQ;KAC1D;AAEF,oBAAiB,qBAAqB,KAAK;;AAG7C,SAAO;;CAMT,MAAM,mBAAmB,MAAM,YAAY;AACzC,SAAO,KAAK,QAAQ,GAAG,EAAE,QAAQ,GAAG;AACpC,QAAM,QAAQ,MAAM,QAAQ;AAC5B,SAAO,cAAc,MAAM,QAAQ;AACnC,QAAM,SAAS,KAAK;AACpB,SAAO,cAAc,MAAM,QAAQ;AACnC,QAAM,UAAU,KAAK;AACrB,SAAO,eAAe,MAAM,QAAQ;AACpC,QAAM,UAAU,KAAK;AACrB,SAAO,aAAa,MAAM,QAAQ;AAClC,QAAM,SAAS,KAAK;AACpB,SAAO;;CAGT,MAAM,OAAM,OAAM,CAAC,MAAM,GAAG,aAAa,KAAK,OAAO,OAAO;CAS5D,MAAM,iBAAiB,MAAM,YAAY;AACvC,SAAO,KACJ,MAAM,CACN,MAAM,MAAM,CACZ,KAAK,MAAM,aAAa,GAAG,QAAQ,CAAC,CACpC,KAAK,IAAI;;CAGd,MAAM,gBAAgB,MAAM,YAAY;EACtC,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,cAAc,GAAG,EAAE;AAClD,SAAO,KAAK,QAAQ,IAAI,GAAG,GAAG,GAAG,GAAG,OAAO;AACzC,SAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG;GACpC,IAAI;AAEJ,OAAI,IAAI,EAAE,CACR,OAAM;YACG,IAAI,EAAE,CACf,OAAM,KAAK,EAAE,QAAQ,CAAC,IAAI,EAAE;YACnB,IAAI,EAAE,CAEf,OAAM,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE;YAC3B,IAAI;AACb,UAAM,mBAAmB,GAAG;AAC5B,UAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;SAGjB,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;AAGnB,SAAM,gBAAgB,IAAI;AAC1B,UAAO;IACP;;CAWJ,MAAM,iBAAiB,MAAM,YAAY;AACvC,SAAO,KACJ,MAAM,CACN,MAAM,MAAM,CACZ,KAAK,MAAM,aAAa,GAAG,QAAQ,CAAC,CACpC,KAAK,IAAI;;CAGd,MAAM,gBAAgB,MAAM,YAAY;AACtC,QAAM,SAAS,MAAM,QAAQ;EAC7B,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,cAAc,GAAG,EAAE;EAClD,MAAM,IAAI,QAAQ,oBAAoB,OAAO;AAC7C,SAAO,KAAK,QAAQ,IAAI,GAAG,GAAG,GAAG,GAAG,OAAO;AACzC,SAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG;GACpC,IAAI;AAEJ,OAAI,IAAI,EAAE,CACR,OAAM;YACG,IAAI,EAAE,CACf,OAAM,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE;YACvB,IAAI,EAAE,CACf,KAAI,MAAM,IACR,OAAM,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;OAExC,OAAM,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE;YAE5B,IAAI;AACb,UAAM,mBAAmB,GAAG;AAC5B,QAAI,MAAM,IACR,KAAI,MAAM,IACR,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE;QAEtB,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;QAGnB,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,CAAC,IAAI,EAAE;UAET;AACL,UAAM,QAAQ;AACd,QAAI,MAAM,IACR,KAAI,MAAM,IACR,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,IAClB,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE;QAE1B,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,IAClB,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;QAGvB,OAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,CAAC,IAAI,EAAE;;AAIhB,SAAM,gBAAgB,IAAI;AAC1B,UAAO;IACP;;CAGJ,MAAM,kBAAkB,MAAM,YAAY;AACxC,QAAM,kBAAkB,MAAM,QAAQ;AACtC,SAAO,KACJ,MAAM,MAAM,CACZ,KAAK,MAAM,cAAc,GAAG,QAAQ,CAAC,CACrC,KAAK,IAAI;;CAGd,MAAM,iBAAiB,MAAM,YAAY;AACvC,SAAO,KAAK,MAAM;EAClB,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,eAAe,GAAG,EAAE;AACnD,SAAO,KAAK,QAAQ,IAAI,KAAK,MAAM,GAAG,GAAG,GAAG,OAAO;AACjD,SAAM,UAAU,MAAM,KAAK,MAAM,GAAG,GAAG,GAAG,GAAG;GAC7C,MAAM,KAAK,IAAI,EAAE;GACjB,MAAM,KAAK,MAAM,IAAI,EAAE;GACvB,MAAM,KAAK,MAAM,IAAI,EAAE;GACvB,MAAM,OAAO;AAEb,OAAI,SAAS,OAAO,KAClB,QAAO;AAKT,QAAK,QAAQ,oBAAoB,OAAO;AAExC,OAAI,GACF,KAAI,SAAS,OAAO,SAAS,IAE3B,OAAM;OAGN,OAAM;YAEC,QAAQ,MAAM;AAGvB,QAAI,GACF,KAAI;AAEN,QAAI;AAEJ,QAAI,SAAS,KAAK;AAGhB,YAAO;AACP,SAAI,IAAI;AACN,UAAI,CAAC,IAAI;AACT,UAAI;AACJ,UAAI;YACC;AACL,UAAI,CAAC,IAAI;AACT,UAAI;;eAEG,SAAS,MAAM;AAGxB,YAAO;AACP,SAAI,GACF,KAAI,CAAC,IAAI;SAET,KAAI,CAAC,IAAI;;AAIb,QAAI,SAAS,IACX,MAAK;AAGP,UAAM,GAAG,OAAO,EAAE,GAAG,EAAE,GAAG,IAAI;cACrB,GACT,OAAM,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE;YACxB,GACT,OAAM,KAAK,EAAE,GAAG,EAAE,IAAI,GACrB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;AAGnB,SAAM,iBAAiB,IAAI;AAE3B,UAAO;IACP;;CAKJ,MAAM,gBAAgB,MAAM,YAAY;AACtC,QAAM,gBAAgB,MAAM,QAAQ;AAEpC,SAAO,KACJ,MAAM,CACN,QAAQ,GAAG,EAAE,OAAO,GAAG;;CAG5B,MAAM,eAAe,MAAM,YAAY;AACrC,QAAM,eAAe,MAAM,QAAQ;AACnC,SAAO,KACJ,MAAM,CACN,QAAQ,GAAG,QAAQ,oBAAoB,EAAE,UAAU,EAAE,OAAO,GAAG;;CASpE,MAAM,iBAAgB,WAAU,IAC9B,MAAM,IAAI,IAAI,IAAI,KAAK,IACvB,IAAI,IAAI,IAAI,IAAI,QAAQ;AACxB,MAAI,IAAI,GAAG,CACT,QAAO;WACE,IAAI,GAAG,CAChB,QAAO,KAAK,GAAG,MAAM,QAAQ,OAAO;WAC3B,IAAI,GAAG,CAChB,QAAO,KAAK,GAAG,GAAG,GAAG,IAAI,QAAQ,OAAO;WAC/B,IACT,QAAO,KAAK;MAEZ,QAAO,KAAK,OAAO,QAAQ,OAAO;AAGpC,MAAI,IAAI,GAAG,CACT,MAAK;WACI,IAAI,GAAG,CAChB,MAAK,IAAI,CAAC,KAAK,EAAE;WACR,IAAI,GAAG,CAChB,MAAK,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE;WACd,IACT,MAAK,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;WACnB,MACT,MAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE;MAE7B,MAAK,KAAK;AAGZ,SAAO,GAAG,KAAK,GAAG,KAAK,MAAM;;CAG/B,MAAM,WAAW,KAAK,SAAS,YAAY;AACzC,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,KAAI,CAAC,IAAI,GAAG,KAAK,QAAQ,CACvB,QAAO;AAIX,MAAI,QAAQ,WAAW,UAAU,CAAC,QAAQ,mBAAmB;AAM3D,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,IAAI,GAAG,OAAO;AACpB,QAAI,IAAI,GAAG,WAAW,WAAW,IAC/B;AAGF,QAAI,IAAI,GAAG,OAAO,WAAW,SAAS,GAAG;KACvC,MAAM,UAAU,IAAI,GAAG;AACvB,SAAI,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,MAC5B,QAAO;;;AAMb,UAAO;;AAGT,SAAO;;;;;;;CCziBT,MAAM,MAAM,OAAO,aAAa;CAEhC,IAAM,aAAN,MAAM,WAAW;EACf,WAAW,MAAO;AAChB,UAAO;;EAGT,YAAa,MAAM,SAAS;AAC1B,aAAU,aAAa,QAAQ;AAE/B,OAAI,gBAAgB,WAClB,KAAI,KAAK,UAAU,CAAC,CAAC,QAAQ,MAC3B,QAAO;OAEP,QAAO,KAAK;AAIhB,UAAO,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,IAAI;AACzC,SAAM,cAAc,MAAM,QAAQ;AAClC,QAAK,UAAU;AACf,QAAK,QAAQ,CAAC,CAAC,QAAQ;AACvB,QAAK,MAAM,KAAK;AAEhB,OAAI,KAAK,WAAW,IAClB,MAAK,QAAQ;OAEb,MAAK,QAAQ,KAAK,WAAW,KAAK,OAAO;AAG3C,SAAM,QAAQ,KAAK;;EAGrB,MAAO,MAAM;GACX,MAAM,IAAI,KAAK,QAAQ,QAAQ,GAAG,EAAE,mBAAmB,GAAG,EAAE;GAC5D,MAAM,IAAI,KAAK,MAAM,EAAE;AAEvB,OAAI,CAAC,EACH,OAAM,IAAI,UAAU,uBAAuB,OAAO;AAGpD,QAAK,WAAW,EAAE,OAAO,SAAY,EAAE,KAAK;AAC5C,OAAI,KAAK,aAAa,IACpB,MAAK,WAAW;AAIlB,OAAI,CAAC,EAAE,GACL,MAAK,SAAS;OAEd,MAAK,SAAS,IAAI,OAAO,EAAE,IAAI,KAAK,QAAQ,MAAM;;EAItD,WAAY;AACV,UAAO,KAAK;;EAGd,KAAM,SAAS;AACb,SAAM,mBAAmB,SAAS,KAAK,QAAQ,MAAM;AAErD,OAAI,KAAK,WAAW,OAAO,YAAY,IACrC,QAAO;AAGT,OAAI,OAAO,YAAY,SACrB,KAAI;AACF,cAAU,IAAI,OAAO,SAAS,KAAK,QAAQ;YACpC,IAAI;AACX,WAAO;;AAIX,UAAO,IAAI,SAAS,KAAK,UAAU,KAAK,QAAQ,KAAK,QAAQ;;EAG/D,WAAY,MAAM,SAAS;AACzB,OAAI,EAAE,gBAAgB,YACpB,OAAM,IAAI,UAAU,2BAA2B;AAGjD,OAAI,KAAK,aAAa,IAAI;AACxB,QAAI,KAAK,UAAU,GACjB,QAAO;AAET,WAAO,IAAI,MAAM,KAAK,OAAO,QAAQ,CAAC,KAAK,KAAK,MAAM;cAC7C,KAAK,aAAa,IAAI;AAC/B,QAAI,KAAK,UAAU,GACjB,QAAO;AAET,WAAO,IAAI,MAAM,KAAK,OAAO,QAAQ,CAAC,KAAK,KAAK,OAAO;;AAGzD,aAAU,aAAa,QAAQ;AAG/B,OAAI,QAAQ,sBACT,KAAK,UAAU,cAAc,KAAK,UAAU,YAC7C,QAAO;AAET,OAAI,CAAC,QAAQ,sBACV,KAAK,MAAM,WAAW,SAAS,IAAI,KAAK,MAAM,WAAW,SAAS,EACnE,QAAO;AAIT,OAAI,KAAK,SAAS,WAAW,IAAI,IAAI,KAAK,SAAS,WAAW,IAAI,CAChE,QAAO;AAGT,OAAI,KAAK,SAAS,WAAW,IAAI,IAAI,KAAK,SAAS,WAAW,IAAI,CAChE,QAAO;AAGT,OACG,KAAK,OAAO,YAAY,KAAK,OAAO,WACrC,KAAK,SAAS,SAAS,IAAI,IAAI,KAAK,SAAS,SAAS,IAAI,CAC1D,QAAO;AAGT,OAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,QAAQ,IAC7C,KAAK,SAAS,WAAW,IAAI,IAAI,KAAK,SAAS,WAAW,IAAI,CAC9D,QAAO;AAGT,OAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,QAAQ,IAC7C,KAAK,SAAS,WAAW,IAAI,IAAI,KAAK,SAAS,WAAW,IAAI,CAC9D,QAAO;AAET,UAAO;;;AAIX,QAAO,UAAU;CAEjB,MAAM;CACN,MAAM,EAAE,QAAQ,IAAI;CACpB,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;;;;;;CC5IN,MAAM;CACN,MAAM,aAAa,SAAS,OAAO,YAAY;AAC7C,MAAI;AACF,WAAQ,IAAI,MAAM,OAAO,QAAQ;WAC1B,IAAI;AACX,UAAO;;AAET,SAAO,MAAM,KAAK,QAAQ;;AAE5B,QAAO,UAAU;;;;;;CCTjB,MAAM;CAGN,MAAM,iBAAiB,OAAO,YAC5B,IAAI,MAAM,OAAO,QAAQ,CAAC,IACvB,KAAI,SAAQ,KAAK,KAAI,MAAK,EAAE,MAAM,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC;AAEpE,QAAO,UAAU;;;;;;CCPjB,MAAM;CACN,MAAM;CAEN,MAAM,iBAAiB,UAAU,OAAO,YAAY;EAClD,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,IAAI,WAAW;AACf,MAAI;AACF,cAAW,IAAI,MAAM,OAAO,QAAQ;WAC7B,IAAI;AACX,UAAO;;AAET,WAAS,SAAS,MAAM;AACtB,OAAI,SAAS,KAAK,EAAE,EAElB;QAAI,CAAC,OAAO,MAAM,QAAQ,EAAE,KAAK,IAAI;AAEnC,WAAM;AACN,aAAQ,IAAI,OAAO,KAAK,QAAQ;;;IAGpC;AACF,SAAO;;AAET,QAAO,UAAU;;;;;;CCxBjB,MAAM;CACN,MAAM;CACN,MAAM,iBAAiB,UAAU,OAAO,YAAY;EAClD,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,IAAI,WAAW;AACf,MAAI;AACF,cAAW,IAAI,MAAM,OAAO,QAAQ;WAC7B,IAAI;AACX,UAAO;;AAET,WAAS,SAAS,MAAM;AACtB,OAAI,SAAS,KAAK,EAAE,EAElB;QAAI,CAAC,OAAO,MAAM,QAAQ,EAAE,KAAK,GAAG;AAElC,WAAM;AACN,aAAQ,IAAI,OAAO,KAAK,QAAQ;;;IAGpC;AACF,SAAO;;AAET,QAAO,UAAU;;;;;;CCvBjB,MAAM;CACN,MAAM;CACN,MAAM;CAEN,MAAM,cAAc,OAAO,UAAU;AACnC,UAAQ,IAAI,MAAM,OAAO,MAAM;EAE/B,IAAI,SAAS,IAAI,OAAO,QAAQ;AAChC,MAAI,MAAM,KAAK,OAAO,CACpB,QAAO;AAGT,WAAS,IAAI,OAAO,UAAU;AAC9B,MAAI,MAAM,KAAK,OAAO,CACpB,QAAO;AAGT,WAAS;AACT,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;GACzC,MAAM,cAAc,MAAM,IAAI;GAE9B,IAAI,SAAS;AACb,eAAY,SAAS,eAAe;IAElC,MAAM,UAAU,IAAI,OAAO,WAAW,OAAO,QAAQ;AACrD,YAAQ,WAAW,UAAnB;KACE,KAAK;AACH,UAAI,QAAQ,WAAW,WAAW,EAChC,SAAQ;UAER,SAAQ,WAAW,KAAK,EAAE;AAE5B,cAAQ,MAAM,QAAQ,QAAQ;KAEhC,KAAK;KACL,KAAK;AACH,UAAI,CAAC,UAAU,GAAG,SAAS,OAAO,CAChC,UAAS;AAEX;KACF,KAAK;KACL,KAAK,KAEH;KAEF,QACE,OAAM,IAAI,MAAM,yBAAyB,WAAW,WAAW;;KAEnE;AACF,OAAI,WAAW,CAAC,UAAU,GAAG,QAAQ,OAAO,EAC1C,UAAS;;AAIb,MAAI,UAAU,MAAM,KAAK,OAAO,CAC9B,QAAO;AAGT,SAAO;;AAET,QAAO,UAAU;;;;;;CC5DjB,MAAM;CACN,MAAM,cAAc,OAAO,YAAY;AACrC,MAAI;AAGF,UAAO,IAAI,MAAM,OAAO,QAAQ,CAAC,SAAS;WACnC,IAAI;AACX,UAAO;;;AAGX,QAAO,UAAU;;;;;;CCVjB,MAAM;CACN,MAAM;CACN,MAAM,EAAE,QAAQ;CAChB,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CAEN,MAAM,WAAW,SAAS,OAAO,MAAM,YAAY;AACjD,YAAU,IAAI,OAAO,SAAS,QAAQ;AACtC,UAAQ,IAAI,MAAM,OAAO,QAAQ;EAEjC,IAAI,MAAM,OAAO,MAAM,MAAM;AAC7B,UAAQ,MAAR;GACE,KAAK;AACH,WAAO;AACP,YAAQ;AACR,WAAO;AACP,WAAO;AACP,YAAQ;AACR;GACF,KAAK;AACH,WAAO;AACP,YAAQ;AACR,WAAO;AACP,WAAO;AACP,YAAQ;AACR;GACF,QACE,OAAM,IAAI,UAAU,4CAAwC;;AAIhE,MAAI,UAAU,SAAS,OAAO,QAAQ,CACpC,QAAO;AAMT,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;GACzC,MAAM,cAAc,MAAM,IAAI;GAE9B,IAAI,OAAO;GACX,IAAI,MAAM;AAEV,eAAY,SAAS,eAAe;AAClC,QAAI,WAAW,WAAW,IACxB,cAAa,IAAI,WAAW,UAAU;AAExC,WAAO,QAAQ;AACf,UAAM,OAAO;AACb,QAAI,KAAK,WAAW,QAAQ,KAAK,QAAQ,QAAQ,CAC/C,QAAO;aACE,KAAK,WAAW,QAAQ,IAAI,QAAQ,QAAQ,CACrD,OAAM;KAER;AAIF,OAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,MAC9C,QAAO;AAKT,QAAK,CAAC,IAAI,YAAY,IAAI,aAAa,SACnC,MAAM,SAAS,IAAI,OAAO,CAC5B,QAAO;YACE,IAAI,aAAa,SAAS,KAAK,SAAS,IAAI,OAAO,CAC5D,QAAO;;AAGX,SAAO;;AAGT,QAAO,UAAU;;;;;;CC9EjB,MAAM;CACN,MAAM,OAAO,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,QAAQ;AAC9E,QAAO,UAAU;;;;;;CCHjB,MAAM;CAEN,MAAM,OAAO,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,QAAQ;AAC9E,QAAO,UAAU;;;;;;CCHjB,MAAM;CACN,MAAM,cAAc,IAAI,IAAI,YAAY;AACtC,OAAK,IAAI,MAAM,IAAI,QAAQ;AAC3B,OAAK,IAAI,MAAM,IAAI,QAAQ;AAC3B,SAAO,GAAG,WAAW,IAAI,QAAQ;;AAEnC,QAAO,UAAU;;;;;;CCHjB,MAAM;CACN,MAAM;AACN,QAAO,WAAW,UAAU,OAAO,YAAY;EAC7C,MAAM,MAAM,EAAE;EACd,IAAI,QAAQ;EACZ,IAAI,OAAO;EACX,MAAM,IAAI,SAAS,MAAM,GAAG,MAAM,QAAQ,GAAG,GAAG,QAAQ,CAAC;AACzD,OAAK,MAAM,WAAW,EAEpB,KADiB,UAAU,SAAS,OAAO,QAAQ,EACrC;AACZ,UAAO;AACP,OAAI,CAAC,MACH,SAAQ;SAEL;AACL,OAAI,KACF,KAAI,KAAK,CAAC,OAAO,KAAK,CAAC;AAEzB,UAAO;AACP,WAAQ;;AAGZ,MAAI,MACF,KAAI,KAAK,CAAC,OAAO,KAAK,CAAC;EAGzB,MAAM,SAAS,EAAE;AACjB,OAAK,MAAM,CAAC,KAAK,QAAQ,IACvB,KAAI,QAAQ,IACV,QAAO,KAAK,IAAI;WACP,CAAC,OAAO,QAAQ,EAAE,GAC3B,QAAO,KAAK,IAAI;WACP,CAAC,IACV,QAAO,KAAK,KAAK,MAAM;WACd,QAAQ,EAAE,GACnB,QAAO,KAAK,KAAK,MAAM;MAEvB,QAAO,KAAK,GAAG,IAAI,KAAK,MAAM;EAGlC,MAAM,aAAa,OAAO,KAAK,OAAO;EACtC,MAAM,WAAW,OAAO,MAAM,QAAQ,WAAW,MAAM,MAAM,OAAO,MAAM;AAC1E,SAAO,WAAW,SAAS,SAAS,SAAS,aAAa;;;;;;;CC7C5D,MAAM;CACN,MAAM;CACN,MAAM,EAAE,QAAQ;CAChB,MAAM;CACN,MAAM;CAsCN,MAAM,UAAU,KAAK,KAAK,UAAU,EAAE,KAAK;AACzC,MAAI,QAAQ,IACV,QAAO;AAGT,QAAM,IAAI,MAAM,KAAK,QAAQ;AAC7B,QAAM,IAAI,MAAM,KAAK,QAAQ;EAC7B,IAAI,aAAa;AAEjB,QAAO,MAAK,MAAM,aAAa,IAAI,KAAK;AACtC,QAAK,MAAM,aAAa,IAAI,KAAK;IAC/B,MAAM,QAAQ,aAAa,WAAW,WAAW,QAAQ;AACzD,iBAAa,cAAc,UAAU;AACrC,QAAI,MACF,UAAS;;AAOb,OAAI,WACF,QAAO;;AAGX,SAAO;;CAGT,MAAM,+BAA+B,CAAC,IAAI,WAAW,YAAY,CAAC;CAClE,MAAM,iBAAiB,CAAC,IAAI,WAAW,UAAU,CAAC;CAElD,MAAM,gBAAgB,KAAK,KAAK,YAAY;AAC1C,MAAI,QAAQ,IACV,QAAO;AAGT,MAAI,IAAI,WAAW,KAAK,IAAI,GAAG,WAAW,IACxC,KAAI,IAAI,WAAW,KAAK,IAAI,GAAG,WAAW,IACxC,QAAO;WACE,QAAQ,kBACjB,OAAM;MAEN,OAAM;AAIV,MAAI,IAAI,WAAW,KAAK,IAAI,GAAG,WAAW,IACxC,KAAI,QAAQ,kBACV,QAAO;MAEP,OAAM;EAIV,MAAM,wBAAQ,IAAI,KAAK;EACvB,IAAI,IAAI;AACR,OAAK,MAAM,KAAK,IACd,KAAI,EAAE,aAAa,OAAO,EAAE,aAAa,KACvC,MAAK,SAAS,IAAI,GAAG,QAAQ;WACpB,EAAE,aAAa,OAAO,EAAE,aAAa,KAC9C,MAAK,QAAQ,IAAI,GAAG,QAAQ;MAE5B,OAAM,IAAI,EAAE,OAAO;AAIvB,MAAI,MAAM,OAAO,EACf,QAAO;EAGT,IAAI;AACJ,MAAI,MAAM,IAAI;AACZ,cAAW,QAAQ,GAAG,QAAQ,GAAG,QAAQ,QAAQ;AACjD,OAAI,WAAW,EACb,QAAO;YACE,aAAa,MAAM,GAAG,aAAa,QAAQ,GAAG,aAAa,MACpE,QAAO;;AAKX,OAAK,MAAM,MAAM,OAAO;AACtB,OAAI,MAAM,CAAC,UAAU,IAAI,OAAO,GAAG,EAAE,QAAQ,CAC3C,QAAO;AAGT,OAAI,MAAM,CAAC,UAAU,IAAI,OAAO,GAAG,EAAE,QAAQ,CAC3C,QAAO;AAGT,QAAK,MAAM,KAAK,IACd,KAAI,CAAC,UAAU,IAAI,OAAO,EAAE,EAAE,QAAQ,CACpC,QAAO;AAIX,UAAO;;EAGT,IAAI,QAAQ;EACZ,IAAI,UAAU;EAGd,IAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;EAC5C,IAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAE5C,MAAI,gBAAgB,aAAa,WAAW,WAAW,KACnD,GAAG,aAAa,OAAO,aAAa,WAAW,OAAO,EACxD,gBAAe;AAGjB,OAAK,MAAM,KAAK,KAAK;AACnB,cAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,cAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,OAAI,IAAI;AACN,QAAI,cACF;SAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,MAClC,gBAAe;;AAGnB,QAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,cAAS,SAAS,IAAI,GAAG,QAAQ;AACjC,SAAI,WAAW,KAAK,WAAW,GAC7B,QAAO;eAEA,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,EAAE,EAAE,QAAQ,CAC1E,QAAO;;AAGX,OAAI,IAAI;AACN,QAAI,cACF;SAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,MAClC,gBAAe;;AAGnB,QAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,aAAQ,QAAQ,IAAI,GAAG,QAAQ;AAC/B,SAAI,UAAU,KAAK,UAAU,GAC3B,QAAO;eAEA,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,EAAE,EAAE,QAAQ,CAC1E,QAAO;;AAGX,OAAI,CAAC,EAAE,aAAa,MAAM,OAAO,aAAa,EAC5C,QAAO;;AAOX,MAAI,MAAM,YAAY,CAAC,MAAM,aAAa,EACxC,QAAO;AAGT,MAAI,MAAM,YAAY,CAAC,MAAM,aAAa,EACxC,QAAO;AAMT,MAAI,gBAAgB,aAClB,QAAO;AAGT,SAAO;;CAIT,MAAM,YAAY,GAAG,GAAG,YAAY;AAClC,MAAI,CAAC,EACH,QAAO;EAET,MAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,QAAQ;AACjD,SAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;;CAIN,MAAM,WAAW,GAAG,GAAG,YAAY;AACjC,MAAI,CAAC,EACH,QAAO;EAET,MAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,QAAQ;AACjD,SAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;;AAGN,QAAO,UAAU;;;;;;CCrPjB,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;AACN,QAAO,UAAU;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,IAAI,WAAW;EACf,KAAK,WAAW;EAChB,QAAQ,WAAW;EACnB,qBAAqB,UAAU;EAC/B,eAAe,UAAU;EACzB,oBAAoB,YAAY;EAChC,qBAAqB,YAAY;EAClC;;;;;;ACpFD,MAAa,mBAAsB,SAAiB,aAAwB;CAC1E,MAAM,+BAAgB,SAAS,SAAS;AAExC,KAAI;EACF,MAAM,wCAA2B,UAAU,OAAO;AAClD,SAAO,KAAK,MAAM,YAAY;SACxB;AACN,QAAM,IAAI,MAAM,iBAAiB,WAAW;;;AAIhD,SAAgB,iBAAiB,aAAwC;AACvE,KAAI;AACF,SAAO,uCAA2C,YAAY,EAAE,cAAc;SACxE;AACN,QAAM,IAAI,MAAM,oCAAoC,cAAc;;;;;;AChBtE,MAAM,qCAAsBC,wBAAK;;;;AAKjC,SAAgB,kBAA0B;AACxC,KAAI;EACF,MAAM,2CAAmB,iCAAiC;GACxD,KAAK,QAAQ,KAAK;GAClB,UAAU;GACV,OAAO;IAAC;IAAU;IAAQ;IAAS;GACpC,CAAC,CAAC,MAAM;AAET,SAAO,mCAAsB,QAAQ,GAAG,UAAU;SAC5C;AACN,SAAO;;;;;;;;AASX,eAAsB,eAAkC;AACtD,KAAI;EACF,MAAM,EAAE,WAAW,MAAM,UACvB;GACE;GACA;GACA;GACA;GACA;GACA;GACD,CAAC,KAAK,IAAI,EACX;GACE,KAAK,iBAAiB;GACtB,UAAU;GACX,CACF;EAED,MAAM,WAAW,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,QAAQ,CAAC,IAAIC,kBAAK,QAAQ;AAE5E,MAAI,SAAS,WAAW,EACtB,OAAM,IAAI,OAAO;AAGnB,SAAO;SACD;AACN,QAAM,IAAI,MAAM,qDAAqD;;;;;;;;;ACnDzE,MAAa,eACX,MACA,eAAe,YACN;CACT,MAAM,aAAa,OAAO,OAAO,KAAK,CAAC;AACvC,KAAI,CAAC,YAAY;AACf,UAAQ,KAAK,qBAAqB;AAClC;;CAGF,MAAM,WAAW,CAAC,cAAc,GAAG,OAAO,KAAK,WAAW,CAAC;CAC3D,MAAMC,YAAwB,EAAE;AAEhC,QAAO,QAAQ,KAAK,CAAC,SAAS,CAAC,aAAa,aAAa;AACvD,YAAU,KAAK,CAAC,aAAa,GAAG,OAAO,OAAO,QAAQ,CAAC,CAAC;GACxD;CAEF,MAAM,mBAAmB,QAAwB;AAE/C,SAAO,IAAI,QAAQ,oBAAoB,GAAG,CAAC;;CAG7C,MAAM,eAAe,SAAS,KAAK,SAAS,UAAU;EACpD,MAAM,eAAe,KAAK,IAAI,GAAG,UAAU,KAAK,QAAQ,gBAAgB,IAAI,UAAU,GAAG,CAAC,CAAC;AAC3F,SAAO,KAAK,IAAI,QAAQ,QAAQ,aAAa;GAC7C;CAEF,MAAM,gBAAgB,IAAI,OAAO,aAAa,KAAK,EAAE;CACrD,MAAM,iBAAiB,aAAa,MAAM,EAAE,CAAC,KAAK,UAAU,IAAI,OAAO,QAAQ,EAAE,CAAC;CAClF,MAAM,eAAe,IAAI,cAAc,GAAG,eAAe,KAAK,IAAI,CAAC;CACnE,MAAM,eAAe,IAAI,cAAc,GAAG,eAAe,KAAK,IAAI,CAAC;CACnE,MAAM,eAAe,IAAI,cAAc,GAAG,eAAe,KAAK,IAAI,CAAC;CAEnE,MAAM,aAAa,UAAoB;AAOrC,SAAO,IANgB,MAAM,KAAK,MAAM,UAAU;GAGhD,MAAM,UAFQ,aAAa,SACN,gBAAgB,KAAK;AAE1C,UAAO,IAAI,OAAO,IAAI,OAAO,KAAK,IAAI,GAAG,QAAQ,CAAC,CAAC;IACnD,CACwB,KAAK,IAAI,CAAC;;AAGtC,SAAQ,KAAK,aAAa;AAC1B,SAAQ,KAAK,UAAU,SAAS,CAAC;AACjC,SAAQ,KAAK,aAAa;AAC1B,WAAU,SAAS,QAAQ;AACzB,UAAQ,KAAK,UAAU,IAAI,CAAC;GAC5B;AACF,SAAQ,KAAK,aAAa;;;;;;;;;AC/B5B,SAAS,mBAAmB,kBAA0B,oBAAqC;AACzF,KAAI,CAAC,iBAAkB,QAAO;AAE9B,KAAIC,sBAAO,MAAM,iBAAiB,IAAIA,sBAAO,UAAU,kBAAkB,mBAAmB,CAC1F,QAAO;CAGT,MAAM,eAAeA,sBAAO,OAAO,iBAAiB;AACpD,QAAO,eAAeA,sBAAO,UAAU,aAAa,SAAS,mBAAmB,GAAG;;;;;AAMrF,SAAS,0BAA0B,aAAqB,aAA6B;AACnF,KAAI;EACF,MAAM,6CAA8B,aAAa,gBAAgB,aAAa,eAAe;AAC7F,MAAI,yBAAY,uBAAuB,CAAE,QAAO;AAGhD,SADoB,KAAK,gCAAmB,wBAAwB,OAAO,CAAC,CACzD,WAAW;SACxB;AACN,SAAO;;;;;;AAOX,SAAS,uBAAuB,aAAoC;CAClE,MAAM,sCAAuB,YAAY;CACzC,MAAM,cAAc,iBAAiB;AAGrC,iDAD6B,cAAc,eAAe,CAC3B,CAC7B,QAAO;AAGT,KAAI,eAAe,iBAAiB,YAClC,QAAO;CAGT,MAAM,oCAAqB,aAAa;AACxC,KAAI,eAAe,aAEjB,QAAO;AAGT,QAAO,uBAAuB,WAAW;;;;;AAM3C,MAAa,uBAAuB,aAAqB,gBAAiC;AACxF,KAAI;EACF,MAAM,gBAAgB,iBAAiB,YAAY;EACnD,MAAM,6CAA8B,QAAQ,KAAK,EAAE,YAAY;EAE/D,MAAM,gEAAoC,qBAAqB,eAAe,CAAC,GAC3E,sBACA,uBAAuB,oBAAoB;AAE/C,MAAI,CAAC,mBAAmB;AACtB,WAAQ,MACN,GAAGC,6BAAc,MAAM,oDAAoD,YAAY,SACxF;AACD,UAAO;;AAGT,MAAI,sBAAsB,oBACxB,SAAQ,KACN,GAAGA,6BAAc,KAAK,2BAA2B,kBAAkB,wBACpE;EAGH,MAAM,cAAc,gBAA6B,mBAAmB,eAAe;AAEnF,MAAI,CAAC,YACH,QAAO;EAGT,MAAM,EAAE,eAAe,EAAE,EAAE,mBAAmB,EAAE,KAAK;EAErD,MAAMC,cAAsD,EAAE;EAC9D,IAAI,cAAc;AAElB,MAAI,eAAe,cACjB,QAAO,QAAQ,cAAc,cAAc,CAAC,SAAS,CAAC,MAAM,wBAAwB;GAClF,MAAM,qBAAqB,0BAA0B,mBAAmB,KAAK;GAC7E,MAAM,wBAAwB,mBAAmB,aAAa,OAAO,mBAAmB;GACxF,MAAM,4BAA4B,mBAChC,iBAAiB,OACjB,mBACD;GACD,MAAM,uBAAuB,mBAAmB,oBAAoB,mBAAmB;AAEvF,OAAK,CAAC,yBAAyB,CAAC,6BAA8B,CAAC,sBAAsB;AACnF,kBAAc;AAEd,gBAAY,QAAQ;KAClB,UAAU;KACV,cAAc,wBACVD,6BAAc,UACd,GAAGA,6BAAc,MAAM,GAAG,aAAa,SAAS;KACpD,kBAAkB,4BACdA,6BAAc,UACd,GAAGA,6BAAc,MAAM,GAAG,iBAAiB,SAAS;KACxD,cAAc,uBACVA,6BAAc,UACd,GAAGA,6BAAc,MAAM,GAAG,sBAAsB;KACrD;;IAEH;AAGJ,MAAI,CAAC,aAAa;AAChB,WAAQ,KACN,GAAGA,6BAAc,MAAM,qDAAqD,YAAY,SACzF;AACD,eAAY,aAAa,UAAU;AAEnC,UAAO;;AAGT,SAAO;UACA,OAAO;AACd,UAAQ,MAAM,6CAA6C,MAAM;AACjE,SAAO;;;;;;;;;AAUX,MAAa,4BACX,aACA,aACA,aAOG;CACH,MAAM,uCAAuB,IAAI,KAAuB;CACxD,MAAME,yBAAmC,EAAE;AAE3C,MAAK,MAAM,UAAU,aAAa;EAChC,MAAM,kCAAmB,QAAQ,KAAK,EAAE,OAAO;EAC/C,MAAM,qDAAyB,UAAU,eAAe,CAAC,GACrD,WACA,uBAAuB,SAAS;AACpC,MAAI,QAAQ;GACV,MAAMC,SAAO,qBAAqB,IAAI,OAAO,IAAI,EAAE;AACnD,UAAK,KAAK,OAAO;AACjB,wBAAqB,IAAI,QAAQA,OAAK;QAEtC,wBAAuB,KAAK,OAAO;;CAIvC,IAAI,YAAY;CAChB,MAAM,0BAAU,IAAI,KAAsB;AAE1C,MAAK,MAAM,CAAC,YAAY,qBAAqB,SAAS,EAAE;EAEtD,MAAM,SAAS,oBAAoB,SAAS,YAAY;AACxD,UAAQ,IAAI,SAAS,OAAO;AAC5B,MAAI,CAAC,OAAQ,aAAY;;CAG3B,MAAM,eAAe,YAAY;CACjC,MAAM,iBAAiB,qBAAqB;CAC5C,MAAM,cAAc,MAAM,KAAK,QAAQ,QAAQ,CAAC,CAAC,OAAO,QAAQ,CAAC;CACjE,MAAM,cAAc,iBAAiB;AAErC,KAAI,uBAAuB,UAAU,CAAC,YACpC,KAAI,CAAC,YACH,UAAS,KAAK,sBAAsB,EAAE,MAAM,0CAA0C,CAAC;MAClF;AACL,WAAS,KAAK,sBAAsB,EAClC,MAAM,6BAA6B,uBAAuB,OAAO,SAC/D,uBAAuB,WAAW,IAAI,MAAM,GAC7C,wCACF,CAAC;AACF,yBAAuB,SAAS,MAAM,QAAQ,MAAM,KAAK,IAAI,CAAC;;MAE3D;EACL,MAAM,aAAa,cAAc,IAAI,aAAa,YAAY,kBAAkB;AAEhF,WAAS,QAAQ,sBAAsB,EACrC,MAAM,kBAAkB,aAAa,SAAS,iBAAiB,IAAI,MAAM,GAAG,UAAU,eAAe,UACnG,mBAAmB,IAAI,MAAM,GAC9B,mBAAmB,YAAY,gBAAgB,cACjD,CAAC;;CAGJ,MAAM,qBAAqB,MAAM,KAAK,QAAQ,SAAS,CAAC,CACrD,QAAQ,GAAG,QAAQ,CAAC,GAAG,CACvB,KAAK,CAAC,UAAU,KAAK;AAExB,QAAO;EAAE;EAAW;EAAS;EAAsB;EAAoB;EAAwB;;;;;;;;;ACxNjG,MAAa,iBAAiB,OAAe,UAAmB;CAC9D,MAAM,YAAY;CAClB,MAAM,YAAY,UAAU,MAAM;CAClC,MAAM,aAAa,WAAW,MAAM;AAEpC,SAAQ,KAAK,GAAG,UAAU,GAAG,UAAU,GAAG,aAAa;;;;;AAMzD,MAAM,uBAAuB,UAAkB,eAAe,IAAI,WAAW,MAAgB;CAC3F,MAAM,uBAAuB;CAC7B,MAAM,sBAAsB;CAC5B,MAAM,YAAY,IAAI,IAAI;EACxB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACD,CAAC;CAEF,MAAM,0BAAU,IAAI,KAAa;AACjC,SAAQ,IAAI,IAAI;CAEhB,MAAM,iBAAiB,SAAiB,QAAQ,MAAY;AAC1D,MAAI,SAAS,SAAU;AAEvB,MAAI;GACF,MAAM,iCAAoB,SAAS,EAAE,eAAe,MAAM,CAAC;AAE3D,QAAK,MAAM,QAAQ,MACjB,KAAI,CAAC,KAAK,KAAK,WAAW,IAAI,IAAI,CAAC,UAAU,IAAI,KAAK,KAAK,EACzD;QAAI,KAAK,aAAa,EAAE;KACtB,MAAM,+BAAgB,SAAS,KAAK,KAAK;KACzC,MAAM,uCAAwB,UAAU,SAAS;AAEjD,SAAI,gBAAgB,CAAC,aAAa,WAAW,KAAK,IAAI,CAAC,aAAa,SAAS,KAAK,EAAE;AAClF,cAAQ,IAAI,aAAa;AACzB,oBAAc,UAAU,QAAQ,EAAE;;;;UAKpC;;AAKV,eAAc,SAAS;CAEvB,MAAM,aAAa,MAAM,KAAK,QAAQ,CAAC,MAAM;AAE7C,KAAI,aAAa,MAAM,EAAE;EACvB,MAAM,aAAa,aAAa,aAAa;AAC7C,SAAO,WACJ,QAAQ,WAAW,OAAO,aAAa,CAAC,SAAS,WAAW,CAAC,CAC7D,MAAM,GAAG,qBAAqB;;AAGnC,QAAO,WAAW,MAAM,GAAG,oBAAoB;;;;;AAMjD,MAAM,gBAAgB,OAAO,aAAuB;CAClD,MAAM,UAAU;CAChB,MAAM,kBAAkB,SAAS,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,KAAK;AAI7E,KAAI,SAAS,WAAW,MAAM,SAAS,OAAO,OAAO,SAAS,OAAO,OAAO;AAM1E,MALsB,qCAAc;GAClC,SAAS;GACT,SAAS;GACV,CAAC,EAEiB;GACjB,MAAM,aAAa,oCAAa;IAC9B,SAAS;IACT,QAAQ,OAAO,gBAAgB;AAI7B,YAFgB,oBADC,QAAQ,KAAK,EACgB,eAAe,GAAG,CAEjD,KAAK,YAAY;MAC9B,MAAM,WAAW,MAAM,uBAAuB;MAC9C,OAAO;MACP,aACE,WAAW,MAAM,8BAA8B,UAAU,OAAO;MACnE,EAAE;;IAEL,WAAW,WAAS;AAClB,SAAI,CAACC,QAAM,MAAM,CAAE,QAAO;KAC1B,MAAM,+BAAgB,QAAQ,KAAK,EAAEA,OAAK;AAC1C,SAAI,yBAAY,SAAS,CAAE,QAAO;AAClC,SAAI,uBAAU,SAAS,CAAC,aAAa,CAAE,QAAO;AAC9C,YAAO;;IAEV,CAAC;AAEF,iBAAc,SAAS,WAAW;AAClC,UAAO,CAAC,WAAW;;AAGrB,gBAAc,SAAS,SAAS,OAAO,OAAO,MAAM,SAAS,GAAG;AAChE,SAAO,CAAC,SAAS,OAAO,OAAO,MAAM,SAAS,GAAG;;AAInD,KAAI,gBAAgB,UAAU,EAC5B,wCAAgB;EACd,UAAU;EACV,SAAS;EACT,SAAS,gBAAgB,KAAK,UAAU;GACtC,MAAM;GACN,OAAO;GACP,SAAS;GACV,EAAE;EACJ,CAAC;AAGJ,QAAO,CAAC,IAAI;;;;;AAMd,MAAM,uBAAuB,OAAO,EAClC,WACA,qBAIqB;CACrB,MAAM,iBAAiB;AAEvB,KAAI,aAAa,eAAe,SAAS,UAAU,EAAE;AACnD,gBAAc,gBAAgB,UAAU;AACxC,SAAO;;AAGT,sCAAY;EACV,SAAS;EACT,SAAS,eAAe,KAAK,UAAU;GAAE,MAAM;GAAM,OAAO;GAAM,EAAE;EACrE,CAAC;;;;;AAMJ,MAAM,iBAAiB,OAAO,EAC5B,WACA,MACA,eAKuB;CACvB,MAAM,cAAc,EAAE;AAEtB,KAAI,yDAA6B,MAAM,UAAU,CAAC,EAAE;AAClD,gBAAc,0BAA0B,UAAU;AAClD,cAAY,KAAK,UAAU;;AAG7B,KAAI,CAAC,YAAY,QAAQ;EACvB,MAAM,oBAAoB,MAAM,cAAc,SAAS;AACvD,cAAY,KAAK,GAAI,qBAAqB,EAAE,CAAE;;AAGhD,QAAO;;;;;AAMT,MAAM,qBAAqB,OAAO,SAAmB;CACnD,MAAM,UAAU;AAChB,KAAI,KAAK,SAAS,QAAQ,IAAI,KAAK,SAAS,YAAY,EAAE;AACxD,gBAAc,SAAS,MAAM;AAC7B,SAAO;;AAGT,uCAAe;EAAE;EAAS,SAAS;EAAO,CAAC;;;;;AAM7C,MAAM,mBAAmB,OAAO,SAAmB;CACjD,MAAM,UAAU;AAEhB,KAAI,KAAK,SAAS,UAAU,EAAE;AAC5B,gBAAc,SAAS,MAAM;AAC7B,SAAO;;AAGT,uCAAe;EAAE;EAAS,SAAS;EAAO,CAAC;;AAG7C,MAAM,yBAAyB,CAAC,mBAAmB,WAAW;;;;AAK9D,MAAM,0BAA0B,OAAO,SAAmB;CACxD,MAAM,UAAU;CAChB,MAAM,qBAAqB,KAAK,WAAW,QAAQ,QAAQ,mBAAmB;CAE9E,IAAIC;AAEJ,KAAI,uBAAuB,MAAM,KAAK,SAAS,qBAAqB,EAClE,iBAAgB,KAAK,qBAAqB;CAG5C,IAAIC;AACJ,KAAI,eAAe;AACjB,gBAAc,SAAS,cAAc;AACrC,iBAAe;OAEf,gBAAe,mCAAY;EACzB;EACA,gBAAgB;EACjB,CAAC;CAGJ,MAAM,cAAc,CAAC,GAAG,uBAAuB;AAC/C,KAAI,cAAc,MAAM,CACtB,aAAY,KAAK,GAAG,aAAa,MAAM,IAAI,CAAC,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC;AAGnE,QAAO,YAAY,KAAK,IAAI;;;;;AAM9B,MAAM,qBAAqB,OAAO,SAAmB;CACnD,MAAM,UAAU;AAEhB,KAAI,KAAK,SAAS,cAAc,EAAE;AAChC,gBAAc,SAAS,MAAM;AAC7B,SAAO;;AAGT,KAAI,KAAK,SAAS,iBAAiB,EAAE;AACnC,gBAAc,SAAS,KAAK;AAC5B,SAAO;;AAGT,uCAAe;EAAE;EAAS,SAAS;EAAM,CAAC;;AAW5C,eAAe,WAAW,EACxB,gBACA,iBACA,UACA,MACA,4BACyC;CACzC,MAAM,OAAO,QAAQ,KAAK,MAAM,EAAE;AAElC,KAAI,4BAA4B,KAAK,OAAO,yBAC1C,MAAK,OAAO;AAsBd,QAAO;EACL,eAnBA,4BACC,MAAM,qBAAqB;GAAE,WAAW,KAAK,MAAM;GAAI;GAAgB,CAAC;EAmBzE,aAhBkB,MAAM,eAAe;GACvC,WAFoB,2BAA4B,KAAK,MAAM,KAAO,KAAK,MAAM;GAG7E;GACA;GACD,CAAC;EAaA,OAXY,oBAAoB,gBAAgB,MAAM,mBAAmB,KAAK,GAAG;EAYjF,SAXc,oBAAoB,gBAAgB,MAAM,iBAAiB,KAAK,GAAG;EAYjF,gBAVA,oBAAoB,WAChB,uBAAuB,KAAK,IAAI,GAChC,MAAM,wBAAwB,KAAK;EASvC,cARmB,oBAAoB,gBAAgB,MAAM,mBAAmB,KAAK,GAAG;EASzF;;AAGH,yBAAe;;;;AC/Sf,eAAe,qBAAqB,eAAuB;CACzD,IAAIC,mBAA4C,EAAE;CAClD,MAAM,eAAe,MAAMC,iBAAG,QAAQ,cAAc;CAEpD,MAAM,iBAAiB,MAAM,QAAQ,IACnC,aAAa,IAAI,OAAO,SAAS;EAE/B,MAAM,kBAAmB,MAAM,OADTC,kBAAK,KAAK,eAAe,MAAM,iBAAiB;AAEtE,qBAAmB;GAAE,GAAG;IAAmB,OAAO,gBAAgB,QAAQ;GAAS;AACnF,SAAO;GACP,CACH;AAED,QAAO;EAAE;EAAkB;EAAgB;;AAG7C,mCAAe;;;;AC9Bf,MAAM,cAAcC,kBAAK,QAAQ,QAAQ,KAAK,EAAE,qBAAqB;AAErE,MAAM,qBAAqB,OAAO,UAAkB,YAAmC;CAErF,MAAM,aADY,iBAAiB,KAAK,QAAQ,GACjB;CAE/B,MAAM,eAAe,QAAQ,QAAQ,iBAAiB,GAAG;CACzD,MAAM,WAAW,aAAa,IAAI,eAAe;AAKjD,KAAI;AACF,QAAMC,yBAAG,OAAO,YAAY;AAE5B,GADwB,MAAMA,yBAAG,SAAS,aAAa,OAAO,EAC/B,MAAM;SAC/B;CAKR,MAAM,OAAO,QAAQ;CACrB,MAAM,iBAAiB,KAAK,WAAW,QAAQ,IAAI,SAAS,iBAAiB,CAAC;AAC9E,KAAI,kBAAkB,GAAG;EACvB,MAAM,gBAAgB,KAAK;EAC3B,MAAM,eAAeD,kBAAK,QAAQ,cAAc;AAChD,EAAmBA,kBAAK,SAAS,aAAa;;CAGhD,MAAM,UAAU,IAAI,WAAW,SAAS,IAAI,aAAa;AACzD,OAAMC,yBAAG,WAAW,aAAa,SAAS,OAAO;;AAGnD,iCAAe;;;;AC7Bf,eAAe,UAAU,GAAiD;AACxE,SAAQ,EAAE,MAAV;EACE,KAAK,SACH,sCAAc;GACZ,SAAS,EAAE;GACX,UAAU,EAAE,WAAW,EAAE,EAAE,KAAK,OAAO;IAAE,MAAM,EAAE;IAAM,OAAO,EAAE;IAAO,EAAE;GACzE,SAAS,EAAE;GACZ,CAAC;EACJ,KAAK,UACH,uCAAe;GACb,SAAS,EAAE;GACX,SAAS,OAAO,EAAE,YAAY,YAAY,EAAE,UAAU;GACvD,CAAC;EACJ,KAAK;EACL,QACE,qCAAa;GACX,SAAS,EAAE;GACX,SAAU,EAAE,WAAsB;GACnC,CAAC;;;AAIR,eAAsB,oBAAoB,aAAuC;CAC/E,MAAM,SAAS,iBAAiB,YAAY;AAC5C,KAAI,CAAC,QAAQ,SAAS,OAAQ,QAAO,EAAE;CAEvC,MAAMC,UAAmB,EAAE;AAE3B,MAAK,MAAM,UAAU,OAAO,QAC1B,KAAI;AACF,UAAQ,OAAO,OAAO,MAAM,UAAU,OAAO;UACtC,OAAO;AACd,UAAQ,KACN,6BAA6B,OAAO,IAAI,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,MAAM,GACpG;AAED,MAAI,OAAO,YAAY,QAAW;AAChC,WAAQ,KAAK,4BAA4B,OAAO,IAAI,KAAK,OAAO,UAAU;AAC1E,WAAQ,OAAO,OAAO,OAAO;QAE7B,SAAQ,KAAK,oBAAoB,OAAO,IAAI,gCAAgC;;AAIlF,QAAO;;;;;AC9CT,MAAM,uBAAuB;AAE7B,SAAgB,uBAA6B;CAC3C,MAAM,qBAAqBC,kBAAK,QAAQ,QAAQ,IAAI,QAAQ,IAAI,qBAAqB;AAErF,KAAI,CAACC,gBAAG,WAAW,mBAAmB,CACpC,OAAM,IAAI,MACR,GAAGC,6BAAc,MAAM,6DAA6D,mBAAmB,8IAExG"}