react-easy-wall 2.0.14 → 3.0.0

package/dist/cjs/node_modules/@wry/context/lib/slot.cjs

@@ -1,167 +0,0 @@
-'use strict';
-
-// This currentContext variable will only be used if the makeSlotClass
-// function is called, which happens only if this is the first copy of the
-// @wry/context package to be imported.
-let currentContext = null;
-// This unique internal object is used to denote the absence of a value
-// for a given Slot, and is never exposed to outside code.
-const MISSING_VALUE = {};
-let idCounter = 1;
-// Although we can't do anything about the cost of duplicated code from
-// accidentally bundling multiple copies of the @wry/context package, we can
-// avoid creating the Slot class more than once using makeSlotClass.
-const makeSlotClass = () => class Slot {
-    constructor() {
-        // If you have a Slot object, you can find out its slot.id, but you cannot
-        // guess the slot.id of a Slot you don't have access to, thanks to the
-        // randomized suffix.
-        this.id = [
-            "slot",
-            idCounter++,
-            Date.now(),
-            Math.random().toString(36).slice(2),
-        ].join(":");
-    }
-    hasValue() {
-        for (let context = currentContext; context; context = context.parent) {
-            // We use the Slot object iself as a key to its value, which means the
-            // value cannot be obtained without a reference to the Slot object.
-            if (this.id in context.slots) {
-                const value = context.slots[this.id];
-                if (value === MISSING_VALUE)
-                    break;
-                if (context !== currentContext) {
-                    // Cache the value in currentContext.slots so the next lookup will
-                    // be faster. This caching is safe because the tree of contexts and
-                    // the values of the slots are logically immutable.
-                    currentContext.slots[this.id] = value;
-                }
-                return true;
-            }
-        }
-        if (currentContext) {
-            // If a value was not found for this Slot, it's never going to be found
-            // no matter how many times we look it up, so we might as well cache
-            // the absence of the value, too.
-            currentContext.slots[this.id] = MISSING_VALUE;
-        }
-        return false;
-    }
-    getValue() {
-        if (this.hasValue()) {
-            return currentContext.slots[this.id];
-        }
-    }
-    withValue(value, callback, 
-    // Given the prevalence of arrow functions, specifying arguments is likely
-    // to be much more common than specifying `this`, hence this ordering:
-    args, thisArg) {
-        const slots = {
-            __proto__: null,
-            [this.id]: value,
-        };
-        const parent = currentContext;
-        currentContext = { parent, slots };
-        try {
-            // Function.prototype.apply allows the arguments array argument to be
-            // omitted or undefined, so args! is fine here.
-            return callback.apply(thisArg, args);
-        }
-        finally {
-            currentContext = parent;
-        }
-    }
-    // Capture the current context and wrap a callback function so that it
-    // reestablishes the captured context when called.
-    static bind(callback) {
-        const context = currentContext;
-        return function () {
-            const saved = currentContext;
-            try {
-                currentContext = context;
-                return callback.apply(this, arguments);
-            }
-            finally {
-                currentContext = saved;
-            }
-        };
-    }
-    // Immediately run a callback function without any captured context.
-    static noContext(callback, 
-    // Given the prevalence of arrow functions, specifying arguments is likely
-    // to be much more common than specifying `this`, hence this ordering:
-    args, thisArg) {
-        if (currentContext) {
-            const saved = currentContext;
-            try {
-                currentContext = null;
-                // Function.prototype.apply allows the arguments array argument to be
-                // omitted or undefined, so args! is fine here.
-                return callback.apply(thisArg, args);
-            }
-            finally {
-                currentContext = saved;
-            }
-        }
-        else {
-            return callback.apply(thisArg, args);
-        }
-    }
-};
-function maybe(fn) {
-    try {
-        return fn();
-    }
-    catch (ignored) { }
-}
-// We store a single global implementation of the Slot class as a permanent
-// non-enumerable property of the globalThis object. This obfuscation does
-// nothing to prevent access to the Slot class, but at least it ensures the
-// implementation (i.e. currentContext) cannot be tampered with, and all copies
-// of the @wry/context package (hopefully just one) will share the same Slot
-// implementation. Since the first copy of the @wry/context package to be
-// imported wins, this technique imposes a steep cost for any future breaking
-// changes to the Slot class.
-const globalKey = "@wry/context:Slot";
-const host = 
-// Prefer globalThis when available.
-// https://github.com/benjamn/wryware/issues/347
-maybe(() => globalThis) ||
-    // Fall back to global, which works in Node.js and may be converted by some
-    // bundlers to the appropriate identifier (window, self, ...) depending on the
-    // bundling target. https://github.com/endojs/endo/issues/576#issuecomment-1178515224
-    maybe(() => global) ||
-    // Otherwise, use a dummy host that's local to this module. We used to fall
-    // back to using the Array constructor as a namespace, but that was flagged in
-    // https://github.com/benjamn/wryware/issues/347, and can be avoided.
-    Object.create(null);
-// Whichever globalHost we're using, make TypeScript happy about the additional
-// globalKey property.
-const globalHost = host;
-const Slot = globalHost[globalKey] ||
-    // Earlier versions of this package stored the globalKey property on the Array
-    // constructor, so we check there as well, to prevent Slot class duplication.
-    Array[globalKey] ||
-    (function (Slot) {
-        try {
-            Object.defineProperty(globalHost, globalKey, {
-                value: Slot,
-                enumerable: false,
-                writable: false,
-                // When it was possible for globalHost to be the Array constructor (a
-                // legacy Slot dedup strategy), it was important for the property to be
-                // configurable:true so it could be deleted. That does not seem to be as
-                // important when globalHost is the global object, but I don't want to
-                // cause similar problems again, and configurable:true seems safest.
-                // https://github.com/endojs/endo/issues/576#issuecomment-1178274008
-                configurable: true
-            });
-        }
-        finally {
-            return Slot;
-        }
-    })(makeSlotClass());
-
-exports.Slot = Slot;
-//# sourceMappingURL=slot.cjs.map

