tdesign-react 1.15.12-alpha.1 → 1.15.12

package/cjs/_chunks/dep-2e9e48a4.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-2e9e48a4.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      const node = this.getNode(val);\n      if (!node?.isLeaf() && expanded) {\n        this.expandedMap.set(val, true);\n      } else {\n        this.expandedMap.delete(val);\n      }\n      node?.afterExpanded();\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","isLeaf","afterExpanded","resetExpanded","withParents","getChecked","isChecked","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;AACd,QAAA,IAAAK,IAAA,GAAOqF,MAAK,CAAAvF,OAAA,CAAQH,GAAG,CAAA,CAAA;AAC7B,QAAA,IAAI,EAACK,IAAA,KAAAA,IAAAA,IAAAA,IAAA,KAAAA,KAAAA,CAAAA,IAAAA,IAAA,CAAMwF,MAAO,EAAA,CAAKV,IAAAA,QAAU,EAAA;UAC1BO,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;AACAK,QAAAA,IAAA,aAAAA,IAAA,KAAA,KAAA,CAAA,IAAAA,IAAA,CAAMyF,aAAc,EAAA,CAAA;AACtB,OAAC,CAAA,CAAA;AACH,KAAA;AAAA,GAAA,EAAA;IAAApG,GAAA,EAAA,eAAA;AAAAC,IAAAA,KAAA,EAMO,SAAAoG,aAAsBA,GAAA;AACrB,MAAA,IAAAZ,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;AAC9CgE,QAAAA,WAAa,EAAA,KAAA;AACf,OAAC,CAAA,CAAA;AACYjB,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,SAAAsG,WAAW/B,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,CAAA6F,SAAA,CAAUpH,UAAU,CAAA,EAAG,OAAA;AAC7B,QAAA,IAAAb,SAAA,KAAc,aAAiB,IAAA,CAACL,aAAe,EAAA;AAG7C,UAAA,IAAA,CAACyC,KAAKQ,MAAU,IAAA,CAACR,KAAKQ,MAAO,CAAAqF,SAAA,CAAUpH,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,CAAKwF,QAAU,EAAA;AACZ7D,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,CAAK6F,WAAW,CAAA;OAAA,CAAA,CAAA;AACxC,MAAA,OAAA3H,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,KAAKV,UAAW,EAAA,CAAA;AAChC,QAAA,IAAAlB,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,KAAKX,UAAW,EAAA,CAAA;AAC1B,MAAA,IAAAlB,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;AAEThB,QAAAA,WAAa,EAAA,IAAA;AAAA,OAAA,EACVjJ,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,KAAK2E,WAAa,EAAA;AACViB,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-30932f94.js

