@ynput/ayon-frontend-shared 0.2.35 → 0.2.37

package/dist/node_modules/immer/dist/immer.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"immer.es.js","sources":["../../../../../node_modules/immer/dist/immer.mjs"],"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 = typeof e === \"function\" ? 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 getPrototypeOf = Object.getPrototypeOf;\nfunction isDraft(value) {\n  return !!value && !!value[DRAFT_STATE];\n}\nfunction isDraftable(value) {\n  if (!value)\n    return false;\n  return isPlainObject(value) || Array.isArray(value) || !!value[DRAFTABLE] || !!value.constructor?.[DRAFTABLE] || isMap(value) || isSet(value);\n}\nvar objectCtorString = Object.prototype.constructor.toString();\nfunction isPlainObject(value) {\n  if (!value || typeof value !== \"object\")\n    return false;\n  const proto = getPrototypeOf(value);\n  if (proto === null) {\n    return true;\n  }\n  const Ctor = Object.hasOwnProperty.call(proto, \"constructor\") && proto.constructor;\n  if (Ctor === Object)\n    return true;\n  return typeof Ctor == \"function\" && Function.toString.call(Ctor) === objectCtorString;\n}\nfunction original(value) {\n  if (!isDraft(value))\n    die(15, value);\n  return value[DRAFT_STATE].base_;\n}\nfunction each(obj, iter) {\n  if (getArchtype(obj) === 0 /* Object */) {\n    Reflect.ownKeys(obj).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_ : Array.isArray(thing) ? 1 /* Array */ : isMap(thing) ? 2 /* Map */ : isSet(thing) ? 3 /* Set */ : 0 /* Object */;\n}\nfunction has(thing, prop) {\n  return getArchtype(thing) === 2 /* Map */ ? thing.has(prop) : Object.prototype.hasOwnProperty.call(thing, prop);\n}\nfunction get(thing, prop) {\n  return getArchtype(thing) === 2 /* Map */ ? thing.get(prop) : thing[prop];\n}\nfunction set(thing, propOrOldValue, value) {\n  const t = getArchtype(thing);\n  if (t === 2 /* Map */)\n    thing.set(propOrOldValue, value);\n  else if (t === 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}\nfunction isMap(target) {\n  return target instanceof Map;\n}\nfunction isSet(target) {\n  return target instanceof Set;\n}\nfunction latest(state) {\n  return state.copy_ || state.base_;\n}\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 (Array.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 = Object.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 Object.create(getPrototypeOf(base), descriptors);\n  } else {\n    const proto = getPrototypeOf(base);\n    if (proto !== null && isPlain) {\n      return { ...base };\n    }\n    const obj = Object.create(proto);\n    return Object.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    obj.set = obj.add = obj.clear = obj.delete = dontMutateFrozenCollections;\n  }\n  Object.freeze(obj);\n  if (deep)\n    Object.entries(obj).forEach(([key, value]) => freeze(value, true));\n  return obj;\n}\nfunction dontMutateFrozenCollections() {\n  die(2);\n}\nfunction isFrozen(obj) {\n  return Object.isFrozen(obj);\n}\n\n// src/utils/plugins.ts\nvar plugins = {};\nfunction getPlugin(pluginKey) {\n  const plugin = plugins[pluginKey];\n  if (!plugin) {\n    die(0, pluginKey);\n  }\n  return plugin;\n}\nfunction loadPlugin(pluginKey, implementation) {\n  if (!plugins[pluginKey])\n    plugins[pluginKey] = implementation;\n}\n\n// src/core/scope.ts\nvar currentScope;\nfunction getCurrentScope() {\n  return currentScope;\n}\nfunction createScope(parent_, immer_) {\n  return {\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  };\n}\nfunction usePatchesInScope(scope, patchListener) {\n  if (patchListener) {\n    getPlugin(\"Patches\");\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}\nfunction enterScope(immer2) {\n  return currentScope = createScope(currentScope, immer2);\n}\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      if (!scope.parent_)\n        maybeFreeze(scope, result);\n    }\n    if (scope.patches_) {\n      getPlugin(\"Patches\").generateReplacementPatches_(\n        baseDraft[DRAFT_STATE].base_,\n        result,\n        scope.patches_,\n        scope.inversePatches_\n      );\n    }\n  } else {\n    result = finalize(scope, baseDraft, []);\n  }\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, path) {\n  if (isFrozen(value))\n    return value;\n  const state = value[DRAFT_STATE];\n  if (!state) {\n    each(\n      value,\n      (key, childValue) => finalizeProperty(rootScope, state, value, key, childValue, path)\n    );\n    return value;\n  }\n  if (state.scope_ !== rootScope)\n    return value;\n  if (!state.modified_) {\n    maybeFreeze(rootScope, state.base_, true);\n    return state.base_;\n  }\n  if (!state.finalized_) {\n    state.finalized_ = true;\n    state.scope_.unfinalizedDrafts_--;\n    const result = state.copy_;\n    let resultEach = result;\n    let isSet2 = false;\n    if (state.type_ === 3 /* Set */) {\n      resultEach = new Set(result);\n      result.clear();\n      isSet2 = true;\n    }\n    each(\n      resultEach,\n      (key, childValue) => finalizeProperty(rootScope, state, result, key, childValue, path, isSet2)\n    );\n    maybeFreeze(rootScope, result, false);\n    if (path && rootScope.patches_) {\n      getPlugin(\"Patches\").generatePatches_(\n        state,\n        path,\n        rootScope.patches_,\n        rootScope.inversePatches_\n      );\n    }\n  }\n  return state.copy_;\n}\nfunction finalizeProperty(rootScope, parentState, targetObject, prop, childValue, rootPath, targetIsSet) {\n  if (process.env.NODE_ENV !== \"production\" && childValue === targetObject)\n    die(5);\n  if (isDraft(childValue)) {\n    const path = rootPath && parentState && parentState.type_ !== 3 /* Set */ && // Set objects are atomic since they have no keys.\n    !has(parentState.assigned_, prop) ? rootPath.concat(prop) : void 0;\n    const res = finalize(rootScope, childValue, path);\n    set(targetObject, prop, res);\n    if (isDraft(res)) {\n      rootScope.canAutoFreeze_ = false;\n    } else\n      return;\n  } else if (targetIsSet) {\n    targetObject.add(childValue);\n  }\n  if (isDraftable(childValue) && !isFrozen(childValue)) {\n    if (!rootScope.immer_.autoFreeze_ && rootScope.unfinalizedDrafts_ < 1) {\n      return;\n    }\n    finalize(rootScope, childValue);\n    if ((!parentState || !parentState.scope_.parent_) && typeof prop !== \"symbol\" && Object.prototype.propertyIsEnumerable.call(targetObject, prop))\n      maybeFreeze(rootScope, childValue);\n  }\n}\nfunction maybeFreeze(scope, value, deep = false) {\n  if (!scope.parent_ && scope.immer_.autoFreeze_ && scope.canAutoFreeze_) {\n    freeze(value, deep);\n  }\n}\n\n// src/core/proxy.ts\nfunction createProxyProxy(base, parent) {\n  const isArray = Array.isArray(base);\n  const state = {\n    type_: isArray ? 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    assigned_: {},\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  };\n  let target = state;\n  let traps = objectTraps;\n  if (isArray) {\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;\n}\nvar objectTraps = {\n  get(state, prop) {\n    if (prop === DRAFT_STATE)\n      return state;\n    const source = latest(state);\n    if (!has(source, prop)) {\n      return readPropFromProto(state, source, prop);\n    }\n    const value = source[prop];\n    if (state.finalized_ || !isDraftable(value)) {\n      return value;\n    }\n    if (value === peek(state.base_, prop)) {\n      prepareCopy(state);\n      return state.copy_[prop] = createProxy(value, state);\n    }\n    return value;\n  },\n  has(state, prop) {\n    return prop in latest(state);\n  },\n  ownKeys(state) {\n    return Reflect.ownKeys(latest(state));\n  },\n  set(state, prop, value) {\n    const desc = getDescriptorFromProto(latest(state), prop);\n    if (desc?.set) {\n      desc.set.call(state.draft_, value);\n      return true;\n    }\n    if (!state.modified_) {\n      const current2 = peek(latest(state), prop);\n      const currentState = current2?.[DRAFT_STATE];\n      if (currentState && currentState.base_ === value) {\n        state.copy_[prop] = value;\n        state.assigned_[prop] = false;\n        return true;\n      }\n      if (is(value, current2) && (value !== void 0 || has(state.base_, prop)))\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_[prop] = true;\n    return true;\n  },\n  deleteProperty(state, prop) {\n    if (peek(state.base_, prop) !== void 0 || prop in state.base_) {\n      state.assigned_[prop] = false;\n      prepareCopy(state);\n      markChanged(state);\n    } else {\n      delete state.assigned_[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 = {};\neach(objectTraps, (key, fn) => {\n  arrayTraps[key] = function() {\n    arguments[0] = arguments[0][0];\n    return fn.apply(this, arguments);\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.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    /**\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 (typeof base === \"function\" && typeof recipe !== \"function\") {\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 (typeof recipe !== \"function\")\n        die(6);\n      if (patchListener !== void 0 && typeof patchListener !== \"function\")\n        die(7);\n      let result;\n      if (isDraftable(base)) {\n        const scope = enterScope(this);\n        const proxy = createProxy(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 || typeof base !== \"object\") {\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(\"Patches\").generateReplacementPatches_(base, result, p, ip);\n          patchListener(p, ip);\n        }\n        return result;\n      } else\n        die(1, base);\n    };\n    this.produceWithPatches = (base, recipe) => {\n      if (typeof base === \"function\") {\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 (typeof config?.autoFreeze === \"boolean\")\n      this.setAutoFreeze(config.autoFreeze);\n    if (typeof config?.useStrictShallowCopy === \"boolean\")\n      this.setUseStrictShallowCopy(config.useStrictShallowCopy);\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(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  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(\"Patches\").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(value, parent) {\n  const draft = isMap(value) ? getPlugin(\"MapSet\").proxyMap_(value, parent) : isSet(value) ? getPlugin(\"MapSet\").proxySet_(value, parent) : createProxyProxy(value, parent);\n  const scope = parent ? parent.scope_ : getCurrentScope();\n  scope.drafts_.push(draft);\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  if (state) {\n    if (!state.modified_)\n      return state.base_;\n    state.finalized_ = true;\n    copy = shallowCopy(value, state.scope_.immer_.useStrictShallowCopy_);\n  } else {\n    copy = shallowCopy(value, true);\n  }\n  each(copy, (key, childValue) => {\n    set(copy, key, currentImpl(childValue));\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  const REPLACE = \"replace\";\n  const ADD = \"add\";\n  const REMOVE = \"remove\";\n  function generatePatches_(state, basePath, patches, inversePatches) {\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(state, basePath, patches, inversePatches);\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    for (let i = 0; i < base_.length; i++) {\n      if (assigned_[i] && copy_[i] !== base_[i]) {\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(copy_[i])\n        });\n        inversePatches.push({\n          op: REPLACE,\n          path,\n          value: clonePatchValueIfNeeded(base_[i])\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_ } = state;\n    each(state.assigned_, (key, assignedValue) => {\n      const origValue = get(base_, key);\n      const value = get(copy_, key);\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(op === REMOVE ? { op, path } : { op, path, value });\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, patches, inversePatches) {\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 (typeof base === \"function\" && p === \"prototype\")\n          die(errorOffset + 3);\n        base = get(base, p);\n        if (typeof base !== \"object\")\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 (Array.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(\"Patches\", {\n    applyPatches_,\n    generatePatches_,\n    generateReplacementPatches_\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      };\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      }\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(value, state);\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    return new DraftMap(target, parent);\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      };\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      }\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    return new DraftSet(target, parent);\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(value, state);\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  loadPlugin(\"MapSet\", { proxyMap_, proxySet_ });\n}\n\n// src/immer.ts\nvar immer = new Immer2();\nvar produce = immer.produce;\nvar produceWithPatches = immer.produceWithPatches.bind(\n  immer\n);\nvar setAutoFreeze = immer.setAutoFreeze.bind(immer);\nvar setUseStrictShallowCopy = immer.setUseStrictShallowCopy.bind(immer);\nvar applyPatches = immer.applyPatches.bind(immer);\nvar createDraft = immer.createDraft.bind(immer);\nvar finishDraft = immer.finishDraft.bind(immer);\nfunction castDraft(value) {\n  return value;\n}\nfunction castImmutable(value) {\n  return value;\n}\nexport {\n  Immer2 as Immer,\n  applyPatches,\n  castDraft,\n  castImmutable,\n  createDraft,\n  current,\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  setUseStrictShallowCopy\n};\n//# sourceMappingURL=immer.mjs.map"],"names":["NOTHING","DRAFTABLE","DRAFT_STATE","errors","plugin","thing","data","die","error","args","e","msg","getPrototypeOf","isDraft","value","isDraftable","_a","isPlainObject","isMap","isSet","objectCtorString","proto","Ctor","original","each","obj","iter","getArchtype","key","entry","index","state","has","prop","get","set","propOrOldValue","t","is","x","y","target","latest","shallowCopy","base","strict","isPlain","descriptors","keys","i","desc","freeze","deep","isFrozen","dontMutateFrozenCollections","plugins","getPlugin","pluginKey","loadPlugin","implementation","currentScope","getCurrentScope","createScope","parent_","immer_","usePatchesInScope","scope","patchListener","revokeScope","leaveScope","revokeDraft","enterScope","immer2","draft","processResult","result","baseDraft","finalize","maybeFreeze","rootScope","path","childValue","finalizeProperty","resultEach","isSet2","parentState","targetObject","rootPath","targetIsSet","res","createProxyProxy","parent","isArray","traps","objectTraps","arrayTraps","revoke","proxy","source","readPropFromProto","peek","prepareCopy","createProxy","getDescriptorFromProto","current2","currentState","markChanged","owner","fn","Immer2","config","recipe","defaultBase","self","base2","hasError","p","ip","patches","inversePatches","current","patch","applyPatchesImpl","currentImpl","copy","enablePatches","op","REPLACE","ADD","REMOVE","generatePatches_","basePath","generatePatchesFromAssigned","generateArrayPatches","generateSetPatches","base_","assigned_","copy_","clonePatchValueIfNeeded","assignedValue","origValue","generateReplacementPatches_","baseValue","replacement","applyPatches_","parentType","type","deepClonePatchValue","k","v","cloned","immer","produceWithPatches","applyPatches"],"mappings":"AACG,IAACA,IAAU,OAAO,IAAI,eAAe,GACpCC,IAAY,OAAO,IAAI,iBAAiB,GACxCC,IAAc,OAAO,IAAI,aAAa,GAGtCC,KAAS,QAAQ,IAAI,aAAa,eAAe;AAAA;AAAA,EAEnD,SAASC,GAAQ;AACf,WAAO,mBAAmBA,CAAM,mFAAmFA,CAAM;AAAA,EAC1H;AAAA,EACD,SAASC,GAAO;AACd,WAAO,sJAAsJA,CAAK;AAAA,EACnK;AAAA,EACD;AAAA,EACA,SAASC,GAAM;AACb,WAAO,yHAAyHA;AAAA,EACjI;AAAA,EACD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAASD,GAAO;AACd,WAAO,mCAAmCA,CAAK;AAAA,EAChD;AAAA,EACD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAASA,GAAO;AACd,WAAO,oCAAoCA,CAAK;AAAA,EACpD;AAAA;AAAA;AAGA,IAAI,CAAE;AACN,SAASE,EAAIC,MAAUC,GAAM;AAC3B,MAAI,QAAQ,IAAI,aAAa,cAAc;AACzC,UAAMC,IAAIP,GAAOK,CAAK,GAChBG,IAAM,OAAOD,KAAM,aAAaA,EAAE,MAAM,MAAMD,CAAI,IAAIC;AAC5D,UAAM,IAAI,MAAM,WAAWC,CAAG,EAAE;AAAA,EACpC;AACE,QAAM,IAAI;AAAA,IACR,8BAA8BH,CAAK;AAAA,EACpC;AACH;AAGA,IAAII,IAAiB,OAAO;AAC5B,SAASC,EAAQC,GAAO;AACtB,SAAO,CAAC,CAACA,KAAS,CAAC,CAACA,EAAMZ,CAAW;AACvC;AACA,SAASa,EAAYD,GAAO;AArD5B,MAAAE;AAsDE,SAAKF,IAEEG,GAAcH,CAAK,KAAK,MAAM,QAAQA,CAAK,KAAK,CAAC,CAACA,EAAMb,CAAS,KAAK,CAAC,GAACe,IAAAF,EAAM,gBAAN,QAAAE,EAAoBf,OAAciB,EAAMJ,CAAK,KAAKK,EAAML,CAAK,IADnI;AAEX;AACA,IAAIM,KAAmB,OAAO,UAAU,YAAY,SAAU;AAC9D,SAASH,GAAcH,GAAO;AAC5B,MAAI,CAACA,KAAS,OAAOA,KAAU;AAC7B,WAAO;AACT,QAAMO,IAAQT,EAAeE,CAAK;AAClC,MAAIO,MAAU;AACZ,WAAO;AAET,QAAMC,IAAO,OAAO,eAAe,KAAKD,GAAO,aAAa,KAAKA,EAAM;AACvE,SAAIC,MAAS,SACJ,KACF,OAAOA,KAAQ,cAAc,SAAS,SAAS,KAAKA,CAAI,MAAMF;AACvE;AACA,SAASG,GAAST,GAAO;AACvB,SAAKD,EAAQC,CAAK,KAChBP,EAAI,IAAIO,CAAK,GACRA,EAAMZ,CAAW,EAAE;AAC5B;AACA,SAASsB,EAAKC,GAAKC,GAAM;AACvB,EAAIC,EAAYF,CAAG,MAAM,IACvB,QAAQ,QAAQA,CAAG,EAAE,QAAQ,CAACG,MAAQ;AACpC,IAAAF,EAAKE,GAAKH,EAAIG,CAAG,GAAGH,CAAG;AAAA,EAC7B,CAAK,IAEDA,EAAI,QAAQ,CAACI,GAAOC,MAAUJ,EAAKI,GAAOD,GAAOJ,CAAG,CAAC;AAEzD;AACA,SAASE,EAAYtB,GAAO;AAC1B,QAAM0B,IAAQ1B,EAAMH,CAAW;AAC/B,SAAO6B,IAAQA,EAAM,QAAQ,MAAM,QAAQ1B,CAAK,IAAI,IAAgBa,EAAMb,CAAK,IAAI,IAAcc,EAAMd,CAAK,IAAI,IAAc;AAChI;AACA,SAAS2B,EAAI3B,GAAO4B,GAAM;AACxB,SAAON,EAAYtB,CAAK,MAAM,IAAcA,EAAM,IAAI4B,CAAI,IAAI,OAAO,UAAU,eAAe,KAAK5B,GAAO4B,CAAI;AAChH;AACA,SAASC,EAAI7B,GAAO4B,GAAM;AACxB,SAAON,EAAYtB,CAAK,MAAM,IAAcA,EAAM,IAAI4B,CAAI,IAAI5B,EAAM4B,CAAI;AAC1E;AACA,SAASE,GAAI9B,GAAO+B,GAAgBtB,GAAO;AACzC,QAAMuB,IAAIV,EAAYtB,CAAK;AAC3B,EAAIgC,MAAM,IACRhC,EAAM,IAAI+B,GAAgBtB,CAAK,IACxBuB,MAAM,IACbhC,EAAM,IAAIS,CAAK,IAEfT,EAAM+B,CAAc,IAAItB;AAC5B;AACA,SAASwB,GAAGC,GAAGC,GAAG;AAChB,SAAID,MAAMC,IACDD,MAAM,KAAK,IAAIA,MAAM,IAAIC,IAEzBD,MAAMA,KAAKC,MAAMA;AAE5B;AACA,SAAStB,EAAMuB,GAAQ;AACrB,SAAOA,aAAkB;AAC3B;AACA,SAAStB,EAAMsB,GAAQ;AACrB,SAAOA,aAAkB;AAC3B;AACA,SAASC,EAAOX,GAAO;AACrB,SAAOA,EAAM,SAASA,EAAM;AAC9B;AACA,SAASY,EAAYC,GAAMC,GAAQ;AACjC,MAAI3B,EAAM0B,CAAI;AACZ,WAAO,IAAI,IAAIA,CAAI;AAErB,MAAIzB,EAAMyB,CAAI;AACZ,WAAO,IAAI,IAAIA,CAAI;AAErB,MAAI,MAAM,QAAQA,CAAI;AACpB,WAAO,MAAM,UAAU,MAAM,KAAKA,CAAI;AACxC,QAAME,IAAU7B,GAAc2B,CAAI;AAClC,MAAIC,MAAW,MAAQA,MAAW,gBAAgB,CAACC,GAAS;AAC1D,UAAMC,IAAc,OAAO,0BAA0BH,CAAI;AACzD,WAAOG,EAAY7C,CAAW;AAC9B,QAAI8C,IAAO,QAAQ,QAAQD,CAAW;AACtC,aAASE,IAAI,GAAGA,IAAID,EAAK,QAAQC,KAAK;AACpC,YAAMrB,IAAMoB,EAAKC,CAAC,GACZC,IAAOH,EAAYnB,CAAG;AAC5B,MAAIsB,EAAK,aAAa,OACpBA,EAAK,WAAW,IAChBA,EAAK,eAAe,MAElBA,EAAK,OAAOA,EAAK,SACnBH,EAAYnB,CAAG,IAAI;AAAA,QACjB,cAAc;AAAA,QACd,UAAU;AAAA;AAAA,QAEV,YAAYsB,EAAK;AAAA,QACjB,OAAON,EAAKhB,CAAG;AAAA,MAChB;AAAA,IACT;AACI,WAAO,OAAO,OAAOhB,EAAegC,CAAI,GAAGG,CAAW;AAAA,EAC1D,OAAS;AACL,UAAM1B,IAAQT,EAAegC,CAAI;AACjC,QAAIvB,MAAU,QAAQyB;AACpB,aAAO,EAAE,GAAGF,EAAM;AAEpB,UAAMnB,IAAM,OAAO,OAAOJ,CAAK;AAC/B,WAAO,OAAO,OAAOI,GAAKmB,CAAI;AAAA,EAClC;AACA;AACA,SAASO,EAAO1B,GAAK2B,IAAO,IAAO;AACjC,SAAIC,EAAS5B,CAAG,KAAKZ,EAAQY,CAAG,KAAK,CAACV,EAAYU,CAAG,MAEjDE,EAAYF,CAAG,IAAI,MACrBA,EAAI,MAAMA,EAAI,MAAMA,EAAI,QAAQA,EAAI,SAAS6B,KAE/C,OAAO,OAAO7B,CAAG,GACb2B,KACF,OAAO,QAAQ3B,CAAG,EAAE,QAAQ,CAAC,CAACG,GAAKd,CAAK,MAAMqC,EAAOrC,GAAO,EAAI,CAAC,IAC5DW;AACT;AACA,SAAS6B,KAA8B;AACrC,EAAA/C,EAAI,CAAC;AACP;AACA,SAAS8C,EAAS5B,GAAK;AACrB,SAAO,OAAO,SAASA,CAAG;AAC5B;AAGA,IAAI8B,IAAU,CAAE;AAChB,SAASC,EAAUC,GAAW;AAC5B,QAAMrD,IAASmD,EAAQE,CAAS;AAChC,SAAKrD,KACHG,EAAI,GAAGkD,CAAS,GAEXrD;AACT;AACA,SAASsD,GAAWD,GAAWE,GAAgB;AAC7C,EAAKJ,EAAQE,CAAS,MACpBF,EAAQE,CAAS,IAAIE;AACzB;AAGA,IAAIC;AACJ,SAASC,KAAkB;AACzB,SAAOD;AACT;AACA,SAASE,GAAYC,GAASC,GAAQ;AACpC,SAAO;AAAA,IACL,SAAS,CAAE;AAAA,IACX,SAAAD;AAAA,IACA,QAAAC;AAAA;AAAA;AAAA,IAGA,gBAAgB;AAAA,IAChB,oBAAoB;AAAA,EACrB;AACH;AACA,SAASC,GAAkBC,GAAOC,GAAe;AAC/C,EAAIA,MACFX,EAAU,SAAS,GACnBU,EAAM,WAAW,CAAE,GACnBA,EAAM,kBAAkB,CAAE,GAC1BA,EAAM,iBAAiBC;AAE3B;AACA,SAASC,EAAYF,GAAO;AAC1B,EAAAG,EAAWH,CAAK,GAChBA,EAAM,QAAQ,QAAQI,EAAW,GACjCJ,EAAM,UAAU;AAClB;AACA,SAASG,EAAWH,GAAO;AACzB,EAAIA,MAAUN,MACZA,IAAeM,EAAM;AAEzB;AACA,SAASK,GAAWC,GAAQ;AAC1B,SAAOZ,IAAeE,GAAYF,GAAcY,CAAM;AACxD;AACA,SAASF,GAAYG,GAAO;AAC1B,QAAM1C,IAAQ0C,EAAMvE,CAAW;AAC/B,EAAI6B,EAAM,UAAU,KAAkBA,EAAM,UAAU,IACpDA,EAAM,QAAS,IAEfA,EAAM,WAAW;AACrB;AAGA,SAAS2C,GAAcC,GAAQT,GAAO;AACpC,EAAAA,EAAM,qBAAqBA,EAAM,QAAQ;AACzC,QAAMU,IAAYV,EAAM,QAAQ,CAAC;AAEjC,SADmBS,MAAW,UAAUA,MAAWC,KAE7CA,EAAU1E,CAAW,EAAE,cACzBkE,EAAYF,CAAK,GACjB3D,EAAI,CAAC,IAEHQ,EAAY4D,CAAM,MACpBA,IAASE,EAASX,GAAOS,CAAM,GAC1BT,EAAM,WACTY,EAAYZ,GAAOS,CAAM,IAEzBT,EAAM,YACRV,EAAU,SAAS,EAAE;AAAA,IACnBoB,EAAU1E,CAAW,EAAE;AAAA,IACvByE;AAAA,IACAT,EAAM;AAAA,IACNA,EAAM;AAAA,EACP,KAGHS,IAASE,EAASX,GAAOU,GAAW,CAAA,CAAE,GAExCR,EAAYF,CAAK,GACbA,EAAM,YACRA,EAAM,eAAeA,EAAM,UAAUA,EAAM,eAAe,GAErDS,MAAW3E,IAAU2E,IAAS;AACvC;AACA,SAASE,EAASE,GAAWjE,GAAOkE,GAAM;AACxC,MAAI3B,EAASvC,CAAK;AAChB,WAAOA;AACT,QAAMiB,IAAQjB,EAAMZ,CAAW;AAC/B,MAAI,CAAC6B;AACH,WAAAP;AAAA,MACEV;AAAA,MACA,CAACc,GAAKqD,MAAeC,GAAiBH,GAAWhD,GAAOjB,GAAOc,GAAKqD,GAAYD,CAAI;AAAA,IACrF,GACMlE;AAET,MAAIiB,EAAM,WAAWgD;AACnB,WAAOjE;AACT,MAAI,CAACiB,EAAM;AACT,WAAA+C,EAAYC,GAAWhD,EAAM,OAAO,EAAI,GACjCA,EAAM;AAEf,MAAI,CAACA,EAAM,YAAY;AACrB,IAAAA,EAAM,aAAa,IACnBA,EAAM,OAAO;AACb,UAAM4C,IAAS5C,EAAM;AACrB,QAAIoD,IAAaR,GACbS,IAAS;AACb,IAAIrD,EAAM,UAAU,MAClBoD,IAAa,IAAI,IAAIR,CAAM,GAC3BA,EAAO,MAAO,GACdS,IAAS,KAEX5D;AAAA,MACE2D;AAAA,MACA,CAACvD,GAAKqD,MAAeC,GAAiBH,GAAWhD,GAAO4C,GAAQ/C,GAAKqD,GAAYD,GAAMI,CAAM;AAAA,IAC9F,GACDN,EAAYC,GAAWJ,GAAQ,EAAK,GAChCK,KAAQD,EAAU,YACpBvB,EAAU,SAAS,EAAE;AAAA,MACnBzB;AAAA,MACAiD;AAAA,MACAD,EAAU;AAAA,MACVA,EAAU;AAAA,IACX;AAAA,EAEP;AACE,SAAOhD,EAAM;AACf;AACA,SAASmD,GAAiBH,GAAWM,GAAaC,GAAcrD,GAAMgD,GAAYM,GAAUC,GAAa;AAGvG,MAFI,QAAQ,IAAI,aAAa,gBAAgBP,MAAeK,KAC1D/E,EAAI,CAAC,GACHM,EAAQoE,CAAU,GAAG;AACvB,UAAMD,IAAOO,KAAYF,KAAeA,EAAY,UAAU;AAAA,IAC9D,CAACrD,EAAIqD,EAAY,WAAWpD,CAAI,IAAIsD,EAAS,OAAOtD,CAAI,IAAI,QACtDwD,IAAMZ,EAASE,GAAWE,GAAYD,CAAI;AAEhD,QADA7C,GAAImD,GAAcrD,GAAMwD,CAAG,GACvB5E,EAAQ4E,CAAG;AACb,MAAAV,EAAU,iBAAiB;AAAA;AAE3B;AAAA,EACH,MAAM,CAAIS,KACTF,EAAa,IAAIL,CAAU;AAE7B,MAAIlE,EAAYkE,CAAU,KAAK,CAAC5B,EAAS4B,CAAU,GAAG;AACpD,QAAI,CAACF,EAAU,OAAO,eAAeA,EAAU,qBAAqB;AAClE;AAEF,IAAAF,EAASE,GAAWE,CAAU,IACzB,CAACI,KAAe,CAACA,EAAY,OAAO,YAAY,OAAOpD,KAAS,YAAY,OAAO,UAAU,qBAAqB,KAAKqD,GAAcrD,CAAI,KAC5I6C,EAAYC,GAAWE,CAAU;AAAA,EACvC;AACA;AACA,SAASH,EAAYZ,GAAOpD,GAAOsC,IAAO,IAAO;AAC/C,EAAI,CAACc,EAAM,WAAWA,EAAM,OAAO,eAAeA,EAAM,kBACtDf,EAAOrC,GAAOsC,CAAI;AAEtB;AAGA,SAASsC,GAAiB9C,GAAM+C,GAAQ;AACtC,QAAMC,IAAU,MAAM,QAAQhD,CAAI,GAC5Bb,IAAQ;AAAA,IACZ,OAAO6D,IAAU,IAAgB;AAAA;AAAA,IAEjC,QAAQD,IAASA,EAAO,SAAS9B,GAAiB;AAAA;AAAA,IAElD,WAAW;AAAA;AAAA,IAEX,YAAY;AAAA;AAAA,IAEZ,WAAW,CAAE;AAAA;AAAA,IAEb,SAAS8B;AAAA;AAAA,IAET,OAAO/C;AAAA;AAAA,IAEP,QAAQ;AAAA;AAAA;AAAA,IAGR,OAAO;AAAA;AAAA,IAEP,SAAS;AAAA,IACT,WAAW;AAAA,EACZ;AACD,MAAIH,IAASV,GACT8D,IAAQC;AACZ,EAAIF,MACFnD,IAAS,CAACV,CAAK,GACf8D,IAAQE;AAEV,QAAM,EAAE,QAAAC,GAAQ,OAAAC,EAAO,IAAG,MAAM,UAAUxD,GAAQoD,CAAK;AACvD,SAAA9D,EAAM,SAASkE,GACflE,EAAM,UAAUiE,GACTC;AACT;AACA,IAAIH,KAAc;AAAA,EAChB,IAAI/D,GAAOE,GAAM;AACf,QAAIA,MAAS/B;AACX,aAAO6B;AACT,UAAMmE,IAASxD,EAAOX,CAAK;AAC3B,QAAI,CAACC,EAAIkE,GAAQjE,CAAI;AACnB,aAAOkE,GAAkBpE,GAAOmE,GAAQjE,CAAI;AAE9C,UAAMnB,IAAQoF,EAAOjE,CAAI;AACzB,WAAIF,EAAM,cAAc,CAAChB,EAAYD,CAAK,IACjCA,IAELA,MAAUsF,EAAKrE,EAAM,OAAOE,CAAI,KAClCoE,EAAYtE,CAAK,GACVA,EAAM,MAAME,CAAI,IAAIqE,EAAYxF,GAAOiB,CAAK,KAE9CjB;AAAA,EACR;AAAA,EACD,IAAIiB,GAAOE,GAAM;AACf,WAAOA,KAAQS,EAAOX,CAAK;AAAA,EAC5B;AAAA,EACD,QAAQA,GAAO;AACb,WAAO,QAAQ,QAAQW,EAAOX,CAAK,CAAC;AAAA,EACrC;AAAA,EACD,IAAIA,GAAOE,GAAMnB,GAAO;AACtB,UAAMoC,IAAOqD,GAAuB7D,EAAOX,CAAK,GAAGE,CAAI;AACvD,QAAIiB,KAAA,QAAAA,EAAM;AACR,aAAAA,EAAK,IAAI,KAAKnB,EAAM,QAAQjB,CAAK,GAC1B;AAET,QAAI,CAACiB,EAAM,WAAW;AACpB,YAAMyE,IAAWJ,EAAK1D,EAAOX,CAAK,GAAGE,CAAI,GACnCwE,IAAeD,KAAA,gBAAAA,EAAWtG;AAChC,UAAIuG,KAAgBA,EAAa,UAAU3F;AACzC,eAAAiB,EAAM,MAAME,CAAI,IAAInB,GACpBiB,EAAM,UAAUE,CAAI,IAAI,IACjB;AAET,UAAIK,GAAGxB,GAAO0F,CAAQ,MAAM1F,MAAU,UAAUkB,EAAID,EAAM,OAAOE,CAAI;AACnE,eAAO;AACT,MAAAoE,EAAYtE,CAAK,GACjB2E,EAAY3E,CAAK;AAAA,IACvB;AACI,WAAIA,EAAM,MAAME,CAAI,MAAMnB;AAAA,KACzBA,MAAU,UAAUmB,KAAQF,EAAM;AAAA,IACnC,OAAO,MAAMjB,CAAK,KAAK,OAAO,MAAMiB,EAAM,MAAME,CAAI,CAAC,MAErDF,EAAM,MAAME,CAAI,IAAInB,GACpBiB,EAAM,UAAUE,CAAI,IAAI,KACjB;AAAA,EACR;AAAA,EACD,eAAeF,GAAOE,GAAM;AAC1B,WAAImE,EAAKrE,EAAM,OAAOE,CAAI,MAAM,UAAUA,KAAQF,EAAM,SACtDA,EAAM,UAAUE,CAAI,IAAI,IACxBoE,EAAYtE,CAAK,GACjB2E,EAAY3E,CAAK,KAEjB,OAAOA,EAAM,UAAUE,CAAI,GAEzBF,EAAM,SACR,OAAOA,EAAM,MAAME,CAAI,GAElB;AAAA,EACR;AAAA;AAAA;AAAA,EAGD,yBAAyBF,GAAOE,GAAM;AACpC,UAAM0E,IAAQjE,EAAOX,CAAK,GACpBmB,IAAO,QAAQ,yBAAyByD,GAAO1E,CAAI;AACzD,WAAKiB,KAEE;AAAA,MACL,UAAU;AAAA,MACV,cAAcnB,EAAM,UAAU,KAAiBE,MAAS;AAAA,MACxD,YAAYiB,EAAK;AAAA,MACjB,OAAOyD,EAAM1E,CAAI;AAAA,IAClB;AAAA,EACF;AAAA,EACD,iBAAiB;AACf,IAAA1B,EAAI,EAAE;AAAA,EACP;AAAA,EACD,eAAewB,GAAO;AACpB,WAAOnB,EAAemB,EAAM,KAAK;AAAA,EAClC;AAAA,EACD,iBAAiB;AACf,IAAAxB,EAAI,EAAE;AAAA,EACV;AACA,GACIwF,IAAa,CAAE;AACnBvE,EAAKsE,IAAa,CAAClE,GAAKgF,MAAO;AAC7B,EAAAb,EAAWnE,CAAG,IAAI,WAAW;AAC3B,qBAAU,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC,GACtBgF,EAAG,MAAM,MAAM,SAAS;AAAA,EAChC;AACH,CAAC;AACDb,EAAW,iBAAiB,SAAShE,GAAOE,GAAM;AAChD,SAAI,QAAQ,IAAI,aAAa,gBAAgB,MAAM,SAASA,CAAI,CAAC,KAC/D1B,EAAI,EAAE,GACDwF,EAAW,IAAI,KAAK,MAAMhE,GAAOE,GAAM,MAAM;AACtD;AACA8D,EAAW,MAAM,SAAShE,GAAOE,GAAMnB,GAAO;AAC5C,SAAI,QAAQ,IAAI,aAAa,gBAAgBmB,MAAS,YAAY,MAAM,SAASA,CAAI,CAAC,KACpF1B,EAAI,EAAE,GACDuF,GAAY,IAAI,KAAK,MAAM/D,EAAM,CAAC,GAAGE,GAAMnB,GAAOiB,EAAM,CAAC,CAAC;AACnE;AACA,SAASqE,EAAK3B,GAAOxC,GAAM;AACzB,QAAMF,IAAQ0C,EAAMvE,CAAW;AAE/B,UADe6B,IAAQW,EAAOX,CAAK,IAAI0C,GACzBxC,CAAI;AACpB;AACA,SAASkE,GAAkBpE,GAAOmE,GAAQjE,GAAM;AA1ehD,MAAAjB;AA2eE,QAAMkC,IAAOqD,GAAuBL,GAAQjE,CAAI;AAChD,SAAOiB,IAAO,WAAWA,IAAOA,EAAK;AAAA;AAAA;AAAA,KAGnClC,IAAAkC,EAAK,QAAL,gBAAAlC,EAAU,KAAKe,EAAM;AAAA,MACnB;AACN;AACA,SAASwE,GAAuBL,GAAQjE,GAAM;AAC5C,MAAI,EAAEA,KAAQiE;AACZ;AACF,MAAI7E,IAAQT,EAAesF,CAAM;AACjC,SAAO7E,KAAO;AACZ,UAAM6B,IAAO,OAAO,yBAAyB7B,GAAOY,CAAI;AACxD,QAAIiB;AACF,aAAOA;AACT,IAAA7B,IAAQT,EAAeS,CAAK;AAAA,EAChC;AAEA;AACA,SAASqF,EAAY3E,GAAO;AAC1B,EAAKA,EAAM,cACTA,EAAM,YAAY,IACdA,EAAM,WACR2E,EAAY3E,EAAM,OAAO;AAG/B;AACA,SAASsE,EAAYtE,GAAO;AAC1B,EAAKA,EAAM,UACTA,EAAM,QAAQY;AAAA,IACZZ,EAAM;AAAA,IACNA,EAAM,OAAO,OAAO;AAAA,EACrB;AAEL;AAGG,IAAC8E,KAAS,MAAM;AAAA,EACjB,YAAYC,GAAQ;AAClB,SAAK,cAAc,IACnB,KAAK,wBAAwB,IAoB7B,KAAK,UAAU,CAAClE,GAAMmE,GAAQ5C,MAAkB;AAC9C,UAAI,OAAOvB,KAAS,cAAc,OAAOmE,KAAW,YAAY;AAC9D,cAAMC,IAAcD;AACpB,QAAAA,IAASnE;AACT,cAAMqE,IAAO;AACb,eAAO,SAAwBC,IAAQF,MAAgBvG,GAAM;AAC3D,iBAAOwG,EAAK,QAAQC,GAAO,CAACzC,MAAUsC,EAAO,KAAK,MAAMtC,GAAO,GAAGhE,CAAI,CAAC;AAAA,QACxE;AAAA,MACT;AACM,MAAI,OAAOsG,KAAW,cACpBxG,EAAI,CAAC,GACH4D,MAAkB,UAAU,OAAOA,KAAkB,cACvD5D,EAAI,CAAC;AACP,UAAIoE;AACJ,UAAI5D,EAAY6B,CAAI,GAAG;AACrB,cAAMsB,IAAQK,GAAW,IAAI,GACvB0B,IAAQK,EAAY1D,GAAM,MAAM;AACtC,YAAIuE,IAAW;AACf,YAAI;AACF,UAAAxC,IAASoC,EAAOd,CAAK,GACrBkB,IAAW;AAAA,QACrB,UAAkB;AACR,UAAIA,IACF/C,EAAYF,CAAK,IAEjBG,EAAWH,CAAK;AAAA,QAC5B;AACQ,eAAAD,GAAkBC,GAAOC,CAAa,GAC/BO,GAAcC,GAAQT,CAAK;AAAA,MACnC,WAAU,CAACtB,KAAQ,OAAOA,KAAS,UAAU;AAQ5C,YAPA+B,IAASoC,EAAOnE,CAAI,GAChB+B,MAAW,WACbA,IAAS/B,IACP+B,MAAW3E,MACb2E,IAAS,SACP,KAAK,eACPxB,EAAOwB,GAAQ,EAAI,GACjBR,GAAe;AACjB,gBAAMiD,IAAI,CAAE,GACNC,IAAK,CAAE;AACb,UAAA7D,EAAU,SAAS,EAAE,4BAA4BZ,GAAM+B,GAAQyC,GAAGC,CAAE,GACpElD,EAAciD,GAAGC,CAAE;AAAA,QAC7B;AACQ,eAAO1C;AAAA,MACR;AACC,QAAApE,EAAI,GAAGqC,CAAI;AAAA,IACd,GACD,KAAK,qBAAqB,CAACA,GAAMmE,MAAW;AAC1C,UAAI,OAAOnE,KAAS;AAClB,eAAO,CAACb,MAAUtB,MAAS,KAAK,mBAAmBsB,GAAO,CAAC0C,MAAU7B,EAAK6B,GAAO,GAAGhE,CAAI,CAAC;AAE3F,UAAI6G,GAASC;AAKb,aAAO,CAJQ,KAAK,QAAQ3E,GAAMmE,GAAQ,CAACK,GAAGC,MAAO;AACnD,QAAAC,IAAUF,GACVG,IAAiBF;AAAA,MACzB,CAAO,GACeC,GAASC,CAAc;AAAA,IACxC,GACG,QAAOT,KAAA,gBAAAA,EAAQ,eAAe,aAChC,KAAK,cAAcA,EAAO,UAAU,GAClC,QAAOA,KAAA,gBAAAA,EAAQ,yBAAyB,aAC1C,KAAK,wBAAwBA,EAAO,oBAAoB;AAAA,EAC9D;AAAA,EACE,YAAYlE,GAAM;AAChB,IAAK7B,EAAY6B,CAAI,KACnBrC,EAAI,CAAC,GACHM,EAAQ+B,CAAI,MACdA,IAAO4E,GAAQ5E,CAAI;AACrB,UAAMsB,IAAQK,GAAW,IAAI,GACvB0B,IAAQK,EAAY1D,GAAM,MAAM;AACtC,WAAAqD,EAAM/F,CAAW,EAAE,YAAY,IAC/BmE,EAAWH,CAAK,GACT+B;AAAA,EACX;AAAA,EACE,YAAYxB,GAAON,GAAe;AAChC,UAAMpC,IAAQ0C,KAASA,EAAMvE,CAAW;AACxC,KAAI,CAAC6B,KAAS,CAACA,EAAM,cACnBxB,EAAI,CAAC;AACP,UAAM,EAAE,QAAQ2D,EAAK,IAAKnC;AAC1B,WAAAkC,GAAkBC,GAAOC,CAAa,GAC/BO,GAAc,QAAQR,CAAK;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAME,cAAcpD,GAAO;AACnB,SAAK,cAAcA;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAME,wBAAwBA,GAAO;AAC7B,SAAK,wBAAwBA;AAAA,EACjC;AAAA,EACE,aAAa8B,GAAM0E,GAAS;AAC1B,QAAIrE;AACJ,SAAKA,IAAIqE,EAAQ,SAAS,GAAGrE,KAAK,GAAGA,KAAK;AACxC,YAAMwE,IAAQH,EAAQrE,CAAC;AACvB,UAAIwE,EAAM,KAAK,WAAW,KAAKA,EAAM,OAAO,WAAW;AACrD,QAAA7E,IAAO6E,EAAM;AACb;AAAA,MACR;AAAA,IACA;AACI,IAAIxE,IAAI,OACNqE,IAAUA,EAAQ,MAAMrE,IAAI,CAAC;AAE/B,UAAMyE,IAAmBlE,EAAU,SAAS,EAAE;AAC9C,WAAI3C,EAAQ+B,CAAI,IACP8E,EAAiB9E,GAAM0E,CAAO,IAEhC,KAAK;AAAA,MACV1E;AAAA,MACA,CAAC6B,MAAUiD,EAAiBjD,GAAO6C,CAAO;AAAA,IAC3C;AAAA,EACL;AACA;AACA,SAAShB,EAAYxF,GAAO6E,GAAQ;AAClC,QAAMlB,IAAQvD,EAAMJ,CAAK,IAAI0C,EAAU,QAAQ,EAAE,UAAU1C,GAAO6E,CAAM,IAAIxE,EAAML,CAAK,IAAI0C,EAAU,QAAQ,EAAE,UAAU1C,GAAO6E,CAAM,IAAID,GAAiB5E,GAAO6E,CAAM;AAExK,UADcA,IAASA,EAAO,SAAS9B,GAAiB,GAClD,QAAQ,KAAKY,CAAK,GACjBA;AACT;AAGA,SAAS+C,GAAQ1G,GAAO;AACtB,SAAKD,EAAQC,CAAK,KAChBP,EAAI,IAAIO,CAAK,GACR6G,GAAY7G,CAAK;AAC1B;AACA,SAAS6G,GAAY7G,GAAO;AAC1B,MAAI,CAACC,EAAYD,CAAK,KAAKuC,EAASvC,CAAK;AACvC,WAAOA;AACT,QAAMiB,IAAQjB,EAAMZ,CAAW;AAC/B,MAAI0H;AACJ,MAAI7F,GAAO;AACT,QAAI,CAACA,EAAM;AACT,aAAOA,EAAM;AACf,IAAAA,EAAM,aAAa,IACnB6F,IAAOjF,EAAY7B,GAAOiB,EAAM,OAAO,OAAO,qBAAqB;AAAA,EACvE;AACI,IAAA6F,IAAOjF,EAAY7B,GAAO,EAAI;AAEhC,SAAAU,EAAKoG,GAAM,CAAChG,GAAKqD,MAAe;AAC9B,IAAA9C,GAAIyF,GAAMhG,GAAK+F,GAAY1C,CAAU,CAAC;AAAA,EAC1C,CAAG,GACGlD,MACFA,EAAM,aAAa,KAEd6F;AACT;AAGA,SAASC,KAAgB;AAEvB,EAAI,QAAQ,IAAI,aAAa,gBAC3B1H,GAAO;AAAA,IACL;AAAA,IACA,SAAS2H,GAAI;AACX,aAAO,kCAAkCA;AAAA,IAC1C;AAAA,IACD,SAAS9C,GAAM;AACb,aAAO,+CAA+CA;AAAA,IACvD;AAAA,IACD;AAAA,EACD;AAEH,QAAM+C,IAAU,WACVC,IAAM,OACNC,IAAS;AACf,WAASC,EAAiBnG,GAAOoG,GAAUb,GAASC,GAAgB;AAClE,YAAQxF,EAAM,OAAK;AAAA,MACjB,KAAK;AAAA,MACL,KAAK;AACH,eAAOqG;AAAA,UACLrG;AAAA,UACAoG;AAAA,UACAb;AAAA,UACAC;AAAA,QACD;AAAA,MACH,KAAK;AACH,eAAOc,EAAqBtG,GAAOoG,GAAUb,GAASC,CAAc;AAAA,MACtE,KAAK;AACH,eAAOe;AAAA,UACLvG;AAAA,UACAoG;AAAA,UACAb;AAAA,UACAC;AAAA,QACD;AAAA,IACT;AAAA,EACA;AACE,WAASc,EAAqBtG,GAAOoG,GAAUb,GAASC,GAAgB;AACtE,QAAI,EAAE,OAAAgB,GAAO,WAAAC,EAAS,IAAKzG,GACvB0G,IAAQ1G,EAAM;AAClB,IAAI0G,EAAM,SAASF,EAAM,WAEvB,CAACA,GAAOE,CAAK,IAAI,CAACA,GAAOF,CAAK,GAC9B,CAACjB,GAASC,CAAc,IAAI,CAACA,GAAgBD,CAAO;AAEtD,aAASrE,IAAI,GAAGA,IAAIsF,EAAM,QAAQtF;AAChC,UAAIuF,EAAUvF,CAAC,KAAKwF,EAAMxF,CAAC,MAAMsF,EAAMtF,CAAC,GAAG;AACzC,cAAM+B,IAAOmD,EAAS,OAAO,CAAClF,CAAC,CAAC;AAChC,QAAAqE,EAAQ,KAAK;AAAA,UACX,IAAIS;AAAA,UACJ,MAAA/C;AAAA;AAAA;AAAA,UAGA,OAAO0D,EAAwBD,EAAMxF,CAAC,CAAC;AAAA,QACjD,CAAS,GACDsE,EAAe,KAAK;AAAA,UAClB,IAAIQ;AAAA,UACJ,MAAA/C;AAAA,UACA,OAAO0D,EAAwBH,EAAMtF,CAAC,CAAC;AAAA,QACjD,CAAS;AAAA,MACT;AAEI,aAASA,IAAIsF,EAAM,QAAQtF,IAAIwF,EAAM,QAAQxF,KAAK;AAChD,YAAM+B,IAAOmD,EAAS,OAAO,CAAClF,CAAC,CAAC;AAChC,MAAAqE,EAAQ,KAAK;AAAA,QACX,IAAIU;AAAA,QACJ,MAAAhD;AAAA;AAAA;AAAA,QAGA,OAAO0D,EAAwBD,EAAMxF,CAAC,CAAC;AAAA,MAC/C,CAAO;AAAA,IACP;AACI,aAASA,IAAIwF,EAAM,SAAS,GAAGF,EAAM,UAAUtF,GAAG,EAAEA,GAAG;AACrD,YAAM+B,IAAOmD,EAAS,OAAO,CAAClF,CAAC,CAAC;AAChC,MAAAsE,EAAe,KAAK;AAAA,QAClB,IAAIU;AAAA,QACJ,MAAAjD;AAAA,MACR,CAAO;AAAA,IACP;AAAA,EACA;AACE,WAASoD,EAA4BrG,GAAOoG,GAAUb,GAASC,GAAgB;AAC7E,UAAM,EAAE,OAAAgB,GAAO,OAAAE,EAAK,IAAK1G;AACzB,IAAAP,EAAKO,EAAM,WAAW,CAACH,GAAK+G,MAAkB;AAC5C,YAAMC,IAAY1G,EAAIqG,GAAO3G,CAAG,GAC1Bd,IAAQoB,EAAIuG,GAAO7G,CAAG,GACtBkG,IAAMa,IAAyB3G,EAAIuG,GAAO3G,CAAG,IAAImG,IAAUC,IAArCC;AAC5B,UAAIW,MAAc9H,KAASgH,MAAOC;AAChC;AACF,YAAM/C,IAAOmD,EAAS,OAAOvG,CAAG;AAChC,MAAA0F,EAAQ,KAAKQ,MAAOG,IAAS,EAAE,IAAAH,GAAI,MAAA9C,EAAI,IAAK,EAAE,IAAA8C,GAAI,MAAA9C,GAAM,OAAAlE,EAAK,CAAE,GAC/DyG,EAAe;AAAA,QACbO,MAAOE,IAAM,EAAE,IAAIC,GAAQ,MAAAjD,EAAM,IAAG8C,MAAOG,IAAS,EAAE,IAAID,GAAK,MAAAhD,GAAM,OAAO0D,EAAwBE,CAAS,EAAC,IAAK,EAAE,IAAIb,GAAS,MAAA/C,GAAM,OAAO0D,EAAwBE,CAAS,EAAC;AAAA,MAClL;AAAA,IACP,CAAK;AAAA,EACL;AACE,WAASN,EAAmBvG,GAAOoG,GAAUb,GAASC,GAAgB;AACpE,QAAI,EAAE,OAAAgB,GAAO,OAAAE,EAAK,IAAK1G,GACnBkB,IAAI;AACR,IAAAsF,EAAM,QAAQ,CAACzH,MAAU;AACvB,UAAI,CAAC2H,EAAM,IAAI3H,CAAK,GAAG;AACrB,cAAMkE,IAAOmD,EAAS,OAAO,CAAClF,CAAC,CAAC;AAChC,QAAAqE,EAAQ,KAAK;AAAA,UACX,IAAIW;AAAA,UACJ,MAAAjD;AAAA,UACA,OAAAlE;AAAA,QACV,CAAS,GACDyG,EAAe,QAAQ;AAAA,UACrB,IAAIS;AAAA,UACJ,MAAAhD;AAAA,UACA,OAAAlE;AAAA,QACV,CAAS;AAAA,MACT;AACM,MAAAmC;AAAA,IACN,CAAK,GACDA,IAAI,GACJwF,EAAM,QAAQ,CAAC3H,MAAU;AACvB,UAAI,CAACyH,EAAM,IAAIzH,CAAK,GAAG;AACrB,cAAMkE,IAAOmD,EAAS,OAAO,CAAClF,CAAC,CAAC;AAChC,QAAAqE,EAAQ,KAAK;AAAA,UACX,IAAIU;AAAA,UACJ,MAAAhD;AAAA,UACA,OAAAlE;AAAA,QACV,CAAS,GACDyG,EAAe,QAAQ;AAAA,UACrB,IAAIU;AAAA,UACJ,MAAAjD;AAAA,UACA,OAAAlE;AAAA,QACV,CAAS;AAAA,MACT;AACM,MAAAmC;AAAA,IACN,CAAK;AAAA,EACL;AACE,WAAS4F,EAA4BC,GAAWC,GAAazB,GAASC,GAAgB;AACpF,IAAAD,EAAQ,KAAK;AAAA,MACX,IAAIS;AAAA,MACJ,MAAM,CAAE;AAAA,MACR,OAAOgB,MAAgB/I,IAAU,SAAS+I;AAAA,IAChD,CAAK,GACDxB,EAAe,KAAK;AAAA,MAClB,IAAIQ;AAAA,MACJ,MAAM,CAAE;AAAA,MACR,OAAOe;AAAA,IACb,CAAK;AAAA,EACL;AACE,WAASE,EAAcvE,GAAO6C,GAAS;AACrC,WAAAA,EAAQ,QAAQ,CAACG,MAAU;AACzB,YAAM,EAAE,MAAAzC,GAAM,IAAA8C,EAAE,IAAKL;AACrB,UAAI7E,IAAO6B;AACX,eAASxB,IAAI,GAAGA,IAAI+B,EAAK,SAAS,GAAG/B,KAAK;AACxC,cAAMgG,IAAatH,EAAYiB,CAAI;AACnC,YAAIwE,IAAIpC,EAAK/B,CAAC;AACd,QAAI,OAAOmE,KAAM,YAAY,OAAOA,KAAM,aACxCA,IAAI,KAAKA,KAEN6B,MAAe,KAAkBA,MAAe,OAAmB7B,MAAM,eAAeA,MAAM,kBACjG7G,EAAI,EAAe,GACjB,OAAOqC,KAAS,cAAcwE,MAAM,eACtC7G,EAAI,EAAe,GACrBqC,IAAOV,EAAIU,GAAMwE,CAAC,GACd,OAAOxE,KAAS,YAClBrC,EAAI,IAAiByE,EAAK,KAAK,GAAG,CAAC;AAAA,MAC7C;AACM,YAAMkE,IAAOvH,EAAYiB,CAAI,GACvB9B,IAAQqI,EAAoB1B,EAAM,KAAK,GACvC7F,IAAMoD,EAAKA,EAAK,SAAS,CAAC;AAChC,cAAQ8C,GAAE;AAAA,QACR,KAAKC;AACH,kBAAQmB,GAAI;AAAA,YACV,KAAK;AACH,qBAAOtG,EAAK,IAAIhB,GAAKd,CAAK;AAAA,YAC5B,KAAK;AACH,cAAAP,EAAI,EAAW;AAAA,YACjB;AACE,qBAAOqC,EAAKhB,CAAG,IAAId;AAAA,UACjC;AAAA,QACQ,KAAKkH;AACH,kBAAQkB,GAAI;AAAA,YACV,KAAK;AACH,qBAAOtH,MAAQ,MAAMgB,EAAK,KAAK9B,CAAK,IAAI8B,EAAK,OAAOhB,GAAK,GAAGd,CAAK;AAAA,YACnE,KAAK;AACH,qBAAO8B,EAAK,IAAIhB,GAAKd,CAAK;AAAA,YAC5B,KAAK;AACH,qBAAO8B,EAAK,IAAI9B,CAAK;AAAA,YACvB;AACE,qBAAO8B,EAAKhB,CAAG,IAAId;AAAA,UACjC;AAAA,QACQ,KAAKmH;AACH,kBAAQiB,GAAI;AAAA,YACV,KAAK;AACH,qBAAOtG,EAAK,OAAOhB,GAAK,CAAC;AAAA,YAC3B,KAAK;AACH,qBAAOgB,EAAK,OAAOhB,CAAG;AAAA,YACxB,KAAK;AACH,qBAAOgB,EAAK,OAAO6E,EAAM,KAAK;AAAA,YAChC;AACE,qBAAO,OAAO7E,EAAKhB,CAAG;AAAA,UACpC;AAAA,QACQ;AACE,UAAArB,EAAI,IAAiBuH,CAAE;AAAA,MACjC;AAAA,IACA,CAAK,GACMrD;AAAA,EACX;AACE,WAAS0E,EAAoB1H,GAAK;AAChC,QAAI,CAACV,EAAYU,CAAG;AAClB,aAAOA;AACT,QAAI,MAAM,QAAQA,CAAG;AACnB,aAAOA,EAAI,IAAI0H,CAAmB;AACpC,QAAIjI,EAAMO,CAAG;AACX,aAAO,IAAI;AAAA,QACT,MAAM,KAAKA,EAAI,QAAS,CAAA,EAAE,IAAI,CAAC,CAAC2H,GAAGC,CAAC,MAAM,CAACD,GAAGD,EAAoBE,CAAC,CAAC,CAAC;AAAA,MACtE;AACH,QAAIlI,EAAMM,CAAG;AACX,aAAO,IAAI,IAAI,MAAM,KAAKA,CAAG,EAAE,IAAI0H,CAAmB,CAAC;AACzD,UAAMG,IAAS,OAAO,OAAO1I,EAAea,CAAG,CAAC;AAChD,eAAWG,KAAOH;AAChB,MAAA6H,EAAO1H,CAAG,IAAIuH,EAAoB1H,EAAIG,CAAG,CAAC;AAC5C,WAAII,EAAIP,GAAKxB,CAAS,MACpBqJ,EAAOrJ,CAAS,IAAIwB,EAAIxB,CAAS,IAC5BqJ;AAAA,EACX;AACE,WAASZ,EAAwBjH,GAAK;AACpC,WAAIZ,EAAQY,CAAG,IACN0H,EAAoB1H,CAAG,IAEvBA;AAAA,EACb;AACE,EAAAiC,GAAW,WAAW;AAAA,IACpB,eAAAsF;AAAA,IACA,kBAAAd;AAAA,IACA,6BAAAW;AAAA,EACJ,CAAG;AACH;AA6PA,IAAIU,IAAQ,IAAI1C,GAAQ;AACV0C,EAAM;AACjB,IAACC,KAAqBD,EAAM,mBAAmB;AAAA,EAChDA;AACF;AACoBA,EAAM,cAAc,KAAKA,CAAK;AACpBA,EAAM,wBAAwB,KAAKA,CAAK;AACnE,IAACE,KAAeF,EAAM,aAAa,KAAKA,CAAK;AAC9BA,EAAM,YAAY,KAAKA,CAAK;AAC5BA,EAAM,YAAY,KAAKA,CAAK;","x_google_ignoreList":[0]}
+{"version":3,"file":"immer.es.js","sources":["../../../../../node_modules/immer/dist/immer.mjs"],"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 = typeof e === \"function\" ? 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 getPrototypeOf = Object.getPrototypeOf;\nfunction isDraft(value) {\n  return !!value && !!value[DRAFT_STATE];\n}\nfunction isDraftable(value) {\n  if (!value)\n    return false;\n  return isPlainObject(value) || Array.isArray(value) || !!value[DRAFTABLE] || !!value.constructor?.[DRAFTABLE] || isMap(value) || isSet(value);\n}\nvar objectCtorString = Object.prototype.constructor.toString();\nfunction isPlainObject(value) {\n  if (!value || typeof value !== \"object\")\n    return false;\n  const proto = getPrototypeOf(value);\n  if (proto === null) {\n    return true;\n  }\n  const Ctor = Object.hasOwnProperty.call(proto, \"constructor\") && proto.constructor;\n  if (Ctor === Object)\n    return true;\n  return typeof Ctor == \"function\" && Function.toString.call(Ctor) === objectCtorString;\n}\nfunction original(value) {\n  if (!isDraft(value))\n    die(15, value);\n  return value[DRAFT_STATE].base_;\n}\nfunction each(obj, iter) {\n  if (getArchtype(obj) === 0 /* Object */) {\n    Reflect.ownKeys(obj).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_ : Array.isArray(thing) ? 1 /* Array */ : isMap(thing) ? 2 /* Map */ : isSet(thing) ? 3 /* Set */ : 0 /* Object */;\n}\nfunction has(thing, prop) {\n  return getArchtype(thing) === 2 /* Map */ ? thing.has(prop) : Object.prototype.hasOwnProperty.call(thing, prop);\n}\nfunction get(thing, prop) {\n  return getArchtype(thing) === 2 /* Map */ ? thing.get(prop) : thing[prop];\n}\nfunction set(thing, propOrOldValue, value) {\n  const t = getArchtype(thing);\n  if (t === 2 /* Map */)\n    thing.set(propOrOldValue, value);\n  else if (t === 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}\nfunction isMap(target) {\n  return target instanceof Map;\n}\nfunction isSet(target) {\n  return target instanceof Set;\n}\nfunction latest(state) {\n  return state.copy_ || state.base_;\n}\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 (Array.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 = Object.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 Object.create(getPrototypeOf(base), descriptors);\n  } else {\n    const proto = getPrototypeOf(base);\n    if (proto !== null && isPlain) {\n      return { ...base };\n    }\n    const obj = Object.create(proto);\n    return Object.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    Object.defineProperties(obj, {\n      set: { value: dontMutateFrozenCollections },\n      add: { value: dontMutateFrozenCollections },\n      clear: { value: dontMutateFrozenCollections },\n      delete: { value: dontMutateFrozenCollections }\n    });\n  }\n  Object.freeze(obj);\n  if (deep)\n    Object.values(obj).forEach((value) => freeze(value, true));\n  return obj;\n}\nfunction dontMutateFrozenCollections() {\n  die(2);\n}\nfunction isFrozen(obj) {\n  return Object.isFrozen(obj);\n}\n\n// src/utils/plugins.ts\nvar plugins = {};\nfunction getPlugin(pluginKey) {\n  const plugin = plugins[pluginKey];\n  if (!plugin) {\n    die(0, pluginKey);\n  }\n  return plugin;\n}\nfunction loadPlugin(pluginKey, implementation) {\n  if (!plugins[pluginKey])\n    plugins[pluginKey] = implementation;\n}\n\n// src/core/scope.ts\nvar currentScope;\nfunction getCurrentScope() {\n  return currentScope;\n}\nfunction createScope(parent_, immer_) {\n  return {\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  };\n}\nfunction usePatchesInScope(scope, patchListener) {\n  if (patchListener) {\n    getPlugin(\"Patches\");\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}\nfunction enterScope(immer2) {\n  return currentScope = createScope(currentScope, immer2);\n}\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      if (!scope.parent_)\n        maybeFreeze(scope, result);\n    }\n    if (scope.patches_) {\n      getPlugin(\"Patches\").generateReplacementPatches_(\n        baseDraft[DRAFT_STATE].base_,\n        result,\n        scope.patches_,\n        scope.inversePatches_\n      );\n    }\n  } else {\n    result = finalize(scope, baseDraft, []);\n  }\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, path) {\n  if (isFrozen(value))\n    return value;\n  const state = value[DRAFT_STATE];\n  if (!state) {\n    each(\n      value,\n      (key, childValue) => finalizeProperty(rootScope, state, value, key, childValue, path)\n    );\n    return value;\n  }\n  if (state.scope_ !== rootScope)\n    return value;\n  if (!state.modified_) {\n    maybeFreeze(rootScope, state.base_, true);\n    return state.base_;\n  }\n  if (!state.finalized_) {\n    state.finalized_ = true;\n    state.scope_.unfinalizedDrafts_--;\n    const result = state.copy_;\n    let resultEach = result;\n    let isSet2 = false;\n    if (state.type_ === 3 /* Set */) {\n      resultEach = new Set(result);\n      result.clear();\n      isSet2 = true;\n    }\n    each(\n      resultEach,\n      (key, childValue) => finalizeProperty(rootScope, state, result, key, childValue, path, isSet2)\n    );\n    maybeFreeze(rootScope, result, false);\n    if (path && rootScope.patches_) {\n      getPlugin(\"Patches\").generatePatches_(\n        state,\n        path,\n        rootScope.patches_,\n        rootScope.inversePatches_\n      );\n    }\n  }\n  return state.copy_;\n}\nfunction finalizeProperty(rootScope, parentState, targetObject, prop, childValue, rootPath, targetIsSet) {\n  if (process.env.NODE_ENV !== \"production\" && childValue === targetObject)\n    die(5);\n  if (isDraft(childValue)) {\n    const path = rootPath && parentState && parentState.type_ !== 3 /* Set */ && // Set objects are atomic since they have no keys.\n    !has(parentState.assigned_, prop) ? rootPath.concat(prop) : void 0;\n    const res = finalize(rootScope, childValue, path);\n    set(targetObject, prop, res);\n    if (isDraft(res)) {\n      rootScope.canAutoFreeze_ = false;\n    } else\n      return;\n  } else if (targetIsSet) {\n    targetObject.add(childValue);\n  }\n  if (isDraftable(childValue) && !isFrozen(childValue)) {\n    if (!rootScope.immer_.autoFreeze_ && rootScope.unfinalizedDrafts_ < 1) {\n      return;\n    }\n    finalize(rootScope, childValue);\n    if ((!parentState || !parentState.scope_.parent_) && typeof prop !== \"symbol\" && (isMap(targetObject) ? targetObject.has(prop) : Object.prototype.propertyIsEnumerable.call(targetObject, prop)))\n      maybeFreeze(rootScope, childValue);\n  }\n}\nfunction maybeFreeze(scope, value, deep = false) {\n  if (!scope.parent_ && scope.immer_.autoFreeze_ && scope.canAutoFreeze_) {\n    freeze(value, deep);\n  }\n}\n\n// src/core/proxy.ts\nfunction createProxyProxy(base, parent) {\n  const isArray = Array.isArray(base);\n  const state = {\n    type_: isArray ? 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    assigned_: {},\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  };\n  let target = state;\n  let traps = objectTraps;\n  if (isArray) {\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;\n}\nvar objectTraps = {\n  get(state, prop) {\n    if (prop === DRAFT_STATE)\n      return state;\n    const source = latest(state);\n    if (!has(source, prop)) {\n      return readPropFromProto(state, source, prop);\n    }\n    const value = source[prop];\n    if (state.finalized_ || !isDraftable(value)) {\n      return value;\n    }\n    if (value === peek(state.base_, prop)) {\n      prepareCopy(state);\n      return state.copy_[prop] = createProxy(value, state);\n    }\n    return value;\n  },\n  has(state, prop) {\n    return prop in latest(state);\n  },\n  ownKeys(state) {\n    return Reflect.ownKeys(latest(state));\n  },\n  set(state, prop, value) {\n    const desc = getDescriptorFromProto(latest(state), prop);\n    if (desc?.set) {\n      desc.set.call(state.draft_, value);\n      return true;\n    }\n    if (!state.modified_) {\n      const current2 = peek(latest(state), prop);\n      const currentState = current2?.[DRAFT_STATE];\n      if (currentState && currentState.base_ === value) {\n        state.copy_[prop] = value;\n        state.assigned_[prop] = false;\n        return true;\n      }\n      if (is(value, current2) && (value !== void 0 || has(state.base_, prop)))\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_[prop] = true;\n    return true;\n  },\n  deleteProperty(state, prop) {\n    if (peek(state.base_, prop) !== void 0 || prop in state.base_) {\n      state.assigned_[prop] = false;\n      prepareCopy(state);\n      markChanged(state);\n    } else {\n      delete state.assigned_[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 = {};\neach(objectTraps, (key, fn) => {\n  arrayTraps[key] = function() {\n    arguments[0] = arguments[0][0];\n    return fn.apply(this, arguments);\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.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    /**\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 (typeof base === \"function\" && typeof recipe !== \"function\") {\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 (typeof recipe !== \"function\")\n        die(6);\n      if (patchListener !== void 0 && typeof patchListener !== \"function\")\n        die(7);\n      let result;\n      if (isDraftable(base)) {\n        const scope = enterScope(this);\n        const proxy = createProxy(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 || typeof base !== \"object\") {\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(\"Patches\").generateReplacementPatches_(base, result, p, ip);\n          patchListener(p, ip);\n        }\n        return result;\n      } else\n        die(1, base);\n    };\n    this.produceWithPatches = (base, recipe) => {\n      if (typeof base === \"function\") {\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 (typeof config?.autoFreeze === \"boolean\")\n      this.setAutoFreeze(config.autoFreeze);\n    if (typeof config?.useStrictShallowCopy === \"boolean\")\n      this.setUseStrictShallowCopy(config.useStrictShallowCopy);\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(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  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(\"Patches\").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(value, parent) {\n  const draft = isMap(value) ? getPlugin(\"MapSet\").proxyMap_(value, parent) : isSet(value) ? getPlugin(\"MapSet\").proxySet_(value, parent) : createProxyProxy(value, parent);\n  const scope = parent ? parent.scope_ : getCurrentScope();\n  scope.drafts_.push(draft);\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  if (state) {\n    if (!state.modified_)\n      return state.base_;\n    state.finalized_ = true;\n    copy = shallowCopy(value, state.scope_.immer_.useStrictShallowCopy_);\n  } else {\n    copy = shallowCopy(value, true);\n  }\n  each(copy, (key, childValue) => {\n    set(copy, key, currentImpl(childValue));\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  const REPLACE = \"replace\";\n  const ADD = \"add\";\n  const REMOVE = \"remove\";\n  function generatePatches_(state, basePath, patches, inversePatches) {\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(state, basePath, patches, inversePatches);\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    for (let i = 0; i < base_.length; i++) {\n      if (assigned_[i] && copy_[i] !== base_[i]) {\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(copy_[i])\n        });\n        inversePatches.push({\n          op: REPLACE,\n          path,\n          value: clonePatchValueIfNeeded(base_[i])\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_ } = state;\n    each(state.assigned_, (key, assignedValue) => {\n      const origValue = get(base_, key);\n      const value = get(copy_, key);\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(op === REMOVE ? { op, path } : { op, path, value });\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, patches, inversePatches) {\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 (typeof base === \"function\" && p === \"prototype\")\n          die(errorOffset + 3);\n        base = get(base, p);\n        if (typeof base !== \"object\")\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 (Array.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(\"Patches\", {\n    applyPatches_,\n    generatePatches_,\n    generateReplacementPatches_\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      };\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      }\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(value, state);\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    return new DraftMap(target, parent);\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      };\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      }\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    return new DraftSet(target, parent);\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(value, state);\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  loadPlugin(\"MapSet\", { proxyMap_, proxySet_ });\n}\n\n// src/immer.ts\nvar immer = new Immer2();\nvar produce = immer.produce;\nvar produceWithPatches = /* @__PURE__ */ immer.produceWithPatches.bind(\n  immer\n);\nvar setAutoFreeze = /* @__PURE__ */ immer.setAutoFreeze.bind(immer);\nvar setUseStrictShallowCopy = /* @__PURE__ */ immer.setUseStrictShallowCopy.bind(\n  immer\n);\nvar applyPatches = /* @__PURE__ */ immer.applyPatches.bind(immer);\nvar createDraft = /* @__PURE__ */ immer.createDraft.bind(immer);\nvar finishDraft = /* @__PURE__ */ immer.finishDraft.bind(immer);\nfunction castDraft(value) {\n  return value;\n}\nfunction castImmutable(value) {\n  return value;\n}\nexport {\n  Immer2 as Immer,\n  applyPatches,\n  castDraft,\n  castImmutable,\n  createDraft,\n  current,\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  setUseStrictShallowCopy\n};\n//# sourceMappingURL=immer.mjs.map"],"names":["NOTHING","DRAFTABLE","DRAFT_STATE","errors","plugin","thing","data","die","error","args","e","msg","getPrototypeOf","isDraft","value","isDraftable","_a","isPlainObject","isMap","isSet","objectCtorString","proto","Ctor","original","each","obj","iter","getArchtype","key","entry","index","state","has","prop","get","set","propOrOldValue","t","is","x","y","target","latest","shallowCopy","base","strict","isPlain","descriptors","keys","i","desc","freeze","deep","isFrozen","dontMutateFrozenCollections","plugins","getPlugin","pluginKey","loadPlugin","implementation","currentScope","getCurrentScope","createScope","parent_","immer_","usePatchesInScope","scope","patchListener","revokeScope","leaveScope","revokeDraft","enterScope","immer2","draft","processResult","result","baseDraft","finalize","maybeFreeze","rootScope","path","childValue","finalizeProperty","resultEach","isSet2","parentState","targetObject","rootPath","targetIsSet","res","createProxyProxy","parent","isArray","traps","objectTraps","arrayTraps","revoke","proxy","source","readPropFromProto","peek","prepareCopy","createProxy","getDescriptorFromProto","current2","currentState","markChanged","owner","fn","Immer2","config","recipe","defaultBase","self","base2","hasError","p","ip","patches","inversePatches","current","patch","applyPatchesImpl","currentImpl","copy","enablePatches","op","REPLACE","ADD","REMOVE","generatePatches_","basePath","generatePatchesFromAssigned","generateArrayPatches","generateSetPatches","base_","assigned_","copy_","clonePatchValueIfNeeded","assignedValue","origValue","generateReplacementPatches_","baseValue","replacement","applyPatches_","parentType","type","deepClonePatchValue","k","v","cloned","immer","produceWithPatches","applyPatches"],"mappings":"AACG,IAACA,IAAU,OAAO,IAAI,eAAe,GACpCC,IAAY,OAAO,IAAI,iBAAiB,GACxCC,IAAc,OAAO,IAAI,aAAa,GAGtCC,KAAS,QAAQ,IAAI,aAAa,eAAe;AAAA;AAAA,EAEnD,SAASC,GAAQ;AACf,WAAO,mBAAmBA,CAAM,mFAAmFA,CAAM;AAAA,EAC1H;AAAA,EACD,SAASC,GAAO;AACd,WAAO,sJAAsJA,CAAK;AAAA,EACnK;AAAA,EACD;AAAA,EACA,SAASC,GAAM;AACb,WAAO,yHAAyHA;AAAA,EACjI;AAAA,EACD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAASD,GAAO;AACd,WAAO,mCAAmCA,CAAK;AAAA,EAChD;AAAA,EACD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAASA,GAAO;AACd,WAAO,oCAAoCA,CAAK;AAAA,EACpD;AAAA;AAAA;AAGA,IAAI,CAAE;AACN,SAASE,EAAIC,MAAUC,GAAM;AAC3B,MAAI,QAAQ,IAAI,aAAa,cAAc;AACzC,UAAMC,IAAIP,GAAOK,CAAK,GAChBG,IAAM,OAAOD,KAAM,aAAaA,EAAE,MAAM,MAAMD,CAAI,IAAIC;AAC5D,UAAM,IAAI,MAAM,WAAWC,CAAG,EAAE;AAAA,EACpC;AACE,QAAM,IAAI;AAAA,IACR,8BAA8BH,CAAK;AAAA,EACpC;AACH;AAGA,IAAII,IAAiB,OAAO;AAC5B,SAASC,EAAQC,GAAO;AACtB,SAAO,CAAC,CAACA,KAAS,CAAC,CAACA,EAAMZ,CAAW;AACvC;AACA,SAASa,EAAYD,GAAO;AArD5B,MAAAE;AAsDE,SAAKF,IAEEG,GAAcH,CAAK,KAAK,MAAM,QAAQA,CAAK,KAAK,CAAC,CAACA,EAAMb,CAAS,KAAK,CAAC,GAACe,IAAAF,EAAM,gBAAN,QAAAE,EAAoBf,OAAciB,EAAMJ,CAAK,KAAKK,EAAML,CAAK,IADnI;AAEX;AACA,IAAIM,KAAmB,OAAO,UAAU,YAAY,SAAU;AAC9D,SAASH,GAAcH,GAAO;AAC5B,MAAI,CAACA,KAAS,OAAOA,KAAU;AAC7B,WAAO;AACT,QAAMO,IAAQT,EAAeE,CAAK;AAClC,MAAIO,MAAU;AACZ,WAAO;AAET,QAAMC,IAAO,OAAO,eAAe,KAAKD,GAAO,aAAa,KAAKA,EAAM;AACvE,SAAIC,MAAS,SACJ,KACF,OAAOA,KAAQ,cAAc,SAAS,SAAS,KAAKA,CAAI,MAAMF;AACvE;AACA,SAASG,GAAST,GAAO;AACvB,SAAKD,EAAQC,CAAK,KAChBP,EAAI,IAAIO,CAAK,GACRA,EAAMZ,CAAW,EAAE;AAC5B;AACA,SAASsB,EAAKC,GAAKC,GAAM;AACvB,EAAIC,EAAYF,CAAG,MAAM,IACvB,QAAQ,QAAQA,CAAG,EAAE,QAAQ,CAACG,MAAQ;AACpC,IAAAF,EAAKE,GAAKH,EAAIG,CAAG,GAAGH,CAAG;AAAA,EAC7B,CAAK,IAEDA,EAAI,QAAQ,CAACI,GAAOC,MAAUJ,EAAKI,GAAOD,GAAOJ,CAAG,CAAC;AAEzD;AACA,SAASE,EAAYtB,GAAO;AAC1B,QAAM0B,IAAQ1B,EAAMH,CAAW;AAC/B,SAAO6B,IAAQA,EAAM,QAAQ,MAAM,QAAQ1B,CAAK,IAAI,IAAgBa,EAAMb,CAAK,IAAI,IAAcc,EAAMd,CAAK,IAAI,IAAc;AAChI;AACA,SAAS2B,EAAI3B,GAAO4B,GAAM;AACxB,SAAON,EAAYtB,CAAK,MAAM,IAAcA,EAAM,IAAI4B,CAAI,IAAI,OAAO,UAAU,eAAe,KAAK5B,GAAO4B,CAAI;AAChH;AACA,SAASC,EAAI7B,GAAO4B,GAAM;AACxB,SAAON,EAAYtB,CAAK,MAAM,IAAcA,EAAM,IAAI4B,CAAI,IAAI5B,EAAM4B,CAAI;AAC1E;AACA,SAASE,GAAI9B,GAAO+B,GAAgBtB,GAAO;AACzC,QAAMuB,IAAIV,EAAYtB,CAAK;AAC3B,EAAIgC,MAAM,IACRhC,EAAM,IAAI+B,GAAgBtB,CAAK,IACxBuB,MAAM,IACbhC,EAAM,IAAIS,CAAK,IAEfT,EAAM+B,CAAc,IAAItB;AAC5B;AACA,SAASwB,GAAGC,GAAGC,GAAG;AAChB,SAAID,MAAMC,IACDD,MAAM,KAAK,IAAIA,MAAM,IAAIC,IAEzBD,MAAMA,KAAKC,MAAMA;AAE5B;AACA,SAAStB,EAAMuB,GAAQ;AACrB,SAAOA,aAAkB;AAC3B;AACA,SAAStB,EAAMsB,GAAQ;AACrB,SAAOA,aAAkB;AAC3B;AACA,SAASC,EAAOX,GAAO;AACrB,SAAOA,EAAM,SAASA,EAAM;AAC9B;AACA,SAASY,EAAYC,GAAMC,GAAQ;AACjC,MAAI3B,EAAM0B,CAAI;AACZ,WAAO,IAAI,IAAIA,CAAI;AAErB,MAAIzB,EAAMyB,CAAI;AACZ,WAAO,IAAI,IAAIA,CAAI;AAErB,MAAI,MAAM,QAAQA,CAAI;AACpB,WAAO,MAAM,UAAU,MAAM,KAAKA,CAAI;AACxC,QAAME,IAAU7B,GAAc2B,CAAI;AAClC,MAAIC,MAAW,MAAQA,MAAW,gBAAgB,CAACC,GAAS;AAC1D,UAAMC,IAAc,OAAO,0BAA0BH,CAAI;AACzD,WAAOG,EAAY7C,CAAW;AAC9B,QAAI8C,IAAO,QAAQ,QAAQD,CAAW;AACtC,aAASE,IAAI,GAAGA,IAAID,EAAK,QAAQC,KAAK;AACpC,YAAMrB,IAAMoB,EAAKC,CAAC,GACZC,IAAOH,EAAYnB,CAAG;AAC5B,MAAIsB,EAAK,aAAa,OACpBA,EAAK,WAAW,IAChBA,EAAK,eAAe,MAElBA,EAAK,OAAOA,EAAK,SACnBH,EAAYnB,CAAG,IAAI;AAAA,QACjB,cAAc;AAAA,QACd,UAAU;AAAA;AAAA,QAEV,YAAYsB,EAAK;AAAA,QACjB,OAAON,EAAKhB,CAAG;AAAA,MAChB;AAAA,IACT;AACI,WAAO,OAAO,OAAOhB,EAAegC,CAAI,GAAGG,CAAW;AAAA,EAC1D,OAAS;AACL,UAAM1B,IAAQT,EAAegC,CAAI;AACjC,QAAIvB,MAAU,QAAQyB;AACpB,aAAO,EAAE,GAAGF,EAAM;AAEpB,UAAMnB,IAAM,OAAO,OAAOJ,CAAK;AAC/B,WAAO,OAAO,OAAOI,GAAKmB,CAAI;AAAA,EAClC;AACA;AACA,SAASO,GAAO1B,GAAK2B,IAAO,IAAO;AACjC,SAAIC,EAAS5B,CAAG,KAAKZ,EAAQY,CAAG,KAAK,CAACV,EAAYU,CAAG,MAEjDE,EAAYF,CAAG,IAAI,KACrB,OAAO,iBAAiBA,GAAK;AAAA,IAC3B,KAAK,EAAE,OAAO6B,EAA6B;AAAA,IAC3C,KAAK,EAAE,OAAOA,EAA6B;AAAA,IAC3C,OAAO,EAAE,OAAOA,EAA6B;AAAA,IAC7C,QAAQ,EAAE,OAAOA,EAA2B;AAAA,EAClD,CAAK,GAEH,OAAO,OAAO7B,CAAG,GACb2B,KACF,OAAO,OAAO3B,CAAG,EAAE,QAAQ,CAACX,MAAUqC,GAAOrC,GAAO,EAAI,CAAC,IACpDW;AACT;AACA,SAAS6B,IAA8B;AACrC,EAAA/C,EAAI,CAAC;AACP;AACA,SAAS8C,EAAS5B,GAAK;AACrB,SAAO,OAAO,SAASA,CAAG;AAC5B;AAGA,IAAI8B,IAAU,CAAE;AAChB,SAASC,EAAUC,GAAW;AAC5B,QAAMrD,IAASmD,EAAQE,CAAS;AAChC,SAAKrD,KACHG,EAAI,GAAGkD,CAAS,GAEXrD;AACT;AACA,SAASsD,GAAWD,GAAWE,GAAgB;AAC7C,EAAKJ,EAAQE,CAAS,MACpBF,EAAQE,CAAS,IAAIE;AACzB;AAGA,IAAIC;AACJ,SAASC,KAAkB;AACzB,SAAOD;AACT;AACA,SAASE,GAAYC,GAASC,GAAQ;AACpC,SAAO;AAAA,IACL,SAAS,CAAE;AAAA,IACX,SAAAD;AAAA,IACA,QAAAC;AAAA;AAAA;AAAA,IAGA,gBAAgB;AAAA,IAChB,oBAAoB;AAAA,EACrB;AACH;AACA,SAASC,GAAkBC,GAAOC,GAAe;AAC/C,EAAIA,MACFX,EAAU,SAAS,GACnBU,EAAM,WAAW,CAAE,GACnBA,EAAM,kBAAkB,CAAE,GAC1BA,EAAM,iBAAiBC;AAE3B;AACA,SAASC,EAAYF,GAAO;AAC1B,EAAAG,EAAWH,CAAK,GAChBA,EAAM,QAAQ,QAAQI,EAAW,GACjCJ,EAAM,UAAU;AAClB;AACA,SAASG,EAAWH,GAAO;AACzB,EAAIA,MAAUN,MACZA,IAAeM,EAAM;AAEzB;AACA,SAASK,GAAWC,GAAQ;AAC1B,SAAOZ,IAAeE,GAAYF,GAAcY,CAAM;AACxD;AACA,SAASF,GAAYG,GAAO;AAC1B,QAAM1C,IAAQ0C,EAAMvE,CAAW;AAC/B,EAAI6B,EAAM,UAAU,KAAkBA,EAAM,UAAU,IACpDA,EAAM,QAAS,IAEfA,EAAM,WAAW;AACrB;AAGA,SAAS2C,GAAcC,GAAQT,GAAO;AACpC,EAAAA,EAAM,qBAAqBA,EAAM,QAAQ;AACzC,QAAMU,IAAYV,EAAM,QAAQ,CAAC;AAEjC,SADmBS,MAAW,UAAUA,MAAWC,KAE7CA,EAAU1E,CAAW,EAAE,cACzBkE,EAAYF,CAAK,GACjB3D,EAAI,CAAC,IAEHQ,EAAY4D,CAAM,MACpBA,IAASE,EAASX,GAAOS,CAAM,GAC1BT,EAAM,WACTY,EAAYZ,GAAOS,CAAM,IAEzBT,EAAM,YACRV,EAAU,SAAS,EAAE;AAAA,IACnBoB,EAAU1E,CAAW,EAAE;AAAA,IACvByE;AAAA,IACAT,EAAM;AAAA,IACNA,EAAM;AAAA,EACP,KAGHS,IAASE,EAASX,GAAOU,GAAW,CAAA,CAAE,GAExCR,EAAYF,CAAK,GACbA,EAAM,YACRA,EAAM,eAAeA,EAAM,UAAUA,EAAM,eAAe,GAErDS,MAAW3E,IAAU2E,IAAS;AACvC;AACA,SAASE,EAASE,GAAWjE,GAAOkE,GAAM;AACxC,MAAI3B,EAASvC,CAAK;AAChB,WAAOA;AACT,QAAMiB,IAAQjB,EAAMZ,CAAW;AAC/B,MAAI,CAAC6B;AACH,WAAAP;AAAA,MACEV;AAAA,MACA,CAACc,GAAKqD,MAAeC,GAAiBH,GAAWhD,GAAOjB,GAAOc,GAAKqD,GAAYD,CAAI;AAAA,IACrF,GACMlE;AAET,MAAIiB,EAAM,WAAWgD;AACnB,WAAOjE;AACT,MAAI,CAACiB,EAAM;AACT,WAAA+C,EAAYC,GAAWhD,EAAM,OAAO,EAAI,GACjCA,EAAM;AAEf,MAAI,CAACA,EAAM,YAAY;AACrB,IAAAA,EAAM,aAAa,IACnBA,EAAM,OAAO;AACb,UAAM4C,IAAS5C,EAAM;AACrB,QAAIoD,IAAaR,GACbS,IAAS;AACb,IAAIrD,EAAM,UAAU,MAClBoD,IAAa,IAAI,IAAIR,CAAM,GAC3BA,EAAO,MAAO,GACdS,IAAS,KAEX5D;AAAA,MACE2D;AAAA,MACA,CAACvD,GAAKqD,MAAeC,GAAiBH,GAAWhD,GAAO4C,GAAQ/C,GAAKqD,GAAYD,GAAMI,CAAM;AAAA,IAC9F,GACDN,EAAYC,GAAWJ,GAAQ,EAAK,GAChCK,KAAQD,EAAU,YACpBvB,EAAU,SAAS,EAAE;AAAA,MACnBzB;AAAA,MACAiD;AAAA,MACAD,EAAU;AAAA,MACVA,EAAU;AAAA,IACX;AAAA,EAEP;AACE,SAAOhD,EAAM;AACf;AACA,SAASmD,GAAiBH,GAAWM,GAAaC,GAAcrD,GAAMgD,GAAYM,GAAUC,GAAa;AAGvG,MAFI,QAAQ,IAAI,aAAa,gBAAgBP,MAAeK,KAC1D/E,EAAI,CAAC,GACHM,EAAQoE,CAAU,GAAG;AACvB,UAAMD,IAAOO,KAAYF,KAAeA,EAAY,UAAU;AAAA,IAC9D,CAACrD,EAAIqD,EAAY,WAAWpD,CAAI,IAAIsD,EAAS,OAAOtD,CAAI,IAAI,QACtDwD,IAAMZ,EAASE,GAAWE,GAAYD,CAAI;AAEhD,QADA7C,GAAImD,GAAcrD,GAAMwD,CAAG,GACvB5E,EAAQ4E,CAAG;AACb,MAAAV,EAAU,iBAAiB;AAAA;AAE3B;AAAA,EACH,MAAM,CAAIS,KACTF,EAAa,IAAIL,CAAU;AAE7B,MAAIlE,EAAYkE,CAAU,KAAK,CAAC5B,EAAS4B,CAAU,GAAG;AACpD,QAAI,CAACF,EAAU,OAAO,eAAeA,EAAU,qBAAqB;AAClE;AAEF,IAAAF,EAASE,GAAWE,CAAU,IACzB,CAACI,KAAe,CAACA,EAAY,OAAO,YAAY,OAAOpD,KAAS,aAAaf,EAAMoE,CAAY,IAAIA,EAAa,IAAIrD,CAAI,IAAI,OAAO,UAAU,qBAAqB,KAAKqD,GAAcrD,CAAI,MAC5L6C,EAAYC,GAAWE,CAAU;AAAA,EACvC;AACA;AACA,SAASH,EAAYZ,GAAOpD,GAAOsC,IAAO,IAAO;AAC/C,EAAI,CAACc,EAAM,WAAWA,EAAM,OAAO,eAAeA,EAAM,kBACtDf,GAAOrC,GAAOsC,CAAI;AAEtB;AAGA,SAASsC,GAAiB9C,GAAM+C,GAAQ;AACtC,QAAMC,IAAU,MAAM,QAAQhD,CAAI,GAC5Bb,IAAQ;AAAA,IACZ,OAAO6D,IAAU,IAAgB;AAAA;AAAA,IAEjC,QAAQD,IAASA,EAAO,SAAS9B,GAAiB;AAAA;AAAA,IAElD,WAAW;AAAA;AAAA,IAEX,YAAY;AAAA;AAAA,IAEZ,WAAW,CAAE;AAAA;AAAA,IAEb,SAAS8B;AAAA;AAAA,IAET,OAAO/C;AAAA;AAAA,IAEP,QAAQ;AAAA;AAAA;AAAA,IAGR,OAAO;AAAA;AAAA,IAEP,SAAS;AAAA,IACT,WAAW;AAAA,EACZ;AACD,MAAIH,IAASV,GACT8D,IAAQC;AACZ,EAAIF,MACFnD,IAAS,CAACV,CAAK,GACf8D,IAAQE;AAEV,QAAM,EAAE,QAAAC,GAAQ,OAAAC,EAAO,IAAG,MAAM,UAAUxD,GAAQoD,CAAK;AACvD,SAAA9D,EAAM,SAASkE,GACflE,EAAM,UAAUiE,GACTC;AACT;AACA,IAAIH,KAAc;AAAA,EAChB,IAAI/D,GAAOE,GAAM;AACf,QAAIA,MAAS/B;AACX,aAAO6B;AACT,UAAMmE,IAASxD,EAAOX,CAAK;AAC3B,QAAI,CAACC,EAAIkE,GAAQjE,CAAI;AACnB,aAAOkE,GAAkBpE,GAAOmE,GAAQjE,CAAI;AAE9C,UAAMnB,IAAQoF,EAAOjE,CAAI;AACzB,WAAIF,EAAM,cAAc,CAAChB,EAAYD,CAAK,IACjCA,IAELA,MAAUsF,EAAKrE,EAAM,OAAOE,CAAI,KAClCoE,EAAYtE,CAAK,GACVA,EAAM,MAAME,CAAI,IAAIqE,EAAYxF,GAAOiB,CAAK,KAE9CjB;AAAA,EACR;AAAA,EACD,IAAIiB,GAAOE,GAAM;AACf,WAAOA,KAAQS,EAAOX,CAAK;AAAA,EAC5B;AAAA,EACD,QAAQA,GAAO;AACb,WAAO,QAAQ,QAAQW,EAAOX,CAAK,CAAC;AAAA,EACrC;AAAA,EACD,IAAIA,GAAOE,GAAMnB,GAAO;AACtB,UAAMoC,IAAOqD,GAAuB7D,EAAOX,CAAK,GAAGE,CAAI;AACvD,QAAIiB,KAAA,QAAAA,EAAM;AACR,aAAAA,EAAK,IAAI,KAAKnB,EAAM,QAAQjB,CAAK,GAC1B;AAET,QAAI,CAACiB,EAAM,WAAW;AACpB,YAAMyE,IAAWJ,EAAK1D,EAAOX,CAAK,GAAGE,CAAI,GACnCwE,IAAeD,KAAA,gBAAAA,EAAWtG;AAChC,UAAIuG,KAAgBA,EAAa,UAAU3F;AACzC,eAAAiB,EAAM,MAAME,CAAI,IAAInB,GACpBiB,EAAM,UAAUE,CAAI,IAAI,IACjB;AAET,UAAIK,GAAGxB,GAAO0F,CAAQ,MAAM1F,MAAU,UAAUkB,EAAID,EAAM,OAAOE,CAAI;AACnE,eAAO;AACT,MAAAoE,EAAYtE,CAAK,GACjB2E,EAAY3E,CAAK;AAAA,IACvB;AACI,WAAIA,EAAM,MAAME,CAAI,MAAMnB;AAAA,KACzBA,MAAU,UAAUmB,KAAQF,EAAM;AAAA,IACnC,OAAO,MAAMjB,CAAK,KAAK,OAAO,MAAMiB,EAAM,MAAME,CAAI,CAAC,MAErDF,EAAM,MAAME,CAAI,IAAInB,GACpBiB,EAAM,UAAUE,CAAI,IAAI,KACjB;AAAA,EACR;AAAA,EACD,eAAeF,GAAOE,GAAM;AAC1B,WAAImE,EAAKrE,EAAM,OAAOE,CAAI,MAAM,UAAUA,KAAQF,EAAM,SACtDA,EAAM,UAAUE,CAAI,IAAI,IACxBoE,EAAYtE,CAAK,GACjB2E,EAAY3E,CAAK,KAEjB,OAAOA,EAAM,UAAUE,CAAI,GAEzBF,EAAM,SACR,OAAOA,EAAM,MAAME,CAAI,GAElB;AAAA,EACR;AAAA;AAAA;AAAA,EAGD,yBAAyBF,GAAOE,GAAM;AACpC,UAAM0E,IAAQjE,EAAOX,CAAK,GACpBmB,IAAO,QAAQ,yBAAyByD,GAAO1E,CAAI;AACzD,WAAKiB,KAEE;AAAA,MACL,UAAU;AAAA,MACV,cAAcnB,EAAM,UAAU,KAAiBE,MAAS;AAAA,MACxD,YAAYiB,EAAK;AAAA,MACjB,OAAOyD,EAAM1E,CAAI;AAAA,IAClB;AAAA,EACF;AAAA,EACD,iBAAiB;AACf,IAAA1B,EAAI,EAAE;AAAA,EACP;AAAA,EACD,eAAewB,GAAO;AACpB,WAAOnB,EAAemB,EAAM,KAAK;AAAA,EAClC;AAAA,EACD,iBAAiB;AACf,IAAAxB,EAAI,EAAE;AAAA,EACV;AACA,GACIwF,IAAa,CAAE;AACnBvE,EAAKsE,IAAa,CAAClE,GAAKgF,MAAO;AAC7B,EAAAb,EAAWnE,CAAG,IAAI,WAAW;AAC3B,qBAAU,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC,GACtBgF,EAAG,MAAM,MAAM,SAAS;AAAA,EAChC;AACH,CAAC;AACDb,EAAW,iBAAiB,SAAShE,GAAOE,GAAM;AAChD,SAAI,QAAQ,IAAI,aAAa,gBAAgB,MAAM,SAASA,CAAI,CAAC,KAC/D1B,EAAI,EAAE,GACDwF,EAAW,IAAI,KAAK,MAAMhE,GAAOE,GAAM,MAAM;AACtD;AACA8D,EAAW,MAAM,SAAShE,GAAOE,GAAMnB,GAAO;AAC5C,SAAI,QAAQ,IAAI,aAAa,gBAAgBmB,MAAS,YAAY,MAAM,SAASA,CAAI,CAAC,KACpF1B,EAAI,EAAE,GACDuF,GAAY,IAAI,KAAK,MAAM/D,EAAM,CAAC,GAAGE,GAAMnB,GAAOiB,EAAM,CAAC,CAAC;AACnE;AACA,SAASqE,EAAK3B,GAAOxC,GAAM;AACzB,QAAMF,IAAQ0C,EAAMvE,CAAW;AAE/B,UADe6B,IAAQW,EAAOX,CAAK,IAAI0C,GACzBxC,CAAI;AACpB;AACA,SAASkE,GAAkBpE,GAAOmE,GAAQjE,GAAM;AA/ehD,MAAAjB;AAgfE,QAAMkC,IAAOqD,GAAuBL,GAAQjE,CAAI;AAChD,SAAOiB,IAAO,WAAWA,IAAOA,EAAK;AAAA;AAAA;AAAA,KAGnClC,IAAAkC,EAAK,QAAL,gBAAAlC,EAAU,KAAKe,EAAM;AAAA,MACnB;AACN;AACA,SAASwE,GAAuBL,GAAQjE,GAAM;AAC5C,MAAI,EAAEA,KAAQiE;AACZ;AACF,MAAI7E,IAAQT,EAAesF,CAAM;AACjC,SAAO7E,KAAO;AACZ,UAAM6B,IAAO,OAAO,yBAAyB7B,GAAOY,CAAI;AACxD,QAAIiB;AACF,aAAOA;AACT,IAAA7B,IAAQT,EAAeS,CAAK;AAAA,EAChC;AAEA;AACA,SAASqF,EAAY3E,GAAO;AAC1B,EAAKA,EAAM,cACTA,EAAM,YAAY,IACdA,EAAM,WACR2E,EAAY3E,EAAM,OAAO;AAG/B;AACA,SAASsE,EAAYtE,GAAO;AAC1B,EAAKA,EAAM,UACTA,EAAM,QAAQY;AAAA,IACZZ,EAAM;AAAA,IACNA,EAAM,OAAO,OAAO;AAAA,EACrB;AAEL;AAGG,IAAC8E,KAAS,MAAM;AAAA,EACjB,YAAYC,GAAQ;AAClB,SAAK,cAAc,IACnB,KAAK,wBAAwB,IAoB7B,KAAK,UAAU,CAAClE,GAAMmE,GAAQ5C,MAAkB;AAC9C,UAAI,OAAOvB,KAAS,cAAc,OAAOmE,KAAW,YAAY;AAC9D,cAAMC,IAAcD;AACpB,QAAAA,IAASnE;AACT,cAAMqE,IAAO;AACb,eAAO,SAAwBC,IAAQF,MAAgBvG,GAAM;AAC3D,iBAAOwG,EAAK,QAAQC,GAAO,CAACzC,MAAUsC,EAAO,KAAK,MAAMtC,GAAO,GAAGhE,CAAI,CAAC;AAAA,QACxE;AAAA,MACT;AACM,MAAI,OAAOsG,KAAW,cACpBxG,EAAI,CAAC,GACH4D,MAAkB,UAAU,OAAOA,KAAkB,cACvD5D,EAAI,CAAC;AACP,UAAIoE;AACJ,UAAI5D,EAAY6B,CAAI,GAAG;AACrB,cAAMsB,IAAQK,GAAW,IAAI,GACvB0B,IAAQK,EAAY1D,GAAM,MAAM;AACtC,YAAIuE,IAAW;AACf,YAAI;AACF,UAAAxC,IAASoC,EAAOd,CAAK,GACrBkB,IAAW;AAAA,QACrB,UAAkB;AACR,UAAIA,IACF/C,EAAYF,CAAK,IAEjBG,EAAWH,CAAK;AAAA,QAC5B;AACQ,eAAAD,GAAkBC,GAAOC,CAAa,GAC/BO,GAAcC,GAAQT,CAAK;AAAA,MACnC,WAAU,CAACtB,KAAQ,OAAOA,KAAS,UAAU;AAQ5C,YAPA+B,IAASoC,EAAOnE,CAAI,GAChB+B,MAAW,WACbA,IAAS/B,IACP+B,MAAW3E,MACb2E,IAAS,SACP,KAAK,eACPxB,GAAOwB,GAAQ,EAAI,GACjBR,GAAe;AACjB,gBAAMiD,IAAI,CAAE,GACNC,IAAK,CAAE;AACb,UAAA7D,EAAU,SAAS,EAAE,4BAA4BZ,GAAM+B,GAAQyC,GAAGC,CAAE,GACpElD,EAAciD,GAAGC,CAAE;AAAA,QAC7B;AACQ,eAAO1C;AAAA,MACR;AACC,QAAApE,EAAI,GAAGqC,CAAI;AAAA,IACd,GACD,KAAK,qBAAqB,CAACA,GAAMmE,MAAW;AAC1C,UAAI,OAAOnE,KAAS;AAClB,eAAO,CAACb,MAAUtB,MAAS,KAAK,mBAAmBsB,GAAO,CAAC0C,MAAU7B,EAAK6B,GAAO,GAAGhE,CAAI,CAAC;AAE3F,UAAI6G,GAASC;AAKb,aAAO,CAJQ,KAAK,QAAQ3E,GAAMmE,GAAQ,CAACK,GAAGC,MAAO;AACnD,QAAAC,IAAUF,GACVG,IAAiBF;AAAA,MACzB,CAAO,GACeC,GAASC,CAAc;AAAA,IACxC,GACG,QAAOT,KAAA,gBAAAA,EAAQ,eAAe,aAChC,KAAK,cAAcA,EAAO,UAAU,GAClC,QAAOA,KAAA,gBAAAA,EAAQ,yBAAyB,aAC1C,KAAK,wBAAwBA,EAAO,oBAAoB;AAAA,EAC9D;AAAA,EACE,YAAYlE,GAAM;AAChB,IAAK7B,EAAY6B,CAAI,KACnBrC,EAAI,CAAC,GACHM,EAAQ+B,CAAI,MACdA,IAAO4E,GAAQ5E,CAAI;AACrB,UAAMsB,IAAQK,GAAW,IAAI,GACvB0B,IAAQK,EAAY1D,GAAM,MAAM;AACtC,WAAAqD,EAAM/F,CAAW,EAAE,YAAY,IAC/BmE,EAAWH,CAAK,GACT+B;AAAA,EACX;AAAA,EACE,YAAYxB,GAAON,GAAe;AAChC,UAAMpC,IAAQ0C,KAASA,EAAMvE,CAAW;AACxC,KAAI,CAAC6B,KAAS,CAACA,EAAM,cACnBxB,EAAI,CAAC;AACP,UAAM,EAAE,QAAQ2D,EAAK,IAAKnC;AAC1B,WAAAkC,GAAkBC,GAAOC,CAAa,GAC/BO,GAAc,QAAQR,CAAK;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAME,cAAcpD,GAAO;AACnB,SAAK,cAAcA;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAME,wBAAwBA,GAAO;AAC7B,SAAK,wBAAwBA;AAAA,EACjC;AAAA,EACE,aAAa8B,GAAM0E,GAAS;AAC1B,QAAIrE;AACJ,SAAKA,IAAIqE,EAAQ,SAAS,GAAGrE,KAAK,GAAGA,KAAK;AACxC,YAAMwE,IAAQH,EAAQrE,CAAC;AACvB,UAAIwE,EAAM,KAAK,WAAW,KAAKA,EAAM,OAAO,WAAW;AACrD,QAAA7E,IAAO6E,EAAM;AACb;AAAA,MACR;AAAA,IACA;AACI,IAAIxE,IAAI,OACNqE,IAAUA,EAAQ,MAAMrE,IAAI,CAAC;AAE/B,UAAMyE,IAAmBlE,EAAU,SAAS,EAAE;AAC9C,WAAI3C,EAAQ+B,CAAI,IACP8E,EAAiB9E,GAAM0E,CAAO,IAEhC,KAAK;AAAA,MACV1E;AAAA,MACA,CAAC6B,MAAUiD,EAAiBjD,GAAO6C,CAAO;AAAA,IAC3C;AAAA,EACL;AACA;AACA,SAAShB,EAAYxF,GAAO6E,GAAQ;AAClC,QAAMlB,IAAQvD,EAAMJ,CAAK,IAAI0C,EAAU,QAAQ,EAAE,UAAU1C,GAAO6E,CAAM,IAAIxE,EAAML,CAAK,IAAI0C,EAAU,QAAQ,EAAE,UAAU1C,GAAO6E,CAAM,IAAID,GAAiB5E,GAAO6E,CAAM;AAExK,UADcA,IAASA,EAAO,SAAS9B,GAAiB,GAClD,QAAQ,KAAKY,CAAK,GACjBA;AACT;AAGA,SAAS+C,GAAQ1G,GAAO;AACtB,SAAKD,EAAQC,CAAK,KAChBP,EAAI,IAAIO,CAAK,GACR6G,GAAY7G,CAAK;AAC1B;AACA,SAAS6G,GAAY7G,GAAO;AAC1B,MAAI,CAACC,EAAYD,CAAK,KAAKuC,EAASvC,CAAK;AACvC,WAAOA;AACT,QAAMiB,IAAQjB,EAAMZ,CAAW;AAC/B,MAAI0H;AACJ,MAAI7F,GAAO;AACT,QAAI,CAACA,EAAM;AACT,aAAOA,EAAM;AACf,IAAAA,EAAM,aAAa,IACnB6F,IAAOjF,EAAY7B,GAAOiB,EAAM,OAAO,OAAO,qBAAqB;AAAA,EACvE;AACI,IAAA6F,IAAOjF,EAAY7B,GAAO,EAAI;AAEhC,SAAAU,EAAKoG,GAAM,CAAChG,GAAKqD,MAAe;AAC9B,IAAA9C,GAAIyF,GAAMhG,GAAK+F,GAAY1C,CAAU,CAAC;AAAA,EAC1C,CAAG,GACGlD,MACFA,EAAM,aAAa,KAEd6F;AACT;AAGA,SAASC,KAAgB;AAEvB,EAAI,QAAQ,IAAI,aAAa,gBAC3B1H,GAAO;AAAA,IACL;AAAA,IACA,SAAS2H,GAAI;AACX,aAAO,kCAAkCA;AAAA,IAC1C;AAAA,IACD,SAAS9C,GAAM;AACb,aAAO,+CAA+CA;AAAA,IACvD;AAAA,IACD;AAAA,EACD;AAEH,QAAM+C,IAAU,WACVC,IAAM,OACNC,IAAS;AACf,WAASC,EAAiBnG,GAAOoG,GAAUb,GAASC,GAAgB;AAClE,YAAQxF,EAAM,OAAK;AAAA,MACjB,KAAK;AAAA,MACL,KAAK;AACH,eAAOqG;AAAA,UACLrG;AAAA,UACAoG;AAAA,UACAb;AAAA,UACAC;AAAA,QACD;AAAA,MACH,KAAK;AACH,eAAOc,EAAqBtG,GAAOoG,GAAUb,GAASC,CAAc;AAAA,MACtE,KAAK;AACH,eAAOe;AAAA,UACLvG;AAAA,UACAoG;AAAA,UACAb;AAAA,UACAC;AAAA,QACD;AAAA,IACT;AAAA,EACA;AACE,WAASc,EAAqBtG,GAAOoG,GAAUb,GAASC,GAAgB;AACtE,QAAI,EAAE,OAAAgB,GAAO,WAAAC,EAAS,IAAKzG,GACvB0G,IAAQ1G,EAAM;AAClB,IAAI0G,EAAM,SAASF,EAAM,WAEvB,CAACA,GAAOE,CAAK,IAAI,CAACA,GAAOF,CAAK,GAC9B,CAACjB,GAASC,CAAc,IAAI,CAACA,GAAgBD,CAAO;AAEtD,aAASrE,IAAI,GAAGA,IAAIsF,EAAM,QAAQtF;AAChC,UAAIuF,EAAUvF,CAAC,KAAKwF,EAAMxF,CAAC,MAAMsF,EAAMtF,CAAC,GAAG;AACzC,cAAM+B,IAAOmD,EAAS,OAAO,CAAClF,CAAC,CAAC;AAChC,QAAAqE,EAAQ,KAAK;AAAA,UACX,IAAIS;AAAA,UACJ,MAAA/C;AAAA;AAAA;AAAA,UAGA,OAAO0D,EAAwBD,EAAMxF,CAAC,CAAC;AAAA,QACjD,CAAS,GACDsE,EAAe,KAAK;AAAA,UAClB,IAAIQ;AAAA,UACJ,MAAA/C;AAAA,UACA,OAAO0D,EAAwBH,EAAMtF,CAAC,CAAC;AAAA,QACjD,CAAS;AAAA,MACT;AAEI,aAASA,IAAIsF,EAAM,QAAQtF,IAAIwF,EAAM,QAAQxF,KAAK;AAChD,YAAM+B,IAAOmD,EAAS,OAAO,CAAClF,CAAC,CAAC;AAChC,MAAAqE,EAAQ,KAAK;AAAA,QACX,IAAIU;AAAA,QACJ,MAAAhD;AAAA;AAAA;AAAA,QAGA,OAAO0D,EAAwBD,EAAMxF,CAAC,CAAC;AAAA,MAC/C,CAAO;AAAA,IACP;AACI,aAASA,IAAIwF,EAAM,SAAS,GAAGF,EAAM,UAAUtF,GAAG,EAAEA,GAAG;AACrD,YAAM+B,IAAOmD,EAAS,OAAO,CAAClF,CAAC,CAAC;AAChC,MAAAsE,EAAe,KAAK;AAAA,QAClB,IAAIU;AAAA,QACJ,MAAAjD;AAAA,MACR,CAAO;AAAA,IACP;AAAA,EACA;AACE,WAASoD,EAA4BrG,GAAOoG,GAAUb,GAASC,GAAgB;AAC7E,UAAM,EAAE,OAAAgB,GAAO,OAAAE,EAAK,IAAK1G;AACzB,IAAAP,EAAKO,EAAM,WAAW,CAACH,GAAK+G,MAAkB;AAC5C,YAAMC,IAAY1G,EAAIqG,GAAO3G,CAAG,GAC1Bd,IAAQoB,EAAIuG,GAAO7G,CAAG,GACtBkG,IAAMa,IAAyB3G,EAAIuG,GAAO3G,CAAG,IAAImG,IAAUC,IAArCC;AAC5B,UAAIW,MAAc9H,KAASgH,MAAOC;AAChC;AACF,YAAM/C,IAAOmD,EAAS,OAAOvG,CAAG;AAChC,MAAA0F,EAAQ,KAAKQ,MAAOG,IAAS,EAAE,IAAAH,GAAI,MAAA9C,EAAI,IAAK,EAAE,IAAA8C,GAAI,MAAA9C,GAAM,OAAAlE,EAAK,CAAE,GAC/DyG,EAAe;AAAA,QACbO,MAAOE,IAAM,EAAE,IAAIC,GAAQ,MAAAjD,EAAM,IAAG8C,MAAOG,IAAS,EAAE,IAAID,GAAK,MAAAhD,GAAM,OAAO0D,EAAwBE,CAAS,EAAC,IAAK,EAAE,IAAIb,GAAS,MAAA/C,GAAM,OAAO0D,EAAwBE,CAAS,EAAC;AAAA,MAClL;AAAA,IACP,CAAK;AAAA,EACL;AACE,WAASN,EAAmBvG,GAAOoG,GAAUb,GAASC,GAAgB;AACpE,QAAI,EAAE,OAAAgB,GAAO,OAAAE,EAAK,IAAK1G,GACnBkB,IAAI;AACR,IAAAsF,EAAM,QAAQ,CAACzH,MAAU;AACvB,UAAI,CAAC2H,EAAM,IAAI3H,CAAK,GAAG;AACrB,cAAMkE,IAAOmD,EAAS,OAAO,CAAClF,CAAC,CAAC;AAChC,QAAAqE,EAAQ,KAAK;AAAA,UACX,IAAIW;AAAA,UACJ,MAAAjD;AAAA,UACA,OAAAlE;AAAA,QACV,CAAS,GACDyG,EAAe,QAAQ;AAAA,UACrB,IAAIS;AAAA,UACJ,MAAAhD;AAAA,UACA,OAAAlE;AAAA,QACV,CAAS;AAAA,MACT;AACM,MAAAmC;AAAA,IACN,CAAK,GACDA,IAAI,GACJwF,EAAM,QAAQ,CAAC3H,MAAU;AACvB,UAAI,CAACyH,EAAM,IAAIzH,CAAK,GAAG;AACrB,cAAMkE,IAAOmD,EAAS,OAAO,CAAClF,CAAC,CAAC;AAChC,QAAAqE,EAAQ,KAAK;AAAA,UACX,IAAIU;AAAA,UACJ,MAAAhD;AAAA,UACA,OAAAlE;AAAA,QACV,CAAS,GACDyG,EAAe,QAAQ;AAAA,UACrB,IAAIU;AAAA,UACJ,MAAAjD;AAAA,UACA,OAAAlE;AAAA,QACV,CAAS;AAAA,MACT;AACM,MAAAmC;AAAA,IACN,CAAK;AAAA,EACL;AACE,WAAS4F,EAA4BC,GAAWC,GAAazB,GAASC,GAAgB;AACpF,IAAAD,EAAQ,KAAK;AAAA,MACX,IAAIS;AAAA,MACJ,MAAM,CAAE;AAAA,MACR,OAAOgB,MAAgB/I,IAAU,SAAS+I;AAAA,IAChD,CAAK,GACDxB,EAAe,KAAK;AAAA,MAClB,IAAIQ;AAAA,MACJ,MAAM,CAAE;AAAA,MACR,OAAOe;AAAA,IACb,CAAK;AAAA,EACL;AACE,WAASE,EAAcvE,GAAO6C,GAAS;AACrC,WAAAA,EAAQ,QAAQ,CAACG,MAAU;AACzB,YAAM,EAAE,MAAAzC,GAAM,IAAA8C,EAAE,IAAKL;AACrB,UAAI7E,IAAO6B;AACX,eAASxB,IAAI,GAAGA,IAAI+B,EAAK,SAAS,GAAG/B,KAAK;AACxC,cAAMgG,IAAatH,EAAYiB,CAAI;AACnC,YAAIwE,IAAIpC,EAAK/B,CAAC;AACd,QAAI,OAAOmE,KAAM,YAAY,OAAOA,KAAM,aACxCA,IAAI,KAAKA,KAEN6B,MAAe,KAAkBA,MAAe,OAAmB7B,MAAM,eAAeA,MAAM,kBACjG7G,EAAI,EAAe,GACjB,OAAOqC,KAAS,cAAcwE,MAAM,eACtC7G,EAAI,EAAe,GACrBqC,IAAOV,EAAIU,GAAMwE,CAAC,GACd,OAAOxE,KAAS,YAClBrC,EAAI,IAAiByE,EAAK,KAAK,GAAG,CAAC;AAAA,MAC7C;AACM,YAAMkE,IAAOvH,EAAYiB,CAAI,GACvB9B,IAAQqI,EAAoB1B,EAAM,KAAK,GACvC7F,IAAMoD,EAAKA,EAAK,SAAS,CAAC;AAChC,cAAQ8C,GAAE;AAAA,QACR,KAAKC;AACH,kBAAQmB,GAAI;AAAA,YACV,KAAK;AACH,qBAAOtG,EAAK,IAAIhB,GAAKd,CAAK;AAAA,YAC5B,KAAK;AACH,cAAAP,EAAI,EAAW;AAAA,YACjB;AACE,qBAAOqC,EAAKhB,CAAG,IAAId;AAAA,UACjC;AAAA,QACQ,KAAKkH;AACH,kBAAQkB,GAAI;AAAA,YACV,KAAK;AACH,qBAAOtH,MAAQ,MAAMgB,EAAK,KAAK9B,CAAK,IAAI8B,EAAK,OAAOhB,GAAK,GAAGd,CAAK;AAAA,YACnE,KAAK;AACH,qBAAO8B,EAAK,IAAIhB,GAAKd,CAAK;AAAA,YAC5B,KAAK;AACH,qBAAO8B,EAAK,IAAI9B,CAAK;AAAA,YACvB;AACE,qBAAO8B,EAAKhB,CAAG,IAAId;AAAA,UACjC;AAAA,QACQ,KAAKmH;AACH,kBAAQiB,GAAI;AAAA,YACV,KAAK;AACH,qBAAOtG,EAAK,OAAOhB,GAAK,CAAC;AAAA,YAC3B,KAAK;AACH,qBAAOgB,EAAK,OAAOhB,CAAG;AAAA,YACxB,KAAK;AACH,qBAAOgB,EAAK,OAAO6E,EAAM,KAAK;AAAA,YAChC;AACE,qBAAO,OAAO7E,EAAKhB,CAAG;AAAA,UACpC;AAAA,QACQ;AACE,UAAArB,EAAI,IAAiBuH,CAAE;AAAA,MACjC;AAAA,IACA,CAAK,GACMrD;AAAA,EACX;AACE,WAAS0E,EAAoB1H,GAAK;AAChC,QAAI,CAACV,EAAYU,CAAG;AAClB,aAAOA;AACT,QAAI,MAAM,QAAQA,CAAG;AACnB,aAAOA,EAAI,IAAI0H,CAAmB;AACpC,QAAIjI,EAAMO,CAAG;AACX,aAAO,IAAI;AAAA,QACT,MAAM,KAAKA,EAAI,QAAS,CAAA,EAAE,IAAI,CAAC,CAAC2H,GAAGC,CAAC,MAAM,CAACD,GAAGD,EAAoBE,CAAC,CAAC,CAAC;AAAA,MACtE;AACH,QAAIlI,EAAMM,CAAG;AACX,aAAO,IAAI,IAAI,MAAM,KAAKA,CAAG,EAAE,IAAI0H,CAAmB,CAAC;AACzD,UAAMG,IAAS,OAAO,OAAO1I,EAAea,CAAG,CAAC;AAChD,eAAWG,KAAOH;AAChB,MAAA6H,EAAO1H,CAAG,IAAIuH,EAAoB1H,EAAIG,CAAG,CAAC;AAC5C,WAAII,EAAIP,GAAKxB,CAAS,MACpBqJ,EAAOrJ,CAAS,IAAIwB,EAAIxB,CAAS,IAC5BqJ;AAAA,EACX;AACE,WAASZ,EAAwBjH,GAAK;AACpC,WAAIZ,EAAQY,CAAG,IACN0H,EAAoB1H,CAAG,IAEvBA;AAAA,EACb;AACE,EAAAiC,GAAW,WAAW;AAAA,IACpB,eAAAsF;AAAA,IACA,kBAAAd;AAAA,IACA,6BAAAW;AAAA,EACJ,CAAG;AACH;AA6PA,IAAIU,IAAQ,IAAI1C,GAAQ;AACV0C,EAAM;AACjB,IAACC,KAAqC,gBAAAD,EAAM,mBAAmB;AAAA,EAChEA;AACF,GAKIE,KAA+B,gBAAAF,EAAM,aAAa,KAAKA,CAAK;","x_google_ignoreList":[0]}