package/dist/cjs/node_modules/@wry/context/lib/slot.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"slot.cjs","sources":["../../../../../../node_modules/@wry/context/lib/slot.js"],"sourcesContent":["// This currentContext variable will only be used if the makeSlotClass\n// function is called, which happens only if this is the first copy of the\n// @wry/context package to be imported.\nlet currentContext = null;\n// This unique internal object is used to denote the absence of a value\n// for a given Slot, and is never exposed to outside code.\nconst MISSING_VALUE = {};\nlet idCounter = 1;\n// Although we can't do anything about the cost of duplicated code from\n// accidentally bundling multiple copies of the @wry/context package, we can\n// avoid creating the Slot class more than once using makeSlotClass.\nconst makeSlotClass = () => class Slot {\n    constructor() {\n        // If you have a Slot object, you can find out its slot.id, but you cannot\n        // guess the slot.id of a Slot you don't have access to, thanks to the\n        // randomized suffix.\n        this.id = [\n            \"slot\",\n            idCounter++,\n            Date.now(),\n            Math.random().toString(36).slice(2),\n        ].join(\":\");\n    }\n    hasValue() {\n        for (let context = currentContext; context; context = context.parent) {\n            // We use the Slot object iself as a key to its value, which means the\n            // value cannot be obtained without a reference to the Slot object.\n            if (this.id in context.slots) {\n                const value = context.slots[this.id];\n                if (value === MISSING_VALUE)\n                    break;\n                if (context !== currentContext) {\n                    // Cache the value in currentContext.slots so the next lookup will\n                    // be faster. This caching is safe because the tree of contexts and\n                    // the values of the slots are logically immutable.\n                    currentContext.slots[this.id] = value;\n                }\n                return true;\n            }\n        }\n        if (currentContext) {\n            // If a value was not found for this Slot, it's never going to be found\n            // no matter how many times we look it up, so we might as well cache\n            // the absence of the value, too.\n            currentContext.slots[this.id] = MISSING_VALUE;\n        }\n        return false;\n    }\n    getValue() {\n        if (this.hasValue()) {\n            return currentContext.slots[this.id];\n        }\n    }\n    withValue(value, callback, \n    // Given the prevalence of arrow functions, specifying arguments is likely\n    // to be much more common than specifying `this`, hence this ordering:\n    args, thisArg) {\n        const slots = {\n            __proto__: null,\n            [this.id]: value,\n        };\n        const parent = currentContext;\n        currentContext = { parent, slots };\n        try {\n            // Function.prototype.apply allows the arguments array argument to be\n            // omitted or undefined, so args! is fine here.\n            return callback.apply(thisArg, args);\n        }\n        finally {\n            currentContext = parent;\n        }\n    }\n    // Capture the current context and wrap a callback function so that it\n    // reestablishes the captured context when called.\n    static bind(callback) {\n        const context = currentContext;\n        return function () {\n            const saved = currentContext;\n            try {\n                currentContext = context;\n                return callback.apply(this, arguments);\n            }\n            finally {\n                currentContext = saved;\n            }\n        };\n    }\n    // Immediately run a callback function without any captured context.\n    static noContext(callback, \n    // Given the prevalence of arrow functions, specifying arguments is likely\n    // to be much more common than specifying `this`, hence this ordering:\n    args, thisArg) {\n        if (currentContext) {\n            const saved = currentContext;\n            try {\n                currentContext = null;\n                // Function.prototype.apply allows the arguments array argument to be\n                // omitted or undefined, so args! is fine here.\n                return callback.apply(thisArg, args);\n            }\n            finally {\n                currentContext = saved;\n            }\n        }\n        else {\n            return callback.apply(thisArg, args);\n        }\n    }\n};\nfunction maybe(fn) {\n    try {\n        return fn();\n    }\n    catch (ignored) { }\n}\n// We store a single global implementation of the Slot class as a permanent\n// non-enumerable property of the globalThis object. This obfuscation does\n// nothing to prevent access to the Slot class, but at least it ensures the\n// implementation (i.e. currentContext) cannot be tampered with, and all copies\n// of the @wry/context package (hopefully just one) will share the same Slot\n// implementation. Since the first copy of the @wry/context package to be\n// imported wins, this technique imposes a steep cost for any future breaking\n// changes to the Slot class.\nconst globalKey = \"@wry/context:Slot\";\nconst host = \n// Prefer globalThis when available.\n// https://github.com/benjamn/wryware/issues/347\nmaybe(() => globalThis) ||\n    // Fall back to global, which works in Node.js and may be converted by some\n    // bundlers to the appropriate identifier (window, self, ...) depending on the\n    // bundling target. https://github.com/endojs/endo/issues/576#issuecomment-1178515224\n    maybe(() => global) ||\n    // Otherwise, use a dummy host that's local to this module. We used to fall\n    // back to using the Array constructor as a namespace, but that was flagged in\n    // https://github.com/benjamn/wryware/issues/347, and can be avoided.\n    Object.create(null);\n// Whichever globalHost we're using, make TypeScript happy about the additional\n// globalKey property.\nconst globalHost = host;\nexport const Slot = globalHost[globalKey] ||\n    // Earlier versions of this package stored the globalKey property on the Array\n    // constructor, so we check there as well, to prevent Slot class duplication.\n    Array[globalKey] ||\n    (function (Slot) {\n        try {\n            Object.defineProperty(globalHost, globalKey, {\n                value: Slot,\n                enumerable: false,\n                writable: false,\n                // When it was possible for globalHost to be the Array constructor (a\n                // legacy Slot dedup strategy), it was important for the property to be\n                // configurable:true so it could be deleted. That does not seem to be as\n                // important when globalHost is the global object, but I don't want to\n                // cause similar problems again, and configurable:true seems safest.\n                // https://github.com/endojs/endo/issues/576#issuecomment-1178274008\n                configurable: true\n            });\n        }\n        finally {\n            return Slot;\n        }\n    })(makeSlotClass());\n//# sourceMappingURL=slot.js.map"],"names":[],"mappings":";;AAAA;AACA;AACA;AACA,IAAI,cAAc,GAAG,IAAI;AACzB;AACA;AACA,MAAM,aAAa,GAAG,EAAE;AACxB,IAAI,SAAS,GAAG,CAAC;AACjB;AACA;AACA;AACA,MAAM,aAAa,GAAG,MAAM,MAAM,IAAI,CAAC;AACvC,IAAI,WAAW,GAAG;AAClB;AACA;AACA;AACA,QAAQ,IAAI,CAAC,EAAE,GAAG;AAClB,YAAY,MAAM;AAClB,YAAY,SAAS,EAAE;AACvB,YAAY,IAAI,CAAC,GAAG,EAAE;AACtB,YAAY,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AAC/C,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC;AACnB,IAAI;AACJ,IAAI,QAAQ,GAAG;AACf,QAAQ,KAAK,IAAI,OAAO,GAAG,cAAc,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE;AAC9E;AACA;AACA,YAAY,IAAI,IAAI,CAAC,EAAE,IAAI,OAAO,CAAC,KAAK,EAAE;AAC1C,gBAAgB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;AACpD,gBAAgB,IAAI,KAAK,KAAK,aAAa;AAC3C,oBAAoB;AACpB,gBAAgB,IAAI,OAAO,KAAK,cAAc,EAAE;AAChD;AACA;AACA;AACA,oBAAoB,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK;AACzD,gBAAgB;AAChB,gBAAgB,OAAO,IAAI;AAC3B,YAAY;AACZ,QAAQ;AACR,QAAQ,IAAI,cAAc,EAAE;AAC5B;AACA;AACA;AACA,YAAY,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,aAAa;AACzD,QAAQ;AACR,QAAQ,OAAO,KAAK;AACpB,IAAI;AACJ,IAAI,QAAQ,GAAG;AACf,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,EAAE;AAC7B,YAAY,OAAO,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;AAChD,QAAQ;AACR,IAAI;AACJ,IAAI,SAAS,CAAC,KAAK,EAAE,QAAQ;AAC7B;AACA;AACA,IAAI,IAAI,EAAE,OAAO,EAAE;AACnB,QAAQ,MAAM,KAAK,GAAG;AACtB,YAAY,SAAS,EAAE,IAAI;AAC3B,YAAY,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK;AAC5B,SAAS;AACT,QAAQ,MAAM,MAAM,GAAG,cAAc;AACrC,QAAQ,cAAc,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE;AAC1C,QAAQ,IAAI;AACZ;AACA;AACA,YAAY,OAAO,QAAQ,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC;AAChD,QAAQ;AACR,gBAAgB;AAChB,YAAY,cAAc,GAAG,MAAM;AACnC,QAAQ;AACR,IAAI;AACJ;AACA;AACA,IAAI,OAAO,IAAI,CAAC,QAAQ,EAAE;AAC1B,QAAQ,MAAM,OAAO,GAAG,cAAc;AACtC,QAAQ,OAAO,YAAY;AAC3B,YAAY,MAAM,KAAK,GAAG,cAAc;AACxC,YAAY,IAAI;AAChB,gBAAgB,cAAc,GAAG,OAAO;AACxC,gBAAgB,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC;AACtD,YAAY;AACZ,oBAAoB;AACpB,gBAAgB,cAAc,GAAG,KAAK;AACtC,YAAY;AACZ,QAAQ,CAAC;AACT,IAAI;AACJ;AACA,IAAI,OAAO,SAAS,CAAC,QAAQ;AAC7B;AACA;AACA,IAAI,IAAI,EAAE,OAAO,EAAE;AACnB,QAAQ,IAAI,cAAc,EAAE;AAC5B,YAAY,MAAM,KAAK,GAAG,cAAc;AACxC,YAAY,IAAI;AAChB,gBAAgB,cAAc,GAAG,IAAI;AACrC;AACA;AACA,gBAAgB,OAAO,QAAQ,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC;AACpD,YAAY;AACZ,oBAAoB;AACpB,gBAAgB,cAAc,GAAG,KAAK;AACtC,YAAY;AACZ,QAAQ;AACR,aAAa;AACb,YAAY,OAAO,QAAQ,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC;AAChD,QAAQ;AACR,IAAI;AACJ,CAAC;AACD,SAAS,KAAK,CAAC,EAAE,EAAE;AACnB,IAAI,IAAI;AACR,QAAQ,OAAO,EAAE,EAAE;AACnB,IAAI;AACJ,IAAI,OAAO,OAAO,EAAE,EAAE;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,SAAS,GAAG,mBAAmB;AACrC,MAAM,IAAI;AACV;AACA;AACA,KAAK,CAAC,MAAM,UAAU,CAAC;AACvB;AACA;AACA;AACA,IAAI,KAAK,CAAC,MAAM,MAAM,CAAC;AACvB;AACA;AACA;AACA,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;AACvB;AACA;AACA,MAAM,UAAU,GAAG,IAAI;AACX,MAAC,IAAI,GAAG,UAAU,CAAC,SAAS,CAAC;AACzC;AACA;AACA,IAAI,KAAK,CAAC,SAAS,CAAC;AACpB,IAAI,CAAC,UAAU,IAAI,EAAE;AACrB,QAAQ,IAAI;AACZ,YAAY,MAAM,CAAC,cAAc,CAAC,UAAU,EAAE,SAAS,EAAE;AACzD,gBAAgB,KAAK,EAAE,IAAI;AAC3B,gBAAgB,UAAU,EAAE,KAAK;AACjC,gBAAgB,QAAQ,EAAE,KAAK;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,YAAY,EAAE;AAC9B,aAAa,CAAC;AACd,QAAQ;AACR,gBAAgB;AAChB,YAAY,OAAO,IAAI;AACvB,QAAQ;AACR,IAAI,CAAC,EAAE,aAAa,EAAE;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/@wry/equality/lib/index.cjs

