@platforma-sdk/ui-vue 1.42.19 → 1.42.21

package/dist/lib/util/helpers/dist/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sources":["../../../../../../../lib/util/helpers/src/utils.ts"],"sourcesContent":["import type { AwaitedStruct, Option, Primitive, Result, Unionize } from './types';\n\nexport function isNil(v: unknown): v is null | undefined | void {\n  return v === null || v === undefined;\n}\n\nexport function isPrimitive(v: unknown): v is Primitive {\n  return isNil(v)\n    || typeof v === 'string'\n    || typeof v === 'number'\n    || typeof v === 'boolean'\n    || typeof v === 'bigint'\n  ;\n}\n\nexport function notEmpty<T>(v: T | null | undefined, message?: string): T {\n  if (v === null || v === undefined) {\n    throw Error(message ?? 'Empty (null | undefined) value');\n  }\n\n  return v;\n}\n\nexport function notUndef<T>(v: T | undefined, message?: string): T {\n  if (v === undefined) {\n    throw Error(message ?? 'Undefined value');\n  }\n\n  return v;\n}\n\nexport function undef<V>(v: V | undefined = undefined): V | undefined {\n  return v;\n}\n\nexport function bool<V extends boolean>(v: V): boolean {\n  return v;\n}\n\nexport function uniqueValues<T>(items: T[]): T[] {\n  return [...new Set(items)];\n}\n\nexport function checkIfNotEmpty<T>(v: T | null | undefined, message?: string): asserts v is T {\n  if (v === undefined || v === null) {\n    throw Error(message ?? 'Empty (null | undefined) value');\n  }\n}\n\nexport function checkIfDefined<T>(v: T | undefined, message?: string): asserts v is T {\n  if (v === undefined) {\n    throw Error(message ?? 'Undefined value');\n  }\n}\n\nexport function between(n: number, a: number, b: number) {\n  const min = Math.min(a, b);\n  const max = Math.max(a, b);\n\n  return n >= min && n <= max;\n}\n\nexport function listToOptions<T>(list: T[] | readonly T[]): Option<T>[] {\n  return list.map((value) => ({ text: String(value), value }));\n}\n\nexport function async<A extends unknown[]>(gf: (...args: A) => Generator) {\n  return function (...args: A) {\n    const generator = gf(...args);\n\n    async function handle(result: IteratorResult<unknown>): Promise<unknown> {\n      if (result.done) {\n        return Promise.resolve(result.value);\n      }\n\n      return Promise.resolve(result.value).then((res) => {\n        return handle(generator.next(res));\n      }).catch((err) => {\n        return handle(generator.throw(err));\n      });\n    }\n\n    try {\n      return handle(generator.next());\n    } catch (ex) {\n      return Promise.reject(ex instanceof Error ? ex : Error(String(ex)));\n    }\n  };\n}\n\nexport class Deferred<T> {\n  public readonly promise: Promise<T>;\n\n  constructor() {\n    this.promise = new Promise<T>((res, rej) => {\n      this.resolve = res;\n      this.reject = rej;\n    });\n  }\n\n  public resolve: (v: T) => void = () => {\n  };\n\n  public reject: (err: Error) => void = () => {\n  };\n}\n\nexport function delay(ms: number) {\n  return new Promise((resolve) => setTimeout(resolve, ms));\n}\n\nexport function tear() {\n  return new Promise<void>((r) => queueMicrotask(r));\n}\n\nexport function timer() {\n  const t = new Date().getTime();\n  return function () {\n    return new Date().getTime() - t;\n  };\n}\n\nexport function performanceTimer() {\n  const t = performance.now();\n  return function () {\n    return performance.now() - t;\n  };\n}\n\nexport function call<R>(f: () => R): R {\n  return f();\n}\n\nexport function clamp(n: number, lo: number, up: number) {\n  return lo > n ? lo : n > up ? up : n;\n}\n\nexport function tap<T, R>(v: T, cb: (v: T) => R) {\n  return cb(v);\n}\n\nexport function tapIf<T, R>(v: T | null | undefined, cb: (v: T) => R) {\n  if (v !== null && v !== undefined) {\n    return cb(v);\n  }\n\n  return;\n}\n\nexport function* range(from: number, to: number, step = 1) {\n  for (let i = from; i < to; i += step) {\n    yield i;\n  }\n}\n\nexport function toList<T>(iterable: Iterable<T>): T[] {\n  const lst: T[] = [];\n  for (const it of iterable) {\n    lst.push(it);\n  }\n\n  return lst;\n}\n\nexport function times<R>(n: number, cb: (i: number) => R): R[] {\n  return toList(range(0, n)).map(cb);\n}\n\nexport class Interval {\n  constructor(private _delay: number) {\n  }\n\n  async* generate(): AsyncGenerator<number> {\n    let i = 0;\n    while (true) {\n      await delay(this._delay);\n      yield i++;\n    }\n  }\n\n  async* [Symbol.asyncIterator]() {\n    let i = 0;\n    while (true) {\n      await delay(this._delay);\n      yield i++;\n    }\n  }\n}\n\nexport function arrayFrom<T>(length: number, cb: (i: number) => T) {\n  return Array.from({ length }, (_, i) => cb(i));\n}\n\nexport function exhaustive(v: never, message: string): never {\n  throw Error(message);\n}\n\nexport type Matcher<T extends string, R = unknown> = {\n  [P in T]: () => R;\n};\n\nexport function match<T extends string, R = unknown>(matcher: Matcher<T, R>) {\n  return (key: T) => matcher[key]();\n}\n\nexport function okOptional<V>(v: { ok: true; value: V } | { ok: false } | undefined) {\n  if (!v) {\n    return undefined;\n  }\n\n  if (v.ok) {\n    return v.value;\n  }\n}\n\nexport function errorOptional<V>(v: Result<V> | undefined) {\n  if (!v) {\n    return undefined;\n  }\n\n  if (!v.ok) {\n    return v.error;\n  }\n}\n\nexport function unwrap<T>(r: Result<T>): T {\n  if (r.ok) {\n    return r.value;\n  }\n\n  throw Error(r.error);\n}\n\nexport function flatValue<T>(v: T | T[]): T[] {\n  return Array.isArray(v) ? v : [v];\n}\n\nexport async function resolveAwaited<O extends Record<string, unknown>>(obj: O): Promise<AwaitedStruct<O>> {\n  return Object.fromEntries(await Promise.all(Object.entries(obj).map(async ([k, v]) => [k, await v]))) as Promise<AwaitedStruct<O>>;\n}\n\nexport function alike(obj: Record<string, unknown>, to: Record<string, unknown>) {\n  return Object.keys(to).every((bKey) => obj[bKey] === to[bKey]);\n}\n\nexport const identity = <T>(v: T): T => v;\n\nexport function asConst<const T>(v: T) {\n  return v;\n}\n\nexport function unionize<K extends keyof O, V, O extends Record<K, V>>(obj: O): Unionize<O>[] {\n  return Object.entries(obj).map(([key, value]) => ({\n    key,\n    value,\n  })) as Unionize<O>[];\n}\n"],"names":["isNil","v","notEmpty","message","Deferred","__publicField","res","rej","delay","ms","resolve","tap","cb","tapIf"],"mappings":";;;AAEM,SAAUA,EAAMC,GAAU;AAC9B,SAAOA,KAAM;AACf;AAWM,SAAUC,EAAYD,GAAyBE,GAAgB;AACnE,MAAIF,KAAM;AACR,UAAM,MAAME,CAA2C;AAGzD,SAAOF;AACT;AAqEa,MAAAG,EAAQ;AAAA,EAGnB,cAAA;AAFgB,IAAAC,EAAA;AAST,IAAAA,EAAA,iBAA0B,MAAK;AAAA,IACtC;AAEO,IAAAA,EAAA,gBAA+B,MAAK;AAAA,IAC3C;AAVE,SAAK,UAAU,IAAI,QAAW,CAACC,GAAKC,MAAO;AACzC,WAAK,UAAUD,GACf,KAAK,SAASC;AAAA,IAChB,CAAC;AAAA,EACH;AAOD;AAEK,SAAUC,EAAMC,GAAU;AAC9B,SAAO,IAAI,QAAQ,CAACC,MAAY,WAAWA,GAASD,CAAE,CAAC;AACzD;AA4BM,SAAUE,EAAUV,GAAMW,GAAe;AAC7C,SAAOA,EAAGX,CAAC;AACb;AAEM,SAAUY,EAAYZ,GAAyBW,GAAe;AAClE,MAAIX,KAAM;AACR,WAAOW,EAAGX,CAAC;AAIf;"}

package/dist/lib.d.ts

@@ -3,6 +3,7 @@ export { default as PlAgDataTableV2 } from './components/PlAgDataTable/PlAgDataT
 export { default as PlAgOverlayLoading } from './components/PlAgDataTable/PlAgOverlayLoading.vue';
 export { default as PlAgOverlayNoRows } from './components/PlAgDataTable/PlAgOverlayNoRows.vue';
 export { default as ValueOrErrorsComponent } from './components/ValueOrErrorsComponent.vue';
+export type { ListOptionBase } from '@platforma-sdk/model';
 export * from './AgGridVue';
 export * from './components/PlAgColumnHeader';
 export * from './components/PlAgCellFile';
@@ -29,4 +30,3 @@ export * from './composition/fileContent';
 export { multiSequenceAlignment } from './components/PlMultiSequenceAlignment/multi-sequence-alignment';
 export * from '@milaboratories/uikit';
 export type * from '@milaboratories/uikit';
-//# sourceMappingURL=lib.d.ts.map

package/dist/node_modules/.pnpm/fast-json-patch@3.1.1/node_modules/fast-json-patch/module/core.js.map