package/dist/node_modules/rehype/node_modules/unified/lib/index.cjs.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const S=require("../../../../bail/index.cjs.js"),B=require("../../../../../_virtual/index.cjs10.js"),z=require("../../../../../_virtual/index.cjs11.js"),E=require("../../../../is-plain-obj/index.cjs.js"),D=require("../../../../trough/lib/index.cjs.js"),M=require("../../vfile/lib/index.cjs.js"),Y=$().freeze(),A={}.hasOwnProperty;function $(){const t=D.trough(),s=[];let a={},w,h=-1;return n.data=j,n.Parser=void 0,n.Compiler=void 0,n.freeze=q,n.attachers=s,n.use=I,n.parse=O,n.stringify=V,n.run=F,n.runSync=N,n.process=L,n.processSync=U,n;function n(){const e=$();let r=-1;for(;++r<s.length;)e.use(...s[r]);return e.data(z(!0,{},a)),e}function j(e,r){return typeof e=="string"?arguments.length===2?(P("data",w),a[e]=r,n):A.call(a,e)&&a[e]||null:e?(P("data",w),a=e,n):a}function q(){if(w)return n;for(;++h<s.length;){const[e,...r]=s[h];if(r[0]===!1)continue;r[0]===!0&&(r[0]=void 0);const i=e.call(n,...r);typeof i=="function"&&t.use(i)}return w=!0,h=Number.POSITIVE_INFINITY,n}function I(e,...r){let i;if(P("use",w),e!=null)if(typeof e=="function")d(e,...r);else if(typeof e=="object")Array.isArray(e)?y(e):p(e);else throw new TypeError("Expected usable value, not `"+e+"`");return i&&(a.settings=Object.assign(a.settings||{},i)),n;function u(o){if(typeof o=="function")d(o);else if(typeof o=="object")if(Array.isArray(o)){const[f,...c]=o;d(f,...c)}else p(o);else throw new TypeError("Expected usable value, not `"+o+"`")}function p(o){y(o.plugins),o.settings&&(i=Object.assign(i||{},o.settings))}function y(o){let f=-1;if(o!=null)if(Array.isArray(o))for(;++f<o.length;){const c=o[f];u(c)}else throw new TypeError("Expected a list of plugins, not `"+o+"`")}function d(o,f){let c=-1,l;for(;++c<s.length;)if(s[c][0]===o){l=s[c];break}l?(E(l[1])&&E(f)&&(f=z(!0,l[1],f)),l[1]=f):s.push([...arguments])}}function O(e){n.freeze();const r=g(e),i=n.Parser;return m("parse",i),C(i,"parse")?new i(String(r),r).parse():i(String(r),r)}function V(e,r){n.freeze();const i=g(r),u=n.Compiler;return x("stringify",u),b(e),C(u,"compile")?new u(e,i).compile():u(e,i)}function F(e,r,i){if(b(e),n.freeze(),!i&&typeof r=="function"&&(i=r,r=void 0),!i)return new Promise(u);u(null,i);function u(p,y){t.run(e,g(r),d);function d(o,f,c){f=f||e,o?y(o):p?p(f):i(null,f,c)}}}function N(e,r){let i,u;return n.run(e,r,p),T("runSync","run",u),i;function p(y,d){S.bail(y),i=d,u=!0}}function L(e,r){if(n.freeze(),m("process",n.Parser),x("process",n.Compiler),!r)return new Promise(i);i(null,r);function i(u,p){const y=g(e);n.run(n.parse(y),y,(o,f,c)=>{if(o||!f||!c)d(o);else{const l=n.stringify(f,c);l==null||(H(l)?c.value=l:c.result=l),d(o,c)}});function d(o,f){o||!f?p(o):u?u(f):r(null,f)}}}function U(e){let r;n.freeze(),m("processSync",n.Parser),x("processSync",n.Compiler);const i=g(e);return n.process(i,u),T("processSync","process",r),i;function u(p){r=!0,S.bail(p)}}}function C(t,s){return typeof t=="function"&&t.prototype&&(_(t.prototype)||s in t.prototype)}function _(t){let s;for(s in t)if(A.call(t,s))return!0;return!1}function m(t,s){if(typeof s!="function")throw new TypeError("Cannot `"+t+"` without `Parser`")}function x(t,s){if(typeof s!="function")throw new TypeError("Cannot `"+t+"` without `Compiler`")}function P(t,s){if(s)throw new Error("Cannot call `"+t+"` on a frozen processor.\nCreate a new processor first, by calling it: use `processor()` instead of `processor`.")}function b(t){if(!E(t)||typeof t.type!="string")throw new TypeError("Expected node, got `"+t+"`")}function T(t,s,a){if(!a)throw new Error("`"+t+"` finished async. Use `"+s+"` instead")}function g(t){return G(t)?t:new M.VFile(t)}function G(t){return!!(t&&typeof t=="object"&&"message"in t&&"messages"in t)}function H(t){return typeof t=="string"||B(t)}exports.unified=Y;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const S=require("../../../../bail/index.cjs.js"),B=require("../../../../../_virtual/index.cjs11.js"),z=require("../../../../../_virtual/index.cjs12.js"),E=require("../../../../is-plain-obj/index.cjs.js"),D=require("../../../../trough/lib/index.cjs.js"),M=require("../../vfile/lib/index.cjs.js"),Y=$().freeze(),A={}.hasOwnProperty;function $(){const t=D.trough(),s=[];let a={},w,h=-1;return n.data=j,n.Parser=void 0,n.Compiler=void 0,n.freeze=q,n.attachers=s,n.use=I,n.parse=O,n.stringify=V,n.run=F,n.runSync=N,n.process=L,n.processSync=U,n;function n(){const e=$();let r=-1;for(;++r<s.length;)e.use(...s[r]);return e.data(z(!0,{},a)),e}function j(e,r){return typeof e=="string"?arguments.length===2?(P("data",w),a[e]=r,n):A.call(a,e)&&a[e]||null:e?(P("data",w),a=e,n):a}function q(){if(w)return n;for(;++h<s.length;){const[e,...r]=s[h];if(r[0]===!1)continue;r[0]===!0&&(r[0]=void 0);const i=e.call(n,...r);typeof i=="function"&&t.use(i)}return w=!0,h=Number.POSITIVE_INFINITY,n}function I(e,...r){let i;if(P("use",w),e!=null)if(typeof e=="function")d(e,...r);else if(typeof e=="object")Array.isArray(e)?y(e):p(e);else throw new TypeError("Expected usable value, not `"+e+"`");return i&&(a.settings=Object.assign(a.settings||{},i)),n;function u(o){if(typeof o=="function")d(o);else if(typeof o=="object")if(Array.isArray(o)){const[f,...c]=o;d(f,...c)}else p(o);else throw new TypeError("Expected usable value, not `"+o+"`")}function p(o){y(o.plugins),o.settings&&(i=Object.assign(i||{},o.settings))}function y(o){let f=-1;if(o!=null)if(Array.isArray(o))for(;++f<o.length;){const c=o[f];u(c)}else throw new TypeError("Expected a list of plugins, not `"+o+"`")}function d(o,f){let c=-1,l;for(;++c<s.length;)if(s[c][0]===o){l=s[c];break}l?(E(l[1])&&E(f)&&(f=z(!0,l[1],f)),l[1]=f):s.push([...arguments])}}function O(e){n.freeze();const r=g(e),i=n.Parser;return m("parse",i),C(i,"parse")?new i(String(r),r).parse():i(String(r),r)}function V(e,r){n.freeze();const i=g(r),u=n.Compiler;return x("stringify",u),b(e),C(u,"compile")?new u(e,i).compile():u(e,i)}function F(e,r,i){if(b(e),n.freeze(),!i&&typeof r=="function"&&(i=r,r=void 0),!i)return new Promise(u);u(null,i);function u(p,y){t.run(e,g(r),d);function d(o,f,c){f=f||e,o?y(o):p?p(f):i(null,f,c)}}}function N(e,r){let i,u;return n.run(e,r,p),T("runSync","run",u),i;function p(y,d){S.bail(y),i=d,u=!0}}function L(e,r){if(n.freeze(),m("process",n.Parser),x("process",n.Compiler),!r)return new Promise(i);i(null,r);function i(u,p){const y=g(e);n.run(n.parse(y),y,(o,f,c)=>{if(o||!f||!c)d(o);else{const l=n.stringify(f,c);l==null||(H(l)?c.value=l:c.result=l),d(o,c)}});function d(o,f){o||!f?p(o):u?u(f):r(null,f)}}}function U(e){let r;n.freeze(),m("processSync",n.Parser),x("processSync",n.Compiler);const i=g(e);return n.process(i,u),T("processSync","process",r),i;function u(p){r=!0,S.bail(p)}}}function C(t,s){return typeof t=="function"&&t.prototype&&(_(t.prototype)||s in t.prototype)}function _(t){let s;for(s in t)if(A.call(t,s))return!0;return!1}function m(t,s){if(typeof s!="function")throw new TypeError("Cannot `"+t+"` without `Parser`")}function x(t,s){if(typeof s!="function")throw new TypeError("Cannot `"+t+"` without `Compiler`")}function P(t,s){if(s)throw new Error("Cannot call `"+t+"` on a frozen processor.\nCreate a new processor first, by calling it: use `processor()` instead of `processor`.")}function b(t){if(!E(t)||typeof t.type!="string")throw new TypeError("Expected node, got `"+t+"`")}function T(t,s,a){if(!a)throw new Error("`"+t+"` finished async. Use `"+s+"` instead")}function g(t){return G(t)?t:new M.VFile(t)}function G(t){return!!(t&&typeof t=="object"&&"message"in t&&"messages"in t)}function H(t){return typeof t=="string"||B(t)}exports.unified=Y;
 //# sourceMappingURL=index.cjs.js.map