@@ -1,199 +0,0 @@
-'use strict';
-
-const { toString, hasOwnProperty } = Object.prototype;
-const fnToStr = Function.prototype.toString;
-const previousComparisons = new Map();
-/**
- * Performs a deep equality check on two JavaScript values, tolerating cycles.
- */
-function equal(a, b) {
-    try {
-        return check(a, b);
-    }
-    finally {
-        previousComparisons.clear();
-    }
-}
-function check(a, b) {
-    // If the two values are strictly equal, our job is easy.
-    if (a === b) {
-        return true;
-    }
-    // Object.prototype.toString returns a representation of the runtime type of
-    // the given value that is considerably more precise than typeof.
-    const aTag = toString.call(a);
-    const bTag = toString.call(b);
-    // If the runtime types of a and b are different, they could maybe be equal
-    // under some interpretation of equality, but for simplicity and performance
-    // we just return false instead.
-    if (aTag !== bTag) {
-        return false;
-    }
-    switch (aTag) {
-        case '[object Array]':
-            // Arrays are a lot like other objects, but we can cheaply compare their
-            // lengths as a short-cut before comparing their elements.
-            if (a.length !== b.length)
-                return false;
-        // Fall through to object case...
-        case '[object Object]': {
-            if (previouslyCompared(a, b))
-                return true;
-            const aKeys = definedKeys(a);
-            const bKeys = definedKeys(b);
-            // If `a` and `b` have a different number of enumerable keys, they
-            // must be different.
-            const keyCount = aKeys.length;
-            if (keyCount !== bKeys.length)
-                return false;
-            // Now make sure they have the same keys.
-            for (let k = 0; k < keyCount; ++k) {
-                if (!hasOwnProperty.call(b, aKeys[k])) {
-                    return false;
-                }
-            }
-            // Finally, check deep equality of all child properties.
-            for (let k = 0; k < keyCount; ++k) {
-                const key = aKeys[k];
-                if (!check(a[key], b[key])) {
-                    return false;
-                }
-            }
-            return true;
-        }
-        case '[object Error]':
-            return a.name === b.name && a.message === b.message;
-        case '[object Number]':
-            // Handle NaN, which is !== itself.
-            if (a !== a)
-                return b !== b;
-        // Fall through to shared +a === +b case...
-        case '[object Boolean]':
-        case '[object Date]':
-            return +a === +b;
-        case '[object RegExp]':
-        case '[object String]':
-            return a == `${b}`;
-        case '[object Map]':
-        case '[object Set]': {
-            if (a.size !== b.size)
-                return false;
-            if (previouslyCompared(a, b))
-                return true;
-            const aIterator = a.entries();
-            const isMap = aTag === '[object Map]';
-            while (true) {
-                const info = aIterator.next();
-                if (info.done)
-                    break;
-                // If a instanceof Set, aValue === aKey.
-                const [aKey, aValue] = info.value;
-                // So this works the same way for both Set and Map.
-                if (!b.has(aKey)) {
-                    return false;
-                }
-                // However, we care about deep equality of values only when dealing
-                // with Map structures.
-                if (isMap && !check(aValue, b.get(aKey))) {
-                    return false;
-                }
-            }
-            return true;
-        }
-        case '[object Uint16Array]':
-        case '[object Uint8Array]': // Buffer, in Node.js.
-        case '[object Uint32Array]':
-        case '[object Int32Array]':
-        case '[object Int8Array]':
-        case '[object Int16Array]':
-        case '[object ArrayBuffer]':
-            // DataView doesn't need these conversions, but the equality check is
-            // otherwise the same.
-            a = new Uint8Array(a);
-            b = new Uint8Array(b);
-        // Fall through...
-        case '[object DataView]': {
-            let len = a.byteLength;
-            if (len === b.byteLength) {
-                while (len-- && a[len] === b[len]) {
-                    // Keep looping as long as the bytes are equal.
-                }
-            }
-            return len === -1;
-        }
-        case '[object AsyncFunction]':
-        case '[object GeneratorFunction]':
-        case '[object AsyncGeneratorFunction]':
-        case '[object Function]': {
-            const aCode = fnToStr.call(a);
-            if (aCode !== fnToStr.call(b)) {
-                return false;
-            }
-            // We consider non-native functions equal if they have the same code
-            // (native functions require === because their code is censored).
-            // Note that this behavior is not entirely sound, since !== function
-            // objects with the same code can behave differently depending on
-            // their closure scope. However, any function can behave differently
-            // depending on the values of its input arguments (including this)
-            // and its calling context (including its closure scope), even
-            // though the function object is === to itself; and it is entirely
-            // possible for functions that are not === to behave exactly the
-            // same under all conceivable circumstances. Because none of these
-            // factors are statically decidable in JavaScript, JS function
-            // equality is not well-defined. This ambiguity allows us to
-            // consider the best possible heuristic among various imperfect
-            // options, and equating non-native functions that have the same
-            // code has enormous practical benefits, such as when comparing
-            // functions that are repeatedly passed as fresh function
-            // expressions within objects that are otherwise deeply equal. Since
-            // any function created from the same syntactic expression (in the
-            // same code location) will always stringify to the same code
-            // according to fnToStr.call, we can reasonably expect these
-            // repeatedly passed function expressions to have the same code, and
-            // thus behave "the same" (with all the caveats mentioned above),
-            // even though the runtime function objects are !== to one another.
-            return !endsWith(aCode, nativeCodeSuffix);
-        }
-    }
-    // Otherwise the values are not equal.
-    return false;
-}
-function definedKeys(obj) {
-    // Remember that the second argument to Array.prototype.filter will be
-    // used as `this` within the callback function.
-    return Object.keys(obj).filter(isDefinedKey, obj);
-}
-function isDefinedKey(key) {
-    return this[key] !== void 0;
-}
-const nativeCodeSuffix = "{ [native code] }";
-function endsWith(full, suffix) {
-    const fromIndex = full.length - suffix.length;
-    return fromIndex >= 0 &&
-        full.indexOf(suffix, fromIndex) === fromIndex;
-}
-function previouslyCompared(a, b) {
-    // Though cyclic references can make an object graph appear infinite from the
-    // perspective of a depth-first traversal, the graph still contains a finite
-    // number of distinct object references. We use the previousComparisons cache
-    // to avoid comparing the same pair of object references more than once, which
-    // guarantees termination (even if we end up comparing every object in one
-    // graph to every object in the other graph, which is extremely unlikely),
-    // while still allowing weird isomorphic structures (like rings with different
-    // lengths) a chance to pass the equality test.
-    let bSet = previousComparisons.get(a);
-    if (bSet) {
-        // Return true here because we can be sure false will be returned somewhere
-        // else if the objects are not equivalent.
-        if (bSet.has(b))
-            return true;
-    }
-    else {
-        previousComparisons.set(a, bSet = new Set);
-    }
-    bSet.add(b);
-    return false;
-}
-
-exports.equal = equal;
-//# sourceMappingURL=index.cjs.map