@@ -1 +1 @@
-{"version":3,"file":"core.js","sources":["../../../../../../../../../node_modules/.pnpm/fast-json-patch@3.1.1/node_modules/fast-json-patch/module/core.mjs"],"sourcesContent":["import { PatchError, _deepClone, isInteger, unescapePathComponent, hasUndefined } from './helpers.mjs';\nexport var JsonPatchError = PatchError;\nexport var deepClone = _deepClone;\n/* We use a Javascript hash to store each\n function. Each hash entry (property) uses\n the operation identifiers specified in rfc6902.\n In this way, we can map each patch operation\n to its dedicated function in efficient way.\n */\n/* The operations applicable to an object */\nvar objOps = {\n    add: function (obj, key, document) {\n        obj[key] = this.value;\n        return { newDocument: document };\n    },\n    remove: function (obj, key, document) {\n        var removed = obj[key];\n        delete obj[key];\n        return { newDocument: document, removed: removed };\n    },\n    replace: function (obj, key, document) {\n        var removed = obj[key];\n        obj[key] = this.value;\n        return { newDocument: document, removed: removed };\n    },\n    move: function (obj, key, document) {\n        /* in case move target overwrites an existing value,\n        return the removed value, this can be taxing performance-wise,\n        and is potentially unneeded */\n        var removed = getValueByPointer(document, this.path);\n        if (removed) {\n            removed = _deepClone(removed);\n        }\n        var originalValue = applyOperation(document, { op: \"remove\", path: this.from }).removed;\n        applyOperation(document, { op: \"add\", path: this.path, value: originalValue });\n        return { newDocument: document, removed: removed };\n    },\n    copy: function (obj, key, document) {\n        var valueToCopy = getValueByPointer(document, this.from);\n        // enforce copy by value so further operations don't affect source (see issue #177)\n        applyOperation(document, { op: \"add\", path: this.path, value: _deepClone(valueToCopy) });\n        return { newDocument: document };\n    },\n    test: function (obj, key, document) {\n        return { newDocument: document, test: _areEquals(obj[key], this.value) };\n    },\n    _get: function (obj, key, document) {\n        this.value = obj[key];\n        return { newDocument: document };\n    }\n};\n/* The operations applicable to an array. Many are the same as for the object */\nvar arrOps = {\n    add: function (arr, i, document) {\n        if (isInteger(i)) {\n            arr.splice(i, 0, this.value);\n        }\n        else { // array props\n            arr[i] = this.value;\n        }\n        // this may be needed when using '-' in an array\n        return { newDocument: document, index: i };\n    },\n    remove: function (arr, i, document) {\n        var removedList = arr.splice(i, 1);\n        return { newDocument: document, removed: removedList[0] };\n    },\n    replace: function (arr, i, document) {\n        var removed = arr[i];\n        arr[i] = this.value;\n        return { newDocument: document, removed: removed };\n    },\n    move: objOps.move,\n    copy: objOps.copy,\n    test: objOps.test,\n    _get: objOps._get\n};\n/**\n * Retrieves a value from a JSON document by a JSON pointer.\n * Returns the value.\n *\n * @param document The document to get the value from\n * @param pointer an escaped JSON pointer\n * @return The retrieved value\n */\nexport function getValueByPointer(document, pointer) {\n    if (pointer == '') {\n        return document;\n    }\n    var getOriginalDestination = { op: \"_get\", path: pointer };\n    applyOperation(document, getOriginalDestination);\n    return getOriginalDestination.value;\n}\n/**\n * Apply a single JSON Patch Operation on a JSON document.\n * Returns the {newDocument, result} of the operation.\n * It modifies the `document` and `operation` objects - it gets the values by reference.\n * If you would like to avoid touching your values, clone them:\n * `jsonpatch.applyOperation(document, jsonpatch._deepClone(operation))`.\n *\n * @param document The document to patch\n * @param operation The operation to apply\n * @param validateOperation `false` is without validation, `true` to use default jsonpatch's validation, or you can pass a `validateOperation` callback to be used for validation.\n * @param mutateDocument Whether to mutate the original document or clone it before applying\n * @param banPrototypeModifications Whether to ban modifications to `__proto__`, defaults to `true`.\n * @return `{newDocument, result}` after the operation\n */\nexport function applyOperation(document, operation, validateOperation, mutateDocument, banPrototypeModifications, index) {\n    if (validateOperation === void 0) { validateOperation = false; }\n    if (mutateDocument === void 0) { mutateDocument = true; }\n    if (banPrototypeModifications === void 0) { banPrototypeModifications = true; }\n    if (index === void 0) { index = 0; }\n    if (validateOperation) {\n        if (typeof validateOperation == 'function') {\n            validateOperation(operation, 0, document, operation.path);\n        }\n        else {\n            validator(operation, 0);\n        }\n    }\n    /* ROOT OPERATIONS */\n    if (operation.path === \"\") {\n        var returnValue = { newDocument: document };\n        if (operation.op === 'add') {\n            returnValue.newDocument = operation.value;\n            return returnValue;\n        }\n        else if (operation.op === 'replace') {\n            returnValue.newDocument = operation.value;\n            returnValue.removed = document; //document we removed\n            return returnValue;\n        }\n        else if (operation.op === 'move' || operation.op === 'copy') { // it's a move or copy to root\n            returnValue.newDocument = getValueByPointer(document, operation.from); // get the value by json-pointer in `from` field\n            if (operation.op === 'move') { // report removed item\n                returnValue.removed = document;\n            }\n            return returnValue;\n        }\n        else if (operation.op === 'test') {\n            returnValue.test = _areEquals(document, operation.value);\n            if (returnValue.test === false) {\n                throw new JsonPatchError(\"Test operation failed\", 'TEST_OPERATION_FAILED', index, operation, document);\n            }\n            returnValue.newDocument = document;\n            return returnValue;\n        }\n        else if (operation.op === 'remove') { // a remove on root\n            returnValue.removed = document;\n            returnValue.newDocument = null;\n            return returnValue;\n        }\n        else if (operation.op === '_get') {\n            operation.value = document;\n            return returnValue;\n        }\n        else { /* bad operation */\n            if (validateOperation) {\n                throw new JsonPatchError('Operation `op` property is not one of operations defined in RFC-6902', 'OPERATION_OP_INVALID', index, operation, document);\n            }\n            else {\n                return returnValue;\n            }\n        }\n    } /* END ROOT OPERATIONS */\n    else {\n        if (!mutateDocument) {\n            document = _deepClone(document);\n        }\n        var path = operation.path || \"\";\n        var keys = path.split('/');\n        var obj = document;\n        var t = 1; //skip empty element - http://jsperf.com/to-shift-or-not-to-shift\n        var len = keys.length;\n        var existingPathFragment = undefined;\n        var key = void 0;\n        var validateFunction = void 0;\n        if (typeof validateOperation == 'function') {\n            validateFunction = validateOperation;\n        }\n        else {\n            validateFunction = validator;\n        }\n        while (true) {\n            key = keys[t];\n            if (key && key.indexOf('~') != -1) {\n                key = unescapePathComponent(key);\n            }\n            if (banPrototypeModifications &&\n                (key == '__proto__' ||\n                    (key == 'prototype' && t > 0 && keys[t - 1] == 'constructor'))) {\n                throw new TypeError('JSON-Patch: modifying `__proto__` or `constructor/prototype` prop is banned for security reasons, if this was on purpose, please set `banPrototypeModifications` flag false and pass it to this function. More info in fast-json-patch README');\n            }\n            if (validateOperation) {\n                if (existingPathFragment === undefined) {\n                    if (obj[key] === undefined) {\n                        existingPathFragment = keys.slice(0, t).join('/');\n                    }\n                    else if (t == len - 1) {\n                        existingPathFragment = operation.path;\n                    }\n                    if (existingPathFragment !== undefined) {\n                        validateFunction(operation, 0, document, existingPathFragment);\n                    }\n                }\n            }\n            t++;\n            if (Array.isArray(obj)) {\n                if (key === '-') {\n                    key = obj.length;\n                }\n                else {\n                    if (validateOperation && !isInteger(key)) {\n                        throw new JsonPatchError(\"Expected an unsigned base-10 integer value, making the new referenced value the array element with the zero-based index\", \"OPERATION_PATH_ILLEGAL_ARRAY_INDEX\", index, operation, document);\n                    } // only parse key when it's an integer for `arr.prop` to work\n                    else if (isInteger(key)) {\n                        key = ~~key;\n                    }\n                }\n                if (t >= len) {\n                    if (validateOperation && operation.op === \"add\" && key > obj.length) {\n                        throw new JsonPatchError(\"The specified index MUST NOT be greater than the number of elements in the array\", \"OPERATION_VALUE_OUT_OF_BOUNDS\", index, operation, document);\n                    }\n                    var returnValue = arrOps[operation.op].call(operation, obj, key, document); // Apply patch\n                    if (returnValue.test === false) {\n                        throw new JsonPatchError(\"Test operation failed\", 'TEST_OPERATION_FAILED', index, operation, document);\n                    }\n                    return returnValue;\n                }\n            }\n            else {\n                if (t >= len) {\n                    var returnValue = objOps[operation.op].call(operation, obj, key, document); // Apply patch\n                    if (returnValue.test === false) {\n                        throw new JsonPatchError(\"Test operation failed\", 'TEST_OPERATION_FAILED', index, operation, document);\n                    }\n                    return returnValue;\n                }\n            }\n            obj = obj[key];\n            // If we have more keys in the path, but the next value isn't a non-null object,\n            // throw an OPERATION_PATH_UNRESOLVABLE error instead of iterating again.\n            if (validateOperation && t < len && (!obj || typeof obj !== \"object\")) {\n                throw new JsonPatchError('Cannot perform operation at the desired path', 'OPERATION_PATH_UNRESOLVABLE', index, operation, document);\n            }\n        }\n    }\n}\n/**\n * Apply a full JSON Patch array on a JSON document.\n * Returns the {newDocument, result} of the patch.\n * It modifies the `document` object and `patch` - it gets the values by reference.\n * If you would like to avoid touching your values, clone them:\n * `jsonpatch.applyPatch(document, jsonpatch._deepClone(patch))`.\n *\n * @param document The document to patch\n * @param patch The patch to apply\n * @param validateOperation `false` is without validation, `true` to use default jsonpatch's validation, or you can pass a `validateOperation` callback to be used for validation.\n * @param mutateDocument Whether to mutate the original document or clone it before applying\n * @param banPrototypeModifications Whether to ban modifications to `__proto__`, defaults to `true`.\n * @return An array of `{newDocument, result}` after the patch\n */\nexport function applyPatch(document, patch, validateOperation, mutateDocument, banPrototypeModifications) {\n    if (mutateDocument === void 0) { mutateDocument = true; }\n    if (banPrototypeModifications === void 0) { banPrototypeModifications = true; }\n    if (validateOperation) {\n        if (!Array.isArray(patch)) {\n            throw new JsonPatchError('Patch sequence must be an array', 'SEQUENCE_NOT_AN_ARRAY');\n        }\n    }\n    if (!mutateDocument) {\n        document = _deepClone(document);\n    }\n    var results = new Array(patch.length);\n    for (var i = 0, length_1 = patch.length; i < length_1; i++) {\n        // we don't need to pass mutateDocument argument because if it was true, we already deep cloned the object, we'll just pass `true`\n        results[i] = applyOperation(document, patch[i], validateOperation, true, banPrototypeModifications, i);\n        document = results[i].newDocument; // in case root was replaced\n    }\n    results.newDocument = document;\n    return results;\n}\n/**\n * Apply a single JSON Patch Operation on a JSON document.\n * Returns the updated document.\n * Suitable as a reducer.\n *\n * @param document The document to patch\n * @param operation The operation to apply\n * @return The updated document\n */\nexport function applyReducer(document, operation, index) {\n    var operationResult = applyOperation(document, operation);\n    if (operationResult.test === false) { // failed test\n        throw new JsonPatchError(\"Test operation failed\", 'TEST_OPERATION_FAILED', index, operation, document);\n    }\n    return operationResult.newDocument;\n}\n/**\n * Validates a single operation. Called from `jsonpatch.validate`. Throws `JsonPatchError` in case of an error.\n * @param {object} operation - operation object (patch)\n * @param {number} index - index of operation in the sequence\n * @param {object} [document] - object where the operation is supposed to be applied\n * @param {string} [existingPathFragment] - comes along with `document`\n */\nexport function validator(operation, index, document, existingPathFragment) {\n    if (typeof operation !== 'object' || operation === null || Array.isArray(operation)) {\n        throw new JsonPatchError('Operation is not an object', 'OPERATION_NOT_AN_OBJECT', index, operation, document);\n    }\n    else if (!objOps[operation.op]) {\n        throw new JsonPatchError('Operation `op` property is not one of operations defined in RFC-6902', 'OPERATION_OP_INVALID', index, operation, document);\n    }\n    else if (typeof operation.path !== 'string') {\n        throw new JsonPatchError('Operation `path` property is not a string', 'OPERATION_PATH_INVALID', index, operation, document);\n    }\n    else if (operation.path.indexOf('/') !== 0 && operation.path.length > 0) {\n        // paths that aren't empty string should start with \"/\"\n        throw new JsonPatchError('Operation `path` property must start with \"/\"', 'OPERATION_PATH_INVALID', index, operation, document);\n    }\n    else if ((operation.op === 'move' || operation.op === 'copy') && typeof operation.from !== 'string') {\n        throw new JsonPatchError('Operation `from` property is not present (applicable in `move` and `copy` operations)', 'OPERATION_FROM_REQUIRED', index, operation, document);\n    }\n    else if ((operation.op === 'add' || operation.op === 'replace' || operation.op === 'test') && operation.value === undefined) {\n        throw new JsonPatchError('Operation `value` property is not present (applicable in `add`, `replace` and `test` operations)', 'OPERATION_VALUE_REQUIRED', index, operation, document);\n    }\n    else if ((operation.op === 'add' || operation.op === 'replace' || operation.op === 'test') && hasUndefined(operation.value)) {\n        throw new JsonPatchError('Operation `value` property is not present (applicable in `add`, `replace` and `test` operations)', 'OPERATION_VALUE_CANNOT_CONTAIN_UNDEFINED', index, operation, document);\n    }\n    else if (document) {\n        if (operation.op == \"add\") {\n            var pathLen = operation.path.split(\"/\").length;\n            var existingPathLen = existingPathFragment.split(\"/\").length;\n            if (pathLen !== existingPathLen + 1 && pathLen !== existingPathLen) {\n                throw new JsonPatchError('Cannot perform an `add` operation at the desired path', 'OPERATION_PATH_CANNOT_ADD', index, operation, document);\n            }\n        }\n        else if (operation.op === 'replace' || operation.op === 'remove' || operation.op === '_get') {\n            if (operation.path !== existingPathFragment) {\n                throw new JsonPatchError('Cannot perform the operation at a path that does not exist', 'OPERATION_PATH_UNRESOLVABLE', index, operation, document);\n            }\n        }\n        else if (operation.op === 'move' || operation.op === 'copy') {\n            var existingValue = { op: \"_get\", path: operation.from, value: undefined };\n            var error = validate([existingValue], document);\n            if (error && error.name === 'OPERATION_PATH_UNRESOLVABLE') {\n                throw new JsonPatchError('Cannot perform the operation from a path that does not exist', 'OPERATION_FROM_UNRESOLVABLE', index, operation, document);\n            }\n        }\n    }\n}\n/**\n * Validates a sequence of operations. If `document` parameter is provided, the sequence is additionally validated against the object document.\n * If error is encountered, returns a JsonPatchError object\n * @param sequence\n * @param document\n * @returns {JsonPatchError|undefined}\n */\nexport function validate(sequence, document, externalValidator) {\n    try {\n        if (!Array.isArray(sequence)) {\n            throw new JsonPatchError('Patch sequence must be an array', 'SEQUENCE_NOT_AN_ARRAY');\n        }\n        if (document) {\n            //clone document and sequence so that we can safely try applying operations\n            applyPatch(_deepClone(document), _deepClone(sequence), externalValidator || true);\n        }\n        else {\n            externalValidator = externalValidator || validator;\n            for (var i = 0; i < sequence.length; i++) {\n                externalValidator(sequence[i], i, document, undefined);\n            }\n        }\n    }\n    catch (e) {\n        if (e instanceof JsonPatchError) {\n            return e;\n        }\n        else {\n            throw e;\n        }\n    }\n}\n// based on https://github.com/epoberezkin/fast-deep-equal\n// MIT License\n// Copyright (c) 2017 Evgeny Poberezkin\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// The above copyright notice and this permission notice shall be included in all\n// copies or substantial portions of the Software.\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n// SOFTWARE.\nexport function _areEquals(a, b) {\n    if (a === b)\n        return true;\n    if (a && b && typeof a == 'object' && typeof b == 'object') {\n        var arrA = Array.isArray(a), arrB = Array.isArray(b), i, length, key;\n        if (arrA && arrB) {\n            length = a.length;\n            if (length != b.length)\n                return false;\n            for (i = length; i-- !== 0;)\n                if (!_areEquals(a[i], b[i]))\n                    return false;\n            return true;\n        }\n        if (arrA != arrB)\n            return false;\n        var keys = Object.keys(a);\n        length = keys.length;\n        if (length !== Object.keys(b).length)\n            return false;\n        for (i = length; i-- !== 0;)\n            if (!b.hasOwnProperty(keys[i]))\n                return false;\n        for (i = length; i-- !== 0;) {\n            key = keys[i];\n            if (!_areEquals(a[key], b[key]))\n                return false;\n        }\n        return true;\n    }\n    return a !== a && b !== b;\n}\n;\n"],"names":["JsonPatchError","PatchError","deepClone","_deepClone","objOps","obj","key","document","removed","getValueByPointer","originalValue","applyOperation","valueToCopy","_areEquals","arrOps","arr","i","isInteger","removedList","pointer","getOriginalDestination","operation","validateOperation","mutateDocument","banPrototypeModifications","index","validator","returnValue","path","keys","t","len","existingPathFragment","validateFunction","unescapePathComponent","applyPatch","patch","results","length_1","applyReducer","operationResult","hasUndefined","pathLen","existingPathLen","existingValue","error","validate","sequence","externalValidator","e","a","b","arrA","arrB","length"],"mappings":";AACU,IAACA,IAAiBC,GACjBC,IAAYC,GAQnBC,IAAS;AAAA,EACT,KAAK,SAAUC,GAAKC,GAAKC,GAAU;AAC/B,WAAAF,EAAIC,CAAG,IAAI,KAAK,OACT,EAAE,aAAaC,EAAU;AAAA,EACnC;AAAA,EACD,QAAQ,SAAUF,GAAKC,GAAKC,GAAU;AAClC,QAAIC,IAAUH,EAAIC,CAAG;AACrB,kBAAOD,EAAIC,CAAG,GACP,EAAE,aAAaC,GAAU,SAASC,EAAS;AAAA,EACrD;AAAA,EACD,SAAS,SAAUH,GAAKC,GAAKC,GAAU;AACnC,QAAIC,IAAUH,EAAIC,CAAG;AACrB,WAAAD,EAAIC,CAAG,IAAI,KAAK,OACT,EAAE,aAAaC,GAAU,SAASC,EAAS;AAAA,EACrD;AAAA,EACD,MAAM,SAAUH,GAAKC,GAAKC,GAAU;AAIhC,QAAIC,IAAUC,EAAkBF,GAAU,KAAK,IAAI;AACnD,IAAIC,MACAA,IAAUL,EAAWK,CAAO;AAEhC,QAAIE,IAAgBC,EAAeJ,GAAU,EAAE,IAAI,UAAU,MAAM,KAAK,KAAM,CAAA,EAAE;AAChF,WAAAI,EAAeJ,GAAU,EAAE,IAAI,OAAO,MAAM,KAAK,MAAM,OAAOG,GAAe,GACtE,EAAE,aAAaH,GAAU,SAASC,EAAS;AAAA,EACrD;AAAA,EACD,MAAM,SAAUH,GAAKC,GAAKC,GAAU;AAChC,QAAIK,IAAcH,EAAkBF,GAAU,KAAK,IAAI;AAEvD,WAAAI,EAAeJ,GAAU,EAAE,IAAI,OAAO,MAAM,KAAK,MAAM,OAAOJ,EAAWS,CAAW,EAAC,CAAE,GAChF,EAAE,aAAaL,EAAU;AAAA,EACnC;AAAA,EACD,MAAM,SAAUF,GAAKC,GAAKC,GAAU;AAChC,WAAO,EAAE,aAAaA,GAAU,MAAMM,EAAWR,EAAIC,CAAG,GAAG,KAAK,KAAK,EAAG;AAAA,EAC3E;AAAA,EACD,MAAM,SAAUD,GAAKC,GAAKC,GAAU;AAChC,gBAAK,QAAQF,EAAIC,CAAG,GACb,EAAE,aAAaC,EAAU;AAAA,EACxC;AACA,GAEIO,IAAS;AAAA,EACT,KAAK,SAAUC,GAAKC,GAAGT,GAAU;AAC7B,WAAIU,EAAUD,CAAC,IACXD,EAAI,OAAOC,GAAG,GAAG,KAAK,KAAK,IAG3BD,EAAIC,CAAC,IAAI,KAAK,OAGX,EAAE,aAAaT,GAAU,OAAOS,EAAG;AAAA,EAC7C;AAAA,EACD,QAAQ,SAAUD,GAAKC,GAAGT,GAAU;AAChC,QAAIW,IAAcH,EAAI,OAAOC,GAAG,CAAC;AACjC,WAAO,EAAE,aAAaT,GAAU,SAASW,EAAY,CAAC,EAAG;AAAA,EAC5D;AAAA,EACD,SAAS,SAAUH,GAAKC,GAAGT,GAAU;AACjC,QAAIC,IAAUO,EAAIC,CAAC;AACnB,WAAAD,EAAIC,CAAC,IAAI,KAAK,OACP,EAAE,aAAaT,GAAU,SAASC,EAAS;AAAA,EACrD;AAAA,EACD,MAAMJ,EAAO;AAAA,EACb,MAAMA,EAAO;AAAA,EACb,MAAMA,EAAO;AAAA,EACb,MAAMA,EAAO;AACjB;AASO,SAASK,EAAkBF,GAAUY,GAAS;AACjD,MAAIA,KAAW;AACX,WAAOZ;AAEX,MAAIa,IAAyB,EAAE,IAAI,QAAQ,MAAMD,EAAS;AAC1D,SAAAR,EAAeJ,GAAUa,CAAsB,GACxCA,EAAuB;AAClC;AAeO,SAAST,EAAeJ,GAAUc,GAAWC,GAAmBC,GAAgBC,GAA2BC,GAAO;AAcrH,MAbIH,MAAsB,WAAUA,IAAoB,KACpDC,MAAmB,WAAUA,IAAiB,KAC9CC,MAA8B,WAAUA,IAA4B,KACpEC,MAAU,WAAUA,IAAQ,IAC5BH,MACI,OAAOA,KAAqB,aAC5BA,EAAkBD,GAAW,GAAGd,GAAUc,EAAU,IAAI,IAGxDK,EAAUL,GAAW,CAAC,IAI1BA,EAAU,SAAS,IAAI;AACvB,QAAIM,IAAc,EAAE,aAAapB,EAAU;AAC3C,QAAIc,EAAU,OAAO;AACjB,aAAAM,EAAY,cAAcN,EAAU,OAC7BM;AAEN,QAAIN,EAAU,OAAO;AACtB,aAAAM,EAAY,cAAcN,EAAU,OACpCM,EAAY,UAAUpB,GACfoB;AAEN,QAAIN,EAAU,OAAO,UAAUA,EAAU,OAAO;AACjD,aAAAM,EAAY,cAAclB,EAAkBF,GAAUc,EAAU,IAAI,GAChEA,EAAU,OAAO,WACjBM,EAAY,UAAUpB,IAEnBoB;AAEN,QAAIN,EAAU,OAAO,QAAQ;AAE9B,UADAM,EAAY,OAAOd,EAAWN,GAAUc,EAAU,KAAK,GACnDM,EAAY,SAAS;AACrB,cAAM,IAAI3B,EAAe,yBAAyB,yBAAyByB,GAAOJ,GAAWd,CAAQ;AAEzG,aAAAoB,EAAY,cAAcpB,GACnBoB;AAAA,IACnB,OACa;AAAA,UAAIN,EAAU,OAAO;AACtB,eAAAM,EAAY,UAAUpB,GACtBoB,EAAY,cAAc,MACnBA;AAEN,UAAIN,EAAU,OAAO;AACtB,eAAAA,EAAU,QAAQd,GACXoB;AAGP,UAAIL;AACA,cAAM,IAAItB,EAAe,wEAAwE,wBAAwByB,GAAOJ,GAAWd,CAAQ;AAGnJ,aAAOoB;AAAA;AAAA,EAGlB,OACI;AACD,IAAKJ,MACDhB,IAAWJ,EAAWI,CAAQ;AAElC,QAAIqB,IAAOP,EAAU,QAAQ,IACzBQ,IAAOD,EAAK,MAAM,GAAG,GACrBvB,IAAME,GACNuB,IAAI,GACJC,IAAMF,EAAK,QACXG,IAAuB,QACvB1B,IAAM,QACN2B,IAAmB;AAOvB,SANI,OAAOX,KAAqB,aAC5BW,IAAmBX,IAGnBW,IAAmBP,OAEV;AAKT,UAJApB,IAAMuB,EAAKC,CAAC,GACRxB,KAAOA,EAAI,QAAQ,GAAG,KAAK,OAC3BA,IAAM4B,EAAsB5B,CAAG,IAE/BkB,MACClB,KAAO,eACHA,KAAO,eAAewB,IAAI,KAAKD,EAAKC,IAAI,CAAC,KAAK;AACnD,cAAM,IAAI,UAAU,+OAA+O;AAgBvQ,UAdIR,KACIU,MAAyB,WACrB3B,EAAIC,CAAG,MAAM,SACb0B,IAAuBH,EAAK,MAAM,GAAGC,CAAC,EAAE,KAAK,GAAG,IAE3CA,KAAKC,IAAM,MAChBC,IAAuBX,EAAU,OAEjCW,MAAyB,UACzBC,EAAiBZ,GAAW,GAAGd,GAAUyB,CAAoB,IAIzEF,KACI,MAAM,QAAQzB,CAAG,GAAG;AACpB,YAAIC,MAAQ;AACR,UAAAA,IAAMD,EAAI;AAAA,aAET;AACD,cAAIiB,KAAqB,CAACL,EAAUX,CAAG;AACnC,kBAAM,IAAIN,EAAe,2HAA2H,sCAAsCyB,GAAOJ,GAAWd,CAAQ;AAEnN,UAAIU,EAAUX,CAAG,MAClBA,IAAM,CAAC,CAACA;AAAA,QAEhC;AACgB,YAAIwB,KAAKC,GAAK;AACV,cAAIT,KAAqBD,EAAU,OAAO,SAASf,IAAMD,EAAI;AACzD,kBAAM,IAAIL,EAAe,oFAAoF,iCAAiCyB,GAAOJ,GAAWd,CAAQ;AAE5K,cAAIoB,IAAcb,EAAOO,EAAU,EAAE,EAAE,KAAKA,GAAWhB,GAAKC,GAAKC,CAAQ;AACzE,cAAIoB,EAAY,SAAS;AACrB,kBAAM,IAAI3B,EAAe,yBAAyB,yBAAyByB,GAAOJ,GAAWd,CAAQ;AAEzG,iBAAOoB;AAAA,QAC3B;AAAA,MACA,WAEoBG,KAAKC,GAAK;AACV,YAAIJ,IAAcvB,EAAOiB,EAAU,EAAE,EAAE,KAAKA,GAAWhB,GAAKC,GAAKC,CAAQ;AACzE,YAAIoB,EAAY,SAAS;AACrB,gBAAM,IAAI3B,EAAe,yBAAyB,yBAAyByB,GAAOJ,GAAWd,CAAQ;AAEzG,eAAOoB;AAAA,MAC3B;AAKY,UAHAtB,IAAMA,EAAIC,CAAG,GAGTgB,KAAqBQ,IAAIC,MAAQ,CAAC1B,KAAO,OAAOA,KAAQ;AACxD,cAAM,IAAIL,EAAe,gDAAgD,+BAA+ByB,GAAOJ,GAAWd,CAAQ;AAAA,IAElJ;AAAA,EACA;AACA;AAeO,SAAS4B,EAAW5B,GAAU6B,GAAOd,GAAmBC,GAAgBC,GAA2B;AAGtG,MAFID,MAAmB,WAAUA,IAAiB,KAC9CC,MAA8B,WAAUA,IAA4B,KACpEF,KACI,CAAC,MAAM,QAAQc,CAAK;AACpB,UAAM,IAAIpC,EAAe,mCAAmC,uBAAuB;AAG3F,EAAKuB,MACDhB,IAAWJ,EAAWI,CAAQ;AAGlC,WADI8B,IAAU,IAAI,MAAMD,EAAM,MAAM,GAC3BpB,IAAI,GAAGsB,IAAWF,EAAM,QAAQpB,IAAIsB,GAAUtB;AAEnD,IAAAqB,EAAQrB,CAAC,IAAIL,EAAeJ,GAAU6B,EAAMpB,CAAC,GAAGM,GAAmB,IAAME,GAA2BR,CAAC,GACrGT,IAAW8B,EAAQrB,CAAC,EAAE;AAE1B,SAAAqB,EAAQ,cAAc9B,GACf8B;AACX;AAUO,SAASE,EAAahC,GAAUc,GAAWI,GAAO;AACrD,MAAIe,IAAkB7B,EAAeJ,GAAUc,CAAS;AACxD,MAAImB,EAAgB,SAAS;AACzB,UAAM,IAAIxC,EAAe,yBAAyB,yBAAyByB,GAAOJ,GAAWd,CAAQ;AAEzG,SAAOiC,EAAgB;AAC3B;AAQO,SAASd,EAAUL,GAAWI,GAAOlB,GAAUyB,GAAsB;AACxE,MAAI,OAAOX,KAAc,YAAYA,MAAc,QAAQ,MAAM,QAAQA,CAAS;AAC9E,UAAM,IAAIrB,EAAe,8BAA8B,2BAA2ByB,GAAOJ,GAAWd,CAAQ;AAE3G,MAAKH,EAAOiB,EAAU,EAAE,GAGxB;AAAA,QAAI,OAAOA,EAAU,QAAS;AAC/B,YAAM,IAAIrB,EAAe,6CAA6C,0BAA0ByB,GAAOJ,GAAWd,CAAQ;AAEzH,QAAIc,EAAU,KAAK,QAAQ,GAAG,MAAM,KAAKA,EAAU,KAAK,SAAS;AAElE,YAAM,IAAIrB,EAAe,iDAAiD,0BAA0ByB,GAAOJ,GAAWd,CAAQ;AAE7H,SAAKc,EAAU,OAAO,UAAUA,EAAU,OAAO,WAAW,OAAOA,EAAU,QAAS;AACvF,YAAM,IAAIrB,EAAe,yFAAyF,2BAA2ByB,GAAOJ,GAAWd,CAAQ;AAEtK,SAAKc,EAAU,OAAO,SAASA,EAAU,OAAO,aAAaA,EAAU,OAAO,WAAWA,EAAU,UAAU;AAC9G,YAAM,IAAIrB,EAAe,oGAAoG,4BAA4ByB,GAAOJ,GAAWd,CAAQ;AAElL,SAAKc,EAAU,OAAO,SAASA,EAAU,OAAO,aAAaA,EAAU,OAAO,WAAWoB,EAAapB,EAAU,KAAK;AACtH,YAAM,IAAIrB,EAAe,oGAAoG,4CAA4CyB,GAAOJ,GAAWd,CAAQ;AAElM,QAAIA;AACL,UAAIc,EAAU,MAAM,OAAO;AACvB,YAAIqB,IAAUrB,EAAU,KAAK,MAAM,GAAG,EAAE,QACpCsB,IAAkBX,EAAqB,MAAM,GAAG,EAAE;AACtD,YAAIU,MAAYC,IAAkB,KAAKD,MAAYC;AAC/C,gBAAM,IAAI3C,EAAe,yDAAyD,6BAA6ByB,GAAOJ,GAAWd,CAAQ;AAAA,MAEzJ,WACiBc,EAAU,OAAO,aAAaA,EAAU,OAAO,YAAYA,EAAU,OAAO;AACjF,YAAIA,EAAU,SAASW;AACnB,gBAAM,IAAIhC,EAAe,8DAA8D,+BAA+ByB,GAAOJ,GAAWd,CAAQ;AAAA,iBAG/Ic,EAAU,OAAO,UAAUA,EAAU,OAAO,QAAQ;AACzD,YAAIuB,IAAgB,EAAE,IAAI,QAAQ,MAAMvB,EAAU,MAAM,OAAO,OAAW,GACtEwB,IAAQC,EAAS,CAACF,CAAa,GAAGrC,CAAQ;AAC9C,YAAIsC,KAASA,EAAM,SAAS;AACxB,gBAAM,IAAI7C,EAAe,gEAAgE,+BAA+ByB,GAAOJ,GAAWd,CAAQ;AAAA,MAElK;AAAA;AAAA,QArCQ,OAAM,IAAIP,EAAe,wEAAwE,wBAAwByB,GAAOJ,GAAWd,CAAQ;AAuC3J;AAQO,SAASuC,EAASC,GAAUxC,GAAUyC,GAAmB;AAC5D,MAAI;AACA,QAAI,CAAC,MAAM,QAAQD,CAAQ;AACvB,YAAM,IAAI/C,EAAe,mCAAmC,uBAAuB;AAEvF,QAAIO;AAEA,MAAA4B,EAAWhC,EAAWI,CAAQ,GAAGJ,EAAW4C,CAAQ,GAAGC,KAAqB,EAAI;AAAA,SAE/E;AACD,MAAAA,IAAoBA,KAAqBtB;AACzC,eAASV,IAAI,GAAGA,IAAI+B,EAAS,QAAQ/B;AACjC,QAAAgC,EAAkBD,EAAS/B,CAAC,GAAGA,GAAGT,GAAU,MAAS;AAAA,IAErE;AAAA,EACA,SACW0C,GAAG;AACN,QAAIA,aAAajD;AACb,aAAOiD;AAGP,UAAMA;AAAA,EAElB;AACA;AAmBO,SAASpC,EAAWqC,GAAGC,GAAG;AAC7B,MAAID,MAAMC;AACN,WAAO;AACX,MAAID,KAAKC,KAAK,OAAOD,KAAK,YAAY,OAAOC,KAAK,UAAU;AACxD,QAAIC,IAAO,MAAM,QAAQF,CAAC,GAAGG,IAAO,MAAM,QAAQF,CAAC,GAAGnC,GAAGsC,GAAQhD;AACjE,QAAI8C,KAAQC,GAAM;AAEd,UADAC,IAASJ,EAAE,QACPI,KAAUH,EAAE;AACZ,eAAO;AACX,WAAKnC,IAAIsC,GAAQtC,QAAQ;AACrB,YAAI,CAACH,EAAWqC,EAAElC,CAAC,GAAGmC,EAAEnC,CAAC,CAAC;AACtB,iBAAO;AACf,aAAO;AAAA,IACnB;AACQ,QAAIoC,KAAQC;AACR,aAAO;AACX,QAAIxB,IAAO,OAAO,KAAKqB,CAAC;AAExB,QADAI,IAASzB,EAAK,QACVyB,MAAW,OAAO,KAAKH,CAAC,EAAE;AAC1B,aAAO;AACX,SAAKnC,IAAIsC,GAAQtC,QAAQ;AACrB,UAAI,CAACmC,EAAE,eAAetB,EAAKb,CAAC,CAAC;AACzB,eAAO;AACf,SAAKA,IAAIsC,GAAQtC,QAAQ;AAErB,UADAV,IAAMuB,EAAKb,CAAC,GACR,CAACH,EAAWqC,EAAE5C,CAAG,GAAG6C,EAAE7C,CAAG,CAAC;AAC1B,eAAO;AAEf,WAAO;AAAA,EACf;AACI,SAAO4C,MAAMA,KAAKC,MAAMA;AAC5B;","x_google_ignoreList":[0]}
+{"version":3,"file":"core.js","sources":["../../../../../../../../../node_modules/.pnpm/fast-json-patch@3.1.1/node_modules/fast-json-patch/module/core.mjs"],"sourcesContent":["import { PatchError, _deepClone, isInteger, unescapePathComponent, hasUndefined } from './helpers.mjs';\nexport var JsonPatchError = PatchError;\nexport var deepClone = _deepClone;\n/* We use a Javascript hash to store each\n function. Each hash entry (property) uses\n the operation identifiers specified in rfc6902.\n In this way, we can map each patch operation\n to its dedicated function in efficient way.\n */\n/* The operations applicable to an object */\nvar objOps = {\n    add: function (obj, key, document) {\n        obj[key] = this.value;\n        return { newDocument: document };\n    },\n    remove: function (obj, key, document) {\n        var removed = obj[key];\n        delete obj[key];\n        return { newDocument: document, removed: removed };\n    },\n    replace: function (obj, key, document) {\n        var removed = obj[key];\n        obj[key] = this.value;\n        return { newDocument: document, removed: removed };\n    },\n    move: function (obj, key, document) {\n        /* in case move target overwrites an existing value,\n        return the removed value, this can be taxing performance-wise,\n        and is potentially unneeded */\n        var removed = getValueByPointer(document, this.path);\n        if (removed) {\n            removed = _deepClone(removed);\n        }\n        var originalValue = applyOperation(document, { op: \"remove\", path: this.from }).removed;\n        applyOperation(document, { op: \"add\", path: this.path, value: originalValue });\n        return { newDocument: document, removed: removed };\n    },\n    copy: function (obj, key, document) {\n        var valueToCopy = getValueByPointer(document, this.from);\n        // enforce copy by value so further operations don't affect source (see issue #177)\n        applyOperation(document, { op: \"add\", path: this.path, value: _deepClone(valueToCopy) });\n        return { newDocument: document };\n    },\n    test: function (obj, key, document) {\n        return { newDocument: document, test: _areEquals(obj[key], this.value) };\n    },\n    _get: function (obj, key, document) {\n        this.value = obj[key];\n        return { newDocument: document };\n    }\n};\n/* The operations applicable to an array. Many are the same as for the object */\nvar arrOps = {\n    add: function (arr, i, document) {\n        if (isInteger(i)) {\n            arr.splice(i, 0, this.value);\n        }\n        else { // array props\n            arr[i] = this.value;\n        }\n        // this may be needed when using '-' in an array\n        return { newDocument: document, index: i };\n    },\n    remove: function (arr, i, document) {\n        var removedList = arr.splice(i, 1);\n        return { newDocument: document, removed: removedList[0] };\n    },\n    replace: function (arr, i, document) {\n        var removed = arr[i];\n        arr[i] = this.value;\n        return { newDocument: document, removed: removed };\n    },\n    move: objOps.move,\n    copy: objOps.copy,\n    test: objOps.test,\n    _get: objOps._get\n};\n/**\n * Retrieves a value from a JSON document by a JSON pointer.\n * Returns the value.\n *\n * @param document The document to get the value from\n * @param pointer an escaped JSON pointer\n * @return The retrieved value\n */\nexport function getValueByPointer(document, pointer) {\n    if (pointer == '') {\n        return document;\n    }\n    var getOriginalDestination = { op: \"_get\", path: pointer };\n    applyOperation(document, getOriginalDestination);\n    return getOriginalDestination.value;\n}\n/**\n * Apply a single JSON Patch Operation on a JSON document.\n * Returns the {newDocument, result} of the operation.\n * It modifies the `document` and `operation` objects - it gets the values by reference.\n * If you would like to avoid touching your values, clone them:\n * `jsonpatch.applyOperation(document, jsonpatch._deepClone(operation))`.\n *\n * @param document The document to patch\n * @param operation The operation to apply\n * @param validateOperation `false` is without validation, `true` to use default jsonpatch's validation, or you can pass a `validateOperation` callback to be used for validation.\n * @param mutateDocument Whether to mutate the original document or clone it before applying\n * @param banPrototypeModifications Whether to ban modifications to `__proto__`, defaults to `true`.\n * @return `{newDocument, result}` after the operation\n */\nexport function applyOperation(document, operation, validateOperation, mutateDocument, banPrototypeModifications, index) {\n    if (validateOperation === void 0) { validateOperation = false; }\n    if (mutateDocument === void 0) { mutateDocument = true; }\n    if (banPrototypeModifications === void 0) { banPrototypeModifications = true; }\n    if (index === void 0) { index = 0; }\n    if (validateOperation) {\n        if (typeof validateOperation == 'function') {\n            validateOperation(operation, 0, document, operation.path);\n        }\n        else {\n            validator(operation, 0);\n        }\n    }\n    /* ROOT OPERATIONS */\n    if (operation.path === \"\") {\n        var returnValue = { newDocument: document };\n        if (operation.op === 'add') {\n            returnValue.newDocument = operation.value;\n            return returnValue;\n        }\n        else if (operation.op === 'replace') {\n            returnValue.newDocument = operation.value;\n            returnValue.removed = document; //document we removed\n            return returnValue;\n        }\n        else if (operation.op === 'move' || operation.op === 'copy') { // it's a move or copy to root\n            returnValue.newDocument = getValueByPointer(document, operation.from); // get the value by json-pointer in `from` field\n            if (operation.op === 'move') { // report removed item\n                returnValue.removed = document;\n            }\n            return returnValue;\n        }\n        else if (operation.op === 'test') {\n            returnValue.test = _areEquals(document, operation.value);\n            if (returnValue.test === false) {\n                throw new JsonPatchError(\"Test operation failed\", 'TEST_OPERATION_FAILED', index, operation, document);\n            }\n            returnValue.newDocument = document;\n            return returnValue;\n        }\n        else if (operation.op === 'remove') { // a remove on root\n            returnValue.removed = document;\n            returnValue.newDocument = null;\n            return returnValue;\n        }\n        else if (operation.op === '_get') {\n            operation.value = document;\n            return returnValue;\n        }\n        else { /* bad operation */\n            if (validateOperation) {\n                throw new JsonPatchError('Operation `op` property is not one of operations defined in RFC-6902', 'OPERATION_OP_INVALID', index, operation, document);\n            }\n            else {\n                return returnValue;\n            }\n        }\n    } /* END ROOT OPERATIONS */\n    else {\n        if (!mutateDocument) {\n            document = _deepClone(document);\n        }\n        var path = operation.path || \"\";\n        var keys = path.split('/');\n        var obj = document;\n        var t = 1; //skip empty element - http://jsperf.com/to-shift-or-not-to-shift\n        var len = keys.length;\n        var existingPathFragment = undefined;\n        var key = void 0;\n        var validateFunction = void 0;\n        if (typeof validateOperation == 'function') {\n            validateFunction = validateOperation;\n        }\n        else {\n            validateFunction = validator;\n        }\n        while (true) {\n            key = keys[t];\n            if (key && key.indexOf('~') != -1) {\n                key = unescapePathComponent(key);\n            }\n            if (banPrototypeModifications &&\n                (key == '__proto__' ||\n                    (key == 'prototype' && t > 0 && keys[t - 1] == 'constructor'))) {\n                throw new TypeError('JSON-Patch: modifying `__proto__` or `constructor/prototype` prop is banned for security reasons, if this was on purpose, please set `banPrototypeModifications` flag false and pass it to this function. More info in fast-json-patch README');\n            }\n            if (validateOperation) {\n                if (existingPathFragment === undefined) {\n                    if (obj[key] === undefined) {\n                        existingPathFragment = keys.slice(0, t).join('/');\n                    }\n                    else if (t == len - 1) {\n                        existingPathFragment = operation.path;\n                    }\n                    if (existingPathFragment !== undefined) {\n                        validateFunction(operation, 0, document, existingPathFragment);\n                    }\n                }\n            }\n            t++;\n            if (Array.isArray(obj)) {\n                if (key === '-') {\n                    key = obj.length;\n                }\n                else {\n                    if (validateOperation && !isInteger(key)) {\n                        throw new JsonPatchError(\"Expected an unsigned base-10 integer value, making the new referenced value the array element with the zero-based index\", \"OPERATION_PATH_ILLEGAL_ARRAY_INDEX\", index, operation, document);\n                    } // only parse key when it's an integer for `arr.prop` to work\n                    else if (isInteger(key)) {\n                        key = ~~key;\n                    }\n                }\n                if (t >= len) {\n                    if (validateOperation && operation.op === \"add\" && key > obj.length) {\n                        throw new JsonPatchError(\"The specified index MUST NOT be greater than the number of elements in the array\", \"OPERATION_VALUE_OUT_OF_BOUNDS\", index, operation, document);\n                    }\n                    var returnValue = arrOps[operation.op].call(operation, obj, key, document); // Apply patch\n                    if (returnValue.test === false) {\n                        throw new JsonPatchError(\"Test operation failed\", 'TEST_OPERATION_FAILED', index, operation, document);\n                    }\n                    return returnValue;\n                }\n            }\n            else {\n                if (t >= len) {\n                    var returnValue = objOps[operation.op].call(operation, obj, key, document); // Apply patch\n                    if (returnValue.test === false) {\n                        throw new JsonPatchError(\"Test operation failed\", 'TEST_OPERATION_FAILED', index, operation, document);\n                    }\n                    return returnValue;\n                }\n            }\n            obj = obj[key];\n            // If we have more keys in the path, but the next value isn't a non-null object,\n            // throw an OPERATION_PATH_UNRESOLVABLE error instead of iterating again.\n            if (validateOperation && t < len && (!obj || typeof obj !== \"object\")) {\n                throw new JsonPatchError('Cannot perform operation at the desired path', 'OPERATION_PATH_UNRESOLVABLE', index, operation, document);\n            }\n        }\n    }\n}\n/**\n * Apply a full JSON Patch array on a JSON document.\n * Returns the {newDocument, result} of the patch.\n * It modifies the `document` object and `patch` - it gets the values by reference.\n * If you would like to avoid touching your values, clone them:\n * `jsonpatch.applyPatch(document, jsonpatch._deepClone(patch))`.\n *\n * @param document The document to patch\n * @param patch The patch to apply\n * @param validateOperation `false` is without validation, `true` to use default jsonpatch's validation, or you can pass a `validateOperation` callback to be used for validation.\n * @param mutateDocument Whether to mutate the original document or clone it before applying\n * @param banPrototypeModifications Whether to ban modifications to `__proto__`, defaults to `true`.\n * @return An array of `{newDocument, result}` after the patch\n */\nexport function applyPatch(document, patch, validateOperation, mutateDocument, banPrototypeModifications) {\n    if (mutateDocument === void 0) { mutateDocument = true; }\n    if (banPrototypeModifications === void 0) { banPrototypeModifications = true; }\n    if (validateOperation) {\n        if (!Array.isArray(patch)) {\n            throw new JsonPatchError('Patch sequence must be an array', 'SEQUENCE_NOT_AN_ARRAY');\n        }\n    }\n    if (!mutateDocument) {\n        document = _deepClone(document);\n    }\n    var results = new Array(patch.length);\n    for (var i = 0, length_1 = patch.length; i < length_1; i++) {\n        // we don't need to pass mutateDocument argument because if it was true, we already deep cloned the object, we'll just pass `true`\n        results[i] = applyOperation(document, patch[i], validateOperation, true, banPrototypeModifications, i);\n        document = results[i].newDocument; // in case root was replaced\n    }\n    results.newDocument = document;\n    return results;\n}\n/**\n * Apply a single JSON Patch Operation on a JSON document.\n * Returns the updated document.\n * Suitable as a reducer.\n *\n * @param document The document to patch\n * @param operation The operation to apply\n * @return The updated document\n */\nexport function applyReducer(document, operation, index) {\n    var operationResult = applyOperation(document, operation);\n    if (operationResult.test === false) { // failed test\n        throw new JsonPatchError(\"Test operation failed\", 'TEST_OPERATION_FAILED', index, operation, document);\n    }\n    return operationResult.newDocument;\n}\n/**\n * Validates a single operation. Called from `jsonpatch.validate`. Throws `JsonPatchError` in case of an error.\n * @param {object} operation - operation object (patch)\n * @param {number} index - index of operation in the sequence\n * @param {object} [document] - object where the operation is supposed to be applied\n * @param {string} [existingPathFragment] - comes along with `document`\n */\nexport function validator(operation, index, document, existingPathFragment) {\n    if (typeof operation !== 'object' || operation === null || Array.isArray(operation)) {\n        throw new JsonPatchError('Operation is not an object', 'OPERATION_NOT_AN_OBJECT', index, operation, document);\n    }\n    else if (!objOps[operation.op]) {\n        throw new JsonPatchError('Operation `op` property is not one of operations defined in RFC-6902', 'OPERATION_OP_INVALID', index, operation, document);\n    }\n    else if (typeof operation.path !== 'string') {\n        throw new JsonPatchError('Operation `path` property is not a string', 'OPERATION_PATH_INVALID', index, operation, document);\n    }\n    else if (operation.path.indexOf('/') !== 0 && operation.path.length > 0) {\n        // paths that aren't empty string should start with \"/\"\n        throw new JsonPatchError('Operation `path` property must start with \"/\"', 'OPERATION_PATH_INVALID', index, operation, document);\n    }\n    else if ((operation.op === 'move' || operation.op === 'copy') && typeof operation.from !== 'string') {\n        throw new JsonPatchError('Operation `from` property is not present (applicable in `move` and `copy` operations)', 'OPERATION_FROM_REQUIRED', index, operation, document);\n    }\n    else if ((operation.op === 'add' || operation.op === 'replace' || operation.op === 'test') && operation.value === undefined) {\n        throw new JsonPatchError('Operation `value` property is not present (applicable in `add`, `replace` and `test` operations)', 'OPERATION_VALUE_REQUIRED', index, operation, document);\n    }\n    else if ((operation.op === 'add' || operation.op === 'replace' || operation.op === 'test') && hasUndefined(operation.value)) {\n        throw new JsonPatchError('Operation `value` property is not present (applicable in `add`, `replace` and `test` operations)', 'OPERATION_VALUE_CANNOT_CONTAIN_UNDEFINED', index, operation, document);\n    }\n    else if (document) {\n        if (operation.op == \"add\") {\n            var pathLen = operation.path.split(\"/\").length;\n            var existingPathLen = existingPathFragment.split(\"/\").length;\n            if (pathLen !== existingPathLen + 1 && pathLen !== existingPathLen) {\n                throw new JsonPatchError('Cannot perform an `add` operation at the desired path', 'OPERATION_PATH_CANNOT_ADD', index, operation, document);\n            }\n        }\n        else if (operation.op === 'replace' || operation.op === 'remove' || operation.op === '_get') {\n            if (operation.path !== existingPathFragment) {\n                throw new JsonPatchError('Cannot perform the operation at a path that does not exist', 'OPERATION_PATH_UNRESOLVABLE', index, operation, document);\n            }\n        }\n        else if (operation.op === 'move' || operation.op === 'copy') {\n            var existingValue = { op: \"_get\", path: operation.from, value: undefined };\n            var error = validate([existingValue], document);\n            if (error && error.name === 'OPERATION_PATH_UNRESOLVABLE') {\n                throw new JsonPatchError('Cannot perform the operation from a path that does not exist', 'OPERATION_FROM_UNRESOLVABLE', index, operation, document);\n            }\n        }\n    }\n}\n/**\n * Validates a sequence of operations. If `document` parameter is provided, the sequence is additionally validated against the object document.\n * If error is encountered, returns a JsonPatchError object\n * @param sequence\n * @param document\n * @returns {JsonPatchError|undefined}\n */\nexport function validate(sequence, document, externalValidator) {\n    try {\n        if (!Array.isArray(sequence)) {\n            throw new JsonPatchError('Patch sequence must be an array', 'SEQUENCE_NOT_AN_ARRAY');\n        }\n        if (document) {\n            //clone document and sequence so that we can safely try applying operations\n            applyPatch(_deepClone(document), _deepClone(sequence), externalValidator || true);\n        }\n        else {\n            externalValidator = externalValidator || validator;\n            for (var i = 0; i < sequence.length; i++) {\n                externalValidator(sequence[i], i, document, undefined);\n            }\n        }\n    }\n    catch (e) {\n        if (e instanceof JsonPatchError) {\n            return e;\n        }\n        else {\n            throw e;\n        }\n    }\n}\n// based on https://github.com/epoberezkin/fast-deep-equal\n// MIT License\n// Copyright (c) 2017 Evgeny Poberezkin\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// The above copyright notice and this permission notice shall be included in all\n// copies or substantial portions of the Software.\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n// SOFTWARE.\nexport function _areEquals(a, b) {\n    if (a === b)\n        return true;\n    if (a && b && typeof a == 'object' && typeof b == 'object') {\n        var arrA = Array.isArray(a), arrB = Array.isArray(b), i, length, key;\n        if (arrA && arrB) {\n            length = a.length;\n            if (length != b.length)\n                return false;\n            for (i = length; i-- !== 0;)\n                if (!_areEquals(a[i], b[i]))\n                    return false;\n            return true;\n        }\n        if (arrA != arrB)\n            return false;\n        var keys = Object.keys(a);\n        length = keys.length;\n        if (length !== Object.keys(b).length)\n            return false;\n        for (i = length; i-- !== 0;)\n            if (!b.hasOwnProperty(keys[i]))\n                return false;\n        for (i = length; i-- !== 0;) {\n            key = keys[i];\n            if (!_areEquals(a[key], b[key]))\n                return false;\n        }\n        return true;\n    }\n    return a !== a && b !== b;\n}\n;\n"],"names":["JsonPatchError","PatchError","deepClone","_deepClone","objOps","obj","key","document","removed","getValueByPointer","originalValue","applyOperation","valueToCopy","_areEquals","arrOps","arr","i","isInteger","removedList","pointer","getOriginalDestination","operation","validateOperation","mutateDocument","banPrototypeModifications","index","validator","returnValue","path","keys","t","len","existingPathFragment","validateFunction","unescapePathComponent","applyPatch","patch","results","length_1","applyReducer","operationResult","hasUndefined","pathLen","existingPathLen","existingValue","error","validate","sequence","externalValidator","e","a","b","arrA","arrB","length"],"mappings":";AACU,IAACA,IAAiBC,GACjBC,IAAYC,GAQnBC,IAAS;AAAA,EACT,KAAK,SAAUC,GAAKC,GAAKC,GAAU;AAC/B,WAAAF,EAAIC,CAAG,IAAI,KAAK,OACT,EAAE,aAAaC,EAAQ;AAAA,EAClC;AAAA,EACA,QAAQ,SAAUF,GAAKC,GAAKC,GAAU;AAClC,QAAIC,IAAUH,EAAIC,CAAG;AACrB,kBAAOD,EAAIC,CAAG,GACP,EAAE,aAAaC,GAAU,SAASC,EAAO;AAAA,EACpD;AAAA,EACA,SAAS,SAAUH,GAAKC,GAAKC,GAAU;AACnC,QAAIC,IAAUH,EAAIC,CAAG;AACrB,WAAAD,EAAIC,CAAG,IAAI,KAAK,OACT,EAAE,aAAaC,GAAU,SAASC,EAAO;AAAA,EACpD;AAAA,EACA,MAAM,SAAUH,GAAKC,GAAKC,GAAU;AAIhC,QAAIC,IAAUC,EAAkBF,GAAU,KAAK,IAAI;AACnD,IAAIC,MACAA,IAAUL,EAAWK,CAAO;AAEhC,QAAIE,IAAgBC,EAAeJ,GAAU,EAAE,IAAI,UAAU,MAAM,KAAK,KAAI,CAAE,EAAE;AAChF,WAAAI,EAAeJ,GAAU,EAAE,IAAI,OAAO,MAAM,KAAK,MAAM,OAAOG,GAAe,GACtE,EAAE,aAAaH,GAAU,SAASC,EAAO;AAAA,EACpD;AAAA,EACA,MAAM,SAAUH,GAAKC,GAAKC,GAAU;AAChC,QAAIK,IAAcH,EAAkBF,GAAU,KAAK,IAAI;AAEvD,WAAAI,EAAeJ,GAAU,EAAE,IAAI,OAAO,MAAM,KAAK,MAAM,OAAOJ,EAAWS,CAAW,EAAC,CAAE,GAChF,EAAE,aAAaL,EAAQ;AAAA,EAClC;AAAA,EACA,MAAM,SAAUF,GAAKC,GAAKC,GAAU;AAChC,WAAO,EAAE,aAAaA,GAAU,MAAMM,EAAWR,EAAIC,CAAG,GAAG,KAAK,KAAK,EAAC;AAAA,EAC1E;AAAA,EACA,MAAM,SAAUD,GAAKC,GAAKC,GAAU;AAChC,gBAAK,QAAQF,EAAIC,CAAG,GACb,EAAE,aAAaC,EAAQ;AAAA,EAClC;AACJ,GAEIO,IAAS;AAAA,EACT,KAAK,SAAUC,GAAKC,GAAGT,GAAU;AAC7B,WAAIU,EAAUD,CAAC,IACXD,EAAI,OAAOC,GAAG,GAAG,KAAK,KAAK,IAG3BD,EAAIC,CAAC,IAAI,KAAK,OAGX,EAAE,aAAaT,GAAU,OAAOS,EAAC;AAAA,EAC5C;AAAA,EACA,QAAQ,SAAUD,GAAKC,GAAGT,GAAU;AAChC,QAAIW,IAAcH,EAAI,OAAOC,GAAG,CAAC;AACjC,WAAO,EAAE,aAAaT,GAAU,SAASW,EAAY,CAAC,EAAC;AAAA,EAC3D;AAAA,EACA,SAAS,SAAUH,GAAKC,GAAGT,GAAU;AACjC,QAAIC,IAAUO,EAAIC,CAAC;AACnB,WAAAD,EAAIC,CAAC,IAAI,KAAK,OACP,EAAE,aAAaT,GAAU,SAASC,EAAO;AAAA,EACpD;AAAA,EACA,MAAMJ,EAAO;AAAA,EACb,MAAMA,EAAO;AAAA,EACb,MAAMA,EAAO;AAAA,EACb,MAAMA,EAAO;AACjB;AASO,SAASK,EAAkBF,GAAUY,GAAS;AACjD,MAAIA,KAAW;AACX,WAAOZ;AAEX,MAAIa,IAAyB,EAAE,IAAI,QAAQ,MAAMD,EAAO;AACxD,SAAAR,EAAeJ,GAAUa,CAAsB,GACxCA,EAAuB;AAClC;AAeO,SAAST,EAAeJ,GAAUc,GAAWC,GAAmBC,GAAgBC,GAA2BC,GAAO;AAcrH,MAbIH,MAAsB,WAAUA,IAAoB,KACpDC,MAAmB,WAAUA,IAAiB,KAC9CC,MAA8B,WAAUA,IAA4B,KACpEC,MAAU,WAAUA,IAAQ,IAC5BH,MACI,OAAOA,KAAqB,aAC5BA,EAAkBD,GAAW,GAAGd,GAAUc,EAAU,IAAI,IAGxDK,EAAUL,GAAW,CAAC,IAI1BA,EAAU,SAAS,IAAI;AACvB,QAAIM,IAAc,EAAE,aAAapB,EAAQ;AACzC,QAAIc,EAAU,OAAO;AACjB,aAAAM,EAAY,cAAcN,EAAU,OAC7BM;AAEN,QAAIN,EAAU,OAAO;AACtB,aAAAM,EAAY,cAAcN,EAAU,OACpCM,EAAY,UAAUpB,GACfoB;AAEN,QAAIN,EAAU,OAAO,UAAUA,EAAU,OAAO;AACjD,aAAAM,EAAY,cAAclB,EAAkBF,GAAUc,EAAU,IAAI,GAChEA,EAAU,OAAO,WACjBM,EAAY,UAAUpB,IAEnBoB;AAEN,QAAIN,EAAU,OAAO,QAAQ;AAE9B,UADAM,EAAY,OAAOd,EAAWN,GAAUc,EAAU,KAAK,GACnDM,EAAY,SAAS;AACrB,cAAM,IAAI3B,EAAe,yBAAyB,yBAAyByB,GAAOJ,GAAWd,CAAQ;AAEzG,aAAAoB,EAAY,cAAcpB,GACnBoB;AAAA,IACX,OACK;AAAA,UAAIN,EAAU,OAAO;AACtB,eAAAM,EAAY,UAAUpB,GACtBoB,EAAY,cAAc,MACnBA;AAEN,UAAIN,EAAU,OAAO;AACtB,eAAAA,EAAU,QAAQd,GACXoB;AAGP,UAAIL;AACA,cAAM,IAAItB,EAAe,wEAAwE,wBAAwByB,GAAOJ,GAAWd,CAAQ;AAGnJ,aAAOoB;AAAA;AAAA,EAGnB,OACK;AACD,IAAKJ,MACDhB,IAAWJ,EAAWI,CAAQ;AAElC,QAAIqB,IAAOP,EAAU,QAAQ,IACzBQ,IAAOD,EAAK,MAAM,GAAG,GACrBvB,IAAME,GACNuB,IAAI,GACJC,IAAMF,EAAK,QACXG,IAAuB,QACvB1B,IAAM,QACN2B,IAAmB;AAOvB,SANI,OAAOX,KAAqB,aAC5BW,IAAmBX,IAGnBW,IAAmBP,OAEV;AAKT,UAJApB,IAAMuB,EAAKC,CAAC,GACRxB,KAAOA,EAAI,QAAQ,GAAG,KAAK,OAC3BA,IAAM4B,EAAsB5B,CAAG,IAE/BkB,MACClB,KAAO,eACHA,KAAO,eAAewB,IAAI,KAAKD,EAAKC,IAAI,CAAC,KAAK;AACnD,cAAM,IAAI,UAAU,+OAA+O;AAgBvQ,UAdIR,KACIU,MAAyB,WACrB3B,EAAIC,CAAG,MAAM,SACb0B,IAAuBH,EAAK,MAAM,GAAGC,CAAC,EAAE,KAAK,GAAG,IAE3CA,KAAKC,IAAM,MAChBC,IAAuBX,EAAU,OAEjCW,MAAyB,UACzBC,EAAiBZ,GAAW,GAAGd,GAAUyB,CAAoB,IAIzEF,KACI,MAAM,QAAQzB,CAAG,GAAG;AACpB,YAAIC,MAAQ;AACR,UAAAA,IAAMD,EAAI;AAAA,aAET;AACD,cAAIiB,KAAqB,CAACL,EAAUX,CAAG;AACnC,kBAAM,IAAIN,EAAe,2HAA2H,sCAAsCyB,GAAOJ,GAAWd,CAAQ;AAEnN,UAAIU,EAAUX,CAAG,MAClBA,IAAM,CAAC,CAACA;AAAA,QAEhB;AACA,YAAIwB,KAAKC,GAAK;AACV,cAAIT,KAAqBD,EAAU,OAAO,SAASf,IAAMD,EAAI;AACzD,kBAAM,IAAIL,EAAe,oFAAoF,iCAAiCyB,GAAOJ,GAAWd,CAAQ;AAE5K,cAAIoB,IAAcb,EAAOO,EAAU,EAAE,EAAE,KAAKA,GAAWhB,GAAKC,GAAKC,CAAQ;AACzE,cAAIoB,EAAY,SAAS;AACrB,kBAAM,IAAI3B,EAAe,yBAAyB,yBAAyByB,GAAOJ,GAAWd,CAAQ;AAEzG,iBAAOoB;AAAA,QACX;AAAA,MACJ,WAEQG,KAAKC,GAAK;AACV,YAAIJ,IAAcvB,EAAOiB,EAAU,EAAE,EAAE,KAAKA,GAAWhB,GAAKC,GAAKC,CAAQ;AACzE,YAAIoB,EAAY,SAAS;AACrB,gBAAM,IAAI3B,EAAe,yBAAyB,yBAAyByB,GAAOJ,GAAWd,CAAQ;AAEzG,eAAOoB;AAAA,MACX;AAKJ,UAHAtB,IAAMA,EAAIC,CAAG,GAGTgB,KAAqBQ,IAAIC,MAAQ,CAAC1B,KAAO,OAAOA,KAAQ;AACxD,cAAM,IAAIL,EAAe,gDAAgD,+BAA+ByB,GAAOJ,GAAWd,CAAQ;AAAA,IAE1I;AAAA,EACJ;AACJ;AAeO,SAAS4B,EAAW5B,GAAU6B,GAAOd,GAAmBC,GAAgBC,GAA2B;AAGtG,MAFID,MAAmB,WAAUA,IAAiB,KAC9CC,MAA8B,WAAUA,IAA4B,KACpEF,KACI,CAAC,MAAM,QAAQc,CAAK;AACpB,UAAM,IAAIpC,EAAe,mCAAmC,uBAAuB;AAG3F,EAAKuB,MACDhB,IAAWJ,EAAWI,CAAQ;AAGlC,WADI8B,IAAU,IAAI,MAAMD,EAAM,MAAM,GAC3BpB,IAAI,GAAGsB,IAAWF,EAAM,QAAQpB,IAAIsB,GAAUtB;AAEnD,IAAAqB,EAAQrB,CAAC,IAAIL,EAAeJ,GAAU6B,EAAMpB,CAAC,GAAGM,GAAmB,IAAME,GAA2BR,CAAC,GACrGT,IAAW8B,EAAQrB,CAAC,EAAE;AAE1B,SAAAqB,EAAQ,cAAc9B,GACf8B;AACX;AAUO,SAASE,EAAahC,GAAUc,GAAWI,GAAO;AACrD,MAAIe,IAAkB7B,EAAeJ,GAAUc,CAAS;AACxD,MAAImB,EAAgB,SAAS;AACzB,UAAM,IAAIxC,EAAe,yBAAyB,yBAAyByB,GAAOJ,GAAWd,CAAQ;AAEzG,SAAOiC,EAAgB;AAC3B;AAQO,SAASd,EAAUL,GAAWI,GAAOlB,GAAUyB,GAAsB;AACxE,MAAI,OAAOX,KAAc,YAAYA,MAAc,QAAQ,MAAM,QAAQA,CAAS;AAC9E,UAAM,IAAIrB,EAAe,8BAA8B,2BAA2ByB,GAAOJ,GAAWd,CAAQ;AAE3G,MAAKH,EAAOiB,EAAU,EAAE,GAGxB;AAAA,QAAI,OAAOA,EAAU,QAAS;AAC/B,YAAM,IAAIrB,EAAe,6CAA6C,0BAA0ByB,GAAOJ,GAAWd,CAAQ;AAEzH,QAAIc,EAAU,KAAK,QAAQ,GAAG,MAAM,KAAKA,EAAU,KAAK,SAAS;AAElE,YAAM,IAAIrB,EAAe,iDAAiD,0BAA0ByB,GAAOJ,GAAWd,CAAQ;AAE7H,SAAKc,EAAU,OAAO,UAAUA,EAAU,OAAO,WAAW,OAAOA,EAAU,QAAS;AACvF,YAAM,IAAIrB,EAAe,yFAAyF,2BAA2ByB,GAAOJ,GAAWd,CAAQ;AAEtK,SAAKc,EAAU,OAAO,SAASA,EAAU,OAAO,aAAaA,EAAU,OAAO,WAAWA,EAAU,UAAU;AAC9G,YAAM,IAAIrB,EAAe,oGAAoG,4BAA4ByB,GAAOJ,GAAWd,CAAQ;AAElL,SAAKc,EAAU,OAAO,SAASA,EAAU,OAAO,aAAaA,EAAU,OAAO,WAAWoB,EAAapB,EAAU,KAAK;AACtH,YAAM,IAAIrB,EAAe,oGAAoG,4CAA4CyB,GAAOJ,GAAWd,CAAQ;AAElM,QAAIA;AACL,UAAIc,EAAU,MAAM,OAAO;AACvB,YAAIqB,IAAUrB,EAAU,KAAK,MAAM,GAAG,EAAE,QACpCsB,IAAkBX,EAAqB,MAAM,GAAG,EAAE;AACtD,YAAIU,MAAYC,IAAkB,KAAKD,MAAYC;AAC/C,gBAAM,IAAI3C,EAAe,yDAAyD,6BAA6ByB,GAAOJ,GAAWd,CAAQ;AAAA,MAEjJ,WACSc,EAAU,OAAO,aAAaA,EAAU,OAAO,YAAYA,EAAU,OAAO;AACjF,YAAIA,EAAU,SAASW;AACnB,gBAAM,IAAIhC,EAAe,8DAA8D,+BAA+ByB,GAAOJ,GAAWd,CAAQ;AAAA,iBAG/Ic,EAAU,OAAO,UAAUA,EAAU,OAAO,QAAQ;AACzD,YAAIuB,IAAgB,EAAE,IAAI,QAAQ,MAAMvB,EAAU,MAAM,OAAO,OAAS,GACpEwB,IAAQC,EAAS,CAACF,CAAa,GAAGrC,CAAQ;AAC9C,YAAIsC,KAASA,EAAM,SAAS;AACxB,gBAAM,IAAI7C,EAAe,gEAAgE,+BAA+ByB,GAAOJ,GAAWd,CAAQ;AAAA,MAE1J;AAAA;AAAA,QArCA,OAAM,IAAIP,EAAe,wEAAwE,wBAAwByB,GAAOJ,GAAWd,CAAQ;AAuC3J;AAQO,SAASuC,EAASC,GAAUxC,GAAUyC,GAAmB;AAC5D,MAAI;AACA,QAAI,CAAC,MAAM,QAAQD,CAAQ;AACvB,YAAM,IAAI/C,EAAe,mCAAmC,uBAAuB;AAEvF,QAAIO;AAEA,MAAA4B,EAAWhC,EAAWI,CAAQ,GAAGJ,EAAW4C,CAAQ,GAAGC,KAAqB,EAAI;AAAA,SAE/E;AACD,MAAAA,IAAoBA,KAAqBtB;AACzC,eAASV,IAAI,GAAGA,IAAI+B,EAAS,QAAQ/B;AACjC,QAAAgC,EAAkBD,EAAS/B,CAAC,GAAGA,GAAGT,GAAU,MAAS;AAAA,IAE7D;AAAA,EACJ,SACO0C,GAAG;AACN,QAAIA,aAAajD;AACb,aAAOiD;AAGP,UAAMA;AAAA,EAEd;AACJ;AAmBO,SAASpC,EAAWqC,GAAGC,GAAG;AAC7B,MAAID,MAAMC;AACN,WAAO;AACX,MAAID,KAAKC,KAAK,OAAOD,KAAK,YAAY,OAAOC,KAAK,UAAU;AACxD,QAAIC,IAAO,MAAM,QAAQF,CAAC,GAAGG,IAAO,MAAM,QAAQF,CAAC,GAAGnC,GAAGsC,GAAQhD;AACjE,QAAI8C,KAAQC,GAAM;AAEd,UADAC,IAASJ,EAAE,QACPI,KAAUH,EAAE;AACZ,eAAO;AACX,WAAKnC,IAAIsC,GAAQtC,QAAQ;AACrB,YAAI,CAACH,EAAWqC,EAAElC,CAAC,GAAGmC,EAAEnC,CAAC,CAAC;AACtB,iBAAO;AACf,aAAO;AAAA,IACX;AACA,QAAIoC,KAAQC;AACR,aAAO;AACX,QAAIxB,IAAO,OAAO,KAAKqB,CAAC;AAExB,QADAI,IAASzB,EAAK,QACVyB,MAAW,OAAO,KAAKH,CAAC,EAAE;AAC1B,aAAO;AACX,SAAKnC,IAAIsC,GAAQtC,QAAQ;AACrB,UAAI,CAACmC,EAAE,eAAetB,EAAKb,CAAC,CAAC;AACzB,eAAO;AACf,SAAKA,IAAIsC,GAAQtC,QAAQ;AAErB,UADAV,IAAMuB,EAAKb,CAAC,GACR,CAACH,EAAWqC,EAAE5C,CAAG,GAAG6C,EAAE7C,CAAG,CAAC;AAC1B,eAAO;AAEf,WAAO;AAAA,EACX;AACA,SAAO4C,MAAMA,KAAKC,MAAMA;AAC5B;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/fast-json-patch@3.1.1/node_modules/fast-json-patch/module/duplex.js.map

@@ -1 +1 @@
-{"version":3,"file":"duplex.js","sources":["../../../../../../../../../node_modules/.pnpm/fast-json-patch@3.1.1/node_modules/fast-json-patch/module/duplex.mjs"],"sourcesContent":["/*!\n * https://github.com/Starcounter-Jack/JSON-Patch\n * (c) 2017-2021 Joachim Wester\n * MIT license\n */\nimport { _deepClone, _objectKeys, escapePathComponent, hasOwnProperty } from './helpers.mjs';\nimport { applyPatch } from './core.mjs';\nvar beforeDict = new WeakMap();\nvar Mirror = /** @class */ (function () {\n    function Mirror(obj) {\n        this.observers = new Map();\n        this.obj = obj;\n    }\n    return Mirror;\n}());\nvar ObserverInfo = /** @class */ (function () {\n    function ObserverInfo(callback, observer) {\n        this.callback = callback;\n        this.observer = observer;\n    }\n    return ObserverInfo;\n}());\nfunction getMirror(obj) {\n    return beforeDict.get(obj);\n}\nfunction getObserverFromMirror(mirror, callback) {\n    return mirror.observers.get(callback);\n}\nfunction removeObserverFromMirror(mirror, observer) {\n    mirror.observers.delete(observer.callback);\n}\n/**\n * Detach an observer from an object\n */\nexport function unobserve(root, observer) {\n    observer.unobserve();\n}\n/**\n * Observes changes made to an object, which can then be retrieved using generate\n */\nexport function observe(obj, callback) {\n    var patches = [];\n    var observer;\n    var mirror = getMirror(obj);\n    if (!mirror) {\n        mirror = new Mirror(obj);\n        beforeDict.set(obj, mirror);\n    }\n    else {\n        var observerInfo = getObserverFromMirror(mirror, callback);\n        observer = observerInfo && observerInfo.observer;\n    }\n    if (observer) {\n        return observer;\n    }\n    observer = {};\n    mirror.value = _deepClone(obj);\n    if (callback) {\n        observer.callback = callback;\n        observer.next = null;\n        var dirtyCheck = function () {\n            generate(observer);\n        };\n        var fastCheck = function () {\n            clearTimeout(observer.next);\n            observer.next = setTimeout(dirtyCheck);\n        };\n        if (typeof window !== 'undefined') { //not Node\n            window.addEventListener('mouseup', fastCheck);\n            window.addEventListener('keyup', fastCheck);\n            window.addEventListener('mousedown', fastCheck);\n            window.addEventListener('keydown', fastCheck);\n            window.addEventListener('change', fastCheck);\n        }\n    }\n    observer.patches = patches;\n    observer.object = obj;\n    observer.unobserve = function () {\n        generate(observer);\n        clearTimeout(observer.next);\n        removeObserverFromMirror(mirror, observer);\n        if (typeof window !== 'undefined') {\n            window.removeEventListener('mouseup', fastCheck);\n            window.removeEventListener('keyup', fastCheck);\n            window.removeEventListener('mousedown', fastCheck);\n            window.removeEventListener('keydown', fastCheck);\n            window.removeEventListener('change', fastCheck);\n        }\n    };\n    mirror.observers.set(callback, new ObserverInfo(callback, observer));\n    return observer;\n}\n/**\n * Generate an array of patches from an observer\n */\nexport function generate(observer, invertible) {\n    if (invertible === void 0) { invertible = false; }\n    var mirror = beforeDict.get(observer.object);\n    _generate(mirror.value, observer.object, observer.patches, \"\", invertible);\n    if (observer.patches.length) {\n        applyPatch(mirror.value, observer.patches);\n    }\n    var temp = observer.patches;\n    if (temp.length > 0) {\n        observer.patches = [];\n        if (observer.callback) {\n            observer.callback(temp);\n        }\n    }\n    return temp;\n}\n// Dirty check if obj is different from mirror, generate patches and update mirror\nfunction _generate(mirror, obj, patches, path, invertible) {\n    if (obj === mirror) {\n        return;\n    }\n    if (typeof obj.toJSON === \"function\") {\n        obj = obj.toJSON();\n    }\n    var newKeys = _objectKeys(obj);\n    var oldKeys = _objectKeys(mirror);\n    var changed = false;\n    var deleted = false;\n    //if ever \"move\" operation is implemented here, make sure this test runs OK: \"should not generate the same patch twice (move)\"\n    for (var t = oldKeys.length - 1; t >= 0; t--) {\n        var key = oldKeys[t];\n        var oldVal = mirror[key];\n        if (hasOwnProperty(obj, key) && !(obj[key] === undefined && oldVal !== undefined && Array.isArray(obj) === false)) {\n            var newVal = obj[key];\n            if (typeof oldVal == \"object\" && oldVal != null && typeof newVal == \"object\" && newVal != null && Array.isArray(oldVal) === Array.isArray(newVal)) {\n                _generate(oldVal, newVal, patches, path + \"/\" + escapePathComponent(key), invertible);\n            }\n            else {\n                if (oldVal !== newVal) {\n                    changed = true;\n                    if (invertible) {\n                        patches.push({ op: \"test\", path: path + \"/\" + escapePathComponent(key), value: _deepClone(oldVal) });\n                    }\n                    patches.push({ op: \"replace\", path: path + \"/\" + escapePathComponent(key), value: _deepClone(newVal) });\n                }\n            }\n        }\n        else if (Array.isArray(mirror) === Array.isArray(obj)) {\n            if (invertible) {\n                patches.push({ op: \"test\", path: path + \"/\" + escapePathComponent(key), value: _deepClone(oldVal) });\n            }\n            patches.push({ op: \"remove\", path: path + \"/\" + escapePathComponent(key) });\n            deleted = true; // property has been deleted\n        }\n        else {\n            if (invertible) {\n                patches.push({ op: \"test\", path: path, value: mirror });\n            }\n            patches.push({ op: \"replace\", path: path, value: obj });\n            changed = true;\n        }\n    }\n    if (!deleted && newKeys.length == oldKeys.length) {\n        return;\n    }\n    for (var t = 0; t < newKeys.length; t++) {\n        var key = newKeys[t];\n        if (!hasOwnProperty(mirror, key) && obj[key] !== undefined) {\n            patches.push({ op: \"add\", path: path + \"/\" + escapePathComponent(key), value: _deepClone(obj[key]) });\n        }\n    }\n}\n/**\n * Create an array of patches from the differences in two objects\n */\nexport function compare(tree1, tree2, invertible) {\n    if (invertible === void 0) { invertible = false; }\n    var patches = [];\n    _generate(tree1, tree2, patches, '', invertible);\n    return patches;\n}\n"],"names":["beforeDict","Mirror","obj","ObserverInfo","callback","observer","getMirror","getObserverFromMirror","mirror","removeObserverFromMirror","unobserve","root","observe","patches","observerInfo","_deepClone","dirtyCheck","generate","fastCheck","invertible","_generate","applyPatch","temp","path","newKeys","_objectKeys","oldKeys","deleted","t","key","oldVal","hasOwnProperty","newVal","escapePathComponent","compare","tree1","tree2"],"mappings":";;AAAA;AAAA;AAAA;AAAA;AAAA;AAOA,IAAIA,IAAa,oBAAI,QAAS,GAC1BC;AAAA;AAAA,EAAwB,2BAAY;AACpC,aAASA,EAAOC,GAAK;AACjB,WAAK,YAAY,oBAAI,IAAK,GAC1B,KAAK,MAAMA;AAAA,IACnB;AACI,WAAOD;AAAA,EACX;GACIE;AAAA;AAAA,EAA8B,2BAAY;AAC1C,aAASA,EAAaC,GAAUC,GAAU;AACtC,WAAK,WAAWD,GAChB,KAAK,WAAWC;AAAA,IACxB;AACI,WAAOF;AAAA,EACX;;AACA,SAASG,EAAUJ,GAAK;AACpB,SAAOF,EAAW,IAAIE,CAAG;AAC7B;AACA,SAASK,EAAsBC,GAAQJ,GAAU;AAC7C,SAAOI,EAAO,UAAU,IAAIJ,CAAQ;AACxC;AACA,SAASK,EAAyBD,GAAQH,GAAU;AAChD,EAAAG,EAAO,UAAU,OAAOH,EAAS,QAAQ;AAC7C;AAIO,SAASK,EAAUC,GAAMN,GAAU;AACtC,EAAAA,EAAS,UAAW;AACxB;AAIO,SAASO,EAAQV,GAAKE,GAAU;AACnC,MAAIS,IAAU,CAAE,GACZR,GACAG,IAASF,EAAUJ,CAAG;AAC1B,MAAI,CAACM;AACD,IAAAA,IAAS,IAAIP,EAAOC,CAAG,GACvBF,EAAW,IAAIE,GAAKM,CAAM;AAAA,OAEzB;AACD,QAAIM,IAAeP,EAAsBC,GAAQJ,CAAQ;AACzD,IAAAC,IAAWS,KAAgBA,EAAa;AAAA,EAChD;AACI,MAAIT;AACA,WAAOA;AAIX,MAFAA,IAAW,CAAE,GACbG,EAAO,QAAQO,EAAWb,CAAG,GACzBE,GAAU;AACV,IAAAC,EAAS,WAAWD,GACpBC,EAAS,OAAO;AAChB,QAAIW,IAAa,WAAY;AACzB,MAAAC,EAASZ,CAAQ;AAAA,IACpB,GACGa,IAAY,WAAY;AACxB,mBAAab,EAAS,IAAI,GAC1BA,EAAS,OAAO,WAAWW,CAAU;AAAA,IACxC;AACD,IAAI,OAAO,SAAW,QAClB,OAAO,iBAAiB,WAAWE,CAAS,GAC5C,OAAO,iBAAiB,SAASA,CAAS,GAC1C,OAAO,iBAAiB,aAAaA,CAAS,GAC9C,OAAO,iBAAiB,WAAWA,CAAS,GAC5C,OAAO,iBAAiB,UAAUA,CAAS;AAAA,EAEvD;AACI,SAAAb,EAAS,UAAUQ,GACnBR,EAAS,SAASH,GAClBG,EAAS,YAAY,WAAY;AAC7B,IAAAY,EAASZ,CAAQ,GACjB,aAAaA,EAAS,IAAI,GAC1BI,EAAyBD,GAAQH,CAAQ,GACrC,OAAO,SAAW,QAClB,OAAO,oBAAoB,WAAWa,CAAS,GAC/C,OAAO,oBAAoB,SAASA,CAAS,GAC7C,OAAO,oBAAoB,aAAaA,CAAS,GACjD,OAAO,oBAAoB,WAAWA,CAAS,GAC/C,OAAO,oBAAoB,UAAUA,CAAS;AAAA,EAErD,GACDV,EAAO,UAAU,IAAIJ,GAAU,IAAID,EAAaC,GAAUC,CAAQ,CAAC,GAC5DA;AACX;AAIO,SAASY,EAASZ,GAAUc,GAAY;AAC3C,EAAIA,MAAe,WAAUA,IAAa;AAC1C,MAAIX,IAASR,EAAW,IAAIK,EAAS,MAAM;AAC3C,EAAAe,EAAUZ,EAAO,OAAOH,EAAS,QAAQA,EAAS,SAAS,IAAIc,CAAU,GACrEd,EAAS,QAAQ,UACjBgB,EAAWb,EAAO,OAAOH,EAAS,OAAO;AAE7C,MAAIiB,IAAOjB,EAAS;AACpB,SAAIiB,EAAK,SAAS,MACdjB,EAAS,UAAU,CAAE,GACjBA,EAAS,YACTA,EAAS,SAASiB,CAAI,IAGvBA;AACX;AAEA,SAASF,EAAUZ,GAAQN,GAAKW,GAASU,GAAMJ,GAAY;AACvD,MAAIjB,MAAQM,GAGZ;AAAA,IAAI,OAAON,EAAI,UAAW,eACtBA,IAAMA,EAAI,OAAQ;AAOtB,aALIsB,IAAUC,EAAYvB,CAAG,GACzBwB,IAAUD,EAAYjB,CAAM,GAE5BmB,IAAU,IAELC,IAAIF,EAAQ,SAAS,GAAGE,KAAK,GAAGA,KAAK;AAC1C,UAAIC,IAAMH,EAAQE,CAAC,GACfE,IAAStB,EAAOqB,CAAG;AACvB,UAAIE,EAAe7B,GAAK2B,CAAG,KAAK,EAAE3B,EAAI2B,CAAG,MAAM,UAAaC,MAAW,UAAa,MAAM,QAAQ5B,CAAG,MAAM,KAAQ;AAC/G,YAAI8B,IAAS9B,EAAI2B,CAAG;AACpB,QAAI,OAAOC,KAAU,YAAYA,KAAU,QAAQ,OAAOE,KAAU,YAAYA,KAAU,QAAQ,MAAM,QAAQF,CAAM,MAAM,MAAM,QAAQE,CAAM,IAC5IZ,EAAUU,GAAQE,GAAQnB,GAASU,IAAO,MAAMU,EAAoBJ,CAAG,GAAGV,CAAU,IAGhFW,MAAWE,MAEPb,KACAN,EAAQ,KAAK,EAAE,IAAI,QAAQ,MAAMU,IAAO,MAAMU,EAAoBJ,CAAG,GAAG,OAAOd,EAAWe,CAAM,EAAC,CAAE,GAEvGjB,EAAQ,KAAK,EAAE,IAAI,WAAW,MAAMU,IAAO,MAAMU,EAAoBJ,CAAG,GAAG,OAAOd,EAAWiB,CAAM,EAAC,CAAE;AAAA,MAG1H,MACa,CAAI,MAAM,QAAQxB,CAAM,MAAM,MAAM,QAAQN,CAAG,KAC5CiB,KACAN,EAAQ,KAAK,EAAE,IAAI,QAAQ,MAAMU,IAAO,MAAMU,EAAoBJ,CAAG,GAAG,OAAOd,EAAWe,CAAM,EAAC,CAAE,GAEvGjB,EAAQ,KAAK,EAAE,IAAI,UAAU,MAAMU,IAAO,MAAMU,EAAoBJ,CAAG,GAAG,GAC1EF,IAAU,OAGNR,KACAN,EAAQ,KAAK,EAAE,IAAI,QAAQ,MAAMU,GAAM,OAAOf,GAAQ,GAE1DK,EAAQ,KAAK,EAAE,IAAI,WAAW,MAAMU,GAAM,OAAOrB,GAAK;AAAA,IAGlE;AACI,QAAI,GAACyB,KAAWH,EAAQ,UAAUE,EAAQ;AAG1C,eAASE,IAAI,GAAGA,IAAIJ,EAAQ,QAAQI,KAAK;AACrC,YAAIC,IAAML,EAAQI,CAAC;AACnB,QAAI,CAACG,EAAevB,GAAQqB,CAAG,KAAK3B,EAAI2B,CAAG,MAAM,UAC7ChB,EAAQ,KAAK,EAAE,IAAI,OAAO,MAAMU,IAAO,MAAMU,EAAoBJ,CAAG,GAAG,OAAOd,EAAWb,EAAI2B,CAAG,CAAC,GAAG;AAAA,MAEhH;AAAA;AACA;AAIO,SAASK,EAAQC,GAAOC,GAAOjB,GAAY;AAC9C,EAAIA,MAAe,WAAUA,IAAa;AAC1C,MAAIN,IAAU,CAAE;AAChB,SAAAO,EAAUe,GAAOC,GAAOvB,GAAS,IAAIM,CAAU,GACxCN;AACX;","x_google_ignoreList":[0]}
+{"version":3,"file":"duplex.js","sources":["../../../../../../../../../node_modules/.pnpm/fast-json-patch@3.1.1/node_modules/fast-json-patch/module/duplex.mjs"],"sourcesContent":["/*!\n * https://github.com/Starcounter-Jack/JSON-Patch\n * (c) 2017-2021 Joachim Wester\n * MIT license\n */\nimport { _deepClone, _objectKeys, escapePathComponent, hasOwnProperty } from './helpers.mjs';\nimport { applyPatch } from './core.mjs';\nvar beforeDict = new WeakMap();\nvar Mirror = /** @class */ (function () {\n    function Mirror(obj) {\n        this.observers = new Map();\n        this.obj = obj;\n    }\n    return Mirror;\n}());\nvar ObserverInfo = /** @class */ (function () {\n    function ObserverInfo(callback, observer) {\n        this.callback = callback;\n        this.observer = observer;\n    }\n    return ObserverInfo;\n}());\nfunction getMirror(obj) {\n    return beforeDict.get(obj);\n}\nfunction getObserverFromMirror(mirror, callback) {\n    return mirror.observers.get(callback);\n}\nfunction removeObserverFromMirror(mirror, observer) {\n    mirror.observers.delete(observer.callback);\n}\n/**\n * Detach an observer from an object\n */\nexport function unobserve(root, observer) {\n    observer.unobserve();\n}\n/**\n * Observes changes made to an object, which can then be retrieved using generate\n */\nexport function observe(obj, callback) {\n    var patches = [];\n    var observer;\n    var mirror = getMirror(obj);\n    if (!mirror) {\n        mirror = new Mirror(obj);\n        beforeDict.set(obj, mirror);\n    }\n    else {\n        var observerInfo = getObserverFromMirror(mirror, callback);\n        observer = observerInfo && observerInfo.observer;\n    }\n    if (observer) {\n        return observer;\n    }\n    observer = {};\n    mirror.value = _deepClone(obj);\n    if (callback) {\n        observer.callback = callback;\n        observer.next = null;\n        var dirtyCheck = function () {\n            generate(observer);\n        };\n        var fastCheck = function () {\n            clearTimeout(observer.next);\n            observer.next = setTimeout(dirtyCheck);\n        };\n        if (typeof window !== 'undefined') { //not Node\n            window.addEventListener('mouseup', fastCheck);\n            window.addEventListener('keyup', fastCheck);\n            window.addEventListener('mousedown', fastCheck);\n            window.addEventListener('keydown', fastCheck);\n            window.addEventListener('change', fastCheck);\n        }\n    }\n    observer.patches = patches;\n    observer.object = obj;\n    observer.unobserve = function () {\n        generate(observer);\n        clearTimeout(observer.next);\n        removeObserverFromMirror(mirror, observer);\n        if (typeof window !== 'undefined') {\n            window.removeEventListener('mouseup', fastCheck);\n            window.removeEventListener('keyup', fastCheck);\n            window.removeEventListener('mousedown', fastCheck);\n            window.removeEventListener('keydown', fastCheck);\n            window.removeEventListener('change', fastCheck);\n        }\n    };\n    mirror.observers.set(callback, new ObserverInfo(callback, observer));\n    return observer;\n}\n/**\n * Generate an array of patches from an observer\n */\nexport function generate(observer, invertible) {\n    if (invertible === void 0) { invertible = false; }\n    var mirror = beforeDict.get(observer.object);\n    _generate(mirror.value, observer.object, observer.patches, \"\", invertible);\n    if (observer.patches.length) {\n        applyPatch(mirror.value, observer.patches);\n    }\n    var temp = observer.patches;\n    if (temp.length > 0) {\n        observer.patches = [];\n        if (observer.callback) {\n            observer.callback(temp);\n        }\n    }\n    return temp;\n}\n// Dirty check if obj is different from mirror, generate patches and update mirror\nfunction _generate(mirror, obj, patches, path, invertible) {\n    if (obj === mirror) {\n        return;\n    }\n    if (typeof obj.toJSON === \"function\") {\n        obj = obj.toJSON();\n    }\n    var newKeys = _objectKeys(obj);\n    var oldKeys = _objectKeys(mirror);\n    var changed = false;\n    var deleted = false;\n    //if ever \"move\" operation is implemented here, make sure this test runs OK: \"should not generate the same patch twice (move)\"\n    for (var t = oldKeys.length - 1; t >= 0; t--) {\n        var key = oldKeys[t];\n        var oldVal = mirror[key];\n        if (hasOwnProperty(obj, key) && !(obj[key] === undefined && oldVal !== undefined && Array.isArray(obj) === false)) {\n            var newVal = obj[key];\n            if (typeof oldVal == \"object\" && oldVal != null && typeof newVal == \"object\" && newVal != null && Array.isArray(oldVal) === Array.isArray(newVal)) {\n                _generate(oldVal, newVal, patches, path + \"/\" + escapePathComponent(key), invertible);\n            }\n            else {\n                if (oldVal !== newVal) {\n                    changed = true;\n                    if (invertible) {\n                        patches.push({ op: \"test\", path: path + \"/\" + escapePathComponent(key), value: _deepClone(oldVal) });\n                    }\n                    patches.push({ op: \"replace\", path: path + \"/\" + escapePathComponent(key), value: _deepClone(newVal) });\n                }\n            }\n        }\n        else if (Array.isArray(mirror) === Array.isArray(obj)) {\n            if (invertible) {\n                patches.push({ op: \"test\", path: path + \"/\" + escapePathComponent(key), value: _deepClone(oldVal) });\n            }\n            patches.push({ op: \"remove\", path: path + \"/\" + escapePathComponent(key) });\n            deleted = true; // property has been deleted\n        }\n        else {\n            if (invertible) {\n                patches.push({ op: \"test\", path: path, value: mirror });\n            }\n            patches.push({ op: \"replace\", path: path, value: obj });\n            changed = true;\n        }\n    }\n    if (!deleted && newKeys.length == oldKeys.length) {\n        return;\n    }\n    for (var t = 0; t < newKeys.length; t++) {\n        var key = newKeys[t];\n        if (!hasOwnProperty(mirror, key) && obj[key] !== undefined) {\n            patches.push({ op: \"add\", path: path + \"/\" + escapePathComponent(key), value: _deepClone(obj[key]) });\n        }\n    }\n}\n/**\n * Create an array of patches from the differences in two objects\n */\nexport function compare(tree1, tree2, invertible) {\n    if (invertible === void 0) { invertible = false; }\n    var patches = [];\n    _generate(tree1, tree2, patches, '', invertible);\n    return patches;\n}\n"],"names":["beforeDict","Mirror","obj","ObserverInfo","callback","observer","getMirror","getObserverFromMirror","mirror","removeObserverFromMirror","unobserve","root","observe","patches","observerInfo","_deepClone","dirtyCheck","generate","fastCheck","invertible","_generate","applyPatch","temp","path","newKeys","_objectKeys","oldKeys","deleted","t","key","oldVal","hasOwnProperty","newVal","escapePathComponent","compare","tree1","tree2"],"mappings":";;AAAA;AAAA;AAAA;AAAA;AAAA;AAOA,IAAIA,IAAa,oBAAI,QAAO,GACxBC;AAAA;AAAA,EAAwB,2BAAY;AACpC,aAASA,EAAOC,GAAK;AACjB,WAAK,YAAY,oBAAI,IAAG,GACxB,KAAK,MAAMA;AAAA,IACf;AACA,WAAOD;AAAA,EACX;GACIE;AAAA;AAAA,EAA8B,2BAAY;AAC1C,aAASA,EAAaC,GAAUC,GAAU;AACtC,WAAK,WAAWD,GAChB,KAAK,WAAWC;AAAA,IACpB;AACA,WAAOF;AAAA,EACX;;AACA,SAASG,EAAUJ,GAAK;AACpB,SAAOF,EAAW,IAAIE,CAAG;AAC7B;AACA,SAASK,EAAsBC,GAAQJ,GAAU;AAC7C,SAAOI,EAAO,UAAU,IAAIJ,CAAQ;AACxC;AACA,SAASK,EAAyBD,GAAQH,GAAU;AAChD,EAAAG,EAAO,UAAU,OAAOH,EAAS,QAAQ;AAC7C;AAIO,SAASK,EAAUC,GAAMN,GAAU;AACtC,EAAAA,EAAS,UAAS;AACtB;AAIO,SAASO,EAAQV,GAAKE,GAAU;AACnC,MAAIS,IAAU,CAAA,GACVR,GACAG,IAASF,EAAUJ,CAAG;AAC1B,MAAI,CAACM;AACD,IAAAA,IAAS,IAAIP,EAAOC,CAAG,GACvBF,EAAW,IAAIE,GAAKM,CAAM;AAAA,OAEzB;AACD,QAAIM,IAAeP,EAAsBC,GAAQJ,CAAQ;AACzD,IAAAC,IAAWS,KAAgBA,EAAa;AAAA,EAC5C;AACA,MAAIT;AACA,WAAOA;AAIX,MAFAA,IAAW,CAAA,GACXG,EAAO,QAAQO,EAAWb,CAAG,GACzBE,GAAU;AACV,IAAAC,EAAS,WAAWD,GACpBC,EAAS,OAAO;AAChB,QAAIW,IAAa,WAAY;AACzB,MAAAC,EAASZ,CAAQ;AAAA,IACrB,GACIa,IAAY,WAAY;AACxB,mBAAab,EAAS,IAAI,GAC1BA,EAAS,OAAO,WAAWW,CAAU;AAAA,IACzC;AACA,IAAI,OAAO,SAAW,QAClB,OAAO,iBAAiB,WAAWE,CAAS,GAC5C,OAAO,iBAAiB,SAASA,CAAS,GAC1C,OAAO,iBAAiB,aAAaA,CAAS,GAC9C,OAAO,iBAAiB,WAAWA,CAAS,GAC5C,OAAO,iBAAiB,UAAUA,CAAS;AAAA,EAEnD;AACA,SAAAb,EAAS,UAAUQ,GACnBR,EAAS,SAASH,GAClBG,EAAS,YAAY,WAAY;AAC7B,IAAAY,EAASZ,CAAQ,GACjB,aAAaA,EAAS,IAAI,GAC1BI,EAAyBD,GAAQH,CAAQ,GACrC,OAAO,SAAW,QAClB,OAAO,oBAAoB,WAAWa,CAAS,GAC/C,OAAO,oBAAoB,SAASA,CAAS,GAC7C,OAAO,oBAAoB,aAAaA,CAAS,GACjD,OAAO,oBAAoB,WAAWA,CAAS,GAC/C,OAAO,oBAAoB,UAAUA,CAAS;AAAA,EAEtD,GACAV,EAAO,UAAU,IAAIJ,GAAU,IAAID,EAAaC,GAAUC,CAAQ,CAAC,GAC5DA;AACX;AAIO,SAASY,EAASZ,GAAUc,GAAY;AAC3C,EAAIA,MAAe,WAAUA,IAAa;AAC1C,MAAIX,IAASR,EAAW,IAAIK,EAAS,MAAM;AAC3C,EAAAe,EAAUZ,EAAO,OAAOH,EAAS,QAAQA,EAAS,SAAS,IAAIc,CAAU,GACrEd,EAAS,QAAQ,UACjBgB,EAAWb,EAAO,OAAOH,EAAS,OAAO;AAE7C,MAAIiB,IAAOjB,EAAS;AACpB,SAAIiB,EAAK,SAAS,MACdjB,EAAS,UAAU,CAAA,GACfA,EAAS,YACTA,EAAS,SAASiB,CAAI,IAGvBA;AACX;AAEA,SAASF,EAAUZ,GAAQN,GAAKW,GAASU,GAAMJ,GAAY;AACvD,MAAIjB,MAAQM,GAGZ;AAAA,IAAI,OAAON,EAAI,UAAW,eACtBA,IAAMA,EAAI,OAAM;AAOpB,aALIsB,IAAUC,EAAYvB,CAAG,GACzBwB,IAAUD,EAAYjB,CAAM,GAE5BmB,IAAU,IAELC,IAAIF,EAAQ,SAAS,GAAGE,KAAK,GAAGA,KAAK;AAC1C,UAAIC,IAAMH,EAAQE,CAAC,GACfE,IAAStB,EAAOqB,CAAG;AACvB,UAAIE,EAAe7B,GAAK2B,CAAG,KAAK,EAAE3B,EAAI2B,CAAG,MAAM,UAAaC,MAAW,UAAa,MAAM,QAAQ5B,CAAG,MAAM,KAAQ;AAC/G,YAAI8B,IAAS9B,EAAI2B,CAAG;AACpB,QAAI,OAAOC,KAAU,YAAYA,KAAU,QAAQ,OAAOE,KAAU,YAAYA,KAAU,QAAQ,MAAM,QAAQF,CAAM,MAAM,MAAM,QAAQE,CAAM,IAC5IZ,EAAUU,GAAQE,GAAQnB,GAASU,IAAO,MAAMU,EAAoBJ,CAAG,GAAGV,CAAU,IAGhFW,MAAWE,MAEPb,KACAN,EAAQ,KAAK,EAAE,IAAI,QAAQ,MAAMU,IAAO,MAAMU,EAAoBJ,CAAG,GAAG,OAAOd,EAAWe,CAAM,EAAC,CAAE,GAEvGjB,EAAQ,KAAK,EAAE,IAAI,WAAW,MAAMU,IAAO,MAAMU,EAAoBJ,CAAG,GAAG,OAAOd,EAAWiB,CAAM,EAAC,CAAE;AAAA,MAGlH,MACK,CAAI,MAAM,QAAQxB,CAAM,MAAM,MAAM,QAAQN,CAAG,KAC5CiB,KACAN,EAAQ,KAAK,EAAE,IAAI,QAAQ,MAAMU,IAAO,MAAMU,EAAoBJ,CAAG,GAAG,OAAOd,EAAWe,CAAM,EAAC,CAAE,GAEvGjB,EAAQ,KAAK,EAAE,IAAI,UAAU,MAAMU,IAAO,MAAMU,EAAoBJ,CAAG,GAAG,GAC1EF,IAAU,OAGNR,KACAN,EAAQ,KAAK,EAAE,IAAI,QAAQ,MAAMU,GAAM,OAAOf,GAAQ,GAE1DK,EAAQ,KAAK,EAAE,IAAI,WAAW,MAAMU,GAAM,OAAOrB,GAAK;AAAA,IAG9D;AACA,QAAI,GAACyB,KAAWH,EAAQ,UAAUE,EAAQ;AAG1C,eAASE,IAAI,GAAGA,IAAIJ,EAAQ,QAAQI,KAAK;AACrC,YAAIC,IAAML,EAAQI,CAAC;AACnB,QAAI,CAACG,EAAevB,GAAQqB,CAAG,KAAK3B,EAAI2B,CAAG,MAAM,UAC7ChB,EAAQ,KAAK,EAAE,IAAI,OAAO,MAAMU,IAAO,MAAMU,EAAoBJ,CAAG,GAAG,OAAOd,EAAWb,EAAI2B,CAAG,CAAC,GAAG;AAAA,MAE5G;AAAA;AACJ;AAIO,SAASK,EAAQC,GAAOC,GAAOjB,GAAY;AAC9C,EAAIA,MAAe,WAAUA,IAAa;AAC1C,MAAIN,IAAU,CAAA;AACd,SAAAO,EAAUe,GAAOC,GAAOvB,GAAS,IAAIM,CAAU,GACxCN;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/fast-json-patch@3.1.1/node_modules/fast-json-patch/module/helpers.js.map

@@ -1 +1 @@
-{"version":3,"file":"helpers.js","sources":["../../../../../../../../../node_modules/.pnpm/fast-json-patch@3.1.1/node_modules/fast-json-patch/module/helpers.mjs"],"sourcesContent":["/*!\n * https://github.com/Starcounter-Jack/JSON-Patch\n * (c) 2017-2022 Joachim Wester\n * MIT licensed\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nvar _hasOwnProperty = Object.prototype.hasOwnProperty;\nexport function hasOwnProperty(obj, key) {\n    return _hasOwnProperty.call(obj, key);\n}\nexport function _objectKeys(obj) {\n    if (Array.isArray(obj)) {\n        var keys_1 = new Array(obj.length);\n        for (var k = 0; k < keys_1.length; k++) {\n            keys_1[k] = \"\" + k;\n        }\n        return keys_1;\n    }\n    if (Object.keys) {\n        return Object.keys(obj);\n    }\n    var keys = [];\n    for (var i in obj) {\n        if (hasOwnProperty(obj, i)) {\n            keys.push(i);\n        }\n    }\n    return keys;\n}\n;\n/**\n* Deeply clone the object.\n* https://jsperf.com/deep-copy-vs-json-stringify-json-parse/25 (recursiveDeepCopy)\n* @param  {any} obj value to clone\n* @return {any} cloned obj\n*/\nexport function _deepClone(obj) {\n    switch (typeof obj) {\n        case \"object\":\n            return JSON.parse(JSON.stringify(obj)); //Faster than ES5 clone - http://jsperf.com/deep-cloning-of-objects/5\n        case \"undefined\":\n            return null; //this is how JSON.stringify behaves for array items\n        default:\n            return obj; //no need to clone primitives\n    }\n}\n//3x faster than cached /^\\d+$/.test(str)\nexport function isInteger(str) {\n    var i = 0;\n    var len = str.length;\n    var charCode;\n    while (i < len) {\n        charCode = str.charCodeAt(i);\n        if (charCode >= 48 && charCode <= 57) {\n            i++;\n            continue;\n        }\n        return false;\n    }\n    return true;\n}\n/**\n* Escapes a json pointer path\n* @param path The raw pointer\n* @return the Escaped path\n*/\nexport function escapePathComponent(path) {\n    if (path.indexOf('/') === -1 && path.indexOf('~') === -1)\n        return path;\n    return path.replace(/~/g, '~0').replace(/\\//g, '~1');\n}\n/**\n * Unescapes a json pointer path\n * @param path The escaped pointer\n * @return The unescaped path\n */\nexport function unescapePathComponent(path) {\n    return path.replace(/~1/g, '/').replace(/~0/g, '~');\n}\nexport function _getPathRecursive(root, obj) {\n    var found;\n    for (var key in root) {\n        if (hasOwnProperty(root, key)) {\n            if (root[key] === obj) {\n                return escapePathComponent(key) + '/';\n            }\n            else if (typeof root[key] === 'object') {\n                found = _getPathRecursive(root[key], obj);\n                if (found != '') {\n                    return escapePathComponent(key) + '/' + found;\n                }\n            }\n        }\n    }\n    return '';\n}\nexport function getPath(root, obj) {\n    if (root === obj) {\n        return '/';\n    }\n    var path = _getPathRecursive(root, obj);\n    if (path === '') {\n        throw new Error(\"Object not found in root\");\n    }\n    return \"/\" + path;\n}\n/**\n* Recursively checks whether an object has any undefined values inside.\n*/\nexport function hasUndefined(obj) {\n    if (obj === undefined) {\n        return true;\n    }\n    if (obj) {\n        if (Array.isArray(obj)) {\n            for (var i_1 = 0, len = obj.length; i_1 < len; i_1++) {\n                if (hasUndefined(obj[i_1])) {\n                    return true;\n                }\n            }\n        }\n        else if (typeof obj === \"object\") {\n            var objKeys = _objectKeys(obj);\n            var objKeysLength = objKeys.length;\n            for (var i = 0; i < objKeysLength; i++) {\n                if (hasUndefined(obj[objKeys[i]])) {\n                    return true;\n                }\n            }\n        }\n    }\n    return false;\n}\nfunction patchErrorMessageFormatter(message, args) {\n    var messageParts = [message];\n    for (var key in args) {\n        var value = typeof args[key] === 'object' ? JSON.stringify(args[key], null, 2) : args[key]; // pretty print\n        if (typeof value !== 'undefined') {\n            messageParts.push(key + \": \" + value);\n        }\n    }\n    return messageParts.join('\\n');\n}\nvar PatchError = /** @class */ (function (_super) {\n    __extends(PatchError, _super);\n    function PatchError(message, name, index, operation, tree) {\n        var _newTarget = this.constructor;\n        var _this = _super.call(this, patchErrorMessageFormatter(message, { name: name, index: index, operation: operation, tree: tree })) || this;\n        _this.name = name;\n        _this.index = index;\n        _this.operation = operation;\n        _this.tree = tree;\n        Object.setPrototypeOf(_this, _newTarget.prototype); // restore prototype chain, see https://stackoverflow.com/a/48342359\n        _this.message = patchErrorMessageFormatter(message, { name: name, index: index, operation: operation, tree: tree });\n        return _this;\n    }\n    return PatchError;\n}(Error));\nexport { PatchError };\n"],"names":["__extends","extendStatics","d","b","p","__","_hasOwnProperty","hasOwnProperty","obj","key","_objectKeys","keys_1","k","keys","i","_deepClone","isInteger","str","len","charCode","escapePathComponent","path","unescapePathComponent","hasUndefined","i_1","objKeys","objKeysLength","patchErrorMessageFormatter","message","args","messageParts","value","PatchError","_super","name","index","operation","tree","_newTarget","_this"],"mappings":"AAAA;AAAA;AAAA;AAAA;AAAA;AAKA,IAAIA,IAAyC,2BAAY;AACrD,MAAIC,IAAgB,SAAUC,GAAGC,GAAG;AAChC,WAAAF,IAAgB,OAAO,kBAClB,EAAE,WAAW,CAAA,eAAgB,SAAS,SAAUC,GAAGC,GAAG;AAAE,MAAAD,EAAE,YAAYC;AAAA,IAAE,KACzE,SAAUD,GAAGC,GAAG;AAAE,eAASC,KAAKD,EAAG,CAAIA,EAAE,eAAeC,CAAC,MAAGF,EAAEE,CAAC,IAAID,EAAEC,CAAC;AAAA,IAAI,GACvEH,EAAcC,GAAGC,CAAC;AAAA,EAC5B;AACD,SAAO,SAAUD,GAAGC,GAAG;AACnB,IAAAF,EAAcC,GAAGC,CAAC;AAClB,aAASE,IAAK;AAAE,WAAK,cAAcH;AAAA,IAAE;AACrC,IAAAA,EAAE,YAAYC,MAAM,OAAO,OAAO,OAAOA,CAAC,KAAKE,EAAG,YAAYF,EAAE,WAAW,IAAIE,EAAE;AAAA,EACpF;AACL,EAAI,GACAC,IAAkB,OAAO,UAAU;AAChC,SAASC,EAAeC,GAAKC,GAAK;AACrC,SAAOH,EAAgB,KAAKE,GAAKC,CAAG;AACxC;AACO,SAASC,EAAYF,GAAK;AAC7B,MAAI,MAAM,QAAQA,CAAG,GAAG;AAEpB,aADIG,IAAS,IAAI,MAAMH,EAAI,MAAM,GACxBI,IAAI,GAAGA,IAAID,EAAO,QAAQC;AAC/B,MAAAD,EAAOC,CAAC,IAAI,KAAKA;AAErB,WAAOD;AAAA,EACf;AACI,MAAI,OAAO;AACP,WAAO,OAAO,KAAKH,CAAG;AAE1B,MAAIK,IAAO,CAAE;AACb,WAASC,KAAKN;AACV,IAAID,EAAeC,GAAKM,CAAC,KACrBD,EAAK,KAAKC,CAAC;AAGnB,SAAOD;AACX;AAQO,SAASE,EAAWP,GAAK;AAC5B,UAAQ,OAAOA,GAAG;AAAA,IACd,KAAK;AACD,aAAO,KAAK,MAAM,KAAK,UAAUA,CAAG,CAAC;AAAA;AAAA,IACzC,KAAK;AACD,aAAO;AAAA;AAAA,IACX;AACI,aAAOA;AAAA,EACnB;AACA;AAEO,SAASQ,EAAUC,GAAK;AAI3B,WAHIH,IAAI,GACJI,IAAMD,EAAI,QACVE,GACGL,IAAII,KAAK;AAEZ,QADAC,IAAWF,EAAI,WAAWH,CAAC,GACvBK,KAAY,MAAMA,KAAY,IAAI;AAClC,MAAAL;AACA;AAAA,IACZ;AACQ,WAAO;AAAA,EACf;AACI,SAAO;AACX;AAMO,SAASM,EAAoBC,GAAM;AACtC,SAAIA,EAAK,QAAQ,GAAG,MAAM,MAAMA,EAAK,QAAQ,GAAG,MAAM,KAC3CA,IACJA,EAAK,QAAQ,MAAM,IAAI,EAAE,QAAQ,OAAO,IAAI;AACvD;AAMO,SAASC,EAAsBD,GAAM;AACxC,SAAOA,EAAK,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG;AACtD;AA+BO,SAASE,EAAaf,GAAK;AAC9B,MAAIA,MAAQ;AACR,WAAO;AAEX,MAAIA;AACA,QAAI,MAAM,QAAQA,CAAG;AACjB,eAASgB,IAAM,GAAGN,IAAMV,EAAI,QAAQgB,IAAMN,GAAKM;AAC3C,YAAID,EAAaf,EAAIgB,CAAG,CAAC;AACrB,iBAAO;AAAA,eAIV,OAAOhB,KAAQ;AAGpB,eAFIiB,IAAUf,EAAYF,CAAG,GACzBkB,IAAgBD,EAAQ,QACnBX,IAAI,GAAGA,IAAIY,GAAeZ;AAC/B,YAAIS,EAAaf,EAAIiB,EAAQX,CAAC,CAAC,CAAC;AAC5B,iBAAO;AAAA;AAAA;AAKvB,SAAO;AACX;AACA,SAASa,EAA2BC,GAASC,GAAM;AAC/C,MAAIC,IAAe,CAACF,CAAO;AAC3B,WAASnB,KAAOoB,GAAM;AAClB,QAAIE,IAAQ,OAAOF,EAAKpB,CAAG,KAAM,WAAW,KAAK,UAAUoB,EAAKpB,CAAG,GAAG,MAAM,CAAC,IAAIoB,EAAKpB,CAAG;AACzF,IAAI,OAAOsB,IAAU,OACjBD,EAAa,KAAKrB,IAAM,OAAOsB,CAAK;AAAA,EAEhD;AACI,SAAOD,EAAa,KAAK;AAAA,CAAI;AACjC;AACG,IAACE;AAAA;AAAA,EAA4B,SAAUC,GAAQ;AAC9C,IAAAjC,EAAUgC,GAAYC,CAAM;AAC5B,aAASD,EAAWJ,GAASM,GAAMC,GAAOC,GAAWC,GAAM;AACvD,UAAIC,IAAa,KAAK,aAClBC,IAAQN,EAAO,KAAK,MAAMN,EAA2BC,GAAS,EAAE,MAAMM,GAAM,OAAOC,GAAO,WAAWC,GAAW,MAAMC,EAAI,CAAE,CAAC,KAAK;AACtI,aAAAE,EAAM,OAAOL,GACbK,EAAM,QAAQJ,GACdI,EAAM,YAAYH,GAClBG,EAAM,OAAOF,GACb,OAAO,eAAeE,GAAOD,EAAW,SAAS,GACjDC,EAAM,UAAUZ,EAA2BC,GAAS,EAAE,MAAMM,GAAM,OAAOC,GAAO,WAAWC,GAAW,MAAMC,EAAI,CAAE,GAC3GE;AAAA,IACf;AACI,WAAOP;AAAA,EACX,EAAE,KAAK;AAAA;","x_google_ignoreList":[0]}
+{"version":3,"file":"helpers.js","sources":["../../../../../../../../../node_modules/.pnpm/fast-json-patch@3.1.1/node_modules/fast-json-patch/module/helpers.mjs"],"sourcesContent":["/*!\n * https://github.com/Starcounter-Jack/JSON-Patch\n * (c) 2017-2022 Joachim Wester\n * MIT licensed\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nvar _hasOwnProperty = Object.prototype.hasOwnProperty;\nexport function hasOwnProperty(obj, key) {\n    return _hasOwnProperty.call(obj, key);\n}\nexport function _objectKeys(obj) {\n    if (Array.isArray(obj)) {\n        var keys_1 = new Array(obj.length);\n        for (var k = 0; k < keys_1.length; k++) {\n            keys_1[k] = \"\" + k;\n        }\n        return keys_1;\n    }\n    if (Object.keys) {\n        return Object.keys(obj);\n    }\n    var keys = [];\n    for (var i in obj) {\n        if (hasOwnProperty(obj, i)) {\n            keys.push(i);\n        }\n    }\n    return keys;\n}\n;\n/**\n* Deeply clone the object.\n* https://jsperf.com/deep-copy-vs-json-stringify-json-parse/25 (recursiveDeepCopy)\n* @param  {any} obj value to clone\n* @return {any} cloned obj\n*/\nexport function _deepClone(obj) {\n    switch (typeof obj) {\n        case \"object\":\n            return JSON.parse(JSON.stringify(obj)); //Faster than ES5 clone - http://jsperf.com/deep-cloning-of-objects/5\n        case \"undefined\":\n            return null; //this is how JSON.stringify behaves for array items\n        default:\n            return obj; //no need to clone primitives\n    }\n}\n//3x faster than cached /^\\d+$/.test(str)\nexport function isInteger(str) {\n    var i = 0;\n    var len = str.length;\n    var charCode;\n    while (i < len) {\n        charCode = str.charCodeAt(i);\n        if (charCode >= 48 && charCode <= 57) {\n            i++;\n            continue;\n        }\n        return false;\n    }\n    return true;\n}\n/**\n* Escapes a json pointer path\n* @param path The raw pointer\n* @return the Escaped path\n*/\nexport function escapePathComponent(path) {\n    if (path.indexOf('/') === -1 && path.indexOf('~') === -1)\n        return path;\n    return path.replace(/~/g, '~0').replace(/\\//g, '~1');\n}\n/**\n * Unescapes a json pointer path\n * @param path The escaped pointer\n * @return The unescaped path\n */\nexport function unescapePathComponent(path) {\n    return path.replace(/~1/g, '/').replace(/~0/g, '~');\n}\nexport function _getPathRecursive(root, obj) {\n    var found;\n    for (var key in root) {\n        if (hasOwnProperty(root, key)) {\n            if (root[key] === obj) {\n                return escapePathComponent(key) + '/';\n            }\n            else if (typeof root[key] === 'object') {\n                found = _getPathRecursive(root[key], obj);\n                if (found != '') {\n                    return escapePathComponent(key) + '/' + found;\n                }\n            }\n        }\n    }\n    return '';\n}\nexport function getPath(root, obj) {\n    if (root === obj) {\n        return '/';\n    }\n    var path = _getPathRecursive(root, obj);\n    if (path === '') {\n        throw new Error(\"Object not found in root\");\n    }\n    return \"/\" + path;\n}\n/**\n* Recursively checks whether an object has any undefined values inside.\n*/\nexport function hasUndefined(obj) {\n    if (obj === undefined) {\n        return true;\n    }\n    if (obj) {\n        if (Array.isArray(obj)) {\n            for (var i_1 = 0, len = obj.length; i_1 < len; i_1++) {\n                if (hasUndefined(obj[i_1])) {\n                    return true;\n                }\n            }\n        }\n        else if (typeof obj === \"object\") {\n            var objKeys = _objectKeys(obj);\n            var objKeysLength = objKeys.length;\n            for (var i = 0; i < objKeysLength; i++) {\n                if (hasUndefined(obj[objKeys[i]])) {\n                    return true;\n                }\n            }\n        }\n    }\n    return false;\n}\nfunction patchErrorMessageFormatter(message, args) {\n    var messageParts = [message];\n    for (var key in args) {\n        var value = typeof args[key] === 'object' ? JSON.stringify(args[key], null, 2) : args[key]; // pretty print\n        if (typeof value !== 'undefined') {\n            messageParts.push(key + \": \" + value);\n        }\n    }\n    return messageParts.join('\\n');\n}\nvar PatchError = /** @class */ (function (_super) {\n    __extends(PatchError, _super);\n    function PatchError(message, name, index, operation, tree) {\n        var _newTarget = this.constructor;\n        var _this = _super.call(this, patchErrorMessageFormatter(message, { name: name, index: index, operation: operation, tree: tree })) || this;\n        _this.name = name;\n        _this.index = index;\n        _this.operation = operation;\n        _this.tree = tree;\n        Object.setPrototypeOf(_this, _newTarget.prototype); // restore prototype chain, see https://stackoverflow.com/a/48342359\n        _this.message = patchErrorMessageFormatter(message, { name: name, index: index, operation: operation, tree: tree });\n        return _this;\n    }\n    return PatchError;\n}(Error));\nexport { PatchError };\n"],"names":["__extends","extendStatics","d","b","p","__","_hasOwnProperty","hasOwnProperty","obj","key","_objectKeys","keys_1","k","keys","i","_deepClone","isInteger","str","len","charCode","escapePathComponent","path","unescapePathComponent","hasUndefined","i_1","objKeys","objKeysLength","patchErrorMessageFormatter","message","args","messageParts","value","PatchError","_super","name","index","operation","tree","_newTarget","_this"],"mappings":"AAAA;AAAA;AAAA;AAAA;AAAA;AAKA,IAAIA,IAAyC,2BAAY;AACrD,MAAIC,IAAgB,SAAUC,GAAGC,GAAG;AAChC,WAAAF,IAAgB,OAAO,kBAClB,EAAE,WAAW,CAAA,eAAgB,SAAS,SAAUC,GAAGC,GAAG;AAAE,MAAAD,EAAE,YAAYC;AAAA,IAAG,KAC1E,SAAUD,GAAGC,GAAG;AAAE,eAASC,KAAKD,EAAG,CAAIA,EAAE,eAAeC,CAAC,MAAGF,EAAEE,CAAC,IAAID,EAAEC,CAAC;AAAA,IAAG,GACtEH,EAAcC,GAAGC,CAAC;AAAA,EAC7B;AACA,SAAO,SAAUD,GAAGC,GAAG;AACnB,IAAAF,EAAcC,GAAGC,CAAC;AAClB,aAASE,IAAK;AAAE,WAAK,cAAcH;AAAA,IAAG;AACtC,IAAAA,EAAE,YAAYC,MAAM,OAAO,OAAO,OAAOA,CAAC,KAAKE,EAAG,YAAYF,EAAE,WAAW,IAAIE,EAAE;AAAA,EACrF;AACJ,EAAC,GACGC,IAAkB,OAAO,UAAU;AAChC,SAASC,EAAeC,GAAKC,GAAK;AACrC,SAAOH,EAAgB,KAAKE,GAAKC,CAAG;AACxC;AACO,SAASC,EAAYF,GAAK;AAC7B,MAAI,MAAM,QAAQA,CAAG,GAAG;AAEpB,aADIG,IAAS,IAAI,MAAMH,EAAI,MAAM,GACxBI,IAAI,GAAGA,IAAID,EAAO,QAAQC;AAC/B,MAAAD,EAAOC,CAAC,IAAI,KAAKA;AAErB,WAAOD;AAAA,EACX;AACA,MAAI,OAAO;AACP,WAAO,OAAO,KAAKH,CAAG;AAE1B,MAAIK,IAAO,CAAA;AACX,WAASC,KAAKN;AACV,IAAID,EAAeC,GAAKM,CAAC,KACrBD,EAAK,KAAKC,CAAC;AAGnB,SAAOD;AACX;AAQO,SAASE,EAAWP,GAAK;AAC5B,UAAQ,OAAOA,GAAG;AAAA,IACd,KAAK;AACD,aAAO,KAAK,MAAM,KAAK,UAAUA,CAAG,CAAC;AAAA;AAAA,IACzC,KAAK;AACD,aAAO;AAAA;AAAA,IACX;AACI,aAAOA;AAAA,EACnB;AACA;AAEO,SAASQ,EAAUC,GAAK;AAI3B,WAHIH,IAAI,GACJI,IAAMD,EAAI,QACVE,GACGL,IAAII,KAAK;AAEZ,QADAC,IAAWF,EAAI,WAAWH,CAAC,GACvBK,KAAY,MAAMA,KAAY,IAAI;AAClC,MAAAL;AACA;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACA,SAAO;AACX;AAMO,SAASM,EAAoBC,GAAM;AACtC,SAAIA,EAAK,QAAQ,GAAG,MAAM,MAAMA,EAAK,QAAQ,GAAG,MAAM,KAC3CA,IACJA,EAAK,QAAQ,MAAM,IAAI,EAAE,QAAQ,OAAO,IAAI;AACvD;AAMO,SAASC,EAAsBD,GAAM;AACxC,SAAOA,EAAK,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG;AACtD;AA+BO,SAASE,EAAaf,GAAK;AAC9B,MAAIA,MAAQ;AACR,WAAO;AAEX,MAAIA;AACA,QAAI,MAAM,QAAQA,CAAG;AACjB,eAASgB,IAAM,GAAGN,IAAMV,EAAI,QAAQgB,IAAMN,GAAKM;AAC3C,YAAID,EAAaf,EAAIgB,CAAG,CAAC;AACrB,iBAAO;AAAA,eAIV,OAAOhB,KAAQ;AAGpB,eAFIiB,IAAUf,EAAYF,CAAG,GACzBkB,IAAgBD,EAAQ,QACnBX,IAAI,GAAGA,IAAIY,GAAeZ;AAC/B,YAAIS,EAAaf,EAAIiB,EAAQX,CAAC,CAAC,CAAC;AAC5B,iBAAO;AAAA;AAAA;AAKvB,SAAO;AACX;AACA,SAASa,EAA2BC,GAASC,GAAM;AAC/C,MAAIC,IAAe,CAACF,CAAO;AAC3B,WAASnB,KAAOoB,GAAM;AAClB,QAAIE,IAAQ,OAAOF,EAAKpB,CAAG,KAAM,WAAW,KAAK,UAAUoB,EAAKpB,CAAG,GAAG,MAAM,CAAC,IAAIoB,EAAKpB,CAAG;AACzF,IAAI,OAAOsB,IAAU,OACjBD,EAAa,KAAKrB,IAAM,OAAOsB,CAAK;AAAA,EAE5C;AACA,SAAOD,EAAa,KAAK;AAAA,CAAI;AACjC;AACG,IAACE;AAAA;AAAA,EAA4B,SAAUC,GAAQ;AAC9C,IAAAjC,EAAUgC,GAAYC,CAAM;AAC5B,aAASD,EAAWJ,GAASM,GAAMC,GAAOC,GAAWC,GAAM;AACvD,UAAIC,IAAa,KAAK,aAClBC,IAAQN,EAAO,KAAK,MAAMN,EAA2BC,GAAS,EAAE,MAAMM,GAAM,OAAOC,GAAO,WAAWC,GAAW,MAAMC,EAAI,CAAE,CAAC,KAAK;AACtI,aAAAE,EAAM,OAAOL,GACbK,EAAM,QAAQJ,GACdI,EAAM,YAAYH,GAClBG,EAAM,OAAOF,GACb,OAAO,eAAeE,GAAOD,EAAW,SAAS,GACjDC,EAAM,UAAUZ,EAA2BC,GAAS,EAAE,MAAMM,GAAM,OAAOC,GAAO,WAAWC,GAAW,MAAMC,EAAI,CAAE,GAC3GE;AAAA,IACX;AACA,WAAOP;AAAA,EACX,EAAE,KAAK;AAAA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/comparator.js.map

@@ -1 +1 @@
-{"version":3,"file":"comparator.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/comparator.js"],"sourcesContent":["'use strict'\n\nconst ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n  static get ANY () {\n    return ANY\n  }\n\n  constructor (comp, options) {\n    options = parseOptions(options)\n\n    if (comp instanceof Comparator) {\n      if (comp.loose === !!options.loose) {\n        return comp\n      } else {\n        comp = comp.value\n      }\n    }\n\n    comp = comp.trim().split(/\\s+/).join(' ')\n    debug('comparator', comp, options)\n    this.options = options\n    this.loose = !!options.loose\n    this.parse(comp)\n\n    if (this.semver === ANY) {\n      this.value = ''\n    } else {\n      this.value = this.operator + this.semver.version\n    }\n\n    debug('comp', this)\n  }\n\n  parse (comp) {\n    const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n    const m = comp.match(r)\n\n    if (!m) {\n      throw new TypeError(`Invalid comparator: ${comp}`)\n    }\n\n    this.operator = m[1] !== undefined ? m[1] : ''\n    if (this.operator === '=') {\n      this.operator = ''\n    }\n\n    // if it literally is just '>' or '' then allow anything.\n    if (!m[2]) {\n      this.semver = ANY\n    } else {\n      this.semver = new SemVer(m[2], this.options.loose)\n    }\n  }\n\n  toString () {\n    return this.value\n  }\n\n  test (version) {\n    debug('Comparator.test', version, this.options.loose)\n\n    if (this.semver === ANY || version === ANY) {\n      return true\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    return cmp(version, this.operator, this.semver, this.options)\n  }\n\n  intersects (comp, options) {\n    if (!(comp instanceof Comparator)) {\n      throw new TypeError('a Comparator is required')\n    }\n\n    if (this.operator === '') {\n      if (this.value === '') {\n        return true\n      }\n      return new Range(comp.value, options).test(this.value)\n    } else if (comp.operator === '') {\n      if (comp.value === '') {\n        return true\n      }\n      return new Range(this.value, options).test(comp.semver)\n    }\n\n    options = parseOptions(options)\n\n    // Special cases where nothing can possibly be lower\n    if (options.includePrerelease &&\n      (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {\n      return false\n    }\n    if (!options.includePrerelease &&\n      (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {\n      return false\n    }\n\n    // Same direction increasing (> or >=)\n    if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {\n      return true\n    }\n    // Same direction decreasing (< or <=)\n    if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // same SemVer and both sides are inclusive (<= or >=)\n    if (\n      (this.semver.version === comp.semver.version) &&\n      this.operator.includes('=') && comp.operator.includes('=')) {\n      return true\n    }\n    // opposite directions less than\n    if (cmp(this.semver, '<', comp.semver, options) &&\n      this.operator.startsWith('>') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // opposite directions greater than\n    if (cmp(this.semver, '>', comp.semver, options) &&\n      this.operator.startsWith('<') && comp.operator.startsWith('>')) {\n      return true\n    }\n    return false\n  }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { safeRe: re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n"],"names":["ANY","Comparator","comp","options","parseOptions","debug","r","re","t","m","SemVer","version","cmp","Range","comparator","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5"],"mappings":";;;;;;;;;;AAEA,QAAMA,IAAM,OAAO,YAAY;AAAA,EAE/B,MAAMC,EAAW;AAAA,IACf,WAAW,MAAO;AAChB,aAAOD;AAAA,IACX;AAAA,IAEE,YAAaE,GAAMC,GAAS;AAG1B,UAFAA,IAAUC,EAAaD,CAAO,GAE1BD,aAAgBD,GAAY;AAC9B,YAAIC,EAAK,UAAU,CAAC,CAACC,EAAQ;AAC3B,iBAAOD;AAEP,QAAAA,IAAOA,EAAK;AAAA,MAEpB;AAEI,MAAAA,IAAOA,EAAK,KAAM,EAAC,MAAM,KAAK,EAAE,KAAK,GAAG,GACxCG,EAAM,cAAcH,GAAMC,CAAO,GACjC,KAAK,UAAUA,GACf,KAAK,QAAQ,CAAC,CAACA,EAAQ,OACvB,KAAK,MAAMD,CAAI,GAEX,KAAK,WAAWF,IAClB,KAAK,QAAQ,KAEb,KAAK,QAAQ,KAAK,WAAW,KAAK,OAAO,SAG3CK,EAAM,QAAQ,IAAI;AAAA,IACtB;AAAA,IAEE,MAAOH,GAAM;AACX,YAAMI,IAAI,KAAK,QAAQ,QAAQC,EAAGC,EAAE,eAAe,IAAID,EAAGC,EAAE,UAAU,GAChEC,IAAIP,EAAK,MAAMI,CAAC;AAEtB,UAAI,CAACG;AACH,cAAM,IAAI,UAAU,uBAAuBP,CAAI,EAAE;AAGnD,WAAK,WAAWO,EAAE,CAAC,MAAM,SAAYA,EAAE,CAAC,IAAI,IACxC,KAAK,aAAa,QACpB,KAAK,WAAW,KAIbA,EAAE,CAAC,IAGN,KAAK,SAAS,IAAIC,EAAOD,EAAE,CAAC,GAAG,KAAK,QAAQ,KAAK,IAFjD,KAAK,SAAST;AAAA,IAIpB;AAAA,IAEE,WAAY;AACV,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,KAAMW,GAAS;AAGb,UAFAN,EAAM,mBAAmBM,GAAS,KAAK,QAAQ,KAAK,GAEhD,KAAK,WAAWX,KAAOW,MAAYX;AACrC,eAAO;AAGT,UAAI,OAAOW,KAAY;AACrB,YAAI;AACF,UAAAA,IAAU,IAAID,EAAOC,GAAS,KAAK,OAAO;AAAA,QAC3C,QAAY;AACX,iBAAO;AAAA,QACf;AAGI,aAAOC,EAAID,GAAS,KAAK,UAAU,KAAK,QAAQ,KAAK,OAAO;AAAA,IAChE;AAAA,IAEE,WAAYT,GAAMC,GAAS;AACzB,UAAI,EAAED,aAAgBD;AACpB,cAAM,IAAI,UAAU,0BAA0B;AAGhD,aAAI,KAAK,aAAa,KAChB,KAAK,UAAU,KACV,KAEF,IAAIY,EAAMX,EAAK,OAAOC,CAAO,EAAE,KAAK,KAAK,KAAK,IAC5CD,EAAK,aAAa,KACvBA,EAAK,UAAU,KACV,KAEF,IAAIW,EAAM,KAAK,OAAOV,CAAO,EAAE,KAAKD,EAAK,MAAM,KAGxDC,IAAUC,EAAaD,CAAO,GAG1BA,EAAQ,sBACT,KAAK,UAAU,cAAcD,EAAK,UAAU,eAG3C,CAACC,EAAQ,sBACV,KAAK,MAAM,WAAW,QAAQ,KAAKD,EAAK,MAAM,WAAW,QAAQ,KAC3D,KAIL,QAAK,SAAS,WAAW,GAAG,KAAKA,EAAK,SAAS,WAAW,GAAG,KAI7D,KAAK,SAAS,WAAW,GAAG,KAAKA,EAAK,SAAS,WAAW,GAAG,KAK9D,KAAK,OAAO,YAAYA,EAAK,OAAO,WACrC,KAAK,SAAS,SAAS,GAAG,KAAKA,EAAK,SAAS,SAAS,GAAG,KAIvDU,EAAI,KAAK,QAAQ,KAAKV,EAAK,QAAQC,CAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAKD,EAAK,SAAS,WAAW,GAAG,KAI3DU,EAAI,KAAK,QAAQ,KAAKV,EAAK,QAAQC,CAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAKD,EAAK,SAAS,WAAW,GAAG;AAAA,IAInE;AAAA,EACA;AAEA,EAAAY,IAAiBb;AAEjB,QAAMG,IAAeW,EAAA,GACf,EAAE,QAAQR,GAAI,GAAAC,EAAG,IAAGQ,EAAA,GACpBJ,IAAMK,EAAA,GACNZ,IAAQa,EAAA,GACRR,IAASS,EAAA,GACTN,IAAQO,EAAA;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"comparator.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/comparator.js"],"sourcesContent":["'use strict'\n\nconst ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n  static get ANY () {\n    return ANY\n  }\n\n  constructor (comp, options) {\n    options = parseOptions(options)\n\n    if (comp instanceof Comparator) {\n      if (comp.loose === !!options.loose) {\n        return comp\n      } else {\n        comp = comp.value\n      }\n    }\n\n    comp = comp.trim().split(/\\s+/).join(' ')\n    debug('comparator', comp, options)\n    this.options = options\n    this.loose = !!options.loose\n    this.parse(comp)\n\n    if (this.semver === ANY) {\n      this.value = ''\n    } else {\n      this.value = this.operator + this.semver.version\n    }\n\n    debug('comp', this)\n  }\n\n  parse (comp) {\n    const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n    const m = comp.match(r)\n\n    if (!m) {\n      throw new TypeError(`Invalid comparator: ${comp}`)\n    }\n\n    this.operator = m[1] !== undefined ? m[1] : ''\n    if (this.operator === '=') {\n      this.operator = ''\n    }\n\n    // if it literally is just '>' or '' then allow anything.\n    if (!m[2]) {\n      this.semver = ANY\n    } else {\n      this.semver = new SemVer(m[2], this.options.loose)\n    }\n  }\n\n  toString () {\n    return this.value\n  }\n\n  test (version) {\n    debug('Comparator.test', version, this.options.loose)\n\n    if (this.semver === ANY || version === ANY) {\n      return true\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    return cmp(version, this.operator, this.semver, this.options)\n  }\n\n  intersects (comp, options) {\n    if (!(comp instanceof Comparator)) {\n      throw new TypeError('a Comparator is required')\n    }\n\n    if (this.operator === '') {\n      if (this.value === '') {\n        return true\n      }\n      return new Range(comp.value, options).test(this.value)\n    } else if (comp.operator === '') {\n      if (comp.value === '') {\n        return true\n      }\n      return new Range(this.value, options).test(comp.semver)\n    }\n\n    options = parseOptions(options)\n\n    // Special cases where nothing can possibly be lower\n    if (options.includePrerelease &&\n      (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {\n      return false\n    }\n    if (!options.includePrerelease &&\n      (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {\n      return false\n    }\n\n    // Same direction increasing (> or >=)\n    if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {\n      return true\n    }\n    // Same direction decreasing (< or <=)\n    if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // same SemVer and both sides are inclusive (<= or >=)\n    if (\n      (this.semver.version === comp.semver.version) &&\n      this.operator.includes('=') && comp.operator.includes('=')) {\n      return true\n    }\n    // opposite directions less than\n    if (cmp(this.semver, '<', comp.semver, options) &&\n      this.operator.startsWith('>') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // opposite directions greater than\n    if (cmp(this.semver, '>', comp.semver, options) &&\n      this.operator.startsWith('<') && comp.operator.startsWith('>')) {\n      return true\n    }\n    return false\n  }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { safeRe: re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n"],"names":["ANY","Comparator","comp","options","parseOptions","debug","r","re","t","m","SemVer","version","cmp","Range","comparator","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5"],"mappings":";;;;;;;;;;AAEA,QAAMA,IAAM,OAAO,YAAY;AAAA,EAE/B,MAAMC,EAAW;AAAA,IACf,WAAW,MAAO;AAChB,aAAOD;AAAA,IACX;AAAA,IAEE,YAAaE,GAAMC,GAAS;AAG1B,UAFAA,IAAUC,EAAaD,CAAO,GAE1BD,aAAgBD,GAAY;AAC9B,YAAIC,EAAK,UAAU,CAAC,CAACC,EAAQ;AAC3B,iBAAOD;AAEP,QAAAA,IAAOA,EAAK;AAAA,MAEpB;AAEI,MAAAA,IAAOA,EAAK,KAAI,EAAG,MAAM,KAAK,EAAE,KAAK,GAAG,GACxCG,EAAM,cAAcH,GAAMC,CAAO,GACjC,KAAK,UAAUA,GACf,KAAK,QAAQ,CAAC,CAACA,EAAQ,OACvB,KAAK,MAAMD,CAAI,GAEX,KAAK,WAAWF,IAClB,KAAK,QAAQ,KAEb,KAAK,QAAQ,KAAK,WAAW,KAAK,OAAO,SAG3CK,EAAM,QAAQ,IAAI;AAAA,IACtB;AAAA,IAEE,MAAOH,GAAM;AACX,YAAMI,IAAI,KAAK,QAAQ,QAAQC,EAAGC,EAAE,eAAe,IAAID,EAAGC,EAAE,UAAU,GAChEC,IAAIP,EAAK,MAAMI,CAAC;AAEtB,UAAI,CAACG;AACH,cAAM,IAAI,UAAU,uBAAuBP,CAAI,EAAE;AAGnD,WAAK,WAAWO,EAAE,CAAC,MAAM,SAAYA,EAAE,CAAC,IAAI,IACxC,KAAK,aAAa,QACpB,KAAK,WAAW,KAIbA,EAAE,CAAC,IAGN,KAAK,SAAS,IAAIC,EAAOD,EAAE,CAAC,GAAG,KAAK,QAAQ,KAAK,IAFjD,KAAK,SAAST;AAAA,IAIpB;AAAA,IAEE,WAAY;AACV,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,KAAMW,GAAS;AAGb,UAFAN,EAAM,mBAAmBM,GAAS,KAAK,QAAQ,KAAK,GAEhD,KAAK,WAAWX,KAAOW,MAAYX;AACrC,eAAO;AAGT,UAAI,OAAOW,KAAY;AACrB,YAAI;AACF,UAAAA,IAAU,IAAID,EAAOC,GAAS,KAAK,OAAO;AAAA,QAClD,QAAmB;AACX,iBAAO;AAAA,QACf;AAGI,aAAOC,EAAID,GAAS,KAAK,UAAU,KAAK,QAAQ,KAAK,OAAO;AAAA,IAChE;AAAA,IAEE,WAAYT,GAAMC,GAAS;AACzB,UAAI,EAAED,aAAgBD;AACpB,cAAM,IAAI,UAAU,0BAA0B;AAGhD,aAAI,KAAK,aAAa,KAChB,KAAK,UAAU,KACV,KAEF,IAAIY,EAAMX,EAAK,OAAOC,CAAO,EAAE,KAAK,KAAK,KAAK,IAC5CD,EAAK,aAAa,KACvBA,EAAK,UAAU,KACV,KAEF,IAAIW,EAAM,KAAK,OAAOV,CAAO,EAAE,KAAKD,EAAK,MAAM,KAGxDC,IAAUC,EAAaD,CAAO,GAG1BA,EAAQ,sBACT,KAAK,UAAU,cAAcD,EAAK,UAAU,eAG3C,CAACC,EAAQ,sBACV,KAAK,MAAM,WAAW,QAAQ,KAAKD,EAAK,MAAM,WAAW,QAAQ,KAC3D,KAIL,QAAK,SAAS,WAAW,GAAG,KAAKA,EAAK,SAAS,WAAW,GAAG,KAI7D,KAAK,SAAS,WAAW,GAAG,KAAKA,EAAK,SAAS,WAAW,GAAG,KAK9D,KAAK,OAAO,YAAYA,EAAK,OAAO,WACrC,KAAK,SAAS,SAAS,GAAG,KAAKA,EAAK,SAAS,SAAS,GAAG,KAIvDU,EAAI,KAAK,QAAQ,KAAKV,EAAK,QAAQC,CAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAKD,EAAK,SAAS,WAAW,GAAG,KAI3DU,EAAI,KAAK,QAAQ,KAAKV,EAAK,QAAQC,CAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAKD,EAAK,SAAS,WAAW,GAAG;AAAA,IAInE;AAAA,EACA;AAEA,EAAAY,IAAiBb;AAEjB,QAAMG,IAAeW,EAAA,GACf,EAAE,QAAQR,GAAI,GAAAC,EAAC,IAAKQ,EAAA,GACpBJ,IAAMK,EAAA,GACNZ,IAAQa,EAAA,GACRR,IAASS,EAAA,GACTN,IAAQO,EAAA;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/range.js.map

@@ -1 +1 @@
-{"version":3,"file":"range.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/range.js"],"sourcesContent":["'use strict'\n\nconst SPACE_CHARACTERS = /\\s+/g\n\n// hoisted class for cyclic dependency\nclass Range {\n  constructor (range, options) {\n    options = parseOptions(options)\n\n    if (range instanceof Range) {\n      if (\n        range.loose === !!options.loose &&\n        range.includePrerelease === !!options.includePrerelease\n      ) {\n        return range\n      } else {\n        return new Range(range.raw, options)\n      }\n    }\n\n    if (range instanceof Comparator) {\n      // just put it in the set and return\n      this.raw = range.value\n      this.set = [[range]]\n      this.formatted = undefined\n      return this\n    }\n\n    this.options = options\n    this.loose = !!options.loose\n    this.includePrerelease = !!options.includePrerelease\n\n    // First reduce all whitespace as much as possible so we do not have to rely\n    // on potentially slow regexes like \\s*. This is then stored and used for\n    // future error messages as well.\n    this.raw = range.trim().replace(SPACE_CHARACTERS, ' ')\n\n    // First, split on ||\n    this.set = this.raw\n      .split('||')\n      // map the range to a 2d array of comparators\n      .map(r => this.parseRange(r.trim()))\n      // throw out any comparator lists that are empty\n      // this generally means that it was not a valid range, which is allowed\n      // in loose mode, but will still throw if the WHOLE range is invalid.\n      .filter(c => c.length)\n\n    if (!this.set.length) {\n      throw new TypeError(`Invalid SemVer Range: ${this.raw}`)\n    }\n\n    // if we have any that are not the null set, throw out null sets.\n    if (this.set.length > 1) {\n      // keep the first one, in case they're all null sets\n      const first = this.set[0]\n      this.set = this.set.filter(c => !isNullSet(c[0]))\n      if (this.set.length === 0) {\n        this.set = [first]\n      } else if (this.set.length > 1) {\n        // if we have any that are *, then the range is just *\n        for (const c of this.set) {\n          if (c.length === 1 && isAny(c[0])) {\n            this.set = [c]\n            break\n          }\n        }\n      }\n    }\n\n    this.formatted = undefined\n  }\n\n  get range () {\n    if (this.formatted === undefined) {\n      this.formatted = ''\n      for (let i = 0; i < this.set.length; i++) {\n        if (i > 0) {\n          this.formatted += '||'\n        }\n        const comps = this.set[i]\n        for (let k = 0; k < comps.length; k++) {\n          if (k > 0) {\n            this.formatted += ' '\n          }\n          this.formatted += comps[k].toString().trim()\n        }\n      }\n    }\n    return this.formatted\n  }\n\n  format () {\n    return this.range\n  }\n\n  toString () {\n    return this.range\n  }\n\n  parseRange (range) {\n    // memoize range parsing for performance.\n    // this is a very hot path, and fully deterministic.\n    const memoOpts =\n      (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |\n      (this.options.loose && FLAG_LOOSE)\n    const memoKey = memoOpts + ':' + range\n    const cached = cache.get(memoKey)\n    if (cached) {\n      return cached\n    }\n\n    const loose = this.options.loose\n    // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n    const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n    range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n    debug('hyphen replace', range)\n\n    // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n    range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n    debug('comparator trim', range)\n\n    // `~ 1.2.3` => `~1.2.3`\n    range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n    debug('tilde trim', range)\n\n    // `^ 1.2.3` => `^1.2.3`\n    range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n    debug('caret trim', range)\n\n    // At this point, the range is completely trimmed and\n    // ready to be split into comparators.\n\n    let rangeList = range\n      .split(' ')\n      .map(comp => parseComparator(comp, this.options))\n      .join(' ')\n      .split(/\\s+/)\n      // >=0.0.0 is equivalent to *\n      .map(comp => replaceGTE0(comp, this.options))\n\n    if (loose) {\n      // in loose mode, throw out any that are not valid comparators\n      rangeList = rangeList.filter(comp => {\n        debug('loose invalid filter', comp, this.options)\n        return !!comp.match(re[t.COMPARATORLOOSE])\n      })\n    }\n    debug('range list', rangeList)\n\n    // if any comparators are the null set, then replace with JUST null set\n    // if more than one comparator, remove any * comparators\n    // also, don't include the same comparator more than once\n    const rangeMap = new Map()\n    const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n    for (const comp of comparators) {\n      if (isNullSet(comp)) {\n        return [comp]\n      }\n      rangeMap.set(comp.value, comp)\n    }\n    if (rangeMap.size > 1 && rangeMap.has('')) {\n      rangeMap.delete('')\n    }\n\n    const result = [...rangeMap.values()]\n    cache.set(memoKey, result)\n    return result\n  }\n\n  intersects (range, options) {\n    if (!(range instanceof Range)) {\n      throw new TypeError('a Range is required')\n    }\n\n    return this.set.some((thisComparators) => {\n      return (\n        isSatisfiable(thisComparators, options) &&\n        range.set.some((rangeComparators) => {\n          return (\n            isSatisfiable(rangeComparators, options) &&\n            thisComparators.every((thisComparator) => {\n              return rangeComparators.every((rangeComparator) => {\n                return thisComparator.intersects(rangeComparator, options)\n              })\n            })\n          )\n        })\n      )\n    })\n  }\n\n  // if ANY of the sets match ALL of its comparators, then pass\n  test (version) {\n    if (!version) {\n      return false\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    for (let i = 0; i < this.set.length; i++) {\n      if (testSet(this.set[i], version, this.options)) {\n        return true\n      }\n    }\n    return false\n  }\n}\n\nmodule.exports = Range\n\nconst LRU = require('../internal/lrucache')\nconst cache = new LRU()\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n  safeRe: re,\n  t,\n  comparatorTrimReplace,\n  tildeTrimReplace,\n  caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n  let result = true\n  const remainingComparators = comparators.slice()\n  let testComparator = remainingComparators.pop()\n\n  while (result && remainingComparators.length) {\n    result = remainingComparators.every((otherComparator) => {\n      return testComparator.intersects(otherComparator, options)\n    })\n\n    testComparator = remainingComparators.pop()\n  }\n\n  return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n  debug('comp', comp, options)\n  comp = replaceCarets(comp, options)\n  debug('caret', comp)\n  comp = replaceTildes(comp, options)\n  debug('tildes', comp)\n  comp = replaceXRanges(comp, options)\n  debug('xrange', comp)\n  comp = replaceStars(comp, options)\n  debug('stars', comp)\n  return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceTilde(c, options))\n    .join(' ')\n}\n\nconst replaceTilde = (comp, options) => {\n  const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('tilde', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0 <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      // ~1.2 == >=1.2.0 <1.3.0-0\n      ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`\n    } else if (pr) {\n      debug('replaceTilde pr', pr)\n      ret = `>=${M}.${m}.${p}-${pr\n      } <${M}.${+m + 1}.0-0`\n    } else {\n      // ~1.2.3 == >=1.2.3 <1.3.0-0\n      ret = `>=${M}.${m}.${p\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('tilde return', ret)\n    return ret\n  })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceCaret(c, options))\n    .join(' ')\n}\n\nconst replaceCaret = (comp, options) => {\n  debug('caret', comp, options)\n  const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n  const z = options.includePrerelease ? '-0' : ''\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('caret', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      if (M === '0') {\n        ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n      } else {\n        ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n      }\n    } else if (pr) {\n      debug('replaceCaret pr', pr)\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p}-${pr\n        } <${+M + 1}.0.0-0`\n      }\n    } else {\n      debug('no pr')\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p\n        } <${+M + 1}.0.0-0`\n      }\n    }\n\n    debug('caret return', ret)\n    return ret\n  })\n}\n\nconst replaceXRanges = (comp, options) => {\n  debug('replaceXRanges', comp, options)\n  return comp\n    .split(/\\s+/)\n    .map((c) => replaceXRange(c, options))\n    .join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n  comp = comp.trim()\n  const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n  return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n    debug('xRange', comp, ret, gtlt, M, m, p, pr)\n    const xM = isX(M)\n    const xm = xM || isX(m)\n    const xp = xm || isX(p)\n    const anyX = xp\n\n    if (gtlt === '=' && anyX) {\n      gtlt = ''\n    }\n\n    // if we're including prereleases in the match, then we need\n    // to fix this to -0, the lowest possible prerelease value\n    pr = options.includePrerelease ? '-0' : ''\n\n    if (xM) {\n      if (gtlt === '>' || gtlt === '<') {\n        // nothing is allowed\n        ret = '<0.0.0-0'\n      } else {\n        // nothing is forbidden\n        ret = '*'\n      }\n    } else if (gtlt && anyX) {\n      // we know patch is an x, because we have any x at all.\n      // replace X with 0\n      if (xm) {\n        m = 0\n      }\n      p = 0\n\n      if (gtlt === '>') {\n        // >1 => >=2.0.0\n        // >1.2 => >=1.3.0\n        gtlt = '>='\n        if (xm) {\n          M = +M + 1\n          m = 0\n          p = 0\n        } else {\n          m = +m + 1\n          p = 0\n        }\n      } else if (gtlt === '<=') {\n        // <=0.7.x is actually <0.8.0, since any 0.7.x should\n        // pass.  Similarly, <=7.x is actually <8.0.0, etc.\n        gtlt = '<'\n        if (xm) {\n          M = +M + 1\n        } else {\n          m = +m + 1\n        }\n      }\n\n      if (gtlt === '<') {\n        pr = '-0'\n      }\n\n      ret = `${gtlt + M}.${m}.${p}${pr}`\n    } else if (xm) {\n      ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n    } else if (xp) {\n      ret = `>=${M}.${m}.0${pr\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('xRange return', ret)\n\n    return ret\n  })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n  debug('replaceStars', comp, options)\n  // Looseness is ignored here.  star is always as loose as it gets!\n  return comp\n    .trim()\n    .replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n  debug('replaceGTE0', comp, options)\n  return comp\n    .trim()\n    .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\n// TODO build?\nconst hyphenReplace = incPr => ($0,\n  from, fM, fm, fp, fpr, fb,\n  to, tM, tm, tp, tpr) => {\n  if (isX(fM)) {\n    from = ''\n  } else if (isX(fm)) {\n    from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n  } else if (isX(fp)) {\n    from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n  } else if (fpr) {\n    from = `>=${from}`\n  } else {\n    from = `>=${from}${incPr ? '-0' : ''}`\n  }\n\n  if (isX(tM)) {\n    to = ''\n  } else if (isX(tm)) {\n    to = `<${+tM + 1}.0.0-0`\n  } else if (isX(tp)) {\n    to = `<${tM}.${+tm + 1}.0-0`\n  } else if (tpr) {\n    to = `<=${tM}.${tm}.${tp}-${tpr}`\n  } else if (incPr) {\n    to = `<${tM}.${tm}.${+tp + 1}-0`\n  } else {\n    to = `<=${to}`\n  }\n\n  return `${from} ${to}`.trim()\n}\n\nconst testSet = (set, version, options) => {\n  for (let i = 0; i < set.length; i++) {\n    if (!set[i].test(version)) {\n      return false\n    }\n  }\n\n  if (version.prerelease.length && !options.includePrerelease) {\n    // Find the set of versions that are allowed to have prereleases\n    // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n    // That should allow `1.2.3-pr.2` to pass.\n    // However, `1.2.4-alpha.notready` should NOT be allowed,\n    // even though it's within the range set by the comparators.\n    for (let i = 0; i < set.length; i++) {\n      debug(set[i].semver)\n      if (set[i].semver === Comparator.ANY) {\n        continue\n      }\n\n      if (set[i].semver.prerelease.length > 0) {\n        const allowed = set[i].semver\n        if (allowed.major === version.major &&\n            allowed.minor === version.minor &&\n            allowed.patch === version.patch) {\n          return true\n        }\n      }\n    }\n\n    // Version has a -pre, but it's not one of the ones we like.\n    return false\n  }\n\n  return true\n}\n"],"names":["SPACE_CHARACTERS","Range","range","options","parseOptions","Comparator","r","c","first","isNullSet","isAny","i","comps","k","memoKey","FLAG_INCLUDE_PRERELEASE","FLAG_LOOSE","cached","cache","loose","hr","re","t","hyphenReplace","debug","comparatorTrimReplace","tildeTrimReplace","caretTrimReplace","rangeList","comp","parseComparator","replaceGTE0","rangeMap","comparators","result","thisComparators","isSatisfiable","rangeComparators","thisComparator","rangeComparator","version","SemVer","testSet","LRU","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","remainingComparators","testComparator","otherComparator","replaceCarets","replaceTildes","replaceXRanges","replaceStars","isX","id","replaceTilde","_","M","m","p","pr","ret","replaceCaret","z","replaceXRange","gtlt","xM","xm","xp","anyX","incPr","$0","from","fM","fm","fp","fpr","fb","to","tM","tm","tp","tpr","set","allowed"],"mappings":";;;;;;;;;;;AAEA,QAAMA,IAAmB;AAAA,EAGzB,MAAMC,EAAM;AAAA,IACV,YAAaC,GAAOC,GAAS;AAG3B,UAFAA,IAAUC,EAAaD,CAAO,GAE1BD,aAAiBD;AACnB,eACEC,EAAM,UAAU,CAAC,CAACC,EAAQ,SAC1BD,EAAM,sBAAsB,CAAC,CAACC,EAAQ,oBAE/BD,IAEA,IAAID,EAAMC,EAAM,KAAKC,CAAO;AAIvC,UAAID,aAAiBG;AAEnB,oBAAK,MAAMH,EAAM,OACjB,KAAK,MAAM,CAAC,CAACA,CAAK,CAAC,GACnB,KAAK,YAAY,QACV;AAsBT,UAnBA,KAAK,UAAUC,GACf,KAAK,QAAQ,CAAC,CAACA,EAAQ,OACvB,KAAK,oBAAoB,CAAC,CAACA,EAAQ,mBAKnC,KAAK,MAAMD,EAAM,KAAI,EAAG,QAAQF,GAAkB,GAAG,GAGrD,KAAK,MAAM,KAAK,IACb,MAAM,IAAI,EAEV,IAAI,CAAAM,MAAK,KAAK,WAAWA,EAAE,KAAI,CAAE,CAAC,EAIlC,OAAO,CAAAC,MAAKA,EAAE,MAAM,GAEnB,CAAC,KAAK,IAAI;AACZ,cAAM,IAAI,UAAU,yBAAyB,KAAK,GAAG,EAAE;AAIzD,UAAI,KAAK,IAAI,SAAS,GAAG;AAEvB,cAAMC,IAAQ,KAAK,IAAI,CAAC;AAExB,YADA,KAAK,MAAM,KAAK,IAAI,OAAO,CAAAD,MAAK,CAACE,EAAUF,EAAE,CAAC,CAAC,CAAC,GAC5C,KAAK,IAAI,WAAW;AACtB,eAAK,MAAM,CAACC,CAAK;AAAA,iBACR,KAAK,IAAI,SAAS;AAE3B,qBAAWD,KAAK,KAAK;AACnB,gBAAIA,EAAE,WAAW,KAAKG,EAAMH,EAAE,CAAC,CAAC,GAAG;AACjC,mBAAK,MAAM,CAACA,CAAC;AACb;AAAA,YACZ;AAAA;AAAA,MAGA;AAEI,WAAK,YAAY;AAAA,IACrB;AAAA,IAEE,IAAI,QAAS;AACX,UAAI,KAAK,cAAc,QAAW;AAChC,aAAK,YAAY;AACjB,iBAASI,IAAI,GAAGA,IAAI,KAAK,IAAI,QAAQA,KAAK;AACxC,UAAIA,IAAI,MACN,KAAK,aAAa;AAEpB,gBAAMC,IAAQ,KAAK,IAAID,CAAC;AACxB,mBAASE,IAAI,GAAGA,IAAID,EAAM,QAAQC;AAChC,YAAIA,IAAI,MACN,KAAK,aAAa,MAEpB,KAAK,aAAaD,EAAMC,CAAC,EAAE,SAAU,EAAC,KAAI;AAAA,QAEpD;AAAA,MACA;AACI,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,SAAU;AACR,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,WAAY;AACV,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,WAAYX,GAAO;AAMjB,YAAMY,MAFH,KAAK,QAAQ,qBAAqBC,MAClC,KAAK,QAAQ,SAASC,MACE,MAAMd,GAC3Be,IAASC,EAAM,IAAIJ,CAAO;AAChC,UAAIG;AACF,eAAOA;AAGT,YAAME,IAAQ,KAAK,QAAQ,OAErBC,IAAKD,IAAQE,EAAGC,EAAE,gBAAgB,IAAID,EAAGC,EAAE,WAAW;AAC5D,MAAApB,IAAQA,EAAM,QAAQkB,GAAIG,EAAc,KAAK,QAAQ,iBAAiB,CAAC,GACvEC,EAAM,kBAAkBtB,CAAK,GAG7BA,IAAQA,EAAM,QAAQmB,EAAGC,EAAE,cAAc,GAAGG,CAAqB,GACjED,EAAM,mBAAmBtB,CAAK,GAG9BA,IAAQA,EAAM,QAAQmB,EAAGC,EAAE,SAAS,GAAGI,CAAgB,GACvDF,EAAM,cAActB,CAAK,GAGzBA,IAAQA,EAAM,QAAQmB,EAAGC,EAAE,SAAS,GAAGK,CAAgB,GACvDH,EAAM,cAActB,CAAK;AAKzB,UAAI0B,IAAY1B,EACb,MAAM,GAAG,EACT,IAAI,CAAA2B,MAAQC,EAAgBD,GAAM,KAAK,OAAO,CAAC,EAC/C,KAAK,GAAG,EACR,MAAM,KAAK,EAEX,IAAI,CAAAA,MAAQE,EAAYF,GAAM,KAAK,OAAO,CAAC;AAE9C,MAAIV,MAEFS,IAAYA,EAAU,OAAO,CAAAC,OAC3BL,EAAM,wBAAwBK,GAAM,KAAK,OAAO,GACzC,CAAC,CAACA,EAAK,MAAMR,EAAGC,EAAE,eAAe,CAAC,EAC1C,IAEHE,EAAM,cAAcI,CAAS;AAK7B,YAAMI,IAAW,oBAAI,IAAG,GAClBC,IAAcL,EAAU,IAAI,CAAAC,MAAQ,IAAIxB,EAAWwB,GAAM,KAAK,OAAO,CAAC;AAC5E,iBAAWA,KAAQI,GAAa;AAC9B,YAAIxB,EAAUoB,CAAI;AAChB,iBAAO,CAACA,CAAI;AAEd,QAAAG,EAAS,IAAIH,EAAK,OAAOA,CAAI;AAAA,MACnC;AACI,MAAIG,EAAS,OAAO,KAAKA,EAAS,IAAI,EAAE,KACtCA,EAAS,OAAO,EAAE;AAGpB,YAAME,IAAS,CAAC,GAAGF,EAAS,OAAQ,CAAA;AACpC,aAAAd,EAAM,IAAIJ,GAASoB,CAAM,GAClBA;AAAA,IACX;AAAA,IAEE,WAAYhC,GAAOC,GAAS;AAC1B,UAAI,EAAED,aAAiBD;AACrB,cAAM,IAAI,UAAU,qBAAqB;AAG3C,aAAO,KAAK,IAAI,KAAK,CAACkC,MAElBC,EAAcD,GAAiBhC,CAAO,KACtCD,EAAM,IAAI,KAAK,CAACmC,MAEZD,EAAcC,GAAkBlC,CAAO,KACvCgC,EAAgB,MAAM,CAACG,MACdD,EAAiB,MAAM,CAACE,MACtBD,EAAe,WAAWC,GAAiBpC,CAAO,CAC1D,CACF,CAEJ,CAEJ;AAAA,IACL;AAAA;AAAA,IAGE,KAAMqC,GAAS;AACb,UAAI,CAACA;AACH,eAAO;AAGT,UAAI,OAAOA,KAAY;AACrB,YAAI;AACF,UAAAA,IAAU,IAAIC,EAAOD,GAAS,KAAK,OAAO;AAAA,QAC3C,QAAY;AACX,iBAAO;AAAA,QACf;AAGI,eAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ;AACnC,YAAIE,EAAQ,KAAK,IAAI,CAAC,GAAGF,GAAS,KAAK,OAAO;AAC5C,iBAAO;AAGX,aAAO;AAAA,IACX;AAAA,EACA;AAEA,EAAAtC,IAAiBD;AAEjB,QAAM0C,IAAMC,EAAA,GACN1B,IAAQ,IAAIyB,EAAG,GAEfvC,IAAeyC,EAAA,GACfxC,IAAayC,EAAA,GACbtB,IAAQuB,EAAA,GACRN,IAASO,EAAA,GACT;AAAA,IACJ,QAAQ3B;AAAA,IACR,GAAAC;AAAA,IACA,uBAAAG;AAAA,IACA,kBAAAC;AAAA,IACA,kBAAAC;AAAA,EACF,IAAIsB,EAAA,GACE,EAAE,yBAAAlC,GAAyB,YAAAC,EAAU,IAAKkC,EAAA,GAE1CzC,IAAY,CAAAF,MAAKA,EAAE,UAAU,YAC7BG,IAAQ,CAAAH,MAAKA,EAAE,UAAU,IAIzB6B,IAAgB,CAACH,GAAa9B,MAAY;AAC9C,QAAI+B,IAAS;AACb,UAAMiB,IAAuBlB,EAAY,MAAK;AAC9C,QAAImB,IAAiBD,EAAqB,IAAG;AAE7C,WAAOjB,KAAUiB,EAAqB;AACpC,MAAAjB,IAASiB,EAAqB,MAAM,CAACE,MAC5BD,EAAe,WAAWC,GAAiBlD,CAAO,CAC1D,GAEDiD,IAAiBD,EAAqB,IAAG;AAG3C,WAAOjB;AAAA,EACT,GAKMJ,IAAkB,CAACD,GAAM1B,OAC7BqB,EAAM,QAAQK,GAAM1B,CAAO,GAC3B0B,IAAOyB,EAAczB,GAAM1B,CAAO,GAClCqB,EAAM,SAASK,CAAI,GACnBA,IAAO0B,EAAc1B,GAAM1B,CAAO,GAClCqB,EAAM,UAAUK,CAAI,GACpBA,IAAO2B,EAAe3B,GAAM1B,CAAO,GACnCqB,EAAM,UAAUK,CAAI,GACpBA,IAAO4B,EAAa5B,GAAM1B,CAAO,GACjCqB,EAAM,SAASK,CAAI,GACZA,IAGH6B,IAAM,CAAAC,MAAM,CAACA,KAAMA,EAAG,YAAa,MAAK,OAAOA,MAAO,KAStDJ,IAAgB,CAAC1B,GAAM1B,MACpB0B,EACJ,KAAI,EACJ,MAAM,KAAK,EACX,IAAI,CAACtB,MAAMqD,EAAarD,GAAGJ,CAAO,CAAC,EACnC,KAAK,GAAG,GAGPyD,IAAe,CAAC/B,GAAM1B,MAAY;AACtC,UAAMG,IAAIH,EAAQ,QAAQkB,EAAGC,EAAE,UAAU,IAAID,EAAGC,EAAE,KAAK;AACvD,WAAOO,EAAK,QAAQvB,GAAG,CAACuD,GAAGC,GAAGC,GAAGC,GAAGC,MAAO;AACzC,MAAAzC,EAAM,SAASK,GAAMgC,GAAGC,GAAGC,GAAGC,GAAGC,CAAE;AACnC,UAAIC;AAEJ,aAAIR,EAAII,CAAC,IACPI,IAAM,KACGR,EAAIK,CAAC,IACdG,IAAM,KAAKJ,CAAC,SAAS,CAACA,IAAI,CAAC,WAClBJ,EAAIM,CAAC,IAEdE,IAAM,KAAKJ,CAAC,IAAIC,CAAC,OAAOD,CAAC,IAAI,CAACC,IAAI,CAAC,SAC1BE,KACTzC,EAAM,mBAAmByC,CAAE,GAC3BC,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CACzB,KAAIH,CAAC,IAAI,CAACC,IAAI,CAAC,UAGhBG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CACpB,KAAIF,CAAC,IAAI,CAACC,IAAI,CAAC,QAGlBvC,EAAM,gBAAgB0C,CAAG,GAClBA;AAAA,IACR,CAAA;AAAA,EACH,GAUMZ,IAAgB,CAACzB,GAAM1B,MACpB0B,EACJ,KAAI,EACJ,MAAM,KAAK,EACX,IAAI,CAACtB,MAAM4D,EAAa5D,GAAGJ,CAAO,CAAC,EACnC,KAAK,GAAG,GAGPgE,IAAe,CAACtC,GAAM1B,MAAY;AACtC,IAAAqB,EAAM,SAASK,GAAM1B,CAAO;AAC5B,UAAMG,IAAIH,EAAQ,QAAQkB,EAAGC,EAAE,UAAU,IAAID,EAAGC,EAAE,KAAK,GACjD8C,IAAIjE,EAAQ,oBAAoB,OAAO;AAC7C,WAAO0B,EAAK,QAAQvB,GAAG,CAACuD,GAAGC,GAAGC,GAAGC,GAAGC,MAAO;AACzC,MAAAzC,EAAM,SAASK,GAAMgC,GAAGC,GAAGC,GAAGC,GAAGC,CAAE;AACnC,UAAIC;AAEJ,aAAIR,EAAII,CAAC,IACPI,IAAM,KACGR,EAAIK,CAAC,IACdG,IAAM,KAAKJ,CAAC,OAAOM,CAAC,KAAK,CAACN,IAAI,CAAC,WACtBJ,EAAIM,CAAC,IACVF,MAAM,MACRI,IAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKK,CAAC,KAAKN,CAAC,IAAI,CAACC,IAAI,CAAC,SAEvCG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKK,CAAC,KAAK,CAACN,IAAI,CAAC,WAE3BG,KACTzC,EAAM,mBAAmByC,CAAE,GACvBH,MAAM,MACJC,MAAM,MACRG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CACpC,KAAeH,CAAC,IAAIC,CAAC,IAAI,CAACC,IAAI,CAAC,OAErBE,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CACzB,KAAIH,CAAC,IAAI,CAACC,IAAI,CAAC,SAGlBG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CAClC,KAAa,CAACH,IAAI,CAAC,aAGbtC,EAAM,OAAO,GACTsC,MAAM,MACJC,MAAM,MACRG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC/B,GAAaI,CAAC,KAAKN,CAAC,IAAIC,CAAC,IAAI,CAACC,IAAI,CAAC,OAEzBE,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC/B,GAAaI,CAAC,KAAKN,CAAC,IAAI,CAACC,IAAI,CAAC,SAGtBG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC7B,KAAa,CAACF,IAAI,CAAC,WAIftC,EAAM,gBAAgB0C,CAAG,GAClBA;AAAA,IACR,CAAA;AAAA,EACH,GAEMV,IAAiB,CAAC3B,GAAM1B,OAC5BqB,EAAM,kBAAkBK,GAAM1B,CAAO,GAC9B0B,EACJ,MAAM,KAAK,EACX,IAAI,CAACtB,MAAM8D,EAAc9D,GAAGJ,CAAO,CAAC,EACpC,KAAK,GAAG,IAGPkE,IAAgB,CAACxC,GAAM1B,MAAY;AACvC,IAAA0B,IAAOA,EAAK,KAAI;AAChB,UAAMvB,IAAIH,EAAQ,QAAQkB,EAAGC,EAAE,WAAW,IAAID,EAAGC,EAAE,MAAM;AACzD,WAAOO,EAAK,QAAQvB,GAAG,CAAC4D,GAAKI,GAAMR,GAAGC,GAAGC,GAAGC,MAAO;AACjD,MAAAzC,EAAM,UAAUK,GAAMqC,GAAKI,GAAMR,GAAGC,GAAGC,GAAGC,CAAE;AAC5C,YAAMM,IAAKb,EAAII,CAAC,GACVU,IAAKD,KAAMb,EAAIK,CAAC,GAChBU,IAAKD,KAAMd,EAAIM,CAAC,GAChBU,IAAOD;AAEb,aAAIH,MAAS,OAAOI,MAClBJ,IAAO,KAKTL,IAAK9D,EAAQ,oBAAoB,OAAO,IAEpCoE,IACED,MAAS,OAAOA,MAAS,MAE3BJ,IAAM,aAGNA,IAAM,MAECI,KAAQI,KAGbF,MACFT,IAAI,IAENC,IAAI,GAEAM,MAAS,OAGXA,IAAO,MACHE,KACFV,IAAI,CAACA,IAAI,GACTC,IAAI,GACJC,IAAI,MAEJD,IAAI,CAACA,IAAI,GACTC,IAAI,MAEGM,MAAS,SAGlBA,IAAO,KACHE,IACFV,IAAI,CAACA,IAAI,IAETC,IAAI,CAACA,IAAI,IAITO,MAAS,QACXL,IAAK,OAGPC,IAAM,GAAGI,IAAOR,CAAC,IAAIC,CAAC,IAAIC,CAAC,GAAGC,CAAE,MACvBO,IACTN,IAAM,KAAKJ,CAAC,OAAOG,CAAE,KAAK,CAACH,IAAI,CAAC,WACvBW,MACTP,IAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKE,CACrB,KAAIH,CAAC,IAAI,CAACC,IAAI,CAAC,SAGlBvC,EAAM,iBAAiB0C,CAAG,GAEnBA;AAAA,IACR,CAAA;AAAA,EACH,GAIMT,IAAe,CAAC5B,GAAM1B,OAC1BqB,EAAM,gBAAgBK,GAAM1B,CAAO,GAE5B0B,EACJ,KAAI,EACJ,QAAQR,EAAGC,EAAE,IAAI,GAAG,EAAE,IAGrBS,IAAc,CAACF,GAAM1B,OACzBqB,EAAM,eAAeK,GAAM1B,CAAO,GAC3B0B,EACJ,KAAI,EACJ,QAAQR,EAAGlB,EAAQ,oBAAoBmB,EAAE,UAAUA,EAAE,IAAI,GAAG,EAAE,IAS7DC,IAAgB,CAAAoD,MAAS,CAACC,GAC9BC,GAAMC,GAAIC,GAAIC,GAAIC,GAAKC,GACvBC,GAAIC,GAAIC,GAAIC,GAAIC,OACZ7B,EAAIoB,CAAE,IACRD,IAAO,KACEnB,EAAIqB,CAAE,IACfF,IAAO,KAAKC,CAAE,OAAOH,IAAQ,OAAO,EAAE,KAC7BjB,EAAIsB,CAAE,IACfH,IAAO,KAAKC,CAAE,IAAIC,CAAE,KAAKJ,IAAQ,OAAO,EAAE,KACjCM,IACTJ,IAAO,KAAKA,CAAI,KAEhBA,IAAO,KAAKA,CAAI,GAAGF,IAAQ,OAAO,EAAE,IAGlCjB,EAAI0B,CAAE,IACRD,IAAK,KACIzB,EAAI2B,CAAE,IACfF,IAAK,IAAI,CAACC,IAAK,CAAC,WACP1B,EAAI4B,CAAE,IACfH,IAAK,IAAIC,CAAE,IAAI,CAACC,IAAK,CAAC,SACbE,IACTJ,IAAK,KAAKC,CAAE,IAAIC,CAAE,IAAIC,CAAE,IAAIC,CAAG,KACtBZ,IACTQ,IAAK,IAAIC,CAAE,IAAIC,CAAE,IAAI,CAACC,IAAK,CAAC,OAE5BH,IAAK,KAAKA,CAAE,IAGP,GAAGN,CAAI,IAAIM,CAAE,GAAG,KAAI,IAGvBzC,IAAU,CAAC8C,GAAKhD,GAASrC,MAAY;AACzC,aAASQ,IAAI,GAAGA,IAAI6E,EAAI,QAAQ7E;AAC9B,UAAI,CAAC6E,EAAI7E,CAAC,EAAE,KAAK6B,CAAO;AACtB,eAAO;AAIX,QAAIA,EAAQ,WAAW,UAAU,CAACrC,EAAQ,mBAAmB;AAM3D,eAASQ,IAAI,GAAGA,IAAI6E,EAAI,QAAQ7E;AAE9B,YADAa,EAAMgE,EAAI7E,CAAC,EAAE,MAAM,GACf6E,EAAI7E,CAAC,EAAE,WAAWN,EAAW,OAI7BmF,EAAI7E,CAAC,EAAE,OAAO,WAAW,SAAS,GAAG;AACvC,gBAAM8E,IAAUD,EAAI7E,CAAC,EAAE;AACvB,cAAI8E,EAAQ,UAAUjD,EAAQ,SAC1BiD,EAAQ,UAAUjD,EAAQ,SAC1BiD,EAAQ,UAAUjD,EAAQ;AAC5B,mBAAO;AAAA,QAEjB;AAII,aAAO;AAAA,IACX;AAEE,WAAO;AAAA,EACT;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"range.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/range.js"],"sourcesContent":["'use strict'\n\nconst SPACE_CHARACTERS = /\\s+/g\n\n// hoisted class for cyclic dependency\nclass Range {\n  constructor (range, options) {\n    options = parseOptions(options)\n\n    if (range instanceof Range) {\n      if (\n        range.loose === !!options.loose &&\n        range.includePrerelease === !!options.includePrerelease\n      ) {\n        return range\n      } else {\n        return new Range(range.raw, options)\n      }\n    }\n\n    if (range instanceof Comparator) {\n      // just put it in the set and return\n      this.raw = range.value\n      this.set = [[range]]\n      this.formatted = undefined\n      return this\n    }\n\n    this.options = options\n    this.loose = !!options.loose\n    this.includePrerelease = !!options.includePrerelease\n\n    // First reduce all whitespace as much as possible so we do not have to rely\n    // on potentially slow regexes like \\s*. This is then stored and used for\n    // future error messages as well.\n    this.raw = range.trim().replace(SPACE_CHARACTERS, ' ')\n\n    // First, split on ||\n    this.set = this.raw\n      .split('||')\n      // map the range to a 2d array of comparators\n      .map(r => this.parseRange(r.trim()))\n      // throw out any comparator lists that are empty\n      // this generally means that it was not a valid range, which is allowed\n      // in loose mode, but will still throw if the WHOLE range is invalid.\n      .filter(c => c.length)\n\n    if (!this.set.length) {\n      throw new TypeError(`Invalid SemVer Range: ${this.raw}`)\n    }\n\n    // if we have any that are not the null set, throw out null sets.\n    if (this.set.length > 1) {\n      // keep the first one, in case they're all null sets\n      const first = this.set[0]\n      this.set = this.set.filter(c => !isNullSet(c[0]))\n      if (this.set.length === 0) {\n        this.set = [first]\n      } else if (this.set.length > 1) {\n        // if we have any that are *, then the range is just *\n        for (const c of this.set) {\n          if (c.length === 1 && isAny(c[0])) {\n            this.set = [c]\n            break\n          }\n        }\n      }\n    }\n\n    this.formatted = undefined\n  }\n\n  get range () {\n    if (this.formatted === undefined) {\n      this.formatted = ''\n      for (let i = 0; i < this.set.length; i++) {\n        if (i > 0) {\n          this.formatted += '||'\n        }\n        const comps = this.set[i]\n        for (let k = 0; k < comps.length; k++) {\n          if (k > 0) {\n            this.formatted += ' '\n          }\n          this.formatted += comps[k].toString().trim()\n        }\n      }\n    }\n    return this.formatted\n  }\n\n  format () {\n    return this.range\n  }\n\n  toString () {\n    return this.range\n  }\n\n  parseRange (range) {\n    // memoize range parsing for performance.\n    // this is a very hot path, and fully deterministic.\n    const memoOpts =\n      (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |\n      (this.options.loose && FLAG_LOOSE)\n    const memoKey = memoOpts + ':' + range\n    const cached = cache.get(memoKey)\n    if (cached) {\n      return cached\n    }\n\n    const loose = this.options.loose\n    // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n    const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n    range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n    debug('hyphen replace', range)\n\n    // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n    range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n    debug('comparator trim', range)\n\n    // `~ 1.2.3` => `~1.2.3`\n    range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n    debug('tilde trim', range)\n\n    // `^ 1.2.3` => `^1.2.3`\n    range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n    debug('caret trim', range)\n\n    // At this point, the range is completely trimmed and\n    // ready to be split into comparators.\n\n    let rangeList = range\n      .split(' ')\n      .map(comp => parseComparator(comp, this.options))\n      .join(' ')\n      .split(/\\s+/)\n      // >=0.0.0 is equivalent to *\n      .map(comp => replaceGTE0(comp, this.options))\n\n    if (loose) {\n      // in loose mode, throw out any that are not valid comparators\n      rangeList = rangeList.filter(comp => {\n        debug('loose invalid filter', comp, this.options)\n        return !!comp.match(re[t.COMPARATORLOOSE])\n      })\n    }\n    debug('range list', rangeList)\n\n    // if any comparators are the null set, then replace with JUST null set\n    // if more than one comparator, remove any * comparators\n    // also, don't include the same comparator more than once\n    const rangeMap = new Map()\n    const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n    for (const comp of comparators) {\n      if (isNullSet(comp)) {\n        return [comp]\n      }\n      rangeMap.set(comp.value, comp)\n    }\n    if (rangeMap.size > 1 && rangeMap.has('')) {\n      rangeMap.delete('')\n    }\n\n    const result = [...rangeMap.values()]\n    cache.set(memoKey, result)\n    return result\n  }\n\n  intersects (range, options) {\n    if (!(range instanceof Range)) {\n      throw new TypeError('a Range is required')\n    }\n\n    return this.set.some((thisComparators) => {\n      return (\n        isSatisfiable(thisComparators, options) &&\n        range.set.some((rangeComparators) => {\n          return (\n            isSatisfiable(rangeComparators, options) &&\n            thisComparators.every((thisComparator) => {\n              return rangeComparators.every((rangeComparator) => {\n                return thisComparator.intersects(rangeComparator, options)\n              })\n            })\n          )\n        })\n      )\n    })\n  }\n\n  // if ANY of the sets match ALL of its comparators, then pass\n  test (version) {\n    if (!version) {\n      return false\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    for (let i = 0; i < this.set.length; i++) {\n      if (testSet(this.set[i], version, this.options)) {\n        return true\n      }\n    }\n    return false\n  }\n}\n\nmodule.exports = Range\n\nconst LRU = require('../internal/lrucache')\nconst cache = new LRU()\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n  safeRe: re,\n  t,\n  comparatorTrimReplace,\n  tildeTrimReplace,\n  caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n  let result = true\n  const remainingComparators = comparators.slice()\n  let testComparator = remainingComparators.pop()\n\n  while (result && remainingComparators.length) {\n    result = remainingComparators.every((otherComparator) => {\n      return testComparator.intersects(otherComparator, options)\n    })\n\n    testComparator = remainingComparators.pop()\n  }\n\n  return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n  debug('comp', comp, options)\n  comp = replaceCarets(comp, options)\n  debug('caret', comp)\n  comp = replaceTildes(comp, options)\n  debug('tildes', comp)\n  comp = replaceXRanges(comp, options)\n  debug('xrange', comp)\n  comp = replaceStars(comp, options)\n  debug('stars', comp)\n  return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceTilde(c, options))\n    .join(' ')\n}\n\nconst replaceTilde = (comp, options) => {\n  const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('tilde', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0 <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      // ~1.2 == >=1.2.0 <1.3.0-0\n      ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`\n    } else if (pr) {\n      debug('replaceTilde pr', pr)\n      ret = `>=${M}.${m}.${p}-${pr\n      } <${M}.${+m + 1}.0-0`\n    } else {\n      // ~1.2.3 == >=1.2.3 <1.3.0-0\n      ret = `>=${M}.${m}.${p\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('tilde return', ret)\n    return ret\n  })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceCaret(c, options))\n    .join(' ')\n}\n\nconst replaceCaret = (comp, options) => {\n  debug('caret', comp, options)\n  const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n  const z = options.includePrerelease ? '-0' : ''\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('caret', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      if (M === '0') {\n        ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n      } else {\n        ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n      }\n    } else if (pr) {\n      debug('replaceCaret pr', pr)\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p}-${pr\n        } <${+M + 1}.0.0-0`\n      }\n    } else {\n      debug('no pr')\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p\n        } <${+M + 1}.0.0-0`\n      }\n    }\n\n    debug('caret return', ret)\n    return ret\n  })\n}\n\nconst replaceXRanges = (comp, options) => {\n  debug('replaceXRanges', comp, options)\n  return comp\n    .split(/\\s+/)\n    .map((c) => replaceXRange(c, options))\n    .join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n  comp = comp.trim()\n  const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n  return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n    debug('xRange', comp, ret, gtlt, M, m, p, pr)\n    const xM = isX(M)\n    const xm = xM || isX(m)\n    const xp = xm || isX(p)\n    const anyX = xp\n\n    if (gtlt === '=' && anyX) {\n      gtlt = ''\n    }\n\n    // if we're including prereleases in the match, then we need\n    // to fix this to -0, the lowest possible prerelease value\n    pr = options.includePrerelease ? '-0' : ''\n\n    if (xM) {\n      if (gtlt === '>' || gtlt === '<') {\n        // nothing is allowed\n        ret = '<0.0.0-0'\n      } else {\n        // nothing is forbidden\n        ret = '*'\n      }\n    } else if (gtlt && anyX) {\n      // we know patch is an x, because we have any x at all.\n      // replace X with 0\n      if (xm) {\n        m = 0\n      }\n      p = 0\n\n      if (gtlt === '>') {\n        // >1 => >=2.0.0\n        // >1.2 => >=1.3.0\n        gtlt = '>='\n        if (xm) {\n          M = +M + 1\n          m = 0\n          p = 0\n        } else {\n          m = +m + 1\n          p = 0\n        }\n      } else if (gtlt === '<=') {\n        // <=0.7.x is actually <0.8.0, since any 0.7.x should\n        // pass.  Similarly, <=7.x is actually <8.0.0, etc.\n        gtlt = '<'\n        if (xm) {\n          M = +M + 1\n        } else {\n          m = +m + 1\n        }\n      }\n\n      if (gtlt === '<') {\n        pr = '-0'\n      }\n\n      ret = `${gtlt + M}.${m}.${p}${pr}`\n    } else if (xm) {\n      ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n    } else if (xp) {\n      ret = `>=${M}.${m}.0${pr\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('xRange return', ret)\n\n    return ret\n  })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n  debug('replaceStars', comp, options)\n  // Looseness is ignored here.  star is always as loose as it gets!\n  return comp\n    .trim()\n    .replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n  debug('replaceGTE0', comp, options)\n  return comp\n    .trim()\n    .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\n// TODO build?\nconst hyphenReplace = incPr => ($0,\n  from, fM, fm, fp, fpr, fb,\n  to, tM, tm, tp, tpr) => {\n  if (isX(fM)) {\n    from = ''\n  } else if (isX(fm)) {\n    from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n  } else if (isX(fp)) {\n    from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n  } else if (fpr) {\n    from = `>=${from}`\n  } else {\n    from = `>=${from}${incPr ? '-0' : ''}`\n  }\n\n  if (isX(tM)) {\n    to = ''\n  } else if (isX(tm)) {\n    to = `<${+tM + 1}.0.0-0`\n  } else if (isX(tp)) {\n    to = `<${tM}.${+tm + 1}.0-0`\n  } else if (tpr) {\n    to = `<=${tM}.${tm}.${tp}-${tpr}`\n  } else if (incPr) {\n    to = `<${tM}.${tm}.${+tp + 1}-0`\n  } else {\n    to = `<=${to}`\n  }\n\n  return `${from} ${to}`.trim()\n}\n\nconst testSet = (set, version, options) => {\n  for (let i = 0; i < set.length; i++) {\n    if (!set[i].test(version)) {\n      return false\n    }\n  }\n\n  if (version.prerelease.length && !options.includePrerelease) {\n    // Find the set of versions that are allowed to have prereleases\n    // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n    // That should allow `1.2.3-pr.2` to pass.\n    // However, `1.2.4-alpha.notready` should NOT be allowed,\n    // even though it's within the range set by the comparators.\n    for (let i = 0; i < set.length; i++) {\n      debug(set[i].semver)\n      if (set[i].semver === Comparator.ANY) {\n        continue\n      }\n\n      if (set[i].semver.prerelease.length > 0) {\n        const allowed = set[i].semver\n        if (allowed.major === version.major &&\n            allowed.minor === version.minor &&\n            allowed.patch === version.patch) {\n          return true\n        }\n      }\n    }\n\n    // Version has a -pre, but it's not one of the ones we like.\n    return false\n  }\n\n  return true\n}\n"],"names":["SPACE_CHARACTERS","Range","range","options","parseOptions","Comparator","r","c","first","isNullSet","isAny","i","comps","k","memoKey","FLAG_INCLUDE_PRERELEASE","FLAG_LOOSE","cached","cache","loose","hr","re","t","hyphenReplace","debug","comparatorTrimReplace","tildeTrimReplace","caretTrimReplace","rangeList","comp","parseComparator","replaceGTE0","rangeMap","comparators","result","thisComparators","isSatisfiable","rangeComparators","thisComparator","rangeComparator","version","SemVer","testSet","LRU","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","remainingComparators","testComparator","otherComparator","replaceCarets","replaceTildes","replaceXRanges","replaceStars","isX","id","replaceTilde","_","M","m","p","pr","ret","replaceCaret","z","replaceXRange","gtlt","xM","xm","xp","anyX","incPr","$0","from","fM","fm","fp","fpr","fb","to","tM","tm","tp","tpr","set","allowed"],"mappings":";;;;;;;;;;;AAEA,QAAMA,IAAmB;AAAA,EAGzB,MAAMC,EAAM;AAAA,IACV,YAAaC,GAAOC,GAAS;AAG3B,UAFAA,IAAUC,EAAaD,CAAO,GAE1BD,aAAiBD;AACnB,eACEC,EAAM,UAAU,CAAC,CAACC,EAAQ,SAC1BD,EAAM,sBAAsB,CAAC,CAACC,EAAQ,oBAE/BD,IAEA,IAAID,EAAMC,EAAM,KAAKC,CAAO;AAIvC,UAAID,aAAiBG;AAEnB,oBAAK,MAAMH,EAAM,OACjB,KAAK,MAAM,CAAC,CAACA,CAAK,CAAC,GACnB,KAAK,YAAY,QACV;AAsBT,UAnBA,KAAK,UAAUC,GACf,KAAK,QAAQ,CAAC,CAACA,EAAQ,OACvB,KAAK,oBAAoB,CAAC,CAACA,EAAQ,mBAKnC,KAAK,MAAMD,EAAM,KAAI,EAAG,QAAQF,GAAkB,GAAG,GAGrD,KAAK,MAAM,KAAK,IACb,MAAM,IAAI,EAEV,IAAI,CAAAM,MAAK,KAAK,WAAWA,EAAE,KAAI,CAAE,CAAC,EAIlC,OAAO,CAAAC,MAAKA,EAAE,MAAM,GAEnB,CAAC,KAAK,IAAI;AACZ,cAAM,IAAI,UAAU,yBAAyB,KAAK,GAAG,EAAE;AAIzD,UAAI,KAAK,IAAI,SAAS,GAAG;AAEvB,cAAMC,IAAQ,KAAK,IAAI,CAAC;AAExB,YADA,KAAK,MAAM,KAAK,IAAI,OAAO,CAAAD,MAAK,CAACE,EAAUF,EAAE,CAAC,CAAC,CAAC,GAC5C,KAAK,IAAI,WAAW;AACtB,eAAK,MAAM,CAACC,CAAK;AAAA,iBACR,KAAK,IAAI,SAAS;AAE3B,qBAAWD,KAAK,KAAK;AACnB,gBAAIA,EAAE,WAAW,KAAKG,EAAMH,EAAE,CAAC,CAAC,GAAG;AACjC,mBAAK,MAAM,CAACA,CAAC;AACb;AAAA,YACZ;AAAA;AAAA,MAGA;AAEI,WAAK,YAAY;AAAA,IACrB;AAAA,IAEE,IAAI,QAAS;AACX,UAAI,KAAK,cAAc,QAAW;AAChC,aAAK,YAAY;AACjB,iBAASI,IAAI,GAAGA,IAAI,KAAK,IAAI,QAAQA,KAAK;AACxC,UAAIA,IAAI,MACN,KAAK,aAAa;AAEpB,gBAAMC,IAAQ,KAAK,IAAID,CAAC;AACxB,mBAASE,IAAI,GAAGA,IAAID,EAAM,QAAQC;AAChC,YAAIA,IAAI,MACN,KAAK,aAAa,MAEpB,KAAK,aAAaD,EAAMC,CAAC,EAAE,SAAQ,EAAG,KAAI;AAAA,QAEpD;AAAA,MACA;AACI,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,SAAU;AACR,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,WAAY;AACV,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,WAAYX,GAAO;AAMjB,YAAMY,MAFH,KAAK,QAAQ,qBAAqBC,MAClC,KAAK,QAAQ,SAASC,MACE,MAAMd,GAC3Be,IAASC,EAAM,IAAIJ,CAAO;AAChC,UAAIG;AACF,eAAOA;AAGT,YAAME,IAAQ,KAAK,QAAQ,OAErBC,IAAKD,IAAQE,EAAGC,EAAE,gBAAgB,IAAID,EAAGC,EAAE,WAAW;AAC5D,MAAApB,IAAQA,EAAM,QAAQkB,GAAIG,EAAc,KAAK,QAAQ,iBAAiB,CAAC,GACvEC,EAAM,kBAAkBtB,CAAK,GAG7BA,IAAQA,EAAM,QAAQmB,EAAGC,EAAE,cAAc,GAAGG,CAAqB,GACjED,EAAM,mBAAmBtB,CAAK,GAG9BA,IAAQA,EAAM,QAAQmB,EAAGC,EAAE,SAAS,GAAGI,CAAgB,GACvDF,EAAM,cAActB,CAAK,GAGzBA,IAAQA,EAAM,QAAQmB,EAAGC,EAAE,SAAS,GAAGK,CAAgB,GACvDH,EAAM,cAActB,CAAK;AAKzB,UAAI0B,IAAY1B,EACb,MAAM,GAAG,EACT,IAAI,CAAA2B,MAAQC,EAAgBD,GAAM,KAAK,OAAO,CAAC,EAC/C,KAAK,GAAG,EACR,MAAM,KAAK,EAEX,IAAI,CAAAA,MAAQE,EAAYF,GAAM,KAAK,OAAO,CAAC;AAE9C,MAAIV,MAEFS,IAAYA,EAAU,OAAO,CAAAC,OAC3BL,EAAM,wBAAwBK,GAAM,KAAK,OAAO,GACzC,CAAC,CAACA,EAAK,MAAMR,EAAGC,EAAE,eAAe,CAAC,EAC1C,IAEHE,EAAM,cAAcI,CAAS;AAK7B,YAAMI,IAAW,oBAAI,IAAG,GAClBC,IAAcL,EAAU,IAAI,CAAAC,MAAQ,IAAIxB,EAAWwB,GAAM,KAAK,OAAO,CAAC;AAC5E,iBAAWA,KAAQI,GAAa;AAC9B,YAAIxB,EAAUoB,CAAI;AAChB,iBAAO,CAACA,CAAI;AAEd,QAAAG,EAAS,IAAIH,EAAK,OAAOA,CAAI;AAAA,MACnC;AACI,MAAIG,EAAS,OAAO,KAAKA,EAAS,IAAI,EAAE,KACtCA,EAAS,OAAO,EAAE;AAGpB,YAAME,IAAS,CAAC,GAAGF,EAAS,OAAM,CAAE;AACpC,aAAAd,EAAM,IAAIJ,GAASoB,CAAM,GAClBA;AAAA,IACX;AAAA,IAEE,WAAYhC,GAAOC,GAAS;AAC1B,UAAI,EAAED,aAAiBD;AACrB,cAAM,IAAI,UAAU,qBAAqB;AAG3C,aAAO,KAAK,IAAI,KAAK,CAACkC,MAElBC,EAAcD,GAAiBhC,CAAO,KACtCD,EAAM,IAAI,KAAK,CAACmC,MAEZD,EAAcC,GAAkBlC,CAAO,KACvCgC,EAAgB,MAAM,CAACG,MACdD,EAAiB,MAAM,CAACE,MACtBD,EAAe,WAAWC,GAAiBpC,CAAO,CAC1D,CACF,CAEJ,CAEJ;AAAA,IACL;AAAA;AAAA,IAGE,KAAMqC,GAAS;AACb,UAAI,CAACA;AACH,eAAO;AAGT,UAAI,OAAOA,KAAY;AACrB,YAAI;AACF,UAAAA,IAAU,IAAIC,EAAOD,GAAS,KAAK,OAAO;AAAA,QAClD,QAAmB;AACX,iBAAO;AAAA,QACf;AAGI,eAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ;AACnC,YAAIE,EAAQ,KAAK,IAAI,CAAC,GAAGF,GAAS,KAAK,OAAO;AAC5C,iBAAO;AAGX,aAAO;AAAA,IACX;AAAA,EACA;AAEA,EAAAtC,IAAiBD;AAEjB,QAAM0C,IAAMC,EAAA,GACN1B,IAAQ,IAAIyB,EAAG,GAEfvC,IAAeyC,EAAA,GACfxC,IAAayC,EAAA,GACbtB,IAAQuB,EAAA,GACRN,IAASO,EAAA,GACT;AAAA,IACJ,QAAQ3B;AAAA,IACR,GAAAC;AAAA,IACA,uBAAAG;AAAA,IACA,kBAAAC;AAAA,IACA,kBAAAC;AAAA,EACF,IAAIsB,EAAA,GACE,EAAE,yBAAAlC,GAAyB,YAAAC,EAAU,IAAKkC,EAAA,GAE1CzC,IAAY,CAAAF,MAAKA,EAAE,UAAU,YAC7BG,IAAQ,CAAAH,MAAKA,EAAE,UAAU,IAIzB6B,IAAgB,CAACH,GAAa9B,MAAY;AAC9C,QAAI+B,IAAS;AACb,UAAMiB,IAAuBlB,EAAY,MAAK;AAC9C,QAAImB,IAAiBD,EAAqB,IAAG;AAE7C,WAAOjB,KAAUiB,EAAqB;AACpC,MAAAjB,IAASiB,EAAqB,MAAM,CAACE,MAC5BD,EAAe,WAAWC,GAAiBlD,CAAO,CAC1D,GAEDiD,IAAiBD,EAAqB,IAAG;AAG3C,WAAOjB;AAAA,EACT,GAKMJ,IAAkB,CAACD,GAAM1B,OAC7BqB,EAAM,QAAQK,GAAM1B,CAAO,GAC3B0B,IAAOyB,EAAczB,GAAM1B,CAAO,GAClCqB,EAAM,SAASK,CAAI,GACnBA,IAAO0B,EAAc1B,GAAM1B,CAAO,GAClCqB,EAAM,UAAUK,CAAI,GACpBA,IAAO2B,EAAe3B,GAAM1B,CAAO,GACnCqB,EAAM,UAAUK,CAAI,GACpBA,IAAO4B,EAAa5B,GAAM1B,CAAO,GACjCqB,EAAM,SAASK,CAAI,GACZA,IAGH6B,IAAM,CAAAC,MAAM,CAACA,KAAMA,EAAG,YAAW,MAAO,OAAOA,MAAO,KAStDJ,IAAgB,CAAC1B,GAAM1B,MACpB0B,EACJ,KAAI,EACJ,MAAM,KAAK,EACX,IAAI,CAACtB,MAAMqD,EAAarD,GAAGJ,CAAO,CAAC,EACnC,KAAK,GAAG,GAGPyD,IAAe,CAAC/B,GAAM1B,MAAY;AACtC,UAAMG,IAAIH,EAAQ,QAAQkB,EAAGC,EAAE,UAAU,IAAID,EAAGC,EAAE,KAAK;AACvD,WAAOO,EAAK,QAAQvB,GAAG,CAACuD,GAAGC,GAAGC,GAAGC,GAAGC,MAAO;AACzC,MAAAzC,EAAM,SAASK,GAAMgC,GAAGC,GAAGC,GAAGC,GAAGC,CAAE;AACnC,UAAIC;AAEJ,aAAIR,EAAII,CAAC,IACPI,IAAM,KACGR,EAAIK,CAAC,IACdG,IAAM,KAAKJ,CAAC,SAAS,CAACA,IAAI,CAAC,WAClBJ,EAAIM,CAAC,IAEdE,IAAM,KAAKJ,CAAC,IAAIC,CAAC,OAAOD,CAAC,IAAI,CAACC,IAAI,CAAC,SAC1BE,KACTzC,EAAM,mBAAmByC,CAAE,GAC3BC,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,MACrBH,CAAC,IAAI,CAACC,IAAI,CAAC,UAGhBG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,MAChBF,CAAC,IAAI,CAACC,IAAI,CAAC,QAGlBvC,EAAM,gBAAgB0C,CAAG,GAClBA;AAAA,IACX,CAAG;AAAA,EACH,GAUMZ,IAAgB,CAACzB,GAAM1B,MACpB0B,EACJ,KAAI,EACJ,MAAM,KAAK,EACX,IAAI,CAACtB,MAAM4D,EAAa5D,GAAGJ,CAAO,CAAC,EACnC,KAAK,GAAG,GAGPgE,IAAe,CAACtC,GAAM1B,MAAY;AACtC,IAAAqB,EAAM,SAASK,GAAM1B,CAAO;AAC5B,UAAMG,IAAIH,EAAQ,QAAQkB,EAAGC,EAAE,UAAU,IAAID,EAAGC,EAAE,KAAK,GACjD8C,IAAIjE,EAAQ,oBAAoB,OAAO;AAC7C,WAAO0B,EAAK,QAAQvB,GAAG,CAACuD,GAAGC,GAAGC,GAAGC,GAAGC,MAAO;AACzC,MAAAzC,EAAM,SAASK,GAAMgC,GAAGC,GAAGC,GAAGC,GAAGC,CAAE;AACnC,UAAIC;AAEJ,aAAIR,EAAII,CAAC,IACPI,IAAM,KACGR,EAAIK,CAAC,IACdG,IAAM,KAAKJ,CAAC,OAAOM,CAAC,KAAK,CAACN,IAAI,CAAC,WACtBJ,EAAIM,CAAC,IACVF,MAAM,MACRI,IAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKK,CAAC,KAAKN,CAAC,IAAI,CAACC,IAAI,CAAC,SAEvCG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKK,CAAC,KAAK,CAACN,IAAI,CAAC,WAE3BG,KACTzC,EAAM,mBAAmByC,CAAE,GACvBH,MAAM,MACJC,MAAM,MACRG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CACpC,KAAeH,CAAC,IAAIC,CAAC,IAAI,CAACC,IAAI,CAAC,OAErBE,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,MACrBH,CAAC,IAAI,CAACC,IAAI,CAAC,SAGlBG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CAClC,KAAa,CAACH,IAAI,CAAC,aAGbtC,EAAM,OAAO,GACTsC,MAAM,MACJC,MAAM,MACRG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC/B,GAAaI,CAAC,KAAKN,CAAC,IAAIC,CAAC,IAAI,CAACC,IAAI,CAAC,OAEzBE,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC/B,GAAaI,CAAC,KAAKN,CAAC,IAAI,CAACC,IAAI,CAAC,SAGtBG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC7B,KAAa,CAACF,IAAI,CAAC,WAIftC,EAAM,gBAAgB0C,CAAG,GAClBA;AAAA,IACX,CAAG;AAAA,EACH,GAEMV,IAAiB,CAAC3B,GAAM1B,OAC5BqB,EAAM,kBAAkBK,GAAM1B,CAAO,GAC9B0B,EACJ,MAAM,KAAK,EACX,IAAI,CAACtB,MAAM8D,EAAc9D,GAAGJ,CAAO,CAAC,EACpC,KAAK,GAAG,IAGPkE,IAAgB,CAACxC,GAAM1B,MAAY;AACvC,IAAA0B,IAAOA,EAAK,KAAI;AAChB,UAAMvB,IAAIH,EAAQ,QAAQkB,EAAGC,EAAE,WAAW,IAAID,EAAGC,EAAE,MAAM;AACzD,WAAOO,EAAK,QAAQvB,GAAG,CAAC4D,GAAKI,GAAMR,GAAGC,GAAGC,GAAGC,MAAO;AACjD,MAAAzC,EAAM,UAAUK,GAAMqC,GAAKI,GAAMR,GAAGC,GAAGC,GAAGC,CAAE;AAC5C,YAAMM,IAAKb,EAAII,CAAC,GACVU,IAAKD,KAAMb,EAAIK,CAAC,GAChBU,IAAKD,KAAMd,EAAIM,CAAC,GAChBU,IAAOD;AAEb,aAAIH,MAAS,OAAOI,MAClBJ,IAAO,KAKTL,IAAK9D,EAAQ,oBAAoB,OAAO,IAEpCoE,IACED,MAAS,OAAOA,MAAS,MAE3BJ,IAAM,aAGNA,IAAM,MAECI,KAAQI,KAGbF,MACFT,IAAI,IAENC,IAAI,GAEAM,MAAS,OAGXA,IAAO,MACHE,KACFV,IAAI,CAACA,IAAI,GACTC,IAAI,GACJC,IAAI,MAEJD,IAAI,CAACA,IAAI,GACTC,IAAI,MAEGM,MAAS,SAGlBA,IAAO,KACHE,IACFV,IAAI,CAACA,IAAI,IAETC,IAAI,CAACA,IAAI,IAITO,MAAS,QACXL,IAAK,OAGPC,IAAM,GAAGI,IAAOR,CAAC,IAAIC,CAAC,IAAIC,CAAC,GAAGC,CAAE,MACvBO,IACTN,IAAM,KAAKJ,CAAC,OAAOG,CAAE,KAAK,CAACH,IAAI,CAAC,WACvBW,MACTP,IAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKE,MACjBH,CAAC,IAAI,CAACC,IAAI,CAAC,SAGlBvC,EAAM,iBAAiB0C,CAAG,GAEnBA;AAAA,IACX,CAAG;AAAA,EACH,GAIMT,IAAe,CAAC5B,GAAM1B,OAC1BqB,EAAM,gBAAgBK,GAAM1B,CAAO,GAE5B0B,EACJ,KAAI,EACJ,QAAQR,EAAGC,EAAE,IAAI,GAAG,EAAE,IAGrBS,IAAc,CAACF,GAAM1B,OACzBqB,EAAM,eAAeK,GAAM1B,CAAO,GAC3B0B,EACJ,KAAI,EACJ,QAAQR,EAAGlB,EAAQ,oBAAoBmB,EAAE,UAAUA,EAAE,IAAI,GAAG,EAAE,IAS7DC,IAAgB,CAAAoD,MAAS,CAACC,GAC9BC,GAAMC,GAAIC,GAAIC,GAAIC,GAAKC,GACvBC,GAAIC,GAAIC,GAAIC,GAAIC,OACZ7B,EAAIoB,CAAE,IACRD,IAAO,KACEnB,EAAIqB,CAAE,IACfF,IAAO,KAAKC,CAAE,OAAOH,IAAQ,OAAO,EAAE,KAC7BjB,EAAIsB,CAAE,IACfH,IAAO,KAAKC,CAAE,IAAIC,CAAE,KAAKJ,IAAQ,OAAO,EAAE,KACjCM,IACTJ,IAAO,KAAKA,CAAI,KAEhBA,IAAO,KAAKA,CAAI,GAAGF,IAAQ,OAAO,EAAE,IAGlCjB,EAAI0B,CAAE,IACRD,IAAK,KACIzB,EAAI2B,CAAE,IACfF,IAAK,IAAI,CAACC,IAAK,CAAC,WACP1B,EAAI4B,CAAE,IACfH,IAAK,IAAIC,CAAE,IAAI,CAACC,IAAK,CAAC,SACbE,IACTJ,IAAK,KAAKC,CAAE,IAAIC,CAAE,IAAIC,CAAE,IAAIC,CAAG,KACtBZ,IACTQ,IAAK,IAAIC,CAAE,IAAIC,CAAE,IAAI,CAACC,IAAK,CAAC,OAE5BH,IAAK,KAAKA,CAAE,IAGP,GAAGN,CAAI,IAAIM,CAAE,GAAG,KAAI,IAGvBzC,IAAU,CAAC8C,GAAKhD,GAASrC,MAAY;AACzC,aAASQ,IAAI,GAAGA,IAAI6E,EAAI,QAAQ7E;AAC9B,UAAI,CAAC6E,EAAI7E,CAAC,EAAE,KAAK6B,CAAO;AACtB,eAAO;AAIX,QAAIA,EAAQ,WAAW,UAAU,CAACrC,EAAQ,mBAAmB;AAM3D,eAASQ,IAAI,GAAGA,IAAI6E,EAAI,QAAQ7E;AAE9B,YADAa,EAAMgE,EAAI7E,CAAC,EAAE,MAAM,GACf6E,EAAI7E,CAAC,EAAE,WAAWN,EAAW,OAI7BmF,EAAI7E,CAAC,EAAE,OAAO,WAAW,SAAS,GAAG;AACvC,gBAAM8E,IAAUD,EAAI7E,CAAC,EAAE;AACvB,cAAI8E,EAAQ,UAAUjD,EAAQ,SAC1BiD,EAAQ,UAAUjD,EAAQ,SAC1BiD,EAAQ,UAAUjD,EAAQ;AAC5B,mBAAO;AAAA,QAEjB;AAII,aAAO;AAAA,IACX;AAEE,WAAO;AAAA,EACT;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/semver.js.map

@@ -1 +1 @@
-{"version":3,"file":"semver.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/semver.js"],"sourcesContent":["'use strict'\n\nconst debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n  constructor (version, options) {\n    options = parseOptions(options)\n\n    if (version instanceof SemVer) {\n      if (version.loose === !!options.loose &&\n        version.includePrerelease === !!options.includePrerelease) {\n        return version\n      } else {\n        version = version.version\n      }\n    } else if (typeof version !== 'string') {\n      throw new TypeError(`Invalid version. Must be a string. Got type \"${typeof version}\".`)\n    }\n\n    if (version.length > MAX_LENGTH) {\n      throw new TypeError(\n        `version is longer than ${MAX_LENGTH} characters`\n      )\n    }\n\n    debug('SemVer', version, options)\n    this.options = options\n    this.loose = !!options.loose\n    // this isn't actually relevant for versions, but keep it so that we\n    // don't run into trouble passing this.options around.\n    this.includePrerelease = !!options.includePrerelease\n\n    const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n    if (!m) {\n      throw new TypeError(`Invalid Version: ${version}`)\n    }\n\n    this.raw = version\n\n    // these are actually numbers\n    this.major = +m[1]\n    this.minor = +m[2]\n    this.patch = +m[3]\n\n    if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n      throw new TypeError('Invalid major version')\n    }\n\n    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n      throw new TypeError('Invalid minor version')\n    }\n\n    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n      throw new TypeError('Invalid patch version')\n    }\n\n    // numberify any prerelease numeric ids\n    if (!m[4]) {\n      this.prerelease = []\n    } else {\n      this.prerelease = m[4].split('.').map((id) => {\n        if (/^[0-9]+$/.test(id)) {\n          const num = +id\n          if (num >= 0 && num < MAX_SAFE_INTEGER) {\n            return num\n          }\n        }\n        return id\n      })\n    }\n\n    this.build = m[5] ? m[5].split('.') : []\n    this.format()\n  }\n\n  format () {\n    this.version = `${this.major}.${this.minor}.${this.patch}`\n    if (this.prerelease.length) {\n      this.version += `-${this.prerelease.join('.')}`\n    }\n    return this.version\n  }\n\n  toString () {\n    return this.version\n  }\n\n  compare (other) {\n    debug('SemVer.compare', this.version, this.options, other)\n    if (!(other instanceof SemVer)) {\n      if (typeof other === 'string' && other === this.version) {\n        return 0\n      }\n      other = new SemVer(other, this.options)\n    }\n\n    if (other.version === this.version) {\n      return 0\n    }\n\n    return this.compareMain(other) || this.comparePre(other)\n  }\n\n  compareMain (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    return (\n      compareIdentifiers(this.major, other.major) ||\n      compareIdentifiers(this.minor, other.minor) ||\n      compareIdentifiers(this.patch, other.patch)\n    )\n  }\n\n  comparePre (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    // NOT having a prerelease is > having one\n    if (this.prerelease.length && !other.prerelease.length) {\n      return -1\n    } else if (!this.prerelease.length && other.prerelease.length) {\n      return 1\n    } else if (!this.prerelease.length && !other.prerelease.length) {\n      return 0\n    }\n\n    let i = 0\n    do {\n      const a = this.prerelease[i]\n      const b = other.prerelease[i]\n      debug('prerelease compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  compareBuild (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    let i = 0\n    do {\n      const a = this.build[i]\n      const b = other.build[i]\n      debug('build compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  // preminor will bump the version up to the next minor release, and immediately\n  // down to pre-release. premajor and prepatch work the same way.\n  inc (release, identifier, identifierBase) {\n    if (release.startsWith('pre')) {\n      if (!identifier && identifierBase === false) {\n        throw new Error('invalid increment argument: identifier is empty')\n      }\n      // Avoid an invalid semver results\n      if (identifier) {\n        const match = `-${identifier}`.match(this.options.loose ? re[t.PRERELEASELOOSE] : re[t.PRERELEASE])\n        if (!match || match[1] !== identifier) {\n          throw new Error(`invalid identifier: ${identifier}`)\n        }\n      }\n    }\n\n    switch (release) {\n      case 'premajor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor = 0\n        this.major++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'preminor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'prepatch':\n        // If this is already a prerelease, it will bump to the next version\n        // drop any prereleases that might already exist, since they are not\n        // relevant at this point.\n        this.prerelease.length = 0\n        this.inc('patch', identifier, identifierBase)\n        this.inc('pre', identifier, identifierBase)\n        break\n      // If the input is a non-prerelease version, this acts the same as\n      // prepatch.\n      case 'prerelease':\n        if (this.prerelease.length === 0) {\n          this.inc('patch', identifier, identifierBase)\n        }\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'release':\n        if (this.prerelease.length === 0) {\n          throw new Error(`version ${this.raw} is not a prerelease`)\n        }\n        this.prerelease.length = 0\n        break\n\n      case 'major':\n        // If this is a pre-major version, bump up to the same major version.\n        // Otherwise increment major.\n        // 1.0.0-5 bumps to 1.0.0\n        // 1.1.0 bumps to 2.0.0\n        if (\n          this.minor !== 0 ||\n          this.patch !== 0 ||\n          this.prerelease.length === 0\n        ) {\n          this.major++\n        }\n        this.minor = 0\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'minor':\n        // If this is a pre-minor version, bump up to the same minor version.\n        // Otherwise increment minor.\n        // 1.2.0-5 bumps to 1.2.0\n        // 1.2.1 bumps to 1.3.0\n        if (this.patch !== 0 || this.prerelease.length === 0) {\n          this.minor++\n        }\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'patch':\n        // If this is not a pre-release version, it will increment the patch.\n        // If it is a pre-release it will bump up to the same patch version.\n        // 1.2.0-5 patches to 1.2.0\n        // 1.2.0 patches to 1.2.1\n        if (this.prerelease.length === 0) {\n          this.patch++\n        }\n        this.prerelease = []\n        break\n      // This probably shouldn't be used publicly.\n      // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n      case 'pre': {\n        const base = Number(identifierBase) ? 1 : 0\n\n        if (this.prerelease.length === 0) {\n          this.prerelease = [base]\n        } else {\n          let i = this.prerelease.length\n          while (--i >= 0) {\n            if (typeof this.prerelease[i] === 'number') {\n              this.prerelease[i]++\n              i = -2\n            }\n          }\n          if (i === -1) {\n            // didn't increment anything\n            if (identifier === this.prerelease.join('.') && identifierBase === false) {\n              throw new Error('invalid increment argument: identifier already exists')\n            }\n            this.prerelease.push(base)\n          }\n        }\n        if (identifier) {\n          // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n          // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n          let prerelease = [identifier, base]\n          if (identifierBase === false) {\n            prerelease = [identifier]\n          }\n          if (compareIdentifiers(this.prerelease[0], identifier) === 0) {\n            if (isNaN(this.prerelease[1])) {\n              this.prerelease = prerelease\n            }\n          } else {\n            this.prerelease = prerelease\n          }\n        }\n        break\n      }\n      default:\n        throw new Error(`invalid increment argument: ${release}`)\n    }\n    this.raw = this.format()\n    if (this.build.length) {\n      this.raw += `+${this.build.join('.')}`\n    }\n    return this\n  }\n}\n\nmodule.exports = SemVer\n"],"names":["debug","require$$0","MAX_LENGTH","MAX_SAFE_INTEGER","require$$1","re","t","require$$2","parseOptions","require$$3","compareIdentifiers","require$$4","SemVer","version","options","m","id","num","other","i","a","b","release","identifier","identifierBase","match","base","prerelease","semver"],"mappings":";;;;;;;;;AAEA,QAAMA,IAAQC,EAAA,GACR,EAAE,YAAAC,GAAY,kBAAAC,EAAgB,IAAKC,EAAA,GACnC,EAAE,QAAQC,GAAI,GAAAC,EAAG,IAAGC,EAAA,GAEpBC,IAAeC,EAAA,GACf,EAAE,oBAAAC,EAAkB,IAAKC,EAAA;AAAA,EAC/B,MAAMC,EAAO;AAAA,IACX,YAAaC,GAASC,GAAS;AAG7B,UAFAA,IAAUN,EAAaM,CAAO,GAE1BD,aAAmBD,GAAQ;AAC7B,YAAIC,EAAQ,UAAU,CAAC,CAACC,EAAQ,SAC9BD,EAAQ,sBAAsB,CAAC,CAACC,EAAQ;AACxC,iBAAOD;AAEP,QAAAA,IAAUA,EAAQ;AAAA,MAE1B,WAAe,OAAOA,KAAY;AAC5B,cAAM,IAAI,UAAU,gDAAgD,OAAOA,CAAO,IAAI;AAGxF,UAAIA,EAAQ,SAASX;AACnB,cAAM,IAAI;AAAA,UACR,0BAA0BA,CAAU;AAAA,QAC5C;AAGI,MAAAF,EAAM,UAAUa,GAASC,CAAO,GAChC,KAAK,UAAUA,GACf,KAAK,QAAQ,CAAC,CAACA,EAAQ,OAGvB,KAAK,oBAAoB,CAAC,CAACA,EAAQ;AAEnC,YAAMC,IAAIF,EAAQ,KAAI,EAAG,MAAMC,EAAQ,QAAQT,EAAGC,EAAE,KAAK,IAAID,EAAGC,EAAE,IAAI,CAAC;AAEvE,UAAI,CAACS;AACH,cAAM,IAAI,UAAU,oBAAoBF,CAAO,EAAE;AAUnD,UAPA,KAAK,MAAMA,GAGX,KAAK,QAAQ,CAACE,EAAE,CAAC,GACjB,KAAK,QAAQ,CAACA,EAAE,CAAC,GACjB,KAAK,QAAQ,CAACA,EAAE,CAAC,GAEb,KAAK,QAAQZ,KAAoB,KAAK,QAAQ;AAChD,cAAM,IAAI,UAAU,uBAAuB;AAG7C,UAAI,KAAK,QAAQA,KAAoB,KAAK,QAAQ;AAChD,cAAM,IAAI,UAAU,uBAAuB;AAG7C,UAAI,KAAK,QAAQA,KAAoB,KAAK,QAAQ;AAChD,cAAM,IAAI,UAAU,uBAAuB;AAI7C,MAAKY,EAAE,CAAC,IAGN,KAAK,aAAaA,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,CAACC,MAAO;AAC5C,YAAI,WAAW,KAAKA,CAAE,GAAG;AACvB,gBAAMC,IAAM,CAACD;AACb,cAAIC,KAAO,KAAKA,IAAMd;AACpB,mBAAOc;AAAA,QAEnB;AACQ,eAAOD;AAAA,MACR,CAAA,IAVD,KAAK,aAAa,CAAA,GAapB,KAAK,QAAQD,EAAE,CAAC,IAAIA,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA,GACtC,KAAK,OAAM;AAAA,IACf;AAAA,IAEE,SAAU;AACR,kBAAK,UAAU,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,IACpD,KAAK,WAAW,WAClB,KAAK,WAAW,IAAI,KAAK,WAAW,KAAK,GAAG,CAAC,KAExC,KAAK;AAAA,IAChB;AAAA,IAEE,WAAY;AACV,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,QAASG,GAAO;AAEd,UADAlB,EAAM,kBAAkB,KAAK,SAAS,KAAK,SAASkB,CAAK,GACrD,EAAEA,aAAiBN,IAAS;AAC9B,YAAI,OAAOM,KAAU,YAAYA,MAAU,KAAK;AAC9C,iBAAO;AAET,QAAAA,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO;AAAA,MAC5C;AAEI,aAAIA,EAAM,YAAY,KAAK,UAClB,IAGF,KAAK,YAAYA,CAAK,KAAK,KAAK,WAAWA,CAAK;AAAA,IAC3D;AAAA,IAEE,YAAaA,GAAO;AAClB,aAAMA,aAAiBN,MACrBM,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO,IAItCR,EAAmB,KAAK,OAAOQ,EAAM,KAAK,KAC1CR,EAAmB,KAAK,OAAOQ,EAAM,KAAK,KAC1CR,EAAmB,KAAK,OAAOQ,EAAM,KAAK;AAAA,IAEhD;AAAA,IAEE,WAAYA,GAAO;AAMjB,UALMA,aAAiBN,MACrBM,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO,IAIpC,KAAK,WAAW,UAAU,CAACA,EAAM,WAAW;AAC9C,eAAO;AACF,UAAI,CAAC,KAAK,WAAW,UAAUA,EAAM,WAAW;AACrD,eAAO;AACF,UAAI,CAAC,KAAK,WAAW,UAAU,CAACA,EAAM,WAAW;AACtD,eAAO;AAGT,UAAIC,IAAI;AACR,SAAG;AACD,cAAMC,IAAI,KAAK,WAAWD,CAAC,GACrBE,IAAIH,EAAM,WAAWC,CAAC;AAE5B,YADAnB,EAAM,sBAAsBmB,GAAGC,GAAGC,CAAC,GAC/BD,MAAM,UAAaC,MAAM;AAC3B,iBAAO;AACF,YAAIA,MAAM;AACf,iBAAO;AACF,YAAID,MAAM;AACf,iBAAO;AACF,YAAIA,MAAMC;AACf;AAEA,eAAOX,EAAmBU,GAAGC,CAAC;AAAA,MAEjC,SAAQ,EAAEF;AAAA,IACf;AAAA,IAEE,aAAcD,GAAO;AACnB,MAAMA,aAAiBN,MACrBM,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO;AAGxC,UAAIC,IAAI;AACR,SAAG;AACD,cAAMC,IAAI,KAAK,MAAMD,CAAC,GAChBE,IAAIH,EAAM,MAAMC,CAAC;AAEvB,YADAnB,EAAM,iBAAiBmB,GAAGC,GAAGC,CAAC,GAC1BD,MAAM,UAAaC,MAAM;AAC3B,iBAAO;AACF,YAAIA,MAAM;AACf,iBAAO;AACF,YAAID,MAAM;AACf,iBAAO;AACF,YAAIA,MAAMC;AACf;AAEA,eAAOX,EAAmBU,GAAGC,CAAC;AAAA,MAEjC,SAAQ,EAAEF;AAAA,IACf;AAAA;AAAA;AAAA,IAIE,IAAKG,GAASC,GAAYC,GAAgB;AACxC,UAAIF,EAAQ,WAAW,KAAK,GAAG;AAC7B,YAAI,CAACC,KAAcC,MAAmB;AACpC,gBAAM,IAAI,MAAM,iDAAiD;AAGnE,YAAID,GAAY;AACd,gBAAME,IAAQ,IAAIF,CAAU,GAAG,MAAM,KAAK,QAAQ,QAAQlB,EAAGC,EAAE,eAAe,IAAID,EAAGC,EAAE,UAAU,CAAC;AAClG,cAAI,CAACmB,KAASA,EAAM,CAAC,MAAMF;AACzB,kBAAM,IAAI,MAAM,uBAAuBA,CAAU,EAAE;AAAA,QAE7D;AAAA,MACA;AAEI,cAAQD,GAAO;AAAA,QACb,KAAK;AACH,eAAK,WAAW,SAAS,GACzB,KAAK,QAAQ,GACb,KAAK,QAAQ,GACb,KAAK,SACL,KAAK,IAAI,OAAOC,GAAYC,CAAc;AAC1C;AAAA,QACF,KAAK;AACH,eAAK,WAAW,SAAS,GACzB,KAAK,QAAQ,GACb,KAAK,SACL,KAAK,IAAI,OAAOD,GAAYC,CAAc;AAC1C;AAAA,QACF,KAAK;AAIH,eAAK,WAAW,SAAS,GACzB,KAAK,IAAI,SAASD,GAAYC,CAAc,GAC5C,KAAK,IAAI,OAAOD,GAAYC,CAAc;AAC1C;AAAA;AAAA;AAAA,QAGF,KAAK;AACH,UAAI,KAAK,WAAW,WAAW,KAC7B,KAAK,IAAI,SAASD,GAAYC,CAAc,GAE9C,KAAK,IAAI,OAAOD,GAAYC,CAAc;AAC1C;AAAA,QACF,KAAK;AACH,cAAI,KAAK,WAAW,WAAW;AAC7B,kBAAM,IAAI,MAAM,WAAW,KAAK,GAAG,sBAAsB;AAE3D,eAAK,WAAW,SAAS;AACzB;AAAA,QAEF,KAAK;AAKH,WACE,KAAK,UAAU,KACf,KAAK,UAAU,KACf,KAAK,WAAW,WAAW,MAE3B,KAAK,SAEP,KAAK,QAAQ,GACb,KAAK,QAAQ,GACb,KAAK,aAAa,CAAA;AAClB;AAAA,QACF,KAAK;AAKH,WAAI,KAAK,UAAU,KAAK,KAAK,WAAW,WAAW,MACjD,KAAK,SAEP,KAAK,QAAQ,GACb,KAAK,aAAa,CAAA;AAClB;AAAA,QACF,KAAK;AAKH,UAAI,KAAK,WAAW,WAAW,KAC7B,KAAK,SAEP,KAAK,aAAa,CAAA;AAClB;AAAA;AAAA;AAAA,QAGF,KAAK,OAAO;AACV,gBAAME,IAAO,OAAOF,CAAc,IAAI,IAAI;AAE1C,cAAI,KAAK,WAAW,WAAW;AAC7B,iBAAK,aAAa,CAACE,CAAI;AAAA,eAClB;AACL,gBAAI,IAAI,KAAK,WAAW;AACxB,mBAAO,EAAE,KAAK;AACZ,cAAI,OAAO,KAAK,WAAW,CAAC,KAAM,aAChC,KAAK,WAAW,CAAC,KACjB,IAAI;AAGR,gBAAI,MAAM,IAAI;AAEZ,kBAAIH,MAAe,KAAK,WAAW,KAAK,GAAG,KAAKC,MAAmB;AACjE,sBAAM,IAAI,MAAM,uDAAuD;AAEzE,mBAAK,WAAW,KAAKE,CAAI;AAAA,YACrC;AAAA,UACA;AACQ,cAAIH,GAAY;AAGd,gBAAII,IAAa,CAACJ,GAAYG,CAAI;AAClC,YAAIF,MAAmB,OACrBG,IAAa,CAACJ,CAAU,IAEtBb,EAAmB,KAAK,WAAW,CAAC,GAAGa,CAAU,MAAM,IACrD,MAAM,KAAK,WAAW,CAAC,CAAC,MAC1B,KAAK,aAAaI,KAGpB,KAAK,aAAaA;AAAA,UAE9B;AACQ;AAAA,QACR;AAAA,QACM;AACE,gBAAM,IAAI,MAAM,+BAA+BL,CAAO,EAAE;AAAA,MAChE;AACI,kBAAK,MAAM,KAAK,OAAM,GAClB,KAAK,MAAM,WACb,KAAK,OAAO,IAAI,KAAK,MAAM,KAAK,GAAG,CAAC,KAE/B;AAAA,IACX;AAAA,EACA;AAEA,SAAAM,IAAiBhB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"semver.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/classes/semver.js"],"sourcesContent":["'use strict'\n\nconst debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n  constructor (version, options) {\n    options = parseOptions(options)\n\n    if (version instanceof SemVer) {\n      if (version.loose === !!options.loose &&\n        version.includePrerelease === !!options.includePrerelease) {\n        return version\n      } else {\n        version = version.version\n      }\n    } else if (typeof version !== 'string') {\n      throw new TypeError(`Invalid version. Must be a string. Got type \"${typeof version}\".`)\n    }\n\n    if (version.length > MAX_LENGTH) {\n      throw new TypeError(\n        `version is longer than ${MAX_LENGTH} characters`\n      )\n    }\n\n    debug('SemVer', version, options)\n    this.options = options\n    this.loose = !!options.loose\n    // this isn't actually relevant for versions, but keep it so that we\n    // don't run into trouble passing this.options around.\n    this.includePrerelease = !!options.includePrerelease\n\n    const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n    if (!m) {\n      throw new TypeError(`Invalid Version: ${version}`)\n    }\n\n    this.raw = version\n\n    // these are actually numbers\n    this.major = +m[1]\n    this.minor = +m[2]\n    this.patch = +m[3]\n\n    if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n      throw new TypeError('Invalid major version')\n    }\n\n    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n      throw new TypeError('Invalid minor version')\n    }\n\n    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n      throw new TypeError('Invalid patch version')\n    }\n\n    // numberify any prerelease numeric ids\n    if (!m[4]) {\n      this.prerelease = []\n    } else {\n      this.prerelease = m[4].split('.').map((id) => {\n        if (/^[0-9]+$/.test(id)) {\n          const num = +id\n          if (num >= 0 && num < MAX_SAFE_INTEGER) {\n            return num\n          }\n        }\n        return id\n      })\n    }\n\n    this.build = m[5] ? m[5].split('.') : []\n    this.format()\n  }\n\n  format () {\n    this.version = `${this.major}.${this.minor}.${this.patch}`\n    if (this.prerelease.length) {\n      this.version += `-${this.prerelease.join('.')}`\n    }\n    return this.version\n  }\n\n  toString () {\n    return this.version\n  }\n\n  compare (other) {\n    debug('SemVer.compare', this.version, this.options, other)\n    if (!(other instanceof SemVer)) {\n      if (typeof other === 'string' && other === this.version) {\n        return 0\n      }\n      other = new SemVer(other, this.options)\n    }\n\n    if (other.version === this.version) {\n      return 0\n    }\n\n    return this.compareMain(other) || this.comparePre(other)\n  }\n\n  compareMain (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    return (\n      compareIdentifiers(this.major, other.major) ||\n      compareIdentifiers(this.minor, other.minor) ||\n      compareIdentifiers(this.patch, other.patch)\n    )\n  }\n\n  comparePre (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    // NOT having a prerelease is > having one\n    if (this.prerelease.length && !other.prerelease.length) {\n      return -1\n    } else if (!this.prerelease.length && other.prerelease.length) {\n      return 1\n    } else if (!this.prerelease.length && !other.prerelease.length) {\n      return 0\n    }\n\n    let i = 0\n    do {\n      const a = this.prerelease[i]\n      const b = other.prerelease[i]\n      debug('prerelease compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  compareBuild (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    let i = 0\n    do {\n      const a = this.build[i]\n      const b = other.build[i]\n      debug('build compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  // preminor will bump the version up to the next minor release, and immediately\n  // down to pre-release. premajor and prepatch work the same way.\n  inc (release, identifier, identifierBase) {\n    if (release.startsWith('pre')) {\n      if (!identifier && identifierBase === false) {\n        throw new Error('invalid increment argument: identifier is empty')\n      }\n      // Avoid an invalid semver results\n      if (identifier) {\n        const match = `-${identifier}`.match(this.options.loose ? re[t.PRERELEASELOOSE] : re[t.PRERELEASE])\n        if (!match || match[1] !== identifier) {\n          throw new Error(`invalid identifier: ${identifier}`)\n        }\n      }\n    }\n\n    switch (release) {\n      case 'premajor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor = 0\n        this.major++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'preminor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'prepatch':\n        // If this is already a prerelease, it will bump to the next version\n        // drop any prereleases that might already exist, since they are not\n        // relevant at this point.\n        this.prerelease.length = 0\n        this.inc('patch', identifier, identifierBase)\n        this.inc('pre', identifier, identifierBase)\n        break\n      // If the input is a non-prerelease version, this acts the same as\n      // prepatch.\n      case 'prerelease':\n        if (this.prerelease.length === 0) {\n          this.inc('patch', identifier, identifierBase)\n        }\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'release':\n        if (this.prerelease.length === 0) {\n          throw new Error(`version ${this.raw} is not a prerelease`)\n        }\n        this.prerelease.length = 0\n        break\n\n      case 'major':\n        // If this is a pre-major version, bump up to the same major version.\n        // Otherwise increment major.\n        // 1.0.0-5 bumps to 1.0.0\n        // 1.1.0 bumps to 2.0.0\n        if (\n          this.minor !== 0 ||\n          this.patch !== 0 ||\n          this.prerelease.length === 0\n        ) {\n          this.major++\n        }\n        this.minor = 0\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'minor':\n        // If this is a pre-minor version, bump up to the same minor version.\n        // Otherwise increment minor.\n        // 1.2.0-5 bumps to 1.2.0\n        // 1.2.1 bumps to 1.3.0\n        if (this.patch !== 0 || this.prerelease.length === 0) {\n          this.minor++\n        }\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'patch':\n        // If this is not a pre-release version, it will increment the patch.\n        // If it is a pre-release it will bump up to the same patch version.\n        // 1.2.0-5 patches to 1.2.0\n        // 1.2.0 patches to 1.2.1\n        if (this.prerelease.length === 0) {\n          this.patch++\n        }\n        this.prerelease = []\n        break\n      // This probably shouldn't be used publicly.\n      // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n      case 'pre': {\n        const base = Number(identifierBase) ? 1 : 0\n\n        if (this.prerelease.length === 0) {\n          this.prerelease = [base]\n        } else {\n          let i = this.prerelease.length\n          while (--i >= 0) {\n            if (typeof this.prerelease[i] === 'number') {\n              this.prerelease[i]++\n              i = -2\n            }\n          }\n          if (i === -1) {\n            // didn't increment anything\n            if (identifier === this.prerelease.join('.') && identifierBase === false) {\n              throw new Error('invalid increment argument: identifier already exists')\n            }\n            this.prerelease.push(base)\n          }\n        }\n        if (identifier) {\n          // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n          // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n          let prerelease = [identifier, base]\n          if (identifierBase === false) {\n            prerelease = [identifier]\n          }\n          if (compareIdentifiers(this.prerelease[0], identifier) === 0) {\n            if (isNaN(this.prerelease[1])) {\n              this.prerelease = prerelease\n            }\n          } else {\n            this.prerelease = prerelease\n          }\n        }\n        break\n      }\n      default:\n        throw new Error(`invalid increment argument: ${release}`)\n    }\n    this.raw = this.format()\n    if (this.build.length) {\n      this.raw += `+${this.build.join('.')}`\n    }\n    return this\n  }\n}\n\nmodule.exports = SemVer\n"],"names":["debug","require$$0","MAX_LENGTH","MAX_SAFE_INTEGER","require$$1","re","t","require$$2","parseOptions","require$$3","compareIdentifiers","require$$4","SemVer","version","options","m","id","num","other","i","a","b","release","identifier","identifierBase","match","base","prerelease","semver"],"mappings":";;;;;;;;;AAEA,QAAMA,IAAQC,EAAA,GACR,EAAE,YAAAC,GAAY,kBAAAC,EAAgB,IAAKC,EAAA,GACnC,EAAE,QAAQC,GAAI,GAAAC,EAAC,IAAKC,EAAA,GAEpBC,IAAeC,EAAA,GACf,EAAE,oBAAAC,EAAkB,IAAKC,EAAA;AAAA,EAC/B,MAAMC,EAAO;AAAA,IACX,YAAaC,GAASC,GAAS;AAG7B,UAFAA,IAAUN,EAAaM,CAAO,GAE1BD,aAAmBD,GAAQ;AAC7B,YAAIC,EAAQ,UAAU,CAAC,CAACC,EAAQ,SAC9BD,EAAQ,sBAAsB,CAAC,CAACC,EAAQ;AACxC,iBAAOD;AAEP,QAAAA,IAAUA,EAAQ;AAAA,MAE1B,WAAe,OAAOA,KAAY;AAC5B,cAAM,IAAI,UAAU,gDAAgD,OAAOA,CAAO,IAAI;AAGxF,UAAIA,EAAQ,SAASX;AACnB,cAAM,IAAI;AAAA,UACR,0BAA0BA,CAAU;AAAA,QAC5C;AAGI,MAAAF,EAAM,UAAUa,GAASC,CAAO,GAChC,KAAK,UAAUA,GACf,KAAK,QAAQ,CAAC,CAACA,EAAQ,OAGvB,KAAK,oBAAoB,CAAC,CAACA,EAAQ;AAEnC,YAAMC,IAAIF,EAAQ,KAAI,EAAG,MAAMC,EAAQ,QAAQT,EAAGC,EAAE,KAAK,IAAID,EAAGC,EAAE,IAAI,CAAC;AAEvE,UAAI,CAACS;AACH,cAAM,IAAI,UAAU,oBAAoBF,CAAO,EAAE;AAUnD,UAPA,KAAK,MAAMA,GAGX,KAAK,QAAQ,CAACE,EAAE,CAAC,GACjB,KAAK,QAAQ,CAACA,EAAE,CAAC,GACjB,KAAK,QAAQ,CAACA,EAAE,CAAC,GAEb,KAAK,QAAQZ,KAAoB,KAAK,QAAQ;AAChD,cAAM,IAAI,UAAU,uBAAuB;AAG7C,UAAI,KAAK,QAAQA,KAAoB,KAAK,QAAQ;AAChD,cAAM,IAAI,UAAU,uBAAuB;AAG7C,UAAI,KAAK,QAAQA,KAAoB,KAAK,QAAQ;AAChD,cAAM,IAAI,UAAU,uBAAuB;AAI7C,MAAKY,EAAE,CAAC,IAGN,KAAK,aAAaA,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,CAACC,MAAO;AAC5C,YAAI,WAAW,KAAKA,CAAE,GAAG;AACvB,gBAAMC,IAAM,CAACD;AACb,cAAIC,KAAO,KAAKA,IAAMd;AACpB,mBAAOc;AAAA,QAEnB;AACQ,eAAOD;AAAA,MACf,CAAO,IAVD,KAAK,aAAa,CAAA,GAapB,KAAK,QAAQD,EAAE,CAAC,IAAIA,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA,GACtC,KAAK,OAAM;AAAA,IACf;AAAA,IAEE,SAAU;AACR,kBAAK,UAAU,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,IACpD,KAAK,WAAW,WAClB,KAAK,WAAW,IAAI,KAAK,WAAW,KAAK,GAAG,CAAC,KAExC,KAAK;AAAA,IAChB;AAAA,IAEE,WAAY;AACV,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,QAASG,GAAO;AAEd,UADAlB,EAAM,kBAAkB,KAAK,SAAS,KAAK,SAASkB,CAAK,GACrD,EAAEA,aAAiBN,IAAS;AAC9B,YAAI,OAAOM,KAAU,YAAYA,MAAU,KAAK;AAC9C,iBAAO;AAET,QAAAA,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO;AAAA,MAC5C;AAEI,aAAIA,EAAM,YAAY,KAAK,UAClB,IAGF,KAAK,YAAYA,CAAK,KAAK,KAAK,WAAWA,CAAK;AAAA,IAC3D;AAAA,IAEE,YAAaA,GAAO;AAClB,aAAMA,aAAiBN,MACrBM,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO,IAItCR,EAAmB,KAAK,OAAOQ,EAAM,KAAK,KAC1CR,EAAmB,KAAK,OAAOQ,EAAM,KAAK,KAC1CR,EAAmB,KAAK,OAAOQ,EAAM,KAAK;AAAA,IAEhD;AAAA,IAEE,WAAYA,GAAO;AAMjB,UALMA,aAAiBN,MACrBM,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO,IAIpC,KAAK,WAAW,UAAU,CAACA,EAAM,WAAW;AAC9C,eAAO;AACF,UAAI,CAAC,KAAK,WAAW,UAAUA,EAAM,WAAW;AACrD,eAAO;AACF,UAAI,CAAC,KAAK,WAAW,UAAU,CAACA,EAAM,WAAW;AACtD,eAAO;AAGT,UAAIC,IAAI;AACR,SAAG;AACD,cAAMC,IAAI,KAAK,WAAWD,CAAC,GACrBE,IAAIH,EAAM,WAAWC,CAAC;AAE5B,YADAnB,EAAM,sBAAsBmB,GAAGC,GAAGC,CAAC,GAC/BD,MAAM,UAAaC,MAAM;AAC3B,iBAAO;AACF,YAAIA,MAAM;AACf,iBAAO;AACF,YAAID,MAAM;AACf,iBAAO;AACF,YAAIA,MAAMC;AACf;AAEA,eAAOX,EAAmBU,GAAGC,CAAC;AAAA,MAEtC,SAAa,EAAEF;AAAA,IACf;AAAA,IAEE,aAAcD,GAAO;AACnB,MAAMA,aAAiBN,MACrBM,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO;AAGxC,UAAIC,IAAI;AACR,SAAG;AACD,cAAMC,IAAI,KAAK,MAAMD,CAAC,GAChBE,IAAIH,EAAM,MAAMC,CAAC;AAEvB,YADAnB,EAAM,iBAAiBmB,GAAGC,GAAGC,CAAC,GAC1BD,MAAM,UAAaC,MAAM;AAC3B,iBAAO;AACF,YAAIA,MAAM;AACf,iBAAO;AACF,YAAID,MAAM;AACf,iBAAO;AACF,YAAIA,MAAMC;AACf;AAEA,eAAOX,EAAmBU,GAAGC,CAAC;AAAA,MAEtC,SAAa,EAAEF;AAAA,IACf;AAAA;AAAA;AAAA,IAIE,IAAKG,GAASC,GAAYC,GAAgB;AACxC,UAAIF,EAAQ,WAAW,KAAK,GAAG;AAC7B,YAAI,CAACC,KAAcC,MAAmB;AACpC,gBAAM,IAAI,MAAM,iDAAiD;AAGnE,YAAID,GAAY;AACd,gBAAME,IAAQ,IAAIF,CAAU,GAAG,MAAM,KAAK,QAAQ,QAAQlB,EAAGC,EAAE,eAAe,IAAID,EAAGC,EAAE,UAAU,CAAC;AAClG,cAAI,CAACmB,KAASA,EAAM,CAAC,MAAMF;AACzB,kBAAM,IAAI,MAAM,uBAAuBA,CAAU,EAAE;AAAA,QAE7D;AAAA,MACA;AAEI,cAAQD,GAAO;AAAA,QACb,KAAK;AACH,eAAK,WAAW,SAAS,GACzB,KAAK,QAAQ,GACb,KAAK,QAAQ,GACb,KAAK,SACL,KAAK,IAAI,OAAOC,GAAYC,CAAc;AAC1C;AAAA,QACF,KAAK;AACH,eAAK,WAAW,SAAS,GACzB,KAAK,QAAQ,GACb,KAAK,SACL,KAAK,IAAI,OAAOD,GAAYC,CAAc;AAC1C;AAAA,QACF,KAAK;AAIH,eAAK,WAAW,SAAS,GACzB,KAAK,IAAI,SAASD,GAAYC,CAAc,GAC5C,KAAK,IAAI,OAAOD,GAAYC,CAAc;AAC1C;AAAA;AAAA;AAAA,QAGF,KAAK;AACH,UAAI,KAAK,WAAW,WAAW,KAC7B,KAAK,IAAI,SAASD,GAAYC,CAAc,GAE9C,KAAK,IAAI,OAAOD,GAAYC,CAAc;AAC1C;AAAA,QACF,KAAK;AACH,cAAI,KAAK,WAAW,WAAW;AAC7B,kBAAM,IAAI,MAAM,WAAW,KAAK,GAAG,sBAAsB;AAE3D,eAAK,WAAW,SAAS;AACzB;AAAA,QAEF,KAAK;AAKH,WACE,KAAK,UAAU,KACf,KAAK,UAAU,KACf,KAAK,WAAW,WAAW,MAE3B,KAAK,SAEP,KAAK,QAAQ,GACb,KAAK,QAAQ,GACb,KAAK,aAAa,CAAA;AAClB;AAAA,QACF,KAAK;AAKH,WAAI,KAAK,UAAU,KAAK,KAAK,WAAW,WAAW,MACjD,KAAK,SAEP,KAAK,QAAQ,GACb,KAAK,aAAa,CAAA;AAClB;AAAA,QACF,KAAK;AAKH,UAAI,KAAK,WAAW,WAAW,KAC7B,KAAK,SAEP,KAAK,aAAa,CAAA;AAClB;AAAA;AAAA;AAAA,QAGF,KAAK,OAAO;AACV,gBAAME,IAAO,OAAOF,CAAc,IAAI,IAAI;AAE1C,cAAI,KAAK,WAAW,WAAW;AAC7B,iBAAK,aAAa,CAACE,CAAI;AAAA,eAClB;AACL,gBAAI,IAAI,KAAK,WAAW;AACxB,mBAAO,EAAE,KAAK;AACZ,cAAI,OAAO,KAAK,WAAW,CAAC,KAAM,aAChC,KAAK,WAAW,CAAC,KACjB,IAAI;AAGR,gBAAI,MAAM,IAAI;AAEZ,kBAAIH,MAAe,KAAK,WAAW,KAAK,GAAG,KAAKC,MAAmB;AACjE,sBAAM,IAAI,MAAM,uDAAuD;AAEzE,mBAAK,WAAW,KAAKE,CAAI;AAAA,YACrC;AAAA,UACA;AACQ,cAAIH,GAAY;AAGd,gBAAII,IAAa,CAACJ,GAAYG,CAAI;AAClC,YAAIF,MAAmB,OACrBG,IAAa,CAACJ,CAAU,IAEtBb,EAAmB,KAAK,WAAW,CAAC,GAAGa,CAAU,MAAM,IACrD,MAAM,KAAK,WAAW,CAAC,CAAC,MAC1B,KAAK,aAAaI,KAGpB,KAAK,aAAaA;AAAA,UAE9B;AACQ;AAAA,QACR;AAAA,QACM;AACE,gBAAM,IAAI,MAAM,+BAA+BL,CAAO,EAAE;AAAA,MAChE;AACI,kBAAK,MAAM,KAAK,OAAM,GAClB,KAAK,MAAM,WACb,KAAK,OAAO,IAAI,KAAK,MAAM,KAAK,GAAG,CAAC,KAE/B;AAAA,IACX;AAAA,EACA;AAEA,SAAAM,IAAiBhB;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/clean.js.map

@@ -1 +1 @@
-{"version":3,"file":"clean.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/clean.js"],"sourcesContent":["'use strict'\n\nconst parse = require('./parse')\nconst clean = (version, options) => {\n  const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n  return s ? s.version : null\n}\nmodule.exports = clean\n"],"names":["parse","require$$0","clean_1","version","options","s"],"mappings":";;;;;AAEA,QAAMA,IAAQC,EAAA;AAKd,SAAAC,IAJc,CAACC,GAASC,MAAY;AAClC,UAAMC,IAAIL,EAAMG,EAAQ,KAAM,EAAC,QAAQ,UAAU,EAAE,GAAGC,CAAO;AAC7D,WAAOC,IAAIA,EAAE,UAAU;AAAA,EACzB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"clean.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/clean.js"],"sourcesContent":["'use strict'\n\nconst parse = require('./parse')\nconst clean = (version, options) => {\n  const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n  return s ? s.version : null\n}\nmodule.exports = clean\n"],"names":["parse","require$$0","clean_1","version","options","s"],"mappings":";;;;;AAEA,QAAMA,IAAQC,EAAA;AAKd,SAAAC,IAJc,CAACC,GAASC,MAAY;AAClC,UAAMC,IAAIL,EAAMG,EAAQ,KAAI,EAAG,QAAQ,UAAU,EAAE,GAAGC,CAAO;AAC7D,WAAOC,IAAIA,EAAE,UAAU;AAAA,EACzB;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/coerce.js.map

@@ -1 +1 @@
-{"version":3,"file":"coerce.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/coerce.js"],"sourcesContent":["'use strict'\n\nconst SemVer = require('../classes/semver')\nconst parse = require('./parse')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst coerce = (version, options) => {\n  if (version instanceof SemVer) {\n    return version\n  }\n\n  if (typeof version === 'number') {\n    version = String(version)\n  }\n\n  if (typeof version !== 'string') {\n    return null\n  }\n\n  options = options || {}\n\n  let match = null\n  if (!options.rtl) {\n    match = version.match(options.includePrerelease ? re[t.COERCEFULL] : re[t.COERCE])\n  } else {\n    // Find the right-most coercible string that does not share\n    // a terminus with a more left-ward coercible string.\n    // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'\n    // With includePrerelease option set, '1.2.3.4-rc' wants to coerce '2.3.4-rc', not '2.3.4'\n    //\n    // Walk through the string checking with a /g regexp\n    // Manually set the index so as to pick up overlapping matches.\n    // Stop when we get a match that ends at the string end, since no\n    // coercible string can be more right-ward without the same terminus.\n    const coerceRtlRegex = options.includePrerelease ? re[t.COERCERTLFULL] : re[t.COERCERTL]\n    let next\n    while ((next = coerceRtlRegex.exec(version)) &&\n        (!match || match.index + match[0].length !== version.length)\n    ) {\n      if (!match ||\n            next.index + next[0].length !== match.index + match[0].length) {\n        match = next\n      }\n      coerceRtlRegex.lastIndex = next.index + next[1].length + next[2].length\n    }\n    // leave it in a clean state\n    coerceRtlRegex.lastIndex = -1\n  }\n\n  if (match === null) {\n    return null\n  }\n\n  const major = match[2]\n  const minor = match[3] || '0'\n  const patch = match[4] || '0'\n  const prerelease = options.includePrerelease && match[5] ? `-${match[5]}` : ''\n  const build = options.includePrerelease && match[6] ? `+${match[6]}` : ''\n\n  return parse(`${major}.${minor}.${patch}${prerelease}${build}`, options)\n}\nmodule.exports = coerce\n"],"names":["SemVer","require$$0","parse","require$$1","re","t","require$$2","coerce_1","version","options","match","coerceRtlRegex","next","major","minor","patch","prerelease","build"],"mappings":";;;;;;;AAEA,QAAMA,IAASC,EAAA,GACTC,IAAQC,EAAA,GACR,EAAE,QAAQC,GAAI,GAAAC,EAAG,IAAGC,EAAA;AAyD1B,SAAAC,IAvDe,CAACC,GAASC,MAAY;AACnC,QAAID,aAAmBR;AACrB,aAAOQ;AAOT,QAJI,OAAOA,KAAY,aACrBA,IAAU,OAAOA,CAAO,IAGtB,OAAOA,KAAY;AACrB,aAAO;AAGT,IAAAC,IAAUA,KAAW,CAAA;AAErB,QAAIC,IAAQ;AACZ,QAAI,CAACD,EAAQ;AACX,MAAAC,IAAQF,EAAQ,MAAMC,EAAQ,oBAAoBL,EAAGC,EAAE,UAAU,IAAID,EAAGC,EAAE,MAAM,CAAC;AAAA,SAC5E;AAUL,YAAMM,IAAiBF,EAAQ,oBAAoBL,EAAGC,EAAE,aAAa,IAAID,EAAGC,EAAE,SAAS;AACvF,UAAIO;AACJ,cAAQA,IAAOD,EAAe,KAAKH,CAAO,OACrC,CAACE,KAASA,EAAM,QAAQA,EAAM,CAAC,EAAE,WAAWF,EAAQ;AAEvD,SAAI,CAACE,KACCE,EAAK,QAAQA,EAAK,CAAC,EAAE,WAAWF,EAAM,QAAQA,EAAM,CAAC,EAAE,YAC3DA,IAAQE,IAEVD,EAAe,YAAYC,EAAK,QAAQA,EAAK,CAAC,EAAE,SAASA,EAAK,CAAC,EAAE;AAGnE,MAAAD,EAAe,YAAY;AAAA,IAC/B;AAEE,QAAID,MAAU;AACZ,aAAO;AAGT,UAAMG,IAAQH,EAAM,CAAC,GACfI,IAAQJ,EAAM,CAAC,KAAK,KACpBK,IAAQL,EAAM,CAAC,KAAK,KACpBM,IAAaP,EAAQ,qBAAqBC,EAAM,CAAC,IAAI,IAAIA,EAAM,CAAC,CAAC,KAAK,IACtEO,IAAQR,EAAQ,qBAAqBC,EAAM,CAAC,IAAI,IAAIA,EAAM,CAAC,CAAC,KAAK;AAEvE,WAAOR,EAAM,GAAGW,CAAK,IAAIC,CAAK,IAAIC,CAAK,GAAGC,CAAU,GAAGC,CAAK,IAAIR,CAAO;AAAA,EACzE;;","x_google_ignoreList":[0]}
+{"version":3,"file":"coerce.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/coerce.js"],"sourcesContent":["'use strict'\n\nconst SemVer = require('../classes/semver')\nconst parse = require('./parse')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst coerce = (version, options) => {\n  if (version instanceof SemVer) {\n    return version\n  }\n\n  if (typeof version === 'number') {\n    version = String(version)\n  }\n\n  if (typeof version !== 'string') {\n    return null\n  }\n\n  options = options || {}\n\n  let match = null\n  if (!options.rtl) {\n    match = version.match(options.includePrerelease ? re[t.COERCEFULL] : re[t.COERCE])\n  } else {\n    // Find the right-most coercible string that does not share\n    // a terminus with a more left-ward coercible string.\n    // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'\n    // With includePrerelease option set, '1.2.3.4-rc' wants to coerce '2.3.4-rc', not '2.3.4'\n    //\n    // Walk through the string checking with a /g regexp\n    // Manually set the index so as to pick up overlapping matches.\n    // Stop when we get a match that ends at the string end, since no\n    // coercible string can be more right-ward without the same terminus.\n    const coerceRtlRegex = options.includePrerelease ? re[t.COERCERTLFULL] : re[t.COERCERTL]\n    let next\n    while ((next = coerceRtlRegex.exec(version)) &&\n        (!match || match.index + match[0].length !== version.length)\n    ) {\n      if (!match ||\n            next.index + next[0].length !== match.index + match[0].length) {\n        match = next\n      }\n      coerceRtlRegex.lastIndex = next.index + next[1].length + next[2].length\n    }\n    // leave it in a clean state\n    coerceRtlRegex.lastIndex = -1\n  }\n\n  if (match === null) {\n    return null\n  }\n\n  const major = match[2]\n  const minor = match[3] || '0'\n  const patch = match[4] || '0'\n  const prerelease = options.includePrerelease && match[5] ? `-${match[5]}` : ''\n  const build = options.includePrerelease && match[6] ? `+${match[6]}` : ''\n\n  return parse(`${major}.${minor}.${patch}${prerelease}${build}`, options)\n}\nmodule.exports = coerce\n"],"names":["SemVer","require$$0","parse","require$$1","re","t","require$$2","coerce_1","version","options","match","coerceRtlRegex","next","major","minor","patch","prerelease","build"],"mappings":";;;;;;;AAEA,QAAMA,IAASC,EAAA,GACTC,IAAQC,EAAA,GACR,EAAE,QAAQC,GAAI,GAAAC,EAAC,IAAKC,EAAA;AAyD1B,SAAAC,IAvDe,CAACC,GAASC,MAAY;AACnC,QAAID,aAAmBR;AACrB,aAAOQ;AAOT,QAJI,OAAOA,KAAY,aACrBA,IAAU,OAAOA,CAAO,IAGtB,OAAOA,KAAY;AACrB,aAAO;AAGT,IAAAC,IAAUA,KAAW,CAAA;AAErB,QAAIC,IAAQ;AACZ,QAAI,CAACD,EAAQ;AACX,MAAAC,IAAQF,EAAQ,MAAMC,EAAQ,oBAAoBL,EAAGC,EAAE,UAAU,IAAID,EAAGC,EAAE,MAAM,CAAC;AAAA,SAC5E;AAUL,YAAMM,IAAiBF,EAAQ,oBAAoBL,EAAGC,EAAE,aAAa,IAAID,EAAGC,EAAE,SAAS;AACvF,UAAIO;AACJ,cAAQA,IAAOD,EAAe,KAAKH,CAAO,OACrC,CAACE,KAASA,EAAM,QAAQA,EAAM,CAAC,EAAE,WAAWF,EAAQ;AAEvD,SAAI,CAACE,KACCE,EAAK,QAAQA,EAAK,CAAC,EAAE,WAAWF,EAAM,QAAQA,EAAM,CAAC,EAAE,YAC3DA,IAAQE,IAEVD,EAAe,YAAYC,EAAK,QAAQA,EAAK,CAAC,EAAE,SAASA,EAAK,CAAC,EAAE;AAGnE,MAAAD,EAAe,YAAY;AAAA,IAC/B;AAEE,QAAID,MAAU;AACZ,aAAO;AAGT,UAAMG,IAAQH,EAAM,CAAC,GACfI,IAAQJ,EAAM,CAAC,KAAK,KACpBK,IAAQL,EAAM,CAAC,KAAK,KACpBM,IAAaP,EAAQ,qBAAqBC,EAAM,CAAC,IAAI,IAAIA,EAAM,CAAC,CAAC,KAAK,IACtEO,IAAQR,EAAQ,qBAAqBC,EAAM,CAAC,IAAI,IAAIA,EAAM,CAAC,CAAC,KAAK;AAEvE,WAAOR,EAAM,GAAGW,CAAK,IAAIC,CAAK,IAAIC,CAAK,GAAGC,CAAU,GAAGC,CAAK,IAAIR,CAAO;AAAA,EACzE;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/inc.js.map

@@ -1 +1 @@
-{"version":3,"file":"inc.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/inc.js"],"sourcesContent":["'use strict'\n\nconst SemVer = require('../classes/semver')\n\nconst inc = (version, release, options, identifier, identifierBase) => {\n  if (typeof (options) === 'string') {\n    identifierBase = identifier\n    identifier = options\n    options = undefined\n  }\n\n  try {\n    return new SemVer(\n      version instanceof SemVer ? version.version : version,\n      options\n    ).inc(release, identifier, identifierBase).version\n  } catch (er) {\n    return null\n  }\n}\nmodule.exports = inc\n"],"names":["SemVer","require$$0","inc_1","version","release","options","identifier","identifierBase"],"mappings":";;;;;AAEA,QAAMA,IAASC,EAAA;AAkBf,SAAAC,IAhBY,CAACC,GAASC,GAASC,GAASC,GAAYC,MAAmB;AACrE,IAAI,OAAQF,KAAa,aACvBE,IAAiBD,GACjBA,IAAaD,GACbA,IAAU;AAGZ,QAAI;AACF,aAAO,IAAIL;AAAA,QACTG,aAAmBH,IAASG,EAAQ,UAAUA;AAAA,QAC9CE;AAAA,MACD,EAAC,IAAID,GAASE,GAAYC,CAAc,EAAE;AAAA,IAC5C,QAAY;AACX,aAAO;AAAA,IACX;AAAA,EACA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"inc.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/inc.js"],"sourcesContent":["'use strict'\n\nconst SemVer = require('../classes/semver')\n\nconst inc = (version, release, options, identifier, identifierBase) => {\n  if (typeof (options) === 'string') {\n    identifierBase = identifier\n    identifier = options\n    options = undefined\n  }\n\n  try {\n    return new SemVer(\n      version instanceof SemVer ? version.version : version,\n      options\n    ).inc(release, identifier, identifierBase).version\n  } catch (er) {\n    return null\n  }\n}\nmodule.exports = inc\n"],"names":["SemVer","require$$0","inc_1","version","release","options","identifier","identifierBase"],"mappings":";;;;;AAEA,QAAMA,IAASC,EAAA;AAkBf,SAAAC,IAhBY,CAACC,GAASC,GAASC,GAASC,GAAYC,MAAmB;AACrE,IAAI,OAAQF,KAAa,aACvBE,IAAiBD,GACjBA,IAAaD,GACbA,IAAU;AAGZ,QAAI;AACF,aAAO,IAAIL;AAAA,QACTG,aAAmBH,IAASG,EAAQ,UAAUA;AAAA,QAC9CE;AAAA,QACA,IAAID,GAASE,GAAYC,CAAc,EAAE;AAAA,IAC/C,QAAe;AACX,aAAO;AAAA,IACX;AAAA,EACA;;","x_google_ignoreList":[0]}