@allahjs/utils 1.11.0 → 1.12.0

package/dist/index.cjs

@@ -1,63 +1,70 @@
 'use strict';
 
-var index$g = require('./core/stringUtils/index.cjs');
-var index$1 = require('./core/arrayUtils/index.cjs');
-var index$e = require('./core/objectUtils/index.cjs');
-var index$9 = require('./core/dateUtils/index.cjs');
-var index$d = require('./core/numberUtils/index.cjs');
-var index$i = require('./core/validationUtils/index.cjs');
-var index$2 = require('./core/asyncUtils/index.cjs');
-var index$4 = require('./core/colorUtils/index.cjs');
-var index$8 = require('./core/cryptoUtils/index.cjs');
-var index$b = require('./core/pageUtils/index.cjs');
-var index$f = require('./core/storageUtils/index.cjs');
-var index$5 = require('./core/constants/index.cjs');
-var index$c = require('./browser/domUtils/index.cjs');
-var index$6 = require('./browser/cookieUtils/index.cjs');
-var index$h = require('./browser/urlUtils/index.cjs');
+var index$k = require('./core/stringUtils/index.cjs');
+var index$2 = require('./core/arrayUtils/index.cjs');
+var index$i = require('./core/objectUtils/index.cjs');
+var index$b = require('./core/dateUtils/index.cjs');
+var index$h = require('./core/numberUtils/index.cjs');
+var index$n = require('./core/validationUtils/index.cjs');
+var index$3 = require('./core/asyncUtils/index.cjs');
+var index$6 = require('./core/colorUtils/index.cjs');
+var index$a = require('./core/cryptoUtils/index.cjs');
+var index$d = require('./core/pageUtils/index.cjs');
+var index$e = require('./core/diffUtils/index.cjs');
+var index$g = require('./core/fileUtils/index.cjs');
+var index$j = require('./core/storageUtils/index.cjs');
+var index$7 = require('./core/constants/index.cjs');
+var index$f = require('./browser/domUtils/index.cjs');
+var index$8 = require('./browser/cookieUtils/index.cjs');
+var index$m = require('./browser/urlUtils/index.cjs');
 var request_index = require('./request/index.cjs');
-var index$7 = require('./uniapp/uniUtils/index.cjs');
+var index$9 = require('./uniapp/uniUtils/index.cjs');
 var index = require('./uniapp/Tips/index.cjs');
-var index$3 = require('./uniapp/cloudUtils/index.cjs');
+var index$4 = require('./uniapp/cloudUtils/index.cjs');
 var initialUmiState = require('./umijs/initialUmiState.cjs');
-var index$a = require('./types/data/index.cjs');
+var index$c = require('./types/data/index.cjs');
+var index$1 = require('./request/ReqQueue/index.cjs');
+var index$l = require('./request/uniRequest/index.cjs');
+var index$5 = require('./request/httpCode/index.cjs');
 
 // 主入口文件 - 导出所有工具函数
 // 核心工具函数（适用于 Node.js、UniApp、React Native 等）
 // 版本信息
 const version = '1.0.0';
 
-exports.stringUtils = index$g.default;
-exports.arrayUtils = index$1.default;
-exports.objectUtils = index$e.default;
-exports.dateUtils = index$9.default;
-exports.templateObj = index$9.templateObj;
-exports.numberUtils = index$d.default;
-exports.validationUtils = index$i.default;
-exports.asyncUtils = index$2.default;
-exports.colorUtils = index$4.default;
-exports.cryptoUtils = index$8.default;
-exports.defTableData = index$b.defTableData;
-exports.pageUtils = index$b.default;
-exports.storageUtils = index$f.default;
-exports.constants = index$5;
-exports.domUtils = index$c.default;
-exports.cookieUtils = index$6.default;
-exports.urlUtils = index$h.default;
+exports.stringUtils = index$k.default;
+exports.arrayUtils = index$2.default;
+exports.objectUtils = index$i.default;
+exports.dateUtils = index$b.default;
+exports.templateObj = index$b.templateObj;
+exports.numberUtils = index$h.default;
+exports.validationUtils = index$n.default;
+exports.asyncUtils = index$3.default;
+exports.colorUtils = index$6.default;
+exports.cryptoUtils = index$a.default;
+exports.defTableData = index$d.defTableData;
+exports.pageUtils = index$d.default;
+exports.diffUtils = index$e.default;
+exports.fileUtils = index$g.default;
+exports.storageUtils = index$j.default;
+exports.constants = index$7;
+exports.domUtils = index$f.default;
+exports.cookieUtils = index$8.default;
+exports.urlUtils = index$m.default;
 exports.request = request_index.default;
