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

package/cjs/_chunks/dep-1ec03761.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-1ec03761.js","sources":["../../../common/js/tree-v1/tree-store.ts"],"sourcesContent":["import { isArray, isFunction, isNumber, isString, difference, camelCase, isPlainObject } from 'lodash-es';\nimport mitt from 'mitt';\n\nimport { TreeNode } from './tree-node';\nimport {\n  TreeNodeValue,\n  TypeIdMap,\n  TypeTimer,\n  TypeTargetNode,\n  TypeTreeNodeData,\n  TypeTreeItem,\n  TypeTreeStoreOptions,\n  TypeTreeFilter,\n  TypeTreeFilterOptions,\n  TypeRelatedNodesOptions,\n  TypeTreeEventState,\n} from './types';\n\n// 构建一个树的数据模型\n// 基本设计思想：写入时更新，减少读取消耗，以减少未来实现虚拟滚动所需的计算量\n// 任何一次数据写入，会触发相应节点的状态更新\n// public 方法，在 ui 组件中有可能在使用，会保障其输入输出实现\n// private 方法，可能会改动其输入输出\n\n/**\n * tree 数据模型\n * @class TreeStore\n * @param {object} options tree 组件选项\n * @param {string} [options.prefix=\"t\"] tree 组件内部属性前缀\n * @param {object} options.keys 取值映射对象，部分属性按照其 key/value 来取 treeNode 属性值\n * @param {string} [options.keys.label=\"label\"] 从 data 种取 label 值时读取的属性名称\n * @param {string} [options.keys.value=\"value\"] 从 data 种取 value 值时读取的属性名称\n * @param {string} [options.keys.children=\"children\"] 从 data 种取 children 值时读取的属性名称\n * @param {boolean} [options.expandAll=false] 初始化节点时，是否自动展开\n * @param {number} [options.expandLevel=0] 初始化节点时，自动展开的级别\n * @param {boolean} [options.expandMutex=false] 展开时，是否使用手风琴模式\n * @param {boolean} [options.expandParent=false] 展开节点时，是否自动展开父节点\n * @param {boolean} [options.activable=false] 是否可以激活节点\n * @param {boolean} [options.activeMultiple=false] 激活节点是否使用多选模式\n * @param {boolean} [options.checkable=false] 节点是否可选中\n * @param {boolean} [options.checkStrictly=false] 节点选中是否使用严格模式\n * @param {boolean} [options.disabled=false] 节点是否禁用\n * @param {boolean} [options.draggable=false] 节点是否可拖动\n * @param {function} [options.load=null] 节点延迟加载函数\n * @param {boolean} [options.lazy=false] 节点是否使用延迟加载模式\n * @param {string} [options.valueMode=\"onlyLeaf\"] 节点选中取值模式\n * @param {function} [options.filter=null] 节点过滤函数\n * @param {function} [options.onLoad=null] 节点延迟加载完成时的回调函数\n * @param {function} [options.onReflow=null] 节点触发回流后的回调\n * @param {function} [options.onUpdate=null] 节点触发更新后的后调\n * @param {boolean} [options.allowFoldNodeOnFilter=false] 过滤时，是否允许折叠节点\n */\nexport class TreeStore {\n  // 根节点集合\n  public children: TreeNode[];\n\n  // 所有节点集合\n  public nodes: TreeNode[];\n\n  // 所有节点映射\n  public nodeMap: Map<TreeNodeValue, TreeNode>;\n\n  // 节点 私有 ID 映射\n  public privateMap: Map<string, TreeNode>;\n\n  // 配置选项\n  public config: TypeTreeStoreOptions;\n\n  // 活动节点集合\n  public activedMap: TypeIdMap;\n\n  // 数据被更新的节点集合\n  public updatedMap: TypeIdMap;\n\n  // 选中节点集合\n  public checkedMap: TypeIdMap;\n\n  // 设置半选集合\n  public indeterminateMap: TypeIdMap;\n\n  // 展开节点的集合\n  public expandedMap: TypeIdMap;\n\n  // 符合过滤条件的节点的集合\n  public filterMap: TypeIdMap;\n\n  // 数据更新计时器\n  public updateTimer: TypeTimer;\n\n  // 识别是否需要重排\n  public shouldReflow: boolean;\n\n  // 存在过滤器标志\n  public hasFilter: boolean;\n\n  // 树节点过滤器\n  public prevFilter: TypeTreeFilter;\n\n  // 事件派发器\n  public emitter: ReturnType<typeof mitt>;\n\n  public constructor(options: TypeTreeStoreOptions) {\n    const config: TypeTreeStoreOptions = {\n      prefix: 't',\n      keys: {},\n      expandAll: false,\n      expandLevel: 0,\n      expandMutex: false,\n      expandParent: false,\n      activable: false,\n      activeMultiple: false,\n      checkable: false,\n      checkStrictly: false,\n      disabled: false,\n      draggable: false,\n      load: null,\n      lazy: false,\n      valueMode: 'onlyLeaf',\n      filter: null,\n      // 每次搜索条件变更，重置展开状态，路径节点展开，显示命中节点\n      // allowFoldNodeOnFilter 为 true 时，搜索条件不变的情况下，允许折叠路径节点\n      // 默认状态，allowFoldNodeOnFilter 为 false 时，路径节点无法折叠\n      allowFoldNodeOnFilter: false,\n      onLoad: null,\n      onReflow: null,\n      onUpdate: null,\n      ...options,\n    };\n    this.config = config;\n    this.nodes = [];\n    this.children = [];\n    this.nodeMap = new Map();\n    this.privateMap = new Map();\n    this.activedMap = new Map();\n    this.expandedMap = new Map();\n    this.checkedMap = new Map();\n    this.updatedMap = new Map();\n    this.indeterminateMap = new Map();\n    this.filterMap = new Map();\n    this.prevFilter = null;\n    // 这个计时器确保频繁的 update 事件被归纳为1次完整数据更新后的触发\n    this.updateTimer = null;\n    // 在子节点增删改查时，将此属性设置为 true，来触发视图更新\n    this.shouldReflow = false;\n    // 这个标志会被大量用到\n    this.hasFilter = isFunction(config.filter);\n    this.emitter = mitt();\n  }\n\n  /**\n   * 配置选项\n   * @param {object} options tree 组件选项\n   * @return void\n   */\n  public setConfig(options: TypeTreeStoreOptions) {\n    const { config } = this;\n    let hasChanged = false;\n    (Object.keys(options)).forEach((key: keyof TypeTreeStoreOptions) => {\n      const val = options[key];\n      if (val !== config[key]) {\n        hasChanged = true;\n        // @ts-ignore\n        // TODO: https://github.com/microsoft/TypeScript/issues/32693\n        config[key] = val;\n      }\n    });\n    this.hasFilter = isFunction(config.filter);\n    if (hasChanged) {\n      // 在 td-tree 的 render 方法中调用 setConfig\n      // 这样减少了 watch 属性\n      // 仅在属性变更后刷新状态\n      // 这样可以避免触发渲染死循环\n      this.refreshState();\n    }\n  }\n\n  /**\n   * 获取根节点列表\n   * @return TreeNode[] 根节点对象数组\n   */\n  public getChildren(): TreeNode[] {\n    return this.children;\n  }\n\n  /**\n   * 获取指定节点对象\n   * @param {string|number|TreeNode} item 获取节点对象的条件，可以是节点 value，也可以是节点本身\n   * @return TreeNode 节点对象，如果判断树中没有符合条件的节点，返回 null\n   */\n  public getNode(item: TypeTargetNode): TreeNode {\n    let node = null;\n    if (isString(item) || isNumber(item)) {\n      node = this.nodeMap.get(item);\n    } else if (item instanceof TreeNode) {\n      node = this.nodeMap.get(item.value);\n    }\n    if (!node) node = null;\n    return node;\n  }\n\n  /**\n   * 获取节点在总节点列表中的位置\n   * @param {TreeNode} node 节点对象\n   * @return number 节点在总节点列表中的位置序号\n   */\n  public getIndex(node: TreeNode): number {\n    return this.nodes.indexOf(node);\n  }\n\n  /**\n   * 获取指定节点的父节点\n   * @param {string} value 节点值\n   * @return TreeNode 节点对象\n   */\n  public getParent(value: TypeTargetNode): TreeNode {\n    let parent = null;\n    const node = this.getNode(value);\n    if (node) {\n      parent = node.getParent();\n    }\n    return parent;\n  }\n\n  /**\n   * 获取指定节点的所有父节点\n   * @param {string} value 节点值\n   * @return TreeNode[] 父节点数组\n   */\n  public getParents(value: TypeTargetNode): TreeNode[] {\n    const node = this.getNode(value);\n    let parents: TreeNode[] = [];\n    if (node) {\n      parents = node.getParents();\n    }\n    return parents;\n  }\n\n  /**\n   * 获取指定节点在其所在 children 中的位置\n   * @param {string} value 节点值\n   * @return number 节点在 children 中的位置序号\n   */\n  public getNodeIndex(value: TypeTargetNode): number {\n    const node = this.getNode(value);\n    let index = -1;\n    if (node) {\n      index = node.getIndex();\n    }\n    return index;\n  }\n\n  /**\n   * 获取所有符合条件的节点，按回流排序后的顺序给出\n   * 以这些字段作为示例:\n   * - value: 节点值(ID)\n   * - TreeNode: 节点实例\n   * - level: 节点层级\n   * - filter: 节点过滤函数\n   * 支持下列使用方式\n   * - getNodes() 获取所有节点\n   * - getNodes(value) 获取节点值对应的目标节点下，包含自己在内的所有子节点\n   * - getNodes(TreeNode) 获取目标节点下，包含自己在内的所有子节点\n   * - getNodes(value, { level: 2 }) 获取目标节点下，层级在 2 以内的子节点\n   * - getNodes(value, { filter: node => (!node.checked) }) 获取目标节点下，未选中的节点\n   * - getNodes(value, { props: { actived: true } }) 获取目标节点下，已激活的节点\n   * @param {string | TreeNode} [item] 节点值，节点对象\n   * @param {object} [options] 节点过滤条件，可传递节点属性，过滤出属性一致的节点\n   * @param {number} [options.level=Infinity] 节点层级\n   * @param {function} [options.filter=null] 节点过滤条件函数\n   * @param {object} [options.props] 节点属性对象，作为过滤条件\n   * @return TreeNode[] 符合条件的节点数组\n   */\n  public getNodes(\n    item?: TypeTargetNode,\n    options?: TypeTreeFilterOptions\n  ): TreeNode[] {\n    let nodes: TreeNode[] = [];\n    let val: TreeNodeValue = '';\n    if (isString(item) || isNumber(item)) {\n      val = item;\n    } else if (item instanceof TreeNode) {\n      val = item.value;\n    }\n    if (!val) {\n      nodes = this.nodes.slice(0);\n    } else {\n      const node = this.getNode(val);\n      if (node) {\n        nodes = node.walk();\n      }\n    }\n\n    if (options) {\n      const conf: TypeTreeFilterOptions = {\n        filter: null,\n        level: Infinity,\n        ...options,\n      };\n      if (isNumber(conf.level) && conf.level !== Infinity) {\n        nodes = nodes.filter((node) => node.level <= conf.level);\n      }\n      if (isFunction(conf.filter)) {\n        nodes = nodes.filter((node) => {\n          const nodeModel = node.getModel();\n          return conf.filter(nodeModel);\n        });\n      }\n      if (isPlainObject(conf.props)) {\n        nodes = nodes.filter((node) => {\n          const result = Object.keys(conf.props).every((key) => {\n            // @ts-ignore\n            // TODO: https://github.com/microsoft/TypeScript/issues/32693\n            const propEqual = node[key] === conf.props[key];\n            return propEqual;\n          });\n          return result;\n        });\n      }\n    }\n    return nodes;\n  }\n\n  /**\n   * 添加新节点数据\n   * @param {object[]} list 节点数据对象数组\n   * @return void\n   */\n  public append(list: TypeTreeNodeData[]): void {\n    list.forEach((item) => {\n      const node = new TreeNode(this, item);\n      this.children.push(node);\n    });\n    this.reflow();\n  }\n\n  /**\n   * 清空当前树的数据，重新加载数据\n   * @param {object[]} list 节点数据对象数组\n   * @return void\n   */\n  public reload(list: TypeTreeNodeData[]): void {\n    this.expandedMap.clear();\n    this.checkedMap.clear();\n    this.activedMap.clear();\n    this.filterMap.clear();\n    this.removeAll();\n    this.append(list);\n  }\n\n  /**\n   * 解析节点数据，适配多种节点类型\n   * @param {string | TreeNode | object} para 树节点值，或者树节点，或者节点构造数据\n   * @param {object | TreeNode} item 节点构造数据, 或者节点构造数据数组，或者树节点\n   * @return spec 解析完成的数据结构\n   * - {TreeNode} spec.node 目标树节点\n   * - {object} spec.data 节点构造数据\n   */\n  private parseNodeData(\n    para: TreeNodeValue | TreeNode | TypeTreeNodeData,\n    item: TypeTreeNodeData | TreeNode\n  ) {\n    let value: TreeNodeValue = '';\n    let node = null;\n    let data = null;\n\n    if (isString(para) || isNumber(para)) {\n      value = para;\n      node = this.getNode(value);\n      data = item;\n    } else if (para instanceof TreeNode) {\n      if (item) {\n        node = para;\n        data = item;\n      } else {\n        data = para;\n      }\n    } else {\n      data = para;\n    }\n    const spec = {\n      node,\n      data,\n    };\n    return spec;\n  }\n\n  /**\n   * 向指定节点追加节点或者数据\n   * 以这些字段作为示例: item: 节点数据, TreeNode: 节点实例, value: 节点值(ID)\n   * 支持下列使用方式\n   * - appendNodes(item) 直接传递节点构造数据，新增节点\n   * - appendNodes(TreeNode) 传递别的树的树节点，新增节点\n   * - appendNodes(value, item) 以节点值查找指定节点，并新增节点构造数据\n   * - appendNodes(value, TreeNode) 以节点值查找指定节点，并新增树节点\n   * - appendNodes(TreeNode, item) 向指定节点新增节点构造数据\n   * - appendNodes(TreeNode, TreeNode) 向指定节点新增树节点\n   * @param {string | TreeNode | object} para 树节点值，或者树节点，或者节点构造数据\n   * @param {object | TreeNode} [item] 节点构造数据, 或者节点构造数据数组，或者树节点\n   * @return void\n   */\n  public appendNodes(\n    para: TypeTargetNode | TypeTreeNodeData,\n    item?: TypeTreeNodeData | TreeNode\n  ): void {\n    const spec = this.parseNodeData(para, item);\n    if (spec.data) {\n      if (!spec.node) {\n        // 在根节点插入\n        if (spec.data instanceof TreeNode) {\n          spec.data.appendTo(this);\n        } else if (Array.isArray(spec.data)) {\n          this.append(spec.data);\n        } else {\n          this.append([spec.data]);\n        }\n      } else {\n        // 插入到目标节点之下\n        if (spec.data instanceof TreeNode) {\n          spec.data.appendTo(this, spec.node);\n        } else if (isArray(spec.data)) {\n          spec.node.append(spec.data);\n        } else {\n          spec.node.append([spec.data]);\n        }\n        spec.node.updateRelated();\n      }\n    }\n  }\n\n  /**\n   * 在目标节点之前插入节点\n   * @param {string | TreeNode} value 节点值，或者树节点\n   * @param {object | TreeNode} item 节点构造数据, 或者树节点\n   * @return void\n   */\n  public insertBefore(value: TypeTargetNode, item: TypeTreeItem): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.insertBefore(item);\n    }\n  }\n\n  /**\n   * 在目标节点之后插入节点\n   * @param {string | TreeNode} value 节点值，或者树节点\n   * @param {object | TreeNode} item 节点构造数据, 或者树节点\n   * @return void\n   */\n  public insertAfter(value: TypeTargetNode, item: TypeTreeItem): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.insertAfter(item);\n    }\n  }\n\n  /**\n   * 更新树结构\n   * - 清空 nodes 数组，然后遍历所有根节点重新插入 node\n   * - 这个操作将会为树结构数据提供一个一纬数组索引\n   * @return void\n   */\n  public refreshNodes(): void {\n    const { children, nodes } = this;\n    nodes.length = 0;\n    children.forEach((node) => {\n      const list = node.walk();\n      Array.prototype.push.apply(nodes, list);\n    });\n  }\n\n  /**\n   * 更新所有树节点状态\n   * @return void\n   */\n  public refreshState(): void {\n    const { nodeMap } = this;\n    // 树在初始化未回流时，nodes 数组为空\n    // 所以遍历 nodeMap 确保初始化阶段 refreshState 方法也可以触发全部节点的更新\n    nodeMap.forEach((node) => {\n      node.update();\n      node.updateChecked('refresh');\n    });\n  }\n\n  /**\n   * 标记节点重排\n   * - 应该仅在树节点增删改查时调用\n   * - 节点重排会在延时后触发 refreshNodes 方法的调用\n   * @param {TreeNode} [node] 触发重排的树节点\n   * @return void\n   */\n  public reflow(node?: TreeNode): void {\n    this.shouldReflow = true;\n    this.updated(node);\n  }\n\n  /**\n   * 触发更新事件\n   * - 节点属性变更时调用\n   * - 统一延时后，处理需要在其他节点状态更新后再处理的逻辑，减少这类逻辑的重复调用开销\n   * - 统一延时后，派发事件，通知树已更新完毕，以及回流完毕，触发 vue 视图渲染操作\n   * @param {TreeNode} [node] 触发更新的树节点\n   * @return void\n   */\n  public updated(node?: TreeNode): void {\n    if (node?.value) {\n      this.updatedMap.set(node.value, true);\n    }\n    if (this.updateTimer) return;\n    this.updateTimer = setTimeout(() => {\n      clearTimeout(this.updateTimer);\n      this.updateTimer = null;\n\n      // 检查节点是否需要回流，重排数组\n      if (this.shouldReflow) {\n        this.refreshNodes();\n        this.emit('reflow');\n      }\n\n      // 检查节点是否有被过滤，锁定路径节点\n      // 在此之前要遍历节点生成一个经过排序的节点数组\n      // 以便于优化锁定检查算法\n      this.lockFilterPathNodes();\n\n      const updatedList = Array.from(this.updatedMap.keys());\n      if (updatedList.length > 0) {\n        // 统计需要更新状态的节点，派发更新事件\n        const updatedNodes = updatedList.map((value) => this.getNode(value));\n        this.emit('update', {\n          nodes: updatedNodes,\n          map: this.updatedMap,\n        });\n      } else if (this.shouldReflow) {\n        // 单纯的回流不需要更新节点状态\n        // 但需要触发更新事件\n        // 实际业务中，这个逻辑几乎无法触发，节点操作必然引发 update\n        // 这里代码仅仅用于边界兜底\n        this.emit('update', {\n          nodes: [],\n          map: this.updatedMap,\n        });\n      }\n\n      // 每次回流检查完毕，还原检查状态\n      this.shouldReflow = false;\n      this.updatedMap.clear();\n    });\n  }\n\n  /**\n   * 获取激活节点集合\n   * @param {Map} [map] 预设激活节点 map, 用于受控操作时预先获取结果而不直接操作节点状态\n   * @return string[] 激活节点值数组\n   */\n  public getActived(map?: TypeIdMap): TreeNodeValue[] {\n    const activedMap = map || this.activedMap;\n    return Array.from(activedMap.keys());\n  }\n\n  /**\n   * 获取指定范围的激活节点\n   * - 范围是目标节点在内所有子节点\n   * @param {string | TreeNode} [item] 目标节点值，或者目标节点本身\n   * @return TreeNode[] 激活节点数组\n   */\n  public getActivedNodes(item?: TypeTargetNode): TreeNode[] {\n    let nodes = this.getNodes(item);\n    nodes = nodes.filter((node) => node.isActived());\n    return nodes;\n  }\n\n  /**\n   * 替换激活态\n   * @param {string[]} list 目标节点值数组\n   * @return void\n   */\n  public replaceActived(list: TreeNodeValue[]): void {\n    this.resetActived();\n    this.setActived(list);\n  }\n\n  public replaceIndeterminate(list: TreeNodeValue[]): void {\n    this.setIndeterminate(list);\n  }\n\n  public setIndeterminate(indeterminate: TreeNodeValue[]): void {\n    indeterminate.forEach((val) => {\n      this.indeterminateMap.set(val, true);\n      const node = this.getNode(val);\n      if (node) {\n        node.setIndeterminate(true);\n        node.update();\n      }\n    });\n  }\n\n  /**\n   * 设置激活态\n   * @param {string[]} list 目标节点值数组\n   * @return void\n   */\n  public setActived(actived: TreeNodeValue[]): void {\n    const { activeMultiple } = this.config;\n    const list = actived.slice(0);\n    if (!activeMultiple) {\n      list.length = 1;\n    }\n    list.forEach((val) => {\n      this.activedMap.set(val, true);\n      const node = this.getNode(val);\n      if (node) {\n        node.update();\n      }\n    });\n  }\n\n  /**\n   * 清空所有节点的激活状态\n   * @return void\n   */\n  public resetActived(): void {\n    const actived = this.getActived();\n    this.activedMap.clear();\n    const relatedNodes = this.getRelatedNodes(actived);\n    relatedNodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  /**\n   * 获取展开节点集合\n   * @param {Map} [map] 预设展开节点 map, 用于受控操作时预先获取结果而不直接操作节点状态\n   * @return void\n   */\n  public getExpanded(map?: TypeIdMap): TreeNodeValue[] {\n    const expandedMap = map || this.expandedMap;\n    return Array.from(expandedMap.keys());\n  }\n\n  /**\n   * 替换展开节点\n   * @param {string[]} list 目标节点值数组\n   * @return void\n   */\n  public replaceExpanded(list: TreeNodeValue[]): void {\n    const expanded = this.getExpanded();\n    const added = difference(list, expanded);\n    const removed = difference(expanded, list);\n    this.setExpandedDirectly(removed, false);\n    this.updateExpanded(removed);\n    this.setExpanded(added);\n  }\n\n  /**\n   * 批量设置展开节点\n   * - 注意这个状态设置操作会忽略互斥属性\n   * @param {string[]} list 目标节点值数组\n   * @return void\n   */\n  public setExpanded(list: TreeNodeValue[]): void {\n    this.setExpandedDirectly(list);\n    this.updateExpanded(list);\n  }\n\n  /**\n   * 直接设置节点展开状态\n   * - 注意这个状态设置操作会忽略互斥属性\n   * @param {string[]} list 目标节点值数组\n   * @param {boolean} [expanded=true] 展开状态\n   * @return void\n   */\n  public setExpandedDirectly(list: TreeNodeValue[], expanded = true): void {\n    list.forEach((val) => {\n      if (expanded) {\n        this.expandedMap.set(val, true);\n      } else {\n        this.expandedMap.delete(val);\n      }\n      const node = this.getNode(val);\n      if (node) {\n        node.afterExpanded();\n      }\n    });\n  }\n\n  /**\n   * 清除所有节点的展开状态\n   * @return void\n   */\n  public resetExpanded(): void {\n    const expanded = this.getExpanded();\n    this.expandedMap.clear();\n    this.updateExpanded(expanded);\n  }\n\n  /**\n   * 更新展开节点相关节点的状态\n   * - 节点展开状态变更后，上下游节点可能存在状态变更，统一纳入待更新队列\n   * @param {string[]} list 目标节点值数组\n   * @return void\n   */\n  public updateExpanded(list: TreeNodeValue[]): void {\n    const relatedNodes = this.getRelatedNodes(list, {\n      withParents: false,\n    });\n    relatedNodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  /**\n   * 获取选中态节点值数组\n   * @param {Map} [map] 预设选中节点 map, 用于受控操作时预先获取结果而不直接操作节点状态\n   * @return string[] 选中态节点 value 数组\n   */\n  public getChecked(map?: TypeIdMap): TreeNodeValue[] {\n    const { nodeMap, config } = this;\n    const { valueMode, checkStrictly } = config;\n    const list: TreeNodeValue[] = [];\n    const checkedMap = map || this.checkedMap;\n    nodeMap.forEach((node) => {\n      // 判断未选中，直接忽略\n      if (!node.isChecked(checkedMap)) return;\n      if (valueMode === 'parentFirst' && !checkStrictly) {\n        // valueMode 为 parentFirst\n        // 仅取值父节点\n        if (!node.parent || !node.parent.isChecked(checkedMap)) {\n          list.push(node.value);\n        }\n      } else if (valueMode === 'onlyLeaf' && !checkStrictly) {\n        // valueMode 为 onlyLeaf\n        // 仅取值叶子节点\n        if (node.isLeaf()) {\n          list.push(node.value);\n        }\n      } else {\n        // valueMode 为 all\n        // 取值所有选中节点\n        list.push(node.value);\n      }\n    });\n    return list;\n  }\n\n  /**\n   * 获取指定节点下的选中节点\n   * @param {string | TreeNode} [item] 目标节点值，或者目标节点\n   * @return TreeNode[] 选中节点数组\n   */\n  public getCheckedNodes(item?: TypeTargetNode): TreeNode[] {\n    let nodes = this.getNodes(item);\n    nodes = nodes.filter((node) => node.isChecked());\n    return nodes;\n  }\n\n  /**\n   * 替换选中态列表\n   * @param {string[]} list 目标节点值数组\n   * @return void\n   */\n  public replaceChecked(list: TreeNodeValue[]): void {\n    this.resetChecked();\n    this.setChecked(list);\n  }\n\n  /**\n   * 批量设置选中态\n   * @param {string[]} list 目标节点值数组\n   * @return void\n   */\n  public setChecked(list: TreeNodeValue[]): void {\n    const { checkStrictly, checkable } = this.config;\n    if (!checkable) return;\n    list.forEach((val: TreeNodeValue) => {\n      const node = this.getNode(val);\n      if (!node) return;\n      if (checkStrictly) {\n        this.checkedMap.set(val, true);\n        node.updateChecked();\n      } else {\n        const childrenNodes = node.walk();\n        childrenNodes.forEach((childNode) => {\n          this.checkedMap.set(childNode.value, true);\n        });\n      }\n    });\n    if (!checkStrictly) {\n      const checkedValues = this.getChecked();\n      const relatedNodes = this.getRelatedNodes(checkedValues);\n      relatedNodes.forEach((node) => {\n        node.updateChecked();\n      });\n    }\n  }\n\n  /**\n   * 清除所有节点选中态\n   * @return void\n   */\n  public resetChecked(): void {\n    const checked = this.getChecked();\n    const relatedNodes = this.getRelatedNodes(checked);\n    this.checkedMap.clear();\n    relatedNodes.forEach((node) => {\n      node.updateChecked();\n    });\n  }\n\n  /**\n   * 更新全部节点状态\n   * @return void\n   */\n  public updateAll(): void {\n    this.nodeMap.forEach((node) => {\n      node.update();\n      node.updateChecked('refresh');\n    });\n  }\n\n  /**\n   * 移除指定节点\n   * @param {string} value 目标节点值\n   * @return void\n   */\n  public remove(value?: TypeTargetNode): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.remove();\n    }\n  }\n\n  /**\n   * 移除所有节点\n   * @return void\n   */\n  public removeAll(): void {\n    const nodes = this.getNodes();\n    nodes.forEach((node) => {\n      node.remove();\n    });\n  }\n\n  /**\n   * 获取节点状态变化可能影响的关联节点\n   * - 用于实现最小遍历集合\n   * @param {string[]} list 目标节点值数组\n   * @param {object} [options] 操作选项\n   * @oaran {boolean} [options.reverse=false] 倒序排列遍历节点\n   * @param {boolean} [options.withParents=true] 包含所有父节点\n   * @return TreeNode[] 关联节点数组\n   */\n  public getRelatedNodes(\n    list: TreeNodeValue[],\n    options?: TypeRelatedNodesOptions\n  ): TreeNode[] {\n    const conf = {\n      // 默认倒序排列，从底层节点开始遍历\n      reverse: false,\n      // 默认遍历父节点\n      withParents: true,\n      ...options,\n    };\n    const map = new Map();\n    list.forEach((value) => {\n      if (map.get(value)) return;\n      const node = this.getNode(value);\n      if (node) {\n        const parents = node.getParents().reverse();\n        const children = node.walk();\n        let related = [];\n        if (conf.withParents) {\n          related = parents.concat(children);\n        } else {\n          related = children;\n        }\n        // 用 map 实现节点去重\n        related.forEach((relatedNode) => {\n          map.set(relatedNode.value, relatedNode);\n        });\n      }\n    });\n    let relatedNodes = Array.from(map.values());\n    if (conf.reverse) {\n      relatedNodes = relatedNodes.reverse();\n    }\n    return relatedNodes;\n  }\n\n  /**\n   * 触发绑定的事件\n   * - store.emitter 可以绑定事件回调，用于多个组件共同监听事件\n   * @param {string} name 事件名称\n   * @param {Event} [state] 事件对象\n   * @param {TreeNode} [state.node] 事件关联节点\n   * @param {TreeNode[]} [state.nodes] 事件关联节点数组\n   * @param {Map} [state.map] 事件关联节点映射\n   * @param {object[]} [state.data] 事件关联节点数据\n   * @return void\n   */\n  public emit(name: string, state?: TypeTreeEventState): void {\n    const { config, emitter } = this;\n    const methodName = camelCase(`on-${name}`);\n    const method = config[methodName as keyof TypeTreeStoreOptions];\n    if (isFunction(method)) {\n      // @ts-ignore\n      // TODO: 待移除\n      method(state);\n    }\n    emitter.emit(name, state);\n  }\n\n  /**\n   * 锁定过滤节点的路径节点\n   * - 使得路径节点自动展开\n   * @return void\n   */\n  private lockFilterPathNodes(): void {\n    const { config } = this;\n    const allNodes = this.getNodes();\n\n    if (this.prevFilter) {\n      // 过滤条件清空时，也需要清理锁定节点\n      // 所在判断过滤条件是否存在之前，就要调用这里的清理逻辑\n      // 不想在每次渲染时都做这个清空判断\n      // 所以判断一下之前是否有进行过滤\n      allNodes.forEach((node: TreeNode) => {\n        // 先清空所有锁定状态\n        if (node.vmIsLocked) {\n          // lock 方法内部有状态计算\n          // 所以要减少 lock 方法调用次数\n          node.lock(false);\n        }\n      });\n    }\n\n    const currentFilter = config.filter;\n    // 当前没有过滤器\n    // 则无需处理锁定节点\n    if (!currentFilter || !isFunction(currentFilter)) return;\n    this.prevFilter = config.filter;\n\n    // 全部节点要经过排序，才能使用这个遍历\n    // 比起每个过滤节点调用 getParents 方法检查父节点状态\n    // 复杂度 O(N*log(N)) => O(N)\n    allNodes.reverse().forEach((node: TreeNode) => {\n      // 数组颠倒后，等于是从每个节点的子节点开始判断\n      // 想象为从展开树的最底部向上遍历\n      const parent = node.getParent();\n      if (!parent) return;\n      if (node.vmIsRest || node.vmIsLocked) {\n        // 当前节点被过滤条件命中\n        // 或者当前节点被锁定\n        // 则需要判定父节点状态\n        if (!parent.vmIsLocked) {\n          // 父节点已被锁定，则忽略动作\n          // lock 方法有内置状态判断\n          parent.lock(true);\n        }\n      }\n    });\n  }\n}\n\nexport default TreeStore;\n"],"names":["TreeStore","options","_classCallCheck","config","_objectSpread","prefix","keys","expandAll","expandLevel","expandMutex","expandParent","activable","activeMultiple","checkable","checkStrictly","disabled","draggable","load","lazy","valueMode","filter","allowFoldNodeOnFilter","onLoad","onReflow","onUpdate","nodes","children","nodeMap","Map","privateMap","activedMap","expandedMap","checkedMap","updatedMap","indeterminateMap","filterMap","prevFilter","updateTimer","shouldReflow","hasFilter","isFunction","emitter","mitt","_createClass","key","value","setConfig","hasChanged","Object","forEach","val","refreshState","getChildren","getNode","item","node","isString","isNumber","get","TreeNode","getIndex","indexOf","getParent","parent","getParents","parents","getNodeIndex","index","getNodes","slice","walk","conf","level","Infinity","nodeModel","getModel","isPlainObject","props","result","every","propEqual","append","list","_this","push","reflow","reload","clear","removeAll","parseNodeData","para","data","spec","appendNodes","appendTo","Array","isArray","updateRelated","insertBefore","insertAfter","refreshNodes","length","prototype","apply","update","updateChecked","updated","_this2","set","setTimeout","clearTimeout","emit","lockFilterPathNodes","updatedList","from","updatedNodes","map","getActived","getActivedNodes","isActived","replaceActived","resetActived","setActived","replaceIndeterminate","setIndeterminate","indeterminate","_this3","actived","_this4","relatedNodes","getRelatedNodes","getExpanded","replaceExpanded","expanded","added","difference","removed","setExpandedDirectly","updateExpanded","setExpanded","_this5","arguments","undefined","afterExpanded","resetExpanded","withParents","getChecked","isChecked","isLeaf","getCheckedNodes","replaceChecked","resetChecked","setChecked","_this6","_this$config","childrenNodes","childNode","checkedValues","checked","updateAll","remove","_this7","reverse","related","concat","relatedNode","values","name","state","methodName","camelCase","method","allNodes","vmIsLocked","lock","currentFilter","vmIsRest"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAoDO,IAAMA,SAAU,gBAAA,YAAA;EAiDd,SAAAA,SAAAA,CAAYC,OAA+B,EAAA;AAAAC,IAAAA,2BAAA,OAAAF,SAAA,CAAA,CAAA;IAChD,IAAMG,MAA+B,GAAAC,aAAA,CAAA;AACnCC,MAAAA,MAAQ,EAAA,GAAA;MACRC,MAAM,EAAC;AACPC,MAAAA,SAAW,EAAA,KAAA;AACXC,MAAAA,WAAa,EAAA,CAAA;AACbC,MAAAA,WAAa,EAAA,KAAA;AACbC,MAAAA,YAAc,EAAA,KAAA;AACdC,MAAAA,SAAW,EAAA,KAAA;AACXC,MAAAA,cAAgB,EAAA,KAAA;AAChBC,MAAAA,SAAW,EAAA,KAAA;AACXC,MAAAA,aAAe,EAAA,KAAA;AACfC,MAAAA,QAAU,EAAA,KAAA;AACVC,MAAAA,SAAW,EAAA,KAAA;AACXC,MAAAA,IAAM,EAAA,IAAA;AACNC,MAAAA,IAAM,EAAA,KAAA;AACNC,MAAAA,SAAW,EAAA,UAAA;AACXC,MAAAA,MAAQ,EAAA,IAAA;AAIRC,MAAAA,qBAAuB,EAAA,KAAA;AACvBC,MAAAA,MAAQ,EAAA,IAAA;AACRC,MAAAA,QAAU,EAAA,IAAA;AACVC,MAAAA,QAAU,EAAA,IAAA;AAAA,KAAA,EACPvB,OAAA,CACL,CAAA;IACA,IAAA,CAAKE,MAAS,GAAAA,MAAA,CAAA;IACd,IAAA,CAAKsB,QAAQ,EAAC,CAAA;IACd,IAAA,CAAKC,WAAW,EAAC,CAAA;AACZ,IAAA,IAAA,CAAAC,OAAA,sBAAcC,GAAI,EAAA,CAAA;AAClB,IAAA,IAAA,CAAAC,UAAA,sBAAiBD,GAAI,EAAA,CAAA;AACrB,IAAA,IAAA,CAAAE,UAAA,sBAAiBF,GAAI,EAAA,CAAA;AACrB,IAAA,IAAA,CAAAG,WAAA,sBAAkBH,GAAI,EAAA,CAAA;AACtB,IAAA,IAAA,CAAAI,UAAA,sBAAiBJ,GAAI,EAAA,CAAA;AACrB,IAAA,IAAA,CAAAK,UAAA,sBAAiBL,GAAI,EAAA,CAAA;AACrB,IAAA,IAAA,CAAAM,gBAAA,sBAAuBN,GAAI,EAAA,CAAA;AAC3B,IAAA,IAAA,CAAAO,SAAA,sBAAgBP,GAAI,EAAA,CAAA;IACzB,IAAA,CAAKQ,UAAa,GAAA,IAAA,CAAA;IAElB,IAAA,CAAKC,WAAc,GAAA,IAAA,CAAA;IAEnB,IAAA,CAAKC,YAAe,GAAA,KAAA,CAAA;IAEf,IAAA,CAAAC,SAAA,GAAYC,qBAAW,CAAArC,MAAA,CAAOiB,MAAM,CAAA,CAAA;AACzC,IAAA,IAAA,CAAKqB,UAAUC,wBAAK,EAAA,CAAA;AACtB,GAAA;EAAA,OAAAC,wBAAA,CAAA3C,SAAA,EAAA,CAAA;IAAA4C,GAAA,EAAA,WAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAC,UAAU7C,OAA+B,EAAA;AACxC,MAAA,IAAEE,SAAW,IAAA,CAAXA;MACR,IAAI4C,UAAa,GAAA,KAAA,CAAA;MAChBC,OAAO1C,IAAK,CAAAL,OAAO,CAAG,CAAAgD,OAAA,CAAQ,UAACL,GAAoC,EAAA;AAClE,QAAA,IAAMM,MAAMjD,OAAQ,CAAA2C,GAAA,CAAA,CAAA;AAChB,QAAA,IAAAM,GAAA,KAAQ/C,OAAOyC,GAAM,CAAA,EAAA;AACVG,UAAAA,UAAA,GAAA,IAAA,CAAA;AAGb5C,UAAAA,MAAA,CAAOyC,GAAO,CAAA,GAAAM,GAAA,CAAA;AAChB,SAAA;AACF,OAAC,CAAA,CAAA;MACI,IAAA,CAAAX,SAAA,GAAYC,qBAAW,CAAArC,MAAA,CAAOiB,MAAM,CAAA,CAAA;AACzC,MAAA,IAAI2B,UAAY,EAAA;QAKd,IAAA,CAAKI,YAAa,EAAA,CAAA;AACpB,OAAA;AACF,KAAA;AAAA,GAAA,EAAA;IAAAP,GAAA,EAAA,aAAA;AAAAC,IAAAA,KAAA,EAMO,SAAAO,WAA0BA,GAAA;MAC/B,OAAO,IAAK,CAAA1B,QAAA,CAAA;AACd,KAAA;AAAA,GAAA,EAAA;IAAAkB,GAAA,EAAA,SAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAQ,QAAQC,IAAgC,EAAA;MAC7C,IAAIC,IAAO,GAAA,IAAA,CAAA;MACX,IAAIC,iBAAS,CAAAF,IAAI,CAAK,IAAAG,iBAAA,CAASH,IAAI,CAAG,EAAA;QAC7BC,IAAA,GAAA,IAAA,CAAK5B,OAAQ,CAAA+B,GAAA,CAAIJ,IAAI,CAAA,CAAA;AAC9B,OAAA,MAAA,IAAWA,gBAAgBK,iBAAU,EAAA;QACnCJ,IAAA,GAAO,IAAK,CAAA5B,OAAA,CAAQ+B,GAAI,CAAAJ,IAAA,CAAKT,KAAK,CAAA,CAAA;AACpC,OAAA;AACA,MAAA,IAAI,CAACU,IAAA,EAAaA,IAAA,GAAA,IAAA,CAAA;AACX,MAAA,OAAAA,IAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAX,GAAA,EAAA,UAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAe,SAASL,IAAwB,EAAA;AAC/B,MAAA,OAAA,IAAA,CAAK9B,KAAM,CAAAoC,OAAA,CAAQN,IAAI,CAAA,CAAA;AAChC,KAAA;AAAA,GAAA,EAAA;IAAAX,GAAA,EAAA,WAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAiB,UAAUjB,KAAiC,EAAA;MAChD,IAAIkB,MAAS,GAAA,IAAA,CAAA;AACP,MAAA,IAAAR,IAAA,GAAO,IAAK,CAAAF,OAAA,CAAQR,KAAK,CAAA,CAAA;AAC/B,MAAA,IAAIU,IAAM,EAAA;AACRQ,QAAAA,MAAA,GAASR,KAAKO,SAAU,EAAA,CAAA;AAC1B,OAAA;AACO,MAAA,OAAAC,MAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAnB,GAAA,EAAA,YAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAmB,WAAWnB,KAAmC,EAAA;AAC7C,MAAA,IAAAU,IAAA,GAAO,IAAK,CAAAF,OAAA,CAAQR,KAAK,CAAA,CAAA;MAC/B,IAAIoB,UAAsB,EAAC,CAAA;AAC3B,MAAA,IAAIV,IAAM,EAAA;AACRU,QAAAA,OAAA,GAAUV,KAAKS,UAAW,EAAA,CAAA;AAC5B,OAAA;AACO,MAAA,OAAAC,OAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAArB,GAAA,EAAA,cAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAqB,aAAarB,KAA+B,EAAA;AAC3C,MAAA,IAAAU,IAAA,GAAO,IAAK,CAAAF,OAAA,CAAQR,KAAK,CAAA,CAAA;MAC/B,IAAIsB,KAAQ,GAAA,CAAA,CAAA,CAAA;AACZ,MAAA,IAAIZ,IAAM,EAAA;AACRY,QAAAA,KAAA,GAAQZ,KAAKK,QAAS,EAAA,CAAA;AACxB,OAAA;AACO,MAAA,OAAAO,KAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAvB,GAAA,EAAA,UAAA;AAAAC,IAAAA,KAAA,EAuBO,SAAAuB,QAAAA,CACLd,MACArD,OACY,EAAA;MACZ,IAAIwB,QAAoB,EAAC,CAAA;MACzB,IAAIyB,GAAqB,GAAA,EAAA,CAAA;MACzB,IAAIM,iBAAS,CAAAF,IAAI,CAAK,IAAAG,iBAAA,CAASH,IAAI,CAAG,EAAA;AAC9BJ,QAAAA,GAAA,GAAAI,IAAA,CAAA;AACR,OAAA,MAAA,IAAWA,gBAAgBK,iBAAU,EAAA;QACnCT,GAAA,GAAMI,IAAK,CAAAT,KAAA,CAAA;AACb,OAAA;MACA,IAAI,CAACK,GAAK,EAAA;QACAzB,KAAA,GAAA,IAAA,CAAKA,KAAM,CAAA4C,KAAA,CAAM,CAAC,CAAA,CAAA;AAC5B,OAAO,MAAA;AACC,QAAA,IAAAd,IAAA,GAAO,IAAK,CAAAF,OAAA,CAAQH,GAAG,CAAA,CAAA;AAC7B,QAAA,IAAIK,IAAM,EAAA;AACR9B,UAAAA,KAAA,GAAQ8B,KAAKe,IAAK,EAAA,CAAA;AACpB,SAAA;AACF,OAAA;AAEA,MAAA,IAAIrE,OAAS,EAAA;QACX,IAAMsE,IAA8B,GAAAnE,aAAA,CAAA;AAClCgB,UAAAA,MAAQ,EAAA,IAAA;AACRoD,UAAAA,KAAO,EAAAC,QAAAA;AAAA,SAAA,EACJxE,OAAA,CACL,CAAA;AACA,QAAA,IAAIwD,kBAASc,IAAK,CAAAC,KAAK,CAAK,IAAAD,IAAA,CAAKC,UAAUC,QAAU,EAAA;AACnDhD,UAAAA,KAAA,GAAQA,MAAML,MAAO,CAAA,UAACmC;mBAASA,IAAK,CAAAiB,KAAA,IAASD,KAAKC,KAAK,CAAA;WAAA,CAAA,CAAA;AACzD,SAAA;AACI,QAAA,IAAAhC,qBAAA,CAAW+B,IAAK,CAAAnD,MAAM,CAAG,EAAA;AACnBK,UAAAA,KAAA,GAAAA,KAAA,CAAML,MAAO,CAAA,UAACmC,IAAS,EAAA;AACvB,YAAA,IAAAmB,SAAA,GAAYnB,KAAKoB,QAAS,EAAA,CAAA;AACzB,YAAA,OAAAJ,IAAA,CAAKnD,OAAOsD,SAAS,CAAA,CAAA;AAC9B,WAAC,CAAA,CAAA;AACH,SAAA;AACI,QAAA,IAAAE,2BAAA,CAAcL,IAAK,CAAAM,KAAK,CAAG,EAAA;AACrBpD,UAAAA,KAAA,GAAAA,KAAA,CAAML,MAAO,CAAA,UAACmC,IAAS,EAAA;AACvB,YAAA,IAAAuB,MAAA,GAAS9B,OAAO1C,IAAK,CAAAiE,IAAA,CAAKM,KAAK,CAAE,CAAAE,KAAA,CAAM,UAACnC,GAAQ,EAAA;AAGpD,cAAA,IAAMoC,SAAY,GAAAzB,IAAA,CAAKX,GAAS,CAAA,KAAA2B,IAAA,CAAKM,KAAM,CAAAjC,GAAA,CAAA,CAAA;AACpC,cAAA,OAAAoC,SAAA,CAAA;AACT,aAAC,CAAA,CAAA;AACM,YAAA,OAAAF,MAAA,CAAA;AACT,WAAC,CAAA,CAAA;AACH,SAAA;AACF,OAAA;AACO,MAAA,OAAArD,KAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAmB,GAAA,EAAA,QAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAoC,OAAOC,IAAgC,EAAA;AAAA,MAAA,IAAAC,KAAA,GAAA,IAAA,CAAA;AACvCD,MAAAA,IAAA,CAAAjC,OAAA,CAAQ,UAACK,IAAS,EAAA;QACrB,IAAMC,IAAO,GAAA,IAAII,iBAAS,CAAAwB,KAAA,EAAM7B,IAAI,CAAA,CAAA;AAC/B6B,QAAAA,KAAA,CAAAzD,QAAA,CAAS0D,KAAK7B,IAAI,CAAA,CAAA;AACzB,OAAC,CAAA,CAAA;MACD,IAAA,CAAK8B,MAAO,EAAA,CAAA;AACd,KAAA;AAAA,GAAA,EAAA;IAAAzC,GAAA,EAAA,QAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAyC,OAAOJ,IAAgC,EAAA;AAC5C,MAAA,IAAA,CAAKnD,YAAYwD,KAAM,EAAA,CAAA;AACvB,MAAA,IAAA,CAAKvD,WAAWuD,KAAM,EAAA,CAAA;AACtB,MAAA,IAAA,CAAKzD,WAAWyD,KAAM,EAAA,CAAA;AACtB,MAAA,IAAA,CAAKpD,UAAUoD,KAAM,EAAA,CAAA;MACrB,IAAA,CAAKC,SAAU,EAAA,CAAA;AACf,MAAA,IAAA,CAAKP,OAAOC,IAAI,CAAA,CAAA;AAClB,KAAA;AAAA,GAAA,EAAA;IAAAtC,GAAA,EAAA,eAAA;AAAAC,IAAAA,KAAA,EAUQ,SAAA4C,aAAAA,CACNC,MACApC,IACA,EAAA;MACA,IAAIT,KAAuB,GAAA,EAAA,CAAA;MAC3B,IAAIU,IAAO,GAAA,IAAA,CAAA;MACX,IAAIoC,IAAO,GAAA,IAAA,CAAA;MAEX,IAAInC,iBAAS,CAAAkC,IAAI,CAAK,IAAAjC,iBAAA,CAASiC,IAAI,CAAG,EAAA;AAC5B7C,QAAAA,KAAA,GAAA6C,IAAA,CAAA;AACDnC,QAAAA,IAAA,GAAA,IAAA,CAAKF,QAAQR,KAAK,CAAA,CAAA;AAClB8C,QAAAA,IAAA,GAAArC,IAAA,CAAA;AACT,OAAA,MAAA,IAAWoC,gBAAgB/B,iBAAU,EAAA;AACnC,QAAA,IAAIL,IAAM,EAAA;AACDC,UAAAA,IAAA,GAAAmC,IAAA,CAAA;AACAC,UAAAA,IAAA,GAAArC,IAAA,CAAA;AACT,SAAO,MAAA;AACEqC,UAAAA,IAAA,GAAAD,IAAA,CAAA;AACT,SAAA;AACF,OAAO,MAAA;AACEC,QAAAA,IAAA,GAAAD,IAAA,CAAA;AACT,OAAA;AACA,MAAA,IAAME,IAAO,GAAA;AACXrC,QAAAA,IAAA,EAAAA,IAAA;AACAoC,QAAAA,IAAA,EAAAA,IAAAA;OACF,CAAA;AACO,MAAA,OAAAC,IAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAhD,GAAA,EAAA,aAAA;AAAAC,IAAAA,KAAA,EAgBO,SAAAgD,WAAAA,CACLH,MACApC,IACM,EAAA;MACN,IAAMsC,IAAO,GAAA,IAAA,CAAKH,aAAc,CAAAC,IAAA,EAAMpC,IAAI,CAAA,CAAA;MAC1C,IAAIsC,KAAKD,IAAM,EAAA;AACT,QAAA,IAAA,CAACC,KAAKrC,IAAM,EAAA;AAEV,UAAA,IAAAqC,IAAA,CAAKD,gBAAgBhC,iBAAU,EAAA;AAC5BiC,YAAAA,IAAA,CAAAD,IAAA,CAAKG,SAAS,IAAI,CAAA,CAAA;WACd,MAAA,IAAAC,KAAA,CAAMC,OAAQ,CAAAJ,IAAA,CAAKD,IAAI,CAAG,EAAA;AAC9B,YAAA,IAAA,CAAAV,MAAA,CAAOW,KAAKD,IAAI,CAAA,CAAA;AACvB,WAAO,MAAA;YACL,IAAA,CAAKV,MAAO,CAAA,CAACW,IAAK,CAAAD,IAAI,CAAC,CAAA,CAAA;AACzB,WAAA;AACF,SAAO,MAAA;AAED,UAAA,IAAAC,IAAA,CAAKD,gBAAgBhC,iBAAU,EAAA;YACjCiC,IAAA,CAAKD,IAAK,CAAAG,QAAA,CAAS,IAAM,EAAAF,IAAA,CAAKrC,IAAI,CAAA,CAAA;WACzB,MAAA,IAAAyC,eAAA,CAAQJ,IAAK,CAAAD,IAAI,CAAG,EAAA;YACxBC,IAAA,CAAArC,IAAA,CAAK0B,MAAO,CAAAW,IAAA,CAAKD,IAAI,CAAA,CAAA;AAC5B,WAAO,MAAA;YACLC,IAAA,CAAKrC,IAAK,CAAA0B,MAAA,CAAO,CAACW,IAAA,CAAKD,IAAI,CAAC,CAAA,CAAA;AAC9B,WAAA;AACAC,UAAAA,IAAA,CAAKrC,KAAK0C,aAAc,EAAA,CAAA;AAC1B,SAAA;AACF,OAAA;AACF,KAAA;AAAA,GAAA,EAAA;IAAArD,GAAA,EAAA,cAAA;AAAAC,IAAAA,KAAA,EAQO,SAAAqD,YAAAA,CAAarD,OAAuBS,IAA0B,EAAA;AAC7D,MAAA,IAAAC,IAAA,GAAO,IAAK,CAAAF,OAAA,CAAQR,KAAK,CAAA,CAAA;AAC/B,MAAA,IAAIU,IAAM,EAAA;AACRA,QAAAA,IAAA,CAAK2C,aAAa5C,IAAI,CAAA,CAAA;AACxB,OAAA;AACF,KAAA;AAAA,GAAA,EAAA;IAAAV,GAAA,EAAA,aAAA;AAAAC,IAAAA,KAAA,EAQO,SAAAsD,WAAAA,CAAYtD,OAAuBS,IAA0B,EAAA;AAC5D,MAAA,IAAAC,IAAA,GAAO,IAAK,CAAAF,OAAA,CAAQR,KAAK,CAAA,CAAA;AAC/B,MAAA,IAAIU,IAAM,EAAA;AACRA,QAAAA,IAAA,CAAK4C,YAAY7C,IAAI,CAAA,CAAA;AACvB,OAAA;AACF,KAAA;AAAA,GAAA,EAAA;IAAAV,GAAA,EAAA,cAAA;AAAAC,IAAAA,KAAA,EAQO,SAAAuD,YAAqBA,GAAA;AACpB,MAAA,IAAE1E,QAAU,GAAU,IAAA,CAApBA,QAAU;QAAAD,KAAA,GAAU,IAAA,CAAVA,KAAA,CAAA;MAClBA,KAAA,CAAM4E,MAAS,GAAA,CAAA,CAAA;AACN3E,MAAAA,QAAA,CAAAuB,OAAA,CAAQ,UAACM,IAAS,EAAA;AACnB,QAAA,IAAA2B,IAAA,GAAO3B,KAAKe,IAAK,EAAA,CAAA;QACvByB,KAAA,CAAMO,SAAU,CAAAlB,IAAA,CAAKmB,KAAM,CAAA9E,KAAA,EAAOyD,IAAI,CAAA,CAAA;AACxC,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAAtC,GAAA,EAAA,cAAA;AAAAC,IAAAA,KAAA,EAMO,SAAAM,YAAqBA,GAAA;AACpB,MAAA,IAAExB,UAAY,IAAA,CAAZA;AAGAA,MAAAA,OAAA,CAAAsB,OAAA,CAAQ,UAACM,IAAS,EAAA;QACxBA,IAAA,CAAKiD,MAAO,EAAA,CAAA;AACZjD,QAAAA,IAAA,CAAKkD,cAAc,SAAS,CAAA,CAAA;AAC9B,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAA7D,GAAA,EAAA,QAAA;AAAAC,IAAAA,KAAA,EASO,SAAAwC,OAAO9B,IAAuB,EAAA;MACnC,IAAA,CAAKjB,YAAe,GAAA,IAAA,CAAA;AACpB,MAAA,IAAA,CAAKoE,QAAQnD,IAAI,CAAA,CAAA;AACnB,KAAA;AAAA,GAAA,EAAA;IAAAX,GAAA,EAAA,SAAA;AAAAC,IAAAA,KAAA,EAUO,SAAA6D,QAAQnD,IAAuB,EAAA;AAAA,MAAA,IAAAoD,MAAA,GAAA,IAAA,CAAA;AACpC,MAAA,IAAIpD,SAAAA,IAAAA,IAAAA,mBAAAA,KAAMV,KAAO,EAAA;QACf,IAAA,CAAKZ,UAAW,CAAA2E,GAAA,CAAIrD,IAAK,CAAAV,KAAA,EAAO,IAAI,CAAA,CAAA;AACtC,OAAA;MACA,IAAI,IAAK,CAAAR,WAAA,EAAa,OAAA;AACjB,MAAA,IAAA,CAAAA,WAAA,GAAcwE,WAAW,YAAM;AAClCC,QAAAA,YAAA,CAAaH,OAAKtE,WAAW,CAAA,CAAA;QAC7BsE,MAAA,CAAKtE,WAAc,GAAA,IAAA,CAAA;QAGnB,IAAIsE,OAAKrE,YAAc,EAAA;UACrBqE,MAAA,CAAKP,YAAa,EAAA,CAAA;AAClBO,UAAAA,MAAA,CAAKI,KAAK,QAAQ,CAAA,CAAA;AACpB,SAAA;QAKAJ,MAAA,CAAKK,mBAAoB,EAAA,CAAA;AAEzB,QAAA,IAAMC,cAAclB,KAAM,CAAAmB,IAAA,CAAKP,MAAK,CAAA1E,UAAA,CAAW3B,MAAM,CAAA,CAAA;AACjD,QAAA,IAAA2G,WAAA,CAAYZ,SAAS,CAAG,EAAA;AAEpB,UAAA,IAAAc,YAAA,GAAeF,YAAYG,GAAI,CAAA,UAACvE;mBAAU8D,MAAK,CAAAtD,OAAA,CAAQR,KAAK,CAAC,CAAA;WAAA,CAAA,CAAA;AACnE8D,UAAAA,MAAA,CAAKI,KAAK,QAAU,EAAA;AAClBtF,YAAAA,KAAO,EAAA0F,YAAA;YACPC,KAAKT,MAAK,CAAA1E,UAAAA;AACZ,WAAC,CAAA,CAAA;AACH,SAAA,MAAA,IAAW0E,OAAKrE,YAAc,EAAA;AAK5BqE,UAAAA,MAAA,CAAKI,KAAK,QAAU,EAAA;AAClBtF,YAAAA,OAAO,EAAC;YACR2F,KAAKT,MAAK,CAAA1E,UAAAA;AACZ,WAAC,CAAA,CAAA;AACH,SAAA;QAGA0E,MAAA,CAAKrE,YAAe,GAAA,KAAA,CAAA;AACpBqE,QAAAA,MAAA,CAAK1E,WAAWsD,KAAM,EAAA,CAAA;AACxB,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAA3C,GAAA,EAAA,YAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAwE,WAAWD,GAAkC,EAAA;AAC5C,MAAA,IAAAtF,UAAA,GAAasF,OAAO,IAAK,CAAAtF,UAAA,CAAA;MAC/B,OAAOiE,KAAM,CAAAmB,IAAA,CAAKpF,UAAW,CAAAxB,IAAA,EAAM,CAAA,CAAA;AACrC,KAAA;AAAA,GAAA,EAAA;IAAAsC,GAAA,EAAA,iBAAA;AAAAC,IAAAA,KAAA,EAQO,SAAAyE,gBAAgBhE,IAAmC,EAAA;AACpD,MAAA,IAAA7B,KAAA,GAAQ,IAAK,CAAA2C,QAAA,CAASd,IAAI,CAAA,CAAA;AAC9B7B,MAAAA,KAAA,GAAQA,MAAML,MAAO,CAAA,UAACmC,IAAS,EAAA;AAAA,QAAA,OAAAA,IAAA,CAAKgE,WAAW,CAAA;OAAA,CAAA,CAAA;AACxC,MAAA,OAAA9F,KAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAmB,GAAA,EAAA,gBAAA;AAAAC,IAAAA,KAAA,EAOO,SAAA2E,eAAetC,IAA6B,EAAA;MACjD,IAAA,CAAKuC,YAAa,EAAA,CAAA;AAClB,MAAA,IAAA,CAAKC,WAAWxC,IAAI,CAAA,CAAA;AACtB,KAAA;AAAA,GAAA,EAAA;IAAAtC,GAAA,EAAA,sBAAA;AAAAC,IAAAA,KAAA,EAEO,SAAA8E,qBAAqBzC,IAA6B,EAAA;AACvD,MAAA,IAAA,CAAK0C,iBAAiB1C,IAAI,CAAA,CAAA;AAC5B,KAAA;AAAA,GAAA,EAAA;IAAAtC,GAAA,EAAA,kBAAA;AAAAC,IAAAA,KAAA,EAEO,SAAA+E,iBAAiBC,aAAsC,EAAA;AAAA,MAAA,IAAAC,MAAA,GAAA,IAAA,CAAA;AAC9CD,MAAAA,aAAA,CAAA5E,OAAA,CAAQ,UAACC,GAAQ,EAAA;QACxB4E,MAAA,CAAA5F,gBAAA,CAAiB0E,GAAI,CAAA1D,GAAA,EAAK,IAAI,CAAA,CAAA;AAC7B,QAAA,IAAAK,IAAA,GAAOuE,MAAK,CAAAzE,OAAA,CAAQH,GAAG,CAAA,CAAA;AAC7B,QAAA,IAAIK,IAAM,EAAA;AACRA,UAAAA,IAAA,CAAKqE,iBAAiB,IAAI,CAAA,CAAA;UAC1BrE,IAAA,CAAKiD,MAAO,EAAA,CAAA;AACd,SAAA;AACF,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAA5D,GAAA,EAAA,YAAA;AAAAC,IAAAA,KAAA,EAOO,SAAA6E,WAAWK,OAAgC,EAAA;AAAA,MAAA,IAAAC,MAAA,GAAA,IAAA,CAAA;AAC1C,MAAA,IAAEpH,cAAe,GAAI,IAAK,CAAAT,MAAA,CAAxBS,cAAe,CAAA;AACjB,MAAA,IAAAsE,IAAA,GAAO6C,OAAQ,CAAA1D,KAAA,CAAM,CAAC,CAAA,CAAA;MAC5B,IAAI,CAACzD,cAAgB,EAAA;QACnBsE,IAAA,CAAKmB,MAAS,GAAA,CAAA,CAAA;AAChB,OAAA;AACKnB,MAAAA,IAAA,CAAAjC,OAAA,CAAQ,UAACC,GAAQ,EAAA;QACf8E,MAAA,CAAAlG,UAAA,CAAW8E,GAAI,CAAA1D,GAAA,EAAK,IAAI,CAAA,CAAA;AACvB,QAAA,IAAAK,IAAA,GAAOyE,MAAK,CAAA3E,OAAA,CAAQH,GAAG,CAAA,CAAA;AAC7B,QAAA,IAAIK,IAAM,EAAA;UACRA,IAAA,CAAKiD,MAAO,EAAA,CAAA;AACd,SAAA;AACF,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAA5D,GAAA,EAAA,cAAA;AAAAC,IAAAA,KAAA,EAMO,SAAA4E,YAAqBA,GAAA;AACpB,MAAA,IAAAM,OAAA,GAAU,KAAKV,UAAW,EAAA,CAAA;AAChC,MAAA,IAAA,CAAKvF,WAAWyD,KAAM,EAAA,CAAA;AAChB,MAAA,IAAA0C,YAAA,GAAe,IAAK,CAAAC,eAAA,CAAgBH,OAAO,CAAA,CAAA;AACpCE,MAAAA,YAAA,CAAAhF,OAAA,CAAQ,UAACM,IAAS,EAAA;QAC7BA,IAAA,CAAKiD,MAAO,EAAA,CAAA;AACd,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAA5D,GAAA,EAAA,aAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAsF,YAAYf,GAAkC,EAAA;AAC7C,MAAA,IAAArF,WAAA,GAAcqF,OAAO,IAAK,CAAArF,WAAA,CAAA;MAChC,OAAOgE,KAAM,CAAAmB,IAAA,CAAKnF,WAAY,CAAAzB,IAAA,EAAM,CAAA,CAAA;AACtC,KAAA;AAAA,GAAA,EAAA;IAAAsC,GAAA,EAAA,iBAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAuF,gBAAgBlD,IAA6B,EAAA;AAC5C,MAAA,IAAAmD,QAAA,GAAW,KAAKF,WAAY,EAAA,CAAA;AAC5B,MAAA,IAAAG,KAAA,GAAQC,qBAAW,CAAArD,IAAA,EAAMmD,QAAQ,CAAA,CAAA;AACjC,MAAA,IAAAG,OAAA,GAAUD,qBAAW,CAAAF,QAAA,EAAUnD,IAAI,CAAA,CAAA;AACpC,MAAA,IAAA,CAAAuD,mBAAA,CAAoBD,SAAS,KAAK,CAAA,CAAA;AACvC,MAAA,IAAA,CAAKE,eAAeF,OAAO,CAAA,CAAA;AAC3B,MAAA,IAAA,CAAKG,YAAYL,KAAK,CAAA,CAAA;AACxB,KAAA;AAAA,GAAA,EAAA;IAAA1F,GAAA,EAAA,aAAA;AAAAC,IAAAA,KAAA,EAQO,SAAA8F,YAAYzD,IAA6B,EAAA;AAC9C,MAAA,IAAA,CAAKuD,oBAAoBvD,IAAI,CAAA,CAAA;AAC7B,MAAA,IAAA,CAAKwD,eAAexD,IAAI,CAAA,CAAA;AAC1B,KAAA;AAAA,GAAA,EAAA;IAAAtC,GAAA,EAAA,qBAAA;AAAAC,IAAAA,KAAA,EASO,SAAA4F,mBAAAA,CAAoBvD,IAAuB,EAAuB;AAAA,MAAA,IAAA0D,MAAA,GAAA,IAAA,CAAA;AAAA,MAAA,IAAvBP,QAAA,GAAAQ,SAAA,CAAAxC,MAAA,GAAA,CAAA,IAAAwC,SAAA,CAAA,CAAA,CAAA,KAAAC,SAAA,GAAAD,SAAA,CAAA,CAAA,CAAA,GAAW,IAAY,CAAA;AAClE3D,MAAAA,IAAA,CAAAjC,OAAA,CAAQ,UAACC,GAAQ,EAAA;AACpB,QAAA,IAAImF,QAAU,EAAA;UACPO,MAAA,CAAA7G,WAAA,CAAY6E,GAAI,CAAA1D,GAAA,EAAK,IAAI,CAAA,CAAA;AAChC,SAAO,MAAA;AACA0F,UAAAA,MAAA,CAAA7G,WAAA,WAAmBmB,GAAG,CAAA,CAAA;AAC7B,SAAA;AACM,QAAA,IAAAK,IAAA,GAAOqF,MAAK,CAAAvF,OAAA,CAAQH,GAAG,CAAA,CAAA;AAC7B,QAAA,IAAIK,IAAM,EAAA;UACRA,IAAA,CAAKwF,aAAc,EAAA,CAAA;AACrB,SAAA;AACF,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAAnG,GAAA,EAAA,eAAA;AAAAC,IAAAA,KAAA,EAMO,SAAAmG,aAAsBA,GAAA;AACrB,MAAA,IAAAX,QAAA,GAAW,KAAKF,WAAY,EAAA,CAAA;AAClC,MAAA,IAAA,CAAKpG,YAAYwD,KAAM,EAAA,CAAA;AACvB,MAAA,IAAA,CAAKmD,eAAeL,QAAQ,CAAA,CAAA;AAC9B,KAAA;AAAA,GAAA,EAAA;IAAAzF,GAAA,EAAA,gBAAA;AAAAC,IAAAA,KAAA,EAQO,SAAA6F,eAAexD,IAA6B,EAAA;AAC3C,MAAA,IAAA+C,YAAA,GAAe,IAAK,CAAAC,eAAA,CAAgBhD,IAAM,EAAA;AAC9C+D,QAAAA,WAAa,EAAA,KAAA;AACf,OAAC,CAAA,CAAA;AACYhB,MAAAA,YAAA,CAAAhF,OAAA,CAAQ,UAACM,IAAS,EAAA;QAC7BA,IAAA,CAAKiD,MAAO,EAAA,CAAA;AACd,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAA5D,GAAA,EAAA,YAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAqG,WAAW9B,GAAkC,EAAA;AAC5C,MAAA,IAAEzF,OAAS,GAAW,IAAA,CAApBA,OAAS;QAAAxB,MAAA,GAAW,IAAA,CAAXA,MAAA,CAAA;AACX,MAAA,IAAEgB,SAAW,GAAkBhB,MAAA,CAA7BgB,SAAW;QAAAL,aAAA,GAAkBX,MAAA,CAAlBW,aAAA,CAAA;MACnB,IAAMoE,OAAwB,EAAC,CAAA;AACzB,MAAA,IAAAlD,UAAA,GAAaoF,OAAO,IAAK,CAAApF,UAAA,CAAA;AACvBL,MAAAA,OAAA,CAAAsB,OAAA,CAAQ,UAACM,IAAS,EAAA;AAEpB,QAAA,IAAA,CAACA,IAAK,CAAA4F,SAAA,CAAUnH,UAAU,CAAA,EAAG,OAAA;AAC7B,QAAA,IAAAb,SAAA,KAAc,aAAiB,IAAA,CAACL,aAAe,EAAA;AAG7C,UAAA,IAAA,CAACyC,KAAKQ,MAAU,IAAA,CAACR,KAAKQ,MAAO,CAAAoF,SAAA,CAAUnH,UAAU,CAAG,EAAA;AACjDkD,YAAAA,IAAA,CAAAE,IAAA,CAAK7B,KAAKV,KAAK,CAAA,CAAA;AACtB,WAAA;SACS,MAAA,IAAA1B,SAAA,KAAc,UAAc,IAAA,CAACL,aAAe,EAAA;AAGjD,UAAA,IAAAyC,IAAA,CAAK6F,QAAU,EAAA;AACZlE,YAAAA,IAAA,CAAAE,IAAA,CAAK7B,KAAKV,KAAK,CAAA,CAAA;AACtB,WAAA;AACF,SAAO,MAAA;AAGAqC,UAAAA,IAAA,CAAAE,IAAA,CAAK7B,KAAKV,KAAK,CAAA,CAAA;AACtB,SAAA;AACF,OAAC,CAAA,CAAA;AACM,MAAA,OAAAqC,IAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAtC,GAAA,EAAA,iBAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAwG,gBAAgB/F,IAAmC,EAAA;AACpD,MAAA,IAAA7B,KAAA,GAAQ,IAAK,CAAA2C,QAAA,CAASd,IAAI,CAAA,CAAA;AAC9B7B,MAAAA,KAAA,GAAQA,MAAML,MAAO,CAAA,UAACmC,IAAS,EAAA;AAAA,QAAA,OAAAA,IAAA,CAAK4F,WAAW,CAAA;OAAA,CAAA,CAAA;AACxC,MAAA,OAAA1H,KAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAAmB,GAAA,EAAA,gBAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAyG,eAAepE,IAA6B,EAAA;MACjD,IAAA,CAAKqE,YAAa,EAAA,CAAA;AAClB,MAAA,IAAA,CAAKC,WAAWtE,IAAI,CAAA,CAAA;AACtB,KAAA;AAAA,GAAA,EAAA;IAAAtC,GAAA,EAAA,YAAA;AAAAC,IAAAA,KAAA,EAOO,SAAA2G,WAAWtE,IAA6B,EAAA;AAAA,MAAA,IAAAuE,MAAA,GAAA,IAAA,CAAA;AAC7C,MAAA,IAAAC,YAAA,GAAqC,IAAK,CAAAvJ,MAAA;QAAlCW,aAAA,GAAA4I,YAAA,CAAA5I,aAAA;QAAeD,SAAU,GAAA6I,YAAA,CAAV7I,SAAU,CAAA;MACjC,IAAI,CAACA,SAAA,EAAW,OAAA;AACXqE,MAAAA,IAAA,CAAAjC,OAAA,CAAQ,UAACC,GAAuB,EAAA;AAC7B,QAAA,IAAAK,IAAA,GAAOkG,MAAK,CAAApG,OAAA,CAAQH,GAAG,CAAA,CAAA;QAC7B,IAAI,CAACK,IAAA,EAAM,OAAA;AACX,QAAA,IAAIzC,aAAe,EAAA;UACZ2I,MAAA,CAAAzH,UAAA,CAAW4E,GAAI,CAAA1D,GAAA,EAAK,IAAI,CAAA,CAAA;UAC7BK,IAAA,CAAKkD,aAAc,EAAA,CAAA;AACrB,SAAO,MAAA;AACC,UAAA,IAAAkD,aAAA,GAAgBpG,KAAKe,IAAK,EAAA,CAAA;AAClBqF,UAAAA,aAAA,CAAA1G,OAAA,CAAQ,UAAC2G,SAAc,EAAA;YACnCH,MAAA,CAAKzH,UAAW,CAAA4E,GAAA,CAAIgD,SAAU,CAAA/G,KAAA,EAAO,IAAI,CAAA,CAAA;AAC3C,WAAC,CAAA,CAAA;AACH,SAAA;AACF,OAAC,CAAA,CAAA;MACD,IAAI,CAAC/B,aAAe,EAAA;AACZ,QAAA,IAAA+I,aAAA,GAAgB,KAAKX,UAAW,EAAA,CAAA;AAChC,QAAA,IAAAjB,YAAA,GAAe,IAAK,CAAAC,eAAA,CAAgB2B,aAAa,CAAA,CAAA;AAC1C5B,QAAAA,YAAA,CAAAhF,OAAA,CAAQ,UAACM,IAAS,EAAA;UAC7BA,IAAA,CAAKkD,aAAc,EAAA,CAAA;AACrB,SAAC,CAAA,CAAA;AACH,OAAA;AACF,KAAA;AAAA,GAAA,EAAA;IAAA7D,GAAA,EAAA,cAAA;AAAAC,IAAAA,KAAA,EAMO,SAAA0G,YAAqBA,GAAA;AACpB,MAAA,IAAAO,OAAA,GAAU,KAAKZ,UAAW,EAAA,CAAA;AAC1B,MAAA,IAAAjB,YAAA,GAAe,IAAK,CAAAC,eAAA,CAAgB4B,OAAO,CAAA,CAAA;AACjD,MAAA,IAAA,CAAK9H,WAAWuD,KAAM,EAAA,CAAA;AACT0C,MAAAA,YAAA,CAAAhF,OAAA,CAAQ,UAACM,IAAS,EAAA;QAC7BA,IAAA,CAAKkD,aAAc,EAAA,CAAA;AACrB,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAA7D,GAAA,EAAA,WAAA;AAAAC,IAAAA,KAAA,EAMO,SAAAkH,SAAkBA,GAAA;AAClB,MAAA,IAAA,CAAApI,OAAA,CAAQsB,OAAQ,CAAA,UAACM,IAAS,EAAA;QAC7BA,IAAA,CAAKiD,MAAO,EAAA,CAAA;AACZjD,QAAAA,IAAA,CAAKkD,cAAc,SAAS,CAAA,CAAA;AAC9B,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAA7D,GAAA,EAAA,QAAA;AAAAC,IAAAA,KAAA,EAOO,SAAAmH,OAAOnH,KAA8B,EAAA;AACpC,MAAA,IAAAU,IAAA,GAAO,IAAK,CAAAF,OAAA,CAAQR,KAAK,CAAA,CAAA;AAC/B,MAAA,IAAIU,IAAM,EAAA;QACRA,IAAA,CAAKyG,MAAO,EAAA,CAAA;AACd,OAAA;AACF,KAAA;AAAA,GAAA,EAAA;IAAApH,GAAA,EAAA,WAAA;AAAAC,IAAAA,KAAA,EAMO,SAAA2C,SAAkBA,GAAA;AACjB,MAAA,IAAA/D,KAAA,GAAQ,KAAK2C,QAAS,EAAA,CAAA;AACtB3C,MAAAA,KAAA,CAAAwB,OAAA,CAAQ,UAACM,IAAS,EAAA;QACtBA,IAAA,CAAKyG,MAAO,EAAA,CAAA;AACd,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAApH,GAAA,EAAA,iBAAA;AAAAC,IAAAA,KAAA,EAWO,SAAAqF,eAAAA,CACLhD,MACAjF,OACY,EAAA;AAAA,MAAA,IAAAgK,MAAA,GAAA,IAAA,CAAA;MACZ,IAAM1F,IAAO,GAAAnE,aAAA,CAAA;AAEX8J,QAAAA,OAAS,EAAA,KAAA;AAETjB,QAAAA,WAAa,EAAA,IAAA;AAAA,OAAA,EACVhJ,OAAA,CACL,CAAA;AACM,MAAA,IAAAmH,GAAA,sBAAUxF,GAAI,EAAA,CAAA;AACfsD,MAAAA,IAAA,CAAAjC,OAAA,CAAQ,UAACJ,KAAU,EAAA;AAClB,QAAA,IAAAuE,GAAA,CAAI1D,IAAIb,KAAK,CAAA,EAAG,OAAA;AACd,QAAA,IAAAU,IAAA,GAAO0G,MAAK,CAAA5G,OAAA,CAAQR,KAAK,CAAA,CAAA;AAC/B,QAAA,IAAIU,IAAM,EAAA;UACR,IAAMU,OAAU,GAAAV,IAAA,CAAKS,UAAW,EAAA,CAAEkG,OAAQ,EAAA,CAAA;AACpC,UAAA,IAAAxI,QAAA,GAAW6B,KAAKe,IAAK,EAAA,CAAA;UAC3B,IAAI6F,UAAU,EAAC,CAAA;UACf,IAAI5F,KAAK0E,WAAa,EAAA;AACVkB,YAAAA,OAAA,GAAAlG,OAAA,CAAQmG,OAAO1I,QAAQ,CAAA,CAAA;AACnC,WAAO,MAAA;AACKyI,YAAAA,OAAA,GAAAzI,QAAA,CAAA;AACZ,WAAA;AAEQyI,UAAAA,OAAA,CAAAlH,OAAA,CAAQ,UAACoH,WAAgB,EAAA;YAC3BjD,GAAA,CAAAR,GAAA,CAAIyD,WAAY,CAAAxH,KAAA,EAAOwH,WAAW,CAAA,CAAA;AACxC,WAAC,CAAA,CAAA;AACH,SAAA;AACF,OAAC,CAAA,CAAA;MACD,IAAIpC,YAAe,GAAAlC,KAAA,CAAMmB,IAAK,CAAAE,GAAA,CAAIkD,QAAQ,CAAA,CAAA;MAC1C,IAAI/F,KAAK2F,OAAS,EAAA;AAChBjC,QAAAA,YAAA,GAAeA,aAAaiC,OAAQ,EAAA,CAAA;AACtC,OAAA;AACO,MAAA,OAAAjC,YAAA,CAAA;AACT,KAAA;AAAA,GAAA,EAAA;IAAArF,GAAA,EAAA,MAAA;AAAAC,IAAAA,KAAA,EAaO,SAAAkE,IAAAA,CAAKwD,MAAcC,KAAkC,EAAA;AACpD,MAAA,IAAErK,MAAQ,GAAY,IAAA,CAApBA,MAAQ;QAAAsC,OAAA,GAAY,IAAA,CAAZA,OAAA,CAAA;MACV,IAAAgI,UAAA,GAAaC,mBAAU,CAAA,KAAA,CAAAN,MAAA,CAAMG,IAAM,CAAA,CAAA,CAAA;AACzC,MAAA,IAAMI,SAASxK,MAAO,CAAAsK,UAAA,CAAA,CAAA;AAClB,MAAA,IAAAjI,qBAAA,CAAWmI,MAAM,CAAG,EAAA;QAGtBA,MAAA,CAAOH,KAAK,CAAA,CAAA;AACd,OAAA;AACQ/H,MAAAA,OAAA,CAAAsE,IAAA,CAAKwD,MAAMC,KAAK,CAAA,CAAA;AAC1B,KAAA;AAAA,GAAA,EAAA;IAAA5H,GAAA,EAAA,qBAAA;AAAAC,IAAAA,KAAA,EAOQ,SAAAmE,mBAA4BA,GAAA;AAC5B,MAAA,IAAE7G,SAAW,IAAA,CAAXA;AACF,MAAA,IAAAyK,QAAA,GAAW,KAAKxG,QAAS,EAAA,CAAA;MAE/B,IAAI,KAAKhC,UAAY,EAAA;AAKVwI,QAAAA,QAAA,CAAA3H,OAAA,CAAQ,UAACM,IAAmB,EAAA;UAEnC,IAAIA,KAAKsH,UAAY,EAAA;AAGnBtH,YAAAA,IAAA,CAAKuH,KAAK,KAAK,CAAA,CAAA;AACjB,WAAA;AACF,SAAC,CAAA,CAAA;AACH,OAAA;AAEA,MAAA,IAAMC,gBAAgB5K,MAAO,CAAAiB,MAAA,CAAA;MAG7B,IAAI,CAAC2J,aAAA,IAAiB,CAACvI,qBAAA,CAAWuI,aAAa,CAAA,EAAG,OAAA;AAClD,MAAA,IAAA,CAAK3I,aAAajC,MAAO,CAAAiB,MAAA,CAAA;MAKzBwJ,QAAA,CAASV,OAAQ,EAAA,CAAEjH,OAAQ,CAAA,UAACM,IAAmB,EAAA;AAGvC,QAAA,IAAAQ,MAAA,GAASR,KAAKO,SAAU,EAAA,CAAA;QAC9B,IAAI,CAACC,MAAA,EAAQ,OAAA;AACT,QAAA,IAAAR,IAAA,CAAKyH,QAAY,IAAAzH,IAAA,CAAKsH,UAAY,EAAA;AAIhC,UAAA,IAAA,CAAC9G,OAAO8G,UAAY,EAAA;AAGtB9G,YAAAA,MAAA,CAAO+G,KAAK,IAAI,CAAA,CAAA;AAClB,WAAA;AACF,SAAA;AACF,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,CAAA,CAAA,CAAA;AAAA,CAAA;;;;"}