package/dist/node_modules/rehype/node_modules/unified/lib/index.es.js

@@ -1,6 +1,6 @@
 import { bail as z } from "../../../../bail/index.es.js";
-import Y from "../../../../../_virtual/index.es10.js";
-import C from "../../../../../_virtual/index.es11.js";
+import Y from "../../../../../_virtual/index.es11.js";
+import C from "../../../../../_virtual/index.es12.js";
 import x from "../../../../is-plain-obj/index.es.js";
 import { trough as _ } from "../../../../trough/lib/index.es.js";
 import { VFile as q } from "../../vfile/lib/index.es.js";

package/dist/node_modules/rehype/node_modules/vfile/lib/index.cjs.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("../../../../../_virtual/index.cjs10.js"),i=require("./minpath.browser.cjs.js"),d=require("./minproc.browser.cjs.js"),c=require("./minurl.browser.cjs.js"),m=require("./minurl.shared.cjs.js"),l=require("../../vfile-message/lib/index.cjs.js"),a=["history","path","basename","stem","extname","dirname"];class g{constructor(t){let e;t?typeof t=="string"||w(t)?e={value:t}:m.isUrl(t)?e={path:t}:e=t:e={},this.data={},this.messages=[],this.history=[],this.cwd=d.proc.cwd(),this.value,this.stored,this.result,this.map;let r=-1;for(;++r<a.length;){const h=a[r];h in e&&e[h]!==void 0&&e[h]!==null&&(this[h]=h==="history"?[...e[h]]:e[h])}let s;for(s in e)a.includes(s)||(this[s]=e[s])}get path(){return this.history[this.history.length-1]}set path(t){m.isUrl(t)&&(t=c.urlToPath(t)),p(t,"path"),this.path!==t&&this.history.push(t)}get dirname(){return typeof this.path=="string"?i.path.dirname(this.path):void 0}set dirname(t){u(this.basename,"dirname"),this.path=i.path.join(t||"",this.basename)}get basename(){return typeof this.path=="string"?i.path.basename(this.path):void 0}set basename(t){p(t,"basename"),o(t,"basename"),this.path=i.path.join(this.dirname||"",t)}get extname(){return typeof this.path=="string"?i.path.extname(this.path):void 0}set extname(t){if(o(t,"extname"),u(this.dirname,"extname"),t){if(t.charCodeAt(0)!==46)throw new Error("`extname` must start with `.`");if(t.includes(".",1))throw new Error("`extname` cannot contain multiple dots")}this.path=i.path.join(this.dirname,this.stem+(t||""))}get stem(){return typeof this.path=="string"?i.path.basename(this.path,this.extname):void 0}set stem(t){p(t,"stem"),o(t,"stem"),this.path=i.path.join(this.dirname||"",t+(this.extname||""))}toString(t){return(this.value||"").toString(t||void 0)}message(t,e,r){const s=new l.VFileMessage(t,e,r);return this.path&&(s.name=this.path+":"+s.name,s.file=this.path),s.fatal=!1,this.messages.push(s),s}info(t,e,r){const s=this.message(t,e,r);return s.fatal=null,s}fail(t,e,r){const s=this.message(t,e,r);throw s.fatal=!0,s}}function o(n,t){if(n&&n.includes(i.path.sep))throw new Error("`"+t+"` cannot be a path: did not expect `"+i.path.sep+"`")}function p(n,t){if(!n)throw new Error("`"+t+"` cannot be empty")}function u(n,t){if(!n)throw new Error("Setting `"+t+"` requires `path` to be set too")}function w(n){return f(n)}exports.VFile=g;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("../../../../../_virtual/index.cjs11.js"),i=require("./minpath.browser.cjs.js"),d=require("./minproc.browser.cjs.js"),c=require("./minurl.browser.cjs.js"),m=require("./minurl.shared.cjs.js"),l=require("../../vfile-message/lib/index.cjs.js"),a=["history","path","basename","stem","extname","dirname"];class g{constructor(t){let e;t?typeof t=="string"||w(t)?e={value:t}:m.isUrl(t)?e={path:t}:e=t:e={},this.data={},this.messages=[],this.history=[],this.cwd=d.proc.cwd(),this.value,this.stored,this.result,this.map;let r=-1;for(;++r<a.length;){const h=a[r];h in e&&e[h]!==void 0&&e[h]!==null&&(this[h]=h==="history"?[...e[h]]:e[h])}let s;for(s in e)a.includes(s)||(this[s]=e[s])}get path(){return this.history[this.history.length-1]}set path(t){m.isUrl(t)&&(t=c.urlToPath(t)),p(t,"path"),this.path!==t&&this.history.push(t)}get dirname(){return typeof this.path=="string"?i.path.dirname(this.path):void 0}set dirname(t){u(this.basename,"dirname"),this.path=i.path.join(t||"",this.basename)}get basename(){return typeof this.path=="string"?i.path.basename(this.path):void 0}set basename(t){p(t,"basename"),o(t,"basename"),this.path=i.path.join(this.dirname||"",t)}get extname(){return typeof this.path=="string"?i.path.extname(this.path):void 0}set extname(t){if(o(t,"extname"),u(this.dirname,"extname"),t){if(t.charCodeAt(0)!==46)throw new Error("`extname` must start with `.`");if(t.includes(".",1))throw new Error("`extname` cannot contain multiple dots")}this.path=i.path.join(this.dirname,this.stem+(t||""))}get stem(){return typeof this.path=="string"?i.path.basename(this.path,this.extname):void 0}set stem(t){p(t,"stem"),o(t,"stem"),this.path=i.path.join(this.dirname||"",t+(this.extname||""))}toString(t){return(this.value||"").toString(t||void 0)}message(t,e,r){const s=new l.VFileMessage(t,e,r);return this.path&&(s.name=this.path+":"+s.name,s.file=this.path),s.fatal=!1,this.messages.push(s),s}info(t,e,r){const s=this.message(t,e,r);return s.fatal=null,s}fail(t,e,r){const s=this.message(t,e,r);throw s.fatal=!0,s}}function o(n,t){if(n&&n.includes(i.path.sep))throw new Error("`"+t+"` cannot be a path: did not expect `"+i.path.sep+"`")}function p(n,t){if(!n)throw new Error("`"+t+"` cannot be empty")}function u(n,t){if(!n)throw new Error("Setting `"+t+"` requires `path` to be set too")}function w(n){return f(n)}exports.VFile=g;
 //# sourceMappingURL=index.cjs.js.map

