use-abcd 0.2.1 → 1.0.1

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../node_modules/mutative/dist/mutative.esm.mjs","../node_modules/lodash-es/_freeGlobal.js","../node_modules/lodash-es/_root.js","../node_modules/lodash-es/_Symbol.js","../node_modules/lodash-es/_getRawTag.js","../node_modules/lodash-es/_objectToString.js","../node_modules/lodash-es/_baseGetTag.js","../node_modules/lodash-es/isObjectLike.js","../node_modules/lodash-es/isSymbol.js","../node_modules/lodash-es/_arrayMap.js","../node_modules/lodash-es/isArray.js","../node_modules/lodash-es/_baseToString.js","../node_modules/lodash-es/_trimmedEndIndex.js","../node_modules/lodash-es/_baseTrim.js","../node_modules/lodash-es/isObject.js","../node_modules/lodash-es/toNumber.js","../node_modules/lodash-es/toFinite.js","../node_modules/lodash-es/toInteger.js","../node_modules/lodash-es/identity.js","../node_modules/lodash-es/isFunction.js","../node_modules/lodash-es/_coreJsData.js","../node_modules/lodash-es/_isMasked.js","../node_modules/lodash-es/_toSource.js","../node_modules/lodash-es/_baseIsNative.js","../node_modules/lodash-es/_getValue.js","../node_modules/lodash-es/_getNative.js","../node_modules/lodash-es/_WeakMap.js","../node_modules/lodash-es/_baseFindIndex.js","../node_modules/lodash-es/_isIndex.js","../node_modules/lodash-es/eq.js","../node_modules/lodash-es/isLength.js","../node_modules/lodash-es/isArrayLike.js","../node_modules/lodash-es/_isPrototype.js","../node_modules/lodash-es/_baseTimes.js","../node_modules/lodash-es/_baseIsArguments.js","../node_modules/lodash-es/isArguments.js","../node_modules/lodash-es/stubFalse.js","../node_modules/lodash-es/isBuffer.js","../node_modules/lodash-es/_baseIsTypedArray.js","../node_modules/lodash-es/_baseUnary.js","../node_modules/lodash-es/_nodeUtil.js","../node_modules/lodash-es/isTypedArray.js","../node_modules/lodash-es/_arrayLikeKeys.js","../node_modules/lodash-es/_overArg.js","../node_modules/lodash-es/_nativeKeys.js","../node_modules/lodash-es/_baseKeys.js","../node_modules/lodash-es/keys.js","../node_modules/lodash-es/_isKey.js","../node_modules/lodash-es/_nativeCreate.js","../node_modules/lodash-es/_hashClear.js","../node_modules/lodash-es/_hashDelete.js","../node_modules/lodash-es/_hashGet.js","../node_modules/lodash-es/_hashHas.js","../node_modules/lodash-es/_hashSet.js","../node_modules/lodash-es/_Hash.js","../node_modules/lodash-es/_listCacheClear.js","../node_modules/lodash-es/_assocIndexOf.js","../node_modules/lodash-es/_listCacheDelete.js","../node_modules/lodash-es/_listCacheGet.js","../node_modules/lodash-es/_listCacheHas.js","../node_modules/lodash-es/_listCacheSet.js","../node_modules/lodash-es/_ListCache.js","../node_modules/lodash-es/_Map.js","../node_modules/lodash-es/_mapCacheClear.js","../node_modules/lodash-es/_isKeyable.js","../node_modules/lodash-es/_getMapData.js","../node_modules/lodash-es/_mapCacheDelete.js","../node_modules/lodash-es/_mapCacheGet.js","../node_modules/lodash-es/_mapCacheHas.js","../node_modules/lodash-es/_mapCacheSet.js","../node_modules/lodash-es/_MapCache.js","../node_modules/lodash-es/memoize.js","../node_modules/lodash-es/_memoizeCapped.js","../node_modules/lodash-es/_stringToPath.js","../node_modules/lodash-es/toString.js","../node_modules/lodash-es/_castPath.js","../node_modules/lodash-es/_toKey.js","../node_modules/lodash-es/_baseGet.js","../node_modules/lodash-es/get.js","../node_modules/lodash-es/_arrayPush.js","../node_modules/lodash-es/_isFlattenable.js","../node_modules/lodash-es/_baseFlatten.js","../node_modules/lodash-es/_stackClear.js","../node_modules/lodash-es/_stackDelete.js","../node_modules/lodash-es/_stackGet.js","../node_modules/lodash-es/_stackHas.js","../node_modules/lodash-es/_stackSet.js","../node_modules/lodash-es/_Stack.js","../node_modules/lodash-es/_arrayFilter.js","../node_modules/lodash-es/stubArray.js","../node_modules/lodash-es/_getSymbols.js","../node_modules/lodash-es/_baseGetAllKeys.js","../node_modules/lodash-es/_getAllKeys.js","../node_modules/lodash-es/_DataView.js","../node_modules/lodash-es/_Promise.js","../node_modules/lodash-es/_Set.js","../node_modules/lodash-es/_getTag.js","../node_modules/lodash-es/_Uint8Array.js","../node_modules/lodash-es/_setCacheAdd.js","../node_modules/lodash-es/_setCacheHas.js","../node_modules/lodash-es/_SetCache.js","../node_modules/lodash-es/_arraySome.js","../node_modules/lodash-es/_cacheHas.js","../node_modules/lodash-es/_equalArrays.js","../node_modules/lodash-es/_mapToArray.js","../node_modules/lodash-es/_setToArray.js","../node_modules/lodash-es/_equalByTag.js","../node_modules/lodash-es/_equalObjects.js","../node_modules/lodash-es/_baseIsEqualDeep.js","../node_modules/lodash-es/_baseIsEqual.js","../node_modules/lodash-es/_baseIsMatch.js","../node_modules/lodash-es/_isStrictComparable.js","../node_modules/lodash-es/_getMatchData.js","../node_modules/lodash-es/_matchesStrictComparable.js","../node_modules/lodash-es/_baseMatches.js","../node_modules/lodash-es/_baseHasIn.js","../node_modules/lodash-es/_hasPath.js","../node_modules/lodash-es/hasIn.js","../node_modules/lodash-es/_baseMatchesProperty.js","../node_modules/lodash-es/_baseProperty.js","../node_modules/lodash-es/_basePropertyDeep.js","../node_modules/lodash-es/property.js","../node_modules/lodash-es/_baseIteratee.js","../node_modules/lodash-es/_createBaseFor.js","../node_modules/lodash-es/_baseFor.js","../node_modules/lodash-es/_baseForOwn.js","../node_modules/lodash-es/_createBaseEach.js","../node_modules/lodash-es/_baseEach.js","../node_modules/lodash-es/last.js","../node_modules/lodash-es/_arrayEvery.js","../node_modules/lodash-es/_baseEvery.js","../node_modules/lodash-es/every.js","../node_modules/lodash-es/_createFind.js","../node_modules/lodash-es/findIndex.js","../node_modules/lodash-es/find.js","../node_modules/lodash-es/_baseMap.js","../node_modules/lodash-es/map.js","../node_modules/lodash-es/flatMap.js","../node_modules/lodash-es/fromPairs.js","../node_modules/lodash-es/isEqual.js","../src/sync-queue.ts","../src/cache.ts","../src/fetch-handler.ts","../src/item.ts","../src/collection.ts","../src/useCrud.ts","../src/useItem.ts"],"sourcesContent":["const Operation = {\n    Remove: 'remove',\n    Replace: 'replace',\n    Add: 'add',\n};\n\n// Don't use `Symbol()` just for 3rd party access the draft\nconst PROXY_DRAFT = Symbol.for('__MUTATIVE_PROXY_DRAFT__');\nconst RAW_RETURN_SYMBOL = Symbol('__MUTATIVE_RAW_RETURN_SYMBOL__');\nconst iteratorSymbol = Symbol.iterator;\nconst dataTypes = {\n    mutable: 'mutable',\n    immutable: 'immutable',\n};\n\nconst internal = {};\n\nfunction has(target, key) {\n    return target instanceof Map\n        ? target.has(key)\n        : Object.prototype.hasOwnProperty.call(target, key);\n}\nfunction getDescriptor(target, key) {\n    if (key in target) {\n        let prototype = Reflect.getPrototypeOf(target);\n        while (prototype) {\n            const descriptor = Reflect.getOwnPropertyDescriptor(prototype, key);\n            if (descriptor)\n                return descriptor;\n            prototype = Reflect.getPrototypeOf(prototype);\n        }\n    }\n    return;\n}\nfunction isBaseSetInstance(obj) {\n    return Object.getPrototypeOf(obj) === Set.prototype;\n}\nfunction isBaseMapInstance(obj) {\n    return Object.getPrototypeOf(obj) === Map.prototype;\n}\n\nfunction latest(proxyDraft) {\n    var _a;\n    return (_a = proxyDraft.copy) !== null && _a !== void 0 ? _a : proxyDraft.original;\n}\n/**\n * Check if the value is a draft\n */\nfunction isDraft(target) {\n    return !!getProxyDraft(target);\n}\nfunction getProxyDraft(value) {\n    if (typeof value !== 'object')\n        return null;\n    return value === null || value === void 0 ? void 0 : value[PROXY_DRAFT];\n}\nfunction getValue(value) {\n    var _a;\n    const proxyDraft = getProxyDraft(value);\n    return proxyDraft ? ((_a = proxyDraft.copy) !== null && _a !== void 0 ? _a : proxyDraft.original) : value;\n}\n/**\n * Check if a value is draftable\n */\nfunction isDraftable(value, options) {\n    if (!value || typeof value !== 'object')\n        return false;\n    let markResult;\n    return (Object.getPrototypeOf(value) === Object.prototype ||\n        Array.isArray(value) ||\n        value instanceof Map ||\n        value instanceof Set ||\n        (!!(options === null || options === void 0 ? void 0 : options.mark) &&\n            ((markResult = options.mark(value, dataTypes)) === dataTypes.immutable ||\n                typeof markResult === 'function')));\n}\nfunction getPath(target, path = []) {\n    if (Object.hasOwnProperty.call(target, 'key')) {\n        // check if the parent is a draft and the original value is not equal to the current value\n        const parentCopy = target.parent.copy;\n        const proxyDraft = getProxyDraft(get(parentCopy, target.key));\n        if (proxyDraft !== null && (proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.original) !== target.original) {\n            return null;\n        }\n        const isSet = target.parent.type === 3 /* DraftType.Set */;\n        const key = isSet\n            ? Array.from(target.parent.setMap.keys()).indexOf(target.key)\n            : target.key;\n        // check if the key is still in the next state parent\n        if (!((isSet && parentCopy.size > key) || has(parentCopy, key)))\n            return null;\n        path.push(key);\n    }\n    if (target.parent) {\n        return getPath(target.parent, path);\n    }\n    // `target` is root draft.\n    path.reverse();\n    try {\n        // check if the path is valid\n        resolvePath(target.copy, path);\n    }\n    catch (e) {\n        return null;\n    }\n    return path;\n}\nfunction getType(target) {\n    if (Array.isArray(target))\n        return 1 /* DraftType.Array */;\n    if (target instanceof Map)\n        return 2 /* DraftType.Map */;\n    if (target instanceof Set)\n        return 3 /* DraftType.Set */;\n    return 0 /* DraftType.Object */;\n}\nfunction get(target, key) {\n    return getType(target) === 2 /* DraftType.Map */ ? target.get(key) : target[key];\n}\nfunction set(target, key, value) {\n    const type = getType(target);\n    if (type === 2 /* DraftType.Map */) {\n        target.set(key, value);\n    }\n    else {\n        target[key] = value;\n    }\n}\nfunction peek(target, key) {\n    const state = getProxyDraft(target);\n    const source = state ? latest(state) : target;\n    return source[key];\n}\nfunction isEqual(x, y) {\n    if (x === y) {\n        return x !== 0 || 1 / x === 1 / y;\n    }\n    else {\n        return x !== x && y !== y;\n    }\n}\nfunction revokeProxy(proxyDraft) {\n    if (!proxyDraft)\n        return;\n    while (proxyDraft.finalities.revoke.length > 0) {\n        const revoke = proxyDraft.finalities.revoke.pop();\n        revoke();\n    }\n}\n// handle JSON Pointer path with spec https://www.rfc-editor.org/rfc/rfc6901\nfunction escapePath(path, pathAsArray) {\n    return pathAsArray\n        ? path\n        : ['']\n            .concat(path)\n            .map((_item) => {\n            const item = `${_item}`;\n            if (item.indexOf('/') === -1 && item.indexOf('~') === -1)\n                return item;\n            return item.replace(/~/g, '~0').replace(/\\//g, '~1');\n        })\n            .join('/');\n}\nfunction unescapePath(path) {\n    if (Array.isArray(path))\n        return path;\n    return path\n        .split('/')\n        .map((_item) => _item.replace(/~1/g, '/').replace(/~0/g, '~'))\n        .slice(1);\n}\nfunction resolvePath(base, path) {\n    for (let index = 0; index < path.length - 1; index += 1) {\n        const key = path[index];\n        // use `index` in Set draft\n        base = get(getType(base) === 3 /* DraftType.Set */ ? Array.from(base) : base, key);\n        if (typeof base !== 'object') {\n            throw new Error(`Cannot resolve patch at '${path.join('/')}'.`);\n        }\n    }\n    return base;\n}\n\nfunction strictCopy(target) {\n    const copy = Object.create(Object.getPrototypeOf(target));\n    Reflect.ownKeys(target).forEach((key) => {\n        let desc = Reflect.getOwnPropertyDescriptor(target, key);\n        if (desc.enumerable && desc.configurable && desc.writable) {\n            copy[key] = target[key];\n            return;\n        }\n        // for freeze\n        if (!desc.writable) {\n            desc.writable = true;\n            desc.configurable = true;\n        }\n        if (desc.get || desc.set)\n            desc = {\n                configurable: true,\n                writable: true,\n                enumerable: desc.enumerable,\n                value: target[key],\n            };\n        Reflect.defineProperty(copy, key, desc);\n    });\n    return copy;\n}\nconst propIsEnum = Object.prototype.propertyIsEnumerable;\nfunction shallowCopy(original, options) {\n    let markResult;\n    if (Array.isArray(original)) {\n        return Array.prototype.concat.call(original);\n    }\n    else if (original instanceof Set) {\n        if (!isBaseSetInstance(original)) {\n            const SubClass = Object.getPrototypeOf(original).constructor;\n            return new SubClass(original.values());\n        }\n        return Set.prototype.difference\n            ? Set.prototype.difference.call(original, new Set())\n            : new Set(original.values());\n    }\n    else if (original instanceof Map) {\n        if (!isBaseMapInstance(original)) {\n            const SubClass = Object.getPrototypeOf(original).constructor;\n            return new SubClass(original);\n        }\n        return new Map(original);\n    }\n    else if ((options === null || options === void 0 ? void 0 : options.mark) &&\n        ((markResult = options.mark(original, dataTypes)),\n            markResult !== undefined) &&\n        markResult !== dataTypes.mutable) {\n        if (markResult === dataTypes.immutable) {\n            return strictCopy(original);\n        }\n        else if (typeof markResult === 'function') {\n            if ((options.enablePatches || options.enableAutoFreeze)) {\n                throw new Error(`You can't use mark and patches or auto freeze together.`);\n            }\n            return markResult();\n        }\n        throw new Error(`Unsupported mark result: ${markResult}`);\n    }\n    else if (typeof original === 'object' &&\n        Object.getPrototypeOf(original) === Object.prototype) {\n        // For best performance with shallow copies,\n        // don't use `Object.create(Object.getPrototypeOf(obj), Object.getOwnPropertyDescriptors(obj));` by default.\n        const copy = {};\n        Object.keys(original).forEach((key) => {\n            copy[key] = original[key];\n        });\n        Object.getOwnPropertySymbols(original).forEach((key) => {\n            if (propIsEnum.call(original, key)) {\n                copy[key] = original[key];\n            }\n        });\n        return copy;\n    }\n    else {\n        throw new Error(`Please check mark() to ensure that it is a stable marker draftable function.`);\n    }\n}\nfunction ensureShallowCopy(target) {\n    if (target.copy)\n        return;\n    target.copy = shallowCopy(target.original, target.options);\n}\nfunction deepClone(target) {\n    if (!isDraftable(target))\n        return getValue(target);\n    if (Array.isArray(target))\n        return target.map(deepClone);\n    if (target instanceof Map) {\n        const iterable = Array.from(target.entries()).map(([k, v]) => [\n            k,\n            deepClone(v),\n        ]);\n        if (!isBaseMapInstance(target)) {\n            const SubClass = Object.getPrototypeOf(target).constructor;\n            return new SubClass(iterable);\n        }\n        return new Map(iterable);\n    }\n    if (target instanceof Set) {\n        const iterable = Array.from(target).map(deepClone);\n        if (!isBaseSetInstance(target)) {\n            const SubClass = Object.getPrototypeOf(target).constructor;\n            return new SubClass(iterable);\n        }\n        return new Set(iterable);\n    }\n    const copy = Object.create(Object.getPrototypeOf(target));\n    for (const key in target)\n        copy[key] = deepClone(target[key]);\n    return copy;\n}\nfunction cloneIfNeeded(target) {\n    return isDraft(target) ? deepClone(target) : target;\n}\n\nfunction markChanged(proxyDraft) {\n    var _a;\n    proxyDraft.assignedMap = (_a = proxyDraft.assignedMap) !== null && _a !== void 0 ? _a : new Map();\n    if (!proxyDraft.operated) {\n        proxyDraft.operated = true;\n        if (proxyDraft.parent) {\n            markChanged(proxyDraft.parent);\n        }\n    }\n}\n\nfunction throwFrozenError() {\n    throw new Error('Cannot modify frozen object');\n}\nfunction deepFreeze(target, subKey, updatedValues, stack, keys) {\n    {\n        updatedValues = updatedValues !== null && updatedValues !== void 0 ? updatedValues : new WeakMap();\n        stack = stack !== null && stack !== void 0 ? stack : [];\n        keys = keys !== null && keys !== void 0 ? keys : [];\n        const value = updatedValues.has(target)\n            ? updatedValues.get(target)\n            : target;\n        if (stack.length > 0) {\n            const index = stack.indexOf(value);\n            if (value && typeof value === 'object' && index !== -1) {\n                if (stack[0] === value) {\n                    throw new Error(`Forbids circular reference`);\n                }\n                throw new Error(`Forbids circular reference: ~/${keys\n                    .slice(0, index)\n                    .map((key, index) => {\n                    if (typeof key === 'symbol')\n                        return `[${key.toString()}]`;\n                    const parent = stack[index];\n                    if (typeof key === 'object' &&\n                        (parent instanceof Map || parent instanceof Set))\n                        return Array.from(parent.keys()).indexOf(key);\n                    return key;\n                })\n                    .join('/')}`);\n            }\n            stack.push(value);\n            keys.push(subKey);\n        }\n        else {\n            stack.push(value);\n        }\n    }\n    if (Object.isFrozen(target) || isDraft(target)) {\n        {\n            stack.pop();\n            keys.pop();\n        }\n        return;\n    }\n    const type = getType(target);\n    switch (type) {\n        case 2 /* DraftType.Map */:\n            for (const [key, value] of target) {\n                deepFreeze(key, key, updatedValues, stack, keys);\n                deepFreeze(value, key, updatedValues, stack, keys);\n            }\n            target.set = target.clear = target.delete = throwFrozenError;\n            break;\n        case 3 /* DraftType.Set */:\n            for (const value of target) {\n                deepFreeze(value, value, updatedValues, stack, keys);\n            }\n            target.add = target.clear = target.delete = throwFrozenError;\n            break;\n        case 1 /* DraftType.Array */:\n            Object.freeze(target);\n            let index = 0;\n            for (const value of target) {\n                deepFreeze(value, index, updatedValues, stack, keys);\n                index += 1;\n            }\n            break;\n        default:\n            Object.freeze(target);\n            // ignore non-enumerable or symbol properties\n            Object.keys(target).forEach((name) => {\n                const value = target[name];\n                deepFreeze(value, name, updatedValues, stack, keys);\n            });\n    }\n    {\n        stack.pop();\n        keys.pop();\n    }\n}\n\nfunction forEach(target, iter) {\n    const type = getType(target);\n    if (type === 0 /* DraftType.Object */) {\n        Reflect.ownKeys(target).forEach((key) => {\n            iter(key, target[key], target);\n        });\n    }\n    else if (type === 1 /* DraftType.Array */) {\n        let index = 0;\n        for (const entry of target) {\n            iter(index, entry, target);\n            index += 1;\n        }\n    }\n    else {\n        target.forEach((entry, index) => iter(index, entry, target));\n    }\n}\n\nfunction handleValue(target, handledSet, options) {\n    if (isDraft(target) ||\n        !isDraftable(target, options) ||\n        handledSet.has(target) ||\n        Object.isFrozen(target))\n        return;\n    const isSet = target instanceof Set;\n    const setMap = isSet ? new Map() : undefined;\n    handledSet.add(target);\n    forEach(target, (key, value) => {\n        var _a;\n        if (isDraft(value)) {\n            const proxyDraft = getProxyDraft(value);\n            ensureShallowCopy(proxyDraft);\n            // A draft where a child node has been changed, or assigned a value\n            const updatedValue = ((_a = proxyDraft.assignedMap) === null || _a === void 0 ? void 0 : _a.size) || proxyDraft.operated\n                ? proxyDraft.copy\n                : proxyDraft.original;\n            // final update value\n            set(isSet ? setMap : target, key, updatedValue);\n        }\n        else {\n            handleValue(value, handledSet, options);\n        }\n    });\n    if (setMap) {\n        const set = target;\n        const values = Array.from(set);\n        set.clear();\n        values.forEach((value) => {\n            set.add(setMap.has(value) ? setMap.get(value) : value);\n        });\n    }\n}\nfunction finalizeAssigned(proxyDraft, key) {\n    // handle the draftable assigned values， and the value is not a draft\n    const copy = proxyDraft.type === 3 /* DraftType.Set */ ? proxyDraft.setMap : proxyDraft.copy;\n    if (proxyDraft.finalities.revoke.length > 1 &&\n        proxyDraft.assignedMap.get(key) &&\n        copy) {\n        handleValue(get(copy, key), proxyDraft.finalities.handledSet, proxyDraft.options);\n    }\n}\nfunction finalizeSetValue(target) {\n    if (target.type === 3 /* DraftType.Set */ && target.copy) {\n        target.copy.clear();\n        target.setMap.forEach((value) => {\n            target.copy.add(getValue(value));\n        });\n    }\n}\nfunction finalizePatches(target, generatePatches, patches, inversePatches) {\n    const shouldFinalize = target.operated &&\n        target.assignedMap &&\n        target.assignedMap.size > 0 &&\n        !target.finalized;\n    if (shouldFinalize) {\n        if (patches && inversePatches) {\n            const basePath = getPath(target);\n            if (basePath) {\n                generatePatches(target, basePath, patches, inversePatches);\n            }\n        }\n        target.finalized = true;\n    }\n}\nfunction markFinalization(target, key, value, generatePatches) {\n    const proxyDraft = getProxyDraft(value);\n    if (proxyDraft) {\n        // !case: assign the draft value\n        if (!proxyDraft.callbacks) {\n            proxyDraft.callbacks = [];\n        }\n        proxyDraft.callbacks.push((patches, inversePatches) => {\n            var _a;\n            const copy = target.type === 3 /* DraftType.Set */ ? target.setMap : target.copy;\n            if (isEqual(get(copy, key), value)) {\n                let updatedValue = proxyDraft.original;\n                if (proxyDraft.copy) {\n                    updatedValue = proxyDraft.copy;\n                }\n                finalizeSetValue(target);\n                finalizePatches(target, generatePatches, patches, inversePatches);\n                if (target.options.enableAutoFreeze) {\n                    target.options.updatedValues =\n                        (_a = target.options.updatedValues) !== null && _a !== void 0 ? _a : new WeakMap();\n                    target.options.updatedValues.set(updatedValue, proxyDraft.original);\n                }\n                // final update value\n                set(copy, key, updatedValue);\n            }\n        });\n        if (target.options.enableAutoFreeze) {\n            // !case: assign the draft value in cross draft tree\n            if (proxyDraft.finalities !== target.finalities) {\n                target.options.enableAutoFreeze = false;\n            }\n        }\n    }\n    if (isDraftable(value, target.options)) {\n        // !case: assign the non-draft value\n        target.finalities.draft.push(() => {\n            const copy = target.type === 3 /* DraftType.Set */ ? target.setMap : target.copy;\n            if (isEqual(get(copy, key), value)) {\n                finalizeAssigned(target, key);\n            }\n        });\n    }\n}\n\nfunction generateArrayPatches(proxyState, basePath, patches, inversePatches, pathAsArray) {\n    let { original, assignedMap, options } = proxyState;\n    let copy = proxyState.copy;\n    if (copy.length < original.length) {\n        [original, copy] = [copy, original];\n        [patches, inversePatches] = [inversePatches, patches];\n    }\n    for (let index = 0; index < original.length; index += 1) {\n        if (assignedMap.get(index.toString()) && copy[index] !== original[index]) {\n            const _path = basePath.concat([index]);\n            const path = escapePath(_path, pathAsArray);\n            patches.push({\n                op: Operation.Replace,\n                path,\n                // If it is a draft, it needs to be deep cloned, and it may also be non-draft.\n                value: cloneIfNeeded(copy[index]),\n            });\n            inversePatches.push({\n                op: Operation.Replace,\n                path,\n                // If it is a draft, it needs to be deep cloned, and it may also be non-draft.\n                value: cloneIfNeeded(original[index]),\n            });\n        }\n    }\n    for (let index = original.length; index < copy.length; index += 1) {\n        const _path = basePath.concat([index]);\n        const path = escapePath(_path, pathAsArray);\n        patches.push({\n            op: Operation.Add,\n            path,\n            // If it is a draft, it needs to be deep cloned, and it may also be non-draft.\n            value: cloneIfNeeded(copy[index]),\n        });\n    }\n    if (original.length < copy.length) {\n        // https://www.rfc-editor.org/rfc/rfc6902#appendix-A.4\n        // For performance, here we only generate an operation that replaces the length of the array,\n        // which is inconsistent with JSON Patch specification\n        const { arrayLengthAssignment = true } = options.enablePatches;\n        if (arrayLengthAssignment) {\n            const _path = basePath.concat(['length']);\n            const path = escapePath(_path, pathAsArray);\n            inversePatches.push({\n                op: Operation.Replace,\n                path,\n                value: original.length,\n            });\n        }\n        else {\n            for (let index = copy.length; original.length < index; index -= 1) {\n                const _path = basePath.concat([index - 1]);\n                const path = escapePath(_path, pathAsArray);\n                inversePatches.push({\n                    op: Operation.Remove,\n                    path,\n                });\n            }\n        }\n    }\n}\nfunction generatePatchesFromAssigned({ original, copy, assignedMap }, basePath, patches, inversePatches, pathAsArray) {\n    assignedMap.forEach((assignedValue, key) => {\n        const originalValue = get(original, key);\n        const value = cloneIfNeeded(get(copy, key));\n        const op = !assignedValue\n            ? Operation.Remove\n            : has(original, key)\n                ? Operation.Replace\n                : Operation.Add;\n        if (isEqual(originalValue, value) && op === Operation.Replace)\n            return;\n        const _path = basePath.concat(key);\n        const path = escapePath(_path, pathAsArray);\n        patches.push(op === Operation.Remove ? { op, path } : { op, path, value });\n        inversePatches.push(op === Operation.Add\n            ? { op: Operation.Remove, path }\n            : op === Operation.Remove\n                ? { op: Operation.Add, path, value: originalValue }\n                : { op: Operation.Replace, path, value: originalValue });\n    });\n}\nfunction generateSetPatches({ original, copy }, basePath, patches, inversePatches, pathAsArray) {\n    let index = 0;\n    original.forEach((value) => {\n        if (!copy.has(value)) {\n            const _path = basePath.concat([index]);\n            const path = escapePath(_path, pathAsArray);\n            patches.push({\n                op: Operation.Remove,\n                path,\n                value,\n            });\n            inversePatches.unshift({\n                op: Operation.Add,\n                path,\n                value,\n            });\n        }\n        index += 1;\n    });\n    index = 0;\n    copy.forEach((value) => {\n        if (!original.has(value)) {\n            const _path = basePath.concat([index]);\n            const path = escapePath(_path, pathAsArray);\n            patches.push({\n                op: Operation.Add,\n                path,\n                value,\n            });\n            inversePatches.unshift({\n                op: Operation.Remove,\n                path,\n                value,\n            });\n        }\n        index += 1;\n    });\n}\nfunction generatePatches(proxyState, basePath, patches, inversePatches) {\n    const { pathAsArray = true } = proxyState.options.enablePatches;\n    switch (proxyState.type) {\n        case 0 /* DraftType.Object */:\n        case 2 /* DraftType.Map */:\n            return generatePatchesFromAssigned(proxyState, basePath, patches, inversePatches, pathAsArray);\n        case 1 /* DraftType.Array */:\n            return generateArrayPatches(proxyState, basePath, patches, inversePatches, pathAsArray);\n        case 3 /* DraftType.Set */:\n            return generateSetPatches(proxyState, basePath, patches, inversePatches, pathAsArray);\n    }\n}\n\nlet readable = false;\nconst checkReadable = (value, options, ignoreCheckDraftable = false) => {\n    if (typeof value === 'object' &&\n        value !== null &&\n        (!isDraftable(value, options) || ignoreCheckDraftable) &&\n        !readable) {\n        throw new Error(`Strict mode: Mutable data cannot be accessed directly, please use 'unsafe(callback)' wrap.`);\n    }\n};\n/**\n * `unsafe(callback)` to access mutable data directly in strict mode.\n *\n * ## Example\n *\n * ```ts\n * import { create, unsafe } from '../index';\n *\n * class Foobar {\n *   bar = 1;\n * }\n *\n * const baseState = { foobar: new Foobar() };\n * const state = create(\n *   baseState,\n *   (draft) => {\n *    unsafe(() => {\n *      draft.foobar.bar = 2;\n *    });\n *   },\n *   {\n *     strict: true,\n *   }\n * );\n *\n * expect(state).toBe(baseState);\n * expect(state.foobar).toBe(baseState.foobar);\n * expect(state.foobar.bar).toBe(2);\n * ```\n */\nfunction unsafe(callback) {\n    readable = true;\n    let result;\n    try {\n        result = callback();\n    }\n    finally {\n        readable = false;\n    }\n    return result;\n}\n\nconst mapHandler = {\n    get size() {\n        const current = latest(getProxyDraft(this));\n        return current.size;\n    },\n    has(key) {\n        return latest(getProxyDraft(this)).has(key);\n    },\n    set(key, value) {\n        const target = getProxyDraft(this);\n        const source = latest(target);\n        if (!source.has(key) || !isEqual(source.get(key), value)) {\n            ensureShallowCopy(target);\n            markChanged(target);\n            target.assignedMap.set(key, true);\n            target.copy.set(key, value);\n            markFinalization(target, key, value, generatePatches);\n        }\n        return this;\n    },\n    delete(key) {\n        if (!this.has(key)) {\n            return false;\n        }\n        const target = getProxyDraft(this);\n        ensureShallowCopy(target);\n        markChanged(target);\n        if (target.original.has(key)) {\n            target.assignedMap.set(key, false);\n        }\n        else {\n            target.assignedMap.delete(key);\n        }\n        target.copy.delete(key);\n        return true;\n    },\n    clear() {\n        const target = getProxyDraft(this);\n        if (!this.size)\n            return;\n        ensureShallowCopy(target);\n        markChanged(target);\n        target.assignedMap = new Map();\n        for (const [key] of target.original) {\n            target.assignedMap.set(key, false);\n        }\n        target.copy.clear();\n    },\n    forEach(callback, thisArg) {\n        const target = getProxyDraft(this);\n        latest(target).forEach((_value, _key) => {\n            callback.call(thisArg, this.get(_key), _key, this);\n        });\n    },\n    get(key) {\n        var _a, _b;\n        const target = getProxyDraft(this);\n        const value = latest(target).get(key);\n        const mutable = ((_b = (_a = target.options).mark) === null || _b === void 0 ? void 0 : _b.call(_a, value, dataTypes)) === dataTypes.mutable;\n        if (target.options.strict) {\n            checkReadable(value, target.options, mutable);\n        }\n        if (mutable) {\n            return value;\n        }\n        if (target.finalized || !isDraftable(value, target.options)) {\n            return value;\n        }\n        // drafted or reassigned\n        if (value !== target.original.get(key)) {\n            return value;\n        }\n        const draft = internal.createDraft({\n            original: value,\n            parentDraft: target,\n            key,\n            finalities: target.finalities,\n            options: target.options,\n        });\n        ensureShallowCopy(target);\n        target.copy.set(key, draft);\n        return draft;\n    },\n    keys() {\n        return latest(getProxyDraft(this)).keys();\n    },\n    values() {\n        const iterator = this.keys();\n        return {\n            [iteratorSymbol]: () => this.values(),\n            next: () => {\n                const result = iterator.next();\n                if (result.done)\n                    return result;\n                const value = this.get(result.value);\n                return {\n                    done: false,\n                    value,\n                };\n            },\n        };\n    },\n    entries() {\n        const iterator = this.keys();\n        return {\n            [iteratorSymbol]: () => this.entries(),\n            next: () => {\n                const result = iterator.next();\n                if (result.done)\n                    return result;\n                const value = this.get(result.value);\n                return {\n                    done: false,\n                    value: [result.value, value],\n                };\n            },\n        };\n    },\n    [iteratorSymbol]() {\n        return this.entries();\n    },\n};\nconst mapHandlerKeys = Reflect.ownKeys(mapHandler);\n\nconst getNextIterator = (target, iterator, { isValuesIterator }) => () => {\n    var _a, _b;\n    const result = iterator.next();\n    if (result.done)\n        return result;\n    const key = result.value;\n    let value = target.setMap.get(key);\n    const currentDraft = getProxyDraft(value);\n    const mutable = ((_b = (_a = target.options).mark) === null || _b === void 0 ? void 0 : _b.call(_a, value, dataTypes)) === dataTypes.mutable;\n    if (target.options.strict) {\n        checkReadable(key, target.options, mutable);\n    }\n    if (!mutable &&\n        !currentDraft &&\n        isDraftable(key, target.options) &&\n        !target.finalized &&\n        target.original.has(key)) {\n        // draft a draftable original set item\n        const proxy = internal.createDraft({\n            original: key,\n            parentDraft: target,\n            key,\n            finalities: target.finalities,\n            options: target.options,\n        });\n        target.setMap.set(key, proxy);\n        value = proxy;\n    }\n    else if (currentDraft) {\n        // drafted\n        value = currentDraft.proxy;\n    }\n    return {\n        done: false,\n        value: isValuesIterator ? value : [value, value],\n    };\n};\nconst setHandler = {\n    get size() {\n        const target = getProxyDraft(this);\n        return target.setMap.size;\n    },\n    has(value) {\n        const target = getProxyDraft(this);\n        // reassigned or non-draftable values\n        if (target.setMap.has(value))\n            return true;\n        ensureShallowCopy(target);\n        const valueProxyDraft = getProxyDraft(value);\n        // drafted\n        if (valueProxyDraft && target.setMap.has(valueProxyDraft.original))\n            return true;\n        return false;\n    },\n    add(value) {\n        const target = getProxyDraft(this);\n        if (!this.has(value)) {\n            ensureShallowCopy(target);\n            markChanged(target);\n            target.assignedMap.set(value, true);\n            target.setMap.set(value, value);\n            markFinalization(target, value, value, generatePatches);\n        }\n        return this;\n    },\n    delete(value) {\n        if (!this.has(value)) {\n            return false;\n        }\n        const target = getProxyDraft(this);\n        ensureShallowCopy(target);\n        markChanged(target);\n        const valueProxyDraft = getProxyDraft(value);\n        if (valueProxyDraft && target.setMap.has(valueProxyDraft.original)) {\n            // delete drafted\n            target.assignedMap.set(valueProxyDraft.original, false);\n            return target.setMap.delete(valueProxyDraft.original);\n        }\n        if (!valueProxyDraft && target.setMap.has(value)) {\n            // non-draftable values\n            target.assignedMap.set(value, false);\n        }\n        else {\n            // reassigned\n            target.assignedMap.delete(value);\n        }\n        // delete reassigned or non-draftable values\n        return target.setMap.delete(value);\n    },\n    clear() {\n        if (!this.size)\n            return;\n        const target = getProxyDraft(this);\n        ensureShallowCopy(target);\n        markChanged(target);\n        for (const value of target.original) {\n            target.assignedMap.set(value, false);\n        }\n        target.setMap.clear();\n    },\n    values() {\n        const target = getProxyDraft(this);\n        ensureShallowCopy(target);\n        const iterator = target.setMap.keys();\n        return {\n            [Symbol.iterator]: () => this.values(),\n            next: getNextIterator(target, iterator, { isValuesIterator: true }),\n        };\n    },\n    entries() {\n        const target = getProxyDraft(this);\n        ensureShallowCopy(target);\n        const iterator = target.setMap.keys();\n        return {\n            [Symbol.iterator]: () => this.entries(),\n            next: getNextIterator(target, iterator, {\n                isValuesIterator: false,\n            }),\n        };\n    },\n    keys() {\n        return this.values();\n    },\n    [iteratorSymbol]() {\n        return this.values();\n    },\n    forEach(callback, thisArg) {\n        const iterator = this.values();\n        let result = iterator.next();\n        while (!result.done) {\n            callback.call(thisArg, result.value, result.value, this);\n            result = iterator.next();\n        }\n    },\n};\nif (Set.prototype.difference) {\n    // for compatibility with new Set methods\n    // https://github.com/tc39/proposal-set-methods\n    // And `https://github.com/tc39/proposal-set-methods/blob/main/details.md#symbolspecies` has some details about the `@@species` symbol.\n    // So we can't use SubSet instance constructor to get the constructor of the SubSet instance.\n    Object.assign(setHandler, {\n        intersection(other) {\n            return Set.prototype.intersection.call(new Set(this.values()), other);\n        },\n        union(other) {\n            return Set.prototype.union.call(new Set(this.values()), other);\n        },\n        difference(other) {\n            return Set.prototype.difference.call(new Set(this.values()), other);\n        },\n        symmetricDifference(other) {\n            return Set.prototype.symmetricDifference.call(new Set(this.values()), other);\n        },\n        isSubsetOf(other) {\n            return Set.prototype.isSubsetOf.call(new Set(this.values()), other);\n        },\n        isSupersetOf(other) {\n            return Set.prototype.isSupersetOf.call(new Set(this.values()), other);\n        },\n        isDisjointFrom(other) {\n            return Set.prototype.isDisjointFrom.call(new Set(this.values()), other);\n        },\n    });\n}\nconst setHandlerKeys = Reflect.ownKeys(setHandler);\n\nconst proxyHandler = {\n    get(target, key, receiver) {\n        var _a, _b;\n        const copy = (_a = target.copy) === null || _a === void 0 ? void 0 : _a[key];\n        // Improve draft reading performance by caching the draft copy.\n        if (copy && target.finalities.draftsCache.has(copy)) {\n            return copy;\n        }\n        if (key === PROXY_DRAFT)\n            return target;\n        let markResult;\n        if (target.options.mark) {\n            // handle `Uncaught TypeError: Method get Map.prototype.size called on incompatible receiver #<Map>`\n            // or `Uncaught TypeError: Method get Set.prototype.size called on incompatible receiver #<Set>`\n            const value = key === 'size' &&\n                (target.original instanceof Map || target.original instanceof Set)\n                ? Reflect.get(target.original, key)\n                : Reflect.get(target.original, key, receiver);\n            markResult = target.options.mark(value, dataTypes);\n            if (markResult === dataTypes.mutable) {\n                if (target.options.strict) {\n                    checkReadable(value, target.options, true);\n                }\n                return value;\n            }\n        }\n        const source = latest(target);\n        if (source instanceof Map && mapHandlerKeys.includes(key)) {\n            if (key === 'size') {\n                return Object.getOwnPropertyDescriptor(mapHandler, 'size').get.call(target.proxy);\n            }\n            const handle = mapHandler[key];\n            return handle.bind(target.proxy);\n        }\n        if (source instanceof Set && setHandlerKeys.includes(key)) {\n            if (key === 'size') {\n                return Object.getOwnPropertyDescriptor(setHandler, 'size').get.call(target.proxy);\n            }\n            const handle = setHandler[key];\n            return handle.bind(target.proxy);\n        }\n        if (!has(source, key)) {\n            const desc = getDescriptor(source, key);\n            return desc\n                ? `value` in desc\n                    ? desc.value\n                    : // !case: support for getter\n                        (_b = desc.get) === null || _b === void 0 ? void 0 : _b.call(target.proxy)\n                : undefined;\n        }\n        const value = source[key];\n        if (target.options.strict) {\n            checkReadable(value, target.options);\n        }\n        if (target.finalized || !isDraftable(value, target.options)) {\n            return value;\n        }\n        // Ensure that the assigned values are not drafted\n        if (value === peek(target.original, key)) {\n            ensureShallowCopy(target);\n            target.copy[key] = createDraft({\n                original: target.original[key],\n                parentDraft: target,\n                key: target.type === 1 /* DraftType.Array */ ? Number(key) : key,\n                finalities: target.finalities,\n                options: target.options,\n            });\n            // !case: support for custom shallow copy function\n            if (typeof markResult === 'function') {\n                const subProxyDraft = getProxyDraft(target.copy[key]);\n                ensureShallowCopy(subProxyDraft);\n                // Trigger a custom shallow copy to update to a new copy\n                markChanged(subProxyDraft);\n                return subProxyDraft.copy;\n            }\n            return target.copy[key];\n        }\n        if (isDraft(value)) {\n            target.finalities.draftsCache.add(value);\n        }\n        return value;\n    },\n    set(target, key, value) {\n        var _a;\n        if (target.type === 3 /* DraftType.Set */ || target.type === 2 /* DraftType.Map */) {\n            throw new Error(`Map/Set draft does not support any property assignment.`);\n        }\n        let _key;\n        if (target.type === 1 /* DraftType.Array */ &&\n            key !== 'length' &&\n            !(Number.isInteger((_key = Number(key))) &&\n                _key >= 0 &&\n                (key === 0 || _key === 0 || String(_key) === String(key)))) {\n            throw new Error(`Only supports setting array indices and the 'length' property.`);\n        }\n        const desc = getDescriptor(latest(target), key);\n        if (desc === null || desc === void 0 ? void 0 : desc.set) {\n            // !case: cover the case of setter\n            desc.set.call(target.proxy, value);\n            return true;\n        }\n        const current = peek(latest(target), key);\n        const currentProxyDraft = getProxyDraft(current);\n        if (currentProxyDraft && isEqual(currentProxyDraft.original, value)) {\n            // !case: ignore the case of assigning the original draftable value to a draft\n            target.copy[key] = value;\n            target.assignedMap = (_a = target.assignedMap) !== null && _a !== void 0 ? _a : new Map();\n            target.assignedMap.set(key, false);\n            return true;\n        }\n        // !case: handle new props with value 'undefined'\n        if (isEqual(value, current) &&\n            (value !== undefined || has(target.original, key)))\n            return true;\n        ensureShallowCopy(target);\n        markChanged(target);\n        if (has(target.original, key) && isEqual(value, target.original[key])) {\n            // !case: handle the case of assigning the original non-draftable value to a draft\n            target.assignedMap.delete(key);\n        }\n        else {\n            target.assignedMap.set(key, true);\n        }\n        target.copy[key] = value;\n        markFinalization(target, key, value, generatePatches);\n        return true;\n    },\n    has(target, key) {\n        return key in latest(target);\n    },\n    ownKeys(target) {\n        return Reflect.ownKeys(latest(target));\n    },\n    getOwnPropertyDescriptor(target, key) {\n        const source = latest(target);\n        const descriptor = Reflect.getOwnPropertyDescriptor(source, key);\n        if (!descriptor)\n            return descriptor;\n        return {\n            writable: true,\n            configurable: target.type !== 1 /* DraftType.Array */ || key !== 'length',\n            enumerable: descriptor.enumerable,\n            value: source[key],\n        };\n    },\n    getPrototypeOf(target) {\n        return Reflect.getPrototypeOf(target.original);\n    },\n    setPrototypeOf() {\n        throw new Error(`Cannot call 'setPrototypeOf()' on drafts`);\n    },\n    defineProperty() {\n        throw new Error(`Cannot call 'defineProperty()' on drafts`);\n    },\n    deleteProperty(target, key) {\n        var _a;\n        if (target.type === 1 /* DraftType.Array */) {\n            return proxyHandler.set.call(this, target, key, undefined, target.proxy);\n        }\n        if (peek(target.original, key) !== undefined || key in target.original) {\n            // !case: delete an existing key\n            ensureShallowCopy(target);\n            markChanged(target);\n            target.assignedMap.set(key, false);\n        }\n        else {\n            target.assignedMap = (_a = target.assignedMap) !== null && _a !== void 0 ? _a : new Map();\n            // The original non-existent key has been deleted\n            target.assignedMap.delete(key);\n        }\n        if (target.copy)\n            delete target.copy[key];\n        return true;\n    },\n};\nfunction createDraft(createDraftOptions) {\n    const { original, parentDraft, key, finalities, options } = createDraftOptions;\n    const type = getType(original);\n    const proxyDraft = {\n        type,\n        finalized: false,\n        parent: parentDraft,\n        original,\n        copy: null,\n        proxy: null,\n        finalities,\n        options,\n        // Mapping of draft Set items to their corresponding draft values.\n        setMap: type === 3 /* DraftType.Set */\n            ? new Map(original.entries())\n            : undefined,\n    };\n    // !case: undefined as a draft map key\n    if (key || 'key' in createDraftOptions) {\n        proxyDraft.key = key;\n    }\n    const { proxy, revoke } = Proxy.revocable(type === 1 /* DraftType.Array */ ? Object.assign([], proxyDraft) : proxyDraft, proxyHandler);\n    finalities.revoke.push(revoke);\n    proxyDraft.proxy = proxy;\n    if (parentDraft) {\n        const target = parentDraft;\n        target.finalities.draft.push((patches, inversePatches) => {\n            var _a, _b;\n            const oldProxyDraft = getProxyDraft(proxy);\n            // if target is a Set draft, `setMap` is the real Set copies proxy mapping.\n            let copy = target.type === 3 /* DraftType.Set */ ? target.setMap : target.copy;\n            const draft = get(copy, key);\n            const proxyDraft = getProxyDraft(draft);\n            if (proxyDraft) {\n                // assign the updated value to the copy object\n                let updatedValue = proxyDraft.original;\n                if (proxyDraft.operated) {\n                    updatedValue = getValue(draft);\n                }\n                finalizeSetValue(proxyDraft);\n                finalizePatches(proxyDraft, generatePatches, patches, inversePatches);\n                if (target.options.enableAutoFreeze) {\n                    target.options.updatedValues =\n                        (_a = target.options.updatedValues) !== null && _a !== void 0 ? _a : new WeakMap();\n                    target.options.updatedValues.set(updatedValue, proxyDraft.original);\n                }\n                // final update value\n                set(copy, key, updatedValue);\n            }\n            // !case: handle the deleted key\n            (_b = oldProxyDraft.callbacks) === null || _b === void 0 ? void 0 : _b.forEach((callback) => {\n                callback(patches, inversePatches);\n            });\n        });\n    }\n    else {\n        // !case: handle the root draft\n        const target = getProxyDraft(proxy);\n        target.finalities.draft.push((patches, inversePatches) => {\n            finalizeSetValue(target);\n            finalizePatches(target, generatePatches, patches, inversePatches);\n        });\n    }\n    return proxy;\n}\ninternal.createDraft = createDraft;\nfunction finalizeDraft(result, returnedValue, patches, inversePatches, enableAutoFreeze) {\n    var _a;\n    const proxyDraft = getProxyDraft(result);\n    const original = (_a = proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.original) !== null && _a !== void 0 ? _a : result;\n    const hasReturnedValue = !!returnedValue.length;\n    if (proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.operated) {\n        while (proxyDraft.finalities.draft.length > 0) {\n            const finalize = proxyDraft.finalities.draft.pop();\n            finalize(patches, inversePatches);\n        }\n    }\n    const state = hasReturnedValue\n        ? returnedValue[0]\n        : proxyDraft\n            ? proxyDraft.operated\n                ? proxyDraft.copy\n                : proxyDraft.original\n            : result;\n    if (proxyDraft)\n        revokeProxy(proxyDraft);\n    if (enableAutoFreeze) {\n        deepFreeze(state, state, proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.options.updatedValues);\n    }\n    return [\n        state,\n        patches && hasReturnedValue\n            ? [{ op: Operation.Replace, path: [], value: returnedValue[0] }]\n            : patches,\n        inversePatches && hasReturnedValue\n            ? [{ op: Operation.Replace, path: [], value: original }]\n            : inversePatches,\n    ];\n}\n\nfunction draftify(baseState, options) {\n    var _a;\n    const finalities = {\n        draft: [],\n        revoke: [],\n        handledSet: new WeakSet(),\n        draftsCache: new WeakSet(),\n    };\n    let patches;\n    let inversePatches;\n    if (options.enablePatches) {\n        patches = [];\n        inversePatches = [];\n    }\n    const isMutable = ((_a = options.mark) === null || _a === void 0 ? void 0 : _a.call(options, baseState, dataTypes)) === dataTypes.mutable ||\n        !isDraftable(baseState, options);\n    const draft = isMutable\n        ? baseState\n        : createDraft({\n            original: baseState,\n            parentDraft: null,\n            finalities,\n            options,\n        });\n    return [\n        draft,\n        (returnedValue = []) => {\n            const [finalizedState, finalizedPatches, finalizedInversePatches] = finalizeDraft(draft, returnedValue, patches, inversePatches, options.enableAutoFreeze);\n            return (options.enablePatches\n                ? [finalizedState, finalizedPatches, finalizedInversePatches]\n                : finalizedState);\n        },\n    ];\n}\n\nfunction handleReturnValue(options) {\n    const { rootDraft, value, useRawReturn = false, isRoot = true } = options;\n    forEach(value, (key, item, source) => {\n        const proxyDraft = getProxyDraft(item);\n        // just handle the draft which is created by the same rootDraft\n        if (proxyDraft &&\n            rootDraft &&\n            proxyDraft.finalities === rootDraft.finalities) {\n            options.isContainDraft = true;\n            const currentValue = proxyDraft.original;\n            // final update value, but just handle return value\n            if (source instanceof Set) {\n                const arr = Array.from(source);\n                source.clear();\n                arr.forEach((_item) => source.add(key === _item ? currentValue : _item));\n            }\n            else {\n                set(source, key, currentValue);\n            }\n        }\n        else if (typeof item === 'object' && item !== null) {\n            options.value = item;\n            options.isRoot = false;\n            handleReturnValue(options);\n        }\n    });\n    if (isRoot) {\n        if (!options.isContainDraft)\n            console.warn(`The return value does not contain any draft, please use 'rawReturn()' to wrap the return value to improve performance.`);\n        if (useRawReturn) {\n            console.warn(`The return value contains drafts, please don't use 'rawReturn()' to wrap the return value.`);\n        }\n    }\n}\nfunction getCurrent(target) {\n    var _a;\n    const proxyDraft = getProxyDraft(target);\n    if (!isDraftable(target, proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.options))\n        return target;\n    const type = getType(target);\n    if (proxyDraft && !proxyDraft.operated)\n        return proxyDraft.original;\n    let currentValue;\n    function ensureShallowCopy() {\n        currentValue =\n            type === 2 /* DraftType.Map */\n                ? !isBaseMapInstance(target)\n                    ? new (Object.getPrototypeOf(target).constructor)(target)\n                    : new Map(target)\n                : type === 3 /* DraftType.Set */\n                    ? Array.from(proxyDraft.setMap.values())\n                    : shallowCopy(target, proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.options);\n    }\n    if (proxyDraft) {\n        // It's a proxy draft, let's create a shallow copy eagerly\n        proxyDraft.finalized = true;\n        try {\n            ensureShallowCopy();\n        }\n        finally {\n            proxyDraft.finalized = false;\n        }\n    }\n    else {\n        // It's not a proxy draft, let's use the target directly and let's see\n        // lazily if we need to create a shallow copy\n        currentValue = target;\n    }\n    forEach(currentValue, (key, value) => {\n        if (proxyDraft && isEqual(get(proxyDraft.original, key), value))\n            return;\n        const newValue = getCurrent(value);\n        if (newValue !== value) {\n            if (currentValue === target)\n                ensureShallowCopy();\n            set(currentValue, key, newValue);\n        }\n    });\n    if (type === 3 /* DraftType.Set */) {\n        const value = (_a = proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.original) !== null && _a !== void 0 ? _a : currentValue;\n        return !isBaseSetInstance(value)\n            ? new (Object.getPrototypeOf(value).constructor)(currentValue)\n            : new Set(currentValue);\n    }\n    return currentValue;\n}\nfunction current(target) {\n    if (!isDraft(target)) {\n        throw new Error(`current() is only used for Draft, parameter: ${target}`);\n    }\n    return getCurrent(target);\n}\n\n/**\n * `makeCreator(options)` to make a creator function.\n *\n * ## Example\n *\n * ```ts\n * import { makeCreator } from '../index';\n *\n * const baseState = { foo: { bar: 'str' }, arr: [] };\n * const create = makeCreator({ enableAutoFreeze: true });\n * const state = create(\n *   baseState,\n *   (draft) => {\n *     draft.foo.bar = 'str2';\n *   },\n * );\n *\n * expect(state).toEqual({ foo: { bar: 'str2' }, arr: [] });\n * expect(state).not.toBe(baseState);\n * expect(state.foo).not.toBe(baseState.foo);\n * expect(state.arr).toBe(baseState.arr);\n * expect(Object.isFrozen(state)).toBeTruthy();\n * ```\n */\nconst makeCreator = (arg) => {\n    if (arg !== undefined &&\n        Object.prototype.toString.call(arg) !== '[object Object]') {\n        throw new Error(`Invalid options: ${String(arg)}, 'options' should be an object.`);\n    }\n    return function create(arg0, arg1, arg2) {\n        var _a, _b, _c;\n        if (typeof arg0 === 'function' && typeof arg1 !== 'function') {\n            return function (base, ...args) {\n                return create(base, (draft) => arg0.call(this, draft, ...args), arg1);\n            };\n        }\n        const base = arg0;\n        const mutate = arg1;\n        let options = arg2;\n        if (typeof arg1 !== 'function') {\n            options = arg1;\n        }\n        if (options !== undefined &&\n            Object.prototype.toString.call(options) !== '[object Object]') {\n            throw new Error(`Invalid options: ${options}, 'options' should be an object.`);\n        }\n        options = Object.assign(Object.assign({}, arg), options);\n        const state = isDraft(base) ? current(base) : base;\n        const mark = Array.isArray(options.mark)\n            ? ((value, types) => {\n                for (const mark of options.mark) {\n                    if (typeof mark !== 'function') {\n                        throw new Error(`Invalid mark: ${mark}, 'mark' should be a function.`);\n                    }\n                    const result = mark(value, types);\n                    if (result) {\n                        return result;\n                    }\n                }\n                return;\n            })\n            : options.mark;\n        const enablePatches = (_a = options.enablePatches) !== null && _a !== void 0 ? _a : false;\n        const strict = (_b = options.strict) !== null && _b !== void 0 ? _b : false;\n        const enableAutoFreeze = (_c = options.enableAutoFreeze) !== null && _c !== void 0 ? _c : false;\n        const _options = {\n            enableAutoFreeze,\n            mark,\n            strict,\n            enablePatches,\n        };\n        if (!isDraftable(state, _options) &&\n            typeof state === 'object' &&\n            state !== null) {\n            throw new Error(`Invalid base state: create() only supports plain objects, arrays, Set, Map or using mark() to mark the state as immutable.`);\n        }\n        const [draft, finalize] = draftify(state, _options);\n        if (typeof arg1 !== 'function') {\n            if (!isDraftable(state, _options)) {\n                throw new Error(`Invalid base state: create() only supports plain objects, arrays, Set, Map or using mark() to mark the state as immutable.`);\n            }\n            return [draft, finalize];\n        }\n        let result;\n        try {\n            result = mutate(draft);\n        }\n        catch (error) {\n            revokeProxy(getProxyDraft(draft));\n            throw error;\n        }\n        const returnValue = (value) => {\n            const proxyDraft = getProxyDraft(draft);\n            if (!isDraft(value)) {\n                if (value !== undefined &&\n                    !isEqual(value, draft) &&\n                    (proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.operated)) {\n                    throw new Error(`Either the value is returned as a new non-draft value, or only the draft is modified without returning any value.`);\n                }\n                const rawReturnValue = value === null || value === void 0 ? void 0 : value[RAW_RETURN_SYMBOL];\n                if (rawReturnValue) {\n                    const _value = rawReturnValue[0];\n                    if (_options.strict && typeof value === 'object' && value !== null) {\n                        handleReturnValue({\n                            rootDraft: proxyDraft,\n                            value,\n                            useRawReturn: true,\n                        });\n                    }\n                    return finalize([_value]);\n                }\n                if (value !== undefined) {\n                    if (typeof value === 'object' && value !== null) {\n                        handleReturnValue({ rootDraft: proxyDraft, value });\n                    }\n                    return finalize([value]);\n                }\n            }\n            if (value === draft || value === undefined) {\n                return finalize([]);\n            }\n            const returnedProxyDraft = getProxyDraft(value);\n            if (_options === returnedProxyDraft.options) {\n                if (returnedProxyDraft.operated) {\n                    throw new Error(`Cannot return a modified child draft.`);\n                }\n                return finalize([current(value)]);\n            }\n            return finalize([value]);\n        };\n        if (result instanceof Promise) {\n            return result.then(returnValue, (error) => {\n                revokeProxy(getProxyDraft(draft));\n                throw error;\n            });\n        }\n        return returnValue(result);\n    };\n};\n\n/**\n * `create(baseState, callback, options)` to create the next state\n *\n * ## Example\n *\n * ```ts\n * import { create } from '../index';\n *\n * const baseState = { foo: { bar: 'str' }, arr: [] };\n * const state = create(\n *   baseState,\n *   (draft) => {\n *     draft.foo.bar = 'str2';\n *   },\n * );\n *\n * expect(state).toEqual({ foo: { bar: 'str2' }, arr: [] });\n * expect(state).not.toBe(baseState);\n * expect(state.foo).not.toBe(baseState.foo);\n * expect(state.arr).toBe(baseState.arr);\n * ```\n */\nconst create = makeCreator();\n\n/**\n * `apply(state, patches)` to apply patches to state\n *\n * ## Example\n *\n * ```ts\n * import { create, apply } from '../index';\n *\n * const baseState = { foo: { bar: 'str' }, arr: [] };\n * const [state, patches] = create(\n *   baseState,\n *   (draft) => {\n *     draft.foo.bar = 'str2';\n *   },\n *   { enablePatches: true }\n * );\n * expect(state).toEqual({ foo: { bar: 'str2' }, arr: [] });\n * expect(patches).toEqual([{ op: 'replace', path: ['foo', 'bar'], value: 'str2' }]);\n * expect(state).toEqual(apply(baseState, patches));\n * ```\n */\nfunction apply(state, patches, applyOptions) {\n    let i;\n    for (i = patches.length - 1; i >= 0; i -= 1) {\n        const { value, op, path } = patches[i];\n        if ((!path.length && op === Operation.Replace) ||\n            (path === '' && op === Operation.Add)) {\n            state = value;\n            break;\n        }\n    }\n    if (i > -1) {\n        patches = patches.slice(i + 1);\n    }\n    const mutate = (draft) => {\n        patches.forEach((patch) => {\n            const { path: _path, op } = patch;\n            const path = unescapePath(_path);\n            let base = draft;\n            for (let index = 0; index < path.length - 1; index += 1) {\n                const parentType = getType(base);\n                let key = path[index];\n                if (typeof key !== 'string' && typeof key !== 'number') {\n                    key = String(key);\n                }\n                if (((parentType === 0 /* DraftType.Object */ ||\n                    parentType === 1 /* DraftType.Array */) &&\n                    (key === '__proto__' || key === 'constructor')) ||\n                    (typeof base === 'function' && key === 'prototype')) {\n                    throw new Error(`Patching reserved attributes like __proto__ and constructor is not allowed.`);\n                }\n                // use `index` in Set draft\n                base = get(parentType === 3 /* DraftType.Set */ ? Array.from(base) : base, key);\n                if (typeof base !== 'object') {\n                    throw new Error(`Cannot apply patch at '${path.join('/')}'.`);\n                }\n            }\n            const type = getType(base);\n            // ensure the original patch is not modified.\n            const value = deepClone(patch.value);\n            const key = path[path.length - 1];\n            switch (op) {\n                case Operation.Replace:\n                    switch (type) {\n                        case 2 /* DraftType.Map */:\n                            return base.set(key, value);\n                        case 3 /* DraftType.Set */:\n                            throw new Error(`Cannot apply replace patch to set.`);\n                        default:\n                            return (base[key] = value);\n                    }\n                case Operation.Add:\n                    switch (type) {\n                        case 1 /* DraftType.Array */:\n                            // If the \"-\" character is used to\n                            // index the end of the array (see [RFC6901](https://datatracker.ietf.org/doc/html/rfc6902)),\n                            // this has the effect of appending the value to the array.\n                            return key === '-'\n                                ? base.push(value)\n                                : base.splice(key, 0, value);\n                        case 2 /* DraftType.Map */:\n                            return base.set(key, value);\n                        case 3 /* DraftType.Set */:\n                            return base.add(value);\n                        default:\n                            return (base[key] = value);\n                    }\n                case Operation.Remove:\n                    switch (type) {\n                        case 1 /* DraftType.Array */:\n                            return base.splice(key, 1);\n                        case 2 /* DraftType.Map */:\n                            return base.delete(key);\n                        case 3 /* DraftType.Set */:\n                            return base.delete(patch.value);\n                        default:\n                            return delete base[key];\n                    }\n                default:\n                    throw new Error(`Unsupported patch operation: ${op}.`);\n            }\n        });\n    };\n    if (applyOptions === null || applyOptions === void 0 ? void 0 : applyOptions.mutable) {\n        {\n            if (Object.keys(applyOptions).filter((key) => key !== 'mutable').length) {\n                console.warn('The \"mutable\" option is not allowed to be used with other options.');\n            }\n        }\n        mutate(state);\n        return undefined;\n    }\n    if (isDraft(state)) {\n        if (applyOptions !== undefined) {\n            throw new Error(`Cannot apply patches with options to a draft.`);\n        }\n        mutate(state);\n        return state;\n    }\n    return create(state, mutate, Object.assign(Object.assign({}, applyOptions), { enablePatches: false }));\n}\n\n/**\n * `original(draft)` to get original state in the draft mutation function.\n *\n * ## Example\n *\n * ```ts\n * import { create, original } from '../index';\n *\n * const baseState = { foo: { bar: 'str' }, arr: [] };\n * const state = create(\n *   baseState,\n *   (draft) => {\n *     draft.foo.bar = 'str2';\n *     expect(original(draft.foo)).toEqual({ bar: 'str' });\n *   }\n * );\n * ```\n */\nfunction original(target) {\n    const proxyDraft = getProxyDraft(target);\n    if (!proxyDraft) {\n        throw new Error(`original() is only used for a draft, parameter: ${target}`);\n    }\n    return proxyDraft.original;\n}\n\n/**\n * Use rawReturn() to wrap the return value to skip the draft check and thus improve performance.\n *\n * ## Example\n *\n * ```ts\n * import { create, rawReturn } from '../index';\n *\n * const baseState = { foo: { bar: 'str' }, arr: [] };\n * const state = create(\n *   baseState,\n *   (draft) => {\n *     return rawReturn(baseState);\n *   },\n * );\n * expect(state).toBe(baseState);\n * ```\n */\nfunction rawReturn(value) {\n    if (arguments.length === 0) {\n        throw new Error('rawReturn() must be called with a value.');\n    }\n    if (arguments.length > 1) {\n        throw new Error('rawReturn() must be called with one argument.');\n    }\n    if (value !== undefined &&\n        (typeof value !== 'object' || value === null)) {\n        console.warn('rawReturn() must be called with an object(including plain object, arrays, Set, Map, etc.) or `undefined`, other types do not need to be returned via rawReturn().');\n    }\n    return {\n        [RAW_RETURN_SYMBOL]: [value],\n    };\n}\n\nconst constructorString = Object.prototype.constructor.toString();\n/**\n * Check if the value is a simple object(No prototype chain object or iframe same-origin object),\n * support case: https://github.com/unadlib/mutative/issues/17\n */\nconst isSimpleObject = (value) => {\n    if (!value || typeof value !== 'object')\n        return false;\n    const prototype = Object.getPrototypeOf(value);\n    if (prototype === null) {\n        return true;\n    }\n    const constructor = Object.hasOwnProperty.call(prototype, 'constructor') &&\n        prototype.constructor;\n    if (constructor === Object)\n        return true;\n    return (typeof constructor === 'function' &&\n        Function.toString.call(constructor) === constructorString);\n};\nconst markSimpleObject = (value) => {\n    if (isSimpleObject(value)) {\n        return dataTypes.immutable;\n    }\n    return;\n};\n\n/**\n * Cast a value to an Draft type value.\n */\nfunction castDraft(value) {\n    return value;\n}\n/**\n * Cast a value to an Immutable type value.\n */\nfunction castImmutable(value) {\n    return value;\n}\n/**\n * Cast a value to an Mutable type value.\n */\nfunction castMutable(draft) {\n    return draft;\n}\n\nexport { apply, castDraft, castImmutable, castMutable, create, current, isDraft, isDraftable, makeCreator, markSimpleObject, original, rawReturn, unsafe };\n//# sourceMappingURL=mutative.esm.mjs.map\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nexport default freeGlobal;\n","import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nexport default root;\n","import root from './_root.js';\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nexport default Symbol;\n","import Symbol from './_Symbol.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nexport default getRawTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nexport default objectToString;\n","import Symbol from './_Symbol.js';\nimport getRawTag from './_getRawTag.js';\nimport objectToString from './_objectToString.js';\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nexport default baseGetTag;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nexport default isObjectLike;\n","import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nexport default isSymbol;\n","/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nexport default arrayMap;\n","/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nexport default isArray;\n","import Symbol from './_Symbol.js';\nimport arrayMap from './_arrayMap.js';\nimport isArray from './isArray.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nexport default baseToString;\n","/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nexport default trimmedEndIndex;\n","import trimmedEndIndex from './_trimmedEndIndex.js';\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nexport default baseTrim;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nexport default isObject;\n","import baseTrim from './_baseTrim.js';\nimport isObject from './isObject.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nexport default toNumber;\n","import toNumber from './toNumber.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nexport default toFinite;\n","import toFinite from './toFinite.js';\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nexport default toInteger;\n","/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nexport default identity;\n","import baseGetTag from './_baseGetTag.js';\nimport isObject from './isObject.js';\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nexport default isFunction;\n","import root from './_root.js';\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nexport default coreJsData;\n","import coreJsData from './_coreJsData.js';\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nexport default isMasked;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nexport default toSource;\n","import isFunction from './isFunction.js';\nimport isMasked from './_isMasked.js';\nimport isObject from './isObject.js';\nimport toSource from './_toSource.js';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nexport default baseIsNative;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nexport default getValue;\n","import baseIsNative from './_baseIsNative.js';\nimport getValue from './_getValue.js';\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nexport default getNative;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar WeakMap = getNative(root, 'WeakMap');\n\nexport default WeakMap;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nexport default baseFindIndex;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nexport default isIndex;\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nexport default eq;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nexport default isLength;\n","import isFunction from './isFunction.js';\nimport isLength from './isLength.js';\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nexport default isArrayLike;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\nexport default isPrototype;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nexport default baseTimes;\n","import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nexport default baseIsArguments;\n","import baseIsArguments from './_baseIsArguments.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nexport default isArguments;\n","/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nexport default stubFalse;\n","import root from './_root.js';\nimport stubFalse from './stubFalse.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nexport default isBuffer;\n","import baseGetTag from './_baseGetTag.js';\nimport isLength from './isLength.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nexport default baseIsTypedArray;\n","/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nexport default baseUnary;\n","import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nexport default nodeUtil;\n","import baseIsTypedArray from './_baseIsTypedArray.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nexport default isTypedArray;\n","import baseTimes from './_baseTimes.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isIndex from './_isIndex.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nexport default arrayLikeKeys;\n","/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nexport default overArg;\n","import overArg from './_overArg.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nexport default nativeKeys;\n","import isPrototype from './_isPrototype.js';\nimport nativeKeys from './_nativeKeys.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nexport default baseKeys;\n","import arrayLikeKeys from './_arrayLikeKeys.js';\nimport baseKeys from './_baseKeys.js';\nimport isArrayLike from './isArrayLike.js';\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nexport default keys;\n","import isArray from './isArray.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used to match property names within property paths. */\nvar reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n    reIsPlainProp = /^\\w*$/;\n\n/**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\nfunction isKey(value, object) {\n  if (isArray(value)) {\n    return false;\n  }\n  var type = typeof value;\n  if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n      value == null || isSymbol(value)) {\n    return true;\n  }\n  return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n    (object != null && value in Object(object));\n}\n\nexport default isKey;\n","import getNative from './_getNative.js';\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nexport default nativeCreate;\n","import nativeCreate from './_nativeCreate.js';\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nexport default hashClear;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nexport default hashDelete;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nexport default hashGet;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nexport default hashHas;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nexport default hashSet;\n","import hashClear from './_hashClear.js';\nimport hashDelete from './_hashDelete.js';\nimport hashGet from './_hashGet.js';\nimport hashHas from './_hashHas.js';\nimport hashSet from './_hashSet.js';\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nexport default Hash;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nexport default listCacheClear;\n","import eq from './eq.js';\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nexport default assocIndexOf;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nexport default listCacheDelete;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nexport default listCacheGet;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nexport default listCacheHas;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nexport default listCacheSet;\n","import listCacheClear from './_listCacheClear.js';\nimport listCacheDelete from './_listCacheDelete.js';\nimport listCacheGet from './_listCacheGet.js';\nimport listCacheHas from './_listCacheHas.js';\nimport listCacheSet from './_listCacheSet.js';\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nexport default ListCache;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nexport default Map;\n","import Hash from './_Hash.js';\nimport ListCache from './_ListCache.js';\nimport Map from './_Map.js';\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nexport default mapCacheClear;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nexport default isKeyable;\n","import isKeyable from './_isKeyable.js';\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nexport default getMapData;\n","import getMapData from './_getMapData.js';\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nexport default mapCacheDelete;\n","import getMapData from './_getMapData.js';\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nexport default mapCacheGet;\n","import getMapData from './_getMapData.js';\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nexport default mapCacheHas;\n","import getMapData from './_getMapData.js';\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nexport default mapCacheSet;\n","import mapCacheClear from './_mapCacheClear.js';\nimport mapCacheDelete from './_mapCacheDelete.js';\nimport mapCacheGet from './_mapCacheGet.js';\nimport mapCacheHas from './_mapCacheHas.js';\nimport mapCacheSet from './_mapCacheSet.js';\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nexport default MapCache;\n","import MapCache from './_MapCache.js';\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\nfunction memoize(func, resolver) {\n  if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  var memoized = function() {\n    var args = arguments,\n        key = resolver ? resolver.apply(this, args) : args[0],\n        cache = memoized.cache;\n\n    if (cache.has(key)) {\n      return cache.get(key);\n    }\n    var result = func.apply(this, args);\n    memoized.cache = cache.set(key, result) || cache;\n    return result;\n  };\n  memoized.cache = new (memoize.Cache || MapCache);\n  return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nexport default memoize;\n","import memoize from './memoize.js';\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n  var result = memoize(func, function(key) {\n    if (cache.size === MAX_MEMOIZE_SIZE) {\n      cache.clear();\n    }\n    return key;\n  });\n\n  var cache = result.cache;\n  return result;\n}\n\nexport default memoizeCapped;\n","import memoizeCapped from './_memoizeCapped.js';\n\n/** Used to match property names within property paths. */\nvar rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n/** Used to match backslashes in property paths. */\nvar reEscapeChar = /\\\\(\\\\)?/g;\n\n/**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\nvar stringToPath = memoizeCapped(function(string) {\n  var result = [];\n  if (string.charCodeAt(0) === 46 /* . */) {\n    result.push('');\n  }\n  string.replace(rePropName, function(match, number, quote, subString) {\n    result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n  });\n  return result;\n});\n\nexport default stringToPath;\n","import baseToString from './_baseToString.js';\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nexport default toString;\n","import isArray from './isArray.js';\nimport isKey from './_isKey.js';\nimport stringToPath from './_stringToPath.js';\nimport toString from './toString.js';\n\n/**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\nfunction castPath(value, object) {\n  if (isArray(value)) {\n    return value;\n  }\n  return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nexport default castPath;\n","import isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\nfunction toKey(value) {\n  if (typeof value == 'string' || isSymbol(value)) {\n    return value;\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nexport default toKey;\n","import castPath from './_castPath.js';\nimport toKey from './_toKey.js';\n\n/**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\nfunction baseGet(object, path) {\n  path = castPath(path, object);\n\n  var index = 0,\n      length = path.length;\n\n  while (object != null && index < length) {\n    object = object[toKey(path[index++])];\n  }\n  return (index && index == length) ? object : undefined;\n}\n\nexport default baseGet;\n","import baseGet from './_baseGet.js';\n\n/**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\nfunction get(object, path, defaultValue) {\n  var result = object == null ? undefined : baseGet(object, path);\n  return result === undefined ? defaultValue : result;\n}\n\nexport default get;\n","/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nexport default arrayPush;\n","import Symbol from './_Symbol.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\n\n/** Built-in value references. */\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nexport default isFlattenable;\n","import arrayPush from './_arrayPush.js';\nimport isFlattenable from './_isFlattenable.js';\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\nexport default baseFlatten;\n","import ListCache from './_ListCache.js';\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nexport default stackClear;\n","/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nexport default stackDelete;\n","/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nexport default stackGet;\n","/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\nexport default stackHas;\n","import ListCache from './_ListCache.js';\nimport Map from './_Map.js';\nimport MapCache from './_MapCache.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\nexport default stackSet;\n","import ListCache from './_ListCache.js';\nimport stackClear from './_stackClear.js';\nimport stackDelete from './_stackDelete.js';\nimport stackGet from './_stackGet.js';\nimport stackHas from './_stackHas.js';\nimport stackSet from './_stackSet.js';\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nexport default Stack;\n","/**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction arrayFilter(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (predicate(value, index, array)) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nexport default arrayFilter;\n","/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nexport default stubArray;\n","import arrayFilter from './_arrayFilter.js';\nimport stubArray from './stubArray.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n  if (object == null) {\n    return [];\n  }\n  object = Object(object);\n  return arrayFilter(nativeGetSymbols(object), function(symbol) {\n    return propertyIsEnumerable.call(object, symbol);\n  });\n};\n\nexport default getSymbols;\n","import arrayPush from './_arrayPush.js';\nimport isArray from './isArray.js';\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nexport default baseGetAllKeys;\n","import baseGetAllKeys from './_baseGetAllKeys.js';\nimport getSymbols from './_getSymbols.js';\nimport keys from './keys.js';\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\nexport default getAllKeys;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView');\n\nexport default DataView;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Promise = getNative(root, 'Promise');\n\nexport default Promise;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nexport default Set;\n","import DataView from './_DataView.js';\nimport Map from './_Map.js';\nimport Promise from './_Promise.js';\nimport Set from './_Set.js';\nimport WeakMap from './_WeakMap.js';\nimport baseGetTag from './_baseGetTag.js';\nimport toSource from './_toSource.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    objectTag = '[object Object]',\n    promiseTag = '[object Promise]',\n    setTag = '[object Set]',\n    weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n    mapCtorString = toSource(Map),\n    promiseCtorString = toSource(Promise),\n    setCtorString = toSource(Set),\n    weakMapCtorString = toSource(WeakMap);\n\n/**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n    (Map && getTag(new Map) != mapTag) ||\n    (Promise && getTag(Promise.resolve()) != promiseTag) ||\n    (Set && getTag(new Set) != setTag) ||\n    (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n  getTag = function(value) {\n    var result = baseGetTag(value),\n        Ctor = result == objectTag ? value.constructor : undefined,\n        ctorString = Ctor ? toSource(Ctor) : '';\n\n    if (ctorString) {\n      switch (ctorString) {\n        case dataViewCtorString: return dataViewTag;\n        case mapCtorString: return mapTag;\n        case promiseCtorString: return promiseTag;\n        case setCtorString: return setTag;\n        case weakMapCtorString: return weakMapTag;\n      }\n    }\n    return result;\n  };\n}\n\nexport default getTag;\n","import root from './_root.js';\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nexport default Uint8Array;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nexport default setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nexport default setCacheHas;\n","import MapCache from './_MapCache.js';\nimport setCacheAdd from './_setCacheAdd.js';\nimport setCacheHas from './_setCacheHas.js';\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nexport default SetCache;\n","/**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n */\nfunction arraySome(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (predicate(array[index], index, array)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nexport default arraySome;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nexport default cacheHas;\n","import SetCache from './_SetCache.js';\nimport arraySome from './_arraySome.js';\nimport cacheHas from './_cacheHas.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Check that cyclic values are equal.\n  var arrStacked = stack.get(array);\n  var othStacked = stack.get(other);\n  if (arrStacked && othStacked) {\n    return arrStacked == other && othStacked == array;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalArrays;\n","/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\nexport default mapToArray;\n","/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nexport default setToArray;\n","import Symbol from './_Symbol.js';\nimport Uint8Array from './_Uint8Array.js';\nimport eq from './eq.js';\nimport equalArrays from './_equalArrays.js';\nimport mapToArray from './_mapToArray.js';\nimport setToArray from './_setToArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nexport default equalByTag;\n","import getAllKeys from './_getAllKeys.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Check that cyclic values are equal.\n  var objStacked = stack.get(object);\n  var othStacked = stack.get(other);\n  if (objStacked && othStacked) {\n    return objStacked == other && othStacked == object;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalObjects;\n","import Stack from './_Stack.js';\nimport equalArrays from './_equalArrays.js';\nimport equalByTag from './_equalByTag.js';\nimport equalObjects from './_equalObjects.js';\nimport getTag from './_getTag.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n  var objIsArr = isArray(object),\n      othIsArr = isArray(other),\n      objTag = objIsArr ? arrayTag : getTag(object),\n      othTag = othIsArr ? arrayTag : getTag(other);\n\n  objTag = objTag == argsTag ? objectTag : objTag;\n  othTag = othTag == argsTag ? objectTag : othTag;\n\n  var objIsObj = objTag == objectTag,\n      othIsObj = othTag == objectTag,\n      isSameTag = objTag == othTag;\n\n  if (isSameTag && isBuffer(object)) {\n    if (!isBuffer(other)) {\n      return false;\n    }\n    objIsArr = true;\n    objIsObj = false;\n  }\n  if (isSameTag && !objIsObj) {\n    stack || (stack = new Stack);\n    return (objIsArr || isTypedArray(object))\n      ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n      : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n  }\n  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n    if (objIsWrapped || othIsWrapped) {\n      var objUnwrapped = objIsWrapped ? object.value() : object,\n          othUnwrapped = othIsWrapped ? other.value() : other;\n\n      stack || (stack = new Stack);\n      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n    }\n  }\n  if (!isSameTag) {\n    return false;\n  }\n  stack || (stack = new Stack);\n  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n}\n\nexport default baseIsEqualDeep;\n","import baseIsEqualDeep from './_baseIsEqualDeep.js';\nimport isObjectLike from './isObjectLike.js';\n\n/**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Unordered comparison\n *  2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n  if (value === other) {\n    return true;\n  }\n  if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n    return value !== value && other !== other;\n  }\n  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nexport default baseIsEqual;\n","import Stack from './_Stack.js';\nimport baseIsEqual from './_baseIsEqual.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\nfunction baseIsMatch(object, source, matchData, customizer) {\n  var index = matchData.length,\n      length = index,\n      noCustomizer = !customizer;\n\n  if (object == null) {\n    return !length;\n  }\n  object = Object(object);\n  while (index--) {\n    var data = matchData[index];\n    if ((noCustomizer && data[2])\n          ? data[1] !== object[data[0]]\n          : !(data[0] in object)\n        ) {\n      return false;\n    }\n  }\n  while (++index < length) {\n    data = matchData[index];\n    var key = data[0],\n        objValue = object[key],\n        srcValue = data[1];\n\n    if (noCustomizer && data[2]) {\n      if (objValue === undefined && !(key in object)) {\n        return false;\n      }\n    } else {\n      var stack = new Stack;\n      if (customizer) {\n        var result = customizer(objValue, srcValue, key, object, source, stack);\n      }\n      if (!(result === undefined\n            ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n            : result\n          )) {\n        return false;\n      }\n    }\n  }\n  return true;\n}\n\nexport default baseIsMatch;\n","import isObject from './isObject.js';\n\n/**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n *  equality comparisons, else `false`.\n */\nfunction isStrictComparable(value) {\n  return value === value && !isObject(value);\n}\n\nexport default isStrictComparable;\n","import isStrictComparable from './_isStrictComparable.js';\nimport keys from './keys.js';\n\n/**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\nfunction getMatchData(object) {\n  var result = keys(object),\n      length = result.length;\n\n  while (length--) {\n    var key = result[length],\n        value = object[key];\n\n    result[length] = [key, value, isStrictComparable(value)];\n  }\n  return result;\n}\n\nexport default getMatchData;\n","/**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction matchesStrictComparable(key, srcValue) {\n  return function(object) {\n    if (object == null) {\n      return false;\n    }\n    return object[key] === srcValue &&\n      (srcValue !== undefined || (key in Object(object)));\n  };\n}\n\nexport default matchesStrictComparable;\n","import baseIsMatch from './_baseIsMatch.js';\nimport getMatchData from './_getMatchData.js';\nimport matchesStrictComparable from './_matchesStrictComparable.js';\n\n/**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatches(source) {\n  var matchData = getMatchData(source);\n  if (matchData.length == 1 && matchData[0][2]) {\n    return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n  }\n  return function(object) {\n    return object === source || baseIsMatch(object, source, matchData);\n  };\n}\n\nexport default baseMatches;\n","/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nexport default baseHasIn;\n","import castPath from './_castPath.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isIndex from './_isIndex.js';\nimport isLength from './isLength.js';\nimport toKey from './_toKey.js';\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nexport default hasPath;\n","import baseHasIn from './_baseHasIn.js';\nimport hasPath from './_hasPath.js';\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nexport default hasIn;\n","import baseIsEqual from './_baseIsEqual.js';\nimport get from './get.js';\nimport hasIn from './hasIn.js';\nimport isKey from './_isKey.js';\nimport isStrictComparable from './_isStrictComparable.js';\nimport matchesStrictComparable from './_matchesStrictComparable.js';\nimport toKey from './_toKey.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatchesProperty(path, srcValue) {\n  if (isKey(path) && isStrictComparable(srcValue)) {\n    return matchesStrictComparable(toKey(path), srcValue);\n  }\n  return function(object) {\n    var objValue = get(object, path);\n    return (objValue === undefined && objValue === srcValue)\n      ? hasIn(object, path)\n      : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n  };\n}\n\nexport default baseMatchesProperty;\n","/**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction baseProperty(key) {\n  return function(object) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nexport default baseProperty;\n","import baseGet from './_baseGet.js';\n\n/**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyDeep(path) {\n  return function(object) {\n    return baseGet(object, path);\n  };\n}\n\nexport default basePropertyDeep;\n","import baseProperty from './_baseProperty.js';\nimport basePropertyDeep from './_basePropertyDeep.js';\nimport isKey from './_isKey.js';\nimport toKey from './_toKey.js';\n\n/**\n * Creates a function that returns the value at `path` of a given object.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var objects = [\n *   { 'a': { 'b': 2 } },\n *   { 'a': { 'b': 1 } }\n * ];\n *\n * _.map(objects, _.property('a.b'));\n * // => [2, 1]\n *\n * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n */\nfunction property(path) {\n  return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n}\n\nexport default property;\n","import baseMatches from './_baseMatches.js';\nimport baseMatchesProperty from './_baseMatchesProperty.js';\nimport identity from './identity.js';\nimport isArray from './isArray.js';\nimport property from './property.js';\n\n/**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\nfunction baseIteratee(value) {\n  // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n  // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n  if (typeof value == 'function') {\n    return value;\n  }\n  if (value == null) {\n    return identity;\n  }\n  if (typeof value == 'object') {\n    return isArray(value)\n      ? baseMatchesProperty(value[0], value[1])\n      : baseMatches(value);\n  }\n  return property(value);\n}\n\nexport default baseIteratee;\n","/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n  return function(object, iteratee, keysFunc) {\n    var index = -1,\n        iterable = Object(object),\n        props = keysFunc(object),\n        length = props.length;\n\n    while (length--) {\n      var key = props[fromRight ? length : ++index];\n      if (iteratee(iterable[key], key, iterable) === false) {\n        break;\n      }\n    }\n    return object;\n  };\n}\n\nexport default createBaseFor;\n","import createBaseFor from './_createBaseFor.js';\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\nexport default baseFor;\n","import baseFor from './_baseFor.js';\nimport keys from './keys.js';\n\n/**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\nfunction baseForOwn(object, iteratee) {\n  return object && baseFor(object, iteratee, keys);\n}\n\nexport default baseForOwn;\n","import isArrayLike from './isArrayLike.js';\n\n/**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseEach(eachFunc, fromRight) {\n  return function(collection, iteratee) {\n    if (collection == null) {\n      return collection;\n    }\n    if (!isArrayLike(collection)) {\n      return eachFunc(collection, iteratee);\n    }\n    var length = collection.length,\n        index = fromRight ? length : -1,\n        iterable = Object(collection);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (iteratee(iterable[index], index, iterable) === false) {\n        break;\n      }\n    }\n    return collection;\n  };\n}\n\nexport default createBaseEach;\n","import baseForOwn from './_baseForOwn.js';\nimport createBaseEach from './_createBaseEach.js';\n\n/**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\nvar baseEach = createBaseEach(baseForOwn);\n\nexport default baseEach;\n","/**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\nfunction last(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? array[length - 1] : undefined;\n}\n\nexport default last;\n","/**\n * A specialized version of `_.every` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n *  else `false`.\n */\nfunction arrayEvery(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (!predicate(array[index], index, array)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport default arrayEvery;\n","import baseEach from './_baseEach.js';\n\n/**\n * The base implementation of `_.every` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n *  else `false`\n */\nfunction baseEvery(collection, predicate) {\n  var result = true;\n  baseEach(collection, function(value, index, collection) {\n    result = !!predicate(value, index, collection);\n    return result;\n  });\n  return result;\n}\n\nexport default baseEvery;\n","import arrayEvery from './_arrayEvery.js';\nimport baseEvery from './_baseEvery.js';\nimport baseIteratee from './_baseIteratee.js';\nimport isArray from './isArray.js';\nimport isIterateeCall from './_isIterateeCall.js';\n\n/**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n *  else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': false },\n *   { 'user': 'fred',   'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\nfunction every(collection, predicate, guard) {\n  var func = isArray(collection) ? arrayEvery : baseEvery;\n  if (guard && isIterateeCall(collection, predicate, guard)) {\n    predicate = undefined;\n  }\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nexport default every;\n","import baseIteratee from './_baseIteratee.js';\nimport isArrayLike from './isArrayLike.js';\nimport keys from './keys.js';\n\n/**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\nfunction createFind(findIndexFunc) {\n  return function(collection, predicate, fromIndex) {\n    var iterable = Object(collection);\n    if (!isArrayLike(collection)) {\n      var iteratee = baseIteratee(predicate, 3);\n      collection = keys(collection);\n      predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n    }\n    var index = findIndexFunc(collection, predicate, fromIndex);\n    return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n  };\n}\n\nexport default createFind;\n","import baseFindIndex from './_baseFindIndex.js';\nimport baseIteratee from './_baseIteratee.js';\nimport toInteger from './toInteger.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': false },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\nfunction findIndex(array, predicate, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = fromIndex == null ? 0 : toInteger(fromIndex);\n  if (index < 0) {\n    index = nativeMax(length + index, 0);\n  }\n  return baseFindIndex(array, baseIteratee(predicate, 3), index);\n}\n\nexport default findIndex;\n","import createFind from './_createFind.js';\nimport findIndex from './findIndex.js';\n\n/**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'age': 36, 'active': true },\n *   { 'user': 'fred',    'age': 40, 'active': false },\n *   { 'user': 'pebbles', 'age': 1,  'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\nvar find = createFind(findIndex);\n\nexport default find;\n","import baseEach from './_baseEach.js';\nimport isArrayLike from './isArrayLike.js';\n\n/**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction baseMap(collection, iteratee) {\n  var index = -1,\n      result = isArrayLike(collection) ? Array(collection.length) : [];\n\n  baseEach(collection, function(value, key, collection) {\n    result[++index] = iteratee(value, key, collection);\n  });\n  return result;\n}\n\nexport default baseMap;\n","import arrayMap from './_arrayMap.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseMap from './_baseMap.js';\nimport isArray from './isArray.js';\n\n/**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n *   return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n *   { 'user': 'barney' },\n *   { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\nfunction map(collection, iteratee) {\n  var func = isArray(collection) ? arrayMap : baseMap;\n  return func(collection, baseIteratee(iteratee, 3));\n}\n\nexport default map;\n","import baseFlatten from './_baseFlatten.js';\nimport map from './map.js';\n\n/**\n * Creates a flattened array of values by running each element in `collection`\n * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n * with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n *   return [n, n];\n * }\n *\n * _.flatMap([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\nfunction flatMap(collection, iteratee) {\n  return baseFlatten(map(collection, iteratee), 1);\n}\n\nexport default flatMap;\n","/**\n * The inverse of `_.toPairs`; this method returns an object composed\n * from key-value `pairs`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} pairs The key-value pairs.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.fromPairs([['a', 1], ['b', 2]]);\n * // => { 'a': 1, 'b': 2 }\n */\nfunction fromPairs(pairs) {\n  var index = -1,\n      length = pairs == null ? 0 : pairs.length,\n      result = {};\n\n  while (++index < length) {\n    var pair = pairs[index];\n    result[pair[0]] = pair[1];\n  }\n  return result;\n}\n\nexport default fromPairs;\n","import baseIsEqual from './_baseIsEqual.js';\n\n/**\n * Performs a deep comparison between two values to determine if they are\n * equivalent.\n *\n * **Note:** This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.isEqual(object, other);\n * // => true\n *\n * object === other;\n * // => false\n */\nfunction isEqual(value, other) {\n  return baseIsEqual(value, other);\n}\n\nexport default isEqual;\n","import { create, type Draft } from \"mutative\";\nimport { last, flatMap, fromPairs, every, find } from \"lodash-es\";\nimport type { Change, SyncQueueState, SyncResult, IdMapping } from \"./types\";\n\nexport type SyncQueueConfig<T> = {\n  debounce: number;\n  maxRetries: number;\n  onSync: (changes: Change<T>[], signal: AbortSignal) => Promise<SyncResult[]>;\n  onIdRemap?: (mappings: IdMapping[]) => void;\n};\n\n// Coalescing rules: returns null for net-zero operations\nconst coalesce = <T>(ops: Change<T>[], next: Change<T>): Change<T>[] | null => {\n  if (!ops.length) return [next];\n\n  const prev = last(ops)!;\n\n  // create + delete = net zero\n  if (prev.type === \"create\" && next.type === \"delete\") return null;\n  // create + update = create with new data\n  if (prev.type === \"create\" && next.type === \"update\") return [{ ...prev, data: next.data }];\n  // update + update = single update with latest data\n  if (prev.type === \"update\" && next.type === \"update\") return [...ops.slice(0, -1), next];\n  // update + delete = keep both (need update before delete)\n  if (prev.type === \"update\" && next.type === \"delete\") return [...ops, next];\n  // Any other combination = replace with new\n  return [next];\n};\n\nexport class SyncQueue<T> {\n  private _config: SyncQueueConfig<T>;\n  private _state: SyncQueueState<T>;\n  private _subscribers = new Set<() => void>();\n  private _debounceTimer: ReturnType<typeof setTimeout> | null = null;\n  private _abortController: AbortController | null = null;\n\n  constructor(config: SyncQueueConfig<T>) {\n    this._config = config;\n    this._state = {\n      queue: new Map(),\n      inFlight: new Map(),\n      errors: new Map(),\n      isPaused: false,\n      isSyncing: false,\n    };\n  }\n\n  enqueue(change: Change<T>): void {\n    this._updateState((draft) => {\n      const existing = [...(draft.queue.get(change.id) ?? [])] as Change<T>[];\n      const coalesced = coalesce(existing, change);\n\n      if (coalesced) {\n        draft.queue.set(change.id, coalesced as Draft<Change<T>[]>);\n      } else {\n        draft.queue.delete(change.id);\n      }\n      draft.errors.delete(change.id);\n    });\n    this._scheduleFlush();\n  }\n\n  pause(): void {\n    this._updateState((draft) => {\n      draft.isPaused = true;\n    });\n    this._clearTimer();\n  }\n\n  resume(): void {\n    this._updateState((draft) => {\n      draft.isPaused = false;\n    });\n    if (this._state.queue.size > 0) this._scheduleFlush();\n  }\n\n  retryAll(): void {\n    const errors = this._state.errors;\n    if (errors.size === 0) return;\n\n    this._updateState((draft) => {\n      // Re-queue all failed operations\n      for (const [id, errorInfo] of errors) {\n        if (!draft.queue.has(id)) {\n          draft.queue.set(id, errorInfo.operations as Draft<Change<T>[]>);\n        }\n      }\n      draft.errors.clear();\n    });\n    this._scheduleFlush();\n  }\n\n  retry(id: string): void {\n    const errorInfo = this._state.errors.get(id);\n    if (!errorInfo) return;\n\n    this._updateState((draft) => {\n      // Re-queue the failed operations\n      if (!draft.queue.has(id)) {\n        draft.queue.set(id, errorInfo.operations as Draft<Change<T>[]>);\n      }\n      draft.errors.delete(id);\n    });\n    this._scheduleFlush();\n  }\n\n  resetRetries(id: string): void {\n    if (!this._state.errors.has(id)) return;\n    this._updateState((draft) => {\n      const error = draft.errors.get(id);\n      if (error) error.retries = 0;\n    });\n  }\n\n  getState(): SyncQueueState<T> {\n    return this._state;\n  }\n\n  subscribe(callback: () => void): () => void {\n    this._subscribers.add(callback);\n    return () => this._subscribers.delete(callback);\n  }\n\n  private _updateState(mutator: (draft: Draft<SyncQueueState<T>>) => void): void {\n    this._state = create(this._state, mutator);\n    this._subscribers.forEach((cb) => cb());\n  }\n\n  private _scheduleFlush(): void {\n    if (this._state.isPaused || this._state.isSyncing) return;\n    this._clearTimer();\n    this._debounceTimer = setTimeout(() => this._flush(), this._config.debounce);\n  }\n\n  private _clearTimer(): void {\n    if (this._debounceTimer) {\n      clearTimeout(this._debounceTimer);\n      this._debounceTimer = null;\n    }\n  }\n\n  private async _flush(): Promise<void> {\n    const { isPaused, isSyncing, queue } = this._state;\n    if (isPaused || isSyncing || queue.size === 0) return;\n\n    // Move queue to inFlight\n    this._updateState((draft) => {\n      draft.inFlight = new Map(queue) as Draft<Map<string, Change<T>[]>>;\n      draft.queue = new Map();\n      draft.isSyncing = true;\n    });\n\n    const changes = flatMap([...this._state.inFlight.values()]);\n    this._abortController = new AbortController();\n\n    try {\n      const results = await this._config.onSync(changes, this._abortController.signal);\n      this._processResults(fromPairs(results.map((r) => [r.id, r])));\n    } catch (error) {\n      this._handleError(error);\n    }\n\n    this._abortController = null;\n    if (this._state.queue.size > 0 && !this._state.isPaused) this._scheduleFlush();\n  }\n\n  private _processResults(resultMap: Record<string, SyncResult>): void {\n    const inFlight = this._state.inFlight;\n    const idMappings: IdMapping[] = [];\n\n    this._updateState((draft) => {\n      for (const [id, ops] of inFlight) {\n        const allSuccess = every(ops, (op) => resultMap[op.id]?.status === \"success\");\n\n        if (allSuccess) {\n          draft.errors.delete(id);\n\n          // Collect ID mappings for successful create operations\n          for (const op of ops) {\n            const result = resultMap[op.id];\n            if (op.type === \"create\" && result?.newId && result.newId !== op.id) {\n              idMappings.push({ tempId: op.id, newId: result.newId });\n            }\n          }\n        } else {\n          const retries = (draft.errors.get(id)?.retries ?? 0) + 1;\n          if (retries < this._config.maxRetries && !draft.queue.has(id)) {\n            draft.queue.set(id, ops as Draft<Change<T>[]>);\n          }\n          const failed = find(ops, (op) => resultMap[op.id]?.status !== \"success\");\n          draft.errors.set(id, {\n            error: resultMap[failed?.id ?? \"\"]?.error ?? \"Unknown error\",\n            retries,\n            operations: ops as Draft<Change<T>[]>,\n          });\n        }\n      }\n      draft.inFlight = new Map();\n      draft.isSyncing = false;\n    });\n\n    // Notify about ID remappings after state update\n    if (idMappings.length > 0 && this._config.onIdRemap) {\n      this._config.onIdRemap(idMappings);\n    }\n  }\n\n  private _handleError(error: unknown): void {\n    const inFlight = this._state.inFlight;\n    const isAborted = this._abortController?.signal.aborted;\n    const errorMsg = error instanceof Error ? error.message : String(error);\n\n    this._updateState((draft) => {\n      for (const [id, ops] of inFlight) {\n        if (isAborted) {\n          if (!draft.queue.has(id)) draft.queue.set(id, ops as Draft<Change<T>[]>);\n        } else {\n          const retries = (draft.errors.get(id)?.retries ?? 0) + 1;\n          if (retries < this._config.maxRetries && !draft.queue.has(id)) {\n            draft.queue.set(id, ops as Draft<Change<T>[]>);\n          }\n          draft.errors.set(id, {\n            error: errorMsg,\n            retries,\n            operations: ops as Draft<Change<T>[]>,\n          });\n        }\n      }\n      draft.inFlight = new Map();\n      draft.isSyncing = false;\n    });\n  }\n}\n","type CacheEntry<T> = { data: T; ts: number };\n\nexport class Cache<T> {\n  private _cache = new Map<string, CacheEntry<T>>();\n  private _capacity: number;\n  private _ttl: number;\n\n  constructor(capacity: number, ttl: number) {\n    this._capacity = capacity;\n    this._ttl = ttl;\n  }\n\n  get(key: string): T | null {\n    const entry = this._cache.get(key);\n    if (!entry) return null;\n\n    if (Date.now() - entry.ts > this._ttl) {\n      this._cache.delete(key);\n      return null;\n    }\n\n    // Move to end (most recently used) for LRU\n    this._cache.delete(key);\n    this._cache.set(key, entry);\n    return entry.data;\n  }\n\n  set(key: string, value: T): void {\n    if (this._cache.has(key)) {\n      this._cache.delete(key);\n    } else if (this._cache.size >= this._capacity) {\n      const firstKey = this._cache.keys().next().value;\n      if (firstKey !== undefined) this._cache.delete(firstKey);\n    }\n\n    this._cache.set(key, { data: value, ts: Date.now() });\n  }\n\n  invalidate(key: string): void {\n    this._cache.delete(key);\n  }\n\n  clear(): void {\n    this._cache.clear();\n  }\n\n  has(key: string): boolean {\n    return this.get(key) !== null;\n  }\n\n  get size(): number {\n    return this._cache.size;\n  }\n}\n","import { create } from \"mutative\";\nimport { Cache } from \"./cache\";\nimport type { FetchState } from \"./types\";\n\nexport type FetchHandlerConfig<T, C> = {\n  id: string;\n  cacheCapacity: number;\n  cacheTtl: number;\n  retries?: number;\n  onFetch: (context: C, signal: AbortSignal) => Promise<T[]>;\n};\n\nexport type FetchHandlerState<T> = {\n  status: FetchState;\n  items: T[];\n  error?: string;\n  retryCount?: number;\n};\n\nexport class FetchHandler<T, C> {\n  private _config: FetchHandlerConfig<T, C>;\n  private _cache: Cache<T[]>;\n  private _state: FetchHandlerState<T> = { status: \"idle\", items: [] };\n  private _subscribers = new Set<() => void>();\n  private _abortController: AbortController | null = null;\n  private _currentContext: C | null = null;\n\n  constructor(config: FetchHandlerConfig<T, C>) {\n    this._config = { retries: 0, ...config };\n    this._cache = new Cache<T[]>(config.cacheCapacity, config.cacheTtl);\n  }\n\n  private _getCacheKey = (context: C): string => JSON.stringify([this._config.id, context]);\n\n  private _setState(patch: Partial<FetchHandlerState<T>>): void {\n    this._state = create(this._state, (draft) => {\n      Object.assign(draft, patch);\n    });\n    this._subscribers.forEach((cb) => cb());\n  }\n\n  private async _fetchWithRetry(context: C, signal: AbortSignal): Promise<T[]> {\n    const maxRetries = this._config.retries!;\n    let lastError: unknown;\n\n    for (let attempt = 0; attempt <= maxRetries; attempt++) {\n      if (signal.aborted) throw new DOMException(\"Aborted\", \"AbortError\");\n\n      try {\n        if (attempt > 0) this._setState({ retryCount: attempt });\n        return await this._config.onFetch(context, signal);\n      } catch (error) {\n        lastError = error;\n        if (signal.aborted || attempt === maxRetries) throw error;\n      }\n    }\n\n    throw lastError;\n  }\n\n  async fetch(context: C): Promise<T[]> {\n    const cacheKey = this._getCacheKey(context);\n    const cached = this._cache.get(cacheKey);\n\n    if (cached !== null) {\n      this._currentContext = context;\n      this._setState({ status: \"idle\", items: cached, error: undefined, retryCount: undefined });\n      return cached;\n    }\n\n    this._abortController?.abort(\"New fetch request started\");\n    const abortController = new AbortController();\n    this._abortController = abortController;\n    this._currentContext = context;\n    this._setState({ status: \"fetching\", error: undefined, retryCount: undefined });\n\n    try {\n      const items = await this._fetchWithRetry(context, abortController.signal);\n      this._cache.set(cacheKey, items);\n      this._abortController = null;\n      this._setState({ status: \"idle\", items, error: undefined, retryCount: undefined });\n      return items;\n    } catch (error) {\n      // If this request was aborted, return current items silently\n      if (abortController.signal.aborted) return this._state.items;\n\n      this._abortController = null;\n      this._setState({\n        status: \"error\",\n        error: error instanceof Error ? error.message : String(error),\n      });\n      throw error;\n    }\n  }\n\n  async refresh(context?: C): Promise<T[]> {\n    const ctx = context ?? this._currentContext;\n    if (!ctx) throw new Error(\"No context provided for refresh\");\n\n    this._cache.invalidate(this._getCacheKey(ctx));\n    return this.fetch(ctx);\n  }\n\n  invalidateCache(): void {\n    this._cache.clear();\n  }\n\n  invalidateCacheForContext(context: C): void {\n    this._cache.invalidate(this._getCacheKey(context));\n  }\n\n  getState = (): FetchHandlerState<T> => this._state;\n  getContext = (): C | null => this._currentContext;\n  isFetching = (): boolean => this._state.status === \"fetching\";\n\n  subscribe(callback: () => void): () => void {\n    this._subscribers.add(callback);\n    return () => {\n      this._subscribers.delete(callback);\n    };\n  }\n}\n","import { isEqual } from \"lodash-es\";\nimport type { Draft } from \"mutative\";\nimport type { Collection } from \"./collection\";\nimport type { ItemStatus } from \"./types\";\n\nexport class Item<T, C = unknown> {\n  private _collection: Collection<T, C>;\n  private _id: string;\n  private _cachedStatus: ItemStatus = null;\n\n  constructor(collection: Collection<T, C>, id: string) {\n    this._collection = collection;\n    this._id = id;\n  }\n\n  get id(): string {\n    return this._id;\n  }\n\n  get data(): T | undefined {\n    return this._collection.getState().items.get(this._id);\n  }\n\n  update(mutate: (draft: Draft<T>) => void): void {\n    this._collection.update(this._id, mutate);\n  }\n\n  remove(): void {\n    this._collection.remove(this._id);\n  }\n\n  getStatus(): ItemStatus {\n    const newStatus = this._collection.getItemStatus(this._id);\n    if (!isEqual(this._cachedStatus, newStatus)) {\n      this._cachedStatus = newStatus;\n    }\n    return this._cachedStatus;\n  }\n\n  exists(): boolean {\n    return this._collection.getState().items.has(this._id);\n  }\n\n  // Expose collection for useItem hook\n  get collection(): Collection<T, C> {\n    return this._collection;\n  }\n\n  // Internal method to update ID after server assigns permanent ID\n  // Called by Collection when handling ID remapping\n  _updateId(newId: string): void {\n    this._id = newId;\n  }\n}\n","import { create, type Draft } from \"mutative\";\nimport { SyncQueue } from \"./sync-queue\";\nimport { FetchHandler } from \"./fetch-handler\";\nimport { Item } from \"./item\";\nimport type {\n  Config,\n  SyncState,\n  Mutator,\n  ItemStatus,\n  SyncQueueState,\n  FetchState,\n  IdMapping,\n  Change,\n  SyncResult,\n} from \"./types\";\n\nexport type CollectionState<T, C> = {\n  context: C;\n  items: Map<string, T>;\n  syncState: SyncState;\n  loading: boolean;\n  syncing: boolean;\n  syncQueue: SyncQueueState<T>;\n  fetchStatus: FetchState;\n  fetchError?: string;\n};\n\nexport class Collection<T, C> {\n  // Global cache of collection instances by id\n  private static _cache = new Map<string, Collection<unknown, unknown>>();\n\n  // Get or create a collection instance\n  static get<T, C>(config: Config<T, C>): Collection<T, C> {\n    const existing = Collection._cache.get(config.id);\n    if (existing) {\n      return existing as Collection<T, C>;\n    }\n    const collection = new Collection(config);\n    Collection._cache.set(config.id, collection as Collection<unknown, unknown>);\n    return collection;\n  }\n\n  // Clear a specific collection from cache\n  static clear(id: string): void {\n    Collection._cache.delete(id);\n  }\n\n  // Clear all collections from cache\n  static clearAll(): void {\n    Collection._cache.clear();\n  }\n\n  readonly id: string;\n  readonly config: Config<T, C>;\n\n  private _state: CollectionState<T, C>;\n  private _syncQueue: SyncQueue<T>;\n  private _fetchHandler: FetchHandler<T, C>;\n  private _itemCache: Map<string, Item<T, C>> = new Map();\n  private _subscribers: Set<() => void> = new Set();\n  private _hasInitialized = false;\n  private _batchMode = false;\n\n  constructor(config: Config<T, C>) {\n    this.id = config.id;\n    this.config = config;\n\n    // Initialize SyncQueue\n    // Default no-op sync handler for offline-first mode (all operations succeed locally)\n    const defaultOnSync = async (changes: Change<T>[]): Promise<SyncResult[]> =>\n      changes.map((c) => ({ id: c.id, status: \"success\" as const }));\n\n    this._syncQueue = new SyncQueue<T>({\n      debounce: config.syncDebounce ?? 300,\n      maxRetries: config.syncRetries ?? 3,\n      onSync: config.onSync ?? defaultOnSync,\n      onIdRemap: (mappings) => this._handleIdRemap(mappings),\n    });\n\n    // Initialize FetchHandler\n    this._fetchHandler = new FetchHandler<T, C>({\n      id: config.id,\n      cacheCapacity: config.cacheCapacity ?? 10,\n      cacheTtl: config.cacheTtl ?? 60000,\n      retries: config.fetchRetries ?? 0,\n      onFetch: config.onFetch,\n    });\n\n    // Initialize state\n    const syncQueueState = this._syncQueue.getState();\n    const fetchState = this._fetchHandler.getState();\n    this._state = {\n      context: config.initialContext,\n      items: new Map(),\n      syncState: \"idle\",\n      loading: false,\n      syncing: false,\n      syncQueue: syncQueueState,\n      fetchStatus: fetchState.status,\n      fetchError: fetchState.error,\n    };\n\n    // Subscribe to SyncQueue changes\n    this._syncQueue.subscribe(() => {\n      this._onSyncQueueChange();\n    });\n\n    // Subscribe to FetchHandler changes\n    this._fetchHandler.subscribe(() => {\n      this._onFetchChange();\n    });\n\n    // Start initial fetch\n    this._initialFetch();\n  }\n\n  // Getters for convenience (read from state)\n  get context(): C {\n    return this._state.context;\n  }\n\n  get items(): Map<string, T> {\n    return this._state.items;\n  }\n\n  get loading(): boolean {\n    return this._state.loading;\n  }\n\n  get syncing(): boolean {\n    return this._state.syncing;\n  }\n\n  get syncQueue(): SyncQueueState<T> {\n    return this._state.syncQueue;\n  }\n\n  // Subscribe to state changes\n  subscribe(callback: () => void): () => void {\n    this._subscribers.add(callback);\n    return () => {\n      this._subscribers.delete(callback);\n    };\n  }\n\n  // Get current state (for useSyncExternalStore) - returns cached reference\n  getState(): CollectionState<T, C> {\n    return this._state;\n  }\n\n  // Get item status from sync queue state\n  getItemStatus(id: string): ItemStatus {\n    const { queue, inFlight, errors } = this._state.syncQueue;\n\n    const inFlightChanges = inFlight.get(id);\n    if (inFlightChanges && inFlightChanges.length > 0) {\n      // Use the last operation as the most relevant status\n      const lastChange = inFlightChanges[inFlightChanges.length - 1];\n      return {\n        type: lastChange.type,\n        status: \"syncing\",\n        retries: errors.get(id)?.retries ?? 0,\n      };\n    }\n\n    const queuedChanges = queue.get(id);\n    if (queuedChanges && queuedChanges.length > 0) {\n      // Use the last operation as the most relevant status\n      const lastChange = queuedChanges[queuedChanges.length - 1];\n      const errorInfo = errors.get(id);\n      return {\n        type: lastChange.type,\n        status: errorInfo ? \"error\" : \"pending\",\n        retries: errorInfo?.retries ?? 0,\n        error: errorInfo?.error,\n      };\n    }\n\n    const errorInfo = errors.get(id);\n    if (errorInfo) {\n      return {\n        type: \"update\",\n        status: \"error\",\n        retries: errorInfo.retries,\n        error: errorInfo.error,\n      };\n    }\n\n    return null;\n  }\n\n  // Create a new item (local-first)\n  create(item: T): void {\n    const id = this.config.getId(item);\n\n    this._state = create(this._state, (draft) => {\n      draft.items.set(id, item as Draft<T>);\n    });\n\n    this._fetchHandler.invalidateCache();\n    this._notifySubscribers();\n    this._syncQueue.enqueue({ id, type: \"create\", data: item });\n  }\n\n  // Update an existing item (local-first)\n  update(id: string, mutate: (draft: Draft<T>) => void): void {\n    const currentItem = this._state.items.get(id);\n    if (!currentItem) return;\n\n    const newItem = create(currentItem, mutate);\n\n    this._state = create(this._state, (draft) => {\n      draft.items.set(id, newItem as Draft<T>);\n    });\n\n    this._fetchHandler.invalidateCache();\n    this._notifySubscribers();\n    this._syncQueue.enqueue({ id, type: \"update\", data: newItem });\n  }\n\n  // Remove an item (local-first)\n  remove(id: string): void {\n    const item = this._state.items.get(id);\n    if (!item) return;\n\n    this._state = create(this._state, (draft) => {\n      draft.items.delete(id);\n    });\n\n    this._itemCache.delete(id);\n    this._fetchHandler.invalidateCache();\n    this._notifySubscribers();\n\n    this._syncQueue.enqueue({ id, type: \"delete\", data: item });\n  }\n\n  // Get Item reference (cached)\n  getItem(id: string): Item<T, C> {\n    let item = this._itemCache.get(id);\n    if (!item) {\n      item = new Item(this, id);\n      this._itemCache.set(id, item);\n    }\n    return item;\n  }\n\n  // Update context and refetch\n  setContext(patchContext: Mutator<C>): void {\n    const oldContext = this._state.context;\n    const newContext = create(oldContext, patchContext);\n\n    if (oldContext !== newContext) {\n      this._state = create(this._state, (draft) => {\n        draft.context = newContext as Draft<C>;\n      });\n\n      this._fetchHandler.fetch(newContext);\n      this._notifySubscribers();\n    }\n  }\n\n  // Force refresh (bypass cache)\n  async refresh(): Promise<void> {\n    this._fetchHandler.invalidateCache();\n    await this._fetchHandler.fetch(this._state.context);\n  }\n\n  // SyncQueue controls\n  pauseSync(): void {\n    this._syncQueue.pause();\n  }\n\n  resumeSync(): void {\n    this._syncQueue.resume();\n    // Refetch to get fresh data after resuming\n    this._fetchHandler.invalidateCache();\n    this._fetchHandler.fetch(this._state.context);\n  }\n\n  retrySync(id?: string): void {\n    if (id) {\n      this._syncQueue.retry(id);\n    } else {\n      this._syncQueue.retryAll();\n    }\n  }\n\n  // Private methods\n  private async _initialFetch(): Promise<void> {\n    if (this._hasInitialized) return;\n    this._hasInitialized = true;\n    await this._fetchHandler.fetch(this._state.context);\n  }\n\n  private _onSyncQueueChange(): void {\n    const currState = this._syncQueue.getState();\n    this._updateSyncState(currState);\n  }\n\n  private _onFetchChange(): void {\n    const fetchState = this._fetchHandler.getState();\n\n    // Single state update\n    this._state = create(this._state, (draft) => {\n      draft.fetchStatus = fetchState.status;\n      draft.fetchError = fetchState.error;\n      draft.loading = fetchState.status === \"fetching\";\n      draft.syncState = this._computeSyncState(fetchState.status, draft.syncQueue.isSyncing);\n\n      const { queue, inFlight } = this._state.syncQueue;\n      const newItems = new Map<string, Draft<T>>();\n\n      // Add all fetched items\n      for (const item of fetchState.items) {\n        const id = this.config.getId(item);\n        newItems.set(id, item as Draft<T>);\n      }\n\n      // Preserve local pending changes (creates/updates not yet synced)\n      for (const [id, changes] of queue) {\n        // Use the last change's data as the most up-to-date local state\n        const lastChange = changes[changes.length - 1];\n        if (lastChange.type === \"create\" || lastChange.type === \"update\") {\n          newItems.set(id, lastChange.data as Draft<T>);\n        }\n      }\n      for (const [id, changes] of inFlight) {\n        // Use the last change's data as the most up-to-date local state\n        const lastChange = changes[changes.length - 1];\n        if (lastChange.type === \"create\" || lastChange.type === \"update\") {\n          newItems.set(id, lastChange.data as Draft<T>);\n        }\n      }\n\n      draft.items = newItems;\n    });\n\n    this._notifySubscribers();\n  }\n\n  private _updateSyncState(syncQueueState: SyncQueueState<T>): void {\n    this._state = create(this._state, (draft) => {\n      draft.syncQueue = syncQueueState as Draft<SyncQueueState<T>>;\n      draft.syncing = syncQueueState.isSyncing;\n      draft.syncState = this._computeSyncState(draft.fetchStatus, syncQueueState.isSyncing);\n    });\n\n    this._notifySubscribers();\n  }\n\n  private _computeSyncState(fetchStatus: FetchState, isSyncing: boolean): SyncState {\n    if (fetchStatus === \"fetching\") {\n      return \"fetching\";\n    }\n    if (isSyncing) {\n      return \"syncing\";\n    }\n    return \"idle\";\n  }\n\n  private _notifySubscribers(): void {\n    if (this._batchMode) return;\n    for (const callback of this._subscribers) {\n      callback();\n    }\n  }\n\n  private _handleIdRemap(mappings: IdMapping[]): void {\n    if (mappings.length === 0) return;\n\n    const { setId } = this.config;\n\n    this._state = create(this._state, (draft) => {\n      for (const { tempId, newId } of mappings) {\n        // Get the item with the temporary ID\n        const item = draft.items.get(tempId);\n        if (item) {\n          // Update the item's id using setId if provided, otherwise assume 'id' property\n          let updatedItem: Draft<T>;\n          if (setId) {\n            updatedItem = setId(item as T, newId) as Draft<T>;\n          } else {\n            // Default: assume the item has an 'id' property\n            (item as Record<string, unknown>).id = newId;\n            updatedItem = item;\n          }\n\n          // Remove old entry and add with new ID\n          draft.items.delete(tempId);\n          draft.items.set(newId, updatedItem);\n        }\n      }\n    });\n\n    // Update item cache references\n    for (const { tempId, newId } of mappings) {\n      const cachedItem = this._itemCache.get(tempId);\n      if (cachedItem) {\n        // Update the Item's internal ID\n        cachedItem._updateId(newId);\n        // Move to new key in cache\n        this._itemCache.delete(tempId);\n        this._itemCache.set(newId, cachedItem);\n      }\n    }\n\n    this._notifySubscribers();\n  }\n}\n","import { useSyncExternalStore } from \"react\";\nimport type { Draft } from \"mutative\";\nimport { Collection } from \"./collection\";\nimport type { Config, Mutator } from \"./types\";\n\n// Re-export types for public use\nexport type {\n  Config,\n  Change,\n  SyncResult,\n  ItemStatus,\n  SyncQueueState,\n  SyncState,\n  ChangeType,\n  ItemSyncStatus,\n} from \"./types\";\n\nexport function useCrud<T, C>(config: Config<T, C>) {\n  const collection = Collection.get(config);\n\n  const state = useSyncExternalStore(\n    (callback) => collection.subscribe(callback),\n    () => collection.getState(),\n    () => collection.getState(),\n  );\n\n  return {\n    // State (all from single immutable state object)\n    items: state.items,\n    context: state.context,\n    syncState: state.syncState,\n    syncQueue: state.syncQueue,\n    loading: state.loading,\n    syncing: state.syncing,\n\n    // Item operations\n    create: (item: T) => collection.create(item),\n    update: (id: string, mutate: (draft: Draft<T>) => void) => collection.update(id, mutate),\n    remove: (id: string) => collection.remove(id),\n    getItem: (id: string) => collection.getItem(id),\n    getItemStatus: (id: string) => collection.getItemStatus(id),\n\n    // Context & refresh\n    setContext: (patchContext: Mutator<C>) => collection.setContext(patchContext),\n    refresh: () => collection.refresh(),\n\n    // Sync controls\n    pauseSync: () => collection.pauseSync(),\n    resumeSync: () => collection.resumeSync(),\n    retrySync: (id?: string) => collection.retrySync(id),\n  };\n}\n","import { useSyncExternalStore, useCallback } from \"react\";\nimport type { Draft } from \"mutative\";\nimport type { Item } from \"./item\";\nimport type { ItemStatus } from \"./types\";\n\nexport type UseItemResult<T> = {\n  data: T | undefined;\n  status: ItemStatus;\n  update: (mutate: (draft: Draft<T>) => void) => void;\n  remove: () => void;\n  exists: boolean;\n};\n\nexport function useItem<T, C>(item: Item<T, C>): UseItemResult<T> {\n  const data = useSyncExternalStore(\n    (callback) => item.collection.subscribe(callback),\n    () => item.data,\n    () => item.data,\n  );\n\n  const status = useSyncExternalStore(\n    (callback) => item.collection.subscribe(callback),\n    () => item.getStatus(),\n    () => item.getStatus(),\n  );\n\n  const exists = useSyncExternalStore(\n    (callback) => item.collection.subscribe(callback),\n    () => item.exists(),\n    () => item.exists(),\n  );\n\n  const update = useCallback((mutate: (draft: Draft<T>) => void) => item.update(mutate), [item]);\n\n  const remove = useCallback(() => item.remove(), [item]);\n\n  return { data, status, update, remove, exists };\n}\n"],"names":["Operation","PROXY_DRAFT","RAW_RETURN_SYMBOL","iteratorSymbol","dataTypes","internal","has","target","key","getDescriptor","prototype","descriptor","isBaseSetInstance","obj","isBaseMapInstance","latest","proxyDraft","_a","isDraft","getProxyDraft","value","getValue","isDraftable","options","markResult","getPath","path","parentCopy","get","isSet","resolvePath","getType","set","peek","state","isEqual","x","y","revokeProxy","escapePath","pathAsArray","_item","item","base","index","strictCopy","copy","desc","propIsEnum","shallowCopy","original","SubClass","ensureShallowCopy","deepClone","iterable","k","v","cloneIfNeeded","markChanged","throwFrozenError","deepFreeze","subKey","updatedValues","stack","keys","parent","name","forEach","iter","type","entry","handleValue","handledSet","setMap","updatedValue","values","finalizeAssigned","finalizeSetValue","finalizePatches","generatePatches","patches","inversePatches","basePath","markFinalization","generateArrayPatches","proxyState","assignedMap","_path","arrayLengthAssignment","generatePatchesFromAssigned","assignedValue","originalValue","op","generateSetPatches","checkReadable","ignoreCheckDraftable","mapHandler","source","callback","thisArg","_value","_key","_b","mutable","draft","iterator","result","mapHandlerKeys","getNextIterator","isValuesIterator","currentDraft","proxy","setHandler","valueProxyDraft","other","setHandlerKeys","proxyHandler","receiver","createDraft","subProxyDraft","current","currentProxyDraft","createDraftOptions","parentDraft","finalities","revoke","oldProxyDraft","finalizeDraft","returnedValue","enableAutoFreeze","hasReturnedValue","draftify","baseState","finalizedState","finalizedPatches","finalizedInversePatches","handleReturnValue","rootDraft","useRawReturn","isRoot","currentValue","arr","getCurrent","newValue","makeCreator","arg","create","arg0","arg1","arg2","_c","args","mutate","mark","types","enablePatches","strict","_options","finalize","error","returnValue","rawReturnValue","returnedProxyDraft","freeGlobal","freeSelf","root","Symbol","objectProto","hasOwnProperty","nativeObjectToString","symToStringTag","getRawTag","isOwn","tag","unmasked","objectToString","nullTag","undefinedTag","baseGetTag","isObjectLike","symbolTag","isSymbol","arrayMap","array","iteratee","length","isArray","symbolProto","symbolToString","baseToString","reWhitespace","trimmedEndIndex","string","reTrimStart","baseTrim","isObject","NAN","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","toNumber","isBinary","INFINITY","MAX_INTEGER","toFinite","sign","toInteger","remainder","identity","asyncTag","funcTag","genTag","proxyTag","isFunction","coreJsData","maskSrcKey","uid","isMasked","func","funcProto","funcToString","toSource","reRegExpChar","reIsHostCtor","reIsNative","baseIsNative","pattern","object","getNative","WeakMap","baseFindIndex","predicate","fromIndex","fromRight","MAX_SAFE_INTEGER","reIsUint","isIndex","eq","isLength","isArrayLike","isPrototype","Ctor","proto","baseTimes","n","argsTag","baseIsArguments","propertyIsEnumerable","isArguments","stubFalse","freeExports","freeModule","moduleExports","Buffer","nativeIsBuffer","isBuffer","arrayTag","boolTag","dateTag","errorTag","mapTag","numberTag","objectTag","regexpTag","setTag","stringTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","typedArrayTags","baseIsTypedArray","baseUnary","freeProcess","nodeUtil","nodeIsTypedArray","isTypedArray","arrayLikeKeys","inherited","isArr","isArg","isBuff","isType","skipIndexes","overArg","transform","nativeKeys","baseKeys","reIsDeepProp","reIsPlainProp","isKey","nativeCreate","hashClear","hashDelete","HASH_UNDEFINED","hashGet","data","hashHas","hashSet","Hash","entries","listCacheClear","assocIndexOf","arrayProto","splice","listCacheDelete","lastIndex","listCacheGet","listCacheHas","listCacheSet","ListCache","Map","mapCacheClear","isKeyable","getMapData","map","mapCacheDelete","mapCacheGet","mapCacheHas","mapCacheSet","size","MapCache","FUNC_ERROR_TEXT","memoize","resolver","memoized","cache","MAX_MEMOIZE_SIZE","memoizeCapped","rePropName","reEscapeChar","stringToPath","match","number","quote","subString","toString","castPath","toKey","baseGet","defaultValue","arrayPush","offset","spreadableSymbol","isFlattenable","baseFlatten","depth","isStrict","stackClear","stackDelete","stackGet","stackHas","LARGE_ARRAY_SIZE","stackSet","pairs","Stack","arrayFilter","resIndex","stubArray","nativeGetSymbols","getSymbols","symbol","baseGetAllKeys","keysFunc","symbolsFunc","getAllKeys","DataView","Promise","Set","promiseTag","dataViewCtorString","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","getTag","ctorString","Uint8Array","setCacheAdd","setCacheHas","SetCache","arraySome","cacheHas","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","equalArrays","bitmask","customizer","equalFunc","isPartial","arrLength","othLength","arrStacked","othStacked","seen","arrValue","othValue","compared","othIndex","mapToArray","setToArray","symbolValueOf","equalByTag","convert","stacked","equalObjects","objProps","objLength","othProps","objStacked","skipCtor","objValue","objCtor","othCtor","baseIsEqualDeep","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","baseIsEqual","baseIsMatch","matchData","srcValue","isStrictComparable","getMatchData","matchesStrictComparable","baseMatches","baseHasIn","hasPath","hasFunc","hasIn","baseMatchesProperty","baseProperty","basePropertyDeep","property","baseIteratee","createBaseFor","props","baseFor","baseForOwn","createBaseEach","eachFunc","collection","baseEach","last","arrayEvery","baseEvery","every","guard","createFind","findIndexFunc","nativeMax","findIndex","find","baseMap","flatMap","fromPairs","pair","coalesce","ops","next","prev","SyncQueue","config","change","existing","coalesced","errors","id","errorInfo","mutator","cb","isPaused","isSyncing","queue","changes","results","r","resultMap","inFlight","idMappings","retries","failed","isAborted","errorMsg","Cache","capacity","ttl","firstKey","FetchHandler","context","patch","signal","maxRetries","lastError","attempt","cacheKey","cached","abortController","items","ctx","Item","newStatus","newId","Collection","defaultOnSync","c","mappings","syncQueueState","fetchState","inFlightChanges","queuedChanges","lastChange","currentItem","newItem","patchContext","oldContext","newContext","currState","newItems","fetchStatus","setId","tempId","updatedItem","cachedItem","useCrud","useSyncExternalStore","useItem","status","exists","update","useCallback","remove"],"mappings":";;;AAAA,MAAMA,IAAY;AAAA,EACd,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,KAAK;AACT,GAGMC,KAAc,OAAO,IAAI,0BAA0B,GACnDC,KAAoB,OAAO,gCAAgC,GAC3DC,KAAiB,OAAO,UACxBC,IAAY;AAAA,EACd,SAAS;AAAA,EACT,WAAW;AACf,GAEMC,KAAW,CAAA;AAEjB,SAASC,GAAIC,GAAQC,GAAK;AACtB,SAAOD,aAAkB,MACnBA,EAAO,IAAIC,CAAG,IACd,OAAO,UAAU,eAAe,KAAKD,GAAQC,CAAG;AAC1D;AACA,SAASC,GAAcF,GAAQC,GAAK;AAChC,MAAIA,KAAOD,GAAQ;AACf,QAAIG,IAAY,QAAQ,eAAeH,CAAM;AAC7C,WAAOG,KAAW;AACd,YAAMC,IAAa,QAAQ,yBAAyBD,GAAWF,CAAG;AAClE,UAAIG;AACA,eAAOA;AACX,MAAAD,IAAY,QAAQ,eAAeA,CAAS;AAAA,IAChD;AAAA,EACJ;AAEJ;AACA,SAASE,GAAkBC,GAAK;AAC5B,SAAO,OAAO,eAAeA,CAAG,MAAM,IAAI;AAC9C;AACA,SAASC,GAAkBD,GAAK;AAC5B,SAAO,OAAO,eAAeA,CAAG,MAAM,IAAI;AAC9C;AAEA,SAASE,EAAOC,GAAY;AACxB,MAAIC;AACJ,UAAQA,IAAKD,EAAW,UAAU,QAAQC,MAAO,SAASA,IAAKD,EAAW;AAC9E;AAIA,SAASE,EAAQX,GAAQ;AACrB,SAAO,CAAC,CAACY,EAAcZ,CAAM;AACjC;AACA,SAASY,EAAcC,GAAO;AAC1B,SAAI,OAAOA,KAAU,WACV,OAC0CA,IAAMnB,EAAW;AAC1E;AACA,SAASoB,GAASD,GAAO;AACrB,MAAIH;AACJ,QAAMD,IAAaG,EAAcC,CAAK;AACtC,SAAOJ,KAAeC,IAAKD,EAAW,UAAU,QAAQC,MAAO,SAASA,IAAKD,EAAW,WAAYI;AACxG;AAIA,SAASE,EAAYF,GAAOG,GAAS;AACjC,MAAI,CAACH,KAAS,OAAOA,KAAU;AAC3B,WAAO;AACX,MAAII;AACJ,SAAQ,OAAO,eAAeJ,CAAK,MAAM,OAAO,aAC5C,MAAM,QAAQA,CAAK,KACnBA,aAAiB,OACjBA,aAAiB,OAChB,CAAC,CAAoDG,GAAQ,UACxDC,IAAaD,EAAQ,KAAKH,GAAOhB,CAAS,OAAOA,EAAU,aACzD,OAAOoB,KAAe;AACtC;AACA,SAASC,GAAQlB,GAAQmB,IAAO,IAAI;AAChC,MAAI,OAAO,eAAe,KAAKnB,GAAQ,KAAK,GAAG;AAE3C,UAAMoB,IAAapB,EAAO,OAAO,MAC3BS,IAAaG,EAAcS,EAAID,GAAYpB,EAAO,GAAG,CAAC;AAC5D,QAAIS,MAAe,QAAiEA,GAAW,aAAcT,EAAO;AAChH,aAAO;AAEX,UAAMsB,IAAQtB,EAAO,OAAO,SAAS,GAC/BC,IAAMqB,IACN,MAAM,KAAKtB,EAAO,OAAO,OAAO,MAAM,EAAE,QAAQA,EAAO,GAAG,IAC1DA,EAAO;AAEb,QAAI,EAAGsB,KAASF,EAAW,OAAOnB,KAAQF,GAAIqB,GAAYnB,CAAG;AACzD,aAAO;AACX,IAAAkB,EAAK,KAAKlB,CAAG;AAAA,EACjB;AACA,MAAID,EAAO;AACP,WAAOkB,GAAQlB,EAAO,QAAQmB,CAAI;AAGtC,EAAAA,EAAK,QAAO;AACZ,MAAI;AAEA,IAAAI,GAAYvB,EAAO,MAAMmB,CAAI;AAAA,EACjC,QACU;AACN,WAAO;AAAA,EACX;AACA,SAAOA;AACX;AACA,SAASK,EAAQxB,GAAQ;AACrB,SAAI,MAAM,QAAQA,CAAM,IACb,IACPA,aAAkB,MACX,IACPA,aAAkB,MACX,IACJ;AACX;AACA,SAASqB,EAAIrB,GAAQC,GAAK;AACtB,SAAOuB,EAAQxB,CAAM,MAAM,IAAwBA,EAAO,IAAIC,CAAG,IAAID,EAAOC,CAAG;AACnF;AACA,SAASwB,GAAIzB,GAAQC,GAAKY,GAAO;AAE7B,EADaW,EAAQxB,CAAM,MACd,IACTA,EAAO,IAAIC,GAAKY,CAAK,IAGrBb,EAAOC,CAAG,IAAIY;AAEtB;AACA,SAASa,GAAK1B,GAAQC,GAAK;AACvB,QAAM0B,IAAQf,EAAcZ,CAAM;AAElC,UADe2B,IAAQnB,EAAOmB,CAAK,IAAI3B,GACzBC,CAAG;AACrB;AACA,SAAS2B,EAAQC,GAAGC,GAAG;AACnB,SAAID,MAAMC,IACCD,MAAM,KAAK,IAAIA,MAAM,IAAIC,IAGzBD,MAAMA,KAAKC,MAAMA;AAEhC;AACA,SAASC,GAAYtB,GAAY;AAC7B,MAAKA;AAEL,WAAOA,EAAW,WAAW,OAAO,SAAS;AAEzC,MADeA,EAAW,WAAW,OAAO,IAAG,EACzC;AAEd;AAEA,SAASuB,EAAWb,GAAMc,GAAa;AACnC,SAAOA,IACDd,IACA,CAAC,EAAE,EACA,OAAOA,CAAI,EACX,IAAI,CAACe,MAAU;AAChB,UAAMC,IAAO,GAAGD,CAAK;AACrB,WAAIC,EAAK,QAAQ,GAAG,MAAM,MAAMA,EAAK,QAAQ,GAAG,MAAM,KAC3CA,IACJA,EAAK,QAAQ,MAAM,IAAI,EAAE,QAAQ,OAAO,IAAI;AAAA,EACvD,CAAC,EACI,KAAK,GAAG;AACrB;AASA,SAASZ,GAAYa,GAAMjB,GAAM;AAC7B,WAASkB,IAAQ,GAAGA,IAAQlB,EAAK,SAAS,GAAGkB,KAAS,GAAG;AACrD,UAAMpC,IAAMkB,EAAKkB,CAAK;AAGtB,QADAD,IAAOf,EAAIG,EAAQY,CAAI,MAAM,IAAwB,MAAM,KAAKA,CAAI,IAAIA,GAAMnC,CAAG,GAC7E,OAAOmC,KAAS;AAChB,YAAM,IAAI,MAAM,4BAA4BjB,EAAK,KAAK,GAAG,CAAC,IAAI;AAAA,EAEtE;AACA,SAAOiB;AACX;AAEA,SAASE,GAAWtC,GAAQ;AACxB,QAAMuC,IAAO,OAAO,OAAO,OAAO,eAAevC,CAAM,CAAC;AACxD,iBAAQ,QAAQA,CAAM,EAAE,QAAQ,CAACC,MAAQ;AACrC,QAAIuC,IAAO,QAAQ,yBAAyBxC,GAAQC,CAAG;AACvD,QAAIuC,EAAK,cAAcA,EAAK,gBAAgBA,EAAK,UAAU;AACvD,MAAAD,EAAKtC,CAAG,IAAID,EAAOC,CAAG;AACtB;AAAA,IACJ;AAEA,IAAKuC,EAAK,aACNA,EAAK,WAAW,IAChBA,EAAK,eAAe,MAEpBA,EAAK,OAAOA,EAAK,SACjBA,IAAO;AAAA,MACH,cAAc;AAAA,MACd,UAAU;AAAA,MACV,YAAYA,EAAK;AAAA,MACjB,OAAOxC,EAAOC,CAAG;AAAA,IACjC,IACQ,QAAQ,eAAesC,GAAMtC,GAAKuC,CAAI;AAAA,EAC1C,CAAC,GACMD;AACX;AACA,MAAME,KAAa,OAAO,UAAU;AACpC,SAASC,GAAYC,GAAU3B,GAAS;AACpC,MAAIC;AACJ,MAAI,MAAM,QAAQ0B,CAAQ;AACtB,WAAO,MAAM,UAAU,OAAO,KAAKA,CAAQ;AAE1C,MAAIA,aAAoB,KAAK;AAC9B,QAAI,CAACtC,GAAkBsC,CAAQ,GAAG;AAC9B,YAAMC,IAAW,OAAO,eAAeD,CAAQ,EAAE;AACjD,aAAO,IAAIC,EAASD,EAAS,QAAQ;AAAA,IACzC;AACA,WAAO,IAAI,UAAU,aACf,IAAI,UAAU,WAAW,KAAKA,GAAU,oBAAI,IAAG,CAAE,IACjD,IAAI,IAAIA,EAAS,QAAQ;AAAA,EACnC,WACSA,aAAoB,KAAK;AAC9B,QAAI,CAACpC,GAAkBoC,CAAQ,GAAG;AAC9B,YAAMC,IAAW,OAAO,eAAeD,CAAQ,EAAE;AACjD,aAAO,IAAIC,EAASD,CAAQ;AAAA,IAChC;AACA,WAAO,IAAI,IAAIA,CAAQ;AAAA,EAC3B,WAC4D3B,GAAQ,SAC9DC,IAAaD,EAAQ,KAAK2B,GAAU9C,CAAS,GAC3CoB,MAAe,WACnBA,MAAepB,EAAU,SAAS;AAClC,QAAIoB,MAAepB,EAAU;AACzB,aAAOyC,GAAWK,CAAQ;AAEzB,QAAI,OAAO1B,KAAe,YAAY;AACvC,UAAKD,EAAQ,iBAAiBA,EAAQ;AAClC,cAAM,IAAI,MAAM,yDAAyD;AAE7E,aAAOC,EAAU;AAAA,IACrB;AACA,UAAM,IAAI,MAAM,4BAA4BA,CAAU,EAAE;AAAA,EAC5D,WACS,OAAO0B,KAAa,YACzB,OAAO,eAAeA,CAAQ,MAAM,OAAO,WAAW;AAGtD,UAAMJ,IAAO,CAAA;AACb,kBAAO,KAAKI,CAAQ,EAAE,QAAQ,CAAC1C,MAAQ;AACnC,MAAAsC,EAAKtC,CAAG,IAAI0C,EAAS1C,CAAG;AAAA,IAC5B,CAAC,GACD,OAAO,sBAAsB0C,CAAQ,EAAE,QAAQ,CAAC1C,MAAQ;AACpD,MAAIwC,GAAW,KAAKE,GAAU1C,CAAG,MAC7BsC,EAAKtC,CAAG,IAAI0C,EAAS1C,CAAG;AAAA,IAEhC,CAAC,GACMsC;AAAA,EACX;AAEI,UAAM,IAAI,MAAM,8EAA8E;AAEtG;AACA,SAASM,EAAkB7C,GAAQ;AAC/B,EAAIA,EAAO,SAEXA,EAAO,OAAO0C,GAAY1C,EAAO,UAAUA,EAAO,OAAO;AAC7D;AACA,SAAS8C,GAAU9C,GAAQ;AACvB,MAAI,CAACe,EAAYf,CAAM;AACnB,WAAOc,GAASd,CAAM;AAC1B,MAAI,MAAM,QAAQA,CAAM;AACpB,WAAOA,EAAO,IAAI8C,EAAS;AAC/B,MAAI9C,aAAkB,KAAK;AACvB,UAAM+C,IAAW,MAAM,KAAK/C,EAAO,SAAS,EAAE,IAAI,CAAC,CAACgD,GAAGC,CAAC,MAAM;AAAA,MAC1DD;AAAA,MACAF,GAAUG,CAAC;AAAA,IACvB,CAAS;AACD,QAAI,CAAC1C,GAAkBP,CAAM,GAAG;AAC5B,YAAM4C,IAAW,OAAO,eAAe5C,CAAM,EAAE;AAC/C,aAAO,IAAI4C,EAASG,CAAQ;AAAA,IAChC;AACA,WAAO,IAAI,IAAIA,CAAQ;AAAA,EAC3B;AACA,MAAI/C,aAAkB,KAAK;AACvB,UAAM+C,IAAW,MAAM,KAAK/C,CAAM,EAAE,IAAI8C,EAAS;AACjD,QAAI,CAACzC,GAAkBL,CAAM,GAAG;AAC5B,YAAM4C,IAAW,OAAO,eAAe5C,CAAM,EAAE;AAC/C,aAAO,IAAI4C,EAASG,CAAQ;AAAA,IAChC;AACA,WAAO,IAAI,IAAIA,CAAQ;AAAA,EAC3B;AACA,QAAMR,IAAO,OAAO,OAAO,OAAO,eAAevC,CAAM,CAAC;AACxD,aAAWC,KAAOD;AACd,IAAAuC,EAAKtC,CAAG,IAAI6C,GAAU9C,EAAOC,CAAG,CAAC;AACrC,SAAOsC;AACX;AACA,SAASW,GAAclD,GAAQ;AAC3B,SAAOW,EAAQX,CAAM,IAAI8C,GAAU9C,CAAM,IAAIA;AACjD;AAEA,SAASmD,EAAY1C,GAAY;AAC7B,MAAIC;AACJ,EAAAD,EAAW,eAAeC,IAAKD,EAAW,iBAAiB,QAAQC,MAAO,SAASA,IAAK,oBAAI,IAAG,GAC1FD,EAAW,aACZA,EAAW,WAAW,IAClBA,EAAW,UACX0C,EAAY1C,EAAW,MAAM;AAGzC;AAEA,SAAS2C,KAAmB;AACxB,QAAM,IAAI,MAAM,6BAA6B;AACjD;AACA,SAASC,EAAWrD,GAAQsD,GAAQC,GAAeC,GAAOC,GAAM;AAC5D;AACI,IAAAF,IAAgBA,KAAqE,oBAAI,QAAO,GAChGC,IAAQA,KAA6C,CAAA,GACrDC,IAAOA,KAA0C,CAAA;AACjD,UAAM5C,IAAQ0C,EAAc,IAAIvD,CAAM,IAChCuD,EAAc,IAAIvD,CAAM,IACxBA;AACN,QAAIwD,EAAM,SAAS,GAAG;AAClB,YAAMnB,IAAQmB,EAAM,QAAQ3C,CAAK;AACjC,UAAIA,KAAS,OAAOA,KAAU,YAAYwB,MAAU;AAChD,cAAImB,EAAM,CAAC,MAAM3C,IACP,IAAI,MAAM,4BAA4B,IAE1C,IAAI,MAAM,iCAAiC4C,EAC5C,MAAM,GAAGpB,CAAK,EACd,IAAI,CAACpC,GAAKoC,MAAU;AACrB,cAAI,OAAOpC,KAAQ;AACf,mBAAO,IAAIA,EAAI,SAAQ,CAAE;AAC7B,gBAAMyD,IAASF,EAAMnB,CAAK;AAC1B,iBAAI,OAAOpC,KAAQ,aACdyD,aAAkB,OAAOA,aAAkB,OACrC,MAAM,KAAKA,EAAO,KAAI,CAAE,EAAE,QAAQzD,CAAG,IACzCA;AAAA,QACX,CAAC,EACI,KAAK,GAAG,CAAC,EAAE;AAEpB,MAAAuD,EAAM,KAAK3C,CAAK,GAChB4C,EAAK,KAAKH,CAAM;AAAA,IACpB;AAEI,MAAAE,EAAM,KAAK3C,CAAK;AAAA,EAExB;AACA,MAAI,OAAO,SAASb,CAAM,KAAKW,EAAQX,CAAM,GAAG;AAExC,IAAAwD,EAAM,IAAG,GACTC,EAAK,IAAG;AAEZ;AAAA,EACJ;AAEA,UADajC,EAAQxB,CAAM,GACf;AAAA,IACR,KAAK;AACD,iBAAW,CAACC,GAAKY,CAAK,KAAKb;AACvB,QAAAqD,EAAWpD,GAAKA,GAAKsD,GAAeC,GAAOC,CAAI,GAC/CJ,EAAWxC,GAAOZ,GAAKsD,GAAeC,GAAOC,CAAI;AAErD,MAAAzD,EAAO,MAAMA,EAAO,QAAQA,EAAO,SAASoD;AAC5C;AAAA,IACJ,KAAK;AACD,iBAAWvC,KAASb;AAChB,QAAAqD,EAAWxC,GAAOA,GAAO0C,GAAeC,GAAOC,CAAI;AAEvD,MAAAzD,EAAO,MAAMA,EAAO,QAAQA,EAAO,SAASoD;AAC5C;AAAA,IACJ,KAAK;AACD,aAAO,OAAOpD,CAAM;AACpB,UAAIqC,IAAQ;AACZ,iBAAWxB,KAASb;AAChB,QAAAqD,EAAWxC,GAAOwB,GAAOkB,GAAeC,GAAOC,CAAI,GACnDpB,KAAS;AAEb;AAAA,IACJ;AACI,aAAO,OAAOrC,CAAM,GAEpB,OAAO,KAAKA,CAAM,EAAE,QAAQ,CAAC2D,MAAS;AAClC,cAAM9C,IAAQb,EAAO2D,CAAI;AACzB,QAAAN,EAAWxC,GAAO8C,GAAMJ,GAAeC,GAAOC,CAAI;AAAA,MACtD,CAAC;AAAA,EACb;AAEQ,EAAAD,EAAM,IAAG,GACTC,EAAK,IAAG;AAEhB;AAEA,SAASG,GAAQ5D,GAAQ6D,GAAM;AAC3B,QAAMC,IAAOtC,EAAQxB,CAAM;AAC3B,MAAI8D,MAAS;AACT,YAAQ,QAAQ9D,CAAM,EAAE,QAAQ,CAACC,MAAQ;AACrC,MAAA4D,EAAK5D,GAAKD,EAAOC,CAAG,GAAGD,CAAM;AAAA,IACjC,CAAC;AAAA,WAEI8D,MAAS,GAAyB;AACvC,QAAIzB,IAAQ;AACZ,eAAW0B,KAAS/D;AAChB,MAAA6D,EAAKxB,GAAO0B,GAAO/D,CAAM,GACzBqC,KAAS;AAAA,EAEjB;AAEI,IAAArC,EAAO,QAAQ,CAAC+D,GAAO1B,MAAUwB,EAAKxB,GAAO0B,GAAO/D,CAAM,CAAC;AAEnE;AAEA,SAASgE,GAAYhE,GAAQiE,GAAYjD,GAAS;AAC9C,MAAIL,EAAQX,CAAM,KACd,CAACe,EAAYf,GAAQgB,CAAO,KAC5BiD,EAAW,IAAIjE,CAAM,KACrB,OAAO,SAASA,CAAM;AACtB;AACJ,QAAMsB,IAAQtB,aAAkB,KAC1BkE,IAAS5C,IAAQ,oBAAI,IAAG,IAAK;AAkBnC,MAjBA2C,EAAW,IAAIjE,CAAM,GACrB4D,GAAQ5D,GAAQ,CAACC,GAAKY,MAAU;AAC5B,QAAIH;AACJ,QAAIC,EAAQE,CAAK,GAAG;AAChB,YAAMJ,IAAaG,EAAcC,CAAK;AACtC,MAAAgC,EAAkBpC,CAAU;AAE5B,YAAM0D,IAAiB,GAAAzD,IAAKD,EAAW,iBAAiB,QAAQC,MAAO,WAAkBA,EAAG,QAASD,EAAW,WAC1GA,EAAW,OACXA,EAAW;AAEjB,MAAAgB,GAAIH,IAAQ4C,IAASlE,GAAQC,GAAKkE,CAAY;AAAA,IAClD;AAEI,MAAAH,GAAYnD,GAAOoD,GAAYjD,CAAO;AAAA,EAE9C,CAAC,GACGkD,GAAQ;AACR,UAAMzC,IAAMzB,GACNoE,IAAS,MAAM,KAAK3C,CAAG;AAC7B,IAAAA,EAAI,MAAK,GACT2C,EAAO,QAAQ,CAACvD,MAAU;AACtB,MAAAY,EAAI,IAAIyC,EAAO,IAAIrD,CAAK,IAAIqD,EAAO,IAAIrD,CAAK,IAAIA,CAAK;AAAA,IACzD,CAAC;AAAA,EACL;AACJ;AACA,SAASwD,GAAiB5D,GAAYR,GAAK;AAEvC,QAAMsC,IAAO9B,EAAW,SAAS,IAAwBA,EAAW,SAASA,EAAW;AACxF,EAAIA,EAAW,WAAW,OAAO,SAAS,KACtCA,EAAW,YAAY,IAAIR,CAAG,KAC9BsC,KACAyB,GAAY3C,EAAIkB,GAAMtC,CAAG,GAAGQ,EAAW,WAAW,YAAYA,EAAW,OAAO;AAExF;AACA,SAAS6D,GAAiBtE,GAAQ;AAC9B,EAAIA,EAAO,SAAS,KAAyBA,EAAO,SAChDA,EAAO,KAAK,MAAK,GACjBA,EAAO,OAAO,QAAQ,CAACa,MAAU;AAC7B,IAAAb,EAAO,KAAK,IAAIc,GAASD,CAAK,CAAC;AAAA,EACnC,CAAC;AAET;AACA,SAAS0D,GAAgBvE,GAAQwE,GAAiBC,GAASC,GAAgB;AAKvE,MAJuB1E,EAAO,YAC1BA,EAAO,eACPA,EAAO,YAAY,OAAO,KAC1B,CAACA,EAAO,WACQ;AAChB,QAAIyE,KAAWC,GAAgB;AAC3B,YAAMC,IAAWzD,GAAQlB,CAAM;AAC/B,MAAI2E,KACAH,EAAgBxE,GAAQ2E,GAAUF,GAASC,CAAc;AAAA,IAEjE;AACA,IAAA1E,EAAO,YAAY;AAAA,EACvB;AACJ;AACA,SAAS4E,GAAiB5E,GAAQC,GAAKY,GAAO2D,GAAiB;AAC3D,QAAM/D,IAAaG,EAAcC,CAAK;AACtC,EAAIJ,MAEKA,EAAW,cACZA,EAAW,YAAY,CAAA,IAE3BA,EAAW,UAAU,KAAK,CAACgE,GAASC,MAAmB;AACnD,QAAIhE;AACJ,UAAM6B,IAAOvC,EAAO,SAAS,IAAwBA,EAAO,SAASA,EAAO;AAC5E,QAAI4B,EAAQP,EAAIkB,GAAMtC,CAAG,GAAGY,CAAK,GAAG;AAChC,UAAIsD,IAAe1D,EAAW;AAC9B,MAAIA,EAAW,SACX0D,IAAe1D,EAAW,OAE9B6D,GAAiBtE,CAAM,GACvBuE,GAAgBvE,GAAQwE,GAAiBC,GAASC,CAAc,GAC5D1E,EAAO,QAAQ,qBACfA,EAAO,QAAQ,iBACVU,IAAKV,EAAO,QAAQ,mBAAmB,QAAQU,MAAO,SAASA,IAAK,oBAAI,QAAO,GACpFV,EAAO,QAAQ,cAAc,IAAImE,GAAc1D,EAAW,QAAQ,IAGtEgB,GAAIc,GAAMtC,GAAKkE,CAAY;AAAA,IAC/B;AAAA,EACJ,CAAC,GACGnE,EAAO,QAAQ,oBAEXS,EAAW,eAAeT,EAAO,eACjCA,EAAO,QAAQ,mBAAmB,MAI1Ce,EAAYF,GAAOb,EAAO,OAAO,KAEjCA,EAAO,WAAW,MAAM,KAAK,MAAM;AAC/B,UAAMuC,IAAOvC,EAAO,SAAS,IAAwBA,EAAO,SAASA,EAAO;AAC5E,IAAI4B,EAAQP,EAAIkB,GAAMtC,CAAG,GAAGY,CAAK,KAC7BwD,GAAiBrE,GAAQC,CAAG;AAAA,EAEpC,CAAC;AAET;AAEA,SAAS4E,GAAqBC,GAAYH,GAAUF,GAASC,GAAgBzC,GAAa;AACtF,MAAI,EAAE,UAAAU,GAAU,aAAAoC,GAAa,SAAA/D,EAAO,IAAK8D,GACrCvC,IAAOuC,EAAW;AACtB,EAAIvC,EAAK,SAASI,EAAS,WACvB,CAACA,GAAUJ,CAAI,IAAI,CAACA,GAAMI,CAAQ,GAClC,CAAC8B,GAASC,CAAc,IAAI,CAACA,GAAgBD,CAAO;AAExD,WAASpC,IAAQ,GAAGA,IAAQM,EAAS,QAAQN,KAAS;AAClD,QAAI0C,EAAY,IAAI1C,EAAM,SAAQ,CAAE,KAAKE,EAAKF,CAAK,MAAMM,EAASN,CAAK,GAAG;AACtE,YAAM2C,IAAQL,EAAS,OAAO,CAACtC,CAAK,CAAC,GAC/BlB,IAAOa,EAAWgD,GAAO/C,CAAW;AAC1C,MAAAwC,EAAQ,KAAK;AAAA,QACT,IAAIhF,EAAU;AAAA,QACd,MAAA0B;AAAA;AAAA,QAEA,OAAO+B,GAAcX,EAAKF,CAAK,CAAC;AAAA,MAChD,CAAa,GACDqC,EAAe,KAAK;AAAA,QAChB,IAAIjF,EAAU;AAAA,QACd,MAAA0B;AAAA;AAAA,QAEA,OAAO+B,GAAcP,EAASN,CAAK,CAAC;AAAA,MACpD,CAAa;AAAA,IACL;AAEJ,WAASA,IAAQM,EAAS,QAAQN,IAAQE,EAAK,QAAQF,KAAS,GAAG;AAC/D,UAAM2C,IAAQL,EAAS,OAAO,CAACtC,CAAK,CAAC,GAC/BlB,IAAOa,EAAWgD,GAAO/C,CAAW;AAC1C,IAAAwC,EAAQ,KAAK;AAAA,MACT,IAAIhF,EAAU;AAAA,MACd,MAAA0B;AAAA;AAAA,MAEA,OAAO+B,GAAcX,EAAKF,CAAK,CAAC;AAAA,IAC5C,CAAS;AAAA,EACL;AACA,MAAIM,EAAS,SAASJ,EAAK,QAAQ;AAI/B,UAAM,EAAE,uBAAA0C,IAAwB,GAAI,IAAKjE,EAAQ;AACjD,QAAIiE,GAAuB;AACvB,YAAMD,IAAQL,EAAS,OAAO,CAAC,QAAQ,CAAC,GAClCxD,IAAOa,EAAWgD,GAAO/C,CAAW;AAC1C,MAAAyC,EAAe,KAAK;AAAA,QAChB,IAAIjF,EAAU;AAAA,QACd,MAAA0B;AAAA,QACA,OAAOwB,EAAS;AAAA,MAChC,CAAa;AAAA,IACL;AAEI,eAASN,IAAQE,EAAK,QAAQI,EAAS,SAASN,GAAOA,KAAS,GAAG;AAC/D,cAAM2C,IAAQL,EAAS,OAAO,CAACtC,IAAQ,CAAC,CAAC,GACnClB,IAAOa,EAAWgD,GAAO/C,CAAW;AAC1C,QAAAyC,EAAe,KAAK;AAAA,UAChB,IAAIjF,EAAU;AAAA,UACd,MAAA0B;AAAA,QACpB,CAAiB;AAAA,MACL;AAAA,EAER;AACJ;AACA,SAAS+D,GAA4B,EAAE,UAAAvC,GAAU,MAAAJ,GAAM,aAAAwC,EAAW,GAAIJ,GAAUF,GAASC,GAAgBzC,GAAa;AAClH,EAAA8C,EAAY,QAAQ,CAACI,GAAelF,MAAQ;AACxC,UAAMmF,IAAgB/D,EAAIsB,GAAU1C,CAAG,GACjCY,IAAQqC,GAAc7B,EAAIkB,GAAMtC,CAAG,CAAC,GACpCoF,IAAMF,IAENpF,GAAI4C,GAAU1C,CAAG,IACbR,EAAU,UACVA,EAAU,MAHdA,EAAU;AAIhB,QAAImC,EAAQwD,GAAevE,CAAK,KAAKwE,MAAO5F,EAAU;AAClD;AACJ,UAAMuF,IAAQL,EAAS,OAAO1E,CAAG,GAC3BkB,IAAOa,EAAWgD,GAAO/C,CAAW;AAC1C,IAAAwC,EAAQ,KAAKY,MAAO5F,EAAU,SAAS,EAAE,IAAA4F,GAAI,MAAAlE,EAAI,IAAK,EAAE,IAAAkE,GAAI,MAAAlE,GAAM,OAAAN,EAAK,CAAE,GACzE6D,EAAe,KAAKW,MAAO5F,EAAU,MAC/B,EAAE,IAAIA,EAAU,QAAQ,MAAA0B,EAAI,IAC5BkE,MAAO5F,EAAU,SACb,EAAE,IAAIA,EAAU,KAAK,MAAA0B,GAAM,OAAOiE,EAAa,IAC/C,EAAE,IAAI3F,EAAU,SAAS,MAAA0B,GAAM,OAAOiE,GAAe;AAAA,EACnE,CAAC;AACL;AACA,SAASE,GAAmB,EAAE,UAAA3C,GAAU,MAAAJ,EAAI,GAAIoC,GAAUF,GAASC,GAAgBzC,GAAa;AAC5F,MAAII,IAAQ;AACZ,EAAAM,EAAS,QAAQ,CAAC9B,MAAU;AACxB,QAAI,CAAC0B,EAAK,IAAI1B,CAAK,GAAG;AAClB,YAAMmE,IAAQL,EAAS,OAAO,CAACtC,CAAK,CAAC,GAC/BlB,IAAOa,EAAWgD,GAAO/C,CAAW;AAC1C,MAAAwC,EAAQ,KAAK;AAAA,QACT,IAAIhF,EAAU;AAAA,QACd,MAAA0B;AAAA,QACA,OAAAN;AAAA,MAChB,CAAa,GACD6D,EAAe,QAAQ;AAAA,QACnB,IAAIjF,EAAU;AAAA,QACd,MAAA0B;AAAA,QACA,OAAAN;AAAA,MAChB,CAAa;AAAA,IACL;AACA,IAAAwB,KAAS;AAAA,EACb,CAAC,GACDA,IAAQ,GACRE,EAAK,QAAQ,CAAC1B,MAAU;AACpB,QAAI,CAAC8B,EAAS,IAAI9B,CAAK,GAAG;AACtB,YAAMmE,IAAQL,EAAS,OAAO,CAACtC,CAAK,CAAC,GAC/BlB,IAAOa,EAAWgD,GAAO/C,CAAW;AAC1C,MAAAwC,EAAQ,KAAK;AAAA,QACT,IAAIhF,EAAU;AAAA,QACd,MAAA0B;AAAA,QACA,OAAAN;AAAA,MAChB,CAAa,GACD6D,EAAe,QAAQ;AAAA,QACnB,IAAIjF,EAAU;AAAA,QACd,MAAA0B;AAAA,QACA,OAAAN;AAAA,MAChB,CAAa;AAAA,IACL;AACA,IAAAwB,KAAS;AAAA,EACb,CAAC;AACL;AACA,SAASmC,GAAgBM,GAAYH,GAAUF,GAASC,GAAgB;AACpE,QAAM,EAAE,aAAAzC,IAAc,GAAI,IAAK6C,EAAW,QAAQ;AAClD,UAAQA,EAAW,MAAI;AAAA,IACnB,KAAK;AAAA,IACL,KAAK;AACD,aAAOI,GAA4BJ,GAAYH,GAAUF,GAASC,GAAgBzC,CAAW;AAAA,IACjG,KAAK;AACD,aAAO4C,GAAqBC,GAAYH,GAAUF,GAASC,GAAgBzC,CAAW;AAAA,IAC1F,KAAK;AACD,aAAOqD,GAAmBR,GAAYH,GAAUF,GAASC,GAAgBzC,CAAW;AAAA,EAChG;AACA;AAGA,MAAMsD,KAAgB,CAAC1E,GAAOG,GAASwE,IAAuB,OAAU;AACpE,MAAI,OAAO3E,KAAU,YACjBA,MAAU,SACT,CAACE,EAAYF,GAAOG,CAAO,KAAKwE;AAEjC,UAAM,IAAI,MAAM,4FAA4F;AAEpH,GA2CMC,KAAa;AAAA,EACf,IAAI,OAAO;AAEP,WADgBjF,EAAOI,EAAc,IAAI,CAAC,EAC3B;AAAA,EACnB;AAAA,EACA,IAAIX,GAAK;AACL,WAAOO,EAAOI,EAAc,IAAI,CAAC,EAAE,IAAIX,CAAG;AAAA,EAC9C;AAAA,EACA,IAAIA,GAAKY,GAAO;AACZ,UAAMb,IAASY,EAAc,IAAI,GAC3B8E,IAASlF,EAAOR,CAAM;AAC5B,YAAI,CAAC0F,EAAO,IAAIzF,CAAG,KAAK,CAAC2B,EAAQ8D,EAAO,IAAIzF,CAAG,GAAGY,CAAK,OACnDgC,EAAkB7C,CAAM,GACxBmD,EAAYnD,CAAM,GAClBA,EAAO,YAAY,IAAIC,GAAK,EAAI,GAChCD,EAAO,KAAK,IAAIC,GAAKY,CAAK,GAC1B+D,GAAiB5E,GAAQC,GAAKY,GAAO2D,EAAe,IAEjD;AAAA,EACX;AAAA,EACA,OAAOvE,GAAK;AACR,QAAI,CAAC,KAAK,IAAIA,CAAG;AACb,aAAO;AAEX,UAAMD,IAASY,EAAc,IAAI;AACjC,WAAAiC,EAAkB7C,CAAM,GACxBmD,EAAYnD,CAAM,GACdA,EAAO,SAAS,IAAIC,CAAG,IACvBD,EAAO,YAAY,IAAIC,GAAK,EAAK,IAGjCD,EAAO,YAAY,OAAOC,CAAG,GAEjCD,EAAO,KAAK,OAAOC,CAAG,GACf;AAAA,EACX;AAAA,EACA,QAAQ;AACJ,UAAMD,IAASY,EAAc,IAAI;AACjC,QAAK,KAAK,MAEV;AAAA,MAAAiC,EAAkB7C,CAAM,GACxBmD,EAAYnD,CAAM,GAClBA,EAAO,cAAc,oBAAI,IAAG;AAC5B,iBAAW,CAACC,CAAG,KAAKD,EAAO;AACvB,QAAAA,EAAO,YAAY,IAAIC,GAAK,EAAK;AAErC,MAAAD,EAAO,KAAK,MAAK;AAAA;AAAA,EACrB;AAAA,EACA,QAAQ2F,GAAUC,GAAS;AACvB,UAAM5F,IAASY,EAAc,IAAI;AACjC,IAAAJ,EAAOR,CAAM,EAAE,QAAQ,CAAC6F,GAAQC,MAAS;AACrC,MAAAH,EAAS,KAAKC,GAAS,KAAK,IAAIE,CAAI,GAAGA,GAAM,IAAI;AAAA,IACrD,CAAC;AAAA,EACL;AAAA,EACA,IAAI7F,GAAK;AACL,QAAIS,GAAIqF;AACR,UAAM/F,IAASY,EAAc,IAAI,GAC3BC,IAAQL,EAAOR,CAAM,EAAE,IAAIC,CAAG,GAC9B+F,MAAYD,KAAMrF,IAAKV,EAAO,SAAS,UAAU,QAAQ+F,MAAO,SAAS,SAASA,EAAG,KAAKrF,GAAIG,GAAOhB,CAAS,OAAOA,EAAU;AAWrI,QAVIG,EAAO,QAAQ,UACfuF,GAAc1E,GAAOb,EAAO,SAASgG,CAAO,GAE5CA,KAGAhG,EAAO,aAAa,CAACe,EAAYF,GAAOb,EAAO,OAAO,KAItDa,MAAUb,EAAO,SAAS,IAAIC,CAAG;AACjC,aAAOY;AAEX,UAAMoF,IAAQnG,GAAS,YAAY;AAAA,MAC/B,UAAUe;AAAA,MACV,aAAab;AAAA,MACb,KAAAC;AAAA,MACA,YAAYD,EAAO;AAAA,MACnB,SAASA,EAAO;AAAA,IAC5B,CAAS;AACD,WAAA6C,EAAkB7C,CAAM,GACxBA,EAAO,KAAK,IAAIC,GAAKgG,CAAK,GACnBA;AAAA,EACX;AAAA,EACA,OAAO;AACH,WAAOzF,EAAOI,EAAc,IAAI,CAAC,EAAE,KAAI;AAAA,EAC3C;AAAA,EACA,SAAS;AACL,UAAMsF,IAAW,KAAK,KAAI;AAC1B,WAAO;AAAA,MACH,CAACtG,EAAc,GAAG,MAAM,KAAK,OAAM;AAAA,MACnC,MAAM,MAAM;AACR,cAAMuG,IAASD,EAAS,KAAI;AAC5B,eAAIC,EAAO,OACAA,IAEJ;AAAA,UACH,MAAM;AAAA,UACN,OAHU,KAAK,IAAIA,EAAO,KAAK;AAAA,QAInD;AAAA,MACY;AAAA,IACZ;AAAA,EACI;AAAA,EACA,UAAU;AACN,UAAMD,IAAW,KAAK,KAAI;AAC1B,WAAO;AAAA,MACH,CAACtG,EAAc,GAAG,MAAM,KAAK,QAAO;AAAA,MACpC,MAAM,MAAM;AACR,cAAMuG,IAASD,EAAS,KAAI;AAC5B,YAAIC,EAAO;AACP,iBAAOA;AACX,cAAMtF,IAAQ,KAAK,IAAIsF,EAAO,KAAK;AACnC,eAAO;AAAA,UACH,MAAM;AAAA,UACN,OAAO,CAACA,EAAO,OAAOtF,CAAK;AAAA,QAC/C;AAAA,MACY;AAAA,IACZ;AAAA,EACI;AAAA,EACA,CAACjB,EAAc,IAAI;AACf,WAAO,KAAK,QAAO;AAAA,EACvB;AACJ,GACMwG,KAAiB,QAAQ,QAAQX,EAAU,GAE3CY,KAAkB,CAACrG,GAAQkG,GAAU,EAAE,kBAAAI,EAAgB,MAAO,MAAM;AACtE,MAAI5F,GAAIqF;AACR,QAAMI,IAASD,EAAS,KAAI;AAC5B,MAAIC,EAAO;AACP,WAAOA;AACX,QAAMlG,IAAMkG,EAAO;AACnB,MAAItF,IAAQb,EAAO,OAAO,IAAIC,CAAG;AACjC,QAAMsG,IAAe3F,EAAcC,CAAK,GAClCmF,MAAYD,KAAMrF,IAAKV,EAAO,SAAS,UAAU,QAAQ+F,MAAO,SAAS,SAASA,EAAG,KAAKrF,GAAIG,GAAOhB,CAAS,OAAOA,EAAU;AAIrI,MAHIG,EAAO,QAAQ,UACfuF,GAActF,GAAKD,EAAO,SAASgG,CAAO,GAE1C,CAACA,KACD,CAACO,KACDxF,EAAYd,GAAKD,EAAO,OAAO,KAC/B,CAACA,EAAO,aACRA,EAAO,SAAS,IAAIC,CAAG,GAAG;AAE1B,UAAMuG,IAAQ1G,GAAS,YAAY;AAAA,MAC/B,UAAUG;AAAA,MACV,aAAaD;AAAA,MACb,KAAAC;AAAA,MACA,YAAYD,EAAO;AAAA,MACnB,SAASA,EAAO;AAAA,IAC5B,CAAS;AACD,IAAAA,EAAO,OAAO,IAAIC,GAAKuG,CAAK,GAC5B3F,IAAQ2F;AAAA,EACZ,MACK,CAAID,MAEL1F,IAAQ0F,EAAa;AAEzB,SAAO;AAAA,IACH,MAAM;AAAA,IACN,OAAOD,IAAmBzF,IAAQ,CAACA,GAAOA,CAAK;AAAA,EACvD;AACA,GACM4F,KAAa;AAAA,EACf,IAAI,OAAO;AAEP,WADe7F,EAAc,IAAI,EACnB,OAAO;AAAA,EACzB;AAAA,EACA,IAAIC,GAAO;AACP,UAAMb,IAASY,EAAc,IAAI;AAEjC,QAAIZ,EAAO,OAAO,IAAIa,CAAK;AACvB,aAAO;AACX,IAAAgC,EAAkB7C,CAAM;AACxB,UAAM0G,IAAkB9F,EAAcC,CAAK;AAE3C,WAAI,GAAA6F,KAAmB1G,EAAO,OAAO,IAAI0G,EAAgB,QAAQ;AAAA,EAGrE;AAAA,EACA,IAAI7F,GAAO;AACP,UAAMb,IAASY,EAAc,IAAI;AACjC,WAAK,KAAK,IAAIC,CAAK,MACfgC,EAAkB7C,CAAM,GACxBmD,EAAYnD,CAAM,GAClBA,EAAO,YAAY,IAAIa,GAAO,EAAI,GAClCb,EAAO,OAAO,IAAIa,GAAOA,CAAK,GAC9B+D,GAAiB5E,GAAQa,GAAOA,GAAO2D,EAAe,IAEnD;AAAA,EACX;AAAA,EACA,OAAO3D,GAAO;AACV,QAAI,CAAC,KAAK,IAAIA,CAAK;AACf,aAAO;AAEX,UAAMb,IAASY,EAAc,IAAI;AACjC,IAAAiC,EAAkB7C,CAAM,GACxBmD,EAAYnD,CAAM;AAClB,UAAM0G,IAAkB9F,EAAcC,CAAK;AAC3C,WAAI6F,KAAmB1G,EAAO,OAAO,IAAI0G,EAAgB,QAAQ,KAE7D1G,EAAO,YAAY,IAAI0G,EAAgB,UAAU,EAAK,GAC/C1G,EAAO,OAAO,OAAO0G,EAAgB,QAAQ,MAEpD,CAACA,KAAmB1G,EAAO,OAAO,IAAIa,CAAK,IAE3Cb,EAAO,YAAY,IAAIa,GAAO,EAAK,IAInCb,EAAO,YAAY,OAAOa,CAAK,GAG5Bb,EAAO,OAAO,OAAOa,CAAK;AAAA,EACrC;AAAA,EACA,QAAQ;AACJ,QAAI,CAAC,KAAK;AACN;AACJ,UAAMb,IAASY,EAAc,IAAI;AACjC,IAAAiC,EAAkB7C,CAAM,GACxBmD,EAAYnD,CAAM;AAClB,eAAWa,KAASb,EAAO;AACvB,MAAAA,EAAO,YAAY,IAAIa,GAAO,EAAK;AAEvC,IAAAb,EAAO,OAAO,MAAK;AAAA,EACvB;AAAA,EACA,SAAS;AACL,UAAMA,IAASY,EAAc,IAAI;AACjC,IAAAiC,EAAkB7C,CAAM;AACxB,UAAMkG,IAAWlG,EAAO,OAAO,KAAI;AACnC,WAAO;AAAA,MACH,CAAC,OAAO,QAAQ,GAAG,MAAM,KAAK,OAAM;AAAA,MACpC,MAAMqG,GAAgBrG,GAAQkG,GAAU,EAAE,kBAAkB,IAAM;AAAA,IAC9E;AAAA,EACI;AAAA,EACA,UAAU;AACN,UAAMlG,IAASY,EAAc,IAAI;AACjC,IAAAiC,EAAkB7C,CAAM;AACxB,UAAMkG,IAAWlG,EAAO,OAAO,KAAI;AACnC,WAAO;AAAA,MACH,CAAC,OAAO,QAAQ,GAAG,MAAM,KAAK,QAAO;AAAA,MACrC,MAAMqG,GAAgBrG,GAAQkG,GAAU;AAAA,QACpC,kBAAkB;AAAA,MAClC,CAAa;AAAA,IACb;AAAA,EACI;AAAA,EACA,OAAO;AACH,WAAO,KAAK,OAAM;AAAA,EACtB;AAAA,EACA,CAACtG,EAAc,IAAI;AACf,WAAO,KAAK,OAAM;AAAA,EACtB;AAAA,EACA,QAAQ+F,GAAUC,GAAS;AACvB,UAAMM,IAAW,KAAK,OAAM;AAC5B,QAAIC,IAASD,EAAS,KAAI;AAC1B,WAAO,CAACC,EAAO;AACX,MAAAR,EAAS,KAAKC,GAASO,EAAO,OAAOA,EAAO,OAAO,IAAI,GACvDA,IAASD,EAAS,KAAI;AAAA,EAE9B;AACJ;AACI,IAAI,UAAU,cAKd,OAAO,OAAOO,IAAY;AAAA,EACtB,aAAaE,GAAO;AAChB,WAAO,IAAI,UAAU,aAAa,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAGA,CAAK;AAAA,EACxE;AAAA,EACA,MAAMA,GAAO;AACT,WAAO,IAAI,UAAU,MAAM,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAGA,CAAK;AAAA,EACjE;AAAA,EACA,WAAWA,GAAO;AACd,WAAO,IAAI,UAAU,WAAW,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAGA,CAAK;AAAA,EACtE;AAAA,EACA,oBAAoBA,GAAO;AACvB,WAAO,IAAI,UAAU,oBAAoB,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAGA,CAAK;AAAA,EAC/E;AAAA,EACA,WAAWA,GAAO;AACd,WAAO,IAAI,UAAU,WAAW,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAGA,CAAK;AAAA,EACtE;AAAA,EACA,aAAaA,GAAO;AAChB,WAAO,IAAI,UAAU,aAAa,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAGA,CAAK;AAAA,EACxE;AAAA,EACA,eAAeA,GAAO;AAClB,WAAO,IAAI,UAAU,eAAe,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAGA,CAAK;AAAA,EAC1E;AACR,CAAK;AAEL,MAAMC,KAAiB,QAAQ,QAAQH,EAAU,GAE3CI,KAAe;AAAA,EACjB,IAAI7G,GAAQC,GAAK6G,GAAU;AACvB,QAAIpG,GAAIqF;AACR,UAAMxD,KAAQ7B,IAAKV,EAAO,UAAU,QAAQU,MAAO,SAAS,SAASA,EAAGT,CAAG;AAE3E,QAAIsC,KAAQvC,EAAO,WAAW,YAAY,IAAIuC,CAAI;AAC9C,aAAOA;AAEX,QAAItC,MAAQP;AACR,aAAOM;AACX,QAAIiB;AACJ,QAAIjB,EAAO,QAAQ,MAAM;AAGrB,YAAMa,IAAQZ,MAAQ,WACjBD,EAAO,oBAAoB,OAAOA,EAAO,oBAAoB,OAC5D,QAAQ,IAAIA,EAAO,UAAUC,CAAG,IAChC,QAAQ,IAAID,EAAO,UAAUC,GAAK6G,CAAQ;AAEhD,UADA7F,IAAajB,EAAO,QAAQ,KAAKa,GAAOhB,CAAS,GAC7CoB,MAAepB,EAAU;AACzB,eAAIG,EAAO,QAAQ,UACfuF,GAAc1E,GAAOb,EAAO,SAAS,EAAI,GAEtCa;AAAA,IAEf;AACA,UAAM6E,IAASlF,EAAOR,CAAM;AAC5B,QAAI0F,aAAkB,OAAOU,GAAe,SAASnG,CAAG;AACpD,aAAIA,MAAQ,SACD,OAAO,yBAAyBwF,IAAY,MAAM,EAAE,IAAI,KAAKzF,EAAO,KAAK,IAErEyF,GAAWxF,CAAG,EACf,KAAKD,EAAO,KAAK;AAEnC,QAAI0F,aAAkB,OAAOkB,GAAe,SAAS3G,CAAG;AACpD,aAAIA,MAAQ,SACD,OAAO,yBAAyBwG,IAAY,MAAM,EAAE,IAAI,KAAKzG,EAAO,KAAK,IAErEyG,GAAWxG,CAAG,EACf,KAAKD,EAAO,KAAK;AAEnC,QAAI,CAACD,GAAI2F,GAAQzF,CAAG,GAAG;AACnB,YAAMuC,IAAOtC,GAAcwF,GAAQzF,CAAG;AACtC,aAAOuC,IACD,WAAWA,IACPA,EAAK;AAAA;AAAA,SAEFuD,IAAKvD,EAAK,SAAS,QAAQuD,MAAO,SAAS,SAASA,EAAG,KAAK/F,EAAO,KAAK;AAAA,UAC/E;AAAA,IACV;AACA,UAAMa,IAAQ6E,EAAOzF,CAAG;AAIxB,QAHID,EAAO,QAAQ,UACfuF,GAAc1E,GAAOb,EAAO,OAAO,GAEnCA,EAAO,aAAa,CAACe,EAAYF,GAAOb,EAAO,OAAO;AACtD,aAAOa;AAGX,QAAIA,MAAUa,GAAK1B,EAAO,UAAUC,CAAG,GAAG;AAUtC,UATA4C,EAAkB7C,CAAM,GACxBA,EAAO,KAAKC,CAAG,IAAI8G,GAAY;AAAA,QAC3B,UAAU/G,EAAO,SAASC,CAAG;AAAA,QAC7B,aAAaD;AAAA,QACb,KAAKA,EAAO,SAAS,IAA0B,OAAOC,CAAG,IAAIA;AAAA,QAC7D,YAAYD,EAAO;AAAA,QACnB,SAASA,EAAO;AAAA,MAChC,CAAa,GAEG,OAAOiB,KAAe,YAAY;AAClC,cAAM+F,IAAgBpG,EAAcZ,EAAO,KAAKC,CAAG,CAAC;AACpD,eAAA4C,EAAkBmE,CAAa,GAE/B7D,EAAY6D,CAAa,GAClBA,EAAc;AAAA,MACzB;AACA,aAAOhH,EAAO,KAAKC,CAAG;AAAA,IAC1B;AACA,WAAIU,EAAQE,CAAK,KACbb,EAAO,WAAW,YAAY,IAAIa,CAAK,GAEpCA;AAAA,EACX;AAAA,EACA,IAAIb,GAAQC,GAAKY,GAAO;AACpB,QAAIH;AACJ,QAAIV,EAAO,SAAS,KAAyBA,EAAO,SAAS;AACzD,YAAM,IAAI,MAAM,yDAAyD;AAE7E,QAAI8F;AACJ,QAAI9F,EAAO,SAAS,KAChBC,MAAQ,YACR,EAAE,OAAO,UAAW6F,IAAO,OAAO7F,CAAG,CAAC,KAClC6F,KAAQ,MACP7F,MAAQ,KAAK6F,MAAS,KAAK,OAAOA,CAAI,MAAM,OAAO7F,CAAG;AAC3D,YAAM,IAAI,MAAM,gEAAgE;AAEpF,UAAMuC,IAAOtC,GAAcM,EAAOR,CAAM,GAAGC,CAAG;AAC9C,QAAgDuC,GAAK;AAEjD,aAAAA,EAAK,IAAI,KAAKxC,EAAO,OAAOa,CAAK,GAC1B;AAEX,UAAMoG,IAAUvF,GAAKlB,EAAOR,CAAM,GAAGC,CAAG,GAClCiH,IAAoBtG,EAAcqG,CAAO;AAC/C,WAAIC,KAAqBtF,EAAQsF,EAAkB,UAAUrG,CAAK,KAE9Db,EAAO,KAAKC,CAAG,IAAIY,GACnBb,EAAO,eAAeU,IAAKV,EAAO,iBAAiB,QAAQU,MAAO,SAASA,IAAK,oBAAI,IAAG,GACvFV,EAAO,YAAY,IAAIC,GAAK,EAAK,GAC1B,OAGP2B,EAAQf,GAAOoG,CAAO,MACrBpG,MAAU,UAAad,GAAIC,EAAO,UAAUC,CAAG,OAEpD4C,EAAkB7C,CAAM,GACxBmD,EAAYnD,CAAM,GACdD,GAAIC,EAAO,UAAUC,CAAG,KAAK2B,EAAQf,GAAOb,EAAO,SAASC,CAAG,CAAC,IAEhED,EAAO,YAAY,OAAOC,CAAG,IAG7BD,EAAO,YAAY,IAAIC,GAAK,EAAI,GAEpCD,EAAO,KAAKC,CAAG,IAAIY,GACnB+D,GAAiB5E,GAAQC,GAAKY,GAAO2D,EAAe,IAC7C;AAAA,EACX;AAAA,EACA,IAAIxE,GAAQC,GAAK;AACb,WAAOA,KAAOO,EAAOR,CAAM;AAAA,EAC/B;AAAA,EACA,QAAQA,GAAQ;AACZ,WAAO,QAAQ,QAAQQ,EAAOR,CAAM,CAAC;AAAA,EACzC;AAAA,EACA,yBAAyBA,GAAQC,GAAK;AAClC,UAAMyF,IAASlF,EAAOR,CAAM,GACtBI,IAAa,QAAQ,yBAAyBsF,GAAQzF,CAAG;AAC/D,WAAKG,KAEE;AAAA,MACH,UAAU;AAAA,MACV,cAAcJ,EAAO,SAAS,KAA2BC,MAAQ;AAAA,MACjE,YAAYG,EAAW;AAAA,MACvB,OAAOsF,EAAOzF,CAAG;AAAA,IAC7B;AAAA,EACI;AAAA,EACA,eAAeD,GAAQ;AACnB,WAAO,QAAQ,eAAeA,EAAO,QAAQ;AAAA,EACjD;AAAA,EACA,iBAAiB;AACb,UAAM,IAAI,MAAM,0CAA0C;AAAA,EAC9D;AAAA,EACA,iBAAiB;AACb,UAAM,IAAI,MAAM,0CAA0C;AAAA,EAC9D;AAAA,EACA,eAAeA,GAAQC,GAAK;AACxB,QAAIS;AACJ,WAAIV,EAAO,SAAS,IACT6G,GAAa,IAAI,KAAK,MAAM7G,GAAQC,GAAK,QAAWD,EAAO,KAAK,KAEvE0B,GAAK1B,EAAO,UAAUC,CAAG,MAAM,UAAaA,KAAOD,EAAO,YAE1D6C,EAAkB7C,CAAM,GACxBmD,EAAYnD,CAAM,GAClBA,EAAO,YAAY,IAAIC,GAAK,EAAK,MAGjCD,EAAO,eAAeU,IAAKV,EAAO,iBAAiB,QAAQU,MAAO,SAASA,IAAK,oBAAI,IAAG,GAEvFV,EAAO,YAAY,OAAOC,CAAG,IAE7BD,EAAO,QACP,OAAOA,EAAO,KAAKC,CAAG,GACnB;AAAA,EACX;AACJ;AACA,SAAS8G,GAAYI,GAAoB;AACrC,QAAM,EAAE,UAAAxE,GAAU,aAAAyE,GAAa,KAAAnH,GAAK,YAAAoH,GAAY,SAAArG,EAAO,IAAKmG,GACtDrD,IAAOtC,EAAQmB,CAAQ,GACvBlC,IAAa;AAAA,IACf,MAAAqD;AAAA,IACA,WAAW;AAAA,IACX,QAAQsD;AAAA,IACR,UAAAzE;AAAA,IACA,MAAM;AAAA,IACN,OAAO;AAAA,IACP,YAAA0E;AAAA,IACA,SAAArG;AAAA;AAAA,IAEA,QAAQ8C,MAAS,IACX,IAAI,IAAInB,EAAS,QAAO,CAAE,IAC1B;AAAA,EACd;AAEI,GAAI1C,KAAO,SAASkH,OAChB1G,EAAW,MAAMR;AAErB,QAAM,EAAE,OAAAuG,GAAO,QAAAc,EAAM,IAAK,MAAM,UAAUxD,MAAS,IAA0B,OAAO,OAAO,CAAA,GAAIrD,CAAU,IAAIA,GAAYoG,EAAY;AAGrI,MAFAQ,EAAW,OAAO,KAAKC,CAAM,GAC7B7G,EAAW,QAAQ+F,GACfY,GAAa;AACb,UAAMpH,IAASoH;AACf,IAAApH,EAAO,WAAW,MAAM,KAAK,CAACyE,GAASC,MAAmB;AACtD,UAAIhE,GAAIqF;AACR,YAAMwB,IAAgB3G,EAAc4F,CAAK;AAEzC,UAAIjE,IAAOvC,EAAO,SAAS,IAAwBA,EAAO,SAASA,EAAO;AAC1E,YAAMiG,IAAQ5E,EAAIkB,GAAMtC,CAAG,GACrBQ,IAAaG,EAAcqF,CAAK;AACtC,UAAIxF,GAAY;AAEZ,YAAI0D,IAAe1D,EAAW;AAC9B,QAAIA,EAAW,aACX0D,IAAerD,GAASmF,CAAK,IAEjC3B,GAAiB7D,CAAU,GAC3B8D,GAAgB9D,GAAY+D,IAAiBC,GAASC,CAAc,GAChE1E,EAAO,QAAQ,qBACfA,EAAO,QAAQ,iBACVU,IAAKV,EAAO,QAAQ,mBAAmB,QAAQU,MAAO,SAASA,IAAK,oBAAI,QAAO,GACpFV,EAAO,QAAQ,cAAc,IAAImE,GAAc1D,EAAW,QAAQ,IAGtEgB,GAAIc,GAAMtC,GAAKkE,CAAY;AAAA,MAC/B;AAEA,OAAC4B,IAAKwB,EAAc,eAAe,QAAQxB,MAAO,UAAkBA,EAAG,QAAQ,CAACJ,MAAa;AACzF,QAAAA,EAASlB,GAASC,CAAc;AAAA,MACpC,CAAC;AAAA,IACL,CAAC;AAAA,EACL,OACK;AAED,UAAM1E,IAASY,EAAc4F,CAAK;AAClC,IAAAxG,EAAO,WAAW,MAAM,KAAK,CAACyE,GAASC,MAAmB;AACtD,MAAAJ,GAAiBtE,CAAM,GACvBuE,GAAgBvE,GAAQwE,IAAiBC,GAASC,CAAc;AAAA,IACpE,CAAC;AAAA,EACL;AACA,SAAO8B;AACX;AACA1G,GAAS,cAAciH;AACvB,SAASS,GAAcrB,GAAQsB,GAAehD,GAASC,GAAgBgD,GAAkB;AACrF,MAAIhH;AACJ,QAAMD,IAAaG,EAAcuF,CAAM,GACjCxD,KAAYjC,IAA6DD,GAAW,cAAc,QAAQC,MAAO,SAASA,IAAKyF,GAC/HwB,IAAmB,CAAC,CAACF,EAAc;AACzC,MAA4DhH,GAAW;AACnE,WAAOA,EAAW,WAAW,MAAM,SAAS;AAExC,MADiBA,EAAW,WAAW,MAAM,IAAG,EACvCgE,GAASC,CAAc;AAGxC,QAAM/C,IAAQgG,IACRF,EAAc,CAAC,IACfhH,IACIA,EAAW,WACPA,EAAW,OACXA,EAAW,WACf0F;AACV,SAAI1F,KACAsB,GAAYtB,CAAU,GACtBiH,KACArE,EAAW1B,GAAOA,GAA+DlB,GAAW,QAAQ,aAAa,GAE9G;AAAA,IACHkB;AAAA,IACA8C,KAAWkD,IACL,CAAC,EAAE,IAAIlI,EAAU,SAAS,MAAM,CAAA,GAAI,OAAOgI,EAAc,CAAC,EAAC,CAAE,IAC7DhD;AAAA,IACNC,KAAkBiD,IACZ,CAAC,EAAE,IAAIlI,EAAU,SAAS,MAAM,CAAA,GAAI,OAAOkD,EAAQ,CAAE,IACrD+B;AAAA,EACd;AACA;AAEA,SAASkD,GAASC,GAAW7G,GAAS;AAClC,MAAIN;AACJ,QAAM2G,IAAa;AAAA,IACf,OAAO,CAAA;AAAA,IACP,QAAQ,CAAA;AAAA,IACR,YAAY,oBAAI,QAAO;AAAA,IACvB,aAAa,oBAAI,QAAO;AAAA,EAChC;AACI,MAAI5C,GACAC;AACJ,EAAI1D,EAAQ,kBACRyD,IAAU,CAAA,GACVC,IAAiB,CAAA;AAIrB,QAAMuB,MAFcvF,IAAKM,EAAQ,UAAU,QAAQN,MAAO,SAAS,SAASA,EAAG,KAAKM,GAAS6G,GAAWhI,CAAS,OAAOA,EAAU,WAC9H,CAACkB,EAAY8G,GAAW7G,CAAO,IAE7B6G,IACAd,GAAY;AAAA,IACV,UAAUc;AAAA,IACV,aAAa;AAAA,IACb,YAAAR;AAAA,IACA,SAAArG;AAAA,EACZ,CAAS;AACL,SAAO;AAAA,IACHiF;AAAA,IACA,CAACwB,IAAgB,CAAA,MAAO;AACpB,YAAM,CAACK,GAAgBC,GAAkBC,CAAuB,IAAIR,GAAcvB,GAAOwB,GAAehD,GAASC,GAAgB1D,EAAQ,gBAAgB;AACzJ,aAAQA,EAAQ,gBACV,CAAC8G,GAAgBC,GAAkBC,CAAuB,IAC1DF;AAAA,IACV;AAAA,EACR;AACA;AAEA,SAASG,GAAkBjH,GAAS;AAChC,QAAM,EAAE,WAAAkH,GAAW,OAAArH,GAAO,cAAAsH,IAAe,IAAO,QAAAC,IAAS,GAAI,IAAKpH;AAClE,EAAA4C,GAAQ/C,GAAO,CAACZ,GAAKkC,GAAMuD,MAAW;AAClC,UAAMjF,IAAaG,EAAcuB,CAAI;AAErC,QAAI1B,KACAyH,KACAzH,EAAW,eAAeyH,EAAU,YAAY;AAChD,MAAAlH,EAAQ,iBAAiB;AACzB,YAAMqH,IAAe5H,EAAW;AAEhC,UAAIiF,aAAkB,KAAK;AACvB,cAAM4C,IAAM,MAAM,KAAK5C,CAAM;AAC7B,QAAAA,EAAO,MAAK,GACZ4C,EAAI,QAAQ,CAACpG,MAAUwD,EAAO,IAAIzF,MAAQiC,IAAQmG,IAAenG,CAAK,CAAC;AAAA,MAC3E;AAEI,QAAAT,GAAIiE,GAAQzF,GAAKoI,CAAY;AAAA,IAErC,MACK,CAAI,OAAOlG,KAAS,YAAYA,MAAS,SAC1CnB,EAAQ,QAAQmB,GAChBnB,EAAQ,SAAS,IACjBiH,GAAkBjH,CAAO;AAAA,EAEjC,CAAC,GACGoH,MACKpH,EAAQ,kBACT,QAAQ,KAAK,wHAAwH,GACrImH,KACA,QAAQ,KAAK,4FAA4F;AAGrH;AACA,SAASI,GAAWvI,GAAQ;AACxB,MAAIU;AACJ,QAAMD,IAAaG,EAAcZ,CAAM;AACvC,MAAI,CAACe,EAAYf,GAAgES,GAAW,OAAO;AAC/F,WAAOT;AACX,QAAM8D,IAAOtC,EAAQxB,CAAM;AAC3B,MAAIS,KAAc,CAACA,EAAW;AAC1B,WAAOA,EAAW;AACtB,MAAI4H;AACJ,WAASxF,IAAoB;AACzB,IAAAwF,IACIvE,MAAS,IACFvD,GAAkBP,CAAM,IAErB,IAAI,IAAIA,CAAM,IADd,KAAK,OAAO,eAAeA,CAAM,GAAE,YAAaA,CAAM,IAE1D8D,MAAS,IACL,MAAM,KAAKrD,EAAW,OAAO,OAAM,CAAE,IACrCiC,GAAY1C,GAAgES,GAAW,OAAO;AAAA,EAChH;AACA,MAAIA,GAAY;AAEZ,IAAAA,EAAW,YAAY;AACvB,QAAI;AACA,MAAAoC,EAAiB;AAAA,IACrB,UACR;AACY,MAAApC,EAAW,YAAY;AAAA,IAC3B;AAAA,EACJ;AAII,IAAA4H,IAAerI;AAYnB,MAVA4D,GAAQyE,GAAc,CAACpI,GAAKY,MAAU;AAClC,QAAIJ,KAAcmB,EAAQP,EAAIZ,EAAW,UAAUR,CAAG,GAAGY,CAAK;AAC1D;AACJ,UAAM2H,IAAWD,GAAW1H,CAAK;AACjC,IAAI2H,MAAa3H,MACTwH,MAAiBrI,KACjB6C,EAAiB,GACrBpB,GAAI4G,GAAcpI,GAAKuI,CAAQ;AAAA,EAEvC,CAAC,GACG1E,MAAS,GAAuB;AAChC,UAAMjD,KAASH,IAA6DD,GAAW,cAAc,QAAQC,MAAO,SAASA,IAAK2H;AAClI,WAAQhI,GAAkBQ,CAAK,IAEzB,IAAI,IAAIwH,CAAY,IADpB,KAAK,OAAO,eAAexH,CAAK,GAAE,YAAawH,CAAY;AAAA,EAErE;AACA,SAAOA;AACX;AACA,SAASpB,GAAQjH,GAAQ;AACrB,MAAI,CAACW,EAAQX,CAAM;AACf,UAAM,IAAI,MAAM,gDAAgDA,CAAM,EAAE;AAE5E,SAAOuI,GAAWvI,CAAM;AAC5B;AA0BA,MAAMyI,KAAc,CAACC,MAKV,SAASC,EAAOC,GAAMC,GAAMC,GAAM;AACrC,MAAIpI,GAAIqF,GAAIgD;AACZ,MAAI,OAAOH,KAAS,cAAc,OAAOC,KAAS;AAC9C,WAAO,SAAUzG,MAAS4G,GAAM;AAC5B,aAAOL,EAAOvG,GAAM,CAAC6D,MAAU2C,EAAK,KAAK,MAAM3C,GAAO,GAAG+C,CAAI,GAAGH,CAAI;AAAA,IACxE;AAEJ,QAAMzG,IAAOwG,GACPK,IAASJ;AACf,MAAI7H,IAAU8H;AAId,MAHI,OAAOD,KAAS,eAChB7H,IAAU6H,IAEV7H,MAAY,UACZ,OAAO,UAAU,SAAS,KAAKA,CAAO,MAAM;AAC5C,UAAM,IAAI,MAAM,oBAAoBA,CAAO,kCAAkC;AAEjF,EAAAA,IAAU,OAAO,OAAO,OAAO,OAAO,IAAI0H,CAAG,GAAG1H,CAAO;AACvD,QAAMW,IAAQhB,EAAQyB,CAAI,IAAI6E,GAAQ7E,CAAI,IAAIA,GACxC8G,IAAO,MAAM,QAAQlI,EAAQ,IAAI,KAChC,CAACH,GAAOsI,MAAU;AACjB,eAAWD,KAAQlI,EAAQ,MAAM;AAC7B,UAAI,OAAOkI,KAAS;AAChB,cAAM,IAAI,MAAM,iBAAiBA,CAAI,gCAAgC;AAEzE,YAAM/C,IAAS+C,EAAKrI,GAAOsI,CAAK;AAChC,UAAIhD;AACA,eAAOA;AAAA,IAEf;AAAA,EAEJ,KACEnF,EAAQ,MACRoI,KAAiB1I,IAAKM,EAAQ,mBAAmB,QAAQN,MAAO,SAASA,IAAK,IAC9E2I,KAAUtD,IAAK/E,EAAQ,YAAY,QAAQ+E,MAAO,SAASA,IAAK,IAEhEuD,IAAW;AAAA,IACb,mBAFsBP,IAAK/H,EAAQ,sBAAsB,QAAQ+H,MAAO,SAASA,IAAK;AAAA,IAGtF,MAAAG;AAAA,IACA,QAAAG;AAAA,IACA,eAAAD;AAAA,EACZ;AACQ,MAAI,CAACrI,EAAYY,GAAO2H,CAAQ,KAC5B,OAAO3H,KAAU,YACjBA,MAAU;AACV,UAAM,IAAI,MAAM,4HAA4H;AAEhJ,QAAM,CAACsE,GAAOsD,CAAQ,IAAI3B,GAASjG,GAAO2H,CAAQ;AAClD,MAAI,OAAOT,KAAS,YAAY;AAC5B,QAAI,CAAC9H,EAAYY,GAAO2H,CAAQ;AAC5B,YAAM,IAAI,MAAM,4HAA4H;AAEhJ,WAAO,CAACrD,GAAOsD,CAAQ;AAAA,EAC3B;AACA,MAAIpD;AACJ,MAAI;AACA,IAAAA,IAAS8C,EAAOhD,CAAK;AAAA,EACzB,SACOuD,GAAO;AACV,UAAAzH,GAAYnB,EAAcqF,CAAK,CAAC,GAC1BuD;AAAA,EACV;AACA,QAAMC,IAAc,CAAC5I,MAAU;AAC3B,UAAMJ,IAAaG,EAAcqF,CAAK;AACtC,QAAI,CAACtF,EAAQE,CAAK,GAAG;AACjB,UAAIA,MAAU,UACV,CAACe,EAAQf,GAAOoF,CAAK,KACoCxF,GAAW;AACpE,cAAM,IAAI,MAAM,mHAAmH;AAEvI,YAAMiJ,IAA+D7I,IAAMlB,EAAiB;AAC5F,UAAI+J,GAAgB;AAChB,cAAM7D,KAAS6D,EAAe,CAAC;AAC/B,eAAIJ,EAAS,UAAU,OAAOzI,KAAU,YAAYA,MAAU,QAC1DoH,GAAkB;AAAA,UACd,WAAWxH;AAAA,UACX,OAAAI;AAAA,UACA,cAAc;AAAA,QAC1C,CAAyB,GAEE0I,EAAS,CAAC1D,EAAM,CAAC;AAAA,MAC5B;AACA,UAAIhF,MAAU;AACV,eAAI,OAAOA,KAAU,YAAYA,MAAU,QACvCoH,GAAkB,EAAE,WAAWxH,GAAY,OAAAI,EAAK,CAAE,GAE/C0I,EAAS,CAAC1I,CAAK,CAAC;AAAA,IAE/B;AACA,QAAIA,MAAUoF,KAASpF,MAAU;AAC7B,aAAO0I,EAAS,CAAA,CAAE;AAEtB,UAAMI,IAAqB/I,EAAcC,CAAK;AAC9C,QAAIyI,MAAaK,EAAmB,SAAS;AACzC,UAAIA,EAAmB;AACnB,cAAM,IAAI,MAAM,uCAAuC;AAE3D,aAAOJ,EAAS,CAACtC,GAAQpG,CAAK,CAAC,CAAC;AAAA,IACpC;AACA,WAAO0I,EAAS,CAAC1I,CAAK,CAAC;AAAA,EAC3B;AACA,SAAIsF,aAAkB,UACXA,EAAO,KAAKsD,GAAa,CAACD,MAAU;AACvC,UAAAzH,GAAYnB,EAAcqF,CAAK,CAAC,GAC1BuD;AAAA,EACV,CAAC,IAEEC,EAAYtD,CAAM;AAC7B,GAyBEwC,IAASF,GAAW;AAwLA,OAAO,UAAU,YAAY,SAAQ;AChtD/D,IAAImB,KAAa,OAAO,UAAU,YAAY,UAAU,OAAO,WAAW,UAAU,QCEhFC,KAAW,OAAO,QAAQ,YAAY,QAAQ,KAAK,WAAW,UAAU,MAGxEC,IAAOF,MAAcC,MAAY,SAAS,aAAa,EAAC,GCHxDE,IAASD,EAAK,QCAdE,KAAc,OAAO,WAGrBC,KAAiBD,GAAY,gBAO7BE,KAAuBF,GAAY,UAGnCG,IAAiBJ,IAASA,EAAO,cAAc;AASnD,SAASK,GAAUvJ,GAAO;AACxB,MAAIwJ,IAAQJ,GAAe,KAAKpJ,GAAOsJ,CAAc,GACjDG,IAAMzJ,EAAMsJ,CAAc;AAE9B,MAAI;AACF,IAAAtJ,EAAMsJ,CAAc,IAAI;AACxB,QAAII,IAAW;AAAA,EACjB,QAAY;AAAA,EAAC;AAEb,MAAIpE,IAAS+D,GAAqB,KAAKrJ,CAAK;AAC5C,SAAI0J,MACEF,IACFxJ,EAAMsJ,CAAc,IAAIG,IAExB,OAAOzJ,EAAMsJ,CAAc,IAGxBhE;AACT;AC1CA,IAAI6D,KAAc,OAAO,WAOrBE,KAAuBF,GAAY;AASvC,SAASQ,GAAe3J,GAAO;AAC7B,SAAOqJ,GAAqB,KAAKrJ,CAAK;AACxC;ACdA,IAAI4J,KAAU,iBACVC,KAAe,sBAGfP,KAAiBJ,IAASA,EAAO,cAAc;AASnD,SAASY,EAAW9J,GAAO;AACzB,SAAIA,KAAS,OACJA,MAAU,SAAY6J,KAAeD,KAEtCN,MAAkBA,MAAkB,OAAOtJ,CAAK,IACpDuJ,GAAUvJ,CAAK,IACf2J,GAAe3J,CAAK;AAC1B;ACDA,SAAS+J,EAAa/J,GAAO;AAC3B,SAAOA,KAAS,QAAQ,OAAOA,KAAS;AAC1C;ACtBA,IAAIgK,KAAY;AAmBhB,SAASC,GAASjK,GAAO;AACvB,SAAO,OAAOA,KAAS,YACpB+J,EAAa/J,CAAK,KAAK8J,EAAW9J,CAAK,KAAKgK;AACjD;ACjBA,SAASE,GAASC,GAAOC,GAAU;AAKjC,WAJI5I,IAAQ,IACR6I,IAASF,KAAS,OAAO,IAAIA,EAAM,QACnC7E,IAAS,MAAM+E,CAAM,GAElB,EAAE7I,IAAQ6I;AACf,IAAA/E,EAAO9D,CAAK,IAAI4I,EAASD,EAAM3I,CAAK,GAAGA,GAAO2I,CAAK;AAErD,SAAO7E;AACT;ACKA,IAAIgF,IAAU,MAAM,SCdhBC,KAAcrB,IAASA,EAAO,YAAY,QAC1CsB,KAAiBD,KAAcA,GAAY,WAAW;AAU1D,SAASE,GAAazK,GAAO;AAE3B,MAAI,OAAOA,KAAS;AAClB,WAAOA;AAET,MAAIsK,EAAQtK,CAAK;AAEf,WAAOkK,GAASlK,GAAOyK,EAAY,IAAI;AAEzC,MAAIR,GAASjK,CAAK;AAChB,WAAOwK,KAAiBA,GAAe,KAAKxK,CAAK,IAAI;AAEvD,MAAIsF,IAAUtF,IAAQ;AACtB,SAAQsF,KAAU,OAAQ,IAAItF,KAAU,SAAa,OAAOsF;AAC9D;ACjCA,IAAIoF,KAAe;AAUnB,SAASC,GAAgBC,GAAQ;AAG/B,WAFIpJ,IAAQoJ,EAAO,QAEZpJ,OAAWkJ,GAAa,KAAKE,EAAO,OAAOpJ,CAAK,CAAC;AAAG;AAC3D,SAAOA;AACT;ACbA,IAAIqJ,KAAc;AASlB,SAASC,GAASF,GAAQ;AACxB,SAAOA,KACHA,EAAO,MAAM,GAAGD,GAAgBC,CAAM,IAAI,CAAC,EAAE,QAAQC,IAAa,EAAE;AAE1E;ACSA,SAASE,GAAS/K,GAAO;AACvB,MAAIiD,IAAO,OAAOjD;AAClB,SAAOA,KAAS,SAASiD,KAAQ,YAAYA,KAAQ;AACvD;ACvBA,IAAI+H,KAAM,KAGNC,KAAa,sBAGbC,KAAa,cAGbC,KAAY,eAGZC,KAAe;AAyBnB,SAASC,GAASrL,GAAO;AACvB,MAAI,OAAOA,KAAS;AAClB,WAAOA;AAET,MAAIiK,GAASjK,CAAK;AAChB,WAAOgL;AAET,MAAID,GAAS/K,CAAK,GAAG;AACnB,QAAI8F,IAAQ,OAAO9F,EAAM,WAAW,aAAaA,EAAM,QAAO,IAAKA;AACnE,IAAAA,IAAQ+K,GAASjF,CAAK,IAAKA,IAAQ,KAAMA;AAAA,EAC3C;AACA,MAAI,OAAO9F,KAAS;AAClB,WAAOA,MAAU,IAAIA,IAAQ,CAACA;AAEhC,EAAAA,IAAQ8K,GAAS9K,CAAK;AACtB,MAAIsL,IAAWJ,GAAW,KAAKlL,CAAK;AACpC,SAAQsL,KAAYH,GAAU,KAAKnL,CAAK,IACpCoL,GAAapL,EAAM,MAAM,CAAC,GAAGsL,IAAW,IAAI,CAAC,IAC5CL,GAAW,KAAKjL,CAAK,IAAIgL,KAAM,CAAChL;AACvC;AC1DA,IAAIuL,KAAW,OACXC,KAAc;AAyBlB,SAASC,GAASzL,GAAO;AACvB,MAAI,CAACA;AACH,WAAOA,MAAU,IAAIA,IAAQ;AAG/B,MADAA,IAAQqL,GAASrL,CAAK,GAClBA,MAAUuL,MAAYvL,MAAU,CAACuL,IAAU;AAC7C,QAAIG,IAAQ1L,IAAQ,IAAI,KAAK;AAC7B,WAAO0L,IAAOF;AAAA,EAChB;AACA,SAAOxL,MAAUA,IAAQA,IAAQ;AACnC;ACXA,SAAS2L,GAAU3L,GAAO;AACxB,MAAIsF,IAASmG,GAASzL,CAAK,GACvB4L,IAAYtG,IAAS;AAEzB,SAAOA,MAAWA,IAAUsG,IAAYtG,IAASsG,IAAYtG,IAAU;AACzE;ACjBA,SAASuG,GAAS7L,GAAO;AACvB,SAAOA;AACT;ACdA,IAAI8L,KAAW,0BACXC,KAAU,qBACVC,KAAS,8BACTC,KAAW;AAmBf,SAASC,GAAWlM,GAAO;AACzB,MAAI,CAAC+K,GAAS/K,CAAK;AACjB,WAAO;AAIT,MAAIyJ,IAAMK,EAAW9J,CAAK;AAC1B,SAAOyJ,KAAOsC,MAAWtC,KAAOuC,MAAUvC,KAAOqC,MAAYrC,KAAOwC;AACtE;AC/BA,IAAIE,KAAalD,EAAK,oBAAoB,GCAtCmD,MAAc,WAAW;AAC3B,MAAIC,IAAM,SAAS,KAAKF,MAAcA,GAAW,QAAQA,GAAW,KAAK,YAAY,EAAE;AACvF,SAAOE,IAAO,mBAAmBA,IAAO;AAC1C;AASA,SAASC,GAASC,GAAM;AACtB,SAAO,CAAC,CAACH,MAAeA,MAAcG;AACxC;AChBA,IAAIC,KAAY,SAAS,WAGrBC,KAAeD,GAAU;AAS7B,SAASE,EAASH,GAAM;AACtB,MAAIA,KAAQ,MAAM;AAChB,QAAI;AACF,aAAOE,GAAa,KAAKF,CAAI;AAAA,IAC/B,QAAY;AAAA,IAAC;AACb,QAAI;AACF,aAAQA,IAAO;AAAA,IACjB,QAAY;AAAA,IAAC;AAAA,EACf;AACA,SAAO;AACT;ACdA,IAAII,KAAe,uBAGfC,KAAe,+BAGfJ,KAAY,SAAS,WACrBrD,KAAc,OAAO,WAGrBsD,KAAeD,GAAU,UAGzBpD,KAAiBD,GAAY,gBAG7B0D,KAAa;AAAA,EAAO,MACtBJ,GAAa,KAAKrD,EAAc,EAAE,QAAQuD,IAAc,MAAM,EAC7D,QAAQ,0DAA0D,OAAO,IAAI;AAChF;AAUA,SAASG,GAAa9M,GAAO;AAC3B,MAAI,CAAC+K,GAAS/K,CAAK,KAAKsM,GAAStM,CAAK;AACpC,WAAO;AAET,MAAI+M,IAAUb,GAAWlM,CAAK,IAAI6M,KAAaD;AAC/C,SAAOG,EAAQ,KAAKL,EAAS1M,CAAK,CAAC;AACrC;ACpCA,SAASC,GAAS+M,GAAQ5N,GAAK;AAC7B,SAAoC4N,IAAO5N,CAAG;AAChD;ACCA,SAAS6N,EAAUD,GAAQ5N,GAAK;AAC9B,MAAIY,IAAQC,GAAS+M,GAAQ5N,CAAG;AAChC,SAAO0N,GAAa9M,CAAK,IAAIA,IAAQ;AACvC;ACVA,IAAIkN,KAAUD,EAAUhE,GAAM,SAAS;ACOvC,SAASkE,GAAchD,GAAOiD,GAAWC,GAAWC,GAAW;AAI7D,WAHIjD,IAASF,EAAM,QACf3I,IAAQ6L,IAA6B,IAEX,EAAE7L,IAAQ6I;AACtC,QAAI+C,EAAUjD,EAAM3I,CAAK,GAAGA,GAAO2I,CAAK;AACtC,aAAO3I;AAGX,SAAO;AACT;ACpBA,IAAI+L,KAAmB,kBAGnBC,KAAW;AAUf,SAASC,GAAQzN,GAAOqK,GAAQ;AAC9B,MAAIpH,IAAO,OAAOjD;AAClB,SAAAqK,IAASA,KAAiBkD,IAEnB,CAAC,CAAClD,MACNpH,KAAQ,YACNA,KAAQ,YAAYuK,GAAS,KAAKxN,CAAK,MACrCA,IAAQ,MAAMA,IAAQ,KAAK,KAAKA,IAAQqK;AACjD;ACUA,SAASqD,GAAG1N,GAAO8F,GAAO;AACxB,SAAO9F,MAAU8F,KAAU9F,MAAUA,KAAS8F,MAAUA;AAC1D;ACjCA,IAAIyH,KAAmB;AA4BvB,SAASI,GAAS3N,GAAO;AACvB,SAAO,OAAOA,KAAS,YACrBA,IAAQ,MAAMA,IAAQ,KAAK,KAAKA,KAASuN;AAC7C;ACJA,SAASK,GAAY5N,GAAO;AAC1B,SAAOA,KAAS,QAAQ2N,GAAS3N,EAAM,MAAM,KAAK,CAACkM,GAAWlM,CAAK;AACrE;AC7BA,IAAImJ,KAAc,OAAO;AASzB,SAAS0E,GAAY7N,GAAO;AAC1B,MAAI8N,IAAO9N,KAASA,EAAM,aACtB+N,IAAS,OAAOD,KAAQ,cAAcA,EAAK,aAAc3E;AAE7D,SAAOnJ,MAAU+N;AACnB;ACNA,SAASC,GAAUC,GAAG7D,GAAU;AAI9B,WAHI5I,IAAQ,IACR8D,IAAS,MAAM2I,CAAC,GAEb,EAAEzM,IAAQyM;AACf,IAAA3I,EAAO9D,CAAK,IAAI4I,EAAS5I,CAAK;AAEhC,SAAO8D;AACT;ACbA,IAAI4I,KAAU;AASd,SAASC,GAAgBnO,GAAO;AAC9B,SAAO+J,EAAa/J,CAAK,KAAK8J,EAAW9J,CAAK,KAAKkO;AACrD;ACXA,IAAI/E,KAAc,OAAO,WAGrBC,KAAiBD,GAAY,gBAG7BiF,KAAuBjF,GAAY,sBAoBnCkF,KAAcF,GAAgB,4BAAW;AAAE,SAAO;AAAW,IAAG,IAAIA,KAAkB,SAASnO,GAAO;AACxG,SAAO+J,EAAa/J,CAAK,KAAKoJ,GAAe,KAAKpJ,GAAO,QAAQ,KAC/D,CAACoO,GAAqB,KAAKpO,GAAO,QAAQ;AAC9C;ACpBA,SAASsO,KAAY;AACnB,SAAO;AACT;ACXA,IAAIC,KAAc,OAAO,WAAW,YAAY,WAAW,CAAC,QAAQ,YAAY,SAG5EC,KAAaD,MAAe,OAAO,UAAU,YAAY,UAAU,CAAC,OAAO,YAAY,QAGvFE,KAAgBD,MAAcA,GAAW,YAAYD,IAGrDG,KAASD,KAAgBxF,EAAK,SAAS,QAGvC0F,KAAiBD,KAASA,GAAO,WAAW,QAmB5CE,KAAWD,MAAkBL,IC9B7BJ,KAAU,sBACVW,KAAW,kBACXC,KAAU,oBACVC,KAAU,iBACVC,KAAW,kBACXjD,KAAU,qBACVkD,KAAS,gBACTC,KAAY,mBACZC,KAAY,mBACZC,KAAY,mBACZC,KAAS,gBACTC,KAAY,mBACZC,KAAa,oBAEbC,KAAiB,wBACjBC,KAAc,qBACdC,KAAa,yBACbC,KAAa,yBACbC,KAAU,sBACVC,KAAW,uBACXC,KAAW,uBACXC,KAAW,uBACXC,KAAkB,8BAClBC,KAAY,wBACZC,KAAY,wBAGZC,IAAiB,CAAA;AACrBA,EAAeT,EAAU,IAAIS,EAAeR,EAAU,IACtDQ,EAAeP,EAAO,IAAIO,EAAeN,EAAQ,IACjDM,EAAeL,EAAQ,IAAIK,EAAeJ,EAAQ,IAClDI,EAAeH,EAAe,IAAIG,EAAeF,EAAS,IAC1DE,EAAeD,EAAS,IAAI;AAC5BC,EAAejC,EAAO,IAAIiC,EAAetB,EAAQ,IACjDsB,EAAeX,EAAc,IAAIW,EAAerB,EAAO,IACvDqB,EAAeV,EAAW,IAAIU,EAAepB,EAAO,IACpDoB,EAAenB,EAAQ,IAAImB,EAAepE,EAAO,IACjDoE,EAAelB,EAAM,IAAIkB,EAAejB,EAAS,IACjDiB,EAAehB,EAAS,IAAIgB,EAAef,EAAS,IACpDe,EAAed,EAAM,IAAIc,EAAeb,EAAS,IACjDa,EAAeZ,EAAU,IAAI;AAS7B,SAASa,GAAiBpQ,GAAO;AAC/B,SAAO+J,EAAa/J,CAAK,KACvB2N,GAAS3N,EAAM,MAAM,KAAK,CAAC,CAACmQ,EAAerG,EAAW9J,CAAK,CAAC;AAChE;AClDA,SAASqQ,GAAU9D,GAAM;AACvB,SAAO,SAASvM,GAAO;AACrB,WAAOuM,EAAKvM,CAAK;AAAA,EACnB;AACF;ACRA,IAAIuO,KAAc,OAAO,WAAW,YAAY,WAAW,CAAC,QAAQ,YAAY,SAG5EC,KAAaD,MAAe,OAAO,UAAU,YAAY,UAAU,CAAC,OAAO,YAAY,QAGvFE,KAAgBD,MAAcA,GAAW,YAAYD,IAGrD+B,KAAc7B,MAAiB1F,GAAW,SAG1CwH,MAAY,WAAW;AACzB,MAAI;AAEF,QAAIjI,IAAQkG,MAAcA,GAAW,WAAWA,GAAW,QAAQ,MAAM,EAAE;AAE3E,WAAIlG,KAKGgI,MAAeA,GAAY,WAAWA,GAAY,QAAQ,MAAM;AAAA,EACzE,QAAY;AAAA,EAAC;AACf,MCtBIE,KAAmBD,MAAYA,GAAS,cAmBxCE,KAAeD,KAAmBH,GAAUG,EAAgB,IAAIJ,IChBhEjH,KAAc,OAAO,WAGrBC,KAAiBD,GAAY;AAUjC,SAASuH,GAAc1Q,GAAO2Q,GAAW;AACvC,MAAIC,IAAQtG,EAAQtK,CAAK,GACrB6Q,IAAQ,CAACD,KAASvC,GAAYrO,CAAK,GACnC8Q,IAAS,CAACF,KAAS,CAACC,KAASjC,GAAS5O,CAAK,GAC3C+Q,IAAS,CAACH,KAAS,CAACC,KAAS,CAACC,KAAUL,GAAazQ,CAAK,GAC1DgR,IAAcJ,KAASC,KAASC,KAAUC,GAC1CzL,IAAS0L,IAAchD,GAAUhO,EAAM,QAAQ,MAAM,IAAI,CAAA,GACzDqK,IAAS/E,EAAO;AAEpB,WAASlG,KAAOY;AACd,IAAkBoJ,GAAe,KAAKpJ,GAAOZ,CAAG,KAC5C,EAAE4R;AAAA,KAEC5R,KAAO;AAAA,IAEN0R,MAAW1R,KAAO,YAAYA,KAAO;AAAA,IAErC2R,MAAW3R,KAAO,YAAYA,KAAO,gBAAgBA,KAAO;AAAA,IAE7DqO,GAAQrO,GAAKiL,CAAM,OAExB/E,EAAO,KAAKlG,CAAG;AAGnB,SAAOkG;AACT;ACtCA,SAAS2L,GAAQ1E,GAAM2E,GAAW;AAChC,SAAO,SAASrJ,GAAK;AACnB,WAAO0E,EAAK2E,EAAUrJ,CAAG,CAAC;AAAA,EAC5B;AACF;ACTA,IAAIsJ,KAAaF,GAAQ,OAAO,MAAM,MAAM,GCCxC9H,KAAc,OAAO,WAGrBC,KAAiBD,GAAY;AASjC,SAASiI,GAASpE,GAAQ;AACxB,MAAI,CAACa,GAAYb,CAAM;AACrB,WAAOmE,GAAWnE,CAAM;AAE1B,MAAI1H,IAAS,CAAA;AACb,WAASlG,KAAO,OAAO4N,CAAM;AAC3B,IAAI5D,GAAe,KAAK4D,GAAQ5N,CAAG,KAAKA,KAAO,iBAC7CkG,EAAO,KAAKlG,CAAG;AAGnB,SAAOkG;AACT;ACKA,SAAS1C,GAAKoK,GAAQ;AACpB,SAAOY,GAAYZ,CAAM,IAAI0D,GAAc1D,CAAM,IAAIoE,GAASpE,CAAM;AACtE;AC9BA,IAAIqE,KAAe,oDACfC,KAAgB;AAUpB,SAASC,GAAMvR,GAAOgN,GAAQ;AAC5B,MAAI1C,EAAQtK,CAAK;AACf,WAAO;AAET,MAAIiD,IAAO,OAAOjD;AAClB,SAAIiD,KAAQ,YAAYA,KAAQ,YAAYA,KAAQ,aAChDjD,KAAS,QAAQiK,GAASjK,CAAK,IAC1B,KAEFsR,GAAc,KAAKtR,CAAK,KAAK,CAACqR,GAAa,KAAKrR,CAAK,KACzDgN,KAAU,QAAQhN,KAAS,OAAOgN,CAAM;AAC7C;ACvBA,IAAIwE,KAAevE,EAAU,QAAQ,QAAQ;ACM7C,SAASwE,KAAY;AACnB,OAAK,WAAWD,KAAeA,GAAa,IAAI,IAAI,CAAA,GACpD,KAAK,OAAO;AACd;ACFA,SAASE,GAAWtS,GAAK;AACvB,MAAIkG,IAAS,KAAK,IAAIlG,CAAG,KAAK,OAAO,KAAK,SAASA,CAAG;AACtD,cAAK,QAAQkG,IAAS,IAAI,GACnBA;AACT;ACXA,IAAIqM,KAAiB,6BAGjBxI,KAAc,OAAO,WAGrBC,KAAiBD,GAAY;AAWjC,SAASyI,GAAQxS,GAAK;AACpB,MAAIyS,IAAO,KAAK;AAChB,MAAIL,IAAc;AAChB,QAAIlM,IAASuM,EAAKzS,CAAG;AACrB,WAAOkG,MAAWqM,KAAiB,SAAYrM;AAAA,EACjD;AACA,SAAO8D,GAAe,KAAKyI,GAAMzS,CAAG,IAAIyS,EAAKzS,CAAG,IAAI;AACtD;ACxBA,IAAI+J,KAAc,OAAO,WAGrBC,KAAiBD,GAAY;AAWjC,SAAS2I,GAAQ1S,GAAK;AACpB,MAAIyS,IAAO,KAAK;AAChB,SAAOL,KAAgBK,EAAKzS,CAAG,MAAM,SAAagK,GAAe,KAAKyI,GAAMzS,CAAG;AACjF;ACjBA,IAAIuS,KAAiB;AAYrB,SAASI,GAAQ3S,GAAKY,GAAO;AAC3B,MAAI6R,IAAO,KAAK;AAChB,cAAK,QAAQ,KAAK,IAAIzS,CAAG,IAAI,IAAI,GACjCyS,EAAKzS,CAAG,IAAKoS,MAAgBxR,MAAU,SAAa2R,KAAiB3R,GAC9D;AACT;ACPA,SAASgS,EAAKC,GAAS;AACrB,MAAIzQ,IAAQ,IACR6I,IAAS4H,KAAW,OAAO,IAAIA,EAAQ;AAG3C,OADA,KAAK,MAAK,GACH,EAAEzQ,IAAQ6I,KAAQ;AACvB,QAAInH,IAAQ+O,EAAQzQ,CAAK;AACzB,SAAK,IAAI0B,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGA8O,EAAK,UAAU,QAAQP;AACvBO,EAAK,UAAU,SAAYN;AAC3BM,EAAK,UAAU,MAAMJ;AACrBI,EAAK,UAAU,MAAMF;AACrBE,EAAK,UAAU,MAAMD;ACtBrB,SAASG,KAAiB;AACxB,OAAK,WAAW,CAAA,GAChB,KAAK,OAAO;AACd;ACAA,SAASC,GAAahI,GAAO/K,GAAK;AAEhC,WADIiL,IAASF,EAAM,QACZE;AACL,QAAIqD,GAAGvD,EAAME,CAAM,EAAE,CAAC,GAAGjL,CAAG;AAC1B,aAAOiL;AAGX,SAAO;AACT;ACfA,IAAI+H,KAAa,MAAM,WAGnBC,KAASD,GAAW;AAWxB,SAASE,GAAgBlT,GAAK;AAC5B,MAAIyS,IAAO,KAAK,UACZrQ,IAAQ2Q,GAAaN,GAAMzS,CAAG;AAElC,MAAIoC,IAAQ;AACV,WAAO;AAET,MAAI+Q,IAAYV,EAAK,SAAS;AAC9B,SAAIrQ,KAAS+Q,IACXV,EAAK,IAAG,IAERQ,GAAO,KAAKR,GAAMrQ,GAAO,CAAC,GAE5B,EAAE,KAAK,MACA;AACT;ACrBA,SAASgR,GAAapT,GAAK;AACzB,MAAIyS,IAAO,KAAK,UACZrQ,IAAQ2Q,GAAaN,GAAMzS,CAAG;AAElC,SAAOoC,IAAQ,IAAI,SAAYqQ,EAAKrQ,CAAK,EAAE,CAAC;AAC9C;ACLA,SAASiR,GAAarT,GAAK;AACzB,SAAO+S,GAAa,KAAK,UAAU/S,CAAG,IAAI;AAC5C;ACDA,SAASsT,GAAatT,GAAKY,GAAO;AAChC,MAAI6R,IAAO,KAAK,UACZrQ,IAAQ2Q,GAAaN,GAAMzS,CAAG;AAElC,SAAIoC,IAAQ,KACV,EAAE,KAAK,MACPqQ,EAAK,KAAK,CAACzS,GAAKY,CAAK,CAAC,KAEtB6R,EAAKrQ,CAAK,EAAE,CAAC,IAAIxB,GAEZ;AACT;ACVA,SAAS2S,EAAUV,GAAS;AAC1B,MAAIzQ,IAAQ,IACR6I,IAAS4H,KAAW,OAAO,IAAIA,EAAQ;AAG3C,OADA,KAAK,MAAK,GACH,EAAEzQ,IAAQ6I,KAAQ;AACvB,QAAInH,IAAQ+O,EAAQzQ,CAAK;AACzB,SAAK,IAAI0B,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGAyP,EAAU,UAAU,QAAQT;AAC5BS,EAAU,UAAU,SAAYL;AAChCK,EAAU,UAAU,MAAMH;AAC1BG,EAAU,UAAU,MAAMF;AAC1BE,EAAU,UAAU,MAAMD;ACzB1B,IAAIE,KAAM3F,EAAUhE,GAAM,KAAK;ACO/B,SAAS4J,KAAgB;AACvB,OAAK,OAAO,GACZ,KAAK,WAAW;AAAA,IACd,MAAQ,IAAIb;AAAA,IACZ,KAAO,KAAKY,MAAOD;AAAA,IACnB,QAAU,IAAIX;AAAA,EAClB;AACA;ACXA,SAASc,GAAU9S,GAAO;AACxB,MAAIiD,IAAO,OAAOjD;AAClB,SAAQiD,KAAQ,YAAYA,KAAQ,YAAYA,KAAQ,YAAYA,KAAQ,YACvEjD,MAAU,cACVA,MAAU;AACjB;ACFA,SAAS+S,GAAWC,GAAK5T,GAAK;AAC5B,MAAIyS,IAAOmB,EAAI;AACf,SAAOF,GAAU1T,CAAG,IAChByS,EAAK,OAAOzS,KAAO,WAAW,WAAW,MAAM,IAC/CyS,EAAK;AACX;ACJA,SAASoB,GAAe7T,GAAK;AAC3B,MAAIkG,IAASyN,GAAW,MAAM3T,CAAG,EAAE,OAAUA,CAAG;AAChD,cAAK,QAAQkG,IAAS,IAAI,GACnBA;AACT;ACJA,SAAS4N,GAAY9T,GAAK;AACxB,SAAO2T,GAAW,MAAM3T,CAAG,EAAE,IAAIA,CAAG;AACtC;ACFA,SAAS+T,GAAY/T,GAAK;AACxB,SAAO2T,GAAW,MAAM3T,CAAG,EAAE,IAAIA,CAAG;AACtC;ACDA,SAASgU,GAAYhU,GAAKY,GAAO;AAC/B,MAAI6R,IAAOkB,GAAW,MAAM3T,CAAG,GAC3BiU,IAAOxB,EAAK;AAEhB,SAAAA,EAAK,IAAIzS,GAAKY,CAAK,GACnB,KAAK,QAAQ6R,EAAK,QAAQwB,IAAO,IAAI,GAC9B;AACT;ACNA,SAASC,EAASrB,GAAS;AACzB,MAAIzQ,IAAQ,IACR6I,IAAS4H,KAAW,OAAO,IAAIA,EAAQ;AAG3C,OADA,KAAK,MAAK,GACH,EAAEzQ,IAAQ6I,KAAQ;AACvB,QAAInH,IAAQ+O,EAAQzQ,CAAK;AACzB,SAAK,IAAI0B,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGAoQ,EAAS,UAAU,QAAQT;AAC3BS,EAAS,UAAU,SAAYL;AAC/BK,EAAS,UAAU,MAAMJ;AACzBI,EAAS,UAAU,MAAMH;AACzBG,EAAS,UAAU,MAAMF;AC1BzB,IAAIG,KAAkB;AA8CtB,SAASC,GAAQjH,GAAMkH,GAAU;AAC/B,MAAI,OAAOlH,KAAQ,cAAekH,KAAY,QAAQ,OAAOA,KAAY;AACvE,UAAM,IAAI,UAAUF,EAAe;AAErC,MAAIG,IAAW,WAAW;AACxB,QAAIvL,IAAO,WACP/I,IAAMqU,IAAWA,EAAS,MAAM,MAAMtL,CAAI,IAAIA,EAAK,CAAC,GACpDwL,IAAQD,EAAS;AAErB,QAAIC,EAAM,IAAIvU,CAAG;AACf,aAAOuU,EAAM,IAAIvU,CAAG;AAEtB,QAAIkG,IAASiH,EAAK,MAAM,MAAMpE,CAAI;AAClC,WAAAuL,EAAS,QAAQC,EAAM,IAAIvU,GAAKkG,CAAM,KAAKqO,GACpCrO;AAAA,EACT;AACA,SAAAoO,EAAS,QAAQ,KAAKF,GAAQ,SAASF,MAChCI;AACT;AAGAF,GAAQ,QAAQF;ACnEhB,IAAIM,KAAmB;AAUvB,SAASC,GAActH,GAAM;AAC3B,MAAIjH,IAASkO,GAAQjH,GAAM,SAASnN,GAAK;AACvC,WAAIuU,EAAM,SAASC,MACjBD,EAAM,MAAK,GAENvU;AAAA,EACT,CAAC,GAEGuU,IAAQrO,EAAO;AACnB,SAAOA;AACT;ACpBA,IAAIwO,KAAa,oGAGbC,KAAe,YASfC,KAAeH,GAAc,SAASjJ,GAAQ;AAChD,MAAItF,IAAS,CAAA;AACb,SAAIsF,EAAO,WAAW,CAAC,MAAM,MAC3BtF,EAAO,KAAK,EAAE,GAEhBsF,EAAO,QAAQkJ,IAAY,SAASG,GAAOC,GAAQC,GAAOC,GAAW;AACnE,IAAA9O,EAAO,KAAK6O,IAAQC,EAAU,QAAQL,IAAc,IAAI,IAAKG,KAAUD,CAAM;AAAA,EAC/E,CAAC,GACM3O;AACT,CAAC;ACDD,SAAS+O,GAASrU,GAAO;AACvB,SAAOA,KAAS,OAAO,KAAKyK,GAAazK,CAAK;AAChD;ACZA,SAASsU,GAAStU,GAAOgN,GAAQ;AAC/B,SAAI1C,EAAQtK,CAAK,IACRA,IAEFuR,GAAMvR,GAAOgN,CAAM,IAAI,CAAChN,CAAK,IAAIgU,GAAaK,GAASrU,CAAK,CAAC;AACtE;ACNA,SAASuU,GAAMvU,GAAO;AACpB,MAAI,OAAOA,KAAS,YAAYiK,GAASjK,CAAK;AAC5C,WAAOA;AAET,MAAIsF,IAAUtF,IAAQ;AACtB,SAAQsF,KAAU,OAAQ,IAAItF,KAAU,SAAa,OAAOsF;AAC9D;ACPA,SAASkP,GAAQxH,GAAQ1M,GAAM;AAC7B,EAAAA,IAAOgU,GAAShU,GAAM0M,CAAM;AAK5B,WAHIxL,IAAQ,GACR6I,IAAS/J,EAAK,QAEX0M,KAAU,QAAQxL,IAAQ6I;AAC/B,IAAA2C,IAASA,EAAOuH,GAAMjU,EAAKkB,GAAO,CAAC,CAAC;AAEtC,SAAQA,KAASA,KAAS6I,IAAU2C,IAAS;AAC/C;ACMA,SAASxM,GAAIwM,GAAQ1M,GAAMmU,GAAc;AACvC,MAAInP,IAAS0H,KAAU,OAAO,SAAYwH,GAAQxH,GAAQ1M,CAAI;AAC9D,SAAOgF,MAAW,SAAYmP,IAAenP;AAC/C;ACtBA,SAASoP,GAAUvK,GAAO5G,GAAQ;AAKhC,WAJI/B,IAAQ,IACR6I,IAAS9G,EAAO,QAChBoR,IAASxK,EAAM,QAEZ,EAAE3I,IAAQ6I;AACf,IAAAF,EAAMwK,IAASnT,CAAK,IAAI+B,EAAO/B,CAAK;AAEtC,SAAO2I;AACT;ACZA,IAAIyK,KAAmB1L,IAASA,EAAO,qBAAqB;AAS5D,SAAS2L,GAAc7U,GAAO;AAC5B,SAAOsK,EAAQtK,CAAK,KAAKqO,GAAYrO,CAAK,KACxC,CAAC,EAAE4U,MAAoB5U,KAASA,EAAM4U,EAAgB;AAC1D;ACHA,SAASE,GAAY3K,GAAO4K,GAAO3H,GAAW4H,GAAU1P,GAAQ;AAC9D,MAAI9D,IAAQ,IACR6I,IAASF,EAAM;AAKnB,OAHAiD,MAAcA,IAAYyH,KAC1BvP,MAAWA,IAAS,KAEb,EAAE9D,IAAQ6I,KAAQ;AACvB,QAAIrK,IAAQmK,EAAM3I,CAAK;AACvB,IAAiB4L,EAAUpN,CAAK,IAK5B0U,GAAUpP,GAAQtF,CAAK,IAGzBsF,EAAOA,EAAO,MAAM,IAAItF;AAAA,EAE5B;AACA,SAAOsF;AACT;AC1BA,SAAS2P,KAAa;AACpB,OAAK,WAAW,IAAItC,KACpB,KAAK,OAAO;AACd;ACHA,SAASuC,GAAY9V,GAAK;AACxB,MAAIyS,IAAO,KAAK,UACZvM,IAASuM,EAAK,OAAUzS,CAAG;AAE/B,cAAK,OAAOyS,EAAK,MACVvM;AACT;ACNA,SAAS6P,GAAS/V,GAAK;AACrB,SAAO,KAAK,SAAS,IAAIA,CAAG;AAC9B;ACFA,SAASgW,GAAShW,GAAK;AACrB,SAAO,KAAK,SAAS,IAAIA,CAAG;AAC9B;ACNA,IAAIiW,KAAmB;AAYvB,SAASC,GAASlW,GAAKY,GAAO;AAC5B,MAAI6R,IAAO,KAAK;AAChB,MAAIA,aAAgBc,GAAW;AAC7B,QAAI4C,IAAQ1D,EAAK;AACjB,QAAI,CAACe,MAAQ2C,EAAM,SAASF,KAAmB;AAC7C,aAAAE,EAAM,KAAK,CAACnW,GAAKY,CAAK,CAAC,GACvB,KAAK,OAAO,EAAE6R,EAAK,MACZ;AAET,IAAAA,IAAO,KAAK,WAAW,IAAIyB,EAASiC,CAAK;AAAA,EAC3C;AACA,SAAA1D,EAAK,IAAIzS,GAAKY,CAAK,GACnB,KAAK,OAAO6R,EAAK,MACV;AACT;ACjBA,SAAS2D,EAAMvD,GAAS;AACtB,MAAIJ,IAAO,KAAK,WAAW,IAAIc,EAAUV,CAAO;AAChD,OAAK,OAAOJ,EAAK;AACnB;AAGA2D,EAAM,UAAU,QAAQP;AACxBO,EAAM,UAAU,SAAYN;AAC5BM,EAAM,UAAU,MAAML;AACtBK,EAAM,UAAU,MAAMJ;AACtBI,EAAM,UAAU,MAAMF;ACftB,SAASG,GAAYtL,GAAOiD,GAAW;AAMrC,WALI5L,IAAQ,IACR6I,IAASF,KAAS,OAAO,IAAIA,EAAM,QACnCuL,IAAW,GACXpQ,IAAS,CAAA,GAEN,EAAE9D,IAAQ6I,KAAQ;AACvB,QAAIrK,IAAQmK,EAAM3I,CAAK;AACvB,IAAI4L,EAAUpN,GAAOwB,GAAO2I,CAAK,MAC/B7E,EAAOoQ,GAAU,IAAI1V;AAAA,EAEzB;AACA,SAAOsF;AACT;ACJA,SAASqQ,KAAY;AACnB,SAAO,CAAA;AACT;AChBA,IAAIxM,KAAc,OAAO,WAGrBiF,KAAuBjF,GAAY,sBAGnCyM,KAAmB,OAAO,uBAS1BC,KAAcD,KAA+B,SAAS5I,GAAQ;AAChE,SAAIA,KAAU,OACL,CAAA,KAETA,IAAS,OAAOA,CAAM,GACfyI,GAAYG,GAAiB5I,CAAM,GAAG,SAAS8I,GAAQ;AAC5D,WAAO1H,GAAqB,KAAKpB,GAAQ8I,CAAM;AAAA,EACjD,CAAC;AACH,IARqCH;ACLrC,SAASI,GAAe/I,GAAQgJ,GAAUC,GAAa;AACrD,MAAI3Q,IAAS0Q,EAAShJ,CAAM;AAC5B,SAAO1C,EAAQ0C,CAAM,IAAI1H,IAASoP,GAAUpP,GAAQ2Q,EAAYjJ,CAAM,CAAC;AACzE;ACNA,SAASkJ,GAAWlJ,GAAQ;AAC1B,SAAO+I,GAAe/I,GAAQpK,IAAMiT,EAAU;AAChD;ACTA,IAAIM,KAAWlJ,EAAUhE,GAAM,UAAU,GCArCmN,KAAUnJ,EAAUhE,GAAM,SAAS,GCAnCoN,KAAMpJ,EAAUhE,GAAM,KAAK,GCK3BgG,KAAS,gBACTE,KAAY,mBACZmH,KAAa,oBACbjH,KAAS,gBACTE,KAAa,oBAEbE,KAAc,qBAGd8G,KAAqB7J,EAASyJ,EAAQ,GACtCK,KAAgB9J,EAASkG,EAAG,GAC5B6D,KAAoB/J,EAAS0J,EAAO,GACpCM,KAAgBhK,EAAS2J,EAAG,GAC5BM,KAAoBjK,EAASQ,EAAO,GASpC0J,IAAS9M;AAAA,CAGRqM,MAAYS,EAAO,IAAIT,GAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK1G,MACxDmD,MAAOgE,EAAO,IAAIhE,IAAG,KAAK3D,MAC1BmH,MAAWQ,EAAOR,GAAQ,QAAO,CAAE,KAAKE,MACxCD,MAAOO,EAAO,IAAIP,IAAG,KAAKhH,MAC1BnC,MAAW0J,EAAO,IAAI1J,IAAO,KAAKqC,QACrCqH,IAAS,SAAS5W,GAAO;AACvB,MAAIsF,IAASwE,EAAW9J,CAAK,GACzB8N,IAAOxI,KAAU6J,KAAYnP,EAAM,cAAc,QACjD6W,IAAa/I,IAAOpB,EAASoB,CAAI,IAAI;AAEzC,MAAI+I;AACF,YAAQA,GAAU;AAAA,MAChB,KAAKN;AAAoB,eAAO9G;AAAAA,MAChC,KAAK+G;AAAe,eAAOvH;AAAAA,MAC3B,KAAKwH;AAAmB,eAAOH;AAAA,MAC/B,KAAKI;AAAe,eAAOrH;AAAAA,MAC3B,KAAKsH;AAAmB,eAAOpH;AAAA,IACvC;AAEI,SAAOjK;AACT;ACnDF,IAAIwR,KAAa7N,EAAK,YCFlB0I,KAAiB;AAYrB,SAASoF,GAAY/W,GAAO;AAC1B,cAAK,SAAS,IAAIA,GAAO2R,EAAc,GAChC;AACT;ACPA,SAASqF,GAAYhX,GAAO;AAC1B,SAAO,KAAK,SAAS,IAAIA,CAAK;AAChC;ACCA,SAASiX,GAAS1T,GAAQ;AACxB,MAAI/B,IAAQ,IACR6I,IAAS9G,KAAU,OAAO,IAAIA,EAAO;AAGzC,OADA,KAAK,WAAW,IAAI+P,KACb,EAAE9R,IAAQ6I;AACf,SAAK,IAAI9G,EAAO/B,CAAK,CAAC;AAE1B;AAGAyV,GAAS,UAAU,MAAMA,GAAS,UAAU,OAAOF;AACnDE,GAAS,UAAU,MAAMD;ACdzB,SAASE,GAAU/M,GAAOiD,GAAW;AAInC,WAHI5L,IAAQ,IACR6I,IAASF,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAE3I,IAAQ6I;AACf,QAAI+C,EAAUjD,EAAM3I,CAAK,GAAGA,GAAO2I,CAAK;AACtC,aAAO;AAGX,SAAO;AACT;ACZA,SAASgN,GAASxD,GAAOvU,GAAK;AAC5B,SAAOuU,EAAM,IAAIvU,CAAG;AACtB;ACLA,IAAIgY,KAAuB,GACvBC,KAAyB;AAe7B,SAASC,GAAYnN,GAAOrE,GAAOyR,GAASC,GAAYC,GAAW9U,GAAO;AACxE,MAAI+U,IAAYH,IAAUH,IACtBO,IAAYxN,EAAM,QAClByN,IAAY9R,EAAM;AAEtB,MAAI6R,KAAaC,KAAa,EAAEF,KAAaE,IAAYD;AACvD,WAAO;AAGT,MAAIE,IAAalV,EAAM,IAAIwH,CAAK,GAC5B2N,IAAanV,EAAM,IAAImD,CAAK;AAChC,MAAI+R,KAAcC;AAChB,WAAOD,KAAc/R,KAASgS,KAAc3N;AAE9C,MAAI3I,IAAQ,IACR8D,IAAS,IACTyS,IAAQR,IAAUF,KAA0B,IAAIJ,OAAW;AAM/D,OAJAtU,EAAM,IAAIwH,GAAOrE,CAAK,GACtBnD,EAAM,IAAImD,GAAOqE,CAAK,GAGf,EAAE3I,IAAQmW,KAAW;AAC1B,QAAIK,IAAW7N,EAAM3I,CAAK,GACtByW,IAAWnS,EAAMtE,CAAK;AAE1B,QAAIgW;AACF,UAAIU,IAAWR,IACXF,EAAWS,GAAUD,GAAUxW,GAAOsE,GAAOqE,GAAOxH,CAAK,IACzD6U,EAAWQ,GAAUC,GAAUzW,GAAO2I,GAAOrE,GAAOnD,CAAK;AAE/D,QAAIuV,MAAa,QAAW;AAC1B,UAAIA;AACF;AAEF,MAAA5S,IAAS;AACT;AAAA,IACF;AAEA,QAAIyS;AACF,UAAI,CAACb,GAAUpR,GAAO,SAASmS,GAAUE,GAAU;AAC7C,YAAI,CAAChB,GAASY,GAAMI,CAAQ,MACvBH,MAAaC,KAAYR,EAAUO,GAAUC,GAAUV,GAASC,GAAY7U,CAAK;AACpF,iBAAOoV,EAAK,KAAKI,CAAQ;AAAA,MAE7B,CAAC,GAAG;AACN,QAAA7S,IAAS;AACT;AAAA,MACF;AAAA,eACS,EACL0S,MAAaC,KACXR,EAAUO,GAAUC,GAAUV,GAASC,GAAY7U,CAAK,IACzD;AACL,MAAA2C,IAAS;AACT;AAAA,IACF;AAAA,EACF;AACA,SAAA3C,EAAM,OAAUwH,CAAK,GACrBxH,EAAM,OAAUmD,CAAK,GACdR;AACT;AC1EA,SAAS8S,GAAWpF,GAAK;AACvB,MAAIxR,IAAQ,IACR8D,IAAS,MAAM0N,EAAI,IAAI;AAE3B,SAAAA,EAAI,QAAQ,SAAShT,GAAOZ,GAAK;AAC/B,IAAAkG,EAAO,EAAE9D,CAAK,IAAI,CAACpC,GAAKY,CAAK;AAAA,EAC/B,CAAC,GACMsF;AACT;ACRA,SAAS+S,GAAWzX,GAAK;AACvB,MAAIY,IAAQ,IACR8D,IAAS,MAAM1E,EAAI,IAAI;AAE3B,SAAAA,EAAI,QAAQ,SAASZ,GAAO;AAC1B,IAAAsF,EAAO,EAAE9D,CAAK,IAAIxB;AAAA,EACpB,CAAC,GACMsF;AACT;ACPA,IAAI8R,KAAuB,GACvBC,KAAyB,GAGzBvI,KAAU,oBACVC,KAAU,iBACVC,KAAW,kBACXC,KAAS,gBACTC,KAAY,mBACZE,KAAY,mBACZC,KAAS,gBACTC,KAAY,mBACZtF,KAAY,mBAEZwF,KAAiB,wBACjBC,KAAc,qBAGdlF,KAAcrB,IAASA,EAAO,YAAY,QAC1CoP,KAAgB/N,KAAcA,GAAY,UAAU;AAmBxD,SAASgO,GAAWvL,GAAQlH,GAAO2D,GAAK8N,GAASC,GAAYC,GAAW9U,GAAO;AAC7E,UAAQ8G,GAAG;AAAA,IACT,KAAKgG;AACH,UAAKzC,EAAO,cAAclH,EAAM,cAC3BkH,EAAO,cAAclH,EAAM;AAC9B,eAAO;AAET,MAAAkH,IAASA,EAAO,QAChBlH,IAAQA,EAAM;AAAA,IAEhB,KAAK0J;AACH,aAAK,EAAAxC,EAAO,cAAclH,EAAM,cAC5B,CAAC2R,EAAU,IAAIX,GAAW9J,CAAM,GAAG,IAAI8J,GAAWhR,CAAK,CAAC;AAAA,IAK9D,KAAKgJ;AAAA,IACL,KAAKC;AAAA,IACL,KAAKG;AAGH,aAAOxB,GAAG,CAACV,GAAQ,CAAClH,CAAK;AAAA,IAE3B,KAAKkJ;AACH,aAAOhC,EAAO,QAAQlH,EAAM,QAAQkH,EAAO,WAAWlH,EAAM;AAAA,IAE9D,KAAKsJ;AAAA,IACL,KAAKE;AAIH,aAAOtC,KAAWlH,IAAQ;AAAA,IAE5B,KAAKmJ;AACH,UAAIuJ,IAAUJ;AAAA,IAEhB,KAAK/I;AACH,UAAIqI,IAAYH,IAAUH;AAG1B,UAFAoB,MAAYA,IAAUH,KAElBrL,EAAO,QAAQlH,EAAM,QAAQ,CAAC4R;AAChC,eAAO;AAGT,UAAIe,IAAU9V,EAAM,IAAIqK,CAAM;AAC9B,UAAIyL;AACF,eAAOA,KAAW3S;AAEpB,MAAAyR,KAAWF,IAGX1U,EAAM,IAAIqK,GAAQlH,CAAK;AACvB,UAAIR,IAASgS,GAAYkB,EAAQxL,CAAM,GAAGwL,EAAQ1S,CAAK,GAAGyR,GAASC,GAAYC,GAAW9U,CAAK;AAC/F,aAAAA,EAAM,OAAUqK,CAAM,GACf1H;AAAA,IAET,KAAK0E;AACH,UAAIsO;AACF,eAAOA,GAAc,KAAKtL,CAAM,KAAKsL,GAAc,KAAKxS,CAAK;AAAA,EAErE;AACE,SAAO;AACT;AC1GA,IAAIsR,KAAuB,GAGvBjO,KAAc,OAAO,WAGrBC,KAAiBD,GAAY;AAejC,SAASuP,GAAa1L,GAAQlH,GAAOyR,GAASC,GAAYC,GAAW9U,GAAO;AAC1E,MAAI+U,IAAYH,IAAUH,IACtBuB,IAAWzC,GAAWlJ,CAAM,GAC5B4L,IAAYD,EAAS,QACrBE,IAAW3C,GAAWpQ,CAAK,GAC3B8R,IAAYiB,EAAS;AAEzB,MAAID,KAAahB,KAAa,CAACF;AAC7B,WAAO;AAGT,WADIlW,IAAQoX,GACLpX,OAAS;AACd,QAAIpC,IAAMuZ,EAASnX,CAAK;AACxB,QAAI,EAAEkW,IAAYtY,KAAO0G,IAAQsD,GAAe,KAAKtD,GAAO1G,CAAG;AAC7D,aAAO;AAAA,EAEX;AAEA,MAAI0Z,IAAanW,EAAM,IAAIqK,CAAM,GAC7B8K,IAAanV,EAAM,IAAImD,CAAK;AAChC,MAAIgT,KAAchB;AAChB,WAAOgB,KAAchT,KAASgS,KAAc9K;AAE9C,MAAI1H,IAAS;AACb,EAAA3C,EAAM,IAAIqK,GAAQlH,CAAK,GACvBnD,EAAM,IAAImD,GAAOkH,CAAM;AAGvB,WADI+L,IAAWrB,GACR,EAAElW,IAAQoX,KAAW;AAC1B,IAAAxZ,IAAMuZ,EAASnX,CAAK;AACpB,QAAIwX,IAAWhM,EAAO5N,CAAG,GACrB6Y,IAAWnS,EAAM1G,CAAG;AAExB,QAAIoY;AACF,UAAIU,IAAWR,IACXF,EAAWS,GAAUe,GAAU5Z,GAAK0G,GAAOkH,GAAQrK,CAAK,IACxD6U,EAAWwB,GAAUf,GAAU7Y,GAAK4N,GAAQlH,GAAOnD,CAAK;AAG9D,QAAI,EAAEuV,MAAa,SACVc,MAAaf,KAAYR,EAAUuB,GAAUf,GAAUV,GAASC,GAAY7U,CAAK,IAClFuV,IACD;AACL,MAAA5S,IAAS;AACT;AAAA,IACF;AACA,IAAAyT,MAAaA,IAAW3Z,KAAO;AAAA,EACjC;AACA,MAAIkG,KAAU,CAACyT,GAAU;AACvB,QAAIE,IAAUjM,EAAO,aACjBkM,IAAUpT,EAAM;AAGpB,IAAImT,KAAWC,KACV,iBAAiBlM,KAAU,iBAAiBlH,KAC7C,EAAE,OAAOmT,KAAW,cAAcA,aAAmBA,KACnD,OAAOC,KAAW,cAAcA,aAAmBA,OACvD5T,IAAS;AAAA,EAEb;AACA,SAAA3C,EAAM,OAAUqK,CAAM,GACtBrK,EAAM,OAAUmD,CAAK,GACdR;AACT;AC7EA,IAAI8R,KAAuB,GAGvBlJ,KAAU,sBACVW,KAAW,kBACXM,KAAY,mBAGZhG,KAAc,OAAO,WAGrBC,KAAiBD,GAAY;AAgBjC,SAASgQ,GAAgBnM,GAAQlH,GAAOyR,GAASC,GAAYC,GAAW9U,GAAO;AAC7E,MAAIyW,IAAW9O,EAAQ0C,CAAM,GACzBqM,IAAW/O,EAAQxE,CAAK,GACxBwT,IAASF,IAAWvK,KAAW+H,EAAO5J,CAAM,GAC5CuM,IAASF,IAAWxK,KAAW+H,EAAO9Q,CAAK;AAE/C,EAAAwT,IAASA,KAAUpL,KAAUiB,KAAYmK,GACzCC,IAASA,KAAUrL,KAAUiB,KAAYoK;AAEzC,MAAIC,IAAWF,KAAUnK,IACrBsK,IAAWF,KAAUpK,IACrBuK,IAAYJ,KAAUC;AAE1B,MAAIG,KAAa9K,GAAS5B,CAAM,GAAG;AACjC,QAAI,CAAC4B,GAAS9I,CAAK;AACjB,aAAO;AAET,IAAAsT,IAAW,IACXI,IAAW;AAAA,EACb;AACA,MAAIE,KAAa,CAACF;AAChB,WAAA7W,MAAUA,IAAQ,IAAI6S,MACd4D,KAAY3I,GAAazD,CAAM,IACnCsK,GAAYtK,GAAQlH,GAAOyR,GAASC,GAAYC,GAAW9U,CAAK,IAChE4V,GAAWvL,GAAQlH,GAAOwT,GAAQ/B,GAASC,GAAYC,GAAW9U,CAAK;AAE7E,MAAI,EAAE4U,IAAUH,KAAuB;AACrC,QAAIuC,IAAeH,KAAYpQ,GAAe,KAAK4D,GAAQ,aAAa,GACpE4M,IAAeH,KAAYrQ,GAAe,KAAKtD,GAAO,aAAa;AAEvE,QAAI6T,KAAgBC,GAAc;AAChC,UAAIC,IAAeF,IAAe3M,EAAO,MAAK,IAAKA,GAC/C8M,IAAeF,IAAe9T,EAAM,MAAK,IAAKA;AAElD,aAAAnD,MAAUA,IAAQ,IAAI6S,MACfiC,EAAUoC,GAAcC,GAAcvC,GAASC,GAAY7U,CAAK;AAAA,IACzE;AAAA,EACF;AACA,SAAK+W,KAGL/W,MAAUA,IAAQ,IAAI6S,MACfkD,GAAa1L,GAAQlH,GAAOyR,GAASC,GAAYC,GAAW9U,CAAK,KAH/D;AAIX;AC/DA,SAASoX,GAAY/Z,GAAO8F,GAAOyR,GAASC,GAAY7U,GAAO;AAC7D,SAAI3C,MAAU8F,IACL,KAEL9F,KAAS,QAAQ8F,KAAS,QAAS,CAACiE,EAAa/J,CAAK,KAAK,CAAC+J,EAAajE,CAAK,IACzE9F,MAAUA,KAAS8F,MAAUA,IAE/BqT,GAAgBnZ,GAAO8F,GAAOyR,GAASC,GAAYuC,IAAapX,CAAK;AAC9E;ACrBA,IAAIyU,KAAuB,GACvBC,KAAyB;AAY7B,SAAS2C,GAAYhN,GAAQnI,GAAQoV,GAAWzC,GAAY;AACvD,MAAChW,IAAQyY,EAAU,QAClB5P,IAAS7I;AAGb,MAAIwL,KAAU;AACZ,WAAO,CAAC3C;AAGV,OADA2C,IAAS,OAAOA,CAAM,GACfxL,OAAS;AACd,QAAIqQ,IAAOoI,EAAUzY,CAAK;AAC1B,QAAqBqQ,EAAK,CAAC,IACnBA,EAAK,CAAC,MAAM7E,EAAO6E,EAAK,CAAC,CAAC,IAC1B,EAAEA,EAAK,CAAC,KAAK7E;AAEnB,aAAO;AAAA,EAEX;AACA,SAAO,EAAExL,IAAQ6I,KAAQ;AACvB,IAAAwH,IAAOoI,EAAUzY,CAAK;AACtB,QAAIpC,IAAMyS,EAAK,CAAC,GACZmH,IAAWhM,EAAO5N,CAAG,GACrB8a,IAAWrI,EAAK,CAAC;AAErB,QAAoBA,EAAK,CAAC;AACxB,UAAImH,MAAa,UAAa,EAAE5Z,KAAO4N;AACrC,eAAO;AAAA,WAEJ;AACL,UAAIrK,IAAQ,IAAI6S,KACtBlQ;AAGM,UAAI,EAAEA,MAAW,SACTyU,GAAYG,GAAUlB,GAAU5B,KAAuBC,IAAwBG,GAAY7U,CAAK,IAChG2C;AAEN,eAAO;AAAA,IAEX;AAAA,EACF;AACA,SAAO;AACT;ACjDA,SAAS6U,GAAmBna,GAAO;AACjC,SAAOA,MAAUA,KAAS,CAAC+K,GAAS/K,CAAK;AAC3C;ACFA,SAASoa,GAAapN,GAAQ;AAI5B,WAHI1H,IAAS1C,GAAKoK,CAAM,GACpB3C,IAAS/E,EAAO,QAEb+E,OAAU;AACf,QAAIjL,IAAMkG,EAAO+E,CAAM,GACnBrK,IAAQgN,EAAO5N,CAAG;AAEtB,IAAAkG,EAAO+E,CAAM,IAAI,CAACjL,GAAKY,GAAOma,GAAmBna,CAAK,CAAC;AAAA,EACzD;AACA,SAAOsF;AACT;ACZA,SAAS+U,GAAwBjb,GAAK8a,GAAU;AAC9C,SAAO,SAASlN,GAAQ;AACtB,WAAIA,KAAU,OACL,KAEFA,EAAO5N,CAAG,MAAM8a,MACpBA,MAAa,UAAc9a,KAAO,OAAO4N,CAAM;AAAA,EACpD;AACF;ACNA,SAASsN,GAAYzV,GAAQ;AAC3B,MAAIoV,IAAYG,GAAavV,CAAM;AACnC,SAAIoV,EAAU,UAAU,KAAKA,EAAU,CAAC,EAAE,CAAC,IAClCI,GAAwBJ,EAAU,CAAC,EAAE,CAAC,GAAGA,EAAU,CAAC,EAAE,CAAC,CAAC,IAE1D,SAASjN,GAAQ;AACtB,WAAOA,MAAWnI,KAAUmV,GAAYhN,GAAQnI,GAAQoV,CAAS;AAAA,EACnE;AACF;ACXA,SAASM,GAAUvN,GAAQ5N,GAAK;AAC9B,SAAO4N,KAAU,QAAQ5N,KAAO,OAAO4N,CAAM;AAC/C;ACMA,SAASwN,GAAQxN,GAAQ1M,GAAMma,GAAS;AACtC,EAAAna,IAAOgU,GAAShU,GAAM0M,CAAM;AAM5B,WAJIxL,IAAQ,IACR6I,IAAS/J,EAAK,QACdgF,IAAS,IAEN,EAAE9D,IAAQ6I,KAAQ;AACvB,QAAIjL,IAAMmV,GAAMjU,EAAKkB,CAAK,CAAC;AAC3B,QAAI,EAAE8D,IAAS0H,KAAU,QAAQyN,EAAQzN,GAAQ5N,CAAG;AAClD;AAEF,IAAA4N,IAASA,EAAO5N,CAAG;AAAA,EACrB;AACA,SAAIkG,KAAU,EAAE9D,KAAS6I,IAChB/E,KAET+E,IAAS2C,KAAU,OAAO,IAAIA,EAAO,QAC9B,CAAC,CAAC3C,KAAUsD,GAAStD,CAAM,KAAKoD,GAAQrO,GAAKiL,CAAM,MACvDC,EAAQ0C,CAAM,KAAKqB,GAAYrB,CAAM;AAC1C;ACPA,SAAS0N,GAAM1N,GAAQ1M,GAAM;AAC3B,SAAO0M,KAAU,QAAQwN,GAAQxN,GAAQ1M,GAAMia,EAAS;AAC1D;ACtBA,IAAInD,KAAuB,GACvBC,KAAyB;AAU7B,SAASsD,GAAoBra,GAAM4Z,GAAU;AAC3C,SAAI3I,GAAMjR,CAAI,KAAK6Z,GAAmBD,CAAQ,IACrCG,GAAwB9F,GAAMjU,CAAI,GAAG4Z,CAAQ,IAE/C,SAASlN,GAAQ;AACtB,QAAIgM,IAAWxY,GAAIwM,GAAQ1M,CAAI;AAC/B,WAAQ0Y,MAAa,UAAaA,MAAakB,IAC3CQ,GAAM1N,GAAQ1M,CAAI,IAClByZ,GAAYG,GAAUlB,GAAU5B,KAAuBC,EAAsB;AAAA,EACnF;AACF;ACvBA,SAASuD,GAAaxb,GAAK;AACzB,SAAO,SAAS4N,GAAQ;AACtB,WAAoCA,IAAO5N,CAAG;AAAA,EAChD;AACF;ACFA,SAASyb,GAAiBva,GAAM;AAC9B,SAAO,SAAS0M,GAAQ;AACtB,WAAOwH,GAAQxH,GAAQ1M,CAAI;AAAA,EAC7B;AACF;ACcA,SAASwa,GAASxa,GAAM;AACtB,SAAOiR,GAAMjR,CAAI,IAAIsa,GAAarG,GAAMjU,CAAI,CAAC,IAAIua,GAAiBva,CAAI;AACxE;AChBA,SAASya,GAAa/a,GAAO;AAG3B,SAAI,OAAOA,KAAS,aACXA,IAELA,KAAS,OACJ6L,KAEL,OAAO7L,KAAS,WACXsK,EAAQtK,CAAK,IAChB2a,GAAoB3a,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC,IACtCsa,GAAYta,CAAK,IAEhB8a,GAAS9a,CAAK;AACvB;ACrBA,SAASgb,GAAc1N,GAAW;AAChC,SAAO,SAASN,GAAQ5C,GAAU4L,GAAU;AAM1C,aALIxU,IAAQ,IACRU,IAAW,OAAO8K,CAAM,GACxBiO,IAAQjF,EAAShJ,CAAM,GACvB3C,IAAS4Q,EAAM,QAEZ5Q,OAAU;AACf,UAAIjL,IAAM6b,EAA2B,EAAEzZ,CAAK;AAC5C,UAAI4I,EAASlI,EAAS9C,CAAG,GAAGA,GAAK8C,CAAQ,MAAM;AAC7C;AAAA,IAEJ;AACA,WAAO8K;AAAA,EACT;AACF;ACTA,IAAIkO,KAAUF,GAAa;ACF3B,SAASG,GAAWnO,GAAQ5C,GAAU;AACpC,SAAO4C,KAAUkO,GAAQlO,GAAQ5C,GAAUxH,EAAI;AACjD;ACHA,SAASwY,GAAeC,GAAU/N,GAAW;AAC3C,SAAO,SAASgO,GAAYlR,GAAU;AACpC,QAAIkR,KAAc;AAChB,aAAOA;AAET,QAAI,CAAC1N,GAAY0N,CAAU;AACzB,aAAOD,EAASC,GAAYlR,CAAQ;AAMtC,aAJIC,IAASiR,EAAW,QACpB9Z,IAA6B,IAC7BU,IAAW,OAAOoZ,CAAU,GAEF,EAAE9Z,IAAQ6I,KAClCD,EAASlI,EAASV,CAAK,GAAGA,GAAOU,CAAQ,MAAM;AAAnD;AAIF,WAAOoZ;AAAA,EACT;AACF;AClBA,IAAIC,KAAWH,GAAeD,EAAU;ACGxC,SAASK,GAAKrR,GAAO;AACnB,MAAIE,IAASF,KAAS,OAAO,IAAIA,EAAM;AACvC,SAAOE,IAASF,EAAME,IAAS,CAAC,IAAI;AACtC;ACPA,SAASoR,GAAWtR,GAAOiD,GAAW;AAIpC,WAHI5L,IAAQ,IACR6I,IAASF,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAE3I,IAAQ6I;AACf,QAAI,CAAC+C,EAAUjD,EAAM3I,CAAK,GAAGA,GAAO2I,CAAK;AACvC,aAAO;AAGX,SAAO;AACT;ACTA,SAASuR,GAAUJ,GAAYlO,GAAW;AACxC,MAAI9H,IAAS;AACb,SAAAiW,GAASD,GAAY,SAAStb,GAAOwB,GAAO8Z,GAAY;AACtD,WAAAhW,IAAS,CAAC,CAAC8H,EAAUpN,GAAOwB,GAAO8Z,CAAU,GACtChW;AAAA,EACT,CAAC,GACMA;AACT;AC6BA,SAASqW,GAAML,GAAYlO,GAAWwO,GAAO;AAC3C,MAAIrP,IAAOjC,EAAQgR,CAAU,IAAIG,KAAaC;AAI9C,SAAOnP,EAAK+O,GAAYP,GAAa3N,CAAY,CAAC;AACpD;AC1CA,SAASyO,GAAWC,GAAe;AACjC,SAAO,SAASR,GAAYlO,GAAWC,GAAW;AAChD,QAAInL,IAAW,OAAOoZ,CAAU;AAChC,QAAI,CAAC1N,GAAY0N,CAAU,GAAG;AAC5B,UAAIlR,IAAW2Q,GAAa3N,CAAY;AACxC,MAAAkO,IAAa1Y,GAAK0Y,CAAU,GAC5BlO,IAAY,SAAShO,GAAK;AAAE,eAAOgL,EAASlI,EAAS9C,CAAG,GAAGA,GAAK8C,CAAQ;AAAA,MAAG;AAAA,IAC7E;AACA,QAAIV,IAAQsa,EAAcR,GAAYlO,GAAWC,CAAS;AAC1D,WAAO7L,IAAQ,KAAKU,EAASkI,IAAWkR,EAAW9Z,CAAK,IAAIA,CAAK,IAAI;AAAA,EACvE;AACF;ACjBA,IAAIua,KAAY,KAAK;AAqCrB,SAASC,GAAU7R,GAAOiD,GAAWC,GAAW;AAC9C,MAAIhD,IAASF,KAAS,OAAO,IAAIA,EAAM;AACvC,MAAI,CAACE;AACH,WAAO;AAET,MAAI7I,IAAQ6L,KAAa,OAAO,IAAI1B,GAAU0B,CAAS;AACvD,SAAI7L,IAAQ,MACVA,IAAQua,GAAU1R,IAAS7I,GAAO,CAAC,IAE9B2L,GAAchD,GAAO4Q,GAAa3N,CAAY,GAAG5L,CAAK;AAC/D;ACbA,IAAIya,KAAOJ,GAAWG,EAAS;AC5B/B,SAASE,GAAQZ,GAAYlR,GAAU;AACrC,MAAI5I,IAAQ,IACR8D,IAASsI,GAAY0N,CAAU,IAAI,MAAMA,EAAW,MAAM,IAAI,CAAA;AAElE,SAAAC,GAASD,GAAY,SAAStb,GAAOZ,GAAKkc,GAAY;AACpD,IAAAhW,EAAO,EAAE9D,CAAK,IAAI4I,EAASpK,GAAOZ,GAAKkc,CAAU;AAAA,EACnD,CAAC,GACMhW;AACT;AC4BA,SAAS0N,GAAIsI,GAAYlR,GAAU;AACjC,MAAImC,IAAOjC,EAAQgR,CAAU,IAAIpR,KAAWgS;AAC5C,SAAO3P,EAAK+O,GAAYP,GAAa3Q,CAAW,CAAC;AACnD;AC1BA,SAAS+R,GAAQb,GAAYlR,GAAU;AACrC,SAAO0K,GAAY9B,GAAIsI,GAAYlR,CAAQ,CAAI;AACjD;ACXA,SAASgS,GAAU7G,GAAO;AAKxB,WAJI/T,IAAQ,IACR6I,IAASkL,KAAS,OAAO,IAAIA,EAAM,QACnCjQ,IAAS,CAAA,GAEN,EAAE9D,IAAQ6I,KAAQ;AACvB,QAAIgS,IAAO9G,EAAM/T,CAAK;AACtB,IAAA8D,EAAO+W,EAAK,CAAC,CAAC,IAAIA,EAAK,CAAC;AAAA,EAC1B;AACA,SAAO/W;AACT;ACKA,SAASvE,GAAQf,GAAO8F,GAAO;AAC7B,SAAOiU,GAAY/Z,GAAO8F,CAAK;AACjC;ACpBA,MAAMwW,KAAW,CAAIC,GAAkBC,MAAwC;AAC7E,MAAI,CAACD,EAAI,OAAQ,QAAO,CAACC,CAAI;AAE7B,QAAMC,IAAOjB,GAAKe,CAAG;AAGrB,SAAIE,EAAK,SAAS,YAAYD,EAAK,SAAS,WAAiB,OAEzDC,EAAK,SAAS,YAAYD,EAAK,SAAS,WAAiB,CAAC,EAAE,GAAGC,GAAM,MAAMD,EAAK,MAAM,IAEtFC,EAAK,SAAS,YAAYD,EAAK,SAAS,WAAiB,CAAC,GAAGD,EAAI,MAAM,GAAG,EAAE,GAAGC,CAAI,IAEnFC,EAAK,SAAS,YAAYD,EAAK,SAAS,WAAiB,CAAC,GAAGD,GAAKC,CAAI,IAEnE,CAACA,CAAI;AACd;AAEO,MAAME,GAAa;AAAA,EAChB;AAAA,EACA;AAAA,EACA,mCAAmB,IAAA;AAAA,EACnB,iBAAuD;AAAA,EACvD,mBAA2C;AAAA,EAEnD,YAAYC,GAA4B;AACtC,SAAK,UAAUA,GACf,KAAK,SAAS;AAAA,MACZ,2BAAW,IAAA;AAAA,MACX,8BAAc,IAAA;AAAA,MACd,4BAAY,IAAA;AAAA,MACZ,UAAU;AAAA,MACV,WAAW;AAAA,IAAA;AAAA,EAEf;AAAA,EAEA,QAAQC,GAAyB;AAC/B,SAAK,aAAa,CAACxX,MAAU;AAC3B,YAAMyX,IAAW,CAAC,GAAIzX,EAAM,MAAM,IAAIwX,EAAO,EAAE,KAAK,EAAG,GACjDE,IAAYR,GAASO,GAAUD,CAAM;AAE3C,MAAIE,IACF1X,EAAM,MAAM,IAAIwX,EAAO,IAAIE,CAA+B,IAE1D1X,EAAM,MAAM,OAAOwX,EAAO,EAAE,GAE9BxX,EAAM,OAAO,OAAOwX,EAAO,EAAE;AAAA,IAC/B,CAAC,GACD,KAAK,eAAA;AAAA,EACP;AAAA,EAEA,QAAc;AACZ,SAAK,aAAa,CAACxX,MAAU;AAC3B,MAAAA,EAAM,WAAW;AAAA,IACnB,CAAC,GACD,KAAK,YAAA;AAAA,EACP;AAAA,EAEA,SAAe;AACb,SAAK,aAAa,CAACA,MAAU;AAC3B,MAAAA,EAAM,WAAW;AAAA,IACnB,CAAC,GACG,KAAK,OAAO,MAAM,OAAO,UAAQ,eAAA;AAAA,EACvC;AAAA,EAEA,WAAiB;AACf,UAAM2X,IAAS,KAAK,OAAO;AAC3B,IAAIA,EAAO,SAAS,MAEpB,KAAK,aAAa,CAAC3X,MAAU;AAE3B,iBAAW,CAAC4X,GAAIC,CAAS,KAAKF;AAC5B,QAAK3X,EAAM,MAAM,IAAI4X,CAAE,KACrB5X,EAAM,MAAM,IAAI4X,GAAIC,EAAU,UAAgC;AAGlE,MAAA7X,EAAM,OAAO,MAAA;AAAA,IACf,CAAC,GACD,KAAK,eAAA;AAAA,EACP;AAAA,EAEA,MAAM4X,GAAkB;AACtB,UAAMC,IAAY,KAAK,OAAO,OAAO,IAAID,CAAE;AAC3C,IAAKC,MAEL,KAAK,aAAa,CAAC7X,MAAU;AAE3B,MAAKA,EAAM,MAAM,IAAI4X,CAAE,KACrB5X,EAAM,MAAM,IAAI4X,GAAIC,EAAU,UAAgC,GAEhE7X,EAAM,OAAO,OAAO4X,CAAE;AAAA,IACxB,CAAC,GACD,KAAK,eAAA;AAAA,EACP;AAAA,EAEA,aAAaA,GAAkB;AAC7B,IAAK,KAAK,OAAO,OAAO,IAAIA,CAAE,KAC9B,KAAK,aAAa,CAAC5X,MAAU;AAC3B,YAAMuD,IAAQvD,EAAM,OAAO,IAAI4X,CAAE;AACjC,MAAIrU,QAAa,UAAU;AAAA,IAC7B,CAAC;AAAA,EACH;AAAA,EAEA,WAA8B;AAC5B,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,UAAU7D,GAAkC;AAC1C,gBAAK,aAAa,IAAIA,CAAQ,GACvB,MAAM,KAAK,aAAa,OAAOA,CAAQ;AAAA,EAChD;AAAA,EAEQ,aAAaoY,GAA0D;AAC7E,SAAK,SAASpV,EAAO,KAAK,QAAQoV,CAAO,GACzC,KAAK,aAAa,QAAQ,CAACC,MAAOA,GAAI;AAAA,EACxC;AAAA,EAEQ,iBAAuB;AAC7B,IAAI,KAAK,OAAO,YAAY,KAAK,OAAO,cACxC,KAAK,YAAA,GACL,KAAK,iBAAiB,WAAW,MAAM,KAAK,UAAU,KAAK,QAAQ,QAAQ;AAAA,EAC7E;AAAA,EAEQ,cAAoB;AAC1B,IAAI,KAAK,mBACP,aAAa,KAAK,cAAc,GAChC,KAAK,iBAAiB;AAAA,EAE1B;AAAA,EAEA,MAAc,SAAwB;AACpC,UAAM,EAAE,UAAAC,GAAU,WAAAC,GAAW,OAAAC,EAAA,IAAU,KAAK;AAC5C,QAAIF,KAAYC,KAAaC,EAAM,SAAS,EAAG;AAG/C,SAAK,aAAa,CAAClY,MAAU;AAC3B,MAAAA,EAAM,WAAW,IAAI,IAAIkY,CAAK,GAC9BlY,EAAM,4BAAY,IAAA,GAClBA,EAAM,YAAY;AAAA,IACpB,CAAC;AAED,UAAMmY,IAAUpB,GAAQ,CAAC,GAAG,KAAK,OAAO,SAAS,OAAA,CAAQ,CAAC;AAC1D,SAAK,mBAAmB,IAAI,gBAAA;AAE5B,QAAI;AACF,YAAMqB,IAAU,MAAM,KAAK,QAAQ,OAAOD,GAAS,KAAK,iBAAiB,MAAM;AAC/E,WAAK,gBAAgBnB,GAAUoB,EAAQ,IAAI,CAACC,MAAM,CAACA,EAAE,IAAIA,CAAC,CAAC,CAAC,CAAC;AAAA,IAC/D,SAAS9U,GAAO;AACd,WAAK,aAAaA,CAAK;AAAA,IACzB;AAEA,SAAK,mBAAmB,MACpB,KAAK,OAAO,MAAM,OAAO,KAAK,CAAC,KAAK,OAAO,YAAU,KAAK,eAAA;AAAA,EAChE;AAAA,EAEQ,gBAAgB+U,GAA6C;AACnE,UAAMC,IAAW,KAAK,OAAO,UACvBC,IAA0B,CAAA;AAEhC,SAAK,aAAa,CAACxY,MAAU;AAC3B,iBAAW,CAAC4X,GAAIT,CAAG,KAAKoB;AAGtB,YAFmBhC,GAAMY,GAAK,CAAC/X,MAAOkZ,EAAUlZ,EAAG,EAAE,GAAG,WAAW,SAAS,GAE5D;AACd,UAAAY,EAAM,OAAO,OAAO4X,CAAE;AAGtB,qBAAWxY,KAAM+X,GAAK;AACpB,kBAAMjX,IAASoY,EAAUlZ,EAAG,EAAE;AAC9B,YAAIA,EAAG,SAAS,YAAYc,GAAQ,SAASA,EAAO,UAAUd,EAAG,MAC/DoZ,EAAW,KAAK,EAAE,QAAQpZ,EAAG,IAAI,OAAOc,EAAO,OAAO;AAAA,UAE1D;AAAA,QACF,OAAO;AACL,gBAAMuY,KAAWzY,EAAM,OAAO,IAAI4X,CAAE,GAAG,WAAW,KAAK;AACvD,UAAIa,IAAU,KAAK,QAAQ,cAAc,CAACzY,EAAM,MAAM,IAAI4X,CAAE,KAC1D5X,EAAM,MAAM,IAAI4X,GAAIT,CAAyB;AAE/C,gBAAMuB,IAAS7B,GAAKM,GAAK,CAAC/X,MAAOkZ,EAAUlZ,EAAG,EAAE,GAAG,WAAW,SAAS;AACvE,UAAAY,EAAM,OAAO,IAAI4X,GAAI;AAAA,YACnB,OAAOU,EAAUI,GAAQ,MAAM,EAAE,GAAG,SAAS;AAAA,YAC7C,SAAAD;AAAA,YACA,YAAYtB;AAAA,UAAA,CACb;AAAA,QACH;AAEF,MAAAnX,EAAM,+BAAe,IAAA,GACrBA,EAAM,YAAY;AAAA,IACpB,CAAC,GAGGwY,EAAW,SAAS,KAAK,KAAK,QAAQ,aACxC,KAAK,QAAQ,UAAUA,CAAU;AAAA,EAErC;AAAA,EAEQ,aAAajV,GAAsB;AACzC,UAAMgV,IAAW,KAAK,OAAO,UACvBI,IAAY,KAAK,kBAAkB,OAAO,SAC1CC,IAAWrV,aAAiB,QAAQA,EAAM,UAAU,OAAOA,CAAK;AAEtE,SAAK,aAAa,CAACvD,MAAU;AAC3B,iBAAW,CAAC4X,GAAIT,CAAG,KAAKoB;AACtB,YAAII;AACF,UAAK3Y,EAAM,MAAM,IAAI4X,CAAE,KAAG5X,EAAM,MAAM,IAAI4X,GAAIT,CAAyB;AAAA,aAClE;AACL,gBAAMsB,KAAWzY,EAAM,OAAO,IAAI4X,CAAE,GAAG,WAAW,KAAK;AACvD,UAAIa,IAAU,KAAK,QAAQ,cAAc,CAACzY,EAAM,MAAM,IAAI4X,CAAE,KAC1D5X,EAAM,MAAM,IAAI4X,GAAIT,CAAyB,GAE/CnX,EAAM,OAAO,IAAI4X,GAAI;AAAA,YACnB,OAAOgB;AAAA,YACP,SAAAH;AAAA,YACA,YAAYtB;AAAA,UAAA,CACb;AAAA,QACH;AAEF,MAAAnX,EAAM,+BAAe,IAAA,GACrBA,EAAM,YAAY;AAAA,IACpB,CAAC;AAAA,EACH;AACF;ACtOO,MAAM6Y,GAAS;AAAA,EACZ,6BAAa,IAAA;AAAA,EACb;AAAA,EACA;AAAA,EAER,YAAYC,GAAkBC,GAAa;AACzC,SAAK,YAAYD,GACjB,KAAK,OAAOC;AAAA,EACd;AAAA,EAEA,IAAI/e,GAAuB;AACzB,UAAM8D,IAAQ,KAAK,OAAO,IAAI9D,CAAG;AACjC,WAAK8D,IAED,KAAK,IAAA,IAAQA,EAAM,KAAK,KAAK,QAC/B,KAAK,OAAO,OAAO9D,CAAG,GACf,SAIT,KAAK,OAAO,OAAOA,CAAG,GACtB,KAAK,OAAO,IAAIA,GAAK8D,CAAK,GACnBA,EAAM,QAVM;AAAA,EAWrB;AAAA,EAEA,IAAI9D,GAAaY,GAAgB;AAC/B,QAAI,KAAK,OAAO,IAAIZ,CAAG;AACrB,WAAK,OAAO,OAAOA,CAAG;AAAA,aACb,KAAK,OAAO,QAAQ,KAAK,WAAW;AAC7C,YAAMgf,IAAW,KAAK,OAAO,KAAA,EAAO,OAAO;AAC3C,MAAIA,MAAa,UAAW,KAAK,OAAO,OAAOA,CAAQ;AAAA,IACzD;AAEA,SAAK,OAAO,IAAIhf,GAAK,EAAE,MAAMY,GAAO,IAAI,KAAK,IAAA,GAAO;AAAA,EACtD;AAAA,EAEA,WAAWZ,GAAmB;AAC5B,SAAK,OAAO,OAAOA,CAAG;AAAA,EACxB;AAAA,EAEA,QAAc;AACZ,SAAK,OAAO,MAAA;AAAA,EACd;AAAA,EAEA,IAAIA,GAAsB;AACxB,WAAO,KAAK,IAAIA,CAAG,MAAM;AAAA,EAC3B;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK,OAAO;AAAA,EACrB;AACF;AClCO,MAAMif,GAAmB;AAAA,EACtB;AAAA,EACA;AAAA,EACA,SAA+B,EAAE,QAAQ,QAAQ,OAAO,CAAA,EAAC;AAAA,EACzD,mCAAmB,IAAA;AAAA,EACnB,mBAA2C;AAAA,EAC3C,kBAA4B;AAAA,EAEpC,YAAY1B,GAAkC;AAC5C,SAAK,UAAU,EAAE,SAAS,GAAG,GAAGA,EAAA,GAChC,KAAK,SAAS,IAAIsB,GAAWtB,EAAO,eAAeA,EAAO,QAAQ;AAAA,EACpE;AAAA,EAEQ,eAAe,CAAC2B,MAAuB,KAAK,UAAU,CAAC,KAAK,QAAQ,IAAIA,CAAO,CAAC;AAAA,EAEhF,UAAUC,GAA4C;AAC5D,SAAK,SAASzW,EAAO,KAAK,QAAQ,CAAC1C,MAAU;AAC3C,aAAO,OAAOA,GAAOmZ,CAAK;AAAA,IAC5B,CAAC,GACD,KAAK,aAAa,QAAQ,CAACpB,MAAOA,GAAI;AAAA,EACxC;AAAA,EAEA,MAAc,gBAAgBmB,GAAYE,GAAmC;AAC3E,UAAMC,IAAa,KAAK,QAAQ;AAChC,QAAIC;AAEJ,aAASC,IAAU,GAAGA,KAAWF,GAAYE,KAAW;AACtD,UAAIH,EAAO,QAAS,OAAM,IAAI,aAAa,WAAW,YAAY;AAElE,UAAI;AACF,eAAIG,IAAU,KAAG,KAAK,UAAU,EAAE,YAAYA,GAAS,GAChD,MAAM,KAAK,QAAQ,QAAQL,GAASE,CAAM;AAAA,MACnD,SAAS7V,GAAO;AAEd,YADA+V,IAAY/V,GACR6V,EAAO,WAAWG,MAAYF,EAAY,OAAM9V;AAAA,MACtD;AAAA,IACF;AAEA,UAAM+V;AAAA,EACR;AAAA,EAEA,MAAM,MAAMJ,GAA0B;AACpC,UAAMM,IAAW,KAAK,aAAaN,CAAO,GACpCO,IAAS,KAAK,OAAO,IAAID,CAAQ;AAEvC,QAAIC,MAAW;AACb,kBAAK,kBAAkBP,GACvB,KAAK,UAAU,EAAE,QAAQ,QAAQ,OAAOO,GAAQ,OAAO,QAAW,YAAY,OAAA,CAAW,GAClFA;AAGT,SAAK,kBAAkB,MAAM,2BAA2B;AACxD,UAAMC,IAAkB,IAAI,gBAAA;AAC5B,SAAK,mBAAmBA,GACxB,KAAK,kBAAkBR,GACvB,KAAK,UAAU,EAAE,QAAQ,YAAY,OAAO,QAAW,YAAY,QAAW;AAE9E,QAAI;AACF,YAAMS,IAAQ,MAAM,KAAK,gBAAgBT,GAASQ,EAAgB,MAAM;AACxE,kBAAK,OAAO,IAAIF,GAAUG,CAAK,GAC/B,KAAK,mBAAmB,MACxB,KAAK,UAAU,EAAE,QAAQ,QAAQ,OAAAA,GAAO,OAAO,QAAW,YAAY,OAAA,CAAW,GAC1EA;AAAA,IACT,SAASpW,GAAO;AAEd,UAAImW,EAAgB,OAAO,QAAS,QAAO,KAAK,OAAO;AAEvD,iBAAK,mBAAmB,MACxB,KAAK,UAAU;AAAA,QACb,QAAQ;AAAA,QACR,OAAOnW,aAAiB,QAAQA,EAAM,UAAU,OAAOA,CAAK;AAAA,MAAA,CAC7D,GACKA;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAM,QAAQ2V,GAA2B;AACvC,UAAMU,IAAMV,KAAW,KAAK;AAC5B,QAAI,CAACU,EAAK,OAAM,IAAI,MAAM,iCAAiC;AAE3D,gBAAK,OAAO,WAAW,KAAK,aAAaA,CAAG,CAAC,GACtC,KAAK,MAAMA,CAAG;AAAA,EACvB;AAAA,EAEA,kBAAwB;AACtB,SAAK,OAAO,MAAA;AAAA,EACd;AAAA,EAEA,0BAA0BV,GAAkB;AAC1C,SAAK,OAAO,WAAW,KAAK,aAAaA,CAAO,CAAC;AAAA,EACnD;AAAA,EAEA,WAAW,MAA4B,KAAK;AAAA,EAC5C,aAAa,MAAgB,KAAK;AAAA,EAClC,aAAa,MAAe,KAAK,OAAO,WAAW;AAAA,EAEnD,UAAUxZ,GAAkC;AAC1C,gBAAK,aAAa,IAAIA,CAAQ,GACvB,MAAM;AACX,WAAK,aAAa,OAAOA,CAAQ;AAAA,IACnC;AAAA,EACF;AACF;ACpHO,MAAMma,GAAqB;AAAA,EACxB;AAAA,EACA;AAAA,EACA,gBAA4B;AAAA,EAEpC,YAAY3D,GAA8B0B,GAAY;AACpD,SAAK,cAAc1B,GACnB,KAAK,MAAM0B;AAAA,EACb;AAAA,EAEA,IAAI,KAAa;AACf,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,OAAsB;AACxB,WAAO,KAAK,YAAY,SAAA,EAAW,MAAM,IAAI,KAAK,GAAG;AAAA,EACvD;AAAA,EAEA,OAAO5U,GAAyC;AAC9C,SAAK,YAAY,OAAO,KAAK,KAAKA,CAAM;AAAA,EAC1C;AAAA,EAEA,SAAe;AACb,SAAK,YAAY,OAAO,KAAK,GAAG;AAAA,EAClC;AAAA,EAEA,YAAwB;AACtB,UAAM8W,IAAY,KAAK,YAAY,cAAc,KAAK,GAAG;AACzD,WAAKne,GAAQ,KAAK,eAAeme,CAAS,MACxC,KAAK,gBAAgBA,IAEhB,KAAK;AAAA,EACd;AAAA,EAEA,SAAkB;AAChB,WAAO,KAAK,YAAY,SAAA,EAAW,MAAM,IAAI,KAAK,GAAG;AAAA,EACvD;AAAA;AAAA,EAGA,IAAI,aAA+B;AACjC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA,EAIA,UAAUC,GAAqB;AAC7B,SAAK,MAAMA;AAAA,EACb;AACF;AC1BO,MAAMC,EAAiB;AAAA;AAAA,EAE5B,OAAe,SAAS,oBAAI,IAAA;AAAA;AAAA,EAG5B,OAAO,IAAUzC,GAAwC;AACvD,UAAME,IAAWuC,EAAW,OAAO,IAAIzC,EAAO,EAAE;AAChD,QAAIE;AACF,aAAOA;AAET,UAAMvB,IAAa,IAAI8D,EAAWzC,CAAM;AACxC,WAAAyC,EAAW,OAAO,IAAIzC,EAAO,IAAIrB,CAA0C,GACpEA;AAAA,EACT;AAAA;AAAA,EAGA,OAAO,MAAM0B,GAAkB;AAC7B,IAAAoC,EAAW,OAAO,OAAOpC,CAAE;AAAA,EAC7B;AAAA;AAAA,EAGA,OAAO,WAAiB;AACtB,IAAAoC,EAAW,OAAO,MAAA;AAAA,EACpB;AAAA,EAES;AAAA,EACA;AAAA,EAED;AAAA,EACA;AAAA,EACA;AAAA,EACA,iCAA0C,IAAA;AAAA,EAC1C,mCAAoC,IAAA;AAAA,EACpC,kBAAkB;AAAA,EAClB,aAAa;AAAA,EAErB,YAAYzC,GAAsB;AAChC,SAAK,KAAKA,EAAO,IACjB,KAAK,SAASA;AAId,UAAM0C,IAAgB,OAAO9B,MAC3BA,EAAQ,IAAI,CAAC+B,OAAO,EAAE,IAAIA,EAAE,IAAI,QAAQ,YAAqB;AAE/D,SAAK,aAAa,IAAI5C,GAAa;AAAA,MACjC,UAAUC,EAAO,gBAAgB;AAAA,MACjC,YAAYA,EAAO,eAAe;AAAA,MAClC,QAAQA,EAAO,UAAU0C;AAAA,MACzB,WAAW,CAACE,MAAa,KAAK,eAAeA,CAAQ;AAAA,IAAA,CACtD,GAGD,KAAK,gBAAgB,IAAIlB,GAAmB;AAAA,MAC1C,IAAI1B,EAAO;AAAA,MACX,eAAeA,EAAO,iBAAiB;AAAA,MACvC,UAAUA,EAAO,YAAY;AAAA,MAC7B,SAASA,EAAO,gBAAgB;AAAA,MAChC,SAASA,EAAO;AAAA,IAAA,CACjB;AAGD,UAAM6C,IAAiB,KAAK,WAAW,SAAA,GACjCC,IAAa,KAAK,cAAc,SAAA;AACtC,SAAK,SAAS;AAAA,MACZ,SAAS9C,EAAO;AAAA,MAChB,2BAAW,IAAA;AAAA,MACX,WAAW;AAAA,MACX,SAAS;AAAA,MACT,SAAS;AAAA,MACT,WAAW6C;AAAA,MACX,aAAaC,EAAW;AAAA,MACxB,YAAYA,EAAW;AAAA,IAAA,GAIzB,KAAK,WAAW,UAAU,MAAM;AAC9B,WAAK,mBAAA;AAAA,IACP,CAAC,GAGD,KAAK,cAAc,UAAU,MAAM;AACjC,WAAK,eAAA;AAAA,IACP,CAAC,GAGD,KAAK,cAAA;AAAA,EACP;AAAA;AAAA,EAGA,IAAI,UAAa;AACf,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA,EAEA,IAAI,QAAwB;AAC1B,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA,EAEA,IAAI,UAAmB;AACrB,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA,EAEA,IAAI,UAAmB;AACrB,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA,EAEA,IAAI,YAA+B;AACjC,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA,EAGA,UAAU3a,GAAkC;AAC1C,gBAAK,aAAa,IAAIA,CAAQ,GACvB,MAAM;AACX,WAAK,aAAa,OAAOA,CAAQ;AAAA,IACnC;AAAA,EACF;AAAA;AAAA,EAGA,WAAkC;AAChC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,cAAckY,GAAwB;AACpC,UAAM,EAAE,OAAAM,GAAO,UAAAK,GAAU,QAAAZ,EAAA,IAAW,KAAK,OAAO,WAE1C2C,IAAkB/B,EAAS,IAAIX,CAAE;AACvC,QAAI0C,KAAmBA,EAAgB,SAAS;AAG9C,aAAO;AAAA,QACL,MAFiBA,EAAgBA,EAAgB,SAAS,CAAC,EAE1C;AAAA,QACjB,QAAQ;AAAA,QACR,SAAS3C,EAAO,IAAIC,CAAE,GAAG,WAAW;AAAA,MAAA;AAIxC,UAAM2C,IAAgBrC,EAAM,IAAIN,CAAE;AAClC,QAAI2C,KAAiBA,EAAc,SAAS,GAAG;AAE7C,YAAMC,IAAaD,EAAcA,EAAc,SAAS,CAAC,GACnD1C,IAAYF,EAAO,IAAIC,CAAE;AAC/B,aAAO;AAAA,QACL,MAAM4C,EAAW;AAAA,QACjB,QAAQ3C,IAAY,UAAU;AAAA,QAC9B,SAASA,GAAW,WAAW;AAAA,QAC/B,OAAOA,GAAW;AAAA,MAAA;AAAA,IAEtB;AAEA,UAAMA,IAAYF,EAAO,IAAIC,CAAE;AAC/B,WAAIC,IACK;AAAA,MACL,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,SAASA,EAAU;AAAA,MACnB,OAAOA,EAAU;AAAA,IAAA,IAId;AAAA,EACT;AAAA;AAAA,EAGA,OAAO3b,GAAe;AACpB,UAAM0b,IAAK,KAAK,OAAO,MAAM1b,CAAI;AAEjC,SAAK,SAASwG,EAAO,KAAK,QAAQ,CAAC1C,MAAU;AAC3C,MAAAA,EAAM,MAAM,IAAI4X,GAAI1b,CAAgB;AAAA,IACtC,CAAC,GAED,KAAK,cAAc,gBAAA,GACnB,KAAK,mBAAA,GACL,KAAK,WAAW,QAAQ,EAAE,IAAA0b,GAAI,MAAM,UAAU,MAAM1b,GAAM;AAAA,EAC5D;AAAA;AAAA,EAGA,OAAO0b,GAAY5U,GAAyC;AAC1D,UAAMyX,IAAc,KAAK,OAAO,MAAM,IAAI7C,CAAE;AAC5C,QAAI,CAAC6C,EAAa;AAElB,UAAMC,IAAUhY,EAAO+X,GAAazX,CAAM;AAE1C,SAAK,SAASN,EAAO,KAAK,QAAQ,CAAC1C,MAAU;AAC3C,MAAAA,EAAM,MAAM,IAAI4X,GAAI8C,CAAmB;AAAA,IACzC,CAAC,GAED,KAAK,cAAc,gBAAA,GACnB,KAAK,mBAAA,GACL,KAAK,WAAW,QAAQ,EAAE,IAAA9C,GAAI,MAAM,UAAU,MAAM8C,GAAS;AAAA,EAC/D;AAAA;AAAA,EAGA,OAAO9C,GAAkB;AACvB,UAAM1b,IAAO,KAAK,OAAO,MAAM,IAAI0b,CAAE;AACrC,IAAK1b,MAEL,KAAK,SAASwG,EAAO,KAAK,QAAQ,CAAC1C,MAAU;AAC3C,MAAAA,EAAM,MAAM,OAAO4X,CAAE;AAAA,IACvB,CAAC,GAED,KAAK,WAAW,OAAOA,CAAE,GACzB,KAAK,cAAc,gBAAA,GACnB,KAAK,mBAAA,GAEL,KAAK,WAAW,QAAQ,EAAE,IAAAA,GAAI,MAAM,UAAU,MAAM1b,GAAM;AAAA,EAC5D;AAAA;AAAA,EAGA,QAAQ0b,GAAwB;AAC9B,QAAI1b,IAAO,KAAK,WAAW,IAAI0b,CAAE;AACjC,WAAK1b,MACHA,IAAO,IAAI2d,GAAK,MAAMjC,CAAE,GACxB,KAAK,WAAW,IAAIA,GAAI1b,CAAI,IAEvBA;AAAA,EACT;AAAA;AAAA,EAGA,WAAWye,GAAgC;AACzC,UAAMC,IAAa,KAAK,OAAO,SACzBC,IAAanY,EAAOkY,GAAYD,CAAY;AAElD,IAAIC,MAAeC,MACjB,KAAK,SAASnY,EAAO,KAAK,QAAQ,CAAC1C,MAAU;AAC3C,MAAAA,EAAM,UAAU6a;AAAA,IAClB,CAAC,GAED,KAAK,cAAc,MAAMA,CAAU,GACnC,KAAK,mBAAA;AAAA,EAET;AAAA;AAAA,EAGA,MAAM,UAAyB;AAC7B,SAAK,cAAc,gBAAA,GACnB,MAAM,KAAK,cAAc,MAAM,KAAK,OAAO,OAAO;AAAA,EACpD;AAAA;AAAA,EAGA,YAAkB;AAChB,SAAK,WAAW,MAAA;AAAA,EAClB;AAAA,EAEA,aAAmB;AACjB,SAAK,WAAW,OAAA,GAEhB,KAAK,cAAc,gBAAA,GACnB,KAAK,cAAc,MAAM,KAAK,OAAO,OAAO;AAAA,EAC9C;AAAA,EAEA,UAAUjD,GAAmB;AAC3B,IAAIA,IACF,KAAK,WAAW,MAAMA,CAAE,IAExB,KAAK,WAAW,SAAA;AAAA,EAEpB;AAAA;AAAA,EAGA,MAAc,gBAA+B;AAC3C,IAAI,KAAK,oBACT,KAAK,kBAAkB,IACvB,MAAM,KAAK,cAAc,MAAM,KAAK,OAAO,OAAO;AAAA,EACpD;AAAA,EAEQ,qBAA2B;AACjC,UAAMkD,IAAY,KAAK,WAAW,SAAA;AAClC,SAAK,iBAAiBA,CAAS;AAAA,EACjC;AAAA,EAEQ,iBAAuB;AAC7B,UAAMT,IAAa,KAAK,cAAc,SAAA;AAGtC,SAAK,SAAS3X,EAAO,KAAK,QAAQ,CAAC1C,MAAU;AAC3C,MAAAA,EAAM,cAAcqa,EAAW,QAC/Bra,EAAM,aAAaqa,EAAW,OAC9Bra,EAAM,UAAUqa,EAAW,WAAW,YACtCra,EAAM,YAAY,KAAK,kBAAkBqa,EAAW,QAAQra,EAAM,UAAU,SAAS;AAErF,YAAM,EAAE,OAAAkY,GAAO,UAAAK,EAAA,IAAa,KAAK,OAAO,WAClCwC,wBAAe,IAAA;AAGrB,iBAAW7e,KAAQme,EAAW,OAAO;AACnC,cAAMzC,IAAK,KAAK,OAAO,MAAM1b,CAAI;AACjC,QAAA6e,EAAS,IAAInD,GAAI1b,CAAgB;AAAA,MACnC;AAGA,iBAAW,CAAC0b,GAAIO,CAAO,KAAKD,GAAO;AAEjC,cAAMsC,IAAarC,EAAQA,EAAQ,SAAS,CAAC;AAC7C,SAAIqC,EAAW,SAAS,YAAYA,EAAW,SAAS,aACtDO,EAAS,IAAInD,GAAI4C,EAAW,IAAgB;AAAA,MAEhD;AACA,iBAAW,CAAC5C,GAAIO,CAAO,KAAKI,GAAU;AAEpC,cAAMiC,IAAarC,EAAQA,EAAQ,SAAS,CAAC;AAC7C,SAAIqC,EAAW,SAAS,YAAYA,EAAW,SAAS,aACtDO,EAAS,IAAInD,GAAI4C,EAAW,IAAgB;AAAA,MAEhD;AAEA,MAAAxa,EAAM,QAAQ+a;AAAA,IAChB,CAAC,GAED,KAAK,mBAAA;AAAA,EACP;AAAA,EAEQ,iBAAiBX,GAAyC;AAChE,SAAK,SAAS1X,EAAO,KAAK,QAAQ,CAAC1C,MAAU;AAC3C,MAAAA,EAAM,YAAYoa,GAClBpa,EAAM,UAAUoa,EAAe,WAC/Bpa,EAAM,YAAY,KAAK,kBAAkBA,EAAM,aAAaoa,EAAe,SAAS;AAAA,IACtF,CAAC,GAED,KAAK,mBAAA;AAAA,EACP;AAAA,EAEQ,kBAAkBY,GAAyB/C,GAA+B;AAChF,WAAI+C,MAAgB,aACX,aAEL/C,IACK,YAEF;AAAA,EACT;AAAA,EAEQ,qBAA2B;AACjC,QAAI,MAAK;AACT,iBAAWvY,KAAY,KAAK;AAC1B,QAAAA,EAAA;AAAA,EAEJ;AAAA,EAEQ,eAAeya,GAA6B;AAClD,QAAIA,EAAS,WAAW,EAAG;AAE3B,UAAM,EAAE,OAAAc,MAAU,KAAK;AAEvB,SAAK,SAASvY,EAAO,KAAK,QAAQ,CAAC1C,MAAU;AAC3C,iBAAW,EAAE,QAAAkb,GAAQ,OAAAnB,EAAA,KAAWI,GAAU;AAExC,cAAMje,IAAO8D,EAAM,MAAM,IAAIkb,CAAM;AACnC,YAAIhf,GAAM;AAER,cAAIif;AACJ,UAAIF,IACFE,IAAcF,EAAM/e,GAAW6d,CAAK,KAGnC7d,EAAiC,KAAK6d,GACvCoB,IAAcjf,IAIhB8D,EAAM,MAAM,OAAOkb,CAAM,GACzBlb,EAAM,MAAM,IAAI+Z,GAAOoB,CAAW;AAAA,QACpC;AAAA,MACF;AAAA,IACF,CAAC;AAGD,eAAW,EAAE,QAAAD,GAAQ,OAAAnB,EAAA,KAAWI,GAAU;AACxC,YAAMiB,IAAa,KAAK,WAAW,IAAIF,CAAM;AAC7C,MAAIE,MAEFA,EAAW,UAAUrB,CAAK,GAE1B,KAAK,WAAW,OAAOmB,CAAM,GAC7B,KAAK,WAAW,IAAInB,GAAOqB,CAAU;AAAA,IAEzC;AAEA,SAAK,mBAAA;AAAA,EACP;AACF;ACvYO,SAASC,GAAc9D,GAAsB;AAClD,QAAMrB,IAAa8D,EAAW,IAAIzC,CAAM,GAElC7b,IAAQ4f;AAAA,IACZ,CAAC5b,MAAawW,EAAW,UAAUxW,CAAQ;AAAA,IAC3C,MAAMwW,EAAW,SAAA;AAAA,IACjB,MAAMA,EAAW,SAAA;AAAA,EAAS;AAG5B,SAAO;AAAA;AAAA,IAEL,OAAOxa,EAAM;AAAA,IACb,SAASA,EAAM;AAAA,IACf,WAAWA,EAAM;AAAA,IACjB,WAAWA,EAAM;AAAA,IACjB,SAASA,EAAM;AAAA,IACf,SAASA,EAAM;AAAA;AAAA,IAGf,QAAQ,CAACQ,MAAYga,EAAW,OAAOha,CAAI;AAAA,IAC3C,QAAQ,CAAC0b,GAAY5U,MAAsCkT,EAAW,OAAO0B,GAAI5U,CAAM;AAAA,IACvF,QAAQ,CAAC4U,MAAe1B,EAAW,OAAO0B,CAAE;AAAA,IAC5C,SAAS,CAACA,MAAe1B,EAAW,QAAQ0B,CAAE;AAAA,IAC9C,eAAe,CAACA,MAAe1B,EAAW,cAAc0B,CAAE;AAAA;AAAA,IAG1D,YAAY,CAAC+C,MAA6BzE,EAAW,WAAWyE,CAAY;AAAA,IAC5E,SAAS,MAAMzE,EAAW,QAAA;AAAA;AAAA,IAG1B,WAAW,MAAMA,EAAW,UAAA;AAAA,IAC5B,YAAY,MAAMA,EAAW,WAAA;AAAA,IAC7B,WAAW,CAAC0B,MAAgB1B,EAAW,UAAU0B,CAAE;AAAA,EAAA;AAEvD;ACtCO,SAAS2D,GAAcrf,GAAoC;AAChE,QAAMuQ,IAAO6O;AAAA,IACX,CAAC5b,MAAaxD,EAAK,WAAW,UAAUwD,CAAQ;AAAA,IAChD,MAAMxD,EAAK;AAAA,IACX,MAAMA,EAAK;AAAA,EAAA,GAGPsf,IAASF;AAAA,IACb,CAAC5b,MAAaxD,EAAK,WAAW,UAAUwD,CAAQ;AAAA,IAChD,MAAMxD,EAAK,UAAA;AAAA,IACX,MAAMA,EAAK,UAAA;AAAA,EAAU,GAGjBuf,IAASH;AAAA,IACb,CAAC5b,MAAaxD,EAAK,WAAW,UAAUwD,CAAQ;AAAA,IAChD,MAAMxD,EAAK,OAAA;AAAA,IACX,MAAMA,EAAK,OAAA;AAAA,EAAO,GAGdwf,IAASC,GAAY,CAAC3Y,MAAsC9G,EAAK,OAAO8G,CAAM,GAAG,CAAC9G,CAAI,CAAC,GAEvF0f,IAASD,GAAY,MAAMzf,EAAK,UAAU,CAACA,CAAI,CAAC;AAEtD,SAAO,EAAE,MAAAuQ,GAAM,QAAA+O,GAAQ,QAAAE,GAAQ,QAAAE,GAAQ,QAAAH,EAAA;AACzC;","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139]}