package/dist/cjs/node_modules/@wry/equality/lib/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../../node_modules/@wry/equality/lib/index.js"],"sourcesContent":["const { toString, hasOwnProperty } = Object.prototype;\nconst fnToStr = Function.prototype.toString;\nconst previousComparisons = new Map();\n/**\n * Performs a deep equality check on two JavaScript values, tolerating cycles.\n */\nexport function equal(a, b) {\n    try {\n        return check(a, b);\n    }\n    finally {\n        previousComparisons.clear();\n    }\n}\n// Allow default imports as well.\nexport default equal;\nfunction check(a, b) {\n    // If the two values are strictly equal, our job is easy.\n    if (a === b) {\n        return true;\n    }\n    // Object.prototype.toString returns a representation of the runtime type of\n    // the given value that is considerably more precise than typeof.\n    const aTag = toString.call(a);\n    const bTag = toString.call(b);\n    // If the runtime types of a and b are different, they could maybe be equal\n    // under some interpretation of equality, but for simplicity and performance\n    // we just return false instead.\n    if (aTag !== bTag) {\n        return false;\n    }\n    switch (aTag) {\n        case '[object Array]':\n            // Arrays are a lot like other objects, but we can cheaply compare their\n            // lengths as a short-cut before comparing their elements.\n            if (a.length !== b.length)\n                return false;\n        // Fall through to object case...\n        case '[object Object]': {\n            if (previouslyCompared(a, b))\n                return true;\n            const aKeys = definedKeys(a);\n            const bKeys = definedKeys(b);\n            // If `a` and `b` have a different number of enumerable keys, they\n            // must be different.\n            const keyCount = aKeys.length;\n            if (keyCount !== bKeys.length)\n                return false;\n            // Now make sure they have the same keys.\n            for (let k = 0; k < keyCount; ++k) {\n                if (!hasOwnProperty.call(b, aKeys[k])) {\n                    return false;\n                }\n            }\n            // Finally, check deep equality of all child properties.\n            for (let k = 0; k < keyCount; ++k) {\n                const key = aKeys[k];\n                if (!check(a[key], b[key])) {\n                    return false;\n                }\n            }\n            return true;\n        }\n        case '[object Error]':\n            return a.name === b.name && a.message === b.message;\n        case '[object Number]':\n            // Handle NaN, which is !== itself.\n            if (a !== a)\n                return b !== b;\n        // Fall through to shared +a === +b case...\n        case '[object Boolean]':\n        case '[object Date]':\n            return +a === +b;\n        case '[object RegExp]':\n        case '[object String]':\n            return a == `${b}`;\n        case '[object Map]':\n        case '[object Set]': {\n            if (a.size !== b.size)\n                return false;\n            if (previouslyCompared(a, b))\n                return true;\n            const aIterator = a.entries();\n            const isMap = aTag === '[object Map]';\n            while (true) {\n                const info = aIterator.next();\n                if (info.done)\n                    break;\n                // If a instanceof Set, aValue === aKey.\n                const [aKey, aValue] = info.value;\n                // So this works the same way for both Set and Map.\n                if (!b.has(aKey)) {\n                    return false;\n                }\n                // However, we care about deep equality of values only when dealing\n                // with Map structures.\n                if (isMap && !check(aValue, b.get(aKey))) {\n                    return false;\n                }\n            }\n            return true;\n        }\n        case '[object Uint16Array]':\n        case '[object Uint8Array]': // Buffer, in Node.js.\n        case '[object Uint32Array]':\n        case '[object Int32Array]':\n        case '[object Int8Array]':\n        case '[object Int16Array]':\n        case '[object ArrayBuffer]':\n            // DataView doesn't need these conversions, but the equality check is\n            // otherwise the same.\n            a = new Uint8Array(a);\n            b = new Uint8Array(b);\n        // Fall through...\n        case '[object DataView]': {\n            let len = a.byteLength;\n            if (len === b.byteLength) {\n                while (len-- && a[len] === b[len]) {\n                    // Keep looping as long as the bytes are equal.\n                }\n            }\n            return len === -1;\n        }\n        case '[object AsyncFunction]':\n        case '[object GeneratorFunction]':\n        case '[object AsyncGeneratorFunction]':\n        case '[object Function]': {\n            const aCode = fnToStr.call(a);\n            if (aCode !== fnToStr.call(b)) {\n                return false;\n            }\n            // We consider non-native functions equal if they have the same code\n            // (native functions require === because their code is censored).\n            // Note that this behavior is not entirely sound, since !== function\n            // objects with the same code can behave differently depending on\n            // their closure scope. However, any function can behave differently\n            // depending on the values of its input arguments (including this)\n            // and its calling context (including its closure scope), even\n            // though the function object is === to itself; and it is entirely\n            // possible for functions that are not === to behave exactly the\n            // same under all conceivable circumstances. Because none of these\n            // factors are statically decidable in JavaScript, JS function\n            // equality is not well-defined. This ambiguity allows us to\n            // consider the best possible heuristic among various imperfect\n            // options, and equating non-native functions that have the same\n            // code has enormous practical benefits, such as when comparing\n            // functions that are repeatedly passed as fresh function\n            // expressions within objects that are otherwise deeply equal. Since\n            // any function created from the same syntactic expression (in the\n            // same code location) will always stringify to the same code\n            // according to fnToStr.call, we can reasonably expect these\n            // repeatedly passed function expressions to have the same code, and\n            // thus behave \"the same\" (with all the caveats mentioned above),\n            // even though the runtime function objects are !== to one another.\n            return !endsWith(aCode, nativeCodeSuffix);\n        }\n    }\n    // Otherwise the values are not equal.\n    return false;\n}\nfunction definedKeys(obj) {\n    // Remember that the second argument to Array.prototype.filter will be\n    // used as `this` within the callback function.\n    return Object.keys(obj).filter(isDefinedKey, obj);\n}\nfunction isDefinedKey(key) {\n    return this[key] !== void 0;\n}\nconst nativeCodeSuffix = \"{ [native code] }\";\nfunction endsWith(full, suffix) {\n    const fromIndex = full.length - suffix.length;\n    return fromIndex >= 0 &&\n        full.indexOf(suffix, fromIndex) === fromIndex;\n}\nfunction previouslyCompared(a, b) {\n    // Though cyclic references can make an object graph appear infinite from the\n    // perspective of a depth-first traversal, the graph still contains a finite\n    // number of distinct object references. We use the previousComparisons cache\n    // to avoid comparing the same pair of object references more than once, which\n    // guarantees termination (even if we end up comparing every object in one\n    // graph to every object in the other graph, which is extremely unlikely),\n    // while still allowing weird isomorphic structures (like rings with different\n    // lengths) a chance to pass the equality test.\n    let bSet = previousComparisons.get(a);\n    if (bSet) {\n        // Return true here because we can be sure false will be returned somewhere\n        // else if the objects are not equivalent.\n        if (bSet.has(b))\n            return true;\n    }\n    else {\n        previousComparisons.set(a, bSet = new Set);\n    }\n    bSet.add(b);\n    return false;\n}\n//# sourceMappingURL=index.js.map"],"names":[],"mappings":";;AAAA,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAE,GAAG,MAAM,CAAC,SAAS;AACrD,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ;AAC3C,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAE;AACrC;AACA;AACA;AACO,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;AAC5B,IAAI,IAAI;AACR,QAAQ,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;AAC1B,IAAI;AACJ,YAAY;AACZ,QAAQ,mBAAmB,CAAC,KAAK,EAAE;AACnC,IAAI;AACJ;AAGA,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;AACrB;AACA,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE;AACjB,QAAQ,OAAO,IAAI;AACnB,IAAI;AACJ;AACA;AACA,IAAI,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;AACjC,IAAI,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;AACjC;AACA;AACA;AACA,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE;AACvB,QAAQ,OAAO,KAAK;AACpB,IAAI;AACJ,IAAI,QAAQ,IAAI;AAChB,QAAQ,KAAK,gBAAgB;AAC7B;AACA;AACA,YAAY,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;AACrC,gBAAgB,OAAO,KAAK;AAC5B;AACA,QAAQ,KAAK,iBAAiB,EAAE;AAChC,YAAY,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC;AACxC,gBAAgB,OAAO,IAAI;AAC3B,YAAY,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC;AACxC,YAAY,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC;AACxC;AACA;AACA,YAAY,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM;AACzC,YAAY,IAAI,QAAQ,KAAK,KAAK,CAAC,MAAM;AACzC,gBAAgB,OAAO,KAAK;AAC5B;AACA,YAAY,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,EAAE,CAAC,EAAE;AAC/C,gBAAgB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;AACvD,oBAAoB,OAAO,KAAK;AAChC,gBAAgB;AAChB,YAAY;AACZ;AACA,YAAY,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,EAAE,CAAC,EAAE;AAC/C,gBAAgB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC;AACpC,gBAAgB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;AAC5C,oBAAoB,OAAO,KAAK;AAChC,gBAAgB;AAChB,YAAY;AACZ,YAAY,OAAO,IAAI;AACvB,QAAQ;AACR,QAAQ,KAAK,gBAAgB;AAC7B,YAAY,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO;AAC/D,QAAQ,KAAK,iBAAiB;AAC9B;AACA,YAAY,IAAI,CAAC,KAAK,CAAC;AACvB,gBAAgB,OAAO,CAAC,KAAK,CAAC;AAC9B;AACA,QAAQ,KAAK,kBAAkB;AAC/B,QAAQ,KAAK,eAAe;AAC5B,YAAY,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC;AAC5B,QAAQ,KAAK,iBAAiB;AAC9B,QAAQ,KAAK,iBAAiB;AAC9B,YAAY,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9B,QAAQ,KAAK,cAAc;AAC3B,QAAQ,KAAK,cAAc,EAAE;AAC7B,YAAY,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;AACjC,gBAAgB,OAAO,KAAK;AAC5B,YAAY,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC;AACxC,gBAAgB,OAAO,IAAI;AAC3B,YAAY,MAAM,SAAS,GAAG,CAAC,CAAC,OAAO,EAAE;AACzC,YAAY,MAAM,KAAK,GAAG,IAAI,KAAK,cAAc;AACjD,YAAY,OAAO,IAAI,EAAE;AACzB,gBAAgB,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE;AAC7C,gBAAgB,IAAI,IAAI,CAAC,IAAI;AAC7B,oBAAoB;AACpB;AACA,gBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK;AACjD;AACA,gBAAgB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AAClC,oBAAoB,OAAO,KAAK;AAChC,gBAAgB;AAChB;AACA;AACA,gBAAgB,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE;AAC1D,oBAAoB,OAAO,KAAK;AAChC,gBAAgB;AAChB,YAAY;AACZ,YAAY,OAAO,IAAI;AACvB,QAAQ;AACR,QAAQ,KAAK,sBAAsB;AACnC,QAAQ,KAAK,qBAAqB,CAAC;AACnC,QAAQ,KAAK,sBAAsB;AACnC,QAAQ,KAAK,qBAAqB;AAClC,QAAQ,KAAK,oBAAoB;AACjC,QAAQ,KAAK,qBAAqB;AAClC,QAAQ,KAAK,sBAAsB;AACnC;AACA;AACA,YAAY,CAAC,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC;AACjC,YAAY,CAAC,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC;AACjC;AACA,QAAQ,KAAK,mBAAmB,EAAE;AAClC,YAAY,IAAI,GAAG,GAAG,CAAC,CAAC,UAAU;AAClC,YAAY,IAAI,GAAG,KAAK,CAAC,CAAC,UAAU,EAAE;AACtC,gBAAgB,OAAO,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE;AACnD;AACA,gBAAgB;AAChB,YAAY;AACZ,YAAY,OAAO,GAAG,KAAK,EAAE;AAC7B,QAAQ;AACR,QAAQ,KAAK,wBAAwB;AACrC,QAAQ,KAAK,4BAA4B;AACzC,QAAQ,KAAK,iCAAiC;AAC9C,QAAQ,KAAK,mBAAmB,EAAE;AAClC,YAAY,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;AACzC,YAAY,IAAI,KAAK,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;AAC3C,gBAAgB,OAAO,KAAK;AAC5B,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,gBAAgB,CAAC;AACrD,QAAQ;AACR;AACA;AACA,IAAI,OAAO,KAAK;AAChB;AACA,SAAS,WAAW,CAAC,GAAG,EAAE;AAC1B;AACA;AACA,IAAI,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,YAAY,EAAE,GAAG,CAAC;AACrD;AACA,SAAS,YAAY,CAAC,GAAG,EAAE;AAC3B,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,MAAM;AAC/B;AACA,MAAM,gBAAgB,GAAG,mBAAmB;AAC5C,SAAS,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE;AAChC,IAAI,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;AACjD,IAAI,OAAO,SAAS,IAAI,CAAC;AACzB,QAAQ,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,SAAS;AACrD;AACA,SAAS,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,IAAI,IAAI,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC;AACzC,IAAI,IAAI,IAAI,EAAE;AACd;AACA;AACA,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACvB,YAAY,OAAO,IAAI;AACvB,IAAI;AACJ,SAAS;AACT,QAAQ,mBAAmB,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,CAAC;AAClD,IAAI;AACJ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACf,IAAI,OAAO,KAAK;AAChB;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/@wry/trie/lib/index.cjs