package/dist/node_modules/rehype/node_modules/vfile/lib/index.es.js

@@ -1,4 +1,4 @@
-import d from "../../../../../_virtual/index.es10.js";
+import d from "../../../../../_virtual/index.es11.js";
 import { path as i } from "./minpath.browser.es.js";
 import { proc as u } from "./minproc.browser.es.js";
 import { urlToPath as l } from "./minurl.browser.es.js";

package/dist/node_modules/rehype-parse/lib/index.cjs.js

@@ -1,2 +1,2 @@
-"use strict";const w=require("../../../_virtual/index.cjs12.js"),A=require("./errors.cjs.js"),E=require("../../hast-util-from-parse5/lib/index.cjs.js"),I="https://html.spec.whatwg.org/multipage/parsing.html#parse-error-",L={2:!0,1:!1,0:null};function j(r){const o=this.data("settings"),n=Object.assign({},o,r);Object.assign(this,{Parser:h});function h(a,l){const b=n.fragment?"parseFragment":"parse",C=n.emitParseErrors?x:null,O=new w({sourceCodeLocationInfo:!0,onParseError:C,scriptingEnabled:!1});return E.fromParse5(O[b](a),{space:n.space,file:l,verbose:n.verbose});function x(e){const c=e.code,u=y(c),i=n[u],f=i??!0,p=typeof f=="number"?f:f?1:0,P={line:e.startLine,column:e.startCol,offset:e.startOffset},q={line:e.endLine,column:e.endCol,offset:e.endOffset};if(p){const t=A.errors[u]||{reason:"",description:"",url:""},s=l.message(g(t.reason),{start:P,end:q});s.source="parse-error",s.ruleId=c,s.fatal=L[p],s.note=g(t.description),s.url="url"in t&&t.url===!1?null:I+c}function g(t){return t.replace(/%c(?:-(\d+))?/g,(s,d)=>{const v=d?-Number.parseInt(d,10):0,m=a.charAt(e.startOffset+v);return m==="`"?"` ` `":m}).replace(/%x/g,()=>"0x"+a.charCodeAt(e.startOffset).toString(16).toUpperCase())}}}}function y(r){return r.replace(/-[a-z]/g,o=>o.charAt(1).toUpperCase())}module.exports=j;
+"use strict";const w=require("../../../_virtual/index.cjs10.js"),A=require("./errors.cjs.js"),E=require("../../hast-util-from-parse5/lib/index.cjs.js"),I="https://html.spec.whatwg.org/multipage/parsing.html#parse-error-",L={2:!0,1:!1,0:null};function j(r){const o=this.data("settings"),n=Object.assign({},o,r);Object.assign(this,{Parser:h});function h(a,l){const b=n.fragment?"parseFragment":"parse",C=n.emitParseErrors?x:null,O=new w({sourceCodeLocationInfo:!0,onParseError:C,scriptingEnabled:!1});return E.fromParse5(O[b](a),{space:n.space,file:l,verbose:n.verbose});function x(e){const c=e.code,u=y(c),i=n[u],f=i??!0,p=typeof f=="number"?f:f?1:0,P={line:e.startLine,column:e.startCol,offset:e.startOffset},q={line:e.endLine,column:e.endCol,offset:e.endOffset};if(p){const t=A.errors[u]||{reason:"",description:"",url:""},s=l.message(g(t.reason),{start:P,end:q});s.source="parse-error",s.ruleId=c,s.fatal=L[p],s.note=g(t.description),s.url="url"in t&&t.url===!1?null:I+c}function g(t){return t.replace(/%c(?:-(\d+))?/g,(s,d)=>{const v=d?-Number.parseInt(d,10):0,m=a.charAt(e.startOffset+v);return m==="`"?"` ` `":m}).replace(/%x/g,()=>"0x"+a.charCodeAt(e.startOffset).toString(16).toUpperCase())}}}}function y(r){return r.replace(/-[a-z]/g,o=>o.charAt(1).toUpperCase())}module.exports=j;
 //# sourceMappingURL=index.cjs.js.map

