@wise/wds-codemods 1.3.1-experimental-d4d0977 → 1.3.1-experimental-cb6b37f

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-CtDbFBsP.js → helpers-CPf8C-KU.js} +48 -50
  2. package/dist/helpers-CPf8C-KU.js.map +1 -0
  3. package/dist/index.js +1 -1
  4. package/dist/transforms/button/transformer.js +1 -1
  5. package/package.json +5 -5
  6. package/dist/helpers-CtDbFBsP.js.map +0 -1
package/dist/{helpers-CtDbFBsP.js → helpers-CPf8C-KU.js} RENAMED
@@ -28,7 +28,7 @@ var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__ge
28
28
  enumerable: true
29
29
  }) : target, mod));
30
30
  //#endregion
31
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/constants.js
31
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/internal/constants.js
32
32
  var require_constants = /* @__PURE__ */ __commonJSMin(((exports, module) => {
33
33
  const SEMVER_SPEC_VERSION = "2.0.0";
34
34
  const MAX_LENGTH = 256;
@@ -53,12 +53,12 @@ var require_constants = /* @__PURE__ */ __commonJSMin(((exports, module) => {
53
53
  };
54
54
  }));
55
55
  //#endregion
56
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/debug.js
56
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/internal/debug.js
57
57
  var require_debug = /* @__PURE__ */ __commonJSMin(((exports, module) => {
58
58
  module.exports = typeof process === "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...args) => console.error("SEMVER", ...args) : () => {};
59
59
  }));
60
60
  //#endregion
61
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/re.js
61
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/internal/re.js
62
62
  var require_re = /* @__PURE__ */ __commonJSMin(((exports, module) => {
63
63
  const { MAX_SAFE_COMPONENT_LENGTH, MAX_SAFE_BUILD_LENGTH, MAX_LENGTH } = require_constants();
64
64
  const debug = require_debug();
@@ -137,7 +137,7 @@ var require_re = /* @__PURE__ */ __commonJSMin(((exports, module) => {
137
137
  createToken("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
138
138
  }));
139
139
  //#endregion
140
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/parse-options.js
140
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/internal/parse-options.js
141
141
  var require_parse_options = /* @__PURE__ */ __commonJSMin(((exports, module) => {
142
142
  const looseOption = Object.freeze({ loose: true });
143
143
  const emptyOpts = Object.freeze({});
@@ -149,7 +149,7 @@ var require_parse_options = /* @__PURE__ */ __commonJSMin(((exports, module) =>
149
149
  module.exports = parseOptions;
150
150
  }));
151
151
  //#endregion
152
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/identifiers.js
152
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/internal/identifiers.js
153
153
  var require_identifiers = /* @__PURE__ */ __commonJSMin(((exports, module) => {
154
154
  const numeric = /^[0-9]+$/;
155
155
  const compareIdentifiers = (a, b) => {
@@ -169,7 +169,7 @@ var require_identifiers = /* @__PURE__ */ __commonJSMin(((exports, module) => {
169
169
  };
170
170
  }));
171
171
  //#endregion
172
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/classes/semver.js
172
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/classes/semver.js
173
173
  var require_semver$1 = /* @__PURE__ */ __commonJSMin(((exports, module) => {
174
174
  const debug = require_debug();
175
175
  const { MAX_LENGTH, MAX_SAFE_INTEGER } = require_constants();
@@ -354,7 +354,7 @@ var require_semver$1 = /* @__PURE__ */ __commonJSMin(((exports, module) => {
354
354
  };
355
355
  }));
356
356
  //#endregion
357
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/parse.js
357
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/parse.js
358
358
  var require_parse = /* @__PURE__ */ __commonJSMin(((exports, module) => {
359
359
  const SemVer = require_semver$1();
360
360
  const parse = (version, options, throwErrors = false) => {
@@ -369,7 +369,7 @@ var require_parse = /* @__PURE__ */ __commonJSMin(((exports, module) => {
369
369
  module.exports = parse;
370
370
  }));
371
371
  //#endregion
372
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/valid.js
372
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/valid.js
373
373
  var require_valid$1 = /* @__PURE__ */ __commonJSMin(((exports, module) => {
374
374
  const parse = require_parse();
375
375
  const valid = (version, options) => {
@@ -379,7 +379,7 @@ var require_valid$1 = /* @__PURE__ */ __commonJSMin(((exports, module) => {
379
379
  module.exports = valid;
380
380
  }));
381
381
  //#endregion
382
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/clean.js
382
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/clean.js
383
383
  var require_clean = /* @__PURE__ */ __commonJSMin(((exports, module) => {
384
384
  const parse = require_parse();
385
385
  const clean = (version, options) => {
@@ -389,7 +389,7 @@ var require_clean = /* @__PURE__ */ __commonJSMin(((exports, module) => {
389
389
  module.exports = clean;
390
390
  }));
391
391
  //#endregion
392
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/inc.js
392
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/inc.js
393
393
  var require_inc = /* @__PURE__ */ __commonJSMin(((exports, module) => {
394
394
  const SemVer = require_semver$1();
395
395
  const inc = (version, release, options, identifier, identifierBase) => {
@@ -407,7 +407,7 @@ var require_inc = /* @__PURE__ */ __commonJSMin(((exports, module) => {
407
407
  module.exports = inc;
408
408
  }));
409
409
  //#endregion
410
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/diff.js
410
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/diff.js
411
411
  var require_diff = /* @__PURE__ */ __commonJSMin(((exports, module) => {
412
412
  const parse = require_parse();
413
413
  const diff = (version1, version2) => {
@@ -435,28 +435,28 @@ var require_diff = /* @__PURE__ */ __commonJSMin(((exports, module) => {
435
435
  module.exports = diff;
436
436
  }));
437
437
  //#endregion
438
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/major.js
438
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/major.js
439
439
  var require_major = /* @__PURE__ */ __commonJSMin(((exports, module) => {
440
440
  const SemVer = require_semver$1();
441
441
  const major = (a, loose) => new SemVer(a, loose).major;
442
442
  module.exports = major;
443
443
  }));
444
444
  //#endregion
445
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/minor.js
445
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/minor.js
446
446
  var require_minor = /* @__PURE__ */ __commonJSMin(((exports, module) => {
447
447
  const SemVer = require_semver$1();
448
448
  const minor = (a, loose) => new SemVer(a, loose).minor;
449
449
  module.exports = minor;
450
450
  }));
451
451
  //#endregion
452
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/patch.js
452
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/patch.js
453
453
  var require_patch = /* @__PURE__ */ __commonJSMin(((exports, module) => {
454
454
  const SemVer = require_semver$1();
455
455
  const patch = (a, loose) => new SemVer(a, loose).patch;
456
456
  module.exports = patch;
457
457
  }));
458
458
  //#endregion
459
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/prerelease.js
459
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/prerelease.js
460
460
  var require_prerelease = /* @__PURE__ */ __commonJSMin(((exports, module) => {
461
461
  const parse = require_parse();
462
462
  const prerelease = (version, options) => {
@@ -466,28 +466,28 @@ var require_prerelease = /* @__PURE__ */ __commonJSMin(((exports, module) => {
466
466
  module.exports = prerelease;
467
467
  }));
468
468
  //#endregion
469
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/compare.js
469
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/compare.js
470
470
  var require_compare = /* @__PURE__ */ __commonJSMin(((exports, module) => {
471
471
  const SemVer = require_semver$1();
472
472
  const compare = (a, b, loose) => new SemVer(a, loose).compare(new SemVer(b, loose));
473
473
  module.exports = compare;
474
474
  }));
475
475
  //#endregion
476
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/rcompare.js
476
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/rcompare.js
477
477
  var require_rcompare = /* @__PURE__ */ __commonJSMin(((exports, module) => {
478
478
  const compare = require_compare();
479
479
  const rcompare = (a, b, loose) => compare(b, a, loose);
480
480
  module.exports = rcompare;
481
481
  }));
482
482
  //#endregion
483
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/compare-loose.js
483
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/compare-loose.js
484
484
  var require_compare_loose = /* @__PURE__ */ __commonJSMin(((exports, module) => {
485
485
  const compare = require_compare();
486
486
  const compareLoose = (a, b) => compare(a, b, true);
487
487
  module.exports = compareLoose;
488
488
  }));
489
489
  //#endregion
490
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/compare-build.js
490
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/compare-build.js
491
491
  var require_compare_build = /* @__PURE__ */ __commonJSMin(((exports, module) => {
492
492
  const SemVer = require_semver$1();
493
493
  const compareBuild = (a, b, loose) => {
@@ -498,63 +498,63 @@ var require_compare_build = /* @__PURE__ */ __commonJSMin(((exports, module) =>
498
498
  module.exports = compareBuild;
499
499
  }));
500
500
  //#endregion
501
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/sort.js
501
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/sort.js
502
502
  var require_sort = /* @__PURE__ */ __commonJSMin(((exports, module) => {
503
503
  const compareBuild = require_compare_build();
504
504
  const sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose));
505
505
  module.exports = sort;
506
506
  }));
507
507
  //#endregion
508
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/rsort.js
508
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/rsort.js
509
509
  var require_rsort = /* @__PURE__ */ __commonJSMin(((exports, module) => {
510
510
  const compareBuild = require_compare_build();
511
511
  const rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose));
512
512
  module.exports = rsort;
513
513
  }));
514
514
  //#endregion
515
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/gt.js
515
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/gt.js
516
516
  var require_gt = /* @__PURE__ */ __commonJSMin(((exports, module) => {
517
517
  const compare = require_compare();
518
518
  const gt = (a, b, loose) => compare(a, b, loose) > 0;
519
519
  module.exports = gt;
520
520
  }));
521
521
  //#endregion
522
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/lt.js
522
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/lt.js
523
523
  var require_lt = /* @__PURE__ */ __commonJSMin(((exports, module) => {
524
524
  const compare = require_compare();
525
525
  const lt = (a, b, loose) => compare(a, b, loose) < 0;
526
526
  module.exports = lt;
527
527
  }));
528
528
  //#endregion
529
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/eq.js
529
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/eq.js
530
530
  var require_eq = /* @__PURE__ */ __commonJSMin(((exports, module) => {
531
531
  const compare = require_compare();
532
532
  const eq = (a, b, loose) => compare(a, b, loose) === 0;
533
533
  module.exports = eq;
534
534
  }));
535
535
  //#endregion
536
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/neq.js
536
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/neq.js
537
537
  var require_neq = /* @__PURE__ */ __commonJSMin(((exports, module) => {
538
538
  const compare = require_compare();
539
539
  const neq = (a, b, loose) => compare(a, b, loose) !== 0;
540
540
  module.exports = neq;
541
541
  }));
542
542
  //#endregion
543
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/gte.js
543
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/gte.js
544
544
  var require_gte = /* @__PURE__ */ __commonJSMin(((exports, module) => {
545
545
  const compare = require_compare();
546
546
  const gte = (a, b, loose) => compare(a, b, loose) >= 0;
547
547
  module.exports = gte;
548
548
  }));
549
549
  //#endregion
550
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/lte.js
550
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/lte.js
551
551
  var require_lte = /* @__PURE__ */ __commonJSMin(((exports, module) => {
552
552
  const compare = require_compare();
553
553
  const lte = (a, b, loose) => compare(a, b, loose) <= 0;
554
554
  module.exports = lte;
555
555
  }));
556
556
  //#endregion
557
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/cmp.js
557
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/cmp.js
558
558
  var require_cmp = /* @__PURE__ */ __commonJSMin(((exports, module) => {
559
559
  const eq = require_eq();
560
560
  const neq = require_neq();
@@ -586,7 +586,7 @@ var require_cmp = /* @__PURE__ */ __commonJSMin(((exports, module) => {
586
586
  module.exports = cmp;
587
587
  }));
588
588
  //#endregion
589
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/coerce.js
589
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/coerce.js
590
590
  var require_coerce = /* @__PURE__ */ __commonJSMin(((exports, module) => {
591
591
  const SemVer = require_semver$1();
592
592
  const parse = require_parse();
@@ -614,7 +614,7 @@ var require_coerce = /* @__PURE__ */ __commonJSMin(((exports, module) => {
614
614
  module.exports = coerce;
615
615
  }));
616
616
  //#endregion
617
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/truncate.js
617
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/truncate.js
618
618
  var require_truncate = /* @__PURE__ */ __commonJSMin(((exports, module) => {
619
619
  const parse = require_parse();
620
620
  const constants = require_constants();
@@ -647,7 +647,7 @@ var require_truncate = /* @__PURE__ */ __commonJSMin(((exports, module) => {
647
647
  module.exports = truncate;
648
648
  }));
649
649
  //#endregion
650
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/lrucache.js
650
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/internal/lrucache.js
651
651
  var require_lrucache = /* @__PURE__ */ __commonJSMin(((exports, module) => {
652
652
  var LRUCache = class {
653
653
  constructor() {
@@ -680,7 +680,7 @@ var require_lrucache = /* @__PURE__ */ __commonJSMin(((exports, module) => {
680
680
  module.exports = LRUCache;
681
681
  }));
682
682
  //#endregion
683
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/classes/range.js
683
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/classes/range.js
684
684
  var require_range = /* @__PURE__ */ __commonJSMin(((exports, module) => {
685
685
  const SPACE_CHARACTERS = /\s+/g;
686
686
  module.exports = class Range {
@@ -824,7 +824,6 @@ var require_range = /* @__PURE__ */ __commonJSMin(((exports, module) => {
824
824
  return comp;
825
825
  };
826
826
  const isX = (id) => !id || id.toLowerCase() === "x" || id === "*";
827
- const invalidXRangeOrder = (M, m, p) => isX(M) && !isX(m) || isX(m) && p && !isX(p);
828
827
  const replaceTildes = (comp, options) => {
829
828
  return comp.trim().split(/\s+/).map((c) => replaceTilde(c, options)).join(" ");
830
829
  };
@@ -865,8 +864,8 @@ var require_range = /* @__PURE__ */ __commonJSMin(((exports, module) => {
865
864
  else ret = `>=${M}.${m}.${p}-${pr} <${+M + 1}.0.0-0`;
866
865
  } else {
867
866
  debug("no pr");
868
- if (M === "0") if (m === "0") ret = `>=${M}.${m}.${p} <${M}.${m}.${+p + 1}-0`;
869
- else ret = `>=${M}.${m}.${p} <${M}.${+m + 1}.0-0`;
867
+ if (M === "0") if (m === "0") ret = `>=${M}.${m}.${p}${z} <${M}.${m}.${+p + 1}-0`;
868
+ else ret = `>=${M}.${m}.${p}${z} <${M}.${+m + 1}.0-0`;
870
869
  else ret = `>=${M}.${m}.${p} <${+M + 1}.0.0-0`;
871
870
  }
872
871
  debug("caret return", ret);
@@ -882,7 +881,6 @@ var require_range = /* @__PURE__ */ __commonJSMin(((exports, module) => {
882
881
  const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE];
883
882
  return comp.replace(r, (ret, gtlt, M, m, p, pr) => {
884
883
  debug("xRange", comp, ret, gtlt, M, m, p, pr);
885
- if (invalidXRangeOrder(M, m, p)) return comp;
886
884
  const xM = isX(M);
887
885
  const xm = xM || isX(m);
888
886
  const xp = xm || isX(p);
@@ -956,7 +954,7 @@ var require_range = /* @__PURE__ */ __commonJSMin(((exports, module) => {
956
954
  };
957
955
  }));
958
956
  //#endregion
959
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/classes/comparator.js
957
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/classes/comparator.js
960
958
  var require_comparator = /* @__PURE__ */ __commonJSMin(((exports, module) => {
961
959
  const ANY = Symbol("SemVer ANY");
962
960
  module.exports = class Comparator {
@@ -1026,7 +1024,7 @@ var require_comparator = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1026
1024
  const Range = require_range();
1027
1025
  }));
1028
1026
  //#endregion
1029
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/satisfies.js
1027
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/satisfies.js
1030
1028
  var require_satisfies = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1031
1029
  const Range = require_range();
1032
1030
  const satisfies = (version, range, options) => {
@@ -1040,14 +1038,14 @@ var require_satisfies = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1040
1038
  module.exports = satisfies;
1041
1039
  }));
1042
1040
  //#endregion
1043
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/to-comparators.js
1041
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/to-comparators.js
1044
1042
  var require_to_comparators = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1045
1043
  const Range = require_range();
1046
1044
  const toComparators = (range, options) => new Range(range, options).set.map((comp) => comp.map((c) => c.value).join(" ").trim().split(" "));
1047
1045
  module.exports = toComparators;
1048
1046
  }));
1049
1047
  //#endregion
1050
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/max-satisfying.js
1048
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/max-satisfying.js
1051
1049
  var require_max_satisfying = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1052
1050
  const SemVer = require_semver$1();
1053
1051
  const Range = require_range();
@@ -1073,7 +1071,7 @@ var require_max_satisfying = /* @__PURE__ */ __commonJSMin(((exports, module) =>
1073
1071
  module.exports = maxSatisfying;
1074
1072
  }));
1075
1073
  //#endregion
1076
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/min-satisfying.js
1074
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/min-satisfying.js
1077
1075
  var require_min_satisfying = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1078
1076
  const SemVer = require_semver$1();
1079
1077
  const Range = require_range();
@@ -1099,7 +1097,7 @@ var require_min_satisfying = /* @__PURE__ */ __commonJSMin(((exports, module) =>
1099
1097
  module.exports = minSatisfying;
1100
1098
  }));
1101
1099
  //#endregion
1102
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/min-version.js
1100
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/min-version.js
1103
1101
  var require_min_version = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1104
1102
  const SemVer = require_semver$1();
1105
1103
  const Range = require_range();
@@ -1139,7 +1137,7 @@ var require_min_version = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1139
1137
  module.exports = minVersion;
1140
1138
  }));
1141
1139
  //#endregion
1142
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/valid.js
1140
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/valid.js
1143
1141
  var require_valid = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1144
1142
  const Range = require_range();
1145
1143
  const validRange = (range, options) => {
@@ -1152,7 +1150,7 @@ var require_valid = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1152
1150
  module.exports = validRange;
1153
1151
  }));
1154
1152
  //#endregion
1155
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/outside.js
1153
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/outside.js
1156
1154
  var require_outside = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1157
1155
  const SemVer = require_semver$1();
1158
1156
  const Comparator = require_comparator();
@@ -1205,21 +1203,21 @@ var require_outside = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1205
1203
  module.exports = outside;
1206
1204
  }));
1207
1205
  //#endregion
1208
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/gtr.js
1206
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/gtr.js
1209
1207
  var require_gtr = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1210
1208
  const outside = require_outside();
1211
1209
  const gtr = (version, range, options) => outside(version, range, ">", options);
1212
1210
  module.exports = gtr;
1213
1211
  }));
1214
1212
  //#endregion
1215
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/ltr.js
1213
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/ltr.js
1216
1214
  var require_ltr = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1217
1215
  const outside = require_outside();
1218
1216
  const ltr = (version, range, options) => outside(version, range, "<", options);
1219
1217
  module.exports = ltr;
1220
1218
  }));
1221
1219
  //#endregion
1222
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/intersects.js
1220
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/intersects.js
1223
1221
  var require_intersects = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1224
1222
  const Range = require_range();
1225
1223
  const intersects = (r1, r2, options) => {
@@ -1230,7 +1228,7 @@ var require_intersects = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1230
1228
  module.exports = intersects;
1231
1229
  }));
1232
1230
  //#endregion
1233
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/simplify.js
1231
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/simplify.js
1234
1232
  var require_simplify = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1235
1233
  const satisfies = require_satisfies();
1236
1234
  const compare = require_compare();
@@ -1260,7 +1258,7 @@ var require_simplify = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1260
1258
  };
1261
1259
  }));
1262
1260
  //#endregion
1263
- //#region node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/subset.js
1261
+ //#region node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/subset.js
1264
1262
  var require_subset = /* @__PURE__ */ __commonJSMin(((exports, module) => {
1265
1263
  const Range = require_range();
1266
1264
  const Comparator = require_comparator();
@@ -1946,4 +1944,4 @@ function validateClaudeConfig() {
1946
1944
  //#endregion
1947
1945
  export { getOptions as a, assessPrerequisitesBatch as c, getCodemodConfig as d, loadTransformModules as i, findPackages as l, runTransformPrompts as n, logToInquirer as o, reportManualReview as r, assessPrerequisites as s, validateClaudeConfig as t, findProjectRoot as u };
1948
1946
 
1949
- //# sourceMappingURL=helpers-CtDbFBsP.js.map
1947
+ //# sourceMappingURL=helpers-CPf8C-KU.js.map
package/dist/helpers-CPf8C-KU.js.map ADDED
@@ -0,0 +1 @@
1
+ {"version":3,"file":"helpers-CPf8C-KU.js","names":["semver","list","fs","fs"],"sources":["../node_modules/.pnpm/semver@7.8.2/node_modules/semver/internal/constants.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/internal/debug.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/internal/re.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/internal/parse-options.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/internal/identifiers.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/classes/semver.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/parse.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/valid.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/clean.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/inc.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/diff.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/major.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/minor.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/patch.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/prerelease.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/compare.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/rcompare.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/compare-loose.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/compare-build.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/sort.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/rsort.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/gt.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/lt.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/eq.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/neq.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/gte.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/lte.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/cmp.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/coerce.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/truncate.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/internal/lrucache.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/classes/range.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/classes/comparator.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/functions/satisfies.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/to-comparators.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/max-satisfying.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/min-satisfying.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/min-version.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/valid.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/outside.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/gtr.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/ltr.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/intersects.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/simplify.js","../node_modules/.pnpm/semver@7.8.2/node_modules/semver/ranges/subset.js","../node_modules/.pnpm/semver@7.8.2/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 identifier, 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')\n\nconst isPrereleaseIdentifier = (prerelease, identifier) => {\n const identifiers = identifier.split('.')\n if (identifiers.length > prerelease.length) {\n return false\n }\n\n for (let i = 0; i < identifiers.length; i++) {\n if (compareIdentifiers(prerelease[i], identifiers[i]) !== 0) {\n return false\n }\n }\n\n return true\n}\n\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 (isPrereleaseIdentifier(this.prerelease, identifier)) {\n const prereleaseBase = this.prerelease[identifier.split('.').length]\n if (isNaN(prereleaseBase)) {\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\nconst parse = require('./parse')\nconst constants = require('../internal/constants')\nconst SemVer = require('../classes/semver')\n\nconst truncate = (version, truncation, options) => {\n if (!constants.RELEASE_TYPES.includes(truncation)) {\n return null\n }\n\n const clonedVersion = cloneInputVersion(version, options)\n return clonedVersion && doTruncation(clonedVersion, truncation)\n}\n\nconst cloneInputVersion = (version, options) => {\n const versionStringToParse = (\n version instanceof SemVer ? version.version : version\n )\n\n return parse(versionStringToParse, options)\n}\n\nconst doTruncation = (version, truncation) => {\n if (isPrerelease(truncation)) {\n return version.version\n }\n\n version.prerelease = []\n\n switch (truncation) {\n case 'major':\n version.minor = 0\n version.patch = 0\n break\n case 'minor':\n version.patch = 0\n break\n }\n\n return version.format()\n}\n\nconst isPrerelease = (type) => {\n return type.startsWith('pre')\n}\n\nmodule.exports = truncate\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 // strip build metadata so it can't bleed into the version\n range = range.replace(BUILDSTRIPRE, '')\n\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 src,\n t,\n comparatorTrimReplace,\n tildeTrimReplace,\n caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\n// unbounded global build-metadata stripper used by parseRange\nconst BUILDSTRIPRE = new RegExp(src[t.BUILD], 'g')\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 === '>=' && !c.test(gt.semver)) {\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 === '<=' && !c.test(lt.semver)) {\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 truncate = require('./functions/truncate')\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 truncate,\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: unknown;\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 };\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,45],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAIA,MAAM,sBAAsB;CAE5B,MAAM,aAAa;CACnB,MAAM,mBAAmB,OAAO,oBACL;CAmB3B,OAAO,UAAU;EACf;EACA;EACA,uBAf4B,aAAa;EAgBzC;EACA;GAdA;GACA;GACA;GACA;GACA;GACA;GACA;EAQA;EACA;EACA,yBAAyB;EACzB,YAAY;CACd;;;;;CC1BA,OAAO,UAPL,OAAO,YAAY,YACnB,QAAQ,OACR,QAAQ,IAAI,cACZ,cAAc,KAAK,QAAQ,IAAI,UAAU,KACtC,GAAG,SAAS,QAAQ,MAAM,UAAU,GAAG,IAAI,UACtC,CAAC;;;;;CCNX,MAAM,EACJ,2BACA,uBACA,eAAA,kBAAA;CAEF,MAAM,QAAA,cAAA;CACN,UAAU,OAAO,UAAU,CAAC;CAG5B,MAAM,KAAK,QAAQ,KAAK,CAAC;CACzB,MAAM,SAAS,QAAQ,SAAS,CAAC;CACjC,MAAM,MAAM,QAAQ,MAAM,CAAC;CAC3B,MAAM,UAAU,QAAQ,UAAU,CAAC;CACnC,MAAM,IAAI,QAAQ,IAAI,CAAC;CACvB,IAAI,IAAI;CAER,MAAM,mBAAmB;CAQzB,MAAM,wBAAwB;EAC5B,CAAC,OAAO,CAAC;EACT,CAAC,OAAO,UAAU;EAClB,CAAC,kBAAkB,qBAAqB;CAC1C;CAEA,MAAM,iBAAiB,UAAU;EAC/B,KAAK,MAAM,CAAC,OAAO,QAAQ,uBACzB,QAAQ,MACL,MAAM,GAAG,MAAM,EAAE,CAAC,CAAC,KAAK,GAAG,MAAM,KAAK,IAAI,EAAE,CAAC,CAC7C,MAAM,GAAG,MAAM,EAAE,CAAC,CAAC,KAAK,GAAG,MAAM,KAAK,IAAI,EAAE;EAEjD,OAAO;CACT;CAEA,MAAM,eAAe,MAAM,OAAO,aAAa;EAC7C,MAAM,OAAO,cAAc,KAAK;EAChC,MAAM,QAAQ;EACd,MAAM,MAAM,OAAO,KAAK;EACxB,EAAE,QAAQ;EACV,IAAI,SAAS;EACb,QAAQ,SAAS;EACjB,GAAG,SAAS,IAAI,OAAO,OAAO,WAAW,MAAM,KAAA,CAAS;EACxD,OAAO,SAAS,IAAI,OAAO,MAAM,WAAW,MAAM,KAAA,CAAS;CAC7D;CAQA,YAAY,qBAAqB,aAAa;CAC9C,YAAY,0BAA0B,MAAM;CAM5C,YAAY,wBAAwB,gBAAgB,iBAAiB,EAAE;CAKvE,YAAY,eAAe,IAAI,IAAI,EAAE,mBAAmB,OACjC,IAAI,EAAE,mBAAmB,OACzB,IAAI,EAAE,mBAAmB,EAAE;CAElD,YAAY,oBAAoB,IAAI,IAAI,EAAE,wBAAwB,OACtC,IAAI,EAAE,wBAAwB,OAC9B,IAAI,EAAE,wBAAwB,EAAE;CAO5D,YAAY,wBAAwB,MAAM,IAAI,EAAE,sBAC/C,GAAG,IAAI,EAAE,mBAAmB,EAAE;CAE/B,YAAY,6BAA6B,MAAM,IAAI,EAAE,sBACpD,GAAG,IAAI,EAAE,wBAAwB,EAAE;CAMpC,YAAY,cAAc,QAAQ,IAAI,EAAE,sBACvC,QAAQ,IAAI,EAAE,sBAAsB,KAAK;CAE1C,YAAY,mBAAmB,SAAS,IAAI,EAAE,2BAC7C,QAAQ,IAAI,EAAE,2BAA2B,KAAK;CAK/C,YAAY,mBAAmB,GAAG,iBAAiB,EAAE;CAMrD,YAAY,SAAS,UAAU,IAAI,EAAE,iBACpC,QAAQ,IAAI,EAAE,iBAAiB,KAAK;CAWrC,YAAY,aAAa,KAAK,IAAI,EAAE,eACjC,IAAI,EAAE,YAAY,GACnB,IAAI,EAAE,OAAO,EAAE;CAEjB,YAAY,QAAQ,IAAI,IAAI,EAAE,WAAW,EAAE;CAK3C,YAAY,cAAc,WAAW,IAAI,EAAE,oBACxC,IAAI,EAAE,iBAAiB,GACxB,IAAI,EAAE,OAAO,EAAE;CAEjB,YAAY,SAAS,IAAI,IAAI,EAAE,YAAY,EAAE;CAE7C,YAAY,QAAQ,cAAc;CAKlC,YAAY,yBAAyB,GAAG,IAAI,EAAE,wBAAwB,SAAS;CAC/E,YAAY,oBAAoB,GAAG,IAAI,EAAE,mBAAmB,SAAS;CAErE,YAAY,eAAe,YAAY,IAAI,EAAE,kBAAkB,UAClC,IAAI,EAAE,kBAAkB,UACxB,IAAI,EAAE,kBAAkB,MAC5B,IAAI,EAAE,YAAY,IACtB,IAAI,EAAE,OAAO,MACT;CAEzB,YAAY,oBAAoB,YAAY,IAAI,EAAE,uBAAuB,UACvC,IAAI,EAAE,uBAAuB,UAC7B,IAAI,EAAE,uBAAuB,MACjC,IAAI,EAAE,iBAAiB,IAC3B,IAAI,EAAE,OAAO,MACT;CAE9B,YAAY,UAAU,IAAI,IAAI,EAAE,MAAM,MAAM,IAAI,EAAE,aAAa,EAAE;CACjE,YAAY,eAAe,IAAI,IAAI,EAAE,MAAM,MAAM,IAAI,EAAE,kBAAkB,EAAE;CAI3E,YAAY,eAAe,oBACD,0BAA0B,iBACtB,0BAA0B,mBAC1B,0BAA0B,KAAK;CAC7D,YAAY,UAAU,GAAG,IAAI,EAAE,aAAa,aAAa;CACzD,YAAY,cAAc,IAAI,EAAE,eAClB,MAAM,IAAI,EAAE,YAAY,OAClB,IAAI,EAAE,OAAO,eACL;CAC5B,YAAY,aAAa,IAAI,EAAE,SAAS,IAAI;CAC5C,YAAY,iBAAiB,IAAI,EAAE,aAAa,IAAI;CAIpD,YAAY,aAAa,SAAS;CAElC,YAAY,aAAa,SAAS,IAAI,EAAE,WAAW,OAAO,IAAI;CAC9D,QAAQ,mBAAmB;CAE3B,YAAY,SAAS,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,aAAa,EAAE;CACjE,YAAY,cAAc,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,kBAAkB,EAAE;CAI3E,YAAY,aAAa,SAAS;CAElC,YAAY,aAAa,SAAS,IAAI,EAAE,WAAW,OAAO,IAAI;CAC9D,QAAQ,mBAAmB;CAE3B,YAAY,SAAS,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,aAAa,EAAE;CACjE,YAAY,cAAc,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,kBAAkB,EAAE;CAG3E,YAAY,mBAAmB,IAAI,IAAI,EAAE,MAAM,OAAO,IAAI,EAAE,YAAY,MAAM;CAC9E,YAAY,cAAc,IAAI,IAAI,EAAE,MAAM,OAAO,IAAI,EAAE,WAAW,MAAM;CAIxE,YAAY,kBAAkB,SAAS,IAAI,EAAE,MAC5C,OAAO,IAAI,EAAE,YAAY,GAAG,IAAI,EAAE,aAAa,IAAI,IAAI;CACxD,QAAQ,wBAAwB;CAMhC,YAAY,eAAe,SAAS,IAAI,EAAE,aAAa,aAEhC,IAAI,EAAE,aAAa,OAChB;CAE1B,YAAY,oBAAoB,SAAS,IAAI,EAAE,kBAAkB,aAErC,IAAI,EAAE,kBAAkB,OACrB;CAG/B,YAAY,QAAQ,iBAAiB;CAErC,YAAY,QAAQ,2BAA2B;CAC/C,YAAY,WAAW,6BAA6B;;;;;CC3NpD,MAAM,cAAc,OAAO,OAAO,EAAE,OAAO,KAAK,CAAC;CACjD,MAAM,YAAY,OAAO,OAAO,CAAE,CAAC;CACnC,MAAM,gBAAe,YAAW;EAC9B,IAAI,CAAC,SACH,OAAO;EAGT,IAAI,OAAO,YAAY,UACrB,OAAO;EAGT,OAAO;CACT;CACA,OAAO,UAAU;;;;;CCdjB,MAAM,UAAU;CAChB,MAAM,sBAAsB,GAAG,MAAM;EACnC,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK;EAGpC,MAAM,OAAO,QAAQ,KAAK,CAAC;EAC3B,MAAM,OAAO,QAAQ,KAAK,CAAC;EAE3B,IAAI,QAAQ,MAAM;GAChB,IAAI,CAAC;GACL,IAAI,CAAC;EACP;EAEA,OAAO,MAAM,IAAI,IACZ,QAAQ,CAAC,OAAQ,KACjB,QAAQ,CAAC,OAAQ,IAClB,IAAI,IAAI,KACR;CACN;CAEA,MAAM,uBAAuB,GAAG,MAAM,mBAAmB,GAAG,CAAC;CAE7D,OAAO,UAAU;EACf;EACA;CACF;;;;;CC1BA,MAAM,QAAA,cAAA;CACN,MAAM,EAAE,YAAY,qBAAA,kBAAA;CACpB,MAAM,EAAE,QAAQ,IAAI,MAAA,WAAA;CAEpB,MAAM,eAAA,sBAAA;CACN,MAAM,EAAE,uBAAA,oBAAA;CAER,MAAM,0BAA0B,YAAY,eAAe;EACzD,MAAM,cAAc,WAAW,MAAM,GAAG;EACxC,IAAI,YAAY,SAAS,WAAW,QAClC,OAAO;EAGT,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,IAAI,mBAAmB,WAAW,IAAI,YAAY,EAAE,MAAM,GACxD,OAAO;EAIX,OAAO;CACT;CAuUA,OAAO,UAAU,MArUX,OAAO;EACX,YAAa,SAAS,SAAS;GAC7B,UAAU,aAAa,OAAO;GAE9B,IAAI,mBAAmB,QACrB,IAAI,QAAQ,UAAU,CAAC,CAAC,QAAQ,SAC9B,QAAQ,sBAAsB,CAAC,CAAC,QAAQ,mBACxC,OAAO;QAEP,UAAU,QAAQ;QAEf,IAAI,OAAO,YAAY,UAC5B,MAAM,IAAI,UAAU,gDAAgD,OAAO,QAAQ,GAAG;GAGxF,IAAI,QAAQ,SAAS,YACnB,MAAM,IAAI,UACR,0BAA0B,WAAW,YACvC;GAGF,MAAM,UAAU,SAAS,OAAO;GAChC,KAAK,UAAU;GACf,KAAK,QAAQ,CAAC,CAAC,QAAQ;GAGvB,KAAK,oBAAoB,CAAC,CAAC,QAAQ;GAEnC,MAAM,IAAI,QAAQ,KAAK,CAAC,CAAC,MAAM,QAAQ,QAAQ,GAAG,EAAE,SAAS,GAAG,EAAE,KAAK;GAEvE,IAAI,CAAC,GACH,MAAM,IAAI,UAAU,oBAAoB,SAAS;GAGnD,KAAK,MAAM;GAGX,KAAK,QAAQ,CAAC,EAAE;GAChB,KAAK,QAAQ,CAAC,EAAE;GAChB,KAAK,QAAQ,CAAC,EAAE;GAEhB,IAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAChD,MAAM,IAAI,UAAU,uBAAuB;GAG7C,IAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAChD,MAAM,IAAI,UAAU,uBAAuB;GAG7C,IAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAChD,MAAM,IAAI,UAAU,uBAAuB;GAI7C,IAAI,CAAC,EAAE,IACL,KAAK,aAAa,CAAC;QAEnB,KAAK,aAAa,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,OAAO;IAC5C,IAAI,WAAW,KAAK,EAAE,GAAG;KACvB,MAAM,MAAM,CAAC;KACb,IAAI,OAAO,KAAK,MAAM,kBACpB,OAAO;IAEX;IACA,OAAO;GACT,CAAC;GAGH,KAAK,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC;GACvC,KAAK,OAAO;EACd;EAEA,SAAU;GACR,KAAK,UAAU,GAAG,KAAK,MAAM,GAAG,KAAK,MAAM,GAAG,KAAK;GACnD,IAAI,KAAK,WAAW,QAClB,KAAK,WAAW,IAAI,KAAK,WAAW,KAAK,GAAG;GAE9C,OAAO,KAAK;EACd;EAEA,WAAY;GACV,OAAO,KAAK;EACd;EAEA,QAAS,OAAO;GACd,MAAM,kBAAkB,KAAK,SAAS,KAAK,SAAS,KAAK;GACzD,IAAI,EAAE,iBAAiB,SAAS;IAC9B,IAAI,OAAO,UAAU,YAAY,UAAU,KAAK,SAC9C,OAAO;IAET,QAAQ,IAAI,OAAO,OAAO,KAAK,OAAO;GACxC;GAEA,IAAI,MAAM,YAAY,KAAK,SACzB,OAAO;GAGT,OAAO,KAAK,YAAY,KAAK,KAAK,KAAK,WAAW,KAAK;EACzD;EAEA,YAAa,OAAO;GAClB,IAAI,EAAE,iBAAiB,SACrB,QAAQ,IAAI,OAAO,OAAO,KAAK,OAAO;GAGxC,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,OAAO;EACT;EAEA,WAAY,OAAO;GACjB,IAAI,EAAE,iBAAiB,SACrB,QAAQ,IAAI,OAAO,OAAO,KAAK,OAAO;GAIxC,IAAI,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,QAC9C,OAAO;QACF,IAAI,CAAC,KAAK,WAAW,UAAU,MAAM,WAAW,QACrD,OAAO;QACF,IAAI,CAAC,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,QACtD,OAAO;GAGT,IAAI,IAAI;GACR,GAAG;IACD,MAAM,IAAI,KAAK,WAAW;IAC1B,MAAM,IAAI,MAAM,WAAW;IAC3B,MAAM,sBAAsB,GAAG,GAAG,CAAC;IACnC,IAAI,MAAM,KAAA,KAAa,MAAM,KAAA,GAC3B,OAAO;SACF,IAAI,MAAM,KAAA,GACf,OAAO;SACF,IAAI,MAAM,KAAA,GACf,OAAO;SACF,IAAI,MAAM,GACf;SAEA,OAAO,mBAAmB,GAAG,CAAC;GAElC,SAAS,EAAE;EACb;EAEA,aAAc,OAAO;GACnB,IAAI,EAAE,iBAAiB,SACrB,QAAQ,IAAI,OAAO,OAAO,KAAK,OAAO;GAGxC,IAAI,IAAI;GACR,GAAG;IACD,MAAM,IAAI,KAAK,MAAM;IACrB,MAAM,IAAI,MAAM,MAAM;IACtB,MAAM,iBAAiB,GAAG,GAAG,CAAC;IAC9B,IAAI,MAAM,KAAA,KAAa,MAAM,KAAA,GAC3B,OAAO;SACF,IAAI,MAAM,KAAA,GACf,OAAO;SACF,IAAI,MAAM,KAAA,GACf,OAAO;SACF,IAAI,MAAM,GACf;SAEA,OAAO,mBAAmB,GAAG,CAAC;GAElC,SAAS,EAAE;EACb;EAIA,IAAK,SAAS,YAAY,gBAAgB;GACxC,IAAI,QAAQ,WAAW,KAAK,GAAG;IAC7B,IAAI,CAAC,cAAc,mBAAmB,OACpC,MAAM,IAAI,MAAM,iDAAiD;IAGnE,IAAI,YAAY;KACd,MAAM,QAAQ,IAAI,aAAa,MAAM,KAAK,QAAQ,QAAQ,GAAG,EAAE,mBAAmB,GAAG,EAAE,WAAW;KAClG,IAAI,CAAC,SAAS,MAAM,OAAO,YACzB,MAAM,IAAI,MAAM,uBAAuB,YAAY;IAEvD;GACF;GAEA,QAAQ,SAAR;IACE,KAAK;KACH,KAAK,WAAW,SAAS;KACzB,KAAK,QAAQ;KACb,KAAK,QAAQ;KACb,KAAK;KACL,KAAK,IAAI,OAAO,YAAY,cAAc;KAC1C;IACF,KAAK;KACH,KAAK,WAAW,SAAS;KACzB,KAAK,QAAQ;KACb,KAAK;KACL,KAAK,IAAI,OAAO,YAAY,cAAc;KAC1C;IACF,KAAK;KAIH,KAAK,WAAW,SAAS;KACzB,KAAK,IAAI,SAAS,YAAY,cAAc;KAC5C,KAAK,IAAI,OAAO,YAAY,cAAc;KAC1C;IAGF,KAAK;KACH,IAAI,KAAK,WAAW,WAAW,GAC7B,KAAK,IAAI,SAAS,YAAY,cAAc;KAE9C,KAAK,IAAI,OAAO,YAAY,cAAc;KAC1C;IACF,KAAK;KACH,IAAI,KAAK,WAAW,WAAW,GAC7B,MAAM,IAAI,MAAM,WAAW,KAAK,IAAI,qBAAqB;KAE3D,KAAK,WAAW,SAAS;KACzB;IAEF,KAAK;KAKH,IACE,KAAK,UAAU,KACf,KAAK,UAAU,KACf,KAAK,WAAW,WAAW,GAE3B,KAAK;KAEP,KAAK,QAAQ;KACb,KAAK,QAAQ;KACb,KAAK,aAAa,CAAC;KACnB;IACF,KAAK;KAKH,IAAI,KAAK,UAAU,KAAK,KAAK,WAAW,WAAW,GACjD,KAAK;KAEP,KAAK,QAAQ;KACb,KAAK,aAAa,CAAC;KACnB;IACF,KAAK;KAKH,IAAI,KAAK,WAAW,WAAW,GAC7B,KAAK;KAEP,KAAK,aAAa,CAAC;KACnB;IAGF,KAAK,OAAO;KACV,MAAM,OAAO,OAAO,cAAc,IAAI,IAAI;KAE1C,IAAI,KAAK,WAAW,WAAW,GAC7B,KAAK,aAAa,CAAC,IAAI;UAClB;MACL,IAAI,IAAI,KAAK,WAAW;MACxB,OAAO,EAAE,KAAK,GACZ,IAAI,OAAO,KAAK,WAAW,OAAO,UAAU;OAC1C,KAAK,WAAW,EAAE;OAClB,IAAI;MACN;MAEF,IAAI,MAAM,IAAI;OAEZ,IAAI,eAAe,KAAK,WAAW,KAAK,GAAG,KAAK,mBAAmB,OACjE,MAAM,IAAI,MAAM,uDAAuD;OAEzE,KAAK,WAAW,KAAK,IAAI;MAC3B;KACF;KACA,IAAI,YAAY;MAGd,IAAI,aAAa,CAAC,YAAY,IAAI;MAClC,IAAI,mBAAmB,OACrB,aAAa,CAAC,UAAU;MAE1B,IAAI,uBAAuB,KAAK,YAAY,UAAU,GAAG;OACvD,MAAM,iBAAiB,KAAK,WAAW,WAAW,MAAM,GAAG,CAAC,CAAC;OAC7D,IAAI,MAAM,cAAc,GACtB,KAAK,aAAa;MAEtB,OACE,KAAK,aAAa;KAEtB;KACA;IACF;IACA,SACE,MAAM,IAAI,MAAM,+BAA+B,SAAS;GAC5D;GACA,KAAK,MAAM,KAAK,OAAO;GACvB,IAAI,KAAK,MAAM,QACb,KAAK,OAAO,IAAI,KAAK,MAAM,KAAK,GAAG;GAErC,OAAO;EACT;CACF;;;;;CCzVA,MAAM,SAAA,iBAAA;CACN,MAAM,SAAS,SAAS,SAAS,cAAc,UAAU;EACvD,IAAI,mBAAmB,QACrB,OAAO;EAET,IAAI;GACF,OAAO,IAAI,OAAO,SAAS,OAAO;EACpC,SAAS,IAAI;GACX,IAAI,CAAC,aACH,OAAO;GAET,MAAM;EACR;CACF;CAEA,OAAO,UAAU;;;;;CCfjB,MAAM,QAAA,cAAA;CACN,MAAM,SAAS,SAAS,YAAY;EAClC,MAAM,IAAI,MAAM,SAAS,OAAO;EAChC,OAAO,IAAI,EAAE,UAAU;CACzB;CACA,OAAO,UAAU;;;;;CCLjB,MAAM,QAAA,cAAA;CACN,MAAM,SAAS,SAAS,YAAY;EAClC,MAAM,IAAI,MAAM,QAAQ,KAAK,CAAC,CAAC,QAAQ,UAAU,EAAE,GAAG,OAAO;EAC7D,OAAO,IAAI,EAAE,UAAU;CACzB;CACA,OAAO,UAAU;;;;;CCLjB,MAAM,SAAA,iBAAA;CAEN,MAAM,OAAO,SAAS,SAAS,SAAS,YAAY,mBAAmB;EACrE,IAAI,OAAQ,YAAa,UAAU;GACjC,iBAAiB;GACjB,aAAa;GACb,UAAU,KAAA;EACZ;EAEA,IAAI;GACF,OAAO,IAAI,OACT,mBAAmB,SAAS,QAAQ,UAAU,SAC9C,OACF,CAAC,CAAC,IAAI,SAAS,YAAY,cAAc,CAAC,CAAC;EAC7C,SAAS,IAAI;GACX,OAAO;EACT;CACF;CACA,OAAO,UAAU;;;;;CClBjB,MAAM,QAAA,cAAA;CAEN,MAAM,QAAQ,UAAU,aAAa;EACnC,MAAM,KAAK,MAAM,UAAU,MAAM,IAAI;EACrC,MAAM,KAAK,MAAM,UAAU,MAAM,IAAI;EACrC,MAAM,aAAa,GAAG,QAAQ,EAAE;EAEhC,IAAI,eAAe,GACjB,OAAO;EAGT,MAAM,WAAW,aAAa;EAC9B,MAAM,cAAc,WAAW,KAAK;EACpC,MAAM,aAAa,WAAW,KAAK;EACnC,MAAM,aAAa,CAAC,CAAC,YAAY,WAAW;EAG5C,IAAI,CAFe,CAAC,WAAW,WAAW,UAEzB,CAAC,YAAY;GAQ5B,IAAI,CAAC,WAAW,SAAS,CAAC,WAAW,OACnC,OAAO;GAIT,IAAI,WAAW,YAAY,WAAW,MAAM,GAAG;IAC7C,IAAI,WAAW,SAAS,CAAC,WAAW,OAClC,OAAO;IAET,OAAO;GACT;EACF;EAGA,MAAM,SAAS,aAAa,QAAQ;EAEpC,IAAI,GAAG,UAAU,GAAG,OAClB,OAAO,SAAS;EAGlB,IAAI,GAAG,UAAU,GAAG,OAClB,OAAO,SAAS;EAGlB,IAAI,GAAG,UAAU,GAAG,OAClB,OAAO,SAAS;EAIlB,OAAO;CACT;CAEA,OAAO,UAAU;;;;;CCzDjB,MAAM,SAAA,iBAAA;CACN,MAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC;CACjD,OAAO,UAAU;;;;;CCFjB,MAAM,SAAA,iBAAA;CACN,MAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC;CACjD,OAAO,UAAU;;;;;CCFjB,MAAM,SAAA,iBAAA;CACN,MAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC;CACjD,OAAO,UAAU;;;;;CCFjB,MAAM,QAAA,cAAA;CACN,MAAM,cAAc,SAAS,YAAY;EACvC,MAAM,SAAS,MAAM,SAAS,OAAO;EACrC,OAAQ,UAAU,OAAO,WAAW,SAAU,OAAO,aAAa;CACpE;CACA,OAAO,UAAU;;;;;CCLjB,MAAM,SAAA,iBAAA;CACN,MAAM,WAAW,GAAG,GAAG,UACrB,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC,QAAQ,IAAI,OAAO,GAAG,KAAK,CAAC;CAEnD,OAAO,UAAU;;;;;CCJjB,MAAM,UAAA,gBAAA;CACN,MAAM,YAAY,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK;CACrD,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,gBAAgB,GAAG,MAAM,QAAQ,GAAG,GAAG,IAAI;CACjD,OAAO,UAAU;;;;;CCFjB,MAAM,SAAA,iBAAA;CACN,MAAM,gBAAgB,GAAG,GAAG,UAAU;EACpC,MAAM,WAAW,IAAI,OAAO,GAAG,KAAK;EACpC,MAAM,WAAW,IAAI,OAAO,GAAG,KAAK;EACpC,OAAO,SAAS,QAAQ,QAAQ,KAAK,SAAS,aAAa,QAAQ;CACrE;CACA,OAAO,UAAU;;;;;CCNjB,MAAM,eAAA,sBAAA;CACN,MAAM,QAAQ,MAAM,UAAU,KAAK,MAAM,GAAG,MAAM,aAAa,GAAG,GAAG,KAAK,CAAC;CAC3E,OAAO,UAAU;;;;;CCFjB,MAAM,eAAA,sBAAA;CACN,MAAM,SAAS,MAAM,UAAU,KAAK,MAAM,GAAG,MAAM,aAAa,GAAG,GAAG,KAAK,CAAC;CAC5E,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,IAAI;CACnD,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,IAAI;CACnD,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,MAAM;CACrD,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,MAAM;CACtD,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,KAAK;CACrD,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,KAAK;CACrD,OAAO,UAAU;;;;;CCFjB,MAAM,KAAA,WAAA;CACN,MAAM,MAAA,YAAA;CACN,MAAM,KAAA,WAAA;CACN,MAAM,MAAA,YAAA;CACN,MAAM,KAAA,WAAA;CACN,MAAM,MAAA,YAAA;CAEN,MAAM,OAAO,GAAG,IAAI,GAAG,UAAU;EAC/B,QAAQ,IAAR;GACE,KAAK;IACH,IAAI,OAAO,MAAM,UACf,IAAI,EAAE;IAER,IAAI,OAAO,MAAM,UACf,IAAI,EAAE;IAER,OAAO,MAAM;GAEf,KAAK;IACH,IAAI,OAAO,MAAM,UACf,IAAI,EAAE;IAER,IAAI,OAAO,MAAM,UACf,IAAI,EAAE;IAER,OAAO,MAAM;GAEf,KAAK;GACL,KAAK;GACL,KAAK,MACH,OAAO,GAAG,GAAG,GAAG,KAAK;GAEvB,KAAK,MACH,OAAO,IAAI,GAAG,GAAG,KAAK;GAExB,KAAK,KACH,OAAO,GAAG,GAAG,GAAG,KAAK;GAEvB,KAAK,MACH,OAAO,IAAI,GAAG,GAAG,KAAK;GAExB,KAAK,KACH,OAAO,GAAG,GAAG,GAAG,KAAK;GAEvB,KAAK,MACH,OAAO,IAAI,GAAG,GAAG,KAAK;GAExB,SACE,MAAM,IAAI,UAAU,qBAAqB,IAAI;EACjD;CACF;CACA,OAAO,UAAU;;;;;CCnDjB,MAAM,SAAA,iBAAA;CACN,MAAM,QAAA,cAAA;CACN,MAAM,EAAE,QAAQ,IAAI,MAAA,WAAA;CAEpB,MAAM,UAAU,SAAS,YAAY;EACnC,IAAI,mBAAmB,QACrB,OAAO;EAGT,IAAI,OAAO,YAAY,UACrB,UAAU,OAAO,OAAO;EAG1B,IAAI,OAAO,YAAY,UACrB,OAAO;EAGT,UAAU,WAAW,CAAC;EAEtB,IAAI,QAAQ;EACZ,IAAI,CAAC,QAAQ,KACX,QAAQ,QAAQ,MAAM,QAAQ,oBAAoB,GAAG,EAAE,cAAc,GAAG,EAAE,OAAO;OAC5E;GAUL,MAAM,iBAAiB,QAAQ,oBAAoB,GAAG,EAAE,iBAAiB,GAAG,EAAE;GAC9E,IAAI;GACJ,QAAQ,OAAO,eAAe,KAAK,OAAO,OACrC,CAAC,SAAS,MAAM,QAAQ,MAAM,EAAE,CAAC,WAAW,QAAQ,SACvD;IACA,IAAI,CAAC,SACC,KAAK,QAAQ,KAAK,EAAE,CAAC,WAAW,MAAM,QAAQ,MAAM,EAAE,CAAC,QAC3D,QAAQ;IAEV,eAAe,YAAY,KAAK,QAAQ,KAAK,EAAE,CAAC,SAAS,KAAK,EAAE,CAAC;GACnE;GAEA,eAAe,YAAY;EAC7B;EAEA,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,MAAM;EAMpB,OAAO,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,OAAO;CACzE;CACA,OAAO,UAAU;;;;;CC3DjB,MAAM,QAAA,cAAA;CACN,MAAM,YAAA,kBAAA;CACN,MAAM,SAAA,iBAAA;CAEN,MAAM,YAAY,SAAS,YAAY,YAAY;EACjD,IAAI,CAAC,UAAU,cAAc,SAAS,UAAU,GAC9C,OAAO;EAGT,MAAM,gBAAgB,kBAAkB,SAAS,OAAO;EACxD,OAAO,iBAAiB,aAAa,eAAe,UAAU;CAChE;CAEA,MAAM,qBAAqB,SAAS,YAAY;EAK9C,OAAO,MAHL,mBAAmB,SAAS,QAAQ,UAAU,SAGb,OAAO;CAC5C;CAEA,MAAM,gBAAgB,SAAS,eAAe;EAC5C,IAAI,aAAa,UAAU,GACzB,OAAO,QAAQ;EAGjB,QAAQ,aAAa,CAAC;EAEtB,QAAQ,YAAR;GACE,KAAK;IACH,QAAQ,QAAQ;IAChB,QAAQ,QAAQ;IAChB;GACF,KAAK;IACH,QAAQ,QAAQ;IAChB;EACJ;EAEA,OAAO,QAAQ,OAAO;CACxB;CAEA,MAAM,gBAAgB,SAAS;EAC7B,OAAO,KAAK,WAAW,KAAK;CAC9B;CAEA,OAAO,UAAU;;;;;CC7CjB,IAAM,WAAN,MAAe;EACb,cAAe;GACb,KAAK,MAAM;GACX,KAAK,sBAAM,IAAI,IAAI;EACrB;EAEA,IAAK,KAAK;GACR,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;GAC9B,IAAI,UAAU,KAAA,GACZ;QACK;IAEL,KAAK,IAAI,OAAO,GAAG;IACnB,KAAK,IAAI,IAAI,KAAK,KAAK;IACvB,OAAO;GACT;EACF;EAEA,OAAQ,KAAK;GACX,OAAO,KAAK,IAAI,OAAO,GAAG;EAC5B;EAEA,IAAK,KAAK,OAAO;GAGf,IAAI,CAFY,KAAK,OAAO,GAEjB,KAAK,UAAU,KAAA,GAAW;IAEnC,IAAI,KAAK,IAAI,QAAQ,KAAK,KAAK;KAC7B,MAAM,WAAW,KAAK,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;KACxC,KAAK,OAAO,QAAQ;IACtB;IAEA,KAAK,IAAI,IAAI,KAAK,KAAK;GACzB;GAEA,OAAO;EACT;CACF;CAEA,OAAO,UAAU;;;;;CCvCjB,MAAM,mBAAmB;CAuNzB,OAAO,UAAU,MApNX,MAAM;EACV,YAAa,OAAO,SAAS;GAC3B,UAAU,aAAa,OAAO;GAE9B,IAAI,iBAAiB,OACnB,IACE,MAAM,UAAU,CAAC,CAAC,QAAQ,SAC1B,MAAM,sBAAsB,CAAC,CAAC,QAAQ,mBAEtC,OAAO;QAEP,OAAO,IAAI,MAAM,MAAM,KAAK,OAAO;GAIvC,IAAI,iBAAiB,YAAY;IAE/B,KAAK,MAAM,MAAM;IACjB,KAAK,MAAM,CAAC,CAAC,KAAK,CAAC;IACnB,KAAK,YAAY,KAAA;IACjB,OAAO;GACT;GAEA,KAAK,UAAU;GACf,KAAK,QAAQ,CAAC,CAAC,QAAQ;GACvB,KAAK,oBAAoB,CAAC,CAAC,QAAQ;GAKnC,KAAK,MAAM,MAAM,KAAK,CAAC,CAAC,QAAQ,kBAAkB,GAAG;GAGrD,KAAK,MAAM,KAAK,IACb,MAAM,IAAI,CAAC,CAEX,KAAI,MAAK,KAAK,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAInC,QAAO,MAAK,EAAE,MAAM;GAEvB,IAAI,CAAC,KAAK,IAAI,QACZ,MAAM,IAAI,UAAU,yBAAyB,KAAK,KAAK;GAIzD,IAAI,KAAK,IAAI,SAAS,GAAG;IAEvB,MAAM,QAAQ,KAAK,IAAI;IACvB,KAAK,MAAM,KAAK,IAAI,QAAO,MAAK,CAAC,UAAU,EAAE,EAAE,CAAC;IAChD,IAAI,KAAK,IAAI,WAAW,GACtB,KAAK,MAAM,CAAC,KAAK;SACZ,IAAI,KAAK,IAAI,SAAS;UAEtB,MAAM,KAAK,KAAK,KACnB,IAAI,EAAE,WAAW,KAAK,MAAM,EAAE,EAAE,GAAG;MACjC,KAAK,MAAM,CAAC,CAAC;MACb;KACF;;GAGN;GAEA,KAAK,YAAY,KAAA;EACnB;EAEA,IAAI,QAAS;GACX,IAAI,KAAK,cAAc,KAAA,GAAW;IAChC,KAAK,YAAY;IACjB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;KACxC,IAAI,IAAI,GACN,KAAK,aAAa;KAEpB,MAAM,QAAQ,KAAK,IAAI;KACvB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;MACrC,IAAI,IAAI,GACN,KAAK,aAAa;MAEpB,KAAK,aAAa,MAAM,EAAE,CAAC,SAAS,CAAC,CAAC,KAAK;KAC7C;IACF;GACF;GACA,OAAO,KAAK;EACd;EAEA,SAAU;GACR,OAAO,KAAK;EACd;EAEA,WAAY;GACV,OAAO,KAAK;EACd;EAEA,WAAY,OAAO;GAEjB,QAAQ,MAAM,QAAQ,cAAc,EAAE;GAOtC,MAAM,YAFH,KAAK,QAAQ,qBAAqB,4BAClC,KAAK,QAAQ,SAAS,eACE,MAAM;GACjC,MAAM,SAAS,MAAM,IAAI,OAAO;GAChC,IAAI,QACF,OAAO;GAGT,MAAM,QAAQ,KAAK,QAAQ;GAE3B,MAAM,KAAK,QAAQ,GAAG,EAAE,oBAAoB,GAAG,EAAE;GACjD,QAAQ,MAAM,QAAQ,IAAI,cAAc,KAAK,QAAQ,iBAAiB,CAAC;GACvE,MAAM,kBAAkB,KAAK;GAG7B,QAAQ,MAAM,QAAQ,GAAG,EAAE,iBAAiB,qBAAqB;GACjE,MAAM,mBAAmB,KAAK;GAG9B,QAAQ,MAAM,QAAQ,GAAG,EAAE,YAAY,gBAAgB;GACvD,MAAM,cAAc,KAAK;GAGzB,QAAQ,MAAM,QAAQ,GAAG,EAAE,YAAY,gBAAgB;GACvD,MAAM,cAAc,KAAK;GAKzB,IAAI,YAAY,MACb,MAAM,GAAG,CAAC,CACV,KAAI,SAAQ,gBAAgB,MAAM,KAAK,OAAO,CAAC,CAAC,CAChD,KAAK,GAAG,CAAC,CACT,MAAM,KAAK,CAAC,CAEZ,KAAI,SAAQ,YAAY,MAAM,KAAK,OAAO,CAAC;GAE9C,IAAI,OAEF,YAAY,UAAU,QAAO,SAAQ;IACnC,MAAM,wBAAwB,MAAM,KAAK,OAAO;IAChD,OAAO,CAAC,CAAC,KAAK,MAAM,GAAG,EAAE,gBAAgB;GAC3C,CAAC;GAEH,MAAM,cAAc,SAAS;GAK7B,MAAM,2BAAW,IAAI,IAAI;GACzB,MAAM,cAAc,UAAU,KAAI,SAAQ,IAAI,WAAW,MAAM,KAAK,OAAO,CAAC;GAC5E,KAAK,MAAM,QAAQ,aAAa;IAC9B,IAAI,UAAU,IAAI,GAChB,OAAO,CAAC,IAAI;IAEd,SAAS,IAAI,KAAK,OAAO,IAAI;GAC/B;GACA,IAAI,SAAS,OAAO,KAAK,SAAS,IAAI,EAAE,GACtC,SAAS,OAAO,EAAE;GAGpB,MAAM,SAAS,CAAC,GAAG,SAAS,OAAO,CAAC;GACpC,MAAM,IAAI,SAAS,MAAM;GACzB,OAAO;EACT;EAEA,WAAY,OAAO,SAAS;GAC1B,IAAI,EAAE,iBAAiB,QACrB,MAAM,IAAI,UAAU,qBAAqB;GAG3C,OAAO,KAAK,IAAI,MAAM,oBAAoB;IACxC,OACE,cAAc,iBAAiB,OAAO,KACtC,MAAM,IAAI,MAAM,qBAAqB;KACnC,OACE,cAAc,kBAAkB,OAAO,KACvC,gBAAgB,OAAO,mBAAmB;MACxC,OAAO,iBAAiB,OAAO,oBAAoB;OACjD,OAAO,eAAe,WAAW,iBAAiB,OAAO;MAC3D,CAAC;KACH,CAAC;IAEL,CAAC;GAEL,CAAC;EACH;EAGA,KAAM,SAAS;GACb,IAAI,CAAC,SACH,OAAO;GAGT,IAAI,OAAO,YAAY,UACrB,IAAI;IACF,UAAU,IAAI,OAAO,SAAS,KAAK,OAAO;GAC5C,SAAS,IAAI;IACX,OAAO;GACT;GAGF,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KACnC,IAAI,QAAQ,KAAK,IAAI,IAAI,SAAS,KAAK,OAAO,GAC5C,OAAO;GAGX,OAAO;EACT;CACF;CAKA,MAAM,QAAQ,KAAA,iBAAA,GAAQ;CAEtB,MAAM,eAAA,sBAAA;CACN,MAAM,aAAA,mBAAA;CACN,MAAM,QAAA,cAAA;CACN,MAAM,SAAA,iBAAA;CACN,MAAM,EACJ,QAAQ,IACR,KACA,GACA,uBACA,kBACA,qBAAA,WAAA;CAEF,MAAM,EAAE,yBAAyB,eAAA,kBAAA;CAGjC,MAAM,eAAe,IAAI,OAAO,IAAI,EAAE,QAAQ,GAAG;CAEjD,MAAM,aAAY,MAAK,EAAE,UAAU;CACnC,MAAM,SAAQ,MAAK,EAAE,UAAU;CAI/B,MAAM,iBAAiB,aAAa,YAAY;EAC9C,IAAI,SAAS;EACb,MAAM,uBAAuB,YAAY,MAAM;EAC/C,IAAI,iBAAiB,qBAAqB,IAAI;EAE9C,OAAO,UAAU,qBAAqB,QAAQ;GAC5C,SAAS,qBAAqB,OAAO,oBAAoB;IACvD,OAAO,eAAe,WAAW,iBAAiB,OAAO;GAC3D,CAAC;GAED,iBAAiB,qBAAqB,IAAI;EAC5C;EAEA,OAAO;CACT;CAKA,MAAM,mBAAmB,MAAM,YAAY;EACzC,OAAO,KAAK,QAAQ,GAAG,EAAE,QAAQ,EAAE;EACnC,MAAM,QAAQ,MAAM,OAAO;EAC3B,OAAO,cAAc,MAAM,OAAO;EAClC,MAAM,SAAS,IAAI;EACnB,OAAO,cAAc,MAAM,OAAO;EAClC,MAAM,UAAU,IAAI;EACpB,OAAO,eAAe,MAAM,OAAO;EACnC,MAAM,UAAU,IAAI;EACpB,OAAO,aAAa,MAAM,OAAO;EACjC,MAAM,SAAS,IAAI;EACnB,OAAO;CACT;CAEA,MAAM,OAAM,OAAM,CAAC,MAAM,GAAG,YAAY,MAAM,OAAO,OAAO;CAS5D,MAAM,iBAAiB,MAAM,YAAY;EACvC,OAAO,KACJ,KAAK,CAAC,CACN,MAAM,KAAK,CAAC,CACZ,KAAK,MAAM,aAAa,GAAG,OAAO,CAAC,CAAC,CACpC,KAAK,GAAG;CACb;CAEA,MAAM,gBAAgB,MAAM,YAAY;EACtC,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,cAAc,GAAG,EAAE;EAClD,OAAO,KAAK,QAAQ,IAAI,GAAG,GAAG,GAAG,GAAG,OAAO;GACzC,MAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,EAAE;GACnC,IAAI;GAEJ,IAAI,IAAI,CAAC,GACP,MAAM;QACD,IAAI,IAAI,CAAC,GACd,MAAM,KAAK,EAAE,QAAQ,CAAC,IAAI,EAAE;QACvB,IAAI,IAAI,CAAC,GAEd,MAAM,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE;QAC/B,IAAI,IAAI;IACb,MAAM,mBAAmB,EAAE;IAC3B,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;GACnB,OAEE,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;GAGnB,MAAM,gBAAgB,GAAG;GACzB,OAAO;EACT,CAAC;CACH;CAUA,MAAM,iBAAiB,MAAM,YAAY;EACvC,OAAO,KACJ,KAAK,CAAC,CACN,MAAM,KAAK,CAAC,CACZ,KAAK,MAAM,aAAa,GAAG,OAAO,CAAC,CAAC,CACpC,KAAK,GAAG;CACb;CAEA,MAAM,gBAAgB,MAAM,YAAY;EACtC,MAAM,SAAS,MAAM,OAAO;EAC5B,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,cAAc,GAAG,EAAE;EAClD,MAAM,IAAI,QAAQ,oBAAoB,OAAO;EAC7C,OAAO,KAAK,QAAQ,IAAI,GAAG,GAAG,GAAG,GAAG,OAAO;GACzC,MAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,EAAE;GACnC,IAAI;GAEJ,IAAI,IAAI,CAAC,GACP,MAAM;QACD,IAAI,IAAI,CAAC,GACd,MAAM,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE;QAC3B,IAAI,IAAI,CAAC,GACd,IAAI,MAAM,KACR,MAAM,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;QAExC,MAAM,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE;QAEhC,IAAI,IAAI;IACb,MAAM,mBAAmB,EAAE;IAC3B,IAAI,MAAM,KACR,IAAI,MAAM,KACR,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE;SAEtB,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;SAGnB,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,CAAC,IAAI,EAAE;GAEhB,OAAO;IACL,MAAM,OAAO;IACb,IAAI,MAAM,KACR,IAAI,MAAM,KACR,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,IAClB,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE;SAE1B,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,IAClB,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;SAGvB,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,CAAC,IAAI,EAAE;GAEhB;GAEA,MAAM,gBAAgB,GAAG;GACzB,OAAO;EACT,CAAC;CACH;CAEA,MAAM,kBAAkB,MAAM,YAAY;EACxC,MAAM,kBAAkB,MAAM,OAAO;EACrC,OAAO,KACJ,MAAM,KAAK,CAAC,CACZ,KAAK,MAAM,cAAc,GAAG,OAAO,CAAC,CAAC,CACrC,KAAK,GAAG;CACb;CAEA,MAAM,iBAAiB,MAAM,YAAY;EACvC,OAAO,KAAK,KAAK;EACjB,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,eAAe,GAAG,EAAE;EACnD,OAAO,KAAK,QAAQ,IAAI,KAAK,MAAM,GAAG,GAAG,GAAG,OAAO;GACjD,MAAM,UAAU,MAAM,KAAK,MAAM,GAAG,GAAG,GAAG,EAAE;GAC5C,MAAM,KAAK,IAAI,CAAC;GAChB,MAAM,KAAK,MAAM,IAAI,CAAC;GACtB,MAAM,KAAK,MAAM,IAAI,CAAC;GACtB,MAAM,OAAO;GAEb,IAAI,SAAS,OAAO,MAClB,OAAO;GAKT,KAAK,QAAQ,oBAAoB,OAAO;GAExC,IAAI,IACF,IAAI,SAAS,OAAO,SAAS,KAE3B,MAAM;QAGN,MAAM;QAEH,IAAI,QAAQ,MAAM;IAGvB,IAAI,IACF,IAAI;IAEN,IAAI;IAEJ,IAAI,SAAS,KAAK;KAGhB,OAAO;KACP,IAAI,IAAI;MACN,IAAI,CAAC,IAAI;MACT,IAAI;MACJ,IAAI;KACN,OAAO;MACL,IAAI,CAAC,IAAI;MACT,IAAI;KACN;IACF,OAAO,IAAI,SAAS,MAAM;KAGxB,OAAO;KACP,IAAI,IACF,IAAI,CAAC,IAAI;UAET,IAAI,CAAC,IAAI;IAEb;IAEA,IAAI,SAAS,KACX,KAAK;IAGP,MAAM,GAAG,OAAO,EAAE,GAAG,EAAE,GAAG,IAAI;GAChC,OAAO,IAAI,IACT,MAAM,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE;QAC5B,IAAI,IACT,MAAM,KAAK,EAAE,GAAG,EAAE,IAAI,GACrB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;GAGnB,MAAM,iBAAiB,GAAG;GAE1B,OAAO;EACT,CAAC;CACH;CAIA,MAAM,gBAAgB,MAAM,YAAY;EACtC,MAAM,gBAAgB,MAAM,OAAO;EAEnC,OAAO,KACJ,KAAK,CAAC,CACN,QAAQ,GAAG,EAAE,OAAO,EAAE;CAC3B;CAEA,MAAM,eAAe,MAAM,YAAY;EACrC,MAAM,eAAe,MAAM,OAAO;EAClC,OAAO,KACJ,KAAK,CAAC,CACN,QAAQ,GAAG,QAAQ,oBAAoB,EAAE,UAAU,EAAE,OAAO,EAAE;CACnE;CAQA,MAAM,iBAAgB,WAAU,IAC9B,MAAM,IAAI,IAAI,IAAI,KAAK,IACvB,IAAI,IAAI,IAAI,IAAI,QAAQ;EACxB,IAAI,IAAI,EAAE,GACR,OAAO;OACF,IAAI,IAAI,EAAE,GACf,OAAO,KAAK,GAAG,MAAM,QAAQ,OAAO;OAC/B,IAAI,IAAI,EAAE,GACf,OAAO,KAAK,GAAG,GAAG,GAAG,IAAI,QAAQ,OAAO;OACnC,IAAI,KACT,OAAO,KAAK;OAEZ,OAAO,KAAK,OAAO,QAAQ,OAAO;EAGpC,IAAI,IAAI,EAAE,GACR,KAAK;OACA,IAAI,IAAI,EAAE,GACf,KAAK,IAAI,CAAC,KAAK,EAAE;OACZ,IAAI,IAAI,EAAE,GACf,KAAK,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE;OAClB,IAAI,KACT,KAAK,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;OACvB,IAAI,OACT,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE;OAE7B,KAAK,KAAK;EAGZ,OAAO,GAAG,KAAK,GAAG,KAAK,KAAK;CAC9B;CAEA,MAAM,WAAW,KAAK,SAAS,YAAY;EACzC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAC9B,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GACtB,OAAO;EAIX,IAAI,QAAQ,WAAW,UAAU,CAAC,QAAQ,mBAAmB;GAM3D,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;IACnC,MAAM,IAAI,EAAE,CAAC,MAAM;IACnB,IAAI,IAAI,EAAE,CAAC,WAAW,WAAW,KAC/B;IAGF,IAAI,IAAI,EAAE,CAAC,OAAO,WAAW,SAAS,GAAG;KACvC,MAAM,UAAU,IAAI,EAAE,CAAC;KACvB,IAAI,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,OAC5B,OAAO;IAEX;GACF;GAGA,OAAO;EACT;EAEA,OAAO;CACT;;;;;CCjjBA,MAAM,MAAM,OAAO,YAAY;CAqI/B,OAAO,UAAU,MAnIX,WAAW;EACf,WAAW,MAAO;GAChB,OAAO;EACT;EAEA,YAAa,MAAM,SAAS;GAC1B,UAAU,aAAa,OAAO;GAE9B,IAAI,gBAAgB,YAClB,IAAI,KAAK,UAAU,CAAC,CAAC,QAAQ,OAC3B,OAAO;QAEP,OAAO,KAAK;GAIhB,OAAO,KAAK,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,KAAK,GAAG;GACxC,MAAM,cAAc,MAAM,OAAO;GACjC,KAAK,UAAU;GACf,KAAK,QAAQ,CAAC,CAAC,QAAQ;GACvB,KAAK,MAAM,IAAI;GAEf,IAAI,KAAK,WAAW,KAClB,KAAK,QAAQ;QAEb,KAAK,QAAQ,KAAK,WAAW,KAAK,OAAO;GAG3C,MAAM,QAAQ,IAAI;EACpB;EAEA,MAAO,MAAM;GACX,MAAM,IAAI,KAAK,QAAQ,QAAQ,GAAG,EAAE,mBAAmB,GAAG,EAAE;GAC5D,MAAM,IAAI,KAAK,MAAM,CAAC;GAEtB,IAAI,CAAC,GACH,MAAM,IAAI,UAAU,uBAAuB,MAAM;GAGnD,KAAK,WAAW,EAAE,OAAO,KAAA,IAAY,EAAE,KAAK;GAC5C,IAAI,KAAK,aAAa,KACpB,KAAK,WAAW;GAIlB,IAAI,CAAC,EAAE,IACL,KAAK,SAAS;QAEd,KAAK,SAAS,IAAI,OAAO,EAAE,IAAI,KAAK,QAAQ,KAAK;EAErD;EAEA,WAAY;GACV,OAAO,KAAK;EACd;EAEA,KAAM,SAAS;GACb,MAAM,mBAAmB,SAAS,KAAK,QAAQ,KAAK;GAEpD,IAAI,KAAK,WAAW,OAAO,YAAY,KACrC,OAAO;GAGT,IAAI,OAAO,YAAY,UACrB,IAAI;IACF,UAAU,IAAI,OAAO,SAAS,KAAK,OAAO;GAC5C,SAAS,IAAI;IACX,OAAO;GACT;GAGF,OAAO,IAAI,SAAS,KAAK,UAAU,KAAK,QAAQ,KAAK,OAAO;EAC9D;EAEA,WAAY,MAAM,SAAS;GACzB,IAAI,EAAE,gBAAgB,aACpB,MAAM,IAAI,UAAU,0BAA0B;GAGhD,IAAI,KAAK,aAAa,IAAI;IACxB,IAAI,KAAK,UAAU,IACjB,OAAO;IAET,OAAO,IAAI,MAAM,KAAK,OAAO,OAAO,CAAC,CAAC,KAAK,KAAK,KAAK;GACvD,OAAO,IAAI,KAAK,aAAa,IAAI;IAC/B,IAAI,KAAK,UAAU,IACjB,OAAO;IAET,OAAO,IAAI,MAAM,KAAK,OAAO,OAAO,CAAC,CAAC,KAAK,KAAK,MAAM;GACxD;GAEA,UAAU,aAAa,OAAO;GAG9B,IAAI,QAAQ,sBACT,KAAK,UAAU,cAAc,KAAK,UAAU,aAC7C,OAAO;GAET,IAAI,CAAC,QAAQ,sBACV,KAAK,MAAM,WAAW,QAAQ,KAAK,KAAK,MAAM,WAAW,QAAQ,IAClE,OAAO;GAIT,IAAI,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAC/D,OAAO;GAGT,IAAI,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAC/D,OAAO;GAGT,IACG,KAAK,OAAO,YAAY,KAAK,OAAO,WACrC,KAAK,SAAS,SAAS,GAAG,KAAK,KAAK,SAAS,SAAS,GAAG,GACzD,OAAO;GAGT,IAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,OAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAC7D,OAAO;GAGT,IAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,OAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAC7D,OAAO;GAET,OAAO;EACT;CACF;CAIA,MAAM,eAAA,sBAAA;CACN,MAAM,EAAE,QAAQ,IAAI,MAAA,WAAA;CACpB,MAAM,MAAA,YAAA;CACN,MAAM,QAAA,cAAA;CACN,MAAM,SAAA,iBAAA;CACN,MAAM,QAAA,cAAA;;;;;CC5IN,MAAM,QAAA,cAAA;CACN,MAAM,aAAa,SAAS,OAAO,YAAY;EAC7C,IAAI;GACF,QAAQ,IAAI,MAAM,OAAO,OAAO;EAClC,SAAS,IAAI;GACX,OAAO;EACT;EACA,OAAO,MAAM,KAAK,OAAO;CAC3B;CACA,OAAO,UAAU;;;;;CCTjB,MAAM,QAAA,cAAA;CAGN,MAAM,iBAAiB,OAAO,YAC5B,IAAI,MAAM,OAAO,OAAO,CAAC,CAAC,IACvB,KAAI,SAAQ,KAAK,KAAI,MAAK,EAAE,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC;CAEnE,OAAO,UAAU;;;;;CCPjB,MAAM,SAAA,iBAAA;CACN,MAAM,QAAA,cAAA;CAEN,MAAM,iBAAiB,UAAU,OAAO,YAAY;EAClD,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,IAAI,WAAW;EACf,IAAI;GACF,WAAW,IAAI,MAAM,OAAO,OAAO;EACrC,SAAS,IAAI;GACX,OAAO;EACT;EACA,SAAS,SAAS,MAAM;GACtB,IAAI,SAAS,KAAK,CAAC;QAEb,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,IAAI;KAEnC,MAAM;KACN,QAAQ,IAAI,OAAO,KAAK,OAAO;IACjC;;EAEJ,CAAC;EACD,OAAO;CACT;CACA,OAAO,UAAU;;;;;CCxBjB,MAAM,SAAA,iBAAA;CACN,MAAM,QAAA,cAAA;CACN,MAAM,iBAAiB,UAAU,OAAO,YAAY;EAClD,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,IAAI,WAAW;EACf,IAAI;GACF,WAAW,IAAI,MAAM,OAAO,OAAO;EACrC,SAAS,IAAI;GACX,OAAO;EACT;EACA,SAAS,SAAS,MAAM;GACtB,IAAI,SAAS,KAAK,CAAC;QAEb,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,GAAG;KAElC,MAAM;KACN,QAAQ,IAAI,OAAO,KAAK,OAAO;IACjC;;EAEJ,CAAC;EACD,OAAO;CACT;CACA,OAAO,UAAU;;;;;CCvBjB,MAAM,SAAA,iBAAA;CACN,MAAM,QAAA,cAAA;CACN,MAAM,KAAA,WAAA;CAEN,MAAM,cAAc,OAAO,UAAU;EACnC,QAAQ,IAAI,MAAM,OAAO,KAAK;EAE9B,IAAI,SAAS,IAAI,OAAO,OAAO;EAC/B,IAAI,MAAM,KAAK,MAAM,GACnB,OAAO;EAGT,SAAS,IAAI,OAAO,SAAS;EAC7B,IAAI,MAAM,KAAK,MAAM,GACnB,OAAO;EAGT,SAAS;EACT,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;GACzC,MAAM,cAAc,MAAM,IAAI;GAE9B,IAAI,SAAS;GACb,YAAY,SAAS,eAAe;IAElC,MAAM,UAAU,IAAI,OAAO,WAAW,OAAO,OAAO;IACpD,QAAQ,WAAW,UAAnB;KACE,KAAK;MACH,IAAI,QAAQ,WAAW,WAAW,GAChC,QAAQ;WAER,QAAQ,WAAW,KAAK,CAAC;MAE3B,QAAQ,MAAM,QAAQ,OAAO;KAE/B,KAAK;KACL,KAAK;MACH,IAAI,CAAC,UAAU,GAAG,SAAS,MAAM,GAC/B,SAAS;MAEX;KACF,KAAK;KACL,KAAK,MAEH;;KAEF,SACE,MAAM,IAAI,MAAM,yBAAyB,WAAW,UAAU;IAClE;GACF,CAAC;GACD,IAAI,WAAW,CAAC,UAAU,GAAG,QAAQ,MAAM,IACzC,SAAS;EAEb;EAEA,IAAI,UAAU,MAAM,KAAK,MAAM,GAC7B,OAAO;EAGT,OAAO;CACT;CACA,OAAO,UAAU;;;;;CC5DjB,MAAM,QAAA,cAAA;CACN,MAAM,cAAc,OAAO,YAAY;EACrC,IAAI;GAGF,OAAO,IAAI,MAAM,OAAO,OAAO,CAAC,CAAC,SAAS;EAC5C,SAAS,IAAI;GACX,OAAO;EACT;CACF;CACA,OAAO,UAAU;;;;;CCVjB,MAAM,SAAA,iBAAA;CACN,MAAM,aAAA,mBAAA;CACN,MAAM,EAAE,QAAQ;CAChB,MAAM,QAAA,cAAA;CACN,MAAM,YAAA,kBAAA;CACN,MAAM,KAAA,WAAA;CACN,MAAM,KAAA,WAAA;CACN,MAAM,MAAA,YAAA;CACN,MAAM,MAAA,YAAA;CAEN,MAAM,WAAW,SAAS,OAAO,MAAM,YAAY;EACjD,UAAU,IAAI,OAAO,SAAS,OAAO;EACrC,QAAQ,IAAI,MAAM,OAAO,OAAO;EAEhC,IAAI,MAAM,OAAO,MAAM,MAAM;EAC7B,QAAQ,MAAR;GACE,KAAK;IACH,OAAO;IACP,QAAQ;IACR,OAAO;IACP,OAAO;IACP,QAAQ;IACR;GACF,KAAK;IACH,OAAO;IACP,QAAQ;IACR,OAAO;IACP,OAAO;IACP,QAAQ;IACR;GACF,SACE,MAAM,IAAI,UAAU,2CAAuC;EAC/D;EAGA,IAAI,UAAU,SAAS,OAAO,OAAO,GACnC,OAAO;EAMT,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;GACzC,MAAM,cAAc,MAAM,IAAI;GAE9B,IAAI,OAAO;GACX,IAAI,MAAM;GAEV,YAAY,SAAS,eAAe;IAClC,IAAI,WAAW,WAAW,KACxB,aAAa,IAAI,WAAW,SAAS;IAEvC,OAAO,QAAQ;IACf,MAAM,OAAO;IACb,IAAI,KAAK,WAAW,QAAQ,KAAK,QAAQ,OAAO,GAC9C,OAAO;SACF,IAAI,KAAK,WAAW,QAAQ,IAAI,QAAQ,OAAO,GACpD,MAAM;GAEV,CAAC;GAID,IAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,OAC9C,OAAO;GAKT,KAAK,CAAC,IAAI,YAAY,IAAI,aAAa,SACnC,MAAM,SAAS,IAAI,MAAM,GAC3B,OAAO;QACF,IAAI,IAAI,aAAa,SAAS,KAAK,SAAS,IAAI,MAAM,GAC3D,OAAO;EAEX;EACA,OAAO;CACT;CAEA,OAAO,UAAU;;;;;CC9EjB,MAAM,UAAA,gBAAA;CACN,MAAM,OAAO,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,OAAO;CAC7E,OAAO,UAAU;;;;;CCHjB,MAAM,UAAA,gBAAA;CAEN,MAAM,OAAO,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,OAAO;CAC7E,OAAO,UAAU;;;;;CCHjB,MAAM,QAAA,cAAA;CACN,MAAM,cAAc,IAAI,IAAI,YAAY;EACtC,KAAK,IAAI,MAAM,IAAI,OAAO;EAC1B,KAAK,IAAI,MAAM,IAAI,OAAO;EAC1B,OAAO,GAAG,WAAW,IAAI,OAAO;CAClC;CACA,OAAO,UAAU;;;;;CCHjB,MAAM,YAAA,kBAAA;CACN,MAAM,UAAA,gBAAA;CACN,OAAO,WAAW,UAAU,OAAO,YAAY;EAC7C,MAAM,MAAM,CAAC;EACb,IAAI,QAAQ;EACZ,IAAI,OAAO;EACX,MAAM,IAAI,SAAS,MAAM,GAAG,MAAM,QAAQ,GAAG,GAAG,OAAO,CAAC;EACxD,KAAK,MAAM,WAAW,GAEpB,IADiB,UAAU,SAAS,OAAO,OAChC,GAAG;GACZ,OAAO;GACP,IAAI,CAAC,OACH,QAAQ;EAEZ,OAAO;GACL,IAAI,MACF,IAAI,KAAK,CAAC,OAAO,IAAI,CAAC;GAExB,OAAO;GACP,QAAQ;EACV;EAEF,IAAI,OACF,IAAI,KAAK,CAAC,OAAO,IAAI,CAAC;EAGxB,MAAM,SAAS,CAAC;EAChB,KAAK,MAAM,CAAC,KAAK,QAAQ,KACvB,IAAI,QAAQ,KACV,OAAO,KAAK,GAAG;OACV,IAAI,CAAC,OAAO,QAAQ,EAAE,IAC3B,OAAO,KAAK,GAAG;OACV,IAAI,CAAC,KACV,OAAO,KAAK,KAAK,KAAK;OACjB,IAAI,QAAQ,EAAE,IACnB,OAAO,KAAK,KAAK,KAAK;OAEtB,OAAO,KAAK,GAAG,IAAI,KAAK,KAAK;EAGjC,MAAM,aAAa,OAAO,KAAK,MAAM;EACrC,MAAM,WAAW,OAAO,MAAM,QAAQ,WAAW,MAAM,MAAM,OAAO,KAAK;EACzE,OAAO,WAAW,SAAS,SAAS,SAAS,aAAa;CAC5D;;;;;CC9CA,MAAM,QAAA,cAAA;CACN,MAAM,aAAA,mBAAA;CACN,MAAM,EAAE,QAAQ;CAChB,MAAM,YAAA,kBAAA;CACN,MAAM,UAAA,gBAAA;CAsCN,MAAM,UAAU,KAAK,KAAK,UAAU,CAAC,MAAM;EACzC,IAAI,QAAQ,KACV,OAAO;EAGT,MAAM,IAAI,MAAM,KAAK,OAAO;EAC5B,MAAM,IAAI,MAAM,KAAK,OAAO;EAC5B,IAAI,aAAa;EAEjB,OAAO,KAAK,MAAM,aAAa,IAAI,KAAK;GACtC,KAAK,MAAM,aAAa,IAAI,KAAK;IAC/B,MAAM,QAAQ,aAAa,WAAW,WAAW,OAAO;IACxD,aAAa,cAAc,UAAU;IACrC,IAAI,OACF,SAAS;GAEb;GAKA,IAAI,YACF,OAAO;EAEX;EACA,OAAO;CACT;CAEA,MAAM,+BAA+B,CAAC,IAAI,WAAW,WAAW,CAAC;CACjE,MAAM,iBAAiB,CAAC,IAAI,WAAW,SAAS,CAAC;CAEjD,MAAM,gBAAgB,KAAK,KAAK,YAAY;EAC1C,IAAI,QAAQ,KACV,OAAO;EAGT,IAAI,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC,WAAW,KACxC,IAAI,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC,WAAW,KACxC,OAAO;OACF,IAAI,QAAQ,mBACjB,MAAM;OAEN,MAAM;EAIV,IAAI,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC,WAAW,KACxC,IAAI,QAAQ,mBACV,OAAO;OAEP,MAAM;EAIV,MAAM,wBAAQ,IAAI,IAAI;EACtB,IAAI,IAAI;EACR,KAAK,MAAM,KAAK,KACd,IAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MACvC,KAAK,SAAS,IAAI,GAAG,OAAO;OACvB,IAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAC9C,KAAK,QAAQ,IAAI,GAAG,OAAO;OAE3B,MAAM,IAAI,EAAE,MAAM;EAItB,IAAI,MAAM,OAAO,GACf,OAAO;EAGT,IAAI;EACJ,IAAI,MAAM,IAAI;GACZ,WAAW,QAAQ,GAAG,QAAQ,GAAG,QAAQ,OAAO;GAChD,IAAI,WAAW,GACb,OAAO;QACF,IAAI,aAAa,MAAM,GAAG,aAAa,QAAQ,GAAG,aAAa,OACpE,OAAO;EAEX;EAGA,KAAK,MAAM,MAAM,OAAO;GACtB,IAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAC1C,OAAO;GAGT,IAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAC1C,OAAO;GAGT,KAAK,MAAM,KAAK,KACd,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,OAAO,GACnC,OAAO;GAIX,OAAO;EACT;EAEA,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;EAE5C,IAAI,gBAAgB,aAAa,WAAW,WAAW,KACnD,GAAG,aAAa,OAAO,aAAa,WAAW,OAAO,GACxD,eAAe;EAGjB,KAAK,MAAM,KAAK,KAAK;GACnB,WAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;GAC5D,WAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;GAC5D,IAAI,IAAI;IACN,IAAI;SACE,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAClC,eAAe;IAAA;IAGnB,IAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;KAC7C,SAAS,SAAS,IAAI,GAAG,OAAO;KAChC,IAAI,WAAW,KAAK,WAAW,IAC7B,OAAO;IAEX,OAAO,IAAI,GAAG,aAAa,QAAQ,CAAC,EAAE,KAAK,GAAG,MAAM,GAClD,OAAO;GAEX;GACA,IAAI,IAAI;IACN,IAAI;SACE,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAClC,eAAe;IAAA;IAGnB,IAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;KAC7C,QAAQ,QAAQ,IAAI,GAAG,OAAO;KAC9B,IAAI,UAAU,KAAK,UAAU,IAC3B,OAAO;IAEX,OAAO,IAAI,GAAG,aAAa,QAAQ,CAAC,EAAE,KAAK,GAAG,MAAM,GAClD,OAAO;GAEX;GACA,IAAI,CAAC,EAAE,aAAa,MAAM,OAAO,aAAa,GAC5C,OAAO;EAEX;EAKA,IAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GACxC,OAAO;EAGT,IAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GACxC,OAAO;EAMT,IAAI,gBAAgB,cAClB,OAAO;EAGT,OAAO;CACT;CAGA,MAAM,YAAY,GAAG,GAAG,YAAY;EAClC,IAAI,CAAC,GACH,OAAO;EAET,MAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;EAChD,OAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;CACN;CAGA,MAAM,WAAW,GAAG,GAAG,YAAY;EACjC,IAAI,CAAC,GACH,OAAO;EAET,MAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;EAChD,OAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;CACN;CAEA,OAAO,UAAU;;;;;CCrPjB,MAAM,aAAA,WAAA;CACN,MAAM,YAAA,kBAAA;CACN,MAAM,SAAA,iBAAA;CACN,MAAM,cAAA,oBAAA;CAuCN,OAAO,UAAU;EACf,OAvCI,cAuCJ;EACA,OAvCI,gBAuCJ;EACA,OAvCI,cAuCJ;EACA,KAvCI,YAuCJ;EACA,MAvCI,aAuCJ;EACA,OAvCI,cAuCJ;EACA,OAvCI,cAuCJ;EACA,OAvCI,cAuCJ;EACA,YAvCI,mBAuCJ;EACA,SAvCI,gBAuCJ;EACA,UAvCI,iBAuCJ;EACA,cAvCI,sBAuCJ;EACA,cAvCI,sBAuCJ;EACA,MAvCI,aAuCJ;EACA,OAvCI,cAuCJ;EACA,IAvCI,WAuCJ;EACA,IAvCI,WAuCJ;EACA,IAvCI,WAuCJ;EACA,KAvCI,YAuCJ;EACA,KAvCI,YAuCJ;EACA,KAvCI,YAuCJ;EACA,KAvCI,YAuCJ;EACA,QAvCI,eAuCJ;EACA,UAvCI,iBAuCJ;EACA,YAvCI,mBAuCJ;EACA,OAvCI,cAuCJ;EACA,WAvCI,kBAuCJ;EACA,eAvCI,uBAuCJ;EACA,eAvCI,uBAuCJ;EACA,eAvCI,uBAuCJ;EACA,YAvCI,oBAuCJ;EACA,YAvCI,cAuCJ;EACA,SAvCI,gBAuCJ;EACA,KAvCI,YAuCJ;EACA,KAvCI,YAuCJ;EACA,YAvCI,mBAuCJ;EACA,eAvCI,iBAuCJ;EACA,QAvCI,eAuCJ;EACA;EACA,IAAI,WAAW;EACf,KAAK,WAAW;EAChB,QAAQ,WAAW;EACnB,qBAAqB,UAAU;EAC/B,eAAe,UAAU;EACzB,oBAAoB,YAAY;EAChC,qBAAqB,YAAY;CACnC;;;ACtFA,MAAA,mBAAA,SAAA,aAAA;;;;;;;;AASA;AAEA,SAAA,iBAAA,aAAA;;;;;;AAMA;;;AClBA,MAAM,YAAY,UAAU,IAAI;;;;AAKhC,SAAgB,kBAA0B;CACxC,IAAI;EACF,MAAM,UAAU,SAAS,iCAAiC;GACxD,KAAK,QAAQ,IAAI;GACjB,UAAU;GACV,OAAO;IAAC;IAAU;IAAQ;GAAQ;EACpC,CAAC,CAAC,CAAC,KAAK;EAER,OAAO,WAAW,WAAW,OAAO,IAAI,UAAU;CACpD,QAAQ;EACN,OAAO;CACT;AACF;;;;;;AAOA,eAAsB,eAAkC;CACtD,IAAI;EACF,MAAM,EAAE,WAAW,MAAM,UACvB;GACE;GACA;GACA;GACA;GACA;GACA;EACF,CAAC,CAAC,KAAK,GAAG,GACV;GACE,KAAK,gBAAgB;GACrB,UAAU;EACZ,CACF;EAEA,MAAM,WAAW,OAAO,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,IAAI,KAAK,OAAO;EAE3E,IAAI,SAAS,WAAW,GACtB,MAAM,IAAI,MAAM;EAGlB,OAAO;CACT,QAAQ;EACN,MAAM,IAAI,MAAM,oDAAoD;CACtE;AACF;;;;;;ACrDA,MAAa,eACX,MACA,eAAe,YACN;CACT,MAAM,aAAa,OAAO,OAAO,IAAI,CAAC,CAAC;CACvC,IAAI,CAAC,YAAY;EACf,QAAQ,KAAK,oBAAoB;EACjC;CACF;CAEA,MAAM,WAAW,CAAC,cAAc,GAAG,OAAO,KAAK,UAAU,CAAC;CAC1D,MAAM,YAAwB,CAAC;CAE/B,OAAO,QAAQ,IAAI,CAAC,CAAC,SAAS,CAAC,aAAa,aAAa;EACvD,UAAU,KAAK,CAAC,aAAa,GAAG,OAAO,OAAO,OAAO,CAAC,CAAC;CACzD,CAAC;CAED,MAAM,mBAAmB,QAAwB;EAE/C,OAAO,IAAI,QAAQ,oBAAoB,EAAE,CAAC,CAAC;CAC7C;CAEA,MAAM,eAAe,SAAS,KAAK,SAAS,UAAU;EACpD,MAAM,eAAe,KAAK,IAAI,GAAG,UAAU,KAAK,QAAQ,gBAAgB,IAAI,UAAU,EAAE,CAAC,CAAC;EAC1F,OAAO,KAAK,IAAI,QAAQ,QAAQ,YAAY;CAC9C,CAAC;CAED,MAAM,gBAAgB,IAAI,OAAO,aAAa,KAAK,CAAC;CACpD,MAAM,iBAAiB,aAAa,MAAM,CAAC,CAAC,CAAC,KAAK,UAAU,IAAI,OAAO,QAAQ,CAAC,CAAC;CACjF,MAAM,eAAe,IAAI,cAAc,GAAG,eAAe,KAAK,GAAG,EAAE;CACnE,MAAM,eAAe,IAAI,cAAc,GAAG,eAAe,KAAK,GAAG,EAAE;CACnE,MAAM,eAAe,IAAI,cAAc,GAAG,eAAe,KAAK,GAAG,EAAE;CAEnE,MAAM,aAAa,UAAoB;EAOrC,OAAO,IANgB,MAAM,KAAK,MAAM,UAAU;GAGhD,MAAM,UAFQ,aAAa,SACN,gBAAgB,IACF;GACnC,OAAO,IAAI,OAAO,IAAI,OAAO,KAAK,IAAI,GAAG,OAAO,CAAC,EAAE;EACrD,CACwB,CAAC,CAAC,KAAK,GAAG,EAAE;CACtC;CAEA,QAAQ,KAAK,YAAY;CACzB,QAAQ,KAAK,UAAU,QAAQ,CAAC;CAChC,QAAQ,KAAK,YAAY;CACzB,UAAU,SAAS,QAAQ;EACzB,QAAQ,KAAK,UAAU,GAAG,CAAC;CAC7B,CAAC;CACD,QAAQ,KAAK,YAAY;AAC3B;;;;;;AChCA,SAAS,mBAAmB,kBAA0B,oBAAqC;CACzF,IAAI,CAAC,kBAAkB,OAAO;CAE9B,IAAIA,cAAAA,QAAO,MAAM,gBAAgB,KAAKA,cAAAA,QAAO,UAAU,kBAAkB,kBAAkB,GACzF,OAAO;CAGT,MAAM,eAAeA,cAAAA,QAAO,OAAO,gBAAgB;CACnD,OAAO,eAAeA,cAAAA,QAAO,UAAU,aAAa,SAAS,kBAAkB,IAAI;AACrF;;;;AAKA,SAAS,0BAA0B,aAAqB,aAA6B;CACnF,IAAI;EACF,MAAM,yBAAyB,KAAK,aAAa,gBAAgB,aAAa,cAAc;EAC5F,IAAI,CAAC,WAAW,sBAAsB,GAAG,OAAO;EAGhD,OADoB,KAAK,MAAM,aAAa,wBAAwB,MAAM,CACzD,CAAC,CAAC,WAAW;CAChC,QAAQ;EACN,OAAO;CACT;AACF;;;;AAKA,SAAS,uBAAuB,aAAoC;CAClE,MAAM,eAAe,QAAQ,WAAW;CACxC,MAAM,cAAc,gBAAgB;CAGpC,IAAI,WADoB,KAAK,cAAc,cACd,CAAC,GAC5B,OAAO;CAGT,IAAI,eAAe,iBAAiB,aAClC,OAAO;CAGT,MAAM,aAAa,QAAQ,YAAY;CACvC,IAAI,eAAe,cAEjB,OAAO;CAGT,OAAO,uBAAuB,UAAU;AAC1C;;;;AAKA,MAAa,uBAAuB,aAAqB,gBAAiC;CACxF,IAAI;EACF,MAAM,gBAAgB,iBAAiB,WAAW;EAClD,MAAM,sBAAsB,QAAQ,QAAQ,IAAI,GAAG,WAAW;EAE9D,MAAM,oBAAoB,WAAW,KAAK,qBAAqB,cAAc,CAAC,IAC1E,sBACA,uBAAuB,mBAAmB;EAE9C,IAAI,CAAC,mBAAmB;GACtB,QAAQ,MACN,GAAG,cAAc,MAAM,oDAAoD,YAAY,QACzF;GACA,OAAO;EACT;EAEA,IAAI,sBAAsB,qBACxB,QAAQ,KACN,GAAG,cAAc,KAAK,2BAA2B,kBAAkB,uBACrE;EAGF,MAAM,cAAc,gBAA6B,mBAAmB,cAAc;EAElF,IAAI,CAAC,aACH,OAAO;EAGT,MAAM,EAAE,eAAe,CAAC,GAAG,mBAAmB,CAAC,MAAM;EAErD,MAAM,cAAsD,CAAC;EAC7D,IAAI,cAAc;EAElB,IAAI,eAAe,eACjB,OAAO,QAAQ,cAAc,aAAa,CAAC,CAAC,SAAS,CAAC,MAAM,wBAAwB;GAClF,MAAM,qBAAqB,0BAA0B,mBAAmB,IAAI;GAC5E,MAAM,wBAAwB,mBAAmB,aAAa,OAAO,kBAAkB;GACvF,MAAM,4BAA4B,mBAChC,iBAAiB,OACjB,kBACF;GACA,MAAM,uBAAuB,mBAAmB,oBAAoB,kBAAkB;GAEtF,IAAK,CAAC,yBAAyB,CAAC,6BAA8B,CAAC,sBAAsB;IACnF,cAAc;IAEd,YAAY,QAAQ;KAClB,UAAU;KACV,cAAc,wBACV,cAAc,UACd,GAAG,cAAc,MAAM,GAAG,aAAa,SAAS;KACpD,kBAAkB,4BACd,cAAc,UACd,GAAG,cAAc,MAAM,GAAG,iBAAiB,SAAS;KACxD,cAAc,uBACV,cAAc,UACd,GAAG,cAAc,MAAM,GAAG,sBAAsB;IACtD;GACF;EACF,CAAC;EAGH,IAAI,CAAC,aAAa;GAChB,QAAQ,KACN,GAAG,cAAc,MAAM,qDAAqD,YAAY,QAC1F;GACA,YAAY,aAAa,SAAS;GAElC,OAAO;EACT;EAEA,OAAO;CACT,SAAS,OAAO;EACd,QAAQ,MAAM,6CAA6C,KAAK;EAChE,OAAO;CACT;AACF;;;;;;;AAQA,MAAa,4BACX,aACA,aACA,aAOG;CACH,MAAM,uCAAuB,IAAI,IAAsB;CACvD,MAAM,yBAAmC,CAAC;CAE1C,KAAK,MAAM,UAAU,aAAa;EAChC,MAAM,WAAW,QAAQ,QAAQ,IAAI,GAAG,MAAM;EAC9C,MAAM,SAAS,WAAW,KAAK,UAAU,cAAc,CAAC,IACpD,WACA,uBAAuB,QAAQ;EACnC,IAAI,QAAQ;GACV,MAAM,OAAO,qBAAqB,IAAI,MAAM,KAAK,CAAC;GAClD,KAAK,KAAK,MAAM;GAChB,qBAAqB,IAAI,QAAQ,IAAI;EACvC,OACE,uBAAuB,KAAK,MAAM;CAEtC;CAEA,IAAI,YAAY;CAChB,MAAM,0BAAU,IAAI,IAAqB;CAEzC,KAAK,MAAM,CAAC,YAAY,qBAAqB,QAAQ,GAAG;EAEtD,MAAM,SAAS,oBAAoB,SAAS,WAAW;EACvD,QAAQ,IAAI,SAAS,MAAM;EAC3B,IAAI,CAAC,QAAQ,YAAY;CAC3B;CAEA,MAAM,eAAe,YAAY;CACjC,MAAM,iBAAiB,qBAAqB;CAC5C,MAAM,cAAc,MAAM,KAAK,QAAQ,OAAO,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC;CACjE,MAAM,cAAc,iBAAiB;CAErC,IAAI,uBAAuB,UAAU,CAAC,aACpC,IAAI,CAAC,aACH,SAAS,KAAK,sBAAsB,EAAE,MAAM,yCAAyC,CAAC;MACjF;EACL,SAAS,KAAK,sBAAsB,EAClC,MAAM,6BAA6B,uBAAuB,OAAO,SAC/D,uBAAuB,WAAW,IAAI,MAAM,GAC7C,uCACH,CAAC;EACD,uBAAuB,SAAS,MAAM,QAAQ,MAAM,KAAK,GAAG,CAAC;CAC/D;MACK;EACL,MAAM,aAAa,cAAc,IAAI,aAAa,YAAY,kBAAkB;EAEhF,SAAS,QAAQ,sBAAsB,EACrC,MAAM,kBAAkB,aAAa,SAAS,iBAAiB,IAAI,MAAM,GAAG,UAAU,eAAe,UACnG,mBAAmB,IAAI,MAAM,GAC9B,mBAAmB,YAAY,gBAAgB,aAClD,CAAC;CACH;CAEA,MAAM,qBAAqB,MAAM,KAAK,QAAQ,QAAQ,CAAC,CAAC,CACrD,QAAQ,GAAG,QAAQ,CAAC,EAAE,CAAC,CACvB,KAAK,CAAC,UAAU,IAAI;CAEvB,OAAO;EAAE;EAAW;EAAS;EAAsB;EAAoB;CAAuB;AAChG;;;;;;;ACzNA,MAAa,iBAAiB,OAAe,UAAmB;CAC9D,MAAM,YAAY;CAClB,MAAM,YAAY,UAAU,MAAM;CAClC,MAAM,aAAa,WAAW,MAAM;CAEpC,QAAQ,KAAK,GAAG,UAAU,GAAG,UAAU,GAAG,YAAY;AACxD;;;;AAKA,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;CACF,CAAC;CAED,MAAM,0BAAU,IAAI,IAAY;CAChC,QAAQ,IAAI,GAAG;CAEf,MAAM,iBAAiB,SAAiB,QAAQ,MAAY;EAC1D,IAAI,SAAS,UAAU;EAEvB,IAAI;GACF,MAAM,QAAQ,YAAY,SAAS,EAAE,eAAe,KAAK,CAAC;GAE1D,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,KAAK,KAAK,WAAW,GAAG,KAAK,CAAC,UAAU,IAAI,KAAK,IAAI;QACpD,KAAK,YAAY,GAAG;KACtB,MAAM,WAAW,KAAK,SAAS,KAAK,IAAI;KACxC,MAAM,eAAe,SAAS,UAAU,QAAQ;KAEhD,IAAI,gBAAgB,CAAC,aAAa,WAAW,IAAI,KAAK,CAAC,aAAa,SAAS,IAAI,GAAG;MAClF,QAAQ,IAAI,YAAY;MACxB,cAAc,UAAU,QAAQ,CAAC;KACnC;IACF;;EAGN,QAAQ,CAER;CACF;CAEA,cAAc,QAAQ;CAEtB,MAAM,aAAa,MAAM,KAAK,OAAO,CAAC,CAAC,KAAK;CAE5C,IAAI,aAAa,KAAK,GAAG;EACvB,MAAM,aAAa,aAAa,YAAY;EAC5C,OAAO,WACJ,QAAQ,WAAW,OAAO,YAAY,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC,CAC7D,MAAM,GAAG,oBAAoB;CAClC;CAEA,OAAO,WAAW,MAAM,GAAG,mBAAmB;AAChD;;;;AAKA,MAAM,gBAAgB,OAAO,aAAuB;CAClD,MAAM,UAAU;CAChB,MAAM,kBAAkB,SAAS,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,IAAI;CAI5E,IAAI,SAAS,WAAW,MAAM,SAAS,OAAO,OAAO,SAAS,OAAO,OAAO;EAM1E,IAAI,MALwB,QAAQ;GAClC,SAAS;GACT,SAAS;EACX,CAAC,GAEkB;GACjB,MAAM,aAAa,MAAM,OAAO;IAC9B,SAAS;IACT,QAAQ,OAAO,gBAAgB;KAI7B,OAFgB,oBADC,QAAQ,IACkB,GAAG,eAAe,EAEhD,CAAC,CAAC,KAAK,YAAY;MAC9B,MAAM,WAAW,MAAM,uBAAuB;MAC9C,OAAO;MACP,aACE,WAAW,MAAM,8BAA8B,UAAU,OAAO;KACpE,EAAE;IACJ;IACA,WAAW,SAAS;KAClB,IAAI,CAAC,MAAM,KAAK,GAAG,OAAO;KAC1B,MAAM,WAAW,KAAK,QAAQ,IAAI,GAAG,IAAI;KACzC,IAAI,CAAC,WAAW,QAAQ,GAAG,OAAO;KAClC,IAAI,CAAC,SAAS,QAAQ,CAAC,CAAC,YAAY,GAAG,OAAO;KAC9C,OAAO;IACT;GACF,CAAC;GAED,cAAc,SAAS,UAAU;GACjC,OAAO,CAAC,UAAU;EACpB;EAEA,cAAc,SAAS,SAAS,OAAO,OAAO,MAAM,SAAS,EAAE;EAC/D,OAAO,CAAC,SAAS,OAAO,OAAO,MAAM,SAAS,EAAE;CAClD;CAGA,IAAI,gBAAgB,UAAU,GAC5B,OAAO,SAAS;EACd,UAAU;EACV,SAAS;EACT,SAAS,gBAAgB,KAAK,UAAU;GACtC,MAAM;GACN,OAAO;GACP,SAAS;EACX,EAAE;CACJ,CAAC;CAGH,OAAO,CAAC,GAAG;AACb;;;;AAKA,MAAM,uBAAuB,OAAO,EAClC,WACA,qBAIqB;CACrB,MAAM,iBAAiB;CAEvB,IAAI,aAAa,eAAe,SAAS,SAAS,GAAG;EACnD,cAAc,gBAAgB,SAAS;EACvC,OAAO;CACT;CAEA,OAAOC,OAAK;EACV,SAAS;EACT,SAAS,eAAe,KAAK,UAAU;GAAE,MAAM;GAAM,OAAO;EAAK,EAAE;CACrE,CAAC;AACH;;;;AAKA,MAAM,iBAAiB,OAAO,EAC5B,WACA,MACA,eAKuB;CACvB,MAAM,cAAc,CAAC;CAErB,IAAI,aAAa,WAAW,KAAK,MAAM,SAAS,CAAC,GAAG;EAClD,cAAc,0BAA0B,SAAS;EACjD,YAAY,KAAK,SAAS;CAC5B;CAEA,IAAI,CAAC,YAAY,QAAQ;EACvB,MAAM,oBAAoB,MAAM,cAAc,QAAQ;EACtD,YAAY,KAAK,GAAI,qBAAqB,CAAC,CAAE;CAC/C;CAEA,OAAO;AACT;;;;AAKA,MAAM,qBAAqB,OAAO,SAAmB;CACnD,MAAM,UAAU;CAChB,IAAI,KAAK,SAAS,OAAO,KAAK,KAAK,SAAS,WAAW,GAAG;EACxD,cAAc,SAAS,KAAK;EAC5B,OAAO;CACT;CAEA,OAAO,QAAQ;EAAE;EAAS,SAAS;CAAM,CAAC;AAC5C;;;;AAKA,MAAM,mBAAmB,OAAO,SAAmB;CACjD,MAAM,UAAU;CAEhB,IAAI,KAAK,SAAS,SAAS,GAAG;EAC5B,cAAc,SAAS,KAAK;EAC5B,OAAO;CACT;CAEA,OAAO,QAAQ;EAAE;EAAS,SAAS;CAAM,CAAC;AAC5C;AAEA,MAAM,yBAAyB,CAAC,mBAAmB,UAAU;;;;AAK7D,MAAM,0BAA0B,OAAO,SAAmB;CACxD,MAAM,UAAU;CAChB,MAAM,qBAAqB,KAAK,WAAW,QAAQ,QAAQ,kBAAkB;CAE7E,IAAI;CAEJ,IAAI,uBAAuB,MAAM,KAAK,SAAS,qBAAqB,GAClE,gBAAgB,KAAK,qBAAqB;CAG5C,IAAI;CACJ,IAAI,eAAe;EACjB,cAAc,SAAS,aAAa;EACpC,eAAe;CACjB,OACE,eAAe,MAAM,MAAM;EACzB;EACA,gBAAgB;CAClB,CAAC;CAGH,MAAM,cAAc,CAAC,GAAG,sBAAsB;CAC9C,IAAI,cAAc,KAAK,GACrB,YAAY,KAAK,GAAG,aAAa,MAAM,GAAG,CAAC,CAAC,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC;CAGlE,OAAO,YAAY,KAAK,GAAG;AAC7B;;;;AAKA,MAAM,qBAAqB,OAAO,SAAmB;CACnD,MAAM,UAAU;CAEhB,IAAI,KAAK,SAAS,aAAa,GAAG;EAChC,cAAc,SAAS,KAAK;EAC5B,OAAO;CACT;CAEA,IAAI,KAAK,SAAS,gBAAgB,GAAG;EACnC,cAAc,SAAS,IAAI;EAC3B,OAAO;CACT;CAEA,OAAO,QAAQ;EAAE;EAAS,SAAS;CAAK,CAAC;AAC3C;AAUA,eAAe,WAAW,EACxB,gBACA,iBACA,UACA,MACA,4BACyC;CACzC,MAAM,OAAO,QAAQ,KAAK,MAAM,CAAC;CAEjC,IAAI,4BAA4B,KAAK,OAAO,0BAC1C,KAAK,MAAM;CAsBb,OAAO;EACL,eAnBA,4BACC,MAAM,qBAAqB;GAAE,WAAW,KAAK,MAAM;GAAI;EAAe,CAAC;EAmBxE,aAAA,MAhBwB,eAAe;GACvC,WAFoB,2BAA4B,KAAK,MAAM,KAAO,KAAK,MAAM;GAG7E;GACA;EACF,CAAC;EAaC,OAXY,oBAAoB,gBAAgB,MAAM,mBAAmB,IAAI,IAAI;EAYjF,SAXc,oBAAoB,gBAAgB,MAAM,iBAAiB,IAAI,IAAI;EAYjF,gBAVA,oBAAoB,WAChB,uBAAuB,KAAK,GAAG,IAC/B,MAAM,wBAAwB,IAAI;EAStC,cARmB,oBAAoB,gBAAgB,MAAM,mBAAmB,IAAI,IAAI;CAS1F;AACF;;;AC/SA,eAAe,qBAAqB,eAAuB;CACzD,IAAI,mBAA4C,CAAC;CACjD,MAAM,eAAe,MAAMC,SAAG,QAAQ,aAAa;CAEnD,MAAM,iBAAiB,MAAM,QAAQ,IACnC,aAAa,IAAI,OAAO,SAAS;EAE/B,MAAM,kBAAmB,MAAM,OADT,KAAK,KAAK,eAAe,MAAM,gBACH;EAClD,mBAAmB;GAAE,GAAG;IAAmB,OAAO,gBAAgB;EAAQ;EAC1E,OAAO;CACT,CAAC,CACH;CAEA,OAAO;EAAE;EAAkB;CAAe;AAC5C;;;AC1BA,MAAM,cAAc,KAAK,QAAQ,QAAQ,IAAI,GAAG,oBAAoB;AAEpE,MAAM,qBAAqB,OAAO,UAAkB,YAAmC;CAErF,MAAM,aADY,iBAAiB,KAAK,OACb,CAAC,GAAG;CAE/B,MAAM,eAAe,QAAQ,QAAQ,iBAAiB,EAAE;CACxD,MAAM,WAAW,aAAa,IAAI,eAAe;CAKjD,IAAI;EACF,MAAM,GAAG,OAAO,WAAW;EAE3B,CAAe,MADe,GAAG,SAAS,aAAa,MAAM,EAAA,CAC9B,KAAK;CACtC,QAAQ,CAER;CAGA,MAAM,OAAO,QAAQ;CACrB,MAAM,iBAAiB,KAAK,WAAW,QAAQ,IAAI,SAAS,gBAAgB,CAAC;CAC7E,IAAI,kBAAkB,GAAG;EACvB,MAAM,gBAAgB,KAAK;EAC3B,MAAM,eAAe,KAAK,QAAQ,aAAa;EAC/C,KAAwB,SAAS,YAAY;CAC/C;CAEA,MAAM,UAAU,IAAI,WAAW,SAAS,IAAI,aAAa;CACzD,MAAM,GAAG,WAAW,aAAa,SAAS,MAAM;AAClD;;;AC3BA,eAAe,UAAU,GAAiD;CACxE,QAAQ,EAAE,MAAV;EACE,KAAK,UACH,OAAO,OAAO;GACZ,SAAS,EAAE;GACX,UAAU,EAAE,WAAW,CAAC,EAAA,CAAG,KAAK,OAAO;IAAE,MAAM,EAAE;IAAM,OAAO,EAAE;GAAM,EAAE;GACxE,SAAS,EAAE;EACb,CAAC;EACH,KAAK,WACH,OAAO,QAAQ;GACb,SAAS,EAAE;GACX,SAAS,OAAO,EAAE,YAAY,YAAY,EAAE,UAAU;EACxD,CAAC;EAEH,SACE,OAAO,MAAM;GACX,SAAS,EAAE;GACX,SAAU,EAAE,WAAsB;EACpC,CAAC;CACL;AACF;AAEA,eAAsB,oBAAoB,aAAuC;CAC/E,MAAM,SAAS,iBAAiB,WAAW;CAC3C,IAAI,CAAC,QAAQ,SAAS,QAAQ,OAAO,CAAC;CAEtC,MAAM,UAAmB,CAAC;CAE1B,KAAK,MAAM,UAAU,OAAO,SAC1B,IAAI;EACF,QAAQ,OAAO,OAAO,MAAM,UAAU,MAAM;CAC9C,SAAS,OAAO;EACd,QAAQ,KACN,6BAA6B,OAAO,IAAI,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,GACpG;EAEA,IAAI,OAAO,YAAY,KAAA,GAAW;GAChC,QAAQ,KAAK,4BAA4B,OAAO,IAAI,KAAK,OAAO,SAAS;GACzE,QAAQ,OAAO,OAAO,OAAO;EAC/B,OACE,QAAQ,KAAK,oBAAoB,OAAO,IAAI,+BAA+B;CAE/E;CAEF,OAAO;AACT;;;AC/CA,MAAM,uBAAuB;AAE7B,SAAgB,uBAA6B;CAC3C,MAAM,qBAAqB,KAAK,QAAQ,QAAQ,IAAI,QAAQ,IAAI,oBAAoB;CAEpF,IAAI,CAACC,KAAG,WAAW,kBAAkB,GACnC,MAAM,IAAI,MACR,GAAG,cAAc,MAAM,6DAA6D,mBAAmB,6IAEzG;AAEJ"}
package/dist/index.js CHANGED
@@ -1,5 +1,5 @@
1
1
  #!/usr/bin/env node
2
- import { a as getOptions, c as assessPrerequisitesBatch, d as getCodemodConfig, i as loadTransformModules, l as findPackages, n as runTransformPrompts, o as logToInquirer, s as assessPrerequisites, t as validateClaudeConfig, u as findProjectRoot } from "./helpers-CtDbFBsP.js";
2
+ import { a as getOptions, c as assessPrerequisitesBatch, d as getCodemodConfig, i as loadTransformModules, l as findPackages, n as runTransformPrompts, o as logToInquirer, s as assessPrerequisites, t as validateClaudeConfig, u as findProjectRoot } from "./helpers-CPf8C-KU.js";
3
3
  import { t as CONSOLE_ICONS } from "./common-AexZXiET.js";
4
4
  import { execSync } from "node:child_process";
5
5
  import fs from "node:fs/promises";
package/dist/transforms/button/transformer.js CHANGED
@@ -1,4 +1,4 @@
1
- import { r as reportManualReview } from "../../helpers-CtDbFBsP.js";
1
+ import { r as reportManualReview } from "../../helpers-CPf8C-KU.js";
2
2
  //#region src/helpers/jscodeshift/addImport.ts
3
3
  /**
4
4
  * Adds a named import if it doesn't already exist.
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@wise/wds-codemods",
3
- "version": "1.3.1-experimental-d4d0977",
3
+ "version": "1.3.1-experimental-cb6b37f",
4
4
  "license": "UNLICENSED",
5
5
  "author": "Wise Payments Ltd.",
6
6
  "repository": {
@@ -53,13 +53,13 @@
53
53
  "@inquirer/testing": "^3.3.9",
54
54
  "@transferwise/components": "^46.148.1",
55
55
  "@types/jscodeshift": "^17.3.0",
56
- "@types/node": "^24.13.2",
56
+ "@types/node": "^24.13.1",
57
57
  "@types/semver": "^7.7.1",
58
58
  "@wise/eslint-config": "^14.2.1",
59
59
  "eslint": "^9.39.4",
60
60
  "husky": "^9.1.7",
61
- "prettier": "^3.8.4",
62
- "semver": "^7.8.4",
61
+ "prettier": "^3.8.3",
62
+ "semver": "^7.8.2",
63
63
  "vitest": "^4.1.8",
64
64
  "ts-node": "^10.9.2",
65
65
  "tsdown": "^0.22.2",
@@ -69,7 +69,7 @@
69
69
  "access": "public",
70
70
  "registry": "https://registry.npmjs.org/"
71
71
  },
72
- "packageManager": "pnpm@11.6.0",
72
+ "packageManager": "pnpm@11.5.2",
73
73
  "engines": {
74
74
  "node": "^24"
75
75
  },
package/dist/helpers-CtDbFBsP.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"file":"helpers-CtDbFBsP.js","names":["semver","list","fs","fs"],"sources":["../node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/constants.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/debug.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/re.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/parse-options.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/identifiers.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/classes/semver.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/parse.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/valid.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/clean.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/inc.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/diff.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/major.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/minor.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/patch.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/prerelease.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/compare.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/rcompare.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/compare-loose.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/compare-build.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/sort.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/rsort.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/gt.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/lt.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/eq.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/neq.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/gte.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/lte.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/cmp.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/coerce.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/truncate.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/lrucache.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/classes/range.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/classes/comparator.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/satisfies.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/to-comparators.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/max-satisfying.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/min-satisfying.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/min-version.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/valid.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/outside.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/gtr.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/ltr.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/intersects.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/simplify.js","../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/subset.js","../node_modules/.pnpm/semver@7.8.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 identifier, 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')\n\nconst isPrereleaseIdentifier = (prerelease, identifier) => {\n const identifiers = identifier.split('.')\n if (identifiers.length > prerelease.length) {\n return false\n }\n\n for (let i = 0; i < identifiers.length; i++) {\n if (compareIdentifiers(prerelease[i], identifiers[i]) !== 0) {\n return false\n }\n }\n\n return true\n}\n\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 (isPrereleaseIdentifier(this.prerelease, identifier)) {\n const prereleaseBase = this.prerelease[identifier.split('.').length]\n if (isNaN(prereleaseBase)) {\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\nconst parse = require('./parse')\nconst constants = require('../internal/constants')\nconst SemVer = require('../classes/semver')\n\nconst truncate = (version, truncation, options) => {\n if (!constants.RELEASE_TYPES.includes(truncation)) {\n return null\n }\n\n const clonedVersion = cloneInputVersion(version, options)\n return clonedVersion && doTruncation(clonedVersion, truncation)\n}\n\nconst cloneInputVersion = (version, options) => {\n const versionStringToParse = (\n version instanceof SemVer ? version.version : version\n )\n\n return parse(versionStringToParse, options)\n}\n\nconst doTruncation = (version, truncation) => {\n if (isPrerelease(truncation)) {\n return version.version\n }\n\n version.prerelease = []\n\n switch (truncation) {\n case 'major':\n version.minor = 0\n version.patch = 0\n break\n case 'minor':\n version.patch = 0\n break\n }\n\n return version.format()\n}\n\nconst isPrerelease = (type) => {\n return type.startsWith('pre')\n}\n\nmodule.exports = truncate\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 // strip build metadata so it can't bleed into the version\n range = range.replace(BUILDSTRIPRE, '')\n\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 src,\n t,\n comparatorTrimReplace,\n tildeTrimReplace,\n caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\n// unbounded global build-metadata stripper used by parseRange\nconst BUILDSTRIPRE = new RegExp(src[t.BUILD], 'g')\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\nconst invalidXRangeOrder = (M, m, p) => (\n (isX(M) && !isX(m)) ||\n (isX(m) && p && !isX(p))\n)\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 } <${M}.${m}.${+p + 1}-0`\n } else {\n ret = `>=${M}.${m}.${p\n } <${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 if (invalidXRangeOrder(M, m, p)) {\n return comp\n }\n\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 === '>=' && !c.test(gt.semver)) {\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 === '<=' && !c.test(lt.semver)) {\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 truncate = require('./functions/truncate')\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 truncate,\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: unknown;\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 };\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,45],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAIA,MAAM,sBAAsB;CAE5B,MAAM,aAAa;CACnB,MAAM,mBAAmB,OAAO,oBACL;CAmB3B,OAAO,UAAU;EACf;EACA;EACA,uBAf4B,aAAa;EAgBzC;EACA;GAdA;GACA;GACA;GACA;GACA;GACA;GACA;EAQA;EACA;EACA,yBAAyB;EACzB,YAAY;CACd;;;;;CC1BA,OAAO,UAPL,OAAO,YAAY,YACnB,QAAQ,OACR,QAAQ,IAAI,cACZ,cAAc,KAAK,QAAQ,IAAI,UAAU,KACtC,GAAG,SAAS,QAAQ,MAAM,UAAU,GAAG,IAAI,UACtC,CAAC;;;;;CCNX,MAAM,EACJ,2BACA,uBACA,eAAA,kBAAA;CAEF,MAAM,QAAA,cAAA;CACN,UAAU,OAAO,UAAU,CAAC;CAG5B,MAAM,KAAK,QAAQ,KAAK,CAAC;CACzB,MAAM,SAAS,QAAQ,SAAS,CAAC;CACjC,MAAM,MAAM,QAAQ,MAAM,CAAC;CAC3B,MAAM,UAAU,QAAQ,UAAU,CAAC;CACnC,MAAM,IAAI,QAAQ,IAAI,CAAC;CACvB,IAAI,IAAI;CAER,MAAM,mBAAmB;CAQzB,MAAM,wBAAwB;EAC5B,CAAC,OAAO,CAAC;EACT,CAAC,OAAO,UAAU;EAClB,CAAC,kBAAkB,qBAAqB;CAC1C;CAEA,MAAM,iBAAiB,UAAU;EAC/B,KAAK,MAAM,CAAC,OAAO,QAAQ,uBACzB,QAAQ,MACL,MAAM,GAAG,MAAM,EAAE,CAAC,CAAC,KAAK,GAAG,MAAM,KAAK,IAAI,EAAE,CAAC,CAC7C,MAAM,GAAG,MAAM,EAAE,CAAC,CAAC,KAAK,GAAG,MAAM,KAAK,IAAI,EAAE;EAEjD,OAAO;CACT;CAEA,MAAM,eAAe,MAAM,OAAO,aAAa;EAC7C,MAAM,OAAO,cAAc,KAAK;EAChC,MAAM,QAAQ;EACd,MAAM,MAAM,OAAO,KAAK;EACxB,EAAE,QAAQ;EACV,IAAI,SAAS;EACb,QAAQ,SAAS;EACjB,GAAG,SAAS,IAAI,OAAO,OAAO,WAAW,MAAM,KAAA,CAAS;EACxD,OAAO,SAAS,IAAI,OAAO,MAAM,WAAW,MAAM,KAAA,CAAS;CAC7D;CAQA,YAAY,qBAAqB,aAAa;CAC9C,YAAY,0BAA0B,MAAM;CAM5C,YAAY,wBAAwB,gBAAgB,iBAAiB,EAAE;CAKvE,YAAY,eAAe,IAAI,IAAI,EAAE,mBAAmB,OACjC,IAAI,EAAE,mBAAmB,OACzB,IAAI,EAAE,mBAAmB,EAAE;CAElD,YAAY,oBAAoB,IAAI,IAAI,EAAE,wBAAwB,OACtC,IAAI,EAAE,wBAAwB,OAC9B,IAAI,EAAE,wBAAwB,EAAE;CAO5D,YAAY,wBAAwB,MAAM,IAAI,EAAE,sBAC/C,GAAG,IAAI,EAAE,mBAAmB,EAAE;CAE/B,YAAY,6BAA6B,MAAM,IAAI,EAAE,sBACpD,GAAG,IAAI,EAAE,wBAAwB,EAAE;CAMpC,YAAY,cAAc,QAAQ,IAAI,EAAE,sBACvC,QAAQ,IAAI,EAAE,sBAAsB,KAAK;CAE1C,YAAY,mBAAmB,SAAS,IAAI,EAAE,2BAC7C,QAAQ,IAAI,EAAE,2BAA2B,KAAK;CAK/C,YAAY,mBAAmB,GAAG,iBAAiB,EAAE;CAMrD,YAAY,SAAS,UAAU,IAAI,EAAE,iBACpC,QAAQ,IAAI,EAAE,iBAAiB,KAAK;CAWrC,YAAY,aAAa,KAAK,IAAI,EAAE,eACjC,IAAI,EAAE,YAAY,GACnB,IAAI,EAAE,OAAO,EAAE;CAEjB,YAAY,QAAQ,IAAI,IAAI,EAAE,WAAW,EAAE;CAK3C,YAAY,cAAc,WAAW,IAAI,EAAE,oBACxC,IAAI,EAAE,iBAAiB,GACxB,IAAI,EAAE,OAAO,EAAE;CAEjB,YAAY,SAAS,IAAI,IAAI,EAAE,YAAY,EAAE;CAE7C,YAAY,QAAQ,cAAc;CAKlC,YAAY,yBAAyB,GAAG,IAAI,EAAE,wBAAwB,SAAS;CAC/E,YAAY,oBAAoB,GAAG,IAAI,EAAE,mBAAmB,SAAS;CAErE,YAAY,eAAe,YAAY,IAAI,EAAE,kBAAkB,UAClC,IAAI,EAAE,kBAAkB,UACxB,IAAI,EAAE,kBAAkB,MAC5B,IAAI,EAAE,YAAY,IACtB,IAAI,EAAE,OAAO,MACT;CAEzB,YAAY,oBAAoB,YAAY,IAAI,EAAE,uBAAuB,UACvC,IAAI,EAAE,uBAAuB,UAC7B,IAAI,EAAE,uBAAuB,MACjC,IAAI,EAAE,iBAAiB,IAC3B,IAAI,EAAE,OAAO,MACT;CAE9B,YAAY,UAAU,IAAI,IAAI,EAAE,MAAM,MAAM,IAAI,EAAE,aAAa,EAAE;CACjE,YAAY,eAAe,IAAI,IAAI,EAAE,MAAM,MAAM,IAAI,EAAE,kBAAkB,EAAE;CAI3E,YAAY,eAAe,oBACD,0BAA0B,iBACtB,0BAA0B,mBAC1B,0BAA0B,KAAK;CAC7D,YAAY,UAAU,GAAG,IAAI,EAAE,aAAa,aAAa;CACzD,YAAY,cAAc,IAAI,EAAE,eAClB,MAAM,IAAI,EAAE,YAAY,OAClB,IAAI,EAAE,OAAO,eACL;CAC5B,YAAY,aAAa,IAAI,EAAE,SAAS,IAAI;CAC5C,YAAY,iBAAiB,IAAI,EAAE,aAAa,IAAI;CAIpD,YAAY,aAAa,SAAS;CAElC,YAAY,aAAa,SAAS,IAAI,EAAE,WAAW,OAAO,IAAI;CAC9D,QAAQ,mBAAmB;CAE3B,YAAY,SAAS,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,aAAa,EAAE;CACjE,YAAY,cAAc,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,kBAAkB,EAAE;CAI3E,YAAY,aAAa,SAAS;CAElC,YAAY,aAAa,SAAS,IAAI,EAAE,WAAW,OAAO,IAAI;CAC9D,QAAQ,mBAAmB;CAE3B,YAAY,SAAS,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,aAAa,EAAE;CACjE,YAAY,cAAc,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,kBAAkB,EAAE;CAG3E,YAAY,mBAAmB,IAAI,IAAI,EAAE,MAAM,OAAO,IAAI,EAAE,YAAY,MAAM;CAC9E,YAAY,cAAc,IAAI,IAAI,EAAE,MAAM,OAAO,IAAI,EAAE,WAAW,MAAM;CAIxE,YAAY,kBAAkB,SAAS,IAAI,EAAE,MAC5C,OAAO,IAAI,EAAE,YAAY,GAAG,IAAI,EAAE,aAAa,IAAI,IAAI;CACxD,QAAQ,wBAAwB;CAMhC,YAAY,eAAe,SAAS,IAAI,EAAE,aAAa,aAEhC,IAAI,EAAE,aAAa,OAChB;CAE1B,YAAY,oBAAoB,SAAS,IAAI,EAAE,kBAAkB,aAErC,IAAI,EAAE,kBAAkB,OACrB;CAG/B,YAAY,QAAQ,iBAAiB;CAErC,YAAY,QAAQ,2BAA2B;CAC/C,YAAY,WAAW,6BAA6B;;;;;CC3NpD,MAAM,cAAc,OAAO,OAAO,EAAE,OAAO,KAAK,CAAC;CACjD,MAAM,YAAY,OAAO,OAAO,CAAE,CAAC;CACnC,MAAM,gBAAe,YAAW;EAC9B,IAAI,CAAC,SACH,OAAO;EAGT,IAAI,OAAO,YAAY,UACrB,OAAO;EAGT,OAAO;CACT;CACA,OAAO,UAAU;;;;;CCdjB,MAAM,UAAU;CAChB,MAAM,sBAAsB,GAAG,MAAM;EACnC,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK;EAGpC,MAAM,OAAO,QAAQ,KAAK,CAAC;EAC3B,MAAM,OAAO,QAAQ,KAAK,CAAC;EAE3B,IAAI,QAAQ,MAAM;GAChB,IAAI,CAAC;GACL,IAAI,CAAC;EACP;EAEA,OAAO,MAAM,IAAI,IACZ,QAAQ,CAAC,OAAQ,KACjB,QAAQ,CAAC,OAAQ,IAClB,IAAI,IAAI,KACR;CACN;CAEA,MAAM,uBAAuB,GAAG,MAAM,mBAAmB,GAAG,CAAC;CAE7D,OAAO,UAAU;EACf;EACA;CACF;;;;;CC1BA,MAAM,QAAA,cAAA;CACN,MAAM,EAAE,YAAY,qBAAA,kBAAA;CACpB,MAAM,EAAE,QAAQ,IAAI,MAAA,WAAA;CAEpB,MAAM,eAAA,sBAAA;CACN,MAAM,EAAE,uBAAA,oBAAA;CAER,MAAM,0BAA0B,YAAY,eAAe;EACzD,MAAM,cAAc,WAAW,MAAM,GAAG;EACxC,IAAI,YAAY,SAAS,WAAW,QAClC,OAAO;EAGT,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,IAAI,mBAAmB,WAAW,IAAI,YAAY,EAAE,MAAM,GACxD,OAAO;EAIX,OAAO;CACT;CAuUA,OAAO,UAAU,MArUX,OAAO;EACX,YAAa,SAAS,SAAS;GAC7B,UAAU,aAAa,OAAO;GAE9B,IAAI,mBAAmB,QACrB,IAAI,QAAQ,UAAU,CAAC,CAAC,QAAQ,SAC9B,QAAQ,sBAAsB,CAAC,CAAC,QAAQ,mBACxC,OAAO;QAEP,UAAU,QAAQ;QAEf,IAAI,OAAO,YAAY,UAC5B,MAAM,IAAI,UAAU,gDAAgD,OAAO,QAAQ,GAAG;GAGxF,IAAI,QAAQ,SAAS,YACnB,MAAM,IAAI,UACR,0BAA0B,WAAW,YACvC;GAGF,MAAM,UAAU,SAAS,OAAO;GAChC,KAAK,UAAU;GACf,KAAK,QAAQ,CAAC,CAAC,QAAQ;GAGvB,KAAK,oBAAoB,CAAC,CAAC,QAAQ;GAEnC,MAAM,IAAI,QAAQ,KAAK,CAAC,CAAC,MAAM,QAAQ,QAAQ,GAAG,EAAE,SAAS,GAAG,EAAE,KAAK;GAEvE,IAAI,CAAC,GACH,MAAM,IAAI,UAAU,oBAAoB,SAAS;GAGnD,KAAK,MAAM;GAGX,KAAK,QAAQ,CAAC,EAAE;GAChB,KAAK,QAAQ,CAAC,EAAE;GAChB,KAAK,QAAQ,CAAC,EAAE;GAEhB,IAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAChD,MAAM,IAAI,UAAU,uBAAuB;GAG7C,IAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAChD,MAAM,IAAI,UAAU,uBAAuB;GAG7C,IAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAChD,MAAM,IAAI,UAAU,uBAAuB;GAI7C,IAAI,CAAC,EAAE,IACL,KAAK,aAAa,CAAC;QAEnB,KAAK,aAAa,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,OAAO;IAC5C,IAAI,WAAW,KAAK,EAAE,GAAG;KACvB,MAAM,MAAM,CAAC;KACb,IAAI,OAAO,KAAK,MAAM,kBACpB,OAAO;IAEX;IACA,OAAO;GACT,CAAC;GAGH,KAAK,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC;GACvC,KAAK,OAAO;EACd;EAEA,SAAU;GACR,KAAK,UAAU,GAAG,KAAK,MAAM,GAAG,KAAK,MAAM,GAAG,KAAK;GACnD,IAAI,KAAK,WAAW,QAClB,KAAK,WAAW,IAAI,KAAK,WAAW,KAAK,GAAG;GAE9C,OAAO,KAAK;EACd;EAEA,WAAY;GACV,OAAO,KAAK;EACd;EAEA,QAAS,OAAO;GACd,MAAM,kBAAkB,KAAK,SAAS,KAAK,SAAS,KAAK;GACzD,IAAI,EAAE,iBAAiB,SAAS;IAC9B,IAAI,OAAO,UAAU,YAAY,UAAU,KAAK,SAC9C,OAAO;IAET,QAAQ,IAAI,OAAO,OAAO,KAAK,OAAO;GACxC;GAEA,IAAI,MAAM,YAAY,KAAK,SACzB,OAAO;GAGT,OAAO,KAAK,YAAY,KAAK,KAAK,KAAK,WAAW,KAAK;EACzD;EAEA,YAAa,OAAO;GAClB,IAAI,EAAE,iBAAiB,SACrB,QAAQ,IAAI,OAAO,OAAO,KAAK,OAAO;GAGxC,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,OAAO;EACT;EAEA,WAAY,OAAO;GACjB,IAAI,EAAE,iBAAiB,SACrB,QAAQ,IAAI,OAAO,OAAO,KAAK,OAAO;GAIxC,IAAI,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,QAC9C,OAAO;QACF,IAAI,CAAC,KAAK,WAAW,UAAU,MAAM,WAAW,QACrD,OAAO;QACF,IAAI,CAAC,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,QACtD,OAAO;GAGT,IAAI,IAAI;GACR,GAAG;IACD,MAAM,IAAI,KAAK,WAAW;IAC1B,MAAM,IAAI,MAAM,WAAW;IAC3B,MAAM,sBAAsB,GAAG,GAAG,CAAC;IACnC,IAAI,MAAM,KAAA,KAAa,MAAM,KAAA,GAC3B,OAAO;SACF,IAAI,MAAM,KAAA,GACf,OAAO;SACF,IAAI,MAAM,KAAA,GACf,OAAO;SACF,IAAI,MAAM,GACf;SAEA,OAAO,mBAAmB,GAAG,CAAC;GAElC,SAAS,EAAE;EACb;EAEA,aAAc,OAAO;GACnB,IAAI,EAAE,iBAAiB,SACrB,QAAQ,IAAI,OAAO,OAAO,KAAK,OAAO;GAGxC,IAAI,IAAI;GACR,GAAG;IACD,MAAM,IAAI,KAAK,MAAM;IACrB,MAAM,IAAI,MAAM,MAAM;IACtB,MAAM,iBAAiB,GAAG,GAAG,CAAC;IAC9B,IAAI,MAAM,KAAA,KAAa,MAAM,KAAA,GAC3B,OAAO;SACF,IAAI,MAAM,KAAA,GACf,OAAO;SACF,IAAI,MAAM,KAAA,GACf,OAAO;SACF,IAAI,MAAM,GACf;SAEA,OAAO,mBAAmB,GAAG,CAAC;GAElC,SAAS,EAAE;EACb;EAIA,IAAK,SAAS,YAAY,gBAAgB;GACxC,IAAI,QAAQ,WAAW,KAAK,GAAG;IAC7B,IAAI,CAAC,cAAc,mBAAmB,OACpC,MAAM,IAAI,MAAM,iDAAiD;IAGnE,IAAI,YAAY;KACd,MAAM,QAAQ,IAAI,aAAa,MAAM,KAAK,QAAQ,QAAQ,GAAG,EAAE,mBAAmB,GAAG,EAAE,WAAW;KAClG,IAAI,CAAC,SAAS,MAAM,OAAO,YACzB,MAAM,IAAI,MAAM,uBAAuB,YAAY;IAEvD;GACF;GAEA,QAAQ,SAAR;IACE,KAAK;KACH,KAAK,WAAW,SAAS;KACzB,KAAK,QAAQ;KACb,KAAK,QAAQ;KACb,KAAK;KACL,KAAK,IAAI,OAAO,YAAY,cAAc;KAC1C;IACF,KAAK;KACH,KAAK,WAAW,SAAS;KACzB,KAAK,QAAQ;KACb,KAAK;KACL,KAAK,IAAI,OAAO,YAAY,cAAc;KAC1C;IACF,KAAK;KAIH,KAAK,WAAW,SAAS;KACzB,KAAK,IAAI,SAAS,YAAY,cAAc;KAC5C,KAAK,IAAI,OAAO,YAAY,cAAc;KAC1C;IAGF,KAAK;KACH,IAAI,KAAK,WAAW,WAAW,GAC7B,KAAK,IAAI,SAAS,YAAY,cAAc;KAE9C,KAAK,IAAI,OAAO,YAAY,cAAc;KAC1C;IACF,KAAK;KACH,IAAI,KAAK,WAAW,WAAW,GAC7B,MAAM,IAAI,MAAM,WAAW,KAAK,IAAI,qBAAqB;KAE3D,KAAK,WAAW,SAAS;KACzB;IAEF,KAAK;KAKH,IACE,KAAK,UAAU,KACf,KAAK,UAAU,KACf,KAAK,WAAW,WAAW,GAE3B,KAAK;KAEP,KAAK,QAAQ;KACb,KAAK,QAAQ;KACb,KAAK,aAAa,CAAC;KACnB;IACF,KAAK;KAKH,IAAI,KAAK,UAAU,KAAK,KAAK,WAAW,WAAW,GACjD,KAAK;KAEP,KAAK,QAAQ;KACb,KAAK,aAAa,CAAC;KACnB;IACF,KAAK;KAKH,IAAI,KAAK,WAAW,WAAW,GAC7B,KAAK;KAEP,KAAK,aAAa,CAAC;KACnB;IAGF,KAAK,OAAO;KACV,MAAM,OAAO,OAAO,cAAc,IAAI,IAAI;KAE1C,IAAI,KAAK,WAAW,WAAW,GAC7B,KAAK,aAAa,CAAC,IAAI;UAClB;MACL,IAAI,IAAI,KAAK,WAAW;MACxB,OAAO,EAAE,KAAK,GACZ,IAAI,OAAO,KAAK,WAAW,OAAO,UAAU;OAC1C,KAAK,WAAW,EAAE;OAClB,IAAI;MACN;MAEF,IAAI,MAAM,IAAI;OAEZ,IAAI,eAAe,KAAK,WAAW,KAAK,GAAG,KAAK,mBAAmB,OACjE,MAAM,IAAI,MAAM,uDAAuD;OAEzE,KAAK,WAAW,KAAK,IAAI;MAC3B;KACF;KACA,IAAI,YAAY;MAGd,IAAI,aAAa,CAAC,YAAY,IAAI;MAClC,IAAI,mBAAmB,OACrB,aAAa,CAAC,UAAU;MAE1B,IAAI,uBAAuB,KAAK,YAAY,UAAU,GAAG;OACvD,MAAM,iBAAiB,KAAK,WAAW,WAAW,MAAM,GAAG,CAAC,CAAC;OAC7D,IAAI,MAAM,cAAc,GACtB,KAAK,aAAa;MAEtB,OACE,KAAK,aAAa;KAEtB;KACA;IACF;IACA,SACE,MAAM,IAAI,MAAM,+BAA+B,SAAS;GAC5D;GACA,KAAK,MAAM,KAAK,OAAO;GACvB,IAAI,KAAK,MAAM,QACb,KAAK,OAAO,IAAI,KAAK,MAAM,KAAK,GAAG;GAErC,OAAO;EACT;CACF;;;;;CCzVA,MAAM,SAAA,iBAAA;CACN,MAAM,SAAS,SAAS,SAAS,cAAc,UAAU;EACvD,IAAI,mBAAmB,QACrB,OAAO;EAET,IAAI;GACF,OAAO,IAAI,OAAO,SAAS,OAAO;EACpC,SAAS,IAAI;GACX,IAAI,CAAC,aACH,OAAO;GAET,MAAM;EACR;CACF;CAEA,OAAO,UAAU;;;;;CCfjB,MAAM,QAAA,cAAA;CACN,MAAM,SAAS,SAAS,YAAY;EAClC,MAAM,IAAI,MAAM,SAAS,OAAO;EAChC,OAAO,IAAI,EAAE,UAAU;CACzB;CACA,OAAO,UAAU;;;;;CCLjB,MAAM,QAAA,cAAA;CACN,MAAM,SAAS,SAAS,YAAY;EAClC,MAAM,IAAI,MAAM,QAAQ,KAAK,CAAC,CAAC,QAAQ,UAAU,EAAE,GAAG,OAAO;EAC7D,OAAO,IAAI,EAAE,UAAU;CACzB;CACA,OAAO,UAAU;;;;;CCLjB,MAAM,SAAA,iBAAA;CAEN,MAAM,OAAO,SAAS,SAAS,SAAS,YAAY,mBAAmB;EACrE,IAAI,OAAQ,YAAa,UAAU;GACjC,iBAAiB;GACjB,aAAa;GACb,UAAU,KAAA;EACZ;EAEA,IAAI;GACF,OAAO,IAAI,OACT,mBAAmB,SAAS,QAAQ,UAAU,SAC9C,OACF,CAAC,CAAC,IAAI,SAAS,YAAY,cAAc,CAAC,CAAC;EAC7C,SAAS,IAAI;GACX,OAAO;EACT;CACF;CACA,OAAO,UAAU;;;;;CClBjB,MAAM,QAAA,cAAA;CAEN,MAAM,QAAQ,UAAU,aAAa;EACnC,MAAM,KAAK,MAAM,UAAU,MAAM,IAAI;EACrC,MAAM,KAAK,MAAM,UAAU,MAAM,IAAI;EACrC,MAAM,aAAa,GAAG,QAAQ,EAAE;EAEhC,IAAI,eAAe,GACjB,OAAO;EAGT,MAAM,WAAW,aAAa;EAC9B,MAAM,cAAc,WAAW,KAAK;EACpC,MAAM,aAAa,WAAW,KAAK;EACnC,MAAM,aAAa,CAAC,CAAC,YAAY,WAAW;EAG5C,IAAI,CAFe,CAAC,WAAW,WAAW,UAEzB,CAAC,YAAY;GAQ5B,IAAI,CAAC,WAAW,SAAS,CAAC,WAAW,OACnC,OAAO;GAIT,IAAI,WAAW,YAAY,WAAW,MAAM,GAAG;IAC7C,IAAI,WAAW,SAAS,CAAC,WAAW,OAClC,OAAO;IAET,OAAO;GACT;EACF;EAGA,MAAM,SAAS,aAAa,QAAQ;EAEpC,IAAI,GAAG,UAAU,GAAG,OAClB,OAAO,SAAS;EAGlB,IAAI,GAAG,UAAU,GAAG,OAClB,OAAO,SAAS;EAGlB,IAAI,GAAG,UAAU,GAAG,OAClB,OAAO,SAAS;EAIlB,OAAO;CACT;CAEA,OAAO,UAAU;;;;;CCzDjB,MAAM,SAAA,iBAAA;CACN,MAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC;CACjD,OAAO,UAAU;;;;;CCFjB,MAAM,SAAA,iBAAA;CACN,MAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC;CACjD,OAAO,UAAU;;;;;CCFjB,MAAM,SAAA,iBAAA;CACN,MAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC;CACjD,OAAO,UAAU;;;;;CCFjB,MAAM,QAAA,cAAA;CACN,MAAM,cAAc,SAAS,YAAY;EACvC,MAAM,SAAS,MAAM,SAAS,OAAO;EACrC,OAAQ,UAAU,OAAO,WAAW,SAAU,OAAO,aAAa;CACpE;CACA,OAAO,UAAU;;;;;CCLjB,MAAM,SAAA,iBAAA;CACN,MAAM,WAAW,GAAG,GAAG,UACrB,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC,QAAQ,IAAI,OAAO,GAAG,KAAK,CAAC;CAEnD,OAAO,UAAU;;;;;CCJjB,MAAM,UAAA,gBAAA;CACN,MAAM,YAAY,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK;CACrD,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,gBAAgB,GAAG,MAAM,QAAQ,GAAG,GAAG,IAAI;CACjD,OAAO,UAAU;;;;;CCFjB,MAAM,SAAA,iBAAA;CACN,MAAM,gBAAgB,GAAG,GAAG,UAAU;EACpC,MAAM,WAAW,IAAI,OAAO,GAAG,KAAK;EACpC,MAAM,WAAW,IAAI,OAAO,GAAG,KAAK;EACpC,OAAO,SAAS,QAAQ,QAAQ,KAAK,SAAS,aAAa,QAAQ;CACrE;CACA,OAAO,UAAU;;;;;CCNjB,MAAM,eAAA,sBAAA;CACN,MAAM,QAAQ,MAAM,UAAU,KAAK,MAAM,GAAG,MAAM,aAAa,GAAG,GAAG,KAAK,CAAC;CAC3E,OAAO,UAAU;;;;;CCFjB,MAAM,eAAA,sBAAA;CACN,MAAM,SAAS,MAAM,UAAU,KAAK,MAAM,GAAG,MAAM,aAAa,GAAG,GAAG,KAAK,CAAC;CAC5E,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,IAAI;CACnD,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,IAAI;CACnD,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,MAAM;CACrD,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,MAAM;CACtD,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,KAAK;CACrD,OAAO,UAAU;;;;;CCFjB,MAAM,UAAA,gBAAA;CACN,MAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,KAAK;CACrD,OAAO,UAAU;;;;;CCFjB,MAAM,KAAA,WAAA;CACN,MAAM,MAAA,YAAA;CACN,MAAM,KAAA,WAAA;CACN,MAAM,MAAA,YAAA;CACN,MAAM,KAAA,WAAA;CACN,MAAM,MAAA,YAAA;CAEN,MAAM,OAAO,GAAG,IAAI,GAAG,UAAU;EAC/B,QAAQ,IAAR;GACE,KAAK;IACH,IAAI,OAAO,MAAM,UACf,IAAI,EAAE;IAER,IAAI,OAAO,MAAM,UACf,IAAI,EAAE;IAER,OAAO,MAAM;GAEf,KAAK;IACH,IAAI,OAAO,MAAM,UACf,IAAI,EAAE;IAER,IAAI,OAAO,MAAM,UACf,IAAI,EAAE;IAER,OAAO,MAAM;GAEf,KAAK;GACL,KAAK;GACL,KAAK,MACH,OAAO,GAAG,GAAG,GAAG,KAAK;GAEvB,KAAK,MACH,OAAO,IAAI,GAAG,GAAG,KAAK;GAExB,KAAK,KACH,OAAO,GAAG,GAAG,GAAG,KAAK;GAEvB,KAAK,MACH,OAAO,IAAI,GAAG,GAAG,KAAK;GAExB,KAAK,KACH,OAAO,GAAG,GAAG,GAAG,KAAK;GAEvB,KAAK,MACH,OAAO,IAAI,GAAG,GAAG,KAAK;GAExB,SACE,MAAM,IAAI,UAAU,qBAAqB,IAAI;EACjD;CACF;CACA,OAAO,UAAU;;;;;CCnDjB,MAAM,SAAA,iBAAA;CACN,MAAM,QAAA,cAAA;CACN,MAAM,EAAE,QAAQ,IAAI,MAAA,WAAA;CAEpB,MAAM,UAAU,SAAS,YAAY;EACnC,IAAI,mBAAmB,QACrB,OAAO;EAGT,IAAI,OAAO,YAAY,UACrB,UAAU,OAAO,OAAO;EAG1B,IAAI,OAAO,YAAY,UACrB,OAAO;EAGT,UAAU,WAAW,CAAC;EAEtB,IAAI,QAAQ;EACZ,IAAI,CAAC,QAAQ,KACX,QAAQ,QAAQ,MAAM,QAAQ,oBAAoB,GAAG,EAAE,cAAc,GAAG,EAAE,OAAO;OAC5E;GAUL,MAAM,iBAAiB,QAAQ,oBAAoB,GAAG,EAAE,iBAAiB,GAAG,EAAE;GAC9E,IAAI;GACJ,QAAQ,OAAO,eAAe,KAAK,OAAO,OACrC,CAAC,SAAS,MAAM,QAAQ,MAAM,EAAE,CAAC,WAAW,QAAQ,SACvD;IACA,IAAI,CAAC,SACC,KAAK,QAAQ,KAAK,EAAE,CAAC,WAAW,MAAM,QAAQ,MAAM,EAAE,CAAC,QAC3D,QAAQ;IAEV,eAAe,YAAY,KAAK,QAAQ,KAAK,EAAE,CAAC,SAAS,KAAK,EAAE,CAAC;GACnE;GAEA,eAAe,YAAY;EAC7B;EAEA,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,MAAM;EAMpB,OAAO,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,OAAO;CACzE;CACA,OAAO,UAAU;;;;;CC3DjB,MAAM,QAAA,cAAA;CACN,MAAM,YAAA,kBAAA;CACN,MAAM,SAAA,iBAAA;CAEN,MAAM,YAAY,SAAS,YAAY,YAAY;EACjD,IAAI,CAAC,UAAU,cAAc,SAAS,UAAU,GAC9C,OAAO;EAGT,MAAM,gBAAgB,kBAAkB,SAAS,OAAO;EACxD,OAAO,iBAAiB,aAAa,eAAe,UAAU;CAChE;CAEA,MAAM,qBAAqB,SAAS,YAAY;EAK9C,OAAO,MAHL,mBAAmB,SAAS,QAAQ,UAAU,SAGb,OAAO;CAC5C;CAEA,MAAM,gBAAgB,SAAS,eAAe;EAC5C,IAAI,aAAa,UAAU,GACzB,OAAO,QAAQ;EAGjB,QAAQ,aAAa,CAAC;EAEtB,QAAQ,YAAR;GACE,KAAK;IACH,QAAQ,QAAQ;IAChB,QAAQ,QAAQ;IAChB;GACF,KAAK;IACH,QAAQ,QAAQ;IAChB;EACJ;EAEA,OAAO,QAAQ,OAAO;CACxB;CAEA,MAAM,gBAAgB,SAAS;EAC7B,OAAO,KAAK,WAAW,KAAK;CAC9B;CAEA,OAAO,UAAU;;;;;CC7CjB,IAAM,WAAN,MAAe;EACb,cAAe;GACb,KAAK,MAAM;GACX,KAAK,sBAAM,IAAI,IAAI;EACrB;EAEA,IAAK,KAAK;GACR,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;GAC9B,IAAI,UAAU,KAAA,GACZ;QACK;IAEL,KAAK,IAAI,OAAO,GAAG;IACnB,KAAK,IAAI,IAAI,KAAK,KAAK;IACvB,OAAO;GACT;EACF;EAEA,OAAQ,KAAK;GACX,OAAO,KAAK,IAAI,OAAO,GAAG;EAC5B;EAEA,IAAK,KAAK,OAAO;GAGf,IAAI,CAFY,KAAK,OAAO,GAEjB,KAAK,UAAU,KAAA,GAAW;IAEnC,IAAI,KAAK,IAAI,QAAQ,KAAK,KAAK;KAC7B,MAAM,WAAW,KAAK,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;KACxC,KAAK,OAAO,QAAQ;IACtB;IAEA,KAAK,IAAI,IAAI,KAAK,KAAK;GACzB;GAEA,OAAO;EACT;CACF;CAEA,OAAO,UAAU;;;;;CCvCjB,MAAM,mBAAmB;CAuNzB,OAAO,UAAU,MApNX,MAAM;EACV,YAAa,OAAO,SAAS;GAC3B,UAAU,aAAa,OAAO;GAE9B,IAAI,iBAAiB,OACnB,IACE,MAAM,UAAU,CAAC,CAAC,QAAQ,SAC1B,MAAM,sBAAsB,CAAC,CAAC,QAAQ,mBAEtC,OAAO;QAEP,OAAO,IAAI,MAAM,MAAM,KAAK,OAAO;GAIvC,IAAI,iBAAiB,YAAY;IAE/B,KAAK,MAAM,MAAM;IACjB,KAAK,MAAM,CAAC,CAAC,KAAK,CAAC;IACnB,KAAK,YAAY,KAAA;IACjB,OAAO;GACT;GAEA,KAAK,UAAU;GACf,KAAK,QAAQ,CAAC,CAAC,QAAQ;GACvB,KAAK,oBAAoB,CAAC,CAAC,QAAQ;GAKnC,KAAK,MAAM,MAAM,KAAK,CAAC,CAAC,QAAQ,kBAAkB,GAAG;GAGrD,KAAK,MAAM,KAAK,IACb,MAAM,IAAI,CAAC,CAEX,KAAI,MAAK,KAAK,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAInC,QAAO,MAAK,EAAE,MAAM;GAEvB,IAAI,CAAC,KAAK,IAAI,QACZ,MAAM,IAAI,UAAU,yBAAyB,KAAK,KAAK;GAIzD,IAAI,KAAK,IAAI,SAAS,GAAG;IAEvB,MAAM,QAAQ,KAAK,IAAI;IACvB,KAAK,MAAM,KAAK,IAAI,QAAO,MAAK,CAAC,UAAU,EAAE,EAAE,CAAC;IAChD,IAAI,KAAK,IAAI,WAAW,GACtB,KAAK,MAAM,CAAC,KAAK;SACZ,IAAI,KAAK,IAAI,SAAS;UAEtB,MAAM,KAAK,KAAK,KACnB,IAAI,EAAE,WAAW,KAAK,MAAM,EAAE,EAAE,GAAG;MACjC,KAAK,MAAM,CAAC,CAAC;MACb;KACF;;GAGN;GAEA,KAAK,YAAY,KAAA;EACnB;EAEA,IAAI,QAAS;GACX,IAAI,KAAK,cAAc,KAAA,GAAW;IAChC,KAAK,YAAY;IACjB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;KACxC,IAAI,IAAI,GACN,KAAK,aAAa;KAEpB,MAAM,QAAQ,KAAK,IAAI;KACvB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;MACrC,IAAI,IAAI,GACN,KAAK,aAAa;MAEpB,KAAK,aAAa,MAAM,EAAE,CAAC,SAAS,CAAC,CAAC,KAAK;KAC7C;IACF;GACF;GACA,OAAO,KAAK;EACd;EAEA,SAAU;GACR,OAAO,KAAK;EACd;EAEA,WAAY;GACV,OAAO,KAAK;EACd;EAEA,WAAY,OAAO;GAEjB,QAAQ,MAAM,QAAQ,cAAc,EAAE;GAOtC,MAAM,YAFH,KAAK,QAAQ,qBAAqB,4BAClC,KAAK,QAAQ,SAAS,eACE,MAAM;GACjC,MAAM,SAAS,MAAM,IAAI,OAAO;GAChC,IAAI,QACF,OAAO;GAGT,MAAM,QAAQ,KAAK,QAAQ;GAE3B,MAAM,KAAK,QAAQ,GAAG,EAAE,oBAAoB,GAAG,EAAE;GACjD,QAAQ,MAAM,QAAQ,IAAI,cAAc,KAAK,QAAQ,iBAAiB,CAAC;GACvE,MAAM,kBAAkB,KAAK;GAG7B,QAAQ,MAAM,QAAQ,GAAG,EAAE,iBAAiB,qBAAqB;GACjE,MAAM,mBAAmB,KAAK;GAG9B,QAAQ,MAAM,QAAQ,GAAG,EAAE,YAAY,gBAAgB;GACvD,MAAM,cAAc,KAAK;GAGzB,QAAQ,MAAM,QAAQ,GAAG,EAAE,YAAY,gBAAgB;GACvD,MAAM,cAAc,KAAK;GAKzB,IAAI,YAAY,MACb,MAAM,GAAG,CAAC,CACV,KAAI,SAAQ,gBAAgB,MAAM,KAAK,OAAO,CAAC,CAAC,CAChD,KAAK,GAAG,CAAC,CACT,MAAM,KAAK,CAAC,CAEZ,KAAI,SAAQ,YAAY,MAAM,KAAK,OAAO,CAAC;GAE9C,IAAI,OAEF,YAAY,UAAU,QAAO,SAAQ;IACnC,MAAM,wBAAwB,MAAM,KAAK,OAAO;IAChD,OAAO,CAAC,CAAC,KAAK,MAAM,GAAG,EAAE,gBAAgB;GAC3C,CAAC;GAEH,MAAM,cAAc,SAAS;GAK7B,MAAM,2BAAW,IAAI,IAAI;GACzB,MAAM,cAAc,UAAU,KAAI,SAAQ,IAAI,WAAW,MAAM,KAAK,OAAO,CAAC;GAC5E,KAAK,MAAM,QAAQ,aAAa;IAC9B,IAAI,UAAU,IAAI,GAChB,OAAO,CAAC,IAAI;IAEd,SAAS,IAAI,KAAK,OAAO,IAAI;GAC/B;GACA,IAAI,SAAS,OAAO,KAAK,SAAS,IAAI,EAAE,GACtC,SAAS,OAAO,EAAE;GAGpB,MAAM,SAAS,CAAC,GAAG,SAAS,OAAO,CAAC;GACpC,MAAM,IAAI,SAAS,MAAM;GACzB,OAAO;EACT;EAEA,WAAY,OAAO,SAAS;GAC1B,IAAI,EAAE,iBAAiB,QACrB,MAAM,IAAI,UAAU,qBAAqB;GAG3C,OAAO,KAAK,IAAI,MAAM,oBAAoB;IACxC,OACE,cAAc,iBAAiB,OAAO,KACtC,MAAM,IAAI,MAAM,qBAAqB;KACnC,OACE,cAAc,kBAAkB,OAAO,KACvC,gBAAgB,OAAO,mBAAmB;MACxC,OAAO,iBAAiB,OAAO,oBAAoB;OACjD,OAAO,eAAe,WAAW,iBAAiB,OAAO;MAC3D,CAAC;KACH,CAAC;IAEL,CAAC;GAEL,CAAC;EACH;EAGA,KAAM,SAAS;GACb,IAAI,CAAC,SACH,OAAO;GAGT,IAAI,OAAO,YAAY,UACrB,IAAI;IACF,UAAU,IAAI,OAAO,SAAS,KAAK,OAAO;GAC5C,SAAS,IAAI;IACX,OAAO;GACT;GAGF,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KACnC,IAAI,QAAQ,KAAK,IAAI,IAAI,SAAS,KAAK,OAAO,GAC5C,OAAO;GAGX,OAAO;EACT;CACF;CAKA,MAAM,QAAQ,KAAA,iBAAA,GAAQ;CAEtB,MAAM,eAAA,sBAAA;CACN,MAAM,aAAA,mBAAA;CACN,MAAM,QAAA,cAAA;CACN,MAAM,SAAA,iBAAA;CACN,MAAM,EACJ,QAAQ,IACR,KACA,GACA,uBACA,kBACA,qBAAA,WAAA;CAEF,MAAM,EAAE,yBAAyB,eAAA,kBAAA;CAGjC,MAAM,eAAe,IAAI,OAAO,IAAI,EAAE,QAAQ,GAAG;CAEjD,MAAM,aAAY,MAAK,EAAE,UAAU;CACnC,MAAM,SAAQ,MAAK,EAAE,UAAU;CAI/B,MAAM,iBAAiB,aAAa,YAAY;EAC9C,IAAI,SAAS;EACb,MAAM,uBAAuB,YAAY,MAAM;EAC/C,IAAI,iBAAiB,qBAAqB,IAAI;EAE9C,OAAO,UAAU,qBAAqB,QAAQ;GAC5C,SAAS,qBAAqB,OAAO,oBAAoB;IACvD,OAAO,eAAe,WAAW,iBAAiB,OAAO;GAC3D,CAAC;GAED,iBAAiB,qBAAqB,IAAI;EAC5C;EAEA,OAAO;CACT;CAKA,MAAM,mBAAmB,MAAM,YAAY;EACzC,OAAO,KAAK,QAAQ,GAAG,EAAE,QAAQ,EAAE;EACnC,MAAM,QAAQ,MAAM,OAAO;EAC3B,OAAO,cAAc,MAAM,OAAO;EAClC,MAAM,SAAS,IAAI;EACnB,OAAO,cAAc,MAAM,OAAO;EAClC,MAAM,UAAU,IAAI;EACpB,OAAO,eAAe,MAAM,OAAO;EACnC,MAAM,UAAU,IAAI;EACpB,OAAO,aAAa,MAAM,OAAO;EACjC,MAAM,SAAS,IAAI;EACnB,OAAO;CACT;CAEA,MAAM,OAAM,OAAM,CAAC,MAAM,GAAG,YAAY,MAAM,OAAO,OAAO;CAE5D,MAAM,sBAAsB,GAAG,GAAG,MAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAChB,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC;CAUxB,MAAM,iBAAiB,MAAM,YAAY;EACvC,OAAO,KACJ,KAAK,CAAC,CACN,MAAM,KAAK,CAAC,CACZ,KAAK,MAAM,aAAa,GAAG,OAAO,CAAC,CAAC,CACpC,KAAK,GAAG;CACb;CAEA,MAAM,gBAAgB,MAAM,YAAY;EACtC,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,cAAc,GAAG,EAAE;EAClD,OAAO,KAAK,QAAQ,IAAI,GAAG,GAAG,GAAG,GAAG,OAAO;GACzC,MAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,EAAE;GACnC,IAAI;GAEJ,IAAI,IAAI,CAAC,GACP,MAAM;QACD,IAAI,IAAI,CAAC,GACd,MAAM,KAAK,EAAE,QAAQ,CAAC,IAAI,EAAE;QACvB,IAAI,IAAI,CAAC,GAEd,MAAM,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE;QAC/B,IAAI,IAAI;IACb,MAAM,mBAAmB,EAAE;IAC3B,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;GACnB,OAEE,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;GAGnB,MAAM,gBAAgB,GAAG;GACzB,OAAO;EACT,CAAC;CACH;CAUA,MAAM,iBAAiB,MAAM,YAAY;EACvC,OAAO,KACJ,KAAK,CAAC,CACN,MAAM,KAAK,CAAC,CACZ,KAAK,MAAM,aAAa,GAAG,OAAO,CAAC,CAAC,CACpC,KAAK,GAAG;CACb;CAEA,MAAM,gBAAgB,MAAM,YAAY;EACtC,MAAM,SAAS,MAAM,OAAO;EAC5B,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,cAAc,GAAG,EAAE;EAClD,MAAM,IAAI,QAAQ,oBAAoB,OAAO;EAC7C,OAAO,KAAK,QAAQ,IAAI,GAAG,GAAG,GAAG,GAAG,OAAO;GACzC,MAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,EAAE;GACnC,IAAI;GAEJ,IAAI,IAAI,CAAC,GACP,MAAM;QACD,IAAI,IAAI,CAAC,GACd,MAAM,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE;QAC3B,IAAI,IAAI,CAAC,GACd,IAAI,MAAM,KACR,MAAM,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;QAExC,MAAM,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE;QAEhC,IAAI,IAAI;IACb,MAAM,mBAAmB,EAAE;IAC3B,IAAI,MAAM,KACR,IAAI,MAAM,KACR,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE;SAEtB,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;SAGnB,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,CAAC,IAAI,EAAE;GAEhB,OAAO;IACL,MAAM,OAAO;IACb,IAAI,MAAM,KACR,IAAI,MAAM,KACR,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE;SAEtB,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;SAGnB,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,CAAC,IAAI,EAAE;GAEhB;GAEA,MAAM,gBAAgB,GAAG;GACzB,OAAO;EACT,CAAC;CACH;CAEA,MAAM,kBAAkB,MAAM,YAAY;EACxC,MAAM,kBAAkB,MAAM,OAAO;EACrC,OAAO,KACJ,MAAM,KAAK,CAAC,CACZ,KAAK,MAAM,cAAc,GAAG,OAAO,CAAC,CAAC,CACrC,KAAK,GAAG;CACb;CAEA,MAAM,iBAAiB,MAAM,YAAY;EACvC,OAAO,KAAK,KAAK;EACjB,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,eAAe,GAAG,EAAE;EACnD,OAAO,KAAK,QAAQ,IAAI,KAAK,MAAM,GAAG,GAAG,GAAG,OAAO;GACjD,MAAM,UAAU,MAAM,KAAK,MAAM,GAAG,GAAG,GAAG,EAAE;GAC5C,IAAI,mBAAmB,GAAG,GAAG,CAAC,GAC5B,OAAO;GAGT,MAAM,KAAK,IAAI,CAAC;GAChB,MAAM,KAAK,MAAM,IAAI,CAAC;GACtB,MAAM,KAAK,MAAM,IAAI,CAAC;GACtB,MAAM,OAAO;GAEb,IAAI,SAAS,OAAO,MAClB,OAAO;GAKT,KAAK,QAAQ,oBAAoB,OAAO;GAExC,IAAI,IACF,IAAI,SAAS,OAAO,SAAS,KAE3B,MAAM;QAGN,MAAM;QAEH,IAAI,QAAQ,MAAM;IAGvB,IAAI,IACF,IAAI;IAEN,IAAI;IAEJ,IAAI,SAAS,KAAK;KAGhB,OAAO;KACP,IAAI,IAAI;MACN,IAAI,CAAC,IAAI;MACT,IAAI;MACJ,IAAI;KACN,OAAO;MACL,IAAI,CAAC,IAAI;MACT,IAAI;KACN;IACF,OAAO,IAAI,SAAS,MAAM;KAGxB,OAAO;KACP,IAAI,IACF,IAAI,CAAC,IAAI;UAET,IAAI,CAAC,IAAI;IAEb;IAEA,IAAI,SAAS,KACX,KAAK;IAGP,MAAM,GAAG,OAAO,EAAE,GAAG,EAAE,GAAG,IAAI;GAChC,OAAO,IAAI,IACT,MAAM,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE;QAC5B,IAAI,IACT,MAAM,KAAK,EAAE,GAAG,EAAE,IAAI,GACrB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;GAGnB,MAAM,iBAAiB,GAAG;GAE1B,OAAO;EACT,CAAC;CACH;CAIA,MAAM,gBAAgB,MAAM,YAAY;EACtC,MAAM,gBAAgB,MAAM,OAAO;EAEnC,OAAO,KACJ,KAAK,CAAC,CACN,QAAQ,GAAG,EAAE,OAAO,EAAE;CAC3B;CAEA,MAAM,eAAe,MAAM,YAAY;EACrC,MAAM,eAAe,MAAM,OAAO;EAClC,OAAO,KACJ,KAAK,CAAC,CACN,QAAQ,GAAG,QAAQ,oBAAoB,EAAE,UAAU,EAAE,OAAO,EAAE;CACnE;CAQA,MAAM,iBAAgB,WAAU,IAC9B,MAAM,IAAI,IAAI,IAAI,KAAK,IACvB,IAAI,IAAI,IAAI,IAAI,QAAQ;EACxB,IAAI,IAAI,EAAE,GACR,OAAO;OACF,IAAI,IAAI,EAAE,GACf,OAAO,KAAK,GAAG,MAAM,QAAQ,OAAO;OAC/B,IAAI,IAAI,EAAE,GACf,OAAO,KAAK,GAAG,GAAG,GAAG,IAAI,QAAQ,OAAO;OACnC,IAAI,KACT,OAAO,KAAK;OAEZ,OAAO,KAAK,OAAO,QAAQ,OAAO;EAGpC,IAAI,IAAI,EAAE,GACR,KAAK;OACA,IAAI,IAAI,EAAE,GACf,KAAK,IAAI,CAAC,KAAK,EAAE;OACZ,IAAI,IAAI,EAAE,GACf,KAAK,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE;OAClB,IAAI,KACT,KAAK,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;OACvB,IAAI,OACT,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE;OAE7B,KAAK,KAAK;EAGZ,OAAO,GAAG,KAAK,GAAG,KAAK,KAAK;CAC9B;CAEA,MAAM,WAAW,KAAK,SAAS,YAAY;EACzC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAC9B,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GACtB,OAAO;EAIX,IAAI,QAAQ,WAAW,UAAU,CAAC,QAAQ,mBAAmB;GAM3D,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;IACnC,MAAM,IAAI,EAAE,CAAC,MAAM;IACnB,IAAI,IAAI,EAAE,CAAC,WAAW,WAAW,KAC/B;IAGF,IAAI,IAAI,EAAE,CAAC,OAAO,WAAW,SAAS,GAAG;KACvC,MAAM,UAAU,IAAI,EAAE,CAAC;KACvB,IAAI,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,OAC5B,OAAO;IAEX;GACF;GAGA,OAAO;EACT;EAEA,OAAO;CACT;;;;;CC1jBA,MAAM,MAAM,OAAO,YAAY;CAqI/B,OAAO,UAAU,MAnIX,WAAW;EACf,WAAW,MAAO;GAChB,OAAO;EACT;EAEA,YAAa,MAAM,SAAS;GAC1B,UAAU,aAAa,OAAO;GAE9B,IAAI,gBAAgB,YAClB,IAAI,KAAK,UAAU,CAAC,CAAC,QAAQ,OAC3B,OAAO;QAEP,OAAO,KAAK;GAIhB,OAAO,KAAK,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,KAAK,GAAG;GACxC,MAAM,cAAc,MAAM,OAAO;GACjC,KAAK,UAAU;GACf,KAAK,QAAQ,CAAC,CAAC,QAAQ;GACvB,KAAK,MAAM,IAAI;GAEf,IAAI,KAAK,WAAW,KAClB,KAAK,QAAQ;QAEb,KAAK,QAAQ,KAAK,WAAW,KAAK,OAAO;GAG3C,MAAM,QAAQ,IAAI;EACpB;EAEA,MAAO,MAAM;GACX,MAAM,IAAI,KAAK,QAAQ,QAAQ,GAAG,EAAE,mBAAmB,GAAG,EAAE;GAC5D,MAAM,IAAI,KAAK,MAAM,CAAC;GAEtB,IAAI,CAAC,GACH,MAAM,IAAI,UAAU,uBAAuB,MAAM;GAGnD,KAAK,WAAW,EAAE,OAAO,KAAA,IAAY,EAAE,KAAK;GAC5C,IAAI,KAAK,aAAa,KACpB,KAAK,WAAW;GAIlB,IAAI,CAAC,EAAE,IACL,KAAK,SAAS;QAEd,KAAK,SAAS,IAAI,OAAO,EAAE,IAAI,KAAK,QAAQ,KAAK;EAErD;EAEA,WAAY;GACV,OAAO,KAAK;EACd;EAEA,KAAM,SAAS;GACb,MAAM,mBAAmB,SAAS,KAAK,QAAQ,KAAK;GAEpD,IAAI,KAAK,WAAW,OAAO,YAAY,KACrC,OAAO;GAGT,IAAI,OAAO,YAAY,UACrB,IAAI;IACF,UAAU,IAAI,OAAO,SAAS,KAAK,OAAO;GAC5C,SAAS,IAAI;IACX,OAAO;GACT;GAGF,OAAO,IAAI,SAAS,KAAK,UAAU,KAAK,QAAQ,KAAK,OAAO;EAC9D;EAEA,WAAY,MAAM,SAAS;GACzB,IAAI,EAAE,gBAAgB,aACpB,MAAM,IAAI,UAAU,0BAA0B;GAGhD,IAAI,KAAK,aAAa,IAAI;IACxB,IAAI,KAAK,UAAU,IACjB,OAAO;IAET,OAAO,IAAI,MAAM,KAAK,OAAO,OAAO,CAAC,CAAC,KAAK,KAAK,KAAK;GACvD,OAAO,IAAI,KAAK,aAAa,IAAI;IAC/B,IAAI,KAAK,UAAU,IACjB,OAAO;IAET,OAAO,IAAI,MAAM,KAAK,OAAO,OAAO,CAAC,CAAC,KAAK,KAAK,MAAM;GACxD;GAEA,UAAU,aAAa,OAAO;GAG9B,IAAI,QAAQ,sBACT,KAAK,UAAU,cAAc,KAAK,UAAU,aAC7C,OAAO;GAET,IAAI,CAAC,QAAQ,sBACV,KAAK,MAAM,WAAW,QAAQ,KAAK,KAAK,MAAM,WAAW,QAAQ,IAClE,OAAO;GAIT,IAAI,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAC/D,OAAO;GAGT,IAAI,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAC/D,OAAO;GAGT,IACG,KAAK,OAAO,YAAY,KAAK,OAAO,WACrC,KAAK,SAAS,SAAS,GAAG,KAAK,KAAK,SAAS,SAAS,GAAG,GACzD,OAAO;GAGT,IAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,OAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAC7D,OAAO;GAGT,IAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,OAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAC7D,OAAO;GAET,OAAO;EACT;CACF;CAIA,MAAM,eAAA,sBAAA;CACN,MAAM,EAAE,QAAQ,IAAI,MAAA,WAAA;CACpB,MAAM,MAAA,YAAA;CACN,MAAM,QAAA,cAAA;CACN,MAAM,SAAA,iBAAA;CACN,MAAM,QAAA,cAAA;;;;;CC5IN,MAAM,QAAA,cAAA;CACN,MAAM,aAAa,SAAS,OAAO,YAAY;EAC7C,IAAI;GACF,QAAQ,IAAI,MAAM,OAAO,OAAO;EAClC,SAAS,IAAI;GACX,OAAO;EACT;EACA,OAAO,MAAM,KAAK,OAAO;CAC3B;CACA,OAAO,UAAU;;;;;CCTjB,MAAM,QAAA,cAAA;CAGN,MAAM,iBAAiB,OAAO,YAC5B,IAAI,MAAM,OAAO,OAAO,CAAC,CAAC,IACvB,KAAI,SAAQ,KAAK,KAAI,MAAK,EAAE,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC;CAEnE,OAAO,UAAU;;;;;CCPjB,MAAM,SAAA,iBAAA;CACN,MAAM,QAAA,cAAA;CAEN,MAAM,iBAAiB,UAAU,OAAO,YAAY;EAClD,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,IAAI,WAAW;EACf,IAAI;GACF,WAAW,IAAI,MAAM,OAAO,OAAO;EACrC,SAAS,IAAI;GACX,OAAO;EACT;EACA,SAAS,SAAS,MAAM;GACtB,IAAI,SAAS,KAAK,CAAC;QAEb,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,IAAI;KAEnC,MAAM;KACN,QAAQ,IAAI,OAAO,KAAK,OAAO;IACjC;;EAEJ,CAAC;EACD,OAAO;CACT;CACA,OAAO,UAAU;;;;;CCxBjB,MAAM,SAAA,iBAAA;CACN,MAAM,QAAA,cAAA;CACN,MAAM,iBAAiB,UAAU,OAAO,YAAY;EAClD,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,IAAI,WAAW;EACf,IAAI;GACF,WAAW,IAAI,MAAM,OAAO,OAAO;EACrC,SAAS,IAAI;GACX,OAAO;EACT;EACA,SAAS,SAAS,MAAM;GACtB,IAAI,SAAS,KAAK,CAAC;QAEb,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,GAAG;KAElC,MAAM;KACN,QAAQ,IAAI,OAAO,KAAK,OAAO;IACjC;;EAEJ,CAAC;EACD,OAAO;CACT;CACA,OAAO,UAAU;;;;;CCvBjB,MAAM,SAAA,iBAAA;CACN,MAAM,QAAA,cAAA;CACN,MAAM,KAAA,WAAA;CAEN,MAAM,cAAc,OAAO,UAAU;EACnC,QAAQ,IAAI,MAAM,OAAO,KAAK;EAE9B,IAAI,SAAS,IAAI,OAAO,OAAO;EAC/B,IAAI,MAAM,KAAK,MAAM,GACnB,OAAO;EAGT,SAAS,IAAI,OAAO,SAAS;EAC7B,IAAI,MAAM,KAAK,MAAM,GACnB,OAAO;EAGT,SAAS;EACT,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;GACzC,MAAM,cAAc,MAAM,IAAI;GAE9B,IAAI,SAAS;GACb,YAAY,SAAS,eAAe;IAElC,MAAM,UAAU,IAAI,OAAO,WAAW,OAAO,OAAO;IACpD,QAAQ,WAAW,UAAnB;KACE,KAAK;MACH,IAAI,QAAQ,WAAW,WAAW,GAChC,QAAQ;WAER,QAAQ,WAAW,KAAK,CAAC;MAE3B,QAAQ,MAAM,QAAQ,OAAO;KAE/B,KAAK;KACL,KAAK;MACH,IAAI,CAAC,UAAU,GAAG,SAAS,MAAM,GAC/B,SAAS;MAEX;KACF,KAAK;KACL,KAAK,MAEH;;KAEF,SACE,MAAM,IAAI,MAAM,yBAAyB,WAAW,UAAU;IAClE;GACF,CAAC;GACD,IAAI,WAAW,CAAC,UAAU,GAAG,QAAQ,MAAM,IACzC,SAAS;EAEb;EAEA,IAAI,UAAU,MAAM,KAAK,MAAM,GAC7B,OAAO;EAGT,OAAO;CACT;CACA,OAAO,UAAU;;;;;CC5DjB,MAAM,QAAA,cAAA;CACN,MAAM,cAAc,OAAO,YAAY;EACrC,IAAI;GAGF,OAAO,IAAI,MAAM,OAAO,OAAO,CAAC,CAAC,SAAS;EAC5C,SAAS,IAAI;GACX,OAAO;EACT;CACF;CACA,OAAO,UAAU;;;;;CCVjB,MAAM,SAAA,iBAAA;CACN,MAAM,aAAA,mBAAA;CACN,MAAM,EAAE,QAAQ;CAChB,MAAM,QAAA,cAAA;CACN,MAAM,YAAA,kBAAA;CACN,MAAM,KAAA,WAAA;CACN,MAAM,KAAA,WAAA;CACN,MAAM,MAAA,YAAA;CACN,MAAM,MAAA,YAAA;CAEN,MAAM,WAAW,SAAS,OAAO,MAAM,YAAY;EACjD,UAAU,IAAI,OAAO,SAAS,OAAO;EACrC,QAAQ,IAAI,MAAM,OAAO,OAAO;EAEhC,IAAI,MAAM,OAAO,MAAM,MAAM;EAC7B,QAAQ,MAAR;GACE,KAAK;IACH,OAAO;IACP,QAAQ;IACR,OAAO;IACP,OAAO;IACP,QAAQ;IACR;GACF,KAAK;IACH,OAAO;IACP,QAAQ;IACR,OAAO;IACP,OAAO;IACP,QAAQ;IACR;GACF,SACE,MAAM,IAAI,UAAU,2CAAuC;EAC/D;EAGA,IAAI,UAAU,SAAS,OAAO,OAAO,GACnC,OAAO;EAMT,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;GACzC,MAAM,cAAc,MAAM,IAAI;GAE9B,IAAI,OAAO;GACX,IAAI,MAAM;GAEV,YAAY,SAAS,eAAe;IAClC,IAAI,WAAW,WAAW,KACxB,aAAa,IAAI,WAAW,SAAS;IAEvC,OAAO,QAAQ;IACf,MAAM,OAAO;IACb,IAAI,KAAK,WAAW,QAAQ,KAAK,QAAQ,OAAO,GAC9C,OAAO;SACF,IAAI,KAAK,WAAW,QAAQ,IAAI,QAAQ,OAAO,GACpD,MAAM;GAEV,CAAC;GAID,IAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,OAC9C,OAAO;GAKT,KAAK,CAAC,IAAI,YAAY,IAAI,aAAa,SACnC,MAAM,SAAS,IAAI,MAAM,GAC3B,OAAO;QACF,IAAI,IAAI,aAAa,SAAS,KAAK,SAAS,IAAI,MAAM,GAC3D,OAAO;EAEX;EACA,OAAO;CACT;CAEA,OAAO,UAAU;;;;;CC9EjB,MAAM,UAAA,gBAAA;CACN,MAAM,OAAO,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,OAAO;CAC7E,OAAO,UAAU;;;;;CCHjB,MAAM,UAAA,gBAAA;CAEN,MAAM,OAAO,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,OAAO;CAC7E,OAAO,UAAU;;;;;CCHjB,MAAM,QAAA,cAAA;CACN,MAAM,cAAc,IAAI,IAAI,YAAY;EACtC,KAAK,IAAI,MAAM,IAAI,OAAO;EAC1B,KAAK,IAAI,MAAM,IAAI,OAAO;EAC1B,OAAO,GAAG,WAAW,IAAI,OAAO;CAClC;CACA,OAAO,UAAU;;;;;CCHjB,MAAM,YAAA,kBAAA;CACN,MAAM,UAAA,gBAAA;CACN,OAAO,WAAW,UAAU,OAAO,YAAY;EAC7C,MAAM,MAAM,CAAC;EACb,IAAI,QAAQ;EACZ,IAAI,OAAO;EACX,MAAM,IAAI,SAAS,MAAM,GAAG,MAAM,QAAQ,GAAG,GAAG,OAAO,CAAC;EACxD,KAAK,MAAM,WAAW,GAEpB,IADiB,UAAU,SAAS,OAAO,OAChC,GAAG;GACZ,OAAO;GACP,IAAI,CAAC,OACH,QAAQ;EAEZ,OAAO;GACL,IAAI,MACF,IAAI,KAAK,CAAC,OAAO,IAAI,CAAC;GAExB,OAAO;GACP,QAAQ;EACV;EAEF,IAAI,OACF,IAAI,KAAK,CAAC,OAAO,IAAI,CAAC;EAGxB,MAAM,SAAS,CAAC;EAChB,KAAK,MAAM,CAAC,KAAK,QAAQ,KACvB,IAAI,QAAQ,KACV,OAAO,KAAK,GAAG;OACV,IAAI,CAAC,OAAO,QAAQ,EAAE,IAC3B,OAAO,KAAK,GAAG;OACV,IAAI,CAAC,KACV,OAAO,KAAK,KAAK,KAAK;OACjB,IAAI,QAAQ,EAAE,IACnB,OAAO,KAAK,KAAK,KAAK;OAEtB,OAAO,KAAK,GAAG,IAAI,KAAK,KAAK;EAGjC,MAAM,aAAa,OAAO,KAAK,MAAM;EACrC,MAAM,WAAW,OAAO,MAAM,QAAQ,WAAW,MAAM,MAAM,OAAO,KAAK;EACzE,OAAO,WAAW,SAAS,SAAS,SAAS,aAAa;CAC5D;;;;;CC9CA,MAAM,QAAA,cAAA;CACN,MAAM,aAAA,mBAAA;CACN,MAAM,EAAE,QAAQ;CAChB,MAAM,YAAA,kBAAA;CACN,MAAM,UAAA,gBAAA;CAsCN,MAAM,UAAU,KAAK,KAAK,UAAU,CAAC,MAAM;EACzC,IAAI,QAAQ,KACV,OAAO;EAGT,MAAM,IAAI,MAAM,KAAK,OAAO;EAC5B,MAAM,IAAI,MAAM,KAAK,OAAO;EAC5B,IAAI,aAAa;EAEjB,OAAO,KAAK,MAAM,aAAa,IAAI,KAAK;GACtC,KAAK,MAAM,aAAa,IAAI,KAAK;IAC/B,MAAM,QAAQ,aAAa,WAAW,WAAW,OAAO;IACxD,aAAa,cAAc,UAAU;IACrC,IAAI,OACF,SAAS;GAEb;GAKA,IAAI,YACF,OAAO;EAEX;EACA,OAAO;CACT;CAEA,MAAM,+BAA+B,CAAC,IAAI,WAAW,WAAW,CAAC;CACjE,MAAM,iBAAiB,CAAC,IAAI,WAAW,SAAS,CAAC;CAEjD,MAAM,gBAAgB,KAAK,KAAK,YAAY;EAC1C,IAAI,QAAQ,KACV,OAAO;EAGT,IAAI,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC,WAAW,KACxC,IAAI,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC,WAAW,KACxC,OAAO;OACF,IAAI,QAAQ,mBACjB,MAAM;OAEN,MAAM;EAIV,IAAI,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC,WAAW,KACxC,IAAI,QAAQ,mBACV,OAAO;OAEP,MAAM;EAIV,MAAM,wBAAQ,IAAI,IAAI;EACtB,IAAI,IAAI;EACR,KAAK,MAAM,KAAK,KACd,IAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MACvC,KAAK,SAAS,IAAI,GAAG,OAAO;OACvB,IAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAC9C,KAAK,QAAQ,IAAI,GAAG,OAAO;OAE3B,MAAM,IAAI,EAAE,MAAM;EAItB,IAAI,MAAM,OAAO,GACf,OAAO;EAGT,IAAI;EACJ,IAAI,MAAM,IAAI;GACZ,WAAW,QAAQ,GAAG,QAAQ,GAAG,QAAQ,OAAO;GAChD,IAAI,WAAW,GACb,OAAO;QACF,IAAI,aAAa,MAAM,GAAG,aAAa,QAAQ,GAAG,aAAa,OACpE,OAAO;EAEX;EAGA,KAAK,MAAM,MAAM,OAAO;GACtB,IAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAC1C,OAAO;GAGT,IAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAC1C,OAAO;GAGT,KAAK,MAAM,KAAK,KACd,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,OAAO,GACnC,OAAO;GAIX,OAAO;EACT;EAEA,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;EAE5C,IAAI,gBAAgB,aAAa,WAAW,WAAW,KACnD,GAAG,aAAa,OAAO,aAAa,WAAW,OAAO,GACxD,eAAe;EAGjB,KAAK,MAAM,KAAK,KAAK;GACnB,WAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;GAC5D,WAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;GAC5D,IAAI,IAAI;IACN,IAAI;SACE,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAClC,eAAe;IAAA;IAGnB,IAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;KAC7C,SAAS,SAAS,IAAI,GAAG,OAAO;KAChC,IAAI,WAAW,KAAK,WAAW,IAC7B,OAAO;IAEX,OAAO,IAAI,GAAG,aAAa,QAAQ,CAAC,EAAE,KAAK,GAAG,MAAM,GAClD,OAAO;GAEX;GACA,IAAI,IAAI;IACN,IAAI;SACE,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAClC,eAAe;IAAA;IAGnB,IAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;KAC7C,QAAQ,QAAQ,IAAI,GAAG,OAAO;KAC9B,IAAI,UAAU,KAAK,UAAU,IAC3B,OAAO;IAEX,OAAO,IAAI,GAAG,aAAa,QAAQ,CAAC,EAAE,KAAK,GAAG,MAAM,GAClD,OAAO;GAEX;GACA,IAAI,CAAC,EAAE,aAAa,MAAM,OAAO,aAAa,GAC5C,OAAO;EAEX;EAKA,IAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GACxC,OAAO;EAGT,IAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GACxC,OAAO;EAMT,IAAI,gBAAgB,cAClB,OAAO;EAGT,OAAO;CACT;CAGA,MAAM,YAAY,GAAG,GAAG,YAAY;EAClC,IAAI,CAAC,GACH,OAAO;EAET,MAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;EAChD,OAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;CACN;CAGA,MAAM,WAAW,GAAG,GAAG,YAAY;EACjC,IAAI,CAAC,GACH,OAAO;EAET,MAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;EAChD,OAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;CACN;CAEA,OAAO,UAAU;;;;;CCrPjB,MAAM,aAAA,WAAA;CACN,MAAM,YAAA,kBAAA;CACN,MAAM,SAAA,iBAAA;CACN,MAAM,cAAA,oBAAA;CAuCN,OAAO,UAAU;EACf,OAvCI,cAuCJ;EACA,OAvCI,gBAuCJ;EACA,OAvCI,cAuCJ;EACA,KAvCI,YAuCJ;EACA,MAvCI,aAuCJ;EACA,OAvCI,cAuCJ;EACA,OAvCI,cAuCJ;EACA,OAvCI,cAuCJ;EACA,YAvCI,mBAuCJ;EACA,SAvCI,gBAuCJ;EACA,UAvCI,iBAuCJ;EACA,cAvCI,sBAuCJ;EACA,cAvCI,sBAuCJ;EACA,MAvCI,aAuCJ;EACA,OAvCI,cAuCJ;EACA,IAvCI,WAuCJ;EACA,IAvCI,WAuCJ;EACA,IAvCI,WAuCJ;EACA,KAvCI,YAuCJ;EACA,KAvCI,YAuCJ;EACA,KAvCI,YAuCJ;EACA,KAvCI,YAuCJ;EACA,QAvCI,eAuCJ;EACA,UAvCI,iBAuCJ;EACA,YAvCI,mBAuCJ;EACA,OAvCI,cAuCJ;EACA,WAvCI,kBAuCJ;EACA,eAvCI,uBAuCJ;EACA,eAvCI,uBAuCJ;EACA,eAvCI,uBAuCJ;EACA,YAvCI,oBAuCJ;EACA,YAvCI,cAuCJ;EACA,SAvCI,gBAuCJ;EACA,KAvCI,YAuCJ;EACA,KAvCI,YAuCJ;EACA,YAvCI,mBAuCJ;EACA,eAvCI,iBAuCJ;EACA,QAvCI,eAuCJ;EACA;EACA,IAAI,WAAW;EACf,KAAK,WAAW;EAChB,QAAQ,WAAW;EACnB,qBAAqB,UAAU;EAC/B,eAAe,UAAU;EACzB,oBAAoB,YAAY;EAChC,qBAAqB,YAAY;CACnC;;;ACtFA,MAAA,mBAAA,SAAA,aAAA;;;;;;;;AASA;AAEA,SAAA,iBAAA,aAAA;;;;;;AAMA;;;AClBA,MAAM,YAAY,UAAU,IAAI;;;;AAKhC,SAAgB,kBAA0B;CACxC,IAAI;EACF,MAAM,UAAU,SAAS,iCAAiC;GACxD,KAAK,QAAQ,IAAI;GACjB,UAAU;GACV,OAAO;IAAC;IAAU;IAAQ;GAAQ;EACpC,CAAC,CAAC,CAAC,KAAK;EAER,OAAO,WAAW,WAAW,OAAO,IAAI,UAAU;CACpD,QAAQ;EACN,OAAO;CACT;AACF;;;;;;AAOA,eAAsB,eAAkC;CACtD,IAAI;EACF,MAAM,EAAE,WAAW,MAAM,UACvB;GACE;GACA;GACA;GACA;GACA;GACA;EACF,CAAC,CAAC,KAAK,GAAG,GACV;GACE,KAAK,gBAAgB;GACrB,UAAU;EACZ,CACF;EAEA,MAAM,WAAW,OAAO,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,IAAI,KAAK,OAAO;EAE3E,IAAI,SAAS,WAAW,GACtB,MAAM,IAAI,MAAM;EAGlB,OAAO;CACT,QAAQ;EACN,MAAM,IAAI,MAAM,oDAAoD;CACtE;AACF;;;;;;ACrDA,MAAa,eACX,MACA,eAAe,YACN;CACT,MAAM,aAAa,OAAO,OAAO,IAAI,CAAC,CAAC;CACvC,IAAI,CAAC,YAAY;EACf,QAAQ,KAAK,oBAAoB;EACjC;CACF;CAEA,MAAM,WAAW,CAAC,cAAc,GAAG,OAAO,KAAK,UAAU,CAAC;CAC1D,MAAM,YAAwB,CAAC;CAE/B,OAAO,QAAQ,IAAI,CAAC,CAAC,SAAS,CAAC,aAAa,aAAa;EACvD,UAAU,KAAK,CAAC,aAAa,GAAG,OAAO,OAAO,OAAO,CAAC,CAAC;CACzD,CAAC;CAED,MAAM,mBAAmB,QAAwB;EAE/C,OAAO,IAAI,QAAQ,oBAAoB,EAAE,CAAC,CAAC;CAC7C;CAEA,MAAM,eAAe,SAAS,KAAK,SAAS,UAAU;EACpD,MAAM,eAAe,KAAK,IAAI,GAAG,UAAU,KAAK,QAAQ,gBAAgB,IAAI,UAAU,EAAE,CAAC,CAAC;EAC1F,OAAO,KAAK,IAAI,QAAQ,QAAQ,YAAY;CAC9C,CAAC;CAED,MAAM,gBAAgB,IAAI,OAAO,aAAa,KAAK,CAAC;CACpD,MAAM,iBAAiB,aAAa,MAAM,CAAC,CAAC,CAAC,KAAK,UAAU,IAAI,OAAO,QAAQ,CAAC,CAAC;CACjF,MAAM,eAAe,IAAI,cAAc,GAAG,eAAe,KAAK,GAAG,EAAE;CACnE,MAAM,eAAe,IAAI,cAAc,GAAG,eAAe,KAAK,GAAG,EAAE;CACnE,MAAM,eAAe,IAAI,cAAc,GAAG,eAAe,KAAK,GAAG,EAAE;CAEnE,MAAM,aAAa,UAAoB;EAOrC,OAAO,IANgB,MAAM,KAAK,MAAM,UAAU;GAGhD,MAAM,UAFQ,aAAa,SACN,gBAAgB,IACF;GACnC,OAAO,IAAI,OAAO,IAAI,OAAO,KAAK,IAAI,GAAG,OAAO,CAAC,EAAE;EACrD,CACwB,CAAC,CAAC,KAAK,GAAG,EAAE;CACtC;CAEA,QAAQ,KAAK,YAAY;CACzB,QAAQ,KAAK,UAAU,QAAQ,CAAC;CAChC,QAAQ,KAAK,YAAY;CACzB,UAAU,SAAS,QAAQ;EACzB,QAAQ,KAAK,UAAU,GAAG,CAAC;CAC7B,CAAC;CACD,QAAQ,KAAK,YAAY;AAC3B;;;;;;AChCA,SAAS,mBAAmB,kBAA0B,oBAAqC;CACzF,IAAI,CAAC,kBAAkB,OAAO;CAE9B,IAAIA,cAAAA,QAAO,MAAM,gBAAgB,KAAKA,cAAAA,QAAO,UAAU,kBAAkB,kBAAkB,GACzF,OAAO;CAGT,MAAM,eAAeA,cAAAA,QAAO,OAAO,gBAAgB;CACnD,OAAO,eAAeA,cAAAA,QAAO,UAAU,aAAa,SAAS,kBAAkB,IAAI;AACrF;;;;AAKA,SAAS,0BAA0B,aAAqB,aAA6B;CACnF,IAAI;EACF,MAAM,yBAAyB,KAAK,aAAa,gBAAgB,aAAa,cAAc;EAC5F,IAAI,CAAC,WAAW,sBAAsB,GAAG,OAAO;EAGhD,OADoB,KAAK,MAAM,aAAa,wBAAwB,MAAM,CACzD,CAAC,CAAC,WAAW;CAChC,QAAQ;EACN,OAAO;CACT;AACF;;;;AAKA,SAAS,uBAAuB,aAAoC;CAClE,MAAM,eAAe,QAAQ,WAAW;CACxC,MAAM,cAAc,gBAAgB;CAGpC,IAAI,WADoB,KAAK,cAAc,cACd,CAAC,GAC5B,OAAO;CAGT,IAAI,eAAe,iBAAiB,aAClC,OAAO;CAGT,MAAM,aAAa,QAAQ,YAAY;CACvC,IAAI,eAAe,cAEjB,OAAO;CAGT,OAAO,uBAAuB,UAAU;AAC1C;;;;AAKA,MAAa,uBAAuB,aAAqB,gBAAiC;CACxF,IAAI;EACF,MAAM,gBAAgB,iBAAiB,WAAW;EAClD,MAAM,sBAAsB,QAAQ,QAAQ,IAAI,GAAG,WAAW;EAE9D,MAAM,oBAAoB,WAAW,KAAK,qBAAqB,cAAc,CAAC,IAC1E,sBACA,uBAAuB,mBAAmB;EAE9C,IAAI,CAAC,mBAAmB;GACtB,QAAQ,MACN,GAAG,cAAc,MAAM,oDAAoD,YAAY,QACzF;GACA,OAAO;EACT;EAEA,IAAI,sBAAsB,qBACxB,QAAQ,KACN,GAAG,cAAc,KAAK,2BAA2B,kBAAkB,uBACrE;EAGF,MAAM,cAAc,gBAA6B,mBAAmB,cAAc;EAElF,IAAI,CAAC,aACH,OAAO;EAGT,MAAM,EAAE,eAAe,CAAC,GAAG,mBAAmB,CAAC,MAAM;EAErD,MAAM,cAAsD,CAAC;EAC7D,IAAI,cAAc;EAElB,IAAI,eAAe,eACjB,OAAO,QAAQ,cAAc,aAAa,CAAC,CAAC,SAAS,CAAC,MAAM,wBAAwB;GAClF,MAAM,qBAAqB,0BAA0B,mBAAmB,IAAI;GAC5E,MAAM,wBAAwB,mBAAmB,aAAa,OAAO,kBAAkB;GACvF,MAAM,4BAA4B,mBAChC,iBAAiB,OACjB,kBACF;GACA,MAAM,uBAAuB,mBAAmB,oBAAoB,kBAAkB;GAEtF,IAAK,CAAC,yBAAyB,CAAC,6BAA8B,CAAC,sBAAsB;IACnF,cAAc;IAEd,YAAY,QAAQ;KAClB,UAAU;KACV,cAAc,wBACV,cAAc,UACd,GAAG,cAAc,MAAM,GAAG,aAAa,SAAS;KACpD,kBAAkB,4BACd,cAAc,UACd,GAAG,cAAc,MAAM,GAAG,iBAAiB,SAAS;KACxD,cAAc,uBACV,cAAc,UACd,GAAG,cAAc,MAAM,GAAG,sBAAsB;IACtD;GACF;EACF,CAAC;EAGH,IAAI,CAAC,aAAa;GAChB,QAAQ,KACN,GAAG,cAAc,MAAM,qDAAqD,YAAY,QAC1F;GACA,YAAY,aAAa,SAAS;GAElC,OAAO;EACT;EAEA,OAAO;CACT,SAAS,OAAO;EACd,QAAQ,MAAM,6CAA6C,KAAK;EAChE,OAAO;CACT;AACF;;;;;;;AAQA,MAAa,4BACX,aACA,aACA,aAOG;CACH,MAAM,uCAAuB,IAAI,IAAsB;CACvD,MAAM,yBAAmC,CAAC;CAE1C,KAAK,MAAM,UAAU,aAAa;EAChC,MAAM,WAAW,QAAQ,QAAQ,IAAI,GAAG,MAAM;EAC9C,MAAM,SAAS,WAAW,KAAK,UAAU,cAAc,CAAC,IACpD,WACA,uBAAuB,QAAQ;EACnC,IAAI,QAAQ;GACV,MAAM,OAAO,qBAAqB,IAAI,MAAM,KAAK,CAAC;GAClD,KAAK,KAAK,MAAM;GAChB,qBAAqB,IAAI,QAAQ,IAAI;EACvC,OACE,uBAAuB,KAAK,MAAM;CAEtC;CAEA,IAAI,YAAY;CAChB,MAAM,0BAAU,IAAI,IAAqB;CAEzC,KAAK,MAAM,CAAC,YAAY,qBAAqB,QAAQ,GAAG;EAEtD,MAAM,SAAS,oBAAoB,SAAS,WAAW;EACvD,QAAQ,IAAI,SAAS,MAAM;EAC3B,IAAI,CAAC,QAAQ,YAAY;CAC3B;CAEA,MAAM,eAAe,YAAY;CACjC,MAAM,iBAAiB,qBAAqB;CAC5C,MAAM,cAAc,MAAM,KAAK,QAAQ,OAAO,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC;CACjE,MAAM,cAAc,iBAAiB;CAErC,IAAI,uBAAuB,UAAU,CAAC,aACpC,IAAI,CAAC,aACH,SAAS,KAAK,sBAAsB,EAAE,MAAM,yCAAyC,CAAC;MACjF;EACL,SAAS,KAAK,sBAAsB,EAClC,MAAM,6BAA6B,uBAAuB,OAAO,SAC/D,uBAAuB,WAAW,IAAI,MAAM,GAC7C,uCACH,CAAC;EACD,uBAAuB,SAAS,MAAM,QAAQ,MAAM,KAAK,GAAG,CAAC;CAC/D;MACK;EACL,MAAM,aAAa,cAAc,IAAI,aAAa,YAAY,kBAAkB;EAEhF,SAAS,QAAQ,sBAAsB,EACrC,MAAM,kBAAkB,aAAa,SAAS,iBAAiB,IAAI,MAAM,GAAG,UAAU,eAAe,UACnG,mBAAmB,IAAI,MAAM,GAC9B,mBAAmB,YAAY,gBAAgB,aAClD,CAAC;CACH;CAEA,MAAM,qBAAqB,MAAM,KAAK,QAAQ,QAAQ,CAAC,CAAC,CACrD,QAAQ,GAAG,QAAQ,CAAC,EAAE,CAAC,CACvB,KAAK,CAAC,UAAU,IAAI;CAEvB,OAAO;EAAE;EAAW;EAAS;EAAsB;EAAoB;CAAuB;AAChG;;;;;;;ACzNA,MAAa,iBAAiB,OAAe,UAAmB;CAC9D,MAAM,YAAY;CAClB,MAAM,YAAY,UAAU,MAAM;CAClC,MAAM,aAAa,WAAW,MAAM;CAEpC,QAAQ,KAAK,GAAG,UAAU,GAAG,UAAU,GAAG,YAAY;AACxD;;;;AAKA,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;CACF,CAAC;CAED,MAAM,0BAAU,IAAI,IAAY;CAChC,QAAQ,IAAI,GAAG;CAEf,MAAM,iBAAiB,SAAiB,QAAQ,MAAY;EAC1D,IAAI,SAAS,UAAU;EAEvB,IAAI;GACF,MAAM,QAAQ,YAAY,SAAS,EAAE,eAAe,KAAK,CAAC;GAE1D,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,KAAK,KAAK,WAAW,GAAG,KAAK,CAAC,UAAU,IAAI,KAAK,IAAI;QACpD,KAAK,YAAY,GAAG;KACtB,MAAM,WAAW,KAAK,SAAS,KAAK,IAAI;KACxC,MAAM,eAAe,SAAS,UAAU,QAAQ;KAEhD,IAAI,gBAAgB,CAAC,aAAa,WAAW,IAAI,KAAK,CAAC,aAAa,SAAS,IAAI,GAAG;MAClF,QAAQ,IAAI,YAAY;MACxB,cAAc,UAAU,QAAQ,CAAC;KACnC;IACF;;EAGN,QAAQ,CAER;CACF;CAEA,cAAc,QAAQ;CAEtB,MAAM,aAAa,MAAM,KAAK,OAAO,CAAC,CAAC,KAAK;CAE5C,IAAI,aAAa,KAAK,GAAG;EACvB,MAAM,aAAa,aAAa,YAAY;EAC5C,OAAO,WACJ,QAAQ,WAAW,OAAO,YAAY,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC,CAC7D,MAAM,GAAG,oBAAoB;CAClC;CAEA,OAAO,WAAW,MAAM,GAAG,mBAAmB;AAChD;;;;AAKA,MAAM,gBAAgB,OAAO,aAAuB;CAClD,MAAM,UAAU;CAChB,MAAM,kBAAkB,SAAS,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,IAAI;CAI5E,IAAI,SAAS,WAAW,MAAM,SAAS,OAAO,OAAO,SAAS,OAAO,OAAO;EAM1E,IAAI,MALwB,QAAQ;GAClC,SAAS;GACT,SAAS;EACX,CAAC,GAEkB;GACjB,MAAM,aAAa,MAAM,OAAO;IAC9B,SAAS;IACT,QAAQ,OAAO,gBAAgB;KAI7B,OAFgB,oBADC,QAAQ,IACkB,GAAG,eAAe,EAEhD,CAAC,CAAC,KAAK,YAAY;MAC9B,MAAM,WAAW,MAAM,uBAAuB;MAC9C,OAAO;MACP,aACE,WAAW,MAAM,8BAA8B,UAAU,OAAO;KACpE,EAAE;IACJ;IACA,WAAW,SAAS;KAClB,IAAI,CAAC,MAAM,KAAK,GAAG,OAAO;KAC1B,MAAM,WAAW,KAAK,QAAQ,IAAI,GAAG,IAAI;KACzC,IAAI,CAAC,WAAW,QAAQ,GAAG,OAAO;KAClC,IAAI,CAAC,SAAS,QAAQ,CAAC,CAAC,YAAY,GAAG,OAAO;KAC9C,OAAO;IACT;GACF,CAAC;GAED,cAAc,SAAS,UAAU;GACjC,OAAO,CAAC,UAAU;EACpB;EAEA,cAAc,SAAS,SAAS,OAAO,OAAO,MAAM,SAAS,EAAE;EAC/D,OAAO,CAAC,SAAS,OAAO,OAAO,MAAM,SAAS,EAAE;CAClD;CAGA,IAAI,gBAAgB,UAAU,GAC5B,OAAO,SAAS;EACd,UAAU;EACV,SAAS;EACT,SAAS,gBAAgB,KAAK,UAAU;GACtC,MAAM;GACN,OAAO;GACP,SAAS;EACX,EAAE;CACJ,CAAC;CAGH,OAAO,CAAC,GAAG;AACb;;;;AAKA,MAAM,uBAAuB,OAAO,EAClC,WACA,qBAIqB;CACrB,MAAM,iBAAiB;CAEvB,IAAI,aAAa,eAAe,SAAS,SAAS,GAAG;EACnD,cAAc,gBAAgB,SAAS;EACvC,OAAO;CACT;CAEA,OAAOC,OAAK;EACV,SAAS;EACT,SAAS,eAAe,KAAK,UAAU;GAAE,MAAM;GAAM,OAAO;EAAK,EAAE;CACrE,CAAC;AACH;;;;AAKA,MAAM,iBAAiB,OAAO,EAC5B,WACA,MACA,eAKuB;CACvB,MAAM,cAAc,CAAC;CAErB,IAAI,aAAa,WAAW,KAAK,MAAM,SAAS,CAAC,GAAG;EAClD,cAAc,0BAA0B,SAAS;EACjD,YAAY,KAAK,SAAS;CAC5B;CAEA,IAAI,CAAC,YAAY,QAAQ;EACvB,MAAM,oBAAoB,MAAM,cAAc,QAAQ;EACtD,YAAY,KAAK,GAAI,qBAAqB,CAAC,CAAE;CAC/C;CAEA,OAAO;AACT;;;;AAKA,MAAM,qBAAqB,OAAO,SAAmB;CACnD,MAAM,UAAU;CAChB,IAAI,KAAK,SAAS,OAAO,KAAK,KAAK,SAAS,WAAW,GAAG;EACxD,cAAc,SAAS,KAAK;EAC5B,OAAO;CACT;CAEA,OAAO,QAAQ;EAAE;EAAS,SAAS;CAAM,CAAC;AAC5C;;;;AAKA,MAAM,mBAAmB,OAAO,SAAmB;CACjD,MAAM,UAAU;CAEhB,IAAI,KAAK,SAAS,SAAS,GAAG;EAC5B,cAAc,SAAS,KAAK;EAC5B,OAAO;CACT;CAEA,OAAO,QAAQ;EAAE;EAAS,SAAS;CAAM,CAAC;AAC5C;AAEA,MAAM,yBAAyB,CAAC,mBAAmB,UAAU;;;;AAK7D,MAAM,0BAA0B,OAAO,SAAmB;CACxD,MAAM,UAAU;CAChB,MAAM,qBAAqB,KAAK,WAAW,QAAQ,QAAQ,kBAAkB;CAE7E,IAAI;CAEJ,IAAI,uBAAuB,MAAM,KAAK,SAAS,qBAAqB,GAClE,gBAAgB,KAAK,qBAAqB;CAG5C,IAAI;CACJ,IAAI,eAAe;EACjB,cAAc,SAAS,aAAa;EACpC,eAAe;CACjB,OACE,eAAe,MAAM,MAAM;EACzB;EACA,gBAAgB;CAClB,CAAC;CAGH,MAAM,cAAc,CAAC,GAAG,sBAAsB;CAC9C,IAAI,cAAc,KAAK,GACrB,YAAY,KAAK,GAAG,aAAa,MAAM,GAAG,CAAC,CAAC,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC;CAGlE,OAAO,YAAY,KAAK,GAAG;AAC7B;;;;AAKA,MAAM,qBAAqB,OAAO,SAAmB;CACnD,MAAM,UAAU;CAEhB,IAAI,KAAK,SAAS,aAAa,GAAG;EAChC,cAAc,SAAS,KAAK;EAC5B,OAAO;CACT;CAEA,IAAI,KAAK,SAAS,gBAAgB,GAAG;EACnC,cAAc,SAAS,IAAI;EAC3B,OAAO;CACT;CAEA,OAAO,QAAQ;EAAE;EAAS,SAAS;CAAK,CAAC;AAC3C;AAUA,eAAe,WAAW,EACxB,gBACA,iBACA,UACA,MACA,4BACyC;CACzC,MAAM,OAAO,QAAQ,KAAK,MAAM,CAAC;CAEjC,IAAI,4BAA4B,KAAK,OAAO,0BAC1C,KAAK,MAAM;CAsBb,OAAO;EACL,eAnBA,4BACC,MAAM,qBAAqB;GAAE,WAAW,KAAK,MAAM;GAAI;EAAe,CAAC;EAmBxE,aAAA,MAhBwB,eAAe;GACvC,WAFoB,2BAA4B,KAAK,MAAM,KAAO,KAAK,MAAM;GAG7E;GACA;EACF,CAAC;EAaC,OAXY,oBAAoB,gBAAgB,MAAM,mBAAmB,IAAI,IAAI;EAYjF,SAXc,oBAAoB,gBAAgB,MAAM,iBAAiB,IAAI,IAAI;EAYjF,gBAVA,oBAAoB,WAChB,uBAAuB,KAAK,GAAG,IAC/B,MAAM,wBAAwB,IAAI;EAStC,cARmB,oBAAoB,gBAAgB,MAAM,mBAAmB,IAAI,IAAI;CAS1F;AACF;;;AC/SA,eAAe,qBAAqB,eAAuB;CACzD,IAAI,mBAA4C,CAAC;CACjD,MAAM,eAAe,MAAMC,SAAG,QAAQ,aAAa;CAEnD,MAAM,iBAAiB,MAAM,QAAQ,IACnC,aAAa,IAAI,OAAO,SAAS;EAE/B,MAAM,kBAAmB,MAAM,OADT,KAAK,KAAK,eAAe,MAAM,gBACH;EAClD,mBAAmB;GAAE,GAAG;IAAmB,OAAO,gBAAgB;EAAQ;EAC1E,OAAO;CACT,CAAC,CACH;CAEA,OAAO;EAAE;EAAkB;CAAe;AAC5C;;;AC1BA,MAAM,cAAc,KAAK,QAAQ,QAAQ,IAAI,GAAG,oBAAoB;AAEpE,MAAM,qBAAqB,OAAO,UAAkB,YAAmC;CAErF,MAAM,aADY,iBAAiB,KAAK,OACb,CAAC,GAAG;CAE/B,MAAM,eAAe,QAAQ,QAAQ,iBAAiB,EAAE;CACxD,MAAM,WAAW,aAAa,IAAI,eAAe;CAKjD,IAAI;EACF,MAAM,GAAG,OAAO,WAAW;EAE3B,CAAe,MADe,GAAG,SAAS,aAAa,MAAM,EAAA,CAC9B,KAAK;CACtC,QAAQ,CAER;CAGA,MAAM,OAAO,QAAQ;CACrB,MAAM,iBAAiB,KAAK,WAAW,QAAQ,IAAI,SAAS,gBAAgB,CAAC;CAC7E,IAAI,kBAAkB,GAAG;EACvB,MAAM,gBAAgB,KAAK;EAC3B,MAAM,eAAe,KAAK,QAAQ,aAAa;EAC/C,KAAwB,SAAS,YAAY;CAC/C;CAEA,MAAM,UAAU,IAAI,WAAW,SAAS,IAAI,aAAa;CACzD,MAAM,GAAG,WAAW,aAAa,SAAS,MAAM;AAClD;;;AC3BA,eAAe,UAAU,GAAiD;CACxE,QAAQ,EAAE,MAAV;EACE,KAAK,UACH,OAAO,OAAO;GACZ,SAAS,EAAE;GACX,UAAU,EAAE,WAAW,CAAC,EAAA,CAAG,KAAK,OAAO;IAAE,MAAM,EAAE;IAAM,OAAO,EAAE;GAAM,EAAE;GACxE,SAAS,EAAE;EACb,CAAC;EACH,KAAK,WACH,OAAO,QAAQ;GACb,SAAS,EAAE;GACX,SAAS,OAAO,EAAE,YAAY,YAAY,EAAE,UAAU;EACxD,CAAC;EAEH,SACE,OAAO,MAAM;GACX,SAAS,EAAE;GACX,SAAU,EAAE,WAAsB;EACpC,CAAC;CACL;AACF;AAEA,eAAsB,oBAAoB,aAAuC;CAC/E,MAAM,SAAS,iBAAiB,WAAW;CAC3C,IAAI,CAAC,QAAQ,SAAS,QAAQ,OAAO,CAAC;CAEtC,MAAM,UAAmB,CAAC;CAE1B,KAAK,MAAM,UAAU,OAAO,SAC1B,IAAI;EACF,QAAQ,OAAO,OAAO,MAAM,UAAU,MAAM;CAC9C,SAAS,OAAO;EACd,QAAQ,KACN,6BAA6B,OAAO,IAAI,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,GACpG;EAEA,IAAI,OAAO,YAAY,KAAA,GAAW;GAChC,QAAQ,KAAK,4BAA4B,OAAO,IAAI,KAAK,OAAO,SAAS;GACzE,QAAQ,OAAO,OAAO,OAAO;EAC/B,OACE,QAAQ,KAAK,oBAAoB,OAAO,IAAI,+BAA+B;CAE/E;CAEF,OAAO;AACT;;;AC/CA,MAAM,uBAAuB;AAE7B,SAAgB,uBAA6B;CAC3C,MAAM,qBAAqB,KAAK,QAAQ,QAAQ,IAAI,QAAQ,IAAI,oBAAoB;CAEpF,IAAI,CAACC,KAAG,WAAW,kBAAkB,GACnC,MAAM,IAAI,MACR,GAAG,cAAc,MAAM,6DAA6D,mBAAmB,6IAEzG;AAEJ"}