@@ -1,86 +0,0 @@
-'use strict';
-
-// A [trie](https://en.wikipedia.org/wiki/Trie) data structure that holds
-// object keys weakly, yet can also hold non-object keys, unlike the
-// native `WeakMap`.
-// If no makeData function is supplied, the looked-up data will be an empty,
-// null-prototype Object.
-const defaultMakeData = () => Object.create(null);
-// Useful for processing arguments objects as well as arrays.
-const { forEach, slice } = Array.prototype;
-const { hasOwnProperty } = Object.prototype;
-class Trie {
-    constructor(weakness = true, makeData = defaultMakeData) {
-        this.weakness = weakness;
-        this.makeData = makeData;
-    }
-    lookup() {
-        return this.lookupArray(arguments);
-    }
-    lookupArray(array) {
-        let node = this;
-        forEach.call(array, key => node = node.getChildTrie(key));
-        return hasOwnProperty.call(node, "data")
-            ? node.data
-            : node.data = this.makeData(slice.call(array));
-    }
-    peek() {
-        return this.peekArray(arguments);
-    }
-    peekArray(array) {
-        let node = this;
-        for (let i = 0, len = array.length; node && i < len; ++i) {
-            const map = node.mapFor(array[i], false);
-            node = map && map.get(array[i]);
-        }
-        return node && node.data;
-    }
-    remove() {
-        return this.removeArray(arguments);
-    }
-    removeArray(array) {
-        let data;
-        if (array.length) {
-            const head = array[0];
-            const map = this.mapFor(head, false);
-            const child = map && map.get(head);
-            if (child) {
-                data = child.removeArray(slice.call(array, 1));
-                if (!child.data && !child.weak && !(child.strong && child.strong.size)) {
-                    map.delete(head);
-                }
-            }
-        }
-        else {
-            data = this.data;
-            delete this.data;
-        }
-        return data;
-    }
-    getChildTrie(key) {
-        const map = this.mapFor(key, true);
-        let child = map.get(key);
-        if (!child)
-            map.set(key, child = new Trie(this.weakness, this.makeData));
-        return child;
-    }
-    mapFor(key, create) {
-        return this.weakness && isObjRef(key)
-            ? this.weak || (create ? this.weak = new WeakMap : void 0)
-            : this.strong || (create ? this.strong = new Map : void 0);
-    }
-}
-function isObjRef(value) {
-    switch (typeof value) {
-        case "object":
-            if (value === null)
-                break;
-        // Fall through to return true...
-        case "function":
-            return true;
-    }
-    return false;
-}
-
-exports.Trie = Trie;
-//# sourceMappingURL=index.cjs.map