package/dist/node_modules/rehype-parse/lib/index.es.js

@@ -1,4 +1,4 @@
-import A from "../../../_virtual/index.es12.js";
+import A from "../../../_virtual/index.es10.js";
 import { errors as E } from "./errors.es.js";
 import { fromParse5 as I } from "../../hast-util-from-parse5/lib/index.es.js";
 const L = "https://html.spec.whatwg.org/multipage/parsing.html#parse-error-", j = { 2: !0, 1: !1, 0: null };

package/dist/node_modules/unist-util-is/lib/index.cjs.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs.js","sources":["../../../../../node_modules/unist-util-is/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n */\n\n/**\n * @template Fn\n * @template Fallback\n * @typedef {Fn extends (value: any) => value is infer Thing ? Thing : Fallback} Predicate\n */\n\n/**\n * @callback Check\n *   Check that an arbitrary value is a node.\n * @param {unknown} this\n *   The given context.\n * @param {unknown} [node]\n *   Anything (typically a node).\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean}\n *   Whether this is a node and passes a test.\n *\n * @typedef {Record<string, unknown> | Node} Props\n *   Object to check for equivalence.\n *\n *   Note: `Node` is included as it is common but is not indexable.\n *\n * @typedef {Array<Props | TestFunction | string> | Props | TestFunction | string | null | undefined} Test\n *   Check for an arbitrary node.\n *\n * @callback TestFunction\n *   Check if a node passes a test.\n * @param {unknown} this\n *   The given context.\n * @param {Node} node\n *   A node.\n * @param {number | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean | undefined | void}\n *   Whether this node passes the test.\n *\n *   Note: `void` is included until TS sees no return as `undefined`.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param {unknown} node\n *   Thing to check, typically `Node`.\n * @param {Test} test\n *   A check for a specific node.\n * @param {number | null | undefined} index\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} parent\n *   The node’s parent.\n * @param {unknown} context\n *   Context object (`this`) to pass to `test` functions.\n * @returns {boolean}\n *   Whether `node` is a node and passes a test.\n */\nexport const is =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((node?: null | undefined) => false) &\n   *   ((node: unknown, test?: null | undefined, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((node: unknown, test?: Test, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => boolean)\n   * )}\n   */\n  (\n    /**\n     * @param {unknown} [node]\n     * @param {Test} [test]\n     * @param {number | null | undefined} [index]\n     * @param {Parent | null | undefined} [parent]\n     * @param {unknown} [context]\n     * @returns {boolean}\n     */\n    // eslint-disable-next-line max-params\n    function (node, test, index, parent, context) {\n      const check = convert(test)\n\n      if (\n        index !== undefined &&\n        index !== null &&\n        (typeof index !== 'number' ||\n          index < 0 ||\n          index === Number.POSITIVE_INFINITY)\n      ) {\n        throw new Error('Expected positive finite index')\n      }\n\n      if (\n        parent !== undefined &&\n        parent !== null &&\n        (!is(parent) || !parent.children)\n      ) {\n        throw new Error('Expected parent node')\n      }\n\n      if (\n        (parent === undefined || parent === null) !==\n        (index === undefined || index === null)\n      ) {\n        throw new Error('Expected both parent and index')\n      }\n\n      return looksLikeANode(node)\n        ? check.call(context, node, index, parent)\n        : false\n    }\n  )\n\n/**\n * Generate an assertion from a test.\n *\n * Useful if you’re going to test many nodes, for example when creating a\n * utility where something else passes a compatible test.\n *\n * The created function is a bit faster because it expects valid input only:\n * a `node`, `index`, and `parent`.\n *\n * @param {Test} test\n *   *   when nullish, checks if `node` is a `Node`.\n *   *   when `string`, works like passing `(node) => node.type === test`.\n *   *   when `function` checks if function passed the node is true.\n *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n *   *   when `array`, checks if any one of the subtests pass.\n * @returns {Check}\n *   An assertion.\n */\nexport const convert =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((test?: null | undefined) => (node?: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((test?: Test) => Check)\n   * )}\n   */\n  (\n    /**\n     * @param {Test} [test]\n     * @returns {Check}\n     */\n    function (test) {\n      if (test === null || test === undefined) {\n        return ok\n      }\n\n      if (typeof test === 'function') {\n        return castFactory(test)\n      }\n\n      if (typeof test === 'object') {\n        return Array.isArray(test) ? anyFactory(test) : propsFactory(test)\n      }\n\n      if (typeof test === 'string') {\n        return typeFactory(test)\n      }\n\n      throw new Error('Expected function, string, or object as test')\n    }\n  )\n\n/**\n * @param {Array<Props | TestFunction | string>} tests\n * @returns {Check}\n */\nfunction anyFactory(tests) {\n  /** @type {Array<Check>} */\n  const checks = []\n  let index = -1\n\n  while (++index < tests.length) {\n    checks[index] = convert(tests[index])\n  }\n\n  return castFactory(any)\n\n  /**\n   * @this {unknown}\n   * @type {TestFunction}\n   */\n  function any(...parameters) {\n    let index = -1\n\n    while (++index < checks.length) {\n      if (checks[index].apply(this, parameters)) return true\n    }\n\n    return false\n  }\n}\n\n/**\n * Turn an object into a test for a node with a certain fields.\n *\n * @param {Props} check\n * @returns {Check}\n */\nfunction propsFactory(check) {\n  const checkAsRecord = /** @type {Record<string, unknown>} */ (check)\n\n  return castFactory(all)\n\n  /**\n   * @param {Node} node\n   * @returns {boolean}\n   */\n  function all(node) {\n    const nodeAsRecord = /** @type {Record<string, unknown>} */ (\n      /** @type {unknown} */ (node)\n    )\n\n    /** @type {string} */\n    let key\n\n    for (key in check) {\n      if (nodeAsRecord[key] !== checkAsRecord[key]) return false\n    }\n\n    return true\n  }\n}\n\n/**\n * Turn a string into a test for a node with a certain type.\n *\n * @param {string} check\n * @returns {Check}\n */\nfunction typeFactory(check) {\n  return castFactory(type)\n\n  /**\n   * @param {Node} node\n   */\n  function type(node) {\n    return node && node.type === check\n  }\n}\n\n/**\n * Turn a custom test into a test for a node that passes that test.\n *\n * @param {TestFunction} testFunction\n * @returns {Check}\n */\nfunction castFactory(testFunction) {\n  return check\n\n  /**\n   * @this {unknown}\n   * @type {Check}\n   */\n  function check(value, index, parent) {\n    return Boolean(\n      looksLikeANode(value) &&\n        testFunction.call(\n          this,\n          value,\n          typeof index === 'number' ? index : undefined,\n          parent || undefined\n        )\n    )\n  }\n}\n\nfunction ok() {\n  return true\n}\n\n/**\n * @param {unknown} value\n * @returns {value is Node}\n */\nfunction looksLikeANode(value) {\n  return value !== null && typeof value === 'object' && 'type' in value\n}\n"],"names":["convert","test","ok","castFactory","anyFactory","propsFactory","typeFactory","tests","checks","index","any","parameters","check","checkAsRecord","all","node","nodeAsRecord","key","type","testFunction","value","parent","looksLikeANode"],"mappings":"gFA2IY,MAACA,EAgBT,SAAUC,EAAM,CACd,GAAIA,GAAS,KACX,OAAOC,EAGT,GAAI,OAAOD,GAAS,WAClB,OAAOE,EAAYF,CAAI,EAGzB,GAAI,OAAOA,GAAS,SAClB,OAAO,MAAM,QAAQA,CAAI,EAAIG,EAAWH,CAAI,EAAII,EAAaJ,CAAI,EAGnE,GAAI,OAAOA,GAAS,SAClB,OAAOK,EAAYL,CAAI,EAGzB,MAAM,IAAI,MAAM,8CAA8C,CACpE,EAOA,SAASG,EAAWG,EAAO,CAEzB,MAAMC,EAAS,CAAA,EACf,IAAIC,EAAQ,GAEZ,KAAO,EAAEA,EAAQF,EAAM,QACrBC,EAAOC,CAAK,EAAIT,EAAQO,EAAME,CAAK,CAAC,EAGtC,OAAON,EAAYO,CAAG,EAMtB,SAASA,KAAOC,EAAY,CAC1B,IAAIF,EAAQ,GAEZ,KAAO,EAAEA,EAAQD,EAAO,QACtB,GAAIA,EAAOC,CAAK,EAAE,MAAM,KAAME,CAAU,EAAG,MAAO,GAGpD,MAAO,EACX,CACA,CAQA,SAASN,EAAaO,EAAO,CAC3B,MAAMC,EAAwDD,EAE9D,OAAOT,EAAYW,CAAG,EAMtB,SAASA,EAAIC,EAAM,CACjB,MAAMC,EACoBD,EAI1B,IAAIE,EAEJ,IAAKA,KAAOL,EACV,GAAII,EAAaC,CAAG,IAAMJ,EAAcI,CAAG,EAAG,MAAO,GAGvD,MAAO,EACX,CACA,CAQA,SAASX,EAAYM,EAAO,CAC1B,OAAOT,EAAYe,CAAI,EAKvB,SAASA,EAAKH,EAAM,CAClB,OAAOA,GAAQA,EAAK,OAASH,CACjC,CACA,CAQA,SAAST,EAAYgB,EAAc,CACjC,OAAOP,EAMP,SAASA,EAAMQ,EAAOX,EAAOY,EAAQ,CACnC,MAAO,GACLC,EAAeF,CAAK,GAClBD,EAAa,KACX,KACAC,EACA,OAAOX,GAAU,SAAWA,EAAQ,OACpCY,GAAU,MACpB,EAEA,CACA,CAEA,SAASnB,GAAK,CACZ,MAAO,EACT,CAMA,SAASoB,EAAeF,EAAO,CAC7B,OAAOA,IAAU,MAAQ,OAAOA,GAAU,UAAY,SAAUA,CAClE","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs.js","sources":["../../../../../node_modules/unist-util-is/lib/index.js"],"sourcesContent":["/**\n * @import {Node, Parent} from 'unist'\n */\n\n/**\n * @template Fn\n * @template Fallback\n * @typedef {Fn extends (value: any) => value is infer Thing ? Thing : Fallback} Predicate\n */\n\n/**\n * @callback Check\n *   Check that an arbitrary value is a node.\n * @param {unknown} this\n *   The given context.\n * @param {unknown} [node]\n *   Anything (typically a node).\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean}\n *   Whether this is a node and passes a test.\n *\n * @typedef {Record<string, unknown> | Node} Props\n *   Object to check for equivalence.\n *\n *   Note: `Node` is included as it is common but is not indexable.\n *\n * @typedef {Array<Props | TestFunction | string> | ReadonlyArray<Props | TestFunction | string> | Props | TestFunction | string | null | undefined} Test\n *   Check for an arbitrary node.\n *\n * @callback TestFunction\n *   Check if a node passes a test.\n * @param {unknown} this\n *   The given context.\n * @param {Node} node\n *   A node.\n * @param {number | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean | undefined | void}\n *   Whether this node passes the test.\n *\n *   Note: `void` is included until TS sees no return as `undefined`.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param {unknown} node\n *   Thing to check, typically `Node`.\n * @param {Test} test\n *   A check for a specific node.\n * @param {number | null | undefined} index\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} parent\n *   The node’s parent.\n * @param {unknown} context\n *   Context object (`this`) to pass to `test` functions.\n * @returns {boolean}\n *   Whether `node` is a node and passes a test.\n */\nexport const is =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends ReadonlyArray<string>>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n   *   (<Condition extends Array<string>>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n   *   (<Condition extends string>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((node?: null | undefined) => false) &\n   *   ((node: unknown, test?: null | undefined, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((node: unknown, test?: Test, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => boolean)\n   * )}\n   */\n  (\n    /**\n     * @param {unknown} [node]\n     * @param {Test} [test]\n     * @param {number | null | undefined} [index]\n     * @param {Parent | null | undefined} [parent]\n     * @param {unknown} [context]\n     * @returns {boolean}\n     */\n    // eslint-disable-next-line max-params\n    function (node, test, index, parent, context) {\n      const check = convert(test)\n\n      if (\n        index !== undefined &&\n        index !== null &&\n        (typeof index !== 'number' ||\n          index < 0 ||\n          index === Number.POSITIVE_INFINITY)\n      ) {\n        throw new Error('Expected positive finite index')\n      }\n\n      if (\n        parent !== undefined &&\n        parent !== null &&\n        (!is(parent) || !parent.children)\n      ) {\n        throw new Error('Expected parent node')\n      }\n\n      if (\n        (parent === undefined || parent === null) !==\n        (index === undefined || index === null)\n      ) {\n        throw new Error('Expected both parent and index')\n      }\n\n      return looksLikeANode(node)\n        ? check.call(context, node, index, parent)\n        : false\n    }\n  )\n\n/**\n * Generate an assertion from a test.\n *\n * Useful if you’re going to test many nodes, for example when creating a\n * utility where something else passes a compatible test.\n *\n * The created function is a bit faster because it expects valid input only:\n * a `node`, `index`, and `parent`.\n *\n * @param {Test} test\n *   *   when nullish, checks if `node` is a `Node`.\n *   *   when `string`, works like passing `(node) => node.type === test`.\n *   *   when `function` checks if function passed the node is true.\n *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n *   *   when `array`, checks if any one of the subtests pass.\n * @returns {Check}\n *   An assertion.\n */\nexport const convert =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((test?: null | undefined) => (node?: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((test?: Test) => Check)\n   * )}\n   */\n  (\n    /**\n     * @param {Test} [test]\n     * @returns {Check}\n     */\n    function (test) {\n      if (test === null || test === undefined) {\n        return ok\n      }\n\n      if (typeof test === 'function') {\n        return castFactory(test)\n      }\n\n      if (typeof test === 'object') {\n        return Array.isArray(test)\n          ? anyFactory(test)\n          : // Cast because `ReadonlyArray` goes into the above but `isArray`\n            // narrows to `Array`.\n            propertiesFactory(/** @type {Props} */ (test))\n      }\n\n      if (typeof test === 'string') {\n        return typeFactory(test)\n      }\n\n      throw new Error('Expected function, string, or object as test')\n    }\n  )\n\n/**\n * @param {Array<Props | TestFunction | string>} tests\n * @returns {Check}\n */\nfunction anyFactory(tests) {\n  /** @type {Array<Check>} */\n  const checks = []\n  let index = -1\n\n  while (++index < tests.length) {\n    checks[index] = convert(tests[index])\n  }\n\n  return castFactory(any)\n\n  /**\n   * @this {unknown}\n   * @type {TestFunction}\n   */\n  function any(...parameters) {\n    let index = -1\n\n    while (++index < checks.length) {\n      if (checks[index].apply(this, parameters)) return true\n    }\n\n    return false\n  }\n}\n\n/**\n * Turn an object into a test for a node with a certain fields.\n *\n * @param {Props} check\n * @returns {Check}\n */\nfunction propertiesFactory(check) {\n  const checkAsRecord = /** @type {Record<string, unknown>} */ (check)\n\n  return castFactory(all)\n\n  /**\n   * @param {Node} node\n   * @returns {boolean}\n   */\n  function all(node) {\n    const nodeAsRecord = /** @type {Record<string, unknown>} */ (\n      /** @type {unknown} */ (node)\n    )\n\n    /** @type {string} */\n    let key\n\n    for (key in check) {\n      if (nodeAsRecord[key] !== checkAsRecord[key]) return false\n    }\n\n    return true\n  }\n}\n\n/**\n * Turn a string into a test for a node with a certain type.\n *\n * @param {string} check\n * @returns {Check}\n */\nfunction typeFactory(check) {\n  return castFactory(type)\n\n  /**\n   * @param {Node} node\n   */\n  function type(node) {\n    return node && node.type === check\n  }\n}\n\n/**\n * Turn a custom test into a test for a node that passes that test.\n *\n * @param {TestFunction} testFunction\n * @returns {Check}\n */\nfunction castFactory(testFunction) {\n  return check\n\n  /**\n   * @this {unknown}\n   * @type {Check}\n   */\n  function check(value, index, parent) {\n    return Boolean(\n      looksLikeANode(value) &&\n        testFunction.call(\n          this,\n          value,\n          typeof index === 'number' ? index : undefined,\n          parent || undefined\n        )\n    )\n  }\n}\n\nfunction ok() {\n  return true\n}\n\n/**\n * @param {unknown} value\n * @returns {value is Node}\n */\nfunction looksLikeANode(value) {\n  return value !== null && typeof value === 'object' && 'type' in value\n}\n"],"names":["convert","test","ok","castFactory","anyFactory","propertiesFactory","typeFactory","tests","checks","index","any","parameters","check","checkAsRecord","all","node","nodeAsRecord","key","type","testFunction","value","parent","looksLikeANode"],"mappings":"gFA4IY,MAACA,EAgBT,SAAUC,EAAM,CACd,GAAIA,GAAS,KACX,OAAOC,EAGT,GAAI,OAAOD,GAAS,WAClB,OAAOE,EAAYF,CAAI,EAGzB,GAAI,OAAOA,GAAS,SAClB,OAAO,MAAM,QAAQA,CAAI,EACrBG,EAAWH,CAAI,EAGfI,EAAwCJ,CAAI,EAGlD,GAAI,OAAOA,GAAS,SAClB,OAAOK,EAAYL,CAAI,EAGzB,MAAM,IAAI,MAAM,8CAA8C,CACpE,EAOA,SAASG,EAAWG,EAAO,CAEzB,MAAMC,EAAS,CAAA,EACf,IAAIC,EAAQ,GAEZ,KAAO,EAAEA,EAAQF,EAAM,QACrBC,EAAOC,CAAK,EAAIT,EAAQO,EAAME,CAAK,CAAC,EAGtC,OAAON,EAAYO,CAAG,EAMtB,SAASA,KAAOC,EAAY,CAC1B,IAAIF,EAAQ,GAEZ,KAAO,EAAEA,EAAQD,EAAO,QACtB,GAAIA,EAAOC,CAAK,EAAE,MAAM,KAAME,CAAU,EAAG,MAAO,GAGpD,MAAO,EACX,CACA,CAQA,SAASN,EAAkBO,EAAO,CAChC,MAAMC,EAAwDD,EAE9D,OAAOT,EAAYW,CAAG,EAMtB,SAASA,EAAIC,EAAM,CACjB,MAAMC,EACoBD,EAI1B,IAAIE,EAEJ,IAAKA,KAAOL,EACV,GAAII,EAAaC,CAAG,IAAMJ,EAAcI,CAAG,EAAG,MAAO,GAGvD,MAAO,EACX,CACA,CAQA,SAASX,EAAYM,EAAO,CAC1B,OAAOT,EAAYe,CAAI,EAKvB,SAASA,EAAKH,EAAM,CAClB,OAAOA,GAAQA,EAAK,OAASH,CACjC,CACA,CAQA,SAAST,EAAYgB,EAAc,CACjC,OAAOP,EAMP,SAASA,EAAMQ,EAAOX,EAAOY,EAAQ,CACnC,MAAO,GACLC,EAAeF,CAAK,GAClBD,EAAa,KACX,KACAC,EACA,OAAOX,GAAU,SAAWA,EAAQ,OACpCY,GAAU,MACpB,EAEA,CACA,CAEA,SAASnB,GAAK,CACZ,MAAO,EACT,CAMA,SAASoB,EAAeF,EAAO,CAC7B,OAAOA,IAAU,MAAQ,OAAOA,GAAU,UAAY,SAAUA,CAClE","x_google_ignoreList":[0]}

package/dist/node_modules/unist-util-is/lib/index.es.js

@@ -19,7 +19,14 @@ const i = (
     if (typeof n == "function")
       return c(n);
     if (typeof n == "object")
-      return Array.isArray(n) ? f(n) : y(n);
+      return Array.isArray(n) ? f(n) : (
+        // Cast because `ReadonlyArray` goes into the above but `isArray`
+        // narrows to `Array`.
+        y(
+          /** @type {Props} */
+          n
+        )
+      );
     if (typeof n == "string")
       return l(n);
     throw new Error("Expected function, string, or object as test");

package/dist/node_modules/unist-util-is/lib/index.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es.js","sources":["../../../../../node_modules/unist-util-is/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n */\n\n/**\n * @template Fn\n * @template Fallback\n * @typedef {Fn extends (value: any) => value is infer Thing ? Thing : Fallback} Predicate\n */\n\n/**\n * @callback Check\n *   Check that an arbitrary value is a node.\n * @param {unknown} this\n *   The given context.\n * @param {unknown} [node]\n *   Anything (typically a node).\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean}\n *   Whether this is a node and passes a test.\n *\n * @typedef {Record<string, unknown> | Node} Props\n *   Object to check for equivalence.\n *\n *   Note: `Node` is included as it is common but is not indexable.\n *\n * @typedef {Array<Props | TestFunction | string> | Props | TestFunction | string | null | undefined} Test\n *   Check for an arbitrary node.\n *\n * @callback TestFunction\n *   Check if a node passes a test.\n * @param {unknown} this\n *   The given context.\n * @param {Node} node\n *   A node.\n * @param {number | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean | undefined | void}\n *   Whether this node passes the test.\n *\n *   Note: `void` is included until TS sees no return as `undefined`.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param {unknown} node\n *   Thing to check, typically `Node`.\n * @param {Test} test\n *   A check for a specific node.\n * @param {number | null | undefined} index\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} parent\n *   The node’s parent.\n * @param {unknown} context\n *   Context object (`this`) to pass to `test` functions.\n * @returns {boolean}\n *   Whether `node` is a node and passes a test.\n */\nexport const is =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((node?: null | undefined) => false) &\n   *   ((node: unknown, test?: null | undefined, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((node: unknown, test?: Test, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => boolean)\n   * )}\n   */\n  (\n    /**\n     * @param {unknown} [node]\n     * @param {Test} [test]\n     * @param {number | null | undefined} [index]\n     * @param {Parent | null | undefined} [parent]\n     * @param {unknown} [context]\n     * @returns {boolean}\n     */\n    // eslint-disable-next-line max-params\n    function (node, test, index, parent, context) {\n      const check = convert(test)\n\n      if (\n        index !== undefined &&\n        index !== null &&\n        (typeof index !== 'number' ||\n          index < 0 ||\n          index === Number.POSITIVE_INFINITY)\n      ) {\n        throw new Error('Expected positive finite index')\n      }\n\n      if (\n        parent !== undefined &&\n        parent !== null &&\n        (!is(parent) || !parent.children)\n      ) {\n        throw new Error('Expected parent node')\n      }\n\n      if (\n        (parent === undefined || parent === null) !==\n        (index === undefined || index === null)\n      ) {\n        throw new Error('Expected both parent and index')\n      }\n\n      return looksLikeANode(node)\n        ? check.call(context, node, index, parent)\n        : false\n    }\n  )\n\n/**\n * Generate an assertion from a test.\n *\n * Useful if you’re going to test many nodes, for example when creating a\n * utility where something else passes a compatible test.\n *\n * The created function is a bit faster because it expects valid input only:\n * a `node`, `index`, and `parent`.\n *\n * @param {Test} test\n *   *   when nullish, checks if `node` is a `Node`.\n *   *   when `string`, works like passing `(node) => node.type === test`.\n *   *   when `function` checks if function passed the node is true.\n *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n *   *   when `array`, checks if any one of the subtests pass.\n * @returns {Check}\n *   An assertion.\n */\nexport const convert =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((test?: null | undefined) => (node?: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((test?: Test) => Check)\n   * )}\n   */\n  (\n    /**\n     * @param {Test} [test]\n     * @returns {Check}\n     */\n    function (test) {\n      if (test === null || test === undefined) {\n        return ok\n      }\n\n      if (typeof test === 'function') {\n        return castFactory(test)\n      }\n\n      if (typeof test === 'object') {\n        return Array.isArray(test) ? anyFactory(test) : propsFactory(test)\n      }\n\n      if (typeof test === 'string') {\n        return typeFactory(test)\n      }\n\n      throw new Error('Expected function, string, or object as test')\n    }\n  )\n\n/**\n * @param {Array<Props | TestFunction | string>} tests\n * @returns {Check}\n */\nfunction anyFactory(tests) {\n  /** @type {Array<Check>} */\n  const checks = []\n  let index = -1\n\n  while (++index < tests.length) {\n    checks[index] = convert(tests[index])\n  }\n\n  return castFactory(any)\n\n  /**\n   * @this {unknown}\n   * @type {TestFunction}\n   */\n  function any(...parameters) {\n    let index = -1\n\n    while (++index < checks.length) {\n      if (checks[index].apply(this, parameters)) return true\n    }\n\n    return false\n  }\n}\n\n/**\n * Turn an object into a test for a node with a certain fields.\n *\n * @param {Props} check\n * @returns {Check}\n */\nfunction propsFactory(check) {\n  const checkAsRecord = /** @type {Record<string, unknown>} */ (check)\n\n  return castFactory(all)\n\n  /**\n   * @param {Node} node\n   * @returns {boolean}\n   */\n  function all(node) {\n    const nodeAsRecord = /** @type {Record<string, unknown>} */ (\n      /** @type {unknown} */ (node)\n    )\n\n    /** @type {string} */\n    let key\n\n    for (key in check) {\n      if (nodeAsRecord[key] !== checkAsRecord[key]) return false\n    }\n\n    return true\n  }\n}\n\n/**\n * Turn a string into a test for a node with a certain type.\n *\n * @param {string} check\n * @returns {Check}\n */\nfunction typeFactory(check) {\n  return castFactory(type)\n\n  /**\n   * @param {Node} node\n   */\n  function type(node) {\n    return node && node.type === check\n  }\n}\n\n/**\n * Turn a custom test into a test for a node that passes that test.\n *\n * @param {TestFunction} testFunction\n * @returns {Check}\n */\nfunction castFactory(testFunction) {\n  return check\n\n  /**\n   * @this {unknown}\n   * @type {Check}\n   */\n  function check(value, index, parent) {\n    return Boolean(\n      looksLikeANode(value) &&\n        testFunction.call(\n          this,\n          value,\n          typeof index === 'number' ? index : undefined,\n          parent || undefined\n        )\n    )\n  }\n}\n\nfunction ok() {\n  return true\n}\n\n/**\n * @param {unknown} value\n * @returns {value is Node}\n */\nfunction looksLikeANode(value) {\n  return value !== null && typeof value === 'object' && 'type' in value\n}\n"],"names":["convert","test","ok","castFactory","anyFactory","propsFactory","typeFactory","tests","checks","index","any","parameters","check","checkAsRecord","all","node","nodeAsRecord","key","type","testFunction","value","parent","looksLikeANode"],"mappings":"AA2IY,MAACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBT,SAAUC,GAAM;AACd,QAAIA,KAAS;AACX,aAAOC;AAGT,QAAI,OAAOD,KAAS;AAClB,aAAOE,EAAYF,CAAI;AAGzB,QAAI,OAAOA,KAAS;AAClB,aAAO,MAAM,QAAQA,CAAI,IAAIG,EAAWH,CAAI,IAAII,EAAaJ,CAAI;AAGnE,QAAI,OAAOA,KAAS;AAClB,aAAOK,EAAYL,CAAI;AAGzB,UAAM,IAAI,MAAM,8CAA8C;AAAA,EACpE;AAAA;AAOA,SAASG,EAAWG,GAAO;AAEzB,QAAMC,IAAS,CAAA;AACf,MAAIC,IAAQ;AAEZ,SAAO,EAAEA,IAAQF,EAAM;AACrB,IAAAC,EAAOC,CAAK,IAAIT,EAAQO,EAAME,CAAK,CAAC;AAGtC,SAAON,EAAYO,CAAG;AAMtB,WAASA,KAAOC,GAAY;AAC1B,QAAIF,IAAQ;AAEZ,WAAO,EAAEA,IAAQD,EAAO;AACtB,UAAIA,EAAOC,CAAK,EAAE,MAAM,MAAME,CAAU,EAAG,QAAO;AAGpD,WAAO;AAAA,EACX;AACA;AAQA,SAASN,EAAaO,GAAO;AAC3B,QAAMC;AAAA;AAAA,IAAwDD;AAAA;AAE9D,SAAOT,EAAYW,CAAG;AAMtB,WAASA,EAAIC,GAAM;AACjB,UAAMC;AAAA;AAAA;AAAA,MACoBD;AAAA;AAI1B,QAAIE;AAEJ,SAAKA,KAAOL;AACV,UAAII,EAAaC,CAAG,MAAMJ,EAAcI,CAAG,EAAG,QAAO;AAGvD,WAAO;AAAA,EACX;AACA;AAQA,SAASX,EAAYM,GAAO;AAC1B,SAAOT,EAAYe,CAAI;AAKvB,WAASA,EAAKH,GAAM;AAClB,WAAOA,KAAQA,EAAK,SAASH;AAAA,EACjC;AACA;AAQA,SAAST,EAAYgB,GAAc;AACjC,SAAOP;AAMP,WAASA,EAAMQ,GAAOX,GAAOY,GAAQ;AACnC,WAAO,GACLC,EAAeF,CAAK,KAClBD,EAAa;AAAA,MACX;AAAA,MACAC;AAAA,MACA,OAAOX,KAAU,WAAWA,IAAQ;AAAA,MACpCY,KAAU;AAAA,IACpB;AAAA,EAEA;AACA;AAEA,SAASnB,IAAK;AACZ,SAAO;AACT;AAMA,SAASoB,EAAeF,GAAO;AAC7B,SAAOA,MAAU,QAAQ,OAAOA,KAAU,YAAY,UAAUA;AAClE;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es.js","sources":["../../../../../node_modules/unist-util-is/lib/index.js"],"sourcesContent":["/**\n * @import {Node, Parent} from 'unist'\n */\n\n/**\n * @template Fn\n * @template Fallback\n * @typedef {Fn extends (value: any) => value is infer Thing ? Thing : Fallback} Predicate\n */\n\n/**\n * @callback Check\n *   Check that an arbitrary value is a node.\n * @param {unknown} this\n *   The given context.\n * @param {unknown} [node]\n *   Anything (typically a node).\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean}\n *   Whether this is a node and passes a test.\n *\n * @typedef {Record<string, unknown> | Node} Props\n *   Object to check for equivalence.\n *\n *   Note: `Node` is included as it is common but is not indexable.\n *\n * @typedef {Array<Props | TestFunction | string> | ReadonlyArray<Props | TestFunction | string> | Props | TestFunction | string | null | undefined} Test\n *   Check for an arbitrary node.\n *\n * @callback TestFunction\n *   Check if a node passes a test.\n * @param {unknown} this\n *   The given context.\n * @param {Node} node\n *   A node.\n * @param {number | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean | undefined | void}\n *   Whether this node passes the test.\n *\n *   Note: `void` is included until TS sees no return as `undefined`.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param {unknown} node\n *   Thing to check, typically `Node`.\n * @param {Test} test\n *   A check for a specific node.\n * @param {number | null | undefined} index\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} parent\n *   The node’s parent.\n * @param {unknown} context\n *   Context object (`this`) to pass to `test` functions.\n * @returns {boolean}\n *   Whether `node` is a node and passes a test.\n */\nexport const is =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends ReadonlyArray<string>>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n   *   (<Condition extends Array<string>>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n   *   (<Condition extends string>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((node?: null | undefined) => false) &\n   *   ((node: unknown, test?: null | undefined, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((node: unknown, test?: Test, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => boolean)\n   * )}\n   */\n  (\n    /**\n     * @param {unknown} [node]\n     * @param {Test} [test]\n     * @param {number | null | undefined} [index]\n     * @param {Parent | null | undefined} [parent]\n     * @param {unknown} [context]\n     * @returns {boolean}\n     */\n    // eslint-disable-next-line max-params\n    function (node, test, index, parent, context) {\n      const check = convert(test)\n\n      if (\n        index !== undefined &&\n        index !== null &&\n        (typeof index !== 'number' ||\n          index < 0 ||\n          index === Number.POSITIVE_INFINITY)\n      ) {\n        throw new Error('Expected positive finite index')\n      }\n\n      if (\n        parent !== undefined &&\n        parent !== null &&\n        (!is(parent) || !parent.children)\n      ) {\n        throw new Error('Expected parent node')\n      }\n\n      if (\n        (parent === undefined || parent === null) !==\n        (index === undefined || index === null)\n      ) {\n        throw new Error('Expected both parent and index')\n      }\n\n      return looksLikeANode(node)\n        ? check.call(context, node, index, parent)\n        : false\n    }\n  )\n\n/**\n * Generate an assertion from a test.\n *\n * Useful if you’re going to test many nodes, for example when creating a\n * utility where something else passes a compatible test.\n *\n * The created function is a bit faster because it expects valid input only:\n * a `node`, `index`, and `parent`.\n *\n * @param {Test} test\n *   *   when nullish, checks if `node` is a `Node`.\n *   *   when `string`, works like passing `(node) => node.type === test`.\n *   *   when `function` checks if function passed the node is true.\n *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n *   *   when `array`, checks if any one of the subtests pass.\n * @returns {Check}\n *   An assertion.\n */\nexport const convert =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((test?: null | undefined) => (node?: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((test?: Test) => Check)\n   * )}\n   */\n  (\n    /**\n     * @param {Test} [test]\n     * @returns {Check}\n     */\n    function (test) {\n      if (test === null || test === undefined) {\n        return ok\n      }\n\n      if (typeof test === 'function') {\n        return castFactory(test)\n      }\n\n      if (typeof test === 'object') {\n        return Array.isArray(test)\n          ? anyFactory(test)\n          : // Cast because `ReadonlyArray` goes into the above but `isArray`\n            // narrows to `Array`.\n            propertiesFactory(/** @type {Props} */ (test))\n      }\n\n      if (typeof test === 'string') {\n        return typeFactory(test)\n      }\n\n      throw new Error('Expected function, string, or object as test')\n    }\n  )\n\n/**\n * @param {Array<Props | TestFunction | string>} tests\n * @returns {Check}\n */\nfunction anyFactory(tests) {\n  /** @type {Array<Check>} */\n  const checks = []\n  let index = -1\n\n  while (++index < tests.length) {\n    checks[index] = convert(tests[index])\n  }\n\n  return castFactory(any)\n\n  /**\n   * @this {unknown}\n   * @type {TestFunction}\n   */\n  function any(...parameters) {\n    let index = -1\n\n    while (++index < checks.length) {\n      if (checks[index].apply(this, parameters)) return true\n    }\n\n    return false\n  }\n}\n\n/**\n * Turn an object into a test for a node with a certain fields.\n *\n * @param {Props} check\n * @returns {Check}\n */\nfunction propertiesFactory(check) {\n  const checkAsRecord = /** @type {Record<string, unknown>} */ (check)\n\n  return castFactory(all)\n\n  /**\n   * @param {Node} node\n   * @returns {boolean}\n   */\n  function all(node) {\n    const nodeAsRecord = /** @type {Record<string, unknown>} */ (\n      /** @type {unknown} */ (node)\n    )\n\n    /** @type {string} */\n    let key\n\n    for (key in check) {\n      if (nodeAsRecord[key] !== checkAsRecord[key]) return false\n    }\n\n    return true\n  }\n}\n\n/**\n * Turn a string into a test for a node with a certain type.\n *\n * @param {string} check\n * @returns {Check}\n */\nfunction typeFactory(check) {\n  return castFactory(type)\n\n  /**\n   * @param {Node} node\n   */\n  function type(node) {\n    return node && node.type === check\n  }\n}\n\n/**\n * Turn a custom test into a test for a node that passes that test.\n *\n * @param {TestFunction} testFunction\n * @returns {Check}\n */\nfunction castFactory(testFunction) {\n  return check\n\n  /**\n   * @this {unknown}\n   * @type {Check}\n   */\n  function check(value, index, parent) {\n    return Boolean(\n      looksLikeANode(value) &&\n        testFunction.call(\n          this,\n          value,\n          typeof index === 'number' ? index : undefined,\n          parent || undefined\n        )\n    )\n  }\n}\n\nfunction ok() {\n  return true\n}\n\n/**\n * @param {unknown} value\n * @returns {value is Node}\n */\nfunction looksLikeANode(value) {\n  return value !== null && typeof value === 'object' && 'type' in value\n}\n"],"names":["convert","test","ok","castFactory","anyFactory","propertiesFactory","typeFactory","tests","checks","index","any","parameters","check","checkAsRecord","all","node","nodeAsRecord","key","type","testFunction","value","parent","looksLikeANode"],"mappings":"AA4IY,MAACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBT,SAAUC,GAAM;AACd,QAAIA,KAAS;AACX,aAAOC;AAGT,QAAI,OAAOD,KAAS;AAClB,aAAOE,EAAYF,CAAI;AAGzB,QAAI,OAAOA,KAAS;AAClB,aAAO,MAAM,QAAQA,CAAI,IACrBG,EAAWH,CAAI;AAAA;AAAA;AAAA,QAGfI;AAAA;AAAA,UAAwCJ;AAAA,QAAI;AAAA;AAGlD,QAAI,OAAOA,KAAS;AAClB,aAAOK,EAAYL,CAAI;AAGzB,UAAM,IAAI,MAAM,8CAA8C;AAAA,EACpE;AAAA;AAOA,SAASG,EAAWG,GAAO;AAEzB,QAAMC,IAAS,CAAA;AACf,MAAIC,IAAQ;AAEZ,SAAO,EAAEA,IAAQF,EAAM;AACrB,IAAAC,EAAOC,CAAK,IAAIT,EAAQO,EAAME,CAAK,CAAC;AAGtC,SAAON,EAAYO,CAAG;AAMtB,WAASA,KAAOC,GAAY;AAC1B,QAAIF,IAAQ;AAEZ,WAAO,EAAEA,IAAQD,EAAO;AACtB,UAAIA,EAAOC,CAAK,EAAE,MAAM,MAAME,CAAU,EAAG,QAAO;AAGpD,WAAO;AAAA,EACX;AACA;AAQA,SAASN,EAAkBO,GAAO;AAChC,QAAMC;AAAA;AAAA,IAAwDD;AAAA;AAE9D,SAAOT,EAAYW,CAAG;AAMtB,WAASA,EAAIC,GAAM;AACjB,UAAMC;AAAA;AAAA;AAAA,MACoBD;AAAA;AAI1B,QAAIE;AAEJ,SAAKA,KAAOL;AACV,UAAII,EAAaC,CAAG,MAAMJ,EAAcI,CAAG,EAAG,QAAO;AAGvD,WAAO;AAAA,EACX;AACA;AAQA,SAASX,EAAYM,GAAO;AAC1B,SAAOT,EAAYe,CAAI;AAKvB,WAASA,EAAKH,GAAM;AAClB,WAAOA,KAAQA,EAAK,SAASH;AAAA,EACjC;AACA;AAQA,SAAST,EAAYgB,GAAc;AACjC,SAAOP;AAMP,WAASA,EAAMQ,GAAOX,GAAOY,GAAQ;AACnC,WAAO,GACLC,EAAeF,CAAK,KAClBD,EAAa;AAAA,MACX;AAAA,MACAC;AAAA,MACA,OAAOX,KAAU,WAAWA,IAAQ;AAAA,MACpCY,KAAU;AAAA,IACpB;AAAA,EAEA;AACA;AAEA,SAASnB,IAAK;AACZ,SAAO;AACT;AAMA,SAASoB,EAAeF,GAAO;AAC7B,SAAOA,MAAU,QAAQ,OAAOA,KAAU,YAAY,UAAUA;AAClE;","x_google_ignoreList":[0]}

package/dist/node_modules/unist-util-visit-parents/lib/index.cjs.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs.js","sources":["../../../../../node_modules/unist-util-visit-parents/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} UnistNode\n * @typedef {import('unist').Parent} UnistParent\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends Array<any>\n *   ? MatchesOne<Value, Check[keyof Check]>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {InternalAncestor<InclusiveDescendant<Tree>, Child>} Ancestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {'skip' | boolean} Action\n *   Union of the action types.\n *\n * @typedef {number} Index\n *   Move to the sibling at `index` next (after node itself is completely\n *   traversed).\n *\n *   Useful if mutating the tree, such as removing the node the visitor is\n *   currently on, or any of its previous siblings.\n *   Results less than 0 or greater than or equal to `children.length` stop\n *   traversing the parent.\n *\n * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple\n *   List with one or two values, the first an action, the second an index.\n *\n * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult\n *   Any value that can be returned from a visitor.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform the parent of node (the last of `ancestors`).\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of an ancestor still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Array<VisitedParents>} ancestors\n *   Ancestors of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [VisitedParents=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Matches<InclusiveDescendant<Tree>, Check>, Ancestor<Tree, Matches<InclusiveDescendant<Tree>, Check>>>} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parents`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Tree type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from 'unist-util-visit-parents/do-not-use-color'\n\n/** @type {Readonly<ActionTuple>} */\nconst empty = []\n\n/**\n * Continue traversing as normal.\n */\nexport const CONTINUE = true\n\n/**\n * Stop traversing immediately.\n */\nexport const EXIT = false\n\n/**\n * Do not traverse this node’s children.\n */\nexport const SKIP = 'skip'\n\n/**\n * Visit nodes, with ancestral information.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} test\n *   `unist-util-is`-compatible test\n * @param {Visitor | boolean | null | undefined} [visitor]\n *   Handle each node.\n * @param {boolean | null | undefined} [reverse]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visitParents(tree, test, visitor, reverse) {\n  /** @type {Test} */\n  let check\n\n  if (typeof test === 'function' && typeof visitor !== 'function') {\n    reverse = visitor\n    // @ts-expect-error no visitor given, so `visitor` is test.\n    visitor = test\n  } else {\n    // @ts-expect-error visitor given, so `test` isn’t a visitor.\n    check = test\n  }\n\n  const is = convert(check)\n  const step = reverse ? -1 : 1\n\n  factory(tree, undefined, [])()\n\n  /**\n   * @param {UnistNode} node\n   * @param {number | undefined} index\n   * @param {Array<UnistParent>} parents\n   */\n  function factory(node, index, parents) {\n    const value = /** @type {Record<string, unknown>} */ (\n      node && typeof node === 'object' ? node : {}\n    )\n\n    if (typeof value.type === 'string') {\n      const name =\n        // `hast`\n        typeof value.tagName === 'string'\n          ? value.tagName\n          : // `xast`\n          typeof value.name === 'string'\n          ? value.name\n          : undefined\n\n      Object.defineProperty(visit, 'name', {\n        value:\n          'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'\n      })\n    }\n\n    return visit\n\n    function visit() {\n      /** @type {Readonly<ActionTuple>} */\n      let result = empty\n      /** @type {Readonly<ActionTuple>} */\n      let subresult\n      /** @type {number} */\n      let offset\n      /** @type {Array<UnistParent>} */\n      let grandparents\n\n      if (!test || is(node, index, parents[parents.length - 1] || undefined)) {\n        // @ts-expect-error: `visitor` is now a visitor.\n        result = toResult(visitor(node, parents))\n\n        if (result[0] === EXIT) {\n          return result\n        }\n      }\n\n      if ('children' in node && node.children) {\n        const nodeAsParent = /** @type {UnistParent} */ (node)\n\n        if (nodeAsParent.children && result[0] !== SKIP) {\n          offset = (reverse ? nodeAsParent.children.length : -1) + step\n          grandparents = parents.concat(nodeAsParent)\n\n          while (offset > -1 && offset < nodeAsParent.children.length) {\n            const child = nodeAsParent.children[offset]\n\n            subresult = factory(child, offset, grandparents)()\n\n            if (subresult[0] === EXIT) {\n              return subresult\n            }\n\n            offset =\n              typeof subresult[1] === 'number' ? subresult[1] : offset + step\n          }\n        }\n      }\n\n      return result\n    }\n  }\n}\n\n/**\n * Turn a return value into a clean result.\n *\n * @param {VisitorResult} value\n *   Valid return values from visitors.\n * @returns {Readonly<ActionTuple>}\n *   Clean result.\n */\nfunction toResult(value) {\n  if (Array.isArray(value)) {\n    return value\n  }\n\n  if (typeof value === 'number') {\n    return [CONTINUE, value]\n  }\n\n  return value === null || value === undefined ? empty : [value]\n}\n"],"names":["empty","CONTINUE","EXIT","SKIP","visitParents","tree","test","visitor","reverse","check","is","convert","step","factory","node","index","parents","value","name","visit","color","result","subresult","offset","grandparents","toResult","nodeAsParent","child"],"mappings":"oKA+NMA,EAAQ,CAAA,EAKDC,EAAW,GAKXC,EAAO,GAKPC,EAAO,OAiDb,SAASC,EAAaC,EAAMC,EAAMC,EAASC,EAAS,CAEzD,IAAIC,EAEA,OAAOH,GAAS,YAAc,OAAOC,GAAY,YACnDC,EAAUD,EAEVA,EAAUD,GAGVG,EAAQH,EAGV,MAAMI,EAAKC,EAAAA,QAAQF,CAAK,EAClBG,EAAOJ,EAAU,GAAK,EAE5BK,EAAQR,EAAM,OAAW,EAAE,EAAC,EAO5B,SAASQ,EAAQC,EAAMC,EAAOC,EAAS,CACrC,MAAMC,EACJH,GAAQ,OAAOA,GAAS,SAAWA,EAAO,CAAA,EAG5C,GAAI,OAAOG,EAAM,MAAS,SAAU,CAClC,MAAMC,EAEJ,OAAOD,EAAM,SAAY,SACrBA,EAAM,QAER,OAAOA,EAAM,MAAS,SACpBA,EAAM,KACN,OAEN,OAAO,eAAeE,EAAO,OAAQ,CACnC,MACE,SAAWC,EAAAA,MAAMN,EAAK,MAAQI,EAAO,IAAMA,EAAO,IAAM,GAAG,EAAI,GAClE,CAAA,CACP,CAEI,OAAOC,EAEP,SAASA,GAAQ,CAEf,IAAIE,EAASrB,EAETsB,EAEAC,EAEAC,EAEJ,IAAI,CAAClB,GAAQI,EAAGI,EAAMC,EAAOC,EAAQA,EAAQ,OAAS,CAAC,GAAK,MAAS,KAEnEK,EAASI,EAASlB,EAAQO,EAAME,CAAO,CAAC,EAEpCK,EAAO,CAAC,IAAMnB,GAChB,OAAOmB,EAIX,GAAI,aAAcP,GAAQA,EAAK,SAAU,CACvC,MAAMY,EAA2CZ,EAEjD,GAAIY,EAAa,UAAYL,EAAO,CAAC,IAAMlB,EAIzC,IAHAoB,GAAUf,EAAUkB,EAAa,SAAS,OAAS,IAAMd,EACzDY,EAAeR,EAAQ,OAAOU,CAAY,EAEnCH,EAAS,IAAMA,EAASG,EAAa,SAAS,QAAQ,CAC3D,MAAMC,EAAQD,EAAa,SAASH,CAAM,EAI1C,GAFAD,EAAYT,EAAQc,EAAOJ,EAAQC,CAAY,EAAC,EAE5CF,EAAU,CAAC,IAAMpB,EACnB,OAAOoB,EAGTC,EACE,OAAOD,EAAU,CAAC,GAAM,SAAWA,EAAU,CAAC,EAAIC,EAASX,CACzE,CAEA,CAEM,OAAOS,CACb,CACA,CACA,CAUA,SAASI,EAASR,EAAO,CACvB,OAAI,MAAM,QAAQA,CAAK,EACdA,EAGL,OAAOA,GAAU,SACZ,CAAChB,EAAUgB,CAAK,EAGlBA,GAAU,KAA8BjB,EAAQ,CAACiB,CAAK,CAC/D","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs.js","sources":["../../../../../node_modules/unist-util-visit-parents/lib/index.js"],"sourcesContent":["/**\n * @import {Node as UnistNode, Parent as UnistParent} from 'unist'\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends ReadonlyArray<infer T>\n *   ? MatchesOne<Value, T>\n *   : Check extends Array<infer T>\n *   ? MatchesOne<Value, T>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {InternalAncestor<InclusiveDescendant<Tree>, Child>} Ancestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {'skip' | boolean} Action\n *   Union of the action types.\n *\n * @typedef {number} Index\n *   Move to the sibling at `index` next (after node itself is completely\n *   traversed).\n *\n *   Useful if mutating the tree, such as removing the node the visitor is\n *   currently on, or any of its previous siblings.\n *   Results less than 0 or greater than or equal to `children.length` stop\n *   traversing the parent.\n *\n * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple\n *   List with one or two values, the first an action, the second an index.\n *\n * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult\n *   Any value that can be returned from a visitor.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform the parent of node (the last of `ancestors`).\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of an ancestor still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Array<VisitedParents>} ancestors\n *   Ancestors of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [VisitedParents=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Matches<InclusiveDescendant<Tree>, Check>, Ancestor<Tree, Matches<InclusiveDescendant<Tree>, Check>>>} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parents`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Tree type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from 'unist-util-visit-parents/do-not-use-color'\n\n/** @type {Readonly<ActionTuple>} */\nconst empty = []\n\n/**\n * Continue traversing as normal.\n */\nexport const CONTINUE = true\n\n/**\n * Stop traversing immediately.\n */\nexport const EXIT = false\n\n/**\n * Do not traverse this node’s children.\n */\nexport const SKIP = 'skip'\n\n/**\n * Visit nodes, with ancestral information.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} test\n *   `unist-util-is`-compatible test\n * @param {Visitor | boolean | null | undefined} [visitor]\n *   Handle each node.\n * @param {boolean | null | undefined} [reverse]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visitParents(tree, test, visitor, reverse) {\n  /** @type {Test} */\n  let check\n\n  if (typeof test === 'function' && typeof visitor !== 'function') {\n    reverse = visitor\n    // @ts-expect-error no visitor given, so `visitor` is test.\n    visitor = test\n  } else {\n    // @ts-expect-error visitor given, so `test` isn’t a visitor.\n    check = test\n  }\n\n  const is = convert(check)\n  const step = reverse ? -1 : 1\n\n  factory(tree, undefined, [])()\n\n  /**\n   * @param {UnistNode} node\n   * @param {number | undefined} index\n   * @param {Array<UnistParent>} parents\n   */\n  function factory(node, index, parents) {\n    const value = /** @type {Record<string, unknown>} */ (\n      node && typeof node === 'object' ? node : {}\n    )\n\n    if (typeof value.type === 'string') {\n      const name =\n        // `hast`\n        typeof value.tagName === 'string'\n          ? value.tagName\n          : // `xast`\n            typeof value.name === 'string'\n            ? value.name\n            : undefined\n\n      Object.defineProperty(visit, 'name', {\n        value:\n          'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'\n      })\n    }\n\n    return visit\n\n    function visit() {\n      /** @type {Readonly<ActionTuple>} */\n      let result = empty\n      /** @type {Readonly<ActionTuple>} */\n      let subresult\n      /** @type {number} */\n      let offset\n      /** @type {Array<UnistParent>} */\n      let grandparents\n\n      if (!test || is(node, index, parents[parents.length - 1] || undefined)) {\n        // @ts-expect-error: `visitor` is now a visitor.\n        result = toResult(visitor(node, parents))\n\n        if (result[0] === EXIT) {\n          return result\n        }\n      }\n\n      if ('children' in node && node.children) {\n        const nodeAsParent = /** @type {UnistParent} */ (node)\n\n        if (nodeAsParent.children && result[0] !== SKIP) {\n          offset = (reverse ? nodeAsParent.children.length : -1) + step\n          grandparents = parents.concat(nodeAsParent)\n\n          while (offset > -1 && offset < nodeAsParent.children.length) {\n            const child = nodeAsParent.children[offset]\n\n            subresult = factory(child, offset, grandparents)()\n\n            if (subresult[0] === EXIT) {\n              return subresult\n            }\n\n            offset =\n              typeof subresult[1] === 'number' ? subresult[1] : offset + step\n          }\n        }\n      }\n\n      return result\n    }\n  }\n}\n\n/**\n * Turn a return value into a clean result.\n *\n * @param {VisitorResult} value\n *   Valid return values from visitors.\n * @returns {Readonly<ActionTuple>}\n *   Clean result.\n */\nfunction toResult(value) {\n  if (Array.isArray(value)) {\n    return value\n  }\n\n  if (typeof value === 'number') {\n    return [CONTINUE, value]\n  }\n\n  return value === null || value === undefined ? empty : [value]\n}\n"],"names":["empty","CONTINUE","EXIT","SKIP","visitParents","tree","test","visitor","reverse","check","is","convert","step","factory","node","index","parents","value","name","visit","color","result","subresult","offset","grandparents","toResult","nodeAsParent","child"],"mappings":"oKAgOMA,EAAQ,CAAA,EAKDC,EAAW,GAKXC,EAAO,GAKPC,EAAO,OAiDb,SAASC,EAAaC,EAAMC,EAAMC,EAASC,EAAS,CAEzD,IAAIC,EAEA,OAAOH,GAAS,YAAc,OAAOC,GAAY,YACnDC,EAAUD,EAEVA,EAAUD,GAGVG,EAAQH,EAGV,MAAMI,EAAKC,EAAAA,QAAQF,CAAK,EAClBG,EAAOJ,EAAU,GAAK,EAE5BK,EAAQR,EAAM,OAAW,EAAE,EAAC,EAO5B,SAASQ,EAAQC,EAAMC,EAAOC,EAAS,CACrC,MAAMC,EACJH,GAAQ,OAAOA,GAAS,SAAWA,EAAO,CAAA,EAG5C,GAAI,OAAOG,EAAM,MAAS,SAAU,CAClC,MAAMC,EAEJ,OAAOD,EAAM,SAAY,SACrBA,EAAM,QAEN,OAAOA,EAAM,MAAS,SACpBA,EAAM,KACN,OAER,OAAO,eAAeE,EAAO,OAAQ,CACnC,MACE,SAAWC,EAAAA,MAAMN,EAAK,MAAQI,EAAO,IAAMA,EAAO,IAAM,GAAG,EAAI,GAClE,CAAA,CACP,CAEI,OAAOC,EAEP,SAASA,GAAQ,CAEf,IAAIE,EAASrB,EAETsB,EAEAC,EAEAC,EAEJ,IAAI,CAAClB,GAAQI,EAAGI,EAAMC,EAAOC,EAAQA,EAAQ,OAAS,CAAC,GAAK,MAAS,KAEnEK,EAASI,EAASlB,EAAQO,EAAME,CAAO,CAAC,EAEpCK,EAAO,CAAC,IAAMnB,GAChB,OAAOmB,EAIX,GAAI,aAAcP,GAAQA,EAAK,SAAU,CACvC,MAAMY,EAA2CZ,EAEjD,GAAIY,EAAa,UAAYL,EAAO,CAAC,IAAMlB,EAIzC,IAHAoB,GAAUf,EAAUkB,EAAa,SAAS,OAAS,IAAMd,EACzDY,EAAeR,EAAQ,OAAOU,CAAY,EAEnCH,EAAS,IAAMA,EAASG,EAAa,SAAS,QAAQ,CAC3D,MAAMC,EAAQD,EAAa,SAASH,CAAM,EAI1C,GAFAD,EAAYT,EAAQc,EAAOJ,EAAQC,CAAY,EAAC,EAE5CF,EAAU,CAAC,IAAMpB,EACnB,OAAOoB,EAGTC,EACE,OAAOD,EAAU,CAAC,GAAM,SAAWA,EAAU,CAAC,EAAIC,EAASX,CACzE,CAEA,CAEM,OAAOS,CACb,CACA,CACA,CAUA,SAASI,EAASR,EAAO,CACvB,OAAI,MAAM,QAAQA,CAAK,EACdA,EAGL,OAAOA,GAAU,SACZ,CAAChB,EAAUgB,CAAK,EAGlBA,GAAU,KAA8BjB,EAAQ,CAACiB,CAAK,CAC/D","x_google_ignoreList":[0]}