@gen-epix/ui-client-casedb 4.0.0

package/dist/_chunks/dashboardStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dashboardStore.js","names":[],"sources":["../../../../node_modules/.pnpm/immer@11.1.9/node_modules/immer/dist/immer.mjs","../../src/stores/dashboardStore/dashboardStore.ts","../../src/stores/dashboardStore/dashboardStoreContext.tsx"],"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    if (prop === \"constructor\" || prop === \"__proto__\") {\n      const source2 = latest(state);\n      const value2 = source2[prop];\n      return new Proxy(value2 || {}, {\n        get: (target, key) => {\n          if (key === \"__proto__\" || key === \"prototype\") {\n            return Object.freeze(/* @__PURE__ */ Object.create(null));\n          }\n          return Reflect.get(target, key);\n        },\n        set: () => {\n          return true;\n        },\n        apply: (target, thisArg, args) => {\n          return Reflect.apply(target, thisArg, args);\n        }\n      });\n    }\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    if (prop === \"constructor\" || prop === \"__proto__\" || prop === \"prototype\") {\n      return false;\n    }\n    return prop in latest(state);\n  },\n  ownKeys(state) {\n    return Reflect.ownKeys(latest(state));\n  },\n  set(state, prop, value) {\n    if (prop === \"constructor\" || prop === \"__proto__\" || prop === \"prototype\") {\n      return true;\n    }\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(immer);\nvar setAutoFreeze = /* @__PURE__ */ immer.setAutoFreeze.bind(immer);\nvar setUseStrictShallowCopy = /* @__PURE__ */ immer.setUseStrictShallowCopy.bind(immer);\nvar setUseStrictIteration = /* @__PURE__ */ immer.setUseStrictIteration.bind(immer);\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","import { createStore } from 'zustand';\nimport { produce } from 'immer';\nimport { t } from 'i18next';\nimport difference from 'lodash/difference';\nimport uniq from 'lodash/uniq';\nimport last from 'lodash/last';\nimport { persist } from 'zustand/middleware';\nimport type {\n  CaseDbCase,\n  CaseDbCaseQuery,\n  CaseDbCaseQueryResult,\n  CaseDbCol,\n  CaseDbCompleteCaseType,\n  CaseDbPhylogeneticTree,\n  CaseDbTypedCompositeFilter,\n} from '@gen-epix/api-casedb';\nimport { CaseDbCaseApi } from '@gen-epix/api-casedb';\nimport { AxiosUtil } from '@gen-epix/ui/utils/AxiosUtil';\nimport { ConfigService } from '@gen-epix/ui/classes/services/ConfigService';\nimport {\n  createTableStoreActions,\n  createTableStoreInitialState,\n  createTableStorePersistConfiguration,\n} from '@gen-epix/ui/stores/tableStore';\nimport { FILTER_MODE } from '@gen-epix/ui/classes/abstracts/FilterAbstract';\nimport { NotificationService } from '@gen-epix/ui/classes/services/NotificationService';\nimport { QueryClientService } from '@gen-epix/ui/classes/services/QueryClientService';\nimport type {\n  CreateTableStoreInitialStateKwArgs,\n  CreateTableStoreKwArgs,\n  TableStoreActions,\n  TableStoreState,\n} from '@gen-epix/ui/stores/tableStore';\nimport type { FilterValues } from '@gen-epix/ui/models/filter';\nimport cloneDeep from 'lodash/cloneDeep';\nimport { ObjectUtil } from '@gen-epix/ui-core/utils/ObjectUtil';\nimport type { TreeNode } from '@gen-epix/ui-phylogenetic-tree/models/tree';\nimport { NewickUtil } from '@gen-epix/ui-phylogenetic-tree/utils/NewickUtil';\nimport { TreeUtil } from '@gen-epix/ui-phylogenetic-tree/utils/TreeUtil';\n\nimport type { FindSimilarCasesResult } from '../../models/caseDb';\nimport type { TreeWidgetDataPersistable } from '../../models/dashboard';\nimport type {\n  StratifiableColumn,\n  Stratification,\n} from '../../models/stratification';\nimport { STRATIFICATION_MODE } from '../../models/stratification';\nimport {\n  SELECTION_FILTER_GROUP,\n  TREE_FILTER_GROUP,\n} from '../../utils/CaseTypeUtil';\nimport { FilterUtil } from '../../utils/FilterUtil';\nimport type { CaseDbConfig } from '../../models/config';\nimport { CASEDB_QUERY_KEY } from '../../constants/query';\nimport { SelectionFilter } from '../../classes/filters/SelectionFilter';\nimport { TreeFilter } from '../../classes/filters/TreeFilter';\nimport { StratificationUtil } from '../../utils/StratificationUtil';\nimport { DASHBOARD_COMPONENT_NAME } from '../../constants/dashboard';\n\nexport interface CreateDashboardStoreInitialStateKwArgs extends CreateTableStoreInitialStateKwArgs<CaseDbCase, CaseDbCompleteCaseType> {\n  caseSetId: string;\n  completeCaseType: CaseDbCompleteCaseType;\n}\n\nexport type CreateDashboardStoreKwArgs = {\n  caseSetId: string;\n  completeCaseType: CaseDbCompleteCaseType;\n} & CreateTableStoreKwArgs<CaseDbCase, CaseDbCompleteCaseType>;\n\nexport type DashboardStore = DashboardStoreActions & DashboardStoreState;\ninterface DashboardStoreActions extends TableStoreActions<CaseDbCase, CaseDbCompleteCaseType> {\n  addTreeFilter: (nodeId: string) => Promise<void>;\n  destroy: () => void;\n  expandZone: (zone: string) => void;\n  getWidgetData: <TData>(widgetName: string) => TData;\n  getWidgetDataPersistable: <TData>(widgetName: string) => TData;\n  mutateCachedCase: (caseId: string, item: CaseDbCase) => void;\n  reloadFieldStratification: () => void;\n  reloadStratifyableColumns: () => void;\n  reloadTree: () => void;\n  removeTreeFilter: () => Promise<void>;\n  resetTreeAddresses: () => void;\n  setFindSimilarCasesResults: (findSimilarCasesResults: FindSimilarCasesResult[]) => Promise<void>;\n  setNumVisibleAttributesInSummary: (numVisibleAttributesInSummary: number) => void;\n  setPhylogeneticTreeResponse: (phylogeneticTree: CaseDbPhylogeneticTree) => void;\n  stratify: (mode: STRATIFICATION_MODE, col?: CaseDbCol) => void;\n  treeFilterStepOut: () => Promise<void>;\n  updateWidgetData: <TData, TPartialData = Partial<TData>>(widgetName: string, data: TPartialData) => void;\n  updateWidgetDataPersistable: <TData, TPartialData = Partial<TData>>(widgetName: string, data: TPartialData) => void;\n}\ninterface DashboardStoreState extends TableStoreState<CaseDbCase, CaseDbCompleteCaseType> {\n  caseSetId: string;\n  completeCaseType: CaseDbCompleteCaseType;\n  expandedZone: string;\n  findSimilarCasesResults: FindSimilarCasesResult[];\n  isMaxResultsExceeded: boolean;\n  isMaxResultsExceededDismissed: boolean;\n  newick: string;\n  numVisibleAttributesInSummary: number;\n  stratification: Stratification;\n  stratifyableColumns: StratifiableColumn[];\n  tree: TreeNode;\n  treeAddresses: {\n    [key: string]: {\n      addresses: { [key: string]: string };\n      algorithmCode: string;\n    };\n  };\n  treeResponse: TreeNode;\n  widgetData: {\n    [key: string]: {\n      [key: string]: unknown;\n    };\n  };\n  widgetDataPersistable: {\n    [key: string]: {\n      [key: string]: unknown;\n    };\n  };\n\n}\n\nconst createDashboardStoreInitialState = (kwArgs: CreateDashboardStoreInitialStateKwArgs): DashboardStoreState => {\n  const { caseSetId, completeCaseType, ...createTableStoreInitialStateKwArgs } = kwArgs;\n\n  return {\n    ...createTableStoreInitialState<CaseDbCase, CaseDbCompleteCaseType>(createTableStoreInitialStateKwArgs),\n    caseSetId,\n    completeCaseType,\n    dataContext: completeCaseType,\n    expandedZone: null,\n    filteredData: {\n      [SELECTION_FILTER_GROUP]: [],\n      [TREE_FILTER_GROUP]: [],\n    },\n    findSimilarCasesResults: [],\n    frontendFilterPriorities: [SELECTION_FILTER_GROUP, TREE_FILTER_GROUP],\n    isMaxResultsExceeded: false,\n    isMaxResultsExceededDismissed: false,\n    newick: null,\n    numVisibleAttributesInSummary: ConfigService.getInstance<CaseDbConfig>().config.epi.INITIAL_NUM_VISIBLE_ATTRIBUTES_IN_CASE_SUMMARY,\n    stratification: null,\n    stratifyableColumns: [],\n    tree: null,\n    treeAddresses: {},\n    treeResponse: null,\n    widgetData: Object.entries(ConfigService.getInstance<CaseDbConfig>().config.dashboard.WIDGETS).reduce((acc, [widgetName, widgetConfig]) => {\n      acc[widgetName] = cloneDeep(widgetConfig.dataDefaultValues);\n      return acc;\n    }, {} as { [key: string]: { [key: string]: unknown } }),\n    widgetDataPersistable: Object.entries(ConfigService.getInstance<CaseDbConfig>().config.dashboard.WIDGETS).reduce((acc, [widgetName, widgetConfig]) => {\n      acc[widgetName] = cloneDeep(widgetConfig.dataDefaultValues);\n      return acc;\n    }, {} as { [key: string]: { [key: string]: unknown } }),\n  };\n};\n\nexport const createDashboardStore = (kwArgs: CreateDashboardStoreKwArgs) => {\n  const { caseSetId, completeCaseType, ...createTableStoreKwArgs } = kwArgs;\n\n  const dashboardStore = createStore<DashboardStore>()(\n    persist(\n      (set, get) => {\n        const initialState = createDashboardStoreInitialState({\n          caseSetId,\n          completeCaseType,\n          ...createTableStoreKwArgs,\n        });\n        const tableStoreActions = createTableStoreActions<CaseDbCase, CaseDbCompleteCaseType>({\n          get,\n          set,\n        });\n\n        return {\n          ...initialState,\n          ...tableStoreActions,\n          addTreeFilter: async (nodeId: string) => {\n            const { filters, reloadSelectedIds, resetTreeAddresses, setFilterValue } = get();\n            resetTreeAddresses();\n            const treeFilter = filters.find(filter => filter instanceof TreeFilter);\n            await setFilterValue(treeFilter.id, nodeId);\n            reloadSelectedIds();\n          },\n          destroy: () => {\n            tableStoreActions.destroy();\n          },\n          expandZone: (expandedZone: string) => {\n            set({ expandedZone });\n          },\n          fetchData: async () => {\n            set({ dataError: null, isMaxResultsExceeded: false, isMaxResultsExceededDismissed: false });\n            const { fetchAbortController: previousFetchAbortController, findSimilarCasesResults, globalAbortSignal } = get();\n            const queryClient = QueryClientService.getInstance().queryClient;\n\n            const similarCaseIds = findSimilarCasesResults?.flatMap((result) => result.similarCaseIds) || [];\n\n            if (previousFetchAbortController && !previousFetchAbortController.signal.aborted) {\n              previousFetchAbortController.abort();\n            }\n            const fetchAbortController = new AbortController();\n            const globalAbortSignalListener = () => {\n              fetchAbortController.abort();\n              globalAbortSignal.removeEventListener('abort', globalAbortSignalListener);\n            };\n            globalAbortSignal.addEventListener('abort', globalAbortSignalListener);\n\n            set({ fetchAbortController });\n            set({ isDataLoading: true });\n            const { filters, setBaseData } = get();\n            const activeFilters = filters\n              .filter(filter => filter.filterMode === FILTER_MODE.BACKEND && !filter.isInitialFilterValue())\n              .map(activeFilter => activeFilter.toBackendFilter())\n              .filter(x => !!x);\n            const compositeFilter: CaseDbTypedCompositeFilter = activeFilters.length\n              ? {\n                filters: activeFilters,\n                operator: 'AND',\n                type: 'COMPOSITE',\n              }\n              : undefined;\n\n            const caseQuery: CaseDbCaseQuery = {\n              case_set_ids: caseSetId ? [caseSetId] : undefined,\n              case_type_id: completeCaseType.id,\n              filter: compositeFilter,\n            };\n            const retrieveCaseIdsByQueryQueryKey = [CASEDB_QUERY_KEY.CASE_IDS_BY_QUERY, completeCaseType.id, JSON.stringify(caseQuery)];\n\n            try {\n              let currentCaseIdsByQueryResponse = QueryClientService.getInstance().getValidQueryData<CaseDbCaseQueryResult>(retrieveCaseIdsByQueryQueryKey);\n              if (!currentCaseIdsByQueryResponse) {\n                const retrieveCaseIdsByQueryResponse = (await CaseDbCaseApi.getInstance().retrieveCaseIdsByQuery(caseQuery, { signal: fetchAbortController.signal })).data;\n                currentCaseIdsByQueryResponse = retrieveCaseIdsByQueryResponse;\n                queryClient.setQueryData(retrieveCaseIdsByQueryQueryKey, currentCaseIdsByQueryResponse);\n              }\n\n              // Note:  Combine the case ids from the query with similar case ids from the \"find similar cases\" feature, to make sure the similar cases are included in the data even if they do not match the current filters.\n              //        It's possible the user added similar cases to the current case_set after. Then the case will be included in the query AND the similar case result. So we need to make sure to only include unique case ids.\n              const caseIds = uniq([...currentCaseIdsByQueryResponse.case_ids, ...similarCaseIds]);\n\n              const currentCases = QueryClientService.getInstance().getValidQueryData<CaseDbCase[]>(QueryClientService.getInstance().getGenericKey(CASEDB_QUERY_KEY.CASES_LAZY));\n              const currentCaseIds = (currentCases ?? []).map(x => x.id);\n              const missingCaseIds = difference(caseIds, currentCaseIds);\n              if (missingCaseIds.length) {\n                const missingCasesResult = (await CaseDbCaseApi.getInstance().retrieveCasesByIds({\n                  case_ids: missingCaseIds,\n                  case_type_id: completeCaseType.id,\n                }, { signal: fetchAbortController.signal })).data;\n                queryClient.setQueryData(QueryClientService.getInstance().getGenericKey(CASEDB_QUERY_KEY.CASES_LAZY), [...currentCases ?? [], ...missingCasesResult]);\n              }\n\n              const casesMap = new Map((QueryClientService.getInstance().getValidQueryData<CaseDbCase[]>(QueryClientService.getInstance().getGenericKey(CASEDB_QUERY_KEY.CASES_LAZY)) ?? []).map(x => [x.id, x]));\n              casesMap.forEach((item) => {\n                queryClient.setQueryData(QueryClientService.getInstance().getGenericKey(CASEDB_QUERY_KEY.CASES_LAZY, item.id), item);\n              });\n              const cases = caseIds.map(id => casesMap.get(id));\n\n              setBaseData(cases);\n              set({ isDataLoading: false, isMaxResultsExceeded: currentCaseIdsByQueryResponse.is_max_results_exceeded });\n            } catch (error: unknown) {\n              if (!AxiosUtil.isAxiosCanceledError(error)) {\n                set({ dataError: error as Error });\n              }\n            } finally {\n              globalAbortSignal.removeEventListener('abort', globalAbortSignalListener);\n            }\n          },\n          getWidgetData: <TData>(widgetName: string): TData => {\n            const widgetData = get().widgetData[widgetName];\n            return widgetData as TData;\n          },\n          getWidgetDataPersistable: <TData>(widgetName: string): TData => {\n            const widgetData = get().widgetDataPersistable[widgetName];\n            return widgetData as TData;\n          },\n          mutateCachedCase: (caseId: string, item: CaseDbCase) => {\n            const queryClient = QueryClientService.getInstance().queryClient;\n            const currentCases = QueryClientService.getInstance().getValidQueryData<CaseDbCase[]>(QueryClientService.getInstance().getGenericKey(CASEDB_QUERY_KEY.CASES_LAZY));\n            queryClient.setQueryData(QueryClientService.getInstance().getGenericKey(CASEDB_QUERY_KEY.CASES_LAZY), currentCases.map(c => c.id === caseId ? item : c));\n          },\n          reloadFieldStratification: () => {\n            const { stratification, stratify, stratifyableColumns } = get();\n            if (stratification?.mode === STRATIFICATION_MODE.FIELD) {\n              const activeStratifyableColumn = stratifyableColumns.find(c => c.col.ref_col_id === stratification.col.ref_col_id);\n              if (!activeStratifyableColumn?.enabled) {\n                // column no longer stratifiable\n                NotificationService.getInstance().showNotification({\n                  message: t`The grouping column is no longer available. Grouping has been removed.`,\n                  severity: 'info',\n                });\n                stratify(null);\n                return;\n              }\n            }\n          },\n          reloadFilterData: () => {\n            const { reloadFieldStratification, reloadStratifyableColumns } = get();\n            tableStoreActions.reloadFilterData();\n            reloadStratifyableColumns();\n            reloadFieldStratification();\n          },\n          // Private\n          reloadFilterPriorityData: (filterPriority: string, data: CaseDbCase[]): CaseDbCase[] => {\n            const { filters, reloadTree } = get();\n            if (filterPriority === SELECTION_FILTER_GROUP) {\n              const selectionFilter = filters.find(filter => filter instanceof SelectionFilter);\n              let filteredCases: CaseDbCase[];\n              if (!selectionFilter.isInitialFilterValue()) {\n                const caseIdsInSelection = selectionFilter.filterValue;\n                filteredCases = data.filter(c => caseIdsInSelection.includes(c.id));\n              } else {\n                filteredCases = data;\n              }\n              return filteredCases;\n            }\n            if (filterPriority === TREE_FILTER_GROUP) {\n              const treeFilter = filters.find(filter => filter instanceof TreeFilter);\n              reloadTree();\n              const { tree } = get();\n              let filteredCases: CaseDbCase[];\n              if (!treeFilter.isInitialFilterValue()) {\n                const { subTreeLeaveNames } = tree;\n                filteredCases = data.filter(c => subTreeLeaveNames.includes(c.id));\n              } else {\n                filteredCases = data;\n              }\n              return filteredCases;\n            }\n            throw new Error(`Unknown filter group: ${filterPriority}`);\n          },\n          reloadStratifyableColumns: () => {\n            const { filteredData, frontendFilterPriorities } = get();\n\n            const data = filteredData[last(frontendFilterPriorities)];\n            const stratifyableColumns = StratificationUtil.getStratifyableColumns({\n              completeCaseType,\n              data,\n            });\n            set({ stratifyableColumns });\n          },\n          reloadTree: () => {\n            const { filters, getWidgetDataPersistable, treeResponse } = get();\n            const treeConfiguration = getWidgetDataPersistable<TreeWidgetDataPersistable>(DASHBOARD_COMPONENT_NAME.TREE).treeConfiguration;\n            const zoomedInTreeNodeName = filters.find(filter => filter instanceof TreeFilter)?.filterValue;\n            const tree = zoomedInTreeNodeName ? TreeUtil.findNewTreeRoot(treeResponse, zoomedInTreeNodeName, 'node') : treeResponse;\n            if (tree) {\n              set({\n                treeAddresses: {\n                  ...get().treeAddresses,\n                  [treeConfiguration.col.id]: {\n                    addresses: TreeUtil.createTreeAddresses(tree),\n                    algorithmCode: treeConfiguration.treeAlgorithm.code,\n                  },\n                },\n              });\n            }\n            set({ tree });\n          },\n          removeTreeFilter: async () => {\n            const { filters, resetTreeAddresses, setFilterValue } = get();\n            const treeFilter = filters.find(filter => filter instanceof TreeFilter);\n            if (treeFilter.filterValue) {\n              resetTreeAddresses();\n              await setFilterValue(treeFilter.id, treeFilter.initialFilterValue);\n            }\n          },\n          resetTreeAddresses: () => {\n            set({ treeAddresses: {} });\n          },\n          // Overwrite table store actions\n          setFilterValues: async (filterValues: FilterValues) => {\n            const { filters: prevFilters } = get();\n            const previousFilterValues: FilterValues = {};\n            prevFilters.forEach(filter => {\n              previousFilterValues[filter.id] = filter.filterValue;\n            });\n            const filterValuesDiff = ObjectUtil.getObjectDiff(previousFilterValues, filterValues);\n            const treeFilter = prevFilters.find(filter => filter instanceof TreeFilter);\n            const hadTreeFilter = !treeFilter.isInitialFilterValue(previousFilterValues[treeFilter.id]);\n            if (hadTreeFilter && !filterValuesDiff.includes(treeFilter.id)) {\n              NotificationService.getInstance().showNotification({\n                message: t`The tree filter has automatically been removed, because it's incompatible with the results of the other filters.`,\n                severity: 'info',\n              });\n              await tableStoreActions.setFilterValues({\n                ...filterValues,\n                [treeFilter.id]: treeFilter.initialFilterValue,\n              });\n            } else {\n              await tableStoreActions.setFilterValues(filterValues);\n            }\n          },\n          setFindSimilarCasesResults: async (findSimilarCasesResults: FindSimilarCasesResult[]) => {\n            const { filters, stratification, stratify } = get();\n            const filterValues: FilterValues = {};\n            filters.forEach(filter => {\n              filterValues[filter.id] = filter.filterValue;\n            });\n            const treeFilter = filters.find(filter => filter instanceof TreeFilter);\n            const hasTreeFilter = !treeFilter.isInitialFilterValue(filterValues[treeFilter.id]);\n            if (hasTreeFilter) {\n              NotificationService.getInstance().showNotification({\n                message: t`The tree filter has automatically been removed, because it's incompatible with the results of \"Find Similar Cases\".`,\n                severity: 'info',\n              });\n              await tableStoreActions.setFilterValues({\n                ...filterValues,\n                [treeFilter.id]: treeFilter.initialFilterValue,\n              });\n            }\n            set({ findSimilarCasesResults });\n            await get().fetchData();\n            if (stratification?.mode === STRATIFICATION_MODE.SIMILAR_CASES) {\n              stratify(STRATIFICATION_MODE.SIMILAR_CASES);\n            }\n          },\n          setNumVisibleAttributesInSummary: (numVisibleAttributesInSummary: number) => {\n            set({ numVisibleAttributesInSummary });\n          },\n\n          setPhylogeneticTreeResponse: (phylogeneticTree: CaseDbPhylogeneticTree) => {\n            const { newick, reloadSelectedIds, reloadSortedData, reloadTree } = get();\n\n            if (newick === phylogeneticTree.newick_repr) {\n              return;\n            }\n\n            if (phylogeneticTree.newick_repr && phylogeneticTree.newick_repr.trim().length > 0 && phylogeneticTree.newick_repr !== '();') {\n              // parse the newick into a tree\n              const parsedTree = NewickUtil.parse(phylogeneticTree.newick_repr);\n              const sanitizedTree = TreeUtil.sanitizeTree(parsedTree, completeCaseType.genetic_distance_protocols[phylogeneticTree.protocol_id].seqdb_max_stored_distance);\n\n              // the tree determines the order of the line list\n              const sortedIds = NewickUtil.getSortedNames(sanitizedTree);\n\n              set({\n                newick: phylogeneticTree.newick_repr,\n                sortedIds,\n                tree: sanitizedTree,\n                treeResponse: sanitizedTree,\n              });\n            } else {\n              set({\n                newick: phylogeneticTree.newick_repr,\n                sortedIds: [],\n                tree: null,\n                treeResponse: null,\n              });\n            }\n\n            reloadTree();\n            reloadSortedData();\n            reloadSelectedIds();\n          },\n          setSelectedIds: (selectedIds: string[]) => {\n            tableStoreActions.setSelectedIds(selectedIds);\n\n            const { stratification, stratify } = get();\n\n            // Apply stratification\n            if (selectedIds.length && (!stratification || stratification?.mode === STRATIFICATION_MODE.SELECTION)) {\n              stratify(STRATIFICATION_MODE.SELECTION);\n            } else if (stratification?.mode === STRATIFICATION_MODE.SELECTION && !selectedIds.length) {\n              stratify(null);\n            }\n          },\n\n          stratify: (mode: STRATIFICATION_MODE, col?: CaseDbCol) => {\n            const { findSimilarCasesResults, selectedIds, sortedData } = get();\n            set({\n              stratification: StratificationUtil.getStratification({\n                col,\n                completeCaseType,\n                mode,\n                selectedIds,\n                similarCaseIds: findSimilarCasesResults?.flatMap((result) => result.similarCaseIds) || [],\n                sortedData,\n              }),\n            });\n          },\n          treeFilterStepOut: async () => {\n            const { filters, resetTreeAddresses, setFilterValue, treeResponse } = get();\n            resetTreeAddresses();\n            const treeFilter = filters.find(filter => filter instanceof TreeFilter);\n            const zoomedInTreeNodeName = TreeUtil.findNewTreeRoot(treeResponse, treeFilter?.filterValue, 'parent').name;\n            await setFilterValue(treeFilter.id, zoomedInTreeNodeName === treeResponse.name ? null : zoomedInTreeNodeName);\n          },\n          updateWidgetData: <T, TPartialData = Partial<T>>(widgetName: string, data: TPartialData) => {\n            set({ widgetData: produce(get().widgetData, (draft) => ({ ...draft, [widgetName]: { ...draft[widgetName] as { [key: string]: T }, ...data } })) });\n          },\n          updateWidgetDataPersistable: <T, TPartialData = Partial<T>>(widgetName: string, data: TPartialData) => {\n            set({ widgetDataPersistable: produce(get().widgetDataPersistable, (draft) => ({ ...draft, [widgetName]: { ...draft[widgetName] as { [key: string]: T }, ...data } })) });\n          },\n        };\n      },\n      createTableStorePersistConfiguration<CaseDbCase, CaseDbCompleteCaseType, DashboardStore>(kwArgs.storageNamePostFix, kwArgs.storageVersion, (state) => {\n        return {\n          numVisibleAttributesInSummary: state.numVisibleAttributesInSummary,\n          widgetDataPersistable: state.widgetDataPersistable,\n        };\n      }),\n    ),\n  );\n  dashboardStore.getState().setFilters(FilterUtil.createFilters(completeCaseType), FilterUtil.createFilterDimensions(completeCaseType), [SELECTION_FILTER_GROUP, TREE_FILTER_GROUP]);\n  return dashboardStore;\n};\n","import { createContext } from 'react';\nimport type { StoreApi } from 'zustand';\n\nimport type { DashboardStore } from './dashboardStore';\n\nexport const DashboardStoreContext = createContext<StoreApi<DashboardStore>>(null);\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AACA,IAAI,KAAU,OAAO,IAAI,eAAe,GACpC,KAAY,OAAO,IAAI,iBAAiB,GACxC,IAAc,OAAO,IAAI,aAAa,GAGtC,KAAA,QAAA,IAAA,aAAkC,eA8BlC,CAAC,IA9BgD;CAEnD,SAAS,GAAQ;EACf,OAAO,mBAAmB,EAAO,kFAAkF,EAAO;CAC5H;CACA,SAAS,GAAO;EACd,OAAO,sJAAsJ,EAAM;CACrK;CACA;CACA,SAAS,GAAM;EACb,OAAO,yHAAyH;CAClI;CACA;CACA;CACA;CACA;CACA;CACA;CACA,SAAS,GAAO;EACd,OAAO,mCAAmC;CAC5C;CACA;CACA;CACA;CACA;CACA,SAAS,GAAO;EACd,OAAO,oCAAoC;CAC7C;AAGF;AACA,SAAS,EAAI,GAAO,GAAG,GAAM;CAC3B,IAAA,QAAA,IAAA,aAA6B,cAAc;EACzC,IAAM,IAAI,GAAO,IACX,IAAM,EAAW,CAAC,IAAI,EAAE,MAAM,MAAM,CAAI,IAAI;EAClD,MAAU,MAAM,WAAW,GAAK;CAClC;CACA,MAAU,MACR,8BAA8B,EAAM,wCACtC;AACF;AAGA,IAAI,IAAI,QACJ,IAAiB,EAAE,gBACnB,IAAc,eACd,IAAY,aACZ,KAAe,gBACf,IAAa,cACb,IAAW,YACX,IAAQ,SACR,KAAW,MAAU,CAAC,CAAC,KAAS,CAAC,CAAC,EAAM;AAC5C,SAAS,EAAY,GAAO;CAG1B,OAFK,IAEE,GAAc,CAAK,KAAK,EAAQ,CAAK,KAAK,CAAC,CAAC,EAAM,OAAc,CAAC,CAAC,EAAM,EAAY,GAAG,OAAc,EAAM,CAAK,KAAK,EAAM,CAAK,IAD9H;AAEX;AACA,IAAI,KAAmB,EAAE,EAAU,CAAC,EAAY,CAAC,SAAS,GACtD,qBAAoC,IAAI,QAAQ;AACpD,SAAS,GAAc,GAAO;CAC5B,IAAI,CAAC,KAAS,CAAC,EAAY,CAAK,GAC9B,OAAO;CACT,IAAM,IAAQ,EAAe,CAAK;CAClC,IAAI,MAAU,QAAQ,MAAU,EAAE,IAChC,OAAO;CACT,IAAM,IAAO,EAAE,eAAe,KAAK,GAAO,CAAW,KAAK,EAAM;CAChE,IAAI,MAAS,QACX,OAAO;CACT,IAAI,CAAC,EAAW,CAAI,GAClB,OAAO;CACT,IAAI,IAAa,GAAkB,IAAI,CAAI;CAK3C,OAJI,MAAe,KAAK,MACtB,IAAa,SAAS,SAAS,KAAK,CAAI,GACxC,GAAkB,IAAI,GAAM,CAAU,IAEjC,MAAe;AACxB;AAMA,SAAS,EAAK,GAAK,GAAM,IAAS,IAAM;CACtC,AAAI,EAAY,CAAG,MAAM,KACV,IAAS,QAAQ,QAAQ,CAAG,IAAI,EAAE,KAAK,CAAG,EAAA,CAClD,SAAS,MAAQ;EACpB,EAAK,GAAK,EAAI,IAAM,CAAG;CACzB,CAAC,IAED,EAAI,SAAS,GAAO,MAAU,EAAK,GAAO,GAAO,CAAG,CAAC;AAEzD;AACA,SAAS,EAAY,GAAO;CAC1B,IAAM,IAAQ,EAAM;CACpB,OAAO,IAAQ,EAAM,QAAQ,EAAQ,CAAK,IAAI,IAAgB,EAAM,CAAK,IAAI,IAAc,EAAM,CAAK,IAAI,IAAc;AAC1H;AACA,IAAI,MAAO,GAAO,GAAM,IAAO,EAAY,CAAK,MAAM,MAAS,IAAc,EAAM,IAAI,CAAI,IAAI,EAAE,EAAU,CAAC,eAAe,KAAK,GAAO,CAAI,GACvI,KAAO,GAAO,GAAM,IAAO,EAAY,CAAK,MAE9C,MAAS,IAAc,EAAM,IAAI,CAAI,IAAI,EAAM,IAE7C,KAAO,GAAO,GAAgB,GAAO,IAAO,EAAY,CAAK,MAAM;CACrE,AAAI,MAAS,IACX,EAAM,IAAI,GAAgB,CAAK,IACxB,MAAS,IAChB,EAAM,IAAI,CAAK,IAEf,EAAM,KAAkB;AAC5B;AACA,SAAS,GAAG,GAAG,GAAG;CAId,OAHE,MAAM,IACD,MAAM,KAAK,IAAI,KAAM,IAAI,IAEzB,MAAM,KAAK,MAAM;AAE5B;AACA,IAAI,IAAU,MAAM,SAChB,KAAS,MAAW,aAAkB,KACtC,KAAS,MAAW,aAAkB,KACtC,KAAe,MAAW,OAAO,KAAW,UAC5C,KAAc,MAAW,OAAO,KAAW,YAC3C,KAAa,MAAW,OAAO,KAAW;AAC9C,SAAS,GAAa,GAAO;CAC3B,IAAM,IAAI,CAAC;CACX,OAAO,OAAO,UAAU,CAAC,KAAK,OAAO,CAAC,MAAM;AAC9C;AAMA,IAAI,KAAU,MAAU,EAAM,SAAS,EAAM,OAKzC,KAAiB,MAAU,EAAM,YAAY,EAAM,QAAQ,EAAM;AACrE,SAAS,EAAY,GAAM,GAAQ;CACjC,IAAI,EAAM,CAAI,GACZ,OAAO,IAAI,IAAI,CAAI;CAErB,IAAI,EAAM,CAAI,GACZ,OAAO,IAAI,IAAI,CAAI;CAErB,IAAI,EAAQ,CAAI,GACd,OAAO,MAAM,EAAU,CAAC,MAAM,KAAK,CAAI;CACzC,IAAM,IAAU,GAAc,CAAI;CAClC,IAAI,MAAW,MAAQ,MAAW,gBAAgB,CAAC,GAAS;EAC1D,IAAM,IAAc,EAAE,0BAA0B,CAAI;EACpD,OAAO,EAAY;EACnB,IAAI,IAAO,QAAQ,QAAQ,CAAW;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,KAAK;GACpC,IAAM,IAAM,EAAK,IACX,IAAO,EAAY;GAKzB,AAJI,EAAK,OAAc,OACrB,EAAK,KAAY,IACjB,EAAK,MAAgB,MAEnB,EAAK,OAAO,EAAK,SACnB,EAAY,KAAO;KAChB,KAAe;KACf,IAAW;KAEX,IAAa,EAAK;KAClB,IAAQ,EAAK;GAChB;EACJ;EACA,OAAO,EAAE,OAAO,EAAe,CAAI,GAAG,CAAW;CACnD,OAAO;EACL,IAAM,IAAQ,EAAe,CAAI;EACjC,IAAI,MAAU,QAAQ,GACpB,OAAO,EAAE,GAAG,EAAK;EAEnB,IAAM,IAAM,EAAE,OAAO,CAAK;EAC1B,OAAO,EAAE,OAAO,GAAK,CAAI;CAC3B;AACF;AACA,SAAS,EAAO,GAAK,IAAO,IAAO;CAoBjC,OAnBI,EAAS,CAAG,KAAK,EAAQ,CAAG,KAAK,CAAC,EAAY,CAAG,IAC5C,KACL,EAAY,CAAG,IAAI,KACrB,EAAE,iBAAiB,GAAK;EACtB,KAAK;EACL,KAAK;EACL,OAAO;EACP,QAAQ;CACV,CAAC,GAEH,EAAE,OAAO,CAAG,GACR,KACF,EACE,IACC,GAAM,MAAU;EACf,EAAO,GAAO,EAAI;CACpB,GACA,EACF,GACK;AACT;AACA,SAAS,KAA8B;CACrC,EAAI,CAAC;AACP;AACA,IAAI,IAA2B,GAC5B,IAAQ,GACX;AACA,SAAS,EAAS,GAAK;CAGrB,OAFI,MAAQ,QAAQ,CAAC,EAAY,CAAG,IAC3B,KACF,EAAE,SAAS,CAAG;AACvB;AAGA,IAAI,IAAe,UACf,KAAgB,WAChB,KAAqB,gBACrB,KAAU,CAAC;AACf,SAAS,EAAU,GAAW;CAC5B,IAAM,IAAS,GAAQ;CAIvB,OAHK,KACH,EAAI,GAAG,CAAS,GAEX;AACT;AACA,IAAI,MAAkB,MAAc,CAAC,CAAC,GAAQ,IAO1C,GACA,WAAwB,GACxB,MAAe,GAAS,OAAY;CACtC,SAAS,CAAC;CACV;CACA;CAGA,gBAAgB;CAChB,oBAAoB;CACpB,6BAA6B,IAAI,IAAI;CACrC,sCAAsC,IAAI,IAAI;CAC9C,eAAe,GAAe,CAAY,IAAI,EAAU,CAAY,IAAI,KAAK;CAC7E,qBAAqB,GAAe,EAAkB,IAAI,EAAU,EAAkB,IAAI,KAAK;AACjG;AACA,SAAS,GAAkB,GAAO,GAAe;CAC/C,AAAI,MACF,EAAM,eAAe,EAAU,EAAa,GAC5C,EAAM,WAAW,CAAC,GAClB,EAAM,kBAAkB,CAAC,GACzB,EAAM,iBAAiB;AAE3B;AACA,SAAS,GAAY,GAAO;CAG1B,AAFA,GAAW,CAAK,GAChB,EAAM,QAAQ,QAAQ,EAAW,GACjC,EAAM,UAAU;AAClB;AACA,SAAS,GAAW,GAAO;CACzB,AAAI,MAAU,MACZ,IAAe,EAAM;AAEzB;AACA,IAAI,MAAc,MAAW,IAAe,GAAY,GAAc,CAAM;AAC5E,SAAS,GAAY,GAAO;CAC1B,IAAM,IAAQ,EAAM;CACpB,AAAI,EAAM,UAAU,KAAkB,EAAM,UAAU,IACpD,EAAM,QAAQ,IAEd,EAAM,WAAW;AACrB;AAGA,SAAS,GAAc,GAAQ,GAAO;CACpC,EAAM,qBAAqB,EAAM,QAAQ;CACzC,IAAM,IAAY,EAAM,QAAQ;CAEhC,IADmB,MAAW,KAAK,KAAK,MAAW,GACnC;EAKd,AAJI,EAAU,EAAY,CAAC,cACzB,GAAY,CAAK,GACjB,EAAI,CAAC,IAEH,EAAY,CAAM,MACpB,IAAS,GAAS,GAAO,CAAM;EAEjC,IAAM,EAAE,oBAAiB;EACzB,AAAI,KACF,EAAa,4BACX,EAAU,EAAY,CAAC,OACvB,GACA,CACF;CAEJ,OACE,IAAS,GAAS,GAAO,CAAS;CAOpC,OALA,GAAY,GAAO,GAAQ,EAAI,GAC/B,GAAY,CAAK,GACb,EAAM,YACR,EAAM,eAAe,EAAM,UAAU,EAAM,eAAe,GAErD,MAAW,KAAmB,KAAK,IAAd;AAC9B;AACA,SAAS,GAAS,GAAW,GAAO;CAClC,IAAI,EAAS,CAAK,GAChB,OAAO;CACT,IAAM,IAAQ,EAAM;CACpB,IAAI,CAAC,GAEH,OADmB,EAAY,GAAO,EAAU,aAAa,CAC7C;CAElB,IAAI,CAAC,EAAY,GAAO,CAAS,GAC/B,OAAO;CAET,IAAI,CAAC,EAAM,WACT,OAAO,EAAM;CAEf,IAAI,CAAC,EAAM,YAAY;EACrB,IAAM,EAAE,kBAAe;EACvB,IAAI,GACF,OAAO,EAAW,SAAS,IAEzB,EAD4B,IACrB,CAAC,CAAC,CAAS;EAGtB,GAA2B,GAAO,CAAS;CAC7C;CACA,OAAO,EAAM;AACf;AACA,SAAS,GAAY,GAAO,GAAO,IAAO,IAAO;CAC/C,AAAI,CAAC,EAAM,WAAW,EAAM,OAAO,eAAe,EAAM,kBACtD,EAAO,GAAO,CAAI;AAEtB;AACA,SAAS,GAAmB,GAAO;CAEjC,AADA,EAAM,aAAa,IACnB,EAAM,OAAO;AACf;AACA,IAAI,KAAe,GAAO,MAAc,EAAM,WAAW,GACrD,KAAyB,CAAC;AAC9B,SAAS,GAAoB,GAAQ,GAAY,GAAgB,GAAa;CAC5E,IAAM,IAAa,EAAO,CAAM,GAC1B,IAAa,EAAO;CAC1B,IAAI,MAAgB,KAAK,KACF,EAAI,GAAY,GAAa,CACnC,MAAM,GAAY;EAC/B,EAAI,GAAY,GAAa,GAAgB,CAAU;EACvD;CACF;CAEF,IAAI,CAAC,EAAO,iBAAiB;EAC3B,IAAM,IAAiB,EAAO,kCAAkC,IAAI,IAAI;EACxE,EAAK,IAAa,GAAK,MAAU;GAC/B,IAAI,EAAQ,CAAK,GAAG;IAClB,IAAM,IAAO,EAAe,IAAI,CAAK,KAAK,CAAC;IAE3C,AADA,EAAK,KAAK,CAAG,GACb,EAAe,IAAI,GAAO,CAAI;GAChC;EACF,CAAC;CACH;CACA,IAAM,IAAY,EAAO,gBAAgB,IAAI,CAAU,KAAK;CAC5D,KAAK,IAAM,KAAY,GACrB,EAAI,GAAY,GAAU,GAAgB,CAAU;AAExD;AACA,SAAS,GAAkC,GAAQ,GAAO,GAAK;CAC7D,EAAO,WAAW,KAAK,SAAsB,GAAW;EACtD,IAAM,IAAQ;EACd,IAAI,CAAC,KAAS,CAAC,EAAY,GAAO,CAAS,GACzC;EAEF,EAAU,eAAe,eAAe,CAAK;EAC7C,IAAM,IAAiB,EAAc,CAAK;EAE1C,AADA,GAAoB,GAAQ,EAAM,UAAU,GAAO,GAAgB,CAAG,GACtE,GAA2B,GAAO,CAAS;CAC7C,CAAC;AACH;AACA,SAAS,GAA2B,GAAO,GAAW;CAEpD,IADuB,EAAM,aAAa,CAAC,EAAM,eAAe,EAAM,UAAU,KAAe,EAAM,UAAU,KAAiB,EAAM,0BAA0B,EAAM,WAAW,QAAQ,KAAK,IAC1K;EAClB,IAAM,EAAE,oBAAiB;EACzB,IAAI,GAAc;GAChB,IAAM,IAAW,EAAa,QAAQ,CAAK;GAC3C,AAAI,KACF,EAAa,iBAAiB,GAAO,GAAU,CAAS;EAE5D;EACA,GAAmB,CAAK;CAC1B;AACF;AACA,SAAS,GAAqB,GAAQ,GAAK,GAAO;CAChD,IAAM,EAAE,cAAW;CACnB,IAAI,EAAQ,CAAK,GAAG;EAClB,IAAM,IAAQ,EAAM;EACpB,AAAI,EAAY,GAAO,CAAM,KAC3B,EAAM,WAAW,KAAK,WAAiC;GAGrD,AAFA,EAAY,CAAM,GAElB,GAAoB,GAAQ,GADL,EAAc,CACW,GAAG,CAAG;EACxD,CAAC;CAEL,OAAO,AAAI,EAAY,CAAK,KAC1B,EAAO,WAAW,KAAK,WAA8B;EACnD,IAAM,IAAa,EAAO,CAAM;EAChC,AAAI,EAAO,UAAU,IACf,EAAW,IAAI,CAAK,KACtB,EAAY,GAAO,EAAO,aAAa,CAAM,IAG3C,EAAI,GAAY,GAAK,EAAO,KAAK,MAAM,KACrC,EAAO,QAAQ,SAAS,MAAM,EAAO,UAAU,IAAI,CAAG,KAAK,QAAW,MAAQ,EAAO,SACvF,EACE,EAAI,EAAO,OAAO,GAAK,EAAO,KAAK,GACnC,EAAO,aACP,CACF;CAIR,CAAC;AAEL;AACA,SAAS,EAAY,GAAQ,GAAY,GAAW;CAoBlD,OAnBI,CAAC,EAAU,OAAO,eAAe,EAAU,qBAAqB,KAGhE,EAAQ,CAAM,KAAK,EAAW,IAAI,CAAM,KAAK,CAAC,EAAY,CAAM,KAAK,EAAS,CAAM,IAC/E,KAET,EAAW,IAAI,CAAM,GACrB,EAAK,IAAS,GAAK,MAAU;EAC3B,IAAI,EAAQ,CAAK,GAAG;GAClB,IAAM,IAAQ,EAAM;GACpB,AAAI,EAAY,GAAO,CAAS,MAE9B,EAAI,GAAQ,GADS,EAAc,CACP,GAAG,EAAO,KAAK,GAC3C,GAAmB,CAAK;EAE5B,OAAO,AAAI,EAAY,CAAK,KAC1B,EAAY,GAAO,GAAY,CAAS;CAE5C,CAAC,GACM;AACT;AAGA,SAAS,GAAiB,GAAM,GAAQ;CACtC,IAAM,IAAc,EAAQ,CAAI,GAC1B,IAAQ;EACZ,OAAO;EAEP,QAAQ,IAAS,EAAO,SAAS,GAAgB;EAEjD,WAAW;EAEX,YAAY;EAGZ,WAAW,KAAK;EAEhB,SAAS;EAET,OAAO;EAEP,QAAQ;EAGR,OAAO;EAEP,SAAS;EACT,WAAW;EAEX,YAAY,KAAK;CACnB,GACI,IAAS,GACT,IAAQ;CACZ,AAAI,MACF,IAAS,CAAC,CAAK,GACf,IAAQ;CAEV,IAAM,EAAE,WAAQ,aAAU,MAAM,UAAU,GAAQ,CAAK;CAGvD,OAFA,EAAM,SAAS,GACf,EAAM,UAAU,GACT,CAAC,GAAO,CAAK;AACtB;AACA,IAAI,IAAc;CAChB,IAAI,GAAO,GAAM;EACf,IAAI,MAAS,GACX,OAAO;EACT,IAAI,MAAS,iBAAiB,MAAS,aAAa;GAElD,IAAM,IADU,EAAO,CACF,CAAC,CAAC;GACvB,OAAO,IAAI,MAAM,KAAU,CAAC,GAAG;IAC7B,MAAM,GAAQ,MACR,MAAQ,eAAe,MAAQ,cAC1B,OAAO,OAAuB,uBAAO,OAAO,IAAI,CAAC,IAEnD,QAAQ,IAAI,GAAQ,CAAG;IAEhC,WACS;IAET,QAAQ,GAAQ,GAAS,MAChB,QAAQ,MAAM,GAAQ,GAAS,CAAI;GAE9C,CAAC;EACH;EACA,IAAI,IAAc,EAAM,OAAO,qBACzB,IAAwB,EAAM,UAAU,KAAiB,OAAO,KAAS;EAC/E,IAAI,KACE,GAAa,uBAAuB,CAAI,GAC1C,OAAO,EAAY,wBAAwB,GAAO,CAAI;EAG1D,IAAM,IAAS,EAAO,CAAK;EAC3B,IAAI,CAAC,GAAI,GAAQ,GAAM,EAAM,KAAK,GAChC,OAAO,GAAkB,GAAO,GAAQ,CAAI;EAE9C,IAAM,IAAQ,EAAO;EAIrB,IAHI,EAAM,cAAc,CAAC,EAAY,CAAK,KAGtC,KAAyB,EAAM,mBAAmB,GAAa,sBACjE,EAAM,eACR,KAAK,GAAa,CAAI,GACpB,OAAO;EAET,IAAI,MAAU,GAAK,EAAM,OAAO,CAAI,GAAG;GACrC,EAAY,CAAK;GACjB,IAAM,IAAW,EAAM,UAAU,IAAgB,CAAC,IAAO,GACnD,IAAa,EAAY,EAAM,QAAQ,GAAO,GAAO,CAAQ;GACnE,OAAO,EAAM,MAAM,KAAY;EACjC;EACA,OAAO;CACT;CACA,IAAI,GAAO,GAAM;EAIf,OAHI,MAAS,iBAAiB,MAAS,eAAe,MAAS,cACtD,KAEF,KAAQ,EAAO,CAAK;CAC7B;CACA,QAAQ,GAAO;EACb,OAAO,QAAQ,QAAQ,EAAO,CAAK,CAAC;CACtC;CACA,IAAI,GAAO,GAAM,GAAO;EACtB,IAAI,MAAS,iBAAiB,MAAS,eAAe,MAAS,aAC7D,OAAO;EAET,IAAM,IAAO,GAAuB,EAAO,CAAK,GAAG,CAAI;EACvD,IAAI,GAAM,KAER,OADA,EAAK,IAAI,KAAK,EAAM,QAAQ,CAAK,GAC1B;EAET,IAAI,CAAC,EAAM,WAAW;GACpB,IAAM,IAAW,GAAK,EAAO,CAAK,GAAG,CAAI,GACnC,IAAe,IAAW;GAChC,IAAI,KAAgB,EAAa,UAAU,GAGzC,OAFA,EAAM,MAAM,KAAQ,GACpB,EAAM,UAAU,IAAI,GAAM,EAAK,GACxB;GAET,IAAI,GAAG,GAAO,CAAQ,MAAM,MAAU,KAAK,KAAK,GAAI,EAAM,OAAO,GAAM,EAAM,KAAK,IAChF,OAAO;GAET,AADA,EAAY,CAAK,GACjB,GAAY,CAAK;EACnB;EAQA,OAPI,EAAM,MAAM,OAAU,MACzB,MAAU,KAAK,KAAK,KAAQ,EAAM,UACnC,OAAO,MAAM,CAAK,KAAK,OAAO,MAAM,EAAM,MAAM,EAAK,IAC5C,MACT,EAAM,MAAM,KAAQ,GACpB,EAAM,UAAU,IAAI,GAAM,EAAI,GAC9B,GAAqB,GAAO,GAAM,CAAK,GAChC;CACT;CACA,eAAe,GAAO,GAAM;EAW1B,OAVA,EAAY,CAAK,GACb,GAAK,EAAM,OAAO,CAAI,MAAM,KAAK,KAAK,KAAQ,EAAM,SACtD,EAAM,UAAU,IAAI,GAAM,EAAK,GAC/B,GAAY,CAAK,KAEjB,EAAM,UAAU,OAAO,CAAI,GAEzB,EAAM,SACR,OAAO,EAAM,MAAM,IAEd;CACT;CAGA,yBAAyB,GAAO,GAAM;EACpC,IAAM,IAAQ,EAAO,CAAK,GACpB,IAAO,QAAQ,yBAAyB,GAAO,CAAI;EAGzD,OAFK,KAEE;IACJ,IAAW;IACX,KAAe,EAAM,UAAU,KAAiB,MAAS;IACzD,IAAa,EAAK;IAClB,IAAQ,EAAM;EACjB;CACF;CACA,iBAAiB;EACf,EAAI,EAAE;CACR;CACA,eAAe,GAAO;EACpB,OAAO,EAAe,EAAM,KAAK;CACnC;CACA,iBAAiB;EACf,EAAI,EAAE;CACR;AACF,GACI,IAAa,CAAC;AAClB,KAAK,IAAI,KAAO,GAAa;CAC3B,IAAI,IAAK,EAAY;CACrB,EAAW,KAAO,WAAW;EAC3B,IAAM,IAAO;EAEb,OADA,EAAK,KAAK,EAAK,EAAE,CAAC,IACX,EAAG,MAAM,MAAM,CAAI;CAC5B;AACF;AACA,EAAW,iBAAiB,SAAS,GAAO,GAAM;CAGhD,OAFA,QAAA,IAAA,aAA6B,gBAAgB,MAAM,SAAS,CAAI,CAAC,KAC/D,EAAI,EAAE,GACD,EAAW,IAAI,KAAK,MAAM,GAAO,GAAM,KAAK,CAAC;AACtD,GACA,EAAW,MAAM,SAAS,GAAO,GAAM,GAAO;CAG5C,OAFA,QAAA,IAAA,aAA6B,gBAAgB,MAAS,YAAY,MAAM,SAAS,CAAI,CAAC,KACpF,EAAI,EAAE,GACD,EAAY,IAAI,KAAK,MAAM,EAAM,IAAI,GAAM,GAAO,EAAM,EAAE;AACnE;AACA,SAAS,GAAK,GAAO,GAAM;CACzB,IAAM,IAAQ,EAAM;CAEpB,QADe,IAAQ,EAAO,CAAK,IAAI,EAAA,CACzB;AAChB;AACA,SAAS,GAAkB,GAAO,GAAQ,GAAM;CAC9C,IAAM,IAAO,GAAuB,GAAQ,CAAI;CAChD,OAAO,IAAO,KAAS,IAAO,EAAK,KAGjC,EAAK,KAAK,KAAK,EAAM,MAAM,IACzB,KAAK;AACX;AACA,SAAS,GAAuB,GAAQ,GAAM;CAC5C,IAAI,EAAE,KAAQ,IACZ;CACF,IAAI,IAAQ,EAAe,CAAM;CACjC,OAAO,IAAO;EACZ,IAAM,IAAO,OAAO,yBAAyB,GAAO,CAAI;EACxD,IAAI,GACF,OAAO;EACT,IAAQ,EAAe,CAAK;CAC9B;AAEF;AACA,SAAS,GAAY,GAAO;CAC1B,AAAK,EAAM,cACT,EAAM,YAAY,IACd,EAAM,WACR,GAAY,EAAM,OAAO;AAG/B;AACA,SAAS,EAAY,GAAO;CAC1B,AAEE,EAAM,WADN,EAAM,4BAA4B,IAAI,IAAI,GAC5B,EACZ,EAAM,OACN,EAAM,OAAO,OAAO,qBACtB;AAEJ;AAGA,IAAI,KAAS,MAAM;CACjB,YAAY,GAAQ;EAwFlB,AAvFA,KAAK,cAAc,IACnB,KAAK,wBAAwB,IAC7B,KAAK,sBAAsB,IAoB3B,KAAK,WAAW,GAAM,GAAQ,MAAkB;GAC9C,IAAI,EAAW,CAAI,KAAK,CAAC,EAAW,CAAM,GAAG;IAC3C,IAAM,IAAc;IACpB,IAAS;IACT,IAAM,IAAO;IACb,OAAO,SAAwB,IAAQ,GAAa,GAAG,GAAM;KAC3D,OAAO,EAAK,QAAQ,IAAQ,MAAU,EAAO,KAAK,MAAM,GAAO,GAAG,CAAI,CAAC;IACzE;GACF;GAGA,AAFK,EAAW,CAAM,KACpB,EAAI,CAAC,GACH,MAAkB,KAAK,KAAK,CAAC,EAAW,CAAa,KACvD,EAAI,CAAC;GACP,IAAI;GACJ,IAAI,EAAY,CAAI,GAAG;IACrB,IAAM,IAAQ,GAAW,IAAI,GACvB,IAAQ,EAAY,GAAO,GAAM,KAAK,CAAC,GACzC,IAAW;IACf,IAAI;KAEF,AADA,IAAS,EAAO,CAAK,GACrB,IAAW;IACb,UAAU;KACR,AAAI,IACF,GAAY,CAAK,IAEjB,GAAW,CAAK;IACpB;IAEA,OADA,GAAkB,GAAO,CAAa,GAC/B,GAAc,GAAQ,CAAK;GACpC,OAAO,IAAI,CAAC,KAAQ,CAAC,EAAY,CAAI,GAAG;IAQtC,IAPA,IAAS,EAAO,CAAI,GAChB,MAAW,KAAK,MAClB,IAAS,IACP,MAAW,OACb,IAAS,KAAK,IACZ,KAAK,eACP,EAAO,GAAQ,EAAI,GACjB,GAAe;KACjB,IAAM,IAAI,CAAC,GACL,IAAK,CAAC;KAKZ,AAJA,EAAU,EAAa,CAAC,CAAC,4BAA4B,GAAM,GAAQ;MACjE,UAAU;MACV,iBAAiB;KACnB,CAAC,GACD,EAAc,GAAG,CAAE;IACrB;IACA,OAAO;GACT,OACE,EAAI,GAAG,CAAI;EACf,GACA,KAAK,sBAAsB,GAAM,MAAW;GAC1C,IAAI,EAAW,CAAI,GACjB,QAAQ,GAAO,GAAG,MAAS,KAAK,mBAAmB,IAAQ,MAAU,EAAK,GAAO,GAAG,CAAI,CAAC;GAE3F,IAAI,GAAS;GAKb,OAAO;IAJQ,KAAK,QAAQ,GAAM,IAAS,GAAG,MAAO;KAEnD,AADA,IAAU,GACV,IAAiB;IACnB,CACa;IAAG;IAAS;GAAc;EACzC,GACI,EAAU,GAAQ,UAAU,KAC9B,KAAK,cAAc,EAAO,UAAU,GAClC,EAAU,GAAQ,oBAAoB,KACxC,KAAK,wBAAwB,EAAO,oBAAoB,GACtD,EAAU,GAAQ,kBAAkB,KACtC,KAAK,sBAAsB,EAAO,kBAAkB;CACxD;CACA,YAAY,GAAM;EAGhB,AAFK,EAAY,CAAI,KACnB,EAAI,CAAC,GACH,EAAQ,CAAI,MACd,IAAO,GAAQ,CAAI;EACrB,IAAM,IAAQ,GAAW,IAAI,GACvB,IAAQ,EAAY,GAAO,GAAM,KAAK,CAAC;EAG7C,OAFA,EAAM,EAAY,CAAC,YAAY,IAC/B,GAAW,CAAK,GACT;CACT;CACA,YAAY,GAAO,GAAe;EAChC,IAAM,IAAQ,KAAS,EAAM;EAC7B,CAAI,CAAC,KAAS,CAAC,EAAM,cACnB,EAAI,CAAC;EACP,IAAM,EAAE,QAAQ,MAAU;EAE1B,OADA,GAAkB,GAAO,CAAa,GAC/B,GAAc,KAAK,GAAG,CAAK;CACpC;CAMA,cAAc,GAAO;EACnB,KAAK,cAAc;CACrB;CAMA,wBAAwB,GAAO;EAC7B,KAAK,wBAAwB;CAC/B;CAOA,sBAAsB,GAAO;EAC3B,KAAK,sBAAsB;CAC7B;CACA,2BAA2B;EACzB,OAAO,KAAK;CACd;CACA,aAAa,GAAM,GAAS;EAC1B,IAAI;EACJ,KAAK,IAAI,EAAQ,SAAS,GAAG,KAAK,GAAG,KAAK;GACxC,IAAM,IAAQ,EAAQ;GACtB,IAAI,EAAM,KAAK,WAAW,KAAK,EAAM,OAAO,WAAW;IACrD,IAAO,EAAM;IACb;GACF;EACF;EACA,AAAI,IAAI,OACN,IAAU,EAAQ,MAAM,IAAI,CAAC;EAE/B,IAAM,IAAmB,EAAU,EAAa,CAAC,CAAC;EAIlD,OAHI,EAAQ,CAAI,IACP,EAAiB,GAAM,CAAO,IAEhC,KAAK,QACV,IACC,MAAU,EAAiB,GAAO,CAAO,CAC5C;CACF;AACF;AACA,SAAS,EAAY,GAAW,GAAO,GAAQ,GAAK;CAClD,IAAM,CAAC,GAAO,KAAS,EAAM,CAAK,IAAI,EAAU,CAAY,CAAC,CAAC,UAAU,GAAO,CAAM,IAAI,EAAM,CAAK,IAAI,EAAU,CAAY,CAAC,CAAC,UAAU,GAAO,CAAM,IAAI,GAAiB,GAAO,CAAM;CAgBzL,QAfc,GAAQ,UAAU,GAAgB,EAAA,CAC1C,QAAQ,KAAK,CAAK,GACxB,EAAM,aAAa,GAAQ,cAAc,CAAC,GAC1C,EAAM,OAAO,GACT,KAAU,MAAQ,KAAK,IACzB,GAAkC,GAAQ,GAAO,CAAG,IAEpD,EAAM,WAAW,KAAK,SAA0B,GAAY;EAC1D,EAAW,eAAe,eAAe,CAAK;EAC9C,IAAM,EAAE,oBAAiB;EACzB,AAAI,EAAM,aAAa,KACrB,EAAa,iBAAiB,GAAO,CAAC,GAAG,CAAU;CAEvD,CAAC,GAEI;AACT;AAGA,SAAS,GAAQ,GAAO;CAGtB,OAFK,EAAQ,CAAK,KAChB,EAAI,IAAI,CAAK,GACR,GAAY,CAAK;AAC1B;AACA,SAAS,GAAY,GAAO;CAC1B,IAAI,CAAC,EAAY,CAAK,KAAK,EAAS,CAAK,GACvC,OAAO;CACT,IAAM,IAAQ,EAAM,IAChB,GACA,IAAS;CACb,IAAI,GAAO;EACT,IAAI,CAAC,EAAM,WACT,OAAO,EAAM;EAGf,AAFA,EAAM,aAAa,IACnB,IAAO,EAAY,GAAO,EAAM,OAAO,OAAO,qBAAqB,GACnE,IAAS,EAAM,OAAO,OAAO,yBAAyB;CACxD,OACE,IAAO,EAAY,GAAO,EAAI;CAYhC,OAVA,EACE,IACC,GAAK,MAAe;EACnB,EAAI,GAAM,GAAK,GAAY,CAAU,CAAC;CACxC,GACA,CACF,GACI,MACF,EAAM,aAAa,KAEd;AACT;AAkvBA,IAAI,IAAU,IADE,GACF,CAAA,CAAM,yICt/Cd,MAAoC,MAAwE;CAChH,IAAM,EAAE,cAAW,qBAAkB,GAAG,MAAuC;CAE/E,OAAO;EACL,GAAG,GAAiE,CAAkC;EACtG;EACA;EACA,aAAa;EACb,cAAc;EACd,cAAc;IACX,IAAyB,CAAC;IAC1B,IAAoB,CAAC;EACxB;EACA,yBAAyB,CAAC;EAC1B,0BAA0B,CAAC,GAAwB,CAAiB;EACpE,sBAAsB;EACtB,+BAA+B;EAC/B,QAAQ;EACR,+BAA+B,GAAc,YAA0B,CAAC,CAAC,OAAO,IAAI;EACpF,gBAAgB;EAChB,qBAAqB,CAAC;EACtB,MAAM;EACN,eAAe,CAAC;EAChB,cAAc;EACd,YAAY,OAAO,QAAQ,GAAc,YAA0B,CAAC,CAAC,OAAO,UAAU,OAAO,CAAC,CAAC,QAAQ,GAAK,CAAC,GAAY,QACvH,EAAI,MAAA,GAAA,GAAA,QAAA,CAAwB,EAAa,iBAAiB,GACnD,IACN,CAAC,CAAkD;EACtD,uBAAuB,OAAO,QAAQ,GAAc,YAA0B,CAAC,CAAC,OAAO,UAAU,OAAO,CAAC,CAAC,QAAQ,GAAK,CAAC,GAAY,QAClI,EAAI,MAAA,GAAA,GAAA,QAAA,CAAwB,EAAa,iBAAiB,GACnD,IACN,CAAC,CAAkD;CACxD;AACF,GAEa,MAAwB,MAAuC;CAC1E,IAAM,EAAE,cAAW,qBAAkB,GAAG,MAA2B,GAE7D,IAAiB,GAA4B,CAAC,CAClD,IACG,GAAK,MAAQ;EACZ,IAAM,IAAe,GAAiC;GACpD;GACA;GACA,GAAG;EACL,CAAC,GACK,IAAoB,GAA4D;GACpF;GACA;EACF,CAAC;EAED,OAAO;GACL,GAAG;GACH,GAAG;GACH,eAAe,OAAO,MAAmB;IACvC,IAAM,EAAE,YAAS,sBAAmB,uBAAoB,sBAAmB,EAAI;IAI/E,AAHA,EAAmB,GAEnB,MAAM,EADa,EAAQ,MAAK,MAAU,aAAkB,CACvC,CAAA,CAAW,IAAI,CAAM,GAC1C,EAAkB;GACpB;GACA,eAAe;IACb,EAAkB,QAAQ;GAC5B;GACA,aAAa,MAAyB;IACpC,EAAI,EAAE,gBAAa,CAAC;GACtB;GACA,WAAW,YAAY;IACrB,EAAI;KAAE,WAAW;KAAM,sBAAsB;KAAO,+BAA+B;IAAM,CAAC;IAC1F,IAAM,EAAE,sBAAsB,GAA8B,4BAAyB,yBAAsB,EAAI,GACzG,IAAc,EAAmB,YAAY,CAAC,CAAC,aAE/C,IAAiB,GAAyB,SAAS,MAAW,EAAO,cAAc,KAAK,CAAC;IAE/F,AAAI,KAAgC,CAAC,EAA6B,OAAO,WACvE,EAA6B,MAAM;IAErC,IAAM,IAAuB,IAAI,gBAAgB,GAC3C,UAAkC;KAEtC,AADA,EAAqB,MAAM,GAC3B,EAAkB,oBAAoB,SAAS,CAAyB;IAC1E;IAIA,AAHA,EAAkB,iBAAiB,SAAS,CAAyB,GAErE,EAAI,EAAE,wBAAqB,CAAC,GAC5B,EAAI,EAAE,eAAe,GAAK,CAAC;IAC3B,IAAM,EAAE,aAAS,mBAAgB,EAAI,GAC/B,KAAgB,GACnB,QAAO,MAAU,EAAO,eAAe,GAAY,WAAW,CAAC,EAAO,qBAAqB,CAAC,CAAC,CAC7F,KAAI,MAAgB,EAAa,gBAAgB,CAAC,CAAC,CACnD,QAAO,MAAK,CAAC,CAAC,CAAC,GACZ,IAA8C,GAAc,SAC9D;KACA,SAAS;KACT,UAAU;KACV,MAAM;IACR,IACE,KAAA,GAEE,IAA6B;KACjC,cAAc,IAAY,CAAC,CAAS,IAAI,KAAA;KACxC,cAAc,EAAiB;KAC/B,QAAQ;IACV,GACM,KAAiC;KAAC,EAAiB;KAAmB,EAAiB;KAAI,KAAK,UAAU,CAAS;IAAC;IAE1H,IAAI;KACF,IAAI,IAAgC,EAAmB,YAAY,CAAC,CAAC,kBAAyC,EAA8B;KAC5I,AAAK,MAEH,KADwC,MAAM,GAAc,YAAY,CAAC,CAAC,uBAAuB,GAAW,EAAE,QAAQ,EAAqB,OAAO,CAAC,EAAA,CAAG,MAEtJ,EAAY,aAAa,IAAgC,CAA6B;KAKxF,IAAM,KAAA,GAAA,GAAA,QAAA,CAAe,CAAC,GAAG,EAA8B,UAAU,GAAG,CAAc,CAAC,GAE7E,IAAe,EAAmB,YAAY,CAAC,CAAC,kBAAgC,EAAmB,YAAY,CAAC,CAAC,cAAc,EAAiB,UAAU,CAAC,GAE3J,KAAA,GAAA,GAAA,QAAA,CAA4B,IADV,KAAgB,CAAC,EAAA,CAAG,KAAI,MAAK,EAAE,EACZ,CAAc;KACzD,IAAI,EAAe,QAAQ;MACzB,IAAM,KAAsB,MAAM,GAAc,YAAY,CAAC,CAAC,mBAAmB;OAC/E,UAAU;OACV,cAAc,EAAiB;MACjC,GAAG,EAAE,QAAQ,EAAqB,OAAO,CAAC,EAAA,CAAG;MAC7C,EAAY,aAAa,EAAmB,YAAY,CAAC,CAAC,cAAc,EAAiB,UAAU,GAAG,CAAC,GAAG,KAAgB,CAAC,GAAG,GAAG,CAAkB,CAAC;KACtJ;KAEA,IAAM,IAAW,IAAI,KAAK,EAAmB,YAAY,CAAC,CAAC,kBAAgC,EAAmB,YAAY,CAAC,CAAC,cAAc,EAAiB,UAAU,CAAC,KAAK,CAAC,EAAA,CAAG,KAAI,MAAK,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;KAOlM,AANA,EAAS,SAAS,MAAS;MACzB,EAAY,aAAa,EAAmB,YAAY,CAAC,CAAC,cAAc,EAAiB,YAAY,EAAK,EAAE,GAAG,CAAI;KACrH,CAAC,GAGD,EAFc,EAAQ,KAAI,MAAM,EAAS,IAAI,CAAE,CAEnC,CAAK,GACjB,EAAI;MAAE,eAAe;MAAO,sBAAsB,EAA8B;KAAwB,CAAC;IAC3G,SAAS,GAAgB;KACvB,AAAK,GAAU,qBAAqB,CAAK,KACvC,EAAI,EAAE,WAAW,EAAe,CAAC;IAErC,UAAU;KACR,EAAkB,oBAAoB,SAAS,CAAyB;IAC1E;GACF;GACA,gBAAuB,MACF,EAAI,CAAC,CAAC,WAAW;GAGtC,2BAAkC,MACb,EAAI,CAAC,CAAC,sBAAsB;GAGjD,mBAAmB,GAAgB,MAAqB;IACtD,IAAM,IAAc,EAAmB,YAAY,CAAC,CAAC,aAC/C,IAAe,EAAmB,YAAY,CAAC,CAAC,kBAAgC,EAAmB,YAAY,CAAC,CAAC,cAAc,EAAiB,UAAU,CAAC;IACjK,EAAY,aAAa,EAAmB,YAAY,CAAC,CAAC,cAAc,EAAiB,UAAU,GAAG,EAAa,KAAI,MAAK,EAAE,OAAO,IAAS,IAAO,CAAC,CAAC;GACzJ;GACA,iCAAiC;IAC/B,IAAM,EAAE,mBAAgB,aAAU,2BAAwB,EAAI;IAC9D,IAAI,GAAgB,SAAS,EAAoB,SAE3C,CAD6B,EAAoB,MAAK,MAAK,EAAE,IAAI,eAAe,EAAe,IAAI,UAClG,CAAA,EAA0B,SAAS;KAMtC,AAJA,GAAoB,YAAY,CAAC,CAAC,iBAAiB;MACjD,SAAS,CAAC;MACV,UAAU;KACZ,CAAC,GACD,EAAS,IAAI;KACb;IACF;GAEJ;GACA,wBAAwB;IACtB,IAAM,EAAE,8BAA2B,iCAA8B,EAAI;IAGrE,AAFA,EAAkB,iBAAiB,GACnC,EAA0B,GAC1B,EAA0B;GAC5B;GAEA,2BAA2B,GAAwB,MAAqC;IACtF,IAAM,EAAE,YAAS,kBAAe,EAAI;IACpC,IAAI,MAAA,aAA2C;KAC7C,IAAM,IAAkB,EAAQ,MAAK,MAAU,aAAkB,CAAe,GAC5E;KACJ,IAAK,EAAgB,qBAAqB,GAIxC,IAAgB;UAJ2B;MAC3C,IAAM,IAAqB,EAAgB;MAC3C,IAAgB,EAAK,QAAO,MAAK,EAAmB,SAAS,EAAE,EAAE,CAAC;KACpE;KAGA,OAAO;IACT;IACA,IAAI,MAAA,QAAsC;KACxC,IAAM,IAAa,EAAQ,MAAK,MAAU,aAAkB,CAAU;KACtE,EAAW;KACX,IAAM,EAAE,YAAS,EAAI,GACjB;KACJ,IAAK,EAAW,qBAAqB,GAInC,IAAgB;UAJsB;MACtC,IAAM,EAAE,yBAAsB;MAC9B,IAAgB,EAAK,QAAO,MAAK,EAAkB,SAAS,EAAE,EAAE,CAAC;KACnE;KAGA,OAAO;IACT;IACA,MAAU,MAAM,yBAAyB,GAAgB;GAC3D;GACA,iCAAiC;IAC/B,IAAM,EAAE,iBAAc,gCAA6B,EAAI,GAEjD,IAAO,GAAA,GAAA,GAAA,QAAA,CAAkB,CAAwB;IAKvD,EAAI,EAAE,qBAJsB,EAAmB,uBAAuB;KACpE;KACA;IACF,CACM,EAAoB,CAAC;GAC7B;GACA,kBAAkB;IAChB,IAAM,EAAE,YAAS,6BAA0B,oBAAiB,EAAI,GAC1D,IAAoB,EAAoD,EAAyB,IAAI,CAAC,CAAC,mBACvG,IAAuB,EAAQ,MAAK,MAAU,aAAkB,CAAU,CAAC,EAAE,aAC7E,IAAO,IAAuB,EAAS,gBAAgB,GAAc,GAAsB,MAAM,IAAI;IAY3G,AAXI,KACF,EAAI,EACF,eAAe;KACb,GAAG,EAAI,CAAC,CAAC;MACR,EAAkB,IAAI,KAAK;MAC1B,WAAW,EAAS,oBAAoB,CAAI;MAC5C,eAAe,EAAkB,cAAc;KACjD;IACF,EACF,CAAC,GAEH,EAAI,EAAE,QAAK,CAAC;GACd;GACA,kBAAkB,YAAY;IAC5B,IAAM,EAAE,YAAS,uBAAoB,sBAAmB,EAAI,GACtD,IAAa,EAAQ,MAAK,MAAU,aAAkB,CAAU;IACtE,AAAI,EAAW,gBACb,EAAmB,GACnB,MAAM,EAAe,EAAW,IAAI,EAAW,kBAAkB;GAErE;GACA,0BAA0B;IACxB,EAAI,EAAE,eAAe,CAAC,EAAE,CAAC;GAC3B;GAEA,iBAAiB,OAAO,MAA+B;IACrD,IAAM,EAAE,SAAS,MAAgB,EAAI,GAC/B,IAAqC,CAAC;IAC5C,EAAY,SAAQ,MAAU;KAC5B,EAAqB,EAAO,MAAM,EAAO;IAC3C,CAAC;IACD,IAAM,IAAmB,GAAW,cAAc,GAAsB,CAAY,GAC9E,IAAa,EAAY,MAAK,MAAU,aAAkB,CAAU;IAE1E,AAAI,CADmB,EAAW,qBAAqB,EAAqB,EAAW,GAAG,KACrE,CAAC,EAAiB,SAAS,EAAW,EAAE,KAC3D,GAAoB,YAAY,CAAC,CAAC,iBAAiB;KACjD,SAAS,CAAC;KACV,UAAU;IACZ,CAAC,GACD,MAAM,EAAkB,gBAAgB;KACtC,GAAG;MACF,EAAW,KAAK,EAAW;IAC9B,CAAC,KAED,MAAM,EAAkB,gBAAgB,CAAY;GAExD;GACA,4BAA4B,OAAO,MAAsD;IACvF,IAAM,EAAE,YAAS,mBAAgB,gBAAa,EAAI,GAC5C,IAA6B,CAAC;IACpC,EAAQ,SAAQ,MAAU;KACxB,EAAa,EAAO,MAAM,EAAO;IACnC,CAAC;IACD,IAAM,IAAa,EAAQ,MAAK,MAAU,aAAkB,CAAU;IActE,AAbuB,EAAW,qBAAqB,EAAa,EAAW,GAAG,MAEhF,GAAoB,YAAY,CAAC,CAAC,iBAAiB;KACjD,SAAS,CAAC;KACV,UAAU;IACZ,CAAC,GACD,MAAM,EAAkB,gBAAgB;KACtC,GAAG;MACF,EAAW,KAAK,EAAW;IAC9B,CAAC,IAEH,EAAI,EAAE,2BAAwB,CAAC,GAC/B,MAAM,EAAI,CAAC,CAAC,UAAU,GAClB,GAAgB,SAAS,EAAoB,iBAC/C,EAAS,EAAoB,aAAa;GAE9C;GACA,mCAAmC,MAA0C;IAC3E,EAAI,EAAE,iCAA8B,CAAC;GACvC;GAEA,8BAA8B,MAA6C;IACzE,IAAM,EAAE,WAAQ,sBAAmB,qBAAkB,kBAAe,EAAI;IAEpE,UAAW,EAAiB,aAIhC;SAAI,EAAiB,eAAe,EAAiB,YAAY,KAAK,CAAC,CAAC,SAAS,KAAK,EAAiB,gBAAgB,OAAO;MAE5H,IAAM,IAAa,GAAW,MAAM,EAAiB,WAAW,GAC1D,IAAgB,EAAS,aAAa,GAAY,EAAiB,2BAA2B,EAAiB,YAAY,CAAC,yBAAyB,GAGrJ,IAAY,GAAW,eAAe,CAAa;MAEzD,EAAI;OACF,QAAQ,EAAiB;OACzB;OACA,MAAM;OACN,cAAc;MAChB,CAAC;KACH,OACE,EAAI;MACF,QAAQ,EAAiB;MACzB,WAAW,CAAC;MACZ,MAAM;MACN,cAAc;KAChB,CAAC;KAKH,AAFA,EAAW,GACX,EAAiB,GACjB,EAAkB;IALf;GAML;GACA,iBAAiB,MAA0B;IACzC,EAAkB,eAAe,CAAW;IAE5C,IAAM,EAAE,mBAAgB,gBAAa,EAAI;IAGzC,AAAI,EAAY,WAAW,CAAC,KAAkB,GAAgB,SAAS,EAAoB,aACzF,EAAS,EAAoB,SAAS,IAC7B,GAAgB,SAAS,EAAoB,aAAa,CAAC,EAAY,UAChF,EAAS,IAAI;GAEjB;GAEA,WAAW,GAA2B,MAAoB;IACxD,IAAM,EAAE,4BAAyB,gBAAa,kBAAe,EAAI;IACjE,EAAI,EACF,gBAAgB,EAAmB,kBAAkB;KACnD;KACA;KACA;KACA;KACA,gBAAgB,GAAyB,SAAS,MAAW,EAAO,cAAc,KAAK,CAAC;KACxF;IACF,CAAC,EACH,CAAC;GACH;GACA,mBAAmB,YAAY;IAC7B,IAAM,EAAE,YAAS,uBAAoB,mBAAgB,oBAAiB,EAAI;IAC1E,EAAmB;IACnB,IAAM,IAAa,EAAQ,MAAK,MAAU,aAAkB,CAAU,GAChE,IAAuB,EAAS,gBAAgB,GAAc,GAAY,aAAa,QAAQ,CAAC,CAAC;IACvG,MAAM,EAAe,EAAW,IAAI,MAAyB,EAAa,OAAO,OAAO,CAAoB;GAC9G;GACA,mBAAiD,GAAoB,MAAuB;IAC1F,EAAI,EAAE,YAAY,EAAQ,EAAI,CAAC,CAAC,aAAa,OAAW;KAAE,GAAG;MAAQ,IAAa;MAAE,GAAG,EAAM;MAAqC,GAAG;KAAK;IAAE,EAAE,EAAE,CAAC;GACnJ;GACA,8BAA4D,GAAoB,MAAuB;IACrG,EAAI,EAAE,uBAAuB,EAAQ,EAAI,CAAC,CAAC,wBAAwB,OAAW;KAAE,GAAG;MAAQ,IAAa;MAAE,GAAG,EAAM;MAAqC,GAAG;KAAK;IAAE,EAAE,EAAE,CAAC;GACzK;EACF;CACF,GACA,GAAyF,EAAO,oBAAoB,EAAO,iBAAiB,OACnI;EACL,+BAA+B,EAAM;EACrC,uBAAuB,EAAM;CAC/B,EACD,CACH,CACF;CAEA,OADA,EAAe,SAAS,CAAC,CAAC,WAAW,EAAW,cAAc,CAAgB,GAAG,EAAW,uBAAuB,CAAgB,GAAG,CAAC,GAAwB,CAAiB,CAAC,GAC1K;AACT,GCpfa,KAAwB,GAAwC,IAAI"}