package/cjs/_chunks/dep-1f4c3315.js

@@ -0,0 +1,43 @@
+/**
+ * tdesign v1.11.8-patch.2
+ * (c) 2025 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _baseFlatten = require('./dep-0cce7980.js');
+var _overRest = require('./dep-3e52428d.js');
+
+/**
+ * Flattens `array` a single level deep.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Array
+ * @param {Array} array The array to flatten.
+ * @returns {Array} Returns the new flattened array.
+ * @example
+ *
+ * _.flatten([1, [2, [3, [4]], 5]]);
+ * // => [1, 2, [3, [4]], 5]
+ */
+function flatten(array) {
+  var length = array == null ? 0 : array.length;
+  return length ? _baseFlatten.baseFlatten(array, 1) : [];
+}
+
+/**
+ * A specialized version of `baseRest` which flattens the rest array.
+ *
+ * @private
+ * @param {Function} func The function to apply a rest parameter to.
+ * @returns {Function} Returns the new function.
+ */
+function flatRest(func) {
+  return _overRest.setToString(_overRest.overRest(func, undefined, flatten), func + '');
+}
+
+exports.flatRest = flatRest;
+//# sourceMappingURL=dep-1f4c3315.js.map

package/cjs/_chunks/dep-1f4c3315.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-1f4c3315.js","sources":["../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/flatten.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_flatRest.js"],"sourcesContent":["import baseFlatten from './_baseFlatten.js';\n\n/**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\nfunction flatten(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseFlatten(array, 1) : [];\n}\n\nexport default flatten;\n","import flatten from './flatten.js';\nimport overRest from './_overRest.js';\nimport setToString from './_setToString.js';\n\n/**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\nfunction flatRest(func) {\n  return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nexport default flatRest;\n"],"names":["flatten","array","length","baseFlatten","flatRest","func","setToString","overRest","undefined"],"mappings":";;;;;;;;;;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASA,OAAOA,CAACC,KAAK,EAAE;EACtB,IAAIC,MAAM,GAAGD,KAAK,IAAI,IAAI,GAAG,CAAC,GAAGA,KAAK,CAACC,MAAM,CAAA;EAC7C,OAAOA,MAAM,GAAGC,wBAAW,CAACF,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,CAAA;AAC5C;;ACfA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASG,QAAQA,CAACC,IAAI,EAAE;AACtB,EAAA,OAAOC,qBAAW,CAACC,kBAAQ,CAACF,IAAI,EAAEG,SAAS,EAAER,OAAO,CAAC,EAAEK,IAAI,GAAG,EAAE,CAAC,CAAA;AACnE;;;;"}

package/cjs/_chunks/dep-22a46632.js

@@ -0,0 +1,397 @@
+/**
+ * tdesign v1.11.8-patch.2
+ * (c) 2025 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _Map = require('./dep-047dcd52.js');
+var eq = require('./dep-efe09dd6.js');
+var _typeof = require('./dep-7a3804dd.js');
+
+/* Built-in method references that are verified to be native. */
+var nativeCreate = _Map.getNative(Object, 'create');
+var nativeCreate$1 = nativeCreate;
+
+/**
+ * Removes all key-value entries from the hash.
+ *
+ * @private
+ * @name clear
+ * @memberOf Hash
+ */
+function hashClear() {
+  this.__data__ = nativeCreate$1 ? nativeCreate$1(null) : {};
+  this.size = 0;
+}
+
+/**
+ * Removes `key` and its value from the hash.
+ *
+ * @private
+ * @name delete
+ * @memberOf Hash
+ * @param {Object} hash The hash to modify.
+ * @param {string} key The key of the value to remove.
+ * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+ */
+function hashDelete(key) {
+  var result = this.has(key) && delete this.__data__[key];
+  this.size -= result ? 1 : 0;
+  return result;
+}
+
+/** Used to stand-in for `undefined` hash values. */
+var HASH_UNDEFINED$1 = '__lodash_hash_undefined__';
+
+/** Used for built-in method references. */
+var objectProto$1 = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty$1 = objectProto$1.hasOwnProperty;
+
+/**
+ * Gets the hash value for `key`.
+ *
+ * @private
+ * @name get
+ * @memberOf Hash
+ * @param {string} key The key of the value to get.
+ * @returns {*} Returns the entry value.
+ */
+function hashGet(key) {
+  var data = this.__data__;
+  if (nativeCreate$1) {
+    var result = data[key];
+    return result === HASH_UNDEFINED$1 ? undefined : result;
+  }
+  return hasOwnProperty$1.call(data, key) ? data[key] : undefined;
+}
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * Checks if a hash value for `key` exists.
+ *
+ * @private
+ * @name has
+ * @memberOf Hash
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+function hashHas(key) {
+  var data = this.__data__;
+  return nativeCreate$1 ? data[key] !== undefined : hasOwnProperty.call(data, key);
+}
+
+/** Used to stand-in for `undefined` hash values. */
+var HASH_UNDEFINED = '__lodash_hash_undefined__';
+
+/**
+ * Sets the hash `key` to `value`.
+ *
+ * @private
+ * @name set
+ * @memberOf Hash
+ * @param {string} key The key of the value to set.
+ * @param {*} value The value to set.
+ * @returns {Object} Returns the hash instance.
+ */
+function hashSet(key, value) {
+  var data = this.__data__;
+  this.size += this.has(key) ? 0 : 1;
+  data[key] = nativeCreate$1 && value === undefined ? HASH_UNDEFINED : value;
+  return this;
+}
+
+/**
+ * Creates a hash object.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [entries] The key-value pairs to cache.
+ */
+function Hash(entries) {
+  var index = -1,
+    length = entries == null ? 0 : entries.length;
+  this.clear();
+  while (++index < length) {
+    var entry = entries[index];
+    this.set(entry[0], entry[1]);
+  }
+}
+
+// Add methods to `Hash`.
+Hash.prototype.clear = hashClear;
+Hash.prototype['delete'] = hashDelete;
+Hash.prototype.get = hashGet;
+Hash.prototype.has = hashHas;
+Hash.prototype.set = hashSet;
+
+/**
+ * Removes all key-value entries from the list cache.
+ *
+ * @private
+ * @name clear
+ * @memberOf ListCache
+ */
+function listCacheClear() {
+  this.__data__ = [];
+  this.size = 0;
+}
+
+/**
+ * Gets the index at which the `key` is found in `array` of key-value pairs.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} key The key to search for.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function assocIndexOf(array, key) {
+  var length = array.length;
+  while (length--) {
+    if (eq.eq(array[length][0], key)) {
+      return length;
+    }
+  }
+  return -1;
+}
+
+/** Used for built-in method references. */
+var arrayProto = Array.prototype;
+
+/** Built-in value references. */
+var splice = arrayProto.splice;
+
+/**
+ * Removes `key` and its value from the list cache.
+ *
+ * @private
+ * @name delete
+ * @memberOf ListCache
+ * @param {string} key The key of the value to remove.
+ * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+ */
+function listCacheDelete(key) {
+  var data = this.__data__,
+    index = assocIndexOf(data, key);
+  if (index < 0) {
+    return false;
+  }
+  var lastIndex = data.length - 1;
+  if (index == lastIndex) {
+    data.pop();
+  } else {
+    splice.call(data, index, 1);
+  }
+  --this.size;
+  return true;
+}
+
+/**
+ * Gets the list cache value for `key`.
+ *
+ * @private
+ * @name get
+ * @memberOf ListCache
+ * @param {string} key The key of the value to get.
+ * @returns {*} Returns the entry value.
+ */
+function listCacheGet(key) {
+  var data = this.__data__,
+    index = assocIndexOf(data, key);
+  return index < 0 ? undefined : data[index][1];
+}
+
+/**
+ * Checks if a list cache value for `key` exists.
+ *
+ * @private
+ * @name has
+ * @memberOf ListCache
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+function listCacheHas(key) {
+  return assocIndexOf(this.__data__, key) > -1;
+}
+
+/**
+ * Sets the list cache `key` to `value`.
+ *
+ * @private
+ * @name set
+ * @memberOf ListCache
+ * @param {string} key The key of the value to set.
+ * @param {*} value The value to set.
+ * @returns {Object} Returns the list cache instance.
+ */
+function listCacheSet(key, value) {
+  var data = this.__data__,
+    index = assocIndexOf(data, key);
+  if (index < 0) {
+    ++this.size;
+    data.push([key, value]);
+  } else {
+    data[index][1] = value;
+  }
+  return this;
+}
+
+/**
+ * Creates an list cache object.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [entries] The key-value pairs to cache.
+ */
+function ListCache(entries) {
+  var index = -1,
+    length = entries == null ? 0 : entries.length;
+  this.clear();
+  while (++index < length) {
+    var entry = entries[index];
+    this.set(entry[0], entry[1]);
+  }
+}
+
+// Add methods to `ListCache`.
+ListCache.prototype.clear = listCacheClear;
+ListCache.prototype['delete'] = listCacheDelete;
+ListCache.prototype.get = listCacheGet;
+ListCache.prototype.has = listCacheHas;
+ListCache.prototype.set = listCacheSet;
+
+/**
+ * Removes all key-value entries from the map.
+ *
+ * @private
+ * @name clear
+ * @memberOf MapCache
+ */
+function mapCacheClear() {
+  this.size = 0;
+  this.__data__ = {
+    'hash': new Hash(),
+    'map': new (_Map.Map || ListCache)(),
+    'string': new Hash()
+  };
+}
+
+/**
+ * Checks if `value` is suitable for use as unique object key.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is suitable, else `false`.
+ */
+function isKeyable(value) {
+  var type = _typeof._typeof(value);
+  return type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean' ? value !== '__proto__' : value === null;
+}
+
+/**
+ * Gets the data for `map`.
+ *
+ * @private
+ * @param {Object} map The map to query.
+ * @param {string} key The reference key.
+ * @returns {*} Returns the map data.
+ */
+function getMapData(map, key) {
+  var data = map.__data__;
+  return isKeyable(key) ? data[typeof key == 'string' ? 'string' : 'hash'] : data.map;
+}
+
+/**
+ * Removes `key` and its value from the map.
+ *
+ * @private
+ * @name delete
+ * @memberOf MapCache
+ * @param {string} key The key of the value to remove.
+ * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+ */
+function mapCacheDelete(key) {
+  var result = getMapData(this, key)['delete'](key);
+  this.size -= result ? 1 : 0;
+  return result;
+}
+
+/**
+ * Gets the map value for `key`.
+ *
+ * @private
+ * @name get
+ * @memberOf MapCache
+ * @param {string} key The key of the value to get.
+ * @returns {*} Returns the entry value.
+ */
+function mapCacheGet(key) {
+  return getMapData(this, key).get(key);
+}
+
+/**
+ * Checks if a map value for `key` exists.
+ *
+ * @private
+ * @name has
+ * @memberOf MapCache
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+function mapCacheHas(key) {
+  return getMapData(this, key).has(key);
+}
+
+/**
+ * Sets the map `key` to `value`.
+ *
+ * @private
+ * @name set
+ * @memberOf MapCache
+ * @param {string} key The key of the value to set.
+ * @param {*} value The value to set.
+ * @returns {Object} Returns the map cache instance.
+ */
+function mapCacheSet(key, value) {
+  var data = getMapData(this, key),
+    size = data.size;
+  data.set(key, value);
+  this.size += data.size == size ? 0 : 1;
+  return this;
+}
+
+/**
+ * Creates a map cache object to store key-value pairs.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [entries] The key-value pairs to cache.
+ */
+function MapCache(entries) {
+  var index = -1,
+    length = entries == null ? 0 : entries.length;
+  this.clear();
+  while (++index < length) {
+    var entry = entries[index];
+    this.set(entry[0], entry[1]);
+  }
+}
+
+// Add methods to `MapCache`.
+MapCache.prototype.clear = mapCacheClear;
+MapCache.prototype['delete'] = mapCacheDelete;
+MapCache.prototype.get = mapCacheGet;
+MapCache.prototype.has = mapCacheHas;
+MapCache.prototype.set = mapCacheSet;
+
+exports.ListCache = ListCache;
+exports.MapCache = MapCache;
+//# sourceMappingURL=dep-22a46632.js.map

