@jsii/runtime 1.101.0 → 1.103.0

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.
@@ -1557,6 +1557,7 @@ var __webpack_modules__ = {
1557
1557
  const Range = __webpack_require__(3597);
1558
1558
  },
1559
1559
  3597: (module, __unused_webpack_exports, __webpack_require__) => {
1560
+ const SPACE_CHARACTERS = /\s+/g;
1560
1561
  class Range {
1561
1562
  constructor(range, options) {
1562
1563
  options = parseOptions(options);
@@ -1570,13 +1571,13 @@ var __webpack_modules__ = {
1570
1571
  if (range instanceof Comparator) {
1571
1572
  this.raw = range.value;
1572
1573
  this.set = [ [ range ] ];
1573
- this.format();
1574
+ this.formatted = undefined;
1574
1575
  return this;
1575
1576
  }
1576
1577
  this.options = options;
1577
1578
  this.loose = !!options.loose;
1578
1579
  this.includePrerelease = !!options.includePrerelease;
1579
- this.raw = range.trim().split(/\s+/).join(" ");
1580
+ this.raw = range.trim().replace(SPACE_CHARACTERS, " ");
1580
1581
  this.set = this.raw.split("||").map((r => this.parseRange(r.trim()))).filter((c => c.length));
1581
1582
  if (!this.set.length) {
1582
1583
  throw new TypeError(`Invalid SemVer Range: ${this.raw}`);
@@ -1595,10 +1596,27 @@ var __webpack_modules__ = {
1595
1596
  }
1596
1597
  }
1597
1598
  }
1598
- this.format();
1599
+ this.formatted = undefined;
1600
+ }
1601
+ get range() {
1602
+ if (this.formatted === undefined) {
1603
+ this.formatted = "";
1604
+ for (let i = 0; i < this.set.length; i++) {
1605
+ if (i > 0) {
1606
+ this.formatted += "||";
1607
+ }
1608
+ const comps = this.set[i];
1609
+ for (let k = 0; k < comps.length; k++) {
1610
+ if (k > 0) {
1611
+ this.formatted += " ";
1612
+ }
1613
+ this.formatted += comps[k].toString().trim();
1614
+ }
1615
+ }
1616
+ }
1617
+ return this.formatted;
1599
1618
  }
1600
1619
  format() {
1601
- this.range = this.set.map((comps => comps.join(" ").trim())).join("||").trim();
1602
1620
  return this.range;
1603
1621
  }
1604
1622
  toString() {
@@ -1670,10 +1688,8 @@ var __webpack_modules__ = {
1670
1688
  }
1671
1689
  }
1672
1690
  module.exports = Range;
1673
- const LRU = __webpack_require__(8163);
1674
- const cache = new LRU({
1675
- max: 1e3
1676
- });
1691
+ const LRU = __webpack_require__(1380);
1692
+ const cache = new LRU;
1677
1693
  const parseOptions = __webpack_require__(6837);
1678
1694
  const Comparator = __webpack_require__(3114);
1679
1695
  const debug = __webpack_require__(4122);
@@ -1839,7 +1855,7 @@ var __webpack_modules__ = {
1839
1855
  debug("replaceGTE0", comp, options);
1840
1856
  return comp.trim().replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], "");
1841
1857
  };
