@fragno-dev/workflows 0.0.1

package/dist/node/node_modules/.pnpm/long@5.3.2/node_modules/long/umd/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":["exports"],"sources":["../../../../../../../../../../node_modules/.pnpm/long@5.3.2/node_modules/long/umd/index.js"],"sourcesContent":["// GENERATED FILE. DO NOT EDIT.\n(function (global, factory) {\n  function preferDefault(exports) {\n    return exports.default || exports;\n  }\n  if (typeof define === \"function\" && define.amd) {\n    define([], function () {\n      var exports = {};\n      factory(exports);\n      return preferDefault(exports);\n    });\n  } else if (typeof exports === \"object\") {\n    factory(exports);\n    if (typeof module === \"object\") module.exports = preferDefault(exports);\n  } else {\n    (function () {\n      var exports = {};\n      factory(exports);\n      global.Long = preferDefault(exports);\n    })();\n  }\n})(\n  typeof globalThis !== \"undefined\"\n    ? globalThis\n    : typeof self !== \"undefined\"\n      ? self\n      : this,\n  function (_exports) {\n    \"use strict\";\n\n    Object.defineProperty(_exports, \"__esModule\", {\n      value: true,\n    });\n    _exports.default = void 0;\n    /**\n     * @license\n     * Copyright 2009 The Closure Library Authors\n     * Copyright 2020 Daniel Wirtz / The long.js Authors.\n     *\n     * Licensed under the Apache License, Version 2.0 (the \"License\");\n     * you may not use this file except in compliance with the License.\n     * You may obtain a copy of the License at\n     *\n     *     http://www.apache.org/licenses/LICENSE-2.0\n     *\n     * Unless required by applicable law or agreed to in writing, software\n     * distributed under the License is distributed on an \"AS IS\" BASIS,\n     * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n     * See the License for the specific language governing permissions and\n     * limitations under the License.\n     *\n     * SPDX-License-Identifier: Apache-2.0\n     */\n\n    // WebAssembly optimizations to do native i64 multiplication and divide\n    var wasm = null;\n    try {\n      wasm = new WebAssembly.Instance(\n        new WebAssembly.Module(\n          new Uint8Array([\n            // \\0asm\n            0, 97, 115, 109,\n            // version 1\n            1, 0, 0, 0,\n            // section \"type\"\n            1, 13, 2,\n            // 0, () => i32\n            96, 0, 1, 127,\n            // 1, (i32, i32, i32, i32) => i32\n            96, 4, 127, 127, 127, 127, 1, 127,\n            // section \"function\"\n            3, 7, 6,\n            // 0, type 0\n            0,\n            // 1, type 1\n            1,\n            // 2, type 1\n            1,\n            // 3, type 1\n            1,\n            // 4, type 1\n            1,\n            // 5, type 1\n            1,\n            // section \"global\"\n            6, 6, 1,\n            // 0, \"high\", mutable i32\n            127, 1, 65, 0, 11,\n            // section \"export\"\n            7, 50, 6,\n            // 0, \"mul\"\n            3, 109, 117, 108, 0, 1,\n            // 1, \"div_s\"\n            5, 100, 105, 118, 95, 115, 0, 2,\n            // 2, \"div_u\"\n            5, 100, 105, 118, 95, 117, 0, 3,\n            // 3, \"rem_s\"\n            5, 114, 101, 109, 95, 115, 0, 4,\n            // 4, \"rem_u\"\n            5, 114, 101, 109, 95, 117, 0, 5,\n            // 5, \"get_high\"\n            8, 103, 101, 116, 95, 104, 105, 103, 104, 0, 0,\n            // section \"code\"\n            10, 191, 1, 6,\n            // 0, \"get_high\"\n            4, 0, 35, 0, 11,\n            // 1, \"mul\"\n            36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173,\n            32, 3, 173, 66, 32, 134, 132, 126, 34, 4, 66, 32, 135, 167, 36, 0,\n            32, 4, 167, 11,\n            // 2, \"div_s\"\n            36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173,\n            32, 3, 173, 66, 32, 134, 132, 127, 34, 4, 66, 32, 135, 167, 36, 0,\n            32, 4, 167, 11,\n            // 3, \"div_u\"\n            36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173,\n            32, 3, 173, 66, 32, 134, 132, 128, 34, 4, 66, 32, 135, 167, 36, 0,\n            32, 4, 167, 11,\n            // 4, \"rem_s\"\n            36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173,\n            32, 3, 173, 66, 32, 134, 132, 129, 34, 4, 66, 32, 135, 167, 36, 0,\n            32, 4, 167, 11,\n            // 5, \"rem_u\"\n            36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173,\n            32, 3, 173, 66, 32, 134, 132, 130, 34, 4, 66, 32, 135, 167, 36, 0,\n            32, 4, 167, 11,\n          ]),\n        ),\n        {},\n      ).exports;\n    } catch {\n      // no wasm support :(\n    }\n\n    /**\n     * Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as *signed* integers.\n     *  See the from* functions below for more convenient ways of constructing Longs.\n     * @exports Long\n     * @class A Long class for representing a 64 bit two's-complement integer value.\n     * @param {number} low The low (signed) 32 bits of the long\n     * @param {number} high The high (signed) 32 bits of the long\n     * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n     * @constructor\n     */\n    function Long(low, high, unsigned) {\n      /**\n       * The low 32 bits as a signed value.\n       * @type {number}\n       */\n      this.low = low | 0;\n\n      /**\n       * The high 32 bits as a signed value.\n       * @type {number}\n       */\n      this.high = high | 0;\n\n      /**\n       * Whether unsigned or not.\n       * @type {boolean}\n       */\n      this.unsigned = !!unsigned;\n    }\n\n    // The internal representation of a long is the two given signed, 32-bit values.\n    // We use 32-bit pieces because these are the size of integers on which\n    // Javascript performs bit-operations.  For operations like addition and\n    // multiplication, we split each number into 16 bit pieces, which can easily be\n    // multiplied within Javascript's floating-point representation without overflow\n    // or change in sign.\n    //\n    // In the algorithms below, we frequently reduce the negative case to the\n    // positive case by negating the input(s) and then post-processing the result.\n    // Note that we must ALWAYS check specially whether those values are MIN_VALUE\n    // (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as\n    // a positive number, it overflows back into a negative).  Not handling this\n    // case would often result in infinite recursion.\n    //\n    // Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the from*\n    // methods on which they depend.\n\n    /**\n     * An indicator used to reliably determine if an object is a Long or not.\n     * @type {boolean}\n     * @const\n     * @private\n     */\n    Long.prototype.__isLong__;\n    Object.defineProperty(Long.prototype, \"__isLong__\", {\n      value: true,\n    });\n\n    /**\n     * @function\n     * @param {*} obj Object\n     * @returns {boolean}\n     * @inner\n     */\n    function isLong(obj) {\n      return (obj && obj[\"__isLong__\"]) === true;\n    }\n\n    /**\n     * @function\n     * @param {*} value number\n     * @returns {number}\n     * @inner\n     */\n    function ctz32(value) {\n      var c = Math.clz32(value & -value);\n      return value ? 31 - c : c;\n    }\n\n    /**\n     * Tests if the specified object is a Long.\n     * @function\n     * @param {*} obj Object\n     * @returns {boolean}\n     */\n    Long.isLong = isLong;\n\n    /**\n     * A cache of the Long representations of small integer values.\n     * @type {!Object}\n     * @inner\n     */\n    var INT_CACHE = {};\n\n    /**\n     * A cache of the Long representations of small unsigned integer values.\n     * @type {!Object}\n     * @inner\n     */\n    var UINT_CACHE = {};\n\n    /**\n     * @param {number} value\n     * @param {boolean=} unsigned\n     * @returns {!Long}\n     * @inner\n     */\n    function fromInt(value, unsigned) {\n      var obj, cachedObj, cache;\n      if (unsigned) {\n        value >>>= 0;\n        if ((cache = 0 <= value && value < 256)) {\n          cachedObj = UINT_CACHE[value];\n          if (cachedObj) return cachedObj;\n        }\n        obj = fromBits(value, 0, true);\n        if (cache) UINT_CACHE[value] = obj;\n        return obj;\n      } else {\n        value |= 0;\n        if ((cache = -128 <= value && value < 128)) {\n          cachedObj = INT_CACHE[value];\n          if (cachedObj) return cachedObj;\n        }\n        obj = fromBits(value, value < 0 ? -1 : 0, false);\n        if (cache) INT_CACHE[value] = obj;\n        return obj;\n      }\n    }\n\n    /**\n     * Returns a Long representing the given 32 bit integer value.\n     * @function\n     * @param {number} value The 32 bit integer in question\n     * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n     * @returns {!Long} The corresponding Long value\n     */\n    Long.fromInt = fromInt;\n\n    /**\n     * @param {number} value\n     * @param {boolean=} unsigned\n     * @returns {!Long}\n     * @inner\n     */\n    function fromNumber(value, unsigned) {\n      if (isNaN(value)) return unsigned ? UZERO : ZERO;\n      if (unsigned) {\n        if (value < 0) return UZERO;\n        if (value >= TWO_PWR_64_DBL) return MAX_UNSIGNED_VALUE;\n      } else {\n        if (value <= -TWO_PWR_63_DBL) return MIN_VALUE;\n        if (value + 1 >= TWO_PWR_63_DBL) return MAX_VALUE;\n      }\n      if (value < 0) return fromNumber(-value, unsigned).neg();\n      return fromBits(\n        value % TWO_PWR_32_DBL | 0,\n        (value / TWO_PWR_32_DBL) | 0,\n        unsigned,\n      );\n    }\n\n    /**\n     * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.\n     * @function\n     * @param {number} value The number in question\n     * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n     * @returns {!Long} The corresponding Long value\n     */\n    Long.fromNumber = fromNumber;\n\n    /**\n     * @param {number} lowBits\n     * @param {number} highBits\n     * @param {boolean=} unsigned\n     * @returns {!Long}\n     * @inner\n     */\n    function fromBits(lowBits, highBits, unsigned) {\n      return new Long(lowBits, highBits, unsigned);\n    }\n\n    /**\n     * Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is\n     *  assumed to use 32 bits.\n     * @function\n     * @param {number} lowBits The low 32 bits\n     * @param {number} highBits The high 32 bits\n     * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n     * @returns {!Long} The corresponding Long value\n     */\n    Long.fromBits = fromBits;\n\n    /**\n     * @function\n     * @param {number} base\n     * @param {number} exponent\n     * @returns {number}\n     * @inner\n     */\n    var pow_dbl = Math.pow; // Used 4 times (4*8 to 15+4)\n\n    /**\n     * @param {string} str\n     * @param {(boolean|number)=} unsigned\n     * @param {number=} radix\n     * @returns {!Long}\n     * @inner\n     */\n    function fromString(str, unsigned, radix) {\n      if (str.length === 0) throw Error(\"empty string\");\n      if (typeof unsigned === \"number\") {\n        // For goog.math.long compatibility\n        radix = unsigned;\n        unsigned = false;\n      } else {\n        unsigned = !!unsigned;\n      }\n      if (\n        str === \"NaN\" ||\n        str === \"Infinity\" ||\n        str === \"+Infinity\" ||\n        str === \"-Infinity\"\n      )\n        return unsigned ? UZERO : ZERO;\n      radix = radix || 10;\n      if (radix < 2 || 36 < radix) throw RangeError(\"radix\");\n      var p;\n      if ((p = str.indexOf(\"-\")) > 0) throw Error(\"interior hyphen\");\n      else if (p === 0) {\n        return fromString(str.substring(1), unsigned, radix).neg();\n      }\n\n      // Do several (8) digits each time through the loop, so as to\n      // minimize the calls to the very expensive emulated div.\n      var radixToPower = fromNumber(pow_dbl(radix, 8));\n      var result = ZERO;\n      for (var i = 0; i < str.length; i += 8) {\n        var size = Math.min(8, str.length - i),\n          value = parseInt(str.substring(i, i + size), radix);\n        if (size < 8) {\n          var power = fromNumber(pow_dbl(radix, size));\n          result = result.mul(power).add(fromNumber(value));\n        } else {\n          result = result.mul(radixToPower);\n          result = result.add(fromNumber(value));\n        }\n      }\n      result.unsigned = unsigned;\n      return result;\n    }\n\n    /**\n     * Returns a Long representation of the given string, written using the specified radix.\n     * @function\n     * @param {string} str The textual representation of the Long\n     * @param {(boolean|number)=} unsigned Whether unsigned or not, defaults to signed\n     * @param {number=} radix The radix in which the text is written (2-36), defaults to 10\n     * @returns {!Long} The corresponding Long value\n     */\n    Long.fromString = fromString;\n\n    /**\n     * @function\n     * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val\n     * @param {boolean=} unsigned\n     * @returns {!Long}\n     * @inner\n     */\n    function fromValue(val, unsigned) {\n      if (typeof val === \"number\") return fromNumber(val, unsigned);\n      if (typeof val === \"string\") return fromString(val, unsigned);\n      // Throws for non-objects, converts non-instanceof Long:\n      return fromBits(\n        val.low,\n        val.high,\n        typeof unsigned === \"boolean\" ? unsigned : val.unsigned,\n      );\n    }\n\n    /**\n     * Converts the specified value to a Long using the appropriate from* function for its type.\n     * @function\n     * @param {!Long|number|bigint|string|!{low: number, high: number, unsigned: boolean}} val Value\n     * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n     * @returns {!Long}\n     */\n    Long.fromValue = fromValue;\n\n    // NOTE: the compiler should inline these constant values below and then remove these variables, so there should be\n    // no runtime penalty for these.\n\n    /**\n     * @type {number}\n     * @const\n     * @inner\n     */\n    var TWO_PWR_16_DBL = 1 << 16;\n\n    /**\n     * @type {number}\n     * @const\n     * @inner\n     */\n    var TWO_PWR_24_DBL = 1 << 24;\n\n    /**\n     * @type {number}\n     * @const\n     * @inner\n     */\n    var TWO_PWR_32_DBL = TWO_PWR_16_DBL * TWO_PWR_16_DBL;\n\n    /**\n     * @type {number}\n     * @const\n     * @inner\n     */\n    var TWO_PWR_64_DBL = TWO_PWR_32_DBL * TWO_PWR_32_DBL;\n\n    /**\n     * @type {number}\n     * @const\n     * @inner\n     */\n    var TWO_PWR_63_DBL = TWO_PWR_64_DBL / 2;\n\n    /**\n     * @type {!Long}\n     * @const\n     * @inner\n     */\n    var TWO_PWR_24 = fromInt(TWO_PWR_24_DBL);\n\n    /**\n     * @type {!Long}\n     * @inner\n     */\n    var ZERO = fromInt(0);\n\n    /**\n     * Signed zero.\n     * @type {!Long}\n     */\n    Long.ZERO = ZERO;\n\n    /**\n     * @type {!Long}\n     * @inner\n     */\n    var UZERO = fromInt(0, true);\n\n    /**\n     * Unsigned zero.\n     * @type {!Long}\n     */\n    Long.UZERO = UZERO;\n\n    /**\n     * @type {!Long}\n     * @inner\n     */\n    var ONE = fromInt(1);\n\n    /**\n     * Signed one.\n     * @type {!Long}\n     */\n    Long.ONE = ONE;\n\n    /**\n     * @type {!Long}\n     * @inner\n     */\n    var UONE = fromInt(1, true);\n\n    /**\n     * Unsigned one.\n     * @type {!Long}\n     */\n    Long.UONE = UONE;\n\n    /**\n     * @type {!Long}\n     * @inner\n     */\n    var NEG_ONE = fromInt(-1);\n\n    /**\n     * Signed negative one.\n     * @type {!Long}\n     */\n    Long.NEG_ONE = NEG_ONE;\n\n    /**\n     * @type {!Long}\n     * @inner\n     */\n    var MAX_VALUE = fromBits(0xffffffff | 0, 0x7fffffff | 0, false);\n\n    /**\n     * Maximum signed value.\n     * @type {!Long}\n     */\n    Long.MAX_VALUE = MAX_VALUE;\n\n    /**\n     * @type {!Long}\n     * @inner\n     */\n    var MAX_UNSIGNED_VALUE = fromBits(0xffffffff | 0, 0xffffffff | 0, true);\n\n    /**\n     * Maximum unsigned value.\n     * @type {!Long}\n     */\n    Long.MAX_UNSIGNED_VALUE = MAX_UNSIGNED_VALUE;\n\n    /**\n     * @type {!Long}\n     * @inner\n     */\n    var MIN_VALUE = fromBits(0, 0x80000000 | 0, false);\n\n    /**\n     * Minimum signed value.\n     * @type {!Long}\n     */\n    Long.MIN_VALUE = MIN_VALUE;\n\n    /**\n     * @alias Long.prototype\n     * @inner\n     */\n    var LongPrototype = Long.prototype;\n\n    /**\n     * Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.\n     * @this {!Long}\n     * @returns {number}\n     */\n    LongPrototype.toInt = function toInt() {\n      return this.unsigned ? this.low >>> 0 : this.low;\n    };\n\n    /**\n     * Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).\n     * @this {!Long}\n     * @returns {number}\n     */\n    LongPrototype.toNumber = function toNumber() {\n      if (this.unsigned)\n        return (this.high >>> 0) * TWO_PWR_32_DBL + (this.low >>> 0);\n      return this.high * TWO_PWR_32_DBL + (this.low >>> 0);\n    };\n\n    /**\n     * Converts the Long to a string written in the specified radix.\n     * @this {!Long}\n     * @param {number=} radix Radix (2-36), defaults to 10\n     * @returns {string}\n     * @override\n     * @throws {RangeError} If `radix` is out of range\n     */\n    LongPrototype.toString = function toString(radix) {\n      radix = radix || 10;\n      if (radix < 2 || 36 < radix) throw RangeError(\"radix\");\n      if (this.isZero()) return \"0\";\n      if (this.isNegative()) {\n        // Unsigned Longs are never negative\n        if (this.eq(MIN_VALUE)) {\n          // We need to change the Long value before it can be negated, so we remove\n          // the bottom-most digit in this base and then recurse to do the rest.\n          var radixLong = fromNumber(radix),\n            div = this.div(radixLong),\n            rem1 = div.mul(radixLong).sub(this);\n          return div.toString(radix) + rem1.toInt().toString(radix);\n        } else return \"-\" + this.neg().toString(radix);\n      }\n\n      // Do several (6) digits each time through the loop, so as to\n      // minimize the calls to the very expensive emulated div.\n      var radixToPower = fromNumber(pow_dbl(radix, 6), this.unsigned),\n        rem = this;\n      var result = \"\";\n      while (true) {\n        var remDiv = rem.div(radixToPower),\n          intval = rem.sub(remDiv.mul(radixToPower)).toInt() >>> 0,\n          digits = intval.toString(radix);\n        rem = remDiv;\n        if (rem.isZero()) return digits + result;\n        else {\n          while (digits.length < 6) digits = \"0\" + digits;\n          result = \"\" + digits + result;\n        }\n      }\n    };\n\n    /**\n     * Gets the high 32 bits as a signed integer.\n     * @this {!Long}\n     * @returns {number} Signed high bits\n     */\n    LongPrototype.getHighBits = function getHighBits() {\n      return this.high;\n    };\n\n    /**\n     * Gets the high 32 bits as an unsigned integer.\n     * @this {!Long}\n     * @returns {number} Unsigned high bits\n     */\n    LongPrototype.getHighBitsUnsigned = function getHighBitsUnsigned() {\n      return this.high >>> 0;\n    };\n\n    /**\n     * Gets the low 32 bits as a signed integer.\n     * @this {!Long}\n     * @returns {number} Signed low bits\n     */\n    LongPrototype.getLowBits = function getLowBits() {\n      return this.low;\n    };\n\n    /**\n     * Gets the low 32 bits as an unsigned integer.\n     * @this {!Long}\n     * @returns {number} Unsigned low bits\n     */\n    LongPrototype.getLowBitsUnsigned = function getLowBitsUnsigned() {\n      return this.low >>> 0;\n    };\n\n    /**\n     * Gets the number of bits needed to represent the absolute value of this Long.\n     * @this {!Long}\n     * @returns {number}\n     */\n    LongPrototype.getNumBitsAbs = function getNumBitsAbs() {\n      if (this.isNegative())\n        // Unsigned Longs are never negative\n        return this.eq(MIN_VALUE) ? 64 : this.neg().getNumBitsAbs();\n      var val = this.high != 0 ? this.high : this.low;\n      for (var bit = 31; bit > 0; bit--) if ((val & (1 << bit)) != 0) break;\n      return this.high != 0 ? bit + 33 : bit + 1;\n    };\n\n    /**\n     * Tests if this Long can be safely represented as a JavaScript number.\n     * @this {!Long}\n     * @returns {boolean}\n     */\n    LongPrototype.isSafeInteger = function isSafeInteger() {\n      // 2^53-1 is the maximum safe value\n      var top11Bits = this.high >> 21;\n      // [0, 2^53-1]\n      if (!top11Bits) return true;\n      // > 2^53-1\n      if (this.unsigned) return false;\n      // [-2^53, -1] except -2^53\n      return top11Bits === -1 && !(this.low === 0 && this.high === -0x200000);\n    };\n\n    /**\n     * Tests if this Long's value equals zero.\n     * @this {!Long}\n     * @returns {boolean}\n     */\n    LongPrototype.isZero = function isZero() {\n      return this.high === 0 && this.low === 0;\n    };\n\n    /**\n     * Tests if this Long's value equals zero. This is an alias of {@link Long#isZero}.\n     * @returns {boolean}\n     */\n    LongPrototype.eqz = LongPrototype.isZero;\n\n    /**\n     * Tests if this Long's value is negative.\n     * @this {!Long}\n     * @returns {boolean}\n     */\n    LongPrototype.isNegative = function isNegative() {\n      return !this.unsigned && this.high < 0;\n    };\n\n    /**\n     * Tests if this Long's value is positive or zero.\n     * @this {!Long}\n     * @returns {boolean}\n     */\n    LongPrototype.isPositive = function isPositive() {\n      return this.unsigned || this.high >= 0;\n    };\n\n    /**\n     * Tests if this Long's value is odd.\n     * @this {!Long}\n     * @returns {boolean}\n     */\n    LongPrototype.isOdd = function isOdd() {\n      return (this.low & 1) === 1;\n    };\n\n    /**\n     * Tests if this Long's value is even.\n     * @this {!Long}\n     * @returns {boolean}\n     */\n    LongPrototype.isEven = function isEven() {\n      return (this.low & 1) === 0;\n    };\n\n    /**\n     * Tests if this Long's value equals the specified's.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.equals = function equals(other) {\n      if (!isLong(other)) other = fromValue(other);\n      if (\n        this.unsigned !== other.unsigned &&\n        this.high >>> 31 === 1 &&\n        other.high >>> 31 === 1\n      )\n        return false;\n      return this.high === other.high && this.low === other.low;\n    };\n\n    /**\n     * Tests if this Long's value equals the specified's. This is an alias of {@link Long#equals}.\n     * @function\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.eq = LongPrototype.equals;\n\n    /**\n     * Tests if this Long's value differs from the specified's.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.notEquals = function notEquals(other) {\n      return !this.eq(/* validates */ other);\n    };\n\n    /**\n     * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\n     * @function\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.neq = LongPrototype.notEquals;\n\n    /**\n     * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\n     * @function\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.ne = LongPrototype.notEquals;\n\n    /**\n     * Tests if this Long's value is less than the specified's.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.lessThan = function lessThan(other) {\n      return this.comp(/* validates */ other) < 0;\n    };\n\n    /**\n     * Tests if this Long's value is less than the specified's. This is an alias of {@link Long#lessThan}.\n     * @function\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.lt = LongPrototype.lessThan;\n\n    /**\n     * Tests if this Long's value is less than or equal the specified's.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.lessThanOrEqual = function lessThanOrEqual(other) {\n      return this.comp(/* validates */ other) <= 0;\n    };\n\n    /**\n     * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\n     * @function\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.lte = LongPrototype.lessThanOrEqual;\n\n    /**\n     * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\n     * @function\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.le = LongPrototype.lessThanOrEqual;\n\n    /**\n     * Tests if this Long's value is greater than the specified's.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.greaterThan = function greaterThan(other) {\n      return this.comp(/* validates */ other) > 0;\n    };\n\n    /**\n     * Tests if this Long's value is greater than the specified's. This is an alias of {@link Long#greaterThan}.\n     * @function\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.gt = LongPrototype.greaterThan;\n\n    /**\n     * Tests if this Long's value is greater than or equal the specified's.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.greaterThanOrEqual = function greaterThanOrEqual(other) {\n      return this.comp(/* validates */ other) >= 0;\n    };\n\n    /**\n     * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\n     * @function\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.gte = LongPrototype.greaterThanOrEqual;\n\n    /**\n     * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\n     * @function\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {boolean}\n     */\n    LongPrototype.ge = LongPrototype.greaterThanOrEqual;\n\n    /**\n     * Compares this Long's value with the specified's.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {number} 0 if they are the same, 1 if the this is greater and -1\n     *  if the given one is greater\n     */\n    LongPrototype.compare = function compare(other) {\n      if (!isLong(other)) other = fromValue(other);\n      if (this.eq(other)) return 0;\n      var thisNeg = this.isNegative(),\n        otherNeg = other.isNegative();\n      if (thisNeg && !otherNeg) return -1;\n      if (!thisNeg && otherNeg) return 1;\n      // At this point the sign bits are the same\n      if (!this.unsigned) return this.sub(other).isNegative() ? -1 : 1;\n      // Both are positive if at least one is unsigned\n      return other.high >>> 0 > this.high >>> 0 ||\n        (other.high === this.high && other.low >>> 0 > this.low >>> 0)\n        ? -1\n        : 1;\n    };\n\n    /**\n     * Compares this Long's value with the specified's. This is an alias of {@link Long#compare}.\n     * @function\n     * @param {!Long|number|bigint|string} other Other value\n     * @returns {number} 0 if they are the same, 1 if the this is greater and -1\n     *  if the given one is greater\n     */\n    LongPrototype.comp = LongPrototype.compare;\n\n    /**\n     * Negates this Long's value.\n     * @this {!Long}\n     * @returns {!Long} Negated Long\n     */\n    LongPrototype.negate = function negate() {\n      if (!this.unsigned && this.eq(MIN_VALUE)) return MIN_VALUE;\n      return this.not().add(ONE);\n    };\n\n    /**\n     * Negates this Long's value. This is an alias of {@link Long#negate}.\n     * @function\n     * @returns {!Long} Negated Long\n     */\n    LongPrototype.neg = LongPrototype.negate;\n\n    /**\n     * Returns the sum of this and the specified Long.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} addend Addend\n     * @returns {!Long} Sum\n     */\n    LongPrototype.add = function add(addend) {\n      if (!isLong(addend)) addend = fromValue(addend);\n\n      // Divide each number into 4 chunks of 16 bits, and then sum the chunks.\n\n      var a48 = this.high >>> 16;\n      var a32 = this.high & 0xffff;\n      var a16 = this.low >>> 16;\n      var a00 = this.low & 0xffff;\n      var b48 = addend.high >>> 16;\n      var b32 = addend.high & 0xffff;\n      var b16 = addend.low >>> 16;\n      var b00 = addend.low & 0xffff;\n      var c48 = 0,\n        c32 = 0,\n        c16 = 0,\n        c00 = 0;\n      c00 += a00 + b00;\n      c16 += c00 >>> 16;\n      c00 &= 0xffff;\n      c16 += a16 + b16;\n      c32 += c16 >>> 16;\n      c16 &= 0xffff;\n      c32 += a32 + b32;\n      c48 += c32 >>> 16;\n      c32 &= 0xffff;\n      c48 += a48 + b48;\n      c48 &= 0xffff;\n      return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\n    };\n\n    /**\n     * Returns the difference of this and the specified Long.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} subtrahend Subtrahend\n     * @returns {!Long} Difference\n     */\n    LongPrototype.subtract = function subtract(subtrahend) {\n      if (!isLong(subtrahend)) subtrahend = fromValue(subtrahend);\n      return this.add(subtrahend.neg());\n    };\n\n    /**\n     * Returns the difference of this and the specified Long. This is an alias of {@link Long#subtract}.\n     * @function\n     * @param {!Long|number|bigint|string} subtrahend Subtrahend\n     * @returns {!Long} Difference\n     */\n    LongPrototype.sub = LongPrototype.subtract;\n\n    /**\n     * Returns the product of this and the specified Long.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} multiplier Multiplier\n     * @returns {!Long} Product\n     */\n    LongPrototype.multiply = function multiply(multiplier) {\n      if (this.isZero()) return this;\n      if (!isLong(multiplier)) multiplier = fromValue(multiplier);\n\n      // use wasm support if present\n      if (wasm) {\n        var low = wasm[\"mul\"](\n          this.low,\n          this.high,\n          multiplier.low,\n          multiplier.high,\n        );\n        return fromBits(low, wasm[\"get_high\"](), this.unsigned);\n      }\n      if (multiplier.isZero()) return this.unsigned ? UZERO : ZERO;\n      if (this.eq(MIN_VALUE)) return multiplier.isOdd() ? MIN_VALUE : ZERO;\n      if (multiplier.eq(MIN_VALUE)) return this.isOdd() ? MIN_VALUE : ZERO;\n      if (this.isNegative()) {\n        if (multiplier.isNegative()) return this.neg().mul(multiplier.neg());\n        else return this.neg().mul(multiplier).neg();\n      } else if (multiplier.isNegative())\n        return this.mul(multiplier.neg()).neg();\n\n      // If both longs are small, use float multiplication\n      if (this.lt(TWO_PWR_24) && multiplier.lt(TWO_PWR_24))\n        return fromNumber(\n          this.toNumber() * multiplier.toNumber(),\n          this.unsigned,\n        );\n\n      // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.\n      // We can skip products that would overflow.\n\n      var a48 = this.high >>> 16;\n      var a32 = this.high & 0xffff;\n      var a16 = this.low >>> 16;\n      var a00 = this.low & 0xffff;\n      var b48 = multiplier.high >>> 16;\n      var b32 = multiplier.high & 0xffff;\n      var b16 = multiplier.low >>> 16;\n      var b00 = multiplier.low & 0xffff;\n      var c48 = 0,\n        c32 = 0,\n        c16 = 0,\n        c00 = 0;\n      c00 += a00 * b00;\n      c16 += c00 >>> 16;\n      c00 &= 0xffff;\n      c16 += a16 * b00;\n      c32 += c16 >>> 16;\n      c16 &= 0xffff;\n      c16 += a00 * b16;\n      c32 += c16 >>> 16;\n      c16 &= 0xffff;\n      c32 += a32 * b00;\n      c48 += c32 >>> 16;\n      c32 &= 0xffff;\n      c32 += a16 * b16;\n      c48 += c32 >>> 16;\n      c32 &= 0xffff;\n      c32 += a00 * b32;\n      c48 += c32 >>> 16;\n      c32 &= 0xffff;\n      c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;\n      c48 &= 0xffff;\n      return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\n    };\n\n    /**\n     * Returns the product of this and the specified Long. This is an alias of {@link Long#multiply}.\n     * @function\n     * @param {!Long|number|bigint|string} multiplier Multiplier\n     * @returns {!Long} Product\n     */\n    LongPrototype.mul = LongPrototype.multiply;\n\n    /**\n     * Returns this Long divided by the specified. The result is signed if this Long is signed or\n     *  unsigned if this Long is unsigned.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} divisor Divisor\n     * @returns {!Long} Quotient\n     */\n    LongPrototype.divide = function divide(divisor) {\n      if (!isLong(divisor)) divisor = fromValue(divisor);\n      if (divisor.isZero()) throw Error(\"division by zero\");\n\n      // use wasm support if present\n      if (wasm) {\n        // guard against signed division overflow: the largest\n        // negative number / -1 would be 1 larger than the largest\n        // positive number, due to two's complement.\n        if (\n          !this.unsigned &&\n          this.high === -0x80000000 &&\n          divisor.low === -1 &&\n          divisor.high === -1\n        ) {\n          // be consistent with non-wasm code path\n          return this;\n        }\n        var low = (this.unsigned ? wasm[\"div_u\"] : wasm[\"div_s\"])(\n          this.low,\n          this.high,\n          divisor.low,\n          divisor.high,\n        );\n        return fromBits(low, wasm[\"get_high\"](), this.unsigned);\n      }\n      if (this.isZero()) return this.unsigned ? UZERO : ZERO;\n      var approx, rem, res;\n      if (!this.unsigned) {\n        // This section is only relevant for signed longs and is derived from the\n        // closure library as a whole.\n        if (this.eq(MIN_VALUE)) {\n          if (divisor.eq(ONE) || divisor.eq(NEG_ONE))\n            return MIN_VALUE; // recall that -MIN_VALUE == MIN_VALUE\n          else if (divisor.eq(MIN_VALUE)) return ONE;\n          else {\n            // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.\n            var halfThis = this.shr(1);\n            approx = halfThis.div(divisor).shl(1);\n            if (approx.eq(ZERO)) {\n              return divisor.isNegative() ? ONE : NEG_ONE;\n            } else {\n              rem = this.sub(divisor.mul(approx));\n              res = approx.add(rem.div(divisor));\n              return res;\n            }\n          }\n        } else if (divisor.eq(MIN_VALUE)) return this.unsigned ? UZERO : ZERO;\n        if (this.isNegative()) {\n          if (divisor.isNegative()) return this.neg().div(divisor.neg());\n          return this.neg().div(divisor).neg();\n        } else if (divisor.isNegative()) return this.div(divisor.neg()).neg();\n        res = ZERO;\n      } else {\n        // The algorithm below has not been made for unsigned longs. It's therefore\n        // required to take special care of the MSB prior to running it.\n        if (!divisor.unsigned) divisor = divisor.toUnsigned();\n        if (divisor.gt(this)) return UZERO;\n        if (divisor.gt(this.shru(1)))\n          // 15 >>> 1 = 7 ; with divisor = 8 ; true\n          return UONE;\n        res = UZERO;\n      }\n\n      // Repeat the following until the remainder is less than other:  find a\n      // floating-point that approximates remainder / other *from below*, add this\n      // into the result, and subtract it from the remainder.  It is critical that\n      // the approximate value is less than or equal to the real value so that the\n      // remainder never becomes negative.\n      rem = this;\n      while (rem.gte(divisor)) {\n        // Approximate the result of division. This may be a little greater or\n        // smaller than the actual value.\n        approx = Math.max(1, Math.floor(rem.toNumber() / divisor.toNumber()));\n\n        // We will tweak the approximate result by changing it in the 48-th digit or\n        // the smallest non-fractional digit, whichever is larger.\n        var log2 = Math.ceil(Math.log(approx) / Math.LN2),\n          delta = log2 <= 48 ? 1 : pow_dbl(2, log2 - 48),\n          // Decrease the approximation until it is smaller than the remainder.  Note\n          // that if it is too large, the product overflows and is negative.\n          approxRes = fromNumber(approx),\n          approxRem = approxRes.mul(divisor);\n        while (approxRem.isNegative() || approxRem.gt(rem)) {\n          approx -= delta;\n          approxRes = fromNumber(approx, this.unsigned);\n          approxRem = approxRes.mul(divisor);\n        }\n\n        // We know the answer can't be zero... and actually, zero would cause\n        // infinite recursion since we would make no progress.\n        if (approxRes.isZero()) approxRes = ONE;\n        res = res.add(approxRes);\n        rem = rem.sub(approxRem);\n      }\n      return res;\n    };\n\n    /**\n     * Returns this Long divided by the specified. This is an alias of {@link Long#divide}.\n     * @function\n     * @param {!Long|number|bigint|string} divisor Divisor\n     * @returns {!Long} Quotient\n     */\n    LongPrototype.div = LongPrototype.divide;\n\n    /**\n     * Returns this Long modulo the specified.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} divisor Divisor\n     * @returns {!Long} Remainder\n     */\n    LongPrototype.modulo = function modulo(divisor) {\n      if (!isLong(divisor)) divisor = fromValue(divisor);\n\n      // use wasm support if present\n      if (wasm) {\n        var low = (this.unsigned ? wasm[\"rem_u\"] : wasm[\"rem_s\"])(\n          this.low,\n          this.high,\n          divisor.low,\n          divisor.high,\n        );\n        return fromBits(low, wasm[\"get_high\"](), this.unsigned);\n      }\n      return this.sub(this.div(divisor).mul(divisor));\n    };\n\n    /**\n     * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\n     * @function\n     * @param {!Long|number|bigint|string} divisor Divisor\n     * @returns {!Long} Remainder\n     */\n    LongPrototype.mod = LongPrototype.modulo;\n\n    /**\n     * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\n     * @function\n     * @param {!Long|number|bigint|string} divisor Divisor\n     * @returns {!Long} Remainder\n     */\n    LongPrototype.rem = LongPrototype.modulo;\n\n    /**\n     * Returns the bitwise NOT of this Long.\n     * @this {!Long}\n     * @returns {!Long}\n     */\n    LongPrototype.not = function not() {\n      return fromBits(~this.low, ~this.high, this.unsigned);\n    };\n\n    /**\n     * Returns count leading zeros of this Long.\n     * @this {!Long}\n     * @returns {!number}\n     */\n    LongPrototype.countLeadingZeros = function countLeadingZeros() {\n      return this.high ? Math.clz32(this.high) : Math.clz32(this.low) + 32;\n    };\n\n    /**\n     * Returns count leading zeros. This is an alias of {@link Long#countLeadingZeros}.\n     * @function\n     * @param {!Long}\n     * @returns {!number}\n     */\n    LongPrototype.clz = LongPrototype.countLeadingZeros;\n\n    /**\n     * Returns count trailing zeros of this Long.\n     * @this {!Long}\n     * @returns {!number}\n     */\n    LongPrototype.countTrailingZeros = function countTrailingZeros() {\n      return this.low ? ctz32(this.low) : ctz32(this.high) + 32;\n    };\n\n    /**\n     * Returns count trailing zeros. This is an alias of {@link Long#countTrailingZeros}.\n     * @function\n     * @param {!Long}\n     * @returns {!number}\n     */\n    LongPrototype.ctz = LongPrototype.countTrailingZeros;\n\n    /**\n     * Returns the bitwise AND of this Long and the specified.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} other Other Long\n     * @returns {!Long}\n     */\n    LongPrototype.and = function and(other) {\n      if (!isLong(other)) other = fromValue(other);\n      return fromBits(\n        this.low & other.low,\n        this.high & other.high,\n        this.unsigned,\n      );\n    };\n\n    /**\n     * Returns the bitwise OR of this Long and the specified.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} other Other Long\n     * @returns {!Long}\n     */\n    LongPrototype.or = function or(other) {\n      if (!isLong(other)) other = fromValue(other);\n      return fromBits(\n        this.low | other.low,\n        this.high | other.high,\n        this.unsigned,\n      );\n    };\n\n    /**\n     * Returns the bitwise XOR of this Long and the given one.\n     * @this {!Long}\n     * @param {!Long|number|bigint|string} other Other Long\n     * @returns {!Long}\n     */\n    LongPrototype.xor = function xor(other) {\n      if (!isLong(other)) other = fromValue(other);\n      return fromBits(\n        this.low ^ other.low,\n        this.high ^ other.high,\n        this.unsigned,\n      );\n    };\n\n    /**\n     * Returns this Long with bits shifted to the left by the given amount.\n     * @this {!Long}\n     * @param {number|!Long} numBits Number of bits\n     * @returns {!Long} Shifted Long\n     */\n    LongPrototype.shiftLeft = function shiftLeft(numBits) {\n      if (isLong(numBits)) numBits = numBits.toInt();\n      if ((numBits &= 63) === 0) return this;\n      else if (numBits < 32)\n        return fromBits(\n          this.low << numBits,\n          (this.high << numBits) | (this.low >>> (32 - numBits)),\n          this.unsigned,\n        );\n      else return fromBits(0, this.low << (numBits - 32), this.unsigned);\n    };\n\n    /**\n     * Returns this Long with bits shifted to the left by the given amount. This is an alias of {@link Long#shiftLeft}.\n     * @function\n     * @param {number|!Long} numBits Number of bits\n     * @returns {!Long} Shifted Long\n     */\n    LongPrototype.shl = LongPrototype.shiftLeft;\n\n    /**\n     * Returns this Long with bits arithmetically shifted to the right by the given amount.\n     * @this {!Long}\n     * @param {number|!Long} numBits Number of bits\n     * @returns {!Long} Shifted Long\n     */\n    LongPrototype.shiftRight = function shiftRight(numBits) {\n      if (isLong(numBits)) numBits = numBits.toInt();\n      if ((numBits &= 63) === 0) return this;\n      else if (numBits < 32)\n        return fromBits(\n          (this.low >>> numBits) | (this.high << (32 - numBits)),\n          this.high >> numBits,\n          this.unsigned,\n        );\n      else\n        return fromBits(\n          this.high >> (numBits - 32),\n          this.high >= 0 ? 0 : -1,\n          this.unsigned,\n        );\n    };\n\n    /**\n     * Returns this Long with bits arithmetically shifted to the right by the given amount. This is an alias of {@link Long#shiftRight}.\n     * @function\n     * @param {number|!Long} numBits Number of bits\n     * @returns {!Long} Shifted Long\n     */\n    LongPrototype.shr = LongPrototype.shiftRight;\n\n    /**\n     * Returns this Long with bits logically shifted to the right by the given amount.\n     * @this {!Long}\n     * @param {number|!Long} numBits Number of bits\n     * @returns {!Long} Shifted Long\n     */\n    LongPrototype.shiftRightUnsigned = function shiftRightUnsigned(numBits) {\n      if (isLong(numBits)) numBits = numBits.toInt();\n      if ((numBits &= 63) === 0) return this;\n      if (numBits < 32)\n        return fromBits(\n          (this.low >>> numBits) | (this.high << (32 - numBits)),\n          this.high >>> numBits,\n          this.unsigned,\n        );\n      if (numBits === 32) return fromBits(this.high, 0, this.unsigned);\n      return fromBits(this.high >>> (numBits - 32), 0, this.unsigned);\n    };\n\n    /**\n     * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\n     * @function\n     * @param {number|!Long} numBits Number of bits\n     * @returns {!Long} Shifted Long\n     */\n    LongPrototype.shru = LongPrototype.shiftRightUnsigned;\n\n    /**\n     * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\n     * @function\n     * @param {number|!Long} numBits Number of bits\n     * @returns {!Long} Shifted Long\n     */\n    LongPrototype.shr_u = LongPrototype.shiftRightUnsigned;\n\n    /**\n     * Returns this Long with bits rotated to the left by the given amount.\n     * @this {!Long}\n     * @param {number|!Long} numBits Number of bits\n     * @returns {!Long} Rotated Long\n     */\n    LongPrototype.rotateLeft = function rotateLeft(numBits) {\n      var b;\n      if (isLong(numBits)) numBits = numBits.toInt();\n      if ((numBits &= 63) === 0) return this;\n      if (numBits === 32) return fromBits(this.high, this.low, this.unsigned);\n      if (numBits < 32) {\n        b = 32 - numBits;\n        return fromBits(\n          (this.low << numBits) | (this.high >>> b),\n          (this.high << numBits) | (this.low >>> b),\n          this.unsigned,\n        );\n      }\n      numBits -= 32;\n      b = 32 - numBits;\n      return fromBits(\n        (this.high << numBits) | (this.low >>> b),\n        (this.low << numBits) | (this.high >>> b),\n        this.unsigned,\n      );\n    };\n    /**\n     * Returns this Long with bits rotated to the left by the given amount. This is an alias of {@link Long#rotateLeft}.\n     * @function\n     * @param {number|!Long} numBits Number of bits\n     * @returns {!Long} Rotated Long\n     */\n    LongPrototype.rotl = LongPrototype.rotateLeft;\n\n    /**\n     * Returns this Long with bits rotated to the right by the given amount.\n     * @this {!Long}\n     * @param {number|!Long} numBits Number of bits\n     * @returns {!Long} Rotated Long\n     */\n    LongPrototype.rotateRight = function rotateRight(numBits) {\n      var b;\n      if (isLong(numBits)) numBits = numBits.toInt();\n      if ((numBits &= 63) === 0) return this;\n      if (numBits === 32) return fromBits(this.high, this.low, this.unsigned);\n      if (numBits < 32) {\n        b = 32 - numBits;\n        return fromBits(\n          (this.high << b) | (this.low >>> numBits),\n          (this.low << b) | (this.high >>> numBits),\n          this.unsigned,\n        );\n      }\n      numBits -= 32;\n      b = 32 - numBits;\n      return fromBits(\n        (this.low << b) | (this.high >>> numBits),\n        (this.high << b) | (this.low >>> numBits),\n        this.unsigned,\n      );\n    };\n    /**\n     * Returns this Long with bits rotated to the right by the given amount. This is an alias of {@link Long#rotateRight}.\n     * @function\n     * @param {number|!Long} numBits Number of bits\n     * @returns {!Long} Rotated Long\n     */\n    LongPrototype.rotr = LongPrototype.rotateRight;\n\n    /**\n     * Converts this Long to signed.\n     * @this {!Long}\n     * @returns {!Long} Signed long\n     */\n    LongPrototype.toSigned = function toSigned() {\n      if (!this.unsigned) return this;\n      return fromBits(this.low, this.high, false);\n    };\n\n    /**\n     * Converts this Long to unsigned.\n     * @this {!Long}\n     * @returns {!Long} Unsigned long\n     */\n    LongPrototype.toUnsigned = function toUnsigned() {\n      if (this.unsigned) return this;\n      return fromBits(this.low, this.high, true);\n    };\n\n    /**\n     * Converts this Long to its byte representation.\n     * @param {boolean=} le Whether little or big endian, defaults to big endian\n     * @this {!Long}\n     * @returns {!Array.<number>} Byte representation\n     */\n    LongPrototype.toBytes = function toBytes(le) {\n      return le ? this.toBytesLE() : this.toBytesBE();\n    };\n\n    /**\n     * Converts this Long to its little endian byte representation.\n     * @this {!Long}\n     * @returns {!Array.<number>} Little endian byte representation\n     */\n    LongPrototype.toBytesLE = function toBytesLE() {\n      var hi = this.high,\n        lo = this.low;\n      return [\n        lo & 0xff,\n        (lo >>> 8) & 0xff,\n        (lo >>> 16) & 0xff,\n        lo >>> 24,\n        hi & 0xff,\n        (hi >>> 8) & 0xff,\n        (hi >>> 16) & 0xff,\n        hi >>> 24,\n      ];\n    };\n\n    /**\n     * Converts this Long to its big endian byte representation.\n     * @this {!Long}\n     * @returns {!Array.<number>} Big endian byte representation\n     */\n    LongPrototype.toBytesBE = function toBytesBE() {\n      var hi = this.high,\n        lo = this.low;\n      return [\n        hi >>> 24,\n        (hi >>> 16) & 0xff,\n        (hi >>> 8) & 0xff,\n        hi & 0xff,\n        lo >>> 24,\n        (lo >>> 16) & 0xff,\n        (lo >>> 8) & 0xff,\n        lo & 0xff,\n      ];\n    };\n\n    /**\n     * Creates a Long from its byte representation.\n     * @param {!Array.<number>} bytes Byte representation\n     * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n     * @param {boolean=} le Whether little or big endian, defaults to big endian\n     * @returns {Long} The corresponding Long value\n     */\n    Long.fromBytes = function fromBytes(bytes, unsigned, le) {\n      return le\n        ? Long.fromBytesLE(bytes, unsigned)\n        : Long.fromBytesBE(bytes, unsigned);\n    };\n\n    /**\n     * Creates a Long from its little endian byte representation.\n     * @param {!Array.<number>} bytes Little endian byte representation\n     * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n     * @returns {Long} The corresponding Long value\n     */\n    Long.fromBytesLE = function fromBytesLE(bytes, unsigned) {\n      return new Long(\n        bytes[0] | (bytes[1] << 8) | (bytes[2] << 16) | (bytes[3] << 24),\n        bytes[4] | (bytes[5] << 8) | (bytes[6] << 16) | (bytes[7] << 24),\n        unsigned,\n      );\n    };\n\n    /**\n     * Creates a Long from its big endian byte representation.\n     * @param {!Array.<number>} bytes Big endian byte representation\n     * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n     * @returns {Long} The corresponding Long value\n     */\n    Long.fromBytesBE = function fromBytesBE(bytes, unsigned) {\n      return new Long(\n        (bytes[4] << 24) | (bytes[5] << 16) | (bytes[6] << 8) | bytes[7],\n        (bytes[0] << 24) | (bytes[1] << 16) | (bytes[2] << 8) | bytes[3],\n        unsigned,\n      );\n    };\n\n    // Support conversion to/from BigInt where available\n    if (typeof BigInt === \"function\") {\n      /**\n       * Returns a Long representing the given big integer.\n       * @function\n       * @param {number} value The big integer value\n       * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\n       * @returns {!Long} The corresponding Long value\n       */\n      Long.fromBigInt = function fromBigInt(value, unsigned) {\n        var lowBits = Number(BigInt.asIntN(32, value));\n        var highBits = Number(BigInt.asIntN(32, value >> BigInt(32)));\n        return fromBits(lowBits, highBits, unsigned);\n      };\n\n      // Override\n      Long.fromValue = function fromValueWithBigInt(value, unsigned) {\n        if (typeof value === \"bigint\") return Long.fromBigInt(value, unsigned);\n        return fromValue(value, unsigned);\n      };\n\n      /**\n       * Converts the Long to its big integer representation.\n       * @this {!Long}\n       * @returns {bigint}\n       */\n      LongPrototype.toBigInt = function toBigInt() {\n        var lowBigInt = BigInt(this.low >>> 0);\n        var highBigInt = BigInt(this.unsigned ? this.high >>> 0 : this.high);\n        return (highBigInt << BigInt(32)) | lowBigInt;\n      };\n    }\n    var _default = (_exports.default = Long);\n  },\n);\n"],"x_google_ignoreList":[0],"mappings":";;;;AACA,EAAC,SAAU,QAAQ,SAAS;EAC1B,SAAS,cAAc,WAAS;AAC9B,UAAOA,UAAQ,WAAWA;;AAE5B,MAAI,OAAO,WAAW,cAAc,OAAO,IACzC,QAAO,EAAE,EAAE,WAAY;GACrB,IAAIA,YAAU,EAAE;AAChB,WAAQA,UAAQ;AAChB,UAAO,cAAcA,UAAQ;IAC7B;WACO,OAAO,YAAY,UAAU;AACtC,WAAQ,QAAQ;AAChB,OAAI,OAAO,WAAW,SAAU,QAAO,UAAU,cAAc,QAAQ;QAEvE,EAAC,WAAY;GACX,IAAIA,YAAU,EAAE;AAChB,WAAQA,UAAQ;AAChB,UAAO,OAAO,cAAcA,UAAQ;MAClC;IAGN,OAAO,eAAe,cAClB,aACA,OAAO,SAAS,cACd,gBAEN,SAAU,UAAU;AAGlB,SAAO,eAAe,UAAU,cAAc,EAC5C,OAAO,MACR,CAAC;AACF,WAAS,UAAU,KAAK;;;;;;;;;;;;;;;;;;;;EAsBxB,IAAI,OAAO;AACX,MAAI;AACF,UAAO,IAAI,YAAY,SACrB,IAAI,YAAY,OACd,IAAI,WAAW;IAEb;IAAG;IAAI;IAAK;IAEZ;IAAG;IAAG;IAAG;IAET;IAAG;IAAI;IAEP;IAAI;IAAG;IAAG;IAEV;IAAI;IAAG;IAAK;IAAK;IAAK;IAAK;IAAG;IAE9B;IAAG;IAAG;IAEN;IAEA;IAEA;IAEA;IAEA;IAEA;IAEA;IAAG;IAAG;IAEN;IAAK;IAAG;IAAI;IAAG;IAEf;IAAG;IAAI;IAEP;IAAG;IAAK;IAAK;IAAK;IAAG;IAErB;IAAG;IAAK;IAAK;IAAK;IAAI;IAAK;IAAG;IAE9B;IAAG;IAAK;IAAK;IAAK;IAAI;IAAK;IAAG;IAE9B;IAAG;IAAK;IAAK;IAAK;IAAI;IAAK;IAAG;IAE9B;IAAG;IAAK;IAAK;IAAK;IAAI;IAAK;IAAG;IAE9B;IAAG;IAAK;IAAK;IAAK;IAAI;IAAK;IAAK;IAAK;IAAK;IAAG;IAE7C;IAAI;IAAK;IAAG;IAEZ;IAAG;IAAG;IAAI;IAAG;IAEb;IAAI;IAAG;IAAG;IAAK;IAAI;IAAG;IAAK;IAAI;IAAG;IAAK;IAAI;IAAI;IAAK;IAAK;IAAI;IAAG;IAChE;IAAI;IAAG;IAAK;IAAI;IAAI;IAAK;IAAK;IAAK;IAAI;IAAG;IAAI;IAAI;IAAK;IAAK;IAAI;IAChE;IAAI;IAAG;IAAK;IAEZ;IAAI;IAAG;IAAG;IAAK;IAAI;IAAG;IAAK;IAAI;IAAG;IAAK;IAAI;IAAI;IAAK;IAAK;IAAI;IAAG;IAChE;IAAI;IAAG;IAAK;IAAI;IAAI;IAAK;IAAK;IAAK;IAAI;IAAG;IAAI;IAAI;IAAK;IAAK;IAAI;IAChE;IAAI;IAAG;IAAK;IAEZ;IAAI;IAAG;IAAG;IAAK;IAAI;IAAG;IAAK;IAAI;IAAG;IAAK;IAAI;IAAI;IAAK;IAAK;IAAI;IAAG;IAChE;IAAI;IAAG;IAAK;IAAI;IAAI;IAAK;IAAK;IAAK;IAAI;IAAG;IAAI;IAAI;IAAK;IAAK;IAAI;IAChE;IAAI;IAAG;IAAK;IAEZ;IAAI;IAAG;IAAG;IAAK;IAAI;IAAG;IAAK;IAAI;IAAG;IAAK;IAAI;IAAI;IAAK;IAAK;IAAI;IAAG;IAChE;IAAI;IAAG;IAAK;IAAI;IAAI;IAAK;IAAK;IAAK;IAAI;IAAG;IAAI;IAAI;IAAK;IAAK;IAAI;IAChE;IAAI;IAAG;IAAK;IAEZ;IAAI;IAAG;IAAG;IAAK;IAAI;IAAG;IAAK;IAAI;IAAG;IAAK;IAAI;IAAI;IAAK;IAAK;IAAI;IAAG;IAChE;IAAI;IAAG;IAAK;IAAI;IAAI;IAAK;IAAK;IAAK;IAAI;IAAG;IAAI;IAAI;IAAK;IAAK;IAAI;IAChE;IAAI;IAAG;IAAK;IACb,CAAC,CACH,EACD,EAAE,CACH,CAAC;UACI;;;;;;;;;;;EAcR,SAAS,KAAK,KAAK,MAAM,UAAU;;;;;AAKjC,QAAK,MAAM,MAAM;;;;;AAMjB,QAAK,OAAO,OAAO;;;;;AAMnB,QAAK,WAAW,CAAC,CAAC;;;;;;;;AA0BpB,OAAK,UAAU;AACf,SAAO,eAAe,KAAK,WAAW,cAAc,EAClD,OAAO,MACR,CAAC;;;;;;;EAQF,SAAS,OAAO,KAAK;AACnB,WAAQ,OAAO,IAAI,mBAAmB;;;;;;;;EASxC,SAAS,MAAM,OAAO;GACpB,IAAI,IAAI,KAAK,MAAM,QAAQ,CAAC,MAAM;AAClC,UAAO,QAAQ,KAAK,IAAI;;;;;;;;AAS1B,OAAK,SAAS;;;;;;EAOd,IAAI,YAAY,EAAE;;;;;;EAOlB,IAAI,aAAa,EAAE;;;;;;;EAQnB,SAAS,QAAQ,OAAO,UAAU;GAChC,IAAI,KAAK,WAAW;AACpB,OAAI,UAAU;AACZ,eAAW;AACX,QAAK,QAAQ,KAAK,SAAS,QAAQ,KAAM;AACvC,iBAAY,WAAW;AACvB,SAAI,UAAW,QAAO;;AAExB,UAAM,SAAS,OAAO,GAAG,KAAK;AAC9B,QAAI,MAAO,YAAW,SAAS;AAC/B,WAAO;UACF;AACL,aAAS;AACT,QAAK,QAAQ,QAAQ,SAAS,QAAQ,KAAM;AAC1C,iBAAY,UAAU;AACtB,SAAI,UAAW,QAAO;;AAExB,UAAM,SAAS,OAAO,QAAQ,IAAI,KAAK,GAAG,MAAM;AAChD,QAAI,MAAO,WAAU,SAAS;AAC9B,WAAO;;;;;;;;;;AAWX,OAAK,UAAU;;;;;;;EAQf,SAAS,WAAW,OAAO,UAAU;AACnC,OAAI,MAAM,MAAM,CAAE,QAAO,WAAW,QAAQ;AAC5C,OAAI,UAAU;AACZ,QAAI,QAAQ,EAAG,QAAO;AACtB,QAAI,SAAS,eAAgB,QAAO;UAC/B;AACL,QAAI,SAAS,CAAC,eAAgB,QAAO;AACrC,QAAI,QAAQ,KAAK,eAAgB,QAAO;;AAE1C,OAAI,QAAQ,EAAG,QAAO,WAAW,CAAC,OAAO,SAAS,CAAC,KAAK;AACxD,UAAO,SACL,QAAQ,iBAAiB,GACxB,QAAQ,iBAAkB,GAC3B,SACD;;;;;;;;;AAUH,OAAK,aAAa;;;;;;;;EASlB,SAAS,SAAS,SAAS,UAAU,UAAU;AAC7C,UAAO,IAAI,KAAK,SAAS,UAAU,SAAS;;;;;;;;;;;AAY9C,OAAK,WAAW;;;;;;;;EAShB,IAAI,UAAU,KAAK;;;;;;;;EASnB,SAAS,WAAW,KAAK,UAAU,OAAO;AACxC,OAAI,IAAI,WAAW,EAAG,OAAM,MAAM,eAAe;AACjD,OAAI,OAAO,aAAa,UAAU;AAEhC,YAAQ;AACR,eAAW;SAEX,YAAW,CAAC,CAAC;AAEf,OACE,QAAQ,SACR,QAAQ,cACR,QAAQ,eACR,QAAQ,YAER,QAAO,WAAW,QAAQ;AAC5B,WAAQ,SAAS;AACjB,OAAI,QAAQ,KAAK,KAAK,MAAO,OAAM,WAAW,QAAQ;GACtD,IAAI;AACJ,QAAK,IAAI,IAAI,QAAQ,IAAI,IAAI,EAAG,OAAM,MAAM,kBAAkB;YACrD,MAAM,EACb,QAAO,WAAW,IAAI,UAAU,EAAE,EAAE,UAAU,MAAM,CAAC,KAAK;GAK5D,IAAI,eAAe,WAAW,QAAQ,OAAO,EAAE,CAAC;GAChD,IAAI,SAAS;AACb,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GAAG;IACtC,IAAI,OAAO,KAAK,IAAI,GAAG,IAAI,SAAS,EAAE,EACpC,QAAQ,SAAS,IAAI,UAAU,GAAG,IAAI,KAAK,EAAE,MAAM;AACrD,QAAI,OAAO,GAAG;KACZ,IAAI,QAAQ,WAAW,QAAQ,OAAO,KAAK,CAAC;AAC5C,cAAS,OAAO,IAAI,MAAM,CAAC,IAAI,WAAW,MAAM,CAAC;WAC5C;AACL,cAAS,OAAO,IAAI,aAAa;AACjC,cAAS,OAAO,IAAI,WAAW,MAAM,CAAC;;;AAG1C,UAAO,WAAW;AAClB,UAAO;;;;;;;;;;AAWT,OAAK,aAAa;;;;;;;;EASlB,SAAS,UAAU,KAAK,UAAU;AAChC,OAAI,OAAO,QAAQ,SAAU,QAAO,WAAW,KAAK,SAAS;AAC7D,OAAI,OAAO,QAAQ,SAAU,QAAO,WAAW,KAAK,SAAS;AAE7D,UAAO,SACL,IAAI,KACJ,IAAI,MACJ,OAAO,aAAa,YAAY,WAAW,IAAI,SAChD;;;;;;;;;AAUH,OAAK,YAAY;;;;;;EAUjB,IAAI,iBAAiB;;;;;;EAOrB,IAAI,iBAAiB,KAAK;;;;;;EAO1B,IAAI,iBAAiB,iBAAiB;;;;;;EAOtC,IAAI,iBAAiB,iBAAiB;;;;;;EAOtC,IAAI,iBAAiB,iBAAiB;;;;;;EAOtC,IAAI,aAAa,QAAQ,eAAe;;;;;EAMxC,IAAI,OAAO,QAAQ,EAAE;;;;;AAMrB,OAAK,OAAO;;;;;EAMZ,IAAI,QAAQ,QAAQ,GAAG,KAAK;;;;;AAM5B,OAAK,QAAQ;;;;;EAMb,IAAI,MAAM,QAAQ,EAAE;;;;;AAMpB,OAAK,MAAM;;;;;EAMX,IAAI,OAAO,QAAQ,GAAG,KAAK;;;;;AAM3B,OAAK,OAAO;;;;;EAMZ,IAAI,UAAU,QAAQ,GAAG;;;;;AAMzB,OAAK,UAAU;;;;;EAMf,IAAI,YAAY,SAAS,IAAgB,YAAgB,MAAM;;;;;AAM/D,OAAK,YAAY;;;;;EAMjB,IAAI,qBAAqB,SAAS,IAAgB,IAAgB,KAAK;;;;;AAMvE,OAAK,qBAAqB;;;;;EAM1B,IAAI,YAAY,SAAS,GAAG,aAAgB,MAAM;;;;;AAMlD,OAAK,YAAY;;;;;EAMjB,IAAI,gBAAgB,KAAK;;;;;;AAOzB,gBAAc,QAAQ,SAAS,QAAQ;AACrC,UAAO,KAAK,WAAW,KAAK,QAAQ,IAAI,KAAK;;;;;;;AAQ/C,gBAAc,WAAW,SAAS,WAAW;AAC3C,OAAI,KAAK,SACP,SAAQ,KAAK,SAAS,KAAK,kBAAkB,KAAK,QAAQ;AAC5D,UAAO,KAAK,OAAO,kBAAkB,KAAK,QAAQ;;;;;;;;;;AAWpD,gBAAc,WAAW,SAAS,SAAS,OAAO;AAChD,WAAQ,SAAS;AACjB,OAAI,QAAQ,KAAK,KAAK,MAAO,OAAM,WAAW,QAAQ;AACtD,OAAI,KAAK,QAAQ,CAAE,QAAO;AAC1B,OAAI,KAAK,YAAY,CAEnB,KAAI,KAAK,GAAG,UAAU,EAAE;IAGtB,IAAI,YAAY,WAAW,MAAM,EAC/B,MAAM,KAAK,IAAI,UAAU,EACzB,OAAO,IAAI,IAAI,UAAU,CAAC,IAAI,KAAK;AACrC,WAAO,IAAI,SAAS,MAAM,GAAG,KAAK,OAAO,CAAC,SAAS,MAAM;SACpD,QAAO,MAAM,KAAK,KAAK,CAAC,SAAS,MAAM;GAKhD,IAAI,eAAe,WAAW,QAAQ,OAAO,EAAE,EAAE,KAAK,SAAS,EAC7D,MAAM;GACR,IAAI,SAAS;AACb,UAAO,MAAM;IACX,IAAI,SAAS,IAAI,IAAI,aAAa,EAEhC,UADS,IAAI,IAAI,OAAO,IAAI,aAAa,CAAC,CAAC,OAAO,KAAK,GACvC,SAAS,MAAM;AACjC,UAAM;AACN,QAAI,IAAI,QAAQ,CAAE,QAAO,SAAS;SAC7B;AACH,YAAO,OAAO,SAAS,EAAG,UAAS,MAAM;AACzC,cAAS,KAAK,SAAS;;;;;;;;;AAU7B,gBAAc,cAAc,SAAS,cAAc;AACjD,UAAO,KAAK;;;;;;;AAQd,gBAAc,sBAAsB,SAAS,sBAAsB;AACjE,UAAO,KAAK,SAAS;;;;;;;AAQvB,gBAAc,aAAa,SAAS,aAAa;AAC/C,UAAO,KAAK;;;;;;;AAQd,gBAAc,qBAAqB,SAAS,qBAAqB;AAC/D,UAAO,KAAK,QAAQ;;;;;;;AAQtB,gBAAc,gBAAgB,SAAS,gBAAgB;AACrD,OAAI,KAAK,YAAY,CAEnB,QAAO,KAAK,GAAG,UAAU,GAAG,KAAK,KAAK,KAAK,CAAC,eAAe;GAC7D,IAAI,MAAM,KAAK,QAAQ,IAAI,KAAK,OAAO,KAAK;AAC5C,QAAK,IAAI,MAAM,IAAI,MAAM,GAAG,MAAO,MAAK,MAAO,KAAK,QAAS,EAAG;AAChE,UAAO,KAAK,QAAQ,IAAI,MAAM,KAAK,MAAM;;;;;;;AAQ3C,gBAAc,gBAAgB,SAAS,gBAAgB;GAErD,IAAI,YAAY,KAAK,QAAQ;AAE7B,OAAI,CAAC,UAAW,QAAO;AAEvB,OAAI,KAAK,SAAU,QAAO;AAE1B,UAAO,cAAc,MAAM,EAAE,KAAK,QAAQ,KAAK,KAAK,SAAS;;;;;;;AAQ/D,gBAAc,SAAS,SAAS,SAAS;AACvC,UAAO,KAAK,SAAS,KAAK,KAAK,QAAQ;;;;;;AAOzC,gBAAc,MAAM,cAAc;;;;;;AAOlC,gBAAc,aAAa,SAAS,aAAa;AAC/C,UAAO,CAAC,KAAK,YAAY,KAAK,OAAO;;;;;;;AAQvC,gBAAc,aAAa,SAAS,aAAa;AAC/C,UAAO,KAAK,YAAY,KAAK,QAAQ;;;;;;;AAQvC,gBAAc,QAAQ,SAAS,QAAQ;AACrC,WAAQ,KAAK,MAAM,OAAO;;;;;;;AAQ5B,gBAAc,SAAS,SAAS,SAAS;AACvC,WAAQ,KAAK,MAAM,OAAO;;;;;;;;AAS5B,gBAAc,SAAS,SAAS,OAAO,OAAO;AAC5C,OAAI,CAAC,OAAO,MAAM,CAAE,SAAQ,UAAU,MAAM;AAC5C,OACE,KAAK,aAAa,MAAM,YACxB,KAAK,SAAS,OAAO,KACrB,MAAM,SAAS,OAAO,EAEtB,QAAO;AACT,UAAO,KAAK,SAAS,MAAM,QAAQ,KAAK,QAAQ,MAAM;;;;;;;;AASxD,gBAAc,KAAK,cAAc;;;;;;;AAQjC,gBAAc,YAAY,SAAS,UAAU,OAAO;AAClD,UAAO,CAAC,KAAK,GAAmB,MAAM;;;;;;;;AASxC,gBAAc,MAAM,cAAc;;;;;;;AAQlC,gBAAc,KAAK,cAAc;;;;;;;AAQjC,gBAAc,WAAW,SAAS,SAAS,OAAO;AAChD,UAAO,KAAK,KAAqB,MAAM,GAAG;;;;;;;;AAS5C,gBAAc,KAAK,cAAc;;;;;;;AAQjC,gBAAc,kBAAkB,SAAS,gBAAgB,OAAO;AAC9D,UAAO,KAAK,KAAqB,MAAM,IAAI;;;;;;;;AAS7C,gBAAc,MAAM,cAAc;;;;;;;AAQlC,gBAAc,KAAK,cAAc;;;;;;;AAQjC,gBAAc,cAAc,SAAS,YAAY,OAAO;AACtD,UAAO,KAAK,KAAqB,MAAM,GAAG;;;;;;;;AAS5C,gBAAc,KAAK,cAAc;;;;;;;AAQjC,gBAAc,qBAAqB,SAAS,mBAAmB,OAAO;AACpE,UAAO,KAAK,KAAqB,MAAM,IAAI;;;;;;;;AAS7C,gBAAc,MAAM,cAAc;;;;;;;AAQlC,gBAAc,KAAK,cAAc;;;;;;;;AASjC,gBAAc,UAAU,SAAS,QAAQ,OAAO;AAC9C,OAAI,CAAC,OAAO,MAAM,CAAE,SAAQ,UAAU,MAAM;AAC5C,OAAI,KAAK,GAAG,MAAM,CAAE,QAAO;GAC3B,IAAI,UAAU,KAAK,YAAY,EAC7B,WAAW,MAAM,YAAY;AAC/B,OAAI,WAAW,CAAC,SAAU,QAAO;AACjC,OAAI,CAAC,WAAW,SAAU,QAAO;AAEjC,OAAI,CAAC,KAAK,SAAU,QAAO,KAAK,IAAI,MAAM,CAAC,YAAY,GAAG,KAAK;AAE/D,UAAO,MAAM,SAAS,IAAI,KAAK,SAAS,KACrC,MAAM,SAAS,KAAK,QAAQ,MAAM,QAAQ,IAAI,KAAK,QAAQ,IAC1D,KACA;;;;;;;;;AAUN,gBAAc,OAAO,cAAc;;;;;;AAOnC,gBAAc,SAAS,SAAS,SAAS;AACvC,OAAI,CAAC,KAAK,YAAY,KAAK,GAAG,UAAU,CAAE,QAAO;AACjD,UAAO,KAAK,KAAK,CAAC,IAAI,IAAI;;;;;;;AAQ5B,gBAAc,MAAM,cAAc;;;;;;;AAQlC,gBAAc,MAAM,SAAS,IAAI,QAAQ;AACvC,OAAI,CAAC,OAAO,OAAO,CAAE,UAAS,UAAU,OAAO;GAI/C,IAAI,MAAM,KAAK,SAAS;GACxB,IAAI,MAAM,KAAK,OAAO;GACtB,IAAI,MAAM,KAAK,QAAQ;GACvB,IAAI,MAAM,KAAK,MAAM;GACrB,IAAI,MAAM,OAAO,SAAS;GAC1B,IAAI,MAAM,OAAO,OAAO;GACxB,IAAI,MAAM,OAAO,QAAQ;GACzB,IAAI,MAAM,OAAO,MAAM;GACvB,IAAI,MAAM,GACR,MAAM,GACN,MAAM,GACN,MAAM;AACR,UAAO,MAAM;AACb,UAAO,QAAQ;AACf,UAAO;AACP,UAAO,MAAM;AACb,UAAO,QAAQ;AACf,UAAO;AACP,UAAO,MAAM;AACb,UAAO,QAAQ;AACf,UAAO;AACP,UAAO,MAAM;AACb,UAAO;AACP,UAAO,SAAU,OAAO,KAAM,KAAM,OAAO,KAAM,KAAK,KAAK,SAAS;;;;;;;;AAStE,gBAAc,WAAW,SAAS,SAAS,YAAY;AACrD,OAAI,CAAC,OAAO,WAAW,CAAE,cAAa,UAAU,WAAW;AAC3D,UAAO,KAAK,IAAI,WAAW,KAAK,CAAC;;;;;;;;AASnC,gBAAc,MAAM,cAAc;;;;;;;AAQlC,gBAAc,WAAW,SAAS,SAAS,YAAY;AACrD,OAAI,KAAK,QAAQ,CAAE,QAAO;AAC1B,OAAI,CAAC,OAAO,WAAW,CAAE,cAAa,UAAU,WAAW;AAG3D,OAAI,KAOF,QAAO,SANG,KAAK,OACb,KAAK,KACL,KAAK,MACL,WAAW,KACX,WAAW,KACZ,EACoB,KAAK,aAAa,EAAE,KAAK,SAAS;AAEzD,OAAI,WAAW,QAAQ,CAAE,QAAO,KAAK,WAAW,QAAQ;AACxD,OAAI,KAAK,GAAG,UAAU,CAAE,QAAO,WAAW,OAAO,GAAG,YAAY;AAChE,OAAI,WAAW,GAAG,UAAU,CAAE,QAAO,KAAK,OAAO,GAAG,YAAY;AAChE,OAAI,KAAK,YAAY,CACnB,KAAI,WAAW,YAAY,CAAE,QAAO,KAAK,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC;OAC/D,QAAO,KAAK,KAAK,CAAC,IAAI,WAAW,CAAC,KAAK;YACnC,WAAW,YAAY,CAChC,QAAO,KAAK,IAAI,WAAW,KAAK,CAAC,CAAC,KAAK;AAGzC,OAAI,KAAK,GAAG,WAAW,IAAI,WAAW,GAAG,WAAW,CAClD,QAAO,WACL,KAAK,UAAU,GAAG,WAAW,UAAU,EACvC,KAAK,SACN;GAKH,IAAI,MAAM,KAAK,SAAS;GACxB,IAAI,MAAM,KAAK,OAAO;GACtB,IAAI,MAAM,KAAK,QAAQ;GACvB,IAAI,MAAM,KAAK,MAAM;GACrB,IAAI,MAAM,WAAW,SAAS;GAC9B,IAAI,MAAM,WAAW,OAAO;GAC5B,IAAI,MAAM,WAAW,QAAQ;GAC7B,IAAI,MAAM,WAAW,MAAM;GAC3B,IAAI,MAAM,GACR,MAAM,GACN,MAAM,GACN,MAAM;AACR,UAAO,MAAM;AACb,UAAO,QAAQ;AACf,UAAO;AACP,UAAO,MAAM;AACb,UAAO,QAAQ;AACf,UAAO;AACP,UAAO,MAAM;AACb,UAAO,QAAQ;AACf,UAAO;AACP,UAAO,MAAM;AACb,UAAO,QAAQ;AACf,UAAO;AACP,UAAO,MAAM;AACb,UAAO,QAAQ;AACf,UAAO;AACP,UAAO,MAAM;AACb,UAAO,QAAQ;AACf,UAAO;AACP,UAAO,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM;AACjD,UAAO;AACP,UAAO,SAAU,OAAO,KAAM,KAAM,OAAO,KAAM,KAAK,KAAK,SAAS;;;;;;;;AAStE,gBAAc,MAAM,cAAc;;;;;;;;AASlC,gBAAc,SAAS,SAAS,OAAO,SAAS;AAC9C,OAAI,CAAC,OAAO,QAAQ,CAAE,WAAU,UAAU,QAAQ;AAClD,OAAI,QAAQ,QAAQ,CAAE,OAAM,MAAM,mBAAmB;AAGrD,OAAI,MAAM;AAIR,QACE,CAAC,KAAK,YACN,KAAK,SAAS,eACd,QAAQ,QAAQ,MAChB,QAAQ,SAAS,GAGjB,QAAO;AAQT,WAAO,UANI,KAAK,WAAW,KAAK,WAAW,KAAK,UAC9C,KAAK,KACL,KAAK,MACL,QAAQ,KACR,QAAQ,KACT,EACoB,KAAK,aAAa,EAAE,KAAK,SAAS;;AAEzD,OAAI,KAAK,QAAQ,CAAE,QAAO,KAAK,WAAW,QAAQ;GAClD,IAAI,QAAQ,KAAK;AACjB,OAAI,CAAC,KAAK,UAAU;AAGlB,QAAI,KAAK,GAAG,UAAU,CACpB,KAAI,QAAQ,GAAG,IAAI,IAAI,QAAQ,GAAG,QAAQ,CACxC,QAAO;aACA,QAAQ,GAAG,UAAU,CAAE,QAAO;SAClC;AAGH,cADe,KAAK,IAAI,EAAE,CACR,IAAI,QAAQ,CAAC,IAAI,EAAE;AACrC,SAAI,OAAO,GAAG,KAAK,CACjB,QAAO,QAAQ,YAAY,GAAG,MAAM;UAC/B;AACL,YAAM,KAAK,IAAI,QAAQ,IAAI,OAAO,CAAC;AACnC,YAAM,OAAO,IAAI,IAAI,IAAI,QAAQ,CAAC;AAClC,aAAO;;;aAGF,QAAQ,GAAG,UAAU,CAAE,QAAO,KAAK,WAAW,QAAQ;AACjE,QAAI,KAAK,YAAY,EAAE;AACrB,SAAI,QAAQ,YAAY,CAAE,QAAO,KAAK,KAAK,CAAC,IAAI,QAAQ,KAAK,CAAC;AAC9D,YAAO,KAAK,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK;eAC3B,QAAQ,YAAY,CAAE,QAAO,KAAK,IAAI,QAAQ,KAAK,CAAC,CAAC,KAAK;AACrE,UAAM;UACD;AAGL,QAAI,CAAC,QAAQ,SAAU,WAAU,QAAQ,YAAY;AACrD,QAAI,QAAQ,GAAG,KAAK,CAAE,QAAO;AAC7B,QAAI,QAAQ,GAAG,KAAK,KAAK,EAAE,CAAC,CAE1B,QAAO;AACT,UAAM;;AAQR,SAAM;AACN,UAAO,IAAI,IAAI,QAAQ,EAAE;AAGvB,aAAS,KAAK,IAAI,GAAG,KAAK,MAAM,IAAI,UAAU,GAAG,QAAQ,UAAU,CAAC,CAAC;IAIrE,IAAI,OAAO,KAAK,KAAK,KAAK,IAAI,OAAO,GAAG,KAAK,IAAI,EAC/C,QAAQ,QAAQ,KAAK,IAAI,QAAQ,GAAG,OAAO,GAAG,EAG9C,YAAY,WAAW,OAAO,EAC9B,YAAY,UAAU,IAAI,QAAQ;AACpC,WAAO,UAAU,YAAY,IAAI,UAAU,GAAG,IAAI,EAAE;AAClD,eAAU;AACV,iBAAY,WAAW,QAAQ,KAAK,SAAS;AAC7C,iBAAY,UAAU,IAAI,QAAQ;;AAKpC,QAAI,UAAU,QAAQ,CAAE,aAAY;AACpC,UAAM,IAAI,IAAI,UAAU;AACxB,UAAM,IAAI,IAAI,UAAU;;AAE1B,UAAO;;;;;;;;AAST,gBAAc,MAAM,cAAc;;;;;;;AAQlC,gBAAc,SAAS,SAAS,OAAO,SAAS;AAC9C,OAAI,CAAC,OAAO,QAAQ,CAAE,WAAU,UAAU,QAAQ;AAGlD,OAAI,KAOF,QAAO,UANI,KAAK,WAAW,KAAK,WAAW,KAAK,UAC9C,KAAK,KACL,KAAK,MACL,QAAQ,KACR,QAAQ,KACT,EACoB,KAAK,aAAa,EAAE,KAAK,SAAS;AAEzD,UAAO,KAAK,IAAI,KAAK,IAAI,QAAQ,CAAC,IAAI,QAAQ,CAAC;;;;;;;;AASjD,gBAAc,MAAM,cAAc;;;;;;;AAQlC,gBAAc,MAAM,cAAc;;;;;;AAOlC,gBAAc,MAAM,SAAS,MAAM;AACjC,UAAO,SAAS,CAAC,KAAK,KAAK,CAAC,KAAK,MAAM,KAAK,SAAS;;;;;;;AAQvD,gBAAc,oBAAoB,SAAS,oBAAoB;AAC7D,UAAO,KAAK,OAAO,KAAK,MAAM,KAAK,KAAK,GAAG,KAAK,MAAM,KAAK,IAAI,GAAG;;;;;;;;AASpE,gBAAc,MAAM,cAAc;;;;;;AAOlC,gBAAc,qBAAqB,SAAS,qBAAqB;AAC/D,UAAO,KAAK,MAAM,MAAM,KAAK,IAAI,GAAG,MAAM,KAAK,KAAK,GAAG;;;;;;;;AASzD,gBAAc,MAAM,cAAc;;;;;;;AAQlC,gBAAc,MAAM,SAAS,IAAI,OAAO;AACtC,OAAI,CAAC,OAAO,MAAM,CAAE,SAAQ,UAAU,MAAM;AAC5C,UAAO,SACL,KAAK,MAAM,MAAM,KACjB,KAAK,OAAO,MAAM,MAClB,KAAK,SACN;;;;;;;;AASH,gBAAc,KAAK,SAAS,GAAG,OAAO;AACpC,OAAI,CAAC,OAAO,MAAM,CAAE,SAAQ,UAAU,MAAM;AAC5C,UAAO,SACL,KAAK,MAAM,MAAM,KACjB,KAAK,OAAO,MAAM,MAClB,KAAK,SACN;;;;;;;;AASH,gBAAc,MAAM,SAAS,IAAI,OAAO;AACtC,OAAI,CAAC,OAAO,MAAM,CAAE,SAAQ,UAAU,MAAM;AAC5C,UAAO,SACL,KAAK,MAAM,MAAM,KACjB,KAAK,OAAO,MAAM,MAClB,KAAK,SACN;;;;;;;;AASH,gBAAc,YAAY,SAAS,UAAU,SAAS;AACpD,OAAI,OAAO,QAAQ,CAAE,WAAU,QAAQ,OAAO;AAC9C,QAAK,WAAW,QAAQ,EAAG,QAAO;YACzB,UAAU,GACjB,QAAO,SACL,KAAK,OAAO,SACX,KAAK,QAAQ,UAAY,KAAK,QAAS,KAAK,SAC7C,KAAK,SACN;OACE,QAAO,SAAS,GAAG,KAAK,OAAQ,UAAU,IAAK,KAAK,SAAS;;;;;;;;AASpE,gBAAc,MAAM,cAAc;;;;;;;AAQlC,gBAAc,aAAa,SAAS,WAAW,SAAS;AACtD,OAAI,OAAO,QAAQ,CAAE,WAAU,QAAQ,OAAO;AAC9C,QAAK,WAAW,QAAQ,EAAG,QAAO;YACzB,UAAU,GACjB,QAAO,SACJ,KAAK,QAAQ,UAAY,KAAK,QAAS,KAAK,SAC7C,KAAK,QAAQ,SACb,KAAK,SACN;OAED,QAAO,SACL,KAAK,QAAS,UAAU,IACxB,KAAK,QAAQ,IAAI,IAAI,IACrB,KAAK,SACN;;;;;;;;AASL,gBAAc,MAAM,cAAc;;;;;;;AAQlC,gBAAc,qBAAqB,SAAS,mBAAmB,SAAS;AACtE,OAAI,OAAO,QAAQ,CAAE,WAAU,QAAQ,OAAO;AAC9C,QAAK,WAAW,QAAQ,EAAG,QAAO;AAClC,OAAI,UAAU,GACZ,QAAO,SACJ,KAAK,QAAQ,UAAY,KAAK,QAAS,KAAK,SAC7C,KAAK,SAAS,SACd,KAAK,SACN;AACH,OAAI,YAAY,GAAI,QAAO,SAAS,KAAK,MAAM,GAAG,KAAK,SAAS;AAChE,UAAO,SAAS,KAAK,SAAU,UAAU,IAAK,GAAG,KAAK,SAAS;;;;;;;;AASjE,gBAAc,OAAO,cAAc;;;;;;;AAQnC,gBAAc,QAAQ,cAAc;;;;;;;AAQpC,gBAAc,aAAa,SAAS,WAAW,SAAS;GACtD,IAAI;AACJ,OAAI,OAAO,QAAQ,CAAE,WAAU,QAAQ,OAAO;AAC9C,QAAK,WAAW,QAAQ,EAAG,QAAO;AAClC,OAAI,YAAY,GAAI,QAAO,SAAS,KAAK,MAAM,KAAK,KAAK,KAAK,SAAS;AACvE,OAAI,UAAU,IAAI;AAChB,QAAI,KAAK;AACT,WAAO,SACJ,KAAK,OAAO,UAAY,KAAK,SAAS,GACtC,KAAK,QAAQ,UAAY,KAAK,QAAQ,GACvC,KAAK,SACN;;AAEH,cAAW;AACX,OAAI,KAAK;AACT,UAAO,SACJ,KAAK,QAAQ,UAAY,KAAK,QAAQ,GACtC,KAAK,OAAO,UAAY,KAAK,SAAS,GACvC,KAAK,SACN;;;;;;;;AAQH,gBAAc,OAAO,cAAc;;;;;;;AAQnC,gBAAc,cAAc,SAAS,YAAY,SAAS;GACxD,IAAI;AACJ,OAAI,OAAO,QAAQ,CAAE,WAAU,QAAQ,OAAO;AAC9C,QAAK,WAAW,QAAQ,EAAG,QAAO;AAClC,OAAI,YAAY,GAAI,QAAO,SAAS,KAAK,MAAM,KAAK,KAAK,KAAK,SAAS;AACvE,OAAI,UAAU,IAAI;AAChB,QAAI,KAAK;AACT,WAAO,SACJ,KAAK,QAAQ,IAAM,KAAK,QAAQ,SAChC,KAAK,OAAO,IAAM,KAAK,SAAS,SACjC,KAAK,SACN;;AAEH,cAAW;AACX,OAAI,KAAK;AACT,UAAO,SACJ,KAAK,OAAO,IAAM,KAAK,SAAS,SAChC,KAAK,QAAQ,IAAM,KAAK,QAAQ,SACjC,KAAK,SACN;;;;;;;;AAQH,gBAAc,OAAO,cAAc;;;;;;AAOnC,gBAAc,WAAW,SAAS,WAAW;AAC3C,OAAI,CAAC,KAAK,SAAU,QAAO;AAC3B,UAAO,SAAS,KAAK,KAAK,KAAK,MAAM,MAAM;;;;;;;AAQ7C,gBAAc,aAAa,SAAS,aAAa;AAC/C,OAAI,KAAK,SAAU,QAAO;AAC1B,UAAO,SAAS,KAAK,KAAK,KAAK,MAAM,KAAK;;;;;;;;AAS5C,gBAAc,UAAU,SAAS,QAAQ,IAAI;AAC3C,UAAO,KAAK,KAAK,WAAW,GAAG,KAAK,WAAW;;;;;;;AAQjD,gBAAc,YAAY,SAAS,YAAY;GAC7C,IAAI,KAAK,KAAK,MACZ,KAAK,KAAK;AACZ,UAAO;IACL,KAAK;IACJ,OAAO,IAAK;IACZ,OAAO,KAAM;IACd,OAAO;IACP,KAAK;IACJ,OAAO,IAAK;IACZ,OAAO,KAAM;IACd,OAAO;IACR;;;;;;;AAQH,gBAAc,YAAY,SAAS,YAAY;GAC7C,IAAI,KAAK,KAAK,MACZ,KAAK,KAAK;AACZ,UAAO;IACL,OAAO;IACN,OAAO,KAAM;IACb,OAAO,IAAK;IACb,KAAK;IACL,OAAO;IACN,OAAO,KAAM;IACb,OAAO,IAAK;IACb,KAAK;IACN;;;;;;;;;AAUH,OAAK,YAAY,SAAS,UAAU,OAAO,UAAU,IAAI;AACvD,UAAO,KACH,KAAK,YAAY,OAAO,SAAS,GACjC,KAAK,YAAY,OAAO,SAAS;;;;;;;;AASvC,OAAK,cAAc,SAAS,YAAY,OAAO,UAAU;AACvD,UAAO,IAAI,KACT,MAAM,KAAM,MAAM,MAAM,IAAM,MAAM,MAAM,KAAO,MAAM,MAAM,IAC7D,MAAM,KAAM,MAAM,MAAM,IAAM,MAAM,MAAM,KAAO,MAAM,MAAM,IAC7D,SACD;;;;;;;;AASH,OAAK,cAAc,SAAS,YAAY,OAAO,UAAU;AACvD,UAAO,IAAI,KACR,MAAM,MAAM,KAAO,MAAM,MAAM,KAAO,MAAM,MAAM,IAAK,MAAM,IAC7D,MAAM,MAAM,KAAO,MAAM,MAAM,KAAO,MAAM,MAAM,IAAK,MAAM,IAC9D,SACD;;AAIH,MAAI,OAAO,WAAW,YAAY;;;;;;;;AAQhC,QAAK,aAAa,SAAS,WAAW,OAAO,UAAU;AAGrD,WAAO,SAFO,OAAO,OAAO,OAAO,IAAI,MAAM,CAAC,EAC/B,OAAO,OAAO,OAAO,IAAI,SAAS,OAAO,GAAG,CAAC,CAAC,EAC1B,SAAS;;AAI9C,QAAK,YAAY,SAAS,oBAAoB,OAAO,UAAU;AAC7D,QAAI,OAAO,UAAU,SAAU,QAAO,KAAK,WAAW,OAAO,SAAS;AACtE,WAAO,UAAU,OAAO,SAAS;;;;;;;AAQnC,iBAAc,WAAW,SAAS,WAAW;IAC3C,IAAI,YAAY,OAAO,KAAK,QAAQ,EAAE;AAEtC,WADiB,OAAO,KAAK,WAAW,KAAK,SAAS,IAAI,KAAK,KAAK,IAC9C,OAAO,GAAG,GAAI;;;AAGxB,WAAS,UAAU;GAEtC"}