package/dist/cjs/node_modules/@wry/trie/lib/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../../node_modules/@wry/trie/lib/index.js"],"sourcesContent":["// A [trie](https://en.wikipedia.org/wiki/Trie) data structure that holds\n// object keys weakly, yet can also hold non-object keys, unlike the\n// native `WeakMap`.\n// If no makeData function is supplied, the looked-up data will be an empty,\n// null-prototype Object.\nconst defaultMakeData = () => Object.create(null);\n// Useful for processing arguments objects as well as arrays.\nconst { forEach, slice } = Array.prototype;\nconst { hasOwnProperty } = Object.prototype;\nexport class Trie {\n    constructor(weakness = true, makeData = defaultMakeData) {\n        this.weakness = weakness;\n        this.makeData = makeData;\n    }\n    lookup() {\n        return this.lookupArray(arguments);\n    }\n    lookupArray(array) {\n        let node = this;\n        forEach.call(array, key => node = node.getChildTrie(key));\n        return hasOwnProperty.call(node, \"data\")\n            ? node.data\n            : node.data = this.makeData(slice.call(array));\n    }\n    peek() {\n        return this.peekArray(arguments);\n    }\n    peekArray(array) {\n        let node = this;\n        for (let i = 0, len = array.length; node && i < len; ++i) {\n            const map = node.mapFor(array[i], false);\n            node = map && map.get(array[i]);\n        }\n        return node && node.data;\n    }\n    remove() {\n        return this.removeArray(arguments);\n    }\n    removeArray(array) {\n        let data;\n        if (array.length) {\n            const head = array[0];\n            const map = this.mapFor(head, false);\n            const child = map && map.get(head);\n            if (child) {\n                data = child.removeArray(slice.call(array, 1));\n                if (!child.data && !child.weak && !(child.strong && child.strong.size)) {\n                    map.delete(head);\n                }\n            }\n        }\n        else {\n            data = this.data;\n            delete this.data;\n        }\n        return data;\n    }\n    getChildTrie(key) {\n        const map = this.mapFor(key, true);\n        let child = map.get(key);\n        if (!child)\n            map.set(key, child = new Trie(this.weakness, this.makeData));\n        return child;\n    }\n    mapFor(key, create) {\n        return this.weakness && isObjRef(key)\n            ? this.weak || (create ? this.weak = new WeakMap : void 0)\n            : this.strong || (create ? this.strong = new Map : void 0);\n    }\n}\nfunction isObjRef(value) {\n    switch (typeof value) {\n        case \"object\":\n            if (value === null)\n                break;\n        // Fall through to return true...\n        case \"function\":\n            return true;\n    }\n    return false;\n}\n//# sourceMappingURL=index.js.map"],"names":[],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA,MAAM,eAAe,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;AACjD;AACA,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,SAAS;AAC1C,MAAM,EAAE,cAAc,EAAE,GAAG,MAAM,CAAC,SAAS;AACpC,MAAM,IAAI,CAAC;AAClB,IAAI,WAAW,CAAC,QAAQ,GAAG,IAAI,EAAE,QAAQ,GAAG,eAAe,EAAE;AAC7D,QAAQ,IAAI,CAAC,QAAQ,GAAG,QAAQ;AAChC,QAAQ,IAAI,CAAC,QAAQ,GAAG,QAAQ;AAChC,IAAI;AACJ,IAAI,MAAM,GAAG;AACb,QAAQ,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC;AAC1C,IAAI;AACJ,IAAI,WAAW,CAAC,KAAK,EAAE;AACvB,QAAQ,IAAI,IAAI,GAAG,IAAI;AACvB,QAAQ,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;AACjE,QAAQ,OAAO,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM;AAC/C,cAAc,IAAI,CAAC;AACnB,cAAc,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC1D,IAAI;AACJ,IAAI,IAAI,GAAG;AACX,QAAQ,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC;AACxC,IAAI;AACJ,IAAI,SAAS,CAAC,KAAK,EAAE;AACrB,QAAQ,IAAI,IAAI,GAAG,IAAI;AACvB,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,EAAE;AAClE,YAAY,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;AACpD,YAAY,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAC3C,QAAQ;AACR,QAAQ,OAAO,IAAI,IAAI,IAAI,CAAC,IAAI;AAChC,IAAI;AACJ,IAAI,MAAM,GAAG;AACb,QAAQ,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC;AAC1C,IAAI;AACJ,IAAI,WAAW,CAAC,KAAK,EAAE;AACvB,QAAQ,IAAI,IAAI;AAChB,QAAQ,IAAI,KAAK,CAAC,MAAM,EAAE;AAC1B,YAAY,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC;AACjC,YAAY,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC;AAChD,YAAY,MAAM,KAAK,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;AAC9C,YAAY,IAAI,KAAK,EAAE;AACvB,gBAAgB,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AAC9D,gBAAgB,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;AACxF,oBAAoB,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;AACpC,gBAAgB;AAChB,YAAY;AACZ,QAAQ;AACR,aAAa;AACb,YAAY,IAAI,GAAG,IAAI,CAAC,IAAI;AAC5B,YAAY,OAAO,IAAI,CAAC,IAAI;AAC5B,QAAQ;AACR,QAAQ,OAAO,IAAI;AACnB,IAAI;AACJ,IAAI,YAAY,CAAC,GAAG,EAAE;AACtB,QAAQ,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC;AAC1C,QAAQ,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;AAChC,QAAQ,IAAI,CAAC,KAAK;AAClB,YAAY,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;AACxE,QAAQ,OAAO,KAAK;AACpB,IAAI;AACJ,IAAI,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE;AACxB,QAAQ,OAAO,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,GAAG;AAC5C,cAAc,IAAI,CAAC,IAAI,KAAK,MAAM,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,OAAO,GAAG,MAAM;AACrE,cAAc,IAAI,CAAC,MAAM,KAAK,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,GAAG,MAAM,CAAC;AACtE,IAAI;AACJ;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE;AACzB,IAAI,QAAQ,OAAO,KAAK;AACxB,QAAQ,KAAK,QAAQ;AACrB,YAAY,IAAI,KAAK,KAAK,IAAI;AAC9B,gBAAgB;AAChB;AACA,QAAQ,KAAK,UAAU;AACvB,YAAY,OAAO,IAAI;AACvB;AACA,IAAI,OAAO,KAAK;AAChB;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/asynckit/index.cjs