1842
- const hyphenReplace = incPr => ($0, from, fM, fm, fp, fpr, fb, to, tM, tm, tp, tpr, tb) => {
1858
+ const hyphenReplace = incPr => ($0, from, fM, fm, fp, fpr, fb, to, tM, tm, tp, tpr) => {
1843
1859
  if (isX(fM)) {
1844
1860
  from = "";
1845
1861
  } else if (isX(fm)) {
@@ -2014,7 +2030,7 @@ var __webpack_modules__ = {
2014
2030
  do {
2015
2031
  const a = this.build[i];
2016
2032
  const b = other.build[i];
2017
- debug("prerelease compare", i, a, b);
2033
+ debug("build compare", i, a, b);
2018
2034
  if (a === undefined && b === undefined) {
2019
2035
  return 0;
2020
2036
  } else if (b === undefined) {
@@ -2544,6 +2560,39 @@ var __webpack_modules__ = {
2544
2560
  rcompareIdentifiers
2545
2561
  };
2546
2562
  },
2563
+ 1380: module => {
2564
+ class LRUCache {
2565
+ constructor() {
2566
+ this.max = 1e3;
2567
+ this.map = new Map;
2568
+ }
2569
+ get(key) {
2570
+ const value = this.map.get(key);
2571
+ if (value === undefined) {
2572
+ return undefined;
2573
+ } else {
2574
+ this.map.delete(key);
2575
+ this.map.set(key, value);
2576
+ return value;
2577
+ }
2578
+ }
2579
+ delete(key) {
2580
+ return this.map.delete(key);
2581
+ }
2582
+ set(key, value) {
2583
+ const deleted = this.delete(key);
2584
+ if (!deleted && value !== undefined) {
2585
+ if (this.map.size >= this.max) {
2586
+ const firstKey = this.map.keys().next().value;
2587
+ this.delete(firstKey);
2588
+ }
2589
+ this.map.set(key, value);
2590
+ }
2591
+ return this;
2592
+ }
2593
+ }
2594
+ module.exports = LRUCache;
2595
+ },
2547
2596
  6837: module => {
2548
2597
  const looseOption = Object.freeze({
2549
2598
  loose: true
@@ -2633,252 +2682,6 @@ var __webpack_modules__ = {
2633
2682
  createToken("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$");
2634
2683
  createToken("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
2635
2684
  },
2636
- 8163: (module, __unused_webpack_exports, __webpack_require__) => {
2637
- "use strict";
2638
- const Yallist = __webpack_require__(5773);
2639
- const MAX = Symbol("max");
2640
- const LENGTH = Symbol("length");
2641
- const LENGTH_CALCULATOR = Symbol("lengthCalculator");
2642
- const ALLOW_STALE = Symbol("allowStale");
2643
- const MAX_AGE = Symbol("maxAge");
2644
- const DISPOSE = Symbol("dispose");
2645
- const NO_DISPOSE_ON_SET = Symbol("noDisposeOnSet");
2646
- const LRU_LIST = Symbol("lruList");
2647
- const CACHE = Symbol("cache");
2648
- const UPDATE_AGE_ON_GET = Symbol("updateAgeOnGet");
2649
- const naiveLength = () => 1;
2650
- class LRUCache {
2651
- constructor(options) {
2652
- if (typeof options === "number") options = {
2653
- max: options
2654
- };
2655
- if (!options) options = {};
2656
- if (options.max && (typeof options.max !== "number" || options.max < 0)) throw new TypeError("max must be a non-negative number");
2657
- const max = this[MAX] = options.max || Infinity;
2658
- const lc = options.length || naiveLength;
2659
- this[LENGTH_CALCULATOR] = typeof lc !== "function" ? naiveLength : lc;
2660
- this[ALLOW_STALE] = options.stale || false;
2661
- if (options.maxAge && typeof options.maxAge !== "number") throw new TypeError("maxAge must be a number");
2662
- this[MAX_AGE] = options.maxAge || 0;
2663
- this[DISPOSE] = options.dispose;
2664
- this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false;
2665
- this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false;
2666
- this.reset();
2667
- }
2668
- set max(mL) {
2669
- if (typeof mL !== "number" || mL < 0) throw new TypeError("max must be a non-negative number");
2670
- this[MAX] = mL || Infinity;
2671
- trim(this);
2672
- }
2673
- get max() {
2674
- return this[MAX];
2675
- }
2676
- set allowStale(allowStale) {
2677
- this[ALLOW_STALE] = !!allowStale;
2678
- }
2679
- get allowStale() {
2680
- return this[ALLOW_STALE];
2681
- }
2682
- set maxAge(mA) {
2683
- if (typeof mA !== "number") throw new TypeError("maxAge must be a non-negative number");
2684
- this[MAX_AGE] = mA;
2685
- trim(this);
2686
- }
2687
- get maxAge() {
2688
- return this[MAX_AGE];
2689
- }
2690
- set lengthCalculator(lC) {
2691
- if (typeof lC !== "function") lC = naiveLength;
2692
- if (lC !== this[LENGTH_CALCULATOR]) {
2693
- this[LENGTH_CALCULATOR] = lC;
2694
- this[LENGTH] = 0;
2695
- this[LRU_LIST].forEach((hit => {
2696
- hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key);
2697
- this[LENGTH] += hit.length;
2698
- }));
2699
- }
2700
- trim(this);
2701
- }
2702
- get lengthCalculator() {
2703
- return this[LENGTH_CALCULATOR];
2704
- }
2705
- get length() {
2706
- return this[LENGTH];
2707
- }
2708
- get itemCount() {
2709
- return this[LRU_LIST].length;
2710
- }
2711
- rforEach(fn, thisp) {
2712
- thisp = thisp || this;
2713
- for (let walker = this[LRU_LIST].tail; walker !== null; ) {
2714
- const prev = walker.prev;
2715
- forEachStep(this, fn, walker, thisp);
2716
- walker = prev;
2717
- }
2718
- }
2719
- forEach(fn, thisp) {
2720
- thisp = thisp || this;
2721
- for (let walker = this[LRU_LIST].head; walker !== null; ) {
2722
- const next = walker.next;
2723
- forEachStep(this, fn, walker, thisp);
2724
- walker = next;
2725
- }
2726
- }
2727
- keys() {
2728
- return this[LRU_LIST].toArray().map((k => k.key));
2729
- }
2730
- values() {
2731
- return this[LRU_LIST].toArray().map((k => k.value));
2732
- }
2733
- reset() {
2734
- if (this[DISPOSE] && this[LRU_LIST] && this[LRU_LIST].length) {
2735
- this[LRU_LIST].forEach((hit => this[DISPOSE](hit.key, hit.value)));
2736
- }
2737
- this[CACHE] = new Map;
2738
- this[LRU_LIST] = new Yallist;
2739
- this[LENGTH] = 0;
2740
- }
2741
- dump() {
2742
- return this[LRU_LIST].map((hit => isStale(this, hit) ? false : {
2743
- k: hit.key,
2744
- v: hit.value,
2745
- e: hit.now + (hit.maxAge || 0)
2746
- })).toArray().filter((h => h));
2747
- }
2748
- dumpLru() {
2749
- return this[LRU_LIST];
2750
- }
2751
- set(key, value, maxAge) {
2752
- maxAge = maxAge || this[MAX_AGE];
2753
- if (maxAge && typeof maxAge !== "number") throw new TypeError("maxAge must be a number");
2754
- const now = maxAge ? Date.now() : 0;
2755
- const len = this[LENGTH_CALCULATOR](value, key);
2756
- if (this[CACHE].has(key)) {
2757
- if (len > this[MAX]) {
2758
- del(this, this[CACHE].get(key));
2759
- return false;
2760
- }
2761
- const node = this[CACHE].get(key);
2762
- const item = node.value;
2763
- if (this[DISPOSE]) {
2764
- if (!this[NO_DISPOSE_ON_SET]) this[DISPOSE](key, item.value);
2765
- }
2766
- item.now = now;
2767
- item.maxAge = maxAge;
2768
- item.value = value;
2769
- this[LENGTH] += len - item.length;
2770
- item.length = len;
2771
- this.get(key);
2772
- trim(this);
2773
- return true;
2774
- }
2775
- const hit = new Entry(key, value, len, now, maxAge);
2776
- if (hit.length > this[MAX]) {
2777
- if (this[DISPOSE]) this[DISPOSE](key, value);
2778
- return false;
2779
- }
2780
- this[LENGTH] += hit.length;
2781
- this[LRU_LIST].unshift(hit);
2782
- this[CACHE].set(key, this[LRU_LIST].head);
2783
- trim(this);
2784
- return true;
2785
- }
2786
- has(key) {
2787
- if (!this[CACHE].has(key)) return false;
2788
- const hit = this[CACHE].get(key).value;
2789
- return !isStale(this, hit);
2790
- }
2791
- get(key) {
2792
- return get(this, key, true);
2793
- }
2794
- peek(key) {
2795
- return get(this, key, false);
2796
- }
2797
- pop() {
2798
- const node = this[LRU_LIST].tail;
2799
- if (!node) return null;
2800
- del(this, node);
2801
- return node.value;
2802
- }
2803
- del(key) {
2804
- del(this, this[CACHE].get(key));
2805
- }
2806
- load(arr) {
2807
- this.reset();
2808
- const now = Date.now();
2809
- for (let l = arr.length - 1; l >= 0; l--) {
2810
- const hit = arr[l];
2811
- const expiresAt = hit.e || 0;
2812
- if (expiresAt === 0) this.set(hit.k, hit.v); else {
2813
- const maxAge = expiresAt - now;
2814
- if (maxAge > 0) {
2815
- this.set(hit.k, hit.v, maxAge);
2816
- }
2817
- }
2818
- }
2819
- }
2820
- prune() {
2821
- this[CACHE].forEach(((value, key) => get(this, key, false)));
2822
- }
2823
- }
2824
- const get = (self, key, doUse) => {
2825
- const node = self[CACHE].get(key);
2826
- if (node) {
2827
- const hit = node.value;
2828
- if (isStale(self, hit)) {
2829
- del(self, node);
2830
- if (!self[ALLOW_STALE]) return undefined;
2831
- } else {
2832
- if (doUse) {
2833
- if (self[UPDATE_AGE_ON_GET]) node.value.now = Date.now();
2834
- self[LRU_LIST].unshiftNode(node);
2835
- }
2836
- }
2837
- return hit.value;
2838
- }
2839
- };
2840
- const isStale = (self, hit) => {
2841
- if (!hit || !hit.maxAge && !self[MAX_AGE]) return false;
2842
- const diff = Date.now() - hit.now;
2843
- return hit.maxAge ? diff > hit.maxAge : self[MAX_AGE] && diff > self[MAX_AGE];
2844
- };
2845
- const trim = self => {
2846
- if (self[LENGTH] > self[MAX]) {
2847
- for (let walker = self[LRU_LIST].tail; self[LENGTH] > self[MAX] && walker !== null; ) {
2848
- const prev = walker.prev;
2849
- del(self, walker);
2850
- walker = prev;
2851
- }
2852
- }
2853
- };
2854
- const del = (self, node) => {
2855
- if (node) {
2856
- const hit = node.value;
2857
- if (self[DISPOSE]) self[DISPOSE](hit.key, hit.value);
2858
- self[LENGTH] -= hit.length;
2859
- self[CACHE].delete(hit.key);
2860
- self[LRU_LIST].removeNode(node);
2861
- }
2862
- };
2863
- class Entry {
2864
- constructor(key, value, length, now, maxAge) {
2865
- this.key = key;
2866
- this.value = value;
2867
- this.length = length;
2868
- this.now = now;
2869
- this.maxAge = maxAge || 0;
2870
- }
2871
- }
2872
- const forEachStep = (self, fn, node, thisp) => {
2873
- let hit = node.value;
2874
- if (isStale(self, hit)) {
2875
- del(self, node);
2876
- if (!self[ALLOW_STALE]) hit = undefined;
2877
- }
2878
- if (hit) fn.call(thisp, hit.value, hit.key, self);
2879
- };
2880
- module.exports = LRUCache;
2881
- },
2882
2685
  7369: (module, __unused_webpack_exports, __webpack_require__) => {
2883
2686
  const outside = __webpack_require__(2641);
2884
2687
  const gtr = (version, range, options) => outside(version, range, ">", options);
@@ -3384,380 +3187,6 @@ var __webpack_modules__ = {
3384
3187
  stderr: translateLevel(supportsColor(true, tty.isatty(2)))
3385
3188
  };
3386
3189
  },
3387
- 6949: module => {
3388
- "use strict";
3389
- module.exports = function(Yallist) {
3390
- Yallist.prototype[Symbol.iterator] = function*() {
3391
- for (let walker = this.head; walker; walker = walker.next) {
3392
- yield walker.value;
3393
- }
3394
- };
3395
- };
3396
- },
3397
- 5773: (module, __unused_webpack_exports, __webpack_require__) => {
3398
- "use strict";
3399
- module.exports = Yallist;
3400
- Yallist.Node = Node;
3401
- Yallist.create = Yallist;
3402
- function Yallist(list) {
3403
- var self = this;
3404
- if (!(self instanceof Yallist)) {
3405
- self = new Yallist;
3406
- }
3407
- self.tail = null;
3408
- self.head = null;
3409
- self.length = 0;
3410
- if (list && typeof list.forEach === "function") {
3411
- list.forEach((function(item) {
3412
- self.push(item);
3413
- }));
3414
- } else if (arguments.length > 0) {
3415
- for (var i = 0, l = arguments.length; i < l; i++) {
3416
- self.push(arguments[i]);
3417
- }
3418
- }
3419
- return self;
3420
- }
3421
- Yallist.prototype.removeNode = function(node) {
3422
- if (node.list !== this) {
3423
- throw new Error("removing node which does not belong to this list");
3424
- }
3425
- var next = node.next;
3426
- var prev = node.prev;
3427
- if (next) {
3428
- next.prev = prev;
3429
- }
3430
- if (prev) {
3431
- prev.next = next;
3432
- }
3433
- if (node === this.head) {
3434
- this.head = next;
3435
- }
3436
- if (node === this.tail) {
3437
- this.tail = prev;
3438
- }
3439
- node.list.length--;
3440
- node.next = null;
3441
- node.prev = null;
3442
- node.list = null;
3443
- return next;
3444
- };
3445
- Yallist.prototype.unshiftNode = function(node) {
3446
- if (node === this.head) {
3447
- return;
3448
- }
3449
- if (node.list) {
3450
- node.list.removeNode(node);
3451
- }
3452
- var head = this.head;
3453
- node.list = this;
3454
- node.next = head;
3455
- if (head) {
3456
- head.prev = node;
3457
- }
3458
- this.head = node;
3459
- if (!this.tail) {
3460
- this.tail = node;
3461
- }
3462
- this.length++;
3463
- };
3464
- Yallist.prototype.pushNode = function(node) {
3465
- if (node === this.tail) {
3466
- return;
3467
- }
3468
- if (node.list) {
3469
- node.list.removeNode(node);
3470
- }
3471
- var tail = this.tail;
3472
- node.list = this;
3473
- node.prev = tail;
3474
- if (tail) {
3475
- tail.next = node;
3476
- }
3477
- this.tail = node;
3478
- if (!this.head) {
3479
- this.head = node;
3480
- }
3481
- this.length++;
3482
- };
3483
- Yallist.prototype.push = function() {
3484
- for (var i = 0, l = arguments.length; i < l; i++) {
3485
- push(this, arguments[i]);
3486
- }
3487
- return this.length;
3488
- };
3489
- Yallist.prototype.unshift = function() {
3490
- for (var i = 0, l = arguments.length; i < l; i++) {
3491
- unshift(this, arguments[i]);
3492
- }
3493
- return this.length;
3494
- };
3495
- Yallist.prototype.pop = function() {
3496
- if (!this.tail) {
3497
- return undefined;
3498
- }
3499
- var res = this.tail.value;
3500
- this.tail = this.tail.prev;
3501
- if (this.tail) {
3502
- this.tail.next = null;
3503
- } else {
3504
- this.head = null;
3505
- }
3506
- this.length--;
3507
- return res;
3508
- };
3509
- Yallist.prototype.shift = function() {
3510
- if (!this.head) {
3511
- return undefined;
3512
- }
3513
- var res = this.head.value;
3514
- this.head = this.head.next;
3515
- if (this.head) {
3516
- this.head.prev = null;
3517
- } else {
3518
- this.tail = null;
3519
- }
3520
- this.length--;
3521
- return res;
3522
- };
3523
- Yallist.prototype.forEach = function(fn, thisp) {
3524
- thisp = thisp || this;
3525
- for (var walker = this.head, i = 0; walker !== null; i++) {
3526
- fn.call(thisp, walker.value, i, this);
3527
- walker = walker.next;
3528
- }
3529
- };
3530
- Yallist.prototype.forEachReverse = function(fn, thisp) {
3531
- thisp = thisp || this;
3532
- for (var walker = this.tail, i = this.length - 1; walker !== null; i--) {
3533
- fn.call(thisp, walker.value, i, this);
3534
- walker = walker.prev;
3535
- }
3536
- };
3537
- Yallist.prototype.get = function(n) {
3538
- for (var i = 0, walker = this.head; walker !== null && i < n; i++) {
3539
- walker = walker.next;
3540
- }
3541
- if (i === n && walker !== null) {
3542
- return walker.value;
3543
- }
3544
- };
3545
- Yallist.prototype.getReverse = function(n) {
3546
- for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {
3547
- walker = walker.prev;
3548
- }
3549
- if (i === n && walker !== null) {
3550
- return walker.value;
3551
- }
3552
- };
3553
- Yallist.prototype.map = function(fn, thisp) {
3554
- thisp = thisp || this;
3555
- var res = new Yallist;
3556
- for (var walker = this.head; walker !== null; ) {
3557
- res.push(fn.call(thisp, walker.value, this));
3558
- walker = walker.next;
3559
- }
3560
- return res;
3561
- };
3562
- Yallist.prototype.mapReverse = function(fn, thisp) {
3563
- thisp = thisp || this;
3564
- var res = new Yallist;
3565
- for (var walker = this.tail; walker !== null; ) {
3566
- res.push(fn.call(thisp, walker.value, this));
3567
- walker = walker.prev;
3568
- }
3569
- return res;
3570
- };
3571
- Yallist.prototype.reduce = function(fn, initial) {
3572
- var acc;
3573
- var walker = this.head;
3574
- if (arguments.length > 1) {
3575
- acc = initial;
3576
- } else if (this.head) {
3577
- walker = this.head.next;
3578
- acc = this.head.value;
3579
- } else {
3580
- throw new TypeError("Reduce of empty list with no initial value");
3581
- }
3582
- for (var i = 0; walker !== null; i++) {
3583
- acc = fn(acc, walker.value, i);
3584
- walker = walker.next;
3585
- }
3586
- return acc;
3587
- };
3588
- Yallist.prototype.reduceReverse = function(fn, initial) {
3589
- var acc;
3590
- var walker = this.tail;
3591
- if (arguments.length > 1) {
3592
- acc = initial;
3593
- } else if (this.tail) {
3594
- walker = this.tail.prev;
3595
- acc = this.tail.value;
3596
- } else {
3597
- throw new TypeError("Reduce of empty list with no initial value");
3598
- }
3599
- for (var i = this.length - 1; walker !== null; i--) {
3600
- acc = fn(acc, walker.value, i);
3601
- walker = walker.prev;
3602
- }
3603
- return acc;
3604
- };
3605
- Yallist.prototype.toArray = function() {
3606
- var arr = new Array(this.length);
3607
- for (var i = 0, walker = this.head; walker !== null; i++) {
3608
- arr[i] = walker.value;
3609
- walker = walker.next;
3610
- }
3611
- return arr;
3612
- };
3613
- Yallist.prototype.toArrayReverse = function() {
3614
- var arr = new Array(this.length);
3615
- for (var i = 0, walker = this.tail; walker !== null; i++) {
3616
- arr[i] = walker.value;
3617
- walker = walker.prev;
3618
- }
3619
- return arr;
3620
- };
3621
- Yallist.prototype.slice = function(from, to) {
3622
- to = to || this.length;
3623
- if (to < 0) {
3624
- to += this.length;
3625
- }
3626
- from = from || 0;
3627
- if (from < 0) {
3628
- from += this.length;
3629
- }
3630
- var ret = new Yallist;
3631
- if (to < from || to < 0) {
3632
- return ret;
3633
- }
3634
- if (from < 0) {
3635
- from = 0;
3636
- }
3637
- if (to > this.length) {
3638
- to = this.length;
3639
- }
3640
- for (var i = 0, walker = this.head; walker !== null && i < from; i++) {
3641
- walker = walker.next;
3642
- }
3643
- for (;walker !== null && i < to; i++, walker = walker.next) {
3644
- ret.push(walker.value);
3645
- }
3646
- return ret;
3647
- };
3648
- Yallist.prototype.sliceReverse = function(from, to) {
3649
- to = to || this.length;
3650
- if (to < 0) {
3651
- to += this.length;
3652
- }
3653
- from = from || 0;
3654
- if (from < 0) {
3655
- from += this.length;
3656
- }
3657
- var ret = new Yallist;
3658
- if (to < from || to < 0) {
3659
- return ret;
3660
- }
3661
- if (from < 0) {
3662
- from = 0;
3663
- }
3664
- if (to > this.length) {
3665
- to = this.length;
3666
- }
3667
- for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) {
3668
- walker = walker.prev;
3669
- }
3670
- for (;walker !== null && i > from; i--, walker = walker.prev) {
3671
- ret.push(walker.value);
3672
- }
3673
- return ret;
3674
- };
3675
- Yallist.prototype.splice = function(start, deleteCount, ...nodes) {
3676
- if (start > this.length) {
3677
- start = this.length - 1;
3678
- }
3679
- if (start < 0) {
3680
- start = this.length + start;
3681
- }
3682
- for (var i = 0, walker = this.head; walker !== null && i < start; i++) {
3683
- walker = walker.next;
3684
- }
3685
- var ret = [];
3686
- for (var i = 0; walker && i < deleteCount; i++) {
3687
- ret.push(walker.value);
3688
- walker = this.removeNode(walker);
3689
- }
3690
- if (walker === null) {
3691
- walker = this.tail;
3692
- }
3693
- if (walker !== this.head && walker !== this.tail) {
3694
- walker = walker.prev;
3695
- }
3696
- for (var i = 0; i < nodes.length; i++) {
3697
- walker = insert(this, walker, nodes[i]);
3698
- }
3699
- return ret;
3700
- };
3701
- Yallist.prototype.reverse = function() {
3702
- var head = this.head;
3703
- var tail = this.tail;
3704
- for (var walker = head; walker !== null; walker = walker.prev) {
3705
- var p = walker.prev;
3706
- walker.prev = walker.next;
3707
- walker.next = p;
3708
- }
3709
- this.head = tail;
3710
- this.tail = head;
3711
- return this;
3712
- };
3713
- function insert(self, node, value) {
3714
- var inserted = node === self.head ? new Node(value, null, node, self) : new Node(value, node, node.next, self);
3715
- if (inserted.next === null) {
3716
- self.tail = inserted;
3717
- }
3718
- if (inserted.prev === null) {
3719
- self.head = inserted;
3720
- }
3721
- self.length++;
3722
- return inserted;
3723
- }
3724
- function push(self, item) {
3725
- self.tail = new Node(item, self.tail, null, self);
3726
- if (!self.head) {
3727
- self.head = self.tail;
3728
- }
3729
- self.length++;
3730
- }
3731
- function unshift(self, item) {
3732
- self.head = new Node(item, null, self.head, self);
3733
- if (!self.tail) {
3734
- self.tail = self.head;
3735
- }
3736
- self.length++;
3737
- }
3738
- function Node(value, prev, next, list) {
3739
- if (!(this instanceof Node)) {
3740
- return new Node(value, prev, next, list);
3741
- }
3742
- this.list = list;
3743
- this.value = value;
3744
- if (prev) {
3745
- prev.next = this;
3746
- this.prev = prev;
3747
- } else {
3748
- this.prev = null;
3749
- }
3750
- if (next) {
3751
- next.prev = this;
3752
- this.next = next;
3753
- } else {
3754
- this.next = null;
3755
- }
3756
- }
3757
- try {
3758
- __webpack_require__(6949)(Yallist);
3759
- } catch (er) {}
3760
- },
3761
3190
  268: (__unused_webpack_module, exports, __webpack_require__) => {
3762
3191
  "use strict";
3763
3192
  Object.defineProperty(exports, "__esModule", {
@@ -3825,13 +3254,13 @@ var __webpack_modules__ = {
3825
3254
  }), new NodeRelease(19, {
3826
3255
  endOfLife: new Date("2023-06-01"),
3827
3256
  untested: true
3257
+ }), new NodeRelease(21, {
3258
+ endOfLife: new Date("2024-06-01"),
3259
+ untested: true
3828
3260
  }), new NodeRelease(18, {
3829
3261
  endOfLife: new Date("2025-04-30")
3830
3262
  }), new NodeRelease(20, {
3831
3263
  endOfLife: new Date("2026-04-30")
3832
- }), new NodeRelease(21, {
3833
- endOfLife: new Date("2024-06-01"),
3834
- untested: true
3835
3264
  }), new NodeRelease(22, {
3836
3265
  endOfLife: new Date("2027-04-30")
3837
3266
  }) ];