package/dist/_chunks/eachYearOfInterval.js

@@ -0,0 +1,104 @@
+import { n as e, t } from "./toDate.js";
+import { a as n, r } from "./format.js";
+//#region ../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/addMonths.js
+function i(n, r, i) {
+	let a = t(n, i?.in);
+	if (isNaN(r)) return e(i?.in || n, NaN);
+	if (!r) return a;
+	let o = a.getDate(), s = e(i?.in || n, a.getTime());
+	return s.setMonth(a.getMonth() + r + 1, 0), o >= s.getDate() ? s : (a.setFullYear(s.getFullYear(), s.getMonth(), o), a);
+}
+//#endregion
+//#region ../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/addQuarters.js
+function a(e, t, n) {
+	return i(e, t * 3, n);
+}
+//#endregion
+//#region ../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/differenceInDays.js
+function o(e, t, i) {
+	let [a, o] = n(i?.in, e, t), c = s(a, o), l = Math.abs(r(a, o));
+	a.setDate(a.getDate() - c * l);
+	let u = c * (l - Number(s(a, o) === -c));
+	return u === 0 ? 0 : u;
+}
+function s(e, t) {
+	let n = e.getFullYear() - t.getFullYear() || e.getMonth() - t.getMonth() || e.getDate() - t.getDate() || e.getHours() - t.getHours() || e.getMinutes() - t.getMinutes() || e.getSeconds() - t.getSeconds() || e.getMilliseconds() - t.getMilliseconds();
+	return n < 0 ? -1 : n > 0 ? 1 : n;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/endOfDay.js
+function c(e, n) {
+	let r = t(e, n?.in);
+	return r.setHours(23, 59, 59, 999), r;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/endOfMonth.js
+function l(e, n) {
+	let r = t(e, n?.in), i = r.getMonth();
+	return r.setFullYear(r.getFullYear(), i + 1, 0), r.setHours(23, 59, 59, 999), r;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/_lib/normalizeInterval.js
+function u(e, t) {
+	let [r, i] = n(e, t.start, t.end);
+	return {
+		start: r,
+		end: i
+	};
+}
+//#endregion
+//#region ../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/eachDayOfInterval.js
+function d(t, n) {
+	let { start: r, end: i } = u(n?.in, t), a = +r > +i, o = a ? +r : +i, s = a ? i : r;
+	s.setHours(0, 0, 0, 0);
+	let c = n?.step ?? 1;
+	if (!c) return [];
+	c < 0 && (c = -c, a = !a);
+	let l = [];
+	for (; +s <= o;) l.push(e(r, s)), s.setDate(s.getDate() + c), s.setHours(0, 0, 0, 0);
+	return a ? l.reverse() : l;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/eachMonthOfInterval.js
+function f(t, n) {
+	let { start: r, end: i } = u(n?.in, t), a = +r > +i, o = a ? +r : +i, s = a ? i : r;
+	s.setHours(0, 0, 0, 0), s.setDate(1);
+	let c = n?.step ?? 1;
+	if (!c) return [];
+	c < 0 && (c = -c, a = !a);
+	let l = [];
+	for (; +s <= o;) l.push(e(r, s)), s.setMonth(s.getMonth() + c);
+	return a ? l.reverse() : l;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/startOfQuarter.js
+function p(e, n) {
+	let r = t(e, n?.in), i = r.getMonth(), a = i - i % 3;
+	return r.setMonth(a, 1), r.setHours(0, 0, 0, 0), r;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/eachQuarterOfInterval.js
+function m(t, n) {
+	let { start: r, end: i } = u(n?.in, t), o = +r > +i, s = o ? +p(r) : +p(i), c = p(o ? i : r), l = n?.step ?? 1;
+	if (!l) return [];
+	l < 0 && (l = -l, o = !o);
+	let d = [];
+	for (; +c <= s;) d.push(e(r, c)), c = a(c, l);
+	return o ? d.reverse() : d;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/eachYearOfInterval.js
+function h(t, n) {
+	let { start: r, end: i } = u(n?.in, t), a = +r > +i, o = a ? +r : +i, s = a ? i : r;
+	s.setHours(0, 0, 0, 0), s.setMonth(0, 1);
+	let c = n?.step ?? 1;
+	if (!c) return [];
+	c < 0 && (c = -c, a = !a);
+	let l = [];
+	for (; +s <= o;) l.push(e(r, s)), s.setFullYear(s.getFullYear() + c);
+	return a ? l.reverse() : l;
+}
+//#endregion
+export { d as a, c, f as i, o as l, m as n, u as o, p as r, l as s, h as t, i as u };
+
+//# sourceMappingURL=eachYearOfInterval.js.map

package/dist/_chunks/eachYearOfInterval.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"eachYearOfInterval.js","names":[],"sources":["../../../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/addMonths.js","../../../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/addQuarters.js","../../../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/differenceInDays.js","../../../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/endOfDay.js","../../../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/endOfMonth.js","../../../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/_lib/normalizeInterval.js","../../../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/eachDayOfInterval.js","../../../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/eachMonthOfInterval.js","../../../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/startOfQuarter.js","../../../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/eachQuarterOfInterval.js","../../../../node_modules/.pnpm/date-fns@4.4.0/node_modules/date-fns/eachYearOfInterval.js"],"sourcesContent":["import { constructFrom } from \"./constructFrom.js\";\nimport { toDate } from \"./toDate.js\";\n\n/**\n * The {@link addMonths} function options.\n */\n\n/**\n * @name addMonths\n * @category Month Helpers\n * @summary Add the specified number of months to the given date.\n *\n * @description\n * Add the specified number of months to the given date.\n *\n * @typeParam DateType - The `Date` type, the function operates on. Gets inferred from passed arguments. Allows to use extensions like [`UTCDate`](https://github.com/date-fns/utc).\n * @typeParam ResultDate - The result `Date` type, it is the type returned from the context function if it is passed, or inferred from the arguments.\n *\n * @param date - The date to be changed\n * @param amount - The amount of months to be added.\n * @param options - The options object\n *\n * @returns The new date with the months added\n *\n * @example\n * // Add 5 months to 1 September 2014:\n * const result = addMonths(new Date(2014, 8, 1), 5)\n * //=> Sun Feb 01 2015 00:00:00\n *\n * // Add one month to 30 January 2023:\n * const result = addMonths(new Date(2023, 0, 30), 1)\n * //=> Tue Feb 28 2023 00:00:00\n */\nexport function addMonths(date, amount, options) {\n  const _date = toDate(date, options?.in);\n  if (isNaN(amount)) return constructFrom(options?.in || date, NaN);\n  if (!amount) {\n    // If 0 months, no-op to avoid changing times in the hour before end of DST\n    return _date;\n  }\n  const dayOfMonth = _date.getDate();\n\n  // The JS Date object supports date math by accepting out-of-bounds values for\n  // month, day, etc. For example, new Date(2020, 0, 0) returns 31 Dec 2019 and\n  // new Date(2020, 13, 1) returns 1 Feb 2021.  This is *almost* the behavior we\n  // want except that dates will wrap around the end of a month, meaning that\n  // new Date(2020, 13, 31) will return 3 Mar 2021 not 28 Feb 2021 as desired. So\n  // we'll default to the end of the desired month by adding 1 to the desired\n  // month and using a date of 0 to back up one day to the end of the desired\n  // month.\n  const endOfDesiredMonth = constructFrom(options?.in || date, _date.getTime());\n  endOfDesiredMonth.setMonth(_date.getMonth() + amount + 1, 0);\n  const daysInMonth = endOfDesiredMonth.getDate();\n  if (dayOfMonth >= daysInMonth) {\n    // If we're already at the end of the month, then this is the correct date\n    // and we're done.\n    return endOfDesiredMonth;\n  } else {\n    // Otherwise, we now know that setting the original day-of-month value won't\n    // cause an overflow, so set the desired day-of-month. Note that we can't\n    // just set the date of `endOfDesiredMonth` because that object may have had\n    // its time changed in the unusual case where where a DST transition was on\n    // the last day of the month and its local time was in the hour skipped or\n    // repeated next to a DST transition.  So we use `date` instead which is\n    // guaranteed to still have the original time.\n    _date.setFullYear(\n      endOfDesiredMonth.getFullYear(),\n      endOfDesiredMonth.getMonth(),\n      dayOfMonth,\n    );\n    return _date;\n  }\n}\n\n// Fallback for modularized imports:\nexport default addMonths;\n","import { addMonths } from \"./addMonths.js\";\n\n/**\n * The {@link addQuarters} function options.\n */\n\n/**\n * @name addQuarters\n * @category Quarter Helpers\n * @summary Add the specified number of year quarters to the given date.\n *\n * @description\n * Add the specified number of year quarters to the given date.\n *\n * @typeParam DateType - The `Date` type, the function operates on. Gets inferred from passed arguments. Allows to use extensions like [`UTCDate`](https://github.com/date-fns/utc).\n * @typeParam ResultDate - The result `Date` type, it is the type returned from the context function if it is passed, or inferred from the arguments.\n *\n * @param date - The date to be changed\n * @param amount - The amount of quarters to be added.\n * @param options - An object with options\n *\n * @returns The new date with the quarters added\n *\n * @example\n * // Add 1 quarter to 1 September 2014:\n * const result = addQuarters(new Date(2014, 8, 1), 1)\n * //=; Mon Dec 01 2014 00:00:00\n */\nexport function addQuarters(date, amount, options) {\n  return addMonths(date, amount * 3, options);\n}\n\n// Fallback for modularized imports:\nexport default addQuarters;\n","import { normalizeDates } from \"./_lib/normalizeDates.js\";\nimport { differenceInCalendarDays } from \"./differenceInCalendarDays.js\";\n\n/**\n * The {@link differenceInDays} function options.\n */\n\n/**\n * @name differenceInDays\n * @category Day Helpers\n * @summary Get the number of full days between the given dates.\n *\n * @description\n * Get the number of full day periods between two dates. Fractional days are\n * truncated towards zero.\n *\n * One \"full day\" is the distance between a local time in one day to the same\n * local time on the next or previous day. A full day can sometimes be less than\n * or more than 24 hours if a daylight savings change happens between two dates.\n *\n * To ignore DST and only measure exact 24-hour periods, use this instead:\n * `Math.trunc(differenceInHours(dateLeft, dateRight)/24)|0`.\n *\n * @param laterDate - The later date\n * @param earlierDate - The earlier date\n * @param options - An object with options\n *\n * @returns The number of full days according to the local timezone\n *\n * @example\n * // How many full days are between\n * // 2 July 2011 23:00:00 and 2 July 2012 00:00:00?\n * const result = differenceInDays(\n *   new Date(2012, 6, 2, 0, 0),\n *   new Date(2011, 6, 2, 23, 0)\n * )\n * //=> 365\n *\n * @example\n * // How many full days are between\n * // 2 July 2011 23:59:00 and 3 July 2011 00:01:00?\n * const result = differenceInDays(\n *   new Date(2011, 6, 3, 0, 1),\n *   new Date(2011, 6, 2, 23, 59)\n * )\n * //=> 0\n *\n * @example\n * // How many full days are between\n * // 1 March 2020 0:00 and 1 June 2020 0:00 ?\n * // Note: because local time is used, the\n * // result will always be 92 days, even in\n * // time zones where DST starts and the\n * // period has only 92*24-1 hours.\n * const result = differenceInDays(\n *   new Date(2020, 5, 1),\n *   new Date(2020, 2, 1)\n * )\n * //=> 92\n */\nexport function differenceInDays(laterDate, earlierDate, options) {\n  const [laterDate_, earlierDate_] = normalizeDates(\n    options?.in,\n    laterDate,\n    earlierDate,\n  );\n\n  const sign = compareLocalAsc(laterDate_, earlierDate_);\n  const difference = Math.abs(\n    differenceInCalendarDays(laterDate_, earlierDate_),\n  );\n\n  laterDate_.setDate(laterDate_.getDate() - sign * difference);\n\n  // Math.abs(diff in full days - diff in calendar days) === 1 if last calendar day is not full\n  // If so, result must be decreased by 1 in absolute value\n  const isLastDayNotFull = Number(\n    compareLocalAsc(laterDate_, earlierDate_) === -sign,\n  );\n\n  const result = sign * (difference - isLastDayNotFull);\n  // Prevent negative zero\n  return result === 0 ? 0 : result;\n}\n\n// Like `compareAsc` but uses local time not UTC, which is needed\n// for accurate equality comparisons of UTC timestamps that end up\n// having the same representation in local time, e.g. one hour before\n// DST ends vs. the instant that DST ends.\nfunction compareLocalAsc(laterDate, earlierDate) {\n  const diff =\n    laterDate.getFullYear() - earlierDate.getFullYear() ||\n    laterDate.getMonth() - earlierDate.getMonth() ||\n    laterDate.getDate() - earlierDate.getDate() ||\n    laterDate.getHours() - earlierDate.getHours() ||\n    laterDate.getMinutes() - earlierDate.getMinutes() ||\n    laterDate.getSeconds() - earlierDate.getSeconds() ||\n    laterDate.getMilliseconds() - earlierDate.getMilliseconds();\n\n  if (diff < 0) return -1;\n  if (diff > 0) return 1;\n\n  // Return 0 if diff is 0; return NaN if diff is NaN\n  return diff;\n}\n\n// Fallback for modularized imports:\nexport default differenceInDays;\n","import { toDate } from \"./toDate.js\";\n\n/**\n * The {@link endOfDay} function options.\n */\n\n/**\n * @name endOfDay\n * @category Day Helpers\n * @summary Return the end of a day for the given date.\n *\n * @description\n * Return the end of a day for the given date.\n * The result will be in the local timezone.\n *\n * @typeParam DateType - The `Date` type, the function operates on. Gets inferred from passed arguments. Allows to use extensions like [`UTCDate`](https://github.com/date-fns/utc).\n * @typeParam ResultDate - The result `Date` type, it is the type returned from the context function if it is passed, or inferred from the arguments.\n *\n * @param date - The original date\n * @param options - An object with options\n *\n * @returns The end of a day\n *\n * @example\n * // The end of a day for 2 September 2014 11:55:00:\n * const result = endOfDay(new Date(2014, 8, 2, 11, 55, 0))\n * //=> Tue Sep 02 2014 23:59:59.999\n */\nexport function endOfDay(date, options) {\n  const _date = toDate(date, options?.in);\n  _date.setHours(23, 59, 59, 999);\n  return _date;\n}\n\n// Fallback for modularized imports:\nexport default endOfDay;\n","import { toDate } from \"./toDate.js\";\n\n/**\n * The {@link endOfMonth} function options.\n */\n\n/**\n * @name endOfMonth\n * @category Month Helpers\n * @summary Return the end of a month for the given date.\n *\n * @description\n * Return the end of a month for the given date.\n * The result will be in the local timezone.\n *\n * @typeParam DateType - The `Date` type, the function operates on. Gets inferred from passed arguments. Allows to use extensions like [`UTCDate`](https://github.com/date-fns/utc).\n * @typeParam ResultDate - The result `Date` type, it is the type returned from the context function if it is passed, or inferred from the arguments.\n *\n * @param date - The original date\n * @param options - An object with options\n *\n * @returns The end of a month\n *\n * @example\n * // The end of a month for 2 September 2014 11:55:00:\n * const result = endOfMonth(new Date(2014, 8, 2, 11, 55, 0))\n * //=> Tue Sep 30 2014 23:59:59.999\n */\nexport function endOfMonth(date, options) {\n  const _date = toDate(date, options?.in);\n  const month = _date.getMonth();\n  _date.setFullYear(_date.getFullYear(), month + 1, 0);\n  _date.setHours(23, 59, 59, 999);\n  return _date;\n}\n\n// Fallback for modularized imports:\nexport default endOfMonth;\n","import { normalizeDates } from \"./normalizeDates.js\";\n\nexport function normalizeInterval(context, interval) {\n  const [start, end] = normalizeDates(context, interval.start, interval.end);\n  return { start, end };\n}\n","import { normalizeInterval } from \"./_lib/normalizeInterval.js\";\nimport { constructFrom } from \"./constructFrom.js\";\n\n/**\n * The {@link eachDayOfInterval} function options.\n */\n\n/**\n * The {@link eachDayOfInterval} function result type. It resolves the proper data type.\n * It uses the first argument date object type, starting from the date argument,\n * then the start interval date, and finally the end interval date. If\n * a context function is passed, it uses the context function return type.\n */\n\n/**\n * @name eachDayOfInterval\n * @category Interval Helpers\n * @summary Return the array of dates within the specified time interval.\n *\n * @description\n * Return the array of dates within the specified time interval.\n *\n * @typeParam IntervalType - Interval type.\n * @typeParam Options - Options type.\n *\n * @param interval - The interval.\n * @param options - An object with options.\n *\n * @returns The array with starts of days from the day of the interval start to the day of the interval end\n *\n * @example\n * // Each day between 6 October 2014 and 10 October 2014:\n * const result = eachDayOfInterval({\n *   start: new Date(2014, 9, 6),\n *   end: new Date(2014, 9, 10)\n * })\n * //=> [\n * //   Mon Oct 06 2014 00:00:00,\n * //   Tue Oct 07 2014 00:00:00,\n * //   Wed Oct 08 2014 00:00:00,\n * //   Thu Oct 09 2014 00:00:00,\n * //   Fri Oct 10 2014 00:00:00\n * // ]\n */\nexport function eachDayOfInterval(interval, options) {\n  const { start, end } = normalizeInterval(options?.in, interval);\n\n  let reversed = +start > +end;\n  const endTime = reversed ? +start : +end;\n  const date = reversed ? end : start;\n  date.setHours(0, 0, 0, 0);\n\n  let step = options?.step ?? 1;\n  if (!step) return [];\n  if (step < 0) {\n    step = -step;\n    reversed = !reversed;\n  }\n\n  const dates = [];\n\n  while (+date <= endTime) {\n    dates.push(constructFrom(start, date));\n    date.setDate(date.getDate() + step);\n    date.setHours(0, 0, 0, 0);\n  }\n\n  return reversed ? dates.reverse() : dates;\n}\n\n// Fallback for modularized imports:\nexport default eachDayOfInterval;\n","import { normalizeInterval } from \"./_lib/normalizeInterval.js\";\nimport { constructFrom } from \"./constructFrom.js\";\n\n/**\n * The {@link eachMonthOfInterval} function options.\n */\n\n/**\n * The {@link eachMonthOfInterval} function result type. It resolves the proper data type.\n */\n\n/**\n * @name eachMonthOfInterval\n * @category Interval Helpers\n * @summary Return the array of months within the specified time interval.\n *\n * @description\n * Return the array of months within the specified time interval.\n *\n * @typeParam IntervalType - Interval type.\n * @typeParam Options - Options type.\n *\n * @param interval - The interval.\n * @param options - An object with options.\n *\n * @returns The array with starts of months from the month of the interval start to the month of the interval end\n *\n * @example\n * // Each month between 6 February 2014 and 10 August 2014:\n * const result = eachMonthOfInterval({\n *   start: new Date(2014, 1, 6),\n *   end: new Date(2014, 7, 10)\n * })\n * //=> [\n * //   Sat Feb 01 2014 00:00:00,\n * //   Sat Mar 01 2014 00:00:00,\n * //   Tue Apr 01 2014 00:00:00,\n * //   Thu May 01 2014 00:00:00,\n * //   Sun Jun 01 2014 00:00:00,\n * //   Tue Jul 01 2014 00:00:00,\n * //   Fri Aug 01 2014 00:00:00\n * // ]\n */\nexport function eachMonthOfInterval(interval, options) {\n  const { start, end } = normalizeInterval(options?.in, interval);\n\n  let reversed = +start > +end;\n  const endTime = reversed ? +start : +end;\n  const date = reversed ? end : start;\n  date.setHours(0, 0, 0, 0);\n  date.setDate(1);\n\n  let step = options?.step ?? 1;\n  if (!step) return [];\n  if (step < 0) {\n    step = -step;\n    reversed = !reversed;\n  }\n\n  const dates = [];\n\n  while (+date <= endTime) {\n    dates.push(constructFrom(start, date));\n    date.setMonth(date.getMonth() + step);\n  }\n\n  return reversed ? dates.reverse() : dates;\n}\n\n// Fallback for modularized imports:\nexport default eachMonthOfInterval;\n","import { toDate } from \"./toDate.js\";\n\n/**\n * The {@link startOfQuarter} function options.\n */\n\n/**\n * @name startOfQuarter\n * @category Quarter Helpers\n * @summary Return the start of a year quarter for the given date.\n *\n * @description\n * Return the start of a year quarter for the given date.\n * The result will be in the local timezone.\n *\n * @typeParam DateType - The `Date` type, the function operates on. Gets inferred from passed arguments. Allows to use extensions like [`UTCDate`](https://github.com/date-fns/utc).\n * @typeParam ResultDate - The result `Date` type, it is the type returned from the context function if it is passed, or inferred from the arguments.\n *\n * @param date - The original date\n * @param options - The options\n *\n * @returns The start of a quarter\n *\n * @example\n * // The start of a quarter for 2 September 2014 11:55:00:\n * const result = startOfQuarter(new Date(2014, 8, 2, 11, 55, 0))\n * //=> Tue Jul 01 2014 00:00:00\n */\nexport function startOfQuarter(date, options) {\n  const _date = toDate(date, options?.in);\n  const currentMonth = _date.getMonth();\n  const month = currentMonth - (currentMonth % 3);\n  _date.setMonth(month, 1);\n  _date.setHours(0, 0, 0, 0);\n  return _date;\n}\n\n// Fallback for modularized imports:\nexport default startOfQuarter;\n","import { normalizeInterval } from \"./_lib/normalizeInterval.js\";\nimport { addQuarters } from \"./addQuarters.js\";\nimport { constructFrom } from \"./constructFrom.js\";\nimport { startOfQuarter } from \"./startOfQuarter.js\";\n\n/**\n * The {@link eachQuarterOfInterval} function options.\n */\n\n/**\n * The {@link eachQuarterOfInterval} function result type. It resolves the proper data type.\n * It uses the first argument date object type, starting from the date argument,\n * then the start interval date, and finally the end interval date. If\n * a context function is passed, it uses the context function return type.\n */\n\n/**\n * @name eachQuarterOfInterval\n * @category Interval Helpers\n * @summary Return the array of quarters within the specified time interval.\n *\n * @description\n * Return the array of quarters within the specified time interval.\n *\n * @typeParam IntervalType - Interval type.\n * @typeParam Options - Options type.\n *\n * @param interval - The interval\n * @param options - An object with options\n *\n * @returns The array with starts of quarters from the quarter of the interval start to the quarter of the interval end\n *\n * @example\n * // Each quarter within interval 6 February 2014 - 10 August 2014:\n * const result = eachQuarterOfInterval({\n *   start: new Date(2014, 1, 6),\n *   end: new Date(2014, 7, 10),\n * })\n * //=> [\n * //   Wed Jan 01 2014 00:00:00,\n * //   Tue Apr 01 2014 00:00:00,\n * //   Tue Jul 01 2014 00:00:00,\n * // ]\n */\nexport function eachQuarterOfInterval(interval, options) {\n  const { start, end } = normalizeInterval(options?.in, interval);\n\n  let reversed = +start > +end;\n  const endTime = reversed ? +startOfQuarter(start) : +startOfQuarter(end);\n  let date = reversed ? startOfQuarter(end) : startOfQuarter(start);\n\n  let step = options?.step ?? 1;\n  if (!step) return [];\n  if (step < 0) {\n    step = -step;\n    reversed = !reversed;\n  }\n\n  const dates = [];\n\n  while (+date <= endTime) {\n    dates.push(constructFrom(start, date));\n    date = addQuarters(date, step);\n  }\n\n  return reversed ? dates.reverse() : dates;\n}\n\n// Fallback for modularized imports:\nexport default eachQuarterOfInterval;\n","import { normalizeInterval } from \"./_lib/normalizeInterval.js\";\nimport { constructFrom } from \"./constructFrom.js\";\n\n/**\n * The {@link eachYearOfInterval} function options.\n */\n\n/**\n * The {@link eachYearOfInterval} function result type. It resolves the proper data type.\n * It uses the first argument date object type, starting from the date argument,\n * then the start interval date, and finally the end interval date. If\n * a context function is passed, it uses the context function return type.\n */\n\n/**\n * @name eachYearOfInterval\n * @category Interval Helpers\n * @summary Return the array of yearly timestamps within the specified time interval.\n *\n * @description\n * Return the array of yearly timestamps within the specified time interval.\n *\n * @typeParam IntervalType - Interval type.\n * @typeParam Options - Options type.\n *\n * @param interval - The interval.\n * @param options - An object with options.\n *\n * @returns The array with starts of yearly timestamps from the month of the interval start to the month of the interval end\n *\n * @example\n * // Each year between 6 February 2014 and 10 August 2017:\n * const result = eachYearOfInterval({\n *   start: new Date(2014, 1, 6),\n *   end: new Date(2017, 7, 10)\n * })\n * //=> [\n * //   Wed Jan 01 2014 00:00:00,\n * //   Thu Jan 01 2015 00:00:00,\n * //   Fri Jan 01 2016 00:00:00,\n * //   Sun Jan 01 2017 00:00:00\n * // ]\n */\nexport function eachYearOfInterval(interval, options) {\n  const { start, end } = normalizeInterval(options?.in, interval);\n\n  let reversed = +start > +end;\n  const endTime = reversed ? +start : +end;\n  const date = reversed ? end : start;\n  date.setHours(0, 0, 0, 0);\n  date.setMonth(0, 1);\n\n  let step = options?.step ?? 1;\n  if (!step) return [];\n  if (step < 0) {\n    step = -step;\n    reversed = !reversed;\n  }\n\n  const dates = [];\n\n  while (+date <= endTime) {\n    dates.push(constructFrom(start, date));\n    date.setFullYear(date.getFullYear() + step);\n  }\n\n  return reversed ? dates.reverse() : dates;\n}\n\n// Fallback for modularized imports:\nexport default eachYearOfInterval;\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10],"mappings":";;;AAiCA,SAAgB,EAAU,GAAM,GAAQ,GAAS;CAC/C,IAAM,IAAQ,EAAO,GAAM,GAAS,EAAE;CACtC,IAAI,MAAM,CAAM,GAAG,OAAO,EAAc,GAAS,MAAM,GAAM,GAAG;CAChE,IAAI,CAAC,GAEH,OAAO;CAET,IAAM,IAAa,EAAM,QAAQ,GAU3B,IAAoB,EAAc,GAAS,MAAM,GAAM,EAAM,QAAQ,CAAC;CAoB1E,OAnBF,EAAkB,SAAS,EAAM,SAAS,IAAI,IAAS,GAAG,CAAC,GAEvD,KADgB,EAAkB,QACV,IAGnB,KASP,EAAM,YACJ,EAAkB,YAAY,GAC9B,EAAkB,SAAS,GAC3B,CACF,GACO;AAEX;;;AC5CA,SAAgB,EAAY,GAAM,GAAQ,GAAS;CACjD,OAAO,EAAU,GAAM,IAAS,GAAG,CAAO;AAC5C;;;AC8BA,SAAgB,EAAiB,GAAW,GAAa,GAAS;CAChE,IAAM,CAAC,GAAY,KAAgB,EACjC,GAAS,IACT,GACA,CACF,GAEM,IAAO,EAAgB,GAAY,CAAY,GAC/C,IAAa,KAAK,IACtB,EAAyB,GAAY,CAAY,CACnD;CAEA,EAAW,QAAQ,EAAW,QAAQ,IAAI,IAAO,CAAU;CAQ3D,IAAM,IAAS,KAAQ,IAJE,OACvB,EAAgB,GAAY,CAAY,MAAM,CAAC,CAGE;CAEnD,OAAO,MAAW,IAAI,IAAI;AAC5B;AAMA,SAAS,EAAgB,GAAW,GAAa;CAC/C,IAAM,IACJ,EAAU,YAAY,IAAI,EAAY,YAAY,KAClD,EAAU,SAAS,IAAI,EAAY,SAAS,KAC5C,EAAU,QAAQ,IAAI,EAAY,QAAQ,KAC1C,EAAU,SAAS,IAAI,EAAY,SAAS,KAC5C,EAAU,WAAW,IAAI,EAAY,WAAW,KAChD,EAAU,WAAW,IAAI,EAAY,WAAW,KAChD,EAAU,gBAAgB,IAAI,EAAY,gBAAgB;CAM5D,OAJI,IAAO,IAAU,KACjB,IAAO,IAAU,IAGd;AACT;;;AC5EA,SAAgB,EAAS,GAAM,GAAS;CACtC,IAAM,IAAQ,EAAO,GAAM,GAAS,EAAE;CAEtC,OADA,EAAM,SAAS,IAAI,IAAI,IAAI,GAAG,GACvB;AACT;;;ACJA,SAAgB,EAAW,GAAM,GAAS;CACxC,IAAM,IAAQ,EAAO,GAAM,GAAS,EAAE,GAChC,IAAQ,EAAM,SAAS;CAG7B,OAFA,EAAM,YAAY,EAAM,YAAY,GAAG,IAAQ,GAAG,CAAC,GACnD,EAAM,SAAS,IAAI,IAAI,IAAI,GAAG,GACvB;AACT;;;AChCA,SAAgB,EAAkB,GAAS,GAAU;CACnD,IAAM,CAAC,GAAO,KAAO,EAAe,GAAS,EAAS,OAAO,EAAS,GAAG;CACzE,OAAO;EAAE;EAAO;CAAI;AACtB;;;ACuCA,SAAgB,EAAkB,GAAU,GAAS;CACnD,IAAM,EAAE,UAAO,WAAQ,EAAkB,GAAS,IAAI,CAAQ,GAE1D,IAAW,CAAC,IAAQ,CAAC,GACnB,IAAU,IAAW,CAAC,IAAQ,CAAC,GAC/B,IAAO,IAAW,IAAM;CAC9B,EAAK,SAAS,GAAG,GAAG,GAAG,CAAC;CAExB,IAAI,IAAO,GAAS,QAAQ;CAC5B,IAAI,CAAC,GAAM,OAAO,CAAC;CACnB,AAAI,IAAO,MACT,IAAO,CAAC,GACR,IAAW,CAAC;CAGd,IAAM,IAAQ,CAAC;CAEf,OAAO,CAAC,KAAQ,IAGd,AAFA,EAAM,KAAK,EAAc,GAAO,CAAI,CAAC,GACrC,EAAK,QAAQ,EAAK,QAAQ,IAAI,CAAI,GAClC,EAAK,SAAS,GAAG,GAAG,GAAG,CAAC;CAG1B,OAAO,IAAW,EAAM,QAAQ,IAAI;AACtC;;;ACzBA,SAAgB,EAAoB,GAAU,GAAS;CACrD,IAAM,EAAE,UAAO,WAAQ,EAAkB,GAAS,IAAI,CAAQ,GAE1D,IAAW,CAAC,IAAQ,CAAC,GACnB,IAAU,IAAW,CAAC,IAAQ,CAAC,GAC/B,IAAO,IAAW,IAAM;CAE9B,AADA,EAAK,SAAS,GAAG,GAAG,GAAG,CAAC,GACxB,EAAK,QAAQ,CAAC;CAEd,IAAI,IAAO,GAAS,QAAQ;CAC5B,IAAI,CAAC,GAAM,OAAO,CAAC;CACnB,AAAI,IAAO,MACT,IAAO,CAAC,GACR,IAAW,CAAC;CAGd,IAAM,IAAQ,CAAC;CAEf,OAAO,CAAC,KAAQ,IAEd,AADA,EAAM,KAAK,EAAc,GAAO,CAAI,CAAC,GACrC,EAAK,SAAS,EAAK,SAAS,IAAI,CAAI;CAGtC,OAAO,IAAW,EAAM,QAAQ,IAAI;AACtC;;;ACvCA,SAAgB,EAAe,GAAM,GAAS;CAC5C,IAAM,IAAQ,EAAO,GAAM,GAAS,EAAE,GAChC,IAAe,EAAM,SAAS,GAC9B,IAAQ,IAAgB,IAAe;CAG7C,OAFA,EAAM,SAAS,GAAO,CAAC,GACvB,EAAM,SAAS,GAAG,GAAG,GAAG,CAAC,GAClB;AACT;;;ACSA,SAAgB,EAAsB,GAAU,GAAS;CACvD,IAAM,EAAE,UAAO,WAAQ,EAAkB,GAAS,IAAI,CAAQ,GAE1D,IAAW,CAAC,IAAQ,CAAC,GACnB,IAAU,IAAW,CAAC,EAAe,CAAK,IAAI,CAAC,EAAe,CAAG,GACnE,IAAkB,EAAX,IAA0B,IAAsB,CAAK,GAE5D,IAAO,GAAS,QAAQ;CAC5B,IAAI,CAAC,GAAM,OAAO,CAAC;CACnB,AAAI,IAAO,MACT,IAAO,CAAC,GACR,IAAW,CAAC;CAGd,IAAM,IAAQ,CAAC;CAEf,OAAO,CAAC,KAAQ,IAEd,AADA,EAAM,KAAK,EAAc,GAAO,CAAI,CAAC,GACrC,IAAO,EAAY,GAAM,CAAI;CAG/B,OAAO,IAAW,EAAM,QAAQ,IAAI;AACtC;;;ACvBA,SAAgB,EAAmB,GAAU,GAAS;CACpD,IAAM,EAAE,UAAO,WAAQ,EAAkB,GAAS,IAAI,CAAQ,GAE1D,IAAW,CAAC,IAAQ,CAAC,GACnB,IAAU,IAAW,CAAC,IAAQ,CAAC,GAC/B,IAAO,IAAW,IAAM;CAE9B,AADA,EAAK,SAAS,GAAG,GAAG,GAAG,CAAC,GACxB,EAAK,SAAS,GAAG,CAAC;CAElB,IAAI,IAAO,GAAS,QAAQ;CAC5B,IAAI,CAAC,GAAM,OAAO,CAAC;CACnB,AAAI,IAAO,MACT,IAAO,CAAC,GACR,IAAW,CAAC;CAGd,IAAM,IAAQ,CAAC;CAEf,OAAO,CAAC,KAAQ,IAEd,AADA,EAAM,KAAK,EAAc,GAAO,CAAI,CAAC,GACrC,EAAK,YAAY,EAAK,YAAY,IAAI,CAAI;CAG5C,OAAO,IAAW,EAAM,QAAQ,IAAI;AACtC"}