@@ -1,23 +0,0 @@
-'use strict';
-
-var parallel = require('./parallel.cjs');
-var serial = require('./serial.cjs');
-var serialOrdered = require('./serialOrdered.cjs');
-
-var asynckit;
-var hasRequiredAsynckit;
-
-function requireAsynckit () {
-	if (hasRequiredAsynckit) return asynckit;
-	hasRequiredAsynckit = 1;
-	asynckit =
-	{
-	  parallel      : parallel.__require(),
-	  serial        : serial.__require(),
-	  serialOrdered : serialOrdered.__require()
-	};
-	return asynckit;
-}
-
-exports.__require = requireAsynckit;
-//# sourceMappingURL=index.cjs.map

package/dist/cjs/node_modules/asynckit/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.cjs","sources":["../../../../node_modules/asynckit/index.js"],"sourcesContent":["module.exports =\n{\n  parallel      : require('./parallel.js'),\n  serial        : require('./serial.js'),\n  serialOrdered : require('./serialOrdered.js')\n};\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;;;AAAA,CAAA,QAAc;AACd,CAAA;GACE,QAAQ,QAAQA,kBAAA,EAAwB;GACxC,MAAM,UAAUC,gBAAA,EAAsB;AACxC,GAAE,aAAa,GAAGC,uBAAA;EACjB;;;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/asynckit/lib/abort.cjs

