@mhmo91/schmancy 0.9.13 → 0.9.15

package/dist/{store-Bmj6rvZY.js.map → store-CjzZDQt8.js.map}

@@ -1 +1 @@
-{"version":3,"file":"store-Bmj6rvZY.js","names":["isPlainObject","isArray","isMap","isSet","finalize"],"sources":["../node_modules/immer/dist/immer.mjs","../src/store/types.ts","../src/store/storage-manager.ts","../src/store/store.class.ts","../src/store/context-array.ts","../src/store/context-collection.ts","../src/store/context-object.ts","../src/store/context-create.ts","../src/store/filter-directive.ts","../src/store/selectors.ts","../src/store/selector-hook.ts"],"sourcesContent":["// src/utils/env.ts\nvar NOTHING = Symbol.for(\"immer-nothing\");\nvar DRAFTABLE = Symbol.for(\"immer-draftable\");\nvar DRAFT_STATE = Symbol.for(\"immer-state\");\n\n// src/utils/errors.ts\nvar errors = process.env.NODE_ENV !== \"production\" ? [\n  // All error codes, starting by 0:\n  function(plugin) {\n    return `The plugin for '${plugin}' has not been loaded into Immer. To enable the plugin, import and call \\`enable${plugin}()\\` when initializing your application.`;\n  },\n  function(thing) {\n    return `produce can only be called on things that are draftable: plain objects, arrays, Map, Set or classes that are marked with '[immerable]: true'. Got '${thing}'`;\n  },\n  \"This object has been frozen and should not be mutated\",\n  function(data) {\n    return \"Cannot use a proxy that has been revoked. Did you pass an object from inside an immer function to an async process? \" + data;\n  },\n  \"An immer producer returned a new value *and* modified its draft. Either return a new value *or* modify the draft.\",\n  \"Immer forbids circular references\",\n  \"The first or second argument to `produce` must be a function\",\n  \"The third argument to `produce` must be a function or undefined\",\n  \"First argument to `createDraft` must be a plain object, an array, or an immerable object\",\n  \"First argument to `finishDraft` must be a draft returned by `createDraft`\",\n  function(thing) {\n    return `'current' expects a draft, got: ${thing}`;\n  },\n  \"Object.defineProperty() cannot be used on an Immer draft\",\n  \"Object.setPrototypeOf() cannot be used on an Immer draft\",\n  \"Immer only supports deleting array indices\",\n  \"Immer only supports setting array indices and the 'length' property\",\n  function(thing) {\n    return `'original' expects a draft, got: ${thing}`;\n  }\n  // Note: if more errors are added, the errorOffset in Patches.ts should be increased\n  // See Patches.ts for additional errors\n] : [];\nfunction die(error, ...args) {\n  if (process.env.NODE_ENV !== \"production\") {\n    const e = errors[error];\n    const msg = isFunction(e) ? e.apply(null, args) : e;\n    throw new Error(`[Immer] ${msg}`);\n  }\n  throw new Error(\n    `[Immer] minified error nr: ${error}. Full error at: https://bit.ly/3cXEKWf`\n  );\n}\n\n// src/utils/common.ts\nvar O = Object;\nvar getPrototypeOf = O.getPrototypeOf;\nvar CONSTRUCTOR = \"constructor\";\nvar PROTOTYPE = \"prototype\";\nvar CONFIGURABLE = \"configurable\";\nvar ENUMERABLE = \"enumerable\";\nvar WRITABLE = \"writable\";\nvar VALUE = \"value\";\nvar isDraft = (value) => !!value && !!value[DRAFT_STATE];\nfunction isDraftable(value) {\n  if (!value)\n    return false;\n  return isPlainObject(value) || isArray(value) || !!value[DRAFTABLE] || !!value[CONSTRUCTOR]?.[DRAFTABLE] || isMap(value) || isSet(value);\n}\nvar objectCtorString = O[PROTOTYPE][CONSTRUCTOR].toString();\nvar cachedCtorStrings = /* @__PURE__ */ new WeakMap();\nfunction isPlainObject(value) {\n  if (!value || !isObjectish(value))\n    return false;\n  const proto = getPrototypeOf(value);\n  if (proto === null || proto === O[PROTOTYPE])\n    return true;\n  const Ctor = O.hasOwnProperty.call(proto, CONSTRUCTOR) && proto[CONSTRUCTOR];\n  if (Ctor === Object)\n    return true;\n  if (!isFunction(Ctor))\n    return false;\n  let ctorString = cachedCtorStrings.get(Ctor);\n  if (ctorString === void 0) {\n    ctorString = Function.toString.call(Ctor);\n    cachedCtorStrings.set(Ctor, ctorString);\n  }\n  return ctorString === objectCtorString;\n}\nfunction original(value) {\n  if (!isDraft(value))\n    die(15, value);\n  return value[DRAFT_STATE].base_;\n}\nfunction each(obj, iter, strict = true) {\n  if (getArchtype(obj) === 0 /* Object */) {\n    const keys = strict ? Reflect.ownKeys(obj) : O.keys(obj);\n    keys.forEach((key) => {\n      iter(key, obj[key], obj);\n    });\n  } else {\n    obj.forEach((entry, index) => iter(index, entry, obj));\n  }\n}\nfunction getArchtype(thing) {\n  const state = thing[DRAFT_STATE];\n  return state ? state.type_ : isArray(thing) ? 1 /* Array */ : isMap(thing) ? 2 /* Map */ : isSet(thing) ? 3 /* Set */ : 0 /* Object */;\n}\nvar has = (thing, prop, type = getArchtype(thing)) => type === 2 /* Map */ ? thing.has(prop) : O[PROTOTYPE].hasOwnProperty.call(thing, prop);\nvar get = (thing, prop, type = getArchtype(thing)) => (\n  // @ts-ignore\n  type === 2 /* Map */ ? thing.get(prop) : thing[prop]\n);\nvar set = (thing, propOrOldValue, value, type = getArchtype(thing)) => {\n  if (type === 2 /* Map */)\n    thing.set(propOrOldValue, value);\n  else if (type === 3 /* Set */) {\n    thing.add(value);\n  } else\n    thing[propOrOldValue] = value;\n};\nfunction is(x, y) {\n  if (x === y) {\n    return x !== 0 || 1 / x === 1 / y;\n  } else {\n    return x !== x && y !== y;\n  }\n}\nvar isArray = Array.isArray;\nvar isMap = (target) => target instanceof Map;\nvar isSet = (target) => target instanceof Set;\nvar isObjectish = (target) => typeof target === \"object\";\nvar isFunction = (target) => typeof target === \"function\";\nvar isBoolean = (target) => typeof target === \"boolean\";\nfunction isArrayIndex(value) {\n  const n = +value;\n  return Number.isInteger(n) && String(n) === value;\n}\nvar getProxyDraft = (value) => {\n  if (!isObjectish(value))\n    return null;\n  return value?.[DRAFT_STATE];\n};\nvar latest = (state) => state.copy_ || state.base_;\nvar getValue = (value) => {\n  const proxyDraft = getProxyDraft(value);\n  return proxyDraft ? proxyDraft.copy_ ?? proxyDraft.base_ : value;\n};\nvar getFinalValue = (state) => state.modified_ ? state.copy_ : state.base_;\nfunction shallowCopy(base, strict) {\n  if (isMap(base)) {\n    return new Map(base);\n  }\n  if (isSet(base)) {\n    return new Set(base);\n  }\n  if (isArray(base))\n    return Array[PROTOTYPE].slice.call(base);\n  const isPlain = isPlainObject(base);\n  if (strict === true || strict === \"class_only\" && !isPlain) {\n    const descriptors = O.getOwnPropertyDescriptors(base);\n    delete descriptors[DRAFT_STATE];\n    let keys = Reflect.ownKeys(descriptors);\n    for (let i = 0; i < keys.length; i++) {\n      const key = keys[i];\n      const desc = descriptors[key];\n      if (desc[WRITABLE] === false) {\n        desc[WRITABLE] = true;\n        desc[CONFIGURABLE] = true;\n      }\n      if (desc.get || desc.set)\n        descriptors[key] = {\n          [CONFIGURABLE]: true,\n          [WRITABLE]: true,\n          // could live with !!desc.set as well here...\n          [ENUMERABLE]: desc[ENUMERABLE],\n          [VALUE]: base[key]\n        };\n    }\n    return O.create(getPrototypeOf(base), descriptors);\n  } else {\n    const proto = getPrototypeOf(base);\n    if (proto !== null && isPlain) {\n      return { ...base };\n    }\n    const obj = O.create(proto);\n    return O.assign(obj, base);\n  }\n}\nfunction freeze(obj, deep = false) {\n  if (isFrozen(obj) || isDraft(obj) || !isDraftable(obj))\n    return obj;\n  if (getArchtype(obj) > 1) {\n    O.defineProperties(obj, {\n      set: dontMutateMethodOverride,\n      add: dontMutateMethodOverride,\n      clear: dontMutateMethodOverride,\n      delete: dontMutateMethodOverride\n    });\n  }\n  O.freeze(obj);\n  if (deep)\n    each(\n      obj,\n      (_key, value) => {\n        freeze(value, true);\n      },\n      false\n    );\n  return obj;\n}\nfunction dontMutateFrozenCollections() {\n  die(2);\n}\nvar dontMutateMethodOverride = {\n  [VALUE]: dontMutateFrozenCollections\n};\nfunction isFrozen(obj) {\n  if (obj === null || !isObjectish(obj))\n    return true;\n  return O.isFrozen(obj);\n}\n\n// src/utils/plugins.ts\nvar PluginMapSet = \"MapSet\";\nvar PluginPatches = \"Patches\";\nvar PluginArrayMethods = \"ArrayMethods\";\nvar plugins = {};\nfunction getPlugin(pluginKey) {\n  const plugin = plugins[pluginKey];\n  if (!plugin) {\n    die(0, pluginKey);\n  }\n  return plugin;\n}\nvar isPluginLoaded = (pluginKey) => !!plugins[pluginKey];\nfunction loadPlugin(pluginKey, implementation) {\n  if (!plugins[pluginKey])\n    plugins[pluginKey] = implementation;\n}\n\n// src/core/scope.ts\nvar currentScope;\nvar getCurrentScope = () => currentScope;\nvar createScope = (parent_, immer_) => ({\n  drafts_: [],\n  parent_,\n  immer_,\n  // Whenever the modified draft contains a draft from another scope, we\n  // need to prevent auto-freezing so the unowned draft can be finalized.\n  canAutoFreeze_: true,\n  unfinalizedDrafts_: 0,\n  handledSet_: /* @__PURE__ */ new Set(),\n  processedForPatches_: /* @__PURE__ */ new Set(),\n  mapSetPlugin_: isPluginLoaded(PluginMapSet) ? getPlugin(PluginMapSet) : void 0,\n  arrayMethodsPlugin_: isPluginLoaded(PluginArrayMethods) ? getPlugin(PluginArrayMethods) : void 0\n});\nfunction usePatchesInScope(scope, patchListener) {\n  if (patchListener) {\n    scope.patchPlugin_ = getPlugin(PluginPatches);\n    scope.patches_ = [];\n    scope.inversePatches_ = [];\n    scope.patchListener_ = patchListener;\n  }\n}\nfunction revokeScope(scope) {\n  leaveScope(scope);\n  scope.drafts_.forEach(revokeDraft);\n  scope.drafts_ = null;\n}\nfunction leaveScope(scope) {\n  if (scope === currentScope) {\n    currentScope = scope.parent_;\n  }\n}\nvar enterScope = (immer2) => currentScope = createScope(currentScope, immer2);\nfunction revokeDraft(draft) {\n  const state = draft[DRAFT_STATE];\n  if (state.type_ === 0 /* Object */ || state.type_ === 1 /* Array */)\n    state.revoke_();\n  else\n    state.revoked_ = true;\n}\n\n// src/core/finalize.ts\nfunction processResult(result, scope) {\n  scope.unfinalizedDrafts_ = scope.drafts_.length;\n  const baseDraft = scope.drafts_[0];\n  const isReplaced = result !== void 0 && result !== baseDraft;\n  if (isReplaced) {\n    if (baseDraft[DRAFT_STATE].modified_) {\n      revokeScope(scope);\n      die(4);\n    }\n    if (isDraftable(result)) {\n      result = finalize(scope, result);\n    }\n    const { patchPlugin_ } = scope;\n    if (patchPlugin_) {\n      patchPlugin_.generateReplacementPatches_(\n        baseDraft[DRAFT_STATE].base_,\n        result,\n        scope\n      );\n    }\n  } else {\n    result = finalize(scope, baseDraft);\n  }\n  maybeFreeze(scope, result, true);\n  revokeScope(scope);\n  if (scope.patches_) {\n    scope.patchListener_(scope.patches_, scope.inversePatches_);\n  }\n  return result !== NOTHING ? result : void 0;\n}\nfunction finalize(rootScope, value) {\n  if (isFrozen(value))\n    return value;\n  const state = value[DRAFT_STATE];\n  if (!state) {\n    const finalValue = handleValue(value, rootScope.handledSet_, rootScope);\n    return finalValue;\n  }\n  if (!isSameScope(state, rootScope)) {\n    return value;\n  }\n  if (!state.modified_) {\n    return state.base_;\n  }\n  if (!state.finalized_) {\n    const { callbacks_ } = state;\n    if (callbacks_) {\n      while (callbacks_.length > 0) {\n        const callback = callbacks_.pop();\n        callback(rootScope);\n      }\n    }\n    generatePatchesAndFinalize(state, rootScope);\n  }\n  return state.copy_;\n}\nfunction maybeFreeze(scope, value, deep = false) {\n  if (!scope.parent_ && scope.immer_.autoFreeze_ && scope.canAutoFreeze_) {\n    freeze(value, deep);\n  }\n}\nfunction markStateFinalized(state) {\n  state.finalized_ = true;\n  state.scope_.unfinalizedDrafts_--;\n}\nvar isSameScope = (state, rootScope) => state.scope_ === rootScope;\nvar EMPTY_LOCATIONS_RESULT = [];\nfunction updateDraftInParent(parent, draftValue, finalizedValue, originalKey) {\n  const parentCopy = latest(parent);\n  const parentType = parent.type_;\n  if (originalKey !== void 0) {\n    const currentValue = get(parentCopy, originalKey, parentType);\n    if (currentValue === draftValue) {\n      set(parentCopy, originalKey, finalizedValue, parentType);\n      return;\n    }\n  }\n  if (!parent.draftLocations_) {\n    const draftLocations = parent.draftLocations_ = /* @__PURE__ */ new Map();\n    each(parentCopy, (key, value) => {\n      if (isDraft(value)) {\n        const keys = draftLocations.get(value) || [];\n        keys.push(key);\n        draftLocations.set(value, keys);\n      }\n    });\n  }\n  const locations = parent.draftLocations_.get(draftValue) ?? EMPTY_LOCATIONS_RESULT;\n  for (const location of locations) {\n    set(parentCopy, location, finalizedValue, parentType);\n  }\n}\nfunction registerChildFinalizationCallback(parent, child, key) {\n  parent.callbacks_.push(function childCleanup(rootScope) {\n    const state = child;\n    if (!state || !isSameScope(state, rootScope)) {\n      return;\n    }\n    rootScope.mapSetPlugin_?.fixSetContents(state);\n    const finalizedValue = getFinalValue(state);\n    updateDraftInParent(parent, state.draft_ ?? state, finalizedValue, key);\n    generatePatchesAndFinalize(state, rootScope);\n  });\n}\nfunction generatePatchesAndFinalize(state, rootScope) {\n  const shouldFinalize = state.modified_ && !state.finalized_ && (state.type_ === 3 /* Set */ || state.type_ === 1 /* Array */ && state.allIndicesReassigned_ || (state.assigned_?.size ?? 0) > 0);\n  if (shouldFinalize) {\n    const { patchPlugin_ } = rootScope;\n    if (patchPlugin_) {\n      const basePath = patchPlugin_.getPath(state);\n      if (basePath) {\n        patchPlugin_.generatePatches_(state, basePath, rootScope);\n      }\n    }\n    markStateFinalized(state);\n  }\n}\nfunction handleCrossReference(target, key, value) {\n  const { scope_ } = target;\n  if (isDraft(value)) {\n    const state = value[DRAFT_STATE];\n    if (isSameScope(state, scope_)) {\n      state.callbacks_.push(function crossReferenceCleanup() {\n        prepareCopy(target);\n        const finalizedValue = getFinalValue(state);\n        updateDraftInParent(target, value, finalizedValue, key);\n      });\n    }\n  } else if (isDraftable(value)) {\n    target.callbacks_.push(function nestedDraftCleanup() {\n      const targetCopy = latest(target);\n      if (target.type_ === 3 /* Set */) {\n        if (targetCopy.has(value)) {\n          handleValue(value, scope_.handledSet_, scope_);\n        }\n      } else {\n        if (get(targetCopy, key, target.type_) === value) {\n          if (scope_.drafts_.length > 1 && (target.assigned_.get(key) ?? false) === true && target.copy_) {\n            handleValue(\n              get(target.copy_, key, target.type_),\n              scope_.handledSet_,\n              scope_\n            );\n          }\n        }\n      }\n    });\n  }\n}\nfunction handleValue(target, handledSet, rootScope) {\n  if (!rootScope.immer_.autoFreeze_ && rootScope.unfinalizedDrafts_ < 1) {\n    return target;\n  }\n  if (isDraft(target) || handledSet.has(target) || !isDraftable(target) || isFrozen(target)) {\n    return target;\n  }\n  handledSet.add(target);\n  each(target, (key, value) => {\n    if (isDraft(value)) {\n      const state = value[DRAFT_STATE];\n      if (isSameScope(state, rootScope)) {\n        const updatedValue = getFinalValue(state);\n        set(target, key, updatedValue, target.type_);\n        markStateFinalized(state);\n      }\n    } else if (isDraftable(value)) {\n      handleValue(value, handledSet, rootScope);\n    }\n  });\n  return target;\n}\n\n// src/core/proxy.ts\nfunction createProxyProxy(base, parent) {\n  const baseIsArray = isArray(base);\n  const state = {\n    type_: baseIsArray ? 1 /* Array */ : 0 /* Object */,\n    // Track which produce call this is associated with.\n    scope_: parent ? parent.scope_ : getCurrentScope(),\n    // True for both shallow and deep changes.\n    modified_: false,\n    // Used during finalization.\n    finalized_: false,\n    // Track which properties have been assigned (true) or deleted (false).\n    // actually instantiated in `prepareCopy()`\n    assigned_: void 0,\n    // The parent draft state.\n    parent_: parent,\n    // The base state.\n    base_: base,\n    // The base proxy.\n    draft_: null,\n    // set below\n    // The base copy with any updated values.\n    copy_: null,\n    // Called by the `produce` function.\n    revoke_: null,\n    isManual_: false,\n    // `callbacks` actually gets assigned in `createProxy`\n    callbacks_: void 0\n  };\n  let target = state;\n  let traps = objectTraps;\n  if (baseIsArray) {\n    target = [state];\n    traps = arrayTraps;\n  }\n  const { revoke, proxy } = Proxy.revocable(target, traps);\n  state.draft_ = proxy;\n  state.revoke_ = revoke;\n  return [proxy, state];\n}\nvar objectTraps = {\n  get(state, prop) {\n    if (prop === DRAFT_STATE)\n      return state;\n    let arrayPlugin = state.scope_.arrayMethodsPlugin_;\n    const isArrayWithStringProp = state.type_ === 1 /* Array */ && typeof prop === \"string\";\n    if (isArrayWithStringProp) {\n      if (arrayPlugin?.isArrayOperationMethod(prop)) {\n        return arrayPlugin.createMethodInterceptor(state, prop);\n      }\n    }\n    const source = latest(state);\n    if (!has(source, prop, state.type_)) {\n      return readPropFromProto(state, source, prop);\n    }\n    const value = source[prop];\n    if (state.finalized_ || !isDraftable(value)) {\n      return value;\n    }\n    if (isArrayWithStringProp && state.operationMethod && arrayPlugin?.isMutatingArrayMethod(\n      state.operationMethod\n    ) && isArrayIndex(prop)) {\n      return value;\n    }\n    if (value === peek(state.base_, prop)) {\n      prepareCopy(state);\n      const childKey = state.type_ === 1 /* Array */ ? +prop : prop;\n      const childDraft = createProxy(state.scope_, value, state, childKey);\n      return state.copy_[childKey] = childDraft;\n    }\n    return value;\n  },\n  has(state, prop) {\n    return prop in latest(state);\n  },\n  ownKeys(state) {\n    return Reflect.ownKeys(latest(state));\n  },\n  set(state, prop, value) {\n    const desc = getDescriptorFromProto(latest(state), prop);\n    if (desc?.set) {\n      desc.set.call(state.draft_, value);\n      return true;\n    }\n    if (!state.modified_) {\n      const current2 = peek(latest(state), prop);\n      const currentState = current2?.[DRAFT_STATE];\n      if (currentState && currentState.base_ === value) {\n        state.copy_[prop] = value;\n        state.assigned_.set(prop, false);\n        return true;\n      }\n      if (is(value, current2) && (value !== void 0 || has(state.base_, prop, state.type_)))\n        return true;\n      prepareCopy(state);\n      markChanged(state);\n    }\n    if (state.copy_[prop] === value && // special case: handle new props with value 'undefined'\n    (value !== void 0 || prop in state.copy_) || // special case: NaN\n    Number.isNaN(value) && Number.isNaN(state.copy_[prop]))\n      return true;\n    state.copy_[prop] = value;\n    state.assigned_.set(prop, true);\n    handleCrossReference(state, prop, value);\n    return true;\n  },\n  deleteProperty(state, prop) {\n    prepareCopy(state);\n    if (peek(state.base_, prop) !== void 0 || prop in state.base_) {\n      state.assigned_.set(prop, false);\n      markChanged(state);\n    } else {\n      state.assigned_.delete(prop);\n    }\n    if (state.copy_) {\n      delete state.copy_[prop];\n    }\n    return true;\n  },\n  // Note: We never coerce `desc.value` into an Immer draft, because we can't make\n  // the same guarantee in ES5 mode.\n  getOwnPropertyDescriptor(state, prop) {\n    const owner = latest(state);\n    const desc = Reflect.getOwnPropertyDescriptor(owner, prop);\n    if (!desc)\n      return desc;\n    return {\n      [WRITABLE]: true,\n      [CONFIGURABLE]: state.type_ !== 1 /* Array */ || prop !== \"length\",\n      [ENUMERABLE]: desc[ENUMERABLE],\n      [VALUE]: owner[prop]\n    };\n  },\n  defineProperty() {\n    die(11);\n  },\n  getPrototypeOf(state) {\n    return getPrototypeOf(state.base_);\n  },\n  setPrototypeOf() {\n    die(12);\n  }\n};\nvar arrayTraps = {};\nfor (let key in objectTraps) {\n  let fn = objectTraps[key];\n  arrayTraps[key] = function() {\n    const args = arguments;\n    args[0] = args[0][0];\n    return fn.apply(this, args);\n  };\n}\narrayTraps.deleteProperty = function(state, prop) {\n  if (process.env.NODE_ENV !== \"production\" && isNaN(parseInt(prop)))\n    die(13);\n  return arrayTraps.set.call(this, state, prop, void 0);\n};\narrayTraps.set = function(state, prop, value) {\n  if (process.env.NODE_ENV !== \"production\" && prop !== \"length\" && isNaN(parseInt(prop)))\n    die(14);\n  return objectTraps.set.call(this, state[0], prop, value, state[0]);\n};\nfunction peek(draft, prop) {\n  const state = draft[DRAFT_STATE];\n  const source = state ? latest(state) : draft;\n  return source[prop];\n}\nfunction readPropFromProto(state, source, prop) {\n  const desc = getDescriptorFromProto(source, prop);\n  return desc ? VALUE in desc ? desc[VALUE] : (\n    // This is a very special case, if the prop is a getter defined by the\n    // prototype, we should invoke it with the draft as context!\n    desc.get?.call(state.draft_)\n  ) : void 0;\n}\nfunction getDescriptorFromProto(source, prop) {\n  if (!(prop in source))\n    return void 0;\n  let proto = getPrototypeOf(source);\n  while (proto) {\n    const desc = Object.getOwnPropertyDescriptor(proto, prop);\n    if (desc)\n      return desc;\n    proto = getPrototypeOf(proto);\n  }\n  return void 0;\n}\nfunction markChanged(state) {\n  if (!state.modified_) {\n    state.modified_ = true;\n    if (state.parent_) {\n      markChanged(state.parent_);\n    }\n  }\n}\nfunction prepareCopy(state) {\n  if (!state.copy_) {\n    state.assigned_ = /* @__PURE__ */ new Map();\n    state.copy_ = shallowCopy(\n      state.base_,\n      state.scope_.immer_.useStrictShallowCopy_\n    );\n  }\n}\n\n// src/core/immerClass.ts\nvar Immer2 = class {\n  constructor(config) {\n    this.autoFreeze_ = true;\n    this.useStrictShallowCopy_ = false;\n    this.useStrictIteration_ = false;\n    /**\n     * The `produce` function takes a value and a \"recipe function\" (whose\n     * return value often depends on the base state). The recipe function is\n     * free to mutate its first argument however it wants. All mutations are\n     * only ever applied to a __copy__ of the base state.\n     *\n     * Pass only a function to create a \"curried producer\" which relieves you\n     * from passing the recipe function every time.\n     *\n     * Only plain objects and arrays are made mutable. All other objects are\n     * considered uncopyable.\n     *\n     * Note: This function is __bound__ to its `Immer` instance.\n     *\n     * @param {any} base - the initial state\n     * @param {Function} recipe - function that receives a proxy of the base state as first argument and which can be freely modified\n     * @param {Function} patchListener - optional function that will be called with all the patches produced here\n     * @returns {any} a new state, or the initial state if nothing was modified\n     */\n    this.produce = (base, recipe, patchListener) => {\n      if (isFunction(base) && !isFunction(recipe)) {\n        const defaultBase = recipe;\n        recipe = base;\n        const self = this;\n        return function curriedProduce(base2 = defaultBase, ...args) {\n          return self.produce(base2, (draft) => recipe.call(this, draft, ...args));\n        };\n      }\n      if (!isFunction(recipe))\n        die(6);\n      if (patchListener !== void 0 && !isFunction(patchListener))\n        die(7);\n      let result;\n      if (isDraftable(base)) {\n        const scope = enterScope(this);\n        const proxy = createProxy(scope, base, void 0);\n        let hasError = true;\n        try {\n          result = recipe(proxy);\n          hasError = false;\n        } finally {\n          if (hasError)\n            revokeScope(scope);\n          else\n            leaveScope(scope);\n        }\n        usePatchesInScope(scope, patchListener);\n        return processResult(result, scope);\n      } else if (!base || !isObjectish(base)) {\n        result = recipe(base);\n        if (result === void 0)\n          result = base;\n        if (result === NOTHING)\n          result = void 0;\n        if (this.autoFreeze_)\n          freeze(result, true);\n        if (patchListener) {\n          const p = [];\n          const ip = [];\n          getPlugin(PluginPatches).generateReplacementPatches_(base, result, {\n            patches_: p,\n            inversePatches_: ip\n          });\n          patchListener(p, ip);\n        }\n        return result;\n      } else\n        die(1, base);\n    };\n    this.produceWithPatches = (base, recipe) => {\n      if (isFunction(base)) {\n        return (state, ...args) => this.produceWithPatches(state, (draft) => base(draft, ...args));\n      }\n      let patches, inversePatches;\n      const result = this.produce(base, recipe, (p, ip) => {\n        patches = p;\n        inversePatches = ip;\n      });\n      return [result, patches, inversePatches];\n    };\n    if (isBoolean(config?.autoFreeze))\n      this.setAutoFreeze(config.autoFreeze);\n    if (isBoolean(config?.useStrictShallowCopy))\n      this.setUseStrictShallowCopy(config.useStrictShallowCopy);\n    if (isBoolean(config?.useStrictIteration))\n      this.setUseStrictIteration(config.useStrictIteration);\n  }\n  createDraft(base) {\n    if (!isDraftable(base))\n      die(8);\n    if (isDraft(base))\n      base = current(base);\n    const scope = enterScope(this);\n    const proxy = createProxy(scope, base, void 0);\n    proxy[DRAFT_STATE].isManual_ = true;\n    leaveScope(scope);\n    return proxy;\n  }\n  finishDraft(draft, patchListener) {\n    const state = draft && draft[DRAFT_STATE];\n    if (!state || !state.isManual_)\n      die(9);\n    const { scope_: scope } = state;\n    usePatchesInScope(scope, patchListener);\n    return processResult(void 0, scope);\n  }\n  /**\n   * Pass true to automatically freeze all copies created by Immer.\n   *\n   * By default, auto-freezing is enabled.\n   */\n  setAutoFreeze(value) {\n    this.autoFreeze_ = value;\n  }\n  /**\n   * Pass true to enable strict shallow copy.\n   *\n   * By default, immer does not copy the object descriptors such as getter, setter and non-enumrable properties.\n   */\n  setUseStrictShallowCopy(value) {\n    this.useStrictShallowCopy_ = value;\n  }\n  /**\n   * Pass false to use faster iteration that skips non-enumerable properties\n   * but still handles symbols for compatibility.\n   *\n   * By default, strict iteration is enabled (includes all own properties).\n   */\n  setUseStrictIteration(value) {\n    this.useStrictIteration_ = value;\n  }\n  shouldUseStrictIteration() {\n    return this.useStrictIteration_;\n  }\n  applyPatches(base, patches) {\n    let i;\n    for (i = patches.length - 1; i >= 0; i--) {\n      const patch = patches[i];\n      if (patch.path.length === 0 && patch.op === \"replace\") {\n        base = patch.value;\n        break;\n      }\n    }\n    if (i > -1) {\n      patches = patches.slice(i + 1);\n    }\n    const applyPatchesImpl = getPlugin(PluginPatches).applyPatches_;\n    if (isDraft(base)) {\n      return applyPatchesImpl(base, patches);\n    }\n    return this.produce(\n      base,\n      (draft) => applyPatchesImpl(draft, patches)\n    );\n  }\n};\nfunction createProxy(rootScope, value, parent, key) {\n  const [draft, state] = isMap(value) ? getPlugin(PluginMapSet).proxyMap_(value, parent) : isSet(value) ? getPlugin(PluginMapSet).proxySet_(value, parent) : createProxyProxy(value, parent);\n  const scope = parent?.scope_ ?? getCurrentScope();\n  scope.drafts_.push(draft);\n  state.callbacks_ = parent?.callbacks_ ?? [];\n  state.key_ = key;\n  if (parent && key !== void 0) {\n    registerChildFinalizationCallback(parent, state, key);\n  } else {\n    state.callbacks_.push(function rootDraftCleanup(rootScope2) {\n      rootScope2.mapSetPlugin_?.fixSetContents(state);\n      const { patchPlugin_ } = rootScope2;\n      if (state.modified_ && patchPlugin_) {\n        patchPlugin_.generatePatches_(state, [], rootScope2);\n      }\n    });\n  }\n  return draft;\n}\n\n// src/core/current.ts\nfunction current(value) {\n  if (!isDraft(value))\n    die(10, value);\n  return currentImpl(value);\n}\nfunction currentImpl(value) {\n  if (!isDraftable(value) || isFrozen(value))\n    return value;\n  const state = value[DRAFT_STATE];\n  let copy;\n  let strict = true;\n  if (state) {\n    if (!state.modified_)\n      return state.base_;\n    state.finalized_ = true;\n    copy = shallowCopy(value, state.scope_.immer_.useStrictShallowCopy_);\n    strict = state.scope_.immer_.shouldUseStrictIteration();\n  } else {\n    copy = shallowCopy(value, true);\n  }\n  each(\n    copy,\n    (key, childValue) => {\n      set(copy, key, currentImpl(childValue));\n    },\n    strict\n  );\n  if (state) {\n    state.finalized_ = false;\n  }\n  return copy;\n}\n\n// src/plugins/patches.ts\nfunction enablePatches() {\n  const errorOffset = 16;\n  if (process.env.NODE_ENV !== \"production\") {\n    errors.push(\n      'Sets cannot have \"replace\" patches.',\n      function(op) {\n        return \"Unsupported patch operation: \" + op;\n      },\n      function(path) {\n        return \"Cannot apply patch, path doesn't resolve: \" + path;\n      },\n      \"Patching reserved attributes like __proto__, prototype and constructor is not allowed\"\n    );\n  }\n  function getPath(state, path = []) {\n    if (state.key_ !== void 0) {\n      const parentCopy = state.parent_.copy_ ?? state.parent_.base_;\n      const proxyDraft = getProxyDraft(get(parentCopy, state.key_));\n      const valueAtKey = get(parentCopy, state.key_);\n      if (valueAtKey === void 0) {\n        return null;\n      }\n      if (valueAtKey !== state.draft_ && valueAtKey !== state.base_ && valueAtKey !== state.copy_) {\n        return null;\n      }\n      if (proxyDraft != null && proxyDraft.base_ !== state.base_) {\n        return null;\n      }\n      const isSet2 = state.parent_.type_ === 3 /* Set */;\n      let key;\n      if (isSet2) {\n        const setParent = state.parent_;\n        key = Array.from(setParent.drafts_.keys()).indexOf(state.key_);\n      } else {\n        key = state.key_;\n      }\n      if (!(isSet2 && parentCopy.size > key || has(parentCopy, key))) {\n        return null;\n      }\n      path.push(key);\n    }\n    if (state.parent_) {\n      return getPath(state.parent_, path);\n    }\n    path.reverse();\n    try {\n      resolvePath(state.copy_, path);\n    } catch (e) {\n      return null;\n    }\n    return path;\n  }\n  function resolvePath(base, path) {\n    let current2 = base;\n    for (let i = 0; i < path.length - 1; i++) {\n      const key = path[i];\n      current2 = get(current2, key);\n      if (!isObjectish(current2) || current2 === null) {\n        throw new Error(`Cannot resolve path at '${path.join(\"/\")}'`);\n      }\n    }\n    return current2;\n  }\n  const REPLACE = \"replace\";\n  const ADD = \"add\";\n  const REMOVE = \"remove\";\n  function generatePatches_(state, basePath, scope) {\n    if (state.scope_.processedForPatches_.has(state)) {\n      return;\n    }\n    state.scope_.processedForPatches_.add(state);\n    const { patches_, inversePatches_ } = scope;\n    switch (state.type_) {\n      case 0 /* Object */:\n      case 2 /* Map */:\n        return generatePatchesFromAssigned(\n          state,\n          basePath,\n          patches_,\n          inversePatches_\n        );\n      case 1 /* Array */:\n        return generateArrayPatches(\n          state,\n          basePath,\n          patches_,\n          inversePatches_\n        );\n      case 3 /* Set */:\n        return generateSetPatches(\n          state,\n          basePath,\n          patches_,\n          inversePatches_\n        );\n    }\n  }\n  function generateArrayPatches(state, basePath, patches, inversePatches) {\n    let { base_, assigned_ } = state;\n    let copy_ = state.copy_;\n    if (copy_.length < base_.length) {\n      ;\n      [base_, copy_] = [copy_, base_];\n      [patches, inversePatches] = [inversePatches, patches];\n    }\n    const allReassigned = state.allIndicesReassigned_ === true;\n    for (let i = 0; i < base_.length; i++) {\n      const copiedItem = copy_[i];\n      const baseItem = base_[i];\n      const isAssigned = allReassigned || assigned_?.get(i.toString());\n      if (isAssigned && copiedItem !== baseItem) {\n        const childState = copiedItem?.[DRAFT_STATE];\n        if (childState && childState.modified_) {\n          continue;\n        }\n        const path = basePath.concat([i]);\n        patches.push({\n          op: REPLACE,\n          path,\n          // Need to maybe clone it, as it can in fact be the original value\n          // due to the base/copy inversion at the start of this function\n          value: clonePatchValueIfNeeded(copiedItem)\n        });\n        inversePatches.push({\n          op: REPLACE,\n          path,\n          value: clonePatchValueIfNeeded(baseItem)\n        });\n      }\n    }\n    for (let i = base_.length; i < copy_.length; i++) {\n      const path = basePath.concat([i]);\n      patches.push({\n        op: ADD,\n        path,\n        // Need to maybe clone it, as it can in fact be the original value\n        // due to the base/copy inversion at the start of this function\n        value: clonePatchValueIfNeeded(copy_[i])\n      });\n    }\n    for (let i = copy_.length - 1; base_.length <= i; --i) {\n      const path = basePath.concat([i]);\n      inversePatches.push({\n        op: REMOVE,\n        path\n      });\n    }\n  }\n  function generatePatchesFromAssigned(state, basePath, patches, inversePatches) {\n    const { base_, copy_, type_ } = state;\n    each(state.assigned_, (key, assignedValue) => {\n      const origValue = get(base_, key, type_);\n      const value = get(copy_, key, type_);\n      const op = !assignedValue ? REMOVE : has(base_, key) ? REPLACE : ADD;\n      if (origValue === value && op === REPLACE)\n        return;\n      const path = basePath.concat(key);\n      patches.push(\n        op === REMOVE ? { op, path } : { op, path, value: clonePatchValueIfNeeded(value) }\n      );\n      inversePatches.push(\n        op === ADD ? { op: REMOVE, path } : op === REMOVE ? { op: ADD, path, value: clonePatchValueIfNeeded(origValue) } : { op: REPLACE, path, value: clonePatchValueIfNeeded(origValue) }\n      );\n    });\n  }\n  function generateSetPatches(state, basePath, patches, inversePatches) {\n    let { base_, copy_ } = state;\n    let i = 0;\n    base_.forEach((value) => {\n      if (!copy_.has(value)) {\n        const path = basePath.concat([i]);\n        patches.push({\n          op: REMOVE,\n          path,\n          value\n        });\n        inversePatches.unshift({\n          op: ADD,\n          path,\n          value\n        });\n      }\n      i++;\n    });\n    i = 0;\n    copy_.forEach((value) => {\n      if (!base_.has(value)) {\n        const path = basePath.concat([i]);\n        patches.push({\n          op: ADD,\n          path,\n          value\n        });\n        inversePatches.unshift({\n          op: REMOVE,\n          path,\n          value\n        });\n      }\n      i++;\n    });\n  }\n  function generateReplacementPatches_(baseValue, replacement, scope) {\n    const { patches_, inversePatches_ } = scope;\n    patches_.push({\n      op: REPLACE,\n      path: [],\n      value: replacement === NOTHING ? void 0 : replacement\n    });\n    inversePatches_.push({\n      op: REPLACE,\n      path: [],\n      value: baseValue\n    });\n  }\n  function applyPatches_(draft, patches) {\n    patches.forEach((patch) => {\n      const { path, op } = patch;\n      let base = draft;\n      for (let i = 0; i < path.length - 1; i++) {\n        const parentType = getArchtype(base);\n        let p = path[i];\n        if (typeof p !== \"string\" && typeof p !== \"number\") {\n          p = \"\" + p;\n        }\n        if ((parentType === 0 /* Object */ || parentType === 1 /* Array */) && (p === \"__proto__\" || p === CONSTRUCTOR))\n          die(errorOffset + 3);\n        if (isFunction(base) && p === PROTOTYPE)\n          die(errorOffset + 3);\n        base = get(base, p);\n        if (!isObjectish(base))\n          die(errorOffset + 2, path.join(\"/\"));\n      }\n      const type = getArchtype(base);\n      const value = deepClonePatchValue(patch.value);\n      const key = path[path.length - 1];\n      switch (op) {\n        case REPLACE:\n          switch (type) {\n            case 2 /* Map */:\n              return base.set(key, value);\n            case 3 /* Set */:\n              die(errorOffset);\n            default:\n              return base[key] = value;\n          }\n        case ADD:\n          switch (type) {\n            case 1 /* Array */:\n              return key === \"-\" ? base.push(value) : base.splice(key, 0, value);\n            case 2 /* Map */:\n              return base.set(key, value);\n            case 3 /* Set */:\n              return base.add(value);\n            default:\n              return base[key] = value;\n          }\n        case REMOVE:\n          switch (type) {\n            case 1 /* Array */:\n              return base.splice(key, 1);\n            case 2 /* Map */:\n              return base.delete(key);\n            case 3 /* Set */:\n              return base.delete(patch.value);\n            default:\n              return delete base[key];\n          }\n        default:\n          die(errorOffset + 1, op);\n      }\n    });\n    return draft;\n  }\n  function deepClonePatchValue(obj) {\n    if (!isDraftable(obj))\n      return obj;\n    if (isArray(obj))\n      return obj.map(deepClonePatchValue);\n    if (isMap(obj))\n      return new Map(\n        Array.from(obj.entries()).map(([k, v]) => [k, deepClonePatchValue(v)])\n      );\n    if (isSet(obj))\n      return new Set(Array.from(obj).map(deepClonePatchValue));\n    const cloned = Object.create(getPrototypeOf(obj));\n    for (const key in obj)\n      cloned[key] = deepClonePatchValue(obj[key]);\n    if (has(obj, DRAFTABLE))\n      cloned[DRAFTABLE] = obj[DRAFTABLE];\n    return cloned;\n  }\n  function clonePatchValueIfNeeded(obj) {\n    if (isDraft(obj)) {\n      return deepClonePatchValue(obj);\n    } else\n      return obj;\n  }\n  loadPlugin(PluginPatches, {\n    applyPatches_,\n    generatePatches_,\n    generateReplacementPatches_,\n    getPath\n  });\n}\n\n// src/plugins/mapset.ts\nfunction enableMapSet() {\n  class DraftMap extends Map {\n    constructor(target, parent) {\n      super();\n      this[DRAFT_STATE] = {\n        type_: 2 /* Map */,\n        parent_: parent,\n        scope_: parent ? parent.scope_ : getCurrentScope(),\n        modified_: false,\n        finalized_: false,\n        copy_: void 0,\n        assigned_: void 0,\n        base_: target,\n        draft_: this,\n        isManual_: false,\n        revoked_: false,\n        callbacks_: []\n      };\n    }\n    get size() {\n      return latest(this[DRAFT_STATE]).size;\n    }\n    has(key) {\n      return latest(this[DRAFT_STATE]).has(key);\n    }\n    set(key, value) {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (!latest(state).has(key) || latest(state).get(key) !== value) {\n        prepareMapCopy(state);\n        markChanged(state);\n        state.assigned_.set(key, true);\n        state.copy_.set(key, value);\n        state.assigned_.set(key, true);\n        handleCrossReference(state, key, value);\n      }\n      return this;\n    }\n    delete(key) {\n      if (!this.has(key)) {\n        return false;\n      }\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      prepareMapCopy(state);\n      markChanged(state);\n      if (state.base_.has(key)) {\n        state.assigned_.set(key, false);\n      } else {\n        state.assigned_.delete(key);\n      }\n      state.copy_.delete(key);\n      return true;\n    }\n    clear() {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (latest(state).size) {\n        prepareMapCopy(state);\n        markChanged(state);\n        state.assigned_ = /* @__PURE__ */ new Map();\n        each(state.base_, (key) => {\n          state.assigned_.set(key, false);\n        });\n        state.copy_.clear();\n      }\n    }\n    forEach(cb, thisArg) {\n      const state = this[DRAFT_STATE];\n      latest(state).forEach((_value, key, _map) => {\n        cb.call(thisArg, this.get(key), key, this);\n      });\n    }\n    get(key) {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      const value = latest(state).get(key);\n      if (state.finalized_ || !isDraftable(value)) {\n        return value;\n      }\n      if (value !== state.base_.get(key)) {\n        return value;\n      }\n      const draft = createProxy(state.scope_, value, state, key);\n      prepareMapCopy(state);\n      state.copy_.set(key, draft);\n      return draft;\n    }\n    keys() {\n      return latest(this[DRAFT_STATE]).keys();\n    }\n    values() {\n      const iterator = this.keys();\n      return {\n        [Symbol.iterator]: () => this.values(),\n        next: () => {\n          const r = iterator.next();\n          if (r.done)\n            return r;\n          const value = this.get(r.value);\n          return {\n            done: false,\n            value\n          };\n        }\n      };\n    }\n    entries() {\n      const iterator = this.keys();\n      return {\n        [Symbol.iterator]: () => this.entries(),\n        next: () => {\n          const r = iterator.next();\n          if (r.done)\n            return r;\n          const value = this.get(r.value);\n          return {\n            done: false,\n            value: [r.value, value]\n          };\n        }\n      };\n    }\n    [(DRAFT_STATE, Symbol.iterator)]() {\n      return this.entries();\n    }\n  }\n  function proxyMap_(target, parent) {\n    const map = new DraftMap(target, parent);\n    return [map, map[DRAFT_STATE]];\n  }\n  function prepareMapCopy(state) {\n    if (!state.copy_) {\n      state.assigned_ = /* @__PURE__ */ new Map();\n      state.copy_ = new Map(state.base_);\n    }\n  }\n  class DraftSet extends Set {\n    constructor(target, parent) {\n      super();\n      this[DRAFT_STATE] = {\n        type_: 3 /* Set */,\n        parent_: parent,\n        scope_: parent ? parent.scope_ : getCurrentScope(),\n        modified_: false,\n        finalized_: false,\n        copy_: void 0,\n        base_: target,\n        draft_: this,\n        drafts_: /* @__PURE__ */ new Map(),\n        revoked_: false,\n        isManual_: false,\n        assigned_: void 0,\n        callbacks_: []\n      };\n    }\n    get size() {\n      return latest(this[DRAFT_STATE]).size;\n    }\n    has(value) {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (!state.copy_) {\n        return state.base_.has(value);\n      }\n      if (state.copy_.has(value))\n        return true;\n      if (state.drafts_.has(value) && state.copy_.has(state.drafts_.get(value)))\n        return true;\n      return false;\n    }\n    add(value) {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (!this.has(value)) {\n        prepareSetCopy(state);\n        markChanged(state);\n        state.copy_.add(value);\n        handleCrossReference(state, value, value);\n      }\n      return this;\n    }\n    delete(value) {\n      if (!this.has(value)) {\n        return false;\n      }\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      prepareSetCopy(state);\n      markChanged(state);\n      return state.copy_.delete(value) || (state.drafts_.has(value) ? state.copy_.delete(state.drafts_.get(value)) : (\n        /* istanbul ignore next */\n        false\n      ));\n    }\n    clear() {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (latest(state).size) {\n        prepareSetCopy(state);\n        markChanged(state);\n        state.copy_.clear();\n      }\n    }\n    values() {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      prepareSetCopy(state);\n      return state.copy_.values();\n    }\n    entries() {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      prepareSetCopy(state);\n      return state.copy_.entries();\n    }\n    keys() {\n      return this.values();\n    }\n    [(DRAFT_STATE, Symbol.iterator)]() {\n      return this.values();\n    }\n    forEach(cb, thisArg) {\n      const iterator = this.values();\n      let result = iterator.next();\n      while (!result.done) {\n        cb.call(thisArg, result.value, result.value, this);\n        result = iterator.next();\n      }\n    }\n  }\n  function proxySet_(target, parent) {\n    const set2 = new DraftSet(target, parent);\n    return [set2, set2[DRAFT_STATE]];\n  }\n  function prepareSetCopy(state) {\n    if (!state.copy_) {\n      state.copy_ = /* @__PURE__ */ new Set();\n      state.base_.forEach((value) => {\n        if (isDraftable(value)) {\n          const draft = createProxy(state.scope_, value, state, value);\n          state.drafts_.set(value, draft);\n          state.copy_.add(draft);\n        } else {\n          state.copy_.add(value);\n        }\n      });\n    }\n  }\n  function assertUnrevoked(state) {\n    if (state.revoked_)\n      die(3, JSON.stringify(latest(state)));\n  }\n  function fixSetContents(target) {\n    if (target.type_ === 3 /* Set */ && target.copy_) {\n      const copy = new Set(target.copy_);\n      target.copy_.clear();\n      copy.forEach((value) => {\n        target.copy_.add(getValue(value));\n      });\n    }\n  }\n  loadPlugin(PluginMapSet, { proxyMap_, proxySet_, fixSetContents });\n}\n\n// src/plugins/arrayMethods.ts\nfunction enableArrayMethods() {\n  const SHIFTING_METHODS = /* @__PURE__ */ new Set([\"shift\", \"unshift\"]);\n  const QUEUE_METHODS = /* @__PURE__ */ new Set([\"push\", \"pop\"]);\n  const RESULT_RETURNING_METHODS = /* @__PURE__ */ new Set([\n    ...QUEUE_METHODS,\n    ...SHIFTING_METHODS\n  ]);\n  const REORDERING_METHODS = /* @__PURE__ */ new Set([\"reverse\", \"sort\"]);\n  const MUTATING_METHODS = /* @__PURE__ */ new Set([\n    ...RESULT_RETURNING_METHODS,\n    ...REORDERING_METHODS,\n    \"splice\"\n  ]);\n  const FIND_METHODS = /* @__PURE__ */ new Set([\"find\", \"findLast\"]);\n  const NON_MUTATING_METHODS = /* @__PURE__ */ new Set([\n    \"filter\",\n    \"slice\",\n    \"concat\",\n    \"flat\",\n    ...FIND_METHODS,\n    \"findIndex\",\n    \"findLastIndex\",\n    \"some\",\n    \"every\",\n    \"indexOf\",\n    \"lastIndexOf\",\n    \"includes\",\n    \"join\",\n    \"toString\",\n    \"toLocaleString\"\n  ]);\n  function isMutatingArrayMethod(method) {\n    return MUTATING_METHODS.has(method);\n  }\n  function isNonMutatingArrayMethod(method) {\n    return NON_MUTATING_METHODS.has(method);\n  }\n  function isArrayOperationMethod(method) {\n    return isMutatingArrayMethod(method) || isNonMutatingArrayMethod(method);\n  }\n  function enterOperation(state, method) {\n    state.operationMethod = method;\n  }\n  function exitOperation(state) {\n    state.operationMethod = void 0;\n  }\n  function executeArrayMethod(state, operation, markLength = true) {\n    prepareCopy(state);\n    const result = operation();\n    markChanged(state);\n    if (markLength)\n      state.assigned_.set(\"length\", true);\n    return result;\n  }\n  function markAllIndicesReassigned(state) {\n    state.allIndicesReassigned_ = true;\n  }\n  function normalizeSliceIndex(index, length) {\n    if (index < 0) {\n      return Math.max(length + index, 0);\n    }\n    return Math.min(index, length);\n  }\n  function handleInsertedValues(state, startIndex, values) {\n    for (let i = 0; i < values.length; i++) {\n      const index = startIndex + i;\n      state.assigned_.set(index, true);\n      handleCrossReference(state, index, values[i]);\n    }\n  }\n  function handleSimpleOperation(state, method, args) {\n    return executeArrayMethod(state, () => {\n      const lengthBefore = state.copy_.length;\n      const result = state.copy_[method](...args);\n      if (SHIFTING_METHODS.has(method)) {\n        markAllIndicesReassigned(state);\n      }\n      if (method === \"push\" && args.length > 0) {\n        handleInsertedValues(state, lengthBefore, args);\n      } else if (method === \"unshift\" && args.length > 0) {\n        handleInsertedValues(state, 0, args);\n      }\n      return RESULT_RETURNING_METHODS.has(method) ? result : state.draft_;\n    });\n  }\n  function handleReorderingOperation(state, method, args) {\n    return executeArrayMethod(\n      state,\n      () => {\n        ;\n        state.copy_[method](...args);\n        markAllIndicesReassigned(state);\n        return state.draft_;\n      },\n      false\n    );\n  }\n  function createMethodInterceptor(state, originalMethod) {\n    return function interceptedMethod(...args) {\n      const method = originalMethod;\n      enterOperation(state, method);\n      try {\n        if (isMutatingArrayMethod(method)) {\n          if (RESULT_RETURNING_METHODS.has(method)) {\n            return handleSimpleOperation(state, method, args);\n          }\n          if (REORDERING_METHODS.has(method)) {\n            return handleReorderingOperation(state, method, args);\n          }\n          if (method === \"splice\") {\n            const res = executeArrayMethod(\n              state,\n              () => state.copy_.splice(...args)\n            );\n            markAllIndicesReassigned(state);\n            if (args.length > 2) {\n              const startIndex = normalizeSliceIndex(\n                args[0] ?? 0,\n                state.copy_.length\n              );\n              handleInsertedValues(state, startIndex, args.slice(2));\n            }\n            return res;\n          }\n        } else {\n          return handleNonMutatingOperation(state, method, args);\n        }\n      } finally {\n        exitOperation(state);\n      }\n    };\n  }\n  function handleNonMutatingOperation(state, method, args) {\n    const source = latest(state);\n    if (method === \"filter\") {\n      const predicate = args[0];\n      const result = [];\n      for (let i = 0; i < source.length; i++) {\n        if (predicate(source[i], i, source)) {\n          result.push(state.draft_[i]);\n        }\n      }\n      return result;\n    }\n    if (FIND_METHODS.has(method)) {\n      const predicate = args[0];\n      const isForward = method === \"find\";\n      const step = isForward ? 1 : -1;\n      const start = isForward ? 0 : source.length - 1;\n      for (let i = start; i >= 0 && i < source.length; i += step) {\n        if (predicate(source[i], i, source)) {\n          return state.draft_[i];\n        }\n      }\n      return void 0;\n    }\n    if (method === \"slice\") {\n      const rawStart = args[0] ?? 0;\n      const rawEnd = args[1] ?? source.length;\n      const start = normalizeSliceIndex(rawStart, source.length);\n      const end = normalizeSliceIndex(rawEnd, source.length);\n      const result = [];\n      for (let i = start; i < end; i++) {\n        result.push(state.draft_[i]);\n      }\n      return result;\n    }\n    return source[method](...args);\n  }\n  loadPlugin(PluginArrayMethods, {\n    createMethodInterceptor,\n    isArrayOperationMethod,\n    isMutatingArrayMethod\n  });\n}\n\n// src/immer.ts\nvar immer = new Immer2();\nvar produce = immer.produce;\nvar produceWithPatches = /* @__PURE__ */ immer.produceWithPatches.bind(\n  immer\n);\nvar setAutoFreeze = /* @__PURE__ */ immer.setAutoFreeze.bind(immer);\nvar setUseStrictShallowCopy = /* @__PURE__ */ immer.setUseStrictShallowCopy.bind(\n  immer\n);\nvar setUseStrictIteration = /* @__PURE__ */ immer.setUseStrictIteration.bind(\n  immer\n);\nvar applyPatches = /* @__PURE__ */ immer.applyPatches.bind(immer);\nvar createDraft = /* @__PURE__ */ immer.createDraft.bind(immer);\nvar finishDraft = /* @__PURE__ */ immer.finishDraft.bind(immer);\nvar castDraft = (value) => value;\nvar castImmutable = (value) => value;\nexport {\n  Immer2 as Immer,\n  applyPatches,\n  castDraft,\n  castImmutable,\n  createDraft,\n  current,\n  enableArrayMethods,\n  enableMapSet,\n  enablePatches,\n  finishDraft,\n  freeze,\n  DRAFTABLE as immerable,\n  isDraft,\n  isDraftable,\n  NOTHING as nothing,\n  original,\n  produce,\n  produceWithPatches,\n  setAutoFreeze,\n  setUseStrictIteration,\n  setUseStrictShallowCopy\n};\n//# sourceMappingURL=immer.mjs.map","// src/store/types.ts\nimport { Draft } from 'immer'\nimport { BehaviorSubject, Observable, Subject } from 'rxjs'\n\n/**\n * Storage types supported by the store\n */\nexport type StorageType = 'memory' | 'local' | 'session' | 'indexeddb'\n\n/**\n * Base store options\n */\nexport interface StoreOptions<T> {\n\t/** Key used for persistent storage */\n\tkey: string\n\n\t/** Storage type */\n\tstorage: StorageType\n\n\t/** Initial state */\n\tinitialState: T\n\n\t/** Enable dev tools */\n\tdevTools?: boolean\n}\n\n/**\n * Enhanced store error with type information and better context handling\n */\nexport class StoreError<T = unknown> extends Error {\n\t/** Original error that caused this store error */\n\tpublic readonly cause?: T\n\n\t/** Additional contextual information */\n\tpublic readonly context?: Record<string, unknown>\n\n\t/** Timestamp when the error occurred */\n\tpublic readonly timestamp: Date\n\n\tconstructor(message: string, cause?: T, context?: Record<string, unknown>) {\n\t\tsuper(message)\n\t\tthis.name = 'StoreError'\n\t\tthis.cause = cause\n\t\tthis.context = context\n\t\tthis.timestamp = new Date()\n\n\t\t// Capture stack trace if available\n\t\tif (Error.captureStackTrace) {\n\t\t\tError.captureStackTrace(this, StoreError)\n\t\t}\n\t}\n\n\t/**\n\t * Returns a JSON-serializable representation of the error\n\t */\n\ttoJSON(): Record<string, unknown> {\n\t\treturn {\n\t\t\tname: this.name,\n\t\t\tmessage: this.message,\n\t\t\tcause: this.cause,\n\t\t\tcontext: this.context,\n\t\t\ttimestamp: this.timestamp.toISOString(),\n\t\t\tstack: this.stack,\n\t\t}\n\t}\n}\n\n/**\n * Core store interface with improved type definitions\n */\nexport interface IStore<T extends Record<string, any>> {\n\t/** Get the current store value */\n\treadonly value: T\n\n\t/** Observable stream of store values */\n\treadonly $: BehaviorSubject<T>\n\n\t/** The default/initial value of the store */\n\treadonly defaultValue: T\n\n\t/** Whether the store is ready (loaded from storage) */\n\tready: boolean\n\n\t/** Observable stream of store errors */\n\treadonly error$: Subject<StoreError | null>\n\n\t/**\n\t * Update store value with partial data\n\t * @param value Partial data to update\n\t * @param merge Whether to merge with existing data (default: true)\n\t */\n\tset(value: Partial<T>, merge?: boolean): void\n\n\t/**\n\t * Reset store to default value\n\t */\n\tclear(): void\n\n\t/**\n\t * Replace entire store value\n\t * @param newValue New value to set\n\t */\n\treplace(newValue: T): void\n\n\t/**\n\t * Delete a specific key from the store\n\t * @param key Key to delete\n\t */\n\tdelete<K extends keyof T>(key: K): void\n\n\t/**\n\t * Clean up resources\n\t */\n\tdestroy(): void\n}\n\n/**\n * Interface for collection stores with improved typing\n */\nexport interface ICollectionStore<T> {\n\t/** Get the current collection value */\n\treadonly value: Map<string, T>\n\n\t/** Observable stream of collection values */\n\treadonly $: BehaviorSubject<Map<string, T>>\n\n\t/** The default/initial value of the collection */\n\treadonly defaultValue: Map<string, T>\n\n\t/** Whether the store is ready (loaded from storage) */\n\tready: boolean\n\n\t/** Observable stream of store errors */\n\treadonly error$: Observable<StoreError | null>\n\n\t/**\n\t * Set a value in the collection\n\t * @param key Item key\n\t * @param value Item value\n\t */\n\tset<V = T>(key: string, value: V): void\n\n\t/**\n\t * Delete an item from the collection\n\t * @param key Item key to delete\n\t */\n\tdelete(key: string): void\n\n\t/**\n\t * Clear all items from the collection\n\t */\n\tclear(): void\n\n\t/**\n\t * Replace the entire collection\n\t * @param newValue New collection value\n\t */\n\treplace(newValue: Map<string, T>): void\n\n\t/**\n\t * Clean up resources\n\t */\n\tdestroy(): void\n}\n\n/**\n * Interface for a storage manager\n */\nexport interface IStorageManager<T> {\n\t/**\n\t * Load data from storage\n\t * @returns Promise resolving to stored data or null\n\t */\n\tload(): Promise<T | null>\n\n\t/**\n\t * Save data to storage\n\t * @param state Data to save\n\t */\n\tsave(state: T): Promise<void>\n\n\t/**\n\t * Clear data from storage\n\t */\n\tclear(): Promise<void>\n}\n\n/**\n * Factory function type for creating stores\n */\nexport type StoreFactory = <T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n) => IStore<T>\n\n/**\n * Factory function type for creating collection stores\n */\nexport type CollectionStoreFactory = <T>(\n\tinitialData: Map<string, T>,\n\tstorage: StorageType,\n\tkey: string,\n) => ICollectionStore<T>\n// Add this to your src/store/types.ts file\n\n/**\n * Interface for array stores with improved typing\n */\nexport interface IArrayStore<T> {\n\t/** Get the current array value */\n\treadonly value: T[]\n\n\t/** Observable stream of array values */\n\treadonly $: BehaviorSubject<T[]>\n\n\t/** The default/initial value of the array */\n\treadonly defaultValue: T[]\n\n\t/** Whether the store is ready (loaded from storage) */\n\tready: boolean\n\n\t/** Observable stream of store errors */\n\treadonly error$: Observable<StoreError | null>\n\n\t/**\n\t * Add item(s) to the end of the array\n\t * @param items Items to add\n\t */\n\tpush(...items: T[]): void\n\n\t/**\n\t * Remove and return the last item from the array\n\t * @returns The removed item or undefined if the array was empty\n\t */\n\tpop(): T | undefined\n\n\t/**\n\t * Add item(s) to the beginning of the array\n\t * @param items Items to add\n\t */\n\tunshift(...items: T[]): void\n\n\t/**\n\t * Remove and return the first item from the array\n\t * @returns The removed item or undefined if the array was empty\n\t */\n\tshift(): T | undefined\n\n\t/**\n\t * Update an item at a specific index\n\t * @param index The index to update\n\t * @param value The new value\n\t */\n\tset(index: number, value: T): void\n\n\t/**\n\t * Get the item at a specific index\n\t * @param index The index to get\n\t * @returns The item or undefined if index is out of bounds\n\t */\n\tget(index: number): T | undefined\n\n\t/**\n\t * Remove items from the array and optionally insert new ones\n\t * @param start The start index\n\t * @param deleteCount The number of items to delete\n\t * @param items Items to insert\n\t * @returns The removed items\n\t */\n\tsplice(start: number, deleteCount?: number, ...items: T[]): T[]\n\n\t/**\n\t * Remove an item by value (first occurrence)\n\t * @param item The item to remove\n\t * @param compareFn Optional function to compare items\n\t * @returns True if the item was found and removed\n\t */\n\tremove(item: T, compareFn?: (a: T, b: T) => boolean): boolean\n\n\t/**\n\t * Replace the entire array\n\t * @param newArray The new array\n\t */\n\treplace(newArray: T[]): void\n\n\t/**\n\t * Filter items in the array\n\t * @param predicate Function to test each item\n\t */\n\tfilter(predicate: (value: T, index: number, array: T[]) => boolean): void\n\n\t/**\n\t * Map over the array and transform items\n\t * @param mapper Function to transform each item\n\t * @returns Array of transformed items\n\t */\n\tmap<U>(mapper: (value: T, index: number, array: T[]) => U): U[]\n\n\t/**\n\t * Sort the array in place\n\t * @param compareFn Optional function to determine sort order\n\t */\n\tsort(compareFn?: (a: T, b: T) => number): void\n\n\t/**\n\t * Update a specific item using a callback function\n\t * @param index The index to update\n\t * @param updater Function that can modify the item\n\t */\n\tupdate(index: number, updater: (item: Draft<T>) => void): void\n\n\t/**\n\t * Clear all items from the array\n\t */\n\tclear(): void\n\n\t/**\n\t * Clean up resources\n\t */\n\tdestroy(): void\n}\n\n/**\n * Factory function type for creating array stores\n */\nexport type ArrayStoreFactory = <T>(initialData: T[], storage: StorageType, key: string) => IArrayStore<T>\n","import { IStorageManager, StorageType, StoreError } from './types'\n\n/**\n * Custom JSON replacer to handle Map and Set serialization\n *\n * LIMITATIONS:\n * - Only supports Maps with string/number/primitive keys\n * - Object keys will be stringified and may collide (e.g., {id: 1} and {id: 2} both become \"[object Object]\")\n * - Circular references are not supported (JSON.stringify limitation)\n *\n * @example\n * ```typescript\n * // ✅ Supported\n * new Map([['key', 'value'], [123, 'number-key']])\n *\n * // ❌ Not supported (object keys will become strings)\n * new Map([[{id: 1}, 'value']])\n * ```\n */\nfunction mapSetReplacer(_key: string, value: unknown): unknown {\n\tif (value instanceof Map) {\n\t\treturn {\n\t\t\t__type: 'Map',\n\t\t\tentries: Array.from(value.entries()),\n\t\t}\n\t}\n\tif (value instanceof Set) {\n\t\treturn {\n\t\t\t__type: 'Set',\n\t\t\tvalues: Array.from(value.values()),\n\t\t}\n\t}\n\treturn value\n}\n\n/**\n * Custom JSON reviver to handle Map and Set deserialization\n *\n * Includes validation to prevent malformed data or __type injection attacks.\n * Invalid structures are ignored and returned as-is.\n */\nfunction mapSetReviver(_key: string, value: unknown): unknown {\n\tif (value && typeof value === 'object' && '__type' in value) {\n\t\tconst typed = value as { __type: string; entries?: unknown[]; values?: unknown[] }\n\n\t\t// Validate and reconstruct Map\n\t\tif (typed.__type === 'Map') {\n\t\t\tif (!Array.isArray(typed.entries)) {\n\t\t\t\tconsole.warn('Invalid Map structure in storage (entries not an array), ignoring')\n\t\t\t\treturn value\n\t\t\t}\n\t\t\t// Validate all entries are [key, value] pairs\n\t\t\tconst isValid = typed.entries.every(e => Array.isArray(e) && e.length === 2)\n\t\t\tif (!isValid) {\n\t\t\t\tconsole.warn('Invalid Map structure in storage (malformed entries), ignoring')\n\t\t\t\treturn value\n\t\t\t}\n\t\t\treturn new Map(typed.entries as Iterable<readonly [unknown, unknown]>)\n\t\t}\n\n\t\t// Validate and reconstruct Set\n\t\tif (typed.__type === 'Set') {\n\t\t\tif (!Array.isArray(typed.values)) {\n\t\t\t\tconsole.warn('Invalid Set structure in storage (values not an array), ignoring')\n\t\t\t\treturn value\n\t\t\t}\n\t\t\treturn new Set(typed.values)\n\t\t}\n\n\t\t// Unknown __type marker, log warning and ignore\n\t\tconsole.warn(`Unknown __type \"${typed.__type}\" in storage, ignoring`)\n\t}\n\treturn value\n}\n\n/**\n * Memory storage manager implementation\n */\nexport class MemoryStorageManager<T> implements IStorageManager<T> {\n\tprivate data: T | null = null\n\n\tasync load(): Promise<T | null> {\n\t\treturn this.data\n\t}\n\n\tasync save(state: T): Promise<void> {\n\t\tthis.data = state\n\t}\n\n\tasync clear(): Promise<void> {\n\t\tthis.data = null\n\t}\n}\n\n/**\n * Local storage manager implementation\n */\nexport class LocalStorageManager<T> implements IStorageManager<T> {\n\tconstructor(private key: string) {}\n\n\tasync load(): Promise<T | null> {\n\t\ttry {\n\t\t\tconst data = localStorage.getItem(this.key)\n\t\t\treturn data ? JSON.parse(data, mapSetReviver) : null\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to load from localStorage (${this.key}):`, err)\n\t\t\treturn null\n\t\t}\n\t}\n\n\tasync save(state: T): Promise<void> {\n\t\ttry {\n\t\t\tlocalStorage.setItem(this.key, JSON.stringify(state, mapSetReplacer))\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to save to localStorage (${this.key}):`, err)\n\t\t\tthrow new StoreError<unknown>(`Failed to save to localStorage (${this.key})`, err)\n\t\t}\n\t}\n\n\tasync clear(): Promise<void> {\n\t\tlocalStorage.removeItem(this.key)\n\t}\n}\n\n/**\n * Session storage manager implementation\n */\nexport class SessionStorageManager<T> implements IStorageManager<T> {\n\tconstructor(private key: string) {}\n\n\tasync load(): Promise<T | null> {\n\t\ttry {\n\t\t\tconst data = sessionStorage.getItem(this.key)\n\t\t\treturn data ? JSON.parse(data, mapSetReviver) : null\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to load from sessionStorage (${this.key}):`, err)\n\t\t\treturn null\n\t\t}\n\t}\n\n\tasync save(state: T): Promise<void> {\n\t\ttry {\n\t\t\tsessionStorage.setItem(this.key, JSON.stringify(state, mapSetReplacer))\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to save to sessionStorage (${this.key}):`, err)\n\t\t\tthrow new StoreError<unknown>(`Failed to save to sessionStorage (${this.key})`, err)\n\t\t}\n\t}\n\n\tasync clear(): Promise<void> {\n\t\tsessionStorage.removeItem(this.key)\n\t}\n}\n\n/**\n * IndexedDB storage manager implementation with better error typing\n */\nexport class IndexedDBStorageManager<T> implements IStorageManager<T> {\n\tprivate static DB_NAME = 'StoreDB'\n\tprivate static STORE_NAME = 'states'\n\tprivate static DB_VERSION = 1\n\n\tconstructor(private key: string) {}\n\n\tprivate openDB(): Promise<IDBDatabase> {\n\t\treturn new Promise<IDBDatabase>((resolve, reject) => {\n\t\t\tconst request = indexedDB.open(IndexedDBStorageManager.DB_NAME, IndexedDBStorageManager.DB_VERSION)\n\n\t\t\trequest.onupgradeneeded = () => {\n\t\t\t\tconst db = request.result\n\t\t\t\tif (!db.objectStoreNames.contains(IndexedDBStorageManager.STORE_NAME)) {\n\t\t\t\t\tdb.createObjectStore(IndexedDBStorageManager.STORE_NAME)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\trequest.onsuccess = () => resolve(request.result)\n\t\t\trequest.onerror = () => reject(request.error)\n\t\t})\n\t}\n\n\tasync load(): Promise<T | null> {\n\t\ttry {\n\t\t\tconst db = await this.openDB()\n\t\t\treturn new Promise<T | null>((resolve, reject) => {\n\t\t\t\tconst transaction = db.transaction(IndexedDBStorageManager.STORE_NAME, 'readonly')\n\t\t\t\tconst store = transaction.objectStore(IndexedDBStorageManager.STORE_NAME)\n\t\t\t\tconst request = store.get(this.key)\n\n\t\t\t\trequest.onsuccess = () => {\n\t\t\t\t\tdb.close()\n\t\t\t\t\tresolve(request.result || null)\n\t\t\t\t}\n\n\t\t\t\trequest.onerror = () => {\n\t\t\t\t\tdb.close()\n\t\t\t\t\treject(request.error)\n\t\t\t\t}\n\t\t\t})\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to load from IndexedDB (${this.key}):`, err)\n\t\t\treturn null\n\t\t}\n\t}\n\n\tasync save(state: T): Promise<void> {\n\t\ttry {\n\t\t\tconst db = await this.openDB()\n\t\t\treturn new Promise<void>((resolve, reject) => {\n\t\t\t\tconst transaction = db.transaction(IndexedDBStorageManager.STORE_NAME, 'readwrite')\n\t\t\t\tconst store = transaction.objectStore(IndexedDBStorageManager.STORE_NAME)\n\t\t\t\tconst request = store.put(state, this.key)\n\n\t\t\t\trequest.onsuccess = () => {\n\t\t\t\t\tdb.close()\n\t\t\t\t\tresolve()\n\t\t\t\t}\n\n\t\t\t\trequest.onerror = () => {\n\t\t\t\t\tdb.close()\n\t\t\t\t\treject(request.error)\n\t\t\t\t}\n\t\t\t})\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to save to IndexedDB (${this.key}):`, err)\n\t\t\tthrow new StoreError<unknown>(`Failed to save to IndexedDB (${this.key})`, err)\n\t\t}\n\t}\n\n\tasync clear(): Promise<void> {\n\t\ttry {\n\t\t\tconst db = await this.openDB()\n\t\t\treturn new Promise<void>((resolve, reject) => {\n\t\t\t\tconst transaction = db.transaction(IndexedDBStorageManager.STORE_NAME, 'readwrite')\n\t\t\t\tconst store = transaction.objectStore(IndexedDBStorageManager.STORE_NAME)\n\t\t\t\tconst request = store.delete(this.key)\n\n\t\t\t\trequest.onsuccess = () => {\n\t\t\t\t\tdb.close()\n\t\t\t\t\tresolve()\n\t\t\t\t}\n\n\t\t\t\trequest.onerror = () => {\n\t\t\t\t\tdb.close()\n\t\t\t\t\treject(request.error)\n\t\t\t\t}\n\t\t\t})\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to clear from IndexedDB (${this.key}):`, err)\n\t\t\tthrow new StoreError<unknown>(`Failed to clear from IndexedDB (${this.key})`, err)\n\t\t}\n\t}\n}\n\n/**\n * Factory function to create the appropriate storage manager\n */\nexport function createStorageManager<T>(type: StorageType, key: string): IStorageManager<T> {\n\tswitch (type) {\n\t\tcase 'local':\n\t\t\treturn new LocalStorageManager<T>(key)\n\t\tcase 'session':\n\t\t\treturn new SessionStorageManager<T>(key)\n\t\tcase 'indexeddb':\n\t\t\treturn new IndexedDBStorageManager<T>(key)\n\t\tcase 'memory':\n\t\tdefault:\n\t\t\treturn new MemoryStorageManager<T>()\n\t}\n}\n","// src/store/store.class.ts - Fixed version\n\nimport { produce, enableMapSet, immerable } from 'immer'\nimport { BehaviorSubject, Subject } from 'rxjs'\nimport { createStorageManager } from './storage-manager'\nimport { IStorageManager, StorageType, StoreError } from './types'\n\n// Enable Map and Set support for Immer\nenableMapSet()\n\n/**\n * Base store class to handle common functionality between store types\n * Now with Immer integration for immutability\n */\nexport abstract class BaseStore<T> {\n\t// Mark the class as immerable to allow Immer to create drafts\n\t[immerable] = true\n\n\t// State tracking\n\tprotected _ready: boolean = false\n\tprotected _destroy$ = new Subject<void>()\n\n\t// Observable streams\n\tpublic $: BehaviorSubject<T>\n\tpublic error$ = new BehaviorSubject<StoreError | null>(null)\n\n\t// Default value for the store\n\tpublic readonly defaultValue: T\n\n\t// Storage manager\n\tprotected storage: IStorageManager<T>\n\n\t/**\n\t * Get store ready state\n\t */\n\tpublic get ready(): boolean {\n\t\treturn this._ready\n\t}\n\n\t/**\n\t * Set store ready state\n\t */\n\tpublic set ready(value: boolean) {\n\t\tthis._ready = value\n\t\tthis.updateState(this.$.value)\n\t}\n\n\t/**\n\t * Get the current value\n\t */\n\tpublic get value(): T {\n\t\treturn this.$.getValue()\n\t}\n\n\t/**\n\t * Initialize the base store\n\t * @param storageType Storage type to use\n\t * @param key Unique key for the store\n\t * @param defaultValue Default/initial value\n\t */\n\tconstructor(\n\t\tprotected storageType: StorageType,\n\t\tprotected key: string,\n\t\tdefaultValue: T,\n\t) {\n\t\t// Before using produce, ensure the input is draftable\n\t\t// This ensures Immer won't throw an error on non-draftable values\n\t\tlet safeDefaultValue: T\n\n\t\tif (defaultValue instanceof Map) {\n\t\t\t// For Maps, create a new Map instance\n\t\t\tsafeDefaultValue = new Map(defaultValue) as unknown as T\n\t\t} else if (Array.isArray(defaultValue)) {\n\t\t\t// For arrays, create a new array instance\n\t\t\tsafeDefaultValue = [...defaultValue] as unknown as T\n\t\t} else if (defaultValue && typeof defaultValue === 'object') {\n\t\t\t// For objects, create a shallow copy\n\t\t\tsafeDefaultValue = { ...defaultValue } as T\n\t\t} else {\n\t\t\t// For primitives or other non-draftable types\n\t\t\tsafeDefaultValue = defaultValue\n\t\t}\n\n\t\t// Make an immutable copy of the default value when possible\n\t\ttry {\n\t\t\tthis.defaultValue = this.isImmerDraftable(safeDefaultValue)\n\t\t\t\t? produce(safeDefaultValue, draft => draft)\n\t\t\t\t: safeDefaultValue\n\t\t} catch (error) {\n\t\t\tconsole.warn(`[BaseStore] Unable to produce immutable copy of defaultValue:`, error)\n\t\t\tthis.defaultValue = safeDefaultValue\n\t\t}\n\n\t\t// Initialize BehaviorSubject with the default value\n\t\tthis.$ = new BehaviorSubject<T>(this.defaultValue)\n\t\tthis.storage = createStorageManager<T>(storageType, key)\n\n\t\t// Set ready immediately for memory storage\n\t\tif (storageType === 'memory') {\n\t\t\tthis._ready = true\n\t\t} else {\n\t\t\t// Initialize from storage for persistent stores\n\t\t\tthis.initializeFromStorage()\n\t\t}\n\t}\n\n\t/**\n\t * Check if a value can be safely used with Immer's produce\n\t */\n\tprotected isImmerDraftable(value: any): boolean {\n\t\treturn (\n\t\t\tvalue !== null &&\n\t\t\ttypeof value === 'object' &&\n\t\t\t(Array.isArray(value) ||\n\t\t\t\tvalue instanceof Map ||\n\t\t\t\tvalue instanceof Set ||\n\t\t\t\tObject.getPrototypeOf(value) === Object.prototype ||\n\t\t\t\tvalue[immerable] === true)\n\t\t)\n\t}\n\n\t/**\n\t * Cleanup method for all store types\n\t */\n\tpublic destroy(): void {\n\t\tthis._destroy$.next()\n\t\tthis._destroy$.complete()\n\t\tthis.$.complete()\n\t\tthis.error$.complete()\n\t}\n\n\t/**\n\t * Replace the entire store state immutably\n\t */\n\tpublic replace(newValue: T): void {\n\t\ttry {\n\t\t\t// Use Immer to create an immutable copy if possible\n\t\t\tconst nextState = this.isImmerDraftable(newValue) ? produce(newValue, draft => draft) : newValue\n\n\t\t\tthis.updateState(nextState)\n\t\t} catch (error) {\n\t\t\tconst storeError = new StoreError<unknown>(`Error replacing state in ${this.key}`, error)\n\t\t\tthis.error$.next(storeError)\n\t\t\tconsole.error(storeError)\n\n\t\t\t// Fallback to direct assignment\n\t\t\tthis.updateState(newValue)\n\t\t}\n\t}\n\n\t/**\n\t * Reset to default value - to be implemented by subclasses\n\t */\n\tpublic abstract clear(): void\n\n\t/**\n\t * Update the state with proper error handling and immutability\n\t */\n\tprotected updateState(newValue: T): void {\n\t\ttry {\n\t\t\t// Ensure immutability by creating a fresh copy with Immer when possible\n\t\t\tlet nextState: T\n\n\t\t\tif (this.isImmerDraftable(newValue)) {\n\t\t\t\tnextState = produce(newValue, draft => draft)\n\t\t\t} else {\n\t\t\t\tnextState = newValue\n\t\t\t}\n\n\t\t\tthis.$.next(nextState)\n\n\t\t\t// Persist to storage\n\t\t\tif (this.storageType !== 'memory') {\n\t\t\t\tthis.persistToStorage(nextState).catch(err => {\n\t\t\t\t\tconst error = new StoreError<unknown>(`Error saving to ${this.storageType} storage for ${this.key}`, err)\n\t\t\t\t\tthis.error$.next(error)\n\t\t\t\t\tconsole.error(error)\n\t\t\t\t})\n\t\t\t}\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error updating state in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\n\t\t\t// Fallback to direct update\n\t\t\tthis.$.next(newValue)\n\t\t}\n\t}\n\n\t/**\n\t * Initialize the store from persistent storage\n\t */\n\tprotected async initializeFromStorage(): Promise<void> {\n\t\ttry {\n\t\t\tconst storedValue = await this.storage.load()\n\t\t\tif (storedValue) {\n\t\t\t\t// Process and update state with the stored value\n\t\t\t\tconst processedValue = this.processStoredValue(storedValue)\n\n\t\t\t\ttry {\n\t\t\t\t\t// Only use Immer if the value is draftable\n\t\t\t\t\tconst immutableValue = this.isImmerDraftable(processedValue)\n\t\t\t\t\t\t? produce(processedValue, draft => draft)\n\t\t\t\t\t\t: processedValue\n\n\t\t\t\t\tthis.updateState(immutableValue)\n\t\t\t\t} catch (error) {\n\t\t\t\t\tconsole.warn(`[BaseStore] Unable to create immutable copy, using value directly:`, error)\n\t\t\t\t\tthis.updateState(processedValue)\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis._ready = true\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error loading from ${this.storageType} storage for ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t\tthis._ready = true // Mark as ready even if loading fails\n\t\t}\n\t}\n\n\t/**\n\t * Process stored value (can be overridden by subclasses)\n\t */\n\tprotected processStoredValue(storedValue: T): T {\n\t\treturn storedValue\n\t}\n\n\t/**\n\t * Persist state to storage\n\t */\n\tprotected async persistToStorage(state: T): Promise<void> {\n\t\treturn this.storage.save(state)\n\t}\n\n\t/**\n\t * Setup development tools\n\t */\n\tprotected abstract setupDevTools(): void\n}\n","// src/store/context-array.ts - Array store implementation with Immer\nimport { Draft, castDraft, produce } from 'immer'\nimport { throttleTime } from 'rxjs'\nimport { BaseStore } from './store.class'\nimport { IArrayStore, StorageType, StoreError } from './types'\n\n/**\n * Enhanced array store with TypeScript support and immutability\n * Extends BaseStore for common functionality\n */\nexport class SchmancyArrayStore<T = any> extends BaseStore<T[]> implements IArrayStore<T> {\n\tpublic static type = 'array'\n\n\t// Static map to hold instances\n\tprivate static instances: Map<string, SchmancyArrayStore<any>> = new Map()\n\n\t/**\n\t * Static method to get or create an instance with proper typing\n\t */\n\tpublic static getInstance<T = any>(storage: StorageType, key: string, defaultValue: T[] = []): SchmancyArrayStore<T> {\n\t\tconst instanceKey = `${storage}:${key}`\n\t\tif (!this.instances.has(instanceKey)) {\n\t\t\tthis.instances.set(instanceKey, new SchmancyArrayStore<T>(storage, key, defaultValue))\n\t\t}\n\t\treturn this.instances.get(instanceKey) as SchmancyArrayStore<T>\n\t}\n\n\t/**\n\t * Constructor extension to set up persistence\n\t */\n\tconstructor(storageType: StorageType, key: string, defaultValue: T[] = []) {\n\t\tsuper(storageType, key, defaultValue)\n\n\t\t// Set up persistence throttling for better performance\n\t\tif (storageType !== 'memory') {\n\t\t\tthis.setupPersistence()\n\t\t}\n\t}\n\n\t/**\n\t * Set up persistence to storage with throttling\n\t */\n\tprivate setupPersistence(): void {\n\t\tthis.$.pipe(throttleTime(100, undefined, { leading: true, trailing: true })).subscribe(currentValue => {\n\t\t\tthis.storage.save(currentValue).catch(err => {\n\t\t\t\tconst error = new StoreError<unknown>(`Error saving to ${this.storageType} storage for ${this.key}`, err)\n\t\t\t\tthis.error$.next(error)\n\t\t\t\tconsole.error(error)\n\t\t\t})\n\t\t})\n\t}\n\n\t/**\n\t * Add an item to the end of the array\n\t */\n\tpublic push(...items: T[]): void {\n\t\ttry {\n\t\t\t// Use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tdraft.push(...items.map(item => castDraft(item) as Draft<T>))\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null) // Clear any previous errors\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error pushing items in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Remove and return the last item from the array\n\t */\n\tpublic pop(): T | undefined {\n\t\ttry {\n\t\t\t// Get the item before modifying the array\n\t\t\tconst originalItem = this.value.length > 0 ? this.value[this.value.length - 1] : undefined\n\n\t\t\t// Use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tdraft.pop()\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null) // Clear any previous errors\n\t\t\treturn originalItem\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error popping item from ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t\treturn undefined\n\t\t}\n\t}\n\t/**\n\t * Add item(s) to the beginning of the array\n\t */\n\tpublic unshift(...items: T[]): void {\n\t\ttry {\n\t\t\t// Use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tdraft.unshift(...items.map(item => castDraft(item) as Draft<T>))\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error unshifting items in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Remove and return the first item from the array\n\t */\n\tpublic shift(): T | undefined {\n\t\ttry {\n\t\t\t// Get the item before modifying the array\n\t\t\tconst originalItem = this.value.length > 0 ? this.value[0] : undefined\n\n\t\t\t// Use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tdraft.shift()\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t\treturn originalItem\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error shifting item from ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t\treturn undefined\n\t\t}\n\t}\n\n\t/**\n\t * Update an item at a specific index\n\t */\n\tpublic set(index: number, value: T): void {\n\t\ttry {\n\t\t\t// Use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tif (index >= 0 && index < draft.length) {\n\t\t\t\t\tdraft[index] = castDraft(value) as Draft<T>\n\t\t\t\t} else {\n\t\t\t\t\tthrow new Error(`Index ${index} out of bounds (length: ${draft.length})`)\n\t\t\t\t}\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error setting item at index ${index} in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Get item at a specific index\n\t */\n\tpublic get(index: number): T | undefined {\n\t\treturn this.value[index]\n\t}\n\n\t/**\n\t * Remove items from the array\n\t */\n\tpublic splice(start: number, deleteCount?: number, ...items: T[]): T[] {\n\t\ttry {\n\t\t\t// Get a copy of the current array\n\t\t\tconst originalArray = [...this.value]\n\n\t\t\t// Perform splice on the copy to get the removed items\n\t\t\tconst removed = originalArray.splice(start, deleteCount ?? 0, ...items)\n\n\t\t\t// Now use Immer to create the new state with the same changes\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tdraft.splice(start, deleteCount ?? 0, ...items.map(item => castDraft(item) as Draft<T>))\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t\treturn removed\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error splicing items in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t\treturn []\n\t\t}\n\t}\n\n\t/**\n\t * Remove an item by value (first occurrence)\n\t */\n\tpublic remove(item: T, compareFn?: (a: T, b: T) => boolean): boolean {\n\t\ttry {\n\t\t\tconst equals = compareFn || ((a, b) => a === b)\n\n\t\t\t// Find the index in the original array\n\t\t\tconst index = this.value.findIndex(currentItem => equals(currentItem, item))\n\n\t\t\t// If found, remove using Immer\n\t\t\tif (index !== -1) {\n\t\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\t\tdraft.splice(index, 1)\n\t\t\t\t})\n\n\t\t\t\tthis.updateState(nextState)\n\t\t\t\tthis.error$.next(null)\n\t\t\t\treturn true\n\t\t\t}\n\n\t\t\t// Item not found\n\t\t\tthis.error$.next(null)\n\t\t\treturn false\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error removing item in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t\treturn false\n\t\t}\n\t}\n\n\t/**\n\t * Replace entire array\n\t */\n\tpublic replace(newArray: T[]): void {\n\t\ttry {\n\t\t\t// Create a fresh immutable copy with Immer\n\t\t\tconst nextState = produce(newArray, draft => draft)\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error replacing array in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Filter items in the array\n\t */\n\tpublic filter(predicate: (value: T, index: number, array: T[]) => boolean): void {\n\t\ttry {\n\t\t\t// Filter the original array first\n\t\t\tconst filteredArray = this.value.filter(predicate)\n\n\t\t\t// Then use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\t// Clear the draft array and fill it with the filtered items\n\t\t\t\tdraft.length = 0\n\t\t\t\tdraft.push(...filteredArray.map(item => castDraft(item) as Draft<T>))\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error filtering array in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Map over the array and transform items\n\t */\n\tpublic map<U>(mapper: (value: T, index: number, array: T[]) => U): U[] {\n\t\treturn this.value.map(mapper)\n\t}\n\n\t/**\n\t * Sort the array in place\n\t */\n\tpublic sort(compareFn?: (a: T, b: T) => number): void {\n\t\ttry {\n\t\t\t// Create a copy of the current array and apply the sort operation\n\t\t\tconst sortedArray = [...this.value].sort(compareFn)\n\n\t\t\t// Use Immer to create a new immutable array that matches the sorted array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\t// Clear the array and refill it with the sorted items\n\t\t\t\tdraft.length = 0\n\t\t\t\tdraft.push(...sortedArray.map(item => castDraft(item) as Draft<T>))\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error sorting array in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Update a specific item using a callback function\n\t */\n\tpublic update(index: number, updater: (item: Draft<T>) => void): void {\n\t\ttry {\n\t\t\t// Use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tif (index >= 0 && index < draft.length) {\n\t\t\t\t\tupdater(draft[index])\n\t\t\t\t} else {\n\t\t\t\t\tthrow new Error(`Index ${index} out of bounds (length: ${draft.length})`)\n\t\t\t\t}\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error updating item at index ${index} in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Clear the array\n\t */\n\tpublic clear(): void {\n\t\tthis.updateState([])\n\t}\n\n\t/**\n\t * Setup development tools for debugging\n\t */\n\tprotected setupDevTools(): void {\n\t\tif (typeof window !== 'undefined') {\n\t\t\t// Add to global store registry\n\t\t\t;(window as any).__STORES__ = (window as any).__STORES__ || {}\n\t\t\t;(window as any).__STORES__[this.key] = {\n\t\t\t\tgetState: () => this.value,\n\t\t\t\tpush: this.push.bind(this),\n\t\t\t\tpop: this.pop.bind(this),\n\t\t\t\tunshift: this.unshift.bind(this),\n\t\t\t\tshift: this.shift.bind(this),\n\t\t\t\tset: this.set.bind(this),\n\t\t\t\tget: this.get.bind(this),\n\t\t\t\tsplice: this.splice.bind(this),\n\t\t\t\tremove: this.remove.bind(this),\n\t\t\t\treplace: this.replace.bind(this),\n\t\t\t\tfilter: this.filter.bind(this),\n\t\t\t\tmap: this.map.bind(this),\n\t\t\t\tsort: this.sort.bind(this),\n\t\t\t\tupdate: this.update.bind(this),\n\t\t\t\tclear: this.clear.bind(this),\n\t\t\t\tsubscribe: (callback: (state: T[]) => void) => {\n\t\t\t\t\tconst subscription = this.$.subscribe(callback)\n\t\t\t\t\treturn () => subscription.unsubscribe()\n\t\t\t\t},\n\t\t\t}\n\t\t}\n\t}\n}\n","// src/store/context-collection.ts - Updated with Immer for immutability\nimport { throttleTime } from 'rxjs'\nimport { BaseStore } from './store.class'\nimport { ICollectionStore, StorageType, StoreError } from './types'\nimport { produce, Draft, castDraft } from 'immer'\n\n/**\n * Enhanced collection store with better TypeScript support and immutability\n * Now extends BaseStore for common functionality\n */\nexport default class SchmancyCollectionStore<V = any> extends BaseStore<Map<string, V>> implements ICollectionStore<V> {\n\tpublic static type = 'collection'\n\n\t// Static map to hold instances\n\tprivate static instances: Map<string, SchmancyCollectionStore<any>> = new Map()\n\n\t/**\n\t * Static method to get or create an instance with proper typing\n\t */\n\tpublic static getInstance<V = any>(\n\t\tstorage: StorageType,\n\t\tkey: string,\n\t\tdefaultValue: Map<string, V>,\n\t): SchmancyCollectionStore<V> {\n\t\tconst instanceKey = `${storage}:${key}`\n\t\tif (!this.instances.has(instanceKey)) {\n\t\t\tthis.instances.set(instanceKey, new SchmancyCollectionStore<V>(storage, key, defaultValue))\n\t\t}\n\t\treturn this.instances.get(instanceKey) as SchmancyCollectionStore<V>\n\t}\n\n\t/**\n\t * Set values in the collection with proper typing and immutability.\n\t * Supports multiple input types to prevent common developer mistakes.\n\t * \n\t * @example\n\t * // Single key-value pair\n\t * store.set('key1', value1)\n\t * \n\t * @example\n\t * // Merge from a Map\n\t * const dataMap = new Map([['key1', value1], ['key2', value2]])\n\t * store.set(dataMap)\n\t * \n\t * @example\n\t * // Merge from an object\n\t * store.set({ key1: value1, key2: value2 })\n\t */\n\tpublic set<T = V>(keyOrData: string | Map<string, T> | Record<string, T>, value?: T): void {\n\t\ttry {\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\t// Handle different input types\n\t\t\t\tif (typeof keyOrData === 'string') {\n\t\t\t\t\t// Traditional key-value pair\n\t\t\t\t\tif (value === undefined) {\n\t\t\t\t\t\tthrow new Error('Value is required when setting a single key')\n\t\t\t\t\t}\n\t\t\t\t\tdraft.set(keyOrData, castDraft(value) as unknown as Draft<V>)\n\t\t\t\t} else if (keyOrData instanceof Map) {\n\t\t\t\t\t// Merge all entries from the Map\n\t\t\t\t\tArray.from(keyOrData.entries()).forEach(([key, val]) => {\n\t\t\t\t\t\tdraft.set(key, castDraft(val) as unknown as Draft<V>)\n\t\t\t\t\t})\n\t\t\t\t} else if (typeof keyOrData === 'object' && keyOrData !== null) {\n\t\t\t\t\t// Merge all properties from the object\n\t\t\t\t\tObject.entries(keyOrData).forEach(([key, val]) => {\n\t\t\t\t\t\tdraft.set(key, castDraft(val) as unknown as Draft<V>)\n\t\t\t\t\t})\n\t\t\t\t} else {\n\t\t\t\t\tthrow new Error('Invalid input: expected string key with value, Map, or object')\n\t\t\t\t}\n\t\t\t})\n\n\t\t\t// Update the state with the new immutable Map\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null) // Clear any previous errors\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error setting values in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Merge a Map into the collection. This is a helper method that provides\n\t * explicit semantics for merging operations.\n\t * \n\t * @param map The Map to merge into the collection\n\t * @example\n\t * const dataMap = new Map([['key1', value1], ['key2', value2]])\n\t * store.merge(dataMap)\n\t */\n\tpublic merge<T = V>(map: Map<string, T>): void {\n\t\tthis.set(map)\n\t}\n\n\t/**\n\t * Delete a value from the collection immutably\n\t */\n\tpublic delete(key: string): void {\n\t\ttry {\n\t\t\t// Use Immer to create a new immutable Map with the key deleted\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tdraft.delete(key)\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null) // Clear any previous errors\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error deleting key ${key} from ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Clear the collection immutably\n\t */\n\tpublic clear(): void {\n\t\t// Create a fresh empty Map\n\t\tthis.updateState(new Map<string, V>())\n\t}\n\n\t/**\n\t * Batch update multiple items in the collection\n\t * @param updates Object with keys and values to update\n\t */\n\tpublic batchUpdate(updates: Record<string, V>): void {\n\t\ttry {\n\t\t\t// Use Immer to apply all updates in a single immutable operation\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tObject.entries(updates).forEach(([key, value]) => {\n\t\t\t\t\tdraft.set(key, castDraft(value) as unknown as Draft<V>)\n\t\t\t\t})\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error batch updating in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Update an existing item in the collection using an updater function\n\t * @param key Key of the item to update\n\t * @param updater Function that receives the current value and returns the new value\n\t */\n\tpublic update(key: string, updater: (currentValue: Draft<V>) => void): void {\n\t\ttry {\n\t\t\t// Use Immer to update the specific item\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tconst currentValue = draft.get(key)\n\t\t\t\tif (currentValue !== undefined) {\n\t\t\t\t\tupdater(currentValue)\n\t\t\t\t\t// No need to set the value back since it's updated in place\n\t\t\t\t}\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error updating item ${key} in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Constructor extension to set up persistence\n\t */\n\tconstructor(storageType: StorageType, key: string, defaultValue: Map<string, V>) {\n\t\tsuper(storageType, key, defaultValue)\n\n\t\t// Set up persistence throttling for better performance\n\t\tif (storageType !== 'memory') {\n\t\t\tthis.setupPersistence()\n\t\t}\n\t}\n\n\t/**\n\t * Set up persistence to storage with throttling\n\t */\n\tprivate setupPersistence(): void {\n\t\tthis.$.pipe(throttleTime(100, undefined, { leading: true, trailing: true })).subscribe(currentValue => {\n\t\t\tthis.storage.save(currentValue).catch(err => {\n\t\t\t\tconst error = new StoreError<unknown>(`Error saving to ${this.storageType} storage for ${this.key}`, err)\n\t\t\t\tthis.error$.next(error)\n\t\t\t\tconsole.error(error)\n\t\t\t})\n\t\t})\n\t}\n\n\t/**\n\t * Setup development tools for debugging\n\t */\n\tprotected setupDevTools(): void {\n\t\tif (typeof window !== 'undefined') {\n\t\t\t// Add to global store registry\n\t\t\t;(window as any).__STORES__ = (window as any).__STORES__ || {}\n\t\t\t;(window as any).__STORES__[this.key] = {\n\t\t\t\tgetState: () => this.value,\n\t\t\t\tset: this.set.bind(this),\n\t\t\t\tmerge: this.merge.bind(this),\n\t\t\t\tdelete: this.delete.bind(this),\n\t\t\t\tclear: this.clear.bind(this),\n\t\t\t\tbatchUpdate: this.batchUpdate.bind(this),\n\t\t\t\tupdate: this.update.bind(this),\n\t\t\t\tsubscribe: (callback: (state: Map<string, V>) => void) => {\n\t\t\t\t\tconst subscription = this.$.subscribe(callback)\n\t\t\t\t\treturn () => subscription.unsubscribe()\n\t\t\t\t},\n\t\t\t}\n\t\t}\n\t}\n}\n","// src/store/context-object.ts - Fixed version\n\nimport { BaseStore } from './store.class'\nimport { IStore, StorageType, StoreError } from './types'\nimport { produce, Draft, castDraft, immerable } from 'immer'\n\n/**\n * Enhanced store object with better TypeScript support and immutability\n * Now extends BaseStore for common functionality and uses Immer\n */\nexport class SchmancyStoreObject<T extends Record<string, any>> extends BaseStore<T> implements IStore<T> {\n\t// Mark as immerable so Immer can create drafts of this class\n\t[immerable] = true\n\n\tpublic static type = 'object'\n\n\t// Static map to hold instances with proper typing\n\tprivate static instances: Map<string, SchmancyStoreObject<any>> = new Map()\n\n\t/**\n\t * Static method to get or create an instance with strong typing\n\t */\n\tpublic static getInstance<T extends Record<string, any>>(\n\t\tstorage: StorageType,\n\t\tkey: string,\n\t\tdefaultValue: T,\n\t): SchmancyStoreObject<T> {\n\t\tconst instanceKey = `${storage}:${key}`\n\t\tif (!this.instances.has(instanceKey)) {\n\t\t\tthis.instances.set(instanceKey, new SchmancyStoreObject<T>(storage, key, defaultValue))\n\t\t}\n\t\treturn this.instances.get(instanceKey) as SchmancyStoreObject<T>\n\t}\n\n\t/**\n\t * Set state with proper typing and immutability using Immer\n\t */\n\tpublic set(value: Partial<T>, merge: boolean = true): void {\n\t\ttry {\n\t\t\tif (!this.isImmerDraftable(this.value)) {\n\t\t\t\t// If current value isn't draftable, handle directly\n\t\t\t\tconst nextState = merge ? { ...this.value, ...value } : (value as T)\n\n\t\t\t\tthis.updateState(nextState)\n\t\t\t\tthis.error$.next(null)\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\t// Use Immer to create an immutable update\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tif (merge) {\n\t\t\t\t\t// Handle null/undefined value safely\n\t\t\t\t\tif (value === null || value === undefined) {\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\n\t\t\t\t\t// Merge new values into existing state\n\t\t\t\t\t// Use castDraft to properly type the value for the draft context\n\t\t\t\t\ttry {\n\t\t\t\t\t\tObject.assign(draft, castDraft(value) as Draft<Partial<T>>)\n\t\t\t\t\t} catch (err) {\n\t\t\t\t\t\tconsole.warn('[SchmancyStoreObject] Error casting to draft, falling back to direct assign:', err)\n\t\t\t\t\t\t// Fallback to direct property assignment\n\t\t\t\t\t\tObject.keys(value).forEach(key => {\n\t\t\t\t\t\t\t;(draft as any)[key] = (value as any)[key]\n\t\t\t\t\t\t})\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t// For complete replacement, return a completely new object\n\t\t\t\t\t// This is handled specially by Immer\n\t\t\t\t\ttry {\n\t\t\t\t\t\treturn castDraft(value as T) as Draft<T>\n\t\t\t\t\t} catch (err) {\n\t\t\t\t\t\tconsole.warn('[SchmancyStoreObject] Error casting to draft, returning value directly:', err)\n\t\t\t\t\t\treturn value as unknown as Draft<T>\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null) // Clear any previous errors\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error updating store: ${this.key}`, err, { value, merge })\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\n\t\t\t// Fallback to direct update\n\t\t\ttry {\n\t\t\t\tconst fallbackState = merge ? { ...this.value, ...value } : (value as T)\n\t\t\t\tthis.updateState(fallbackState)\n\t\t\t} catch (fallbackErr) {\n\t\t\t\tconsole.error('Failed fallback update:', fallbackErr)\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Reset the store to its default value\n\t */\n\tpublic clear(): void {\n\t\ttry {\n\t\t\t// Create a fresh copy of the default value using Immer\n\t\t\tif (this.isImmerDraftable(this.defaultValue)) {\n\t\t\t\tconst freshDefaultValue = produce(this.defaultValue, draft => draft)\n\t\t\t\tthis.set(freshDefaultValue, false)\n\t\t\t} else {\n\t\t\t\t// For non-draftable values, use direct replacement\n\t\t\t\tthis.set(this.defaultValue as any, false)\n\t\t\t}\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error clearing store: ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\n\t\t\t// Fallback to direct reset\n\t\t\tthis.updateState(this.defaultValue)\n\t\t}\n\t}\n\n\t/**\n\t * Delete a specific key from the store with type checking and immutability\n\t */\n\tpublic delete<K extends keyof T>(key: K): void {\n\t\ttry {\n\t\t\tif (!this.isImmerDraftable(this.value)) {\n\t\t\t\t// Handle non-draftable objects directly\n\t\t\t\tconst nextState = { ...this.value }\n\t\t\t\tdelete nextState[key]\n\t\t\t\tthis.updateState(nextState as T)\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\t// Use Immer to create an immutable update that removes the key\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\t// Use type assertion to tell TypeScript this is safe\n\t\t\t\tdelete draft[key as keyof Draft<T>]\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error deleting key ${String(key)} from store: ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\n\t\t\t// Fallback to direct modification\n\t\t\ttry {\n\t\t\t\tconst fallbackState = { ...this.value }\n\t\t\t\tdelete fallbackState[key]\n\t\t\t\tthis.updateState(fallbackState as T)\n\t\t\t} catch (fallbackErr) {\n\t\t\t\tconsole.error('Failed fallback delete:', fallbackErr)\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Update a nested property at a specific path\n\t * @param path Dot-separated path to the property (e.g., 'user.profile.name')\n\t * @param value New value to set\n\t */\n\tpublic setPath(path: string, value: any): void {\n\t\ttry {\n\t\t\tif (!path) {\n\t\t\t\tconsole.warn('[SchmancyStoreObject] Empty path provided to setPath')\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tif (!this.isImmerDraftable(this.value)) {\n\t\t\t\t// Handle non-draftable objects with direct modification\n\t\t\t\tconst parts = path.split('.')\n\t\t\t\tconst nextState = { ...this.value }\n\t\t\t\tlet current: any = nextState\n\n\t\t\t\tfor (let i = 0; i < parts.length - 1; i++) {\n\t\t\t\t\tconst part = parts[i]\n\t\t\t\t\tif (current[part] === undefined) {\n\t\t\t\t\t\tcurrent[part] = {}\n\t\t\t\t\t} else if (typeof current[part] !== 'object' || current[part] === null) {\n\t\t\t\t\t\tcurrent[part] = {}\n\t\t\t\t\t}\n\t\t\t\t\tcurrent = current[part]\n\t\t\t\t}\n\n\t\t\t\tcurrent[parts[parts.length - 1]] = value\n\t\t\t\tthis.updateState(nextState)\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\t// Use Immer for immutable deep updates\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tconst parts = path.split('.')\n\t\t\t\tlet current: any = draft\n\n\t\t\t\t// Navigate to the parent of the property we want to update\n\t\t\t\tfor (let i = 0; i < parts.length - 1; i++) {\n\t\t\t\t\tconst part = parts[i]\n\n\t\t\t\t\t// Create the path if it doesn't exist\n\t\t\t\t\tif (current[part] === undefined) {\n\t\t\t\t\t\tcurrent[part] = {}\n\t\t\t\t\t} else if (typeof current[part] !== 'object' || current[part] === null) {\n\t\t\t\t\t\t// Convert to object if it's not one already\n\t\t\t\t\t\tcurrent[part] = {}\n\t\t\t\t\t}\n\n\t\t\t\t\tcurrent = current[part]\n\t\t\t\t}\n\n\t\t\t\t// Set the value at the final path segment\n\t\t\t\tconst lastPart = parts[parts.length - 1]\n\t\t\t\ttry {\n\t\t\t\t\tcurrent[lastPart] = castDraft(value)\n\t\t\t\t} catch (err) {\n\t\t\t\t\tconsole.warn('[SchmancyStoreObject] Error casting to draft, setting directly:', err)\n\t\t\t\t\tcurrent[lastPart] = value\n\t\t\t\t}\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error setting path ${path} in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\n\t\t\t// Fallback to direct path setting\n\t\t\ttry {\n\t\t\t\tconst parts = path.split('.')\n\t\t\t\tconst nextState = { ...this.value }\n\t\t\t\tlet current: any = nextState\n\n\t\t\t\tfor (let i = 0; i < parts.length - 1; i++) {\n\t\t\t\t\tconst part = parts[i]\n\t\t\t\t\tif (current[part] === undefined) {\n\t\t\t\t\t\tcurrent[part] = {}\n\t\t\t\t\t} else if (typeof current[part] !== 'object' || current[part] === null) {\n\t\t\t\t\t\tcurrent[part] = {}\n\t\t\t\t\t}\n\t\t\t\t\tcurrent = current[part]\n\t\t\t\t}\n\n\t\t\t\tcurrent[parts[parts.length - 1]] = value\n\t\t\t\tthis.updateState(nextState)\n\t\t\t} catch (fallbackErr) {\n\t\t\t\tconsole.error('Failed fallback setPath:', fallbackErr)\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Process stored value by merging with default value\n\t */\n\tprotected processStoredValue(storedValue: T): T {\n\t\ttry {\n\t\t\t// Use Immer to create a clean merged state if possible\n\t\t\tif (this.isImmerDraftable(this.defaultValue) && this.isImmerDraftable(storedValue)) {\n\t\t\t\treturn produce(this.defaultValue, draft => {\n\t\t\t\t\tObject.assign(draft, castDraft(storedValue) as Draft<T>)\n\t\t\t\t})\n\t\t\t} else {\n\t\t\t\t// Otherwise use a standard merge\n\t\t\t\treturn { ...this.defaultValue, ...storedValue }\n\t\t\t}\n\t\t} catch (err) {\n\t\t\tconsole.warn(`[SchmancyStoreObject] Error processing stored value, returning as-is:`, err)\n\t\t\treturn storedValue\n\t\t}\n\t}\n\n\t/**\n\t * Setup development tools for debugging\n\t */\n\tprotected setupDevTools(): void {\n\t\tif (typeof window !== 'undefined') {\n\t\t\t// Add to global store registry\n\t\t\t;(window as any).__STORES__ = (window as any).__STORES__ || {}\n\t\t\t;(window as any).__STORES__[this.key] = {\n\t\t\t\tgetState: () => this.value,\n\t\t\t\tset: this.set.bind(this),\n\t\t\t\tdelete: this.delete.bind(this),\n\t\t\t\tclear: this.clear.bind(this),\n\t\t\t\tsetPath: this.setPath.bind(this),\n\t\t\t\tsubscribe: (callback: (state: T) => void) => {\n\t\t\t\t\tconst subscription = this.$.subscribe(callback)\n\t\t\t\t\treturn () => subscription.unsubscribe()\n\t\t\t\t},\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Inherit isImmerDraftable from BaseStore, but also check for [immerable]\n\t */\n\tprotected isImmerDraftable(value: any): boolean {\n\t\t// Use the parent implementation and add our own checks\n\t\treturn value !== null && typeof value === 'object' && (super.isImmerDraftable(value) || value[immerable] === true)\n\t}\n}\n","// src/store/context-create.ts - Fixed version\n\nimport { SchmancyArrayStore } from './context-array'\nimport SchmancyCollectionStore from './context-collection'\nimport { SchmancyStoreObject } from './context-object'\nimport { IArrayStore, ICollectionStore, IStore, StorageType } from './types'\n\n/**\n * Type guard to check if an object is empty\n */\nfunction isEmptyObject(obj: unknown): boolean {\n\tif (typeof obj !== 'object' || obj === null) {\n\t\treturn false\n\t}\n\treturn Object.keys(obj).length === 0\n}\n\n/**\n * Type guard for Map objects\n */\nfunction isMap<K, V>(value: unknown): value is Map<K, V> {\n\treturn value instanceof Map\n}\n\n/**\n * Type guard for Array objects\n */\nfunction isArray<T>(value: unknown): value is Array<T> {\n\treturn Array.isArray(value)\n}\n\n/**\n * Type guard for plain objects (not arrays, maps, null, etc.)\n */\nfunction isPlainObject(value: unknown): boolean {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object' &&\n\t\t!Array.isArray(value) &&\n\t\t!(value instanceof Map) &&\n\t\t!(value instanceof Set) &&\n\t\t!(value instanceof Date) &&\n\t\t!(value instanceof RegExp) &&\n\t\tObject.getPrototypeOf(value) === Object.prototype\n\t)\n}\n\n/**\n * Creates a regular object store with better typing and error handling\n */\nfunction createObjectStore<T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n): IStore<T> & SchmancyStoreObject<T> {\n\ttry {\n\t\t// Validate storage type\n\t\tif (storage === 'indexeddb') {\n\t\t\tconsole.warn(`IndexedDB storage is not optimal for plain objects. Using 'local' instead for key: ${key}`)\n\t\t\tstorage = 'local'\n\t\t}\n\n\t\t// Ensure initialData is a plain object\n\t\tif (!isPlainObject(initialData)) {\n\t\t\tconsole.warn(`Initial data is not a plain object. Converting to object for key: ${key}`)\n\t\t\tinitialData = { ...initialData } as T\n\t\t}\n\n\t\t// Create the store instance\n\t\tconst store = SchmancyStoreObject.getInstance<T>(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (isEmptyObject(store.value)) {\n\t\t\tstore.set({ ...initialData }) // Use spread to create a copy\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create object store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyStoreObject.getInstance<T>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\tinitialData,\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n/**\n * Creates a collection store with better typing and error handling\n */\nfunction createCollectionStore<V>(\n\tinitialData: Map<string, V>,\n\tstorage: StorageType,\n\tkey: string,\n): ICollectionStore<V> & SchmancyCollectionStore<V> {\n\ttry {\n\t\t// Create the store instance\n\t\tconst store = SchmancyCollectionStore.getInstance(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (!store.value.size) {\n\t\t\t// Create a new Map instance to avoid modifying the input\n\t\t\tstore.replace(new Map(initialData))\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create collection store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyCollectionStore.getInstance<V>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\tnew Map(initialData),\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n/**\n * Creates an array store with better typing and error handling\n */\nfunction createArrayStore<T>(\n\tinitialData: T[],\n\tstorage: StorageType,\n\tkey: string,\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\t// Create the store instance\n\t\tconst store = SchmancyArrayStore.getInstance(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (!store.value.length) {\n\t\t\t// Create a new array instance to avoid modifying the input\n\t\t\tstore.replace([...initialData])\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create array store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyArrayStore.getInstance<T>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\t[...initialData],\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n// Function overloads for better type inference\n/**\n * Creates a context for managing object state\n * @param initialData The initial object data\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns A store instance for the object\n */\nexport function createContext<T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n): IStore<T> & SchmancyStoreObject<T>\n\n/**\n * Creates a context for managing collection state\n * @param initialData The initial Map collection\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns A collection store instance\n */\nexport function createContext<V>(\n\tinitialData: Map<string, V>,\n\tstorage: StorageType,\n\tkey: string,\n): ICollectionStore<V> & SchmancyCollectionStore<V>\n\n/**\n * Creates a context for managing array state\n * @param initialData The initial array\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns An array store instance\n */\nexport function createContext<T>(\n\tinitialData: T[],\n\tstorage: StorageType,\n\tkey: string,\n): IArrayStore<T> & SchmancyArrayStore<T>\n\n/**\n * Implementation of the createContext function with complete type checking\n * and robust error handling\n */\nexport function createContext<T extends Record<string, any> | Map<string, any> | any[]>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n):\n\t| (IStore<T> & SchmancyStoreObject<T>)\n\t| (ICollectionStore<any> & SchmancyCollectionStore<any>)\n\t| (IArrayStore<any> & SchmancyArrayStore<any>) {\n\ttry {\n\t\t// Validate input\n\t\tif (initialData === null || initialData === undefined) {\n\t\t\tconsole.error('Initial data cannot be null or undefined')\n\t\t\t// Provide a sensible default based on type expected\n\t\t\tif (key.includes('collection') || key.includes('map')) {\n\t\t\t\tinitialData = new Map() as unknown as T\n\t\t\t} else if (key.includes('array') || key.includes('list')) {\n\t\t\t\tinitialData = [] as unknown as T\n\t\t\t} else {\n\t\t\t\tinitialData = {} as T\n\t\t\t}\n\t\t}\n\n\t\t// Determine store type based on input data with improved type checking\n\t\tif (isMap<string, any>(initialData)) {\n\t\t\treturn createCollectionStore<any>(initialData, storage, key)\n\t\t} else if (isArray<any>(initialData)) {\n\t\t\treturn createArrayStore<any>(initialData, storage, key)\n\t\t} else if (typeof initialData === 'object') {\n\t\t\treturn createObjectStore<any>(initialData as Record<string, any>, storage, key)\n\t\t} else {\n\t\t\t// Handle non-object data by wrapping it\n\t\t\tconsole.warn(`Initial data must be an object, array, or Map. Got ${typeof initialData}. Creating object wrapper.`)\n\t\t\treturn createObjectStore<any>({ value: initialData } as Record<string, any>, storage, key)\n\t\t}\n\t} catch (error) {\n\t\t// Last-resort error handling\n\t\tconsole.error(`Fatal error creating context for ${key}:`, error)\n\n\t\t// Create an emergency fallback store that won't throw\n\t\treturn createObjectStore<any>(\n\t\t\ttypeof initialData === 'object' && initialData !== null ? { ...initialData } : { value: initialData },\n\t\t\t'memory',\n\t\t\t`emergency-fallback-${key}`,\n\t\t)\n\t}\n}\n\n/**\n * Creates an array context with simplified API and type inference\n * @param initialData The initial array data\n * @param key Unique key for the store\n * @param storage Storage type to use (defaults to 'local')\n * @returns An array store instance\n */\nexport function createArrayContext<T>(\n\tinitialData: T[] = [],\n\tkey: string,\n\tstorage: StorageType = 'local',\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\treturn createContext<T>(initialData, storage, key)\n\t} catch (err) {\n\t\tconsole.error(`Failed to create array context for key: ${key}`, err)\n\t\t// Return a fallback store\n\t\treturn createArrayStore<T>(initialData, 'memory', `${key}-fallback`)\n\t}\n}\n\n/**\n * Creates a testable array context\n * @param initialData The initial array data\n * @param key Unique key for the store\n * @returns An array store that uses memory storage\n */\nexport function createTestArrayContext<T>(\n\tinitialData: T[] = [],\n\tkey: string = 'test-array',\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\treturn createContext<T>(initialData, 'memory', key)\n\t} catch (err) {\n\t\tconsole.error(`Failed to create test array context for key: ${key}`, err)\n\t\t// Return a fallback store with a different key\n\t\treturn createArrayStore<T>(initialData, 'memory', `${key}-emergency-fallback`)\n\t}\n}\n","// src/store/filter-directive.ts\n\n/** Supported comparison operators with TypeScript literal types */\nexport type ComparisonOperator =\n\t| '=='\n\t| '!='\n\t| '>'\n\t| '<'\n\t| '>='\n\t| '<='\n\t| 'includes'\n\t| 'notIncludes'\n\t| 'startsWith'\n\t| 'endsWith'\n\t| 'in'\n\t| 'notIn'\n\t| 'any' // fuzzy search operator\n\n/**\n * Type-safe condition tuple\n */\nexport type ConditionTuple = [field: string, op: ComparisonOperator, expected: unknown, strict?: boolean]\n\n/**\n * Type-safe condition object\n */\nexport interface ConditionObject {\n\tkey: string | string[] // Array of keys applies OR logic across fields\n\toperator: ComparisonOperator\n\tvalue: unknown\n\tstrict?: boolean\n}\n\n/**\n * Unified query condition type\n */\nexport type QueryCondition = ConditionTuple | ConditionObject\n\n/**\n * Filter result with item and score\n */\nexport interface ScoredItem<T> {\n\titem: T\n\tscore: number\n}\n\n/**\n * Get a nested value from an object using a dot-separated path.\n * Checks explicitly for null/undefined so falsy values like 0 or false are preserved.\n */\nexport const getFieldValue = <T = any>(item: Record<string, any>, path: string): T => {\n\tif (!path) return item as unknown as T\n\n\tconst parts = path.split('.')\n\tlet value: any = item\n\n\tfor (const part of parts) {\n\t\tif (value == null) return undefined as unknown as T\n\t\tvalue = value[part]\n\t}\n\n\treturn value as T\n}\n\n/**\n * Compute the Levenshtein distance between two strings.\n */\nconst levenshtein = (a: string, b: string): number => {\n\tif (a === b) return 0\n\n\tconst matrix: number[][] = Array(b.length + 1)\n\t\t.fill(null)\n\t\t.map((_, i) => [i])\n\n\t// initialize the first row\n\tfor (let j = 0; j <= a.length; j++) {\n\t\tmatrix[0][j] = j\n\t}\n\n\tfor (let i = 1; i <= b.length; i++) {\n\t\tfor (let j = 1; j <= a.length; j++) {\n\t\t\tif (b.charAt(i - 1) === a.charAt(j - 1)) {\n\t\t\t\tmatrix[i][j] = matrix[i - 1][j - 1]\n\t\t\t} else {\n\t\t\t\tmatrix[i][j] = Math.min(\n\t\t\t\t\tmatrix[i - 1][j] + 1, // deletion\n\t\t\t\t\tmatrix[i][j - 1] + 1, // insertion\n\t\t\t\t\tmatrix[i - 1][j - 1] + 1, // substitution\n\t\t\t\t)\n\t\t\t}\n\t\t}\n\t}\n\treturn matrix[b.length][a.length]\n}\n\n/**\n * Check if string `sub` is a subsequence of string `str`.\n * All characters in `sub` must appear in order in `str` (they need not be contiguous).\n */\nconst isSubsequence = (sub: string, str: string): boolean => {\n\tif (!sub) return true\n\tif (!str) return false\n\n\tlet i = 0,\n\t\tj = 0\n\twhile (i < sub.length && j < str.length) {\n\t\tif (sub[i].toLowerCase() === str[j].toLowerCase()) i++\n\t\tj++\n\t}\n\treturn i === sub.length\n}\n\n/**\n * Check if every character (with frequency) in the query exists in the target.\n * For example, \"aovc\" matches \"avocados\".\n */\nconst anagramMatch = (query: string, target: string): boolean => {\n\tif (!query) return true\n\tif (!target) return false\n\n\tconst countChars = (s: string): Record<string, number> =>\n\t\ts\n\t\t\t.toLowerCase()\n\t\t\t.split('')\n\t\t\t.reduce(\n\t\t\t\t(acc, char) => {\n\t\t\t\t\tacc[char] = (acc[char] || 0) + 1\n\t\t\t\t\treturn acc\n\t\t\t\t},\n\t\t\t\t{} as Record<string, number>,\n\t\t\t)\n\n\tconst queryCount = countChars(query)\n\tconst targetCount = countChars(target)\n\treturn Object.keys(queryCount).every(char => (targetCount[char] || 0) >= queryCount[char])\n}\n\n/**\n * Generate bigrams for a string.\n */\nconst getBigrams = (s: string): string[] => {\n\tif (!s || s.length < 2) return []\n\n\tconst bigrams: string[] = []\n\tfor (let i = 0; i < s.length - 1; i++) {\n\t\tbigrams.push(s.substring(i, i + 2).toLowerCase())\n\t}\n\treturn bigrams\n}\n\n/**\n * Compute Dice's coefficient for two strings based on bigrams.\n * Returns a value between 0 (no similarity) and 1 (perfect match).\n */\nconst diceCoefficient = (s1: string, s2: string): number => {\n\tif (!s1 || !s2 || s1.length < 2 || s2.length < 2) return 0\n\n\tconst bigrams1 = getBigrams(s1)\n\tconst bigrams2 = getBigrams(s2)\n\n\tif (bigrams1.length === 0 || bigrams2.length === 0) return 0\n\n\tlet intersection = 0\n\tconst used = new Array(bigrams2.length).fill(false)\n\n\tfor (const bigram of bigrams1) {\n\t\tfor (let i = 0; i < bigrams2.length; i++) {\n\t\t\tif (!used[i] && bigrams2[i] === bigram) {\n\t\t\t\tintersection++\n\t\t\t\tused[i] = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\treturn (2 * intersection) / (bigrams1.length + bigrams2.length)\n}\n\n/**\n * Compute a fuzzy similarity score between two strings.\n * The score is computed by taking the maximum of several methods:\n * - Direct substring match (score 1)\n * - Subsequence check (score 0.8)\n * - Anagram subset match (score 0.7)\n * - Dice coefficient\n * - Normalized Levenshtein similarity\n */\nconst computeFuzzyScore = (actual: string, expected: string): number => {\n\tif (!actual || !expected) return 0\n\n\tconst a = actual.toLowerCase().trim()\n\tconst b = expected.toLowerCase().trim()\n\n\tif (a === b) return 1\n\n\tconst substringScore = a.includes(b) ? 1 : 0\n\tconst subsequenceScore = isSubsequence(b, a) ? 0.8 : 0\n\tconst anagramScore = anagramMatch(b, a) ? 0.7 : 0\n\tconst diceScore = diceCoefficient(a, b)\n\n\tconst maxLen = Math.max(a.length, b.length)\n\tconst levenshteinScore = maxLen ? 1 - levenshtein(a, b) / maxLen : 0\n\n\treturn Math.max(substringScore, subsequenceScore, anagramScore, diceScore, levenshteinScore)\n}\n\n/**\n * Safely coerce value to string if possible, or return empty string\n */\nconst safeString = (value: unknown): string => {\n\tif (value == null) return ''\n\treturn String(value)\n}\n\n/**\n * Apply a query condition to an item and return score\n */\nfunction applyQueryCondition<T extends Record<string, any>>(\n\titem: T,\n\tquery: QueryCondition,\n\tfuzzyThreshold: number = 0.3,\n): { valid: boolean; score: number } {\n\tlet field: string,\n\t\top: ComparisonOperator,\n\t\texpected: unknown,\n\t\tstrict = false\n\n\tif (Array.isArray(query)) {\n\t\t;[field, op, expected, strict = false] = query\n\t} else {\n\t\t// Handle array of keys (OR logic)\n\t\tif (Array.isArray(query.key)) {\n\t\t\tconst results = query.key.map(k =>\n\t\t\t\tapplyQueryCondition(item, { ...query, key: k }, fuzzyThreshold)\n\t\t\t)\n\t\t\t// Return best valid result, or invalid if none valid\n\t\t\treturn results.reduce(\n\t\t\t\t(best, curr) => (curr.valid ? (curr.score > best.score ? curr : best) : best),\n\t\t\t\t{ valid: false, score: 0 }\n\t\t\t)\n\t\t}\n\n\t\tfield = query.key\n\t\top = query.operator\n\t\texpected = query.value\n\t\tstrict = query.strict || false\n\t}\n\n\t// Skip empty filters for non-strict queries\n\tif (!strict && (expected === '' || expected == null || (isArray(expected) && expected.length === 0))) {\n\t\treturn { valid: true, score: 1 }\n\t}\n\n\tconst actual = getFieldValue(item, field)\n\n\t// FIXED: Properly handle strict mode\n\tif (strict) {\n\t\t// For strict mode, use exact equality comparison for all operators except 'any'\n\t\tif (op === 'any') {\n\t\t\t// Fuzzy search still applies with strict mode\n\t\t\tif (typeof actual !== 'string' || typeof expected !== 'string') {\n\t\t\t\treturn { valid: false, score: 0 }\n\t\t\t}\n\n\t\t\tconst score = computeFuzzyScore(actual, expected)\n\t\t\treturn {\n\t\t\t\tvalid: score >= fuzzyThreshold,\n\t\t\t\tscore: score >= fuzzyThreshold ? score : 0,\n\t\t\t}\n\t\t} else {\n\t\t\t// For all other operators in strict mode,\n\t\t\t// delegate to compareValues function but return precise scores\n\t\t\tconst matches = compareValues(op, actual, expected)\n\t\t\treturn {\n\t\t\t\tvalid: matches,\n\t\t\t\tscore: matches ? 1 : 0,\n\t\t\t}\n\t\t}\n\t} else if (op === 'any') {\n\t\t// Fuzzy search requires both values to be strings\n\t\tif (typeof actual !== 'string' || typeof expected !== 'string') {\n\t\t\treturn { valid: false, score: 0 }\n\t\t}\n\n\t\tconst score = computeFuzzyScore(actual, expected)\n\t\tif (score < fuzzyThreshold) {\n\t\t\treturn { valid: false, score: 0 }\n\t\t}\n\n\t\treturn { valid: true, score }\n\t} else {\n\t\t// For non-fuzzy operators, check condition\n\t\tconst matches = compareValues(op, actual, expected)\n\t\treturn {\n\t\t\tvalid: matches,\n\t\t\tscore: matches ? 1 : 0,\n\t\t}\n\t}\n}\n\n/**\n * Filter a Map of items given an array of query conditions.\n * For each query condition:\n * - If the expected value is empty/null/undefined, it is treated as a match.\n * - For non-fuzzy operators, the condition must strictly match.\n * - For the \"any\" operator, a fuzzy similarity score is computed.\n *   Items with a fuzzy score below a given threshold (e.g., 0.3) are excluded.\n *\n * The overall item score is the average of the scores from all conditions.\n * The results are sorted in descending order of relevance.\n *\n * @param items - A Map containing items to filter.\n * @param queries - An array of query conditions to apply.\n * @param fuzzyThreshold - Minimum score required for fuzzy matches (default: 0.3)\n * @returns An array of items that match all query conditions, sorted by relevance.\n */\nexport function filterMapItems<T extends Record<string, any>>(\n\titems: Map<string, T>,\n\tqueries: QueryCondition[] = [],\n\tfuzzyThreshold: number = 0.3,\n): T[] {\n\t// If no queries, return all items unsorted\n\tif (!queries.length) {\n\t\treturn Array.from(items.values())\n\t}\n\n\t// Score and filter each item\n\tconst scoredItems: ScoredItem<T>[] = []\n\n\tfor (const [_, item] of items.entries()) {\n\t\tlet totalScore = 0\n\t\tlet matchCount = 0\n\t\tlet valid = true\n\n\t\tfor (const query of queries) {\n\t\t\tconst result = applyQueryCondition(item, query, fuzzyThreshold)\n\n\t\t\tif (!result.valid) {\n\t\t\t\tvalid = false\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\ttotalScore += result.score\n\t\t\tmatchCount++\n\t\t}\n\n\t\tif (valid) {\n\t\t\tscoredItems.push({\n\t\t\t\titem,\n\t\t\t\tscore: matchCount > 0 ? totalScore / matchCount : 1,\n\t\t\t})\n\t\t}\n\t}\n\n\t// Sort by descending score\n\tscoredItems.sort((a, b) => b.score - a.score)\n\n\treturn scoredItems.map(x => x.item)\n}\n\n/**\n * Filter an array of items using query conditions\n */\nexport function filterArrayItems<T extends Record<string, any>>(\n\titems: T[],\n\tqueries: QueryCondition[] = [],\n\tfuzzyThreshold: number = 0.3,\n): T[] {\n\t// Create temporary map with numeric indices as keys\n\tconst map = new Map<string, T>()\n\titems.forEach((item, index) => map.set(String(index), item))\n\n\treturn filterMapItems(map, queries, fuzzyThreshold)\n}\n\n// Improved type guards for filter-directive.ts\n\n/**\n * Type guard for checking if a value is an array with better type inference\n * @param value Value to check\n * @returns True if the value is an array\n */\nexport function isArray<T = unknown>(value: unknown): value is Array<T> {\n\treturn Array.isArray(value)\n}\n\n/**\n * Type guard for checking if a value is a string\n * @param value Value to check\n * @returns True if the value is a string\n */\nexport function isString(value: unknown): value is string {\n\treturn typeof value === 'string'\n}\n\n/**\n * Type guard for checking if a value is a number\n * @param value Value to check\n * @returns True if the value is a number and not NaN\n */\nexport function isNumber(value: unknown): value is number {\n\treturn typeof value === 'number' && !isNaN(value)\n}\n\n/**\n * Type guard for checking if a value is a date\n * @param value Value to check\n * @returns True if the value is a valid Date object\n */\nexport function isDate(value: unknown): value is Date {\n\treturn value instanceof Date && !isNaN(value.getTime())\n}\n\n/**\n * Type guard for checking if a value is an iterable collection\n * @param value Value to check\n * @returns True if the value implements the iterable protocol\n */\nexport function isIterable<T = unknown>(value: unknown): value is Iterable<T> {\n\t// Must be non-null and of type 'object'\n\tif (value == null || typeof value !== 'object') {\n\t\treturn false\n\t}\n\n\t// Check for Symbol.iterator method\n\treturn Symbol.iterator in Object(value) && typeof (value as any)[Symbol.iterator] === 'function'\n}\n\n/**\n * Type guard for checking if a value is a Map\n * @param value Value to check\n * @returns True if the value is a Map\n */\nexport function isMap<K = unknown, V = unknown>(value: unknown): value is Map<K, V> {\n\treturn value instanceof Map\n}\n\n/**\n * Type guard for checking if a value is a Set\n * @param value Value to check\n * @returns True if the value is a Set\n */\nexport function isSet<T = unknown>(value: unknown): value is Set<T> {\n\treturn value instanceof Set\n}\n\n/**\n * Type guard for checking if a value is a plain object (not an array, Map, etc.)\n * @param value Value to check\n * @returns True if the value is a plain object\n */\nexport function isPlainObject(value: unknown): value is Record<string, unknown> {\n\tif (value === null || typeof value !== 'object') {\n\t\treturn false\n\t}\n\n\tconst proto = Object.getPrototypeOf(value)\n\treturn proto === Object.prototype || proto === null\n}\n\n/**\n * Type guard for checking if a value is undefined or null\n * @param value Value to check\n * @returns True if the value is undefined or null\n */\nexport function isNil(value: unknown): value is undefined | null {\n\treturn value === undefined || value === null\n}\n\n/**\n * Improved type-safe comparison function that uses appropriate type guards\n * @param op Comparison operator\n * @param actual Actual value\n * @param expected Expected value\n * @returns Result of the comparison\n */\nexport function compareValues(op: ComparisonOperator, actual: unknown, expected: unknown): boolean {\n\t// Handle null/undefined cases\n\tif (isNil(actual) && isNil(expected)) return true\n\tif (isNil(actual) || isNil(expected)) {\n\t\t// For equality operators, null == null but null != non-null\n\t\tif (op === '==') return actual === expected\n\t\tif (op === '!=') return actual !== expected\n\t\t// Other operators should return false for null/undefined values\n\t\treturn false\n\t}\n\n\tswitch (op) {\n\t\tcase '==':\n\t\t\treturn actual === expected\n\t\tcase '!=':\n\t\t\treturn actual !== expected\n\t\tcase '>':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual > expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() > expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) > 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '<':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual < expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() < expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) < 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '>=':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual >= expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() >= expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) >= 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '<=':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual <= expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() <= expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) <= 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase 'includes': {\n\t\t\tif (isString(actual)) {\n\t\t\t\treturn actual.toLowerCase().includes(safeString(expected).toLowerCase())\n\t\t\t}\n\t\t\tif (isArray(actual)) {\n\t\t\t\treturn actual.includes(expected as any)\n\t\t\t}\n\t\t\tif (isSet(actual)) {\n\t\t\t\treturn actual.has(expected as any)\n\t\t\t}\n\t\t\tif (isMap(actual)) {\n\t\t\t\treturn Array.from(actual.values()).includes(expected as any)\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'notIncludes': {\n\t\t\tif (isString(actual)) {\n\t\t\t\treturn !actual.toLowerCase().includes(safeString(expected).toLowerCase())\n\t\t\t}\n\t\t\tif (isArray(actual)) {\n\t\t\t\treturn !actual.includes(expected as any)\n\t\t\t}\n\t\t\tif (isSet(actual)) {\n\t\t\t\treturn !actual.has(expected as any)\n\t\t\t}\n\t\t\tif (isMap(actual)) {\n\t\t\t\treturn !Array.from(actual.values()).includes(expected as any)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t\tcase 'startsWith': {\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.toLowerCase().startsWith(expected.toLowerCase())\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'endsWith': {\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.toLowerCase().endsWith(expected.toLowerCase())\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'in': {\n\t\t\tif (isArray(expected)) {\n\t\t\t\treturn expected.includes(actual as any)\n\t\t\t}\n\t\t\tif (isSet(expected)) {\n\t\t\t\treturn expected.has(actual as any)\n\t\t\t}\n\t\t\tif (isMap(expected)) {\n\t\t\t\treturn expected.has(actual as any) || Array.from(expected.values()).includes(actual as any)\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'notIn': {\n\t\t\tif (isArray(expected)) {\n\t\t\t\treturn !expected.includes(actual as any)\n\t\t\t}\n\t\t\tif (isSet(expected)) {\n\t\t\t\treturn !expected.has(actual as any)\n\t\t\t}\n\t\t\tif (isMap(expected)) {\n\t\t\t\treturn !expected.has(actual as any) && !Array.from(expected.values()).includes(actual as any)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t\tdefault: {\n\t\t\tconsole.warn(`Operator \"${op}\" is not supported in comparison.`)\n\t\t\treturn false\n\t\t}\n\t}\n}\n\n// Export a simpler alias for filterMapItems\nexport const filterMap = filterMapItems\n\n// Export an alias for filterArrayItems\nexport const filterArray = filterArrayItems\n","// src/store/selectors.ts\nimport { BehaviorSubject, Observable, combineLatest, distinctUntilChanged, map, share, shareReplay } from 'rxjs'\nimport { ICollectionStore, IStore, StoreError } from './types'\n\n/**\n * Deep equality comparison for maps and complex objects\n * More efficient than JSON.stringify for large objects\n */\nfunction deepEqual(a: unknown, b: unknown): boolean {\n\tif (a === b) return true\n\n\tif (a instanceof Map && b instanceof Map) {\n\t\tif (a.size !== b.size) return false\n\t\tfor (const [key, value] of a) {\n\t\t\tif (!b.has(key) || !deepEqual(value, b.get(key))) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (a instanceof Set && b instanceof Set) {\n\t\tif (a.size !== b.size) return false\n\t\tfor (const item of a) {\n\t\t\tif (!b.has(item)) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (typeof a === 'object' && a !== null && typeof b === 'object' && b !== null) {\n\t\tconst keysA = Object.keys(a)\n\t\tconst keysB = Object.keys(b)\n\n\t\tif (keysA.length !== keysB.length) return false\n\n\t\tfor (const key of keysA) {\n\t\t\t// @ts-ignore: Index signature\n\t\t\tif (!deepEqual(a[key], b[key])) return false\n\t\t}\n\n\t\treturn true\n\t}\n\n\treturn false\n}\n\n/**\n * Creates a selector that derives a value from store state\n *\n * @param store The store to observe\n * @param selectorFn Function that transforms the state\n * @returns An observable of the selected state that only emits when the derived value changes\n */\nexport function createSelector<T, R>(store: IStore<T>, selectorFn: (state: T) => R): Observable<R> {\n\treturn store.$.pipe(map(selectorFn), distinctUntilChanged<R>(deepEqual), shareReplay(1))\n}\n\n/**\n * Creates a selector for collection stores that derives a value from the collection\n *\n * @param store The collection store to observe\n * @param selectorFn Function that transforms the collection\n * @returns An observable of the selected state that only emits when the derived value changes\n */\nexport function createCollectionSelector<T, R>(\n\tstore: ICollectionStore<T>,\n\tselectorFn: (state: Map<string, T>) => R,\n): Observable<R> {\n\treturn store.$.pipe(map(selectorFn), distinctUntilChanged<R>(deepEqual), shareReplay(1))\n}\n\n/**\n * Creates a selector that returns all items from a collection as an array\n *\n * @param store The collection store\n * @returns An observable of all items as an array\n */\nexport function createItemsSelector<T>(store: ICollectionStore<T>): Observable<T[]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.values()))\n}\n\n/**\n * Creates a selector that retrieves a single item from a collection\n *\n * @param store The collection store\n * @param itemKey The key of the item to select\n * @returns An observable of the selected item that emits when the item changes\n */\nexport function createItemSelector<T>(store: ICollectionStore<T>, itemKey: string): Observable<T | undefined> {\n\treturn createCollectionSelector(store, collection => collection.get(itemKey))\n}\n\n/**\n * Creates a selector that returns all keys from a collection\n */\nexport function createKeysSelector<T>(store: ICollectionStore<T>): Observable<string[]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.keys()))\n}\n\n/**\n * Creates a selector that returns entries (key-value pairs) from a collection\n */\nexport function createEntriesSelector<T>(store: ICollectionStore<T>): Observable<[string, T][]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.entries()))\n}\n\n/**\n * Creates a selector that sorts collection items\n */\nexport function createSortSelector<T>(store: ICollectionStore<T>, compareFn: (a: T, b: T) => number): Observable<T[]> {\n\treturn createCollectionSelector(store, collection => {\n\t\treturn Array.from(collection.values()).sort(compareFn)\n\t})\n}\n\n/**\n * Creates a selector that finds the first item matching a predicate\n */\nexport function createFindSelector<T>(\n\tstore: ICollectionStore<T>,\n\tpredicate: (item: T, key: string) => boolean,\n): Observable<T | undefined> {\n\treturn createCollectionSelector(store, collection => {\n\t\tfor (const [key, item] of collection.entries()) {\n\t\t\tif (predicate(item, key)) {\n\t\t\t\treturn item\n\t\t\t}\n\t\t}\n\t\treturn undefined\n\t})\n}\n\n/**\n * Creates a selector that filters items from a collection - OPTIMIZED\n *\n * @param store The collection store\n * @param filterFn Function that returns true for items to include\n * @returns An observable of filtered items as an array\n */\nexport function createFilterSelector<T>(\n\tstore: ICollectionStore<T>,\n\tfilterFn: (item: T, key: string) => boolean,\n): Observable<T[]> {\n\treturn createCollectionSelector(store, collection =>\n\t\tArray.from(collection.entries())\n\t\t\t.filter(([key, item]) => filterFn(item, key))\n\t\t\t.map(([_, item]) => item),\n\t)\n}\n\n/**\n * Creates a selector that maps collection values through a transform function - OPTIMIZED\n */\nexport function createMapSelector<T, R>(\n\tstore: ICollectionStore<T>,\n\tmapFn: (item: T, key: string) => R,\n): Observable<R[]> {\n\treturn createCollectionSelector(store, collection =>\n\t\tArray.from(collection.entries()).map(([key, item]) => mapFn(item, key)),\n\t)\n}\n\n/**\n * Creates a selector that counts items in a collection, optionally filtered - OPTIMIZED\n *\n * @param store The collection store\n * @param filterFn Optional function to filter which items to count\n * @returns An observable of the count\n */\nexport function createCountSelector<T>(\n\tstore: ICollectionStore<T>,\n\tfilterFn?: (item: T, key: string) => boolean,\n): Observable<number> {\n\treturn createCollectionSelector(store, collection => {\n\t\tif (!filterFn) return collection.size\n\n\t\treturn Array.from(collection.entries()).filter(([key, item]) => filterFn(item, key)).length\n\t})\n}\n\n/**\n * Optimized RxJS Pipeline - use share with reset on refCount zero for better memory management\n * in scenarios where selector subscriptions come and go\n *\n * @param store The store to observe\n * @param selectorFn Function that transforms the state\n * @returns An observable of the selected state with improved memory management\n */\nexport function createOptimizedSelector<T, R>(store: IStore<T>, selectorFn: (state: T) => R): Observable<R> {\n\treturn store.$.pipe(\n\t\tmap(selectorFn),\n\t\tdistinctUntilChanged<R>(deepEqual),\n\t\tshare({\n\t\t\tresetOnRefCountZero: true,\n\t\t\tresetOnError: false,\n\t\t\tresetOnComplete: false,\n\t\t}),\n\t)\n}\n\n/**\n * Creates a compound selector from multiple stores\n *\n * This function combines data from multiple stores to create a derived\n * state that's compatible with the @select decorator.\n *\n * @param stores Array of stores to derive state from\n * @param selectorFns Selector functions for each store\n * @param combinerFn Function that combines the selected values\n * @returns A store-compatible object to use with @select\n */\nexport function createCompoundSelector<R>(\n\tstores: Array<IStore<any> | ICollectionStore<any>>,\n\tselectorFns: Array<(state: any) => any>,\n\tcombinerFn: (...values: any[]) => R,\n): IStore<R> {\n\t// Calculate initial value\n\tconst initialValues = stores.map((store, index) => selectorFns[index](store.value))\n\tconst initialValue = combinerFn(...initialValues)\n\n\t// Create a store with the initial value\n\tconst result: IStore<R> = {\n\t\t$: new BehaviorSubject<R>(initialValue),\n\t\terror$: new BehaviorSubject<StoreError | null>(null),\n\t\tready: true,\n\t\tdefaultValue: initialValue,\n\n\t\tget value(): R {\n\t\t\treturn this.$.getValue()\n\t\t},\n\n\t\t// These methods are no-ops for read-only stores\n\t\tset(_value: Partial<R>, _merge?: boolean): void {\n\t\t\tconsole.warn('Compound selector store is read-only')\n\t\t},\n\n\t\tclear(): void {\n\t\t\tthis.$.next(this.defaultValue)\n\t\t},\n\n\t\treplace(_newValue: R): void {\n\t\t\tconsole.warn('Compound selector store is read-only')\n\t\t},\n\n\t\tdelete<K extends keyof R>(_key: K): void {\n\t\t\tconsole.warn('Compound selector store is read-only')\n\t\t},\n\n\t\tdestroy(): void {\n\t\t\tthis.$.complete()\n\t\t\tthis.error$.complete()\n\t\t},\n\t}\n\n\t// Set up the reactivity by subscribing to all source stores\n\tconst observables = stores.map((store, _) => store.$)\n\n\t// Create a subscription that updates the result whenever any source changes\n\tconst subscription = combineLatest(observables).subscribe({\n\t\tnext: storeValues => {\n\t\t\ttry {\n\t\t\t\t// Apply selectors to each store value\n\t\t\t\tconst selectedValues = storeValues.map((value, index) => selectorFns[index](value))\n\n\t\t\t\t// Apply combiner function\n\t\t\t\tconst newValue = combinerFn(...selectedValues)\n\n\t\t\t\t// Update the BehaviorSubject\n\t\t\t\tresult.$.next(newValue)\n\t\t\t} catch (err) {\n\t\t\t\tconst error = new StoreError('Error in compound selector', err)\n\t\t\t\tresult.error$.next(error)\n\t\t\t\tconsole.error(error)\n\t\t\t}\n\t\t},\n\t\terror: err => {\n\t\t\tconst error = new StoreError('Error in store subscription', err)\n\t\t\tresult.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t},\n\t})\n\n\t// Ensure the subscription is cleaned up when the store is destroyed\n\tconst originalDestroy = result.destroy\n\tresult.destroy = function () {\n\t\tsubscription.unsubscribe()\n\t\toriginalDestroy.call(this)\n\t}\n\n\treturn result\n}\n","// src/store/selector-hook.ts - Improved memory management\nimport { property as litProperty } from 'lit/decorators.js'\nimport { Observable, Subject, Subscription } from 'rxjs'\nimport { takeUntil } from 'rxjs/operators'\nimport { createCollectionSelector, createSelector } from './selectors'\nimport { ICollectionStore, IStore } from './types'\n\n/**\n * Symbol used for storing cleanup resources\n * Using a Symbol prevents name collisions with component properties\n */\nconst CLEANUP_SUBJECT = Symbol('selectorCleanup')\nconst SUBSCRIPTIONS = Symbol('selectorSubscriptions')\nconst INITIALIZED = Symbol('selectorInitialized')\nconst CONNECTED_CALLED = Symbol('connectedCallbackCalled')\n\n/**\n * Component lifecycle interface\n */\ninterface ComponentWithLifecycle {\n\t// Lifecycle hooks\n\tisConnected: boolean\n\tdisconnectedCallback?: () => void\n\tconnectedCallback?: () => void\n\trequestUpdate?: () => void\n\n\t// Internal properties using symbols to avoid name collisions\n\t[CLEANUP_SUBJECT]?: Subject<void>\n\t[SUBSCRIPTIONS]?: Map<string, Subscription>\n\t[INITIALIZED]?: Set<string>\n\t[CONNECTED_CALLED]?: boolean\n\n\t// Value storage\n\t[key: string]: any\n}\n\n/**\n * Property descriptor interface\n */\ntype PropertyDescriptor<T> = {\n\tget?: () => T\n\tset?: (value: T) => void\n\tvalue?: T\n\tconfigurable?: boolean\n\tenumerable?: boolean\n\twritable?: boolean\n}\n\n/**\n * Options for selecting from a store\n */\ninterface SelectOptions {\n\t/** If true, will wait for selector to emit a value (including null) before calling connectedCallback. Only undefined is considered \"not ready\". Default is true. */\n\trequired?: boolean\n\n\t/** If true, will only update the component and not set the property value */\n\tupdateOnly?: boolean\n\n\t/** If true, will use structuredClone to deeply clone values (prevents mutations) */\n\tdeepClone?: boolean\n\n\t/** Custom equality function to determine when to update */\n\tequals?: (a: any, b: any) => boolean\n\n\t/** Debug mode - logs selector activity */\n\tdebug?: boolean\n}\n\n/**\n * Type guard to check if a store is a collection store\n */\nfunction isCollectionStore<T>(store: IStore<any> | ICollectionStore<T>): store is ICollectionStore<T> {\n\treturn 'set' in store && typeof store.set === 'function' && store.value instanceof Map\n}\n\n/**\n * Ensures the cleanup resources exist on the component\n */\nfunction ensureCleanupResources(component: ComponentWithLifecycle): void {\n\tif (!component[CLEANUP_SUBJECT] || component[CLEANUP_SUBJECT].closed) {\n\t\tcomponent[CLEANUP_SUBJECT] = new Subject<void>()\n\t}\n\n\tif (!component[SUBSCRIPTIONS]) {\n\t\tcomponent[SUBSCRIPTIONS] = new Map()\n\t}\n\n\tif (!component[INITIALIZED]) {\n\t\tcomponent[INITIALIZED] = new Set()\n\t}\n}\n\n/**\n * Cleans up all selector resources\n */\nfunction cleanupSelectorResources(component: ComponentWithLifecycle): void {\n\tif (component[CLEANUP_SUBJECT]) {\n\t\tcomponent[CLEANUP_SUBJECT].next()\n\t\tcomponent[CLEANUP_SUBJECT].complete()\n\t\tcomponent[CLEANUP_SUBJECT] = undefined\n\t}\n\n\tif (component[SUBSCRIPTIONS]) {\n\t\tcomponent[SUBSCRIPTIONS].forEach(sub => sub.unsubscribe())\n\t\tcomponent[SUBSCRIPTIONS].clear()\n\t\tcomponent[SUBSCRIPTIONS] = undefined\n\t}\n\n\tif (component[INITIALIZED]) {\n\t\tcomponent[INITIALIZED].clear()\n\t\tcomponent[INITIALIZED] = undefined\n\t}\n\n\t// Reset the connected flag when cleaning up\n\tcomponent[CONNECTED_CALLED] = undefined\n}\n\n/**\n * Selector decorator that connects a component property to a store selector\n * with improved memory management\n *\n * @param store The store to select from\n * @param selectorFn Optional function to transform the store state\n * @param options Additional options for the selector\n */\nexport function select<T, R>(\n\tstore: IStore<T> | ICollectionStore<T>,\n\tselectorFn: (state: any) => R = (state: R) => state,\n\toptions: SelectOptions = { required: true },\n) {\n\treturn function (proto: Record<string, any>, propName: string, _descriptor?: PropertyDescriptor<R>) {\n\t\t// Register as a Lit property\n\t\tlitProperty({ attribute: false, type: Object })(proto, propName)\n\n\t\t// Store original lifecycle methods\n\t\tconst originalConnectedCallback = proto.connectedCallback\n\t\tconst originalDisconnectedCallback = proto.disconnectedCallback\n\n\t\t// Override connectedCallback to set up subscription\n\t\tproto.connectedCallback = function (this: ComponentWithLifecycle) {\n\t\t\t// Initialize cleanup resources\n\t\t\tensureCleanupResources(this)\n\n\t\t\t// Create the appropriate selector\n\t\t\tconst selector: Observable<R> = isCollectionStore(store)\n\t\t\t\t? createCollectionSelector(store, selectorFn)\n\t\t\t\t: createSelector(store as IStore<T>, selectorFn)\n\n\t\t\t// Call original connectedCallback immediately if not waiting for data\n\t\t\tif (!options.required && !this[CONNECTED_CALLED]) {\n\t\t\t\toriginalConnectedCallback?.call(this)\n\t\t\t\tthis[CONNECTED_CALLED] = true\n\t\t\t}\n\n\t\t\t// Clean up any existing subscription\n\t\t\tif (this[SUBSCRIPTIONS]!.has(propName)) {\n\t\t\t\tthis[SUBSCRIPTIONS]!.get(propName)?.unsubscribe()\n\t\t\t\tthis[SUBSCRIPTIONS]!.delete(propName)\n\t\t\t}\n\n\t\t\t// Debug log if needed\n\t\t\tif (options.debug) {\n\t\t\t\tconsole.debug(`[select] Setting up subscription for ${propName}`)\n\t\t\t}\n\n\t\t\t// Create new subscription with better error handling\n\t\t\tconst subscription = selector.pipe(takeUntil(this[CLEANUP_SUBJECT]!)).subscribe({\n\t\t\t\tnext: (value: R) => {\n\t\t\t\t\t// Handle value updates\n\t\t\t\t\tconst newValue = options.deepClone ? structuredClone(value) : value\n\n\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\tconsole.debug(`[select] New value for ${propName}:`, newValue)\n\t\t\t\t\t}\n\n\t\t\t\t\tif (!options.updateOnly) {\n\t\t\t\t\t\tthis[propName] = newValue\n\t\t\t\t\t}\n\n\t\t\t\t\tthis.requestUpdate?.()\n\n\t\t\t\t\t// If required and not initialized, call connectedCallback when we get a value\n\t\t\t\t\t// Allow null values but not undefined (undefined means the selector hasn't emitted yet)\n\t\t\t\t\tif (options.required && !this[INITIALIZED]!.has(propName) && newValue !== undefined) {\n\t\t\t\t\t\tthis[INITIALIZED]!.add(propName)\n\t\t\t\t\t\t\n\t\t\t\t\t\t// Only call original connectedCallback once, regardless of how many selectors\n\t\t\t\t\t\tif (!this[CONNECTED_CALLED]) {\n\t\t\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\t\t\tconsole.debug(`[select] Calling delayed connectedCallback for ${propName}`)\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\toriginalConnectedCallback?.call(this)\n\t\t\t\t\t\t\tthis[CONNECTED_CALLED] = true\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\terror: (err: Error) => {\n\t\t\t\t\tconsole.error(`Error in selector subscription for ${propName}:`, err)\n\t\t\t\t\t// Resubscribe on error to prevent component from becoming unresponsive\n\t\t\t\t\tif (this.isConnected) {\n\t\t\t\t\t\t// Small delay to prevent immediate resubscription\n\t\t\t\t\t\tsetTimeout(() => {\n\t\t\t\t\t\t\tif (this.isConnected) {\n\t\t\t\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\t\t\t\tconsole.debug(`[select] Resubscribing after error for ${propName}`)\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tthis.connectedCallback?.()\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}, 1000)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t})\n\n\t\t\t// Store the subscription for cleanup\n\t\t\tthis[SUBSCRIPTIONS]!.set(propName, subscription)\n\t\t}\n\n\t\t// Override disconnectedCallback to clean up subscriptions\n\t\tproto.disconnectedCallback = function (this: ComponentWithLifecycle) {\n\t\t\t// Call original disconnectedCallback\n\t\t\toriginalDisconnectedCallback?.call(this)\n\n\t\t\t// Debug log if needed\n\t\t\tif (options.debug) {\n\t\t\t\tconsole.debug(`[select] Cleaning up resources in disconnectedCallback`)\n\t\t\t}\n\n\t\t\t// Clean up all subscription resources\n\t\t\tcleanupSelectorResources(this)\n\t\t}\n\t}\n}\n\n/**\n * Creates a selector decorator that selects a specific item from a collection store\n * with improved memory management\n *\n * @param store The collection store\n * @param keyGetter Function that returns the key to select\n * @param options Additional options\n */\nexport function selectItem<T>(\n\tstore: ICollectionStore<T>,\n\tkeyGetter: (component: any) => string,\n\toptions: SelectOptions = { required: true },\n) {\n\treturn function (proto: Record<string, any>, propName: string, _descriptor?: PropertyDescriptor<T | undefined>) {\n\t\tselect(\n\t\t\tstore,\n\t\t\tfunction (state) {\n\t\t\t\t// This will be evaluated during subscription, when 'this' is available\n\t\t\t\tconst itemKey = keyGetter(this)\n\t\t\t\treturn itemKey ? state.get(itemKey) : undefined\n\t\t\t},\n\t\t\toptions,\n\t\t)(proto, propName)\n\t}\n}\n"],"x_google_ignoreList":[0],"mappings":";;;AACA,IAAI,KAAU,OAAO,IAAI,gBAAA,EACrB,IAAY,OAAO,IAAI,kBAAA,EACvB,IAAc,OAAO,IAAI,cAAA,EAGzB,KAAA,QAAA,IAAA,aAAkC,eA8BlC,EAAA,GA9BiD;CAEnD,SAAS,GAAA;AACP,SAAO,mBAAmB,EAAA,kFAAyF,EAAA;;CAErH,SAAS,GAAA;AACP,SAAO,sJAAsJ,EAAA;;CAE/J;CACA,SAAS,GAAA;AACP,SAAO,yHAAyH;;CAElI;CACA;CACA;CACA;CACA;CACA;CACA,SAAS,GAAA;AACP,SAAO,mCAAmC;;CAE5C;CACA;CACA;CACA;CACA,SAAS,GAAA;AACP,SAAO,oCAAoC;;CAAA;AAK/C,SAAS,EAAI,GAAA,GAAU,GAAA;AACrB,KAAA,QAAA,IAAA,aAA6B,cAAc;EACzC,IAAM,IAAI,GAAO,IACX,IAAM,EAAW,EAAA,GAAK,EAAE,MAAM,MAAM,EAAA,GAAQ;AAClD,QAAU,MAAM,WAAW,IAAA;;AAE7B,OAAU,MACR,8BAA8B,EAAA,yCAAA;;AAKlC,IAAI,IAAI,QACJ,IAAiB,EAAE,gBACnB,IAAc,eACd,KAAY,aACZ,KAAe,gBACf,IAAa,cACb,IAAW,YACX,IAAQ,SACR,KAAW,MAAA,CAAA,CAAY,KAAA,CAAA,CAAW,EAAM;AAC5C,SAAS,EAAY,GAAA;AACnB,QAAA,CAAA,CAAK,MAEEA,GAAc,EAAA,IAAUC,GAAQ,EAAA,IAAA,CAAA,CAAY,EAAM,MAAA,CAAA,CAAgB,EAAM,KAAe,MAAcC,GAAM,EAAA,IAAUC,GAAM,EAAA;;AAEpI,IAAI,KAAmB,EAAE,IAAW,GAAa,UAAA,EAC7C,qBAAoC,IAAI,SAAA;AAC5C,SAASH,GAAc,GAAA;AACrB,KAAA,CAAK,KAAA,CAAU,EAAY,EAAA,CACzB,QAAA,CAAO;CACT,IAAM,IAAQ,EAAe,EAAA;AAC7B,KAAI,MAAU,QAAQ,MAAU,EAAE,IAChC,QAAA,CAAO;CACT,IAAM,IAAO,EAAE,eAAe,KAAK,GAAO,EAAA,IAAgB,EAAM;AAChE,KAAI,MAAS,OACX,QAAA,CAAO;AACT,KAAA,CAAK,EAAW,EAAA,CACd,QAAA,CAAO;CACT,IAAI,IAAa,GAAkB,IAAI,EAAA;AAKvC,QAJI,MAIJ,KAJwB,MACtB,IAAa,SAAS,SAAS,KAAK,EAAA,EACpC,GAAkB,IAAI,GAAM,EAAA,GAEvB,MAAe;;AAOxB,SAAS,EAAK,GAAK,GAAM,IAAA,CAAS,GAAA;AACP,CAArB,EAAY,EAAA,KAAS,KACV,IAAS,QAAQ,QAAQ,EAAA,GAAO,EAAE,KAAK,EAAA,EAC/C,SAAS,MAAA;AACZ,IAAK,GAAK,EAAI,IAAM,EAAA;GAAA,GAGtB,EAAI,SAAS,GAAO,MAAU,EAAK,GAAO,GAAO,EAAA,CAAA;;AAGrD,SAAS,EAAY,GAAA;CACnB,IAAM,IAAQ,EAAM;AACpB,QAAO,IAAQ,EAAM,QAAQC,GAAQ,EAAA,GAAS,IAAgBC,GAAM,EAAA,GAAS,IAAcC,GAAM,EAAA,GAAS,IAAc;;AAE1H,IAAI,MAAO,GAAO,GAAM,IAAO,EAAY,EAAA,KAAW,MAAS,IAAc,EAAM,IAAI,EAAA,GAAQ,EAAE,IAAW,eAAe,KAAK,GAAO,EAAA,EACnI,MAAO,GAAO,GAAM,IAAO,EAAY,EAAA,KAEzC,MAAS,IAAc,EAAM,IAAI,EAAA,GAAQ,EAAM,IAE7C,MAAO,GAAO,GAAgB,GAAO,IAAO,EAAY,EAAA,KAAA;AAC7C,CAAT,MAAS,IACX,EAAM,IAAI,GAAgB,EAAA,GACnB,MAAS,IAChB,EAAM,IAAI,EAAA,GAEV,EAAM,KAAkB;GASxBF,KAAU,MAAM,SAChBC,MAAS,MAAW,aAAkB,KACtCC,MAAS,MAAW,aAAkB,KACtC,KAAe,MAA6B,OAAX,KAAW,UAC5C,KAAc,MAA6B,OAAX,KAAW,YAC3C,MAAa,MAA6B,OAAX,KAAW,WAU1C,KAAU,MAAU,EAAM,SAAS,EAAM,OACzC,MAAY,MAAA;CACd,IAAM,MAPa,MACd,EAAY,EAAA,GAEV,IAAQ,KADN,MAKwB,EAAA;AACjC,QAAO,IAAa,EAAW,SAAS,EAAW,QAAQ;GAEzD,MAAiB,MAAU,EAAM,YAAY,EAAM,QAAQ,EAAM;AACrE,SAAS,GAAY,GAAM,GAAA;AACzB,KAAID,GAAM,EAAA,CACR,QAAO,IAAI,IAAI,EAAA;AAEjB,KAAIC,GAAM,EAAA,CACR,QAAO,IAAI,IAAI,EAAA;AAEjB,KAAIF,GAAQ,EAAA,CACV,QAAO,MAAM,IAAW,MAAM,KAAK,EAAA;CACrC,IAAM,IAAUD,GAAc,EAAA;AAC9B,KAAA,CAAe,MAAX,KAAmB,MAAW,gBAAX,CAA4B,GAAS;EAC1D,IAAM,IAAc,EAAE,0BAA0B,EAAA;AAAA,SACzC,EAAY;EACnB,IAAI,IAAO,QAAQ,QAAQ,EAAA;AAC3B,OAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,KAAK;GACpC,IAAM,IAAM,EAAK,IACX,IAAO,EAAY;AAAA,IACF,MAAnB,EAAK,OACP,EAAK,KAAA,CAAY,GACjB,EAAK,MAAA,CAAgB,KAEnB,EAAK,OAAO,EAAK,SACnB,EAAY,KAAO;KAChB,KAAA,CAAe;KACf,IAAA,CAAW;KAEX,IAAa,EAAK;KAClB,IAAQ,EAAK;IAAA;;AAGpB,SAAO,EAAE,OAAO,EAAe,EAAA,EAAO,EAAA;;CACjC;EACL,IAAM,IAAQ,EAAe,EAAA;AAC7B,MAAI,MAAU,QAAQ,EACpB,QAAO,EAAA,GAAK,GAAA;EAEd,IAAM,IAAM,EAAE,OAAO,EAAA;AACrB,SAAO,EAAE,OAAO,GAAK,EAAA;;;AAGzB,SAAS,GAAO,GAAK,IAAA,CAAO,GAAA;AAC1B,QAAI,EAAS,EAAA,IAAQ,EAAQ,EAAA,IAAA,CAAS,EAAY,EAAA,KAE9C,EAAY,EAAA,GAAO,KACrB,EAAE,iBAAiB,GAAK;EACtB,KAAK;EACL,KAAK;EACL,OAAO;EACP,QAAQ;EAAA,CAAA,EAGZ,EAAE,OAAO,EAAA,EACL,KACF,EACE,IACC,GAAM,MAAA;AACL,KAAO,GAAA,CAAO,EAAA;IAAA,CAEhB,EAAA,GAhBK;;AAuBX,IAAI,IAA2B,EAAA,CAC5B,IAJH,WAAA;AACE,GAAI,EAAA;GAAA;AAKN,SAAS,EAAS,GAAA;AAChB,QAAI,MAAQ,QAAR,CAAiB,EAAY,EAAA,IAE1B,EAAE,SAAS,EAAA;;AAIpB,IAAI,IAAe,UACf,KAAgB,WAChB,KAAqB,gBACrB,KAAU,EAAA;AACd,SAAS,EAAU,GAAA;CACjB,IAAM,IAAS,GAAQ;AAIvB,QAHK,KACH,EAAI,GAAG,EAAA,EAEF;;AAET,IAOI,GAPA,MAAkB,MAAA,CAAA,CAAgB,GAAQ,IAQ1C,UAAwB;AAc5B,SAAS,GAAkB,GAAO,GAAA;AAC5B,OACF,EAAM,eAAe,EAAU,GAAA,EAC/B,EAAM,WAAW,EAAA,EACjB,EAAM,kBAAkB,EAAA,EACxB,EAAM,iBAAiB;;AAG3B,SAAS,GAAY,GAAA;AACnB,IAAW,EAAA,EACX,EAAM,QAAQ,QAAQ,GAAA,EACtB,EAAM,UAAU;;AAElB,SAAS,GAAW,GAAA;AACd,OAAU,MACZ,IAAe,EAAM;;AAGzB,IAAI,MAAc,MAAW,IA/BD;CAC1B,SAAS,EAAA;CACT,SA6BsD;CA5BtD,QA4BoE;CAzBpE,gBAAA,CAAgB;CAChB,oBAAoB;CACpB,6BAA6B,IAAI,KAAA;CACjC,sCAAsC,IAAI,KAAA;CAC1C,eAAe,GAAe,EAAA,GAAgB,EAAU,EAAA,GAAA,KAAqB;CAC7E,qBAAqB,GAAe,GAAA,GAAsB,EAAU,GAAA,GAAA,KAA2B;CAAA;AAqBjG,SAAS,GAAY,GAAA;CACnB,IAAM,IAAQ,EAAM;AACA,CAAhB,EAAM,UAAU,KAAkB,EAAM,UAAU,IACpD,EAAM,SAAA,GAEN,EAAM,WAAA,CAAW;;AAIrB,SAAS,GAAc,GAAQ,GAAA;AAC7B,GAAM,qBAAqB,EAAM,QAAQ;CACzC,IAAM,IAAY,EAAM,QAAQ;AAEhC,KADmB,MACnB,KADmC,KAAK,MAAW,GACnC;AACV,IAAU,GAAa,cACzB,GAAY,EAAA,EACZ,EAAI,EAAA,GAEF,EAAY,EAAA,KACd,IAASI,GAAS,GAAO,EAAA;EAE3B,IAAA,EAAM,cAAE,MAAiB;AACrB,OACF,EAAa,4BACX,EAAU,GAAa,OACvB,GACA,EAAA;OAIJ,KAASA,GAAS,GAAO,EAAA;AAO3B,QA4BF,SAAqB,GAAO,GAAO,IAAA,CAAO,GAAA;AAAA,GACnC,EAAM,WAAW,EAAM,OAAO,eAAe,EAAM,kBACtD,GAAO,GAAO,EAAA;GAnCJ,GAAO,GAAA,CAAQ,EAAA,EAC3B,GAAY,EAAA,EACR,EAAM,YACR,EAAM,eAAe,EAAM,UAAU,EAAM,gBAAA,EAEtC,MAAW,KAAU,KAAc,IAAd;;AAE9B,SAASA,GAAS,GAAW,GAAA;AAC3B,KAAI,EAAS,EAAA,CACX,QAAO;CACT,IAAM,IAAQ,EAAM;AACpB,KAAA,CAAK,EAEH,QADmB,EAAY,GAAO,EAAU,aAAa,EAAA;AAG/D,KAAA,CAAK,EAAY,GAAO,EAAA,CACtB,QAAO;AAET,KAAA,CAAK,EAAM,UACT,QAAO,EAAM;AAEf,KAAA,CAAK,EAAM,YAAY;EACrB,IAAA,EAAM,YAAE,MAAe;AACvB,MAAI,EACF,QAAO,EAAW,SAAS,GACR,GAAW,KAAX,CACR,EAAA;AAGb,KAA2B,GAAO,EAAA;;AAEpC,QAAO,EAAM;;AAOf,SAAS,GAAmB,GAAA;AAC1B,GAAM,aAAA,CAAa,GACnB,EAAM,OAAO;;AAEf,IAAI,KAAe,GAAO,MAAc,EAAM,WAAW,GACrD,KAAyB,EAAA;AAC7B,SAAS,GAAoB,GAAQ,GAAY,GAAgB,GAAA;CAC/D,IAAM,IAAa,EAAO,EAAA,EACpB,IAAa,EAAO;AAC1B,KAAI,MAAJ,KAAyB,KACF,GAAI,GAAY,GAAa,EAAA,KAC7B,EAEnB,QAAA,KADA,GAAI,GAAY,GAAa,GAAgB,EAAA;AAIjD,KAAA,CAAK,EAAO,iBAAiB;EAC3B,IAAM,IAAiB,EAAO,kCAAkC,IAAI,KAAA;AACpE,IAAK,IAAa,GAAK,MAAA;AACrB,OAAI,EAAQ,EAAA,EAAQ;IAClB,IAAM,IAAO,EAAe,IAAI,EAAA,IAAU,EAAA;AAC1C,MAAK,KAAK,EAAA,EACV,EAAe,IAAI,GAAO,EAAA;;IAAA;;CAIhC,IAAM,IAAY,EAAO,gBAAgB,IAAI,EAAA,IAAe;AAC5D,MAAK,IAAM,KAAY,EACrB,IAAI,GAAY,GAAU,GAAgB,EAAA;;AAe9C,SAAS,GAA2B,GAAO,GAAA;AAEzC,KADuB,EAAM,aAAA,CAAc,EAAM,eAAe,EAAM,UAAU,KAAe,EAAM,UAAU,KAAiB,EAAM,0BAA0B,EAAM,WAAW,QAAQ,KAAK,IAC1K;EAClB,IAAA,EAAM,cAAE,MAAiB;AACzB,MAAI,GAAc;GAChB,IAAM,IAAW,EAAa,QAAQ,EAAA;AAClC,QACF,EAAa,iBAAiB,GAAO,GAAU,EAAA;;AAGnD,KAAmB,EAAA;;;AAGvB,SAAS,GAAqB,GAAQ,GAAK,GAAA;CACzC,IAAA,EAAM,QAAE,MAAW;AACnB,KAAI,EAAQ,EAAA,EAAQ;EAClB,IAAM,IAAQ,EAAM;AAChB,IAAY,GAAO,EAAA,IACrB,EAAM,WAAW,KAAK,WAAA;AACpB,KAAY,EAAA,EAEZ,GAAoB,GAAQ,GADL,GAAc,EAAA,EACc,EAAA;IAAA;OAG9C,GAAY,EAAA,IACrB,EAAO,WAAW,KAAK,WAAA;EACrB,IAAM,IAAa,EAAO,EAAA;AACL,EAAjB,EAAO,UAAU,IACf,EAAW,IAAI,EAAA,IACjB,EAAY,GAAO,EAAO,aAAa,EAAA,GAGrC,GAAI,GAAY,GAAK,EAAO,MAAA,KAAW,KACrC,EAAO,QAAQ,SAAS,KAAA,CAA8C,OAAxC,EAAO,UAAU,IAAI,EAAA,IAAA,CAAQ,MAAmB,EAAO,SACvF,EACE,GAAI,EAAO,OAAO,GAAK,EAAO,MAAA,EAC9B,EAAO,aACP,EAAA;GAAA;;AAQd,SAAS,EAAY,GAAQ,GAAY,GAAA;AACvC,QAAA,CAAK,EAAU,OAAO,eAAe,EAAU,qBAAqB,KAGhE,EAAQ,EAAA,IAAW,EAAW,IAAI,EAAA,IAAA,CAAY,EAAY,EAAA,IAAW,EAAS,EAAA,KAGlF,EAAW,IAAI,EAAA,EACf,EAAK,IAAS,GAAK,MAAA;AACjB,MAAI,EAAQ,EAAA,EAAQ;GAClB,IAAM,IAAQ,EAAM;AAChB,KAAY,GAAO,EAAA,KAErB,GAAI,GAAQ,GADS,GAAc,EAAA,EACJ,EAAO,MAAA,EACtC,GAAmB,EAAA;QAEZ,GAAY,EAAA,IACrB,EAAY,GAAO,GAAY,EAAA;GAAA,GAf1B;;AA6DX,IAAI,IAAc;CAChB,IAAI,GAAO,GAAA;AACT,MAAI,MAAS,EACX,QAAO;EACT,IAAI,IAAc,EAAM,OAAO,qBACzB,IAAwB,EAAM,UAAU,KAAiC,OAAT,KAAS;AAC/E,MAAI,KACE,GAAa,uBAAuB,EAAA,CACtC,QAAO,EAAY,wBAAwB,GAAO,EAAA;EAGtD,IAAM,IAAS,EAAO,EAAA;AACtB,MAAA,CAAK,GAAI,GAAQ,GAAM,EAAM,MAAA,CAC3B,QAkHN,SAA2B,GAAO,GAAQ,GAAA;GACxC,IAAM,IAAO,GAAuB,GAAQ,EAAA;AAC5C,UAAO,IAAO,KAAS,IAAO,EAAK,KAGjC,EAAK,KAAK,KAAK,EAAM,OAAA,GAAA,KACd;IAxHoB,GAAO,GAAQ,EAAA;EAE1C,IAAM,IAAQ,EAAO;AAIrB,MAHI,EAAM,cAAA,CAAe,EAAY,EAAA,IAGjC,KAAyB,EAAM,mBAAmB,GAAa,sBACjE,EAAM,gBAAA,IA/XZ,SAAsB,GAAA;GACpB,IAAM,IAAA,CAAK;AACX,UAAO,OAAO,UAAU,EAAA,IAAM,OAAO,EAAA,KAAO;IA8XxB,EAAA,CAChB,QAAO;AAET,MAAI,MAAU,GAAK,EAAM,OAAO,EAAA,EAAO;AACrC,KAAY,EAAA;GACZ,IAAM,IAAW,EAAM,UAAU,IAAV,CAA2B,IAAO,GACnD,IAAa,EAAY,EAAM,QAAQ,GAAO,GAAO,EAAA;AAC3D,UAAO,EAAM,MAAM,KAAY;;AAEjC,SAAO;;CAET,MAAI,GAAO,MACF,KAAQ,EAAO,EAAA;CAExB,UAAQ,MACC,QAAQ,QAAQ,EAAO,EAAA,CAAA;CAEhC,IAAI,GAAO,GAAM,GAAA;EACf,IAAM,IAAO,GAAuB,EAAO,EAAA,EAAQ,EAAA;AACnD,MAAI,GAAM,IAER,QADA,EAAK,IAAI,KAAK,EAAM,QAAQ,EAAA,EAAA,CACrB;AAET,MAAA,CAAK,EAAM,WAAW;GACpB,IAAM,IAAW,GAAK,EAAO,EAAA,EAAQ,EAAA,EAC/B,IAAe,IAAW;AAChC,OAAI,KAAgB,EAAa,UAAU,EAGzC,QAFA,EAAM,MAAM,KAAQ,GACpB,EAAM,UAAU,IAAI,GAAA,CAAM,EAAA,EAAA,CACnB;AAET,SA5aM,IA4aC,QA5aE,IA4aK,KA1aT,MAAM,KAAK,IAAI,KAAM,IAAI,IAEzB,KAAM,KAAK,KAAM,OAwaM,MAxaN,KAwaqB,KAAK,GAAI,EAAM,OAAO,GAAM,EAAM,MAAA,EAC3E,QAAA,CAAO;AACT,KAAY,EAAA,EACZ,EAAY,EAAA;;EA/alB,IAAY,GAAG;AAibX,SAAI,EAAM,MAAM,OAAU,MACzB,MADyB,KACV,KAAK,KAAQ,EAAM,UACnC,OAAO,MAAM,EAAA,IAAU,OAAO,MAAM,EAAM,MAAM,GAAA,KAEhD,EAAM,MAAM,KAAQ,GACpB,EAAM,UAAU,IAAI,GAAA,CAAM,EAAA,EAC1B,GAAqB,GAAO,GAAM,EAAA,GAAA,CAHzB;;CAMX,iBAAe,GAAO,OACpB,EAAY,EAAA,EACR,GAAK,EAAM,OAAO,EAAA,KADV,KACyB,KAAK,KAAQ,EAAM,SACtD,EAAM,UAAU,IAAI,GAAA,CAAM,EAAA,EAC1B,EAAY,EAAA,IAEZ,EAAM,UAAU,OAAO,EAAA,EAErB,EAAM,SAAA,OACD,EAAM,MAAM,IAAA,CAEd;CAIT,yBAAyB,GAAO,GAAA;EAC9B,IAAM,IAAQ,EAAO,EAAA,EACf,IAAO,QAAQ,yBAAyB,GAAO,EAAA;AACrD,SAAK,KAEE;IACJ,IAAA,CAAW;IACX,KAAe,EAAM,UAAU,KAAiB,MAAS;IACzD,IAAa,EAAK;IAClB,IAAQ,EAAM;GAAA;;CAGnB,iBAAA;AACE,IAAI,GAAA;;CAEN,iBAAe,MACN,EAAe,EAAM,MAAA;CAE9B,iBAAA;AACE,IAAI,GAAA;;CAAA,EAGJ,IAAa,EAAA;AACjB,KAAK,IAAI,KAAO,GAAa;CAC3B,IAAI,IAAK,EAAY;AACrB,GAAW,KAAO,WAAA;EAChB,IAAM,IAAO;AAEb,SADA,EAAK,KAAK,EAAK,GAAG,IACX,EAAG,MAAM,MAAM,EAAA;;;AAa1B,SAAS,GAAK,GAAO,GAAA;CACnB,IAAM,IAAQ,EAAM;AAEpB,SADe,IAAQ,EAAO,EAAA,GAAS,GACzB;;AAUhB,SAAS,GAAuB,GAAQ,GAAA;AACtC,KAAA,EAAM,KAAQ,GACZ;CACF,IAAI,IAAQ,EAAe,EAAA;AAC3B,QAAO,IAAO;EACZ,IAAM,IAAO,OAAO,yBAAyB,GAAO,EAAA;AACpD,MAAI,EACF,QAAO;AACT,MAAQ,EAAe,EAAA;;;AAI3B,SAAS,EAAY,GAAA;AACd,GAAM,cACT,EAAM,YAAA,CAAY,GACd,EAAM,WACR,EAAY,EAAM,QAAA;;AAIxB,SAAS,EAAY,GAAA;AACd,CAEH,EAAM,WADN,EAAM,4BAA4B,IAAI,KAAA,EACxB,GACZ,EAAM,OACN,EAAM,OAAO,OAAO,sBAAA;;AAhD1B,EAAW,iBAAiB,SAAS,GAAO,GAAA;AAG1C,QAFA,QAAA,IAAA,aAA6B,gBAAgB,MAAM,SAAS,EAAA,CAAA,IAC1D,EAAI,GAAA,EACC,EAAW,IAAI,KAAK,MAAM,GAAO,GAAA,KAAW,EAAA;GAErD,EAAW,MAAM,SAAS,GAAO,GAAM,GAAA;AAGrC,QAFA,QAAA,IAAA,aAA6B,gBAAgB,MAAS,YAAY,MAAM,SAAS,EAAA,CAAA,IAC/E,EAAI,GAAA,EACC,EAAY,IAAI,KAAK,MAAM,EAAM,IAAI,GAAM,GAAO,EAAM,GAAA;;AA+MjE,SAAS,EAAY,GAAW,GAAO,GAAQ,GAAA;CAC7C,IAAA,CAAO,GAAO,KAASF,GAAM,EAAA,GAAS,EAAU,EAAA,CAAc,UAAU,GAAO,EAAA,GAAUC,GAAM,EAAA,GAAS,EAAU,EAAA,CAAc,UAAU,GAAO,EAAA,GA/WnJ,SAA0B,GAAM,GAAA;EAC9B,IAAM,IAAcF,GAAQ,EAAA,EACtB,IAAQ;GACZ,OAAO;GAEP,QAAQ,IAAS,EAAO,SAAS,GAAA;GAEjC,WAAA,CAAW;GAEX,YAAA,CAAY;GAGZ,WAAA,KAAgB;GAEhB,SAAS;GAET,OAAO;GAEP,QAAQ;GAGR,OAAO;GAEP,SAAS;GACT,WAAA,CAAW;GAEX,YAAA,KAAiB;GAAA,EAEf,IAAS,GACT,IAAQ;AACR,QACF,IAAS,CAAC,EAAA,EACV,IAAQ;EAEV,IAAA,EAAM,QAAE,GAAA,OAAQ,MAAU,MAAM,UAAU,GAAQ,EAAA;AAGlD,SAFA,EAAM,SAAS,GACf,EAAM,UAAU,GACT,CAAC,GAAO,EAAA;GA0U6J,GAAO,EAAA;AAgBnL,SAfc,GAAQ,UAAU,GAAA,EAC1B,QAAQ,KAAK,EAAA,EACnB,EAAM,aAAa,GAAQ,cAAc,EAAA,EACzC,EAAM,OAAO,GACT,KAAU,MAAV,KAAuB,IArc7B,SAA2C,GAAQ,GAAO,GAAA;AACxD,IAAO,WAAW,KAAK,SAAsB,GAAA;GAC3C,IAAM,IAAQ;AACd,OAAA,CAAK,KAAA,CAAU,EAAY,GAAO,EAAA,CAChC;AAEF,KAAU,eAAe,eAAe,EAAA;GACxC,IAAM,IAAiB,GAAc,EAAA;AACrC,MAAoB,GAAQ,EAAM,UAAU,GAAO,GAAgB,EAAA,EACnE,GAA2B,GAAO,EAAA;IAAA;GA6bA,GAAQ,GAAO,EAAA,GAEjD,EAAM,WAAW,KAAK,SAA0B,GAAA;AAC9C,IAAW,eAAe,eAAe,EAAA;EACzC,IAAA,EAAM,cAAE,MAAiB;AACrB,IAAM,aAAa,KACrB,EAAa,iBAAiB,GAAO,EAAA,EAAI,EAAA;GAAA,EAIxC;;AAST,SAAS,GAAY,GAAA;AACnB,KAAA,CAAK,EAAY,EAAA,IAAU,EAAS,EAAA,CAClC,QAAO;CACT,IAAM,IAAQ,EAAM,IAChB,GACA,IAAA,CAAS;AACb,KAAI,GAAO;AACT,MAAA,CAAK,EAAM,UACT,QAAO,EAAM;AACf,IAAM,aAAA,CAAa,GACnB,IAAO,GAAY,GAAO,EAAM,OAAO,OAAO,sBAAA,EAC9C,IAAS,EAAM,OAAO,OAAO,0BAAA;OAE7B,KAAO,GAAY,GAAA,CAAO,EAAA;AAY5B,QAVA,EACE,IACC,GAAK,MAAA;AACJ,KAAI,GAAM,GAAK,GAAY,EAAA,CAAA;IAE7B,EAAA,EAEE,MACF,EAAM,aAAA,CAAa,IAEd;;AAkvBT,IACI,IADQ,IAt8BC,MAAA;CACX,YAAY,GAAA;AACV,OAAK,cAAA,CAAc,GACnB,KAAK,wBAAA,CAAwB,GAC7B,KAAK,sBAAA,CAAsB,GAoB3B,KAAK,WAAW,GAAM,GAAQ,MAAA;AAC5B,OAAI,EAAW,EAAA,IAAA,CAAU,EAAW,EAAA,EAAS;IAC3C,IAAM,IAAc;AACpB,QAAS;IACT,IAAM,IAAO;AACb,WAAO,SAAwB,IAAQ,GAAA,GAAgB,GAAA;AACrD,YAAO,EAAK,QAAQ,IAAQ,MAAU,EAAO,KAAK,MAAM,GAAA,GAAU,EAAA,CAAA;;;GAOtE,IAAI;AACJ,OALK,EAAW,EAAA,IACd,EAAI,EAAA,EACF,MADE,KACqB,KAAM,EAAW,EAAA,IAC1C,EAAI,EAAA,EAEF,EAAY,EAAA,EAAO;IACrB,IAAM,IAAQ,GAAW,KAAA,EACnB,IAAQ,EAAY,GAAO,GAAA,KAAW,EAAA,EACxC,IAAA,CAAW;AACf,QAAA;AACE,SAAS,EAAO,EAAA,EAChB,IAAA,CAAW;cAAA;AAEP,SACF,GAAY,EAAA,GAEZ,GAAW,EAAA;;AAGf,WADA,GAAkB,GAAO,EAAA,EAClB,GAAc,GAAQ,EAAA;;AAAA,OAAA,CACnB,KAAA,CAAS,EAAY,EAAA,EAAO;AAQtC,QAPA,IAAS,EAAO,EAAA,EACZ,MADY,KACI,MAClB,IAAS,IACP,MAAW,OACb,IAAA,KAAc,IACZ,KAAK,eACP,GAAO,GAAA,CAAQ,EAAA,EACb,GAAe;KACjB,IAAM,IAAI,EAAA,EACJ,IAAK,EAAA;AACX,OAAU,GAAA,CAAe,4BAA4B,GAAM,GAAQ;MACjE,UAAU;MACV,iBAAiB;MAAA,CAAA,EAEnB,EAAc,GAAG,EAAA;;AAEnB,WAAO;;AAEP,KAAI,GAAG,EAAA;KAEX,KAAK,sBAAsB,GAAM,MAAA;AAC/B,OAAI,EAAW,EAAA,CACb,SAAQ,GAAA,GAAU,MAAS,KAAK,mBAAmB,IAAQ,MAAU,EAAK,GAAA,GAAU,EAAA,CAAA;GAEtF,IAAI,GAAS;AAKb,UAAO;IAJQ,KAAK,QAAQ,GAAM,IAAS,GAAG,MAAA;AAC5C,SAAU,GACV,IAAiB;MAAA;IAEH;IAAS;IAAA;KAEvB,GAAU,GAAQ,WAAA,IACpB,KAAK,cAAc,EAAO,WAAA,EACxB,GAAU,GAAQ,qBAAA,IACpB,KAAK,wBAAwB,EAAO,qBAAA,EAClC,GAAU,GAAQ,mBAAA,IACpB,KAAK,sBAAsB,EAAO,mBAAA;;CAEtC,YAAY,GAAA;AACL,IAAY,EAAA,IACf,EAAI,EAAA,EACF,EAAQ,EAAA,KACV,IAsFN,SAAiB,GAAA;AAGf,UAFK,EAAQ,EAAA,IACX,EAAI,IAAI,EAAA,EACH,GAAY,EAAA;IAzFA,EAAA;EACjB,IAAM,IAAQ,GAAW,KAAA,EACnB,IAAQ,EAAY,GAAO,GAAA,KAAW,EAAA;AAG5C,SAFA,EAAM,GAAa,YAAA,CAAY,GAC/B,GAAW,EAAA,EACJ;;CAET,YAAY,GAAO,GAAA;EACjB,IAAM,IAAQ,KAAS,EAAM;AACxB,OAAU,EAAM,aACnB,EAAI,EAAA;EACN,IAAA,EAAQ,QAAQ,MAAU;AAE1B,SADA,GAAkB,GAAO,EAAA,EAClB,GAAA,KAAmB,GAAG,EAAA;;CAO/B,cAAc,GAAA;AACZ,OAAK,cAAc;;CAOrB,wBAAwB,GAAA;AACtB,OAAK,wBAAwB;;CAQ/B,sBAAsB,GAAA;AACpB,OAAK,sBAAsB;;CAE7B,2BAAA;AACE,SAAO,KAAK;;CAEd,aAAa,GAAM,GAAA;EACjB,IAAI;AACJ,OAAK,IAAI,EAAQ,SAAS,GAAG,KAAK,GAAG,KAAK;GACxC,IAAM,IAAQ,EAAQ;AACtB,OAAI,EAAM,KAAK,WAAW,KAAK,EAAM,OAAO,WAAW;AACrD,QAAO,EAAM;AACb;;;AAGA,MAAA,OACF,IAAU,EAAQ,MAAM,IAAI,EAAA;EAE9B,IAAM,IAAmB,EAAU,GAAA,CAAe;AAClD,SAAI,EAAQ,EAAA,GACH,EAAiB,GAAM,EAAA,GAEzB,KAAK,QACV,IACC,MAAU,EAAiB,GAAO,EAAA,CAAA;;GAAA,CA0yBrB,SC3jDP,IAAb,MAAa,UAAgC,MAAA;CAU5C,YAAY,GAAiB,GAAW,GAAA;AACvC,QAAM,EAAA,EACN,KAAK,OAAO,cACZ,KAAK,QAAQ,GACb,KAAK,UAAU,GACf,KAAK,4BAAY,IAAI,MAAA,EAGjB,MAAM,qBACT,MAAM,kBAAkB,MAAM,EAAA;;CAOhC,SAAA;AACC,SAAO;GACN,MAAM,KAAK;GACX,SAAS,KAAK;GACd,OAAO,KAAK;GACZ,SAAS,KAAK;GACd,WAAW,KAAK,UAAU,aAAA;GAC1B,OAAO,KAAK;GAAA;;;AC3Cf,SAAS,GAAe,GAAc,GAAA;AACrC,QAAI,aAAiB,MACb;EACN,GAAQ;EACR,SAAS,MAAM,KAAK,EAAM,SAAA,CAAA;EAAA,GAGxB,aAAiB,MACb;EACN,GAAQ;EACR,QAAQ,MAAM,KAAK,EAAM,QAAA,CAAA;EAAA,GAGpB;;AASR,SAAS,GAAc,GAAc,GAAA;AACpC,KAAI,KAA0B,OAAV,KAAU,YAAY,OAAY,GAAO;EAC5D,IAAM,IAAQ;AAGd,MAAI,EAAM,MAAW,MACpB,QAAK,MAAM,QAAQ,EAAM,QAAA,IAKT,EAAM,QAAQ,OAAM,MAAK,MAAM,QAAQ,EAAA,IAAM,EAAE,WAAW,EAAX,GAKxD,IAAI,IAAI,EAAM,QAAA,GARb;AAYT,MAAI,EAAM,MAAW,MACpB,QAAK,MAAM,QAAQ,EAAM,OAAA,GAIlB,IAAI,IAAI,EAAM,OAAA,GAFb;;AAQV,QAAO;;AAMR,IAAa,KAAb,MAAA;CAAA,cAAA;AAAA,OAAA,OAC0B;;CAEzB,MAAA,OAAM;AACL,SAAO,KAAK;;CAGb,MAAA,KAAW,GAAA;AACV,OAAK,OAAO;;CAGb,MAAA,QAAM;AACL,OAAK,OAAO;;GAOD,KAAb,MAAA;CACC,YAAY,GAAA;AAAQ,OAAA,MAAA;;CAEpB,MAAA,OAAM;AACL,MAAA;GACC,IAAM,IAAO,aAAa,QAAQ,KAAK,IAAA;AACvC,UAAO,IAAO,KAAK,MAAM,GAAM,GAAA,GAAiB;UACxC;AAER,UAAO;;;CAIT,MAAA,KAAW,GAAA;AACV,MAAA;AACC,gBAAa,QAAQ,KAAK,KAAK,KAAK,UAAU,GAAO,GAAA,CAAA;WAC7C,GAAA;AAER,SAAM,IAAI,EAAoB,mCAAmC,KAAK,IAAA,IAAQ,EAAA;;;CAIhF,MAAA,QAAM;AACL,eAAa,WAAW,KAAK,IAAA;;GAOlB,KAAb,MAAA;CACC,YAAY,GAAA;AAAQ,OAAA,MAAA;;CAEpB,MAAA,OAAM;AACL,MAAA;GACC,IAAM,IAAO,eAAe,QAAQ,KAAK,IAAA;AACzC,UAAO,IAAO,KAAK,MAAM,GAAM,GAAA,GAAiB;UACxC;AAER,UAAO;;;CAIT,MAAA,KAAW,GAAA;AACV,MAAA;AACC,kBAAe,QAAQ,KAAK,KAAK,KAAK,UAAU,GAAO,GAAA,CAAA;WAC/C,GAAA;AAER,SAAM,IAAI,EAAoB,qCAAqC,KAAK,IAAA,IAAQ,EAAA;;;CAIlF,MAAA,QAAM;AACL,iBAAe,WAAW,KAAK,IAAA;;GAOpB,KAAb,MAAa,EAAA;CAAA;AAAA,OAAA,UACa;;CAAA;AAAA,OAAA,aACG;;CAAA;AAAA,OAAA,aACA;;CAE5B,YAAY,GAAA;AAAQ,OAAA,MAAA;;CAEpB,SAAA;AACC,SAAO,IAAI,SAAsB,GAAS,MAAA;GACzC,IAAM,IAAU,UAAU,KAAK,EAAwB,SAAS,EAAwB,WAAA;AAExF,KAAQ,wBAAA;IACP,IAAM,IAAK,EAAQ;AACd,MAAG,iBAAiB,SAAS,EAAwB,WAAA,IACzD,EAAG,kBAAkB,EAAwB,WAAA;MAI/C,EAAQ,kBAAkB,EAAQ,EAAQ,OAAA,EAC1C,EAAQ,gBAAgB,EAAO,EAAQ,MAAA;IAAA;;CAIzC,MAAA,OAAM;AACL,MAAA;GACC,IAAM,IAAA,MAAW,KAAK,QAAA;AACtB,UAAO,IAAI,SAAmB,GAAS,MAAA;IAGtC,IAAM,IAFc,EAAG,YAAY,EAAwB,YAAY,WAAA,CAC7C,YAAY,EAAwB,WAAA,CACxC,IAAI,KAAK,IAAA;AAE/B,MAAQ,kBAAA;AACP,OAAG,OAAA,EACH,EAAQ,EAAQ,UAAU,KAAA;OAG3B,EAAQ,gBAAA;AACP,OAAG,OAAA,EACH,EAAO,EAAQ,MAAA;;KAAA;UAGT;AAER,UAAO;;;CAIT,MAAA,KAAW,GAAA;AACV,MAAA;GACC,IAAM,IAAA,MAAW,KAAK,QAAA;AACtB,UAAO,IAAI,SAAe,GAAS,MAAA;IAGlC,IAAM,IAFc,EAAG,YAAY,EAAwB,YAAY,YAAA,CAC7C,YAAY,EAAwB,WAAA,CACxC,IAAI,GAAO,KAAK,IAAA;AAEtC,MAAQ,kBAAA;AACP,OAAG,OAAA,EACH,GAAA;OAGD,EAAQ,gBAAA;AACP,OAAG,OAAA,EACH,EAAO,EAAQ,MAAA;;KAAA;WAGT,GAAA;AAER,SAAM,IAAI,EAAoB,gCAAgC,KAAK,IAAA,IAAQ,EAAA;;;CAI7E,MAAA,QAAM;AACL,MAAA;GACC,IAAM,IAAA,MAAW,KAAK,QAAA;AACtB,UAAO,IAAI,SAAe,GAAS,MAAA;IAGlC,IAAM,IAFc,EAAG,YAAY,EAAwB,YAAY,YAAA,CAC7C,YAAY,EAAwB,WAAA,CACxC,OAAO,KAAK,IAAA;AAElC,MAAQ,kBAAA;AACP,OAAG,OAAA,EACH,GAAA;OAGD,EAAQ,gBAAA;AACP,OAAG,OAAA,EACH,EAAO,EAAQ,MAAA;;KAAA;WAGT,GAAA;AAER,SAAM,IAAI,EAAoB,mCAAmC,KAAK,IAAA,IAAQ,EAAA;;;;AAQjF,SAAgB,GAAwB,GAAmB,GAAA;AAC1D,SAAQ,GAAR;EACC,KAAK,QACJ,QAAO,IAAI,GAAuB,EAAA;EACnC,KAAK,UACJ,QAAO,IAAI,GAAyB,EAAA;EACrC,KAAK,YACJ,QAAO,IAAI,GAA2B,EAAA;EAEvC,QACC,QAAO,IAAI,IAAA;;;CFk5Bd,WAAA;CACE,MAAM,UAAiB,IAAA;EACrB,YAAY,GAAQ,GAAA;AAClB,UAAA,EACA,KAAK,KAAe;IAClB,OAAO;IACP,SAAS;IACT,QAAQ,IAAS,EAAO,SAAS,GAAA;IACjC,WAAA,CAAW;IACX,YAAA,CAAY;IACZ,OAAA,KAAY;IACZ,WAAA,KAAgB;IAChB,OAAO;IACP,QAAQ;IACR,WAAA,CAAW;IACX,UAAA,CAAU;IACV,YAAY,EAAA;IAAA;;EAGhB,IAAA,OAAI;AACF,UAAO,EAAO,KAAK,GAAA,CAAc;;EAEnC,IAAI,GAAA;AACF,UAAO,EAAO,KAAK,GAAA,CAAc,IAAI,EAAA;;EAEvC,IAAI,GAAK,GAAA;GACP,IAAM,IAAQ,KAAK;AAUnB,UATA,EAAgB,EAAA,EACX,EAAO,EAAA,CAAO,IAAI,EAAA,IAAQ,EAAO,EAAA,CAAO,IAAI,EAAA,KAAS,MACxD,EAAe,EAAA,EACf,EAAY,EAAA,EACZ,EAAM,UAAU,IAAI,GAAA,CAAK,EAAA,EACzB,EAAM,MAAM,IAAI,GAAK,EAAA,EACrB,EAAM,UAAU,IAAI,GAAA,CAAK,EAAA,EACzB,GAAqB,GAAO,GAAK,EAAA,GAE5B;;EAET,OAAO,GAAA;AACL,OAAA,CAAK,KAAK,IAAI,EAAA,CACZ,QAAA,CAAO;GAET,IAAM,IAAQ,KAAK;AAUnB,UATA,EAAgB,EAAA,EAChB,EAAe,EAAA,EACf,EAAY,EAAA,EACR,EAAM,MAAM,IAAI,EAAA,GAClB,EAAM,UAAU,IAAI,GAAA,CAAK,EAAA,GAEzB,EAAM,UAAU,OAAO,EAAA,EAEzB,EAAM,MAAM,OAAO,EAAA,EAAA,CACZ;;EAET,QAAA;GACE,IAAM,IAAQ,KAAK;AACnB,KAAgB,EAAA,EACZ,EAAO,EAAA,CAAO,SAChB,EAAe,EAAA,EACf,EAAY,EAAA,EACZ,EAAM,4BAA4B,IAAI,KAAA,EACtC,EAAK,EAAM,QAAQ,MAAA;AACjB,MAAM,UAAU,IAAI,GAAA,CAAK,EAAA;KAAA,EAE3B,EAAM,MAAM,OAAA;;EAGhB,QAAQ,GAAI,GAAA;GACV,IAAM,IAAQ,KAAK;AACnB,KAAO,EAAA,CAAO,SAAS,GAAQ,GAAK,MAAA;AAClC,MAAG,KAAK,GAAS,KAAK,IAAI,EAAA,EAAM,GAAK,KAAA;KAAA;;EAGzC,IAAI,GAAA;GACF,IAAM,IAAQ,KAAK;AACnB,KAAgB,EAAA;GAChB,IAAM,IAAQ,EAAO,EAAA,CAAO,IAAI,EAAA;AAIhC,OAHI,EAAM,cAAA,CAAe,EAAY,EAAA,IAGjC,MAAU,EAAM,MAAM,IAAI,EAAA,CAC5B,QAAO;GAET,IAAM,IAAQ,EAAY,EAAM,QAAQ,GAAO,GAAO,EAAA;AAGtD,UAFA,EAAe,EAAA,EACf,EAAM,MAAM,IAAI,GAAK,EAAA,EACd;;EAET,OAAA;AACE,UAAO,EAAO,KAAK,GAAA,CAAc,MAAA;;EAEnC,SAAA;GACE,IAAM,IAAW,KAAK,MAAA;AACtB,UAAO;KACJ,OAAO,iBAAiB,KAAK,QAAA;IAC9B,YAAA;KACE,IAAM,IAAI,EAAS,MAAA;AACnB,YAAI,EAAE,OACG,IAEF;MACL,MAAA,CAAM;MACN,OAHY,KAAK,IAAI,EAAE,MAAA;MAAA;;IAAA;;EAQ/B,UAAA;GACE,IAAM,IAAW,KAAK,MAAA;AACtB,UAAO;KACJ,OAAO,iBAAiB,KAAK,SAAA;IAC9B,YAAA;KACE,IAAM,IAAI,EAAS,MAAA;AACnB,SAAI,EAAE,KACJ,QAAO;KACT,IAAM,IAAQ,KAAK,IAAI,EAAE,MAAA;AACzB,YAAO;MACL,MAAA,CAAM;MACN,OAAO,CAAC,EAAE,OAAO,EAAA;MAAA;;IAAA;;EAKzB,CAAe,OAAO,YAAA;AACpB,UAAO,KAAK,SAAA;;;CAOhB,SAAS,EAAe,GAAA;AACjB,EAEH,EAAM,WADN,EAAM,4BAA4B,IAAI,KAAA,EACxB,IAAI,IAAI,EAAM,MAAA;;CAGhC,MAAM,UAAiB,IAAA;EACrB,YAAY,GAAQ,GAAA;AAClB,UAAA,EACA,KAAK,KAAe;IAClB,OAAO;IACP,SAAS;IACT,QAAQ,IAAS,EAAO,SAAS,GAAA;IACjC,WAAA,CAAW;IACX,YAAA,CAAY;IACZ,OAAA,KAAY;IACZ,OAAO;IACP,QAAQ;IACR,yBAAyB,IAAI,KAAA;IAC7B,UAAA,CAAU;IACV,WAAA,CAAW;IACX,WAAA,KAAgB;IAChB,YAAY,EAAA;IAAA;;EAGhB,IAAA,OAAI;AACF,UAAO,EAAO,KAAK,GAAA,CAAc;;EAEnC,IAAI,GAAA;GACF,IAAM,IAAQ,KAAK;AAEnB,UADA,EAAgB,EAAA,EACX,EAAM,QAAA,CAAA,CAGP,EAAM,MAAM,IAAI,EAAA,IAAA,EAAA,CAEhB,EAAM,QAAQ,IAAI,EAAA,IAAA,CAAU,EAAM,MAAM,IAAI,EAAM,QAAQ,IAAI,EAAA,CAAA,IAJzD,EAAM,MAAM,IAAI,EAAA;;EAQ3B,IAAI,GAAA;GACF,IAAM,IAAQ,KAAK;AAQnB,UAPA,EAAgB,EAAA,EACX,KAAK,IAAI,EAAA,KACZ,EAAe,EAAA,EACf,EAAY,EAAA,EACZ,EAAM,MAAM,IAAI,EAAA,EAChB,GAAqB,GAAO,GAAO,EAAA,GAE9B;;EAET,OAAO,GAAA;AACL,OAAA,CAAK,KAAK,IAAI,EAAA,CACZ,QAAA,CAAO;GAET,IAAM,IAAQ,KAAK;AAInB,UAHA,EAAgB,EAAA,EAChB,EAAe,EAAA,EACf,EAAY,EAAA,EACL,EAAM,MAAM,OAAO,EAAA,IAAA,CAAA,CAAW,EAAM,QAAQ,IAAI,EAAA,IAAS,EAAM,MAAM,OAAO,EAAM,QAAQ,IAAI,EAAA,CAAA;;EAKvG,QAAA;GACE,IAAM,IAAQ,KAAK;AACnB,KAAgB,EAAA,EACZ,EAAO,EAAA,CAAO,SAChB,EAAe,EAAA,EACf,EAAY,EAAA,EACZ,EAAM,MAAM,OAAA;;EAGhB,SAAA;GACE,IAAM,IAAQ,KAAK;AAGnB,UAFA,EAAgB,EAAA,EAChB,EAAe,EAAA,EACR,EAAM,MAAM,QAAA;;EAErB,UAAA;GACE,IAAM,IAAQ,KAAK;AAGnB,UAFA,EAAgB,EAAA,EAChB,EAAe,EAAA,EACR,EAAM,MAAM,SAAA;;EAErB,OAAA;AACE,UAAO,KAAK,QAAA;;EAEd,CAAe,OAAO,YAAA;AACpB,UAAO,KAAK,QAAA;;EAEd,QAAQ,GAAI,GAAA;GACV,IAAM,IAAW,KAAK,QAAA,EAClB,IAAS,EAAS,MAAA;AACtB,UAAA,CAAQ,EAAO,MACb,GAAG,KAAK,GAAS,EAAO,OAAO,EAAO,OAAO,KAAA,EAC7C,IAAS,EAAS,MAAA;;;CAQxB,SAAS,EAAe,GAAA;AACjB,IAAM,UACT,EAAM,wBAAwB,IAAI,KAAA,EAClC,EAAM,MAAM,SAAS,MAAA;AACnB,OAAI,EAAY,EAAA,EAAQ;IACtB,IAAM,IAAQ,EAAY,EAAM,QAAQ,GAAO,GAAO,EAAA;AACtD,MAAM,QAAQ,IAAI,GAAO,EAAA,EACzB,EAAM,MAAM,IAAI,EAAA;SAEhB,GAAM,MAAM,IAAI,EAAA;IAAA;;CAKxB,SAAS,EAAgB,GAAA;AACnB,IAAM,YACR,EAAI,GAAG,KAAK,UAAU,EAAO,EAAA,CAAA,CAAA;;CAjrCnC,IAAoB;AACb,IADa,IA4rCP,OA1rCT,GAAQ,KAAa;EA0rCI,WAvI3B,SAAmB,GAAQ,GAAA;GACzB,IAAM,IAAM,IAAI,EAAS,GAAQ,EAAA;AACjC,UAAO,CAAC,GAAK,EAAI,GAAA;;EAqImB,WA/BtC,SAAmB,GAAQ,GAAA;GACzB,IAAM,IAAO,IAAI,EAAS,GAAQ,EAAA;AAClC,UAAO,CAAC,GAAM,EAAK,GAAA;;EA6B4B,gBATjD,SAAwB,GAAA;AACtB,OAAI,EAAO,UAAU,KAAe,EAAO,OAAO;IAChD,IAAM,IAAO,IAAI,IAAI,EAAO,MAAA;AAC5B,MAAO,MAAM,OAAA,EACb,EAAK,SAAS,MAAA;AACZ,OAAO,MAAM,IAAI,GAAS,EAAA,CAAA;MAAA;;;EAtrCT;IGhOzB;AAMA,IAAsB,IAAtB,MAAA;CAqBC,IAAA,QAAW;AACV,SAAO,KAAK;;CAMb,IAAA,MAAiB,GAAA;AAChB,OAAK,SAAS,GACd,KAAK,YAAY,KAAK,EAAE,MAAA;;CAMzB,IAAA,QAAW;AACV,SAAO,KAAK,EAAE,UAAA;;CASf,YACC,GACA,GACA,GAAA;EAIA,IAAI;AANM,OAAA,cAAA,GACA,KAAA,MAAA,GAAA,KA9CV,KAAA,CAAa,GAAA,KAAA,SAAA,CAGc,GAAA,KAAA,YACN,IAAI,GAAA,EAAA,KAAA,SAIV,IAAI,EAAmC,KAAA,EA+CrD,IAFG,aAAwB,MAER,IAAI,IAAI,EAAA,GACjB,MAAM,QAAQ,EAAA,GAEL,CAAA,GAAI,EAAA,GACb,KAAwC,OAAjB,KAAiB,WAE/B,EAAA,GAAK,GAAA,GAGL;AAIpB,MAAA;AACC,QAAK,eAAe,KAAK,iBAAiB,EAAA,GACvC,EAAQ,IAAkB,MAAS,EAAA,GACnC;UACK;AAER,QAAK,eAAe;;AAIrB,OAAK,IAAI,IAAI,EAAmB,KAAK,aAAA,EACrC,KAAK,UAAU,GAAwB,GAAa,EAAA,EAGhD,MAAgB,WACnB,KAAK,SAAA,CAAS,IAGd,KAAK,uBAAA;;CAOP,iBAA2B,GAAA;AAC1B,SAEkB,OAAV,KAAU,cADjB,MAEC,MAAM,QAAQ,EAAA,IACd,aAAiB,OACjB,aAAiB,OACjB,OAAO,eAAe,EAAA,KAAW,OAAO,aAAA,CACnB,MAArB,EAAM;;CAOT,UAAA;AACC,OAAK,UAAU,MAAA,EACf,KAAK,UAAU,UAAA,EACf,KAAK,EAAE,UAAA,EACP,KAAK,OAAO,UAAA;;CAMb,QAAe,GAAA;AACd,MAAA;GAEC,IAAM,IAAY,KAAK,iBAAiB,EAAA,GAAY,EAAQ,IAAU,MAAS,EAAA,GAAS;AAExF,QAAK,YAAY,EAAA;WACT,GAAA;GACR,IAAM,IAAa,IAAI,EAAoB,4BAA4B,KAAK,OAAO,EAAA;AACnF,QAAK,OAAO,KAAK,EAAA,EAIjB,KAAK,YAAY,EAAA;;;CAYnB,YAAsB,GAAA;AACrB,MAAA;GAEC,IAAI;AAGH,OADG,KAAK,iBAAiB,EAAA,GACb,EAAQ,IAAU,MAAS,EAAA,GAE3B,GAGb,KAAK,EAAE,KAAK,EAAA,EAGR,KAAK,gBAAgB,YACxB,KAAK,iBAAiB,EAAA,CAAW,OAAM,MAAA;IACtC,IAAM,IAAQ,IAAI,EAAoB,mBAAmB,KAAK,YAAA,eAA2B,KAAK,OAAO,EAAA;AACrG,SAAK,OAAO,KAAK,EAAA;KAAA;WAIX,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,2BAA2B,KAAK,OAAO,EAAA;AAC7E,QAAK,OAAO,KAAK,EAAA,EAIjB,KAAK,EAAE,KAAK,EAAA;;;CAOd,MAAA,wBAAgB;AACf,MAAA;GACC,IAAM,IAAA,MAAoB,KAAK,QAAQ,MAAA;AACvC,OAAI,GAAa;IAEhB,IAAM,IAAiB,KAAK,mBAAmB,EAAA;AAE/C,QAAA;KAEC,IAAM,IAAiB,KAAK,iBAAiB,EAAA,GAC1C,EAAQ,IAAgB,MAAS,EAAA,GACjC;AAEH,UAAK,YAAY,EAAA;YACT;AAER,UAAK,YAAY,EAAA;;;AAGnB,QAAK,SAAA,CAAS;WACN,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,sBAAsB,KAAK,YAAA,eAA2B,KAAK,OAAO,EAAA;AACxG,QAAK,OAAO,KAAK,EAAA,EAEjB,KAAK,SAAA,CAAS;;;CAOhB,mBAA6B,GAAA;AAC5B,SAAO;;CAMR,MAAA,iBAAiC,GAAA;AAChC,SAAO,KAAK,QAAQ,KAAK,EAAA;;GC7Nd,KAAb,MAAa,UAAoC,EAAA;CAAA;AAAA,OAAA,OAC3B;;CAAA;AAAA,OAAA,4BAG4C,IAAI,KAAA;;CAKrE,OAAA,YAAmC,GAAsB,GAAa,IAAoB,EAAA,EAAA;EACzF,IAAM,IAAc,GAAG,EAAA,GAAW;AAIlC,SAHK,KAAK,UAAU,IAAI,EAAA,IACvB,KAAK,UAAU,IAAI,GAAa,IAAI,EAAsB,GAAS,GAAK,EAAA,CAAA,EAElE,KAAK,UAAU,IAAI,EAAA;;CAM3B,YAAY,GAA0B,GAAa,IAAoB,EAAA,EAAA;AACtE,QAAM,GAAa,GAAK,EAAA,EAGpB,MAAgB,YACnB,KAAK,kBAAA;;CAOP,mBAAA;AACC,OAAK,EAAE,KAAK,EAAa,KAAA,KAAK,GAAW;GAAE,SAAA,CAAS;GAAM,UAAA,CAAU;GAAA,CAAA,CAAA,CAAS,WAAU,MAAA;AACtF,QAAK,QAAQ,KAAK,EAAA,CAAc,OAAM,MAAA;IACrC,IAAM,IAAQ,IAAI,EAAoB,mBAAmB,KAAK,YAAA,eAA2B,KAAK,OAAO,EAAA;AACrG,SAAK,OAAO,KAAK,EAAA;KAAA;IAAA;;CASpB,KAAA,GAAe,GAAA;AACd,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,MAAM,KAAA,GAAQ,EAAM,KAAI,MAAkB,EAAA,CAAA;KAAA;AAG3C,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,0BAA0B,KAAK,OAAO,EAAA;AAC5E,QAAK,OAAO,KAAK,EAAA;;;CAQnB,MAAA;AACC,MAAA;GAEC,IAAM,IAAe,KAAK,MAAM,SAAS,IAAI,KAAK,MAAM,KAAK,MAAM,SAAS,KAAA,KAAK,GAG3E,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,MAAM,KAAA;KAAA;AAKP,UAFA,KAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA,EACV;WACC,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,2BAA2B,KAAK,OAAO,EAAA;AAG7E,GAFA,KAAK,OAAO,KAAK,EAAA;AAEjB;;;CAMF,QAAA,GAAkB,GAAA;AACjB,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,MAAM,QAAA,GAAW,EAAM,KAAI,MAAkB,EAAA,CAAA;KAAA;AAG9C,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,6BAA6B,KAAK,OAAO,EAAA;AAC/E,QAAK,OAAO,KAAK,EAAA;;;CAQnB,QAAA;AACC,MAAA;GAEC,IAAM,IAAe,KAAK,MAAM,SAAS,IAAI,KAAK,MAAM,KAAA,KAAK,GAGvD,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,MAAM,OAAA;KAAA;AAKP,UAFA,KAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA,EACV;WACC,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,4BAA4B,KAAK,OAAO,EAAA;AAG9E,GAFA,KAAK,OAAO,KAAK,EAAA;AAEjB;;;CAOF,IAAW,GAAe,GAAA;AACzB,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,QAAA,EAAI,KAAS,KAAK,IAAQ,EAAM,QAG/B,OAAU,MAAM,SAAS,EAAA,0BAAgC,EAAM,OAAA,GAAA;AAF/D,MAAM,KAAmB;KAAA;AAM3B,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,+BAA+B,EAAA,MAAY,KAAK,OAAO,EAAA;AAC7F,QAAK,OAAO,KAAK,EAAA;;;CAQnB,IAAW,GAAA;AACV,SAAO,KAAK,MAAM;;CAMnB,OAAc,GAAe,GAAA,GAAyB,GAAA;AACrD,MAAA;GAKC,IAAM,IAAU,CAAA,GAHU,KAAK,MAAA,CAGD,OAAO,GAAO,KAAe,GAAA,GAAM,EAAA,EAG3D,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,MAAM,OAAO,GAAO,KAAe,GAAA,GAAM,EAAM,KAAI,MAAkB,EAAA,CAAA;KAAA;AAKtE,UAFA,KAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA,EACV;WACC,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,2BAA2B,KAAK,OAAO,EAAA;AAG7E,UAFA,KAAK,OAAO,KAAK,EAAA,EAEV,EAAA;;;CAOT,OAAc,GAAS,GAAA;AACtB,MAAA;GACC,IAAM,IAAS,OAAe,GAAG,MAAM,MAAM,IAGvC,IAAQ,KAAK,MAAM,WAAU,MAAe,EAAO,GAAa,EAAA,CAAA;AAGtE,OAAI,MAAJ,IAAkB;IACjB,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,OAAM,OAAO,GAAO,EAAA;MAAA;AAKrB,WAFA,KAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA,EAAA,CACV;;AAKR,UADA,KAAK,OAAO,KAAK,KAAA,EAAA,CACV;WACC,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,0BAA0B,KAAK,OAAO,EAAA;AAG5E,UAFA,KAAK,OAAO,KAAK,EAAA,EAAA,CAEV;;;CAOT,QAAe,GAAA;AACd,MAAA;GAEC,IAAM,IAAY,EAAQ,IAAU,MAAS,EAAA;AAC7C,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,4BAA4B,KAAK,OAAO,EAAA;AAC9E,QAAK,OAAO,KAAK,EAAA;;;CAQnB,OAAc,GAAA;AACb,MAAA;GAEC,IAAM,IAAgB,KAAK,MAAM,OAAO,EAAA,EAGlC,IAAY,EAAQ,KAAK,QAAO,MAAA;AAErC,MAAM,SAAS,GACf,EAAM,KAAA,GAAQ,EAAc,KAAI,MAAkB,EAAA,CAAA;KAAA;AAGnD,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,4BAA4B,KAAK,OAAO,EAAA;AAC9E,QAAK,OAAO,KAAK,EAAA;;;CAQnB,IAAc,GAAA;AACb,SAAO,KAAK,MAAM,IAAI,EAAA;;CAMvB,KAAY,GAAA;AACX,MAAA;GAEC,IAAM,IAAc,CAAA,GAAI,KAAK,MAAA,CAAO,KAAK,EAAA,EAGnC,IAAY,EAAQ,KAAK,QAAO,MAAA;AAErC,MAAM,SAAS,GACf,EAAM,KAAA,GAAQ,EAAY,KAAI,MAAkB,EAAA,CAAA;KAAA;AAGjD,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,0BAA0B,KAAK,OAAO,EAAA;AAC5E,QAAK,OAAO,KAAK,EAAA;;;CAQnB,OAAc,GAAe,GAAA;AAC5B,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,QAAA,EAAI,KAAS,KAAK,IAAQ,EAAM,QAG/B,OAAU,MAAM,SAAS,EAAA,0BAAgC,EAAM,OAAA,GAAA;AAF/D,MAAQ,EAAM,GAAA;KAAA;AAMhB,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,gCAAgC,EAAA,MAAY,KAAK,OAAO,EAAA;AAC9F,QAAK,OAAO,KAAK,EAAA;;;CAQnB,QAAA;AACC,OAAK,YAAY,EAAA,CAAA;;CAMlB,gBAAA;AACuB,EAAA,OAAX,SAAW,QAEnB,OAAe,aAAc,OAAe,cAAc,EAAA,EAC1D,OAAe,WAAW,KAAK,OAAO;GACvC,gBAAgB,KAAK;GACrB,MAAM,KAAK,KAAK,KAAK,KAAA;GACrB,KAAK,KAAK,IAAI,KAAK,KAAA;GACnB,SAAS,KAAK,QAAQ,KAAK,KAAA;GAC3B,OAAO,KAAK,MAAM,KAAK,KAAA;GACvB,KAAK,KAAK,IAAI,KAAK,KAAA;GACnB,KAAK,KAAK,IAAI,KAAK,KAAA;GACnB,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,SAAS,KAAK,QAAQ,KAAK,KAAA;GAC3B,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,KAAK,KAAK,IAAI,KAAK,KAAA;GACnB,MAAM,KAAK,KAAK,KAAK,KAAA;GACrB,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,OAAO,KAAK,MAAM,KAAK,KAAA;GACvB,YAAY,MAAA;IACX,IAAM,IAAe,KAAK,EAAE,UAAU,EAAA;AACtC,iBAAa,EAAa,aAAA;;GAAA;;GCtVV,KAArB,MAAqB,UAAyC,EAAA;CAAA;AAAA,OAAA,OACxC;;CAAA;AAAA,OAAA,4BAGiD,IAAI,KAAA;;CAK1E,OAAA,YACC,GACA,GACA,GAAA;EAEA,IAAM,IAAc,GAAG,EAAA,GAAW;AAIlC,SAHK,KAAK,UAAU,IAAI,EAAA,IACvB,KAAK,UAAU,IAAI,GAAa,IAAI,EAA2B,GAAS,GAAK,EAAA,CAAA,EAEvE,KAAK,UAAU,IAAI,EAAA;;CAoB3B,IAAkB,GAAwD,GAAA;AACzE,MAAA;GACC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AAErC,QAAyB,OAAd,KAAc,UAAU;AAElC,SAAI,MAAJ,KAAc,EACb,OAAU,MAAM,8CAAA;AAEjB,OAAM,IAAI,GAAqB,EAAA;eACrB,aAAqB,IAE/B,OAAM,KAAK,EAAU,SAAA,CAAA,CAAW,SAAA,CAAU,GAAK,OAAA;AAC9C,OAAM,IAAI,GAAe,EAAA;MAAA;SAAA;AAAA,SAEK,OAAd,KAAc,aAAY,EAM3C,OAAU,MAAM,gEAAA;AAJhB,YAAO,QAAQ,EAAA,CAAW,SAAA,CAAU,GAAK,OAAA;AACxC,QAAM,IAAI,GAAe,EAAA;OAGsD;;KAAA;AAKlF,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,2BAA2B,KAAK,OAAO,EAAA;AAC7E,QAAK,OAAO,KAAK,EAAA;;;CAcnB,MAAoB,GAAA;AACnB,OAAK,IAAI,EAAA;;CAMV,OAAc,GAAA;AACb,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,MAAM,OAAO,EAAA;KAAA;AAGd,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,sBAAsB,EAAA,QAAY,KAAK,OAAO,EAAA;AACpF,QAAK,OAAO,KAAK,EAAA;;;CAQnB,QAAA;AAEC,OAAK,4BAAY,IAAI,KAAA,CAAA;;CAOtB,YAAmB,GAAA;AAClB,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,WAAO,QAAQ,EAAA,CAAS,SAAA,CAAU,GAAK,OAAA;AACtC,OAAM,IAAI,GAAe,EAAA;MAAA;KAAA;AAI3B,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,2BAA2B,KAAK,OAAO,EAAA;AAC7E,QAAK,OAAO,KAAK,EAAA;;;CAUnB,OAAc,GAAa,GAAA;AAC1B,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;IACrC,IAAM,IAAe,EAAM,IAAI,EAAA;AAAA,IAC3B,MAD2B,KACV,KACpB,EAAQ,EAAA;KAAA;AAKV,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,uBAAuB,EAAA,MAAU,KAAK,OAAO,EAAA;AACnF,QAAK,OAAO,KAAK,EAAA;;;CAQnB,YAAY,GAA0B,GAAa,GAAA;AAClD,QAAM,GAAa,GAAK,EAAA,EAGpB,MAAgB,YACnB,KAAK,kBAAA;;CAOP,mBAAA;AACC,OAAK,EAAE,KAAK,EAAa,KAAA,KAAK,GAAW;GAAE,SAAA,CAAS;GAAM,UAAA,CAAU;GAAA,CAAA,CAAA,CAAS,WAAU,MAAA;AACtF,QAAK,QAAQ,KAAK,EAAA,CAAc,OAAM,MAAA;IACrC,IAAM,IAAQ,IAAI,EAAoB,mBAAmB,KAAK,YAAA,eAA2B,KAAK,OAAO,EAAA;AACrG,SAAK,OAAO,KAAK,EAAA;KAAA;IAAA;;CASpB,gBAAA;AACuB,EAAA,OAAX,SAAW,QAEnB,OAAe,aAAc,OAAe,cAAc,EAAA,EAC1D,OAAe,WAAW,KAAK,OAAO;GACvC,gBAAgB,KAAK;GACrB,KAAK,KAAK,IAAI,KAAK,KAAA;GACnB,OAAO,KAAK,MAAM,KAAK,KAAA;GACvB,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,OAAO,KAAK,MAAM,KAAK,KAAA;GACvB,aAAa,KAAK,YAAY,KAAK,KAAA;GACnC,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,YAAY,MAAA;IACX,IAAM,IAAe,KAAK,EAAE,UAAU,EAAA;AACtC,iBAAa,EAAa,aAAA;;GAAA;;GC1MlB,KAAb,MAAa,UAA2D,EAAA;CAAA,YAAA,GAAA,GAAA;AAAA,QAAA,GAAA,EAAA,EAAA,KAEtE,KAAA,CAAa;;CAAA;AAAA,OAAA,OAEO;;CAAA;AAAA,OAAA,4BAG6C,IAAI,KAAA;;CAKtE,OAAA,YACC,GACA,GACA,GAAA;EAEA,IAAM,IAAc,GAAG,EAAA,GAAW;AAIlC,SAHK,KAAK,UAAU,IAAI,EAAA,IACvB,KAAK,UAAU,IAAI,GAAa,IAAI,EAAuB,GAAS,GAAK,EAAA,CAAA,EAEnE,KAAK,UAAU,IAAI,EAAA;;CAM3B,IAAW,GAAmB,IAAA,CAAiB,GAAA;AAC9C,MAAA;AACC,OAAA,CAAK,KAAK,iBAAiB,KAAK,MAAA,EAAQ;IAEvC,IAAM,IAAY,IAAQ;KAAA,GAAK,KAAK;KAAA,GAAU;KAAA,GAAW;AAEzD,SAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;AACjB;;GAID,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,QAAI,GAAO;AAEV,SAAI,KAAA,KACH;AAKD,SAAA;AACC,aAAO,OAAO,GAAiB,EAAA;aACvB;AAGR,aAAO,KAAK,EAAA,CAAO,SAAQ,MAAA;AACxB,SAAc,KAAQ,EAAc;QAAA;;UAMxC,KAAA;AACC,YAAiB;YACT;AAER,YAAO;;KAAA;AAKV,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,yBAAyB,KAAK,OAAO,GAAK;IAAE,OAAA;IAAO,OAAA;IAAA,CAAA;AACzF,QAAK,OAAO,KAAK,EAAA;AAIjB,OAAA;IACC,IAAM,IAAgB,IAAQ;KAAA,GAAK,KAAK;KAAA,GAAU;KAAA,GAAW;AAC7D,SAAK,YAAY,EAAA;WACT;;;CASX,QAAA;AACC,MAAA;AAEC,OAAI,KAAK,iBAAiB,KAAK,aAAA,EAAe;IAC7C,IAAM,IAAoB,EAAQ,KAAK,eAAc,MAAS,EAAA;AAC9D,SAAK,IAAI,GAAA,CAAmB,EAAA;SAG5B,MAAK,IAAI,KAAK,cAAA,CAAqB,EAAA;WAE5B,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,yBAAyB,KAAK,OAAO,EAAA;AAC3E,QAAK,OAAO,KAAK,EAAA,EAIjB,KAAK,YAAY,KAAK,aAAA;;;CAOxB,OAAiC,GAAA;AAChC,MAAA;AACC,OAAA,CAAK,KAAK,iBAAiB,KAAK,MAAA,EAAQ;IAEvC,IAAM,IAAY,EAAA,GAAK,KAAK,OAAA;AAG5B,WAFO,EAAU,IACjB,KAAK,YAAY,EAAA;AACjB;;GAID,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AAAA,WAE9B,EAAM;KAAA;AAGd,QAAK,YAAY,EAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,sBAAsB,OAAO,EAAA,CAAA,eAAoB,KAAK,OAAO,EAAA;AACnG,QAAK,OAAO,KAAK,EAAA;AAIjB,OAAA;IACC,IAAM,IAAgB,EAAA,GAAK,KAAK,OAAA;AAAA,WACzB,EAAc,IACrB,KAAK,YAAY,EAAA;WACT;;;CAWX,QAAe,GAAc,GAAA;AAC5B,MAAA;AACC,OAAA,CAAK,EAEJ;AAGD,OAAA,CAAK,KAAK,iBAAiB,KAAK,MAAA,EAAQ;IAEvC,IAAM,IAAQ,EAAK,MAAM,IAAA,EACnB,IAAY,EAAA,GAAK,KAAK,OAAA,EACxB,IAAe;AAEnB,SAAK,IAAI,IAAI,GAAG,IAAI,EAAM,SAAS,GAAG,KAAK;KAC1C,IAAM,IAAO,EAAM;AAAA,KACf,EAAQ,OADO,KACG,IACrB,EAAQ,KAAQ,EAAA,GACmB,OAAlB,EAAQ,MAAU,YAAY,EAAQ,OAAU,SACjE,EAAQ,KAAQ,EAAA,GAEjB,IAAU,EAAQ;;AAGnB,MAAQ,EAAM,EAAM,SAAS,MAAM,GACnC,KAAK,YAAY,EAAA;AACjB;;GAID,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;IACrC,IAAM,IAAQ,EAAK,MAAM,IAAA,EACrB,IAAe;AAGnB,SAAK,IAAI,IAAI,GAAG,IAAI,EAAM,SAAS,GAAG,KAAK;KAC1C,IAAM,IAAO,EAAM;AAAA,KAGf,EAAQ,OAHO,KAGG,IACrB,EAAQ,KAAQ,EAAA,GACmB,OAAlB,EAAQ,MAAU,YAAY,EAAQ,OAAU,SAEjE,EAAQ,KAAQ,EAAA,GAGjB,IAAU,EAAQ;;IAInB,IAAM,IAAW,EAAM,EAAM,SAAS;AACtC,QAAA;AACC,OAAQ,KAAsB;YACtB;AAER,OAAQ,KAAY;;KAAA;AAItB,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,sBAAsB,EAAA,MAAW,KAAK,OAAO,EAAA;AACnF,QAAK,OAAO,KAAK,EAAA;AAIjB,OAAA;IACC,IAAM,IAAQ,EAAK,MAAM,IAAA,EACnB,IAAY,EAAA,GAAK,KAAK,OAAA,EACxB,IAAe;AAEnB,SAAK,IAAI,IAAI,GAAG,IAAI,EAAM,SAAS,GAAG,KAAK;KAC1C,IAAM,IAAO,EAAM;AAAA,KACf,EAAQ,OADO,KACG,IACrB,EAAQ,KAAQ,EAAA,GACmB,OAAlB,EAAQ,MAAU,YAAY,EAAQ,OAAU,SACjE,EAAQ,KAAQ,EAAA,GAEjB,IAAU,EAAQ;;AAGnB,MAAQ,EAAM,EAAM,SAAS,MAAM,GACnC,KAAK,YAAY,EAAA;WACT;;;CASX,mBAA6B,GAAA;AAC5B,MAAA;AAEC,UAAI,KAAK,iBAAiB,KAAK,aAAA,IAAiB,KAAK,iBAAiB,EAAA,GAC9D,EAAQ,KAAK,eAAc,MAAA;AACjC,WAAO,OAAO,GAAiB,EAAA;KAAA,GAIzB;IAAA,GAAK,KAAK;IAAA,GAAiB;IAAA;UAE3B;AAER,UAAO;;;CAOT,gBAAA;AACuB,EAAA,OAAX,SAAW,QAEnB,OAAe,aAAc,OAAe,cAAc,EAAA,EAC1D,OAAe,WAAW,KAAK,OAAO;GACvC,gBAAgB,KAAK;GACrB,KAAK,KAAK,IAAI,KAAK,KAAA;GACnB,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,OAAO,KAAK,MAAM,KAAK,KAAA;GACvB,SAAS,KAAK,QAAQ,KAAK,KAAA;GAC3B,YAAY,MAAA;IACX,IAAM,IAAe,KAAK,EAAE,UAAU,EAAA;AACtC,iBAAa,EAAa,aAAA;;GAAA;;CAS9B,iBAA2B,GAAA;AAE1B,SAA0C,OAAV,KAAU,cAAnC,MAAgD,MAAM,iBAAiB,EAAA,IAAA,CAA+B,MAArB,EAAM;;;ACrPhG,SAAS,GACR,GACA,GACA,GAAA;AAEA,KAAA;AAEiB,EAAZ,MAAY,gBAEf,IAAU,YAzBU,IA6BF,OA3BT,QACO,OAAV,KAAU,YAChB,MAAM,QAAQ,EAAA,IACb,aAAiB,OACjB,aAAiB,OACjB,aAAiB,QACjB,aAAiB,UACnB,OAAO,eAAe,EAAA,KAAW,OAAO,eAsBvC,IAAc,EAAA,GAAK,GAAA;EAIpB,IAAM,IAAQ,GAAoB,YAAe,GAAS,GAAK,EAAA;AAO/D,SAjEkB,QADG,IA8DH,EAAM,UA7DN,YAAY,MAAQ,QAGhC,OAAO,KAAK,EAAA,CAAK,WAAW,KA2DjC,EAAM,IAAI,EAAA,GAAK,GAAA,CAAA,EAGT;SACC;AASR,SANsB,GAAoB,YACzC,UACA,GAAG,EAAA,YACH,EAAA;;CAzEH,IAAuB,GAwBA;;AA2FvB,SAAS,GACR,GACA,GACA,GAAA;AAEA,KAAA;EAEC,IAAM,IAAQ,GAAmB,YAAY,GAAS,GAAK,EAAA;AAQ3D,SALK,EAAM,MAAM,UAEhB,EAAM,QAAQ,CAAA,GAAI,EAAA,CAAA,EAGZ;SACC;AASR,SANsB,GAAmB,YACxC,UACA,GAAG,EAAA,YACH,CAAA,GAAI,EAAA,CAAA;;;AAmDP,SAAgB,GACf,GACA,GACA,GAAA;AAKA,KAAA;AAeC,SAbI,AAIF,MADG,EAAI,SAAS,aAAA,IAAiB,EAAI,SAAS,MAAA,mBAChC,IAAI,KAAA,GACR,EAAI,SAAS,QAAA,IAAY,EAAI,SAAS,OAAA,GAClC,EAAA,GAEA,EAAA,EAKO,aAxMA,MAwEzB,SACC,GACA,GACA,GAAA;AAEA,OAAA;IAEC,IAAM,IAAQ,GAAwB,YAAY,GAAS,GAAK,EAAA;AAQhE,WALK,EAAM,MAAM,QAEhB,EAAM,QAAQ,IAAI,IAAI,EAAA,CAAA,EAGhB;WACC;AASR,WANsB,GAAwB,YAC7C,UACA,GAAG,EAAA,YACH,IAAI,IAAI,EAAA,CAAA;;IA2G0B,GAAa,GAAS,EAAA,GAnM3D,SAAoB,GAAA;AACnB,UAAO,MAAM,QAAQ,EAAA;IAmMI,EAAA,GAChB,GAAsB,GAAa,GAAS,EAAA,GAE5C,GAD0B,OAAhB,KAAgB,WACH,IAIA,EAAE,OAAO,GAAA,EAJ2B,GAAS,EAAA;SAMpE;AAKR,SAAO,GACiB,OAAhB,KAAgB,YAAY,IAAuB,EAAA,GAAK,GAAA,GAAgB,EAAE,OAAO,GAAA,EACxF,UACA,sBAAsB,IAAA;;;AAYzB,SAAgB,GACf,IAAmB,EAAA,EACnB,GACA,IAAuB,SAAA;AAEvB,KAAA;AACC,SAAO,GAAiB,GAAa,GAAS,EAAA;SACtC;AAGR,SAAO,GAAoB,GAAa,UAAU,GAAG,EAAA,WAAA;;;AAUvD,SAAgB,GACf,IAAmB,EAAA,EACnB,IAAc,cAAA;AAEd,KAAA;AACC,SAAO,GAAiB,GAAa,UAAU,EAAA;SACvC;AAGR,SAAO,GAAoB,GAAa,UAAU,GAAG,EAAA,qBAAA;;;ACvOvD,IAAa,MAA0B,GAA2B,MAAA;AACjE,KAAA,CAAK,EAAM,QAAO;CAElB,IAAM,IAAQ,EAAK,MAAM,IAAA,EACrB,IAAa;AAEjB,MAAK,IAAM,KAAQ,GAAO;AACzB,MAAI,KAAS,KAAM;AACnB,MAAQ,EAAM;;AAGf,QAAO;GA+EF,MAAc,MAAA;AACnB,KAAA,CAAK,KAAK,EAAE,SAAS,EAAG,QAAO,EAAA;CAE/B,IAAM,IAAoB,EAAA;AAC1B,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,SAAS,GAAG,IACjC,GAAQ,KAAK,EAAE,UAAU,GAAG,IAAI,EAAA,CAAG,aAAA,CAAA;AAEpC,QAAO;GAwCF,MAAqB,GAAgB,MAAA;AAC1C,KAAA,CAAK,KAAA,CAAW,EAAU,QAAO;CAEjC,IAAM,IAAI,EAAO,aAAA,CAAc,MAAA,EACzB,IAAI,EAAS,aAAA,CAAc,MAAA;AAEjC,KAAI,MAAM,EAAG,QAAO;CAEpB,IAAM,IAAiB,KAAE,SAAS,EAAA,EAC5B,MAjGgB,GAAa,MAAA;AACnC,MAAA,CAAK,EAAK,QAAA,CAAO;AACjB,MAAA,CAAK,EAAK,QAAA,CAAO;EAEjB,IAAI,IAAI,GACP,IAAI;AACL,SAAO,IAAI,EAAI,UAAU,IAAI,EAAI,QAC5B,GAAI,GAAG,aAAA,KAAkB,EAAI,GAAG,aAAA,IAAe,KACnD;AAED,SAAO,MAAM,EAAI;IAuFsB,GAAG,EAAA,GAAK,KAAM,GAC/C,MAjFe,GAAe,MAAA;AACpC,MAAA,CAAK,EAAO,QAAA,CAAO;AACnB,MAAA,CAAK,EAAQ,QAAA,CAAO;EAEpB,IAAM,KAAc,MACnB,EACE,aAAA,CACA,MAAM,GAAA,CACN,QACC,GAAK,OACL,EAAI,MAAS,EAAI,MAAS,KAAK,GACxB,IAER,EAAA,CAAA,EAGG,IAAa,EAAW,EAAA,EACxB,IAAc,EAAW,EAAA;AAC/B,SAAO,OAAO,KAAK,EAAA,CAAY,OAAM,OAAS,EAAY,MAAS,MAAM,EAAW,GAAA;IA+DlD,GAAG,EAAA,GAAK,KAAM,GAC1C,MA5CkB,GAAY,MAAA;AACpC,MAAA,CAAK,KAAA,CAAO,KAAM,EAAG,SAAS,KAAK,EAAG,SAAS,EAAG,QAAO;EAEzD,IAAM,IAAW,GAAW,EAAA,EACtB,IAAW,GAAW,EAAA;AAE5B,MAAI,EAAS,WAAW,KAAK,EAAS,WAAW,EAAG,QAAO;EAE3D,IAAI,IAAe,GACb,IAAW,MAAM,EAAS,OAAA,CAAQ,KAAA,CAAK,EAAA;AAE7C,OAAK,IAAM,KAAU,EACpB,MAAK,IAAI,IAAI,GAAG,IAAI,EAAS,QAAQ,IACpC,KAAA,CAAK,EAAK,MAAM,EAAS,OAAO,GAAQ;AACvC,QACA,EAAK,KAAA,CAAK;AACV;;AAKH,SAAQ,IAAI,KAAiB,EAAS,SAAS,EAAS;IAuBtB,GAAG,EAAA,EAE/B,IAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,OAAA,EAC9B,KAAmB,IAAS,MAtId,GAAW,MAAA;AAC/B,MAAI,MAAM,EAAG,QAAO;EAEpB,IAAM,IAAqB,MAAM,EAAE,SAAS,EAAA,CAC1C,KAAK,KAAA,CACL,KAAK,GAAG,MAAM,CAAC,EAAA,CAAA;AAGjB,OAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,IAC9B,GAAO,GAAG,KAAK;AAGhB,OAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,IAC9B,MAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,IAC1B,GAAE,OAAO,IAAI,EAAA,KAAO,EAAE,OAAO,IAAI,EAAA,GACpC,EAAO,GAAG,KAAK,EAAO,IAAI,GAAG,IAAI,KAEjC,EAAO,GAAG,KAAK,KAAK,IACnB,EAAO,IAAI,GAAG,KAAK,GACnB,EAAO,GAAG,IAAI,KAAK,GACnB,EAAO,IAAI,GAAG,IAAI,KAAK,EAAA;AAK3B,SAAO,EAAO,EAAE,QAAQ,EAAE;IA6GwB,GAAG,EAAA,GAAK,IAAS;AAEnE,QAAO,KAAK,IAAI,GAAgB,GAAkB,GAAc,GAAW,GAAA;GAMtE,MAAc,MACf,KAAS,OAAa,KACnB,OAAO,EAAA;AAMf,SAAS,GACR,GACA,GACA,IAAyB,IAAA;CAEzB,IAAI,GACH,GACA,GACA,IAAA,CAAS;AAEV,KAAI,MAAM,QAAQ,EAAA,CAAA,EACf,GAAO,GAAI,GAAU,IAAA,CAAS,KAAS;MACnC;AAEN,MAAI,MAAM,QAAQ,EAAM,IAAA,CAKvB,QAJgB,EAAM,IAAI,KAAI,MAC7B,GAAoB,GAAM;GAAA,GAAK;GAAO,KAAK;GAAA,EAAK,EAAA,CAAA,CAGlC,QACb,GAAM,MAAU,EAAK,SAAS,EAAK,QAAQ,EAAK,QAAQ,IAAe,GACxE;GAAE,OAAA,CAAO;GAAO,OAAO;GAAA,CAAA;AAIzB,MAAQ,EAAM,KACd,IAAK,EAAM,UACX,IAAW,EAAM,OACjB,IAAS,EAAM,UAAA,CAAU;;AAI1B,KAAA,CAAK,MAAW,MAAa,MAAM,KAAY,QAAS,EAAQ,EAAA,IAAa,EAAS,WAAW,GAChG,QAAO;EAAE,OAAA,CAAO;EAAM,OAAO;EAAA;CAG9B,IAAM,IAAS,GAAc,GAAM,EAAA;AAGnC,KAAI,GAEH;AAAA,MAAI,MAAO,OAAO;AAEjB,OAAsB,OAAX,KAAW,YAAgC,OAAb,KAAa,SACrD,QAAO;IAAE,OAAA,CAAO;IAAO,OAAO;IAAA;GAG/B,IAAM,IAAQ,GAAkB,GAAQ,EAAA;AACxC,UAAO;IACN,OAAO,KAAS;IAChB,OAAO,KAAS,IAAiB,IAAQ;IAAA;;EAEpC;GAGN,IAAM,IAAU,GAAc,GAAI,GAAQ,EAAA;AAC1C,UAAO;IACN,OAAO;IACP,OAAO;IAAc;;;AAAA,KAGb,MAAO,OAAO;AAExB,MAAsB,OAAX,KAAW,YAAgC,OAAb,KAAa,SACrD,QAAO;GAAE,OAAA,CAAO;GAAO,OAAO;GAAA;EAG/B,IAAM,IAAQ,GAAkB,GAAQ,EAAA;AACxC,SAAI,IAAQ,IACJ;GAAE,OAAA,CAAO;GAAO,OAAO;GAAA,GAGxB;GAAE,OAAA,CAAO;GAAM,OAAA;GAAA;;CAChB;EAEN,IAAM,IAAU,GAAc,GAAI,GAAQ,EAAA;AAC1C,SAAO;GACN,OAAO;GACP,OAAO;GAAc;;;AAqBxB,SAAgB,GACf,GACA,IAA4B,EAAA,EAC5B,IAAyB,IAAA;AAGzB,KAAA,CAAK,EAAQ,OACZ,QAAO,MAAM,KAAK,EAAM,QAAA,CAAA;CAIzB,IAAM,IAA+B,EAAA;AAErC,MAAK,IAAA,CAAO,GAAG,MAAS,EAAM,SAAA,EAAW;EACxC,IAAI,IAAa,GACb,IAAa,GACb,IAAA,CAAQ;AAEZ,OAAK,IAAM,KAAS,GAAS;GAC5B,IAAM,IAAS,GAAoB,GAAM,GAAO,EAAA;AAEhD,OAAA,CAAK,EAAO,OAAO;AAClB,QAAA,CAAQ;AACR;;AAGD,QAAc,EAAO,OACrB;;AAGG,OACH,EAAY,KAAK;GAChB,MAAA;GACA,OAAO,IAAa,IAAI,IAAa,IAAa;GAAA,CAAA;;AAQrD,QAFA,EAAY,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAA,EAEhC,EAAY,KAAI,MAAK,EAAE,KAAA;;AAM/B,SAAgB,GACf,GACA,IAA4B,EAAA,EAC5B,IAAyB,IAAA;CAGzB,IAAM,oBAAM,IAAI,KAAA;AAGhB,QAFA,EAAM,SAAS,GAAM,MAAU,EAAI,IAAI,OAAO,EAAA,EAAQ,EAAA,CAAA,EAE/C,GAAe,GAAK,GAAS,EAAA;;AAUrC,SAAgB,EAAqB,GAAA;AACpC,QAAO,MAAM,QAAQ,EAAA;;AAQtB,SAAgB,EAAS,GAAA;AACxB,QAAwB,OAAV,KAAU;;AAQzB,SAAgB,EAAS,GAAA;AACxB,QAAwB,OAAV,KAAU,YAAV,CAAuB,MAAM,EAAA;;AAQ5C,SAAgB,EAAO,GAAA;AACtB,QAAO,aAAiB,QAAA,CAAS,MAAM,EAAM,SAAA,CAAA;;AAQ9C,SAAgB,GAAwB,GAAA;AAEvC,QAAsC,OAAV,KAAU,cAAlC,KAKG,OAAO,YAAY,OAAO,EAAA,IAAqD,OAAnC,EAAc,OAAO,aAAc;;AAQvF,SAAgB,EAAgC,GAAA;AAC/C,QAAO,aAAiB;;AAQzB,SAAgB,EAAmB,GAAA;AAClC,QAAO,aAAiB;;AAQzB,SAAgB,GAAc,GAAA;AAC7B,KAAuC,OAAV,KAAU,aAAnC,EACH,QAAA,CAAO;CAGR,IAAM,IAAQ,OAAO,eAAe,EAAA;AACpC,QAAO,MAAU,OAAO,aAAa,MAAU;;AAQhD,SAAgB,EAAM,GAAA;AACrB,QAAO,KAAA;;AAUR,SAAgB,GAAc,GAAwB,GAAiB,GAAA;AAEtE,KAAI,EAAM,EAAA,IAAW,EAAM,EAAA,CAAW,QAAA,CAAO;AAC7C,KAAI,EAAM,EAAA,IAAW,EAAM,EAAA,CAE1B,QAAI,MAAO,OAAa,MAAW,IAC/B,MAAO,QAAa,MAAW;AAKpC,SAAQ,GAAR;EACC,KAAK,KACJ,QAAO,MAAW;EACnB,KAAK,KACJ,QAAO,MAAW;EACnB,KAAK,IACJ,QAAI,EAAS,EAAA,IAAW,EAAS,EAAA,GACzB,IAAS,IAEb,EAAO,EAAA,IAAW,EAAO,EAAA,GACrB,EAAO,SAAA,GAAY,EAAS,SAAA,GAAA,EAAA,CAEhC,EAAS,EAAA,IAAA,CAAW,EAAS,EAAA,KACzB,EAAO,cAAc,EAAA,GAAY;EAG1C,KAAK,IACJ,QAAI,EAAS,EAAA,IAAW,EAAS,EAAA,GACzB,IAAS,IAEb,EAAO,EAAA,IAAW,EAAO,EAAA,GACrB,EAAO,SAAA,GAAY,EAAS,SAAA,GAAA,EAAA,CAEhC,EAAS,EAAA,IAAA,CAAW,EAAS,EAAA,KACzB,EAAO,cAAc,EAAA,GAAY;EAG1C,KAAK,KACJ,QAAI,EAAS,EAAA,IAAW,EAAS,EAAA,GACzB,KAAU,IAEd,EAAO,EAAA,IAAW,EAAO,EAAA,GACrB,EAAO,SAAA,IAAa,EAAS,SAAA,GAAA,EAAA,CAEjC,EAAS,EAAA,IAAA,CAAW,EAAS,EAAA,KACzB,EAAO,cAAc,EAAA,IAAa;EAG3C,KAAK,KACJ,QAAI,EAAS,EAAA,IAAW,EAAS,EAAA,GACzB,KAAU,IAEd,EAAO,EAAA,IAAW,EAAO,EAAA,GACrB,EAAO,SAAA,IAAa,EAAS,SAAA,GAAA,EAAA,CAEjC,EAAS,EAAA,IAAA,CAAW,EAAS,EAAA,KACzB,EAAO,cAAc,EAAA,IAAa;EAG3C,KAAK,WACJ,QAAI,EAAS,EAAA,GACL,EAAO,aAAA,CAAc,SAAS,GAAW,EAAA,CAAU,aAAA,CAAA,GAEvD,EAAQ,EAAA,GACJ,EAAO,SAAS,EAAA,GAEpB,EAAM,EAAA,GACF,EAAO,IAAI,EAAA,GAAA,CAAA,CAEf,EAAM,EAAA,IACF,MAAM,KAAK,EAAO,QAAA,CAAA,CAAU,SAAS,EAAA;EAI9C,KAAK,cACJ,QAAI,EAAS,EAAA,GAAA,CACJ,EAAO,aAAA,CAAc,SAAS,GAAW,EAAA,CAAU,aAAA,CAAA,GAExD,EAAQ,EAAA,GAAA,CACH,EAAO,SAAS,EAAA,GAErB,EAAM,EAAA,GAAA,CACD,EAAO,IAAI,EAAA,GAAA,CAEhB,EAAM,EAAA,IAAA,CACD,MAAM,KAAK,EAAO,QAAA,CAAA,CAAU,SAAS,EAAA;EAI/C,KAAK,aACJ,QAAA,EAAA,CAAI,EAAS,EAAA,IAAA,CAAW,EAAS,EAAA,KACzB,EAAO,aAAA,CAAc,WAAW,EAAS,aAAA,CAAA;EAIlD,KAAK,WACJ,QAAA,EAAA,CAAI,EAAS,EAAA,IAAA,CAAW,EAAS,EAAA,KACzB,EAAO,aAAA,CAAc,SAAS,EAAS,aAAA,CAAA;EAIhD,KAAK,KACJ,QAAI,EAAQ,EAAA,GACJ,EAAS,SAAS,EAAA,GAEtB,EAAM,EAAA,GACF,EAAS,IAAI,EAAA,GAAA,CAAA,CAEjB,EAAM,EAAA,KACF,EAAS,IAAI,EAAA,IAAkB,MAAM,KAAK,EAAS,QAAA,CAAA,CAAU,SAAS,EAAA;EAI/E,KAAK,QACJ,QAAI,EAAQ,EAAA,GAAA,CACH,EAAS,SAAS,EAAA,GAEvB,EAAM,EAAA,GAAA,CACD,EAAS,IAAI,EAAA,GAAA,CAElB,EAAM,EAAA,IAAA,CACD,EAAS,IAAI,EAAA,IAAA,CAAmB,MAAM,KAAK,EAAS,QAAA,CAAA,CAAU,SAAS,EAAA;EAIjF,QAEC,QAAA,CAAO;;;AAMV,IAAa,KAAY,IAGZ,KAAc;AC7lB3B,SAAS,EAAU,GAAY,GAAA;AAC9B,KAAI,MAAM,EAAG,QAAA,CAAO;AAEpB,KAAI,aAAa,OAAO,aAAa,KAAK;AACzC,MAAI,EAAE,SAAS,EAAE,KAAM,QAAA,CAAO;AAC9B,OAAK,IAAA,CAAO,GAAK,MAAU,EAC1B,KAAA,CAAK,EAAE,IAAI,EAAA,IAAA,CAAS,EAAU,GAAO,EAAE,IAAI,EAAA,CAAA,CAAO,QAAA,CAAO;AAE1D,SAAA,CAAO;;AAGR,KAAI,aAAa,OAAO,aAAa,KAAK;AACzC,MAAI,EAAE,SAAS,EAAE,KAAM,QAAA,CAAO;AAC9B,OAAK,IAAM,KAAQ,EAClB,KAAA,CAAK,EAAE,IAAI,EAAA,CAAO,QAAA,CAAO;AAE1B,SAAA,CAAO;;AAGR,KAAiB,OAAN,KAAM,YAAY,KAA2B,OAAN,KAAM,YAAY,GAAY;EAC/E,IAAM,IAAQ,OAAO,KAAK,EAAA,EACpB,IAAQ,OAAO,KAAK,EAAA;AAE1B,MAAI,EAAM,WAAW,EAAM,OAAQ,QAAA,CAAO;AAE1C,OAAK,IAAM,KAAO,EAEjB,KAAA,CAAK,EAAU,EAAE,IAAM,EAAE,GAAA,CAAO,QAAA,CAAO;AAGxC,SAAA,CAAO;;AAGR,QAAA,CAAO;;AAUR,SAAgB,GAAqB,GAAkB,GAAA;AACtD,QAAO,EAAM,EAAE,KAAK,EAAI,EAAA,EAAa,EAAwB,EAAA,EAAY,EAAY,EAAA,CAAA;;AAUtF,SAAgB,EACf,GACA,GAAA;AAEA,QAAO,EAAM,EAAE,KAAK,EAAI,EAAA,EAAa,EAAwB,EAAA,EAAY,EAAY,EAAA,CAAA;;AAStF,SAAgB,GAAuB,GAAA;AACtC,QAAO,EAAyB,IAAO,MAAc,MAAM,KAAK,EAAW,QAAA,CAAA,CAAA;;AAU5E,SAAgB,GAAsB,GAA4B,GAAA;AACjE,QAAO,EAAyB,IAAO,MAAc,EAAW,IAAI,EAAA,CAAA;;AAMrE,SAAgB,GAAsB,GAAA;AACrC,QAAO,EAAyB,IAAO,MAAc,MAAM,KAAK,EAAW,MAAA,CAAA,CAAA;;AAM5E,SAAgB,GAAyB,GAAA;AACxC,QAAO,EAAyB,IAAO,MAAc,MAAM,KAAK,EAAW,SAAA,CAAA,CAAA;;AAM5E,SAAgB,GAAsB,GAA4B,GAAA;AACjE,QAAO,EAAyB,IAAO,MAC/B,MAAM,KAAK,EAAW,QAAA,CAAA,CAAU,KAAK,EAAA,CAAA;;AAO9C,SAAgB,GACf,GACA,GAAA;AAEA,QAAO,EAAyB,IAAO,MAAA;AACtC,OAAK,IAAA,CAAO,GAAK,MAAS,EAAW,SAAA,CACpC,KAAI,EAAU,GAAM,EAAA,CACnB,QAAO;GAAA;;AAcX,SAAgB,GACf,GACA,GAAA;AAEA,QAAO,EAAyB,IAAO,MACtC,MAAM,KAAK,EAAW,SAAA,CAAA,CACpB,QAAA,CAAS,GAAK,OAAU,EAAS,GAAM,EAAA,CAAA,CACvC,KAAA,CAAM,GAAG,OAAU,EAAA,CAAA;;AAOvB,SAAgB,GACf,GACA,GAAA;AAEA,QAAO,EAAyB,IAAO,MACtC,MAAM,KAAK,EAAW,SAAA,CAAA,CAAW,KAAA,CAAM,GAAK,OAAU,EAAM,GAAM,EAAA,CAAA,CAAA;;AAWpE,SAAgB,GACf,GACA,GAAA;AAEA,QAAO,EAAyB,IAAO,MACjC,IAEE,MAAM,KAAK,EAAW,SAAA,CAAA,CAAW,QAAA,CAAS,GAAK,OAAU,EAAS,GAAM,EAAA,CAAA,CAAM,SAF/D,EAAW,KAAA;;AAcnC,SAAgB,GAA8B,GAAkB,GAAA;AAC/D,QAAO,EAAM,EAAE,KACd,EAAI,EAAA,EACJ,EAAwB,EAAA,EACxB,EAAM;EACL,qBAAA,CAAqB;EACrB,cAAA,CAAc;EACd,iBAAA,CAAiB;EAAA,CAAA,CAAA;;AAgBpB,SAAgB,GACf,GACA,GACA,GAAA;CAIA,IAAM,IAAe,EAAA,GADC,EAAO,KAAK,GAAO,MAAU,EAAY,GAAO,EAAM,MAAA,CAAA,CAAA,EAItE,IAAoB;EACzB,GAAG,IAAI,EAAmB,EAAA;EAC1B,QAAQ,IAAI,EAAmC,KAAA;EAC/C,OAAA,CAAO;EACP,cAAc;EAEd,IAAA,QAAI;AACH,UAAO,KAAK,EAAE,UAAA;;EAIf,IAAI,GAAoB,GAAA;EAIxB,QAAA;AACC,QAAK,EAAE,KAAK,KAAK,aAAA;;EAGlB,QAAQ,GAAA;EAIR,OAA0B,GAAA;EAI1B,UAAA;AACC,QAAK,EAAE,UAAA,EACP,KAAK,OAAO,UAAA;;EAAA,EAQR,IAAe,EAHD,EAAO,KAAK,GAAO,MAAM,EAAM,EAAA,CAAA,CAGH,UAAU;EACzD,OAAM,MAAA;AACL,OAAA;IAKC,IAAM,IAAW,EAAA,GAHM,EAAY,KAAK,GAAO,MAAU,EAAY,GAAO,EAAA,CAAA,CAAA;AAM5E,MAAO,EAAE,KAAK,EAAA;YACN,GAAA;IACR,IAAM,IAAQ,IAAI,EAAW,8BAA8B,EAAA;AAC3D,MAAO,OAAO,KAAK,EAAA;;;EAIrB,QAAO,MAAA;GACN,IAAM,IAAQ,IAAI,EAAW,+BAA+B,EAAA;AAC5D,KAAO,OAAO,KAAK,EAAA;;EAAA,CAAA,EAMf,IAAkB,EAAO;AAM/B,QALA,EAAO,UAAU,WAAA;AAChB,IAAa,aAAA,EACb,EAAgB,KAAK,KAAA;IAGf;;ACpRR,IAAM,IAAkB,OAAO,kBAAA,EACzB,IAAgB,OAAO,wBAAA,EACvB,IAAc,OAAO,sBAAA,EACrB,IAAmB,OAAO,0BAAA;AA+GhC,SAAgB,GACf,GACA,KAAiC,MAAa,GAC9C,IAAyB,EAAE,UAAA,CAAU,GAAA,EAAA;AAErC,QAAO,SAAU,GAA4B,GAAkB,GAAA;AAE9D,KAAY;GAAE,WAAA,CAAW;GAAO,MAAM;GAAA,CAAtC,CAAgD,GAAO,EAAA;EAGvD,IAAM,IAA4B,EAAM,mBAClC,KAA+B,EAAM;AAG3C,IAAM,oBAAoB,WAAA;GA7D5B,IAAgC;AAAA,IAAA,IA+DN,MA9DV,MAAA,CAAoB,EAAU,GAAiB,WAC7D,EAAU,KAAmB,IAAI,GAAA,GAG7B,EAAU,OACd,EAAU,qBAAiB,IAAI,KAAA,GAG3B,EAAU,OACd,EAAU,qBAAe,IAAI,KAAA;GAwD5B,IAAM,IAzET,SAA8B,GAAA;AAC7B,WAAO,SAAS,KAA8B,OAAd,EAAM,OAAQ,cAAc,EAAM,iBAAiB;KAwE/B,EAAA,GAC/C,EAAyB,GAAO,EAAA,GAChC,GAAe,GAAoB,EAAA;AAGjC,KAAQ,YAAa,KAAK,OAC9B,GAA2B,KAAK,KAAA,EAChC,KAAK,KAAA,CAAoB,IAItB,KAAK,GAAgB,IAAI,EAAA,KAC5B,KAAK,GAAgB,IAAI,EAAA,EAAW,aAAA,EACpC,KAAK,GAAgB,OAAO,EAAA,GAIzB,EAAQ;GAKZ,IAAM,KAAe,EAAS,KAAK,EAAU,KAAK,GAAA,CAAA,CAAoB,UAAU;IAC/E,OAAO,MAAA;KAEN,IAAM,IAAW,EAAQ,YAAY,gBAAgB,EAAA,GAAS;AAE1D,OAAQ,OAIP,EAAQ,eACZ,KAAK,KAAY,IAGlB,KAAK,iBAAA,EAID,EAAQ,YAAA,CAAa,KAAK,GAAc,IAAI,EAAA,IAAa,MAAb,KAA0B,MACzE,KAAK,GAAc,IAAI,EAAA,EAGlB,KAAK,OACL,EAAQ,OAIZ,GAA2B,KAAK,KAAA,EAChC,KAAK,KAAA,CAAoB;;IAI5B,QAAQ,MAAA;AAGH,UAAK,eAER,iBAAA;AACK,WAAK,gBACJ,EAAQ,OAGZ,KAAK,qBAAA;QAEJ,IAAA;;IAAA,CAAA;AAMN,QAAK,GAAgB,IAAI,GAAU,GAAA;KAIpC,EAAM,uBAAuB,WAAA;GA5H/B,IAAkC;AA8H/B,OAA8B,KAAK,KAAA,EAG/B,EAAQ,QAjImB,IAsIN,MArIb,OACb,EAAU,GAAiB,MAAA,EAC3B,EAAU,GAAiB,UAAA,EAC3B,EAAU,KAAA,KAAmB,IAG1B,EAAU,OACb,EAAU,GAAe,SAAQ,MAAO,EAAI,aAAA,CAAA,EAC5C,EAAU,GAAe,OAAA,EACzB,EAAU,KAAA,KAAiB,IAGxB,EAAU,OACb,EAAU,GAAa,OAAA,EACvB,EAAU,KAAA,KAAe,IAI1B,EAAU,KAAA,KAAoB;;;;AAgI/B,SAAgB,GACf,GACA,GACA,IAAyB,EAAE,UAAA,CAAU,GAAA,EAAA;AAErC,QAAO,SAAU,GAA4B,GAAkB,GAAA;AAC9D,KACC,GACA,SAAU,GAAA;GAET,IAAM,IAAU,EAAU,KAAA;AAC1B,UAAO,IAAU,EAAM,IAAI,EAAA,GAAA,KAAW;KAEvC,EAPD,CAQE,GAAO,EAAA;;;AAAA,SAAA,KAAA,GAAA,MAAA,GAAA,KAAA,GAAA,KAAA,GAAA,KAAA,GAAA,MAAA,GAAA,KAAA,GAAA,KAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,KAAA,GAAA,KAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,KAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,KAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA"}
+{"version":3,"file":"store-CjzZDQt8.js","names":["isPlainObject","isArray","isMap","isSet","finalize"],"sources":["../node_modules/immer/dist/immer.mjs","../src/store/types.ts","../src/store/storage-manager.ts","../src/store/store.class.ts","../src/store/context-array.ts","../src/store/context-collection.ts","../src/store/context-object.ts","../src/store/context-create.ts","../src/store/filter-directive.ts","../src/store/selectors.ts","../src/store/selector-hook.ts"],"sourcesContent":["// src/utils/env.ts\nvar NOTHING = Symbol.for(\"immer-nothing\");\nvar DRAFTABLE = Symbol.for(\"immer-draftable\");\nvar DRAFT_STATE = Symbol.for(\"immer-state\");\n\n// src/utils/errors.ts\nvar errors = process.env.NODE_ENV !== \"production\" ? [\n  // All error codes, starting by 0:\n  function(plugin) {\n    return `The plugin for '${plugin}' has not been loaded into Immer. To enable the plugin, import and call \\`enable${plugin}()\\` when initializing your application.`;\n  },\n  function(thing) {\n    return `produce can only be called on things that are draftable: plain objects, arrays, Map, Set or classes that are marked with '[immerable]: true'. Got '${thing}'`;\n  },\n  \"This object has been frozen and should not be mutated\",\n  function(data) {\n    return \"Cannot use a proxy that has been revoked. Did you pass an object from inside an immer function to an async process? \" + data;\n  },\n  \"An immer producer returned a new value *and* modified its draft. Either return a new value *or* modify the draft.\",\n  \"Immer forbids circular references\",\n  \"The first or second argument to `produce` must be a function\",\n  \"The third argument to `produce` must be a function or undefined\",\n  \"First argument to `createDraft` must be a plain object, an array, or an immerable object\",\n  \"First argument to `finishDraft` must be a draft returned by `createDraft`\",\n  function(thing) {\n    return `'current' expects a draft, got: ${thing}`;\n  },\n  \"Object.defineProperty() cannot be used on an Immer draft\",\n  \"Object.setPrototypeOf() cannot be used on an Immer draft\",\n  \"Immer only supports deleting array indices\",\n  \"Immer only supports setting array indices and the 'length' property\",\n  function(thing) {\n    return `'original' expects a draft, got: ${thing}`;\n  }\n  // Note: if more errors are added, the errorOffset in Patches.ts should be increased\n  // See Patches.ts for additional errors\n] : [];\nfunction die(error, ...args) {\n  if (process.env.NODE_ENV !== \"production\") {\n    const e = errors[error];\n    const msg = isFunction(e) ? e.apply(null, args) : e;\n    throw new Error(`[Immer] ${msg}`);\n  }\n  throw new Error(\n    `[Immer] minified error nr: ${error}. Full error at: https://bit.ly/3cXEKWf`\n  );\n}\n\n// src/utils/common.ts\nvar O = Object;\nvar getPrototypeOf = O.getPrototypeOf;\nvar CONSTRUCTOR = \"constructor\";\nvar PROTOTYPE = \"prototype\";\nvar CONFIGURABLE = \"configurable\";\nvar ENUMERABLE = \"enumerable\";\nvar WRITABLE = \"writable\";\nvar VALUE = \"value\";\nvar isDraft = (value) => !!value && !!value[DRAFT_STATE];\nfunction isDraftable(value) {\n  if (!value)\n    return false;\n  return isPlainObject(value) || isArray(value) || !!value[DRAFTABLE] || !!value[CONSTRUCTOR]?.[DRAFTABLE] || isMap(value) || isSet(value);\n}\nvar objectCtorString = O[PROTOTYPE][CONSTRUCTOR].toString();\nvar cachedCtorStrings = /* @__PURE__ */ new WeakMap();\nfunction isPlainObject(value) {\n  if (!value || !isObjectish(value))\n    return false;\n  const proto = getPrototypeOf(value);\n  if (proto === null || proto === O[PROTOTYPE])\n    return true;\n  const Ctor = O.hasOwnProperty.call(proto, CONSTRUCTOR) && proto[CONSTRUCTOR];\n  if (Ctor === Object)\n    return true;\n  if (!isFunction(Ctor))\n    return false;\n  let ctorString = cachedCtorStrings.get(Ctor);\n  if (ctorString === void 0) {\n    ctorString = Function.toString.call(Ctor);\n    cachedCtorStrings.set(Ctor, ctorString);\n  }\n  return ctorString === objectCtorString;\n}\nfunction original(value) {\n  if (!isDraft(value))\n    die(15, value);\n  return value[DRAFT_STATE].base_;\n}\nfunction each(obj, iter, strict = true) {\n  if (getArchtype(obj) === 0 /* Object */) {\n    const keys = strict ? Reflect.ownKeys(obj) : O.keys(obj);\n    keys.forEach((key) => {\n      iter(key, obj[key], obj);\n    });\n  } else {\n    obj.forEach((entry, index) => iter(index, entry, obj));\n  }\n}\nfunction getArchtype(thing) {\n  const state = thing[DRAFT_STATE];\n  return state ? state.type_ : isArray(thing) ? 1 /* Array */ : isMap(thing) ? 2 /* Map */ : isSet(thing) ? 3 /* Set */ : 0 /* Object */;\n}\nvar has = (thing, prop, type = getArchtype(thing)) => type === 2 /* Map */ ? thing.has(prop) : O[PROTOTYPE].hasOwnProperty.call(thing, prop);\nvar get = (thing, prop, type = getArchtype(thing)) => (\n  // @ts-ignore\n  type === 2 /* Map */ ? thing.get(prop) : thing[prop]\n);\nvar set = (thing, propOrOldValue, value, type = getArchtype(thing)) => {\n  if (type === 2 /* Map */)\n    thing.set(propOrOldValue, value);\n  else if (type === 3 /* Set */) {\n    thing.add(value);\n  } else\n    thing[propOrOldValue] = value;\n};\nfunction is(x, y) {\n  if (x === y) {\n    return x !== 0 || 1 / x === 1 / y;\n  } else {\n    return x !== x && y !== y;\n  }\n}\nvar isArray = Array.isArray;\nvar isMap = (target) => target instanceof Map;\nvar isSet = (target) => target instanceof Set;\nvar isObjectish = (target) => typeof target === \"object\";\nvar isFunction = (target) => typeof target === \"function\";\nvar isBoolean = (target) => typeof target === \"boolean\";\nfunction isArrayIndex(value) {\n  const n = +value;\n  return Number.isInteger(n) && String(n) === value;\n}\nvar getProxyDraft = (value) => {\n  if (!isObjectish(value))\n    return null;\n  return value?.[DRAFT_STATE];\n};\nvar latest = (state) => state.copy_ || state.base_;\nvar getValue = (value) => {\n  const proxyDraft = getProxyDraft(value);\n  return proxyDraft ? proxyDraft.copy_ ?? proxyDraft.base_ : value;\n};\nvar getFinalValue = (state) => state.modified_ ? state.copy_ : state.base_;\nfunction shallowCopy(base, strict) {\n  if (isMap(base)) {\n    return new Map(base);\n  }\n  if (isSet(base)) {\n    return new Set(base);\n  }\n  if (isArray(base))\n    return Array[PROTOTYPE].slice.call(base);\n  const isPlain = isPlainObject(base);\n  if (strict === true || strict === \"class_only\" && !isPlain) {\n    const descriptors = O.getOwnPropertyDescriptors(base);\n    delete descriptors[DRAFT_STATE];\n    let keys = Reflect.ownKeys(descriptors);\n    for (let i = 0; i < keys.length; i++) {\n      const key = keys[i];\n      const desc = descriptors[key];\n      if (desc[WRITABLE] === false) {\n        desc[WRITABLE] = true;\n        desc[CONFIGURABLE] = true;\n      }\n      if (desc.get || desc.set)\n        descriptors[key] = {\n          [CONFIGURABLE]: true,\n          [WRITABLE]: true,\n          // could live with !!desc.set as well here...\n          [ENUMERABLE]: desc[ENUMERABLE],\n          [VALUE]: base[key]\n        };\n    }\n    return O.create(getPrototypeOf(base), descriptors);\n  } else {\n    const proto = getPrototypeOf(base);\n    if (proto !== null && isPlain) {\n      return { ...base };\n    }\n    const obj = O.create(proto);\n    return O.assign(obj, base);\n  }\n}\nfunction freeze(obj, deep = false) {\n  if (isFrozen(obj) || isDraft(obj) || !isDraftable(obj))\n    return obj;\n  if (getArchtype(obj) > 1) {\n    O.defineProperties(obj, {\n      set: dontMutateMethodOverride,\n      add: dontMutateMethodOverride,\n      clear: dontMutateMethodOverride,\n      delete: dontMutateMethodOverride\n    });\n  }\n  O.freeze(obj);\n  if (deep)\n    each(\n      obj,\n      (_key, value) => {\n        freeze(value, true);\n      },\n      false\n    );\n  return obj;\n}\nfunction dontMutateFrozenCollections() {\n  die(2);\n}\nvar dontMutateMethodOverride = {\n  [VALUE]: dontMutateFrozenCollections\n};\nfunction isFrozen(obj) {\n  if (obj === null || !isObjectish(obj))\n    return true;\n  return O.isFrozen(obj);\n}\n\n// src/utils/plugins.ts\nvar PluginMapSet = \"MapSet\";\nvar PluginPatches = \"Patches\";\nvar PluginArrayMethods = \"ArrayMethods\";\nvar plugins = {};\nfunction getPlugin(pluginKey) {\n  const plugin = plugins[pluginKey];\n  if (!plugin) {\n    die(0, pluginKey);\n  }\n  return plugin;\n}\nvar isPluginLoaded = (pluginKey) => !!plugins[pluginKey];\nfunction loadPlugin(pluginKey, implementation) {\n  if (!plugins[pluginKey])\n    plugins[pluginKey] = implementation;\n}\n\n// src/core/scope.ts\nvar currentScope;\nvar getCurrentScope = () => currentScope;\nvar createScope = (parent_, immer_) => ({\n  drafts_: [],\n  parent_,\n  immer_,\n  // Whenever the modified draft contains a draft from another scope, we\n  // need to prevent auto-freezing so the unowned draft can be finalized.\n  canAutoFreeze_: true,\n  unfinalizedDrafts_: 0,\n  handledSet_: /* @__PURE__ */ new Set(),\n  processedForPatches_: /* @__PURE__ */ new Set(),\n  mapSetPlugin_: isPluginLoaded(PluginMapSet) ? getPlugin(PluginMapSet) : void 0,\n  arrayMethodsPlugin_: isPluginLoaded(PluginArrayMethods) ? getPlugin(PluginArrayMethods) : void 0\n});\nfunction usePatchesInScope(scope, patchListener) {\n  if (patchListener) {\n    scope.patchPlugin_ = getPlugin(PluginPatches);\n    scope.patches_ = [];\n    scope.inversePatches_ = [];\n    scope.patchListener_ = patchListener;\n  }\n}\nfunction revokeScope(scope) {\n  leaveScope(scope);\n  scope.drafts_.forEach(revokeDraft);\n  scope.drafts_ = null;\n}\nfunction leaveScope(scope) {\n  if (scope === currentScope) {\n    currentScope = scope.parent_;\n  }\n}\nvar enterScope = (immer2) => currentScope = createScope(currentScope, immer2);\nfunction revokeDraft(draft) {\n  const state = draft[DRAFT_STATE];\n  if (state.type_ === 0 /* Object */ || state.type_ === 1 /* Array */)\n    state.revoke_();\n  else\n    state.revoked_ = true;\n}\n\n// src/core/finalize.ts\nfunction processResult(result, scope) {\n  scope.unfinalizedDrafts_ = scope.drafts_.length;\n  const baseDraft = scope.drafts_[0];\n  const isReplaced = result !== void 0 && result !== baseDraft;\n  if (isReplaced) {\n    if (baseDraft[DRAFT_STATE].modified_) {\n      revokeScope(scope);\n      die(4);\n    }\n    if (isDraftable(result)) {\n      result = finalize(scope, result);\n    }\n    const { patchPlugin_ } = scope;\n    if (patchPlugin_) {\n      patchPlugin_.generateReplacementPatches_(\n        baseDraft[DRAFT_STATE].base_,\n        result,\n        scope\n      );\n    }\n  } else {\n    result = finalize(scope, baseDraft);\n  }\n  maybeFreeze(scope, result, true);\n  revokeScope(scope);\n  if (scope.patches_) {\n    scope.patchListener_(scope.patches_, scope.inversePatches_);\n  }\n  return result !== NOTHING ? result : void 0;\n}\nfunction finalize(rootScope, value) {\n  if (isFrozen(value))\n    return value;\n  const state = value[DRAFT_STATE];\n  if (!state) {\n    const finalValue = handleValue(value, rootScope.handledSet_, rootScope);\n    return finalValue;\n  }\n  if (!isSameScope(state, rootScope)) {\n    return value;\n  }\n  if (!state.modified_) {\n    return state.base_;\n  }\n  if (!state.finalized_) {\n    const { callbacks_ } = state;\n    if (callbacks_) {\n      while (callbacks_.length > 0) {\n        const callback = callbacks_.pop();\n        callback(rootScope);\n      }\n    }\n    generatePatchesAndFinalize(state, rootScope);\n  }\n  return state.copy_;\n}\nfunction maybeFreeze(scope, value, deep = false) {\n  if (!scope.parent_ && scope.immer_.autoFreeze_ && scope.canAutoFreeze_) {\n    freeze(value, deep);\n  }\n}\nfunction markStateFinalized(state) {\n  state.finalized_ = true;\n  state.scope_.unfinalizedDrafts_--;\n}\nvar isSameScope = (state, rootScope) => state.scope_ === rootScope;\nvar EMPTY_LOCATIONS_RESULT = [];\nfunction updateDraftInParent(parent, draftValue, finalizedValue, originalKey) {\n  const parentCopy = latest(parent);\n  const parentType = parent.type_;\n  if (originalKey !== void 0) {\n    const currentValue = get(parentCopy, originalKey, parentType);\n    if (currentValue === draftValue) {\n      set(parentCopy, originalKey, finalizedValue, parentType);\n      return;\n    }\n  }\n  if (!parent.draftLocations_) {\n    const draftLocations = parent.draftLocations_ = /* @__PURE__ */ new Map();\n    each(parentCopy, (key, value) => {\n      if (isDraft(value)) {\n        const keys = draftLocations.get(value) || [];\n        keys.push(key);\n        draftLocations.set(value, keys);\n      }\n    });\n  }\n  const locations = parent.draftLocations_.get(draftValue) ?? EMPTY_LOCATIONS_RESULT;\n  for (const location of locations) {\n    set(parentCopy, location, finalizedValue, parentType);\n  }\n}\nfunction registerChildFinalizationCallback(parent, child, key) {\n  parent.callbacks_.push(function childCleanup(rootScope) {\n    const state = child;\n    if (!state || !isSameScope(state, rootScope)) {\n      return;\n    }\n    rootScope.mapSetPlugin_?.fixSetContents(state);\n    const finalizedValue = getFinalValue(state);\n    updateDraftInParent(parent, state.draft_ ?? state, finalizedValue, key);\n    generatePatchesAndFinalize(state, rootScope);\n  });\n}\nfunction generatePatchesAndFinalize(state, rootScope) {\n  const shouldFinalize = state.modified_ && !state.finalized_ && (state.type_ === 3 /* Set */ || state.type_ === 1 /* Array */ && state.allIndicesReassigned_ || (state.assigned_?.size ?? 0) > 0);\n  if (shouldFinalize) {\n    const { patchPlugin_ } = rootScope;\n    if (patchPlugin_) {\n      const basePath = patchPlugin_.getPath(state);\n      if (basePath) {\n        patchPlugin_.generatePatches_(state, basePath, rootScope);\n      }\n    }\n    markStateFinalized(state);\n  }\n}\nfunction handleCrossReference(target, key, value) {\n  const { scope_ } = target;\n  if (isDraft(value)) {\n    const state = value[DRAFT_STATE];\n    if (isSameScope(state, scope_)) {\n      state.callbacks_.push(function crossReferenceCleanup() {\n        prepareCopy(target);\n        const finalizedValue = getFinalValue(state);\n        updateDraftInParent(target, value, finalizedValue, key);\n      });\n    }\n  } else if (isDraftable(value)) {\n    target.callbacks_.push(function nestedDraftCleanup() {\n      const targetCopy = latest(target);\n      if (target.type_ === 3 /* Set */) {\n        if (targetCopy.has(value)) {\n          handleValue(value, scope_.handledSet_, scope_);\n        }\n      } else {\n        if (get(targetCopy, key, target.type_) === value) {\n          if (scope_.drafts_.length > 1 && (target.assigned_.get(key) ?? false) === true && target.copy_) {\n            handleValue(\n              get(target.copy_, key, target.type_),\n              scope_.handledSet_,\n              scope_\n            );\n          }\n        }\n      }\n    });\n  }\n}\nfunction handleValue(target, handledSet, rootScope) {\n  if (!rootScope.immer_.autoFreeze_ && rootScope.unfinalizedDrafts_ < 1) {\n    return target;\n  }\n  if (isDraft(target) || handledSet.has(target) || !isDraftable(target) || isFrozen(target)) {\n    return target;\n  }\n  handledSet.add(target);\n  each(target, (key, value) => {\n    if (isDraft(value)) {\n      const state = value[DRAFT_STATE];\n      if (isSameScope(state, rootScope)) {\n        const updatedValue = getFinalValue(state);\n        set(target, key, updatedValue, target.type_);\n        markStateFinalized(state);\n      }\n    } else if (isDraftable(value)) {\n      handleValue(value, handledSet, rootScope);\n    }\n  });\n  return target;\n}\n\n// src/core/proxy.ts\nfunction createProxyProxy(base, parent) {\n  const baseIsArray = isArray(base);\n  const state = {\n    type_: baseIsArray ? 1 /* Array */ : 0 /* Object */,\n    // Track which produce call this is associated with.\n    scope_: parent ? parent.scope_ : getCurrentScope(),\n    // True for both shallow and deep changes.\n    modified_: false,\n    // Used during finalization.\n    finalized_: false,\n    // Track which properties have been assigned (true) or deleted (false).\n    // actually instantiated in `prepareCopy()`\n    assigned_: void 0,\n    // The parent draft state.\n    parent_: parent,\n    // The base state.\n    base_: base,\n    // The base proxy.\n    draft_: null,\n    // set below\n    // The base copy with any updated values.\n    copy_: null,\n    // Called by the `produce` function.\n    revoke_: null,\n    isManual_: false,\n    // `callbacks` actually gets assigned in `createProxy`\n    callbacks_: void 0\n  };\n  let target = state;\n  let traps = objectTraps;\n  if (baseIsArray) {\n    target = [state];\n    traps = arrayTraps;\n  }\n  const { revoke, proxy } = Proxy.revocable(target, traps);\n  state.draft_ = proxy;\n  state.revoke_ = revoke;\n  return [proxy, state];\n}\nvar objectTraps = {\n  get(state, prop) {\n    if (prop === DRAFT_STATE)\n      return state;\n    let arrayPlugin = state.scope_.arrayMethodsPlugin_;\n    const isArrayWithStringProp = state.type_ === 1 /* Array */ && typeof prop === \"string\";\n    if (isArrayWithStringProp) {\n      if (arrayPlugin?.isArrayOperationMethod(prop)) {\n        return arrayPlugin.createMethodInterceptor(state, prop);\n      }\n    }\n    const source = latest(state);\n    if (!has(source, prop, state.type_)) {\n      return readPropFromProto(state, source, prop);\n    }\n    const value = source[prop];\n    if (state.finalized_ || !isDraftable(value)) {\n      return value;\n    }\n    if (isArrayWithStringProp && state.operationMethod && arrayPlugin?.isMutatingArrayMethod(\n      state.operationMethod\n    ) && isArrayIndex(prop)) {\n      return value;\n    }\n    if (value === peek(state.base_, prop)) {\n      prepareCopy(state);\n      const childKey = state.type_ === 1 /* Array */ ? +prop : prop;\n      const childDraft = createProxy(state.scope_, value, state, childKey);\n      return state.copy_[childKey] = childDraft;\n    }\n    return value;\n  },\n  has(state, prop) {\n    return prop in latest(state);\n  },\n  ownKeys(state) {\n    return Reflect.ownKeys(latest(state));\n  },\n  set(state, prop, value) {\n    const desc = getDescriptorFromProto(latest(state), prop);\n    if (desc?.set) {\n      desc.set.call(state.draft_, value);\n      return true;\n    }\n    if (!state.modified_) {\n      const current2 = peek(latest(state), prop);\n      const currentState = current2?.[DRAFT_STATE];\n      if (currentState && currentState.base_ === value) {\n        state.copy_[prop] = value;\n        state.assigned_.set(prop, false);\n        return true;\n      }\n      if (is(value, current2) && (value !== void 0 || has(state.base_, prop, state.type_)))\n        return true;\n      prepareCopy(state);\n      markChanged(state);\n    }\n    if (state.copy_[prop] === value && // special case: handle new props with value 'undefined'\n    (value !== void 0 || prop in state.copy_) || // special case: NaN\n    Number.isNaN(value) && Number.isNaN(state.copy_[prop]))\n      return true;\n    state.copy_[prop] = value;\n    state.assigned_.set(prop, true);\n    handleCrossReference(state, prop, value);\n    return true;\n  },\n  deleteProperty(state, prop) {\n    prepareCopy(state);\n    if (peek(state.base_, prop) !== void 0 || prop in state.base_) {\n      state.assigned_.set(prop, false);\n      markChanged(state);\n    } else {\n      state.assigned_.delete(prop);\n    }\n    if (state.copy_) {\n      delete state.copy_[prop];\n    }\n    return true;\n  },\n  // Note: We never coerce `desc.value` into an Immer draft, because we can't make\n  // the same guarantee in ES5 mode.\n  getOwnPropertyDescriptor(state, prop) {\n    const owner = latest(state);\n    const desc = Reflect.getOwnPropertyDescriptor(owner, prop);\n    if (!desc)\n      return desc;\n    return {\n      [WRITABLE]: true,\n      [CONFIGURABLE]: state.type_ !== 1 /* Array */ || prop !== \"length\",\n      [ENUMERABLE]: desc[ENUMERABLE],\n      [VALUE]: owner[prop]\n    };\n  },\n  defineProperty() {\n    die(11);\n  },\n  getPrototypeOf(state) {\n    return getPrototypeOf(state.base_);\n  },\n  setPrototypeOf() {\n    die(12);\n  }\n};\nvar arrayTraps = {};\nfor (let key in objectTraps) {\n  let fn = objectTraps[key];\n  arrayTraps[key] = function() {\n    const args = arguments;\n    args[0] = args[0][0];\n    return fn.apply(this, args);\n  };\n}\narrayTraps.deleteProperty = function(state, prop) {\n  if (process.env.NODE_ENV !== \"production\" && isNaN(parseInt(prop)))\n    die(13);\n  return arrayTraps.set.call(this, state, prop, void 0);\n};\narrayTraps.set = function(state, prop, value) {\n  if (process.env.NODE_ENV !== \"production\" && prop !== \"length\" && isNaN(parseInt(prop)))\n    die(14);\n  return objectTraps.set.call(this, state[0], prop, value, state[0]);\n};\nfunction peek(draft, prop) {\n  const state = draft[DRAFT_STATE];\n  const source = state ? latest(state) : draft;\n  return source[prop];\n}\nfunction readPropFromProto(state, source, prop) {\n  const desc = getDescriptorFromProto(source, prop);\n  return desc ? VALUE in desc ? desc[VALUE] : (\n    // This is a very special case, if the prop is a getter defined by the\n    // prototype, we should invoke it with the draft as context!\n    desc.get?.call(state.draft_)\n  ) : void 0;\n}\nfunction getDescriptorFromProto(source, prop) {\n  if (!(prop in source))\n    return void 0;\n  let proto = getPrototypeOf(source);\n  while (proto) {\n    const desc = Object.getOwnPropertyDescriptor(proto, prop);\n    if (desc)\n      return desc;\n    proto = getPrototypeOf(proto);\n  }\n  return void 0;\n}\nfunction markChanged(state) {\n  if (!state.modified_) {\n    state.modified_ = true;\n    if (state.parent_) {\n      markChanged(state.parent_);\n    }\n  }\n}\nfunction prepareCopy(state) {\n  if (!state.copy_) {\n    state.assigned_ = /* @__PURE__ */ new Map();\n    state.copy_ = shallowCopy(\n      state.base_,\n      state.scope_.immer_.useStrictShallowCopy_\n    );\n  }\n}\n\n// src/core/immerClass.ts\nvar Immer2 = class {\n  constructor(config) {\n    this.autoFreeze_ = true;\n    this.useStrictShallowCopy_ = false;\n    this.useStrictIteration_ = false;\n    /**\n     * The `produce` function takes a value and a \"recipe function\" (whose\n     * return value often depends on the base state). The recipe function is\n     * free to mutate its first argument however it wants. All mutations are\n     * only ever applied to a __copy__ of the base state.\n     *\n     * Pass only a function to create a \"curried producer\" which relieves you\n     * from passing the recipe function every time.\n     *\n     * Only plain objects and arrays are made mutable. All other objects are\n     * considered uncopyable.\n     *\n     * Note: This function is __bound__ to its `Immer` instance.\n     *\n     * @param {any} base - the initial state\n     * @param {Function} recipe - function that receives a proxy of the base state as first argument and which can be freely modified\n     * @param {Function} patchListener - optional function that will be called with all the patches produced here\n     * @returns {any} a new state, or the initial state if nothing was modified\n     */\n    this.produce = (base, recipe, patchListener) => {\n      if (isFunction(base) && !isFunction(recipe)) {\n        const defaultBase = recipe;\n        recipe = base;\n        const self = this;\n        return function curriedProduce(base2 = defaultBase, ...args) {\n          return self.produce(base2, (draft) => recipe.call(this, draft, ...args));\n        };\n      }\n      if (!isFunction(recipe))\n        die(6);\n      if (patchListener !== void 0 && !isFunction(patchListener))\n        die(7);\n      let result;\n      if (isDraftable(base)) {\n        const scope = enterScope(this);\n        const proxy = createProxy(scope, base, void 0);\n        let hasError = true;\n        try {\n          result = recipe(proxy);\n          hasError = false;\n        } finally {\n          if (hasError)\n            revokeScope(scope);\n          else\n            leaveScope(scope);\n        }\n        usePatchesInScope(scope, patchListener);\n        return processResult(result, scope);\n      } else if (!base || !isObjectish(base)) {\n        result = recipe(base);\n        if (result === void 0)\n          result = base;\n        if (result === NOTHING)\n          result = void 0;\n        if (this.autoFreeze_)\n          freeze(result, true);\n        if (patchListener) {\n          const p = [];\n          const ip = [];\n          getPlugin(PluginPatches).generateReplacementPatches_(base, result, {\n            patches_: p,\n            inversePatches_: ip\n          });\n          patchListener(p, ip);\n        }\n        return result;\n      } else\n        die(1, base);\n    };\n    this.produceWithPatches = (base, recipe) => {\n      if (isFunction(base)) {\n        return (state, ...args) => this.produceWithPatches(state, (draft) => base(draft, ...args));\n      }\n      let patches, inversePatches;\n      const result = this.produce(base, recipe, (p, ip) => {\n        patches = p;\n        inversePatches = ip;\n      });\n      return [result, patches, inversePatches];\n    };\n    if (isBoolean(config?.autoFreeze))\n      this.setAutoFreeze(config.autoFreeze);\n    if (isBoolean(config?.useStrictShallowCopy))\n      this.setUseStrictShallowCopy(config.useStrictShallowCopy);\n    if (isBoolean(config?.useStrictIteration))\n      this.setUseStrictIteration(config.useStrictIteration);\n  }\n  createDraft(base) {\n    if (!isDraftable(base))\n      die(8);\n    if (isDraft(base))\n      base = current(base);\n    const scope = enterScope(this);\n    const proxy = createProxy(scope, base, void 0);\n    proxy[DRAFT_STATE].isManual_ = true;\n    leaveScope(scope);\n    return proxy;\n  }\n  finishDraft(draft, patchListener) {\n    const state = draft && draft[DRAFT_STATE];\n    if (!state || !state.isManual_)\n      die(9);\n    const { scope_: scope } = state;\n    usePatchesInScope(scope, patchListener);\n    return processResult(void 0, scope);\n  }\n  /**\n   * Pass true to automatically freeze all copies created by Immer.\n   *\n   * By default, auto-freezing is enabled.\n   */\n  setAutoFreeze(value) {\n    this.autoFreeze_ = value;\n  }\n  /**\n   * Pass true to enable strict shallow copy.\n   *\n   * By default, immer does not copy the object descriptors such as getter, setter and non-enumrable properties.\n   */\n  setUseStrictShallowCopy(value) {\n    this.useStrictShallowCopy_ = value;\n  }\n  /**\n   * Pass false to use faster iteration that skips non-enumerable properties\n   * but still handles symbols for compatibility.\n   *\n   * By default, strict iteration is enabled (includes all own properties).\n   */\n  setUseStrictIteration(value) {\n    this.useStrictIteration_ = value;\n  }\n  shouldUseStrictIteration() {\n    return this.useStrictIteration_;\n  }\n  applyPatches(base, patches) {\n    let i;\n    for (i = patches.length - 1; i >= 0; i--) {\n      const patch = patches[i];\n      if (patch.path.length === 0 && patch.op === \"replace\") {\n        base = patch.value;\n        break;\n      }\n    }\n    if (i > -1) {\n      patches = patches.slice(i + 1);\n    }\n    const applyPatchesImpl = getPlugin(PluginPatches).applyPatches_;\n    if (isDraft(base)) {\n      return applyPatchesImpl(base, patches);\n    }\n    return this.produce(\n      base,\n      (draft) => applyPatchesImpl(draft, patches)\n    );\n  }\n};\nfunction createProxy(rootScope, value, parent, key) {\n  const [draft, state] = isMap(value) ? getPlugin(PluginMapSet).proxyMap_(value, parent) : isSet(value) ? getPlugin(PluginMapSet).proxySet_(value, parent) : createProxyProxy(value, parent);\n  const scope = parent?.scope_ ?? getCurrentScope();\n  scope.drafts_.push(draft);\n  state.callbacks_ = parent?.callbacks_ ?? [];\n  state.key_ = key;\n  if (parent && key !== void 0) {\n    registerChildFinalizationCallback(parent, state, key);\n  } else {\n    state.callbacks_.push(function rootDraftCleanup(rootScope2) {\n      rootScope2.mapSetPlugin_?.fixSetContents(state);\n      const { patchPlugin_ } = rootScope2;\n      if (state.modified_ && patchPlugin_) {\n        patchPlugin_.generatePatches_(state, [], rootScope2);\n      }\n    });\n  }\n  return draft;\n}\n\n// src/core/current.ts\nfunction current(value) {\n  if (!isDraft(value))\n    die(10, value);\n  return currentImpl(value);\n}\nfunction currentImpl(value) {\n  if (!isDraftable(value) || isFrozen(value))\n    return value;\n  const state = value[DRAFT_STATE];\n  let copy;\n  let strict = true;\n  if (state) {\n    if (!state.modified_)\n      return state.base_;\n    state.finalized_ = true;\n    copy = shallowCopy(value, state.scope_.immer_.useStrictShallowCopy_);\n    strict = state.scope_.immer_.shouldUseStrictIteration();\n  } else {\n    copy = shallowCopy(value, true);\n  }\n  each(\n    copy,\n    (key, childValue) => {\n      set(copy, key, currentImpl(childValue));\n    },\n    strict\n  );\n  if (state) {\n    state.finalized_ = false;\n  }\n  return copy;\n}\n\n// src/plugins/patches.ts\nfunction enablePatches() {\n  const errorOffset = 16;\n  if (process.env.NODE_ENV !== \"production\") {\n    errors.push(\n      'Sets cannot have \"replace\" patches.',\n      function(op) {\n        return \"Unsupported patch operation: \" + op;\n      },\n      function(path) {\n        return \"Cannot apply patch, path doesn't resolve: \" + path;\n      },\n      \"Patching reserved attributes like __proto__, prototype and constructor is not allowed\"\n    );\n  }\n  function getPath(state, path = []) {\n    if (state.key_ !== void 0) {\n      const parentCopy = state.parent_.copy_ ?? state.parent_.base_;\n      const proxyDraft = getProxyDraft(get(parentCopy, state.key_));\n      const valueAtKey = get(parentCopy, state.key_);\n      if (valueAtKey === void 0) {\n        return null;\n      }\n      if (valueAtKey !== state.draft_ && valueAtKey !== state.base_ && valueAtKey !== state.copy_) {\n        return null;\n      }\n      if (proxyDraft != null && proxyDraft.base_ !== state.base_) {\n        return null;\n      }\n      const isSet2 = state.parent_.type_ === 3 /* Set */;\n      let key;\n      if (isSet2) {\n        const setParent = state.parent_;\n        key = Array.from(setParent.drafts_.keys()).indexOf(state.key_);\n      } else {\n        key = state.key_;\n      }\n      if (!(isSet2 && parentCopy.size > key || has(parentCopy, key))) {\n        return null;\n      }\n      path.push(key);\n    }\n    if (state.parent_) {\n      return getPath(state.parent_, path);\n    }\n    path.reverse();\n    try {\n      resolvePath(state.copy_, path);\n    } catch (e) {\n      return null;\n    }\n    return path;\n  }\n  function resolvePath(base, path) {\n    let current2 = base;\n    for (let i = 0; i < path.length - 1; i++) {\n      const key = path[i];\n      current2 = get(current2, key);\n      if (!isObjectish(current2) || current2 === null) {\n        throw new Error(`Cannot resolve path at '${path.join(\"/\")}'`);\n      }\n    }\n    return current2;\n  }\n  const REPLACE = \"replace\";\n  const ADD = \"add\";\n  const REMOVE = \"remove\";\n  function generatePatches_(state, basePath, scope) {\n    if (state.scope_.processedForPatches_.has(state)) {\n      return;\n    }\n    state.scope_.processedForPatches_.add(state);\n    const { patches_, inversePatches_ } = scope;\n    switch (state.type_) {\n      case 0 /* Object */:\n      case 2 /* Map */:\n        return generatePatchesFromAssigned(\n          state,\n          basePath,\n          patches_,\n          inversePatches_\n        );\n      case 1 /* Array */:\n        return generateArrayPatches(\n          state,\n          basePath,\n          patches_,\n          inversePatches_\n        );\n      case 3 /* Set */:\n        return generateSetPatches(\n          state,\n          basePath,\n          patches_,\n          inversePatches_\n        );\n    }\n  }\n  function generateArrayPatches(state, basePath, patches, inversePatches) {\n    let { base_, assigned_ } = state;\n    let copy_ = state.copy_;\n    if (copy_.length < base_.length) {\n      ;\n      [base_, copy_] = [copy_, base_];\n      [patches, inversePatches] = [inversePatches, patches];\n    }\n    const allReassigned = state.allIndicesReassigned_ === true;\n    for (let i = 0; i < base_.length; i++) {\n      const copiedItem = copy_[i];\n      const baseItem = base_[i];\n      const isAssigned = allReassigned || assigned_?.get(i.toString());\n      if (isAssigned && copiedItem !== baseItem) {\n        const childState = copiedItem?.[DRAFT_STATE];\n        if (childState && childState.modified_) {\n          continue;\n        }\n        const path = basePath.concat([i]);\n        patches.push({\n          op: REPLACE,\n          path,\n          // Need to maybe clone it, as it can in fact be the original value\n          // due to the base/copy inversion at the start of this function\n          value: clonePatchValueIfNeeded(copiedItem)\n        });\n        inversePatches.push({\n          op: REPLACE,\n          path,\n          value: clonePatchValueIfNeeded(baseItem)\n        });\n      }\n    }\n    for (let i = base_.length; i < copy_.length; i++) {\n      const path = basePath.concat([i]);\n      patches.push({\n        op: ADD,\n        path,\n        // Need to maybe clone it, as it can in fact be the original value\n        // due to the base/copy inversion at the start of this function\n        value: clonePatchValueIfNeeded(copy_[i])\n      });\n    }\n    for (let i = copy_.length - 1; base_.length <= i; --i) {\n      const path = basePath.concat([i]);\n      inversePatches.push({\n        op: REMOVE,\n        path\n      });\n    }\n  }\n  function generatePatchesFromAssigned(state, basePath, patches, inversePatches) {\n    const { base_, copy_, type_ } = state;\n    each(state.assigned_, (key, assignedValue) => {\n      const origValue = get(base_, key, type_);\n      const value = get(copy_, key, type_);\n      const op = !assignedValue ? REMOVE : has(base_, key) ? REPLACE : ADD;\n      if (origValue === value && op === REPLACE)\n        return;\n      const path = basePath.concat(key);\n      patches.push(\n        op === REMOVE ? { op, path } : { op, path, value: clonePatchValueIfNeeded(value) }\n      );\n      inversePatches.push(\n        op === ADD ? { op: REMOVE, path } : op === REMOVE ? { op: ADD, path, value: clonePatchValueIfNeeded(origValue) } : { op: REPLACE, path, value: clonePatchValueIfNeeded(origValue) }\n      );\n    });\n  }\n  function generateSetPatches(state, basePath, patches, inversePatches) {\n    let { base_, copy_ } = state;\n    let i = 0;\n    base_.forEach((value) => {\n      if (!copy_.has(value)) {\n        const path = basePath.concat([i]);\n        patches.push({\n          op: REMOVE,\n          path,\n          value\n        });\n        inversePatches.unshift({\n          op: ADD,\n          path,\n          value\n        });\n      }\n      i++;\n    });\n    i = 0;\n    copy_.forEach((value) => {\n      if (!base_.has(value)) {\n        const path = basePath.concat([i]);\n        patches.push({\n          op: ADD,\n          path,\n          value\n        });\n        inversePatches.unshift({\n          op: REMOVE,\n          path,\n          value\n        });\n      }\n      i++;\n    });\n  }\n  function generateReplacementPatches_(baseValue, replacement, scope) {\n    const { patches_, inversePatches_ } = scope;\n    patches_.push({\n      op: REPLACE,\n      path: [],\n      value: replacement === NOTHING ? void 0 : replacement\n    });\n    inversePatches_.push({\n      op: REPLACE,\n      path: [],\n      value: baseValue\n    });\n  }\n  function applyPatches_(draft, patches) {\n    patches.forEach((patch) => {\n      const { path, op } = patch;\n      let base = draft;\n      for (let i = 0; i < path.length - 1; i++) {\n        const parentType = getArchtype(base);\n        let p = path[i];\n        if (typeof p !== \"string\" && typeof p !== \"number\") {\n          p = \"\" + p;\n        }\n        if ((parentType === 0 /* Object */ || parentType === 1 /* Array */) && (p === \"__proto__\" || p === CONSTRUCTOR))\n          die(errorOffset + 3);\n        if (isFunction(base) && p === PROTOTYPE)\n          die(errorOffset + 3);\n        base = get(base, p);\n        if (!isObjectish(base))\n          die(errorOffset + 2, path.join(\"/\"));\n      }\n      const type = getArchtype(base);\n      const value = deepClonePatchValue(patch.value);\n      const key = path[path.length - 1];\n      switch (op) {\n        case REPLACE:\n          switch (type) {\n            case 2 /* Map */:\n              return base.set(key, value);\n            case 3 /* Set */:\n              die(errorOffset);\n            default:\n              return base[key] = value;\n          }\n        case ADD:\n          switch (type) {\n            case 1 /* Array */:\n              return key === \"-\" ? base.push(value) : base.splice(key, 0, value);\n            case 2 /* Map */:\n              return base.set(key, value);\n            case 3 /* Set */:\n              return base.add(value);\n            default:\n              return base[key] = value;\n          }\n        case REMOVE:\n          switch (type) {\n            case 1 /* Array */:\n              return base.splice(key, 1);\n            case 2 /* Map */:\n              return base.delete(key);\n            case 3 /* Set */:\n              return base.delete(patch.value);\n            default:\n              return delete base[key];\n          }\n        default:\n          die(errorOffset + 1, op);\n      }\n    });\n    return draft;\n  }\n  function deepClonePatchValue(obj) {\n    if (!isDraftable(obj))\n      return obj;\n    if (isArray(obj))\n      return obj.map(deepClonePatchValue);\n    if (isMap(obj))\n      return new Map(\n        Array.from(obj.entries()).map(([k, v]) => [k, deepClonePatchValue(v)])\n      );\n    if (isSet(obj))\n      return new Set(Array.from(obj).map(deepClonePatchValue));\n    const cloned = Object.create(getPrototypeOf(obj));\n    for (const key in obj)\n      cloned[key] = deepClonePatchValue(obj[key]);\n    if (has(obj, DRAFTABLE))\n      cloned[DRAFTABLE] = obj[DRAFTABLE];\n    return cloned;\n  }\n  function clonePatchValueIfNeeded(obj) {\n    if (isDraft(obj)) {\n      return deepClonePatchValue(obj);\n    } else\n      return obj;\n  }\n  loadPlugin(PluginPatches, {\n    applyPatches_,\n    generatePatches_,\n    generateReplacementPatches_,\n    getPath\n  });\n}\n\n// src/plugins/mapset.ts\nfunction enableMapSet() {\n  class DraftMap extends Map {\n    constructor(target, parent) {\n      super();\n      this[DRAFT_STATE] = {\n        type_: 2 /* Map */,\n        parent_: parent,\n        scope_: parent ? parent.scope_ : getCurrentScope(),\n        modified_: false,\n        finalized_: false,\n        copy_: void 0,\n        assigned_: void 0,\n        base_: target,\n        draft_: this,\n        isManual_: false,\n        revoked_: false,\n        callbacks_: []\n      };\n    }\n    get size() {\n      return latest(this[DRAFT_STATE]).size;\n    }\n    has(key) {\n      return latest(this[DRAFT_STATE]).has(key);\n    }\n    set(key, value) {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (!latest(state).has(key) || latest(state).get(key) !== value) {\n        prepareMapCopy(state);\n        markChanged(state);\n        state.assigned_.set(key, true);\n        state.copy_.set(key, value);\n        state.assigned_.set(key, true);\n        handleCrossReference(state, key, value);\n      }\n      return this;\n    }\n    delete(key) {\n      if (!this.has(key)) {\n        return false;\n      }\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      prepareMapCopy(state);\n      markChanged(state);\n      if (state.base_.has(key)) {\n        state.assigned_.set(key, false);\n      } else {\n        state.assigned_.delete(key);\n      }\n      state.copy_.delete(key);\n      return true;\n    }\n    clear() {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (latest(state).size) {\n        prepareMapCopy(state);\n        markChanged(state);\n        state.assigned_ = /* @__PURE__ */ new Map();\n        each(state.base_, (key) => {\n          state.assigned_.set(key, false);\n        });\n        state.copy_.clear();\n      }\n    }\n    forEach(cb, thisArg) {\n      const state = this[DRAFT_STATE];\n      latest(state).forEach((_value, key, _map) => {\n        cb.call(thisArg, this.get(key), key, this);\n      });\n    }\n    get(key) {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      const value = latest(state).get(key);\n      if (state.finalized_ || !isDraftable(value)) {\n        return value;\n      }\n      if (value !== state.base_.get(key)) {\n        return value;\n      }\n      const draft = createProxy(state.scope_, value, state, key);\n      prepareMapCopy(state);\n      state.copy_.set(key, draft);\n      return draft;\n    }\n    keys() {\n      return latest(this[DRAFT_STATE]).keys();\n    }\n    values() {\n      const iterator = this.keys();\n      return {\n        [Symbol.iterator]: () => this.values(),\n        next: () => {\n          const r = iterator.next();\n          if (r.done)\n            return r;\n          const value = this.get(r.value);\n          return {\n            done: false,\n            value\n          };\n        }\n      };\n    }\n    entries() {\n      const iterator = this.keys();\n      return {\n        [Symbol.iterator]: () => this.entries(),\n        next: () => {\n          const r = iterator.next();\n          if (r.done)\n            return r;\n          const value = this.get(r.value);\n          return {\n            done: false,\n            value: [r.value, value]\n          };\n        }\n      };\n    }\n    [(DRAFT_STATE, Symbol.iterator)]() {\n      return this.entries();\n    }\n  }\n  function proxyMap_(target, parent) {\n    const map = new DraftMap(target, parent);\n    return [map, map[DRAFT_STATE]];\n  }\n  function prepareMapCopy(state) {\n    if (!state.copy_) {\n      state.assigned_ = /* @__PURE__ */ new Map();\n      state.copy_ = new Map(state.base_);\n    }\n  }\n  class DraftSet extends Set {\n    constructor(target, parent) {\n      super();\n      this[DRAFT_STATE] = {\n        type_: 3 /* Set */,\n        parent_: parent,\n        scope_: parent ? parent.scope_ : getCurrentScope(),\n        modified_: false,\n        finalized_: false,\n        copy_: void 0,\n        base_: target,\n        draft_: this,\n        drafts_: /* @__PURE__ */ new Map(),\n        revoked_: false,\n        isManual_: false,\n        assigned_: void 0,\n        callbacks_: []\n      };\n    }\n    get size() {\n      return latest(this[DRAFT_STATE]).size;\n    }\n    has(value) {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (!state.copy_) {\n        return state.base_.has(value);\n      }\n      if (state.copy_.has(value))\n        return true;\n      if (state.drafts_.has(value) && state.copy_.has(state.drafts_.get(value)))\n        return true;\n      return false;\n    }\n    add(value) {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (!this.has(value)) {\n        prepareSetCopy(state);\n        markChanged(state);\n        state.copy_.add(value);\n        handleCrossReference(state, value, value);\n      }\n      return this;\n    }\n    delete(value) {\n      if (!this.has(value)) {\n        return false;\n      }\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      prepareSetCopy(state);\n      markChanged(state);\n      return state.copy_.delete(value) || (state.drafts_.has(value) ? state.copy_.delete(state.drafts_.get(value)) : (\n        /* istanbul ignore next */\n        false\n      ));\n    }\n    clear() {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      if (latest(state).size) {\n        prepareSetCopy(state);\n        markChanged(state);\n        state.copy_.clear();\n      }\n    }\n    values() {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      prepareSetCopy(state);\n      return state.copy_.values();\n    }\n    entries() {\n      const state = this[DRAFT_STATE];\n      assertUnrevoked(state);\n      prepareSetCopy(state);\n      return state.copy_.entries();\n    }\n    keys() {\n      return this.values();\n    }\n    [(DRAFT_STATE, Symbol.iterator)]() {\n      return this.values();\n    }\n    forEach(cb, thisArg) {\n      const iterator = this.values();\n      let result = iterator.next();\n      while (!result.done) {\n        cb.call(thisArg, result.value, result.value, this);\n        result = iterator.next();\n      }\n    }\n  }\n  function proxySet_(target, parent) {\n    const set2 = new DraftSet(target, parent);\n    return [set2, set2[DRAFT_STATE]];\n  }\n  function prepareSetCopy(state) {\n    if (!state.copy_) {\n      state.copy_ = /* @__PURE__ */ new Set();\n      state.base_.forEach((value) => {\n        if (isDraftable(value)) {\n          const draft = createProxy(state.scope_, value, state, value);\n          state.drafts_.set(value, draft);\n          state.copy_.add(draft);\n        } else {\n          state.copy_.add(value);\n        }\n      });\n    }\n  }\n  function assertUnrevoked(state) {\n    if (state.revoked_)\n      die(3, JSON.stringify(latest(state)));\n  }\n  function fixSetContents(target) {\n    if (target.type_ === 3 /* Set */ && target.copy_) {\n      const copy = new Set(target.copy_);\n      target.copy_.clear();\n      copy.forEach((value) => {\n        target.copy_.add(getValue(value));\n      });\n    }\n  }\n  loadPlugin(PluginMapSet, { proxyMap_, proxySet_, fixSetContents });\n}\n\n// src/plugins/arrayMethods.ts\nfunction enableArrayMethods() {\n  const SHIFTING_METHODS = /* @__PURE__ */ new Set([\"shift\", \"unshift\"]);\n  const QUEUE_METHODS = /* @__PURE__ */ new Set([\"push\", \"pop\"]);\n  const RESULT_RETURNING_METHODS = /* @__PURE__ */ new Set([\n    ...QUEUE_METHODS,\n    ...SHIFTING_METHODS\n  ]);\n  const REORDERING_METHODS = /* @__PURE__ */ new Set([\"reverse\", \"sort\"]);\n  const MUTATING_METHODS = /* @__PURE__ */ new Set([\n    ...RESULT_RETURNING_METHODS,\n    ...REORDERING_METHODS,\n    \"splice\"\n  ]);\n  const FIND_METHODS = /* @__PURE__ */ new Set([\"find\", \"findLast\"]);\n  const NON_MUTATING_METHODS = /* @__PURE__ */ new Set([\n    \"filter\",\n    \"slice\",\n    \"concat\",\n    \"flat\",\n    ...FIND_METHODS,\n    \"findIndex\",\n    \"findLastIndex\",\n    \"some\",\n    \"every\",\n    \"indexOf\",\n    \"lastIndexOf\",\n    \"includes\",\n    \"join\",\n    \"toString\",\n    \"toLocaleString\"\n  ]);\n  function isMutatingArrayMethod(method) {\n    return MUTATING_METHODS.has(method);\n  }\n  function isNonMutatingArrayMethod(method) {\n    return NON_MUTATING_METHODS.has(method);\n  }\n  function isArrayOperationMethod(method) {\n    return isMutatingArrayMethod(method) || isNonMutatingArrayMethod(method);\n  }\n  function enterOperation(state, method) {\n    state.operationMethod = method;\n  }\n  function exitOperation(state) {\n    state.operationMethod = void 0;\n  }\n  function executeArrayMethod(state, operation, markLength = true) {\n    prepareCopy(state);\n    const result = operation();\n    markChanged(state);\n    if (markLength)\n      state.assigned_.set(\"length\", true);\n    return result;\n  }\n  function markAllIndicesReassigned(state) {\n    state.allIndicesReassigned_ = true;\n  }\n  function normalizeSliceIndex(index, length) {\n    if (index < 0) {\n      return Math.max(length + index, 0);\n    }\n    return Math.min(index, length);\n  }\n  function handleInsertedValues(state, startIndex, values) {\n    for (let i = 0; i < values.length; i++) {\n      const index = startIndex + i;\n      state.assigned_.set(index, true);\n      handleCrossReference(state, index, values[i]);\n    }\n  }\n  function handleSimpleOperation(state, method, args) {\n    return executeArrayMethod(state, () => {\n      const lengthBefore = state.copy_.length;\n      const result = state.copy_[method](...args);\n      if (SHIFTING_METHODS.has(method)) {\n        markAllIndicesReassigned(state);\n      }\n      if (method === \"push\" && args.length > 0) {\n        handleInsertedValues(state, lengthBefore, args);\n      } else if (method === \"unshift\" && args.length > 0) {\n        handleInsertedValues(state, 0, args);\n      }\n      return RESULT_RETURNING_METHODS.has(method) ? result : state.draft_;\n    });\n  }\n  function handleReorderingOperation(state, method, args) {\n    return executeArrayMethod(\n      state,\n      () => {\n        ;\n        state.copy_[method](...args);\n        markAllIndicesReassigned(state);\n        return state.draft_;\n      },\n      false\n    );\n  }\n  function createMethodInterceptor(state, originalMethod) {\n    return function interceptedMethod(...args) {\n      const method = originalMethod;\n      enterOperation(state, method);\n      try {\n        if (isMutatingArrayMethod(method)) {\n          if (RESULT_RETURNING_METHODS.has(method)) {\n            return handleSimpleOperation(state, method, args);\n          }\n          if (REORDERING_METHODS.has(method)) {\n            return handleReorderingOperation(state, method, args);\n          }\n          if (method === \"splice\") {\n            const res = executeArrayMethod(\n              state,\n              () => state.copy_.splice(...args)\n            );\n            markAllIndicesReassigned(state);\n            if (args.length > 2) {\n              const startIndex = normalizeSliceIndex(\n                args[0] ?? 0,\n                state.copy_.length\n              );\n              handleInsertedValues(state, startIndex, args.slice(2));\n            }\n            return res;\n          }\n        } else {\n          return handleNonMutatingOperation(state, method, args);\n        }\n      } finally {\n        exitOperation(state);\n      }\n    };\n  }\n  function handleNonMutatingOperation(state, method, args) {\n    const source = latest(state);\n    if (method === \"filter\") {\n      const predicate = args[0];\n      const result = [];\n      for (let i = 0; i < source.length; i++) {\n        if (predicate(source[i], i, source)) {\n          result.push(state.draft_[i]);\n        }\n      }\n      return result;\n    }\n    if (FIND_METHODS.has(method)) {\n      const predicate = args[0];\n      const isForward = method === \"find\";\n      const step = isForward ? 1 : -1;\n      const start = isForward ? 0 : source.length - 1;\n      for (let i = start; i >= 0 && i < source.length; i += step) {\n        if (predicate(source[i], i, source)) {\n          return state.draft_[i];\n        }\n      }\n      return void 0;\n    }\n    if (method === \"slice\") {\n      const rawStart = args[0] ?? 0;\n      const rawEnd = args[1] ?? source.length;\n      const start = normalizeSliceIndex(rawStart, source.length);\n      const end = normalizeSliceIndex(rawEnd, source.length);\n      const result = [];\n      for (let i = start; i < end; i++) {\n        result.push(state.draft_[i]);\n      }\n      return result;\n    }\n    return source[method](...args);\n  }\n  loadPlugin(PluginArrayMethods, {\n    createMethodInterceptor,\n    isArrayOperationMethod,\n    isMutatingArrayMethod\n  });\n}\n\n// src/immer.ts\nvar immer = new Immer2();\nvar produce = immer.produce;\nvar produceWithPatches = /* @__PURE__ */ immer.produceWithPatches.bind(\n  immer\n);\nvar setAutoFreeze = /* @__PURE__ */ immer.setAutoFreeze.bind(immer);\nvar setUseStrictShallowCopy = /* @__PURE__ */ immer.setUseStrictShallowCopy.bind(\n  immer\n);\nvar setUseStrictIteration = /* @__PURE__ */ immer.setUseStrictIteration.bind(\n  immer\n);\nvar applyPatches = /* @__PURE__ */ immer.applyPatches.bind(immer);\nvar createDraft = /* @__PURE__ */ immer.createDraft.bind(immer);\nvar finishDraft = /* @__PURE__ */ immer.finishDraft.bind(immer);\nvar castDraft = (value) => value;\nvar castImmutable = (value) => value;\nexport {\n  Immer2 as Immer,\n  applyPatches,\n  castDraft,\n  castImmutable,\n  createDraft,\n  current,\n  enableArrayMethods,\n  enableMapSet,\n  enablePatches,\n  finishDraft,\n  freeze,\n  DRAFTABLE as immerable,\n  isDraft,\n  isDraftable,\n  NOTHING as nothing,\n  original,\n  produce,\n  produceWithPatches,\n  setAutoFreeze,\n  setUseStrictIteration,\n  setUseStrictShallowCopy\n};\n//# sourceMappingURL=immer.mjs.map","// src/store/types.ts\nimport { Draft } from 'immer'\nimport { BehaviorSubject, Observable, Subject } from 'rxjs'\n\n/**\n * Storage types supported by the store\n */\nexport type StorageType = 'memory' | 'local' | 'session' | 'indexeddb'\n\n/**\n * Base store options\n */\nexport interface StoreOptions<T> {\n\t/** Key used for persistent storage */\n\tkey: string\n\n\t/** Storage type */\n\tstorage: StorageType\n\n\t/** Initial state */\n\tinitialState: T\n\n\t/** Enable dev tools */\n\tdevTools?: boolean\n}\n\n/**\n * Enhanced store error with type information and better context handling\n */\nexport class StoreError<T = unknown> extends Error {\n\t/** Original error that caused this store error */\n\tpublic readonly cause?: T\n\n\t/** Additional contextual information */\n\tpublic readonly context?: Record<string, unknown>\n\n\t/** Timestamp when the error occurred */\n\tpublic readonly timestamp: Date\n\n\tconstructor(message: string, cause?: T, context?: Record<string, unknown>) {\n\t\tsuper(message)\n\t\tthis.name = 'StoreError'\n\t\tthis.cause = cause\n\t\tthis.context = context\n\t\tthis.timestamp = new Date()\n\n\t\t// Capture stack trace if available\n\t\tif (Error.captureStackTrace) {\n\t\t\tError.captureStackTrace(this, StoreError)\n\t\t}\n\t}\n\n\t/**\n\t * Returns a JSON-serializable representation of the error\n\t */\n\ttoJSON(): Record<string, unknown> {\n\t\treturn {\n\t\t\tname: this.name,\n\t\t\tmessage: this.message,\n\t\t\tcause: this.cause,\n\t\t\tcontext: this.context,\n\t\t\ttimestamp: this.timestamp.toISOString(),\n\t\t\tstack: this.stack,\n\t\t}\n\t}\n}\n\n/**\n * Core store interface with improved type definitions\n */\nexport interface IStore<T extends Record<string, any>> {\n\t/** Get the current store value */\n\treadonly value: T\n\n\t/** Observable stream of store values */\n\treadonly $: BehaviorSubject<T>\n\n\t/** The default/initial value of the store */\n\treadonly defaultValue: T\n\n\t/** Whether the store is ready (loaded from storage) */\n\tready: boolean\n\n\t/** Observable stream of store errors */\n\treadonly error$: Subject<StoreError | null>\n\n\t/**\n\t * Update store value with partial data\n\t * @param value Partial data to update\n\t * @param merge Whether to merge with existing data (default: true)\n\t */\n\tset(value: Partial<T>, merge?: boolean): void\n\n\t/**\n\t * Reset store to default value\n\t */\n\tclear(): void\n\n\t/**\n\t * Replace entire store value\n\t * @param newValue New value to set\n\t */\n\treplace(newValue: T): void\n\n\t/**\n\t * Delete a specific key from the store\n\t * @param key Key to delete\n\t */\n\tdelete<K extends keyof T>(key: K): void\n\n\t/**\n\t * Clean up resources\n\t */\n\tdestroy(): void\n}\n\n/**\n * Interface for collection stores with improved typing\n */\nexport interface ICollectionStore<T> {\n\t/** Get the current collection value */\n\treadonly value: Map<string, T>\n\n\t/** Observable stream of collection values */\n\treadonly $: BehaviorSubject<Map<string, T>>\n\n\t/** The default/initial value of the collection */\n\treadonly defaultValue: Map<string, T>\n\n\t/** Whether the store is ready (loaded from storage) */\n\tready: boolean\n\n\t/** Observable stream of store errors */\n\treadonly error$: Observable<StoreError | null>\n\n\t/**\n\t * Set a value in the collection\n\t * @param key Item key\n\t * @param value Item value\n\t */\n\tset<V = T>(key: string, value: V): void\n\n\t/**\n\t * Delete an item from the collection\n\t * @param key Item key to delete\n\t */\n\tdelete(key: string): void\n\n\t/**\n\t * Clear all items from the collection\n\t */\n\tclear(): void\n\n\t/**\n\t * Replace the entire collection\n\t * @param newValue New collection value\n\t */\n\treplace(newValue: Map<string, T>): void\n\n\t/**\n\t * Clean up resources\n\t */\n\tdestroy(): void\n}\n\n/**\n * Interface for a storage manager\n */\nexport interface IStorageManager<T> {\n\t/**\n\t * Load data from storage\n\t * @returns Promise resolving to stored data or null\n\t */\n\tload(): Promise<T | null>\n\n\t/**\n\t * Save data to storage\n\t * @param state Data to save\n\t */\n\tsave(state: T): Promise<void>\n\n\t/**\n\t * Clear data from storage\n\t */\n\tclear(): Promise<void>\n}\n\n/**\n * Factory function type for creating stores\n */\nexport type StoreFactory = <T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n) => IStore<T>\n\n/**\n * Factory function type for creating collection stores\n */\nexport type CollectionStoreFactory = <T>(\n\tinitialData: Map<string, T>,\n\tstorage: StorageType,\n\tkey: string,\n) => ICollectionStore<T>\n// Add this to your src/store/types.ts file\n\n/**\n * Interface for array stores with improved typing\n */\nexport interface IArrayStore<T> {\n\t/** Get the current array value */\n\treadonly value: T[]\n\n\t/** Observable stream of array values */\n\treadonly $: BehaviorSubject<T[]>\n\n\t/** The default/initial value of the array */\n\treadonly defaultValue: T[]\n\n\t/** Whether the store is ready (loaded from storage) */\n\tready: boolean\n\n\t/** Observable stream of store errors */\n\treadonly error$: Observable<StoreError | null>\n\n\t/**\n\t * Add item(s) to the end of the array\n\t * @param items Items to add\n\t */\n\tpush(...items: T[]): void\n\n\t/**\n\t * Remove and return the last item from the array\n\t * @returns The removed item or undefined if the array was empty\n\t */\n\tpop(): T | undefined\n\n\t/**\n\t * Add item(s) to the beginning of the array\n\t * @param items Items to add\n\t */\n\tunshift(...items: T[]): void\n\n\t/**\n\t * Remove and return the first item from the array\n\t * @returns The removed item or undefined if the array was empty\n\t */\n\tshift(): T | undefined\n\n\t/**\n\t * Update an item at a specific index\n\t * @param index The index to update\n\t * @param value The new value\n\t */\n\tset(index: number, value: T): void\n\n\t/**\n\t * Get the item at a specific index\n\t * @param index The index to get\n\t * @returns The item or undefined if index is out of bounds\n\t */\n\tget(index: number): T | undefined\n\n\t/**\n\t * Remove items from the array and optionally insert new ones\n\t * @param start The start index\n\t * @param deleteCount The number of items to delete\n\t * @param items Items to insert\n\t * @returns The removed items\n\t */\n\tsplice(start: number, deleteCount?: number, ...items: T[]): T[]\n\n\t/**\n\t * Remove an item by value (first occurrence)\n\t * @param item The item to remove\n\t * @param compareFn Optional function to compare items\n\t * @returns True if the item was found and removed\n\t */\n\tremove(item: T, compareFn?: (a: T, b: T) => boolean): boolean\n\n\t/**\n\t * Replace the entire array\n\t * @param newArray The new array\n\t */\n\treplace(newArray: T[]): void\n\n\t/**\n\t * Filter items in the array\n\t * @param predicate Function to test each item\n\t */\n\tfilter(predicate: (value: T, index: number, array: T[]) => boolean): void\n\n\t/**\n\t * Map over the array and transform items\n\t * @param mapper Function to transform each item\n\t * @returns Array of transformed items\n\t */\n\tmap<U>(mapper: (value: T, index: number, array: T[]) => U): U[]\n\n\t/**\n\t * Sort the array in place\n\t * @param compareFn Optional function to determine sort order\n\t */\n\tsort(compareFn?: (a: T, b: T) => number): void\n\n\t/**\n\t * Update a specific item using a callback function\n\t * @param index The index to update\n\t * @param updater Function that can modify the item\n\t */\n\tupdate(index: number, updater: (item: Draft<T>) => void): void\n\n\t/**\n\t * Clear all items from the array\n\t */\n\tclear(): void\n\n\t/**\n\t * Clean up resources\n\t */\n\tdestroy(): void\n}\n\n/**\n * Factory function type for creating array stores\n */\nexport type ArrayStoreFactory = <T>(initialData: T[], storage: StorageType, key: string) => IArrayStore<T>\n","import { IStorageManager, StorageType, StoreError } from './types'\n\n/**\n * Custom JSON replacer to handle Map and Set serialization\n *\n * LIMITATIONS:\n * - Only supports Maps with string/number/primitive keys\n * - Object keys will be stringified and may collide (e.g., {id: 1} and {id: 2} both become \"[object Object]\")\n * - Circular references are not supported (JSON.stringify limitation)\n *\n * @example\n * ```typescript\n * // ✅ Supported\n * new Map([['key', 'value'], [123, 'number-key']])\n *\n * // ❌ Not supported (object keys will become strings)\n * new Map([[{id: 1}, 'value']])\n * ```\n */\nfunction mapSetReplacer(_key: string, value: unknown): unknown {\n\tif (value instanceof Map) {\n\t\treturn {\n\t\t\t__type: 'Map',\n\t\t\tentries: Array.from(value.entries()),\n\t\t}\n\t}\n\tif (value instanceof Set) {\n\t\treturn {\n\t\t\t__type: 'Set',\n\t\t\tvalues: Array.from(value.values()),\n\t\t}\n\t}\n\treturn value\n}\n\n/**\n * Custom JSON reviver to handle Map and Set deserialization\n *\n * Includes validation to prevent malformed data or __type injection attacks.\n * Invalid structures are ignored and returned as-is.\n */\nfunction mapSetReviver(_key: string, value: unknown): unknown {\n\tif (value && typeof value === 'object' && '__type' in value) {\n\t\tconst typed = value as { __type: string; entries?: unknown[]; values?: unknown[] }\n\n\t\t// Validate and reconstruct Map\n\t\tif (typed.__type === 'Map') {\n\t\t\tif (!Array.isArray(typed.entries)) {\n\t\t\t\tconsole.warn('Invalid Map structure in storage (entries not an array), ignoring')\n\t\t\t\treturn value\n\t\t\t}\n\t\t\t// Validate all entries are [key, value] pairs\n\t\t\tconst isValid = typed.entries.every(e => Array.isArray(e) && e.length === 2)\n\t\t\tif (!isValid) {\n\t\t\t\tconsole.warn('Invalid Map structure in storage (malformed entries), ignoring')\n\t\t\t\treturn value\n\t\t\t}\n\t\t\treturn new Map(typed.entries as Iterable<readonly [unknown, unknown]>)\n\t\t}\n\n\t\t// Validate and reconstruct Set\n\t\tif (typed.__type === 'Set') {\n\t\t\tif (!Array.isArray(typed.values)) {\n\t\t\t\tconsole.warn('Invalid Set structure in storage (values not an array), ignoring')\n\t\t\t\treturn value\n\t\t\t}\n\t\t\treturn new Set(typed.values)\n\t\t}\n\n\t\t// Unknown __type marker, log warning and ignore\n\t\tconsole.warn(`Unknown __type \"${typed.__type}\" in storage, ignoring`)\n\t}\n\treturn value\n}\n\n/**\n * Memory storage manager implementation\n */\nexport class MemoryStorageManager<T> implements IStorageManager<T> {\n\tprivate data: T | null = null\n\n\tasync load(): Promise<T | null> {\n\t\treturn this.data\n\t}\n\n\tasync save(state: T): Promise<void> {\n\t\tthis.data = state\n\t}\n\n\tasync clear(): Promise<void> {\n\t\tthis.data = null\n\t}\n}\n\n/**\n * Local storage manager implementation\n */\nexport class LocalStorageManager<T> implements IStorageManager<T> {\n\tconstructor(private key: string) {}\n\n\tasync load(): Promise<T | null> {\n\t\ttry {\n\t\t\tconst data = localStorage.getItem(this.key)\n\t\t\treturn data ? JSON.parse(data, mapSetReviver) : null\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to load from localStorage (${this.key}):`, err)\n\t\t\treturn null\n\t\t}\n\t}\n\n\tasync save(state: T): Promise<void> {\n\t\ttry {\n\t\t\tlocalStorage.setItem(this.key, JSON.stringify(state, mapSetReplacer))\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to save to localStorage (${this.key}):`, err)\n\t\t\tthrow new StoreError<unknown>(`Failed to save to localStorage (${this.key})`, err)\n\t\t}\n\t}\n\n\tasync clear(): Promise<void> {\n\t\tlocalStorage.removeItem(this.key)\n\t}\n}\n\n/**\n * Session storage manager implementation\n */\nexport class SessionStorageManager<T> implements IStorageManager<T> {\n\tconstructor(private key: string) {}\n\n\tasync load(): Promise<T | null> {\n\t\ttry {\n\t\t\tconst data = sessionStorage.getItem(this.key)\n\t\t\treturn data ? JSON.parse(data, mapSetReviver) : null\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to load from sessionStorage (${this.key}):`, err)\n\t\t\treturn null\n\t\t}\n\t}\n\n\tasync save(state: T): Promise<void> {\n\t\ttry {\n\t\t\tsessionStorage.setItem(this.key, JSON.stringify(state, mapSetReplacer))\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to save to sessionStorage (${this.key}):`, err)\n\t\t\tthrow new StoreError<unknown>(`Failed to save to sessionStorage (${this.key})`, err)\n\t\t}\n\t}\n\n\tasync clear(): Promise<void> {\n\t\tsessionStorage.removeItem(this.key)\n\t}\n}\n\n/**\n * IndexedDB storage manager implementation with better error typing\n */\nexport class IndexedDBStorageManager<T> implements IStorageManager<T> {\n\tprivate static DB_NAME = 'StoreDB'\n\tprivate static STORE_NAME = 'states'\n\tprivate static DB_VERSION = 1\n\n\tconstructor(private key: string) {}\n\n\tprivate openDB(): Promise<IDBDatabase> {\n\t\treturn new Promise<IDBDatabase>((resolve, reject) => {\n\t\t\tconst request = indexedDB.open(IndexedDBStorageManager.DB_NAME, IndexedDBStorageManager.DB_VERSION)\n\n\t\t\trequest.onupgradeneeded = () => {\n\t\t\t\tconst db = request.result\n\t\t\t\tif (!db.objectStoreNames.contains(IndexedDBStorageManager.STORE_NAME)) {\n\t\t\t\t\tdb.createObjectStore(IndexedDBStorageManager.STORE_NAME)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\trequest.onsuccess = () => resolve(request.result)\n\t\t\trequest.onerror = () => reject(request.error)\n\t\t})\n\t}\n\n\tasync load(): Promise<T | null> {\n\t\ttry {\n\t\t\tconst db = await this.openDB()\n\t\t\treturn new Promise<T | null>((resolve, reject) => {\n\t\t\t\tconst transaction = db.transaction(IndexedDBStorageManager.STORE_NAME, 'readonly')\n\t\t\t\tconst store = transaction.objectStore(IndexedDBStorageManager.STORE_NAME)\n\t\t\t\tconst request = store.get(this.key)\n\n\t\t\t\trequest.onsuccess = () => {\n\t\t\t\t\tdb.close()\n\t\t\t\t\tresolve(request.result || null)\n\t\t\t\t}\n\n\t\t\t\trequest.onerror = () => {\n\t\t\t\t\tdb.close()\n\t\t\t\t\treject(request.error)\n\t\t\t\t}\n\t\t\t})\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to load from IndexedDB (${this.key}):`, err)\n\t\t\treturn null\n\t\t}\n\t}\n\n\tasync save(state: T): Promise<void> {\n\t\ttry {\n\t\t\tconst db = await this.openDB()\n\t\t\treturn new Promise<void>((resolve, reject) => {\n\t\t\t\tconst transaction = db.transaction(IndexedDBStorageManager.STORE_NAME, 'readwrite')\n\t\t\t\tconst store = transaction.objectStore(IndexedDBStorageManager.STORE_NAME)\n\t\t\t\tconst request = store.put(state, this.key)\n\n\t\t\t\trequest.onsuccess = () => {\n\t\t\t\t\tdb.close()\n\t\t\t\t\tresolve()\n\t\t\t\t}\n\n\t\t\t\trequest.onerror = () => {\n\t\t\t\t\tdb.close()\n\t\t\t\t\treject(request.error)\n\t\t\t\t}\n\t\t\t})\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to save to IndexedDB (${this.key}):`, err)\n\t\t\tthrow new StoreError<unknown>(`Failed to save to IndexedDB (${this.key})`, err)\n\t\t}\n\t}\n\n\tasync clear(): Promise<void> {\n\t\ttry {\n\t\t\tconst db = await this.openDB()\n\t\t\treturn new Promise<void>((resolve, reject) => {\n\t\t\t\tconst transaction = db.transaction(IndexedDBStorageManager.STORE_NAME, 'readwrite')\n\t\t\t\tconst store = transaction.objectStore(IndexedDBStorageManager.STORE_NAME)\n\t\t\t\tconst request = store.delete(this.key)\n\n\t\t\t\trequest.onsuccess = () => {\n\t\t\t\t\tdb.close()\n\t\t\t\t\tresolve()\n\t\t\t\t}\n\n\t\t\t\trequest.onerror = () => {\n\t\t\t\t\tdb.close()\n\t\t\t\t\treject(request.error)\n\t\t\t\t}\n\t\t\t})\n\t\t} catch (err) {\n\t\t\tconsole.error(`Failed to clear from IndexedDB (${this.key}):`, err)\n\t\t\tthrow new StoreError<unknown>(`Failed to clear from IndexedDB (${this.key})`, err)\n\t\t}\n\t}\n}\n\n/**\n * Factory function to create the appropriate storage manager\n */\nexport function createStorageManager<T>(type: StorageType, key: string): IStorageManager<T> {\n\tswitch (type) {\n\t\tcase 'local':\n\t\t\treturn new LocalStorageManager<T>(key)\n\t\tcase 'session':\n\t\t\treturn new SessionStorageManager<T>(key)\n\t\tcase 'indexeddb':\n\t\t\treturn new IndexedDBStorageManager<T>(key)\n\t\tcase 'memory':\n\t\tdefault:\n\t\t\treturn new MemoryStorageManager<T>()\n\t}\n}\n","// src/store/store.class.ts - Fixed version\n\nimport { produce, enableMapSet, immerable } from 'immer'\nimport { BehaviorSubject, Subject } from 'rxjs'\nimport { createStorageManager } from './storage-manager'\nimport { IStorageManager, StorageType, StoreError } from './types'\n\n// Enable Map and Set support for Immer\nenableMapSet()\n\n/**\n * Base store class to handle common functionality between store types\n * Now with Immer integration for immutability\n */\nexport abstract class BaseStore<T> {\n\t// Mark the class as immerable to allow Immer to create drafts\n\t[immerable] = true\n\n\t// State tracking\n\tprotected _ready: boolean = false\n\tprotected _destroy$ = new Subject<void>()\n\n\t// Observable streams\n\tpublic $: BehaviorSubject<T>\n\tpublic error$ = new BehaviorSubject<StoreError | null>(null)\n\n\t// Default value for the store\n\tpublic readonly defaultValue: T\n\n\t// Storage manager\n\tprotected storage: IStorageManager<T>\n\n\t/**\n\t * Get store ready state\n\t */\n\tpublic get ready(): boolean {\n\t\treturn this._ready\n\t}\n\n\t/**\n\t * Set store ready state\n\t */\n\tpublic set ready(value: boolean) {\n\t\tthis._ready = value\n\t\tthis.updateState(this.$.value)\n\t}\n\n\t/**\n\t * Get the current value\n\t */\n\tpublic get value(): T {\n\t\treturn this.$.getValue()\n\t}\n\n\t/**\n\t * Initialize the base store\n\t * @param storageType Storage type to use\n\t * @param key Unique key for the store\n\t * @param defaultValue Default/initial value\n\t */\n\tconstructor(\n\t\tprotected storageType: StorageType,\n\t\tprotected key: string,\n\t\tdefaultValue: T,\n\t) {\n\t\t// Before using produce, ensure the input is draftable\n\t\t// This ensures Immer won't throw an error on non-draftable values\n\t\tlet safeDefaultValue: T\n\n\t\tif (defaultValue instanceof Map) {\n\t\t\t// For Maps, create a new Map instance\n\t\t\tsafeDefaultValue = new Map(defaultValue) as unknown as T\n\t\t} else if (Array.isArray(defaultValue)) {\n\t\t\t// For arrays, create a new array instance\n\t\t\tsafeDefaultValue = [...defaultValue] as unknown as T\n\t\t} else if (defaultValue && typeof defaultValue === 'object') {\n\t\t\t// For objects, create a shallow copy\n\t\t\tsafeDefaultValue = { ...defaultValue } as T\n\t\t} else {\n\t\t\t// For primitives or other non-draftable types\n\t\t\tsafeDefaultValue = defaultValue\n\t\t}\n\n\t\t// Make an immutable copy of the default value when possible\n\t\ttry {\n\t\t\tthis.defaultValue = this.isImmerDraftable(safeDefaultValue)\n\t\t\t\t? produce(safeDefaultValue, draft => draft)\n\t\t\t\t: safeDefaultValue\n\t\t} catch (error) {\n\t\t\tconsole.warn(`[BaseStore] Unable to produce immutable copy of defaultValue:`, error)\n\t\t\tthis.defaultValue = safeDefaultValue\n\t\t}\n\n\t\t// Initialize BehaviorSubject with the default value\n\t\tthis.$ = new BehaviorSubject<T>(this.defaultValue)\n\t\tthis.storage = createStorageManager<T>(storageType, key)\n\n\t\t// Set ready immediately for memory storage\n\t\tif (storageType === 'memory') {\n\t\t\tthis._ready = true\n\t\t} else {\n\t\t\t// Initialize from storage for persistent stores\n\t\t\tthis.initializeFromStorage()\n\t\t}\n\t}\n\n\t/**\n\t * Check if a value can be safely used with Immer's produce\n\t */\n\tprotected isImmerDraftable(value: any): boolean {\n\t\treturn (\n\t\t\tvalue !== null &&\n\t\t\ttypeof value === 'object' &&\n\t\t\t(Array.isArray(value) ||\n\t\t\t\tvalue instanceof Map ||\n\t\t\t\tvalue instanceof Set ||\n\t\t\t\tObject.getPrototypeOf(value) === Object.prototype ||\n\t\t\t\tvalue[immerable] === true)\n\t\t)\n\t}\n\n\t/**\n\t * Cleanup method for all store types\n\t */\n\tpublic destroy(): void {\n\t\tthis._destroy$.next()\n\t\tthis._destroy$.complete()\n\t\tthis.$.complete()\n\t\tthis.error$.complete()\n\t}\n\n\t/**\n\t * Replace the entire store state immutably\n\t */\n\tpublic replace(newValue: T): void {\n\t\ttry {\n\t\t\t// Use Immer to create an immutable copy if possible\n\t\t\tconst nextState = this.isImmerDraftable(newValue) ? produce(newValue, draft => draft) : newValue\n\n\t\t\tthis.updateState(nextState)\n\t\t} catch (error) {\n\t\t\tconst storeError = new StoreError<unknown>(`Error replacing state in ${this.key}`, error)\n\t\t\tthis.error$.next(storeError)\n\t\t\tconsole.error(storeError)\n\n\t\t\t// Fallback to direct assignment\n\t\t\tthis.updateState(newValue)\n\t\t}\n\t}\n\n\t/**\n\t * Reset to default value - to be implemented by subclasses\n\t */\n\tpublic abstract clear(): void\n\n\t/**\n\t * Update the state with proper error handling and immutability\n\t */\n\tprotected updateState(newValue: T): void {\n\t\ttry {\n\t\t\t// Ensure immutability by creating a fresh copy with Immer when possible\n\t\t\tlet nextState: T\n\n\t\t\tif (this.isImmerDraftable(newValue)) {\n\t\t\t\tnextState = produce(newValue, draft => draft)\n\t\t\t} else {\n\t\t\t\tnextState = newValue\n\t\t\t}\n\n\t\t\tthis.$.next(nextState)\n\n\t\t\t// Persist to storage\n\t\t\tif (this.storageType !== 'memory') {\n\t\t\t\tthis.persistToStorage(nextState).catch(err => {\n\t\t\t\t\tconst error = new StoreError<unknown>(`Error saving to ${this.storageType} storage for ${this.key}`, err)\n\t\t\t\t\tthis.error$.next(error)\n\t\t\t\t\tconsole.error(error)\n\t\t\t\t})\n\t\t\t}\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error updating state in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\n\t\t\t// Fallback to direct update\n\t\t\tthis.$.next(newValue)\n\t\t}\n\t}\n\n\t/**\n\t * Initialize the store from persistent storage\n\t */\n\tprotected async initializeFromStorage(): Promise<void> {\n\t\ttry {\n\t\t\tconst storedValue = await this.storage.load()\n\t\t\tif (storedValue) {\n\t\t\t\t// Process and update state with the stored value\n\t\t\t\tconst processedValue = this.processStoredValue(storedValue)\n\n\t\t\t\ttry {\n\t\t\t\t\t// Only use Immer if the value is draftable\n\t\t\t\t\tconst immutableValue = this.isImmerDraftable(processedValue)\n\t\t\t\t\t\t? produce(processedValue, draft => draft)\n\t\t\t\t\t\t: processedValue\n\n\t\t\t\t\tthis.updateState(immutableValue)\n\t\t\t\t} catch (error) {\n\t\t\t\t\tconsole.warn(`[BaseStore] Unable to create immutable copy, using value directly:`, error)\n\t\t\t\t\tthis.updateState(processedValue)\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis._ready = true\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error loading from ${this.storageType} storage for ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t\tthis._ready = true // Mark as ready even if loading fails\n\t\t}\n\t}\n\n\t/**\n\t * Process stored value (can be overridden by subclasses)\n\t */\n\tprotected processStoredValue(storedValue: T): T {\n\t\treturn storedValue\n\t}\n\n\t/**\n\t * Persist state to storage\n\t */\n\tprotected async persistToStorage(state: T): Promise<void> {\n\t\treturn this.storage.save(state)\n\t}\n\n\t/**\n\t * Setup development tools\n\t */\n\tprotected abstract setupDevTools(): void\n}\n","// src/store/context-array.ts - Array store implementation with Immer\nimport { Draft, castDraft, produce } from 'immer'\nimport { throttleTime } from 'rxjs'\nimport { BaseStore } from './store.class'\nimport { IArrayStore, StorageType, StoreError } from './types'\n\n/**\n * Enhanced array store with TypeScript support and immutability\n * Extends BaseStore for common functionality\n */\nexport class SchmancyArrayStore<T = any> extends BaseStore<T[]> implements IArrayStore<T> {\n\tpublic static type = 'array'\n\n\t// Static map to hold instances\n\tprivate static instances: Map<string, SchmancyArrayStore<any>> = new Map()\n\n\t/**\n\t * Static method to get or create an instance with proper typing\n\t */\n\tpublic static getInstance<T = any>(storage: StorageType, key: string, defaultValue: T[] = []): SchmancyArrayStore<T> {\n\t\tconst instanceKey = `${storage}:${key}`\n\t\tif (!this.instances.has(instanceKey)) {\n\t\t\tthis.instances.set(instanceKey, new SchmancyArrayStore<T>(storage, key, defaultValue))\n\t\t}\n\t\treturn this.instances.get(instanceKey) as SchmancyArrayStore<T>\n\t}\n\n\t/**\n\t * Constructor extension to set up persistence\n\t */\n\tconstructor(storageType: StorageType, key: string, defaultValue: T[] = []) {\n\t\tsuper(storageType, key, defaultValue)\n\n\t\t// Set up persistence throttling for better performance\n\t\tif (storageType !== 'memory') {\n\t\t\tthis.setupPersistence()\n\t\t}\n\t}\n\n\t/**\n\t * Set up persistence to storage with throttling\n\t */\n\tprivate setupPersistence(): void {\n\t\tthis.$.pipe(throttleTime(100, undefined, { leading: true, trailing: true })).subscribe(currentValue => {\n\t\t\tthis.storage.save(currentValue).catch(err => {\n\t\t\t\tconst error = new StoreError<unknown>(`Error saving to ${this.storageType} storage for ${this.key}`, err)\n\t\t\t\tthis.error$.next(error)\n\t\t\t\tconsole.error(error)\n\t\t\t})\n\t\t})\n\t}\n\n\t/**\n\t * Add an item to the end of the array\n\t */\n\tpublic push(...items: T[]): void {\n\t\ttry {\n\t\t\t// Use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tdraft.push(...items.map(item => castDraft(item) as Draft<T>))\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null) // Clear any previous errors\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error pushing items in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Remove and return the last item from the array\n\t */\n\tpublic pop(): T | undefined {\n\t\ttry {\n\t\t\t// Get the item before modifying the array\n\t\t\tconst originalItem = this.value.length > 0 ? this.value[this.value.length - 1] : undefined\n\n\t\t\t// Use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tdraft.pop()\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null) // Clear any previous errors\n\t\t\treturn originalItem\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error popping item from ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t\treturn undefined\n\t\t}\n\t}\n\t/**\n\t * Add item(s) to the beginning of the array\n\t */\n\tpublic unshift(...items: T[]): void {\n\t\ttry {\n\t\t\t// Use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tdraft.unshift(...items.map(item => castDraft(item) as Draft<T>))\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error unshifting items in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Remove and return the first item from the array\n\t */\n\tpublic shift(): T | undefined {\n\t\ttry {\n\t\t\t// Get the item before modifying the array\n\t\t\tconst originalItem = this.value.length > 0 ? this.value[0] : undefined\n\n\t\t\t// Use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tdraft.shift()\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t\treturn originalItem\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error shifting item from ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t\treturn undefined\n\t\t}\n\t}\n\n\t/**\n\t * Update an item at a specific index\n\t */\n\tpublic set(index: number, value: T): void {\n\t\ttry {\n\t\t\t// Use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tif (index >= 0 && index < draft.length) {\n\t\t\t\t\tdraft[index] = castDraft(value) as Draft<T>\n\t\t\t\t} else {\n\t\t\t\t\tthrow new Error(`Index ${index} out of bounds (length: ${draft.length})`)\n\t\t\t\t}\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error setting item at index ${index} in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Get item at a specific index\n\t */\n\tpublic get(index: number): T | undefined {\n\t\treturn this.value[index]\n\t}\n\n\t/**\n\t * Remove items from the array\n\t */\n\tpublic splice(start: number, deleteCount?: number, ...items: T[]): T[] {\n\t\ttry {\n\t\t\t// Get a copy of the current array\n\t\t\tconst originalArray = [...this.value]\n\n\t\t\t// Perform splice on the copy to get the removed items\n\t\t\tconst removed = originalArray.splice(start, deleteCount ?? 0, ...items)\n\n\t\t\t// Now use Immer to create the new state with the same changes\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tdraft.splice(start, deleteCount ?? 0, ...items.map(item => castDraft(item) as Draft<T>))\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t\treturn removed\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error splicing items in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t\treturn []\n\t\t}\n\t}\n\n\t/**\n\t * Remove an item by value (first occurrence)\n\t */\n\tpublic remove(item: T, compareFn?: (a: T, b: T) => boolean): boolean {\n\t\ttry {\n\t\t\tconst equals = compareFn || ((a, b) => a === b)\n\n\t\t\t// Find the index in the original array\n\t\t\tconst index = this.value.findIndex(currentItem => equals(currentItem, item))\n\n\t\t\t// If found, remove using Immer\n\t\t\tif (index !== -1) {\n\t\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\t\tdraft.splice(index, 1)\n\t\t\t\t})\n\n\t\t\t\tthis.updateState(nextState)\n\t\t\t\tthis.error$.next(null)\n\t\t\t\treturn true\n\t\t\t}\n\n\t\t\t// Item not found\n\t\t\tthis.error$.next(null)\n\t\t\treturn false\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error removing item in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t\treturn false\n\t\t}\n\t}\n\n\t/**\n\t * Replace entire array\n\t */\n\tpublic replace(newArray: T[]): void {\n\t\ttry {\n\t\t\t// Create a fresh immutable copy with Immer\n\t\t\tconst nextState = produce(newArray, draft => draft)\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error replacing array in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Filter items in the array\n\t */\n\tpublic filter(predicate: (value: T, index: number, array: T[]) => boolean): void {\n\t\ttry {\n\t\t\t// Filter the original array first\n\t\t\tconst filteredArray = this.value.filter(predicate)\n\n\t\t\t// Then use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\t// Clear the draft array and fill it with the filtered items\n\t\t\t\tdraft.length = 0\n\t\t\t\tdraft.push(...filteredArray.map(item => castDraft(item) as Draft<T>))\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error filtering array in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Map over the array and transform items\n\t */\n\tpublic map<U>(mapper: (value: T, index: number, array: T[]) => U): U[] {\n\t\treturn this.value.map(mapper)\n\t}\n\n\t/**\n\t * Sort the array in place\n\t */\n\tpublic sort(compareFn?: (a: T, b: T) => number): void {\n\t\ttry {\n\t\t\t// Create a copy of the current array and apply the sort operation\n\t\t\tconst sortedArray = [...this.value].sort(compareFn)\n\n\t\t\t// Use Immer to create a new immutable array that matches the sorted array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\t// Clear the array and refill it with the sorted items\n\t\t\t\tdraft.length = 0\n\t\t\t\tdraft.push(...sortedArray.map(item => castDraft(item) as Draft<T>))\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error sorting array in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Update a specific item using a callback function\n\t */\n\tpublic update(index: number, updater: (item: Draft<T>) => void): void {\n\t\ttry {\n\t\t\t// Use Immer to create a new immutable array\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tif (index >= 0 && index < draft.length) {\n\t\t\t\t\tupdater(draft[index])\n\t\t\t\t} else {\n\t\t\t\t\tthrow new Error(`Index ${index} out of bounds (length: ${draft.length})`)\n\t\t\t\t}\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error updating item at index ${index} in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Clear the array\n\t */\n\tpublic clear(): void {\n\t\tthis.updateState([])\n\t}\n\n\t/**\n\t * Setup development tools for debugging\n\t */\n\tprotected setupDevTools(): void {\n\t\tif (typeof window !== 'undefined') {\n\t\t\t// Add to global store registry\n\t\t\t;(window as any).__STORES__ = (window as any).__STORES__ || {}\n\t\t\t;(window as any).__STORES__[this.key] = {\n\t\t\t\tgetState: () => this.value,\n\t\t\t\tpush: this.push.bind(this),\n\t\t\t\tpop: this.pop.bind(this),\n\t\t\t\tunshift: this.unshift.bind(this),\n\t\t\t\tshift: this.shift.bind(this),\n\t\t\t\tset: this.set.bind(this),\n\t\t\t\tget: this.get.bind(this),\n\t\t\t\tsplice: this.splice.bind(this),\n\t\t\t\tremove: this.remove.bind(this),\n\t\t\t\treplace: this.replace.bind(this),\n\t\t\t\tfilter: this.filter.bind(this),\n\t\t\t\tmap: this.map.bind(this),\n\t\t\t\tsort: this.sort.bind(this),\n\t\t\t\tupdate: this.update.bind(this),\n\t\t\t\tclear: this.clear.bind(this),\n\t\t\t\tsubscribe: (callback: (state: T[]) => void) => {\n\t\t\t\t\tconst subscription = this.$.subscribe(callback)\n\t\t\t\t\treturn () => subscription.unsubscribe()\n\t\t\t\t},\n\t\t\t}\n\t\t}\n\t}\n}\n","// src/store/context-collection.ts - Updated with Immer for immutability\nimport { throttleTime } from 'rxjs'\nimport { BaseStore } from './store.class'\nimport { ICollectionStore, StorageType, StoreError } from './types'\nimport { produce, Draft, castDraft } from 'immer'\n\n/**\n * Enhanced collection store with better TypeScript support and immutability\n * Now extends BaseStore for common functionality\n */\nexport default class SchmancyCollectionStore<V = any> extends BaseStore<Map<string, V>> implements ICollectionStore<V> {\n\tpublic static type = 'collection'\n\n\t// Static map to hold instances\n\tprivate static instances: Map<string, SchmancyCollectionStore<any>> = new Map()\n\n\t/**\n\t * Static method to get or create an instance with proper typing\n\t */\n\tpublic static getInstance<V = any>(\n\t\tstorage: StorageType,\n\t\tkey: string,\n\t\tdefaultValue: Map<string, V>,\n\t): SchmancyCollectionStore<V> {\n\t\tconst instanceKey = `${storage}:${key}`\n\t\tif (!this.instances.has(instanceKey)) {\n\t\t\tthis.instances.set(instanceKey, new SchmancyCollectionStore<V>(storage, key, defaultValue))\n\t\t}\n\t\treturn this.instances.get(instanceKey) as SchmancyCollectionStore<V>\n\t}\n\n\t/**\n\t * Set values in the collection with proper typing and immutability.\n\t * Supports multiple input types to prevent common developer mistakes.\n\t * \n\t * @example\n\t * // Single key-value pair\n\t * store.set('key1', value1)\n\t * \n\t * @example\n\t * // Merge from a Map\n\t * const dataMap = new Map([['key1', value1], ['key2', value2]])\n\t * store.set(dataMap)\n\t * \n\t * @example\n\t * // Merge from an object\n\t * store.set({ key1: value1, key2: value2 })\n\t */\n\tpublic set<T = V>(keyOrData: string | Map<string, T> | Record<string, T>, value?: T): void {\n\t\ttry {\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\t// Handle different input types\n\t\t\t\tif (typeof keyOrData === 'string') {\n\t\t\t\t\t// Traditional key-value pair\n\t\t\t\t\tif (value === undefined) {\n\t\t\t\t\t\tthrow new Error('Value is required when setting a single key')\n\t\t\t\t\t}\n\t\t\t\t\tdraft.set(keyOrData, castDraft(value) as unknown as Draft<V>)\n\t\t\t\t} else if (keyOrData instanceof Map) {\n\t\t\t\t\t// Merge all entries from the Map\n\t\t\t\t\tArray.from(keyOrData.entries()).forEach(([key, val]) => {\n\t\t\t\t\t\tdraft.set(key, castDraft(val) as unknown as Draft<V>)\n\t\t\t\t\t})\n\t\t\t\t} else if (typeof keyOrData === 'object' && keyOrData !== null) {\n\t\t\t\t\t// Merge all properties from the object\n\t\t\t\t\tObject.entries(keyOrData).forEach(([key, val]) => {\n\t\t\t\t\t\tdraft.set(key, castDraft(val) as unknown as Draft<V>)\n\t\t\t\t\t})\n\t\t\t\t} else {\n\t\t\t\t\tthrow new Error('Invalid input: expected string key with value, Map, or object')\n\t\t\t\t}\n\t\t\t})\n\n\t\t\t// Update the state with the new immutable Map\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null) // Clear any previous errors\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error setting values in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Merge a Map into the collection. This is a helper method that provides\n\t * explicit semantics for merging operations.\n\t * \n\t * @param map The Map to merge into the collection\n\t * @example\n\t * const dataMap = new Map([['key1', value1], ['key2', value2]])\n\t * store.merge(dataMap)\n\t */\n\tpublic merge<T = V>(map: Map<string, T>): void {\n\t\tthis.set(map)\n\t}\n\n\t/**\n\t * Delete a value from the collection immutably\n\t */\n\tpublic delete(key: string): void {\n\t\ttry {\n\t\t\t// Use Immer to create a new immutable Map with the key deleted\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tdraft.delete(key)\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null) // Clear any previous errors\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error deleting key ${key} from ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Clear the collection immutably\n\t */\n\tpublic clear(): void {\n\t\t// Create a fresh empty Map\n\t\tthis.updateState(new Map<string, V>())\n\t}\n\n\t/**\n\t * Batch update multiple items in the collection\n\t * @param updates Object with keys and values to update\n\t */\n\tpublic batchUpdate(updates: Record<string, V>): void {\n\t\ttry {\n\t\t\t// Use Immer to apply all updates in a single immutable operation\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tObject.entries(updates).forEach(([key, value]) => {\n\t\t\t\t\tdraft.set(key, castDraft(value) as unknown as Draft<V>)\n\t\t\t\t})\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error batch updating in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Update an existing item in the collection using an updater function\n\t * @param key Key of the item to update\n\t * @param updater Function that receives the current value and returns the new value\n\t */\n\tpublic update(key: string, updater: (currentValue: Draft<V>) => void): void {\n\t\ttry {\n\t\t\t// Use Immer to update the specific item\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tconst currentValue = draft.get(key)\n\t\t\t\tif (currentValue !== undefined) {\n\t\t\t\t\tupdater(currentValue)\n\t\t\t\t\t// No need to set the value back since it's updated in place\n\t\t\t\t}\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error updating item ${key} in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t}\n\t}\n\n\t/**\n\t * Constructor extension to set up persistence\n\t */\n\tconstructor(storageType: StorageType, key: string, defaultValue: Map<string, V>) {\n\t\tsuper(storageType, key, defaultValue)\n\n\t\t// Set up persistence throttling for better performance\n\t\tif (storageType !== 'memory') {\n\t\t\tthis.setupPersistence()\n\t\t}\n\t}\n\n\t/**\n\t * Set up persistence to storage with throttling\n\t */\n\tprivate setupPersistence(): void {\n\t\tthis.$.pipe(throttleTime(100, undefined, { leading: true, trailing: true })).subscribe(currentValue => {\n\t\t\tthis.storage.save(currentValue).catch(err => {\n\t\t\t\tconst error = new StoreError<unknown>(`Error saving to ${this.storageType} storage for ${this.key}`, err)\n\t\t\t\tthis.error$.next(error)\n\t\t\t\tconsole.error(error)\n\t\t\t})\n\t\t})\n\t}\n\n\t/**\n\t * Setup development tools for debugging\n\t */\n\tprotected setupDevTools(): void {\n\t\tif (typeof window !== 'undefined') {\n\t\t\t// Add to global store registry\n\t\t\t;(window as any).__STORES__ = (window as any).__STORES__ || {}\n\t\t\t;(window as any).__STORES__[this.key] = {\n\t\t\t\tgetState: () => this.value,\n\t\t\t\tset: this.set.bind(this),\n\t\t\t\tmerge: this.merge.bind(this),\n\t\t\t\tdelete: this.delete.bind(this),\n\t\t\t\tclear: this.clear.bind(this),\n\t\t\t\tbatchUpdate: this.batchUpdate.bind(this),\n\t\t\t\tupdate: this.update.bind(this),\n\t\t\t\tsubscribe: (callback: (state: Map<string, V>) => void) => {\n\t\t\t\t\tconst subscription = this.$.subscribe(callback)\n\t\t\t\t\treturn () => subscription.unsubscribe()\n\t\t\t\t},\n\t\t\t}\n\t\t}\n\t}\n}\n","// src/store/context-object.ts - Fixed version\n\nimport { BaseStore } from './store.class'\nimport { IStore, StorageType, StoreError } from './types'\nimport { produce, Draft, castDraft, immerable } from 'immer'\n\n/**\n * Enhanced store object with better TypeScript support and immutability\n * Now extends BaseStore for common functionality and uses Immer\n */\nexport class SchmancyStoreObject<T extends Record<string, any>> extends BaseStore<T> implements IStore<T> {\n\t// Mark as immerable so Immer can create drafts of this class\n\t[immerable] = true\n\n\tpublic static type = 'object'\n\n\t// Static map to hold instances with proper typing\n\tprivate static instances: Map<string, SchmancyStoreObject<any>> = new Map()\n\n\t/**\n\t * Static method to get or create an instance with strong typing\n\t */\n\tpublic static getInstance<T extends Record<string, any>>(\n\t\tstorage: StorageType,\n\t\tkey: string,\n\t\tdefaultValue: T,\n\t): SchmancyStoreObject<T> {\n\t\tconst instanceKey = `${storage}:${key}`\n\t\tif (!this.instances.has(instanceKey)) {\n\t\t\tthis.instances.set(instanceKey, new SchmancyStoreObject<T>(storage, key, defaultValue))\n\t\t}\n\t\treturn this.instances.get(instanceKey) as SchmancyStoreObject<T>\n\t}\n\n\t/**\n\t * Set state with proper typing and immutability using Immer\n\t */\n\tpublic set(value: Partial<T>, merge: boolean = true): void {\n\t\ttry {\n\t\t\tif (!this.isImmerDraftable(this.value)) {\n\t\t\t\t// If current value isn't draftable, handle directly\n\t\t\t\tconst nextState = merge ? { ...this.value, ...value } : (value as T)\n\n\t\t\t\tthis.updateState(nextState)\n\t\t\t\tthis.error$.next(null)\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\t// Use Immer to create an immutable update\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tif (merge) {\n\t\t\t\t\t// Handle null/undefined value safely\n\t\t\t\t\tif (value === null || value === undefined) {\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\n\t\t\t\t\t// Merge new values into existing state\n\t\t\t\t\t// Use castDraft to properly type the value for the draft context\n\t\t\t\t\ttry {\n\t\t\t\t\t\tObject.assign(draft, castDraft(value) as Draft<Partial<T>>)\n\t\t\t\t\t} catch (err) {\n\t\t\t\t\t\tconsole.warn('[SchmancyStoreObject] Error casting to draft, falling back to direct assign:', err)\n\t\t\t\t\t\t// Fallback to direct property assignment\n\t\t\t\t\t\tObject.keys(value).forEach(key => {\n\t\t\t\t\t\t\t;(draft as any)[key] = (value as any)[key]\n\t\t\t\t\t\t})\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t// For complete replacement, return a completely new object\n\t\t\t\t\t// This is handled specially by Immer\n\t\t\t\t\ttry {\n\t\t\t\t\t\treturn castDraft(value as T) as Draft<T>\n\t\t\t\t\t} catch (err) {\n\t\t\t\t\t\tconsole.warn('[SchmancyStoreObject] Error casting to draft, returning value directly:', err)\n\t\t\t\t\t\treturn value as unknown as Draft<T>\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null) // Clear any previous errors\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error updating store: ${this.key}`, err, { value, merge })\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\n\t\t\t// Fallback to direct update\n\t\t\ttry {\n\t\t\t\tconst fallbackState = merge ? { ...this.value, ...value } : (value as T)\n\t\t\t\tthis.updateState(fallbackState)\n\t\t\t} catch (fallbackErr) {\n\t\t\t\tconsole.error('Failed fallback update:', fallbackErr)\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Reset the store to its default value\n\t */\n\tpublic clear(): void {\n\t\ttry {\n\t\t\t// Create a fresh copy of the default value using Immer\n\t\t\tif (this.isImmerDraftable(this.defaultValue)) {\n\t\t\t\tconst freshDefaultValue = produce(this.defaultValue, draft => draft)\n\t\t\t\tthis.set(freshDefaultValue, false)\n\t\t\t} else {\n\t\t\t\t// For non-draftable values, use direct replacement\n\t\t\t\tthis.set(this.defaultValue as any, false)\n\t\t\t}\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error clearing store: ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\n\t\t\t// Fallback to direct reset\n\t\t\tthis.updateState(this.defaultValue)\n\t\t}\n\t}\n\n\t/**\n\t * Delete a specific key from the store with type checking and immutability\n\t */\n\tpublic delete<K extends keyof T>(key: K): void {\n\t\ttry {\n\t\t\tif (!this.isImmerDraftable(this.value)) {\n\t\t\t\t// Handle non-draftable objects directly\n\t\t\t\tconst nextState = { ...this.value }\n\t\t\t\tdelete nextState[key]\n\t\t\t\tthis.updateState(nextState as T)\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\t// Use Immer to create an immutable update that removes the key\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\t// Use type assertion to tell TypeScript this is safe\n\t\t\t\tdelete draft[key as keyof Draft<T>]\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error deleting key ${String(key)} from store: ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\n\t\t\t// Fallback to direct modification\n\t\t\ttry {\n\t\t\t\tconst fallbackState = { ...this.value }\n\t\t\t\tdelete fallbackState[key]\n\t\t\t\tthis.updateState(fallbackState as T)\n\t\t\t} catch (fallbackErr) {\n\t\t\t\tconsole.error('Failed fallback delete:', fallbackErr)\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Update a nested property at a specific path\n\t * @param path Dot-separated path to the property (e.g., 'user.profile.name')\n\t * @param value New value to set\n\t */\n\tpublic setPath(path: string, value: any): void {\n\t\ttry {\n\t\t\tif (!path) {\n\t\t\t\tconsole.warn('[SchmancyStoreObject] Empty path provided to setPath')\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tif (!this.isImmerDraftable(this.value)) {\n\t\t\t\t// Handle non-draftable objects with direct modification\n\t\t\t\tconst parts = path.split('.')\n\t\t\t\tconst nextState = { ...this.value }\n\t\t\t\tlet current: any = nextState\n\n\t\t\t\tfor (let i = 0; i < parts.length - 1; i++) {\n\t\t\t\t\tconst part = parts[i]\n\t\t\t\t\tif (current[part] === undefined) {\n\t\t\t\t\t\tcurrent[part] = {}\n\t\t\t\t\t} else if (typeof current[part] !== 'object' || current[part] === null) {\n\t\t\t\t\t\tcurrent[part] = {}\n\t\t\t\t\t}\n\t\t\t\t\tcurrent = current[part]\n\t\t\t\t}\n\n\t\t\t\tcurrent[parts[parts.length - 1]] = value\n\t\t\t\tthis.updateState(nextState)\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\t// Use Immer for immutable deep updates\n\t\t\tconst nextState = produce(this.value, draft => {\n\t\t\t\tconst parts = path.split('.')\n\t\t\t\tlet current: any = draft\n\n\t\t\t\t// Navigate to the parent of the property we want to update\n\t\t\t\tfor (let i = 0; i < parts.length - 1; i++) {\n\t\t\t\t\tconst part = parts[i]\n\n\t\t\t\t\t// Create the path if it doesn't exist\n\t\t\t\t\tif (current[part] === undefined) {\n\t\t\t\t\t\tcurrent[part] = {}\n\t\t\t\t\t} else if (typeof current[part] !== 'object' || current[part] === null) {\n\t\t\t\t\t\t// Convert to object if it's not one already\n\t\t\t\t\t\tcurrent[part] = {}\n\t\t\t\t\t}\n\n\t\t\t\t\tcurrent = current[part]\n\t\t\t\t}\n\n\t\t\t\t// Set the value at the final path segment\n\t\t\t\tconst lastPart = parts[parts.length - 1]\n\t\t\t\ttry {\n\t\t\t\t\tcurrent[lastPart] = castDraft(value)\n\t\t\t\t} catch (err) {\n\t\t\t\t\tconsole.warn('[SchmancyStoreObject] Error casting to draft, setting directly:', err)\n\t\t\t\t\tcurrent[lastPart] = value\n\t\t\t\t}\n\t\t\t})\n\n\t\t\tthis.updateState(nextState)\n\t\t\tthis.error$.next(null)\n\t\t} catch (err) {\n\t\t\tconst error = new StoreError<unknown>(`Error setting path ${path} in ${this.key}`, err)\n\t\t\tthis.error$.next(error)\n\t\t\tconsole.error(error)\n\n\t\t\t// Fallback to direct path setting\n\t\t\ttry {\n\t\t\t\tconst parts = path.split('.')\n\t\t\t\tconst nextState = { ...this.value }\n\t\t\t\tlet current: any = nextState\n\n\t\t\t\tfor (let i = 0; i < parts.length - 1; i++) {\n\t\t\t\t\tconst part = parts[i]\n\t\t\t\t\tif (current[part] === undefined) {\n\t\t\t\t\t\tcurrent[part] = {}\n\t\t\t\t\t} else if (typeof current[part] !== 'object' || current[part] === null) {\n\t\t\t\t\t\tcurrent[part] = {}\n\t\t\t\t\t}\n\t\t\t\t\tcurrent = current[part]\n\t\t\t\t}\n\n\t\t\t\tcurrent[parts[parts.length - 1]] = value\n\t\t\t\tthis.updateState(nextState)\n\t\t\t} catch (fallbackErr) {\n\t\t\t\tconsole.error('Failed fallback setPath:', fallbackErr)\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Process stored value by merging with default value\n\t */\n\tprotected processStoredValue(storedValue: T): T {\n\t\ttry {\n\t\t\t// Use Immer to create a clean merged state if possible\n\t\t\tif (this.isImmerDraftable(this.defaultValue) && this.isImmerDraftable(storedValue)) {\n\t\t\t\treturn produce(this.defaultValue, draft => {\n\t\t\t\t\tObject.assign(draft, castDraft(storedValue) as Draft<T>)\n\t\t\t\t})\n\t\t\t} else {\n\t\t\t\t// Otherwise use a standard merge\n\t\t\t\treturn { ...this.defaultValue, ...storedValue }\n\t\t\t}\n\t\t} catch (err) {\n\t\t\tconsole.warn(`[SchmancyStoreObject] Error processing stored value, returning as-is:`, err)\n\t\t\treturn storedValue\n\t\t}\n\t}\n\n\t/**\n\t * Setup development tools for debugging\n\t */\n\tprotected setupDevTools(): void {\n\t\tif (typeof window !== 'undefined') {\n\t\t\t// Add to global store registry\n\t\t\t;(window as any).__STORES__ = (window as any).__STORES__ || {}\n\t\t\t;(window as any).__STORES__[this.key] = {\n\t\t\t\tgetState: () => this.value,\n\t\t\t\tset: this.set.bind(this),\n\t\t\t\tdelete: this.delete.bind(this),\n\t\t\t\tclear: this.clear.bind(this),\n\t\t\t\tsetPath: this.setPath.bind(this),\n\t\t\t\tsubscribe: (callback: (state: T) => void) => {\n\t\t\t\t\tconst subscription = this.$.subscribe(callback)\n\t\t\t\t\treturn () => subscription.unsubscribe()\n\t\t\t\t},\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Inherit isImmerDraftable from BaseStore, but also check for [immerable]\n\t */\n\tprotected isImmerDraftable(value: any): boolean {\n\t\t// Use the parent implementation and add our own checks\n\t\treturn value !== null && typeof value === 'object' && (super.isImmerDraftable(value) || value[immerable] === true)\n\t}\n}\n","// src/store/context-create.ts - Fixed version\n\nimport { SchmancyArrayStore } from './context-array'\nimport SchmancyCollectionStore from './context-collection'\nimport { SchmancyStoreObject } from './context-object'\nimport { IArrayStore, ICollectionStore, IStore, StorageType } from './types'\n\n/**\n * Type guard to check if an object is empty\n */\nfunction isEmptyObject(obj: unknown): boolean {\n\tif (typeof obj !== 'object' || obj === null) {\n\t\treturn false\n\t}\n\treturn Object.keys(obj).length === 0\n}\n\n/**\n * Type guard for Map objects\n */\nfunction isMap<K, V>(value: unknown): value is Map<K, V> {\n\treturn value instanceof Map\n}\n\n/**\n * Type guard for Array objects\n */\nfunction isArray<T>(value: unknown): value is Array<T> {\n\treturn Array.isArray(value)\n}\n\n/**\n * Type guard for plain objects (not arrays, maps, null, etc.)\n */\nfunction isPlainObject(value: unknown): boolean {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object' &&\n\t\t!Array.isArray(value) &&\n\t\t!(value instanceof Map) &&\n\t\t!(value instanceof Set) &&\n\t\t!(value instanceof Date) &&\n\t\t!(value instanceof RegExp) &&\n\t\tObject.getPrototypeOf(value) === Object.prototype\n\t)\n}\n\n/**\n * Creates a regular object store with better typing and error handling\n */\nfunction createObjectStore<T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n): IStore<T> & SchmancyStoreObject<T> {\n\ttry {\n\t\t// Validate storage type\n\t\tif (storage === 'indexeddb') {\n\t\t\tconsole.warn(`IndexedDB storage is not optimal for plain objects. Using 'local' instead for key: ${key}`)\n\t\t\tstorage = 'local'\n\t\t}\n\n\t\t// Ensure initialData is a plain object\n\t\tif (!isPlainObject(initialData)) {\n\t\t\tconsole.warn(`Initial data is not a plain object. Converting to object for key: ${key}`)\n\t\t\tinitialData = { ...initialData } as T\n\t\t}\n\n\t\t// Create the store instance\n\t\tconst store = SchmancyStoreObject.getInstance<T>(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (isEmptyObject(store.value)) {\n\t\t\tstore.set({ ...initialData }) // Use spread to create a copy\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create object store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyStoreObject.getInstance<T>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\tinitialData,\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n/**\n * Creates a collection store with better typing and error handling\n */\nfunction createCollectionStore<V>(\n\tinitialData: Map<string, V>,\n\tstorage: StorageType,\n\tkey: string,\n): ICollectionStore<V> & SchmancyCollectionStore<V> {\n\ttry {\n\t\t// Create the store instance\n\t\tconst store = SchmancyCollectionStore.getInstance(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (!store.value.size) {\n\t\t\t// Create a new Map instance to avoid modifying the input\n\t\t\tstore.replace(new Map(initialData))\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create collection store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyCollectionStore.getInstance<V>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\tnew Map(initialData),\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n/**\n * Creates an array store with better typing and error handling\n */\nfunction createArrayStore<T>(\n\tinitialData: T[],\n\tstorage: StorageType,\n\tkey: string,\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\t// Create the store instance\n\t\tconst store = SchmancyArrayStore.getInstance(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (!store.value.length) {\n\t\t\t// Create a new array instance to avoid modifying the input\n\t\t\tstore.replace([...initialData])\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create array store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyArrayStore.getInstance<T>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\t[...initialData],\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n// Function overloads for better type inference\n/**\n * Creates a context for managing object state\n * @param initialData The initial object data\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns A store instance for the object\n */\nexport function createContext<T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n): IStore<T> & SchmancyStoreObject<T>\n\n/**\n * Creates a context for managing collection state\n * @param initialData The initial Map collection\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns A collection store instance\n */\nexport function createContext<V>(\n\tinitialData: Map<string, V>,\n\tstorage: StorageType,\n\tkey: string,\n): ICollectionStore<V> & SchmancyCollectionStore<V>\n\n/**\n * Creates a context for managing array state\n * @param initialData The initial array\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns An array store instance\n */\nexport function createContext<T>(\n\tinitialData: T[],\n\tstorage: StorageType,\n\tkey: string,\n): IArrayStore<T> & SchmancyArrayStore<T>\n\n/**\n * Implementation of the createContext function with complete type checking\n * and robust error handling\n */\nexport function createContext<T extends Record<string, any> | Map<string, any> | any[]>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n):\n\t| (IStore<T> & SchmancyStoreObject<T>)\n\t| (ICollectionStore<any> & SchmancyCollectionStore<any>)\n\t| (IArrayStore<any> & SchmancyArrayStore<any>) {\n\ttry {\n\t\t// Validate input\n\t\tif (initialData === null || initialData === undefined) {\n\t\t\tconsole.error('Initial data cannot be null or undefined')\n\t\t\t// Provide a sensible default based on type expected\n\t\t\tif (key.includes('collection') || key.includes('map')) {\n\t\t\t\tinitialData = new Map() as unknown as T\n\t\t\t} else if (key.includes('array') || key.includes('list')) {\n\t\t\t\tinitialData = [] as unknown as T\n\t\t\t} else {\n\t\t\t\tinitialData = {} as T\n\t\t\t}\n\t\t}\n\n\t\t// Determine store type based on input data with improved type checking\n\t\tif (isMap<string, any>(initialData)) {\n\t\t\treturn createCollectionStore<any>(initialData, storage, key)\n\t\t} else if (isArray<any>(initialData)) {\n\t\t\treturn createArrayStore<any>(initialData, storage, key)\n\t\t} else if (typeof initialData === 'object') {\n\t\t\treturn createObjectStore<any>(initialData as Record<string, any>, storage, key)\n\t\t} else {\n\t\t\t// Handle non-object data by wrapping it\n\t\t\tconsole.warn(`Initial data must be an object, array, or Map. Got ${typeof initialData}. Creating object wrapper.`)\n\t\t\treturn createObjectStore<any>({ value: initialData } as Record<string, any>, storage, key)\n\t\t}\n\t} catch (error) {\n\t\t// Last-resort error handling\n\t\tconsole.error(`Fatal error creating context for ${key}:`, error)\n\n\t\t// Create an emergency fallback store that won't throw\n\t\treturn createObjectStore<any>(\n\t\t\ttypeof initialData === 'object' && initialData !== null ? { ...initialData } : { value: initialData },\n\t\t\t'memory',\n\t\t\t`emergency-fallback-${key}`,\n\t\t)\n\t}\n}\n\n/**\n * Creates an array context with simplified API and type inference\n * @param initialData The initial array data\n * @param key Unique key for the store\n * @param storage Storage type to use (defaults to 'local')\n * @returns An array store instance\n */\nexport function createArrayContext<T>(\n\tinitialData: T[] = [],\n\tkey: string,\n\tstorage: StorageType = 'local',\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\treturn createContext<T>(initialData, storage, key)\n\t} catch (err) {\n\t\tconsole.error(`Failed to create array context for key: ${key}`, err)\n\t\t// Return a fallback store\n\t\treturn createArrayStore<T>(initialData, 'memory', `${key}-fallback`)\n\t}\n}\n\n/**\n * Creates a testable array context\n * @param initialData The initial array data\n * @param key Unique key for the store\n * @returns An array store that uses memory storage\n */\nexport function createTestArrayContext<T>(\n\tinitialData: T[] = [],\n\tkey: string = 'test-array',\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\treturn createContext<T>(initialData, 'memory', key)\n\t} catch (err) {\n\t\tconsole.error(`Failed to create test array context for key: ${key}`, err)\n\t\t// Return a fallback store with a different key\n\t\treturn createArrayStore<T>(initialData, 'memory', `${key}-emergency-fallback`)\n\t}\n}\n","// src/store/filter-directive.ts\n\n/** Supported comparison operators with TypeScript literal types */\nexport type ComparisonOperator =\n\t| '=='\n\t| '!='\n\t| '>'\n\t| '<'\n\t| '>='\n\t| '<='\n\t| 'includes'\n\t| 'notIncludes'\n\t| 'startsWith'\n\t| 'endsWith'\n\t| 'in'\n\t| 'notIn'\n\t| 'any' // fuzzy search operator\n\n/**\n * Type-safe condition tuple\n */\nexport type ConditionTuple = [field: string, op: ComparisonOperator, expected: unknown, strict?: boolean]\n\n/**\n * Type-safe condition object\n */\nexport interface ConditionObject {\n\tkey: string | string[] // Array of keys applies OR logic across fields\n\toperator: ComparisonOperator\n\tvalue: unknown\n\tstrict?: boolean\n}\n\n/**\n * Unified query condition type\n */\nexport type QueryCondition = ConditionTuple | ConditionObject\n\n/**\n * Filter result with item and score\n */\nexport interface ScoredItem<T> {\n\titem: T\n\tscore: number\n}\n\n/**\n * Get a nested value from an object using a dot-separated path.\n * Checks explicitly for null/undefined so falsy values like 0 or false are preserved.\n */\nexport const getFieldValue = <T = any>(item: Record<string, any>, path: string): T => {\n\tif (!path) return item as unknown as T\n\n\tconst parts = path.split('.')\n\tlet value: any = item\n\n\tfor (const part of parts) {\n\t\tif (value == null) return undefined as unknown as T\n\t\tvalue = value[part]\n\t}\n\n\treturn value as T\n}\n\n/**\n * Compute the Levenshtein distance between two strings.\n */\nconst levenshtein = (a: string, b: string): number => {\n\tif (a === b) return 0\n\n\tconst matrix: number[][] = Array(b.length + 1)\n\t\t.fill(null)\n\t\t.map((_, i) => [i])\n\n\t// initialize the first row\n\tfor (let j = 0; j <= a.length; j++) {\n\t\tmatrix[0][j] = j\n\t}\n\n\tfor (let i = 1; i <= b.length; i++) {\n\t\tfor (let j = 1; j <= a.length; j++) {\n\t\t\tif (b.charAt(i - 1) === a.charAt(j - 1)) {\n\t\t\t\tmatrix[i][j] = matrix[i - 1][j - 1]\n\t\t\t} else {\n\t\t\t\tmatrix[i][j] = Math.min(\n\t\t\t\t\tmatrix[i - 1][j] + 1, // deletion\n\t\t\t\t\tmatrix[i][j - 1] + 1, // insertion\n\t\t\t\t\tmatrix[i - 1][j - 1] + 1, // substitution\n\t\t\t\t)\n\t\t\t}\n\t\t}\n\t}\n\treturn matrix[b.length][a.length]\n}\n\n/**\n * Check if string `sub` is a subsequence of string `str`.\n * All characters in `sub` must appear in order in `str` (they need not be contiguous).\n */\nconst isSubsequence = (sub: string, str: string): boolean => {\n\tif (!sub) return true\n\tif (!str) return false\n\n\tlet i = 0,\n\t\tj = 0\n\twhile (i < sub.length && j < str.length) {\n\t\tif (sub[i].toLowerCase() === str[j].toLowerCase()) i++\n\t\tj++\n\t}\n\treturn i === sub.length\n}\n\n/**\n * Check if every character (with frequency) in the query exists in the target.\n * For example, \"aovc\" matches \"avocados\".\n */\nconst anagramMatch = (query: string, target: string): boolean => {\n\tif (!query) return true\n\tif (!target) return false\n\n\tconst countChars = (s: string): Record<string, number> =>\n\t\ts\n\t\t\t.toLowerCase()\n\t\t\t.split('')\n\t\t\t.reduce(\n\t\t\t\t(acc, char) => {\n\t\t\t\t\tacc[char] = (acc[char] || 0) + 1\n\t\t\t\t\treturn acc\n\t\t\t\t},\n\t\t\t\t{} as Record<string, number>,\n\t\t\t)\n\n\tconst queryCount = countChars(query)\n\tconst targetCount = countChars(target)\n\treturn Object.keys(queryCount).every(char => (targetCount[char] || 0) >= queryCount[char])\n}\n\n/**\n * Generate bigrams for a string.\n */\nconst getBigrams = (s: string): string[] => {\n\tif (!s || s.length < 2) return []\n\n\tconst bigrams: string[] = []\n\tfor (let i = 0; i < s.length - 1; i++) {\n\t\tbigrams.push(s.substring(i, i + 2).toLowerCase())\n\t}\n\treturn bigrams\n}\n\n/**\n * Compute Dice's coefficient for two strings based on bigrams.\n * Returns a value between 0 (no similarity) and 1 (perfect match).\n */\nconst diceCoefficient = (s1: string, s2: string): number => {\n\tif (!s1 || !s2 || s1.length < 2 || s2.length < 2) return 0\n\n\tconst bigrams1 = getBigrams(s1)\n\tconst bigrams2 = getBigrams(s2)\n\n\tif (bigrams1.length === 0 || bigrams2.length === 0) return 0\n\n\tlet intersection = 0\n\tconst used = new Array(bigrams2.length).fill(false)\n\n\tfor (const bigram of bigrams1) {\n\t\tfor (let i = 0; i < bigrams2.length; i++) {\n\t\t\tif (!used[i] && bigrams2[i] === bigram) {\n\t\t\t\tintersection++\n\t\t\t\tused[i] = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\treturn (2 * intersection) / (bigrams1.length + bigrams2.length)\n}\n\n/**\n * Compute a fuzzy similarity score between two strings.\n * The score is computed by taking the maximum of several methods:\n * - Direct substring match (score 1)\n * - Subsequence check (score 0.8)\n * - Anagram subset match (score 0.7)\n * - Dice coefficient\n * - Normalized Levenshtein similarity\n */\nconst computeFuzzyScore = (actual: string, expected: string): number => {\n\tif (!actual || !expected) return 0\n\n\tconst a = actual.toLowerCase().trim()\n\tconst b = expected.toLowerCase().trim()\n\n\tif (a === b) return 1\n\n\tconst substringScore = a.includes(b) ? 1 : 0\n\tconst subsequenceScore = isSubsequence(b, a) ? 0.8 : 0\n\tconst anagramScore = anagramMatch(b, a) ? 0.7 : 0\n\tconst diceScore = diceCoefficient(a, b)\n\n\tconst maxLen = Math.max(a.length, b.length)\n\tconst levenshteinScore = maxLen ? 1 - levenshtein(a, b) / maxLen : 0\n\n\treturn Math.max(substringScore, subsequenceScore, anagramScore, diceScore, levenshteinScore)\n}\n\n/**\n * Safely coerce value to string if possible, or return empty string\n */\nconst safeString = (value: unknown): string => {\n\tif (value == null) return ''\n\treturn String(value)\n}\n\n/**\n * Apply a query condition to an item and return score\n */\nfunction applyQueryCondition<T extends Record<string, any>>(\n\titem: T,\n\tquery: QueryCondition,\n\tfuzzyThreshold: number = 0.3,\n): { valid: boolean; score: number } {\n\tlet field: string,\n\t\top: ComparisonOperator,\n\t\texpected: unknown,\n\t\tstrict = false\n\n\tif (Array.isArray(query)) {\n\t\t;[field, op, expected, strict = false] = query\n\t} else {\n\t\t// Handle array of keys (OR logic)\n\t\tif (Array.isArray(query.key)) {\n\t\t\tconst results = query.key.map(k =>\n\t\t\t\tapplyQueryCondition(item, { ...query, key: k }, fuzzyThreshold)\n\t\t\t)\n\t\t\t// Return best valid result, or invalid if none valid\n\t\t\treturn results.reduce(\n\t\t\t\t(best, curr) => (curr.valid ? (curr.score > best.score ? curr : best) : best),\n\t\t\t\t{ valid: false, score: 0 }\n\t\t\t)\n\t\t}\n\n\t\tfield = query.key\n\t\top = query.operator\n\t\texpected = query.value\n\t\tstrict = query.strict || false\n\t}\n\n\t// Skip empty filters for non-strict queries\n\tif (!strict && (expected === '' || expected == null || (isArray(expected) && expected.length === 0))) {\n\t\treturn { valid: true, score: 1 }\n\t}\n\n\tconst actual = getFieldValue(item, field)\n\n\t// FIXED: Properly handle strict mode\n\tif (strict) {\n\t\t// For strict mode, use exact equality comparison for all operators except 'any'\n\t\tif (op === 'any') {\n\t\t\t// Fuzzy search still applies with strict mode\n\t\t\tif (typeof actual !== 'string' || typeof expected !== 'string') {\n\t\t\t\treturn { valid: false, score: 0 }\n\t\t\t}\n\n\t\t\tconst score = computeFuzzyScore(actual, expected)\n\t\t\treturn {\n\t\t\t\tvalid: score >= fuzzyThreshold,\n\t\t\t\tscore: score >= fuzzyThreshold ? score : 0,\n\t\t\t}\n\t\t} else {\n\t\t\t// For all other operators in strict mode,\n\t\t\t// delegate to compareValues function but return precise scores\n\t\t\tconst matches = compareValues(op, actual, expected)\n\t\t\treturn {\n\t\t\t\tvalid: matches,\n\t\t\t\tscore: matches ? 1 : 0,\n\t\t\t}\n\t\t}\n\t} else if (op === 'any') {\n\t\t// Fuzzy search requires both values to be strings\n\t\tif (typeof actual !== 'string' || typeof expected !== 'string') {\n\t\t\treturn { valid: false, score: 0 }\n\t\t}\n\n\t\tconst score = computeFuzzyScore(actual, expected)\n\t\tif (score < fuzzyThreshold) {\n\t\t\treturn { valid: false, score: 0 }\n\t\t}\n\n\t\treturn { valid: true, score }\n\t} else {\n\t\t// For non-fuzzy operators, check condition\n\t\tconst matches = compareValues(op, actual, expected)\n\t\treturn {\n\t\t\tvalid: matches,\n\t\t\tscore: matches ? 1 : 0,\n\t\t}\n\t}\n}\n\n/**\n * Filter a Map of items given an array of query conditions.\n * For each query condition:\n * - If the expected value is empty/null/undefined, it is treated as a match.\n * - For non-fuzzy operators, the condition must strictly match.\n * - For the \"any\" operator, a fuzzy similarity score is computed.\n *   Items with a fuzzy score below a given threshold (e.g., 0.3) are excluded.\n *\n * The overall item score is the average of the scores from all conditions.\n * The results are sorted in descending order of relevance.\n *\n * @param items - A Map containing items to filter.\n * @param queries - An array of query conditions to apply.\n * @param fuzzyThreshold - Minimum score required for fuzzy matches (default: 0.3)\n * @returns An array of items that match all query conditions, sorted by relevance.\n */\nexport function filterMapItems<T extends Record<string, any>>(\n\titems: Map<string, T>,\n\tqueries: QueryCondition[] = [],\n\tfuzzyThreshold: number = 0.3,\n): T[] {\n\t// If no queries, return all items unsorted\n\tif (!queries.length) {\n\t\treturn Array.from(items.values())\n\t}\n\n\t// Score and filter each item\n\tconst scoredItems: ScoredItem<T>[] = []\n\n\tfor (const [_, item] of items.entries()) {\n\t\tlet totalScore = 0\n\t\tlet matchCount = 0\n\t\tlet valid = true\n\n\t\tfor (const query of queries) {\n\t\t\tconst result = applyQueryCondition(item, query, fuzzyThreshold)\n\n\t\t\tif (!result.valid) {\n\t\t\t\tvalid = false\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\ttotalScore += result.score\n\t\t\tmatchCount++\n\t\t}\n\n\t\tif (valid) {\n\t\t\tscoredItems.push({\n\t\t\t\titem,\n\t\t\t\tscore: matchCount > 0 ? totalScore / matchCount : 1,\n\t\t\t})\n\t\t}\n\t}\n\n\t// Sort by descending score\n\tscoredItems.sort((a, b) => b.score - a.score)\n\n\treturn scoredItems.map(x => x.item)\n}\n\n/**\n * Filter an array of items using query conditions\n */\nexport function filterArrayItems<T extends Record<string, any>>(\n\titems: T[],\n\tqueries: QueryCondition[] = [],\n\tfuzzyThreshold: number = 0.3,\n): T[] {\n\t// Create temporary map with numeric indices as keys\n\tconst map = new Map<string, T>()\n\titems.forEach((item, index) => map.set(String(index), item))\n\n\treturn filterMapItems(map, queries, fuzzyThreshold)\n}\n\n// Improved type guards for filter-directive.ts\n\n/**\n * Type guard for checking if a value is an array with better type inference\n * @param value Value to check\n * @returns True if the value is an array\n */\nexport function isArray<T = unknown>(value: unknown): value is Array<T> {\n\treturn Array.isArray(value)\n}\n\n/**\n * Type guard for checking if a value is a string\n * @param value Value to check\n * @returns True if the value is a string\n */\nexport function isString(value: unknown): value is string {\n\treturn typeof value === 'string'\n}\n\n/**\n * Type guard for checking if a value is a number\n * @param value Value to check\n * @returns True if the value is a number and not NaN\n */\nexport function isNumber(value: unknown): value is number {\n\treturn typeof value === 'number' && !isNaN(value)\n}\n\n/**\n * Type guard for checking if a value is a date\n * @param value Value to check\n * @returns True if the value is a valid Date object\n */\nexport function isDate(value: unknown): value is Date {\n\treturn value instanceof Date && !isNaN(value.getTime())\n}\n\n/**\n * Type guard for checking if a value is an iterable collection\n * @param value Value to check\n * @returns True if the value implements the iterable protocol\n */\nexport function isIterable<T = unknown>(value: unknown): value is Iterable<T> {\n\t// Must be non-null and of type 'object'\n\tif (value == null || typeof value !== 'object') {\n\t\treturn false\n\t}\n\n\t// Check for Symbol.iterator method\n\treturn Symbol.iterator in Object(value) && typeof (value as any)[Symbol.iterator] === 'function'\n}\n\n/**\n * Type guard for checking if a value is a Map\n * @param value Value to check\n * @returns True if the value is a Map\n */\nexport function isMap<K = unknown, V = unknown>(value: unknown): value is Map<K, V> {\n\treturn value instanceof Map\n}\n\n/**\n * Type guard for checking if a value is a Set\n * @param value Value to check\n * @returns True if the value is a Set\n */\nexport function isSet<T = unknown>(value: unknown): value is Set<T> {\n\treturn value instanceof Set\n}\n\n/**\n * Type guard for checking if a value is a plain object (not an array, Map, etc.)\n * @param value Value to check\n * @returns True if the value is a plain object\n */\nexport function isPlainObject(value: unknown): value is Record<string, unknown> {\n\tif (value === null || typeof value !== 'object') {\n\t\treturn false\n\t}\n\n\tconst proto = Object.getPrototypeOf(value)\n\treturn proto === Object.prototype || proto === null\n}\n\n/**\n * Type guard for checking if a value is undefined or null\n * @param value Value to check\n * @returns True if the value is undefined or null\n */\nexport function isNil(value: unknown): value is undefined | null {\n\treturn value === undefined || value === null\n}\n\n/**\n * Improved type-safe comparison function that uses appropriate type guards\n * @param op Comparison operator\n * @param actual Actual value\n * @param expected Expected value\n * @returns Result of the comparison\n */\nexport function compareValues(op: ComparisonOperator, actual: unknown, expected: unknown): boolean {\n\t// Handle null/undefined cases\n\tif (isNil(actual) && isNil(expected)) return true\n\tif (isNil(actual) || isNil(expected)) {\n\t\t// For equality operators, null == null but null != non-null\n\t\tif (op === '==') return actual === expected\n\t\tif (op === '!=') return actual !== expected\n\t\t// Other operators should return false for null/undefined values\n\t\treturn false\n\t}\n\n\tswitch (op) {\n\t\tcase '==':\n\t\t\treturn actual === expected\n\t\tcase '!=':\n\t\t\treturn actual !== expected\n\t\tcase '>':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual > expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() > expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) > 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '<':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual < expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() < expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) < 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '>=':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual >= expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() >= expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) >= 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '<=':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual <= expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() <= expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) <= 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase 'includes': {\n\t\t\tif (isString(actual)) {\n\t\t\t\treturn actual.toLowerCase().includes(safeString(expected).toLowerCase())\n\t\t\t}\n\t\t\tif (isArray(actual)) {\n\t\t\t\treturn actual.includes(expected as any)\n\t\t\t}\n\t\t\tif (isSet(actual)) {\n\t\t\t\treturn actual.has(expected as any)\n\t\t\t}\n\t\t\tif (isMap(actual)) {\n\t\t\t\treturn Array.from(actual.values()).includes(expected as any)\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'notIncludes': {\n\t\t\tif (isString(actual)) {\n\t\t\t\treturn !actual.toLowerCase().includes(safeString(expected).toLowerCase())\n\t\t\t}\n\t\t\tif (isArray(actual)) {\n\t\t\t\treturn !actual.includes(expected as any)\n\t\t\t}\n\t\t\tif (isSet(actual)) {\n\t\t\t\treturn !actual.has(expected as any)\n\t\t\t}\n\t\t\tif (isMap(actual)) {\n\t\t\t\treturn !Array.from(actual.values()).includes(expected as any)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t\tcase 'startsWith': {\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.toLowerCase().startsWith(expected.toLowerCase())\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'endsWith': {\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.toLowerCase().endsWith(expected.toLowerCase())\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'in': {\n\t\t\tif (isArray(expected)) {\n\t\t\t\treturn expected.includes(actual as any)\n\t\t\t}\n\t\t\tif (isSet(expected)) {\n\t\t\t\treturn expected.has(actual as any)\n\t\t\t}\n\t\t\tif (isMap(expected)) {\n\t\t\t\treturn expected.has(actual as any) || Array.from(expected.values()).includes(actual as any)\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'notIn': {\n\t\t\tif (isArray(expected)) {\n\t\t\t\treturn !expected.includes(actual as any)\n\t\t\t}\n\t\t\tif (isSet(expected)) {\n\t\t\t\treturn !expected.has(actual as any)\n\t\t\t}\n\t\t\tif (isMap(expected)) {\n\t\t\t\treturn !expected.has(actual as any) && !Array.from(expected.values()).includes(actual as any)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t\tdefault: {\n\t\t\tconsole.warn(`Operator \"${op}\" is not supported in comparison.`)\n\t\t\treturn false\n\t\t}\n\t}\n}\n\n// Export a simpler alias for filterMapItems\nexport const filterMap = filterMapItems\n\n// Export an alias for filterArrayItems\nexport const filterArray = filterArrayItems\n","// src/store/selectors.ts\nimport { BehaviorSubject, Observable, combineLatest, distinctUntilChanged, map, share, shareReplay } from 'rxjs'\nimport { ICollectionStore, IStore, StoreError } from './types'\n\n/**\n * Deep equality comparison for maps and complex objects\n * More efficient than JSON.stringify for large objects\n */\nfunction deepEqual(a: unknown, b: unknown): boolean {\n\tif (a === b) return true\n\n\tif (a instanceof Map && b instanceof Map) {\n\t\tif (a.size !== b.size) return false\n\t\tfor (const [key, value] of a) {\n\t\t\tif (!b.has(key) || !deepEqual(value, b.get(key))) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (a instanceof Set && b instanceof Set) {\n\t\tif (a.size !== b.size) return false\n\t\tfor (const item of a) {\n\t\t\tif (!b.has(item)) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (typeof a === 'object' && a !== null && typeof b === 'object' && b !== null) {\n\t\tconst keysA = Object.keys(a)\n\t\tconst keysB = Object.keys(b)\n\n\t\tif (keysA.length !== keysB.length) return false\n\n\t\tfor (const key of keysA) {\n\t\t\t// @ts-ignore: Index signature\n\t\t\tif (!deepEqual(a[key], b[key])) return false\n\t\t}\n\n\t\treturn true\n\t}\n\n\treturn false\n}\n\n/**\n * Creates a selector that derives a value from store state\n *\n * @param store The store to observe\n * @param selectorFn Function that transforms the state\n * @returns An observable of the selected state that only emits when the derived value changes\n */\nexport function createSelector<T, R>(store: IStore<T>, selectorFn: (state: T) => R): Observable<R> {\n\treturn store.$.pipe(map(selectorFn), distinctUntilChanged<R>(deepEqual), shareReplay(1))\n}\n\n/**\n * Creates a selector for collection stores that derives a value from the collection\n *\n * @param store The collection store to observe\n * @param selectorFn Function that transforms the collection\n * @returns An observable of the selected state that only emits when the derived value changes\n */\nexport function createCollectionSelector<T, R>(\n\tstore: ICollectionStore<T>,\n\tselectorFn: (state: Map<string, T>) => R,\n): Observable<R> {\n\treturn store.$.pipe(map(selectorFn), distinctUntilChanged<R>(deepEqual), shareReplay(1))\n}\n\n/**\n * Creates a selector that returns all items from a collection as an array\n *\n * @param store The collection store\n * @returns An observable of all items as an array\n */\nexport function createItemsSelector<T>(store: ICollectionStore<T>): Observable<T[]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.values()))\n}\n\n/**\n * Creates a selector that retrieves a single item from a collection\n *\n * @param store The collection store\n * @param itemKey The key of the item to select\n * @returns An observable of the selected item that emits when the item changes\n */\nexport function createItemSelector<T>(store: ICollectionStore<T>, itemKey: string): Observable<T | undefined> {\n\treturn createCollectionSelector(store, collection => collection.get(itemKey))\n}\n\n/**\n * Creates a selector that returns all keys from a collection\n */\nexport function createKeysSelector<T>(store: ICollectionStore<T>): Observable<string[]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.keys()))\n}\n\n/**\n * Creates a selector that returns entries (key-value pairs) from a collection\n */\nexport function createEntriesSelector<T>(store: ICollectionStore<T>): Observable<[string, T][]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.entries()))\n}\n\n/**\n * Creates a selector that sorts collection items\n */\nexport function createSortSelector<T>(store: ICollectionStore<T>, compareFn: (a: T, b: T) => number): Observable<T[]> {\n\treturn createCollectionSelector(store, collection => {\n\t\treturn Array.from(collection.values()).sort(compareFn)\n\t})\n}\n\n/**\n * Creates a selector that finds the first item matching a predicate\n */\nexport function createFindSelector<T>(\n\tstore: ICollectionStore<T>,\n\tpredicate: (item: T, key: string) => boolean,\n): Observable<T | undefined> {\n\treturn createCollectionSelector(store, collection => {\n\t\tfor (const [key, item] of collection.entries()) {\n\t\t\tif (predicate(item, key)) {\n\t\t\t\treturn item\n\t\t\t}\n\t\t}\n\t\treturn undefined\n\t})\n}\n\n/**\n * Creates a selector that filters items from a collection - OPTIMIZED\n *\n * @param store The collection store\n * @param filterFn Function that returns true for items to include\n * @returns An observable of filtered items as an array\n */\nexport function createFilterSelector<T>(\n\tstore: ICollectionStore<T>,\n\tfilterFn: (item: T, key: string) => boolean,\n): Observable<T[]> {\n\treturn createCollectionSelector(store, collection =>\n\t\tArray.from(collection.entries())\n\t\t\t.filter(([key, item]) => filterFn(item, key))\n\t\t\t.map(([_, item]) => item),\n\t)\n}\n\n/**\n * Creates a selector that maps collection values through a transform function - OPTIMIZED\n */\nexport function createMapSelector<T, R>(\n\tstore: ICollectionStore<T>,\n\tmapFn: (item: T, key: string) => R,\n): Observable<R[]> {\n\treturn createCollectionSelector(store, collection =>\n\t\tArray.from(collection.entries()).map(([key, item]) => mapFn(item, key)),\n\t)\n}\n\n/**\n * Creates a selector that counts items in a collection, optionally filtered - OPTIMIZED\n *\n * @param store The collection store\n * @param filterFn Optional function to filter which items to count\n * @returns An observable of the count\n */\nexport function createCountSelector<T>(\n\tstore: ICollectionStore<T>,\n\tfilterFn?: (item: T, key: string) => boolean,\n): Observable<number> {\n\treturn createCollectionSelector(store, collection => {\n\t\tif (!filterFn) return collection.size\n\n\t\treturn Array.from(collection.entries()).filter(([key, item]) => filterFn(item, key)).length\n\t})\n}\n\n/**\n * Optimized RxJS Pipeline - use share with reset on refCount zero for better memory management\n * in scenarios where selector subscriptions come and go\n *\n * @param store The store to observe\n * @param selectorFn Function that transforms the state\n * @returns An observable of the selected state with improved memory management\n */\nexport function createOptimizedSelector<T, R>(store: IStore<T>, selectorFn: (state: T) => R): Observable<R> {\n\treturn store.$.pipe(\n\t\tmap(selectorFn),\n\t\tdistinctUntilChanged<R>(deepEqual),\n\t\tshare({\n\t\t\tresetOnRefCountZero: true,\n\t\t\tresetOnError: false,\n\t\t\tresetOnComplete: false,\n\t\t}),\n\t)\n}\n\n/**\n * Creates a compound selector from multiple stores\n *\n * This function combines data from multiple stores to create a derived\n * state that's compatible with the @select decorator.\n *\n * @param stores Array of stores to derive state from\n * @param selectorFns Selector functions for each store\n * @param combinerFn Function that combines the selected values\n * @returns A store-compatible object to use with @select\n */\nexport function createCompoundSelector<R>(\n\tstores: Array<IStore<any> | ICollectionStore<any>>,\n\tselectorFns: Array<(state: any) => any>,\n\tcombinerFn: (...values: any[]) => R,\n): IStore<R> {\n\t// Calculate initial value\n\tconst initialValues = stores.map((store, index) => selectorFns[index](store.value))\n\tconst initialValue = combinerFn(...initialValues)\n\n\t// Create a store with the initial value\n\tconst result: IStore<R> = {\n\t\t$: new BehaviorSubject<R>(initialValue),\n\t\terror$: new BehaviorSubject<StoreError | null>(null),\n\t\tready: true,\n\t\tdefaultValue: initialValue,\n\n\t\tget value(): R {\n\t\t\treturn this.$.getValue()\n\t\t},\n\n\t\t// These methods are no-ops for read-only stores\n\t\tset(_value: Partial<R>, _merge?: boolean): void {\n\t\t\tconsole.warn('Compound selector store is read-only')\n\t\t},\n\n\t\tclear(): void {\n\t\t\tthis.$.next(this.defaultValue)\n\t\t},\n\n\t\treplace(_newValue: R): void {\n\t\t\tconsole.warn('Compound selector store is read-only')\n\t\t},\n\n\t\tdelete<K extends keyof R>(_key: K): void {\n\t\t\tconsole.warn('Compound selector store is read-only')\n\t\t},\n\n\t\tdestroy(): void {\n\t\t\tthis.$.complete()\n\t\t\tthis.error$.complete()\n\t\t},\n\t}\n\n\t// Set up the reactivity by subscribing to all source stores\n\tconst observables = stores.map((store, _) => store.$)\n\n\t// Create a subscription that updates the result whenever any source changes\n\tconst subscription = combineLatest(observables).subscribe({\n\t\tnext: storeValues => {\n\t\t\ttry {\n\t\t\t\t// Apply selectors to each store value\n\t\t\t\tconst selectedValues = storeValues.map((value, index) => selectorFns[index](value))\n\n\t\t\t\t// Apply combiner function\n\t\t\t\tconst newValue = combinerFn(...selectedValues)\n\n\t\t\t\t// Update the BehaviorSubject\n\t\t\t\tresult.$.next(newValue)\n\t\t\t} catch (err) {\n\t\t\t\tconst error = new StoreError('Error in compound selector', err)\n\t\t\t\tresult.error$.next(error)\n\t\t\t\tconsole.error(error)\n\t\t\t}\n\t\t},\n\t\terror: err => {\n\t\t\tconst error = new StoreError('Error in store subscription', err)\n\t\t\tresult.error$.next(error)\n\t\t\tconsole.error(error)\n\t\t},\n\t})\n\n\t// Ensure the subscription is cleaned up when the store is destroyed\n\tconst originalDestroy = result.destroy\n\tresult.destroy = function () {\n\t\tsubscription.unsubscribe()\n\t\toriginalDestroy.call(this)\n\t}\n\n\treturn result\n}\n","// src/store/selector-hook.ts - Improved memory management\nimport { property as litProperty } from 'lit/decorators.js'\nimport { Observable, Subject, Subscription } from 'rxjs'\nimport { takeUntil } from 'rxjs/operators'\nimport { createCollectionSelector, createSelector } from './selectors'\nimport { ICollectionStore, IStore } from './types'\n\n/**\n * Symbol used for storing cleanup resources\n * Using a Symbol prevents name collisions with component properties\n */\nconst CLEANUP_SUBJECT = Symbol('selectorCleanup')\nconst SUBSCRIPTIONS = Symbol('selectorSubscriptions')\nconst INITIALIZED = Symbol('selectorInitialized')\nconst CONNECTED_CALLED = Symbol('connectedCallbackCalled')\n\n/**\n * Component lifecycle interface\n */\ninterface ComponentWithLifecycle {\n\t// Lifecycle hooks\n\tisConnected: boolean\n\tdisconnectedCallback?: () => void\n\tconnectedCallback?: () => void\n\trequestUpdate?: () => void\n\n\t// Internal properties using symbols to avoid name collisions\n\t[CLEANUP_SUBJECT]?: Subject<void>\n\t[SUBSCRIPTIONS]?: Map<string, Subscription>\n\t[INITIALIZED]?: Set<string>\n\t[CONNECTED_CALLED]?: boolean\n\n\t// Value storage\n\t[key: string]: any\n}\n\n/**\n * Property descriptor interface\n */\ntype PropertyDescriptor<T> = {\n\tget?: () => T\n\tset?: (value: T) => void\n\tvalue?: T\n\tconfigurable?: boolean\n\tenumerable?: boolean\n\twritable?: boolean\n}\n\n/**\n * Options for selecting from a store\n */\ninterface SelectOptions {\n\t/** If true, will wait for selector to emit a value (including null) before calling connectedCallback. Only undefined is considered \"not ready\". Default is true. */\n\trequired?: boolean\n\n\t/** If true, will only update the component and not set the property value */\n\tupdateOnly?: boolean\n\n\t/** If true, will use structuredClone to deeply clone values (prevents mutations) */\n\tdeepClone?: boolean\n\n\t/** Custom equality function to determine when to update */\n\tequals?: (a: any, b: any) => boolean\n\n\t/** Debug mode - logs selector activity */\n\tdebug?: boolean\n}\n\n/**\n * Type guard to check if a store is a collection store\n */\nfunction isCollectionStore<T>(store: IStore<any> | ICollectionStore<T>): store is ICollectionStore<T> {\n\treturn 'set' in store && typeof store.set === 'function' && store.value instanceof Map\n}\n\n/**\n * Ensures the cleanup resources exist on the component\n */\nfunction ensureCleanupResources(component: ComponentWithLifecycle): void {\n\tif (!component[CLEANUP_SUBJECT] || component[CLEANUP_SUBJECT].closed) {\n\t\tcomponent[CLEANUP_SUBJECT] = new Subject<void>()\n\t}\n\n\tif (!component[SUBSCRIPTIONS]) {\n\t\tcomponent[SUBSCRIPTIONS] = new Map()\n\t}\n\n\tif (!component[INITIALIZED]) {\n\t\tcomponent[INITIALIZED] = new Set()\n\t}\n}\n\n/**\n * Cleans up all selector resources\n */\nfunction cleanupSelectorResources(component: ComponentWithLifecycle): void {\n\tif (component[CLEANUP_SUBJECT]) {\n\t\tcomponent[CLEANUP_SUBJECT].next()\n\t\tcomponent[CLEANUP_SUBJECT].complete()\n\t\tcomponent[CLEANUP_SUBJECT] = undefined\n\t}\n\n\tif (component[SUBSCRIPTIONS]) {\n\t\tcomponent[SUBSCRIPTIONS].forEach(sub => sub.unsubscribe())\n\t\tcomponent[SUBSCRIPTIONS].clear()\n\t\tcomponent[SUBSCRIPTIONS] = undefined\n\t}\n\n\tif (component[INITIALIZED]) {\n\t\tcomponent[INITIALIZED].clear()\n\t\tcomponent[INITIALIZED] = undefined\n\t}\n\n\t// Reset the connected flag when cleaning up\n\tcomponent[CONNECTED_CALLED] = undefined\n}\n\n/**\n * Selector decorator that connects a component property to a store selector\n * with improved memory management\n *\n * @param store The store to select from\n * @param selectorFn Optional function to transform the store state\n * @param options Additional options for the selector\n */\nexport function select<T, R>(\n\tstore: IStore<T> | ICollectionStore<T>,\n\tselectorFn: (state: any) => R = (state: R) => state,\n\toptions: SelectOptions = { required: true },\n) {\n\treturn function (proto: Record<string, any>, propName: string, _descriptor?: PropertyDescriptor<R>) {\n\t\t// Register as a Lit property\n\t\tlitProperty({ attribute: false, type: Object })(proto, propName)\n\n\t\t// Store original lifecycle methods\n\t\tconst originalConnectedCallback = proto.connectedCallback\n\t\tconst originalDisconnectedCallback = proto.disconnectedCallback\n\n\t\t// Override connectedCallback to set up subscription\n\t\tproto.connectedCallback = function (this: ComponentWithLifecycle) {\n\t\t\t// Initialize cleanup resources\n\t\t\tensureCleanupResources(this)\n\n\t\t\t// Create the appropriate selector\n\t\t\tconst selector: Observable<R> = isCollectionStore(store)\n\t\t\t\t? createCollectionSelector(store, selectorFn)\n\t\t\t\t: createSelector(store as IStore<T>, selectorFn)\n\n\t\t\t// Call original connectedCallback immediately if not waiting for data\n\t\t\tif (!options.required && !this[CONNECTED_CALLED]) {\n\t\t\t\toriginalConnectedCallback?.call(this)\n\t\t\t\tthis[CONNECTED_CALLED] = true\n\t\t\t}\n\n\t\t\t// Clean up any existing subscription\n\t\t\tif (this[SUBSCRIPTIONS]!.has(propName)) {\n\t\t\t\tthis[SUBSCRIPTIONS]!.get(propName)?.unsubscribe()\n\t\t\t\tthis[SUBSCRIPTIONS]!.delete(propName)\n\t\t\t}\n\n\t\t\t// Debug log if needed\n\t\t\tif (options.debug) {\n\t\t\t\tconsole.debug(`[select] Setting up subscription for ${propName}`)\n\t\t\t}\n\n\t\t\t// Create new subscription with better error handling\n\t\t\tconst subscription = selector.pipe(takeUntil(this[CLEANUP_SUBJECT]!)).subscribe({\n\t\t\t\tnext: (value: R) => {\n\t\t\t\t\t// Handle value updates\n\t\t\t\t\tconst newValue = options.deepClone ? structuredClone(value) : value\n\n\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\tconsole.debug(`[select] New value for ${propName}:`, newValue)\n\t\t\t\t\t}\n\n\t\t\t\t\tif (!options.updateOnly) {\n\t\t\t\t\t\tthis[propName] = newValue\n\t\t\t\t\t}\n\n\t\t\t\t\tthis.requestUpdate?.()\n\n\t\t\t\t\t// If required and not initialized, call connectedCallback when we get a value\n\t\t\t\t\t// Allow null values but not undefined (undefined means the selector hasn't emitted yet)\n\t\t\t\t\tif (options.required && !this[INITIALIZED]!.has(propName) && newValue !== undefined) {\n\t\t\t\t\t\tthis[INITIALIZED]!.add(propName)\n\t\t\t\t\t\t\n\t\t\t\t\t\t// Only call original connectedCallback once, regardless of how many selectors\n\t\t\t\t\t\tif (!this[CONNECTED_CALLED]) {\n\t\t\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\t\t\tconsole.debug(`[select] Calling delayed connectedCallback for ${propName}`)\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\toriginalConnectedCallback?.call(this)\n\t\t\t\t\t\t\tthis[CONNECTED_CALLED] = true\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\terror: (err: Error) => {\n\t\t\t\t\tconsole.error(`Error in selector subscription for ${propName}:`, err)\n\t\t\t\t\t// Resubscribe on error to prevent component from becoming unresponsive\n\t\t\t\t\tif (this.isConnected) {\n\t\t\t\t\t\t// Small delay to prevent immediate resubscription\n\t\t\t\t\t\tsetTimeout(() => {\n\t\t\t\t\t\t\tif (this.isConnected) {\n\t\t\t\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\t\t\t\tconsole.debug(`[select] Resubscribing after error for ${propName}`)\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tthis.connectedCallback?.()\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}, 1000)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t})\n\n\t\t\t// Store the subscription for cleanup\n\t\t\tthis[SUBSCRIPTIONS]!.set(propName, subscription)\n\t\t}\n\n\t\t// Override disconnectedCallback to clean up subscriptions\n\t\tproto.disconnectedCallback = function (this: ComponentWithLifecycle) {\n\t\t\t// Call original disconnectedCallback\n\t\t\toriginalDisconnectedCallback?.call(this)\n\n\t\t\t// Debug log if needed\n\t\t\tif (options.debug) {\n\t\t\t\tconsole.debug(`[select] Cleaning up resources in disconnectedCallback`)\n\t\t\t}\n\n\t\t\t// Clean up all subscription resources\n\t\t\tcleanupSelectorResources(this)\n\t\t}\n\t}\n}\n\n/**\n * Creates a selector decorator that selects a specific item from a collection store\n * with improved memory management\n *\n * @param store The collection store\n * @param keyGetter Function that returns the key to select\n * @param options Additional options\n */\nexport function selectItem<T>(\n\tstore: ICollectionStore<T>,\n\tkeyGetter: (component: any) => string,\n\toptions: SelectOptions = { required: true },\n) {\n\treturn function (proto: Record<string, any>, propName: string, _descriptor?: PropertyDescriptor<T | undefined>) {\n\t\tselect(\n\t\t\tstore,\n\t\t\tfunction (state) {\n\t\t\t\t// This will be evaluated during subscription, when 'this' is available\n\t\t\t\tconst itemKey = keyGetter(this)\n\t\t\t\treturn itemKey ? state.get(itemKey) : undefined\n\t\t\t},\n\t\t\toptions,\n\t\t)(proto, propName)\n\t}\n}\n"],"x_google_ignoreList":[0],"mappings":";;;AACA,IAAI,KAAU,OAAO,IAAI,gBAAA,EACrB,IAAY,OAAO,IAAI,kBAAA,EACvB,IAAc,OAAO,IAAI,cAAA,EAGzB,KAAA,QAAA,IAAA,aAAkC,eA8BlC,EAAA,GA9BiD;CAEnD,SAAS,GAAA;AACP,SAAO,mBAAmB,EAAA,kFAAyF,EAAA;;CAErH,SAAS,GAAA;AACP,SAAO,sJAAsJ,EAAA;;CAE/J;CACA,SAAS,GAAA;AACP,SAAO,yHAAyH;;CAElI;CACA;CACA;CACA;CACA;CACA;CACA,SAAS,GAAA;AACP,SAAO,mCAAmC;;CAE5C;CACA;CACA;CACA;CACA,SAAS,GAAA;AACP,SAAO,oCAAoC;;CAAA;AAK/C,SAAS,EAAI,GAAA,GAAU,GAAA;AACrB,KAAA,QAAA,IAAA,aAA6B,cAAc;EACzC,IAAM,IAAI,GAAO,IACX,IAAM,EAAW,EAAA,GAAK,EAAE,MAAM,MAAM,EAAA,GAAQ;AAClD,QAAU,MAAM,WAAW,IAAA;;AAE7B,OAAU,MACR,8BAA8B,EAAA,yCAAA;;AAKlC,IAAI,IAAI,QACJ,IAAiB,EAAE,gBACnB,IAAc,eACd,KAAY,aACZ,KAAe,gBACf,IAAa,cACb,IAAW,YACX,IAAQ,SACR,KAAW,MAAA,CAAA,CAAY,KAAA,CAAA,CAAW,EAAM;AAC5C,SAAS,EAAY,GAAA;AACnB,QAAA,CAAA,CAAK,MAEEA,GAAc,EAAA,IAAUC,GAAQ,EAAA,IAAA,CAAA,CAAY,EAAM,MAAA,CAAA,CAAgB,EAAM,KAAe,MAAcC,GAAM,EAAA,IAAUC,GAAM,EAAA;;AAEpI,IAAI,KAAmB,EAAE,IAAW,GAAa,UAAA,EAC7C,qBAAoC,IAAI,SAAA;AAC5C,SAASH,GAAc,GAAA;AACrB,KAAA,CAAK,KAAA,CAAU,EAAY,EAAA,CACzB,QAAA,CAAO;CACT,IAAM,IAAQ,EAAe,EAAA;AAC7B,KAAI,MAAU,QAAQ,MAAU,EAAE,IAChC,QAAA,CAAO;CACT,IAAM,IAAO,EAAE,eAAe,KAAK,GAAO,EAAA,IAAgB,EAAM;AAChE,KAAI,MAAS,OACX,QAAA,CAAO;AACT,KAAA,CAAK,EAAW,EAAA,CACd,QAAA,CAAO;CACT,IAAI,IAAa,GAAkB,IAAI,EAAA;AAKvC,QAJI,MAIJ,KAJwB,MACtB,IAAa,SAAS,SAAS,KAAK,EAAA,EACpC,GAAkB,IAAI,GAAM,EAAA,GAEvB,MAAe;;AAOxB,SAAS,EAAK,GAAK,GAAM,IAAA,CAAS,GAAA;AACP,CAArB,EAAY,EAAA,KAAS,KACV,IAAS,QAAQ,QAAQ,EAAA,GAAO,EAAE,KAAK,EAAA,EAC/C,SAAS,MAAA;AACZ,IAAK,GAAK,EAAI,IAAM,EAAA;GAAA,GAGtB,EAAI,SAAS,GAAO,MAAU,EAAK,GAAO,GAAO,EAAA,CAAA;;AAGrD,SAAS,EAAY,GAAA;CACnB,IAAM,IAAQ,EAAM;AACpB,QAAO,IAAQ,EAAM,QAAQC,GAAQ,EAAA,GAAS,IAAgBC,GAAM,EAAA,GAAS,IAAcC,GAAM,EAAA,GAAS,IAAc;;AAE1H,IAAI,MAAO,GAAO,GAAM,IAAO,EAAY,EAAA,KAAW,MAAS,IAAc,EAAM,IAAI,EAAA,GAAQ,EAAE,IAAW,eAAe,KAAK,GAAO,EAAA,EACnI,MAAO,GAAO,GAAM,IAAO,EAAY,EAAA,KAEzC,MAAS,IAAc,EAAM,IAAI,EAAA,GAAQ,EAAM,IAE7C,MAAO,GAAO,GAAgB,GAAO,IAAO,EAAY,EAAA,KAAA;AAC7C,CAAT,MAAS,IACX,EAAM,IAAI,GAAgB,EAAA,GACnB,MAAS,IAChB,EAAM,IAAI,EAAA,GAEV,EAAM,KAAkB;GASxBF,KAAU,MAAM,SAChBC,MAAS,MAAW,aAAkB,KACtCC,MAAS,MAAW,aAAkB,KACtC,KAAe,MAA6B,OAAX,KAAW,UAC5C,KAAc,MAA6B,OAAX,KAAW,YAC3C,MAAa,MAA6B,OAAX,KAAW,WAU1C,KAAU,MAAU,EAAM,SAAS,EAAM,OACzC,MAAY,MAAA;CACd,IAAM,MAPa,MACd,EAAY,EAAA,GAEV,IAAQ,KADN,MAKwB,EAAA;AACjC,QAAO,IAAa,EAAW,SAAS,EAAW,QAAQ;GAEzD,MAAiB,MAAU,EAAM,YAAY,EAAM,QAAQ,EAAM;AACrE,SAAS,GAAY,GAAM,GAAA;AACzB,KAAID,GAAM,EAAA,CACR,QAAO,IAAI,IAAI,EAAA;AAEjB,KAAIC,GAAM,EAAA,CACR,QAAO,IAAI,IAAI,EAAA;AAEjB,KAAIF,GAAQ,EAAA,CACV,QAAO,MAAM,IAAW,MAAM,KAAK,EAAA;CACrC,IAAM,IAAUD,GAAc,EAAA;AAC9B,KAAA,CAAe,MAAX,KAAmB,MAAW,gBAAX,CAA4B,GAAS;EAC1D,IAAM,IAAc,EAAE,0BAA0B,EAAA;AAAA,SACzC,EAAY;EACnB,IAAI,IAAO,QAAQ,QAAQ,EAAA;AAC3B,OAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,KAAK;GACpC,IAAM,IAAM,EAAK,IACX,IAAO,EAAY;AAAA,IACF,MAAnB,EAAK,OACP,EAAK,KAAA,CAAY,GACjB,EAAK,MAAA,CAAgB,KAEnB,EAAK,OAAO,EAAK,SACnB,EAAY,KAAO;KAChB,KAAA,CAAe;KACf,IAAA,CAAW;KAEX,IAAa,EAAK;KAClB,IAAQ,EAAK;IAAA;;AAGpB,SAAO,EAAE,OAAO,EAAe,EAAA,EAAO,EAAA;;CACjC;EACL,IAAM,IAAQ,EAAe,EAAA;AAC7B,MAAI,MAAU,QAAQ,EACpB,QAAO,EAAA,GAAK,GAAA;EAEd,IAAM,IAAM,EAAE,OAAO,EAAA;AACrB,SAAO,EAAE,OAAO,GAAK,EAAA;;;AAGzB,SAAS,GAAO,GAAK,IAAA,CAAO,GAAA;AAC1B,QAAI,EAAS,EAAA,IAAQ,EAAQ,EAAA,IAAA,CAAS,EAAY,EAAA,KAE9C,EAAY,EAAA,GAAO,KACrB,EAAE,iBAAiB,GAAK;EACtB,KAAK;EACL,KAAK;EACL,OAAO;EACP,QAAQ;EAAA,CAAA,EAGZ,EAAE,OAAO,EAAA,EACL,KACF,EACE,IACC,GAAM,MAAA;AACL,KAAO,GAAA,CAAO,EAAA;IAAA,CAEhB,EAAA,GAhBK;;AAuBX,IAAI,IAA2B,EAAA,CAC5B,IAJH,WAAA;AACE,GAAI,EAAA;GAAA;AAKN,SAAS,EAAS,GAAA;AAChB,QAAI,MAAQ,QAAR,CAAiB,EAAY,EAAA,IAE1B,EAAE,SAAS,EAAA;;AAIpB,IAAI,IAAe,UACf,KAAgB,WAChB,KAAqB,gBACrB,KAAU,EAAA;AACd,SAAS,EAAU,GAAA;CACjB,IAAM,IAAS,GAAQ;AAIvB,QAHK,KACH,EAAI,GAAG,EAAA,EAEF;;AAET,IAOI,GAPA,MAAkB,MAAA,CAAA,CAAgB,GAAQ,IAQ1C,UAAwB;AAc5B,SAAS,GAAkB,GAAO,GAAA;AAC5B,OACF,EAAM,eAAe,EAAU,GAAA,EAC/B,EAAM,WAAW,EAAA,EACjB,EAAM,kBAAkB,EAAA,EACxB,EAAM,iBAAiB;;AAG3B,SAAS,GAAY,GAAA;AACnB,IAAW,EAAA,EACX,EAAM,QAAQ,QAAQ,GAAA,EACtB,EAAM,UAAU;;AAElB,SAAS,GAAW,GAAA;AACd,OAAU,MACZ,IAAe,EAAM;;AAGzB,IAAI,MAAc,MAAW,IA/BD;CAC1B,SAAS,EAAA;CACT,SA6BsD;CA5BtD,QA4BoE;CAzBpE,gBAAA,CAAgB;CAChB,oBAAoB;CACpB,6BAA6B,IAAI,KAAA;CACjC,sCAAsC,IAAI,KAAA;CAC1C,eAAe,GAAe,EAAA,GAAgB,EAAU,EAAA,GAAA,KAAqB;CAC7E,qBAAqB,GAAe,GAAA,GAAsB,EAAU,GAAA,GAAA,KAA2B;CAAA;AAqBjG,SAAS,GAAY,GAAA;CACnB,IAAM,IAAQ,EAAM;AACA,CAAhB,EAAM,UAAU,KAAkB,EAAM,UAAU,IACpD,EAAM,SAAA,GAEN,EAAM,WAAA,CAAW;;AAIrB,SAAS,GAAc,GAAQ,GAAA;AAC7B,GAAM,qBAAqB,EAAM,QAAQ;CACzC,IAAM,IAAY,EAAM,QAAQ;AAEhC,KADmB,MACnB,KADmC,KAAK,MAAW,GACnC;AACV,IAAU,GAAa,cACzB,GAAY,EAAA,EACZ,EAAI,EAAA,GAEF,EAAY,EAAA,KACd,IAASI,GAAS,GAAO,EAAA;EAE3B,IAAA,EAAM,cAAE,MAAiB;AACrB,OACF,EAAa,4BACX,EAAU,GAAa,OACvB,GACA,EAAA;OAIJ,KAASA,GAAS,GAAO,EAAA;AAO3B,QA4BF,SAAqB,GAAO,GAAO,IAAA,CAAO,GAAA;AAAA,GACnC,EAAM,WAAW,EAAM,OAAO,eAAe,EAAM,kBACtD,GAAO,GAAO,EAAA;GAnCJ,GAAO,GAAA,CAAQ,EAAA,EAC3B,GAAY,EAAA,EACR,EAAM,YACR,EAAM,eAAe,EAAM,UAAU,EAAM,gBAAA,EAEtC,MAAW,KAAU,KAAc,IAAd;;AAE9B,SAASA,GAAS,GAAW,GAAA;AAC3B,KAAI,EAAS,EAAA,CACX,QAAO;CACT,IAAM,IAAQ,EAAM;AACpB,KAAA,CAAK,EAEH,QADmB,EAAY,GAAO,EAAU,aAAa,EAAA;AAG/D,KAAA,CAAK,EAAY,GAAO,EAAA,CACtB,QAAO;AAET,KAAA,CAAK,EAAM,UACT,QAAO,EAAM;AAEf,KAAA,CAAK,EAAM,YAAY;EACrB,IAAA,EAAM,YAAE,MAAe;AACvB,MAAI,EACF,QAAO,EAAW,SAAS,GACR,GAAW,KAAX,CACR,EAAA;AAGb,KAA2B,GAAO,EAAA;;AAEpC,QAAO,EAAM;;AAOf,SAAS,GAAmB,GAAA;AAC1B,GAAM,aAAA,CAAa,GACnB,EAAM,OAAO;;AAEf,IAAI,KAAe,GAAO,MAAc,EAAM,WAAW,GACrD,KAAyB,EAAA;AAC7B,SAAS,GAAoB,GAAQ,GAAY,GAAgB,GAAA;CAC/D,IAAM,IAAa,EAAO,EAAA,EACpB,IAAa,EAAO;AAC1B,KAAI,MAAJ,KAAyB,KACF,GAAI,GAAY,GAAa,EAAA,KAC7B,EAEnB,QAAA,KADA,GAAI,GAAY,GAAa,GAAgB,EAAA;AAIjD,KAAA,CAAK,EAAO,iBAAiB;EAC3B,IAAM,IAAiB,EAAO,kCAAkC,IAAI,KAAA;AACpE,IAAK,IAAa,GAAK,MAAA;AACrB,OAAI,EAAQ,EAAA,EAAQ;IAClB,IAAM,IAAO,EAAe,IAAI,EAAA,IAAU,EAAA;AAC1C,MAAK,KAAK,EAAA,EACV,EAAe,IAAI,GAAO,EAAA;;IAAA;;CAIhC,IAAM,IAAY,EAAO,gBAAgB,IAAI,EAAA,IAAe;AAC5D,MAAK,IAAM,KAAY,EACrB,IAAI,GAAY,GAAU,GAAgB,EAAA;;AAe9C,SAAS,GAA2B,GAAO,GAAA;AAEzC,KADuB,EAAM,aAAA,CAAc,EAAM,eAAe,EAAM,UAAU,KAAe,EAAM,UAAU,KAAiB,EAAM,0BAA0B,EAAM,WAAW,QAAQ,KAAK,IAC1K;EAClB,IAAA,EAAM,cAAE,MAAiB;AACzB,MAAI,GAAc;GAChB,IAAM,IAAW,EAAa,QAAQ,EAAA;AAClC,QACF,EAAa,iBAAiB,GAAO,GAAU,EAAA;;AAGnD,KAAmB,EAAA;;;AAGvB,SAAS,GAAqB,GAAQ,GAAK,GAAA;CACzC,IAAA,EAAM,QAAE,MAAW;AACnB,KAAI,EAAQ,EAAA,EAAQ;EAClB,IAAM,IAAQ,EAAM;AAChB,IAAY,GAAO,EAAA,IACrB,EAAM,WAAW,KAAK,WAAA;AACpB,KAAY,EAAA,EAEZ,GAAoB,GAAQ,GADL,GAAc,EAAA,EACc,EAAA;IAAA;OAG9C,GAAY,EAAA,IACrB,EAAO,WAAW,KAAK,WAAA;EACrB,IAAM,IAAa,EAAO,EAAA;AACL,EAAjB,EAAO,UAAU,IACf,EAAW,IAAI,EAAA,IACjB,EAAY,GAAO,EAAO,aAAa,EAAA,GAGrC,GAAI,GAAY,GAAK,EAAO,MAAA,KAAW,KACrC,EAAO,QAAQ,SAAS,KAAA,CAA8C,OAAxC,EAAO,UAAU,IAAI,EAAA,IAAA,CAAQ,MAAmB,EAAO,SACvF,EACE,GAAI,EAAO,OAAO,GAAK,EAAO,MAAA,EAC9B,EAAO,aACP,EAAA;GAAA;;AAQd,SAAS,EAAY,GAAQ,GAAY,GAAA;AACvC,QAAA,CAAK,EAAU,OAAO,eAAe,EAAU,qBAAqB,KAGhE,EAAQ,EAAA,IAAW,EAAW,IAAI,EAAA,IAAA,CAAY,EAAY,EAAA,IAAW,EAAS,EAAA,KAGlF,EAAW,IAAI,EAAA,EACf,EAAK,IAAS,GAAK,MAAA;AACjB,MAAI,EAAQ,EAAA,EAAQ;GAClB,IAAM,IAAQ,EAAM;AAChB,KAAY,GAAO,EAAA,KAErB,GAAI,GAAQ,GADS,GAAc,EAAA,EACJ,EAAO,MAAA,EACtC,GAAmB,EAAA;QAEZ,GAAY,EAAA,IACrB,EAAY,GAAO,GAAY,EAAA;GAAA,GAf1B;;AA6DX,IAAI,IAAc;CAChB,IAAI,GAAO,GAAA;AACT,MAAI,MAAS,EACX,QAAO;EACT,IAAI,IAAc,EAAM,OAAO,qBACzB,IAAwB,EAAM,UAAU,KAAiC,OAAT,KAAS;AAC/E,MAAI,KACE,GAAa,uBAAuB,EAAA,CACtC,QAAO,EAAY,wBAAwB,GAAO,EAAA;EAGtD,IAAM,IAAS,EAAO,EAAA;AACtB,MAAA,CAAK,GAAI,GAAQ,GAAM,EAAM,MAAA,CAC3B,QAkHN,SAA2B,GAAO,GAAQ,GAAA;GACxC,IAAM,IAAO,GAAuB,GAAQ,EAAA;AAC5C,UAAO,IAAO,KAAS,IAAO,EAAK,KAGjC,EAAK,KAAK,KAAK,EAAM,OAAA,GAAA,KACd;IAxHoB,GAAO,GAAQ,EAAA;EAE1C,IAAM,IAAQ,EAAO;AAIrB,MAHI,EAAM,cAAA,CAAe,EAAY,EAAA,IAGjC,KAAyB,EAAM,mBAAmB,GAAa,sBACjE,EAAM,gBAAA,IA/XZ,SAAsB,GAAA;GACpB,IAAM,IAAA,CAAK;AACX,UAAO,OAAO,UAAU,EAAA,IAAM,OAAO,EAAA,KAAO;IA8XxB,EAAA,CAChB,QAAO;AAET,MAAI,MAAU,GAAK,EAAM,OAAO,EAAA,EAAO;AACrC,KAAY,EAAA;GACZ,IAAM,IAAW,EAAM,UAAU,IAAV,CAA2B,IAAO,GACnD,IAAa,EAAY,EAAM,QAAQ,GAAO,GAAO,EAAA;AAC3D,UAAO,EAAM,MAAM,KAAY;;AAEjC,SAAO;;CAET,MAAI,GAAO,MACF,KAAQ,EAAO,EAAA;CAExB,UAAQ,MACC,QAAQ,QAAQ,EAAO,EAAA,CAAA;CAEhC,IAAI,GAAO,GAAM,GAAA;EACf,IAAM,IAAO,GAAuB,EAAO,EAAA,EAAQ,EAAA;AACnD,MAAI,GAAM,IAER,QADA,EAAK,IAAI,KAAK,EAAM,QAAQ,EAAA,EAAA,CACrB;AAET,MAAA,CAAK,EAAM,WAAW;GACpB,IAAM,IAAW,GAAK,EAAO,EAAA,EAAQ,EAAA,EAC/B,IAAe,IAAW;AAChC,OAAI,KAAgB,EAAa,UAAU,EAGzC,QAFA,EAAM,MAAM,KAAQ,GACpB,EAAM,UAAU,IAAI,GAAA,CAAM,EAAA,EAAA,CACnB;AAET,SA5aM,IA4aC,QA5aE,IA4aK,KA1aT,MAAM,KAAK,IAAI,KAAM,IAAI,IAEzB,KAAM,KAAK,KAAM,OAwaM,MAxaN,KAwaqB,KAAK,GAAI,EAAM,OAAO,GAAM,EAAM,MAAA,EAC3E,QAAA,CAAO;AACT,KAAY,EAAA,EACZ,EAAY,EAAA;;EA/alB,IAAY,GAAG;AAibX,SAAI,EAAM,MAAM,OAAU,MACzB,MADyB,KACV,KAAK,KAAQ,EAAM,UACnC,OAAO,MAAM,EAAA,IAAU,OAAO,MAAM,EAAM,MAAM,GAAA,KAEhD,EAAM,MAAM,KAAQ,GACpB,EAAM,UAAU,IAAI,GAAA,CAAM,EAAA,EAC1B,GAAqB,GAAO,GAAM,EAAA,GAAA,CAHzB;;CAMX,iBAAe,GAAO,OACpB,EAAY,EAAA,EACR,GAAK,EAAM,OAAO,EAAA,KADV,KACyB,KAAK,KAAQ,EAAM,SACtD,EAAM,UAAU,IAAI,GAAA,CAAM,EAAA,EAC1B,EAAY,EAAA,IAEZ,EAAM,UAAU,OAAO,EAAA,EAErB,EAAM,SAAA,OACD,EAAM,MAAM,IAAA,CAEd;CAIT,yBAAyB,GAAO,GAAA;EAC9B,IAAM,IAAQ,EAAO,EAAA,EACf,IAAO,QAAQ,yBAAyB,GAAO,EAAA;AACrD,SAAK,KAEE;IACJ,IAAA,CAAW;IACX,KAAe,EAAM,UAAU,KAAiB,MAAS;IACzD,IAAa,EAAK;IAClB,IAAQ,EAAM;GAAA;;CAGnB,iBAAA;AACE,IAAI,GAAA;;CAEN,iBAAe,MACN,EAAe,EAAM,MAAA;CAE9B,iBAAA;AACE,IAAI,GAAA;;CAAA,EAGJ,IAAa,EAAA;AACjB,KAAK,IAAI,KAAO,GAAa;CAC3B,IAAI,IAAK,EAAY;AACrB,GAAW,KAAO,WAAA;EAChB,IAAM,IAAO;AAEb,SADA,EAAK,KAAK,EAAK,GAAG,IACX,EAAG,MAAM,MAAM,EAAA;;;AAa1B,SAAS,GAAK,GAAO,GAAA;CACnB,IAAM,IAAQ,EAAM;AAEpB,SADe,IAAQ,EAAO,EAAA,GAAS,GACzB;;AAUhB,SAAS,GAAuB,GAAQ,GAAA;AACtC,KAAA,EAAM,KAAQ,GACZ;CACF,IAAI,IAAQ,EAAe,EAAA;AAC3B,QAAO,IAAO;EACZ,IAAM,IAAO,OAAO,yBAAyB,GAAO,EAAA;AACpD,MAAI,EACF,QAAO;AACT,MAAQ,EAAe,EAAA;;;AAI3B,SAAS,EAAY,GAAA;AACd,GAAM,cACT,EAAM,YAAA,CAAY,GACd,EAAM,WACR,EAAY,EAAM,QAAA;;AAIxB,SAAS,EAAY,GAAA;AACd,CAEH,EAAM,WADN,EAAM,4BAA4B,IAAI,KAAA,EACxB,GACZ,EAAM,OACN,EAAM,OAAO,OAAO,sBAAA;;AAhD1B,EAAW,iBAAiB,SAAS,GAAO,GAAA;AAG1C,QAFA,QAAA,IAAA,aAA6B,gBAAgB,MAAM,SAAS,EAAA,CAAA,IAC1D,EAAI,GAAA,EACC,EAAW,IAAI,KAAK,MAAM,GAAO,GAAA,KAAW,EAAA;GAErD,EAAW,MAAM,SAAS,GAAO,GAAM,GAAA;AAGrC,QAFA,QAAA,IAAA,aAA6B,gBAAgB,MAAS,YAAY,MAAM,SAAS,EAAA,CAAA,IAC/E,EAAI,GAAA,EACC,EAAY,IAAI,KAAK,MAAM,EAAM,IAAI,GAAM,GAAO,EAAM,GAAA;;AA+MjE,SAAS,EAAY,GAAW,GAAO,GAAQ,GAAA;CAC7C,IAAA,CAAO,GAAO,KAASF,GAAM,EAAA,GAAS,EAAU,EAAA,CAAc,UAAU,GAAO,EAAA,GAAUC,GAAM,EAAA,GAAS,EAAU,EAAA,CAAc,UAAU,GAAO,EAAA,GA/WnJ,SAA0B,GAAM,GAAA;EAC9B,IAAM,IAAcF,GAAQ,EAAA,EACtB,IAAQ;GACZ,OAAO;GAEP,QAAQ,IAAS,EAAO,SAAS,GAAA;GAEjC,WAAA,CAAW;GAEX,YAAA,CAAY;GAGZ,WAAA,KAAgB;GAEhB,SAAS;GAET,OAAO;GAEP,QAAQ;GAGR,OAAO;GAEP,SAAS;GACT,WAAA,CAAW;GAEX,YAAA,KAAiB;GAAA,EAEf,IAAS,GACT,IAAQ;AACR,QACF,IAAS,CAAC,EAAA,EACV,IAAQ;EAEV,IAAA,EAAM,QAAE,GAAA,OAAQ,MAAU,MAAM,UAAU,GAAQ,EAAA;AAGlD,SAFA,EAAM,SAAS,GACf,EAAM,UAAU,GACT,CAAC,GAAO,EAAA;GA0U6J,GAAO,EAAA;AAgBnL,SAfc,GAAQ,UAAU,GAAA,EAC1B,QAAQ,KAAK,EAAA,EACnB,EAAM,aAAa,GAAQ,cAAc,EAAA,EACzC,EAAM,OAAO,GACT,KAAU,MAAV,KAAuB,IArc7B,SAA2C,GAAQ,GAAO,GAAA;AACxD,IAAO,WAAW,KAAK,SAAsB,GAAA;GAC3C,IAAM,IAAQ;AACd,OAAA,CAAK,KAAA,CAAU,EAAY,GAAO,EAAA,CAChC;AAEF,KAAU,eAAe,eAAe,EAAA;GACxC,IAAM,IAAiB,GAAc,EAAA;AACrC,MAAoB,GAAQ,EAAM,UAAU,GAAO,GAAgB,EAAA,EACnE,GAA2B,GAAO,EAAA;IAAA;GA6bA,GAAQ,GAAO,EAAA,GAEjD,EAAM,WAAW,KAAK,SAA0B,GAAA;AAC9C,IAAW,eAAe,eAAe,EAAA;EACzC,IAAA,EAAM,cAAE,MAAiB;AACrB,IAAM,aAAa,KACrB,EAAa,iBAAiB,GAAO,EAAA,EAAI,EAAA;GAAA,EAIxC;;AAST,SAAS,GAAY,GAAA;AACnB,KAAA,CAAK,EAAY,EAAA,IAAU,EAAS,EAAA,CAClC,QAAO;CACT,IAAM,IAAQ,EAAM,IAChB,GACA,IAAA,CAAS;AACb,KAAI,GAAO;AACT,MAAA,CAAK,EAAM,UACT,QAAO,EAAM;AACf,IAAM,aAAA,CAAa,GACnB,IAAO,GAAY,GAAO,EAAM,OAAO,OAAO,sBAAA,EAC9C,IAAS,EAAM,OAAO,OAAO,0BAAA;OAE7B,KAAO,GAAY,GAAA,CAAO,EAAA;AAY5B,QAVA,EACE,IACC,GAAK,MAAA;AACJ,KAAI,GAAM,GAAK,GAAY,EAAA,CAAA;IAE7B,EAAA,EAEE,MACF,EAAM,aAAA,CAAa,IAEd;;AAkvBT,IACI,IADQ,IAt8BC,MAAA;CACX,YAAY,GAAA;AACV,OAAK,cAAA,CAAc,GACnB,KAAK,wBAAA,CAAwB,GAC7B,KAAK,sBAAA,CAAsB,GAoB3B,KAAK,WAAW,GAAM,GAAQ,MAAA;AAC5B,OAAI,EAAW,EAAA,IAAA,CAAU,EAAW,EAAA,EAAS;IAC3C,IAAM,IAAc;AACpB,QAAS;IACT,IAAM,IAAO;AACb,WAAO,SAAwB,IAAQ,GAAA,GAAgB,GAAA;AACrD,YAAO,EAAK,QAAQ,IAAQ,MAAU,EAAO,KAAK,MAAM,GAAA,GAAU,EAAA,CAAA;;;GAOtE,IAAI;AACJ,OALK,EAAW,EAAA,IACd,EAAI,EAAA,EACF,MADE,KACqB,KAAM,EAAW,EAAA,IAC1C,EAAI,EAAA,EAEF,EAAY,EAAA,EAAO;IACrB,IAAM,IAAQ,GAAW,KAAA,EACnB,IAAQ,EAAY,GAAO,GAAA,KAAW,EAAA,EACxC,IAAA,CAAW;AACf,QAAA;AACE,SAAS,EAAO,EAAA,EAChB,IAAA,CAAW;cAAA;AAEP,SACF,GAAY,EAAA,GAEZ,GAAW,EAAA;;AAGf,WADA,GAAkB,GAAO,EAAA,EAClB,GAAc,GAAQ,EAAA;;AAAA,OAAA,CACnB,KAAA,CAAS,EAAY,EAAA,EAAO;AAQtC,QAPA,IAAS,EAAO,EAAA,EACZ,MADY,KACI,MAClB,IAAS,IACP,MAAW,OACb,IAAA,KAAc,IACZ,KAAK,eACP,GAAO,GAAA,CAAQ,EAAA,EACb,GAAe;KACjB,IAAM,IAAI,EAAA,EACJ,IAAK,EAAA;AACX,OAAU,GAAA,CAAe,4BAA4B,GAAM,GAAQ;MACjE,UAAU;MACV,iBAAiB;MAAA,CAAA,EAEnB,EAAc,GAAG,EAAA;;AAEnB,WAAO;;AAEP,KAAI,GAAG,EAAA;KAEX,KAAK,sBAAsB,GAAM,MAAA;AAC/B,OAAI,EAAW,EAAA,CACb,SAAQ,GAAA,GAAU,MAAS,KAAK,mBAAmB,IAAQ,MAAU,EAAK,GAAA,GAAU,EAAA,CAAA;GAEtF,IAAI,GAAS;AAKb,UAAO;IAJQ,KAAK,QAAQ,GAAM,IAAS,GAAG,MAAA;AAC5C,SAAU,GACV,IAAiB;MAAA;IAEH;IAAS;IAAA;KAEvB,GAAU,GAAQ,WAAA,IACpB,KAAK,cAAc,EAAO,WAAA,EACxB,GAAU,GAAQ,qBAAA,IACpB,KAAK,wBAAwB,EAAO,qBAAA,EAClC,GAAU,GAAQ,mBAAA,IACpB,KAAK,sBAAsB,EAAO,mBAAA;;CAEtC,YAAY,GAAA;AACL,IAAY,EAAA,IACf,EAAI,EAAA,EACF,EAAQ,EAAA,KACV,IAsFN,SAAiB,GAAA;AAGf,UAFK,EAAQ,EAAA,IACX,EAAI,IAAI,EAAA,EACH,GAAY,EAAA;IAzFA,EAAA;EACjB,IAAM,IAAQ,GAAW,KAAA,EACnB,IAAQ,EAAY,GAAO,GAAA,KAAW,EAAA;AAG5C,SAFA,EAAM,GAAa,YAAA,CAAY,GAC/B,GAAW,EAAA,EACJ;;CAET,YAAY,GAAO,GAAA;EACjB,IAAM,IAAQ,KAAS,EAAM;AACxB,OAAU,EAAM,aACnB,EAAI,EAAA;EACN,IAAA,EAAQ,QAAQ,MAAU;AAE1B,SADA,GAAkB,GAAO,EAAA,EAClB,GAAA,KAAmB,GAAG,EAAA;;CAO/B,cAAc,GAAA;AACZ,OAAK,cAAc;;CAOrB,wBAAwB,GAAA;AACtB,OAAK,wBAAwB;;CAQ/B,sBAAsB,GAAA;AACpB,OAAK,sBAAsB;;CAE7B,2BAAA;AACE,SAAO,KAAK;;CAEd,aAAa,GAAM,GAAA;EACjB,IAAI;AACJ,OAAK,IAAI,EAAQ,SAAS,GAAG,KAAK,GAAG,KAAK;GACxC,IAAM,IAAQ,EAAQ;AACtB,OAAI,EAAM,KAAK,WAAW,KAAK,EAAM,OAAO,WAAW;AACrD,QAAO,EAAM;AACb;;;AAGA,MAAA,OACF,IAAU,EAAQ,MAAM,IAAI,EAAA;EAE9B,IAAM,IAAmB,EAAU,GAAA,CAAe;AAClD,SAAI,EAAQ,EAAA,GACH,EAAiB,GAAM,EAAA,GAEzB,KAAK,QACV,IACC,MAAU,EAAiB,GAAO,EAAA,CAAA;;GAAA,CA0yBrB,SC3jDP,IAAb,MAAa,UAAgC,MAAA;CAU5C,YAAY,GAAiB,GAAW,GAAA;AACvC,QAAM,EAAA,EACN,KAAK,OAAO,cACZ,KAAK,QAAQ,GACb,KAAK,UAAU,GACf,KAAK,4BAAY,IAAI,MAAA,EAGjB,MAAM,qBACT,MAAM,kBAAkB,MAAM,EAAA;;CAOhC,SAAA;AACC,SAAO;GACN,MAAM,KAAK;GACX,SAAS,KAAK;GACd,OAAO,KAAK;GACZ,SAAS,KAAK;GACd,WAAW,KAAK,UAAU,aAAA;GAC1B,OAAO,KAAK;GAAA;;;AC3Cf,SAAS,GAAe,GAAc,GAAA;AACrC,QAAI,aAAiB,MACb;EACN,GAAQ;EACR,SAAS,MAAM,KAAK,EAAM,SAAA,CAAA;EAAA,GAGxB,aAAiB,MACb;EACN,GAAQ;EACR,QAAQ,MAAM,KAAK,EAAM,QAAA,CAAA;EAAA,GAGpB;;AASR,SAAS,GAAc,GAAc,GAAA;AACpC,KAAI,KAA0B,OAAV,KAAU,YAAY,OAAY,GAAO;EAC5D,IAAM,IAAQ;AAGd,MAAI,EAAM,MAAW,MACpB,QAAK,MAAM,QAAQ,EAAM,QAAA,IAKT,EAAM,QAAQ,OAAM,MAAK,MAAM,QAAQ,EAAA,IAAM,EAAE,WAAW,EAAX,GAKxD,IAAI,IAAI,EAAM,QAAA,GARb;AAYT,MAAI,EAAM,MAAW,MACpB,QAAK,MAAM,QAAQ,EAAM,OAAA,GAIlB,IAAI,IAAI,EAAM,OAAA,GAFb;;AAQV,QAAO;;AAMR,IAAa,KAAb,MAAA;CAAA,cAAA;AAAA,OAAA,OAC0B;;CAEzB,MAAA,OAAM;AACL,SAAO,KAAK;;CAGb,MAAA,KAAW,GAAA;AACV,OAAK,OAAO;;CAGb,MAAA,QAAM;AACL,OAAK,OAAO;;GAOD,KAAb,MAAA;CACC,YAAY,GAAA;AAAQ,OAAA,MAAA;;CAEpB,MAAA,OAAM;AACL,MAAA;GACC,IAAM,IAAO,aAAa,QAAQ,KAAK,IAAA;AACvC,UAAO,IAAO,KAAK,MAAM,GAAM,GAAA,GAAiB;UACxC;AAER,UAAO;;;CAIT,MAAA,KAAW,GAAA;AACV,MAAA;AACC,gBAAa,QAAQ,KAAK,KAAK,KAAK,UAAU,GAAO,GAAA,CAAA;WAC7C,GAAA;AAER,SAAM,IAAI,EAAoB,mCAAmC,KAAK,IAAA,IAAQ,EAAA;;;CAIhF,MAAA,QAAM;AACL,eAAa,WAAW,KAAK,IAAA;;GAOlB,KAAb,MAAA;CACC,YAAY,GAAA;AAAQ,OAAA,MAAA;;CAEpB,MAAA,OAAM;AACL,MAAA;GACC,IAAM,IAAO,eAAe,QAAQ,KAAK,IAAA;AACzC,UAAO,IAAO,KAAK,MAAM,GAAM,GAAA,GAAiB;UACxC;AAER,UAAO;;;CAIT,MAAA,KAAW,GAAA;AACV,MAAA;AACC,kBAAe,QAAQ,KAAK,KAAK,KAAK,UAAU,GAAO,GAAA,CAAA;WAC/C,GAAA;AAER,SAAM,IAAI,EAAoB,qCAAqC,KAAK,IAAA,IAAQ,EAAA;;;CAIlF,MAAA,QAAM;AACL,iBAAe,WAAW,KAAK,IAAA;;GAOpB,KAAb,MAAa,EAAA;CAAA;AAAA,OAAA,UACa;;CAAA;AAAA,OAAA,aACG;;CAAA;AAAA,OAAA,aACA;;CAE5B,YAAY,GAAA;AAAQ,OAAA,MAAA;;CAEpB,SAAA;AACC,SAAO,IAAI,SAAsB,GAAS,MAAA;GACzC,IAAM,IAAU,UAAU,KAAK,EAAwB,SAAS,EAAwB,WAAA;AAExF,KAAQ,wBAAA;IACP,IAAM,IAAK,EAAQ;AACd,MAAG,iBAAiB,SAAS,EAAwB,WAAA,IACzD,EAAG,kBAAkB,EAAwB,WAAA;MAI/C,EAAQ,kBAAkB,EAAQ,EAAQ,OAAA,EAC1C,EAAQ,gBAAgB,EAAO,EAAQ,MAAA;IAAA;;CAIzC,MAAA,OAAM;AACL,MAAA;GACC,IAAM,IAAA,MAAW,KAAK,QAAA;AACtB,UAAO,IAAI,SAAmB,GAAS,MAAA;IAGtC,IAAM,IAFc,EAAG,YAAY,EAAwB,YAAY,WAAA,CAC7C,YAAY,EAAwB,WAAA,CACxC,IAAI,KAAK,IAAA;AAE/B,MAAQ,kBAAA;AACP,OAAG,OAAA,EACH,EAAQ,EAAQ,UAAU,KAAA;OAG3B,EAAQ,gBAAA;AACP,OAAG,OAAA,EACH,EAAO,EAAQ,MAAA;;KAAA;UAGT;AAER,UAAO;;;CAIT,MAAA,KAAW,GAAA;AACV,MAAA;GACC,IAAM,IAAA,MAAW,KAAK,QAAA;AACtB,UAAO,IAAI,SAAe,GAAS,MAAA;IAGlC,IAAM,IAFc,EAAG,YAAY,EAAwB,YAAY,YAAA,CAC7C,YAAY,EAAwB,WAAA,CACxC,IAAI,GAAO,KAAK,IAAA;AAEtC,MAAQ,kBAAA;AACP,OAAG,OAAA,EACH,GAAA;OAGD,EAAQ,gBAAA;AACP,OAAG,OAAA,EACH,EAAO,EAAQ,MAAA;;KAAA;WAGT,GAAA;AAER,SAAM,IAAI,EAAoB,gCAAgC,KAAK,IAAA,IAAQ,EAAA;;;CAI7E,MAAA,QAAM;AACL,MAAA;GACC,IAAM,IAAA,MAAW,KAAK,QAAA;AACtB,UAAO,IAAI,SAAe,GAAS,MAAA;IAGlC,IAAM,IAFc,EAAG,YAAY,EAAwB,YAAY,YAAA,CAC7C,YAAY,EAAwB,WAAA,CACxC,OAAO,KAAK,IAAA;AAElC,MAAQ,kBAAA;AACP,OAAG,OAAA,EACH,GAAA;OAGD,EAAQ,gBAAA;AACP,OAAG,OAAA,EACH,EAAO,EAAQ,MAAA;;KAAA;WAGT,GAAA;AAER,SAAM,IAAI,EAAoB,mCAAmC,KAAK,IAAA,IAAQ,EAAA;;;;AAQjF,SAAgB,GAAwB,GAAmB,GAAA;AAC1D,SAAQ,GAAR;EACC,KAAK,QACJ,QAAO,IAAI,GAAuB,EAAA;EACnC,KAAK,UACJ,QAAO,IAAI,GAAyB,EAAA;EACrC,KAAK,YACJ,QAAO,IAAI,GAA2B,EAAA;EAEvC,QACC,QAAO,IAAI,IAAA;;;CFk5Bd,WAAA;CACE,MAAM,UAAiB,IAAA;EACrB,YAAY,GAAQ,GAAA;AAClB,UAAA,EACA,KAAK,KAAe;IAClB,OAAO;IACP,SAAS;IACT,QAAQ,IAAS,EAAO,SAAS,GAAA;IACjC,WAAA,CAAW;IACX,YAAA,CAAY;IACZ,OAAA,KAAY;IACZ,WAAA,KAAgB;IAChB,OAAO;IACP,QAAQ;IACR,WAAA,CAAW;IACX,UAAA,CAAU;IACV,YAAY,EAAA;IAAA;;EAGhB,IAAA,OAAI;AACF,UAAO,EAAO,KAAK,GAAA,CAAc;;EAEnC,IAAI,GAAA;AACF,UAAO,EAAO,KAAK,GAAA,CAAc,IAAI,EAAA;;EAEvC,IAAI,GAAK,GAAA;GACP,IAAM,IAAQ,KAAK;AAUnB,UATA,EAAgB,EAAA,EACX,EAAO,EAAA,CAAO,IAAI,EAAA,IAAQ,EAAO,EAAA,CAAO,IAAI,EAAA,KAAS,MACxD,EAAe,EAAA,EACf,EAAY,EAAA,EACZ,EAAM,UAAU,IAAI,GAAA,CAAK,EAAA,EACzB,EAAM,MAAM,IAAI,GAAK,EAAA,EACrB,EAAM,UAAU,IAAI,GAAA,CAAK,EAAA,EACzB,GAAqB,GAAO,GAAK,EAAA,GAE5B;;EAET,OAAO,GAAA;AACL,OAAA,CAAK,KAAK,IAAI,EAAA,CACZ,QAAA,CAAO;GAET,IAAM,IAAQ,KAAK;AAUnB,UATA,EAAgB,EAAA,EAChB,EAAe,EAAA,EACf,EAAY,EAAA,EACR,EAAM,MAAM,IAAI,EAAA,GAClB,EAAM,UAAU,IAAI,GAAA,CAAK,EAAA,GAEzB,EAAM,UAAU,OAAO,EAAA,EAEzB,EAAM,MAAM,OAAO,EAAA,EAAA,CACZ;;EAET,QAAA;GACE,IAAM,IAAQ,KAAK;AACnB,KAAgB,EAAA,EACZ,EAAO,EAAA,CAAO,SAChB,EAAe,EAAA,EACf,EAAY,EAAA,EACZ,EAAM,4BAA4B,IAAI,KAAA,EACtC,EAAK,EAAM,QAAQ,MAAA;AACjB,MAAM,UAAU,IAAI,GAAA,CAAK,EAAA;KAAA,EAE3B,EAAM,MAAM,OAAA;;EAGhB,QAAQ,GAAI,GAAA;GACV,IAAM,IAAQ,KAAK;AACnB,KAAO,EAAA,CAAO,SAAS,GAAQ,GAAK,MAAA;AAClC,MAAG,KAAK,GAAS,KAAK,IAAI,EAAA,EAAM,GAAK,KAAA;KAAA;;EAGzC,IAAI,GAAA;GACF,IAAM,IAAQ,KAAK;AACnB,KAAgB,EAAA;GAChB,IAAM,IAAQ,EAAO,EAAA,CAAO,IAAI,EAAA;AAIhC,OAHI,EAAM,cAAA,CAAe,EAAY,EAAA,IAGjC,MAAU,EAAM,MAAM,IAAI,EAAA,CAC5B,QAAO;GAET,IAAM,IAAQ,EAAY,EAAM,QAAQ,GAAO,GAAO,EAAA;AAGtD,UAFA,EAAe,EAAA,EACf,EAAM,MAAM,IAAI,GAAK,EAAA,EACd;;EAET,OAAA;AACE,UAAO,EAAO,KAAK,GAAA,CAAc,MAAA;;EAEnC,SAAA;GACE,IAAM,IAAW,KAAK,MAAA;AACtB,UAAO;KACJ,OAAO,iBAAiB,KAAK,QAAA;IAC9B,YAAA;KACE,IAAM,IAAI,EAAS,MAAA;AACnB,YAAI,EAAE,OACG,IAEF;MACL,MAAA,CAAM;MACN,OAHY,KAAK,IAAI,EAAE,MAAA;MAAA;;IAAA;;EAQ/B,UAAA;GACE,IAAM,IAAW,KAAK,MAAA;AACtB,UAAO;KACJ,OAAO,iBAAiB,KAAK,SAAA;IAC9B,YAAA;KACE,IAAM,IAAI,EAAS,MAAA;AACnB,SAAI,EAAE,KACJ,QAAO;KACT,IAAM,IAAQ,KAAK,IAAI,EAAE,MAAA;AACzB,YAAO;MACL,MAAA,CAAM;MACN,OAAO,CAAC,EAAE,OAAO,EAAA;MAAA;;IAAA;;EAKzB,CAAe,OAAO,YAAA;AACpB,UAAO,KAAK,SAAA;;;CAOhB,SAAS,EAAe,GAAA;AACjB,EAEH,EAAM,WADN,EAAM,4BAA4B,IAAI,KAAA,EACxB,IAAI,IAAI,EAAM,MAAA;;CAGhC,MAAM,UAAiB,IAAA;EACrB,YAAY,GAAQ,GAAA;AAClB,UAAA,EACA,KAAK,KAAe;IAClB,OAAO;IACP,SAAS;IACT,QAAQ,IAAS,EAAO,SAAS,GAAA;IACjC,WAAA,CAAW;IACX,YAAA,CAAY;IACZ,OAAA,KAAY;IACZ,OAAO;IACP,QAAQ;IACR,yBAAyB,IAAI,KAAA;IAC7B,UAAA,CAAU;IACV,WAAA,CAAW;IACX,WAAA,KAAgB;IAChB,YAAY,EAAA;IAAA;;EAGhB,IAAA,OAAI;AACF,UAAO,EAAO,KAAK,GAAA,CAAc;;EAEnC,IAAI,GAAA;GACF,IAAM,IAAQ,KAAK;AAEnB,UADA,EAAgB,EAAA,EACX,EAAM,QAAA,CAAA,CAGP,EAAM,MAAM,IAAI,EAAA,IAAA,EAAA,CAEhB,EAAM,QAAQ,IAAI,EAAA,IAAA,CAAU,EAAM,MAAM,IAAI,EAAM,QAAQ,IAAI,EAAA,CAAA,IAJzD,EAAM,MAAM,IAAI,EAAA;;EAQ3B,IAAI,GAAA;GACF,IAAM,IAAQ,KAAK;AAQnB,UAPA,EAAgB,EAAA,EACX,KAAK,IAAI,EAAA,KACZ,EAAe,EAAA,EACf,EAAY,EAAA,EACZ,EAAM,MAAM,IAAI,EAAA,EAChB,GAAqB,GAAO,GAAO,EAAA,GAE9B;;EAET,OAAO,GAAA;AACL,OAAA,CAAK,KAAK,IAAI,EAAA,CACZ,QAAA,CAAO;GAET,IAAM,IAAQ,KAAK;AAInB,UAHA,EAAgB,EAAA,EAChB,EAAe,EAAA,EACf,EAAY,EAAA,EACL,EAAM,MAAM,OAAO,EAAA,IAAA,CAAA,CAAW,EAAM,QAAQ,IAAI,EAAA,IAAS,EAAM,MAAM,OAAO,EAAM,QAAQ,IAAI,EAAA,CAAA;;EAKvG,QAAA;GACE,IAAM,IAAQ,KAAK;AACnB,KAAgB,EAAA,EACZ,EAAO,EAAA,CAAO,SAChB,EAAe,EAAA,EACf,EAAY,EAAA,EACZ,EAAM,MAAM,OAAA;;EAGhB,SAAA;GACE,IAAM,IAAQ,KAAK;AAGnB,UAFA,EAAgB,EAAA,EAChB,EAAe,EAAA,EACR,EAAM,MAAM,QAAA;;EAErB,UAAA;GACE,IAAM,IAAQ,KAAK;AAGnB,UAFA,EAAgB,EAAA,EAChB,EAAe,EAAA,EACR,EAAM,MAAM,SAAA;;EAErB,OAAA;AACE,UAAO,KAAK,QAAA;;EAEd,CAAe,OAAO,YAAA;AACpB,UAAO,KAAK,QAAA;;EAEd,QAAQ,GAAI,GAAA;GACV,IAAM,IAAW,KAAK,QAAA,EAClB,IAAS,EAAS,MAAA;AACtB,UAAA,CAAQ,EAAO,MACb,GAAG,KAAK,GAAS,EAAO,OAAO,EAAO,OAAO,KAAA,EAC7C,IAAS,EAAS,MAAA;;;CAQxB,SAAS,EAAe,GAAA;AACjB,IAAM,UACT,EAAM,wBAAwB,IAAI,KAAA,EAClC,EAAM,MAAM,SAAS,MAAA;AACnB,OAAI,EAAY,EAAA,EAAQ;IACtB,IAAM,IAAQ,EAAY,EAAM,QAAQ,GAAO,GAAO,EAAA;AACtD,MAAM,QAAQ,IAAI,GAAO,EAAA,EACzB,EAAM,MAAM,IAAI,EAAA;SAEhB,GAAM,MAAM,IAAI,EAAA;IAAA;;CAKxB,SAAS,EAAgB,GAAA;AACnB,IAAM,YACR,EAAI,GAAG,KAAK,UAAU,EAAO,EAAA,CAAA,CAAA;;CAjrCnC,IAAoB;AACb,IADa,IA4rCP,OA1rCT,GAAQ,KAAa;EA0rCI,WAvI3B,SAAmB,GAAQ,GAAA;GACzB,IAAM,IAAM,IAAI,EAAS,GAAQ,EAAA;AACjC,UAAO,CAAC,GAAK,EAAI,GAAA;;EAqImB,WA/BtC,SAAmB,GAAQ,GAAA;GACzB,IAAM,IAAO,IAAI,EAAS,GAAQ,EAAA;AAClC,UAAO,CAAC,GAAM,EAAK,GAAA;;EA6B4B,gBATjD,SAAwB,GAAA;AACtB,OAAI,EAAO,UAAU,KAAe,EAAO,OAAO;IAChD,IAAM,IAAO,IAAI,IAAI,EAAO,MAAA;AAC5B,MAAO,MAAM,OAAA,EACb,EAAK,SAAS,MAAA;AACZ,OAAO,MAAM,IAAI,GAAS,EAAA,CAAA;MAAA;;;EAtrCT;IGhOzB;AAMA,IAAsB,IAAtB,MAAA;CAqBC,IAAA,QAAW;AACV,SAAO,KAAK;;CAMb,IAAA,MAAiB,GAAA;AAChB,OAAK,SAAS,GACd,KAAK,YAAY,KAAK,EAAE,MAAA;;CAMzB,IAAA,QAAW;AACV,SAAO,KAAK,EAAE,UAAA;;CASf,YACC,GACA,GACA,GAAA;EAIA,IAAI;AANM,OAAA,cAAA,GACA,KAAA,MAAA,GAAA,KA9CV,KAAA,CAAa,GAAA,KAAA,SAAA,CAGc,GAAA,KAAA,YACN,IAAI,GAAA,EAAA,KAAA,SAIV,IAAI,EAAmC,KAAA,EA+CrD,IAFG,aAAwB,MAER,IAAI,IAAI,EAAA,GACjB,MAAM,QAAQ,EAAA,GAEL,CAAA,GAAI,EAAA,GACb,KAAwC,OAAjB,KAAiB,WAE/B,EAAA,GAAK,GAAA,GAGL;AAIpB,MAAA;AACC,QAAK,eAAe,KAAK,iBAAiB,EAAA,GACvC,EAAQ,IAAkB,MAAS,EAAA,GACnC;UACK;AAER,QAAK,eAAe;;AAIrB,OAAK,IAAI,IAAI,EAAmB,KAAK,aAAA,EACrC,KAAK,UAAU,GAAwB,GAAa,EAAA,EAGhD,MAAgB,WACnB,KAAK,SAAA,CAAS,IAGd,KAAK,uBAAA;;CAOP,iBAA2B,GAAA;AAC1B,SAEkB,OAAV,KAAU,cADjB,MAEC,MAAM,QAAQ,EAAA,IACd,aAAiB,OACjB,aAAiB,OACjB,OAAO,eAAe,EAAA,KAAW,OAAO,aAAA,CACnB,MAArB,EAAM;;CAOT,UAAA;AACC,OAAK,UAAU,MAAA,EACf,KAAK,UAAU,UAAA,EACf,KAAK,EAAE,UAAA,EACP,KAAK,OAAO,UAAA;;CAMb,QAAe,GAAA;AACd,MAAA;GAEC,IAAM,IAAY,KAAK,iBAAiB,EAAA,GAAY,EAAQ,IAAU,MAAS,EAAA,GAAS;AAExF,QAAK,YAAY,EAAA;WACT,GAAA;GACR,IAAM,IAAa,IAAI,EAAoB,4BAA4B,KAAK,OAAO,EAAA;AACnF,QAAK,OAAO,KAAK,EAAA,EAIjB,KAAK,YAAY,EAAA;;;CAYnB,YAAsB,GAAA;AACrB,MAAA;GAEC,IAAI;AAGH,OADG,KAAK,iBAAiB,EAAA,GACb,EAAQ,IAAU,MAAS,EAAA,GAE3B,GAGb,KAAK,EAAE,KAAK,EAAA,EAGR,KAAK,gBAAgB,YACxB,KAAK,iBAAiB,EAAA,CAAW,OAAM,MAAA;IACtC,IAAM,IAAQ,IAAI,EAAoB,mBAAmB,KAAK,YAAA,eAA2B,KAAK,OAAO,EAAA;AACrG,SAAK,OAAO,KAAK,EAAA;KAAA;WAIX,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,2BAA2B,KAAK,OAAO,EAAA;AAC7E,QAAK,OAAO,KAAK,EAAA,EAIjB,KAAK,EAAE,KAAK,EAAA;;;CAOd,MAAA,wBAAgB;AACf,MAAA;GACC,IAAM,IAAA,MAAoB,KAAK,QAAQ,MAAA;AACvC,OAAI,GAAa;IAEhB,IAAM,IAAiB,KAAK,mBAAmB,EAAA;AAE/C,QAAA;KAEC,IAAM,IAAiB,KAAK,iBAAiB,EAAA,GAC1C,EAAQ,IAAgB,MAAS,EAAA,GACjC;AAEH,UAAK,YAAY,EAAA;YACT;AAER,UAAK,YAAY,EAAA;;;AAGnB,QAAK,SAAA,CAAS;WACN,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,sBAAsB,KAAK,YAAA,eAA2B,KAAK,OAAO,EAAA;AACxG,QAAK,OAAO,KAAK,EAAA,EAEjB,KAAK,SAAA,CAAS;;;CAOhB,mBAA6B,GAAA;AAC5B,SAAO;;CAMR,MAAA,iBAAiC,GAAA;AAChC,SAAO,KAAK,QAAQ,KAAK,EAAA;;GC7Nd,KAAb,MAAa,UAAoC,EAAA;CAAA;AAAA,OAAA,OAC3B;;CAAA;AAAA,OAAA,4BAG4C,IAAI,KAAA;;CAKrE,OAAA,YAAmC,GAAsB,GAAa,IAAoB,EAAA,EAAA;EACzF,IAAM,IAAc,GAAG,EAAA,GAAW;AAIlC,SAHK,KAAK,UAAU,IAAI,EAAA,IACvB,KAAK,UAAU,IAAI,GAAa,IAAI,EAAsB,GAAS,GAAK,EAAA,CAAA,EAElE,KAAK,UAAU,IAAI,EAAA;;CAM3B,YAAY,GAA0B,GAAa,IAAoB,EAAA,EAAA;AACtE,QAAM,GAAa,GAAK,EAAA,EAGpB,MAAgB,YACnB,KAAK,kBAAA;;CAOP,mBAAA;AACC,OAAK,EAAE,KAAK,EAAa,KAAA,KAAK,GAAW;GAAE,SAAA,CAAS;GAAM,UAAA,CAAU;GAAA,CAAA,CAAA,CAAS,WAAU,MAAA;AACtF,QAAK,QAAQ,KAAK,EAAA,CAAc,OAAM,MAAA;IACrC,IAAM,IAAQ,IAAI,EAAoB,mBAAmB,KAAK,YAAA,eAA2B,KAAK,OAAO,EAAA;AACrG,SAAK,OAAO,KAAK,EAAA;KAAA;IAAA;;CASpB,KAAA,GAAe,GAAA;AACd,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,MAAM,KAAA,GAAQ,EAAM,KAAI,MAAkB,EAAA,CAAA;KAAA;AAG3C,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,0BAA0B,KAAK,OAAO,EAAA;AAC5E,QAAK,OAAO,KAAK,EAAA;;;CAQnB,MAAA;AACC,MAAA;GAEC,IAAM,IAAe,KAAK,MAAM,SAAS,IAAI,KAAK,MAAM,KAAK,MAAM,SAAS,KAAA,KAAK,GAG3E,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,MAAM,KAAA;KAAA;AAKP,UAFA,KAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA,EACV;WACC,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,2BAA2B,KAAK,OAAO,EAAA;AAG7E,GAFA,KAAK,OAAO,KAAK,EAAA;AAEjB;;;CAMF,QAAA,GAAkB,GAAA;AACjB,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,MAAM,QAAA,GAAW,EAAM,KAAI,MAAkB,EAAA,CAAA;KAAA;AAG9C,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,6BAA6B,KAAK,OAAO,EAAA;AAC/E,QAAK,OAAO,KAAK,EAAA;;;CAQnB,QAAA;AACC,MAAA;GAEC,IAAM,IAAe,KAAK,MAAM,SAAS,IAAI,KAAK,MAAM,KAAA,KAAK,GAGvD,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,MAAM,OAAA;KAAA;AAKP,UAFA,KAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA,EACV;WACC,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,4BAA4B,KAAK,OAAO,EAAA;AAG9E,GAFA,KAAK,OAAO,KAAK,EAAA;AAEjB;;;CAOF,IAAW,GAAe,GAAA;AACzB,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,QAAA,EAAI,KAAS,KAAK,IAAQ,EAAM,QAG/B,OAAU,MAAM,SAAS,EAAA,0BAAgC,EAAM,OAAA,GAAA;AAF/D,MAAM,KAAmB;KAAA;AAM3B,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,+BAA+B,EAAA,MAAY,KAAK,OAAO,EAAA;AAC7F,QAAK,OAAO,KAAK,EAAA;;;CAQnB,IAAW,GAAA;AACV,SAAO,KAAK,MAAM;;CAMnB,OAAc,GAAe,GAAA,GAAyB,GAAA;AACrD,MAAA;GAKC,IAAM,IAAU,CAAA,GAHU,KAAK,MAAA,CAGD,OAAO,GAAO,KAAe,GAAA,GAAM,EAAA,EAG3D,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,MAAM,OAAO,GAAO,KAAe,GAAA,GAAM,EAAM,KAAI,MAAkB,EAAA,CAAA;KAAA;AAKtE,UAFA,KAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA,EACV;WACC,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,2BAA2B,KAAK,OAAO,EAAA;AAG7E,UAFA,KAAK,OAAO,KAAK,EAAA,EAEV,EAAA;;;CAOT,OAAc,GAAS,GAAA;AACtB,MAAA;GACC,IAAM,IAAS,OAAe,GAAG,MAAM,MAAM,IAGvC,IAAQ,KAAK,MAAM,WAAU,MAAe,EAAO,GAAa,EAAA,CAAA;AAGtE,OAAI,MAAJ,IAAkB;IACjB,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,OAAM,OAAO,GAAO,EAAA;MAAA;AAKrB,WAFA,KAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA,EAAA,CACV;;AAKR,UADA,KAAK,OAAO,KAAK,KAAA,EAAA,CACV;WACC,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,0BAA0B,KAAK,OAAO,EAAA;AAG5E,UAFA,KAAK,OAAO,KAAK,EAAA,EAAA,CAEV;;;CAOT,QAAe,GAAA;AACd,MAAA;GAEC,IAAM,IAAY,EAAQ,IAAU,MAAS,EAAA;AAC7C,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,4BAA4B,KAAK,OAAO,EAAA;AAC9E,QAAK,OAAO,KAAK,EAAA;;;CAQnB,OAAc,GAAA;AACb,MAAA;GAEC,IAAM,IAAgB,KAAK,MAAM,OAAO,EAAA,EAGlC,IAAY,EAAQ,KAAK,QAAO,MAAA;AAErC,MAAM,SAAS,GACf,EAAM,KAAA,GAAQ,EAAc,KAAI,MAAkB,EAAA,CAAA;KAAA;AAGnD,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,4BAA4B,KAAK,OAAO,EAAA;AAC9E,QAAK,OAAO,KAAK,EAAA;;;CAQnB,IAAc,GAAA;AACb,SAAO,KAAK,MAAM,IAAI,EAAA;;CAMvB,KAAY,GAAA;AACX,MAAA;GAEC,IAAM,IAAc,CAAA,GAAI,KAAK,MAAA,CAAO,KAAK,EAAA,EAGnC,IAAY,EAAQ,KAAK,QAAO,MAAA;AAErC,MAAM,SAAS,GACf,EAAM,KAAA,GAAQ,EAAY,KAAI,MAAkB,EAAA,CAAA;KAAA;AAGjD,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,0BAA0B,KAAK,OAAO,EAAA;AAC5E,QAAK,OAAO,KAAK,EAAA;;;CAQnB,OAAc,GAAe,GAAA;AAC5B,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,QAAA,EAAI,KAAS,KAAK,IAAQ,EAAM,QAG/B,OAAU,MAAM,SAAS,EAAA,0BAAgC,EAAM,OAAA,GAAA;AAF/D,MAAQ,EAAM,GAAA;KAAA;AAMhB,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,gCAAgC,EAAA,MAAY,KAAK,OAAO,EAAA;AAC9F,QAAK,OAAO,KAAK,EAAA;;;CAQnB,QAAA;AACC,OAAK,YAAY,EAAA,CAAA;;CAMlB,gBAAA;AACuB,EAAA,OAAX,SAAW,QAEnB,OAAe,aAAc,OAAe,cAAc,EAAA,EAC1D,OAAe,WAAW,KAAK,OAAO;GACvC,gBAAgB,KAAK;GACrB,MAAM,KAAK,KAAK,KAAK,KAAA;GACrB,KAAK,KAAK,IAAI,KAAK,KAAA;GACnB,SAAS,KAAK,QAAQ,KAAK,KAAA;GAC3B,OAAO,KAAK,MAAM,KAAK,KAAA;GACvB,KAAK,KAAK,IAAI,KAAK,KAAA;GACnB,KAAK,KAAK,IAAI,KAAK,KAAA;GACnB,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,SAAS,KAAK,QAAQ,KAAK,KAAA;GAC3B,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,KAAK,KAAK,IAAI,KAAK,KAAA;GACnB,MAAM,KAAK,KAAK,KAAK,KAAA;GACrB,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,OAAO,KAAK,MAAM,KAAK,KAAA;GACvB,YAAY,MAAA;IACX,IAAM,IAAe,KAAK,EAAE,UAAU,EAAA;AACtC,iBAAa,EAAa,aAAA;;GAAA;;GCtVV,KAArB,MAAqB,UAAyC,EAAA;CAAA;AAAA,OAAA,OACxC;;CAAA;AAAA,OAAA,4BAGiD,IAAI,KAAA;;CAK1E,OAAA,YACC,GACA,GACA,GAAA;EAEA,IAAM,IAAc,GAAG,EAAA,GAAW;AAIlC,SAHK,KAAK,UAAU,IAAI,EAAA,IACvB,KAAK,UAAU,IAAI,GAAa,IAAI,EAA2B,GAAS,GAAK,EAAA,CAAA,EAEvE,KAAK,UAAU,IAAI,EAAA;;CAoB3B,IAAkB,GAAwD,GAAA;AACzE,MAAA;GACC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AAErC,QAAyB,OAAd,KAAc,UAAU;AAElC,SAAI,MAAJ,KAAc,EACb,OAAU,MAAM,8CAAA;AAEjB,OAAM,IAAI,GAAqB,EAAA;eACrB,aAAqB,IAE/B,OAAM,KAAK,EAAU,SAAA,CAAA,CAAW,SAAA,CAAU,GAAK,OAAA;AAC9C,OAAM,IAAI,GAAe,EAAA;MAAA;SAAA;AAAA,SAEK,OAAd,KAAc,aAAY,EAM3C,OAAU,MAAM,gEAAA;AAJhB,YAAO,QAAQ,EAAA,CAAW,SAAA,CAAU,GAAK,OAAA;AACxC,QAAM,IAAI,GAAe,EAAA;OAGsD;;KAAA;AAKlF,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,2BAA2B,KAAK,OAAO,EAAA;AAC7E,QAAK,OAAO,KAAK,EAAA;;;CAcnB,MAAoB,GAAA;AACnB,OAAK,IAAI,EAAA;;CAMV,OAAc,GAAA;AACb,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,MAAM,OAAO,EAAA;KAAA;AAGd,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,sBAAsB,EAAA,QAAY,KAAK,OAAO,EAAA;AACpF,QAAK,OAAO,KAAK,EAAA;;;CAQnB,QAAA;AAEC,OAAK,4BAAY,IAAI,KAAA,CAAA;;CAOtB,YAAmB,GAAA;AAClB,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,WAAO,QAAQ,EAAA,CAAS,SAAA,CAAU,GAAK,OAAA;AACtC,OAAM,IAAI,GAAe,EAAA;MAAA;KAAA;AAI3B,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,2BAA2B,KAAK,OAAO,EAAA;AAC7E,QAAK,OAAO,KAAK,EAAA;;;CAUnB,OAAc,GAAa,GAAA;AAC1B,MAAA;GAEC,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;IACrC,IAAM,IAAe,EAAM,IAAI,EAAA;AAAA,IAC3B,MAD2B,KACV,KACpB,EAAQ,EAAA;KAAA;AAKV,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,uBAAuB,EAAA,MAAU,KAAK,OAAO,EAAA;AACnF,QAAK,OAAO,KAAK,EAAA;;;CAQnB,YAAY,GAA0B,GAAa,GAAA;AAClD,QAAM,GAAa,GAAK,EAAA,EAGpB,MAAgB,YACnB,KAAK,kBAAA;;CAOP,mBAAA;AACC,OAAK,EAAE,KAAK,EAAa,KAAA,KAAK,GAAW;GAAE,SAAA,CAAS;GAAM,UAAA,CAAU;GAAA,CAAA,CAAA,CAAS,WAAU,MAAA;AACtF,QAAK,QAAQ,KAAK,EAAA,CAAc,OAAM,MAAA;IACrC,IAAM,IAAQ,IAAI,EAAoB,mBAAmB,KAAK,YAAA,eAA2B,KAAK,OAAO,EAAA;AACrG,SAAK,OAAO,KAAK,EAAA;KAAA;IAAA;;CASpB,gBAAA;AACuB,EAAA,OAAX,SAAW,QAEnB,OAAe,aAAc,OAAe,cAAc,EAAA,EAC1D,OAAe,WAAW,KAAK,OAAO;GACvC,gBAAgB,KAAK;GACrB,KAAK,KAAK,IAAI,KAAK,KAAA;GACnB,OAAO,KAAK,MAAM,KAAK,KAAA;GACvB,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,OAAO,KAAK,MAAM,KAAK,KAAA;GACvB,aAAa,KAAK,YAAY,KAAK,KAAA;GACnC,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,YAAY,MAAA;IACX,IAAM,IAAe,KAAK,EAAE,UAAU,EAAA;AACtC,iBAAa,EAAa,aAAA;;GAAA;;GC1MlB,KAAb,MAAa,UAA2D,EAAA;CAAA,YAAA,GAAA,GAAA;AAAA,QAAA,GAAA,EAAA,EAAA,KAEtE,KAAA,CAAa;;CAAA;AAAA,OAAA,OAEO;;CAAA;AAAA,OAAA,4BAG6C,IAAI,KAAA;;CAKtE,OAAA,YACC,GACA,GACA,GAAA;EAEA,IAAM,IAAc,GAAG,EAAA,GAAW;AAIlC,SAHK,KAAK,UAAU,IAAI,EAAA,IACvB,KAAK,UAAU,IAAI,GAAa,IAAI,EAAuB,GAAS,GAAK,EAAA,CAAA,EAEnE,KAAK,UAAU,IAAI,EAAA;;CAM3B,IAAW,GAAmB,IAAA,CAAiB,GAAA;AAC9C,MAAA;AACC,OAAA,CAAK,KAAK,iBAAiB,KAAK,MAAA,EAAQ;IAEvC,IAAM,IAAY,IAAQ;KAAA,GAAK,KAAK;KAAA,GAAU;KAAA,GAAW;AAEzD,SAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;AACjB;;GAID,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AACrC,QAAI,GAAO;AAEV,SAAI,KAAA,KACH;AAKD,SAAA;AACC,aAAO,OAAO,GAAiB,EAAA;aACvB;AAGR,aAAO,KAAK,EAAA,CAAO,SAAQ,MAAA;AACxB,SAAc,KAAQ,EAAc;QAAA;;UAMxC,KAAA;AACC,YAAiB;YACT;AAER,YAAO;;KAAA;AAKV,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,yBAAyB,KAAK,OAAO,GAAK;IAAE,OAAA;IAAO,OAAA;IAAA,CAAA;AACzF,QAAK,OAAO,KAAK,EAAA;AAIjB,OAAA;IACC,IAAM,IAAgB,IAAQ;KAAA,GAAK,KAAK;KAAA,GAAU;KAAA,GAAW;AAC7D,SAAK,YAAY,EAAA;WACT;;;CASX,QAAA;AACC,MAAA;AAEC,OAAI,KAAK,iBAAiB,KAAK,aAAA,EAAe;IAC7C,IAAM,IAAoB,EAAQ,KAAK,eAAc,MAAS,EAAA;AAC9D,SAAK,IAAI,GAAA,CAAmB,EAAA;SAG5B,MAAK,IAAI,KAAK,cAAA,CAAqB,EAAA;WAE5B,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,yBAAyB,KAAK,OAAO,EAAA;AAC3E,QAAK,OAAO,KAAK,EAAA,EAIjB,KAAK,YAAY,KAAK,aAAA;;;CAOxB,OAAiC,GAAA;AAChC,MAAA;AACC,OAAA,CAAK,KAAK,iBAAiB,KAAK,MAAA,EAAQ;IAEvC,IAAM,IAAY,EAAA,GAAK,KAAK,OAAA;AAG5B,WAFO,EAAU,IACjB,KAAK,YAAY,EAAA;AACjB;;GAID,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;AAAA,WAE9B,EAAM;KAAA;AAGd,QAAK,YAAY,EAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,sBAAsB,OAAO,EAAA,CAAA,eAAoB,KAAK,OAAO,EAAA;AACnG,QAAK,OAAO,KAAK,EAAA;AAIjB,OAAA;IACC,IAAM,IAAgB,EAAA,GAAK,KAAK,OAAA;AAAA,WACzB,EAAc,IACrB,KAAK,YAAY,EAAA;WACT;;;CAWX,QAAe,GAAc,GAAA;AAC5B,MAAA;AACC,OAAA,CAAK,EAEJ;AAGD,OAAA,CAAK,KAAK,iBAAiB,KAAK,MAAA,EAAQ;IAEvC,IAAM,IAAQ,EAAK,MAAM,IAAA,EACnB,IAAY,EAAA,GAAK,KAAK,OAAA,EACxB,IAAe;AAEnB,SAAK,IAAI,IAAI,GAAG,IAAI,EAAM,SAAS,GAAG,KAAK;KAC1C,IAAM,IAAO,EAAM;AAAA,KACf,EAAQ,OADO,KACG,IACrB,EAAQ,KAAQ,EAAA,GACmB,OAAlB,EAAQ,MAAU,YAAY,EAAQ,OAAU,SACjE,EAAQ,KAAQ,EAAA,GAEjB,IAAU,EAAQ;;AAGnB,MAAQ,EAAM,EAAM,SAAS,MAAM,GACnC,KAAK,YAAY,EAAA;AACjB;;GAID,IAAM,IAAY,EAAQ,KAAK,QAAO,MAAA;IACrC,IAAM,IAAQ,EAAK,MAAM,IAAA,EACrB,IAAe;AAGnB,SAAK,IAAI,IAAI,GAAG,IAAI,EAAM,SAAS,GAAG,KAAK;KAC1C,IAAM,IAAO,EAAM;AAAA,KAGf,EAAQ,OAHO,KAGG,IACrB,EAAQ,KAAQ,EAAA,GACmB,OAAlB,EAAQ,MAAU,YAAY,EAAQ,OAAU,SAEjE,EAAQ,KAAQ,EAAA,GAGjB,IAAU,EAAQ;;IAInB,IAAM,IAAW,EAAM,EAAM,SAAS;AACtC,QAAA;AACC,OAAQ,KAAsB;YACtB;AAER,OAAQ,KAAY;;KAAA;AAItB,QAAK,YAAY,EAAA,EACjB,KAAK,OAAO,KAAK,KAAA;WACT,GAAA;GACR,IAAM,IAAQ,IAAI,EAAoB,sBAAsB,EAAA,MAAW,KAAK,OAAO,EAAA;AACnF,QAAK,OAAO,KAAK,EAAA;AAIjB,OAAA;IACC,IAAM,IAAQ,EAAK,MAAM,IAAA,EACnB,IAAY,EAAA,GAAK,KAAK,OAAA,EACxB,IAAe;AAEnB,SAAK,IAAI,IAAI,GAAG,IAAI,EAAM,SAAS,GAAG,KAAK;KAC1C,IAAM,IAAO,EAAM;AAAA,KACf,EAAQ,OADO,KACG,IACrB,EAAQ,KAAQ,EAAA,GACmB,OAAlB,EAAQ,MAAU,YAAY,EAAQ,OAAU,SACjE,EAAQ,KAAQ,EAAA,GAEjB,IAAU,EAAQ;;AAGnB,MAAQ,EAAM,EAAM,SAAS,MAAM,GACnC,KAAK,YAAY,EAAA;WACT;;;CASX,mBAA6B,GAAA;AAC5B,MAAA;AAEC,UAAI,KAAK,iBAAiB,KAAK,aAAA,IAAiB,KAAK,iBAAiB,EAAA,GAC9D,EAAQ,KAAK,eAAc,MAAA;AACjC,WAAO,OAAO,GAAiB,EAAA;KAAA,GAIzB;IAAA,GAAK,KAAK;IAAA,GAAiB;IAAA;UAE3B;AAER,UAAO;;;CAOT,gBAAA;AACuB,EAAA,OAAX,SAAW,QAEnB,OAAe,aAAc,OAAe,cAAc,EAAA,EAC1D,OAAe,WAAW,KAAK,OAAO;GACvC,gBAAgB,KAAK;GACrB,KAAK,KAAK,IAAI,KAAK,KAAA;GACnB,QAAQ,KAAK,OAAO,KAAK,KAAA;GACzB,OAAO,KAAK,MAAM,KAAK,KAAA;GACvB,SAAS,KAAK,QAAQ,KAAK,KAAA;GAC3B,YAAY,MAAA;IACX,IAAM,IAAe,KAAK,EAAE,UAAU,EAAA;AACtC,iBAAa,EAAa,aAAA;;GAAA;;CAS9B,iBAA2B,GAAA;AAE1B,SAA0C,OAAV,KAAU,cAAnC,MAAgD,MAAM,iBAAiB,EAAA,IAAA,CAA+B,MAArB,EAAM;;;ACrPhG,SAAS,GACR,GACA,GACA,GAAA;AAEA,KAAA;AAEiB,EAAZ,MAAY,gBAEf,IAAU,YAzBU,IA6BF,OA3BT,QACO,OAAV,KAAU,YAChB,MAAM,QAAQ,EAAA,IACb,aAAiB,OACjB,aAAiB,OACjB,aAAiB,QACjB,aAAiB,UACnB,OAAO,eAAe,EAAA,KAAW,OAAO,eAsBvC,IAAc,EAAA,GAAK,GAAA;EAIpB,IAAM,IAAQ,GAAoB,YAAe,GAAS,GAAK,EAAA;AAO/D,SAjEkB,QADG,IA8DH,EAAM,UA7DN,YAAY,MAAQ,QAGhC,OAAO,KAAK,EAAA,CAAK,WAAW,KA2DjC,EAAM,IAAI,EAAA,GAAK,GAAA,CAAA,EAGT;SACC;AASR,SANsB,GAAoB,YACzC,UACA,GAAG,EAAA,YACH,EAAA;;CAzEH,IAAuB,GAwBA;;AA2FvB,SAAS,GACR,GACA,GACA,GAAA;AAEA,KAAA;EAEC,IAAM,IAAQ,GAAmB,YAAY,GAAS,GAAK,EAAA;AAQ3D,SALK,EAAM,MAAM,UAEhB,EAAM,QAAQ,CAAA,GAAI,EAAA,CAAA,EAGZ;SACC;AASR,SANsB,GAAmB,YACxC,UACA,GAAG,EAAA,YACH,CAAA,GAAI,EAAA,CAAA;;;AAmDP,SAAgB,GACf,GACA,GACA,GAAA;AAKA,KAAA;AAeC,SAbI,AAIF,MADG,EAAI,SAAS,aAAA,IAAiB,EAAI,SAAS,MAAA,mBAChC,IAAI,KAAA,GACR,EAAI,SAAS,QAAA,IAAY,EAAI,SAAS,OAAA,GAClC,EAAA,GAEA,EAAA,EAKO,aAxMA,MAwEzB,SACC,GACA,GACA,GAAA;AAEA,OAAA;IAEC,IAAM,IAAQ,GAAwB,YAAY,GAAS,GAAK,EAAA;AAQhE,WALK,EAAM,MAAM,QAEhB,EAAM,QAAQ,IAAI,IAAI,EAAA,CAAA,EAGhB;WACC;AASR,WANsB,GAAwB,YAC7C,UACA,GAAG,EAAA,YACH,IAAI,IAAI,EAAA,CAAA;;IA2G0B,GAAa,GAAS,EAAA,GAnM3D,SAAoB,GAAA;AACnB,UAAO,MAAM,QAAQ,EAAA;IAmMI,EAAA,GAChB,GAAsB,GAAa,GAAS,EAAA,GAE5C,GAD0B,OAAhB,KAAgB,WACH,IAIA,EAAE,OAAO,GAAA,EAJ2B,GAAS,EAAA;SAMpE;AAKR,SAAO,GACiB,OAAhB,KAAgB,YAAY,IAAuB,EAAA,GAAK,GAAA,GAAgB,EAAE,OAAO,GAAA,EACxF,UACA,sBAAsB,IAAA;;;AAYzB,SAAgB,GACf,IAAmB,EAAA,EACnB,GACA,IAAuB,SAAA;AAEvB,KAAA;AACC,SAAO,GAAiB,GAAa,GAAS,EAAA;SACtC;AAGR,SAAO,GAAoB,GAAa,UAAU,GAAG,EAAA,WAAA;;;AAUvD,SAAgB,GACf,IAAmB,EAAA,EACnB,IAAc,cAAA;AAEd,KAAA;AACC,SAAO,GAAiB,GAAa,UAAU,EAAA;SACvC;AAGR,SAAO,GAAoB,GAAa,UAAU,GAAG,EAAA,qBAAA;;;ACvOvD,IAAa,MAA0B,GAA2B,MAAA;AACjE,KAAA,CAAK,EAAM,QAAO;CAElB,IAAM,IAAQ,EAAK,MAAM,IAAA,EACrB,IAAa;AAEjB,MAAK,IAAM,KAAQ,GAAO;AACzB,MAAI,KAAS,KAAM;AACnB,MAAQ,EAAM;;AAGf,QAAO;GA+EF,MAAc,MAAA;AACnB,KAAA,CAAK,KAAK,EAAE,SAAS,EAAG,QAAO,EAAA;CAE/B,IAAM,IAAoB,EAAA;AAC1B,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,SAAS,GAAG,IACjC,GAAQ,KAAK,EAAE,UAAU,GAAG,IAAI,EAAA,CAAG,aAAA,CAAA;AAEpC,QAAO;GAwCF,MAAqB,GAAgB,MAAA;AAC1C,KAAA,CAAK,KAAA,CAAW,EAAU,QAAO;CAEjC,IAAM,IAAI,EAAO,aAAA,CAAc,MAAA,EACzB,IAAI,EAAS,aAAA,CAAc,MAAA;AAEjC,KAAI,MAAM,EAAG,QAAO;CAEpB,IAAM,IAAiB,KAAE,SAAS,EAAA,EAC5B,MAjGgB,GAAa,MAAA;AACnC,MAAA,CAAK,EAAK,QAAA,CAAO;AACjB,MAAA,CAAK,EAAK,QAAA,CAAO;EAEjB,IAAI,IAAI,GACP,IAAI;AACL,SAAO,IAAI,EAAI,UAAU,IAAI,EAAI,QAC5B,GAAI,GAAG,aAAA,KAAkB,EAAI,GAAG,aAAA,IAAe,KACnD;AAED,SAAO,MAAM,EAAI;IAuFsB,GAAG,EAAA,GAAK,KAAM,GAC/C,MAjFe,GAAe,MAAA;AACpC,MAAA,CAAK,EAAO,QAAA,CAAO;AACnB,MAAA,CAAK,EAAQ,QAAA,CAAO;EAEpB,IAAM,KAAc,MACnB,EACE,aAAA,CACA,MAAM,GAAA,CACN,QACC,GAAK,OACL,EAAI,MAAS,EAAI,MAAS,KAAK,GACxB,IAER,EAAA,CAAA,EAGG,IAAa,EAAW,EAAA,EACxB,IAAc,EAAW,EAAA;AAC/B,SAAO,OAAO,KAAK,EAAA,CAAY,OAAM,OAAS,EAAY,MAAS,MAAM,EAAW,GAAA;IA+DlD,GAAG,EAAA,GAAK,KAAM,GAC1C,MA5CkB,GAAY,MAAA;AACpC,MAAA,CAAK,KAAA,CAAO,KAAM,EAAG,SAAS,KAAK,EAAG,SAAS,EAAG,QAAO;EAEzD,IAAM,IAAW,GAAW,EAAA,EACtB,IAAW,GAAW,EAAA;AAE5B,MAAI,EAAS,WAAW,KAAK,EAAS,WAAW,EAAG,QAAO;EAE3D,IAAI,IAAe,GACb,IAAW,MAAM,EAAS,OAAA,CAAQ,KAAA,CAAK,EAAA;AAE7C,OAAK,IAAM,KAAU,EACpB,MAAK,IAAI,IAAI,GAAG,IAAI,EAAS,QAAQ,IACpC,KAAA,CAAK,EAAK,MAAM,EAAS,OAAO,GAAQ;AACvC,QACA,EAAK,KAAA,CAAK;AACV;;AAKH,SAAQ,IAAI,KAAiB,EAAS,SAAS,EAAS;IAuBtB,GAAG,EAAA,EAE/B,IAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,OAAA,EAC9B,KAAmB,IAAS,MAtId,GAAW,MAAA;AAC/B,MAAI,MAAM,EAAG,QAAO;EAEpB,IAAM,IAAqB,MAAM,EAAE,SAAS,EAAA,CAC1C,KAAK,KAAA,CACL,KAAK,GAAG,MAAM,CAAC,EAAA,CAAA;AAGjB,OAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,IAC9B,GAAO,GAAG,KAAK;AAGhB,OAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,IAC9B,MAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,IAC1B,GAAE,OAAO,IAAI,EAAA,KAAO,EAAE,OAAO,IAAI,EAAA,GACpC,EAAO,GAAG,KAAK,EAAO,IAAI,GAAG,IAAI,KAEjC,EAAO,GAAG,KAAK,KAAK,IACnB,EAAO,IAAI,GAAG,KAAK,GACnB,EAAO,GAAG,IAAI,KAAK,GACnB,EAAO,IAAI,GAAG,IAAI,KAAK,EAAA;AAK3B,SAAO,EAAO,EAAE,QAAQ,EAAE;IA6GwB,GAAG,EAAA,GAAK,IAAS;AAEnE,QAAO,KAAK,IAAI,GAAgB,GAAkB,GAAc,GAAW,GAAA;GAMtE,MAAc,MACf,KAAS,OAAa,KACnB,OAAO,EAAA;AAMf,SAAS,GACR,GACA,GACA,IAAyB,IAAA;CAEzB,IAAI,GACH,GACA,GACA,IAAA,CAAS;AAEV,KAAI,MAAM,QAAQ,EAAA,CAAA,EACf,GAAO,GAAI,GAAU,IAAA,CAAS,KAAS;MACnC;AAEN,MAAI,MAAM,QAAQ,EAAM,IAAA,CAKvB,QAJgB,EAAM,IAAI,KAAI,MAC7B,GAAoB,GAAM;GAAA,GAAK;GAAO,KAAK;GAAA,EAAK,EAAA,CAAA,CAGlC,QACb,GAAM,MAAU,EAAK,SAAS,EAAK,QAAQ,EAAK,QAAQ,IAAe,GACxE;GAAE,OAAA,CAAO;GAAO,OAAO;GAAA,CAAA;AAIzB,MAAQ,EAAM,KACd,IAAK,EAAM,UACX,IAAW,EAAM,OACjB,IAAS,EAAM,UAAA,CAAU;;AAI1B,KAAA,CAAK,MAAW,MAAa,MAAM,KAAY,QAAS,EAAQ,EAAA,IAAa,EAAS,WAAW,GAChG,QAAO;EAAE,OAAA,CAAO;EAAM,OAAO;EAAA;CAG9B,IAAM,IAAS,GAAc,GAAM,EAAA;AAGnC,KAAI,GAEH;AAAA,MAAI,MAAO,OAAO;AAEjB,OAAsB,OAAX,KAAW,YAAgC,OAAb,KAAa,SACrD,QAAO;IAAE,OAAA,CAAO;IAAO,OAAO;IAAA;GAG/B,IAAM,IAAQ,GAAkB,GAAQ,EAAA;AACxC,UAAO;IACN,OAAO,KAAS;IAChB,OAAO,KAAS,IAAiB,IAAQ;IAAA;;EAEpC;GAGN,IAAM,IAAU,GAAc,GAAI,GAAQ,EAAA;AAC1C,UAAO;IACN,OAAO;IACP,OAAO;IAAc;;;AAAA,KAGb,MAAO,OAAO;AAExB,MAAsB,OAAX,KAAW,YAAgC,OAAb,KAAa,SACrD,QAAO;GAAE,OAAA,CAAO;GAAO,OAAO;GAAA;EAG/B,IAAM,IAAQ,GAAkB,GAAQ,EAAA;AACxC,SAAI,IAAQ,IACJ;GAAE,OAAA,CAAO;GAAO,OAAO;GAAA,GAGxB;GAAE,OAAA,CAAO;GAAM,OAAA;GAAA;;CAChB;EAEN,IAAM,IAAU,GAAc,GAAI,GAAQ,EAAA;AAC1C,SAAO;GACN,OAAO;GACP,OAAO;GAAc;;;AAqBxB,SAAgB,GACf,GACA,IAA4B,EAAA,EAC5B,IAAyB,IAAA;AAGzB,KAAA,CAAK,EAAQ,OACZ,QAAO,MAAM,KAAK,EAAM,QAAA,CAAA;CAIzB,IAAM,IAA+B,EAAA;AAErC,MAAK,IAAA,CAAO,GAAG,MAAS,EAAM,SAAA,EAAW;EACxC,IAAI,IAAa,GACb,IAAa,GACb,IAAA,CAAQ;AAEZ,OAAK,IAAM,KAAS,GAAS;GAC5B,IAAM,IAAS,GAAoB,GAAM,GAAO,EAAA;AAEhD,OAAA,CAAK,EAAO,OAAO;AAClB,QAAA,CAAQ;AACR;;AAGD,QAAc,EAAO,OACrB;;AAGG,OACH,EAAY,KAAK;GAChB,MAAA;GACA,OAAO,IAAa,IAAI,IAAa,IAAa;GAAA,CAAA;;AAQrD,QAFA,EAAY,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAA,EAEhC,EAAY,KAAI,MAAK,EAAE,KAAA;;AAM/B,SAAgB,GACf,GACA,IAA4B,EAAA,EAC5B,IAAyB,IAAA;CAGzB,IAAM,oBAAM,IAAI,KAAA;AAGhB,QAFA,EAAM,SAAS,GAAM,MAAU,EAAI,IAAI,OAAO,EAAA,EAAQ,EAAA,CAAA,EAE/C,GAAe,GAAK,GAAS,EAAA;;AAUrC,SAAgB,EAAqB,GAAA;AACpC,QAAO,MAAM,QAAQ,EAAA;;AAQtB,SAAgB,EAAS,GAAA;AACxB,QAAwB,OAAV,KAAU;;AAQzB,SAAgB,EAAS,GAAA;AACxB,QAAwB,OAAV,KAAU,YAAV,CAAuB,MAAM,EAAA;;AAQ5C,SAAgB,EAAO,GAAA;AACtB,QAAO,aAAiB,QAAA,CAAS,MAAM,EAAM,SAAA,CAAA;;AAQ9C,SAAgB,GAAwB,GAAA;AAEvC,QAAsC,OAAV,KAAU,cAAlC,KAKG,OAAO,YAAY,OAAO,EAAA,IAAqD,OAAnC,EAAc,OAAO,aAAc;;AAQvF,SAAgB,EAAgC,GAAA;AAC/C,QAAO,aAAiB;;AAQzB,SAAgB,EAAmB,GAAA;AAClC,QAAO,aAAiB;;AAQzB,SAAgB,GAAc,GAAA;AAC7B,KAAuC,OAAV,KAAU,aAAnC,EACH,QAAA,CAAO;CAGR,IAAM,IAAQ,OAAO,eAAe,EAAA;AACpC,QAAO,MAAU,OAAO,aAAa,MAAU;;AAQhD,SAAgB,EAAM,GAAA;AACrB,QAAO,KAAA;;AAUR,SAAgB,GAAc,GAAwB,GAAiB,GAAA;AAEtE,KAAI,EAAM,EAAA,IAAW,EAAM,EAAA,CAAW,QAAA,CAAO;AAC7C,KAAI,EAAM,EAAA,IAAW,EAAM,EAAA,CAE1B,QAAI,MAAO,OAAa,MAAW,IAC/B,MAAO,QAAa,MAAW;AAKpC,SAAQ,GAAR;EACC,KAAK,KACJ,QAAO,MAAW;EACnB,KAAK,KACJ,QAAO,MAAW;EACnB,KAAK,IACJ,QAAI,EAAS,EAAA,IAAW,EAAS,EAAA,GACzB,IAAS,IAEb,EAAO,EAAA,IAAW,EAAO,EAAA,GACrB,EAAO,SAAA,GAAY,EAAS,SAAA,GAAA,EAAA,CAEhC,EAAS,EAAA,IAAA,CAAW,EAAS,EAAA,KACzB,EAAO,cAAc,EAAA,GAAY;EAG1C,KAAK,IACJ,QAAI,EAAS,EAAA,IAAW,EAAS,EAAA,GACzB,IAAS,IAEb,EAAO,EAAA,IAAW,EAAO,EAAA,GACrB,EAAO,SAAA,GAAY,EAAS,SAAA,GAAA,EAAA,CAEhC,EAAS,EAAA,IAAA,CAAW,EAAS,EAAA,KACzB,EAAO,cAAc,EAAA,GAAY;EAG1C,KAAK,KACJ,QAAI,EAAS,EAAA,IAAW,EAAS,EAAA,GACzB,KAAU,IAEd,EAAO,EAAA,IAAW,EAAO,EAAA,GACrB,EAAO,SAAA,IAAa,EAAS,SAAA,GAAA,EAAA,CAEjC,EAAS,EAAA,IAAA,CAAW,EAAS,EAAA,KACzB,EAAO,cAAc,EAAA,IAAa;EAG3C,KAAK,KACJ,QAAI,EAAS,EAAA,IAAW,EAAS,EAAA,GACzB,KAAU,IAEd,EAAO,EAAA,IAAW,EAAO,EAAA,GACrB,EAAO,SAAA,IAAa,EAAS,SAAA,GAAA,EAAA,CAEjC,EAAS,EAAA,IAAA,CAAW,EAAS,EAAA,KACzB,EAAO,cAAc,EAAA,IAAa;EAG3C,KAAK,WACJ,QAAI,EAAS,EAAA,GACL,EAAO,aAAA,CAAc,SAAS,GAAW,EAAA,CAAU,aAAA,CAAA,GAEvD,EAAQ,EAAA,GACJ,EAAO,SAAS,EAAA,GAEpB,EAAM,EAAA,GACF,EAAO,IAAI,EAAA,GAAA,CAAA,CAEf,EAAM,EAAA,IACF,MAAM,KAAK,EAAO,QAAA,CAAA,CAAU,SAAS,EAAA;EAI9C,KAAK,cACJ,QAAI,EAAS,EAAA,GAAA,CACJ,EAAO,aAAA,CAAc,SAAS,GAAW,EAAA,CAAU,aAAA,CAAA,GAExD,EAAQ,EAAA,GAAA,CACH,EAAO,SAAS,EAAA,GAErB,EAAM,EAAA,GAAA,CACD,EAAO,IAAI,EAAA,GAAA,CAEhB,EAAM,EAAA,IAAA,CACD,MAAM,KAAK,EAAO,QAAA,CAAA,CAAU,SAAS,EAAA;EAI/C,KAAK,aACJ,QAAA,EAAA,CAAI,EAAS,EAAA,IAAA,CAAW,EAAS,EAAA,KACzB,EAAO,aAAA,CAAc,WAAW,EAAS,aAAA,CAAA;EAIlD,KAAK,WACJ,QAAA,EAAA,CAAI,EAAS,EAAA,IAAA,CAAW,EAAS,EAAA,KACzB,EAAO,aAAA,CAAc,SAAS,EAAS,aAAA,CAAA;EAIhD,KAAK,KACJ,QAAI,EAAQ,EAAA,GACJ,EAAS,SAAS,EAAA,GAEtB,EAAM,EAAA,GACF,EAAS,IAAI,EAAA,GAAA,CAAA,CAEjB,EAAM,EAAA,KACF,EAAS,IAAI,EAAA,IAAkB,MAAM,KAAK,EAAS,QAAA,CAAA,CAAU,SAAS,EAAA;EAI/E,KAAK,QACJ,QAAI,EAAQ,EAAA,GAAA,CACH,EAAS,SAAS,EAAA,GAEvB,EAAM,EAAA,GAAA,CACD,EAAS,IAAI,EAAA,GAAA,CAElB,EAAM,EAAA,IAAA,CACD,EAAS,IAAI,EAAA,IAAA,CAAmB,MAAM,KAAK,EAAS,QAAA,CAAA,CAAU,SAAS,EAAA;EAIjF,QAEC,QAAA,CAAO;;;AAMV,IAAa,KAAY,IAGZ,KAAc;AC7lB3B,SAAS,EAAU,GAAY,GAAA;AAC9B,KAAI,MAAM,EAAG,QAAA,CAAO;AAEpB,KAAI,aAAa,OAAO,aAAa,KAAK;AACzC,MAAI,EAAE,SAAS,EAAE,KAAM,QAAA,CAAO;AAC9B,OAAK,IAAA,CAAO,GAAK,MAAU,EAC1B,KAAA,CAAK,EAAE,IAAI,EAAA,IAAA,CAAS,EAAU,GAAO,EAAE,IAAI,EAAA,CAAA,CAAO,QAAA,CAAO;AAE1D,SAAA,CAAO;;AAGR,KAAI,aAAa,OAAO,aAAa,KAAK;AACzC,MAAI,EAAE,SAAS,EAAE,KAAM,QAAA,CAAO;AAC9B,OAAK,IAAM,KAAQ,EAClB,KAAA,CAAK,EAAE,IAAI,EAAA,CAAO,QAAA,CAAO;AAE1B,SAAA,CAAO;;AAGR,KAAiB,OAAN,KAAM,YAAY,KAA2B,OAAN,KAAM,YAAY,GAAY;EAC/E,IAAM,IAAQ,OAAO,KAAK,EAAA,EACpB,IAAQ,OAAO,KAAK,EAAA;AAE1B,MAAI,EAAM,WAAW,EAAM,OAAQ,QAAA,CAAO;AAE1C,OAAK,IAAM,KAAO,EAEjB,KAAA,CAAK,EAAU,EAAE,IAAM,EAAE,GAAA,CAAO,QAAA,CAAO;AAGxC,SAAA,CAAO;;AAGR,QAAA,CAAO;;AAUR,SAAgB,GAAqB,GAAkB,GAAA;AACtD,QAAO,EAAM,EAAE,KAAK,EAAI,EAAA,EAAa,EAAwB,EAAA,EAAY,EAAY,EAAA,CAAA;;AAUtF,SAAgB,EACf,GACA,GAAA;AAEA,QAAO,EAAM,EAAE,KAAK,EAAI,EAAA,EAAa,EAAwB,EAAA,EAAY,EAAY,EAAA,CAAA;;AAStF,SAAgB,GAAuB,GAAA;AACtC,QAAO,EAAyB,IAAO,MAAc,MAAM,KAAK,EAAW,QAAA,CAAA,CAAA;;AAU5E,SAAgB,GAAsB,GAA4B,GAAA;AACjE,QAAO,EAAyB,IAAO,MAAc,EAAW,IAAI,EAAA,CAAA;;AAMrE,SAAgB,GAAsB,GAAA;AACrC,QAAO,EAAyB,IAAO,MAAc,MAAM,KAAK,EAAW,MAAA,CAAA,CAAA;;AAM5E,SAAgB,GAAyB,GAAA;AACxC,QAAO,EAAyB,IAAO,MAAc,MAAM,KAAK,EAAW,SAAA,CAAA,CAAA;;AAM5E,SAAgB,GAAsB,GAA4B,GAAA;AACjE,QAAO,EAAyB,IAAO,MAC/B,MAAM,KAAK,EAAW,QAAA,CAAA,CAAU,KAAK,EAAA,CAAA;;AAO9C,SAAgB,GACf,GACA,GAAA;AAEA,QAAO,EAAyB,IAAO,MAAA;AACtC,OAAK,IAAA,CAAO,GAAK,MAAS,EAAW,SAAA,CACpC,KAAI,EAAU,GAAM,EAAA,CACnB,QAAO;GAAA;;AAcX,SAAgB,GACf,GACA,GAAA;AAEA,QAAO,EAAyB,IAAO,MACtC,MAAM,KAAK,EAAW,SAAA,CAAA,CACpB,QAAA,CAAS,GAAK,OAAU,EAAS,GAAM,EAAA,CAAA,CACvC,KAAA,CAAM,GAAG,OAAU,EAAA,CAAA;;AAOvB,SAAgB,GACf,GACA,GAAA;AAEA,QAAO,EAAyB,IAAO,MACtC,MAAM,KAAK,EAAW,SAAA,CAAA,CAAW,KAAA,CAAM,GAAK,OAAU,EAAM,GAAM,EAAA,CAAA,CAAA;;AAWpE,SAAgB,GACf,GACA,GAAA;AAEA,QAAO,EAAyB,IAAO,MACjC,IAEE,MAAM,KAAK,EAAW,SAAA,CAAA,CAAW,QAAA,CAAS,GAAK,OAAU,EAAS,GAAM,EAAA,CAAA,CAAM,SAF/D,EAAW,KAAA;;AAcnC,SAAgB,GAA8B,GAAkB,GAAA;AAC/D,QAAO,EAAM,EAAE,KACd,EAAI,EAAA,EACJ,EAAwB,EAAA,EACxB,EAAM;EACL,qBAAA,CAAqB;EACrB,cAAA,CAAc;EACd,iBAAA,CAAiB;EAAA,CAAA,CAAA;;AAgBpB,SAAgB,GACf,GACA,GACA,GAAA;CAIA,IAAM,IAAe,EAAA,GADC,EAAO,KAAK,GAAO,MAAU,EAAY,GAAO,EAAM,MAAA,CAAA,CAAA,EAItE,IAAoB;EACzB,GAAG,IAAI,EAAmB,EAAA;EAC1B,QAAQ,IAAI,EAAmC,KAAA;EAC/C,OAAA,CAAO;EACP,cAAc;EAEd,IAAA,QAAI;AACH,UAAO,KAAK,EAAE,UAAA;;EAIf,IAAI,GAAoB,GAAA;EAIxB,QAAA;AACC,QAAK,EAAE,KAAK,KAAK,aAAA;;EAGlB,QAAQ,GAAA;EAIR,OAA0B,GAAA;EAI1B,UAAA;AACC,QAAK,EAAE,UAAA,EACP,KAAK,OAAO,UAAA;;EAAA,EAQR,IAAe,EAHD,EAAO,KAAK,GAAO,MAAM,EAAM,EAAA,CAAA,CAGH,UAAU;EACzD,OAAM,MAAA;AACL,OAAA;IAKC,IAAM,IAAW,EAAA,GAHM,EAAY,KAAK,GAAO,MAAU,EAAY,GAAO,EAAA,CAAA,CAAA;AAM5E,MAAO,EAAE,KAAK,EAAA;YACN,GAAA;IACR,IAAM,IAAQ,IAAI,EAAW,8BAA8B,EAAA;AAC3D,MAAO,OAAO,KAAK,EAAA;;;EAIrB,QAAO,MAAA;GACN,IAAM,IAAQ,IAAI,EAAW,+BAA+B,EAAA;AAC5D,KAAO,OAAO,KAAK,EAAA;;EAAA,CAAA,EAMf,IAAkB,EAAO;AAM/B,QALA,EAAO,UAAU,WAAA;AAChB,IAAa,aAAA,EACb,EAAgB,KAAK,KAAA;IAGf;;ACpRR,IAAM,IAAkB,OAAO,kBAAA,EACzB,IAAgB,OAAO,wBAAA,EACvB,IAAc,OAAO,sBAAA,EACrB,IAAmB,OAAO,0BAAA;AA+GhC,SAAgB,GACf,GACA,KAAiC,MAAa,GAC9C,IAAyB,EAAE,UAAA,CAAU,GAAA,EAAA;AAErC,QAAO,SAAU,GAA4B,GAAkB,GAAA;AAE9D,KAAY;GAAE,WAAA,CAAW;GAAO,MAAM;GAAA,CAAtC,CAAgD,GAAO,EAAA;EAGvD,IAAM,IAA4B,EAAM,mBAClC,KAA+B,EAAM;AAG3C,IAAM,oBAAoB,WAAA;GA7D5B,IAAgC;AAAA,IAAA,IA+DN,MA9DV,MAAA,CAAoB,EAAU,GAAiB,WAC7D,EAAU,KAAmB,IAAI,GAAA,GAG7B,EAAU,OACd,EAAU,qBAAiB,IAAI,KAAA,GAG3B,EAAU,OACd,EAAU,qBAAe,IAAI,KAAA;GAwD5B,IAAM,IAzET,SAA8B,GAAA;AAC7B,WAAO,SAAS,KAA8B,OAAd,EAAM,OAAQ,cAAc,EAAM,iBAAiB;KAwE/B,EAAA,GAC/C,EAAyB,GAAO,EAAA,GAChC,GAAe,GAAoB,EAAA;AAGjC,KAAQ,YAAa,KAAK,OAC9B,GAA2B,KAAK,KAAA,EAChC,KAAK,KAAA,CAAoB,IAItB,KAAK,GAAgB,IAAI,EAAA,KAC5B,KAAK,GAAgB,IAAI,EAAA,EAAW,aAAA,EACpC,KAAK,GAAgB,OAAO,EAAA,GAIzB,EAAQ;GAKZ,IAAM,KAAe,EAAS,KAAK,EAAU,KAAK,GAAA,CAAA,CAAoB,UAAU;IAC/E,OAAO,MAAA;KAEN,IAAM,IAAW,EAAQ,YAAY,gBAAgB,EAAA,GAAS;AAE1D,OAAQ,OAIP,EAAQ,eACZ,KAAK,KAAY,IAGlB,KAAK,iBAAA,EAID,EAAQ,YAAA,CAAa,KAAK,GAAc,IAAI,EAAA,IAAa,MAAb,KAA0B,MACzE,KAAK,GAAc,IAAI,EAAA,EAGlB,KAAK,OACL,EAAQ,OAIZ,GAA2B,KAAK,KAAA,EAChC,KAAK,KAAA,CAAoB;;IAI5B,QAAQ,MAAA;AAGH,UAAK,eAER,iBAAA;AACK,WAAK,gBACJ,EAAQ,OAGZ,KAAK,qBAAA;QAEJ,IAAA;;IAAA,CAAA;AAMN,QAAK,GAAgB,IAAI,GAAU,GAAA;KAIpC,EAAM,uBAAuB,WAAA;GA5H/B,IAAkC;AA8H/B,OAA8B,KAAK,KAAA,EAG/B,EAAQ,QAjImB,IAsIN,MArIb,OACb,EAAU,GAAiB,MAAA,EAC3B,EAAU,GAAiB,UAAA,EAC3B,EAAU,KAAA,KAAmB,IAG1B,EAAU,OACb,EAAU,GAAe,SAAQ,MAAO,EAAI,aAAA,CAAA,EAC5C,EAAU,GAAe,OAAA,EACzB,EAAU,KAAA,KAAiB,IAGxB,EAAU,OACb,EAAU,GAAa,OAAA,EACvB,EAAU,KAAA,KAAe,IAI1B,EAAU,KAAA,KAAoB;;;;AAgI/B,SAAgB,GACf,GACA,GACA,IAAyB,EAAE,UAAA,CAAU,GAAA,EAAA;AAErC,QAAO,SAAU,GAA4B,GAAkB,GAAA;AAC9D,KACC,GACA,SAAU,GAAA;GAET,IAAM,IAAU,EAAU,KAAA;AAC1B,UAAO,IAAU,EAAM,IAAI,EAAA,GAAA,KAAW;KAEvC,EAPD,CAQE,GAAO,EAAA;;;AAAA,SAAA,KAAA,GAAA,MAAA,GAAA,KAAA,GAAA,KAAA,GAAA,KAAA,GAAA,MAAA,GAAA,KAAA,GAAA,KAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,KAAA,GAAA,KAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,KAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,KAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA,GAAA,MAAA"}