tdesign-react 1.11.8-patch.1 → 1.11.8-patch.2

package/lib/_chunks/dep-314368fa.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-314368fa.js","sources":["../../../common/js/tree-v1/tree-node-model.ts","../../../common/js/tree-v1/tree-node.ts"],"sourcesContent":["import { isUndefined, isBoolean, pick, omit } from 'lodash-es';\nimport { TreeNode } from './tree-node';\nimport { OptionData } from '../common';\nimport {\n  TreeNodeValue,\n  TypeTreeNodeModel,\n  TypeTreeNodeData,\n  TypeTreeItem,\n  TreeNodeModelProps,\n} from './types';\nimport log from '../log/log';\n\n// 获取节点需要暴露的属性\nfunction getExposedProps(node: TreeNode): TreeNodeModelProps {\n  const props = pick(node, [\n    'value',\n    'label',\n    'data',\n    'actived',\n    'expanded',\n    'checked',\n    'indeterminate',\n    'loading',\n  ]) as TreeNodeModelProps;\n  return props;\n}\n\n// 封装对外暴露的对象\nexport function createNodeModel(node: TreeNode): TypeTreeNodeModel {\n  const props = getExposedProps(node);\n\n  const model: TypeTreeNodeModel = {\n    ...props,\n\n    /**\n     * 获取节点所处层级\n     * @return number 节点层级序号\n     */\n    getLevel() {\n      return node.getLevel();\n    },\n\n    /**\n     * 获取节点在父节点的子节点列表中的位置\n     * - 如果没有父节点，则获取节点在根节点列表的位置\n     * @return number 节点位置序号\n     */\n    getIndex() {\n      return node.getIndex();\n    },\n\n    /**\n     * 是否为兄弟节点中的第一个节点\n     * @return boolean 是否为第一个节点\n     */\n    isFirst() {\n      return node.isFirst();\n    },\n\n    /**\n     * 是否为兄弟节点中的最后一个节点\n     * @return boolean 是否为最后一个节点\n     */\n    isLast() {\n      return node.isLast();\n    },\n\n    /**\n     * 是否为叶子节点，叶子节点没有子节点\n     * @return boolean 是否为叶子节点\n     */\n    isLeaf() {\n      return node.isLeaf();\n    },\n\n    /**\n     * 在当前节点之前插入节点\n     * @param {object} newData 要插入的节点或者数据\n     * @return void\n     */\n    insertBefore(newData: TypeTreeItem) {\n      return node.insertBefore(newData);\n    },\n\n    /**\n     * 在当前节点之后插入节点\n     * @param {object} newData 要插入的节点或者数据\n     * @return void\n     */\n    insertAfter(newData: TypeTreeItem) {\n      return node.insertAfter(newData);\n    },\n\n    /**\n     * 追加节点数据\n     * @param {object | object[]} data 节点数据\n     * @return void\n     */\n    appendData(data: TypeTreeNodeData | TypeTreeNodeData[]) {\n      return node.append(data);\n    },\n\n    /**\n     * 返回路径节点\n     * - 路径节点包含自己在内\n     * - 节点顺序与父级节点顺序相反，从根到当前\n     * @return TreeNodeModel[] 路径节点数组\n     */\n    getPath(): TypeTreeNodeModel[] {\n      const nodes = node.getPath();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    /**\n     * 获取本节点的父节点\n     * @return TreeNodeModel 父节点\n     */\n    getParent(): TypeTreeNodeModel {\n      return node.parent?.getModel();\n    },\n\n    /**\n     * 获取所有父级节点\n     * - 顺序为从当前到根\n     * @return TreeNodeModel[] 父级节点数组\n     */\n    getParents(): TypeTreeNodeModel[] {\n      const nodes = node.getParents();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    /**\n     * 获取本节点的根节点\n     * @return TreeNodeModel 根节点\n     */\n    getRoot(): TypeTreeNodeModel {\n      const root = node.getRoot();\n      return root?.getModel();\n    },\n\n    /**\n     * 获取所有兄弟节点，包含自己在内\n     * @return TreeNodeModel[] 兄弟节点数组\n     */\n    getSiblings(): TypeTreeNodeModel[] {\n      const nodes = node.getSiblings();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    /**\n     * 获取当前节点的子节点\n     * @param {boolean} deep 是否获取所有深层子节点\n     * @return TreeNodeModel[] 子节点数组\n     */\n    getChildren(deep?: boolean): boolean | TypeTreeNodeModel[] {\n      let childrenModel: boolean | TypeTreeNodeModel[] = false;\n      const { children } = node;\n      if (Array.isArray(children)) {\n        if (children.length > 0) {\n          if (deep) {\n            const nodes = node.walk();\n            nodes.shift();\n            childrenModel = nodes.map((item) => item.getModel());\n          } else {\n            childrenModel = children.map((item) => item.getModel());\n          }\n        } else {\n          childrenModel = false;\n        }\n      } else if (isBoolean(children)) {\n        childrenModel = children;\n      }\n      return childrenModel;\n    },\n\n    /**\n     * 移除节点\n     * - 提供 value 参数，移除本节点子节点中的节点\n     * - 不提供 value 参数，移除自己\n     * @param {string} value 目标节点值\n     * @return void\n     */\n    remove(value?: TreeNodeValue) {\n      if (!value) {\n        node.remove();\n        return;\n      }\n\n      const { tree } = node;\n      const targetNode = tree.getNode(value);\n      if (!targetNode) {\n        log.warnOnce('Tree', `\\`${value}\\` is not exist`);\n        return;\n      }\n\n      const parents = targetNode.getParents();\n      const parentValues = parents.map((pnode) => (pnode.value));\n      if (parentValues.indexOf(node.value) < 0) {\n        log.warnOnce('Tree', `\\`${value}\\` is not a childNode of current node`);\n        return;\n      }\n      targetNode.remove();\n    },\n\n    /**\n     * 设置本节点携带的元数据\n     * @param {object} data 节点数据\n     * @return void\n     */\n    setData(data: OptionData) {\n      // 详细细节可见 https://github.com/Tencent/tdesign-common/issues/655\n      const _data = omit(data, ['children', 'value', 'label']);\n      const { keys } = node.tree.config;\n      const dataValue = data[keys?.value || 'value'];\n      const dataLabel = data[keys?.label || 'label'];\n      if (!isUndefined(dataValue)) _data.value = dataValue;\n      if (!isUndefined(dataLabel)) _data.label = dataLabel;\n\n      Object.assign(node.data, _data);\n      Object.assign(node, _data);\n    },\n  };\n\n  return model;\n}\n\n/**\n * 同步节点属性到封装对象\n * @param {TreeNodeModel} 节点封装对象\n * @param {object} data 节点数据\n * @return void\n */\nexport function updateNodeModel(model: TypeTreeNodeModel, node: TreeNode) {\n  // 同步节点属性\n  const props = getExposedProps(node);\n  Object.assign(model, props);\n}\n","import { isNull, isFunction, isNumber, uniqueId, isBoolean, isNil, get } from 'lodash-es';\nimport { TreeStore } from './tree-store';\nimport {\n  TreeNodeValue,\n  TreeNodeState,\n  TypeIdMap,\n  TypeTreeItem,\n  TypeSettingOptions,\n  TypeTreeNodeModel,\n  TypeTreeNodeData,\n} from './types';\nimport { createNodeModel, updateNodeModel } from './tree-node-model';\nimport log from '../log';\n\nconst { hasOwnProperty } = Object.prototype;\n\n// 这里的属性为 data 中属性可以同步到 treeNode 实例属性的白名单\n// 仅 label 属性和在列表中的属性可以通过 set 方法配置到 treeNode 实例上\nexport const settableStatus: Record<string, boolean | null> = {\n  expandMutex: null,\n  activable: null,\n  checkable: null,\n  draggable: null,\n  loading: false,\n};\n\nexport const settableProps = Object.keys(settableStatus);\n\nexport const syncableProps = [\n  ...settableProps,\n  'actived',\n  'expanded',\n  'checked',\n];\n\nexport const privateKey = '__tdesign_id__';\n\n// vm 开头为视图属性，不可以外部设置\n// 用于触发视图更新\n// public 方法，在 ui 组件中有可能在使用，会保障其输入输出实现\n// private 方法，可能会改动其输入输出\n\n/**\n * tree 节点数据模型\n * @class TreeNode\n * @param {TreeStore} tree TreeStore 实例\n * @param {object} [data] 节点数据\n * @param {TreeNode} parent 指定的当前 TreeStore 实例中的父节点\n */\nexport class TreeNode {\n  // 节点隶属的树实例\n  public tree: TreeStore;\n\n  // 节点私有 id，不接受外部传入，确保唯一性\n  public [privateKey]: string;\n\n  // 节点 id ，唯一标志\n  public value: string;\n\n  // 节点文本\n  public label: string;\n\n  // 节点数据\n  public data: TypeTreeNodeData;\n\n  // 父节点\n  public parent: TreeNode;\n\n  // 子节点列表\n  public children: TreeNode[] | boolean;\n\n  // 暴露的 treeNodeModel，这个对象的属性和 api 提供给用户使用\n  public model: TypeTreeNodeModel;\n\n  // 是否为叶节点\n  public vmIsLeaf: boolean;\n\n  // 是否为子节点中的第一个\n  public vmIsFirst: boolean;\n\n  // 是否为子节点中的最后\n  public vmIsLast: boolean;\n\n  // 节点是否是经过过滤剩下的\n  public vmIsRest: boolean;\n\n  // 节点是否展示为锁定状态\n  public vmIsLocked: boolean;\n\n  // 节点在视图上实际的展开状态\n  public expanded: boolean;\n\n  // 展开时是否收起同级节点，对子节点生效\n  public expandMutex: null | boolean;\n\n  // 节点在视图上实际的激活状态\n  public actived: boolean;\n\n  // 是否可激活\n  public activable: null | boolean;\n\n  // 是否可选中\n  public checkable: null | boolean;\n\n  // 是否可选中的视图呈现\n  public vmCheckable: boolean;\n\n  // 节点在视图上实际的选中态\n  public checked: boolean;\n\n  public isIndeterminateManual: boolean;\n\n  // 节点实际是否为半选状态\n  public indeterminate: boolean;\n\n  // 节点是否已禁用\n  public disabled: null | boolean;\n\n  // 节点是否可拖动\n  public draggable: null | boolean;\n\n  // 节点是否可视\n  public visible: boolean;\n\n  // 节点在树中的层级\n  public level: number;\n\n  // 节点是否正在加载数据\n  public loading: boolean;\n\n  public constructor(\n    tree: TreeStore,\n    data?: TypeTreeNodeData,\n    parent?: TreeNode\n  ) {\n    this.data = data;\n    this.tree = tree;\n\n    const config = tree.config || {};\n    const prefix = config.prefix || 't';\n    const keys = config.keys || {};\n    const propChildren = keys.children || 'children';\n    const propLabel = keys.label || 'label';\n    const propValue = keys.value || 'value';\n    const propsDisabled = keys.disabled || 'disabled';\n\n    // 节点自身初始化数据\n    this.model = null;\n    this.children = null;\n    this.level = 0;\n\n    // vm 开头为视图属性，不可以外部设置\n    this.vmCheckable = false;\n    this.vmIsLeaf = false;\n    this.vmIsFirst = false;\n    this.vmIsLast = false;\n    this.vmIsRest = false;\n    this.vmIsLocked = false;\n\n    // 初始化节点基本状态\n    this.visible = false;\n    this.actived = false;\n    this.checked = false;\n    this.indeterminate = false;\n    this.loading = false;\n    this.expanded = config.expandAll;\n\n    // 下面几个属性，节点初始化的时候，可以设置与 treeStore.config 不同的值\n    // 初始化默认值为 null, 则在方法判断时，默认以 treeStore.config 为准\n    // 传递或者设置属性为 boolean 类型的值，则以节点属性值为准\n    // 这种处理方式主要是解决 treeStore.setConfig 方法配置全局属性导致的状态切换与保留的问题\n    this.activable = null;\n    this.checkable = null;\n    this.expandMutex = null;\n    this.draggable = null;\n\n    // 为节点设置唯一 id\n    // tree 数据替换时，value 相同有可能导致节点状态渲染冲突\n    // 用这个 唯一 id 来解决，用于类似 vue 组件的唯一 key 指定场景\n    this[privateKey] = uniqueId(prefix);\n\n    // 设置 value\n    // 没有 value 的时候，value 默认使用自动生成的 唯一 id\n    this.value = isNil(get(data, propValue))\n      ? this[privateKey]\n      : get(data, propValue);\n    const { nodeMap, privateMap } = tree;\n    if (nodeMap.get(this.value)) {\n      log.warn('Tree', `Dulplicate value: ${this.value}`);\n    }\n    nodeMap.set(this.value, this);\n    privateMap.set(this[privateKey], this);\n\n    // 设置标签\n    this.label = get(data, propLabel) || '';\n    // 设置是否禁用\n    this.disabled = get(data, propsDisabled);\n\n    // 设置子节点\n    const children = data[propChildren];\n    // 子节点为 true 的状态逻辑需要放到状态计算之前\n    // 初始化加载逻辑需要依据这个来进行\n    if (children === true) {\n      this.children = children;\n    }\n\n    // 设置父节点\n    if (parent && parent instanceof TreeNode) {\n      this.parent = parent;\n    } else {\n      this.parent = null;\n    }\n\n    // 同步数据属性到节点属性\n    // 仅 syncableStatus 列举的属性被同步到 treeNode 实例属性\n    syncableProps.forEach((prop) => {\n      if (typeof data[prop] !== 'undefined') {\n        // @ts-ignore\n        // TODO: 待移除\n        this[prop] = data[prop];\n      }\n    });\n\n    // 初始化节点状态\n    this.initActived();\n    this.initExpanded();\n    this.initChecked();\n\n    // 这里的子节点加载逻辑不能放到状态初始化之前\n    // 因为子节点状态计算依赖父节点初始化状态\n    if (Array.isArray(children)) {\n      this.append(children);\n    } else if (children === true && !config.lazy) {\n      this.loadChildren();\n    }\n\n    // checked 状态依赖于子节点状态\n    // 因此子节点插入之后需要再次更新状态\n    this.updateChecked();\n\n    // 标记节点更新\n    this.update();\n    // 创建节点需要回流操作\n    tree.reflow(this);\n  }\n\n  /* ------ 状态初始化 ------ */\n\n  /**\n   * 初始化选中态\n   * @return void\n   */\n  private initChecked(): void {\n    const { tree, value, parent } = this;\n    const { checkedMap } = tree;\n    const { checkStrictly } = tree.config;\n    if (this.checked) {\n      checkedMap.set(value, true);\n    }\n    // 这里不可以使用 parent.isChecked 方法\n    // 因为当前节点创建时尚未插入父节点的 children 数组，可能父节点选中态仅受到之前子节点状态的影响\n    // 这会导致父节点状态计算错误，进而引发子节点变更了选中状态\n    if (!checkStrictly && parent?.checked) {\n      checkedMap.set(value, true);\n    }\n    this.updateChecked();\n  }\n\n  /**\n   * 初始化节点展开状态\n   * @return void\n   */\n  private initExpanded(): void {\n    const { tree } = this;\n    let { expanded } = this;\n    const { config } = tree;\n    if (isNumber(config.expandLevel) && this.getLevel() < config.expandLevel) {\n      tree.expandedMap.set(this.value, true);\n      expanded = true;\n    }\n    if (this.children === true && config.lazy) {\n      expanded = false;\n    }\n    if (expanded) {\n      tree.expandedMap.set(this.value, true);\n    } else {\n      tree.expandedMap.delete(this.value);\n    }\n    this.expanded = expanded;\n  }\n\n  /**\n   * 初始化节点激活状态\n   * @return void\n   */\n  private initActived(): void {\n    const { tree, actived } = this;\n    if (actived && this.isActivable()) {\n      tree.activedMap.set(this.value, true);\n    }\n  }\n\n  /* ------ 节点操作 ------ */\n\n  /**\n   * 追加节点数据\n   * @param {object | object[]} data 节点数据\n   * @return void\n   */\n  public append(data: TypeTreeNodeData | TypeTreeNodeData[]): void {\n    const list = [];\n    if (!Array.isArray(data)) {\n      list.push(data);\n    } else {\n      list.push(...data);\n    }\n    if (list.length <= 0) {\n      return;\n    }\n    if (!Array.isArray(this.children)) {\n      this.children = [];\n    }\n    const { children, tree } = this;\n    list.forEach((item) => {\n      let node = null;\n      if (item instanceof TreeNode) {\n        node = item;\n        node.appendTo(this.tree, this);\n      } else {\n        node = new TreeNode(this.tree, item, this);\n        children.push(node);\n      }\n    });\n    tree.reflow(this);\n    this.updateRelated();\n  }\n\n  /**\n   * 将当前节点追加到某个父节点的子节点列表中\n   * @param {TreeStore} tree 目标树\n   * @param {TreeNode} [parent] 目标父节点\n   * @param {number} [index] 预期在子节点列表中的位置\n   * @return void\n   */\n  public appendTo(tree: TreeStore, parent?: TreeNode, index?: number): void {\n    const parentNode = parent;\n    let targetIndex = -1;\n    if (isNumber(index)) {\n      targetIndex = index;\n    }\n\n    const targetParents = parentNode?.getParents() || [];\n    const includeCurrent = targetParents.some((pnode) => pnode === this);\n    if (includeCurrent) {\n      throw new Error('无法将父节点插入到子节点');\n    }\n\n    if (parentNode === this) {\n      throw new Error('无法将节点插入到本节点');\n    }\n\n    if (Array.isArray(parentNode?.children)) {\n      const targetPosNode = parentNode?.children[targetIndex];\n      if (targetPosNode && targetPosNode === this) {\n        // 无需将节点插入到原位置\n        return;\n      }\n    }\n\n    // 先要取得 siblings\n    // 因为要应对节点在同一个 siblings 中变换位置的情况\n    let siblings = null;\n    if (parentNode instanceof TreeNode) {\n      if (!Array.isArray(parentNode?.children)) {\n        parentNode.children = [];\n      }\n      siblings = parent.children;\n    } else {\n      siblings = tree.children;\n    }\n\n    // 上面的逻辑其实已经覆盖了所有业务情况\n    // 这里的逻辑报错仅用于极限兜底，防止 treeStore 被误使用\n    if (!Array.isArray(siblings)) {\n      throw new Error('无法插入到目标位置，可插入的节点列表不存在');\n    }\n\n    const prevLength = siblings.length;\n    const prevIndex = this.getIndex();\n\n    this.remove();\n\n    if (isNumber(index)) {\n      let targetIndex = index;\n      if (parentNode === this.parent) {\n        // 前置节点被拔出后再插入到同一个 siblings 时，会引起目标 index 的变化\n        // 因此要相应的变更插入位置\n        // 后置节点被拔出时，目标 index 是不变的\n        const curLength = siblings.length;\n        if (curLength < prevLength && prevIndex <= targetIndex) {\n          targetIndex -= 1;\n        }\n      }\n      siblings.splice(targetIndex, 0, this);\n    } else {\n      siblings.push(this);\n    }\n\n    this.parent = parentNode;\n\n    // 插入节点应当继承展开状态\n    // 但不要继承选中状态和高亮状态\n    const nodes = this.walk();\n    nodes.forEach((item) => {\n      const node = item;\n      node.tree = tree;\n      tree.nodeMap.set(node.value, node);\n      tree.privateMap.set(node[privateKey], node);\n      if (node.expanded) {\n        tree.expandedMap.set(node.value, true);\n      }\n    });\n\n    const updateNodes = parentNode?.walk() || tree.children.map((item) => item.walk()).flat();\n    updateNodes.forEach((node) => {\n      node.update();\n      node.updateChecked();\n    });\n\n    tree.reflow();\n  }\n\n  /**\n   * 插入一个节点或者数据到到同级节点的目标位置\n   * @param {TreeNode | object} item 要插入的节点或者数据\n   * @param {number} [index] 预期在子节点列表中的位置\n   * @return void\n   */\n  private insert(item: TypeTreeItem, index?: number): void {\n    const { tree, parent } = this;\n    const siblings = this.getSiblings();\n    let node = null;\n    if (item instanceof TreeNode) {\n      node = item;\n      node.appendTo(tree, parent, index);\n    } else if (item) {\n      node = new TreeNode(tree, item, parent);\n      if (isNumber(index)) {\n        siblings.splice(index, 0, node);\n      }\n      siblings.forEach((sibling) => {\n        sibling.update();\n      });\n    }\n    tree.reflow();\n  }\n\n  /**\n   * 在当前节点之前插入节点\n   * @param {TreeNode | object} newData 要插入的节点或者数据\n   * @return void\n   */\n  public insertBefore(newData: TypeTreeItem): void {\n    const index = this.getIndex();\n    this.insert(newData, index);\n  }\n\n  /**\n   * 在当前节点之后插入节点\n   * @param {TreeNode | object} newData 要插入的节点或者数据\n   * @return void\n   */\n  public insertAfter(newData: TypeTreeItem): void {\n    const index = this.getIndex();\n    this.insert(newData, index + 1);\n  }\n\n  /**\n   * 从当前树中移除本节点\n   * @return void\n   */\n  public remove(): void {\n    const { tree } = this;\n\n    const nodes = this.walk();\n    const siblings = this.getSiblings();\n    const index = this.getIndex();\n    // 从父节点的子节点列表中移除自己\n    // 但不要将自己的父节点移除，避免渲染与判断失败\n    if (Array.isArray(siblings)) {\n      siblings.splice(index, 1);\n    }\n    // 清理与树的关系，但不清理自身状态\n    nodes.forEach((node) => {\n      node.clean();\n    });\n    // 同级节点的连线状态会受到影响\n    siblings.forEach((node) => {\n      node.update();\n    });\n    // 父节点选中态会受到影响\n    this.updateParents();\n    tree.reflow();\n  }\n\n  /**\n   * 清除本节点与当前树的关系\n   * @return void\n   */\n  private clean(): void {\n    const { tree, value } = this;\n    tree.activedMap.delete(value);\n    tree.checkedMap.delete(value);\n    tree.expandedMap.delete(value);\n    tree.nodeMap.delete(value);\n    tree.filterMap.delete(value);\n    tree.privateMap.delete(this[privateKey]);\n  }\n\n  /**\n   * 异步加载子节点\n   * @return Promise<void>\n   */\n  private async loadChildren(): Promise<void> {\n    const config = get(this, 'tree.config') || {};\n    if (this.children === true && !this.loading) {\n      if ('load' in config && isFunction(config.load)) {\n        this.loading = true;\n        this.update();\n        let list = [];\n        list = await config.load(this);\n        this.tree.emit('load', {\n          node: this,\n          data: list,\n        });\n        this.loading = false;\n        if (Array.isArray(list) && list.length > 0) {\n          this.append(list);\n        } else {\n          this.children = false;\n        }\n        this.update();\n      }\n    }\n  }\n\n  /**\n   * 设置节点状态\n   * - 为节点设置独立于配置的 disabled 状态: set({ disabled: true })\n   * - 清除独立于配置的 disabled 状态: set({ disabled: null })\n   * @param {object} item 节点状态对象\n   * @return void\n   */\n  public set(item: TreeNodeState): void {\n    const { tree } = this;\n    const keys = Object.keys(item);\n    keys.forEach((key) => {\n      if (\n        hasOwnProperty.call(settableStatus, key)\n        || key === 'label'\n        || key === 'disabled'\n      ) {\n        // @ts-ignore\n        // TODO: 待移除\n        this[key] = item[key];\n      }\n    });\n    tree.updated(this);\n  }\n\n  /* ------ 节点获取 ------- */\n\n  /**\n   * 获取本节点的父节点\n   * @return TreeNode 父节点\n   */\n  public getParent(): TreeNode {\n    return this.parent;\n  }\n\n  /**\n   * 获取所有父级节点\n   * - 顺序为从当前到根\n   * @return TreeNode[] 父级节点数组\n   */\n  public getParents(): TreeNode[] {\n    const parents = [];\n    let node = this.parent;\n    while (node) {\n      parents.push(node);\n      node = node.parent;\n    }\n    return parents;\n  }\n\n  /**\n   * 获取所有兄弟节点，包含自己在内\n   * @return TreeNode[] 兄弟节点数组\n   */\n  public getSiblings(): TreeNode[] {\n    const { parent, tree } = this;\n    let list: TreeNode[] = [];\n    if (parent) {\n      if (Array.isArray(parent.children)) {\n        list = parent.children;\n      }\n    } else if (tree) {\n      list = tree.children;\n    }\n    return list;\n  }\n\n  /**\n   * 获取当前节点的子节点\n   * @param {boolean} deep 是否获取所有深层子节点\n   * @return TreeNodeModel[] 子节点数组\n   */\n  public getChildren(deep?: boolean): boolean | TypeTreeNodeModel[] {\n    let childrenModel: boolean | TypeTreeNodeModel[] = false;\n    const { children } = this;\n    if (Array.isArray(children)) {\n      if (children.length > 0) {\n        if (deep) {\n          const nodes = this.walk();\n          nodes.shift();\n          childrenModel = nodes.map((item) => item.getModel());\n        } else {\n          childrenModel = children.map((item) => item.getModel());\n        }\n      } else {\n        childrenModel = false;\n      }\n    } else if (isBoolean(children)) {\n      childrenModel = children;\n    }\n    return childrenModel;\n  }\n\n  /**\n   * 获取本节点的根节点\n   * @return TreeNode 根节点\n   */\n  public getRoot(): TreeNode {\n    const parents = this.getParents();\n    return parents[parents.length - 1] || null;\n  }\n\n  /**\n   * 获取节点在父节点的子节点列表中的位置\n   * - 如果没有父节点，则获取节点在根节点列表的位置\n   * @return number 节点位置序号\n   */\n  public getIndex(): number {\n    const list = this.getSiblings();\n    return list.indexOf(this);\n  }\n\n  /**\n   * 返回路径节点\n   * - 路径节点包含自己在内\n   * - 节点顺序与父级节点顺序相反，从根到当前\n   * @return TreeNode[] 路径节点数组\n   */\n  public getPath(): TreeNode[] {\n    const nodes = this.getParents();\n    nodes.unshift(this);\n    return nodes.reverse();\n  }\n\n  /**\n   * 获取节点所在层级\n   * @return number 层级序号\n   */\n  public getLevel(): number {\n    const parents = this.getParents();\n    return parents.length;\n  }\n\n  /* ------ 节点状态判断 ------ */\n\n  /**\n   * 判断节点是否被过滤\n   * @return boolean 是否被过滤方法命中\n   */\n  public isRest(): boolean {\n    const { config, filterMap, hasFilter } = this.tree;\n\n    let rest = false;\n    if (hasFilter) {\n      // 仅在存在过滤条件时，过滤命中才有效\n      const nodeModel = this.getModel();\n      rest = config.filter(nodeModel);\n    }\n\n    if (rest) {\n      filterMap.set(this.value, true);\n    } else if (filterMap.get(this.value)) {\n      filterMap.delete(this.value);\n    }\n\n    return rest;\n  }\n\n  /**\n   * 判断节点是否可见\n   * @return boolean 是否可见\n   */\n  public isVisible(): boolean {\n    const { nodeMap, hasFilter, config } = this.tree;\n    const { allowFoldNodeOnFilter } = config;\n\n    let visible = true;\n\n    if (!nodeMap.get(this.value)) {\n      // 节点不在当前树上，所以不可见\n      return false;\n    }\n\n    if (hasFilter && !allowFoldNodeOnFilter) {\n      // 如果存在过滤条件\n      // 锁定状态和过滤命中状态，直接呈现\n      visible = this.vmIsLocked || this.vmIsRest;\n      return visible;\n    }\n\n    // 标志所有父节点展开导致的可见状态\n    let expandVisible = true;\n    const parents = this.getParents();\n    if (parents.length > 0) {\n      expandVisible = parents.every((node: TreeNode) => node.expanded);\n    }\n\n    if (hasFilter) {\n      visible = expandVisible && (this.vmIsRest || this.vmIsLocked);\n    } else {\n      visible = expandVisible;\n    }\n    return visible;\n  }\n\n  /**\n   * 判断节点是否被禁用\n   * @return boolean 是否被禁用\n   */\n  public isDisabled(): boolean {\n    const { tree } = this;\n    const { hasFilter, config } = tree;\n    const { disabled, allowFoldNodeOnFilter } = config;\n    if (\n      hasFilter\n      && !allowFoldNodeOnFilter\n      && this.vmIsLocked\n      && !this.vmIsRest\n    ) {\n      return true;\n    }\n    let state = disabled;\n    if (typeof this.disabled === 'boolean') {\n      state = this.disabled;\n    }\n    return state;\n  }\n\n  /**\n   * 判断节点是否能拖拽\n   * @return boolean 是否能拖拽\n   */\n  public isDraggable(): boolean {\n    let state = !!get(this, 'tree.config.draggable');\n    if (typeof this.draggable === 'boolean') {\n      state = this.draggable;\n    }\n    return state;\n  }\n\n  /**\n   * 判断子节点是否互斥展开\n   * @return boolean 子节点是否互斥展开\n   */\n  public isExpandMutex(): boolean {\n    let state = !!get(this, 'tree.config.expandMutex');\n    if (typeof this.expandMutex === 'boolean') {\n      state = this.expandMutex;\n    }\n    return state;\n  }\n\n  /**\n   * 节点是否可被激活\n   * @return boolean 是否可被激活\n   */\n  public isActivable() {\n    let state = !!get(this, 'tree.config.activable');\n    if (typeof this.activable === 'boolean') {\n      state = this.activable;\n    }\n    return state;\n  }\n\n  /**\n   * 节点是否可选\n   * @return boolean 是否可选\n   */\n  public isCheckable() {\n    let state = !!get(this, 'tree.config.checkable');\n    if (typeof this.checkable === 'boolean') {\n      state = this.checkable;\n    }\n    return state;\n  }\n\n  /**\n   * 节点是否被激活\n   * @param {Map} [map] 预设激活节点 map, 用于计算节点在预期环境中的激活状态\n   * @return boolean 是否被激活\n   */\n  public isActived(map?: Map<string, boolean>): boolean {\n    const { tree, value } = this;\n    const activedMap = map || tree.activedMap;\n    return !!(tree.nodeMap.get(value) && activedMap.get(value));\n  }\n\n  /**\n   * 节点是否已展开\n   * @param {Map} [map] 预设展开节点 map, 用于计算节点在预期环境中的展开状态\n   * @return boolean 是否已展开\n   */\n  public isExpanded(map?: Map<string, boolean>): boolean {\n    const { tree, value, vmIsLocked } = this;\n    const { hasFilter, config } = tree;\n    const { allowFoldNodeOnFilter } = config;\n    if (hasFilter && !allowFoldNodeOnFilter && vmIsLocked) return true;\n    const expandedMap = map || tree.expandedMap;\n    return !!(tree.nodeMap.get(value) && expandedMap.get(value));\n  }\n\n  /**\n   * 节点是否被选中\n   * @param {Map} [map] 预设选中节点 map, 用于计算节点在预期环境中的选中态\n   * @return boolean 是否被选中\n   */\n  public isChecked(map?: TypeIdMap): boolean {\n    const { children, tree, value } = this;\n    const { checkStrictly, valueMode } = tree.config;\n    // 节点不在当前树上，视为未选中\n    if (!tree.nodeMap.get(value)) return false;\n    // 节点不可选，视为未选中\n    if (!this.isCheckable()) return false;\n    const checkedMap = map || tree.checkedMap;\n    // 严格模式，则已经可以判定选中状态\n    if (checkStrictly) {\n      return !!checkedMap.get(value);\n    }\n    let checked = false;\n    // 在 checkedMap 中，则根据 valueMode 的值进行判断\n    if (checkedMap.get(value)\n      && (\n        // 如果 valueMode 为 all、parentFirst，则视为选中\n        valueMode !== 'onlyLeaf'\n        // 如果 valueMode 为 onlyLeaf 并且当前节点是叶子节点，则视为选中\n        || this.isLeaf()\n      )\n    ) {\n      return true;\n    }\n    // 如果 valueMode 为 onlyLeaf 并且当前节点是父节点，则进一步判断\n    if (Array.isArray(children) && children.length > 0) {\n      // 子节点全部选中，则当前节点选中\n      checked = children.every((node) => {\n        const childIsChecked = node.isChecked(checkedMap);\n        return childIsChecked;\n      });\n    } else {\n      // 从父节点状态推断子节点状态\n      // 这里再调用 isChecked 会导致死循环\n      const parents = this.getParents();\n      checked = parents.some((node) => checkedMap.get(node.value));\n    }\n    return checked;\n  }\n\n  /**\n   * 是否为半选状态\n   * @return boolean 是否为半选状态\n   */\n  public isIndeterminate(): boolean {\n    const { children, tree, value } = this;\n    const { checkStrictly } = tree.config;\n    // 节点不在当前树上，视为未选中\n    if (!tree.nodeMap.get(value)) return false;\n    // 节点不可选，视为未选中\n    if (!this.isCheckable()) return false;\n    // 严格模式没有半选状态\n    if (checkStrictly) return false;\n    // 叶节点不存在半选状态\n    if (!Array.isArray(children)) return false;\n\n    let childChecked: null | boolean = null;\n    const indeterminate = children.some((node: TreeNode) => {\n      if (node.isIndeterminate()) {\n        // 子节点有任意一个半选，则其为半选状态\n        return true;\n      }\n      if (isNull(childChecked)) {\n        childChecked = node.isChecked();\n      }\n      if (childChecked !== node.isChecked()) {\n        // 子节点选中状态不一致，则其为半选状态\n        return true;\n      }\n      return false;\n    });\n\n    return indeterminate;\n  }\n\n  /**\n   * 是否为兄弟节点中的第一个节点\n   * @return boolean 是否为第一个节点\n   */\n  public isFirst(): boolean {\n    const siblings = this.getSiblings();\n    return siblings[0] === this;\n  }\n\n  /**\n   * 是否为兄弟节点中的最后一个节点\n   * @return boolean 是否为最后一个节点\n   */\n  public isLast(): boolean {\n    const siblings = this.getSiblings();\n    return siblings[siblings.length - 1] === this;\n  }\n\n  /**\n   * 是否为叶子节点，叶子节点没有子节点\n   * @return boolean 是否为叶子节点\n   */\n  public isLeaf(): boolean {\n    let isLeaf = false;\n    if (Array.isArray(this.children)) {\n      isLeaf = this.children.length <= 0;\n    } else {\n      isLeaf = !this.children;\n    }\n    return isLeaf;\n  }\n\n  /* ------ 节点状态切换 ------ */\n\n  /**\n   * 锁定节点，解锁节点\n   * - 搜索过滤节点时，路径节点需要固定呈现，视其为锁定态\n   * @param {boolean} lockState 锁定状态\n   * @return void\n   */\n  public lock(lockState: boolean): void {\n    this.vmIsLocked = lockState;\n    this.expanded = this.isExpanded();\n    this.visible = this.isVisible();\n  }\n\n  /**\n   * 节点展开关闭后需要调用的状态检查函数\n   * @return void\n   */\n  public afterExpanded(): void {\n    this.update();\n    // 节点展开时检查延迟加载的数据\n    if (this.expanded && this.children === true) {\n      this.loadChildren();\n    }\n    this.updateChildren();\n  }\n\n  /**\n   * 切换节点展开状态\n   * - 用于受控逻辑处理\n   * - 仅返回预期状态值数组，不直接操作状态\n   * @return string[] 当前树展开的节点值数组\n   */\n  public toggleExpanded(): TreeNodeValue[] {\n    return this.setExpanded(!this.isExpanded());\n  }\n\n  /**\n   * 设置节点展开状态\n   * @param {boolean} expanded 节点展开状态\n   * @param {object} [opts] 操作选项\n   * @param {boolean} [opts.directly=false] 是否直接操作节点状态\n   * @return string[] 当前树展开的节点值数组\n   */\n  public setExpanded(\n    expanded: boolean,\n    opts?: TypeSettingOptions\n  ): TreeNodeValue[] {\n    const { tree } = this;\n    const { config } = tree;\n    const options = {\n      directly: false,\n      ...opts,\n    };\n\n    let map = tree.expandedMap;\n    if (!options.directly) {\n      map = new Map(tree.expandedMap);\n    }\n\n    // 手风琴效果，先折叠同级节点\n    if (expanded) {\n      // 列举需要展开的节点\n      const shouldExpandNodes = [];\n      // 自己一定在展开列表中\n      shouldExpandNodes.push(this);\n      if (config.expandParent) {\n        // expandParent 为 true，则父节点都要展开\n        this.getParents().forEach((node) => {\n          shouldExpandNodes.push(node);\n        });\n      }\n      shouldExpandNodes.forEach((node) => {\n        let isExpandMutex = false;\n        // 对于每一个节点，都需要判断是否启用手风琴效果\n        if (node.parent) {\n          isExpandMutex = node.parent.isExpandMutex();\n        } else {\n          isExpandMutex = tree?.config?.expandMutex;\n        }\n        if (isExpandMutex) {\n          // 折叠列表中，先移除同级节点\n          const siblings = node.getSiblings();\n          siblings.forEach((snode) => {\n            map.delete(snode.value);\n            // 同级节点相关状态更新\n            snode.update();\n            snode.updateChildren();\n          });\n        }\n        // 最后设置自己的折叠状态\n        map.set(node.value, true);\n        node.update();\n        node.updateChildren();\n      });\n    } else {\n      map.delete(this.value);\n    }\n\n    if (options.directly) {\n      this.afterExpanded();\n    }\n\n    return tree.getExpanded(map);\n  }\n\n  /**\n   * 切换节点激活状态\n   * - 用于受控逻辑处理\n   * - 仅返回预期状态值数组，不直接操作状态\n   * @return string[] 当前树激活的节点值数组\n   */\n  public toggleActived(): TreeNodeValue[] {\n    return this.setActived(!this.isActived());\n  }\n\n  /**\n   * 设置节点激活状态\n   * @param {boolean} actived 节点激活状态\n   * @param {object} [opts] 操作选项\n   * @param {boolean} [opts.directly=false] 是否直接操作节点状态\n   * @return string[] 当前树激活的节点值数组\n   */\n  public setActived(\n    actived: boolean,\n    opts?: TypeSettingOptions\n  ): TreeNodeValue[] {\n    const { tree } = this;\n    const options = {\n      directly: false,\n      ...opts,\n    };\n    const config = tree.config || {};\n    let map = tree.activedMap;\n    if (!options.directly) {\n      map = new Map(tree.activedMap);\n    }\n    if (this.isActivable()) {\n      if (actived) {\n        const prevKeys = Array.from(map.keys());\n        if (!config.activeMultiple) {\n          map.clear();\n        }\n        prevKeys.forEach((value) => {\n          const node = tree.getNode(value);\n          node?.update();\n        });\n        map.set(this.value, true);\n      } else {\n        map.delete(this.value);\n      }\n    }\n    this.update();\n    return tree.getActived(map);\n  }\n\n  /**\n   * 切换节点选中状态\n   * - 用于受控逻辑处理\n   * - 仅返回预期状态值数组，不直接操作状态\n   * @return string[] 当前树选中的节点值数组\n   */\n  public toggleChecked(): TreeNodeValue[] {\n    return this.setChecked(!this.isChecked());\n  }\n\n  /**\n   * 设置节点选中状态\n   * - 节点 UI 操作时调用这个方法\n   * - 节点设置自身状态时调用这个方法\n   * @param {boolean} checked 节点选中状态\n   * @param {object} [opts] 操作选项\n   * @param {boolean} [opts.isAction=true] 是否为 UI 动作\n   * @param {boolean} [opts.directly=false] 是否直接操作节点状态\n   * @return string[] 当前树选中的节点值数组\n   */\n  public setChecked(\n    checked: boolean,\n    opts?: TypeSettingOptions\n  ): TreeNodeValue[] {\n    const { tree } = this;\n    const config = tree.config || {};\n    const options: TypeSettingOptions = {\n      // 为 true, 为 UI 操作，状态扩散受 disabled 影响\n      // 为 false, 为值操作, 状态扩散不受 disabled 影响\n      isAction: true,\n      // 为 true, 直接操作节点状态\n      // 为 false, 返回预期状态\n      directly: false,\n      ...opts,\n    };\n    let map = tree.checkedMap;\n\n    if (!options.directly) {\n      map = new Map(tree.checkedMap);\n    }\n    if (!this.isCheckable()) {\n      // 当前节点非可选节点，则不可设置选中态\n      return tree.getChecked(map);\n    }\n    if (options.isAction && this.isDisabled()) {\n      // 对于 UI 动作，禁用时不可切换选中态\n      return tree.getChecked(map);\n    }\n    if (checked === this.isChecked()) {\n      // 值没有变更，则选中态无变化\n      return tree.getChecked(map);\n    }\n\n    if (checked) {\n      map.set(this.value, true);\n    } else {\n      map.delete(this.value);\n    }\n\n    if (config.checkStrictly) {\n      // 严格模式下，选中态不扩散，仅操作节点自身\n      if (options.directly) {\n        // 严格模式值更新节点自身\n        this.updateChecked();\n      }\n    } else {\n      // 先向下游扩散选中态\n      this.spreadChildrenChecked(checked, map, options);\n      // 再计算上游选中态\n      this.spreadParentChecked(checked, map, options);\n      // 状态更新务必放到扩散动作之后\n      // 过早的状态更新会导致后续计算出错\n      if (options.directly) {\n        const relatedNodes = tree.getRelatedNodes([this.value], {\n          reverse: true,\n        });\n        relatedNodes.forEach((node) => {\n          node.updateChecked();\n        });\n      }\n    }\n    this.isIndeterminateManual = false;\n\n    return tree.getChecked(map);\n  }\n\n  public setIndeterminate(indeterminate: boolean, opts?: TypeSettingOptions) {\n    const { tree } = this;\n    const config = tree.config || {};\n    const options: TypeSettingOptions = {\n      // 为 true, 为 UI 操作，状态扩散受 disabled 影响\n      // 为 false, 为值操作, 状态扩散不受 disabled 影响\n      isAction: true,\n      // 为 true, 直接操作节点状态\n      // 为 false, 返回预期状态\n      directly: false,\n      ...opts,\n    };\n    let map = tree.checkedMap;\n    if (!options.directly) {\n      map = new Map(tree.checkedMap);\n    }\n    if (!this.isCheckable()) {\n      // 当前节点非可选节点，则不可设置选中态\n      return tree.getChecked(map);\n    }\n    if (options.isAction && this.isDisabled()) {\n      // 对于 UI 动作，禁用时不可切换选中态\n      return tree.getChecked(map);\n    }\n    if (indeterminate === this.isIndeterminate()) {\n      // 值没有变更，则选中态无变化\n      return tree.getChecked(map);\n    }\n    this.indeterminate = indeterminate;\n    this.isIndeterminateManual = true;\n\n    return tree.getChecked(map);\n  }\n\n  // 选中态向上游扩散\n  private spreadParentChecked(\n    checked: boolean,\n    map?: TypeIdMap,\n    opts?: TypeSettingOptions\n  ) {\n    const options: TypeSettingOptions = {\n      isAction: true,\n      directly: false,\n      ...opts,\n    };\n    // 碰到不可选节点，中断扩散\n    if (!this.isCheckable()) return;\n\n    const { children } = this;\n    if (Array.isArray(children) && children.length > 0) {\n      // 有子节点，则选中态由子节点选中态集合来决定\n      map.delete(this.value);\n    }\n\n    const { parent } = this;\n    if (!parent) return;\n    parent.spreadParentChecked(checked, map, options);\n  }\n\n  // 选中态向下游扩散\n  private spreadChildrenChecked(\n    checked: boolean,\n    map?: TypeIdMap,\n    opts?: TypeSettingOptions\n  ) {\n    const options: TypeSettingOptions = {\n      isAction: true,\n      directly: false,\n      ...opts,\n    };\n\n    // 碰到不可选节点，中断扩散\n    if (!this.isCheckable()) return;\n    // 对于 UI 动作操作，节点禁用，中断扩散\n    if (options.isAction && this.isDisabled()) return;\n\n    const { children } = this;\n    if (!Array.isArray(children)) return;\n    children.forEach((node) => {\n      // 对于 UI 动作，向下扩散时，禁用状态会阻止状态切换\n      if (options.isAction && node.isDisabled()) return;\n      if (checked) {\n        map.set(node.value, true);\n      } else {\n        map.delete(node.value);\n      }\n      node.spreadChildrenChecked(checked, map, options);\n    });\n  }\n\n  /* ------ 节点状态更新 ------ */\n\n  /**\n   * 更新节点当前状态，将节点放到延时更新检查队列\n   * @return void\n   */\n  public update(): void {\n    this.level = this.getLevel();\n    this.vmIsFirst = this.isFirst();\n    this.vmIsLast = this.isLast();\n    this.vmIsLeaf = this.isLeaf();\n    this.vmCheckable = this.isCheckable();\n    this.vmIsRest = this.isRest();\n    this.actived = this.isActived();\n    this.expanded = this.isExpanded();\n    this.visible = this.isVisible();\n    this.tree.updated(this);\n  }\n\n  /**\n   * 更新节点选中态\n   * @return void\n   */\n  public updateChecked(from?: string): void {\n    const { tree, value, isIndeterminateManual } = this;\n    if (isIndeterminateManual && ['refresh'].includes(from)) {\n      return;\n    }\n\n    const { checkedMap } = tree;\n    this.checked = this.isChecked();\n    this.indeterminate = this.isIndeterminate();\n    if (this.checked) {\n      checkedMap.set(value, true);\n    }\n    tree.updated(this);\n  }\n\n  /**\n   * 更新所有子节点状态\n   * - 不包含自己\n   * @return void\n   */\n  public updateChildren(): void {\n    const { children } = this;\n    if (Array.isArray(children)) {\n      children.forEach((node) => {\n        node.update();\n        node.updateChecked();\n        node.updateChildren();\n      });\n    }\n  }\n\n  /**\n   * 更新所有父级节点状态\n   * - 不包含自己\n   * @return void\n   */\n  public updateParents(): void {\n    const { parent } = this;\n    if (parent) {\n      parent.update();\n      parent.updateChecked();\n      parent.updateParents();\n    }\n  }\n\n  /**\n   * 更新上下游相关节点状态\n   * - 包含自己\n   * @return void\n   */\n  public updateRelated(): void {\n    const { tree } = this;\n    const relatedNodes = tree.getRelatedNodes([this.value]);\n    relatedNodes.forEach((node) => {\n      node.update();\n      if (node.isIndeterminateManual && node.indeterminate) return;\n      node.updateChecked();\n    });\n  }\n\n  /* ------ 节点遍历 ------ */\n\n  /**\n   * 获取包含自己在内所有的子节点\n   * - 包含自己\n   * @return TreeNode[] 遍历结果节点数组\n   */\n  public walk(): TreeNode[] {\n    const { children } = this;\n    let list: TreeNode[] = [];\n    list.push(this);\n    if (Array.isArray(children) && children.length > 0) {\n      children.forEach((node) => {\n        list = list.concat(node.walk());\n      });\n    }\n    return list;\n  }\n\n  /**\n   * 获取节点封装对象\n   * - TreeNode 对象 => TypeTreeNodeModel 对象\n   * - TypeTreeNodeModel 用于封装 treeNode 对外暴露的 api\n   * - 用户仅可操作经过封装的对象，减少了对外暴露的 api，利于代码重构\n   * @return TypeTreeNodeModel 节点封装对象\n   */\n  public getModel(): TypeTreeNodeModel {\n    let { model } = this;\n    if (!model) {\n      model = createNodeModel(this);\n      this.model = model;\n    }\n    updateNodeModel(model, this);\n    return model;\n  }\n}\n\nexport default TreeNode;\n"],"names":["getExposedProps","node","props","pick","createNodeModel","model","_objectSpread","getLevel","getIndex","isFirst","isLast","isLeaf","insertBefore","newData","insertAfter","appendData","data","append","getPath","nodes","map","item","getModel","getParent","_node$parent","parent","getParents","getRoot","root","getSiblings","getChildren","deep","childrenModel","children","Array","isArray","length","walk","shift","isBoolean","remove","value","tree","targetNode","getNode","log","warnOnce","concat","parents","parentValues","pnode","indexOf","setData","_data","omit","keys","config","dataValue","dataLabel","label","isUndefined","Object","assign","updateNodeModel","hasOwnProperty","prototype","settableStatus","expandMutex","activable","checkable","draggable","loading","settableProps","syncableProps","privateKey","TreeNode","_this","_classCallCheck","prefix","propChildren","propLabel","propValue","propsDisabled","disabled","level","vmCheckable","vmIsLeaf","vmIsFirst","vmIsLast","vmIsRest","vmIsLocked","visible","actived","checked","indeterminate","expanded","expandAll","uniqueId","isNil","get","nodeMap","privateMap","warn","set","forEach","prop","initActived","initExpanded","initChecked","lazy","loadChildren","updateChecked","update","reflow","_createClass","key","checkedMap","checkStrictly","isNumber","expandLevel","expandedMap","isActivable","activedMap","_this2","list","push","apply","_toConsumableArray","appendTo","updateRelated","index","_this3","parentNode","targetIndex","targetParents","includeCurrent","some","Error","targetPosNode","siblings","prevLength","prevIndex","curLength","splice","updateNodes","flat","insert","sibling","clean","updateParents","filterMap","_loadChildren","_asyncToGenerator","_regeneratorRuntime","mark","_callee","wrap","_callee$","_context","prev","next","isFunction","load","sent","emit","stop","arguments","_this4","call","updated","unshift","reverse","isRest","_this$tree","hasFilter","rest","nodeModel","filter","isVisible","_this$tree2","allowFoldNodeOnFilter","expandVisible","every","isDisabled","state","isDraggable","isExpandMutex","isCheckable","isActived","isExpanded","isChecked","_tree$config","valueMode","childIsChecked","isIndeterminate","childChecked","isNull","lock","lockState","afterExpanded","updateChildren","toggleExpanded","setExpanded","opts","options","directly","Map","shouldExpandNodes","expandParent","_tree$config2","snode","getExpanded","toggleActived","setActived","prevKeys","from","activeMultiple","clear","getActived","toggleChecked","setChecked","isAction","getChecked","spreadChildrenChecked","spreadParentChecked","relatedNodes","getRelatedNodes","isIndeterminateManual","setIndeterminate","includes"],"mappings":";;;;;;;;;;;;;;;AAaA,SAASA,gBAAgBC,IAAoC,EAAA;EACrD,IAAAC,KAAA,GAAQC,KAAKF,IAAM,EAAA,CACvB,OAAA,EACA,OAAA,EACA,MAAA,EACA,SAAA,EACA,UAAA,EACA,SAAA,EACA,eAAA,EACA,SAAA,CACD,CAAA,CAAA;AACM,EAAA,OAAAC,KAAA,CAAA;AACT,CAAA;AAGO,SAASE,gBAAgBH,IAAmC,EAAA;AAC3D,EAAA,IAAAC,KAAA,GAAQF,gBAAgBC,IAAI,CAAA,CAAA;AAElC,EAAA,IAAMI,KAA2B,GAAAC,eAAA,CAAAA,eAAA,KAC5BJ,KAAA,CAAA,EAAA,EAAA,EAAA;IAMHK,QAAW,EAAA,SAAXA,QAAWA,GAAA;AACT,MAAA,OAAON,KAAKM,QAAS,EAAA,CAAA;KACvB;IAOAC,QAAW,EAAA,SAAXA,QAAWA,GAAA;AACT,MAAA,OAAOP,KAAKO,QAAS,EAAA,CAAA;KACvB;IAMAC,OAAU,EAAA,SAAVA,OAAUA,GAAA;AACR,MAAA,OAAOR,KAAKQ,OAAQ,EAAA,CAAA;KACtB;IAMAC,MAAS,EAAA,SAATA,MAASA,GAAA;AACP,MAAA,OAAOT,KAAKS,MAAO,EAAA,CAAA;KACrB;IAMAC,MAAS,EAAA,SAATA,MAASA,GAAA;AACP,MAAA,OAAOV,KAAKU,MAAO,EAAA,CAAA;KACrB;AAOAC,IAAAA,cAAAA,SAAAA,aAAaC,OAAuB,EAAA;AAC3B,MAAA,OAAAZ,IAAA,CAAKW,aAAaC,OAAO,CAAA,CAAA;KAClC;AAOAC,IAAAA,aAAAA,SAAAA,YAAYD,OAAuB,EAAA;AAC1B,MAAA,OAAAZ,IAAA,CAAKa,YAAYD,OAAO,CAAA,CAAA;KACjC;AAOAE,IAAAA,YAAAA,SAAAA,WAAWC,IAA6C,EAAA;AAC/C,MAAA,OAAAf,IAAA,CAAKgB,OAAOD,IAAI,CAAA,CAAA;KACzB;IAQAE,OAA+B,EAAA,SAA/BA,OAA+BA,GAAA;AACvB,MAAA,IAAAC,KAAA,GAAQlB,KAAKiB,OAAQ,EAAA,CAAA;AAC3B,MAAA,OAAOC,MAAMC,GAAI,CAAA,UAACC,IAAmB,EAAA;AAAA,QAAA,OAAAA,IAAA,CAAKC,UAAU,CAAA;OAAA,CAAA,CAAA;KACtD;IAMAC,SAA+B,EAAA,SAA/BA,SAA+BA,GAAA;AAAA,MAAA,IAAAC,YAAA,CAAA;AACtB,MAAA,OAAA,CAAAA,YAAA,GAAAvB,IAAA,CAAKwB,uDAALD,YAAA,CAAaF,QAAS,EAAA,CAAA;KAC/B;IAOAI,UAAkC,EAAA,SAAlCA,UAAkCA,GAAA;AAC1B,MAAA,IAAAP,KAAA,GAAQlB,KAAKyB,UAAW,EAAA,CAAA;AAC9B,MAAA,OAAOP,MAAMC,GAAI,CAAA,UAACC,IAAmB,EAAA;AAAA,QAAA,OAAAA,IAAA,CAAKC,UAAU,CAAA;OAAA,CAAA,CAAA;KACtD;IAMAK,OAA6B,EAAA,SAA7BA,OAA6BA,GAAA;AACrB,MAAA,IAAAC,IAAA,GAAO3B,KAAK0B,OAAQ,EAAA,CAAA;MAC1B,OAAOC,iBAAAA,2BAAAA,KAAMN,QAAS,EAAA,CAAA;KACxB;IAMAO,WAAmC,EAAA,SAAnCA,WAAmCA,GAAA;AAC3B,MAAA,IAAAV,KAAA,GAAQlB,KAAK4B,WAAY,EAAA,CAAA;AAC/B,MAAA,OAAOV,MAAMC,GAAI,CAAA,UAACC,IAAmB,EAAA;AAAA,QAAA,OAAAA,IAAA,CAAKC,UAAU,CAAA;OAAA,CAAA,CAAA;KACtD;AAOAQ,IAAAA,aAAAA,SAAAA,YAAYC,IAA+C,EAAA;MACzD,IAAIC,aAA+C,GAAA,KAAA,CAAA;AAC7C,MAAA,IAAEC,WAAahC,IAAA,CAAbgC;AACJ,MAAA,IAAAC,KAAA,CAAMC,OAAQ,CAAAF,QAAQ,CAAG,EAAA;AACvB,QAAA,IAAAA,QAAA,CAASG,SAAS,CAAG,EAAA;AACvB,UAAA,IAAIL,IAAM,EAAA;AACF,YAAA,IAAAZ,KAAA,GAAQlB,KAAKoC,IAAK,EAAA,CAAA;YACxBlB,KAAA,CAAMmB,KAAM,EAAA,CAAA;AACZN,YAAAA,aAAA,GAAgBb,MAAMC,GAAI,CAAA,UAACC,IAAS,EAAA;AAAA,cAAA,OAAAA,IAAA,CAAKC,UAAU,CAAA;aAAA,CAAA,CAAA;AACrD,WAAO,MAAA;AACLU,YAAAA,aAAA,GAAgBC,SAASb,GAAI,CAAA,UAACC,IAAS,EAAA;AAAA,cAAA,OAAAA,IAAA,CAAKC,UAAU,CAAA;aAAA,CAAA,CAAA;AACxD,WAAA;AACF,SAAO,MAAA;AACWU,UAAAA,aAAA,GAAA,KAAA,CAAA;AAClB,SAAA;AACF,OAAA,MAAA,IAAWO,SAAU,CAAAN,QAAQ,CAAG,EAAA;AACdD,QAAAA,aAAA,GAAAC,QAAA,CAAA;AAClB,OAAA;AACO,MAAA,OAAAD,aAAA,CAAA;KACT;AASAQ,IAAAA,QAAAA,SAAAA,OAAOC,KAAuB,EAAA;MAC5B,IAAI,CAACA,KAAO,EAAA;QACVxC,IAAA,CAAKuC,MAAO,EAAA,CAAA;AACZ,QAAA,OAAA;AACF,OAAA;AAEM,MAAA,IAAEE,OAASzC,IAAA,CAATyC;AACF,MAAA,IAAAC,UAAA,GAAaD,IAAK,CAAAE,OAAA,CAAQH,KAAK,CAAA,CAAA;MACrC,IAAI,CAACE,UAAY,EAAA;QACXE,GAAA,CAAAC,QAAA,CAAS,MAAQ,MAAAC,MAAA,CAAKN,KAAsB,EAAA,gBAAA,CAAA,CAAA,CAAA;AAChD,QAAA,OAAA;AACF,OAAA;AAEM,MAAA,IAAAO,OAAA,GAAUL,WAAWjB,UAAW,EAAA,CAAA;AACtC,MAAA,IAAMuB,eAAeD,OAAQ,CAAA5B,GAAA,CAAI,UAAC8B,KAAA,EAAA;QAAA,OAAWA,MAAMT,KAAM,CAAA;OAAA,CAAA,CAAA;MACzD,IAAIQ,YAAa,CAAAE,OAAA,CAAQlD,IAAK,CAAAwC,KAAK,IAAI,CAAG,EAAA;QACpCI,GAAA,CAAAC,QAAA,CAAS,MAAQ,MAAAC,MAAA,CAAKN,KAA4C,EAAA,sCAAA,CAAA,CAAA,CAAA;AACtE,QAAA,OAAA;AACF,OAAA;MACAE,UAAA,CAAWH,MAAO,EAAA,CAAA;KACpB;AAOAY,IAAAA,SAAAA,SAAAA,QAAQpC,IAAkB,EAAA;AAExB,MAAA,IAAMqC,QAAQC,IAAK,CAAAtC,IAAA,EAAM,CAAC,UAAY,EAAA,OAAA,EAAS,OAAO,CAAC,CAAA,CAAA;MACvD,IAAQuC,IAAA,GAAStD,IAAA,CAAKyC,IAAK,CAAAc,MAAA,CAAnBD,IAAA,CAAA;AACF,MAAA,IAAAE,SAAA,GAAYzC,IAAK,CAAA,CAAAuC,IAAA,KAAA,IAAA,IAAAA,IAAA,KAAA,KAAA,CAAA,GAAA,KAAA,CAAA,GAAAA,IAAA,CAAMd,KAAS,KAAA,OAAA,CAAA,CAAA;AAChC,MAAA,IAAAiB,SAAA,GAAY1C,IAAK,CAAA,CAAAuC,IAAA,KAAA,IAAA,IAAAA,IAAA,KAAA,KAAA,CAAA,GAAA,KAAA,CAAA,GAAAA,IAAA,CAAMI,KAAS,KAAA,OAAA,CAAA,CAAA;MAClC,IAAA,CAACC,YAAYH,SAAS,CAAA,EAAGJ,KAAA,CAAMZ,KAAQ,GAAAgB,SAAA,CAAA;MACvC,IAAA,CAACG,YAAYF,SAAS,CAAA,EAAGL,KAAA,CAAMM,KAAQ,GAAAD,SAAA,CAAA;MAEpCG,MAAA,CAAAC,MAAA,CAAO7D,IAAK,CAAAe,IAAA,EAAMqC,KAAK,CAAA,CAAA;AACvBQ,MAAAA,MAAA,CAAAC,MAAA,CAAO7D,MAAMoD,KAAK,CAAA,CAAA;AAC3B,KAAA;GACF,CAAA,CAAA;AAEO,EAAA,OAAAhD,KAAA,CAAA;AACT,CAAA;AAQgB,SAAA0D,eAAAA,CAAgB1D,OAA0BJ,IAAgB,EAAA;AAElE,EAAA,IAAAC,KAAA,GAAQF,gBAAgBC,IAAI,CAAA,CAAA;AAC3B4D,EAAAA,MAAA,CAAAC,MAAA,CAAOzD,OAAOH,KAAK,CAAA,CAAA;AAC5B;;;;AC9NA,IAAQ8D,cAAe,GAAIH,MAAO,CAAAI,SAAA,CAA1BD,cAAe,CAAA;AAIhB,IAAME,cAAiD,GAAA;AAC5DC,EAAAA,WAAa,EAAA,IAAA;AACbC,EAAAA,SAAW,EAAA,IAAA;AACXC,EAAAA,SAAW,EAAA,IAAA;AACXC,EAAAA,SAAW,EAAA,IAAA;AACXC,EAAAA,OAAS,EAAA,KAAA;AACX,CAAA,CAAA;AAEa,IAAAC,aAAA,GAAgBX,MAAO,CAAAN,IAAA,CAAKW,cAAc,CAAA,CAAA;AAEhD,IAAMO,aAAgB,GAAA1B,EAAAA,CAAAA,MAAA,CACxByB,aAAA,EACH,CAAA,SAAA,EACA,UAAA,EACA,SAAA,CACF,CAAA,CAAA;AAEO,IAAME,UAAa,GAAA,gBAAA,CAAA;AAcnB,IAAMC,QAAS,gBAAA,YAAA;AAiFb,EAAA,SAAAA,SACLjC,IACA,EAAA1B,IAAA,EACAS,MACA,EAAA;AAAA,IAAA,IAAAmD,KAAA,GAAA,IAAA,CAAA;AAAAC,IAAAA,eAAA,OAAAF,QAAA,CAAA,CAAA;IACA,IAAA,CAAK3D,IAAO,GAAAA,IAAA,CAAA;IACZ,IAAA,CAAK0B,IAAO,GAAAA,IAAA,CAAA;AAEN,IAAA,IAAAc,MAAA,GAASd,IAAK,CAAAc,MAAA,IAAU,EAAC,CAAA;AACzB,IAAA,IAAAsB,MAAA,GAAStB,OAAOsB,MAAU,IAAA,GAAA,CAAA;AAC1B,IAAA,IAAAvB,IAAA,GAAOC,MAAO,CAAAD,IAAA,IAAQ,EAAC,CAAA;AACvB,IAAA,IAAAwB,YAAA,GAAexB,KAAKtB,QAAY,IAAA,UAAA,CAAA;AAChC,IAAA,IAAA+C,SAAA,GAAYzB,KAAKI,KAAS,IAAA,OAAA,CAAA;AAC1B,IAAA,IAAAsB,SAAA,GAAY1B,KAAKd,KAAS,IAAA,OAAA,CAAA;AAC1B,IAAA,IAAAyC,aAAA,GAAgB3B,KAAK4B,QAAY,IAAA,UAAA,CAAA;IAGvC,IAAA,CAAK9E,KAAQ,GAAA,IAAA,CAAA;IACb,IAAA,CAAK4B,QAAW,GAAA,IAAA,CAAA;IAChB,IAAA,CAAKmD,KAAQ,GAAA,CAAA,CAAA;IAGb,IAAA,CAAKC,WAAc,GAAA,KAAA,CAAA;IACnB,IAAA,CAAKC,QAAW,GAAA,KAAA,CAAA;IAChB,IAAA,CAAKC,SAAY,GAAA,KAAA,CAAA;IACjB,IAAA,CAAKC,QAAW,GAAA,KAAA,CAAA;IAChB,IAAA,CAAKC,QAAW,GAAA,KAAA,CAAA;IAChB,IAAA,CAAKC,UAAa,GAAA,KAAA,CAAA;IAGlB,IAAA,CAAKC,OAAU,GAAA,KAAA,CAAA;IACf,IAAA,CAAKC,OAAU,GAAA,KAAA,CAAA;IACf,IAAA,CAAKC,OAAU,GAAA,KAAA,CAAA;IACf,IAAA,CAAKC,aAAgB,GAAA,KAAA,CAAA;IACrB,IAAA,CAAKvB,OAAU,GAAA,KAAA,CAAA;AACf,IAAA,IAAA,CAAKwB,WAAWvC,MAAO,CAAAwC,SAAA,CAAA;IAMvB,IAAA,CAAK5B,SAAY,GAAA,IAAA,CAAA;IACjB,IAAA,CAAKC,SAAY,GAAA,IAAA,CAAA;IACjB,IAAA,CAAKF,WAAc,GAAA,IAAA,CAAA;IACnB,IAAA,CAAKG,SAAY,GAAA,IAAA,CAAA;AAKZ,IAAA,IAAA,CAAAI,UAAA,CAAA,GAAcuB,SAASnB,MAAM,CAAA,CAAA;IAI7B,IAAA,CAAArC,KAAA,GAAQyD,KAAM,CAAAC,GAAA,CAAInF,IAAM,EAAAiE,SAAS,CAAC,CAAA,GACnC,IAAK,CAAAP,UAAA,CAAA,GACLyB,GAAI,CAAAnF,IAAA,EAAMiE,SAAS,CAAA,CAAA;AACjB,IAAA,IAAEmB,OAAS,GAAe1D,IAAA,CAAxB0D,OAAS;MAAAC,UAAA,GAAe3D,IAAA,CAAf2D,UAAA,CAAA;IACjB,IAAID,OAAQ,CAAAD,GAAA,CAAI,IAAK,CAAA1D,KAAK,CAAG,EAAA;MAC3BI,GAAA,CAAIyD,IAAK,CAAA,MAAA,EAAA,oBAAA,CAAAvD,MAAA,CAA6B,IAAA,CAAKN,KAAO,CAAA,CAAA,CAAA;AACpD,KAAA;IACQ2D,OAAA,CAAAG,GAAA,CAAI,IAAK,CAAA9D,KAAA,EAAO,IAAI,CAAA,CAAA;IACjB4D,UAAA,CAAAE,GAAA,CAAI,IAAK,CAAA7B,UAAA,CAAA,EAAa,IAAI,CAAA,CAAA;IAGrC,IAAA,CAAKf,KAAQ,GAAAwC,GAAA,CAAInF,IAAM,EAAAgE,SAAS,CAAK,IAAA,EAAA,CAAA;IAEhC,IAAA,CAAAG,QAAA,GAAWgB,GAAI,CAAAnF,IAAA,EAAMkE,aAAa,CAAA,CAAA;AAGvC,IAAA,IAAMjD,WAAWjB,IAAK,CAAA+D,YAAA,CAAA,CAAA;IAGtB,IAAI9C,aAAa,IAAM,EAAA;MACrB,IAAA,CAAKA,QAAW,GAAAA,QAAA,CAAA;AAClB,KAAA;AAGI,IAAA,IAAAR,MAAA,IAAUA,kBAAkBkD,QAAU,EAAA;MACxC,IAAA,CAAKlD,MAAS,GAAAA,MAAA,CAAA;AAChB,KAAO,MAAA;MACL,IAAA,CAAKA,MAAS,GAAA,IAAA,CAAA;AAChB,KAAA;AAIcgD,IAAAA,aAAA,CAAA+B,OAAA,CAAQ,UAACC,IAAS,EAAA;AAC1B,MAAA,IAAA,OAAOzF,IAAK,CAAAyF,IAAA,CAAA,KAAU,WAAa,EAAA;AAGrC7B,QAAAA,KAAA,CAAK6B,QAAQzF,IAAK,CAAAyF,IAAA,CAAA,CAAA;AACpB,OAAA;AACF,KAAC,CAAA,CAAA;IAGD,IAAA,CAAKC,WAAY,EAAA,CAAA;IACjB,IAAA,CAAKC,YAAa,EAAA,CAAA;IAClB,IAAA,CAAKC,WAAY,EAAA,CAAA;AAIb,IAAA,IAAA1E,KAAA,CAAMC,OAAQ,CAAAF,QAAQ,CAAG,EAAA;AAC3B,MAAA,IAAA,CAAKhB,OAAOgB,QAAQ,CAAA,CAAA;KACX,MAAA,IAAAA,QAAA,KAAa,IAAQ,IAAA,CAACuB,OAAOqD,IAAM,EAAA;MAC5C,IAAA,CAAKC,YAAa,EAAA,CAAA;AACpB,KAAA;IAIA,IAAA,CAAKC,aAAc,EAAA,CAAA;IAGnB,IAAA,CAAKC,MAAO,EAAA,CAAA;AAEZtE,IAAAA,IAAA,CAAKuE,OAAO,IAAI,CAAA,CAAA;AAClB,GAAA;EAAA,OAAAC,YAAA,CAAAvC,QAAA,EAAA,CAAA;IAAAwC,GAAA,EAAA,aAAA;AAAA1E,IAAAA,KAAA,EAQQ,SAAAmE,WAAoBA,GAAA;AAC1B,MAAA,IAAQlE,IAAA,GAAwB,IAAA,CAAxBA,IAAA;QAAMD,KAAO,GAAW,IAAA,CAAlBA,KAAO;QAAAhB,MAAA,GAAW,IAAA,CAAXA,MAAA,CAAA;AACf,MAAA,IAAE2F,aAAe1E,IAAA,CAAf0E;AACF,MAAA,IAAEC,aAAc,GAAI3E,IAAK,CAAAc,MAAA,CAAvB6D,aAAc,CAAA;MACtB,IAAI,KAAKxB,OAAS,EAAA;AACLuB,QAAAA,UAAA,CAAAb,GAAA,CAAI9D,OAAO,IAAI,CAAA,CAAA;AAC5B,OAAA;MAII,IAAA,CAAC4E,aAAiB,IAAA5F,MAAA,KAAA,IAAA,IAAAA,MAAA,KAAAA,KAAAA,CAAAA,IAAAA,MAAA,CAAQoE,OAAS,EAAA;AAC1BuB,QAAAA,UAAA,CAAAb,GAAA,CAAI9D,OAAO,IAAI,CAAA,CAAA;AAC5B,OAAA;MACA,IAAA,CAAKsE,aAAc,EAAA,CAAA;AACrB,KAAA;AAAA,GAAA,EAAA;IAAAI,GAAA,EAAA,cAAA;AAAA1E,IAAAA,KAAA,EAMQ,SAAAkE,YAAqBA,GAAA;AACrB,MAAA,IAAEjE,OAAS,IAAA,CAATA;AACJ,MAAA,IAAEqD,WAAa,IAAA,CAAbA;AACA,MAAA,IAAEvC,SAAWd,IAAA,CAAXc;AACJ,MAAA,IAAA8D,QAAA,CAAS9D,OAAO+D,WAAW,CAAA,IAAK,KAAKhH,QAAS,EAAA,GAAIiD,OAAO+D,WAAa,EAAA;QACxE7E,IAAA,CAAK8E,WAAY,CAAAjB,GAAA,CAAI,IAAK,CAAA9D,KAAA,EAAO,IAAI,CAAA,CAAA;AAC1BsD,QAAAA,QAAA,GAAA,IAAA,CAAA;AACb,OAAA;MACA,IAAI,IAAK,CAAA9D,QAAA,KAAa,IAAQ,IAAAuB,MAAA,CAAOqD,IAAM,EAAA;AAC9Bd,QAAAA,QAAA,GAAA,KAAA,CAAA;AACb,OAAA;AACA,MAAA,IAAIA,QAAU,EAAA;QACZrD,IAAA,CAAK8E,WAAY,CAAAjB,GAAA,CAAI,IAAK,CAAA9D,KAAA,EAAO,IAAI,CAAA,CAAA;AACvC,OAAO,MAAA;AACAC,QAAAA,IAAA,CAAA8E,WAAA,CAAA,QAAA,CAAmB,CAAA,IAAA,CAAK/E,KAAK,CAAA,CAAA;AACpC,OAAA;MACA,IAAA,CAAKsD,QAAW,GAAAA,QAAA,CAAA;AAClB,KAAA;AAAA,GAAA,EAAA;IAAAoB,GAAA,EAAA,aAAA;AAAA1E,IAAAA,KAAA,EAMQ,SAAAiE,WAAoBA,GAAA;AACpB,MAAA,IAAEhE,IAAM,GAAY,IAAA,CAAlBA,IAAM;QAAAkD,OAAA,GAAY,IAAA,CAAZA,OAAA,CAAA;AACV,MAAA,IAAAA,OAAA,IAAW,IAAK,CAAA6B,WAAA,EAAe,EAAA;QACjC/E,IAAA,CAAKgF,UAAW,CAAAnB,GAAA,CAAI,IAAK,CAAA9D,KAAA,EAAO,IAAI,CAAA,CAAA;AACtC,OAAA;AACF,KAAA;AAAA,GAAA,EAAA;IAAA0E,GAAA,EAAA,QAAA;AAAA1E,IAAAA,KAAA,EASO,SAAAxB,OAAOD,IAAmD,EAAA;AAAA,MAAA,IAAA2G,MAAA,GAAA,IAAA,CAAA;MAC/D,IAAMC,OAAO,EAAC,CAAA;AACd,MAAA,IAAI,CAAC1F,KAAA,CAAMC,OAAQ,CAAAnB,IAAI,CAAG,EAAA;AACxB4G,QAAAA,IAAA,CAAKC,KAAK7G,IAAI,CAAA,CAAA;AAChB,OAAO,MAAA;QACA4G,IAAA,CAAAC,IAAA,CAAAC,KAAA,CAAAF,IAAA,EAAAG,kBAAA,CAAQ/G,IAAI,CAAA,CAAA,CAAA;AACnB,OAAA;AACI,MAAA,IAAA4G,IAAA,CAAKxF,UAAU,CAAG,EAAA;AACpB,QAAA,OAAA;AACF,OAAA;MACA,IAAI,CAACF,KAAA,CAAMC,OAAQ,CAAA,IAAA,CAAKF,QAAQ,CAAG,EAAA;QACjC,IAAA,CAAKA,WAAW,EAAC,CAAA;AACnB,OAAA;AACM,MAAA,IAAEA,QAAU,GAAS,IAAA,CAAnBA,QAAU;QAAAS,IAAA,GAAS,IAAA,CAATA,IAAA,CAAA;AACbkF,MAAAA,IAAA,CAAApB,OAAA,CAAQ,UAACnF,IAAS,EAAA;QACrB,IAAIpB,IAAO,GAAA,IAAA,CAAA;QACX,IAAIoB,gBAAgBsD,QAAU,EAAA;AACrB1E,UAAAA,IAAA,GAAAoB,IAAA,CAAA;UACFpB,IAAA,CAAA+H,QAAA,CAASL,MAAK,CAAAjF,IAAA,EAAMiF,MAAI,CAAA,CAAA;AAC/B,SAAO,MAAA;UACL1H,IAAA,GAAO,IAAI0E,QAAA,CAASgD,MAAK,CAAAjF,IAAA,EAAMrB,MAAMsG,MAAI,CAAA,CAAA;AACzC1F,UAAAA,QAAA,CAAS4F,KAAK5H,IAAI,CAAA,CAAA;AACpB,SAAA;AACF,OAAC,CAAA,CAAA;AACDyC,MAAAA,IAAA,CAAKuE,OAAO,IAAI,CAAA,CAAA;MAChB,IAAA,CAAKgB,aAAc,EAAA,CAAA;AACrB,KAAA;AAAA,GAAA,EAAA;IAAAd,GAAA,EAAA,UAAA;IAAA1E,KAAA,EASO,SAAAuF,QAAAA,CAAStF,IAAiB,EAAAjB,MAAA,EAAmByG,KAAsB,EAAA;AAAA,MAAA,IAAAC,MAAA,GAAA,IAAA,CAAA;MACxE,IAAMC,UAAa,GAAA3G,MAAA,CAAA;MACnB,IAAI4G,WAAc,GAAA,CAAA,CAAA,CAAA;AACd,MAAA,IAAAf,QAAA,CAASY,KAAK,CAAG,EAAA;AACLG,QAAAA,WAAA,GAAAH,KAAA,CAAA;AAChB,OAAA;AAEA,MAAA,IAAMI,aAAgB,GAAA,CAAAF,UAAA,KAAAA,IAAAA,IAAAA,UAAA,KAAAA,KAAAA,CAAAA,GAAAA,KAAAA,CAAAA,GAAAA,UAAA,CAAY1G,UAAW,EAAA,KAAK,EAAC,CAAA;AACnD,MAAA,IAAM6G,iBAAiBD,aAAc,CAAAE,IAAA,CAAK,UAACtF,KAAA,EAAA;QAAA,OAAUA,UAAUiF,MAAI,CAAA;OAAA,CAAA,CAAA;AACnE,MAAA,IAAII,cAAgB,EAAA;AACZ,QAAA,MAAA,IAAIE,MAAM,0EAAc,CAAA,CAAA;AAChC,OAAA;MAEA,IAAIL,eAAe,IAAM,EAAA;AACjB,QAAA,MAAA,IAAIK,MAAM,oEAAa,CAAA,CAAA;AAC/B,OAAA;AAEA,MAAA,IAAIvG,KAAM,CAAAC,OAAA,CAAQiG,UAAY,KAAA,IAAA,IAAZA,UAAY,KAAA,KAAA,CAAA,GAAA,KAAA,CAAA,GAAZA,UAAY,CAAAnG,QAAQ,CAAG,EAAA;QACjC,IAAAyG,aAAA,GAAgBN,eAAAA,IAAAA,IAAAA,eAAAA,KAAAA,CAAAA,GAAAA,KAAAA,CAAAA,GAAAA,WAAYnG,QAAS,CAAAoG,WAAA,CAAA,CAAA;AACvC,QAAA,IAAAK,aAAA,IAAiBA,kBAAkB,IAAM,EAAA;AAE3C,UAAA,OAAA;AACF,SAAA;AACF,OAAA;MAIA,IAAIC,QAAW,GAAA,IAAA,CAAA;MACf,IAAIP,sBAAsBzD,QAAU,EAAA;AAClC,QAAA,IAAI,CAACzC,KAAA,CAAMC,OAAQ,CAAAiG,UAAA,KAAAA,IAAAA,IAAAA,UAAA,KAAAA,KAAAA,CAAAA,GAAAA,KAAAA,CAAAA,GAAAA,UAAA,CAAYnG,QAAQ,CAAG,EAAA;UACxCmG,UAAA,CAAWnG,WAAW,EAAC,CAAA;AACzB,SAAA;QACA0G,QAAA,GAAWlH,MAAO,CAAAQ,QAAA,CAAA;AACpB,OAAO,MAAA;QACL0G,QAAA,GAAWjG,IAAK,CAAAT,QAAA,CAAA;AAClB,OAAA;AAIA,MAAA,IAAI,CAACC,KAAA,CAAMC,OAAQ,CAAAwG,QAAQ,CAAG,EAAA;AACtB,QAAA,MAAA,IAAIF,MAAM,gIAAuB,CAAA,CAAA;AACzC,OAAA;AAEA,MAAA,IAAMG,aAAaD,QAAS,CAAAvG,MAAA,CAAA;AACtB,MAAA,IAAAyG,SAAA,GAAY,KAAKrI,QAAS,EAAA,CAAA;MAEhC,IAAA,CAAKgC,MAAO,EAAA,CAAA;AAER,MAAA,IAAA8E,QAAA,CAASY,KAAK,CAAG,EAAA;QACnB,IAAIG,YAAc,GAAAH,KAAA,CAAA;AACd,QAAA,IAAAE,UAAA,KAAe,KAAK3G,MAAQ,EAAA;AAI9B,UAAA,IAAMqH,YAAYH,QAAS,CAAAvG,MAAA,CAAA;AACvB,UAAA,IAAA0G,SAAA,GAAYF,UAAc,IAAAC,SAAA,IAAaR,YAAa,EAAA;AACtDA,YAAAA,YAAe,IAAA,CAAA,CAAA;AACjB,WAAA;AACF,SAAA;QACSM,QAAA,CAAAI,MAAA,CAAOV,YAAa,EAAA,CAAA,EAAG,IAAI,CAAA,CAAA;AACtC,OAAO,MAAA;AACLM,QAAAA,QAAA,CAASd,KAAK,IAAI,CAAA,CAAA;AACpB,OAAA;MAEA,IAAA,CAAKpG,MAAS,GAAA2G,UAAA,CAAA;AAIR,MAAA,IAAAjH,KAAA,GAAQ,KAAKkB,IAAK,EAAA,CAAA;AAClBlB,MAAAA,KAAA,CAAAqF,OAAA,CAAQ,UAACnF,IAAS,EAAA;QACtB,IAAMpB,IAAO,GAAAoB,IAAA,CAAA;QACbpB,IAAA,CAAKyC,IAAO,GAAAA,IAAA,CAAA;QACZA,IAAA,CAAK0D,OAAQ,CAAAG,GAAA,CAAItG,IAAK,CAAAwC,KAAA,EAAOxC,IAAI,CAAA,CAAA;QACjCyC,IAAA,CAAK2D,UAAW,CAAAE,GAAA,CAAItG,IAAK,CAAAyE,UAAA,CAAA,EAAazE,IAAI,CAAA,CAAA;QAC1C,IAAIA,KAAK8F,QAAU,EAAA;UACjBrD,IAAA,CAAK8E,WAAY,CAAAjB,GAAA,CAAItG,IAAK,CAAAwC,KAAA,EAAO,IAAI,CAAA,CAAA;AACvC,SAAA;AACF,OAAC,CAAA,CAAA;MAED,IAAMuG,WAAc,GAAA,CAAAZ,UAAA,aAAAA,UAAA,KAAA,KAAA,CAAA,GAAA,KAAA,CAAA,GAAAA,UAAA,CAAY/F,IAAK,EAAA,KAAKK,IAAK,CAAAT,QAAA,CAASb,GAAI,CAAA,UAACC,IAAS,EAAA;AAAA,QAAA,OAAAA,IAAA,CAAKgB,IAAK,EAAC,CAAA;SAAE4G,IAAK,EAAA,CAAA;AAC5ED,MAAAA,WAAA,CAAAxC,OAAA,CAAQ,UAACvG,IAAS,EAAA;QAC5BA,IAAA,CAAK+G,MAAO,EAAA,CAAA;QACZ/G,IAAA,CAAK8G,aAAc,EAAA,CAAA;AACrB,OAAC,CAAA,CAAA;MAEDrE,IAAA,CAAKuE,MAAO,EAAA,CAAA;AACd,KAAA;AAAA,GAAA,EAAA;IAAAE,GAAA,EAAA,QAAA;AAAA1E,IAAAA,KAAA,EAQQ,SAAAyG,MAAAA,CAAO7H,MAAoB6G,KAAsB,EAAA;AACjD,MAAA,IAAExF,IAAM,GAAW,IAAA,CAAjBA,IAAM;QAAAjB,MAAA,GAAW,IAAA,CAAXA,MAAA,CAAA;AACR,MAAA,IAAAkH,QAAA,GAAW,KAAK9G,WAAY,EAAA,CAAA;MAClC,IAAI5B,IAAO,GAAA,IAAA,CAAA;MACX,IAAIoB,gBAAgBsD,QAAU,EAAA;AACrB1E,QAAAA,IAAA,GAAAoB,IAAA,CAAA;QACFpB,IAAA,CAAA+H,QAAA,CAAStF,IAAM,EAAAjB,MAAA,EAAQyG,KAAK,CAAA,CAAA;iBACxB7G,IAAM,EAAA;QACfpB,IAAA,GAAO,IAAI0E,QAAA,CAASjC,IAAM,EAAArB,IAAA,EAAMI,MAAM,CAAA,CAAA;AAClC,QAAA,IAAA6F,QAAA,CAASY,KAAK,CAAG,EAAA;UACVS,QAAA,CAAAI,MAAA,CAAOb,KAAO,EAAA,CAAA,EAAGjI,IAAI,CAAA,CAAA;AAChC,SAAA;AACS0I,QAAAA,QAAA,CAAAnC,OAAA,CAAQ,UAAC2C,OAAY,EAAA;UAC5BA,OAAA,CAAQnC,MAAO,EAAA,CAAA;AACjB,SAAC,CAAA,CAAA;AACH,OAAA;MACAtE,IAAA,CAAKuE,MAAO,EAAA,CAAA;AACd,KAAA;AAAA,GAAA,EAAA;IAAAE,GAAA,EAAA,cAAA;AAAA1E,IAAAA,KAAA,EAOO,SAAA7B,aAAaC,OAA6B,EAAA;AACzC,MAAA,IAAAqH,KAAA,GAAQ,KAAK1H,QAAS,EAAA,CAAA;AACvB,MAAA,IAAA,CAAA0I,MAAA,CAAOrI,SAASqH,KAAK,CAAA,CAAA;AAC5B,KAAA;AAAA,GAAA,EAAA;IAAAf,GAAA,EAAA,aAAA;AAAA1E,IAAAA,KAAA,EAOO,SAAA3B,YAAYD,OAA6B,EAAA;AACxC,MAAA,IAAAqH,KAAA,GAAQ,KAAK1H,QAAS,EAAA,CAAA;MACvB,IAAA,CAAA0I,MAAA,CAAOrI,OAAS,EAAAqH,KAAA,GAAQ,CAAC,CAAA,CAAA;AAChC,KAAA;AAAA,GAAA,EAAA;IAAAf,GAAA,EAAA,QAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAAD,MAAeA,GAAA;AACd,MAAA,IAAEE,OAAS,IAAA,CAATA;AAEF,MAAA,IAAAvB,KAAA,GAAQ,KAAKkB,IAAK,EAAA,CAAA;AAClB,MAAA,IAAAsG,QAAA,GAAW,KAAK9G,WAAY,EAAA,CAAA;AAC5B,MAAA,IAAAqG,KAAA,GAAQ,KAAK1H,QAAS,EAAA,CAAA;AAGxB,MAAA,IAAA0B,KAAA,CAAMC,OAAQ,CAAAwG,QAAQ,CAAG,EAAA;AAClBA,QAAAA,QAAA,CAAAI,MAAA,CAAOb,OAAO,CAAC,CAAA,CAAA;AAC1B,OAAA;AAEM/G,MAAAA,KAAA,CAAAqF,OAAA,CAAQ,UAACvG,IAAS,EAAA;QACtBA,IAAA,CAAKmJ,KAAM,EAAA,CAAA;AACb,OAAC,CAAA,CAAA;AAEQT,MAAAA,QAAA,CAAAnC,OAAA,CAAQ,UAACvG,IAAS,EAAA;QACzBA,IAAA,CAAK+G,MAAO,EAAA,CAAA;AACd,OAAC,CAAA,CAAA;MAED,IAAA,CAAKqC,aAAc,EAAA,CAAA;MACnB3G,IAAA,CAAKuE,MAAO,EAAA,CAAA;AACd,KAAA;AAAA,GAAA,EAAA;IAAAE,GAAA,EAAA,OAAA;AAAA1E,IAAAA,KAAA,EAMQ,SAAA2G,KAAcA,GAAA;AACd,MAAA,IAAE1G,IAAM,GAAU,IAAA,CAAhBA,IAAM;QAAAD,KAAA,GAAU,IAAA,CAAVA,KAAA,CAAA;AACTC,MAAAA,IAAA,CAAAgF,UAAA,WAAkBjF,KAAK,CAAA,CAAA;AACvBC,MAAAA,IAAA,CAAA0E,UAAA,WAAkB3E,KAAK,CAAA,CAAA;AACvBC,MAAAA,IAAA,CAAA8E,WAAA,WAAmB/E,KAAK,CAAA,CAAA;AACxBC,MAAAA,IAAA,CAAA0D,OAAA,WAAe3D,KAAK,CAAA,CAAA;AACpBC,MAAAA,IAAA,CAAA4G,SAAA,WAAiB7G,KAAK,CAAA,CAAA;MACtBC,IAAA,CAAA2D,UAAA,CAAkB,QAAA,CAAA,CAAA,IAAA,CAAK3B,UAAW,CAAA,CAAA,CAAA;AACzC,KAAA;AAAA,GAAA,EAAA;IAAAyC,GAAA,EAAA,cAAA;IAAA1E,KAAA,EAAA,YAAA;MAAA,IAAA8G,aAAA,GAAAC,iBAAA,cAAAC,WAAA,CAAAC,IAAA,CAMA,SAAAC,OAAA,GAAA;QAAA,IAAAnG,MAAA,EAAAoE,IAAA,CAAA;AAAA,QAAA,OAAA6B,WAAA,CAAAG,IAAA,CAAA,SAAAC,SAAAC,QAAA,EAAA;AAAA,UAAA,OAAA,CAAA,EAAA,QAAAA,QAAA,CAAAC,IAAA,GAAAD,QAAA,CAAAE,IAAA;AAAA,YAAA,KAAA,CAAA;cACQxG,MAAS,GAAA2C,GAAA,CAAI,IAAM,EAAA,aAAa,KAAK,EAAC,CAAA;cAAA,IACxC,EAAA,IAAK,CAAAlE,QAAA,KAAa,IAAQ,IAAA,CAAC,KAAKsC,OAAS,CAAA,EAAA;AAAAuF,gBAAAA,QAAA,CAAAE,IAAA,GAAA,EAAA,CAAA;AAAA,gBAAA,MAAA;AAAA,eAAA;cAAA,IACvC,EAAA,MAAU,IAAAxG,MAAA,IAAUyG,UAAW,CAAAzG,MAAA,CAAO0G,IAAI,CAAG,CAAA,EAAA;AAAAJ,gBAAAA,QAAA,CAAAE,IAAA,GAAA,EAAA,CAAA;AAAA,gBAAA,MAAA;AAAA,eAAA;cAC/C,IAAA,CAAKzF,OAAU,GAAA,IAAA,CAAA;cACf,IAAA,CAAKyC,MAAO,EAAA,CAAA;AACRY,cAAAA,OAAO,EAAC,CAAA;AAAAkC,cAAAA,QAAA,CAAAE,IAAA,GAAA,CAAA,CAAA;AAAA,cAAA,OACCxG,MAAO,CAAA0G,IAAA,CAAK,IAAI,CAAA,CAAA;AAAA,YAAA,KAAA,CAAA;cAAtBtC,IAAA,GAAAkC,QAAA,CAAAK,IAAA,CAAA;AACF,cAAA,IAAA,CAAAzH,IAAA,CAAK0H,KAAK,MAAQ,EAAA;AACrBnK,gBAAAA,IAAM,EAAA,IAAA;AACNe,gBAAAA,IAAM,EAAA4G,IAAAA;AACR,eAAC,CAAA,CAAA;cACD,IAAA,CAAKrD,OAAU,GAAA,KAAA,CAAA;AACf,cAAA,IAAIrC,MAAMC,OAAQ,CAAAyF,IAAI,CAAK,IAAAA,IAAA,CAAKxF,SAAS,CAAG,EAAA;AAC1C,gBAAA,IAAA,CAAKnB,OAAO2G,IAAI,CAAA,CAAA;AAClB,eAAO,MAAA;gBACL,IAAA,CAAK3F,QAAW,GAAA,KAAA,CAAA;AAClB,eAAA;cACA,IAAA,CAAK+E,MAAO,EAAA,CAAA;AAAA,YAAA,KAAA,EAAA,CAAA;AAAA,YAAA,KAAA,KAAA;cAAA,OAAA8C,QAAA,CAAAO,IAAA,EAAA,CAAA;AAAA,WAAA;AAAA,SAAA,EAAAV,OAAA,EAAA,IAAA,CAAA,CAAA;OAGlB,CAAA,CAAA,CAAA;AAAA,MAAA,SArBc7C,YAA8BA,GAAA;AAAA,QAAA,OAAAyC,aAAA,CAAAzB,KAAA,CAAA,IAAA,EAAAwC,SAAA,CAAA,CAAA;AAAA,OAAA;AAAA,MAAA,OAA9BxD,YAA8B,CAAA;AAAA,KAAA,EAAA;AAAA,GAAA,EAAA;IAAAK,GAAA,EAAA,KAAA;AAAA1E,IAAAA,KAAA,EA8BrC,SAAA8D,IAAIlF,IAA2B,EAAA;AAAA,MAAA,IAAAkJ,MAAA,GAAA,IAAA,CAAA;AAC9B,MAAA,IAAE7H,OAAS,IAAA,CAATA;AACF,MAAA,IAAAa,IAAA,GAAOM,MAAO,CAAAN,IAAA,CAAKlC,IAAI,CAAA,CAAA;AACxBkC,MAAAA,IAAA,CAAAiD,OAAA,CAAQ,UAACW,GAAQ,EAAA;AAElB,QAAA,IAAAnD,cAAA,CAAewG,KAAKtG,cAAgB,EAAAiD,GAAG,KACpCA,GAAQ,KAAA,OAAA,IACRA,QAAQ,UACX,EAAA;AAGAoD,UAAAA,MAAA,CAAKpD,OAAO9F,IAAK,CAAA8F,GAAA,CAAA,CAAA;AACnB,SAAA;AACF,OAAC,CAAA,CAAA;AACDzE,MAAAA,IAAA,CAAK+H,QAAQ,IAAI,CAAA,CAAA;AACnB,KAAA;AAAA,GAAA,EAAA;IAAAtD,GAAA,EAAA,WAAA;AAAA1E,IAAAA,KAAA,EAQO,SAAAlB,SAAsBA,GAAA;MAC3B,OAAO,IAAK,CAAAE,MAAA,CAAA;AACd,KAAA;AAAA,GAAA,EAAA;IAAA0F,GAAA,EAAA,YAAA;AAAA1E,IAAAA,KAAA,EAOO,SAAAf,UAAyBA,GAAA;MAC9B,IAAMsB,UAAU,EAAC,CAAA;AACjB,MAAA,IAAI/C,OAAO,IAAK,CAAAwB,MAAA,CAAA;AAChB,MAAA,OAAOxB,IAAM,EAAA;AACX+C,QAAAA,OAAA,CAAQ6E,KAAK5H,IAAI,CAAA,CAAA;QACjBA,IAAA,GAAOA,IAAK,CAAAwB,MAAA,CAAA;AACd,OAAA;AACO,MAAA,OAAAuB,OAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAmE,GAAA,EAAA,aAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAAZ,WAA0BA,GAAA;AACzB,MAAA,IAAEJ,MAAQ,GAAS,IAAA,CAAjBA,MAAQ;QAAAiB,IAAA,GAAS,IAAA,CAATA,IAAA,CAAA;MAChB,IAAIkF,OAAmB,EAAC,CAAA;AACxB,MAAA,IAAInG,MAAQ,EAAA;QACV,IAAIS,KAAM,CAAAC,OAAA,CAAQV,MAAO,CAAAQ,QAAQ,CAAG,EAAA;UAClC2F,IAAA,GAAOnG,MAAO,CAAAQ,QAAA,CAAA;AAChB,SAAA;iBACSS,IAAM,EAAA;QACfkF,IAAA,GAAOlF,IAAK,CAAAT,QAAA,CAAA;AACd,OAAA;AACO,MAAA,OAAA2F,IAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAT,GAAA,EAAA,aAAA;AAAA1E,IAAAA,KAAA,EAOO,SAAAX,YAAYC,IAA+C,EAAA;MAChE,IAAIC,aAA+C,GAAA,KAAA,CAAA;AAC7C,MAAA,IAAEC,WAAa,IAAA,CAAbA;AACJ,MAAA,IAAAC,KAAA,CAAMC,OAAQ,CAAAF,QAAQ,CAAG,EAAA;AACvB,QAAA,IAAAA,QAAA,CAASG,SAAS,CAAG,EAAA;AACvB,UAAA,IAAIL,IAAM,EAAA;AACF,YAAA,IAAAZ,KAAA,GAAQ,KAAKkB,IAAK,EAAA,CAAA;YACxBlB,KAAA,CAAMmB,KAAM,EAAA,CAAA;AACZN,YAAAA,aAAA,GAAgBb,MAAMC,GAAI,CAAA,UAACC,IAAS,EAAA;AAAA,cAAA,OAAAA,IAAA,CAAKC,UAAU,CAAA;aAAA,CAAA,CAAA;AACrD,WAAO,MAAA;AACLU,YAAAA,aAAA,GAAgBC,SAASb,GAAI,CAAA,UAACC,IAAS,EAAA;AAAA,cAAA,OAAAA,IAAA,CAAKC,UAAU,CAAA;aAAA,CAAA,CAAA;AACxD,WAAA;AACF,SAAO,MAAA;AACWU,UAAAA,aAAA,GAAA,KAAA,CAAA;AAClB,SAAA;AACF,OAAA,MAAA,IAAWO,SAAU,CAAAN,QAAQ,CAAG,EAAA;AACdD,QAAAA,aAAA,GAAAC,QAAA,CAAA;AAClB,OAAA;AACO,MAAA,OAAAD,aAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAmF,GAAA,EAAA,SAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAAd,OAAoBA,GAAA;AACnB,MAAA,IAAAqB,OAAA,GAAU,KAAKtB,UAAW,EAAA,CAAA;MACzB,OAAAsB,OAAA,CAAQA,OAAQ,CAAAZ,MAAA,GAAS,CAAM,CAAA,IAAA,IAAA,CAAA;AACxC,KAAA;AAAA,GAAA,EAAA;IAAA+E,GAAA,EAAA,UAAA;AAAA1E,IAAAA,KAAA,EAOO,SAAAjC,QAAmBA,GAAA;AAClB,MAAA,IAAAoH,IAAA,GAAO,KAAK/F,WAAY,EAAA,CAAA;AACvB,MAAA,OAAA+F,IAAA,CAAKzE,QAAQ,IAAI,CAAA,CAAA;AAC1B,KAAA;AAAA,GAAA,EAAA;IAAAgE,GAAA,EAAA,SAAA;AAAA1E,IAAAA,KAAA,EAQO,SAAAvB,OAAsBA,GAAA;AACrB,MAAA,IAAAC,KAAA,GAAQ,KAAKO,UAAW,EAAA,CAAA;AAC9BP,MAAAA,KAAA,CAAMuJ,QAAQ,IAAI,CAAA,CAAA;AAClB,MAAA,OAAOvJ,MAAMwJ,OAAQ,EAAA,CAAA;AACvB,KAAA;AAAA,GAAA,EAAA;IAAAxD,GAAA,EAAA,UAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAAlC,QAAmBA,GAAA;AAClB,MAAA,IAAAyC,OAAA,GAAU,KAAKtB,UAAW,EAAA,CAAA;MAChC,OAAOsB,OAAQ,CAAAZ,MAAA,CAAA;AACjB,KAAA;AAAA,GAAA,EAAA;IAAA+E,GAAA,EAAA,QAAA;AAAA1E,IAAAA,KAAA,EAQO,SAAAmI,MAAkBA,GAAA;AACvB,MAAA,IAAAC,UAAA,GAAyC,IAAK,CAAAnI,IAAA;QAAtCc,MAAA,GAAAqH,UAAA,CAAArH,MAAA;QAAQ8F,SAAW,GAAAuB,UAAA,CAAXvB,SAAW;QAAAwB,SAAA,GAAAD,UAAA,CAAAC,SAAA,CAAA;MAE3B,IAAIC,IAAO,GAAA,KAAA,CAAA;AACX,MAAA,IAAID,SAAW,EAAA;AAEP,QAAA,IAAAE,SAAA,GAAY,KAAK1J,QAAS,EAAA,CAAA;AACzByJ,QAAAA,IAAA,GAAAvH,MAAA,CAAOyH,OAAOD,SAAS,CAAA,CAAA;AAChC,OAAA;AAEA,MAAA,IAAID,IAAM,EAAA;QACEzB,SAAA,CAAA/C,GAAA,CAAI,IAAK,CAAA9D,KAAA,EAAO,IAAI,CAAA,CAAA;OACrB,MAAA,IAAA6G,SAAA,CAAUnD,GAAI,CAAA,IAAA,CAAK1D,KAAK,CAAG,EAAA;AAC1B6G,QAAAA,SAAA,CAAA,QAAA,CAAA,CAAO,KAAK7G,KAAK,CAAA,CAAA;AAC7B,OAAA;AAEO,MAAA,OAAAsI,IAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAA5D,GAAA,EAAA,WAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAAyI,SAAqBA,GAAA;AAC1B,MAAA,IAAAC,WAAA,GAAuC,IAAK,CAAAzI,IAAA;QAApC0D,OAAA,GAAA+E,WAAA,CAAA/E,OAAA;QAAS0E,SAAW,GAAAK,WAAA,CAAXL,SAAW;QAAAtH,MAAA,GAAA2H,WAAA,CAAA3H,MAAA,CAAA;AACtB,MAAA,IAAE4H,wBAA0B5H,MAAA,CAA1B4H;MAER,IAAIzF,OAAU,GAAA,IAAA,CAAA;MAEd,IAAI,CAACS,OAAA,CAAQD,GAAI,CAAA,IAAA,CAAK1D,KAAK,CAAG,EAAA;AAErB,QAAA,OAAA,KAAA,CAAA;AACT,OAAA;AAEI,MAAA,IAAAqI,SAAA,IAAa,CAACM,qBAAuB,EAAA;AAG7BzF,QAAAA,OAAA,GAAA,IAAA,CAAKD,cAAc,IAAK,CAAAD,QAAA,CAAA;AAC3B,QAAA,OAAAE,OAAA,CAAA;AACT,OAAA;MAGA,IAAI0F,aAAgB,GAAA,IAAA,CAAA;AACd,MAAA,IAAArI,OAAA,GAAU,KAAKtB,UAAW,EAAA,CAAA;AAC5B,MAAA,IAAAsB,OAAA,CAAQZ,SAAS,CAAG,EAAA;AACtBiJ,QAAAA,aAAA,GAAgBrI,OAAQ,CAAAsI,KAAA,CAAM,UAACrL,IAAA,EAAA;UAAA,OAAmBA,KAAK8F,QAAQ,CAAA;SAAA,CAAA,CAAA;AACjE,OAAA;AAEA,MAAA,IAAI+E,SAAW,EAAA;QACHnF,OAAA,GAAA0F,aAAA,KAAkB,IAAK,CAAA5F,QAAA,IAAY,IAAK,CAAAC,UAAA,CAAA,CAAA;AACpD,OAAO,MAAA;AACKC,QAAAA,OAAA,GAAA0F,aAAA,CAAA;AACZ,OAAA;AACO,MAAA,OAAA1F,OAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAwB,GAAA,EAAA,YAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAA8I,UAAsBA,GAAA;AACrB,MAAA,IAAE7I,OAAS,IAAA,CAATA;AACF,MAAA,IAAEoI,SAAW,GAAWpI,IAAA,CAAtBoI,SAAW;QAAAtH,MAAA,GAAWd,IAAA,CAAXc,MAAA,CAAA;AACb,MAAA,IAAE2B,QAAU,GAA0B3B,MAAA,CAApC2B,QAAU;QAAAiG,qBAAA,GAA0B5H,MAAA,CAA1B4H,qBAAA,CAAA;AAClB,MAAA,IACEN,aACG,CAACM,qBAAA,IACD,KAAK1F,UACL,IAAA,CAAC,KAAKD,QACT,EAAA;AACO,QAAA,OAAA,IAAA,CAAA;AACT,OAAA;MACA,IAAI+F,KAAQ,GAAArG,QAAA,CAAA;AACR,MAAA,IAAA,OAAO,IAAK,CAAAA,QAAA,KAAa,SAAW,EAAA;QACtCqG,KAAA,GAAQ,IAAK,CAAArG,QAAA,CAAA;AACf,OAAA;AACO,MAAA,OAAAqG,KAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAArE,GAAA,EAAA,aAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAAgJ,WAAuBA,GAAA;MAC5B,IAAID,KAAQ,GAAA,CAAC,CAACrF,GAAA,CAAI,MAAM,uBAAuB,CAAA,CAAA;AAC3C,MAAA,IAAA,OAAO,IAAK,CAAA7B,SAAA,KAAc,SAAW,EAAA;QACvCkH,KAAA,GAAQ,IAAK,CAAAlH,SAAA,CAAA;AACf,OAAA;AACO,MAAA,OAAAkH,KAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAArE,GAAA,EAAA,eAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAAiJ,aAAyBA,GAAA;MAC9B,IAAIF,KAAQ,GAAA,CAAC,CAACrF,GAAA,CAAI,MAAM,yBAAyB,CAAA,CAAA;AAC7C,MAAA,IAAA,OAAO,IAAK,CAAAhC,WAAA,KAAgB,SAAW,EAAA;QACzCqH,KAAA,GAAQ,IAAK,CAAArH,WAAA,CAAA;AACf,OAAA;AACO,MAAA,OAAAqH,KAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAArE,GAAA,EAAA,aAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAAgF,WAAcA,GAAA;MACnB,IAAI+D,KAAQ,GAAA,CAAC,CAACrF,GAAA,CAAI,MAAM,uBAAuB,CAAA,CAAA;AAC3C,MAAA,IAAA,OAAO,IAAK,CAAA/B,SAAA,KAAc,SAAW,EAAA;QACvCoH,KAAA,GAAQ,IAAK,CAAApH,SAAA,CAAA;AACf,OAAA;AACO,MAAA,OAAAoH,KAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAArE,GAAA,EAAA,aAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAAkJ,WAAcA,GAAA;MACnB,IAAIH,KAAQ,GAAA,CAAC,CAACrF,GAAA,CAAI,MAAM,uBAAuB,CAAA,CAAA;AAC3C,MAAA,IAAA,OAAO,IAAK,CAAA9B,SAAA,KAAc,SAAW,EAAA;QACvCmH,KAAA,GAAQ,IAAK,CAAAnH,SAAA,CAAA;AACf,OAAA;AACO,MAAA,OAAAmH,KAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAArE,GAAA,EAAA,WAAA;AAAA1E,IAAAA,KAAA,EAOO,SAAAmJ,UAAUxK,GAAqC,EAAA;AAC9C,MAAA,IAAEsB,IAAM,GAAU,IAAA,CAAhBA,IAAM;QAAAD,KAAA,GAAU,IAAA,CAAVA,KAAA,CAAA;AACR,MAAA,IAAAiF,UAAA,GAAatG,OAAOsB,IAAK,CAAAgF,UAAA,CAAA;AACxB,MAAA,OAAA,CAAC,EAAEhF,IAAK,CAAA0D,OAAA,CAAQD,IAAI1D,KAAK,CAAA,IAAKiF,UAAW,CAAAvB,GAAA,CAAI1D,KAAK,CAAA,CAAA,CAAA;AAC3D,KAAA;AAAA,GAAA,EAAA;IAAA0E,GAAA,EAAA,YAAA;AAAA1E,IAAAA,KAAA,EAOO,SAAAoJ,WAAWzK,GAAqC,EAAA;AACrD,MAAA,IAAQsB,IAAA,GAA4B,IAAA,CAA5BA,IAAA;QAAMD,KAAO,GAAe,IAAA,CAAtBA,KAAO;QAAAiD,UAAA,GAAe,IAAA,CAAfA,UAAA,CAAA;AACf,MAAA,IAAEoF,SAAW,GAAWpI,IAAA,CAAtBoI,SAAW;QAAAtH,MAAA,GAAWd,IAAA,CAAXc,MAAA,CAAA;AACb,MAAA,IAAE4H,wBAA0B5H,MAAA,CAA1B4H;MACJ,IAAAN,SAAA,IAAa,CAACM,qBAAyB,IAAA1F,UAAA,EAAmB,OAAA,IAAA,CAAA;AACxD,MAAA,IAAA8B,WAAA,GAAcpG,OAAOsB,IAAK,CAAA8E,WAAA,CAAA;AACzB,MAAA,OAAA,CAAC,EAAE9E,IAAK,CAAA0D,OAAA,CAAQD,IAAI1D,KAAK,CAAA,IAAK+E,WAAY,CAAArB,GAAA,CAAI1D,KAAK,CAAA,CAAA,CAAA;AAC5D,KAAA;AAAA,GAAA,EAAA;IAAA0E,GAAA,EAAA,WAAA;AAAA1E,IAAAA,KAAA,EAOO,SAAAqJ,UAAU1K,GAA0B,EAAA;AACzC,MAAA,IAAQa,QAAA,GAA0B,IAAA,CAA1BA,QAAA;QAAUS,IAAM,GAAU,IAAA,CAAhBA,IAAM;QAAAD,KAAA,GAAU,IAAA,CAAVA,KAAA,CAAA;AACxB,MAAA,IAAAsJ,YAAA,GAAqCrJ,IAAK,CAAAc,MAAA;QAAlC6D,aAAA,GAAA0E,YAAA,CAAA1E,aAAA;QAAe2E,SAAU,GAAAD,YAAA,CAAVC,SAAU,CAAA;MAEjC,IAAI,CAACtJ,IAAA,CAAK0D,OAAQ,CAAAD,GAAA,CAAI1D,KAAK,CAAA,EAAU,OAAA,KAAA,CAAA;MAEjC,IAAA,CAAC,KAAKkJ,WAAY,EAAA,EAAU,OAAA,KAAA,CAAA;AAC1B,MAAA,IAAAvE,UAAA,GAAahG,OAAOsB,IAAK,CAAA0E,UAAA,CAAA;AAE/B,MAAA,IAAIC,aAAe,EAAA;AACjB,QAAA,OAAO,CAAC,CAACD,UAAW,CAAAjB,GAAA,CAAI1D,KAAK,CAAA,CAAA;AAC/B,OAAA;MACA,IAAIoD,OAAU,GAAA,KAAA,CAAA;AAEV,MAAA,IAAAuB,UAAA,CAAWjB,IAAI1D,KAAK,CAAA,KAGpBuJ,cAAc,UAEX,IAAA,IAAA,CAAKrL,QAEV,CAAA,EAAA;AACO,QAAA,OAAA,IAAA,CAAA;AACT,OAAA;AAEA,MAAA,IAAIuB,MAAMC,OAAQ,CAAAF,QAAQ,CAAK,IAAAA,QAAA,CAASG,SAAS,CAAG,EAAA;AAExCyD,QAAAA,OAAA,GAAA5D,QAAA,CAASqJ,KAAM,CAAA,UAACrL,IAAS,EAAA;AAC3B,UAAA,IAAAgM,cAAA,GAAiBhM,IAAK,CAAA6L,SAAA,CAAU1E,UAAU,CAAA,CAAA;AACzC,UAAA,OAAA6E,cAAA,CAAA;AACT,SAAC,CAAA,CAAA;AACH,OAAO,MAAA;AAGC,QAAA,IAAAjJ,OAAA,GAAU,KAAKtB,UAAW,EAAA,CAAA;AACtBmE,QAAAA,OAAA,GAAA7C,OAAA,CAAQwF,KAAK,UAACvI,IAAA,EAAA;AAAA,UAAA,OAASmH,WAAWjB,GAAI,CAAAlG,IAAA,CAAKwC,KAAK,CAAC,CAAA;SAAA,CAAA,CAAA;AAC7D,OAAA;AACO,MAAA,OAAAoD,OAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAsB,GAAA,EAAA,iBAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAAyJ,eAA2BA,GAAA;AAChC,MAAA,IAAQjK,QAAA,GAA0B,IAAA,CAA1BA,QAAA;QAAUS,IAAM,GAAU,IAAA,CAAhBA,IAAM;QAAAD,KAAA,GAAU,IAAA,CAAVA,KAAA,CAAA;AAClB,MAAA,IAAE4E,aAAc,GAAI3E,IAAK,CAAAc,MAAA,CAAvB6D,aAAc,CAAA;MAEtB,IAAI,CAAC3E,IAAA,CAAK0D,OAAQ,CAAAD,GAAA,CAAI1D,KAAK,CAAA,EAAU,OAAA,KAAA,CAAA;MAEjC,IAAA,CAAC,KAAKkJ,WAAY,EAAA,EAAU,OAAA,KAAA,CAAA;MAE5B,IAAAtE,aAAA,EAAsB,OAAA,KAAA,CAAA;MAEtB,IAAA,CAACnF,KAAM,CAAAC,OAAA,CAAQF,QAAQ,CAAA,EAAU,OAAA,KAAA,CAAA;MAErC,IAAIkK,YAA+B,GAAA,IAAA,CAAA;MACnC,IAAMrG,aAAgB,GAAA7D,QAAA,CAASuG,IAAK,CAAA,UAACvI,IAAmB,EAAA;AAClD,QAAA,IAAAA,IAAA,CAAKiM,iBAAmB,EAAA;AAEnB,UAAA,OAAA,IAAA,CAAA;AACT,SAAA;AACI,QAAA,IAAAE,MAAA,CAAOD,YAAY,CAAG,EAAA;AACxBA,UAAAA,YAAA,GAAelM,KAAK6L,SAAU,EAAA,CAAA;AAChC,SAAA;AACI,QAAA,IAAAK,YAAA,KAAiBlM,IAAK,CAAA6L,SAAA,EAAa,EAAA;AAE9B,UAAA,OAAA,IAAA,CAAA;AACT,SAAA;AACO,QAAA,OAAA,KAAA,CAAA;AACT,OAAC,CAAA,CAAA;AAEM,MAAA,OAAAhG,aAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAqB,GAAA,EAAA,SAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAAhC,OAAmBA,GAAA;AAClB,MAAA,IAAAkI,QAAA,GAAW,KAAK9G,WAAY,EAAA,CAAA;AAClC,MAAA,OAAO8G,SAAS,CAAO,CAAA,KAAA,IAAA,CAAA;AACzB,KAAA;AAAA,GAAA,EAAA;IAAAxB,GAAA,EAAA,QAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAA/B,MAAkBA,GAAA;AACjB,MAAA,IAAAiI,QAAA,GAAW,KAAK9G,WAAY,EAAA,CAAA;MAC3B,OAAA8G,QAAA,CAASA,QAAS,CAAAvG,MAAA,GAAS,CAAO,CAAA,KAAA,IAAA,CAAA;AAC3C,KAAA;AAAA,GAAA,EAAA;IAAA+E,GAAA,EAAA,QAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAA9B,MAAkBA,GAAA;MACvB,IAAIA,MAAS,GAAA,KAAA,CAAA;MACb,IAAIuB,KAAM,CAAAC,OAAA,CAAQ,IAAK,CAAAF,QAAQ,CAAG,EAAA;AACvBtB,QAAAA,MAAA,GAAA,IAAA,CAAKsB,SAASG,MAAU,IAAA,CAAA,CAAA;AACnC,OAAO,MAAA;AACLzB,QAAAA,MAAA,GAAS,CAAC,IAAK,CAAAsB,QAAA,CAAA;AACjB,OAAA;AACO,MAAA,OAAAtB,MAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAwG,GAAA,EAAA,MAAA;AAAA1E,IAAAA,KAAA,EAUO,SAAA4J,KAAKC,SAA0B,EAAA;MACpC,IAAA,CAAK5G,UAAa,GAAA4G,SAAA,CAAA;AACb,MAAA,IAAA,CAAAvG,QAAA,GAAW,KAAK8F,UAAW,EAAA,CAAA;AAC3B,MAAA,IAAA,CAAAlG,OAAA,GAAU,KAAKuF,SAAU,EAAA,CAAA;AAChC,KAAA;AAAA,GAAA,EAAA;IAAA/D,GAAA,EAAA,eAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAA8J,aAAsBA,GAAA;MAC3B,IAAA,CAAKvF,MAAO,EAAA,CAAA;MAEZ,IAAI,IAAK,CAAAjB,QAAA,IAAY,IAAK,CAAA9D,QAAA,KAAa,IAAM,EAAA;QAC3C,IAAA,CAAK6E,YAAa,EAAA,CAAA;AACpB,OAAA;MACA,IAAA,CAAK0F,cAAe,EAAA,CAAA;AACtB,KAAA;AAAA,GAAA,EAAA;IAAArF,GAAA,EAAA,gBAAA;AAAA1E,IAAAA,KAAA,EAQO,SAAAgK,cAAkCA,GAAA;MACvC,OAAO,IAAK,CAAAC,WAAA,CAAY,CAAC,IAAA,CAAKb,YAAY,CAAA,CAAA;AAC5C,KAAA;AAAA,GAAA,EAAA;IAAA1E,GAAA,EAAA,aAAA;AAAA1E,IAAAA,KAAA,EASO,SAAAiK,WAAAA,CACL3G,UACA4G,IACiB,EAAA;AACX,MAAA,IAAEjK,OAAS,IAAA,CAATA;AACF,MAAA,IAAEc,SAAWd,IAAA,CAAXc;MACR,IAAMoJ,OAAU,GAAAtM,aAAA,CAAA;AACduM,QAAAA,QAAU,EAAA,KAAA;AAAA,OAAA,EACPF,IAAA,CACL,CAAA;AAEA,MAAA,IAAIvL,MAAMsB,IAAK,CAAA8E,WAAA,CAAA;AACX,MAAA,IAAA,CAACoF,QAAQC,QAAU,EAAA;AACfzL,QAAAA,GAAA,GAAA,IAAI0L,GAAI,CAAApK,IAAA,CAAK8E,WAAW,CAAA,CAAA;AAChC,OAAA;AAGA,MAAA,IAAIzB,QAAU,EAAA;QAEZ,IAAMgH,oBAAoB,EAAC,CAAA;AAE3BA,QAAAA,iBAAA,CAAkBlF,KAAK,IAAI,CAAA,CAAA;QAC3B,IAAIrE,OAAOwJ,YAAc,EAAA;UAEvB,IAAA,CAAKtL,UAAW,EAAA,CAAE8E,OAAQ,CAAA,UAACvG,IAAS,EAAA;AAClC8M,YAAAA,iBAAA,CAAkBlF,KAAK5H,IAAI,CAAA,CAAA;AAC7B,WAAC,CAAA,CAAA;AACH,SAAA;AACkB8M,QAAAA,iBAAA,CAAAvG,OAAA,CAAQ,UAACvG,IAAS,EAAA;UAClC,IAAIyL,aAAgB,GAAA,KAAA,CAAA;UAEpB,IAAIzL,KAAKwB,MAAQ,EAAA;AACCiK,YAAAA,aAAA,GAAAzL,IAAA,CAAKwB,OAAOiK,aAAc,EAAA,CAAA;AAC5C,WAAO,MAAA;AAAA,YAAA,IAAAuB,aAAA,CAAA;AACLvB,YAAAA,aAAA,GAAgBhJ,SAAAA,IAAAA,IAAAA,oCAAAA,KAAMc,MAAQ,MAAAyJ,IAAAA,IAAAA,aAAA,KAAdA,KAAAA,CAAAA,GAAAA,KAAAA,CAAAA,GAAAA,aAAA,CAAc9I,WAAA,CAAA;AAChC,WAAA;AACA,UAAA,IAAIuH,aAAe,EAAA;AAEX,YAAA,IAAA/C,QAAA,GAAW1I,KAAK4B,WAAY,EAAA,CAAA;AACzB8G,YAAAA,QAAA,CAAAnC,OAAA,CAAQ,UAAC0G,KAAU,EAAA;AACtB9L,cAAAA,GAAA,CAAA,QAAA,CAAA,CAAO8L,MAAMzK,KAAK,CAAA,CAAA;cAEtByK,KAAA,CAAMlG,MAAO,EAAA,CAAA;cACbkG,KAAA,CAAMV,cAAe,EAAA,CAAA;AACvB,aAAC,CAAA,CAAA;AACH,WAAA;UAEIpL,GAAA,CAAAmF,GAAA,CAAItG,IAAK,CAAAwC,KAAA,EAAO,IAAI,CAAA,CAAA;UACxBxC,IAAA,CAAK+G,MAAO,EAAA,CAAA;UACZ/G,IAAA,CAAKuM,cAAe,EAAA,CAAA;AACtB,SAAC,CAAA,CAAA;AACH,OAAO,MAAA;AACDpL,QAAAA,GAAA,CAAA,QAAA,CAAA,CAAO,KAAKqB,KAAK,CAAA,CAAA;AACvB,OAAA;MAEA,IAAImK,QAAQC,QAAU,EAAA;QACpB,IAAA,CAAKN,aAAc,EAAA,CAAA;AACrB,OAAA;AAEO,MAAA,OAAA7J,IAAA,CAAKyK,YAAY/L,GAAG,CAAA,CAAA;AAC7B,KAAA;AAAA,GAAA,EAAA;IAAA+F,GAAA,EAAA,eAAA;AAAA1E,IAAAA,KAAA,EAQO,SAAA2K,aAAiCA,GAAA;MACtC,OAAO,IAAK,CAAAC,UAAA,CAAW,CAAC,IAAA,CAAKzB,WAAW,CAAA,CAAA;AAC1C,KAAA;AAAA,GAAA,EAAA;IAAAzE,GAAA,EAAA,YAAA;AAAA1E,IAAAA,KAAA,EASO,SAAA4K,UAAAA,CACLzH,SACA+G,IACiB,EAAA;AACX,MAAA,IAAEjK,OAAS,IAAA,CAATA;MACR,IAAMkK,OAAU,GAAAtM,aAAA,CAAA;AACduM,QAAAA,QAAU,EAAA,KAAA;AAAA,OAAA,EACPF,IAAA,CACL,CAAA;AACM,MAAA,IAAAnJ,MAAA,GAASd,IAAK,CAAAc,MAAA,IAAU,EAAC,CAAA;AAC/B,MAAA,IAAIpC,MAAMsB,IAAK,CAAAgF,UAAA,CAAA;AACX,MAAA,IAAA,CAACkF,QAAQC,QAAU,EAAA;AACfzL,QAAAA,GAAA,GAAA,IAAI0L,GAAI,CAAApK,IAAA,CAAKgF,UAAU,CAAA,CAAA;AAC/B,OAAA;AACI,MAAA,IAAA,IAAA,CAAKD,aAAe,EAAA;AACtB,QAAA,IAAI7B,OAAS,EAAA;UACX,IAAM0H,QAAW,GAAApL,KAAA,CAAMqL,IAAK,CAAAnM,GAAA,CAAImC,MAAM,CAAA,CAAA;AAClC,UAAA,IAAA,CAACC,OAAOgK,cAAgB,EAAA;YAC1BpM,GAAA,CAAIqM,KAAM,EAAA,CAAA;AACZ,WAAA;AACSH,UAAAA,QAAA,CAAA9G,OAAA,CAAQ,UAAC/D,KAAU,EAAA;AACpB,YAAA,IAAAxC,IAAA,GAAOyC,IAAK,CAAAE,OAAA,CAAQH,KAAK,CAAA,CAAA;AAC/BxC,YAAAA,IAAA,aAAAA,IAAA,KAAA,KAAA,CAAA,IAAAA,IAAA,CAAM+G,MAAO,EAAA,CAAA;AACf,WAAC,CAAA,CAAA;UACG5F,GAAA,CAAAmF,GAAA,CAAI,IAAK,CAAA9D,KAAA,EAAO,IAAI,CAAA,CAAA;AAC1B,SAAO,MAAA;AACDrB,UAAAA,GAAA,CAAA,QAAA,CAAA,CAAO,KAAKqB,KAAK,CAAA,CAAA;AACvB,SAAA;AACF,OAAA;MACA,IAAA,CAAKuE,MAAO,EAAA,CAAA;AACL,MAAA,OAAAtE,IAAA,CAAKgL,WAAWtM,GAAG,CAAA,CAAA;AAC5B,KAAA;AAAA,GAAA,EAAA;IAAA+F,GAAA,EAAA,eAAA;AAAA1E,IAAAA,KAAA,EAQO,SAAAkL,aAAiCA,GAAA;MACtC,OAAO,IAAK,CAAAC,UAAA,CAAW,CAAC,IAAA,CAAK9B,WAAW,CAAA,CAAA;AAC1C,KAAA;AAAA,GAAA,EAAA;IAAA3E,GAAA,EAAA,YAAA;AAAA1E,IAAAA,KAAA,EAYO,SAAAmL,UAAAA,CACL/H,SACA8G,IACiB,EAAA;AACX,MAAA,IAAEjK,OAAS,IAAA,CAATA;AACF,MAAA,IAAAc,MAAA,GAASd,IAAK,CAAAc,MAAA,IAAU,EAAC,CAAA;MAC/B,IAAMoJ,OAA8B,GAAAtM,aAAA,CAAA;AAGlCuN,QAAAA,QAAU,EAAA,IAAA;AAGVhB,QAAAA,QAAU,EAAA,KAAA;AAAA,OAAA,EACPF,IAAA,CACL,CAAA;AACA,MAAA,IAAIvL,MAAMsB,IAAK,CAAA0E,UAAA,CAAA;AAEX,MAAA,IAAA,CAACwF,QAAQC,QAAU,EAAA;AACfzL,QAAAA,GAAA,GAAA,IAAI0L,GAAI,CAAApK,IAAA,CAAK0E,UAAU,CAAA,CAAA;AAC/B,OAAA;AACI,MAAA,IAAA,CAAC,IAAK,CAAAuE,WAAA,EAAe,EAAA;AAEhB,QAAA,OAAAjJ,IAAA,CAAKoL,WAAW1M,GAAG,CAAA,CAAA;AAC5B,OAAA;MACA,IAAIwL,OAAQ,CAAAiB,QAAA,IAAY,IAAK,CAAAtC,UAAA,EAAc,EAAA;AAElC,QAAA,OAAA7I,IAAA,CAAKoL,WAAW1M,GAAG,CAAA,CAAA;AAC5B,OAAA;AACI,MAAA,IAAAyE,OAAA,KAAY,IAAK,CAAAiG,SAAA,EAAa,EAAA;AAEzB,QAAA,OAAApJ,IAAA,CAAKoL,WAAW1M,GAAG,CAAA,CAAA;AAC5B,OAAA;AAEA,MAAA,IAAIyE,OAAS,EAAA;QACPzE,GAAA,CAAAmF,GAAA,CAAI,IAAK,CAAA9D,KAAA,EAAO,IAAI,CAAA,CAAA;AAC1B,OAAO,MAAA;AACDrB,QAAAA,GAAA,CAAA,QAAA,CAAA,CAAO,KAAKqB,KAAK,CAAA,CAAA;AACvB,OAAA;MAEA,IAAIe,OAAO6D,aAAe,EAAA;QAExB,IAAIuF,QAAQC,QAAU,EAAA;UAEpB,IAAA,CAAK9F,aAAc,EAAA,CAAA;AACrB,SAAA;AACF,OAAO,MAAA;QAEA,IAAA,CAAAgH,qBAAA,CAAsBlI,OAAS,EAAAzE,GAAA,EAAKwL,OAAO,CAAA,CAAA;QAE3C,IAAA,CAAAoB,mBAAA,CAAoBnI,OAAS,EAAAzE,GAAA,EAAKwL,OAAO,CAAA,CAAA;QAG9C,IAAIA,QAAQC,QAAU,EAAA;UACpB,IAAMoB,eAAevL,IAAK,CAAAwL,eAAA,CAAgB,CAAC,IAAA,CAAKzL,KAAK,CAAG,EAAA;AACtDkI,YAAAA,OAAS,EAAA,IAAA;AACX,WAAC,CAAA,CAAA;AACYsD,UAAAA,YAAA,CAAAzH,OAAA,CAAQ,UAACvG,IAAS,EAAA;YAC7BA,IAAA,CAAK8G,aAAc,EAAA,CAAA;AACrB,WAAC,CAAA,CAAA;AACH,SAAA;AACF,OAAA;MACA,IAAA,CAAKoH,qBAAwB,GAAA,KAAA,CAAA;AAEtB,MAAA,OAAAzL,IAAA,CAAKoL,WAAW1M,GAAG,CAAA,CAAA;AAC5B,KAAA;AAAA,GAAA,EAAA;IAAA+F,GAAA,EAAA,kBAAA;AAAA1E,IAAAA,KAAA,EAEO,SAAA2L,gBAAAA,CAAiBtI,eAAwB6G,IAA2B,EAAA;AACnE,MAAA,IAAEjK,OAAS,IAAA,CAATA;AACF,MAASA,IAAK,CAAAc,MAAA,IAAU,GAAC;MAC/B,IAAMoJ,OAA8B,GAAAtM,aAAA,CAAA;AAGlCuN,QAAAA,QAAU,EAAA,IAAA;AAGVhB,QAAAA,QAAU,EAAA,KAAA;AAAA,OAAA,EACPF,IAAA,CACL,CAAA;AACA,MAAA,IAAIvL,MAAMsB,IAAK,CAAA0E,UAAA,CAAA;AACX,MAAA,IAAA,CAACwF,QAAQC,QAAU,EAAA;AACfzL,QAAAA,GAAA,GAAA,IAAI0L,GAAI,CAAApK,IAAA,CAAK0E,UAAU,CAAA,CAAA;AAC/B,OAAA;AACI,MAAA,IAAA,CAAC,IAAK,CAAAuE,WAAA,EAAe,EAAA;AAEhB,QAAA,OAAAjJ,IAAA,CAAKoL,WAAW1M,GAAG,CAAA,CAAA;AAC5B,OAAA;MACA,IAAIwL,OAAQ,CAAAiB,QAAA,IAAY,IAAK,CAAAtC,UAAA,EAAc,EAAA;AAElC,QAAA,OAAA7I,IAAA,CAAKoL,WAAW1M,GAAG,CAAA,CAAA;AAC5B,OAAA;AACI,MAAA,IAAA0E,aAAA,KAAkB,IAAK,CAAAoG,eAAA,EAAmB,EAAA;AAErC,QAAA,OAAAxJ,IAAA,CAAKoL,WAAW1M,GAAG,CAAA,CAAA;AAC5B,OAAA;MACA,IAAA,CAAK0E,aAAgB,GAAAA,aAAA,CAAA;MACrB,IAAA,CAAKqI,qBAAwB,GAAA,IAAA,CAAA;AAEtB,MAAA,OAAAzL,IAAA,CAAKoL,WAAW1M,GAAG,CAAA,CAAA;AAC5B,KAAA;AAAA,GAAA,EAAA;IAAA+F,GAAA,EAAA,qBAAA;IAAA1E,KAAA,EAGQ,SAAAuL,mBAAAA,CACNnI,OACA,EAAAzE,GAAA,EACAuL,IACA,EAAA;MACA,IAAMC,OAA8B,GAAAtM,aAAA,CAAA;AAClCuN,QAAAA,QAAU,EAAA,IAAA;AACVhB,QAAAA,QAAU,EAAA,KAAA;AAAA,OAAA,EACPF,IAAA,CACL,CAAA;AAEI,MAAA,IAAA,CAAC,KAAKhB,WAAY,EAAA,EAAG,OAAA;AAEnB,MAAA,IAAE1J,WAAa,IAAA,CAAbA;AACR,MAAA,IAAIC,MAAMC,OAAQ,CAAAF,QAAQ,CAAK,IAAAA,QAAA,CAASG,SAAS,CAAG,EAAA;AAE9ChB,QAAAA,GAAA,CAAA,QAAA,CAAA,CAAO,KAAKqB,KAAK,CAAA,CAAA;AACvB,OAAA;AAEM,MAAA,IAAEhB,SAAW,IAAA,CAAXA;MACR,IAAI,CAACA,MAAA,EAAQ,OAAA;MACNA,MAAA,CAAAuM,mBAAA,CAAoBnI,OAAS,EAAAzE,GAAA,EAAKwL,OAAO,CAAA,CAAA;AAClD,KAAA;AAAA,GAAA,EAAA;IAAAzF,GAAA,EAAA,uBAAA;IAAA1E,KAAA,EAGQ,SAAAsL,qBAAAA,CACNlI,OACA,EAAAzE,GAAA,EACAuL,IACA,EAAA;MACA,IAAMC,OAA8B,GAAAtM,aAAA,CAAA;AAClCuN,QAAAA,QAAU,EAAA,IAAA;AACVhB,QAAAA,QAAU,EAAA,KAAA;AAAA,OAAA,EACPF,IAAA,CACL,CAAA;AAGI,MAAA,IAAA,CAAC,KAAKhB,WAAY,EAAA,EAAG,OAAA;MAErB,IAAAiB,OAAA,CAAQiB,QAAY,IAAA,IAAA,CAAKtC,UAAW,EAAA,EAAG,OAAA;AAErC,MAAA,IAAEtJ,WAAa,IAAA,CAAbA;AACJ,MAAA,IAAA,CAACC,KAAM,CAAAC,OAAA,CAAQF,QAAQ,CAAA,EAAG,OAAA;AACrBA,MAAAA,QAAA,CAAAuE,OAAA,CAAQ,UAACvG,IAAS,EAAA;QAErB,IAAA2M,OAAA,CAAQiB,QAAY,IAAA5N,IAAA,CAAKsL,UAAW,EAAA,EAAG,OAAA;AAC3C,QAAA,IAAI1F,OAAS,EAAA;UACPzE,GAAA,CAAAmF,GAAA,CAAItG,IAAK,CAAAwC,KAAA,EAAO,IAAI,CAAA,CAAA;AAC1B,SAAO,MAAA;AACDrB,UAAAA,GAAA,CAAA,QAAA,CAAA,CAAOnB,KAAKwC,KAAK,CAAA,CAAA;AACvB,SAAA;QACKxC,IAAA,CAAA8N,qBAAA,CAAsBlI,OAAS,EAAAzE,GAAA,EAAKwL,OAAO,CAAA,CAAA;AAClD,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAAzF,GAAA,EAAA,QAAA;AAAA1E,IAAAA,KAAA,EAQO,SAAAuE,MAAeA,GAAA;AACf,MAAA,IAAA,CAAA5B,KAAA,GAAQ,KAAK7E,QAAS,EAAA,CAAA;AACtB,MAAA,IAAA,CAAAgF,SAAA,GAAY,KAAK9E,OAAQ,EAAA,CAAA;AACzB,MAAA,IAAA,CAAA+E,QAAA,GAAW,KAAK9E,MAAO,EAAA,CAAA;AACvB,MAAA,IAAA,CAAA4E,QAAA,GAAW,KAAK3E,MAAO,EAAA,CAAA;AACvB,MAAA,IAAA,CAAA0E,WAAA,GAAc,KAAKsG,WAAY,EAAA,CAAA;AAC/B,MAAA,IAAA,CAAAlG,QAAA,GAAW,KAAKmF,MAAO,EAAA,CAAA;AACvB,MAAA,IAAA,CAAAhF,OAAA,GAAU,KAAKgG,SAAU,EAAA,CAAA;AACzB,MAAA,IAAA,CAAA7F,QAAA,GAAW,KAAK8F,UAAW,EAAA,CAAA;AAC3B,MAAA,IAAA,CAAAlG,OAAA,GAAU,KAAKuF,SAAU,EAAA,CAAA;AACzB,MAAA,IAAA,CAAAxI,IAAA,CAAK+H,QAAQ,IAAI,CAAA,CAAA;AACxB,KAAA;AAAA,GAAA,EAAA;IAAAtD,GAAA,EAAA,eAAA;AAAA1E,IAAAA,KAAA,EAMO,SAAAsE,cAAcwG,IAAqB,EAAA;AACxC,MAAA,IAAQ7K,IAAA,GAAuC,IAAA,CAAvCA,IAAA;QAAMD,KAAO,GAA0B,IAAA,CAAjCA,KAAO;QAAA0L,qBAAA,GAA0B,IAAA,CAA1BA,qBAAA,CAAA;MACrB,IAAIA,yBAAyB,CAAC,SAAS,CAAE,CAAAE,QAAA,CAASd,IAAI,CAAG,EAAA;AACvD,QAAA,OAAA;AACF,OAAA;AAEM,MAAA,IAAEnG,aAAe1E,IAAA,CAAf0E;AACH,MAAA,IAAA,CAAAvB,OAAA,GAAU,KAAKiG,SAAU,EAAA,CAAA;AACzB,MAAA,IAAA,CAAAhG,aAAA,GAAgB,KAAKoG,eAAgB,EAAA,CAAA;MAC1C,IAAI,KAAKrG,OAAS,EAAA;AACLuB,QAAAA,UAAA,CAAAb,GAAA,CAAI9D,OAAO,IAAI,CAAA,CAAA;AAC5B,OAAA;AACAC,MAAAA,IAAA,CAAK+H,QAAQ,IAAI,CAAA,CAAA;AACnB,KAAA;AAAA,GAAA,EAAA;IAAAtD,GAAA,EAAA,gBAAA;AAAA1E,IAAAA,KAAA,EAOO,SAAA+J,cAAuBA,GAAA;AACtB,MAAA,IAAEvK,WAAa,IAAA,CAAbA;AACJ,MAAA,IAAAC,KAAA,CAAMC,OAAQ,CAAAF,QAAQ,CAAG,EAAA;AAClBA,QAAAA,QAAA,CAAAuE,OAAA,CAAQ,UAACvG,IAAS,EAAA;UACzBA,IAAA,CAAK+G,MAAO,EAAA,CAAA;UACZ/G,IAAA,CAAK8G,aAAc,EAAA,CAAA;UACnB9G,IAAA,CAAKuM,cAAe,EAAA,CAAA;AACtB,SAAC,CAAA,CAAA;AACH,OAAA;AACF,KAAA;AAAA,GAAA,EAAA;IAAArF,GAAA,EAAA,eAAA;AAAA1E,IAAAA,KAAA,EAOO,SAAA4G,aAAsBA,GAAA;AACrB,MAAA,IAAE5H,SAAW,IAAA,CAAXA;AACR,MAAA,IAAIA,MAAQ,EAAA;QACVA,MAAA,CAAOuF,MAAO,EAAA,CAAA;QACdvF,MAAA,CAAOsF,aAAc,EAAA,CAAA;QACrBtF,MAAA,CAAO4H,aAAc,EAAA,CAAA;AACvB,OAAA;AACF,KAAA;AAAA,GAAA,EAAA;IAAAlC,GAAA,EAAA,eAAA;AAAA1E,IAAAA,KAAA,EAOO,SAAAwF,aAAsBA,GAAA;AACrB,MAAA,IAAEvF,OAAS,IAAA,CAATA;MACR,IAAMuL,eAAevL,IAAK,CAAAwL,eAAA,CAAgB,CAAC,IAAA,CAAKzL,KAAK,CAAC,CAAA,CAAA;AACzCwL,MAAAA,YAAA,CAAAzH,OAAA,CAAQ,UAACvG,IAAS,EAAA;QAC7BA,IAAA,CAAK+G,MAAO,EAAA,CAAA;AACR,QAAA,IAAA/G,IAAA,CAAKkO,yBAAyBlO,IAAK,CAAA6F,aAAA,EAAe,OAAA;QACtD7F,IAAA,CAAK8G,aAAc,EAAA,CAAA;AACrB,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAAI,GAAA,EAAA,MAAA;AAAA1E,IAAAA,KAAA,EASO,SAAAJ,IAAmBA,GAAA;AAClB,MAAA,IAAEJ,WAAa,IAAA,CAAbA;MACR,IAAI2F,OAAmB,EAAC,CAAA;AACxBA,MAAAA,IAAA,CAAKC,KAAK,IAAI,CAAA,CAAA;AACd,MAAA,IAAI3F,MAAMC,OAAQ,CAAAF,QAAQ,CAAK,IAAAA,QAAA,CAASG,SAAS,CAAG,EAAA;AACzCH,QAAAA,QAAA,CAAAuE,OAAA,CAAQ,UAACvG,IAAS,EAAA;UACzB2H,IAAA,GAAOA,IAAK,CAAA7E,MAAA,CAAO9C,IAAK,CAAAoC,IAAA,EAAM,CAAA,CAAA;AAChC,SAAC,CAAA,CAAA;AACH,OAAA;AACO,MAAA,OAAAuF,IAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAT,GAAA,EAAA,UAAA;AAAA1E,IAAAA,KAAA,EASO,SAAAnB,QAA8BA,GAAA;AAC/B,MAAA,IAAEjB,QAAU,IAAA,CAAVA;MACN,IAAI,CAACA,KAAO,EAAA;AACVA,QAAAA,KAAA,GAAQD,gBAAgB,IAAI,CAAA,CAAA;QAC5B,IAAA,CAAKC,KAAQ,GAAAA,KAAA,CAAA;AACf,OAAA;AACA0D,MAAAA,eAAA,CAAgB1D,OAAO,IAAI,CAAA,CAAA;AACpB,MAAA,OAAAA,KAAA,CAAA;AACT,KAAA;AAAA,GAAA,CAAA,CAAA,CAAA;AAAA,CAAA;;;;"}