-exports.createTimestampedData = index$7.createTimestampedData;
-exports.createUpdateData = index$7.createUpdateData;
-exports.deepClone = index$7.deepClone;
-exports.ensureArray = index$7.ensureArray;
-exports.findById = index$7.findById;
-exports.formatDate = index$7.formatDate;
-exports.formatRelativeTime = index$7.formatRelativeTime;
-exports.handleError = index$7.handleError;
-exports.handleSuccess = index$7.handleSuccess;
-exports.isDataExists = index$7.isDataExists;
-exports.isValidFamilyMember = index$7.isValidFamilyMember;
-exports.safeGetResponseData = index$7.safeGetResponseData;
-exports.validateRequiredFields = index$7.validateRequiredFields;
+exports.createTimestampedData = index$9.createTimestampedData;
+exports.createUpdateData = index$9.createUpdateData;
+exports.deepClone = index$9.deepClone;
+exports.ensureArray = index$9.ensureArray;
+exports.findById = index$9.findById;
+exports.formatDate = index$9.formatDate;
+exports.formatRelativeTime = index$9.formatRelativeTime;
+exports.handleError = index$9.handleError;
+exports.handleSuccess = index$9.handleSuccess;
+exports.isDataExists = index$9.isDataExists;
+exports.isValidFamilyMember = index$9.isValidFamilyMember;
+exports.safeGetResponseData = index$9.safeGetResponseData;
+exports.validateRequiredFields = index$9.validateRequiredFields;
 exports.BatchOperationTips = index.BatchOperationTips;
 exports.Tips = index.Tips;
 Object.defineProperty(exports, "ToastPosition", {
@@ -88,13 +95,17 @@ exports.showSuccessToastWithCallback = index.showSuccessToastWithCallback;
 exports.showToast = index.showToast;
 exports.showUpdateDialog = index.showUpdateDialog;
 exports.showWarningToast = index.showWarningToast;
-exports.cloudUtils = index$3.cloudUtils;
+exports.cloudUtils = index$4.cloudUtils;
 exports.buildLoginPath = initialUmiState.buildLoginPath;
 exports.getJwtToken = initialUmiState.getJwtToken;
 exports.initialUmiState = initialUmiState.initialUmiState;
 exports.isLogin = initialUmiState.isLogin;
 exports.loginOk = initialUmiState.loginOk;
 exports.toLogin = initialUmiState.toLogin;
-exports.defBaseFilter = index$a.defBaseFilter;
+exports.defBaseFilter = index$c.defBaseFilter;
+exports.ReqQueue = index$1.default;
+exports.uniRequest = index$l.default;
+exports.codeMessage = index$5.codeMessage;
+exports.defOption = index$5.defOption;
 exports.version = version;
 //# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../src/index.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAEA;AAoCA;AACO,MAAM,OAAO,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"index.cjs","sources":["../src/index.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAEA;AAsCA;AACO,MAAM,OAAO,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/index.d.ts

@@ -8,6 +8,8 @@ export { default as asyncUtils } from './core/asyncUtils/index.js';
 export { default as colorUtils } from './core/colorUtils/index.js';
 export { default as cryptoUtils } from './core/cryptoUtils/index.js';
 export { ITablePage, defTableData, default as pageUtils } from './core/pageUtils/index.js';
+export { default as diffUtils } from './core/diffUtils/index.js';
+export { default as fileUtils } from './core/fileUtils/index.js';
 export { default as storageUtils } from './core/storageUtils/index.js';
 import * as index from './core/constants/index.js';
 export { index as constants };
@@ -25,7 +27,10 @@ export { FormItemLabelProps, FormItemProps, IUploadProps, RequiredMark, TooltipP
 export { BaseRule, RuleType } from './form/rule.js';
 export { IBaseFilter, IOptions, IOptions2, IOptions61, ITreeNode, IValidityNum, IWaterInfo, IWaterLives, defBaseFilter } from './types/data/index.js';
 export { ISysDisFilter, ISysDistrict } from './types/dbData/index.js';
+export { default as ReqQueue } from './request/ReqQueue/index.js';
+export { default as uniRequest } from './request/uniRequest/index.js';
 export { ICacheData, ICallBack, IRequestOption } from './request/typings/index.js';
+export { codeMessage, defOption } from './request/httpCode/index.js';
 
 declare const version = "1.0.0";
 

package/dist/node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/diff/array.cjs

@@ -0,0 +1,23 @@
+'use strict';
+
+var base = require('./base.cjs');
+
+class ArrayDiff extends base.default {
+    tokenize(value) {
+        return value.slice();
+    }
+    join(value) {
+        return value;
+    }
+    removeEmpty(value) {
+        return value;
+    }
+}
+const arrayDiff = new ArrayDiff();
+function diffArrays(oldArr, newArr, options) {
+    return arrayDiff.diff(oldArr, newArr, options);
+}
+
+exports.arrayDiff = arrayDiff;
+exports.diffArrays = diffArrays;
+//# sourceMappingURL=array.cjs.map

package/dist/node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/diff/array.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.cjs","sources":["../../../../../../../../node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/diff/array.js"],"sourcesContent":["import Diff from './base.js';\nclass ArrayDiff extends Diff {\n    tokenize(value) {\n        return value.slice();\n    }\n    join(value) {\n        return value;\n    }\n    removeEmpty(value) {\n        return value;\n    }\n}\nexport const arrayDiff = new ArrayDiff();\nexport function diffArrays(oldArr, newArr, options) {\n    return arrayDiff.diff(oldArr, newArr, options);\n}\n"],"names":["Diff"],"mappings":";;;;AACA,MAAM,SAAS,SAASA,YAAI,CAAC;AAC7B,IAAI,QAAQ,CAAC,KAAK,EAAE;AACpB,QAAQ,OAAO,KAAK,CAAC,KAAK,EAAE;AAC5B,IAAI;AACJ,IAAI,IAAI,CAAC,KAAK,EAAE;AAChB,QAAQ,OAAO,KAAK;AACpB,IAAI;AACJ,IAAI,WAAW,CAAC,KAAK,EAAE;AACvB,QAAQ,OAAO,KAAK;AACpB,IAAI;AACJ;AACY,MAAC,SAAS,GAAG,IAAI,SAAS;AAC/B,SAAS,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE;AACpD,IAAI,OAAO,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC;AAClD;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/diff/base.cjs

@@ -0,0 +1,260 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+class Diff {
+    diff(oldStr, newStr, 
+    // Type below is not accurate/complete - see above for full possibilities - but it compiles
+    options = {}) {
+        let callback;
+        if (typeof options === 'function') {
+            callback = options;
+            options = {};
+        }
+        else if ('callback' in options) {
+            callback = options.callback;
+        }
+        // Allow subclasses to massage the input prior to running
+        const oldString = this.castInput(oldStr, options);
+        const newString = this.castInput(newStr, options);
+        const oldTokens = this.removeEmpty(this.tokenize(oldString, options));
+        const newTokens = this.removeEmpty(this.tokenize(newString, options));
+        return this.diffWithOptionsObj(oldTokens, newTokens, options, callback);
+    }
+    diffWithOptionsObj(oldTokens, newTokens, options, callback) {
+        var _a;
+        const done = (value) => {
+            value = this.postProcess(value, options);
+            if (callback) {
+                setTimeout(function () { callback(value); }, 0);
+                return undefined;
+            }
+            else {
+                return value;
+            }
+        };
+        const newLen = newTokens.length, oldLen = oldTokens.length;
+        let editLength = 1;
+        let maxEditLength = newLen + oldLen;
+        if (options.maxEditLength != null) {
+            maxEditLength = Math.min(maxEditLength, options.maxEditLength);
+        }
+        const maxExecutionTime = (_a = options.timeout) !== null && _a !== void 0 ? _a : Infinity;
+        const abortAfterTimestamp = Date.now() + maxExecutionTime;
+        const bestPath = [{ oldPos: -1, lastComponent: undefined }];
+        // Seed editLength = 0, i.e. the content starts with the same values
+        let newPos = this.extractCommon(bestPath[0], newTokens, oldTokens, 0, options);
+        if (bestPath[0].oldPos + 1 >= oldLen && newPos + 1 >= newLen) {
+            // Identity per the equality and tokenizer
+            return done(this.buildValues(bestPath[0].lastComponent, newTokens, oldTokens));
+        }
+        // Once we hit the right edge of the edit graph on some diagonal k, we can
+        // definitely reach the end of the edit graph in no more than k edits, so
+        // there's no point in considering any moves to diagonal k+1 any more (from
+        // which we're guaranteed to need at least k+1 more edits).
+        // Similarly, once we've reached the bottom of the edit graph, there's no
+        // point considering moves to lower diagonals.
+        // We record this fact by setting minDiagonalToConsider and
+        // maxDiagonalToConsider to some finite value once we've hit the edge of
+        // the edit graph.
+        // This optimization is not faithful to the original algorithm presented in
+        // Myers's paper, which instead pointlessly extends D-paths off the end of
+        // the edit graph - see page 7 of Myers's paper which notes this point
+        // explicitly and illustrates it with a diagram. This has major performance
+        // implications for some common scenarios. For instance, to compute a diff
+        // where the new text simply appends d characters on the end of the
+        // original text of length n, the true Myers algorithm will take O(n+d^2)
+        // time while this optimization needs only O(n+d) time.
+        let minDiagonalToConsider = -Infinity, maxDiagonalToConsider = Infinity;
+        // Main worker method. checks all permutations of a given edit length for acceptance.
+        const execEditLength = () => {
+            for (let diagonalPath = Math.max(minDiagonalToConsider, -editLength); diagonalPath <= Math.min(maxDiagonalToConsider, editLength); diagonalPath += 2) {
+                let basePath;
+                const removePath = bestPath[diagonalPath - 1], addPath = bestPath[diagonalPath + 1];
+                if (removePath) {
+                    // No one else is going to attempt to use this value, clear it
+                    // @ts-expect-error - perf optimisation. This type-violating value will never be read.
+                    bestPath[diagonalPath - 1] = undefined;
+                }
+                let canAdd = false;
+                if (addPath) {
+                    // what newPos will be after we do an insertion:
+                    const addPathNewPos = addPath.oldPos - diagonalPath;
+                    canAdd = addPath && 0 <= addPathNewPos && addPathNewPos < newLen;
+                }
+                const canRemove = removePath && removePath.oldPos + 1 < oldLen;
+                if (!canAdd && !canRemove) {
+                    // If this path is a terminal then prune
+                    // @ts-expect-error - perf optimisation. This type-violating value will never be read.
+                    bestPath[diagonalPath] = undefined;
+                    continue;
+                }
+                // Select the diagonal that we want to branch from. We select the prior
+                // path whose position in the old string is the farthest from the origin
+                // and does not pass the bounds of the diff graph
+                if (!canRemove || (canAdd && removePath.oldPos < addPath.oldPos)) {
+                    basePath = this.addToPath(addPath, true, false, 0, options);
+                }
+                else {
+                    basePath = this.addToPath(removePath, false, true, 1, options);
+                }
+                newPos = this.extractCommon(basePath, newTokens, oldTokens, diagonalPath, options);
+                if (basePath.oldPos + 1 >= oldLen && newPos + 1 >= newLen) {
+                    // If we have hit the end of both strings, then we are done
+                    return done(this.buildValues(basePath.lastComponent, newTokens, oldTokens)) || true;
+                }
+                else {
+                    bestPath[diagonalPath] = basePath;
+                    if (basePath.oldPos + 1 >= oldLen) {
+                        maxDiagonalToConsider = Math.min(maxDiagonalToConsider, diagonalPath - 1);
+                    }
+                    if (newPos + 1 >= newLen) {
+                        minDiagonalToConsider = Math.max(minDiagonalToConsider, diagonalPath + 1);
+                    }
+                }
+            }
+            editLength++;
+        };
+        // Performs the length of edit iteration. Is a bit fugly as this has to support the
+        // sync and async mode which is never fun. Loops over execEditLength until a value
+        // is produced, or until the edit length exceeds options.maxEditLength (if given),
+        // in which case it will return undefined.
+        if (callback) {
+            (function exec() {
+                setTimeout(function () {
+                    if (editLength > maxEditLength || Date.now() > abortAfterTimestamp) {
+                        return callback(undefined);
+                    }
+                    if (!execEditLength()) {
+                        exec();
+                    }
+                }, 0);
+            }());
+        }
+        else {
+            while (editLength <= maxEditLength && Date.now() <= abortAfterTimestamp) {
+                const ret = execEditLength();
+                if (ret) {
+                    return ret;
+                }
+            }
+        }
+    }
+    addToPath(path, added, removed, oldPosInc, options) {
+        const last = path.lastComponent;
+        if (last && !options.oneChangePerToken && last.added === added && last.removed === removed) {
+            return {
+                oldPos: path.oldPos + oldPosInc,
+                lastComponent: { count: last.count + 1, added: added, removed: removed, previousComponent: last.previousComponent }
+            };
+        }
+        else {
+            return {
+                oldPos: path.oldPos + oldPosInc,
+                lastComponent: { count: 1, added: added, removed: removed, previousComponent: last }
+            };
+        }
+    }
+    extractCommon(basePath, newTokens, oldTokens, diagonalPath, options) {
+        const newLen = newTokens.length, oldLen = oldTokens.length;
+        let oldPos = basePath.oldPos, newPos = oldPos - diagonalPath, commonCount = 0;
+        while (newPos + 1 < newLen && oldPos + 1 < oldLen && this.equals(oldTokens[oldPos + 1], newTokens[newPos + 1], options)) {
+            newPos++;
+            oldPos++;
+            commonCount++;
+            if (options.oneChangePerToken) {
+                basePath.lastComponent = { count: 1, previousComponent: basePath.lastComponent, added: false, removed: false };
+            }
+        }
+        if (commonCount && !options.oneChangePerToken) {
+            basePath.lastComponent = { count: commonCount, previousComponent: basePath.lastComponent, added: false, removed: false };
+        }
+        basePath.oldPos = oldPos;
+        return newPos;
+    }
+    equals(left, right, options) {
+        if (options.comparator) {
+            return options.comparator(left, right);
+        }
+        else {
+            return left === right
+                || (!!options.ignoreCase && left.toLowerCase() === right.toLowerCase());
+        }
+    }
+    removeEmpty(array) {
+        const ret = [];
+        for (let i = 0; i < array.length; i++) {
+            if (array[i]) {
+                ret.push(array[i]);
+            }
+        }
+        return ret;
+    }
+    // eslint-disable-next-line @typescript-eslint/no-unused-vars
+    castInput(value, options) {
+        return value;
+    }
+    // eslint-disable-next-line @typescript-eslint/no-unused-vars
+    tokenize(value, options) {
+        return Array.from(value);
+    }
+    join(chars) {
+        // Assumes ValueT is string, which is the case for most subclasses.
+        // When it's false, e.g. in diffArrays, this method needs to be overridden (e.g. with a no-op)
+        // Yes, the casts are verbose and ugly, because this pattern - of having the base class SORT OF
+        // assume tokens and values are strings, but not completely - is weird and janky.
+        return chars.join('');
+    }
+    postProcess(changeObjects, 
+    // eslint-disable-next-line @typescript-eslint/no-unused-vars
+    options) {
+        return changeObjects;
+    }
+    get useLongestToken() {
+        return false;
+    }
+    buildValues(lastComponent, newTokens, oldTokens) {
+        // First we convert our linked list of components in reverse order to an
+        // array in the right order:
+        const components = [];
+        let nextComponent;
+        while (lastComponent) {
+            components.push(lastComponent);
+            nextComponent = lastComponent.previousComponent;
+            delete lastComponent.previousComponent;
+            lastComponent = nextComponent;
+        }
+        components.reverse();
+        const componentLen = components.length;
+        let componentPos = 0, newPos = 0, oldPos = 0;
+        for (; componentPos < componentLen; componentPos++) {
+            const component = components[componentPos];
+            if (!component.removed) {
+                if (!component.added && this.useLongestToken) {
+                    let value = newTokens.slice(newPos, newPos + component.count);
+                    value = value.map(function (value, i) {
+                        const oldValue = oldTokens[oldPos + i];
+                        return oldValue.length > value.length ? oldValue : value;
+                    });
+                    component.value = this.join(value);
+                }
+                else {
+                    component.value = this.join(newTokens.slice(newPos, newPos + component.count));
+                }
+                newPos += component.count;
+                // Common case
+                if (!component.added) {
+                    oldPos += component.count;
+                }
+            }
+            else {
+                component.value = this.join(oldTokens.slice(oldPos, oldPos + component.count));
+                oldPos += component.count;
+            }
+        }
+        return components;
+    }
+}
+
+exports.default = Diff;
+//# sourceMappingURL=base.cjs.map

package/dist/node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/diff/base.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"base.cjs","sources":["../../../../../../../../node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/diff/base.js"],"sourcesContent":["export default class Diff {\n    diff(oldStr, newStr, \n    // Type below is not accurate/complete - see above for full possibilities - but it compiles\n    options = {}) {\n        let callback;\n        if (typeof options === 'function') {\n            callback = options;\n            options = {};\n        }\n        else if ('callback' in options) {\n            callback = options.callback;\n        }\n        // Allow subclasses to massage the input prior to running\n        const oldString = this.castInput(oldStr, options);\n        const newString = this.castInput(newStr, options);\n        const oldTokens = this.removeEmpty(this.tokenize(oldString, options));\n        const newTokens = this.removeEmpty(this.tokenize(newString, options));\n        return this.diffWithOptionsObj(oldTokens, newTokens, options, callback);\n    }\n    diffWithOptionsObj(oldTokens, newTokens, options, callback) {\n        var _a;\n        const done = (value) => {\n            value = this.postProcess(value, options);\n            if (callback) {\n                setTimeout(function () { callback(value); }, 0);\n                return undefined;\n            }\n            else {\n                return value;\n            }\n        };\n        const newLen = newTokens.length, oldLen = oldTokens.length;\n        let editLength = 1;\n        let maxEditLength = newLen + oldLen;\n        if (options.maxEditLength != null) {\n            maxEditLength = Math.min(maxEditLength, options.maxEditLength);\n        }\n        const maxExecutionTime = (_a = options.timeout) !== null && _a !== void 0 ? _a : Infinity;\n        const abortAfterTimestamp = Date.now() + maxExecutionTime;\n        const bestPath = [{ oldPos: -1, lastComponent: undefined }];\n        // Seed editLength = 0, i.e. the content starts with the same values\n        let newPos = this.extractCommon(bestPath[0], newTokens, oldTokens, 0, options);\n        if (bestPath[0].oldPos + 1 >= oldLen && newPos + 1 >= newLen) {\n            // Identity per the equality and tokenizer\n            return done(this.buildValues(bestPath[0].lastComponent, newTokens, oldTokens));\n        }\n        // Once we hit the right edge of the edit graph on some diagonal k, we can\n        // definitely reach the end of the edit graph in no more than k edits, so\n        // there's no point in considering any moves to diagonal k+1 any more (from\n        // which we're guaranteed to need at least k+1 more edits).\n        // Similarly, once we've reached the bottom of the edit graph, there's no\n        // point considering moves to lower diagonals.\n        // We record this fact by setting minDiagonalToConsider and\n        // maxDiagonalToConsider to some finite value once we've hit the edge of\n        // the edit graph.\n        // This optimization is not faithful to the original algorithm presented in\n        // Myers's paper, which instead pointlessly extends D-paths off the end of\n        // the edit graph - see page 7 of Myers's paper which notes this point\n        // explicitly and illustrates it with a diagram. This has major performance\n        // implications for some common scenarios. For instance, to compute a diff\n        // where the new text simply appends d characters on the end of the\n        // original text of length n, the true Myers algorithm will take O(n+d^2)\n        // time while this optimization needs only O(n+d) time.\n        let minDiagonalToConsider = -Infinity, maxDiagonalToConsider = Infinity;\n        // Main worker method. checks all permutations of a given edit length for acceptance.\n        const execEditLength = () => {\n            for (let diagonalPath = Math.max(minDiagonalToConsider, -editLength); diagonalPath <= Math.min(maxDiagonalToConsider, editLength); diagonalPath += 2) {\n                let basePath;\n                const removePath = bestPath[diagonalPath - 1], addPath = bestPath[diagonalPath + 1];\n                if (removePath) {\n                    // No one else is going to attempt to use this value, clear it\n                    // @ts-expect-error - perf optimisation. This type-violating value will never be read.\n                    bestPath[diagonalPath - 1] = undefined;\n                }\n                let canAdd = false;\n                if (addPath) {\n                    // what newPos will be after we do an insertion:\n                    const addPathNewPos = addPath.oldPos - diagonalPath;\n                    canAdd = addPath && 0 <= addPathNewPos && addPathNewPos < newLen;\n                }\n                const canRemove = removePath && removePath.oldPos + 1 < oldLen;\n                if (!canAdd && !canRemove) {\n                    // If this path is a terminal then prune\n                    // @ts-expect-error - perf optimisation. This type-violating value will never be read.\n                    bestPath[diagonalPath] = undefined;\n                    continue;\n                }\n                // Select the diagonal that we want to branch from. We select the prior\n                // path whose position in the old string is the farthest from the origin\n                // and does not pass the bounds of the diff graph\n                if (!canRemove || (canAdd && removePath.oldPos < addPath.oldPos)) {\n                    basePath = this.addToPath(addPath, true, false, 0, options);\n                }\n                else {\n                    basePath = this.addToPath(removePath, false, true, 1, options);\n                }\n                newPos = this.extractCommon(basePath, newTokens, oldTokens, diagonalPath, options);\n                if (basePath.oldPos + 1 >= oldLen && newPos + 1 >= newLen) {\n                    // If we have hit the end of both strings, then we are done\n                    return done(this.buildValues(basePath.lastComponent, newTokens, oldTokens)) || true;\n                }\n                else {\n                    bestPath[diagonalPath] = basePath;\n                    if (basePath.oldPos + 1 >= oldLen) {\n                        maxDiagonalToConsider = Math.min(maxDiagonalToConsider, diagonalPath - 1);\n                    }\n                    if (newPos + 1 >= newLen) {\n                        minDiagonalToConsider = Math.max(minDiagonalToConsider, diagonalPath + 1);\n                    }\n                }\n            }\n            editLength++;\n        };\n        // Performs the length of edit iteration. Is a bit fugly as this has to support the\n        // sync and async mode which is never fun. Loops over execEditLength until a value\n        // is produced, or until the edit length exceeds options.maxEditLength (if given),\n        // in which case it will return undefined.\n        if (callback) {\n            (function exec() {\n                setTimeout(function () {\n                    if (editLength > maxEditLength || Date.now() > abortAfterTimestamp) {\n                        return callback(undefined);\n                    }\n                    if (!execEditLength()) {\n                        exec();\n                    }\n                }, 0);\n            }());\n        }\n        else {\n            while (editLength <= maxEditLength && Date.now() <= abortAfterTimestamp) {\n                const ret = execEditLength();\n                if (ret) {\n                    return ret;\n                }\n            }\n        }\n    }\n    addToPath(path, added, removed, oldPosInc, options) {\n        const last = path.lastComponent;\n        if (last && !options.oneChangePerToken && last.added === added && last.removed === removed) {\n            return {\n                oldPos: path.oldPos + oldPosInc,\n                lastComponent: { count: last.count + 1, added: added, removed: removed, previousComponent: last.previousComponent }\n            };\n        }\n        else {\n            return {\n                oldPos: path.oldPos + oldPosInc,\n                lastComponent: { count: 1, added: added, removed: removed, previousComponent: last }\n            };\n        }\n    }\n    extractCommon(basePath, newTokens, oldTokens, diagonalPath, options) {\n        const newLen = newTokens.length, oldLen = oldTokens.length;\n        let oldPos = basePath.oldPos, newPos = oldPos - diagonalPath, commonCount = 0;\n        while (newPos + 1 < newLen && oldPos + 1 < oldLen && this.equals(oldTokens[oldPos + 1], newTokens[newPos + 1], options)) {\n            newPos++;\n            oldPos++;\n            commonCount++;\n            if (options.oneChangePerToken) {\n                basePath.lastComponent = { count: 1, previousComponent: basePath.lastComponent, added: false, removed: false };\n            }\n        }\n        if (commonCount && !options.oneChangePerToken) {\n            basePath.lastComponent = { count: commonCount, previousComponent: basePath.lastComponent, added: false, removed: false };\n        }\n        basePath.oldPos = oldPos;\n        return newPos;\n    }\n    equals(left, right, options) {\n        if (options.comparator) {\n            return options.comparator(left, right);\n        }\n        else {\n            return left === right\n                || (!!options.ignoreCase && left.toLowerCase() === right.toLowerCase());\n        }\n    }\n    removeEmpty(array) {\n        const ret = [];\n        for (let i = 0; i < array.length; i++) {\n            if (array[i]) {\n                ret.push(array[i]);\n            }\n        }\n        return ret;\n    }\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    castInput(value, options) {\n        return value;\n    }\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    tokenize(value, options) {\n        return Array.from(value);\n    }\n    join(chars) {\n        // Assumes ValueT is string, which is the case for most subclasses.\n        // When it's false, e.g. in diffArrays, this method needs to be overridden (e.g. with a no-op)\n        // Yes, the casts are verbose and ugly, because this pattern - of having the base class SORT OF\n        // assume tokens and values are strings, but not completely - is weird and janky.\n        return chars.join('');\n    }\n    postProcess(changeObjects, \n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    options) {\n        return changeObjects;\n    }\n    get useLongestToken() {\n        return false;\n    }\n    buildValues(lastComponent, newTokens, oldTokens) {\n        // First we convert our linked list of components in reverse order to an\n        // array in the right order:\n        const components = [];\n        let nextComponent;\n        while (lastComponent) {\n            components.push(lastComponent);\n            nextComponent = lastComponent.previousComponent;\n            delete lastComponent.previousComponent;\n            lastComponent = nextComponent;\n        }\n        components.reverse();\n        const componentLen = components.length;\n        let componentPos = 0, newPos = 0, oldPos = 0;\n        for (; componentPos < componentLen; componentPos++) {\n            const component = components[componentPos];\n            if (!component.removed) {\n                if (!component.added && this.useLongestToken) {\n                    let value = newTokens.slice(newPos, newPos + component.count);\n                    value = value.map(function (value, i) {\n                        const oldValue = oldTokens[oldPos + i];\n                        return oldValue.length > value.length ? oldValue : value;\n                    });\n                    component.value = this.join(value);\n                }\n                else {\n                    component.value = this.join(newTokens.slice(newPos, newPos + component.count));\n                }\n                newPos += component.count;\n                // Common case\n                if (!component.added) {\n                    oldPos += component.count;\n                }\n            }\n            else {\n                component.value = this.join(oldTokens.slice(oldPos, oldPos + component.count));\n                oldPos += component.count;\n            }\n        }\n        return components;\n    }\n}\n"],"names":[],"mappings":";;;;AAAe,MAAM,IAAI,CAAC;AAC1B,IAAI,IAAI,CAAC,MAAM,EAAE,MAAM;AACvB;AACA,IAAI,OAAO,GAAG,EAAE,EAAE;AAClB,QAAQ,IAAI,QAAQ;AACpB,QAAQ,IAAI,OAAO,OAAO,KAAK,UAAU,EAAE;AAC3C,YAAY,QAAQ,GAAG,OAAO;AAC9B,YAAY,OAAO,GAAG,EAAE;AACxB,QAAQ;AACR,aAAa,IAAI,UAAU,IAAI,OAAO,EAAE;AACxC,YAAY,QAAQ,GAAG,OAAO,CAAC,QAAQ;AACvC,QAAQ;AACR;AACA,QAAQ,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC;AACzD,QAAQ,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC;AACzD,QAAQ,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;AAC7E,QAAQ,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;AAC7E,QAAQ,OAAO,IAAI,CAAC,kBAAkB,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,CAAC;AAC/E,IAAI;AACJ,IAAI,kBAAkB,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE;AAChE,QAAQ,IAAI,EAAE;AACd,QAAQ,MAAM,IAAI,GAAG,CAAC,KAAK,KAAK;AAChC,YAAY,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC;AACpD,YAAY,IAAI,QAAQ,EAAE;AAC1B,gBAAgB,UAAU,CAAC,YAAY,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAC/D,gBAAgB,OAAO,SAAS;AAChC,YAAY;AACZ,iBAAiB;AACjB,gBAAgB,OAAO,KAAK;AAC5B,YAAY;AACZ,QAAQ,CAAC;AACT,QAAQ,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC,MAAM;AAClE,QAAQ,IAAI,UAAU,GAAG,CAAC;AAC1B,QAAQ,IAAI,aAAa,GAAG,MAAM,GAAG,MAAM;AAC3C,QAAQ,IAAI,OAAO,CAAC,aAAa,IAAI,IAAI,EAAE;AAC3C,YAAY,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,OAAO,CAAC,aAAa,CAAC;AAC1E,QAAQ;AACR,QAAQ,MAAM,gBAAgB,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC,OAAO,MAAM,IAAI,IAAI,EAAE,KAAK,MAAM,GAAG,EAAE,GAAG,QAAQ;AACjG,QAAQ,MAAM,mBAAmB,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,gBAAgB;AACjE,QAAQ,MAAM,QAAQ,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC;AACnE;AACA,QAAQ,IAAI,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC;AACtF,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,EAAE;AACtE;AACA,YAAY,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;AAC1F,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,IAAI,qBAAqB,GAAG,CAAC,QAAQ,EAAE,qBAAqB,GAAG,QAAQ;AAC/E;AACA,QAAQ,MAAM,cAAc,GAAG,MAAM;AACrC,YAAY,KAAK,IAAI,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,qBAAqB,EAAE,CAAC,UAAU,CAAC,EAAE,YAAY,IAAI,IAAI,CAAC,GAAG,CAAC,qBAAqB,EAAE,UAAU,CAAC,EAAE,YAAY,IAAI,CAAC,EAAE;AAClK,gBAAgB,IAAI,QAAQ;AAC5B,gBAAgB,MAAM,UAAU,GAAG,QAAQ,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC,YAAY,GAAG,CAAC,CAAC;AACnG,gBAAgB,IAAI,UAAU,EAAE;AAChC;AACA;AACA,oBAAoB,QAAQ,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,SAAS;AAC1D,gBAAgB;AAChB,gBAAgB,IAAI,MAAM,GAAG,KAAK;AAClC,gBAAgB,IAAI,OAAO,EAAE;AAC7B;AACA,oBAAoB,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,GAAG,YAAY;AACvE,oBAAoB,MAAM,GAAG,OAAO,IAAI,CAAC,IAAI,aAAa,IAAI,aAAa,GAAG,MAAM;AACpF,gBAAgB;AAChB,gBAAgB,MAAM,SAAS,GAAG,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM;AAC9E,gBAAgB,IAAI,CAAC,MAAM,IAAI,CAAC,SAAS,EAAE;AAC3C;AACA;AACA,oBAAoB,QAAQ,CAAC,YAAY,CAAC,GAAG,SAAS;AACtD,oBAAoB;AACpB,gBAAgB;AAChB;AACA;AACA;AACA,gBAAgB,IAAI,CAAC,SAAS,KAAK,MAAM,IAAI,UAAU,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE;AAClF,oBAAoB,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC;AAC/E,gBAAgB;AAChB,qBAAqB;AACrB,oBAAoB,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,CAAC;AAClF,gBAAgB;AAChB,gBAAgB,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,OAAO,CAAC;AAClG,gBAAgB,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,EAAE;AAC3E;AACA,oBAAoB,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,aAAa,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,IAAI,IAAI;AACvG,gBAAgB;AAChB,qBAAqB;AACrB,oBAAoB,QAAQ,CAAC,YAAY,CAAC,GAAG,QAAQ;AACrD,oBAAoB,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,EAAE;AACvD,wBAAwB,qBAAqB,GAAG,IAAI,CAAC,GAAG,CAAC,qBAAqB,EAAE,YAAY,GAAG,CAAC,CAAC;AACjG,oBAAoB;AACpB,oBAAoB,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,EAAE;AAC9C,wBAAwB,qBAAqB,GAAG,IAAI,CAAC,GAAG,CAAC,qBAAqB,EAAE,YAAY,GAAG,CAAC,CAAC;AACjG,oBAAoB;AACpB,gBAAgB;AAChB,YAAY;AACZ,YAAY,UAAU,EAAE;AACxB,QAAQ,CAAC;AACT;AACA;AACA;AACA;AACA,QAAQ,IAAI,QAAQ,EAAE;AACtB,YAAY,CAAC,SAAS,IAAI,GAAG;AAC7B,gBAAgB,UAAU,CAAC,YAAY;AACvC,oBAAoB,IAAI,UAAU,GAAG,aAAa,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,mBAAmB,EAAE;AACxF,wBAAwB,OAAO,QAAQ,CAAC,SAAS,CAAC;AAClD,oBAAoB;AACpB,oBAAoB,IAAI,CAAC,cAAc,EAAE,EAAE;AAC3C,wBAAwB,IAAI,EAAE;AAC9B,oBAAoB;AACpB,gBAAgB,CAAC,EAAE,CAAC,CAAC;AACrB,YAAY,CAAC,EAAE;AACf,QAAQ;AACR,aAAa;AACb,YAAY,OAAO,UAAU,IAAI,aAAa,IAAI,IAAI,CAAC,GAAG,EAAE,IAAI,mBAAmB,EAAE;AACrF,gBAAgB,MAAM,GAAG,GAAG,cAAc,EAAE;AAC5C,gBAAgB,IAAI,GAAG,EAAE;AACzB,oBAAoB,OAAO,GAAG;AAC9B,gBAAgB;AAChB,YAAY;AACZ,QAAQ;AACR,IAAI;AACJ,IAAI,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE;AACxD,QAAQ,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa;AACvC,QAAQ,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,iBAAiB,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,OAAO,KAAK,OAAO,EAAE;AACpG,YAAY,OAAO;AACnB,gBAAgB,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,SAAS;AAC/C,gBAAgB,aAAa,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;AACjI,aAAa;AACb,QAAQ;AACR,aAAa;AACb,YAAY,OAAO;AACnB,gBAAgB,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,SAAS;AAC/C,gBAAgB,aAAa,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,iBAAiB,EAAE,IAAI;AAClG,aAAa;AACb,QAAQ;AACR,IAAI;AACJ,IAAI,aAAa,CAAC,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE;AACzE,QAAQ,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC,MAAM;AAClE,QAAQ,IAAI,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,YAAY,EAAE,WAAW,GAAG,CAAC;AACrF,QAAQ,OAAO,MAAM,GAAG,CAAC,GAAG,MAAM,IAAI,MAAM,GAAG,CAAC,GAAG,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE;AACjI,YAAY,MAAM,EAAE;AACpB,YAAY,MAAM,EAAE;AACpB,YAAY,WAAW,EAAE;AACzB,YAAY,IAAI,OAAO,CAAC,iBAAiB,EAAE;AAC3C,gBAAgB,QAAQ,CAAC,aAAa,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,iBAAiB,EAAE,QAAQ,CAAC,aAAa,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;AAC9H,YAAY;AACZ,QAAQ;AACR,QAAQ,IAAI,WAAW,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE;AACvD,YAAY,QAAQ,CAAC,aAAa,GAAG,EAAE,KAAK,EAAE,WAAW,EAAE,iBAAiB,EAAE,QAAQ,CAAC,aAAa,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;AACpI,QAAQ;AACR,QAAQ,QAAQ,CAAC,MAAM,GAAG,MAAM;AAChC,QAAQ,OAAO,MAAM;AACrB,IAAI;AACJ,IAAI,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE;AACjC,QAAQ,IAAI,OAAO,CAAC,UAAU,EAAE;AAChC,YAAY,OAAO,OAAO,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC;AAClD,QAAQ;AACR,aAAa;AACb,YAAY,OAAO,IAAI,KAAK;AAC5B,oBAAoB,CAAC,CAAC,OAAO,CAAC,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE,KAAK,KAAK,CAAC,WAAW,EAAE,CAAC;AACvF,QAAQ;AACR,IAAI;AACJ,IAAI,WAAW,CAAC,KAAK,EAAE;AACvB,QAAQ,MAAM,GAAG,GAAG,EAAE;AACtB,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC/C,YAAY,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE;AAC1B,gBAAgB,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAClC,YAAY;AACZ,QAAQ;AACR,QAAQ,OAAO,GAAG;AAClB,IAAI;AACJ;AACA,IAAI,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE;AAC9B,QAAQ,OAAO,KAAK;AACpB,IAAI;AACJ;AACA,IAAI,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE;AAC7B,QAAQ,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;AAChC,IAAI;AACJ,IAAI,IAAI,CAAC,KAAK,EAAE;AAChB;AACA;AACA;AACA;AACA,QAAQ,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;AAC7B,IAAI;AACJ,IAAI,WAAW,CAAC,aAAa;AAC7B;AACA,IAAI,OAAO,EAAE;AACb,QAAQ,OAAO,aAAa;AAC5B,IAAI;AACJ,IAAI,IAAI,eAAe,GAAG;AAC1B,QAAQ,OAAO,KAAK;AACpB,IAAI;AACJ,IAAI,WAAW,CAAC,aAAa,EAAE,SAAS,EAAE,SAAS,EAAE;AACrD;AACA;AACA,QAAQ,MAAM,UAAU,GAAG,EAAE;AAC7B,QAAQ,IAAI,aAAa;AACzB,QAAQ,OAAO,aAAa,EAAE;AAC9B,YAAY,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC;AAC1C,YAAY,aAAa,GAAG,aAAa,CAAC,iBAAiB;AAC3D,YAAY,OAAO,aAAa,CAAC,iBAAiB;AAClD,YAAY,aAAa,GAAG,aAAa;AACzC,QAAQ;AACR,QAAQ,UAAU,CAAC,OAAO,EAAE;AAC5B,QAAQ,MAAM,YAAY,GAAG,UAAU,CAAC,MAAM;AAC9C,QAAQ,IAAI,YAAY,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC;AACpD,QAAQ,OAAO,YAAY,GAAG,YAAY,EAAE,YAAY,EAAE,EAAE;AAC5D,YAAY,MAAM,SAAS,GAAG,UAAU,CAAC,YAAY,CAAC;AACtD,YAAY,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE;AACpC,gBAAgB,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,eAAe,EAAE;AAC9D,oBAAoB,IAAI,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC;AACjF,oBAAoB,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,KAAK,EAAE,CAAC,EAAE;AAC1D,wBAAwB,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;AAC9D,wBAAwB,OAAO,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,QAAQ,GAAG,KAAK;AAChF,oBAAoB,CAAC,CAAC;AACtB,oBAAoB,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;AACtD,gBAAgB;AAChB,qBAAqB;AACrB,oBAAoB,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;AAClG,gBAAgB;AAChB,gBAAgB,MAAM,IAAI,SAAS,CAAC,KAAK;AACzC;AACA,gBAAgB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE;AACtC,oBAAoB,MAAM,IAAI,SAAS,CAAC,KAAK;AAC7C,gBAAgB;AAChB,YAAY;AACZ,iBAAiB;AACjB,gBAAgB,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;AAC9F,gBAAgB,MAAM,IAAI,SAAS,CAAC,KAAK;AACzC,YAAY;AACZ,QAAQ;AACR,QAAQ,OAAO,UAAU;AACzB,IAAI;AACJ;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/diff/character.cjs

@@ -0,0 +1,14 @@
+'use strict';
+
+var base = require('./base.cjs');
+
+class CharacterDiff extends base.default {
+}
+const characterDiff = new CharacterDiff();
+function diffChars(oldStr, newStr, options) {
+    return characterDiff.diff(oldStr, newStr, options);
+}
+
+exports.characterDiff = characterDiff;
+exports.diffChars = diffChars;
+//# sourceMappingURL=character.cjs.map

package/dist/node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/diff/character.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"character.cjs","sources":["../../../../../../../../node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/diff/character.js"],"sourcesContent":["import Diff from './base.js';\nclass CharacterDiff extends Diff {\n}\nexport const characterDiff = new CharacterDiff();\nexport function diffChars(oldStr, newStr, options) {\n    return characterDiff.diff(oldStr, newStr, options);\n}\n"],"names":["Diff"],"mappings":";;;;AACA,MAAM,aAAa,SAASA,YAAI,CAAC;AACjC;AACY,MAAC,aAAa,GAAG,IAAI,aAAa;AACvC,SAAS,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE;AACnD,IAAI,OAAO,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC;AACtD;;;;;","x_google_ignoreList":[0]}

package/dist/request/ReqQueue/index.d.ts

@@ -0,0 +1,25 @@
+type IReqQueueInit = {
+    maxQueueLength?: number;
+    cacheMethod?: (v: Record<string, any>) => void;
+};
+declare class ReqQueue {
+    private static instance;
+    private static reqQueue;
+    private static maxQueueLength;
+    private static cacheMethod;
+    constructor(p: IReqQueueInit);
+    static init(p: IReqQueueInit): ReqQueue;
+    static getInstance(p: IReqQueueInit): ReqQueue;
+    /**
+     * 获取下日志队列
+     */
+    static getReqQueue(): Record<string, any>;
+    /**
+     * 添加或者更新一条记录
+     * @param data
+     * @param key
+     */
+    static addReqQueue(data: any, key?: string): Promise<void>;
+}
+
+export { ReqQueue as default };

package/dist/request/httpCode/index.d.ts

@@ -0,0 +1,9 @@
+import { IRequestOption } from '../typings/index.js';
+
+/**
+ * HTTP编码属性
+ */
+declare const codeMessage: any;
+declare const defOption: IRequestOption;
+
+export { codeMessage, defOption };