package/dist/node/node_modules/.pnpm/lru.min@1.1.3/node_modules/lru.min/lib/index.js

@@ -0,0 +1,202 @@
+import { __commonJS } from "../../../../../../_virtual/rolldown_runtime.js";
+
+//#region ../../node_modules/.pnpm/lru.min@1.1.3/node_modules/lru.min/lib/index.js
+var require_lib = /* @__PURE__ */ __commonJS({ "../../node_modules/.pnpm/lru.min@1.1.3/node_modules/lru.min/lib/index.js": ((exports) => {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.createLRU = void 0;
+	const createLRU = (options) => {
+		let { max } = options;
+		if (!(Number.isInteger(max) && max > 0)) throw new TypeError("`max` must be a positive integer");
+		let size = 0;
+		let head = 0;
+		let tail = 0;
+		let free = [];
+		const { onEviction } = options;
+		const keyMap = /* @__PURE__ */ new Map();
+		const keyList = new Array(max).fill(void 0);
+		const valList = new Array(max).fill(void 0);
+		const next = new Array(max).fill(0);
+		const prev = new Array(max).fill(0);
+		const setTail = (index, type) => {
+			if (index === tail) return;
+			const nextIndex = next[index];
+			const prevIndex = prev[index];
+			if (index === head) head = nextIndex;
+			else if (type === "get" || prevIndex !== 0) next[prevIndex] = nextIndex;
+			if (nextIndex !== 0) prev[nextIndex] = prevIndex;
+			next[tail] = index;
+			prev[index] = tail;
+			next[index] = 0;
+			tail = index;
+		};
+		const _evict = () => {
+			const evictHead = head;
+			const key = keyList[evictHead];
+			onEviction === null || onEviction === void 0 || onEviction(key, valList[evictHead]);
+			keyMap.delete(key);
+			keyList[evictHead] = void 0;
+			valList[evictHead] = void 0;
+			head = next[evictHead];
+			if (head !== 0) prev[head] = 0;
+			size--;
+			if (size === 0) head = tail = 0;
+			free.push(evictHead);
+			return evictHead;
+		};
+		return {
+			set(key, value) {
+				if (key === void 0) return;
+				let index = keyMap.get(key);
+				if (index === void 0) {
+					index = size === max ? _evict() : free.length > 0 ? free.pop() : size;
+					keyMap.set(key, index);
+					keyList[index] = key;
+					size++;
+				} else onEviction === null || onEviction === void 0 || onEviction(key, valList[index]);
+				valList[index] = value;
+				if (size === 1) head = tail = index;
+				else setTail(index, "set");
+			},
+			get(key) {
+				const index = keyMap.get(key);
+				if (index === void 0) return;
+				if (index !== tail) setTail(index, "get");
+				return valList[index];
+			},
+			peek: (key) => {
+				const index = keyMap.get(key);
+				return index !== void 0 ? valList[index] : void 0;
+			},
+			has: (key) => keyMap.has(key),
+			*keys() {
+				let current = tail;
+				for (let i = 0; i < size; i++) {
+					yield keyList[current];
+					current = prev[current];
+				}
+			},
+			*values() {
+				let current = tail;
+				for (let i = 0; i < size; i++) {
+					yield valList[current];
+					current = prev[current];
+				}
+			},
+			*entries() {
+				let current = tail;
+				for (let i = 0; i < size; i++) {
+					yield [keyList[current], valList[current]];
+					current = prev[current];
+				}
+			},
+			forEach: (callback) => {
+				let current = tail;
+				for (let i = 0; i < size; i++) {
+					const key = keyList[current];
+					const value = valList[current];
+					callback(value, key);
+					current = prev[current];
+				}
+			},
+			delete(key) {
+				const index = keyMap.get(key);
+				if (index === void 0) return false;
+				onEviction === null || onEviction === void 0 || onEviction(key, valList[index]);
+				keyMap.delete(key);
+				free.push(index);
+				keyList[index] = void 0;
+				valList[index] = void 0;
+				const prevIndex = prev[index];
+				const nextIndex = next[index];
+				if (prevIndex !== 0) next[prevIndex] = nextIndex;
+				if (nextIndex !== 0) prev[nextIndex] = prevIndex;
+				if (index === head) head = nextIndex;
+				if (index === tail) tail = prevIndex;
+				size--;
+				return true;
+			},
+			evict: (number) => {
+				let toPrune = Math.min(number, size);
+				while (toPrune > 0) {
+					_evict();
+					toPrune--;
+				}
+			},
+			clear() {
+				if (typeof onEviction === "function") {
+					let current = head;
+					for (let i = 0; i < size; i++) {
+						onEviction(keyList[current], valList[current]);
+						current = next[current];
+					}
+				}
+				keyMap.clear();
+				keyList.fill(void 0);
+				valList.fill(void 0);
+				free = [];
+				size = 0;
+				head = tail = 0;
+			},
+			resize: (newMax) => {
+				if (!(Number.isInteger(newMax) && newMax > 0)) throw new TypeError("`max` must be a positive integer");
+				if (newMax === max) return;
+				if (newMax < max) {
+					let current = tail;
+					const preserve = Math.min(size, newMax);
+					const remove = size - preserve;
+					const newKeyList = new Array(newMax);
+					const newValList = new Array(newMax);
+					const newNext = new Array(newMax);
+					const newPrev = new Array(newMax);
+					for (let i = 1; i <= remove; i++) onEviction === null || onEviction === void 0 || onEviction(keyList[i], valList[i]);
+					for (let i = preserve - 1; i >= 0; i--) {
+						newKeyList[i] = keyList[current];
+						newValList[i] = valList[current];
+						newNext[i] = i + 1;
+						newPrev[i] = i - 1;
+						keyMap.set(newKeyList[i], i);
+						current = prev[current];
+					}
+					head = 0;
+					tail = preserve - 1;
+					size = preserve;
+					keyList.length = newMax;
+					valList.length = newMax;
+					next.length = newMax;
+					prev.length = newMax;
+					for (let i = 0; i < preserve; i++) {
+						keyList[i] = newKeyList[i];
+						valList[i] = newValList[i];
+						next[i] = newNext[i];
+						prev[i] = newPrev[i];
+					}
+					free = [];
+					for (let i = preserve; i < newMax; i++) free.push(i);
+				} else {
+					const fill = newMax - max;
+					keyList.push(...new Array(fill).fill(void 0));
+					valList.push(...new Array(fill).fill(void 0));
+					next.push(...new Array(fill).fill(0));
+					prev.push(...new Array(fill).fill(0));
+				}
+				max = newMax;
+			},
+			get max() {
+				return max;
+			},
+			get size() {
+				return size;
+			},
+			get available() {
+				return max - size;
+			}
+		};
+	};
+	exports.createLRU = createLRU;
+}) });
+
+//#endregion
+export default require_lib();
+
+export { require_lib };
+//# sourceMappingURL=index.js.map

