dequanto 0.2.25 → 0.2.29

package/lib/cjs/class/PackedRanges.js

@@ -25,6 +25,7 @@ class PackedRanges {
             this.ranges = opts.ranges ?? [];
         }
     }
+    // Get the outer range [from..to] total capacity (regardless of tracked ranges)
     total() {
         let min = this.from;
         let max = this.to ?? this.getMax();
@@ -33,6 +34,7 @@ class PackedRanges {
         }
         return max - min;
     }
+    // Get the sum of all tracked range lengths (total numbers visited/added)
     totalAdded() {
         let count = 0;
         for (let i = 0; i < this.ranges.length; i++) {
@@ -41,9 +43,29 @@ class PackedRanges {
         }
         return count;
     }
+    /**
+     * Calculates the number of elements remaining to be visited/added in the range.
+     * This is the difference between the total capacity and the number of elements already tracked.
+     */
     totalLeft() {
         return this.total() - this.totalAdded();
     }
+    /**
+     * Gets the next unvisited number in the range and marks it as visited.
+     *
+     * This method finds the next number that hasn't been added to the tracked ranges yet,
+     * automatically adds it to the ranges, and returns it. It respects the boundaries
+     * defined by `from` and `to` properties.
+     *
+     * The method works by:
+     * - Starting from `this.from` if no ranges exist
+     * - Filling gaps between existing ranges
+     * - Extending the last range if no gaps exist
+     * - Merging adjacent ranges when they become contiguous
+     *
+     * @returns The next unvisited number in the range, or `null` if all numbers up to `this.to` have been visited
+     * @throws {Error} If the internal ranges array is in an invalid state (unsorted or overlapping)
+     */
     next() {
         let min = this.from;
         if (this.ranges.length === 0) {
@@ -77,6 +99,14 @@ class PackedRanges {
         this.ranges[0][1] = r0Max;
         return r0Max;
     }
+    /**
+     * Gets the maximum (upper bound) value from all tracked ranges.
+     *
+     * This method returns the highest number that has been visited/added to the ranges.
+     * It retrieves the upper bound of the last range in the sorted ranges array.
+     *
+     * @returns The maximum value in the tracked ranges, or `null` if no ranges have been added yet
+     */
     getMax() {
         if (this.ranges.length === 0) {
             return null;
@@ -84,6 +114,16 @@ class PackedRanges {
         let r = this.ranges[this.ranges.length - 1];
         return r[1];
     }
+    /**
+     * Checks if a specific number has been visited/added to the tracked ranges.
+     *
+     * This method searches through all tracked ranges to determine if the given number
+     * falls within any of them. It performs a linear search through the ranges array,
+     * checking if the number is within the bounds (inclusive) of any range.
+     *
+     * @param nr - The number to check for inclusion in the tracked ranges
+     * @returns `true` if the number exists within any of the tracked ranges, `false` otherwise
+     */
     includes(nr) {
         for (let i = 0; i < this.ranges.length; i++) {
             let [a, b] = this.ranges[i];
@@ -93,6 +133,21 @@ class PackedRanges {
         }
         return false;
     }
+    /**
+     * Adds a number to the tracked ranges, marking it as visited.
+     *
+     * This method intelligently adds a number to the ranges by either:
+     * - Extending an existing range if the number is adjacent to it
+     * - Creating a new range if the number is isolated
+     * - Doing nothing if the number is already included in an existing range
+     *
+     * The method maintains the sorted order of ranges and automatically merges
+     * adjacent numbers into contiguous ranges for efficient storage.
+     *
+     * @param nr - The number to add to the tracked ranges
+     * @returns `true` if the number was successfully added (new or extended a range),
+     *          `false` if the number was already present in the ranges
+     */
     add(nr) {
         let modified = false;
         for (let i = 0; i < this.ranges.length; i++) {
@@ -129,6 +184,40 @@ class PackedRanges {
         }
         return true;
     }
+    /**
+     * Adds a complete range to the tracked ranges and compacts the result.
+     *
+     * This method adds an entire range [min, max] to the tracked ranges array,
+     * then automatically compacts the ranges to merge any overlapping or adjacent
+     * ranges. This is useful for bulk operations where you want to mark multiple
+     * consecutive numbers as visited at once.
+     *
+     * Unlike the `add()` method which adds individual numbers, this method adds
+     * a complete range tuple and ensures the internal ranges array remains optimized
+     * by calling `compact()` after insertion.
+     *
+     * @param range - A tuple [min, max] representing the range to add, where both bounds are inclusive
+     */
+    addRange(range) {
+        this.ranges.push(range);
+        this.compact();
+    }
+    /**
+     * Removes a specific number from the tracked ranges, marking it as unvisited.
+     *
+     * This method searches for the number within the tracked ranges and removes it by either:
+     * - Removing the entire range if it contains only the target number
+     * - Shrinking the range by adjusting its lower bound if the number is at the start
+     * - Shrinking the range by adjusting its upper bound if the number is at the end
+     * - Splitting the range into two separate ranges if the number is in the middle
+     *
+     * The method maintains the sorted order of ranges and ensures efficient storage
+     * by handling all edge cases appropriately.
+     *
+     * @param nr - The number to remove from the tracked ranges
+     * @returns `true` if the number was found and successfully removed from the ranges,
+     *          `false` if the number was not present in any of the tracked ranges
+     */
     remove(nr) {
         for (let i = 0; i < this.ranges.length; i++) {
             let [min, max] = this.ranges[i];
@@ -153,43 +242,356 @@ class PackedRanges {
         }
         return false;
     }
+    /**
+     * Removes a range of numbers from the tracked ranges, marking them as unvisited.
+     *
+     * This method subtracts the specified range from all tracked ranges, effectively
+     * removing all numbers within the given range from the visited/added set. It handles
+     * overlapping ranges by splitting or trimming existing ranges as needed.
+     *
+     * The method maintains the sorted order of ranges and ensures efficient storage
+     * by delegating to the `Ranges.subtract()` utility function.
+     *
+     * @param range - A tuple [min, max] representing the range to remove, where both bounds are inclusive
+     * @returns The current `PackedRanges` instance for method chaining
+     */
+    subtractRange(range) {
+        this.ranges = Ranges.subtract(this.ranges, range);
+        return this;
+    }
+    /**
+     * Removes multiple ranges of numbers from the tracked ranges, marking them as unvisited.
+     *
+     * This method subtracts all specified ranges from the tracked ranges, effectively
+     * removing all numbers within the given ranges from the visited/added set. It handles
+     * overlapping ranges by splitting or trimming existing ranges as needed for each
+     * range in the input array.
+     *
+     * The method maintains the sorted order of ranges and ensures efficient storage
+     * by delegating to the `Ranges.subtractMany()` utility function.
+     *
+     * @param ranges - An array of tuples [min, max] representing the ranges to remove, where both bounds are inclusive
+     * @returns The current `PackedRanges` instance for method chaining
+     */
+    subtractRanges(ranges) {
+        this.ranges = Ranges.subtractMany(this.ranges, ranges);
+        return this;
+    }
+    /**
+     * Compacts the tracked ranges by merging overlapping and adjacent ranges.
+     *
+     * This method optimizes the internal ranges array by:
+     * - Merging overlapping ranges into single contiguous ranges
+     * - Joining adjacent ranges (e.g., [1,4] and [5,6] become [1,6])
+     * - Sorting ranges by their starting values
+     * - Removing redundant range entries
+     *
+     * This operation is useful after bulk modifications to ensure the ranges
+     * array remains in its most efficient form for storage and querying.
+     */
     compact() {
-        for (let i = 0; i < this.ranges.length; i++) {
-            let rangeA = this.ranges[i];
-            for (let j = i + 1; j < this.ranges.length; j++) {
-                let rangeB = this.ranges[j];
-                if (Ranges.overlaps(rangeA, rangeB)) {
-                    let [x1, y1] = rangeA;
-                    let [x2, y2] = rangeB;
-                    this.ranges[i] = [Math.min(x1, x2), Math.max(y1, y2)];
-                    this.ranges.splice(j, 1);
-                    j--;
-                    continue;
-                }
-            }
-        }
-        this.ranges = (0, alot_1.default)(this.ranges)
-            .sortBy(([x]) => x)
-            .toArray();
+        this.ranges = Ranges.compact(this.ranges);
     }
+    /**
+     * Sets the tracked ranges to a new array of ranges and compacts them.
+     *
+     * This method replaces the entire internal ranges array with the provided ranges,
+     * then automatically compacts them to merge any overlapping or adjacent ranges.
+     * This is useful for bulk initialization or restoration of ranges from a saved state.
+     *
+     * After setting the ranges, the method ensures the internal ranges array is optimized
+     * by calling `compact()`, which merges overlapping ranges and joins adjacent ones.
+     *
+     * @param ranges - An array of tuples [min, max] representing the ranges to set, where both bounds are inclusive
+     */
     set(ranges) {
         this.ranges = ranges;
         this.compact();
     }
+    /**
+     * Serializes the tracked ranges to a JSON string representation.
+     *
+     * This method converts the internal ranges array into a JSON string format,
+     * which can be used for persistence, transmission, or storage purposes.
+     * The serialized string can later be parsed and used to restore the ranges
+     * via the constructor's `ranges` option.
+     *
+     * @returns A JSON string representation of the tracked ranges array
+     */
     serialize() {
         return JSON.stringify(this.ranges);
     }
+    /**
+     * Creates a new PackedRanges instance containing only the ranges starting from a specified number.
+     *
+     * This method filters the tracked ranges to include only those that contain or come after
+     * the specified `from` value. If a range overlaps with the `from` value, it is trimmed
+     * to start at `from`. All ranges before `from` are excluded from the result.
+     *
+     * The original PackedRanges instance remains unchanged; a new instance is returned with
+     * the filtered ranges.
+     *
+     * @param from - The starting number from which to pick ranges (inclusive)
+     * @returns A new PackedRanges instance containing only the ranges from the specified number onwards
+     */
+    pickFrom(from) {
+        let arr = Ranges.pickFrom(this.ranges, from);
+        return new PackedRanges({ ranges: arr });
+    }
+    /**
+     * Creates a new PackedRanges instance containing only the ranges up to a specified number.
+     *
+     * This method filters the tracked ranges to include only those that contain or come before
+     * the specified `to` value. If a range overlaps with the `to` value, it is trimmed
+     * to end at `to`. All ranges after `to` are excluded from the result.
+     *
+     * The original PackedRanges instance remains unchanged; a new instance is returned with
+     * the filtered ranges.
+     *
+     * @param to - The ending number up to which to pick ranges (inclusive)
+     * @returns A new PackedRanges instance containing only the ranges up to the specified number
+     */
+    pickTo(to) {
+        let arr = Ranges.pickTo(this.ranges, to);
+        return new PackedRanges({ ranges: arr });
+    }
+    /**
+     * Computes the intersection of multiple range arrays, returning only the ranges that are common to all inputs.
+     *
+     * This method performs a set intersection operation across multiple arrays of ranges,
+     * finding only those number ranges that appear in every input array. The result is
+     * compacted to merge any overlapping or adjacent ranges for efficient storage.
+     *
+     * For example:
+     * - Input: [[[1,5], [10,15]], [[3,7], [12,20]]]
+     * - Output: [[3,5], [12,15]] (ranges common to both arrays)
+     *
+     * @param rangesArr - An array of range arrays, where each range array contains tuples [min, max] representing inclusive number ranges
+     * @returns A compacted array of ranges representing the intersection of all input range arrays, or an empty array if no common ranges exist or if the input is empty
+     */
+    static intersection(rangesArr) {
+        if (rangesArr.length === 0) {
+            return [];
+        }
+        let arr = Ranges.clone(rangesArr[0]);
+        for (let i = 1; i < rangesArr.length; i++) {
+            arr = Ranges.intersection(arr, rangesArr[i]);
+        }
+        return Ranges.compact(arr);
+    }
+    /**
+     * Computes the union of multiple range arrays, returning all ranges that appear in any of the inputs.
+     *
+     * This method performs a set union operation across multiple arrays of ranges,
+     * combining all number ranges from every input array. The result is compacted to
+     * merge any overlapping or adjacent ranges for efficient storage.
+     *
+     * For example:
+     * - Input: [[[1,5], [10,15]], [[3,7], [12,20]]]
+     * - Output: [[1,7], [10,20]] (all ranges merged and compacted)
+     *
+     * @param rangesArr - An array of range arrays, where each range array contains tuples [min, max] representing inclusive number ranges
+     * @returns A compacted array of ranges representing the union of all input range arrays, or an empty array if the input is empty
+     */
+    static union(rangesArr) {
+        let arr = (0, alot_1.default)(rangesArr)
+            .mapMany(x => x)
+            .toArray();
+        return Ranges.compact(arr);
+    }
+    /**
+     * Computes the difference between two range arrays, removing all ranges in B from ranges in A.
+     *
+     * This method performs a set difference operation (A − B), subtracting all number ranges
+     * in `rangesB` from `rangesA`. The result contains only those portions of `rangesA` that
+     * do not overlap with any range in `rangesB`. The result is compacted to merge any
+     * overlapping or adjacent ranges for efficient storage.
+     *
+     * For example:
+     * - Input: rangesA = [[1,10], [20,30]], rangesB = [[5,15], [25,35]]
+     * - Output: [[1,4], [20,24]] (parts of A not covered by B)
+     *
+     * @param rangesA - The array of ranges to subtract from, where each range is a tuple [min, max] representing inclusive number ranges
+     * @param rangesB - The array of ranges to subtract, where each range is a tuple [min, max] representing inclusive number ranges
+     * @returns A compacted array of ranges representing the difference (A − B), or an empty array if all of A is covered by B
+     */
+    static subtract(rangesA, rangesB) {
+        let arr = Ranges.subtractMany(rangesA, rangesB);
+        return Ranges.compact(arr);
+    }
+    static pickFrom(ranges, from) {
+        let arr = Ranges.pickFrom(ranges, from);
+        return arr;
+    }
+    static pickTo(ranges, to) {
+        let arr = Ranges.pickTo(ranges, to);
+        return arr;
+    }
 }
 exports.PackedRanges = PackedRanges;
-var Ranges;
-(function (Ranges) {
+var Range;
+(function (Range) {
+    // Check if two ranges overlap
     function overlaps(r1, r2) {
         let [x1, y1] = r1;
         let [x2, y2] = r2;
         let d = Math.min(y1, y2) - Math.max(x1, x2);
         return d > -1;
     }
-    Ranges.overlaps = overlaps;
+    Range.overlaps = overlaps;
+    // AND: A ∩ B
+    function intersection(r1, r2) {
+        let [x1, y1] = r1;
+        let [x2, y2] = r2;
+        let minY = Math.min(y1, y2);
+        let maxX = Math.max(x1, x2);
+        if (minY >= maxX) {
+            return [maxX, minY];
+        }
+        return null;
+    }
+    Range.intersection = intersection;
+})(Range || (Range = {}));
+var Ranges;
+(function (Ranges) {
+    function clone(ranges) {
+        let arr = [];
+        for (let [x, y] of ranges) {
+            arr.push([x, y]);
+        }
+        return arr;
+    }
+    Ranges.clone = clone;
+    // AND: A ∩ B
+    function intersection(rangesA, rangesB) {
+        let arr = [];
+        for (let i = 0; i < rangesA.length; i++) {
+            let rA = rangesA[i];
+            for (let j = 0; j < rangesB.length; j++) {
+                let union = Range.intersection(rA, rangesB[j]);
+                if (union) {
+                    arr.push(union);
+                    continue;
+                }
+            }
+        }
+        return arr;
+    }
+    Ranges.intersection = intersection;
+    function compact(ranges) {
+        for (let i = 0; i < ranges.length; i++) {
+            let rangeA = ranges[i];
+            for (let j = i + 1; j < ranges.length; j++) {
+                let rangeB = ranges[j];
+                if (Range.overlaps(rangeA, rangeB)) {
+                    let [x1, y1] = rangeA;
+                    let [x2, y2] = rangeB;
+                    ranges[i] = [Math.min(x1, x2), Math.max(y1, y2)];
+                    ranges.splice(j, 1);
+                    j--;
+                    continue;
+                }
+            }
+        }
+        ranges = (0, alot_1.default)(ranges)
+            .sortBy(([x]) => x)
+            .toArray();
+        // Join non overlapping ranges: [1,4],[5, 6] -> [1,6]
+        for (let i = 0; i < ranges.length - 1; i++) {
+            let A = ranges[i];
+            let B = ranges[i + 1];
+            let aLast = A[A.length - 1];
+            let bFirst = B[0];
+            if (aLast + 1 === bFirst) {
+                let bLast = B[B.length - 1];
+                A[A.length - 1] = bLast;
+                ranges.splice(i + 1, 1);
+            }
+        }
+        return ranges;
+    }
+    Ranges.compact = compact;
+    // Difference: A \ B
+    function subtract(ranges, range) {
+        let arr = [];
+        let [rmFrom, rmTo] = range;
+        for (let i = 0; i < ranges.length; i++) {
+            let A = ranges[i];
+            if (Range.overlaps(A, range) === false) {
+                arr.push(A);
+                continue;
+            }
+            let [Amin, Amax] = ranges[i];
+            if (Amin < rmFrom) {
+                arr.push([Amin, rmFrom - 1]);
+            }
+            if (Amax > rmTo) {
+                arr.push([rmTo + 1, Amax]);
+            }
+        }
+        return arr;
+    }
+    Ranges.subtract = subtract;
+    // Difference: A \ ∩B
+    function subtractMany(ranges, rangeArr) {
+        let arr = ranges;
+        for (let range of rangeArr) {
+            arr = subtract(arr, range);
+        }
+        return arr;
+    }
+    Ranges.subtractMany = subtractMany;
+    function pickFrom(ranges, from) {
+        if (ranges == null || ranges.length === 0) {
+            return [];
+        }
+        let arr = [];
+        for (let i = 0; i < ranges.length; i++) {
+            let A = ranges[i];
+            let aFirst = A[0];
+            let aLast = A[A.length - 1];
+            if (aLast < from) {
+                // This part is fully before from, ignore, search for the next part
+                continue;
+            }
+            if (from < aFirst) {
+                // No overlapping, pick all ranges
+                arr = ranges.slice(i).map(([x, y]) => [x, y]);
+                break;
+            }
+            let overlapped = [from, aLast];
+            arr = ranges.slice(i + 1).map(([x, y]) => [x, y]);
+            arr.unshift(overlapped);
+            break;
+        }
+        return arr;
+    }
+    Ranges.pickFrom = pickFrom;
+    function pickTo(ranges, to) {
+        if (ranges == null || ranges.length === 0) {
+            return [];
+        }
+        let arr = [];
+        for (let i = 0; i < ranges.length; i++) {
+            let A = ranges[i];
+            let aFirst = A[0];
+            let aLast = A[A.length - 1];
+            if (aFirst > to) {
+                // This part starts after 'to' => break (as sorted, next parts also start after 'to')
+                break;
+            }
+            if (aLast < to) {
+                // No overlapping, pick full range
+                arr.push([aFirst, aLast]);
+            }
+            else {
+                // Overlapps
+                arr.push([aFirst, to]);
+            }
+        }
+        return arr;
+    }
+    Ranges.pickTo = pickTo;
 })(Ranges || (Ranges = {}));
 //# sourceMappingURL=PackedRanges.js.map
 //# sourceMappingURL=PackedRanges.ts.map

package/lib/cjs/class/PackedRanges.js.map

@@ -1 +1 @@
-{"version":3,"file":"PackedRanges.js","sourceRoot":"","sources":["../../../src/class/PackedRanges.ts"],"names":[],"mappings":";;;;;;AAAA,gDAAwB;AAExB;;;;;;;;;GASG;AACH,MAAa,YAAY;IAMrB,YAAY,IAIX;QATS,WAAM,GAAuB,EAAE,CAAC;QAE1C,SAAI,GAAW,CAAC,CAAA;QASZ,IAAI,IAAI,IAAI,IAAI,EAAE;YACd,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;YAC5D,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;SACnC;IACL,CAAC;IAED,KAAK;QACD,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;YAC5B,OAAO,QAAQ,CAAC;SACnB;QACD,OAAO,GAAG,GAAG,GAAG,CAAC;IACrB,CAAC;IACD,UAAU;QACN,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;SAC1B;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,SAAS;QACL,OAAO,IAAI,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;IAC5C,CAAC;IAGD,IAAI;QACA,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;YAC1B,IAAI,CAAC,GAAG,GAAG,CAAC;YACZ,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,CAAC,CAAC;SACZ;QACD,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,GAAG,GAAG,KAAK,EAAE;YACb,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,OAAO,GAAG,CAAC;SACd;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YAC3B,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEpC,IAAI,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;YACrB,IAAI,IAAI,GAAG,KAAK,EAAE;gBACd,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACzB,OAAO,IAAI,CAAC;aACf;YACD,IAAI,IAAI,KAAK,KAAK,EAAE;gBAChB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;gBAC1B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzB,SAAS;aACZ;YACD,MAAM,IAAI,KAAK,CAAC,0BAA0B,KAAK,YAAY,KAAK,EAAE,CAAC,CAAC;SACvE;QAED,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAE9B,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,EAAE,EAAE;YACrC,OAAO,IAAI,CAAC;SACf;QAED,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QAC1B,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,MAAM;QACF,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;YAC1B,OAAO,IAAI,CAAC;SACf;QACD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5C,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IAED,QAAQ,CAAC,EAAU;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;gBACpB,OAAO,IAAI,CAAC;aACf;SACJ;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,GAAG,CAAC,EAAU;QACV,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;gBACpB,OAAO,KAAK,CAAC;aAChB;YACD,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE;gBACd,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACvB,QAAQ,GAAG,IAAI,CAAC;gBAChB,MAAM;aACT;YACD,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE;gBACd,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACvB,QAAQ,GAAG,IAAI,CAAC;gBAChB,MAAM;aACT;SACJ;QACD,IAAI,QAAQ,KAAK,KAAK,EAAE;YACpB,SAAS;YACT,IAAI,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAqB,CAAC;YACvC,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACzC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,EAAE,GAAG,CAAC,EAAE;oBACR,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;oBAC9B,QAAQ,GAAG,IAAI,CAAC;oBAChB,MAAM;iBACT;aACJ;YACD,IAAI,QAAQ,KAAK,KAAK,EAAE;gBACpB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;aACzB;SACJ;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,MAAM,CAAE,EAAU;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,GAAG,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,EAAE;gBAExB,IAAI,GAAG,KAAK,GAAG,EAAE;oBACb,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACzB,OAAO,IAAI,CAAC;iBACf;gBACD,IAAI,GAAG,KAAK,EAAE,EAAE;oBACZ,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;oBAC5B,OAAO,IAAI,CAAC;iBACf;gBACD,IAAI,GAAG,KAAK,EAAE,EAAE;oBACZ,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;oBAC5B,OAAO,IAAI,CAAC;iBACf;gBAED,IAAI,IAAI,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,CAAsB,CAAC;gBAC9C,IAAI,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAsB,CAAC;gBAC9C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBACrC,OAAO,IAAI,CAAC;aACf;SACJ;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,OAAO;QACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC7C,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE;oBACjC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC;oBACtB,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC;oBAEtB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBACtD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACzB,CAAC,EAAE,CAAC;oBACJ,SAAS;iBACZ;aACJ;SACJ;QAED,IAAI,CAAC,MAAM,GAAG,IAAA,cAAI,EAAC,IAAI,CAAC,MAAM,CAAC;aAC1B,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;aAClB,OAAO,EAAE,CAAC;IACnB,CAAC;IAED,GAAG,CAAC,MAA0B;QAC1B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,OAAO,EAAE,CAAC;IACnB,CAAC;IACD,SAAS;QACL,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvC,CAAC;CACJ;AA5LD,oCA4LC;AAID,IAAU,MAAM,CAQf;AARD,WAAU,MAAM;IACZ,SAAgB,QAAQ,CAAE,EAAoB,EAAE,EAAoB;QAChE,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAE5C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;IAClB,CAAC;IANe,eAAQ,WAMvB,CAAA;AACL,CAAC,EARS,MAAM,KAAN,MAAM,QAQf"}
+{"version":3,"file":"PackedRanges.js","sourceRoot":"","sources":["../../../src/class/PackedRanges.ts"],"names":[],"mappings":";;;;;;AAAA,gDAAwB;AAExB;;;;;;;;;GASG;AACH,MAAa,YAAY;IAMrB,YAAY,IAIX;QATS,WAAM,GAAuB,EAAE,CAAC;QAE1C,SAAI,GAAW,CAAC,CAAA;QASZ,IAAI,IAAI,IAAI,IAAI,EAAE;YACd,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;YAC5D,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;SACnC;IACL,CAAC;IAED,+EAA+E;IAC/E,KAAK;QACD,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;YAC5B,OAAO,QAAQ,CAAC;SACnB;QACD,OAAO,GAAG,GAAG,GAAG,CAAC;IACrB,CAAC;IACD,yEAAyE;IACzE,UAAU;QACN,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;SAC1B;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,SAAS;QACL,OAAO,IAAI,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;IAC5C,CAAC;IAGD;;;;;;;;;;;;;;;OAeG;IACH,IAAI;QACA,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;YAC1B,IAAI,CAAC,GAAG,GAAG,CAAC;YACZ,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,CAAC,CAAC;SACZ;QACD,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,GAAG,GAAG,KAAK,EAAE;YACb,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,OAAO,GAAG,CAAC;SACd;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YAC3B,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEpC,IAAI,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;YACrB,IAAI,IAAI,GAAG,KAAK,EAAE;gBACd,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACzB,OAAO,IAAI,CAAC;aACf;YACD,IAAI,IAAI,KAAK,KAAK,EAAE;gBAChB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;gBAC1B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzB,SAAS;aACZ;YACD,MAAM,IAAI,KAAK,CAAC,0BAA0B,KAAK,YAAY,KAAK,EAAE,CAAC,CAAC;SACvE;QAED,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAE9B,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,EAAE,EAAE;YACrC,OAAO,IAAI,CAAC;SACf;QAED,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QAC1B,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;;OAOG;IACH,MAAM;QACF,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;YAC1B,OAAO,IAAI,CAAC;SACf;QACD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5C,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IAED;;;;;;;;;OASG;IACH,QAAQ,CAAC,EAAU;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;gBACpB,OAAO,IAAI,CAAC;aACf;SACJ;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH,GAAG,CAAC,EAAU;QACV,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;gBACpB,OAAO,KAAK,CAAC;aAChB;YACD,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE;gBACd,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACvB,QAAQ,GAAG,IAAI,CAAC;gBAChB,MAAM;aACT;YACD,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE;gBACd,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACvB,QAAQ,GAAG,IAAI,CAAC;gBAChB,MAAM;aACT;SACJ;QACD,IAAI,QAAQ,KAAK,KAAK,EAAE;YACpB,SAAS;YACT,IAAI,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAqB,CAAC;YACvC,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACzC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,EAAE,GAAG,CAAC,EAAE;oBACR,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;oBAC9B,QAAQ,GAAG,IAAI,CAAC;oBAChB,MAAM;iBACT;aACJ;YACD,IAAI,QAAQ,KAAK,KAAK,EAAE;gBACpB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;aACzB;SACJ;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,QAAQ,CAAC,KAAuB;QAC5B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,IAAI,CAAC,OAAO,EAAE,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,MAAM,CAAC,EAAU;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,GAAG,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,EAAE;gBAExB,IAAI,GAAG,KAAK,GAAG,EAAE;oBACb,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACzB,OAAO,IAAI,CAAC;iBACf;gBACD,IAAI,GAAG,KAAK,EAAE,EAAE;oBACZ,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;oBAC5B,OAAO,IAAI,CAAC;iBACf;gBACD,IAAI,GAAG,KAAK,EAAE,EAAE;oBACZ,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;oBAC5B,OAAO,IAAI,CAAC;iBACf;gBAED,IAAI,IAAI,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,CAAqB,CAAC;gBAC7C,IAAI,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAqB,CAAC;gBAC7C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBACrC,OAAO,IAAI,CAAC;aACf;SACJ;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,aAAa,CAAC,KAAuB;QACjC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,cAAc,CAAC,MAA0B;QACrC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,OAAO;QACH,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED;;;;;;;;;;;OAWG;IACH,GAAG,CAAC,MAA0B;QAC1B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,OAAO,EAAE,CAAC;IACnB,CAAC;IAED;;;;;;;;;OASG;IACH,SAAS;QACL,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvC,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,IAAY;QACjB,IAAI,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC7C,OAAO,IAAI,YAAY,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,MAAM,CAAC,EAAU;QACb,IAAI,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACzC,OAAO,IAAI,YAAY,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;IAC7C,CAAC;IAGD;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,YAAY,CAAC,SAAiC;QACjD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;YACxB,OAAO,EAAE,CAAC;SACb;QACD,IAAI,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACvC,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;SAChD;QACD,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,KAAK,CAAC,SAAiC;QAC1C,IAAI,GAAG,GAAG,IAAA,cAAI,EAAC,SAAS,CAAC;aACpB,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aACf,OAAO,EAAE,CAAC;QACf,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,MAAM,CAAC,QAAQ,CAAC,OAA2B,EAAE,OAA2B;QACpE,IAAI,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAChD,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAGD,MAAM,CAAC,QAAQ,CAAC,MAA0B,EAAE,IAAY;QACpD,IAAI,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACxC,OAAO,GAAG,CAAC;IACf,CAAC;IAED,MAAM,CAAC,MAAM,CAAC,MAA0B,EAAE,EAAU;QAChD,IAAI,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACpC,OAAO,GAAG,CAAC;IACf,CAAC;CACJ;AAjcD,oCAicC;AAED,IAAU,KAAK,CAsBd;AAtBD,WAAU,KAAK;IAEX,8BAA8B;IAC9B,SAAgB,QAAQ,CAAC,EAAoB,EAAE,EAAoB;QAC/D,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;IAClB,CAAC;IALe,cAAQ,WAKvB,CAAA;IAED,aAAa;IACb,SAAgB,YAAY,CAAC,EAAoB,EAAE,EAAoB;QACnE,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC;QAClB,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5B,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5B,IAAI,IAAI,IAAI,IAAI,EAAE;YACd,OAAO,CAAC,IAAI,EAAE,IAAI,CAAqB,CAAC;SAC3C;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IATe,kBAAY,eAS3B,CAAA;AAEL,CAAC,EAtBS,KAAK,KAAL,KAAK,QAsBd;AAID,IAAU,MAAM,CA+If;AA/ID,WAAU,MAAM;IACZ,SAAgB,KAAK,CAAC,MAA0B;QAC5C,IAAI,GAAG,GAAG,EAAwB,CAAC;QACnC,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE;YACvB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;SACpB;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IANe,YAAK,QAMpB,CAAA;IAED,aAAa;IACb,SAAgB,YAAY,CAAC,OAA2B,EAAE,OAA2B;QACjF,IAAI,GAAG,GAAG,EAAwB,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,IAAI,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACrC,IAAI,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/C,IAAI,KAAK,EAAE;oBACP,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAChB,SAAS;iBACZ;aACJ;SACJ;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAbe,mBAAY,eAa3B,CAAA;IAED,SAAgB,OAAO,CAAE,MAA0B;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,IAAI,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACxC,IAAI,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE;oBAChC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC;oBACtB,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC;oBAEtB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBACjD,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACpB,CAAC,EAAE,CAAC;oBACJ,SAAS;iBACZ;aACJ;SACJ;QAED,MAAM,GAAG,IAAA,cAAI,EAAC,MAAM,CAAC;aAChB,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;aAClB,OAAO,EAAE,CAAC;QAEf,qDAAqD;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACxC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC5B,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,KAAK,GAAG,CAAC,KAAK,MAAM,EAAE;gBACtB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAC5B,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;gBACxB,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;aAC3B;SACJ;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAnCe,cAAO,UAmCtB,CAAA;IAED,oBAAoB;IACpB,SAAgB,QAAQ,CAAC,MAAyB,EAAE,KAAuB;QACvE,IAAI,GAAG,GAAG,EAAwB,CAAC;QACnC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,KAAK,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,KAAK,EAAE;gBACpC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACZ,SAAS;aACZ;YACD,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,IAAI,GAAG,MAAM,EAAE;gBACf,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;aAChC;YACD,IAAI,IAAI,GAAG,IAAI,EAAE;gBACb,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;aAC9B;SACJ;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAlBe,eAAQ,WAkBvB,CAAA;IAED,qBAAqB;IACrB,SAAgB,YAAY,CAAC,MAAyB,EAAE,QAA4B;QAChF,IAAI,GAAG,GAAG,MAAM,CAAC;QACjB,KAAK,IAAI,KAAK,IAAI,QAAQ,EAAE;YACxB,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;SAC9B;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IANe,mBAAY,eAM3B,CAAA;IAED,SAAgB,QAAQ,CAAC,MAA0B,EAAE,IAAY;QAC7D,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;YACvC,OAAO,EAAE,CAAC;SACb;QACD,IAAI,GAAG,GAAG,EAAwB,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC5B,IAAI,KAAK,GAAG,IAAI,EAAE;gBACd,mEAAmE;gBACnE,SAAS;aACZ;YACD,IAAI,IAAI,GAAG,MAAM,EAAE;gBACf,kCAAkC;gBAClC,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC9C,MAAM;aACT;YACD,IAAI,UAAU,GAAG,CAAC,IAAI,EAAE,KAAK,CAAqB,CAAC;YACnD,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClD,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAA;YACvB,MAAM;SACT;QACD,OAAO,GAAG,CAAA;IACd,CAAC;IAxBe,eAAQ,WAwBvB,CAAA;IAED,SAAgB,MAAM,CAAC,MAA0B,EAAE,EAAU;QACzD,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;YACvC,OAAO,EAAE,CAAC;SACb;QACD,IAAI,GAAG,GAAG,EAAwB,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAE5B,IAAI,MAAM,GAAG,EAAE,EAAE;gBACb,qFAAqF;gBACrF,MAAM;aACT;YAED,IAAI,KAAK,GAAG,EAAE,EAAE;gBACZ,kCAAkC;gBAClC,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;aAC7B;iBAAM;gBACH,YAAY;gBACZ,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;aAC1B;SACJ;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAxBe,aAAM,SAwBrB,CAAA;AACL,CAAC,EA/IS,MAAM,KAAN,MAAM,QA+If"}

package/lib/cjs/clients/Web3Client.js

@@ -523,7 +523,8 @@ var RangeWorker;
                 blocks: perf.blocks,
                 blocksPerSecond: Number(blocksPerSecFormatted),
                 timeLeftSeconds: leftSeconds,
-                completed: cursor >= toBlock
+                completed: cursor >= toBlock,
+                infos: { fetched: perf.blocks.loaded, cached: 0 }
             });
             let lastNodeStats = Date.now() - nodeStats;
             if (lastNodeStats > 30 * 1000) {