package/cjs/_chunks/dep-22a46632.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-22a46632.js","sources":["../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_nativeCreate.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_hashClear.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_hashDelete.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_hashGet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_hashHas.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_hashSet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_Hash.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_listCacheClear.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_assocIndexOf.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_listCacheDelete.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_listCacheGet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_listCacheHas.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_listCacheSet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_ListCache.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mapCacheClear.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_isKeyable.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getMapData.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mapCacheDelete.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mapCacheGet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mapCacheHas.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mapCacheSet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_MapCache.js"],"sourcesContent":["import getNative from './_getNative.js';\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nexport default nativeCreate;\n","import nativeCreate from './_nativeCreate.js';\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nexport default hashClear;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nexport default hashDelete;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nexport default hashGet;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nexport default hashHas;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nexport default hashSet;\n","import hashClear from './_hashClear.js';\nimport hashDelete from './_hashDelete.js';\nimport hashGet from './_hashGet.js';\nimport hashHas from './_hashHas.js';\nimport hashSet from './_hashSet.js';\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nexport default Hash;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nexport default listCacheClear;\n","import eq from './eq.js';\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nexport default assocIndexOf;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nexport default listCacheDelete;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nexport default listCacheGet;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nexport default listCacheHas;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nexport default listCacheSet;\n","import listCacheClear from './_listCacheClear.js';\nimport listCacheDelete from './_listCacheDelete.js';\nimport listCacheGet from './_listCacheGet.js';\nimport listCacheHas from './_listCacheHas.js';\nimport listCacheSet from './_listCacheSet.js';\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nexport default ListCache;\n","import Hash from './_Hash.js';\nimport ListCache from './_ListCache.js';\nimport Map from './_Map.js';\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nexport default mapCacheClear;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nexport default isKeyable;\n","import isKeyable from './_isKeyable.js';\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nexport default getMapData;\n","import getMapData from './_getMapData.js';\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nexport default mapCacheDelete;\n","import getMapData from './_getMapData.js';\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nexport default mapCacheGet;\n","import getMapData from './_getMapData.js';\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nexport default mapCacheHas;\n","import getMapData from './_getMapData.js';\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nexport default mapCacheSet;\n","import mapCacheClear from './_mapCacheClear.js';\nimport mapCacheDelete from './_mapCacheDelete.js';\nimport mapCacheGet from './_mapCacheGet.js';\nimport mapCacheHas from './_mapCacheHas.js';\nimport mapCacheSet from './_mapCacheSet.js';\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nexport default MapCache;\n"],"names":["nativeCreate","getNative","Object","hashClear","__data__","size","hashDelete","key","result","has","HASH_UNDEFINED","objectProto","prototype","hasOwnProperty","hashGet","data","undefined","call","hashHas","hashSet","value","Hash","entries","index","length","clear","entry","set","get","listCacheClear","assocIndexOf","array","eq","arrayProto","Array","splice","listCacheDelete","lastIndex","pop","listCacheGet","listCacheHas","listCacheSet","push","ListCache","mapCacheClear","Map","isKeyable","type","_typeof","getMapData","map","mapCacheDelete","mapCacheGet","mapCacheHas","mapCacheSet","MapCache"],"mappings":";;;;;;;;;;;;AAEA;AACA,IAAIA,YAAY,GAAGC,cAAS,CAACC,MAAM,EAAE,QAAQ,CAAC,CAAA;AAE9C,qBAAeF,YAAY;;ACH3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASG,SAASA,GAAG;EACnB,IAAI,CAACC,QAAQ,GAAGJ,cAAY,GAAGA,cAAY,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;EACtD,IAAI,CAACK,IAAI,GAAG,CAAC,CAAA;AACf;;ACZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,UAAUA,CAACC,GAAG,EAAE;AACvB,EAAA,IAAIC,MAAM,GAAG,IAAI,CAACC,GAAG,CAACF,GAAG,CAAC,IAAI,OAAO,IAAI,CAACH,QAAQ,CAACG,GAAG,CAAC,CAAA;AACvD,EAAA,IAAI,CAACF,IAAI,IAAIG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAA;AAC3B,EAAA,OAAOA,MAAM,CAAA;AACf;;ACZA;AACA,IAAIE,gBAAc,GAAG,2BAA2B,CAAA;;AAEhD;AACA,IAAIC,aAAW,GAAGT,MAAM,CAACU,SAAS,CAAA;;AAElC;AACA,IAAIC,gBAAc,GAAGF,aAAW,CAACE,cAAc,CAAA;;AAE/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,OAAOA,CAACP,GAAG,EAAE;AACpB,EAAA,IAAIQ,IAAI,GAAG,IAAI,CAACX,QAAQ,CAAA;AACxB,EAAA,IAAIJ,cAAY,EAAE;AAChB,IAAA,IAAIQ,MAAM,GAAGO,IAAI,CAACR,GAAG,CAAC,CAAA;AACtB,IAAA,OAAOC,MAAM,KAAKE,gBAAc,GAAGM,SAAS,GAAGR,MAAM,CAAA;AACvD,GAAA;AACA,EAAA,OAAOK,gBAAc,CAACI,IAAI,CAACF,IAAI,EAAER,GAAG,CAAC,GAAGQ,IAAI,CAACR,GAAG,CAAC,GAAGS,SAAS,CAAA;AAC/D;;ACzBA;AACA,IAAIL,WAAW,GAAGT,MAAM,CAACU,SAAS,CAAA;;AAElC;AACA,IAAIC,cAAc,GAAGF,WAAW,CAACE,cAAc,CAAA;;AAE/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASK,OAAOA,CAACX,GAAG,EAAE;AACpB,EAAA,IAAIQ,IAAI,GAAG,IAAI,CAACX,QAAQ,CAAA;AACxB,EAAA,OAAOJ,cAAY,GAAIe,IAAI,CAACR,GAAG,CAAC,KAAKS,SAAS,GAAIH,cAAc,CAACI,IAAI,CAACF,IAAI,EAAER,GAAG,CAAC,CAAA;AAClF;;AClBA;AACA,IAAIG,cAAc,GAAG,2BAA2B,CAAA;;AAEhD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASS,OAAOA,CAACZ,GAAG,EAAEa,KAAK,EAAE;AAC3B,EAAA,IAAIL,IAAI,GAAG,IAAI,CAACX,QAAQ,CAAA;AACxB,EAAA,IAAI,CAACC,IAAI,IAAI,IAAI,CAACI,GAAG,CAACF,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;AAClCQ,EAAAA,IAAI,CAACR,GAAG,CAAC,GAAIP,cAAY,IAAIoB,KAAK,KAAKJ,SAAS,GAAIN,cAAc,GAAGU,KAAK,CAAA;AAC1E,EAAA,OAAO,IAAI,CAAA;AACb;;ACdA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,IAAIA,CAACC,OAAO,EAAE;EACrB,IAAIC,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGF,OAAO,IAAI,IAAI,GAAG,CAAC,GAAGA,OAAO,CAACE,MAAM,CAAA;EAEjD,IAAI,CAACC,KAAK,EAAE,CAAA;AACZ,EAAA,OAAO,EAAEF,KAAK,GAAGC,MAAM,EAAE;AACvB,IAAA,IAAIE,KAAK,GAAGJ,OAAO,CAACC,KAAK,CAAC,CAAA;AAC1B,IAAA,IAAI,CAACI,GAAG,CAACD,KAAK,CAAC,CAAC,CAAC,EAAEA,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;AAC9B,GAAA;AACF,CAAA;;AAEA;AACAL,IAAI,CAACT,SAAS,CAACa,KAAK,GAAGtB,SAAS,CAAA;AAChCkB,IAAI,CAACT,SAAS,CAAC,QAAQ,CAAC,GAAGN,UAAU,CAAA;AACrCe,IAAI,CAACT,SAAS,CAACgB,GAAG,GAAGd,OAAO,CAAA;AAC5BO,IAAI,CAACT,SAAS,CAACH,GAAG,GAAGS,OAAO,CAAA;AAC5BG,IAAI,CAACT,SAAS,CAACe,GAAG,GAAGR,OAAO;;AC7B5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASU,cAAcA,GAAG;EACxB,IAAI,CAACzB,QAAQ,GAAG,EAAE,CAAA;EAClB,IAAI,CAACC,IAAI,GAAG,CAAC,CAAA;AACf;;ACRA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASyB,YAAYA,CAACC,KAAK,EAAExB,GAAG,EAAE;AAChC,EAAA,IAAIiB,MAAM,GAAGO,KAAK,CAACP,MAAM,CAAA;EACzB,OAAOA,MAAM,EAAE,EAAE;AACf,IAAA,IAAIQ,KAAE,CAACD,KAAK,CAACP,MAAM,CAAC,CAAC,CAAC,CAAC,EAAEjB,GAAG,CAAC,EAAE;AAC7B,MAAA,OAAOiB,MAAM,CAAA;AACf,KAAA;AACF,GAAA;AACA,EAAA,OAAO,CAAC,CAAC,CAAA;AACX;;AChBA;AACA,IAAIS,UAAU,GAAGC,KAAK,CAACtB,SAAS,CAAA;;AAEhC;AACA,IAAIuB,MAAM,GAAGF,UAAU,CAACE,MAAM,CAAA;;AAE9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,eAAeA,CAAC7B,GAAG,EAAE;AAC5B,EAAA,IAAIQ,IAAI,GAAG,IAAI,CAACX,QAAQ;AACpBmB,IAAAA,KAAK,GAAGO,YAAY,CAACf,IAAI,EAAER,GAAG,CAAC,CAAA;EAEnC,IAAIgB,KAAK,GAAG,CAAC,EAAE;AACb,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;AACA,EAAA,IAAIc,SAAS,GAAGtB,IAAI,CAACS,MAAM,GAAG,CAAC,CAAA;EAC/B,IAAID,KAAK,IAAIc,SAAS,EAAE;IACtBtB,IAAI,CAACuB,GAAG,EAAE,CAAA;AACZ,GAAC,MAAM;IACLH,MAAM,CAAClB,IAAI,CAACF,IAAI,EAAEQ,KAAK,EAAE,CAAC,CAAC,CAAA;AAC7B,GAAA;EACA,EAAE,IAAI,CAAClB,IAAI,CAAA;AACX,EAAA,OAAO,IAAI,CAAA;AACb;;AC9BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASkC,YAAYA,CAAChC,GAAG,EAAE;AACzB,EAAA,IAAIQ,IAAI,GAAG,IAAI,CAACX,QAAQ;AACpBmB,IAAAA,KAAK,GAAGO,YAAY,CAACf,IAAI,EAAER,GAAG,CAAC,CAAA;AAEnC,EAAA,OAAOgB,KAAK,GAAG,CAAC,GAAGP,SAAS,GAAGD,IAAI,CAACQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;AAC/C;;ACdA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASiB,YAAYA,CAACjC,GAAG,EAAE;EACzB,OAAOuB,YAAY,CAAC,IAAI,CAAC1B,QAAQ,EAAEG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;AAC9C;;ACXA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASkC,YAAYA,CAAClC,GAAG,EAAEa,KAAK,EAAE;AAChC,EAAA,IAAIL,IAAI,GAAG,IAAI,CAACX,QAAQ;AACpBmB,IAAAA,KAAK,GAAGO,YAAY,CAACf,IAAI,EAAER,GAAG,CAAC,CAAA;EAEnC,IAAIgB,KAAK,GAAG,CAAC,EAAE;IACb,EAAE,IAAI,CAAClB,IAAI,CAAA;IACXU,IAAI,CAAC2B,IAAI,CAAC,CAACnC,GAAG,EAAEa,KAAK,CAAC,CAAC,CAAA;AACzB,GAAC,MAAM;AACLL,IAAAA,IAAI,CAACQ,KAAK,CAAC,CAAC,CAAC,CAAC,GAAGH,KAAK,CAAA;AACxB,GAAA;AACA,EAAA,OAAO,IAAI,CAAA;AACb;;ACjBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASuB,SAASA,CAACrB,OAAO,EAAE;EAC1B,IAAIC,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGF,OAAO,IAAI,IAAI,GAAG,CAAC,GAAGA,OAAO,CAACE,MAAM,CAAA;EAEjD,IAAI,CAACC,KAAK,EAAE,CAAA;AACZ,EAAA,OAAO,EAAEF,KAAK,GAAGC,MAAM,EAAE;AACvB,IAAA,IAAIE,KAAK,GAAGJ,OAAO,CAACC,KAAK,CAAC,CAAA;AAC1B,IAAA,IAAI,CAACI,GAAG,CAACD,KAAK,CAAC,CAAC,CAAC,EAAEA,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;AAC9B,GAAA;AACF,CAAA;;AAEA;AACAiB,SAAS,CAAC/B,SAAS,CAACa,KAAK,GAAGI,cAAc,CAAA;AAC1Cc,SAAS,CAAC/B,SAAS,CAAC,QAAQ,CAAC,GAAGwB,eAAe,CAAA;AAC/CO,SAAS,CAAC/B,SAAS,CAACgB,GAAG,GAAGW,YAAY,CAAA;AACtCI,SAAS,CAAC/B,SAAS,CAACH,GAAG,GAAG+B,YAAY,CAAA;AACtCG,SAAS,CAAC/B,SAAS,CAACe,GAAG,GAAGc,YAAY;;ACzBtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASG,aAAaA,GAAG;EACvB,IAAI,CAACvC,IAAI,GAAG,CAAC,CAAA;EACb,IAAI,CAACD,QAAQ,GAAG;AACd,IAAA,MAAM,EAAE,IAAIiB,IAAI,EAAA;AAChB,IAAA,KAAK,EAAE,KAAKwB,QAAG,IAAIF,SAAS,GAAC;IAC7B,QAAQ,EAAE,IAAItB,IAAI,EAAD;GAClB,CAAA;AACH;;AClBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASyB,SAASA,CAAC1B,KAAK,EAAE;AACxB,EAAA,IAAI2B,IAAI,GAAAC,eAAA,CAAU5B,KAAK,CAAA,CAAA;EACvB,OAAQ2B,IAAI,IAAI,QAAQ,IAAIA,IAAI,IAAI,QAAQ,IAAIA,IAAI,IAAI,QAAQ,IAAIA,IAAI,IAAI,SAAS,GAChF3B,KAAK,KAAK,WAAW,GACrBA,KAAK,KAAK,IAAK,CAAA;AACtB;;ACVA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS6B,UAAUA,CAACC,GAAG,EAAE3C,GAAG,EAAE;AAC5B,EAAA,IAAIQ,IAAI,GAAGmC,GAAG,CAAC9C,QAAQ,CAAA;AACvB,EAAA,OAAO0C,SAAS,CAACvC,GAAG,CAAC,GACjBQ,IAAI,CAAC,OAAOR,GAAG,IAAI,QAAQ,GAAG,QAAQ,GAAG,MAAM,CAAC,GAChDQ,IAAI,CAACmC,GAAG,CAAA;AACd;;ACbA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,cAAcA,CAAC5C,GAAG,EAAE;AAC3B,EAAA,IAAIC,MAAM,GAAGyC,UAAU,CAAC,IAAI,EAAE1C,GAAG,CAAC,CAAC,QAAQ,CAAC,CAACA,GAAG,CAAC,CAAA;AACjD,EAAA,IAAI,CAACF,IAAI,IAAIG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAA;AAC3B,EAAA,OAAOA,MAAM,CAAA;AACf;;ACbA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS4C,WAAWA,CAAC7C,GAAG,EAAE;EACxB,OAAO0C,UAAU,CAAC,IAAI,EAAE1C,GAAG,CAAC,CAACqB,GAAG,CAACrB,GAAG,CAAC,CAAA;AACvC;;ACXA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS8C,WAAWA,CAAC9C,GAAG,EAAE;EACxB,OAAO0C,UAAU,CAAC,IAAI,EAAE1C,GAAG,CAAC,CAACE,GAAG,CAACF,GAAG,CAAC,CAAA;AACvC;;ACXA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS+C,WAAWA,CAAC/C,GAAG,EAAEa,KAAK,EAAE;AAC/B,EAAA,IAAIL,IAAI,GAAGkC,UAAU,CAAC,IAAI,EAAE1C,GAAG,CAAC;IAC5BF,IAAI,GAAGU,IAAI,CAACV,IAAI,CAAA;AAEpBU,EAAAA,IAAI,CAACY,GAAG,CAACpB,GAAG,EAAEa,KAAK,CAAC,CAAA;EACpB,IAAI,CAACf,IAAI,IAAIU,IAAI,CAACV,IAAI,IAAIA,IAAI,GAAG,CAAC,GAAG,CAAC,CAAA;AACtC,EAAA,OAAO,IAAI,CAAA;AACb;;ACbA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASkD,QAAQA,CAACjC,OAAO,EAAE;EACzB,IAAIC,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGF,OAAO,IAAI,IAAI,GAAG,CAAC,GAAGA,OAAO,CAACE,MAAM,CAAA;EAEjD,IAAI,CAACC,KAAK,EAAE,CAAA;AACZ,EAAA,OAAO,EAAEF,KAAK,GAAGC,MAAM,EAAE;AACvB,IAAA,IAAIE,KAAK,GAAGJ,OAAO,CAACC,KAAK,CAAC,CAAA;AAC1B,IAAA,IAAI,CAACI,GAAG,CAACD,KAAK,CAAC,CAAC,CAAC,EAAEA,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;AAC9B,GAAA;AACF,CAAA;;AAEA;AACA6B,QAAQ,CAAC3C,SAAS,CAACa,KAAK,GAAGmB,aAAa,CAAA;AACxCW,QAAQ,CAAC3C,SAAS,CAAC,QAAQ,CAAC,GAAGuC,cAAc,CAAA;AAC7CI,QAAQ,CAAC3C,SAAS,CAACgB,GAAG,GAAGwB,WAAW,CAAA;AACpCG,QAAQ,CAAC3C,SAAS,CAACH,GAAG,GAAG4C,WAAW,CAAA;AACpCE,QAAQ,CAAC3C,SAAS,CAACe,GAAG,GAAG2B,WAAW;;;;;"}