package/dist/node/node_modules/.pnpm/lru.min@1.1.3/node_modules/lru.min/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../../../../../../../../../node_modules/.pnpm/lru.min@1.1.3/node_modules/lru.min/lib/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createLRU = void 0;\nconst createLRU = (options) => {\n    let { max } = options;\n    if (!(Number.isInteger(max) && max > 0))\n        throw new TypeError('`max` must be a positive integer');\n    let size = 0;\n    let head = 0;\n    let tail = 0;\n    let free = [];\n    const { onEviction } = options;\n    const keyMap = new Map();\n    const keyList = new Array(max).fill(undefined);\n    const valList = new Array(max).fill(undefined);\n    const next = new Array(max).fill(0);\n    const prev = new Array(max).fill(0);\n    const setTail = (index, type) => {\n        if (index === tail)\n            return;\n        const nextIndex = next[index];\n        const prevIndex = prev[index];\n        if (index === head)\n            head = nextIndex;\n        else if (type === 'get' || prevIndex !== 0)\n            next[prevIndex] = nextIndex;\n        if (nextIndex !== 0)\n            prev[nextIndex] = prevIndex;\n        next[tail] = index;\n        prev[index] = tail;\n        next[index] = 0;\n        tail = index;\n    };\n    const _evict = () => {\n        const evictHead = head;\n        const key = keyList[evictHead];\n        onEviction === null || onEviction === void 0 ? void 0 : onEviction(key, valList[evictHead]);\n        keyMap.delete(key);\n        keyList[evictHead] = undefined;\n        valList[evictHead] = undefined;\n        head = next[evictHead];\n        if (head !== 0)\n            prev[head] = 0;\n        size--;\n        if (size === 0)\n            head = tail = 0;\n        free.push(evictHead);\n        return evictHead;\n    };\n    return {\n        /** Adds a key-value pair to the cache. Updates the value if the key already exists. */\n        set(key, value) {\n            if (key === undefined)\n                return;\n            let index = keyMap.get(key);\n            if (index === undefined) {\n                index = size === max ? _evict() : free.length > 0 ? free.pop() : size;\n                keyMap.set(key, index);\n                keyList[index] = key;\n                size++;\n            }\n            else\n                onEviction === null || onEviction === void 0 ? void 0 : onEviction(key, valList[index]);\n            valList[index] = value;\n            if (size === 1)\n                head = tail = index;\n            else\n                setTail(index, 'set');\n        },\n        /** Retrieves the value for a given key and moves the key to the most recent position. */\n        get(key) {\n            const index = keyMap.get(key);\n            if (index === undefined)\n                return;\n            if (index !== tail)\n                setTail(index, 'get');\n            return valList[index];\n        },\n        /** Retrieves the value for a given key without changing its position. */\n        peek: (key) => {\n            const index = keyMap.get(key);\n            return index !== undefined ? valList[index] : undefined;\n        },\n        /** Checks if a key exists in the cache. */\n        has: (key) => keyMap.has(key),\n        /** Iterates over all keys in the cache, from most recent to least recent. */\n        *keys() {\n            let current = tail;\n            for (let i = 0; i < size; i++) {\n                yield keyList[current];\n                current = prev[current];\n            }\n        },\n        /** Iterates over all values in the cache, from most recent to least recent. */\n        *values() {\n            let current = tail;\n            for (let i = 0; i < size; i++) {\n                yield valList[current];\n                current = prev[current];\n            }\n        },\n        /** Iterates over `[key, value]` pairs in the cache, from most recent to least recent. */\n        *entries() {\n            let current = tail;\n            for (let i = 0; i < size; i++) {\n                yield [keyList[current], valList[current]];\n                current = prev[current];\n            }\n        },\n        /** Iterates over each value-key pair in the cache, from most recent to least recent. */\n        forEach: (callback) => {\n            let current = tail;\n            for (let i = 0; i < size; i++) {\n                const key = keyList[current];\n                const value = valList[current];\n                callback(value, key);\n                current = prev[current];\n            }\n        },\n        /** Deletes a key-value pair from the cache. */\n        delete(key) {\n            const index = keyMap.get(key);\n            if (index === undefined)\n                return false;\n            onEviction === null || onEviction === void 0 ? void 0 : onEviction(key, valList[index]);\n            keyMap.delete(key);\n            free.push(index);\n            keyList[index] = undefined;\n            valList[index] = undefined;\n            const prevIndex = prev[index];\n            const nextIndex = next[index];\n            if (prevIndex !== 0)\n                next[prevIndex] = nextIndex;\n            if (nextIndex !== 0)\n                prev[nextIndex] = prevIndex;\n            if (index === head)\n                head = nextIndex;\n            if (index === tail)\n                tail = prevIndex;\n            size--;\n            return true;\n        },\n        /** Evicts the oldest item or the specified number of the oldest items from the cache. */\n        evict: (number) => {\n            let toPrune = Math.min(number, size);\n            while (toPrune > 0) {\n                _evict();\n                toPrune--;\n            }\n        },\n        /** Clears all key-value pairs from the cache. */\n        clear() {\n            if (typeof onEviction === 'function') {\n                let current = head;\n                for (let i = 0; i < size; i++) {\n                    onEviction(keyList[current], valList[current]);\n                    current = next[current];\n                }\n            }\n            keyMap.clear();\n            keyList.fill(undefined);\n            valList.fill(undefined);\n            free = [];\n            size = 0;\n            head = tail = 0;\n        },\n        /** Resizes the cache to a new maximum size, evicting items if necessary. */\n        resize: (newMax) => {\n            if (!(Number.isInteger(newMax) && newMax > 0))\n                throw new TypeError('`max` must be a positive integer');\n            if (newMax === max)\n                return;\n            if (newMax < max) {\n                let current = tail;\n                const preserve = Math.min(size, newMax);\n                const remove = size - preserve;\n                const newKeyList = new Array(newMax);\n                const newValList = new Array(newMax);\n                const newNext = new Array(newMax);\n                const newPrev = new Array(newMax);\n                for (let i = 1; i <= remove; i++)\n                    onEviction === null || onEviction === void 0 ? void 0 : onEviction(keyList[i], valList[i]);\n                for (let i = preserve - 1; i >= 0; i--) {\n                    newKeyList[i] = keyList[current];\n                    newValList[i] = valList[current];\n                    newNext[i] = i + 1;\n                    newPrev[i] = i - 1;\n                    keyMap.set(newKeyList[i], i);\n                    current = prev[current];\n                }\n                head = 0;\n                tail = preserve - 1;\n                size = preserve;\n                keyList.length = newMax;\n                valList.length = newMax;\n                next.length = newMax;\n                prev.length = newMax;\n                for (let i = 0; i < preserve; i++) {\n                    keyList[i] = newKeyList[i];\n                    valList[i] = newValList[i];\n                    next[i] = newNext[i];\n                    prev[i] = newPrev[i];\n                }\n                free = [];\n                for (let i = preserve; i < newMax; i++)\n                    free.push(i);\n            }\n            else {\n                const fill = newMax - max;\n                keyList.push(...new Array(fill).fill(undefined));\n                valList.push(...new Array(fill).fill(undefined));\n                next.push(...new Array(fill).fill(0));\n                prev.push(...new Array(fill).fill(0));\n            }\n            max = newMax;\n        },\n        /** Returns the maximum number of items that can be stored in the cache. */\n        get max() {\n            return max;\n        },\n        /** Returns the number of items currently stored in the cache. */\n        get size() {\n            return size;\n        },\n        /** Returns the number of currently available slots in the cache before reaching the maximum size. */\n        get available() {\n            return max - size;\n        },\n    };\n};\nexports.createLRU = createLRU;\n"],"x_google_ignoreList":[0],"mappings":";;;;AACA,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM,CAAC;AAC7D,SAAQ,YAAY,KAAK;CACzB,MAAM,aAAa,YAAY;EAC3B,IAAI,EAAE,QAAQ;AACd,MAAI,EAAE,OAAO,UAAU,IAAI,IAAI,MAAM,GACjC,OAAM,IAAI,UAAU,mCAAmC;EAC3D,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI,OAAO,EAAE;EACb,MAAM,EAAE,eAAe;EACvB,MAAM,yBAAS,IAAI,KAAK;EACxB,MAAM,UAAU,IAAI,MAAM,IAAI,CAAC,KAAK,OAAU;EAC9C,MAAM,UAAU,IAAI,MAAM,IAAI,CAAC,KAAK,OAAU;EAC9C,MAAM,OAAO,IAAI,MAAM,IAAI,CAAC,KAAK,EAAE;EACnC,MAAM,OAAO,IAAI,MAAM,IAAI,CAAC,KAAK,EAAE;EACnC,MAAM,WAAW,OAAO,SAAS;AAC7B,OAAI,UAAU,KACV;GACJ,MAAM,YAAY,KAAK;GACvB,MAAM,YAAY,KAAK;AACvB,OAAI,UAAU,KACV,QAAO;YACF,SAAS,SAAS,cAAc,EACrC,MAAK,aAAa;AACtB,OAAI,cAAc,EACd,MAAK,aAAa;AACtB,QAAK,QAAQ;AACb,QAAK,SAAS;AACd,QAAK,SAAS;AACd,UAAO;;EAEX,MAAM,eAAe;GACjB,MAAM,YAAY;GAClB,MAAM,MAAM,QAAQ;AACpB,kBAAe,QAAQ,eAAe,KAAK,KAAa,WAAW,KAAK,QAAQ,WAAW;AAC3F,UAAO,OAAO,IAAI;AAClB,WAAQ,aAAa;AACrB,WAAQ,aAAa;AACrB,UAAO,KAAK;AACZ,OAAI,SAAS,EACT,MAAK,QAAQ;AACjB;AACA,OAAI,SAAS,EACT,QAAO,OAAO;AAClB,QAAK,KAAK,UAAU;AACpB,UAAO;;AAEX,SAAO;GAEH,IAAI,KAAK,OAAO;AACZ,QAAI,QAAQ,OACR;IACJ,IAAI,QAAQ,OAAO,IAAI,IAAI;AAC3B,QAAI,UAAU,QAAW;AACrB,aAAQ,SAAS,MAAM,QAAQ,GAAG,KAAK,SAAS,IAAI,KAAK,KAAK,GAAG;AACjE,YAAO,IAAI,KAAK,MAAM;AACtB,aAAQ,SAAS;AACjB;UAGA,gBAAe,QAAQ,eAAe,KAAK,KAAa,WAAW,KAAK,QAAQ,OAAO;AAC3F,YAAQ,SAAS;AACjB,QAAI,SAAS,EACT,QAAO,OAAO;QAEd,SAAQ,OAAO,MAAM;;GAG7B,IAAI,KAAK;IACL,MAAM,QAAQ,OAAO,IAAI,IAAI;AAC7B,QAAI,UAAU,OACV;AACJ,QAAI,UAAU,KACV,SAAQ,OAAO,MAAM;AACzB,WAAO,QAAQ;;GAGnB,OAAO,QAAQ;IACX,MAAM,QAAQ,OAAO,IAAI,IAAI;AAC7B,WAAO,UAAU,SAAY,QAAQ,SAAS;;GAGlD,MAAM,QAAQ,OAAO,IAAI,IAAI;GAE7B,CAAC,OAAO;IACJ,IAAI,UAAU;AACd,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;AAC3B,WAAM,QAAQ;AACd,eAAU,KAAK;;;GAIvB,CAAC,SAAS;IACN,IAAI,UAAU;AACd,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;AAC3B,WAAM,QAAQ;AACd,eAAU,KAAK;;;GAIvB,CAAC,UAAU;IACP,IAAI,UAAU;AACd,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;AAC3B,WAAM,CAAC,QAAQ,UAAU,QAAQ,SAAS;AAC1C,eAAU,KAAK;;;GAIvB,UAAU,aAAa;IACnB,IAAI,UAAU;AACd,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;KAC3B,MAAM,MAAM,QAAQ;KACpB,MAAM,QAAQ,QAAQ;AACtB,cAAS,OAAO,IAAI;AACpB,eAAU,KAAK;;;GAIvB,OAAO,KAAK;IACR,MAAM,QAAQ,OAAO,IAAI,IAAI;AAC7B,QAAI,UAAU,OACV,QAAO;AACX,mBAAe,QAAQ,eAAe,KAAK,KAAa,WAAW,KAAK,QAAQ,OAAO;AACvF,WAAO,OAAO,IAAI;AAClB,SAAK,KAAK,MAAM;AAChB,YAAQ,SAAS;AACjB,YAAQ,SAAS;IACjB,MAAM,YAAY,KAAK;IACvB,MAAM,YAAY,KAAK;AACvB,QAAI,cAAc,EACd,MAAK,aAAa;AACtB,QAAI,cAAc,EACd,MAAK,aAAa;AACtB,QAAI,UAAU,KACV,QAAO;AACX,QAAI,UAAU,KACV,QAAO;AACX;AACA,WAAO;;GAGX,QAAQ,WAAW;IACf,IAAI,UAAU,KAAK,IAAI,QAAQ,KAAK;AACpC,WAAO,UAAU,GAAG;AAChB,aAAQ;AACR;;;GAIR,QAAQ;AACJ,QAAI,OAAO,eAAe,YAAY;KAClC,IAAI,UAAU;AACd,UAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;AAC3B,iBAAW,QAAQ,UAAU,QAAQ,SAAS;AAC9C,gBAAU,KAAK;;;AAGvB,WAAO,OAAO;AACd,YAAQ,KAAK,OAAU;AACvB,YAAQ,KAAK,OAAU;AACvB,WAAO,EAAE;AACT,WAAO;AACP,WAAO,OAAO;;GAGlB,SAAS,WAAW;AAChB,QAAI,EAAE,OAAO,UAAU,OAAO,IAAI,SAAS,GACvC,OAAM,IAAI,UAAU,mCAAmC;AAC3D,QAAI,WAAW,IACX;AACJ,QAAI,SAAS,KAAK;KACd,IAAI,UAAU;KACd,MAAM,WAAW,KAAK,IAAI,MAAM,OAAO;KACvC,MAAM,SAAS,OAAO;KACtB,MAAM,aAAa,IAAI,MAAM,OAAO;KACpC,MAAM,aAAa,IAAI,MAAM,OAAO;KACpC,MAAM,UAAU,IAAI,MAAM,OAAO;KACjC,MAAM,UAAU,IAAI,MAAM,OAAO;AACjC,UAAK,IAAI,IAAI,GAAG,KAAK,QAAQ,IACzB,gBAAe,QAAQ,eAAe,KAAK,KAAa,WAAW,QAAQ,IAAI,QAAQ,GAAG;AAC9F,UAAK,IAAI,IAAI,WAAW,GAAG,KAAK,GAAG,KAAK;AACpC,iBAAW,KAAK,QAAQ;AACxB,iBAAW,KAAK,QAAQ;AACxB,cAAQ,KAAK,IAAI;AACjB,cAAQ,KAAK,IAAI;AACjB,aAAO,IAAI,WAAW,IAAI,EAAE;AAC5B,gBAAU,KAAK;;AAEnB,YAAO;AACP,YAAO,WAAW;AAClB,YAAO;AACP,aAAQ,SAAS;AACjB,aAAQ,SAAS;AACjB,UAAK,SAAS;AACd,UAAK,SAAS;AACd,UAAK,IAAI,IAAI,GAAG,IAAI,UAAU,KAAK;AAC/B,cAAQ,KAAK,WAAW;AACxB,cAAQ,KAAK,WAAW;AACxB,WAAK,KAAK,QAAQ;AAClB,WAAK,KAAK,QAAQ;;AAEtB,YAAO,EAAE;AACT,UAAK,IAAI,IAAI,UAAU,IAAI,QAAQ,IAC/B,MAAK,KAAK,EAAE;WAEf;KACD,MAAM,OAAO,SAAS;AACtB,aAAQ,KAAK,GAAG,IAAI,MAAM,KAAK,CAAC,KAAK,OAAU,CAAC;AAChD,aAAQ,KAAK,GAAG,IAAI,MAAM,KAAK,CAAC,KAAK,OAAU,CAAC;AAChD,UAAK,KAAK,GAAG,IAAI,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;AACrC,UAAK,KAAK,GAAG,IAAI,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;;AAEzC,UAAM;;GAGV,IAAI,MAAM;AACN,WAAO;;GAGX,IAAI,OAAO;AACP,WAAO;;GAGX,IAAI,YAAY;AACZ,WAAO,MAAM;;GAEpB;;AAEL,SAAQ,YAAY"}