@@ -0,0 +1,403 @@
+/**
+ * tdesign v1.15.12
+ * (c) 2026 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _Uint8Array = require('./dep-8b7fad52.js');
+var _cacheHas = require('./dep-1855aad9.js');
+var _baseGetTag = require('./dep-b1f75508.js');
+var eq = require('./dep-442b16fc.js');
+var _getAllKeys = require('./dep-fc9261e7.js');
+var _getTag = require('./dep-08eaf73f.js');
+var isArray = require('./dep-9f33bae6.js');
+var _overArg = require('./dep-eb56be60.js');
+var isObjectLike = require('./dep-ad440ab2.js');
+
+/**
+ * A specialized version of `_.some` for arrays without support for iteratee
+ * shorthands.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {boolean} Returns `true` if any element passes the predicate check,
+ *  else `false`.
+ */
+function arraySome(array, predicate) {
+  var index = -1,
+    length = array == null ? 0 : array.length;
+  while (++index < length) {
+    if (predicate(array[index], index, array)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG$3 = 1,
+  COMPARE_UNORDERED_FLAG$1 = 2;
+
+/**
+ * A specialized version of `baseIsEqualDeep` for arrays with support for
+ * partial deep comparisons.
+ *
+ * @private
+ * @param {Array} array The array to compare.
+ * @param {Array} other The other array to compare.
+ * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+ * @param {Function} customizer The function to customize comparisons.
+ * @param {Function} equalFunc The function to determine equivalents of values.
+ * @param {Object} stack Tracks traversed `array` and `other` objects.
+ * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
+ */
+function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {
+  var isPartial = bitmask & COMPARE_PARTIAL_FLAG$3,
+    arrLength = array.length,
+    othLength = other.length;
+  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {
+    return false;
+  }
+  // Check that cyclic values are equal.
+  var arrStacked = stack.get(array);
+  var othStacked = stack.get(other);
+  if (arrStacked && othStacked) {
+    return arrStacked == other && othStacked == array;
+  }
+  var index = -1,
+    result = true,
+    seen = bitmask & COMPARE_UNORDERED_FLAG$1 ? new _cacheHas.SetCache() : undefined;
+  stack.set(array, other);
+  stack.set(other, array);
+
+  // Ignore non-index properties.
+  while (++index < arrLength) {
+    var arrValue = array[index],
+      othValue = other[index];
+    if (customizer) {
+      var compared = isPartial ? customizer(othValue, arrValue, index, other, array, stack) : customizer(arrValue, othValue, index, array, other, stack);
+    }
+    if (compared !== undefined) {
+      if (compared) {
+        continue;
+      }
+      result = false;
+      break;
+    }
+    // Recursively compare arrays (susceptible to call stack limits).
+    if (seen) {
+      if (!arraySome(other, function (othValue, othIndex) {
+        if (!_cacheHas.cacheHas(seen, othIndex) && (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {
+          return seen.push(othIndex);
+        }
+      })) {
+        result = false;
+        break;
+      }
+    } else if (!(arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {
+      result = false;
+      break;
+    }
+  }
+  stack['delete'](array);
+  stack['delete'](other);
+  return result;
+}
+
+/**
+ * Converts `map` to its key-value pairs.
+ *
+ * @private
+ * @param {Object} map The map to convert.
+ * @returns {Array} Returns the key-value pairs.
+ */
+function mapToArray(map) {
+  var index = -1,
+    result = Array(map.size);
+  map.forEach(function (value, key) {
+    result[++index] = [key, value];
+  });
+  return result;
+}
+
+/**
+ * Converts `set` to an array of its values.
+ *
+ * @private
+ * @param {Object} set The set to convert.
+ * @returns {Array} Returns the values.
+ */
+function setToArray(set) {
+  var index = -1,
+    result = Array(set.size);
+  set.forEach(function (value) {
+    result[++index] = value;
+  });
+  return result;
+}
+
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG$2 = 1,
+  COMPARE_UNORDERED_FLAG = 2;
+
+/** `Object#toString` result references. */
+var boolTag = '[object Boolean]',
+  dateTag = '[object Date]',
+  errorTag = '[object Error]',
+  mapTag = '[object Map]',
+  numberTag = '[object Number]',
+  regexpTag = '[object RegExp]',
+  setTag = '[object Set]',
+  stringTag = '[object String]',
+  symbolTag = '[object Symbol]';
+var arrayBufferTag = '[object ArrayBuffer]',
+  dataViewTag = '[object DataView]';
+
+/** Used to convert symbols to primitives and strings. */
+var symbolProto = _baseGetTag._Symbol ? _baseGetTag._Symbol.prototype : undefined,
+  symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;
+
+/**
+ * A specialized version of `baseIsEqualDeep` for comparing objects of
+ * the same `toStringTag`.
+ *
+ * **Note:** This function only supports comparing values with tags of
+ * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
+ *
+ * @private
+ * @param {Object} object The object to compare.
+ * @param {Object} other The other object to compare.
+ * @param {string} tag The `toStringTag` of the objects to compare.
+ * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+ * @param {Function} customizer The function to customize comparisons.
+ * @param {Function} equalFunc The function to determine equivalents of values.
+ * @param {Object} stack Tracks traversed `object` and `other` objects.
+ * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+ */
+function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {
+  switch (tag) {
+    case dataViewTag:
+      if (object.byteLength != other.byteLength || object.byteOffset != other.byteOffset) {
+        return false;
+      }
+      object = object.buffer;
+      other = other.buffer;
+    case arrayBufferTag:
+      if (object.byteLength != other.byteLength || !equalFunc(new _Uint8Array.Uint8Array(object), new _Uint8Array.Uint8Array(other))) {
+        return false;
+      }
+      return true;
+    case boolTag:
+    case dateTag:
+    case numberTag:
+      // Coerce booleans to `1` or `0` and dates to milliseconds.
+      // Invalid dates are coerced to `NaN`.
+      return eq.eq(+object, +other);
+    case errorTag:
+      return object.name == other.name && object.message == other.message;
+    case regexpTag:
+    case stringTag:
+      // Coerce regexes to strings and treat strings, primitives and objects,
+      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring
+      // for more details.
+      return object == other + '';
+    case mapTag:
+      var convert = mapToArray;
+    case setTag:
+      var isPartial = bitmask & COMPARE_PARTIAL_FLAG$2;
+      convert || (convert = setToArray);
+      if (object.size != other.size && !isPartial) {
+        return false;
+      }
+      // Assume cyclic values are equal.
+      var stacked = stack.get(object);
+      if (stacked) {
+        return stacked == other;
+      }
+      bitmask |= COMPARE_UNORDERED_FLAG;
+
+      // Recursively compare objects (susceptible to call stack limits).
+      stack.set(object, other);
+      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);
+      stack['delete'](object);
+      return result;
+    case symbolTag:
+      if (symbolValueOf) {
+        return symbolValueOf.call(object) == symbolValueOf.call(other);
+      }
+  }
+  return false;
+}
+
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG$1 = 1;
+
+/** Used for built-in method references. */
+var objectProto$1 = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty$1 = objectProto$1.hasOwnProperty;
+
+/**
+ * A specialized version of `baseIsEqualDeep` for objects with support for
+ * partial deep comparisons.
+ *
+ * @private
+ * @param {Object} object The object to compare.
+ * @param {Object} other The other object to compare.
+ * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+ * @param {Function} customizer The function to customize comparisons.
+ * @param {Function} equalFunc The function to determine equivalents of values.
+ * @param {Object} stack Tracks traversed `object` and `other` objects.
+ * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+ */
+function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {
+  var isPartial = bitmask & COMPARE_PARTIAL_FLAG$1,
+    objProps = _getAllKeys.getAllKeys(object),
+    objLength = objProps.length,
+    othProps = _getAllKeys.getAllKeys(other),
+    othLength = othProps.length;
+  if (objLength != othLength && !isPartial) {
+    return false;
+  }
+  var index = objLength;
+  while (index--) {
+    var key = objProps[index];
+    if (!(isPartial ? key in other : hasOwnProperty$1.call(other, key))) {
+      return false;
+    }
+  }
+  // Check that cyclic values are equal.
+  var objStacked = stack.get(object);
+  var othStacked = stack.get(other);
+  if (objStacked && othStacked) {
+    return objStacked == other && othStacked == object;
+  }
+  var result = true;
+  stack.set(object, other);
+  stack.set(other, object);
+  var skipCtor = isPartial;
+  while (++index < objLength) {
+    key = objProps[index];
+    var objValue = object[key],
+      othValue = other[key];
+    if (customizer) {
+      var compared = isPartial ? customizer(othValue, objValue, key, other, object, stack) : customizer(objValue, othValue, key, object, other, stack);
+    }
+    // Recursively compare objects (susceptible to call stack limits).
+    if (!(compared === undefined ? objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack) : compared)) {
+      result = false;
+      break;
+    }
+    skipCtor || (skipCtor = key == 'constructor');
+  }
+  if (result && !skipCtor) {
+    var objCtor = object.constructor,
+      othCtor = other.constructor;
+
+    // Non `Object` object instances with different constructors are not equal.
+    if (objCtor != othCtor && 'constructor' in object && 'constructor' in other && !(typeof objCtor == 'function' && objCtor instanceof objCtor && typeof othCtor == 'function' && othCtor instanceof othCtor)) {
+      result = false;
+    }
+  }
+  stack['delete'](object);
+  stack['delete'](other);
+  return result;
+}
+
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG = 1;
+
+/** `Object#toString` result references. */
+var argsTag = '[object Arguments]',
+  arrayTag = '[object Array]',
+  objectTag = '[object Object]';
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * A specialized version of `baseIsEqual` for arrays and objects which performs
+ * deep comparisons and tracks traversed objects enabling objects with circular
+ * references to be compared.
+ *
+ * @private
+ * @param {Object} object The object to compare.
+ * @param {Object} other The other object to compare.
+ * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+ * @param {Function} customizer The function to customize comparisons.
+ * @param {Function} equalFunc The function to determine equivalents of values.
+ * @param {Object} [stack] Tracks traversed `object` and `other` objects.
+ * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+ */
+function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {
+  var objIsArr = isArray.isArray(object),
+    othIsArr = isArray.isArray(other),
+    objTag = objIsArr ? arrayTag : _getTag.getTag(object),
+    othTag = othIsArr ? arrayTag : _getTag.getTag(other);
+  objTag = objTag == argsTag ? objectTag : objTag;
+  othTag = othTag == argsTag ? objectTag : othTag;
+  var objIsObj = objTag == objectTag,
+    othIsObj = othTag == objectTag,
+    isSameTag = objTag == othTag;
+  if (isSameTag && _overArg.isBuffer(object)) {
+    if (!_overArg.isBuffer(other)) {
+      return false;
+    }
+    objIsArr = true;
+    objIsObj = false;
+  }
+  if (isSameTag && !objIsObj) {
+    stack || (stack = new _Uint8Array.Stack());
+    return objIsArr || _overArg.isTypedArray(object) ? equalArrays(object, other, bitmask, customizer, equalFunc, stack) : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);
+  }
+  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {
+    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
+      othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');
+    if (objIsWrapped || othIsWrapped) {
+      var objUnwrapped = objIsWrapped ? object.value() : object,
+        othUnwrapped = othIsWrapped ? other.value() : other;
+      stack || (stack = new _Uint8Array.Stack());
+      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);
+    }
+  }
+  if (!isSameTag) {
+    return false;
+  }
+  stack || (stack = new _Uint8Array.Stack());
+  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);
+}
+
+/**
+ * The base implementation of `_.isEqual` which supports partial comparisons
+ * and tracks traversed objects.
+ *
+ * @private
+ * @param {*} value The value to compare.
+ * @param {*} other The other value to compare.
+ * @param {boolean} bitmask The bitmask flags.
+ *  1 - Unordered comparison
+ *  2 - Partial comparison
+ * @param {Function} [customizer] The function to customize comparisons.
+ * @param {Object} [stack] Tracks traversed `value` and `other` objects.
+ * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+ */
+function baseIsEqual(value, other, bitmask, customizer, stack) {
+  if (value === other) {
+    return true;
+  }
+  if (value == null || other == null || !isObjectLike.isObjectLike(value) && !isObjectLike.isObjectLike(other)) {
+    return value !== value && other !== other;
+  }
+  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);
+}
+
+exports.baseIsEqual = baseIsEqual;
+exports.setToArray = setToArray;
+//# sourceMappingURL=dep-30932f94.js.map

package/cjs/_chunks/dep-30932f94.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-30932f94.js","sources":["../../../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_arraySome.js","../../../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_equalArrays.js","../../../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_mapToArray.js","../../../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_setToArray.js","../../../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_equalByTag.js","../../../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_equalObjects.js","../../../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseIsEqualDeep.js","../../../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseIsEqual.js"],"sourcesContent":["/**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n */\nfunction arraySome(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (predicate(array[index], index, array)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nexport default arraySome;\n","import SetCache from './_SetCache.js';\nimport arraySome from './_arraySome.js';\nimport cacheHas from './_cacheHas.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Check that cyclic values are equal.\n  var arrStacked = stack.get(array);\n  var othStacked = stack.get(other);\n  if (arrStacked && othStacked) {\n    return arrStacked == other && othStacked == array;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalArrays;\n","/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\nexport default mapToArray;\n","/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nexport default setToArray;\n","import Symbol from './_Symbol.js';\nimport Uint8Array from './_Uint8Array.js';\nimport eq from './eq.js';\nimport equalArrays from './_equalArrays.js';\nimport mapToArray from './_mapToArray.js';\nimport setToArray from './_setToArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nexport default equalByTag;\n","import getAllKeys from './_getAllKeys.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\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 * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Check that cyclic values are equal.\n  var objStacked = stack.get(object);\n  var othStacked = stack.get(other);\n  if (objStacked && othStacked) {\n    return objStacked == other && othStacked == object;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalObjects;\n","import Stack from './_Stack.js';\nimport equalArrays from './_equalArrays.js';\nimport equalByTag from './_equalByTag.js';\nimport equalObjects from './_equalObjects.js';\nimport getTag from './_getTag.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    objectTag = '[object Object]';\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 * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n  var objIsArr = isArray(object),\n      othIsArr = isArray(other),\n      objTag = objIsArr ? arrayTag : getTag(object),\n      othTag = othIsArr ? arrayTag : getTag(other);\n\n  objTag = objTag == argsTag ? objectTag : objTag;\n  othTag = othTag == argsTag ? objectTag : othTag;\n\n  var objIsObj = objTag == objectTag,\n      othIsObj = othTag == objectTag,\n      isSameTag = objTag == othTag;\n\n  if (isSameTag && isBuffer(object)) {\n    if (!isBuffer(other)) {\n      return false;\n    }\n    objIsArr = true;\n    objIsObj = false;\n  }\n  if (isSameTag && !objIsObj) {\n    stack || (stack = new Stack);\n    return (objIsArr || isTypedArray(object))\n      ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n      : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n  }\n  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n    if (objIsWrapped || othIsWrapped) {\n      var objUnwrapped = objIsWrapped ? object.value() : object,\n          othUnwrapped = othIsWrapped ? other.value() : other;\n\n      stack || (stack = new Stack);\n      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n    }\n  }\n  if (!isSameTag) {\n    return false;\n  }\n  stack || (stack = new Stack);\n  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n}\n\nexport default baseIsEqualDeep;\n","import baseIsEqualDeep from './_baseIsEqualDeep.js';\nimport isObjectLike from './isObjectLike.js';\n\n/**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Unordered comparison\n *  2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n  if (value === other) {\n    return true;\n  }\n  if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n    return value !== value && other !== other;\n  }\n  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nexport default baseIsEqual;\n"],"names":["arraySome","array","predicate","index","length","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","equalArrays","other","bitmask","customizer","equalFunc","stack","isPartial","arrLength","othLength","arrStacked","get","othStacked","result","seen","SetCache","undefined","set","arrValue","othValue","compared","othIndex","cacheHas","push","mapToArray","map","Array","size","forEach","value","key","setToArray","boolTag","dateTag","errorTag","mapTag","numberTag","regexpTag","setTag","stringTag","symbolTag","arrayBufferTag","dataViewTag","symbolProto","Symbol","prototype","symbolValueOf","valueOf","equalByTag","object","tag","byteLength","byteOffset","buffer","Uint8Array","eq","name","message","convert","stacked","call","objectProto","Object","hasOwnProperty","equalObjects","objProps","getAllKeys","objLength","othProps","objStacked","skipCtor","objValue","objCtor","constructor","othCtor","argsTag","arrayTag","objectTag","baseIsEqualDeep","objIsArr","isArray","othIsArr","objTag","getTag","othTag","objIsObj","othIsObj","isSameTag","isBuffer","Stack","isTypedArray","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","baseIsEqual","isObjectLike"],"mappings":";;;;;;;;;;;;;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASA,SAASA,CAACC,KAAK,EAAEC,SAAS,EAAE;EACnC,IAAIC,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGH,KAAK,IAAI,IAAI,GAAG,CAAC,GAAGA,KAAK,CAACG,MAAM,CAAA;AAE7C,EAAA,OAAO,EAAED,KAAK,GAAGC,MAAM,EAAE;IACvB,IAAIF,SAAS,CAACD,KAAK,CAACE,KAAK,CAAC,EAAEA,KAAK,EAAEF,KAAK,CAAC,EAAE;AACzC,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AACF,GAAA;AACA,EAAA,OAAO,KAAK,CAAA;AACd;;AChBA;AACA,IAAII,sBAAoB,GAAG,CAAC;AACxBC,EAAAA,wBAAsB,GAAG,CAAC,CAAA;;AAE9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,WAAWA,CAACN,KAAK,EAAEO,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,EAAE;AACxE,EAAA,IAAIC,SAAS,GAAGJ,OAAO,GAAGJ,sBAAoB;IAC1CS,SAAS,GAAGb,KAAK,CAACG,MAAM;IACxBW,SAAS,GAAGP,KAAK,CAACJ,MAAM,CAAA;EAE5B,IAAIU,SAAS,IAAIC,SAAS,IAAI,EAAEF,SAAS,IAAIE,SAAS,GAAGD,SAAS,CAAC,EAAE;AACnE,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;AACA;AACA,EAAA,IAAIE,UAAU,GAAGJ,KAAK,CAACK,GAAG,CAAChB,KAAK,CAAC,CAAA;AACjC,EAAA,IAAIiB,UAAU,GAAGN,KAAK,CAACK,GAAG,CAACT,KAAK,CAAC,CAAA;EACjC,IAAIQ,UAAU,IAAIE,UAAU,EAAE;AAC5B,IAAA,OAAOF,UAAU,IAAIR,KAAK,IAAIU,UAAU,IAAIjB,KAAK,CAAA;AACnD,GAAA;EACA,IAAIE,KAAK,GAAG,CAAC,CAAC;AACVgB,IAAAA,MAAM,GAAG,IAAI;IACbC,IAAI,GAAIX,OAAO,GAAGH,wBAAsB,GAAI,IAAIe,kBAAQ,EAAA,GAAGC,SAAS,CAAA;AAExEV,EAAAA,KAAK,CAACW,GAAG,CAACtB,KAAK,EAAEO,KAAK,CAAC,CAAA;AACvBI,EAAAA,KAAK,CAACW,GAAG,CAACf,KAAK,EAAEP,KAAK,CAAC,CAAA;;AAEvB;AACA,EAAA,OAAO,EAAEE,KAAK,GAAGW,SAAS,EAAE;AAC1B,IAAA,IAAIU,QAAQ,GAAGvB,KAAK,CAACE,KAAK,CAAC;AACvBsB,MAAAA,QAAQ,GAAGjB,KAAK,CAACL,KAAK,CAAC,CAAA;AAE3B,IAAA,IAAIO,UAAU,EAAE;AACd,MAAA,IAAIgB,QAAQ,GAAGb,SAAS,GACpBH,UAAU,CAACe,QAAQ,EAAED,QAAQ,EAAErB,KAAK,EAAEK,KAAK,EAAEP,KAAK,EAAEW,KAAK,CAAC,GAC1DF,UAAU,CAACc,QAAQ,EAAEC,QAAQ,EAAEtB,KAAK,EAAEF,KAAK,EAAEO,KAAK,EAAEI,KAAK,CAAC,CAAA;AAChE,KAAA;IACA,IAAIc,QAAQ,KAAKJ,SAAS,EAAE;AAC1B,MAAA,IAAII,QAAQ,EAAE;AACZ,QAAA,SAAA;AACF,OAAA;AACAP,MAAAA,MAAM,GAAG,KAAK,CAAA;AACd,MAAA,MAAA;AACF,KAAA;AACA;AACA,IAAA,IAAIC,IAAI,EAAE;MACR,IAAI,CAACpB,SAAS,CAACQ,KAAK,EAAE,UAASiB,QAAQ,EAAEE,QAAQ,EAAE;QAC7C,IAAI,CAACC,kBAAQ,CAACR,IAAI,EAAEO,QAAQ,CAAC,KACxBH,QAAQ,KAAKC,QAAQ,IAAId,SAAS,CAACa,QAAQ,EAAEC,QAAQ,EAAEhB,OAAO,EAAEC,UAAU,EAAEE,KAAK,CAAC,CAAC,EAAE;AACxF,UAAA,OAAOQ,IAAI,CAACS,IAAI,CAACF,QAAQ,CAAC,CAAA;AAC5B,SAAA;AACF,OAAC,CAAC,EAAE;AACNR,QAAAA,MAAM,GAAG,KAAK,CAAA;AACd,QAAA,MAAA;AACF,OAAA;KACD,MAAM,IAAI,EACLK,QAAQ,KAAKC,QAAQ,IACnBd,SAAS,CAACa,QAAQ,EAAEC,QAAQ,EAAEhB,OAAO,EAAEC,UAAU,EAAEE,KAAK,CAAC,CAC5D,EAAE;AACLO,MAAAA,MAAM,GAAG,KAAK,CAAA;AACd,MAAA,MAAA;AACF,KAAA;AACF,GAAA;AACAP,EAAAA,KAAK,CAAC,QAAQ,CAAC,CAACX,KAAK,CAAC,CAAA;AACtBW,EAAAA,KAAK,CAAC,QAAQ,CAAC,CAACJ,KAAK,CAAC,CAAA;AACtB,EAAA,OAAOW,MAAM,CAAA;AACf;;ACjFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASW,UAAUA,CAACC,GAAG,EAAE;EACvB,IAAI5B,KAAK,GAAG,CAAC,CAAC;AACVgB,IAAAA,MAAM,GAAGa,KAAK,CAACD,GAAG,CAACE,IAAI,CAAC,CAAA;AAE5BF,EAAAA,GAAG,CAACG,OAAO,CAAC,UAASC,KAAK,EAAEC,GAAG,EAAE;IAC/BjB,MAAM,CAAC,EAAEhB,KAAK,CAAC,GAAG,CAACiC,GAAG,EAAED,KAAK,CAAC,CAAA;AAChC,GAAC,CAAC,CAAA;AACF,EAAA,OAAOhB,MAAM,CAAA;AACf;;ACfA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASkB,UAAUA,CAACd,GAAG,EAAE;EACvB,IAAIpB,KAAK,GAAG,CAAC,CAAC;AACVgB,IAAAA,MAAM,GAAGa,KAAK,CAACT,GAAG,CAACU,IAAI,CAAC,CAAA;AAE5BV,EAAAA,GAAG,CAACW,OAAO,CAAC,UAASC,KAAK,EAAE;AAC1BhB,IAAAA,MAAM,CAAC,EAAEhB,KAAK,CAAC,GAAGgC,KAAK,CAAA;AACzB,GAAC,CAAC,CAAA;AACF,EAAA,OAAOhB,MAAM,CAAA;AACf;;ACRA;AACA,IAAId,sBAAoB,GAAG,CAAC;AACxBC,EAAAA,sBAAsB,GAAG,CAAC,CAAA;;AAE9B;AACA,IAAIgC,OAAO,GAAG,kBAAkB;AAC5BC,EAAAA,OAAO,GAAG,eAAe;AACzBC,EAAAA,QAAQ,GAAG,gBAAgB;AAC3BC,EAAAA,MAAM,GAAG,cAAc;AACvBC,EAAAA,SAAS,GAAG,iBAAiB;AAC7BC,EAAAA,SAAS,GAAG,iBAAiB;AAC7BC,EAAAA,MAAM,GAAG,cAAc;AACvBC,EAAAA,SAAS,GAAG,iBAAiB;AAC7BC,EAAAA,SAAS,GAAG,iBAAiB,CAAA;AAEjC,IAAIC,cAAc,GAAG,sBAAsB;AACvCC,EAAAA,WAAW,GAAG,mBAAmB,CAAA;;AAErC;AACA,IAAIC,WAAW,GAAGC,mBAAM,GAAGA,mBAAM,CAACC,SAAS,GAAG7B,SAAS;AACnD8B,EAAAA,aAAa,GAAGH,WAAW,GAAGA,WAAW,CAACI,OAAO,GAAG/B,SAAS,CAAA;;AAEjE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASgC,UAAUA,CAACC,MAAM,EAAE/C,KAAK,EAAEgD,GAAG,EAAE/C,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,EAAE;AAC7E,EAAA,QAAQ4C,GAAG;AACT,IAAA,KAAKR,WAAW;AACd,MAAA,IAAKO,MAAM,CAACE,UAAU,IAAIjD,KAAK,CAACiD,UAAU,IACrCF,MAAM,CAACG,UAAU,IAAIlD,KAAK,CAACkD,UAAW,EAAE;AAC3C,QAAA,OAAO,KAAK,CAAA;AACd,OAAA;MACAH,MAAM,GAAGA,MAAM,CAACI,MAAM,CAAA;MACtBnD,KAAK,GAAGA,KAAK,CAACmD,MAAM,CAAA;AAEtB,IAAA,KAAKZ,cAAc;MACjB,IAAKQ,MAAM,CAACE,UAAU,IAAIjD,KAAK,CAACiD,UAAU,IACtC,CAAC9C,SAAS,CAAC,IAAIiD,sBAAU,CAACL,MAAM,CAAC,EAAE,IAAIK,sBAAU,CAACpD,KAAK,CAAC,CAAC,EAAE;AAC7D,QAAA,OAAO,KAAK,CAAA;AACd,OAAA;AACA,MAAA,OAAO,IAAI,CAAA;AAEb,IAAA,KAAK8B,OAAO,CAAA;AACZ,IAAA,KAAKC,OAAO,CAAA;AACZ,IAAA,KAAKG,SAAS;AACZ;AACA;AACA,MAAA,OAAOmB,KAAE,CAAC,CAACN,MAAM,EAAE,CAAC/C,KAAK,CAAC,CAAA;AAE5B,IAAA,KAAKgC,QAAQ;AACX,MAAA,OAAOe,MAAM,CAACO,IAAI,IAAItD,KAAK,CAACsD,IAAI,IAAIP,MAAM,CAACQ,OAAO,IAAIvD,KAAK,CAACuD,OAAO,CAAA;AAErE,IAAA,KAAKpB,SAAS,CAAA;AACd,IAAA,KAAKE,SAAS;AACZ;AACA;AACA;AACA,MAAA,OAAOU,MAAM,IAAK/C,KAAK,GAAG,EAAG,CAAA;AAE/B,IAAA,KAAKiC,MAAM;MACT,IAAIuB,OAAO,GAAGlC,UAAU,CAAA;AAE1B,IAAA,KAAKc,MAAM;AACT,MAAA,IAAI/B,SAAS,GAAGJ,OAAO,GAAGJ,sBAAoB,CAAA;AAC9C2D,MAAAA,OAAO,KAAKA,OAAO,GAAG3B,UAAU,CAAC,CAAA;MAEjC,IAAIkB,MAAM,CAACtB,IAAI,IAAIzB,KAAK,CAACyB,IAAI,IAAI,CAACpB,SAAS,EAAE;AAC3C,QAAA,OAAO,KAAK,CAAA;AACd,OAAA;AACA;AACA,MAAA,IAAIoD,OAAO,GAAGrD,KAAK,CAACK,GAAG,CAACsC,MAAM,CAAC,CAAA;AAC/B,MAAA,IAAIU,OAAO,EAAE;QACX,OAAOA,OAAO,IAAIzD,KAAK,CAAA;AACzB,OAAA;AACAC,MAAAA,OAAO,IAAIH,sBAAsB,CAAA;;AAEjC;AACAM,MAAAA,KAAK,CAACW,GAAG,CAACgC,MAAM,EAAE/C,KAAK,CAAC,CAAA;MACxB,IAAIW,MAAM,GAAGZ,WAAW,CAACyD,OAAO,CAACT,MAAM,CAAC,EAAES,OAAO,CAACxD,KAAK,CAAC,EAAEC,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,CAAC,CAAA;AAChGA,MAAAA,KAAK,CAAC,QAAQ,CAAC,CAAC2C,MAAM,CAAC,CAAA;AACvB,MAAA,OAAOpC,MAAM,CAAA;AAEf,IAAA,KAAK2B,SAAS;AACZ,MAAA,IAAIM,aAAa,EAAE;AACjB,QAAA,OAAOA,aAAa,CAACc,IAAI,CAACX,MAAM,CAAC,IAAIH,aAAa,CAACc,IAAI,CAAC1D,KAAK,CAAC,CAAA;AAChE,OAAA;AACJ,GAAA;AACA,EAAA,OAAO,KAAK,CAAA;AACd;;AC3GA;AACA,IAAIH,sBAAoB,GAAG,CAAC,CAAA;;AAE5B;AACA,IAAI8D,aAAW,GAAGC,MAAM,CAACjB,SAAS,CAAA;;AAElC;AACA,IAAIkB,gBAAc,GAAGF,aAAW,CAACE,cAAc,CAAA;;AAE/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,YAAYA,CAACf,MAAM,EAAE/C,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,EAAE;AAC1E,EAAA,IAAIC,SAAS,GAAGJ,OAAO,GAAGJ,sBAAoB;AAC1CkE,IAAAA,QAAQ,GAAGC,sBAAU,CAACjB,MAAM,CAAC;IAC7BkB,SAAS,GAAGF,QAAQ,CAACnE,MAAM;AAC3BsE,IAAAA,QAAQ,GAAGF,sBAAU,CAAChE,KAAK,CAAC;IAC5BO,SAAS,GAAG2D,QAAQ,CAACtE,MAAM,CAAA;AAE/B,EAAA,IAAIqE,SAAS,IAAI1D,SAAS,IAAI,CAACF,SAAS,EAAE;AACxC,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;EACA,IAAIV,KAAK,GAAGsE,SAAS,CAAA;EACrB,OAAOtE,KAAK,EAAE,EAAE;AACd,IAAA,IAAIiC,GAAG,GAAGmC,QAAQ,CAACpE,KAAK,CAAC,CAAA;AACzB,IAAA,IAAI,EAAEU,SAAS,GAAGuB,GAAG,IAAI5B,KAAK,GAAG6D,gBAAc,CAACH,IAAI,CAAC1D,KAAK,EAAE4B,GAAG,CAAC,CAAC,EAAE;AACjE,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;AACF,GAAA;AACA;AACA,EAAA,IAAIuC,UAAU,GAAG/D,KAAK,CAACK,GAAG,CAACsC,MAAM,CAAC,CAAA;AAClC,EAAA,IAAIrC,UAAU,GAAGN,KAAK,CAACK,GAAG,CAACT,KAAK,CAAC,CAAA;EACjC,IAAImE,UAAU,IAAIzD,UAAU,EAAE;AAC5B,IAAA,OAAOyD,UAAU,IAAInE,KAAK,IAAIU,UAAU,IAAIqC,MAAM,CAAA;AACpD,GAAA;EACA,IAAIpC,MAAM,GAAG,IAAI,CAAA;AACjBP,EAAAA,KAAK,CAACW,GAAG,CAACgC,MAAM,EAAE/C,KAAK,CAAC,CAAA;AACxBI,EAAAA,KAAK,CAACW,GAAG,CAACf,KAAK,EAAE+C,MAAM,CAAC,CAAA;EAExB,IAAIqB,QAAQ,GAAG/D,SAAS,CAAA;AACxB,EAAA,OAAO,EAAEV,KAAK,GAAGsE,SAAS,EAAE;AAC1BrC,IAAAA,GAAG,GAAGmC,QAAQ,CAACpE,KAAK,CAAC,CAAA;AACrB,IAAA,IAAI0E,QAAQ,GAAGtB,MAAM,CAACnB,GAAG,CAAC;AACtBX,MAAAA,QAAQ,GAAGjB,KAAK,CAAC4B,GAAG,CAAC,CAAA;AAEzB,IAAA,IAAI1B,UAAU,EAAE;AACd,MAAA,IAAIgB,QAAQ,GAAGb,SAAS,GACpBH,UAAU,CAACe,QAAQ,EAAEoD,QAAQ,EAAEzC,GAAG,EAAE5B,KAAK,EAAE+C,MAAM,EAAE3C,KAAK,CAAC,GACzDF,UAAU,CAACmE,QAAQ,EAAEpD,QAAQ,EAAEW,GAAG,EAAEmB,MAAM,EAAE/C,KAAK,EAAEI,KAAK,CAAC,CAAA;AAC/D,KAAA;AACA;IACA,IAAI,EAAEc,QAAQ,KAAKJ,SAAS,GACnBuD,QAAQ,KAAKpD,QAAQ,IAAId,SAAS,CAACkE,QAAQ,EAAEpD,QAAQ,EAAEhB,OAAO,EAAEC,UAAU,EAAEE,KAAK,CAAC,GACnFc,QAAQ,CACX,EAAE;AACLP,MAAAA,MAAM,GAAG,KAAK,CAAA;AACd,MAAA,MAAA;AACF,KAAA;AACAyD,IAAAA,QAAQ,KAAKA,QAAQ,GAAGxC,GAAG,IAAI,aAAa,CAAC,CAAA;AAC/C,GAAA;AACA,EAAA,IAAIjB,MAAM,IAAI,CAACyD,QAAQ,EAAE;AACvB,IAAA,IAAIE,OAAO,GAAGvB,MAAM,CAACwB,WAAW;MAC5BC,OAAO,GAAGxE,KAAK,CAACuE,WAAW,CAAA;;AAE/B;AACA,IAAA,IAAID,OAAO,IAAIE,OAAO,IACjB,aAAa,IAAIzB,MAAM,IAAI,aAAa,IAAI/C,KAAM,IACnD,EAAE,OAAOsE,OAAO,IAAI,UAAU,IAAIA,OAAO,YAAYA,OAAO,IAC1D,OAAOE,OAAO,IAAI,UAAU,IAAIA,OAAO,YAAYA,OAAO,CAAC,EAAE;AACjE7D,MAAAA,MAAM,GAAG,KAAK,CAAA;AAChB,KAAA;AACF,GAAA;AACAP,EAAAA,KAAK,CAAC,QAAQ,CAAC,CAAC2C,MAAM,CAAC,CAAA;AACvB3C,EAAAA,KAAK,CAAC,QAAQ,CAAC,CAACJ,KAAK,CAAC,CAAA;AACtB,EAAA,OAAOW,MAAM,CAAA;AACf;;AC9EA;AACA,IAAId,oBAAoB,GAAG,CAAC,CAAA;;AAE5B;AACA,IAAI4E,OAAO,GAAG,oBAAoB;AAC9BC,EAAAA,QAAQ,GAAG,gBAAgB;AAC3BC,EAAAA,SAAS,GAAG,iBAAiB,CAAA;;AAEjC;AACA,IAAIhB,WAAW,GAAGC,MAAM,CAACjB,SAAS,CAAA;;AAElC;AACA,IAAIkB,cAAc,GAAGF,WAAW,CAACE,cAAc,CAAA;;AAE/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASe,eAAeA,CAAC7B,MAAM,EAAE/C,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,EAAE;AAC7E,EAAA,IAAIyE,QAAQ,GAAGC,eAAO,CAAC/B,MAAM,CAAC;AAC1BgC,IAAAA,QAAQ,GAAGD,eAAO,CAAC9E,KAAK,CAAC;IACzBgF,MAAM,GAAGH,QAAQ,GAAGH,QAAQ,GAAGO,cAAM,CAAClC,MAAM,CAAC;IAC7CmC,MAAM,GAAGH,QAAQ,GAAGL,QAAQ,GAAGO,cAAM,CAACjF,KAAK,CAAC,CAAA;AAEhDgF,EAAAA,MAAM,GAAGA,MAAM,IAAIP,OAAO,GAAGE,SAAS,GAAGK,MAAM,CAAA;AAC/CE,EAAAA,MAAM,GAAGA,MAAM,IAAIT,OAAO,GAAGE,SAAS,GAAGO,MAAM,CAAA;AAE/C,EAAA,IAAIC,QAAQ,GAAGH,MAAM,IAAIL,SAAS;IAC9BS,QAAQ,GAAGF,MAAM,IAAIP,SAAS;IAC9BU,SAAS,GAAGL,MAAM,IAAIE,MAAM,CAAA;AAEhC,EAAA,IAAIG,SAAS,IAAIC,iBAAQ,CAACvC,MAAM,CAAC,EAAE;AACjC,IAAA,IAAI,CAACuC,iBAAQ,CAACtF,KAAK,CAAC,EAAE;AACpB,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;AACA6E,IAAAA,QAAQ,GAAG,IAAI,CAAA;AACfM,IAAAA,QAAQ,GAAG,KAAK,CAAA;AAClB,GAAA;AACA,EAAA,IAAIE,SAAS,IAAI,CAACF,QAAQ,EAAE;AAC1B/E,IAAAA,KAAK,KAAKA,KAAK,GAAG,IAAImF,iBAAK,EAAA,CAAC,CAAA;AAC5B,IAAA,OAAQV,QAAQ,IAAIW,qBAAY,CAACzC,MAAM,CAAC,GACpChD,WAAW,CAACgD,MAAM,EAAE/C,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,CAAC,GACjE0C,UAAU,CAACC,MAAM,EAAE/C,KAAK,EAAEgF,MAAM,EAAE/E,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,CAAC,CAAA;AAC9E,GAAA;AACA,EAAA,IAAI,EAAEH,OAAO,GAAGJ,oBAAoB,CAAC,EAAE;IACrC,IAAI4F,YAAY,GAAGN,QAAQ,IAAItB,cAAc,CAACH,IAAI,CAACX,MAAM,EAAE,aAAa,CAAC;MACrE2C,YAAY,GAAGN,QAAQ,IAAIvB,cAAc,CAACH,IAAI,CAAC1D,KAAK,EAAE,aAAa,CAAC,CAAA;IAExE,IAAIyF,YAAY,IAAIC,YAAY,EAAE;MAChC,IAAIC,YAAY,GAAGF,YAAY,GAAG1C,MAAM,CAACpB,KAAK,EAAE,GAAGoB,MAAM;QACrD6C,YAAY,GAAGF,YAAY,GAAG1F,KAAK,CAAC2B,KAAK,EAAE,GAAG3B,KAAK,CAAA;AAEvDI,MAAAA,KAAK,KAAKA,KAAK,GAAG,IAAImF,iBAAK,EAAA,CAAC,CAAA;MAC5B,OAAOpF,SAAS,CAACwF,YAAY,EAAEC,YAAY,EAAE3F,OAAO,EAAEC,UAAU,EAAEE,KAAK,CAAC,CAAA;AAC1E,KAAA;AACF,GAAA;EACA,IAAI,CAACiF,SAAS,EAAE;AACd,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;AACAjF,EAAAA,KAAK,KAAKA,KAAK,GAAG,IAAImF,iBAAK,EAAA,CAAC,CAAA;AAC5B,EAAA,OAAOzB,YAAY,CAACf,MAAM,EAAE/C,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,CAAC,CAAA;AAC3E;;AC7EA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASyF,WAAWA,CAAClE,KAAK,EAAE3B,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAEE,KAAK,EAAE;EAC7D,IAAIuB,KAAK,KAAK3B,KAAK,EAAE;AACnB,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;AACA,EAAA,IAAI2B,KAAK,IAAI,IAAI,IAAI3B,KAAK,IAAI,IAAI,IAAK,CAAC8F,yBAAY,CAACnE,KAAK,CAAC,IAAI,CAACmE,yBAAY,CAAC9F,KAAK,CAAE,EAAE;AACpF,IAAA,OAAO2B,KAAK,KAAKA,KAAK,IAAI3B,KAAK,KAAKA,KAAK,CAAA;AAC3C,GAAA;AACA,EAAA,OAAO4E,eAAe,CAACjD,KAAK,EAAE3B,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAE2F,WAAW,EAAEzF,KAAK,CAAC,CAAA;AAC/E;;;;;"}

package/cjs/_chunks/dep-32a4b608.js

@@ -0,0 +1,38 @@
+/**
+ * tdesign v1.15.12
+ * (c) 2026 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _typeof = require('./dep-b541f57b.js');
+
+function toPrimitive(t, r) {
+  if ("object" != _typeof._typeof(t) || !t) return t;
+  var e = t[Symbol.toPrimitive];
+  if (void 0 !== e) {
+    var i = e.call(t, r || "default");
+    if ("object" != _typeof._typeof(i)) return i;
+    throw new TypeError("@@toPrimitive must return a primitive value.");
+  }
+  return ("string" === r ? String : Number)(t);
+}
+
+function toPropertyKey(t) {
+  var i = toPrimitive(t, "string");
+  return "symbol" == _typeof._typeof(i) ? i : i + "";
+}
+
+function _defineProperty(e, r, t) {
+  return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {
+    value: t,
+    enumerable: !0,
+    configurable: !0,
+    writable: !0
+  }) : e[r] = t, e;
+}
+
+exports._defineProperty = _defineProperty;
+exports.toPropertyKey = toPropertyKey;
+//# sourceMappingURL=dep-32a4b608.js.map

package/cjs/_chunks/dep-32a4b608.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-32a4b608.js","sources":["../../../../node_modules/.pnpm/@babel+runtime@7.26.10/node_modules/@babel/runtime/helpers/esm/toPrimitive.js","../../../../node_modules/.pnpm/@babel+runtime@7.26.10/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js","../../../../node_modules/.pnpm/@babel+runtime@7.26.10/node_modules/@babel/runtime/helpers/esm/defineProperty.js"],"sourcesContent":["import _typeof from \"./typeof.js\";\nfunction toPrimitive(t, r) {\n  if (\"object\" != _typeof(t) || !t) return t;\n  var e = t[Symbol.toPrimitive];\n  if (void 0 !== e) {\n    var i = e.call(t, r || \"default\");\n    if (\"object\" != _typeof(i)) return i;\n    throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n  }\n  return (\"string\" === r ? String : Number)(t);\n}\nexport { toPrimitive as default };","import _typeof from \"./typeof.js\";\nimport toPrimitive from \"./toPrimitive.js\";\nfunction toPropertyKey(t) {\n  var i = toPrimitive(t, \"string\");\n  return \"symbol\" == _typeof(i) ? i : i + \"\";\n}\nexport { toPropertyKey as default };","import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperty(e, r, t) {\n  return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {\n    value: t,\n    enumerable: !0,\n    configurable: !0,\n    writable: !0\n  }) : e[r] = t, e;\n}\nexport { _defineProperty as default };"],"names":["toPrimitive","t","r","_typeof","e","Symbol","i","call","TypeError","String","Number","toPropertyKey","_defineProperty","Object","defineProperty","value","enumerable","configurable","writable"],"mappings":";;;;;;;;;;AACA,SAASA,WAAWA,CAACC,CAAC,EAAEC,CAAC,EAAE;EACzB,IAAI,QAAQ,IAAIC,eAAO,CAACF,CAAC,CAAC,IAAI,CAACA,CAAC,EAAE,OAAOA,CAAC,CAAA;AAC1C,EAAA,IAAIG,CAAC,GAAGH,CAAC,CAACI,MAAM,CAACL,WAAW,CAAC,CAAA;AAC7B,EAAA,IAAI,KAAK,CAAC,KAAKI,CAAC,EAAE;IAChB,IAAIE,CAAC,GAAGF,CAAC,CAACG,IAAI,CAACN,CAAC,EAAEC,CAAC,IAAI,SAAS,CAAC,CAAA;IACjC,IAAI,QAAQ,IAAIC,eAAO,CAACG,CAAC,CAAC,EAAE,OAAOA,CAAC,CAAA;AACpC,IAAA,MAAM,IAAIE,SAAS,CAAC,8CAA8C,CAAC,CAAA;AACrE,GAAA;EACA,OAAO,CAAC,QAAQ,KAAKN,CAAC,GAAGO,MAAM,GAAGC,MAAM,EAAET,CAAC,CAAC,CAAA;AAC9C;;ACRA,SAASU,aAAaA,CAACV,CAAC,EAAE;AACxB,EAAA,IAAIK,CAAC,GAAGN,WAAW,CAACC,CAAC,EAAE,QAAQ,CAAC,CAAA;EAChC,OAAO,QAAQ,IAAIE,eAAO,CAACG,CAAC,CAAC,GAAGA,CAAC,GAAGA,CAAC,GAAG,EAAE,CAAA;AAC5C;;ACJA,SAASM,eAAeA,CAACR,CAAC,EAAEF,CAAC,EAAED,CAAC,EAAE;AAChC,EAAA,OAAO,CAACC,CAAC,GAAGS,aAAa,CAACT,CAAC,CAAC,KAAKE,CAAC,GAAGS,MAAM,CAACC,cAAc,CAACV,CAAC,EAAEF,CAAC,EAAE;AAC/Da,IAAAA,KAAK,EAAEd,CAAC;IACRe,UAAU,EAAE,CAAC,CAAC;IACdC,YAAY,EAAE,CAAC,CAAC;AAChBC,IAAAA,QAAQ,EAAE,CAAC,CAAA;GACZ,CAAC,GAAGd,CAAC,CAACF,CAAC,CAAC,GAAGD,CAAC,EAAEG,CAAC,CAAA;AAClB;;;;;"}