package/lib/_chunks/dep-341cf550.js

@@ -0,0 +1,377 @@
+/**
+ * tdesign v1.11.8-patch.2
+ * (c) 2025 tdesign
+ * @license MIT
+ */
+
+import { _ as _typeof$1 } from './dep-b321d08d.js';
+
+function asyncGeneratorStep(n, t, e, r, o, a, c) {
+  try {
+    var i = n[a](c),
+      u = i.value;
+  } catch (n) {
+    return void e(n);
+  }
+  i.done ? t(u) : Promise.resolve(u).then(r, o);
+}
+function _asyncToGenerator(n) {
+  return function () {
+    var t = this,
+      e = arguments;
+    return new Promise(function (r, o) {
+      var a = n.apply(t, e);
+      function _next(n) {
+        asyncGeneratorStep(a, r, o, _next, _throw, "next", n);
+      }
+      function _throw(n) {
+        asyncGeneratorStep(a, r, o, _next, _throw, "throw", n);
+      }
+      _next(void 0);
+    });
+  };
+}
+
+var regeneratorRuntime$1 = {exports: {}};
+
+var _typeof = {exports: {}};
+
+(function (module) {
+  function _typeof(o) {
+    "@babel/helpers - typeof";
+
+    return module.exports = _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) {
+      return typeof o;
+    } : function (o) {
+      return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o;
+    }, module.exports.__esModule = true, module.exports["default"] = module.exports, _typeof(o);
+  }
+  module.exports = _typeof, module.exports.__esModule = true, module.exports["default"] = module.exports;
+})(_typeof);
+
+(function (module) {
+  var _typeof$1 = _typeof.exports["default"];
+  function _regeneratorRuntime() {
+
+    /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */
+    module.exports = _regeneratorRuntime = function _regeneratorRuntime() {
+      return e;
+    }, module.exports.__esModule = true, module.exports["default"] = module.exports;
+    var t,
+      e = {},
+      r = Object.prototype,
+      n = r.hasOwnProperty,
+      o = Object.defineProperty || function (t, e, r) {
+        t[e] = r.value;
+      },
+      i = "function" == typeof Symbol ? Symbol : {},
+      a = i.iterator || "@@iterator",
+      c = i.asyncIterator || "@@asyncIterator",
+      u = i.toStringTag || "@@toStringTag";
+    function define(t, e, r) {
+      return Object.defineProperty(t, e, {
+        value: r,
+        enumerable: !0,
+        configurable: !0,
+        writable: !0
+      }), t[e];
+    }
+    try {
+      define({}, "");
+    } catch (t) {
+      define = function define(t, e, r) {
+        return t[e] = r;
+      };
+    }
+    function wrap(t, e, r, n) {
+      var i = e && e.prototype instanceof Generator ? e : Generator,
+        a = Object.create(i.prototype),
+        c = new Context(n || []);
+      return o(a, "_invoke", {
+        value: makeInvokeMethod(t, r, c)
+      }), a;
+    }
+    function tryCatch(t, e, r) {
+      try {
+        return {
+          type: "normal",
+          arg: t.call(e, r)
+        };
+      } catch (t) {
+        return {
+          type: "throw",
+          arg: t
+        };
+      }
+    }
+    e.wrap = wrap;
+    var h = "suspendedStart",
+      l = "suspendedYield",
+      f = "executing",
+      s = "completed",
+      y = {};
+    function Generator() {}
+    function GeneratorFunction() {}
+    function GeneratorFunctionPrototype() {}
+    var p = {};
+    define(p, a, function () {
+      return this;
+    });
+    var d = Object.getPrototypeOf,
+      v = d && d(d(values([])));
+    v && v !== r && n.call(v, a) && (p = v);
+    var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p);
+    function defineIteratorMethods(t) {
+      ["next", "throw", "return"].forEach(function (e) {
+        define(t, e, function (t) {
+          return this._invoke(e, t);
+        });
+      });
+    }
+    function AsyncIterator(t, e) {
+      function invoke(r, o, i, a) {
+        var c = tryCatch(t[r], t, o);
+        if ("throw" !== c.type) {
+          var u = c.arg,
+            h = u.value;
+          return h && "object" == _typeof$1(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) {
+            invoke("next", t, i, a);
+          }, function (t) {
+            invoke("throw", t, i, a);
+          }) : e.resolve(h).then(function (t) {
+            u.value = t, i(u);
+          }, function (t) {
+            return invoke("throw", t, i, a);
+          });
+        }
+        a(c.arg);
+      }
+      var r;
+      o(this, "_invoke", {
+        value: function value(t, n) {
+          function callInvokeWithMethodAndArg() {
+            return new e(function (e, r) {
+              invoke(t, n, e, r);
+            });
+          }
+          return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg();
+        }
+      });
+    }
+    function makeInvokeMethod(e, r, n) {
+      var o = h;
+      return function (i, a) {
+        if (o === f) throw Error("Generator is already running");
+        if (o === s) {
+          if ("throw" === i) throw a;
+          return {
+            value: t,
+            done: !0
+          };
+        }
+        for (n.method = i, n.arg = a;;) {
+          var c = n.delegate;
+          if (c) {
+            var u = maybeInvokeDelegate(c, n);
+            if (u) {
+              if (u === y) continue;
+              return u;
+            }
+          }
+          if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) {
+            if (o === h) throw o = s, n.arg;
+            n.dispatchException(n.arg);
+          } else "return" === n.method && n.abrupt("return", n.arg);
+          o = f;
+          var p = tryCatch(e, r, n);
+          if ("normal" === p.type) {
+            if (o = n.done ? s : l, p.arg === y) continue;
+            return {
+              value: p.arg,
+              done: n.done
+            };
+          }
+          "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg);
+        }
+      };
+    }
+    function maybeInvokeDelegate(e, r) {
+      var n = r.method,
+        o = e.iterator[n];
+      if (o === t) return r.delegate = null, "throw" === n && e.iterator["return"] && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y;
+      var i = tryCatch(o, e.iterator, r.arg);
+      if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y;
+      var a = i.arg;
+      return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y);
+    }
+    function pushTryEntry(t) {
+      var e = {
+        tryLoc: t[0]
+      };
+      1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e);
+    }
+    function resetTryEntry(t) {
+      var e = t.completion || {};
+      e.type = "normal", delete e.arg, t.completion = e;
+    }
+    function Context(t) {
+      this.tryEntries = [{
+        tryLoc: "root"
+      }], t.forEach(pushTryEntry, this), this.reset(!0);
+    }
+    function values(e) {
+      if (e || "" === e) {
+        var r = e[a];
+        if (r) return r.call(e);
+        if ("function" == typeof e.next) return e;
+        if (!isNaN(e.length)) {
+          var o = -1,
+            i = function next() {
+              for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next;
+              return next.value = t, next.done = !0, next;
+            };
+          return i.next = i;
+        }
+      }
+      throw new TypeError(_typeof$1(e) + " is not iterable");
+    }
+    return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", {
+      value: GeneratorFunctionPrototype,
+      configurable: !0
+    }), o(GeneratorFunctionPrototype, "constructor", {
+      value: GeneratorFunction,
+      configurable: !0
+    }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) {
+      var e = "function" == typeof t && t.constructor;
+      return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name));
+    }, e.mark = function (t) {
+      return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t;
+    }, e.awrap = function (t) {
+      return {
+        __await: t
+      };
+    }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () {
+      return this;
+    }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) {
+      void 0 === i && (i = Promise);
+      var a = new AsyncIterator(wrap(t, r, n, o), i);
+      return e.isGeneratorFunction(r) ? a : a.next().then(function (t) {
+        return t.done ? t.value : a.next();
+      });
+    }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () {
+      return this;
+    }), define(g, "toString", function () {
+      return "[object Generator]";
+    }), e.keys = function (t) {
+      var e = Object(t),
+        r = [];
+      for (var n in e) r.push(n);
+      return r.reverse(), function next() {
+        for (; r.length;) {
+          var t = r.pop();
+          if (t in e) return next.value = t, next.done = !1, next;
+        }
+        return next.done = !0, next;
+      };
+    }, e.values = values, Context.prototype = {
+      constructor: Context,
+      reset: function reset(e) {
+        if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t);
+      },
+      stop: function stop() {
+        this.done = !0;
+        var t = this.tryEntries[0].completion;
+        if ("throw" === t.type) throw t.arg;
+        return this.rval;
+      },
+      dispatchException: function dispatchException(e) {
+        if (this.done) throw e;
+        var r = this;
+        function handle(n, o) {
+          return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o;
+        }
+        for (var o = this.tryEntries.length - 1; o >= 0; --o) {
+          var i = this.tryEntries[o],
+            a = i.completion;
+          if ("root" === i.tryLoc) return handle("end");
+          if (i.tryLoc <= this.prev) {
+            var c = n.call(i, "catchLoc"),
+              u = n.call(i, "finallyLoc");
+            if (c && u) {
+              if (this.prev < i.catchLoc) return handle(i.catchLoc, !0);
+              if (this.prev < i.finallyLoc) return handle(i.finallyLoc);
+            } else if (c) {
+              if (this.prev < i.catchLoc) return handle(i.catchLoc, !0);
+            } else {
+              if (!u) throw Error("try statement without catch or finally");
+              if (this.prev < i.finallyLoc) return handle(i.finallyLoc);
+            }
+          }
+        }
+      },
+      abrupt: function abrupt(t, e) {
+        for (var r = this.tryEntries.length - 1; r >= 0; --r) {
+          var o = this.tryEntries[r];
+          if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) {
+            var i = o;
+            break;
+          }
+        }
+        i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null);
+        var a = i ? i.completion : {};
+        return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a);
+      },
+      complete: function complete(t, e) {
+        if ("throw" === t.type) throw t.arg;
+        return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y;
+      },
+      finish: function finish(t) {
+        for (var e = this.tryEntries.length - 1; e >= 0; --e) {
+          var r = this.tryEntries[e];
+          if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y;
+        }
+      },
+      "catch": function _catch(t) {
+        for (var e = this.tryEntries.length - 1; e >= 0; --e) {
+          var r = this.tryEntries[e];
+          if (r.tryLoc === t) {
+            var n = r.completion;
+            if ("throw" === n.type) {
+              var o = n.arg;
+              resetTryEntry(r);
+            }
+            return o;
+          }
+        }
+        throw Error("illegal catch attempt");
+      },
+      delegateYield: function delegateYield(e, r, n) {
+        return this.delegate = {
+          iterator: values(e),
+          resultName: r,
+          nextLoc: n
+        }, "next" === this.method && (this.arg = t), y;
+      }
+    }, e;
+  }
+  module.exports = _regeneratorRuntime, module.exports.__esModule = true, module.exports["default"] = module.exports;
+})(regeneratorRuntime$1);
+
+// TODO(Babel 8): Remove this file.
+
+var runtime = regeneratorRuntime$1.exports();
+var regenerator = runtime;
+
+// Copied from https://github.com/facebook/regenerator/blob/main/packages/runtime/runtime.js#L736=
+try {
+  regeneratorRuntime = runtime;
+} catch (accidentalStrictMode) {
+  if ((typeof globalThis === "undefined" ? "undefined" : _typeof$1(globalThis)) === "object") {
+    globalThis.regeneratorRuntime = runtime;
+  } else {
+    Function("r", "regeneratorRuntime = r")(runtime);
+  }
+}
+
+export { _asyncToGenerator as _, regenerator as r };
+//# sourceMappingURL=dep-341cf550.js.map