@@ -1,42 +0,0 @@
-'use strict';
-
-var abort_1;
-var hasRequiredAbort;
-
-function requireAbort () {
-	if (hasRequiredAbort) return abort_1;
-	hasRequiredAbort = 1;
-	// API
-	abort_1 = abort;
-
-	/**
-	 * Aborts leftover active jobs
-	 *
-	 * @param {object} state - current state object
-	 */
-	function abort(state)
-	{
-	  Object.keys(state.jobs).forEach(clean.bind(state));
-
-	  // reset leftover jobs
-	  state.jobs = {};
-	}
-
-	/**
-	 * Cleans up leftover job by invoking abort function for the provided job id
-	 *
-	 * @this  state
-	 * @param {string|number} key - job id to abort
-	 */
-	function clean(key)
-	{
-	  if (typeof this.jobs[key] == 'function')
-	  {
-	    this.jobs[key]();
-	  }
-	}
-	return abort_1;
-}
-
-exports.__require = requireAbort;
-//# sourceMappingURL=abort.cjs.map

package/dist/cjs/node_modules/asynckit/lib/abort.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"abort.cjs","sources":["../../../../../node_modules/asynckit/lib/abort.js"],"sourcesContent":["// API\nmodule.exports = abort;\n\n/**\n * Aborts leftover active jobs\n *\n * @param {object} state - current state object\n */\nfunction abort(state)\n{\n  Object.keys(state.jobs).forEach(clean.bind(state));\n\n  // reset leftover jobs\n  state.jobs = {};\n}\n\n/**\n * Cleans up leftover job by invoking abort function for the provided job id\n *\n * @this  state\n * @param {string|number} key - job id to abort\n */\nfunction clean(key)\n{\n  if (typeof this.jobs[key] == 'function')\n  {\n    this.jobs[key]();\n  }\n}\n"],"names":[],"mappings":";;;;;;;;AAAA;AACA,CAAA,OAAc,GAAG,KAAK;;AAEtB;AACA;AACA;AACA;AACA;CACA,SAAS,KAAK,CAAC,KAAK;AACpB,CAAA;AACA,GAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;AAEpD;AACA,GAAE,KAAK,CAAC,IAAI,GAAG,EAAE;AACjB,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,KAAK,CAAC,GAAG;AAClB,CAAA;GACE,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,UAAU;GACvC;AACF,KAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;AACpB,GAAA;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/asynckit/lib/async.cjs

@@ -1,49 +0,0 @@
-'use strict';
-
-var defer = require('./defer.cjs');
-
-var async_1;
-var hasRequiredAsync;
-
-function requireAsync () {
-	if (hasRequiredAsync) return async_1;
-	hasRequiredAsync = 1;
-	var defer$1 = defer.__require();
-
-	// API
-	async_1 = async;
-
-	/**
-	 * Runs provided callback asynchronously
-	 * even if callback itself is not
-	 *
-	 * @param   {function} callback - callback to invoke
-	 * @returns {function} - augmented callback
-	 */
-	function async(callback)
-	{
-	  var isAsync = false;
-
-	  // check if async happened
-	  defer$1(function() { isAsync = true; });
-
-	  return function async_callback(err, result)
-	  {
-	    if (isAsync)
-	    {
-	      callback(err, result);
-	    }
-	    else
-	    {
-	      defer$1(function nextTick_callback()
-	      {
-	        callback(err, result);
-	      });
-	    }
-	  };
-	}
-	return async_1;
-}
-
-exports.__require = requireAsync;
-//# sourceMappingURL=async.cjs.map

package/dist/cjs/node_modules/asynckit/lib/async.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"async.cjs","sources":["../../../../../node_modules/asynckit/lib/async.js"],"sourcesContent":["var defer = require('./defer.js');\n\n// API\nmodule.exports = async;\n\n/**\n * Runs provided callback asynchronously\n * even if callback itself is not\n *\n * @param   {function} callback - callback to invoke\n * @returns {function} - augmented callback\n */\nfunction async(callback)\n{\n  var isAsync = false;\n\n  // check if async happened\n  defer(function() { isAsync = true; });\n\n  return function async_callback(err, result)\n  {\n    if (isAsync)\n    {\n      callback(err, result);\n    }\n    else\n    {\n      defer(function nextTick_callback()\n      {\n        callback(err, result);\n      });\n    }\n  };\n}\n"],"names":["defer","require$$0"],"mappings":";;;;;;;;;;CAAA,IAAIA,OAAK,GAAGC,eAAA,EAAqB;;AAEjC;AACA,CAAA,OAAc,GAAG,KAAK;;AAEtB;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,KAAK,CAAC,QAAQ;AACvB,CAAA;GACE,IAAI,OAAO,GAAG,KAAK;;AAErB;GACED,OAAK,CAAC,WAAW,EAAE,OAAO,GAAG,IAAI,CAAC,CAAA,CAAE,CAAC;;AAEvC,GAAE,OAAO,SAAS,cAAc,CAAC,GAAG,EAAE,MAAM;GAC1C;AACF,KAAI,IAAI,OAAO;KACX;AACJ,OAAM,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;AAC3B,KAAA;AACA;KACI;OACEA,OAAK,CAAC,SAAS,iBAAiB;OAChC;AACN,SAAQ,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;AAC7B,OAAA,CAAO,CAAC;AACR,KAAA;GACA,CAAG;AACH,CAAA;;;;;;","x_google_ignoreList":[0]}