tdesign-react 0.23.0 → 0.23.1

package/lib/_chunks/dep-201e7b8c.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-201e7b8c.js","sources":["../../node_modules/@babel/runtime/helpers/esm/classCallCheck.js","../../node_modules/@babel/runtime/helpers/esm/createClass.js","../../node_modules/lodash/uniqueId.js","../../src/_common/js/tree/tree-node.ts"],"sourcesContent":["export default function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}","function _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, descriptor.key, descriptor);\n  }\n}\n\nexport default function _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  Object.defineProperty(Constructor, \"prototype\", {\n    writable: false\n  });\n  return Constructor;\n}","var toString = require('./toString');\n\n/** Used to generate unique IDs. */\nvar idCounter = 0;\n\n/**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\nfunction uniqueId(prefix) {\n  var id = ++idCounter;\n  return toString(prefix) + id;\n}\n\nmodule.exports = uniqueId;\n","import uniqueId from 'lodash/uniqueId';\nimport get from 'lodash/get';\nimport { TreeStore } from './tree-store';\nimport {\n  TreeNodeValue,\n  TreeNodeState,\n  TypeIdMap,\n  TypeTreeItem,\n  TypeSettingOptions,\n  TypeTreeNodeModel,\n  TypeTreeNodeData,\n} from './types';\nimport {\n  createNodeModel,\n  updateNodeModel,\n} from './tree-node-model';\n\nconst { hasOwnProperty } = Object.prototype;\n\nconst defaultStatus = {\n  expandMutex: false,\n  activable: false,\n  checkable: false,\n  disabled: false,\n  draggable: false,\n  loading: false,\n};\n\n// vm 开头为视图属性，不可以外部设置\n// 用于触发视图更新\nexport class TreeNode {\n  // 节点隶属的树实例\n  public tree: TreeStore;\n\n  // 节点 id ，唯一标志\n  public value: string;\n\n  // 节点文本\n  public label: string;\n\n  // 节点数据\n  public data: TypeTreeNodeData;\n\n  // 父节点\n  public parent: TreeNode;\n\n  // 子节点列表\n  public children: TreeNode[] | boolean;\n\n  // 暴露的 treeNodeModel，这个对象的属性和 api 提供给用户使用\n  public model: TypeTreeNodeModel;\n\n  // 是否为叶节点\n  public vmIsLeaf: boolean;\n\n  // 是否为子节点中的第一个\n  public vmIsFirst: boolean;\n\n  // 是否为子节点中的最后\n  public vmIsLast: boolean;\n\n  // 节点是否是经过过滤剩下的\n  public vmIsRest: boolean;\n\n  // 节点是否展示为锁定状态\n  public vmIsLocked: boolean;\n\n  // 节点在视图上实际的展开状态\n  public expanded: boolean;\n\n  // 展开时是否收起同级节点，对子节点生效\n  public expandMutex: boolean;\n\n  // 节点在视图上实际的激活状态\n  public actived: boolean;\n\n  // 是否可激活\n  public activable: boolean;\n\n  // 是否可选中\n  public checkable: boolean;\n\n  // 是否可选中的视图呈现\n  public vmCheckable: boolean;\n\n  // 节点在视图上实际的选中态\n  public checked: boolean;\n\n  // 节点实际是否为半选状态\n  public indeterminate: boolean;\n\n  // 节点是否已禁用\n  public disabled: boolean;\n\n  // 节点是否可拖动\n  public draggable: boolean;\n\n  // 节点是否可视\n  public visible: boolean;\n\n  // 节点在树中的层级\n  public level: number;\n\n  // 节点是否正在加载数据\n  public loading: boolean;\n\n  public constructor(\n    tree: TreeStore,\n    data?: TypeTreeNodeData,\n    parent?: TreeNode,\n  ) {\n    this.data = data;\n    this.tree = tree;\n\n    const config = tree.config || {};\n    const prefix = config.prefix || 't';\n    const keys = get(tree, 'config.keys') || {};\n    const propChildren = keys.children || 'children';\n    const propLabel = keys.label || 'label';\n    const propValue = keys.value || 'value';\n\n    this.model = null;\n    this.children = null;\n    this.vmCheckable = false;\n    this.vmIsLeaf = false;\n    this.vmIsFirst = false;\n    this.vmIsLast = false;\n    this.vmIsRest = true;\n    this.vmIsLocked = false;\n\n    const spec = {\n      ...defaultStatus,\n      actived: false,\n      expanded: false,\n      checked: false,\n      ...data,\n    };\n    const children = spec[propChildren];\n\n    this.set(spec);\n    this.label = spec[propLabel] || '';\n    this.value = spec[propValue] || uniqueId(prefix);\n    this.tree.nodeMap.set(this.value, this);\n\n    if (parent && parent instanceof TreeNode) {\n      this.parent = parent;\n    } else {\n      this.parent = null;\n    }\n\n    // 子节点为 true 的状态逻辑需要放到状态计算之前\n    // 初始化加载逻辑需要依据这个来进行\n    if (children === true) {\n      this.children = children;\n    }\n\n    // 初始化状态计算\n    this.level = 0;\n    this.visible = true;\n\n    this.actived = spec.actived;\n    this.initActived();\n\n    this.expanded = spec.expanded;\n    this.initExpanded();\n\n    this.checked = spec.checked;\n    this.initChecked();\n\n    this.update();\n    tree.reflow(this);\n\n    // 这里的子节点加载逻辑不能放到状态计算之前\n    // 因为子节点状态计算依赖父节点状态\n    if (Array.isArray(children)) {\n      this.append(children);\n    } else if (children === true && !config.lazy) {\n      this.loadChildren();\n    }\n\n    // checked 状态依赖于子节点状态\n    // 因此初始化状态放到子节点插入之后\n    this.checked = false;\n    this.indeterminate = false;\n    this.updateChecked();\n  }\n\n  /* ------ 状态初始化 ------ */\n\n  // 初始化选中态\n  public initChecked() {\n    const { tree, value, parent } = this;\n    const { checkStrictly } = tree.config;\n    let { checked } = this;\n    checked = parent?.isChecked();\n    if (checked && !checkStrictly) {\n      tree.checkedMap.set(value, true);\n    }\n    this.checked = checked;\n  }\n\n  // 初始化节点展开状态\n  public initExpanded(): void {\n    const { tree } = this;\n    let { expanded } = this;\n    const { config } = tree;\n    if (\n      typeof config.expandLevel === 'number'\n      && this.getLevel() < config.expandLevel\n    ) {\n      tree.expandedMap.set(this.value, true);\n      expanded = true;\n    }\n    if (config.expandAll) {\n      expanded = true;\n    }\n    if (this.children === true && config.lazy) {\n      expanded = false;\n    }\n    if (expanded) {\n      tree.expandedMap.set(this.value, true);\n    } else {\n      tree.expandedMap.delete(this.value);\n    }\n    this.expanded = expanded;\n  }\n\n  // 初始化高亮状态\n  public initActived(): void {\n    const { tree, actived } = this;\n    if (actived) {\n      tree.activedMap.set(this.value, true);\n    }\n  }\n\n  /* ------ 节点操作 ------ */\n\n  // 追加数据\n  public append(data: TypeTreeNodeData | TypeTreeNodeData[]): void {\n    const list = [];\n    if (!Array.isArray(data)) {\n      list.push(data);\n    } else {\n      list.push(...data);\n    }\n    if (list.length <= 0) {\n      return;\n    }\n    if (!Array.isArray(this.children)) {\n      this.children = [];\n    }\n    const { children, tree } = this;\n    list.forEach((item) => {\n      let node = null;\n      if (item instanceof TreeNode) {\n        node = item;\n        node.appendTo(this.tree, this);\n      } else {\n        node = new TreeNode(this.tree, item, this);\n        children.push(node);\n      }\n    });\n    tree.reflow(this);\n    this.updateRelated();\n  }\n\n  // 将当前节点追加到某个父节点的子节点列表中\n  public appendTo(\n    tree: TreeStore,\n    parent?: TreeNode,\n    index?: number,\n  ): void {\n    const parentNode = parent;\n    if (!parentNode) return;\n\n    const targetParents = parentNode.getParents();\n    const includeCurrent = targetParents.some((node) => node.value === this.value);\n    if (includeCurrent) {\n      // 不能将父节点插入到子节点\n      return;\n    }\n\n    if (Array.isArray(parentNode.children)) {\n      let targetIndex = 0;\n      if (typeof index === 'number') {\n        targetIndex = index;\n      }\n      const targetPosNode = parentNode.children[targetIndex];\n      if (targetPosNode.value === this.value) {\n        // 无需将节点插入到原位置\n        return;\n      }\n    }\n\n    this.remove();\n    this.parent = parentNode;\n\n    let siblings = null;\n    if (parentNode instanceof TreeNode) {\n      if (!Array.isArray(parentNode.children)) {\n        parentNode.children = [];\n      }\n      siblings = parent.children;\n    } else {\n      siblings = tree.children;\n    }\n    if (Array.isArray(siblings)) {\n      if (typeof index === 'number') {\n        siblings.splice(index, 0, this);\n      } else {\n        siblings.push(this);\n      }\n    }\n\n    // 插入节点应当继承展开状态\n    // 但建议不要继承选中状态和高亮状态\n    const nodes = this.walk();\n    nodes.forEach((item) => {\n      const node = item;\n      node.tree = tree;\n      tree.nodeMap.set(node.value, node);\n      if (node.expanded) {\n        tree.expandedMap.set(node.value, true);\n      }\n    });\n\n    const updateNodes = parentNode.walk();\n    updateNodes.forEach((node) => {\n      node.update();\n      node.updateChecked();\n    });\n\n    tree.reflow();\n  }\n\n  // 插入一个同级节点数据\n  public insert(\n    item: TypeTreeItem,\n    index?: number,\n  ): void {\n    const { tree, parent } = this;\n    const siblings = this.getSiblings();\n    let node = null;\n    if (item instanceof TreeNode) {\n      node = item;\n      node.appendTo(tree, parent, index);\n    } else if (item) {\n      node = new TreeNode(tree, item, parent);\n      if (typeof index === 'number') {\n        siblings.splice(index, 0, node);\n      }\n      siblings.forEach((sibling) => {\n        sibling.update();\n      });\n    }\n    tree.reflow();\n  }\n\n  // 在当前节点之前插入节点\n  public insertBefore(newData: TypeTreeItem): void {\n    const index = this.getIndex();\n    this.insert(newData, index);\n  }\n\n  // 在当前节点之后插入节点\n  public insertAfter(newData: TypeTreeItem): void {\n    const index = this.getIndex();\n    this.insert(newData, index + 1);\n  }\n\n  // 从一个树移除本节点\n  public remove(): void {\n    const { tree } = this;\n\n    const nodes = this.walk();\n    const siblings = this.getSiblings();\n    const index = this.getIndex();\n    // 从父节点的子节点列表中移除自己\n    // 但不要将自己的父节点移除，避免渲染与判断失败\n    if (Array.isArray(siblings)) {\n      siblings.splice(index, 1);\n    }\n    // 清理与树的关系，但不清理自身状态\n    nodes.forEach((node) => {\n      node.clean();\n    });\n    // 同级节点的连线状态会受到影响\n    siblings.forEach((node) => {\n      node.update();\n    });\n    // 父节点选中态会受到影响\n    this.updateParents();\n    tree.reflow();\n  }\n\n  // 清除本节点与一个树的关系\n  public clean(): void {\n    const { tree, value } = this;\n    tree.activedMap.delete(value);\n    tree.checkedMap.delete(value);\n    tree.expandedMap.delete(value);\n    tree.nodeMap.delete(value);\n  }\n\n  // 异步加载子节点数据\n  public async loadChildren(): Promise<void> {\n    const config = get(this, 'tree.config') || {};\n    if (this.children === true && !this.loading) {\n      if (typeof config.load === 'function') {\n        this.loading = true;\n        this.update();\n        let list = [];\n        list = await config.load(this);\n        this.tree.emit('load', {\n          node: this,\n          data: list,\n        });\n        this.loading = false;\n        if (Array.isArray(list) && list.length > 0) {\n          this.append(list);\n        } else {\n          this.children = false;\n        }\n        this.update();\n      }\n    }\n  }\n\n  // 设置状态\n  public set(item: TreeNodeState): void {\n    const { tree } = this;\n    const keys = Object.keys(item);\n    keys.forEach((key) => {\n      if (hasOwnProperty.call(defaultStatus, key) || key === 'label') {\n        this[key] = item[key];\n      }\n    });\n    tree.updated(this);\n  }\n\n  /* ------ 节点获取 ------- */\n\n  // 获取单个父节点\n  public getParent(): TreeNode {\n    return this.parent;\n  }\n\n  // 获取所有父节点\n  public getParents(): TreeNode[] {\n    const parents = [];\n    let node = this.parent;\n    while (node) {\n      parents.push(node);\n      node = node.parent;\n    }\n    return parents;\n  }\n\n  // 获取兄弟节点，包含自己在内\n  public getSiblings(): TreeNode[] {\n    const { parent, tree } = this;\n    let list: TreeNode[] = [];\n    if (parent) {\n      if (Array.isArray(parent.children)) {\n        list = parent.children;\n      }\n    } else if (tree) {\n      list = tree.children;\n    }\n    return list;\n  }\n\n  // 获取根节点\n  public getRoot(): TreeNode {\n    const parents = this.getParents();\n    return parents[parents.length - 1] || null;\n  }\n\n  // 获取节点在父节点的子节点列表中的位置\n  // 如果没有父节点，则获取节点在根节点列表的位置\n  public getIndex(): number {\n    const list = this.getSiblings();\n    return list.indexOf(this);\n  }\n\n  // 返回路径节点\n  public getPath(): TreeNode[] {\n    const nodes = this.getParents();\n    nodes.unshift(this);\n    return nodes.reverse();\n  }\n\n  // 获取节点所在层级\n  public getLevel(): number {\n    const parents = this.getParents();\n    return parents.length;\n  }\n\n  /* ------ 节点状态判断 ------ */\n\n  // 判断节点是否被过滤\n  public isRest(): boolean {\n    const {\n      config,\n      filterMap,\n    } = this.tree;\n\n    let rest = true;\n    if (typeof config.filter === 'function') {\n      const nodeModel = this.getModel();\n      rest = config.filter(nodeModel);\n    }\n\n    if (rest) {\n      filterMap.set(this.value, true);\n    } else if (filterMap.get(this.value)) {\n      filterMap.delete(this.value);\n    }\n\n    return rest;\n  }\n\n  // 判断节点是否可视\n  public isVisible(): boolean {\n    const {\n      nodeMap,\n    } = this.tree;\n\n    let visible = true;\n\n    // 锁定状态，直接呈现\n    if (this.vmIsLocked) {\n      return true;\n    }\n\n    // 在当前树上，未被移除\n    if (nodeMap.get(this.value)) {\n      // 节点未被过滤\n      const filterVisible = this.isRest();\n\n      // 所有父节点展开\n      let expandVisible = true;\n      const parents = this.getParents();\n      if (parents.length > 0) {\n        expandVisible = parents.every((node: TreeNode) => node.isExpanded());\n      }\n\n      // 节点为未被过滤节点的父节点\n      visible = expandVisible && filterVisible;\n    } else {\n      visible = false;\n    }\n    return visible;\n  }\n\n  // 判断节点是否被禁用\n  public isDisabled() {\n    if (this.vmIsLocked) return true;\n    const treeDisabled = get(this, 'tree.config.disabled');\n    return !!(treeDisabled || this.disabled);\n  }\n\n  // 判断节点是否支持互斥展开\n  public isExpandMutex() {\n    return !!(get(this, 'tree.config.expandMutex') || this.expandMutex);\n  }\n\n  // 节点可高亮\n  public isActivable() {\n    return !!(get(this, 'tree.config.activable') || this.activable);\n  }\n\n  // 是否可选\n  public isCheckable() {\n    return !!(get(this, 'tree.config.checkable') || this.checkable);\n  }\n\n  // 检查节点是否被激活\n  public isActived(map?: Map<string, boolean>): boolean {\n    const { tree, value } = this;\n    const activedMap = map || tree.activedMap;\n    return !!(tree.nodeMap.get(value) && activedMap.get(value));\n  }\n\n  // 检查节点是否已展开\n  public isExpanded(map?: Map<string, boolean>): boolean {\n    const { tree, value, vmIsLocked } = this;\n    if (vmIsLocked) return true;\n    const expandedMap = map || tree.expandedMap;\n    return !!(tree.nodeMap.get(value) && expandedMap.get(value));\n  }\n\n  // 计算属性，判断节点是否被选中\n  // map: 预期选中项map，用于计算节点在预期环境中的选中态\n  public isChecked(map?: TypeIdMap): boolean {\n    const { children, tree } = this;\n    const { checkStrictly } = tree.config;\n    let checked = false;\n    const checkedMap = map || tree.checkedMap;\n    if (tree.nodeMap.get(this.value)) {\n      if (checkedMap.get(this.value)) {\n        // 如果在 checked 节点列表中，则直接为 true\n        checked = true;\n      } else if (\n        Array.isArray(children)\n        && children.length > 0\n        && !checkStrictly\n      ) {\n        // 如果是父节点，需检查所有子节点状态\n        checked = children.every((node) => {\n          const childIsChecked = node.isChecked(checkedMap);\n          return childIsChecked;\n        });\n      } else if (!checkStrictly) {\n        // 从父节点状态推断子节点状态\n        // 这里再调用 isChecked 会导致死循环\n        const parents = this.getParents();\n        checked = parents.some((node) => checkedMap.get(node.value));\n      }\n    }\n    return !!checked;\n  }\n\n  // 是否为半选状态\n  public isIndeterminate(): boolean {\n    const { children, tree } = this;\n    const { checkStrictly } = tree.config;\n    if (checkStrictly) {\n      return false;\n    }\n    let indeterminate = false;\n    if (Array.isArray(children)) {\n      // 叶节点不存在半选状态\n      let childChecked: null | boolean = null;\n      indeterminate = children.some((node: TreeNode) => {\n        if (node.isIndeterminate()) {\n          // 子节点有任意一个半选，则其为半选状态\n          return true;\n        }\n        if (childChecked === null) {\n          childChecked = node.isChecked();\n        }\n        if (childChecked !== node.isChecked()) {\n          // 子节点选中状态不一致，则其为半选状态\n          return true;\n        }\n        return false;\n      });\n    }\n    return indeterminate;\n  }\n\n  public isFirst(): boolean {\n    const siblings = this.getSiblings();\n    return siblings[0] === this;\n  }\n\n  public isLast(): boolean {\n    const siblings = this.getSiblings();\n    return siblings[siblings.length - 1] === this;\n  }\n\n  // 是叶节点\n  public isLeaf(): boolean {\n    let isLeaf = false;\n    if (Array.isArray(this.children)) {\n      isLeaf = this.children.length <= 0;\n    } else {\n      isLeaf = !this.children;\n    }\n    return isLeaf;\n  }\n\n  /* ------ 节点状态切换 ------ */\n\n  // 锁定节点\n  // 搜索过滤节点时，路径节点需要固定呈现，视其为锁定态\n  public lock(lockState: boolean): void {\n    this.vmIsLocked = lockState;\n    this.expanded = this.isExpanded();\n    this.visible = this.isVisible();\n  }\n\n  // 节点展开关闭后需要调用的状态检查函数\n  public afterExpanded(): void {\n    this.update();\n    // 节点展开时检查延迟加载的数据\n    if (this.expanded && this.children === true) {\n      this.loadChildren();\n    }\n  }\n\n  // 展开或者关闭节点\n  public toggleExpanded(): TreeNodeValue[] {\n    return this.setExpanded(!this.isExpanded());\n  }\n\n  // 设置节点展开状态\n  public setExpanded(expanded: boolean, opts?: TypeSettingOptions): TreeNodeValue[] {\n    const { tree } = this;\n    const options = {\n      directly: false,\n      ...opts,\n    };\n\n    let map = tree.expandedMap;\n    if (!options.directly) {\n      map = new Map(tree.expandedMap);\n    }\n\n    // 手风琴效果，先折叠同级节点\n    if (expanded) {\n      const shouldExpandNodes = [];\n      shouldExpandNodes.push(this);\n      if (get(tree, 'config.expandParent')) {\n        this.getParents().forEach((node) => {\n          shouldExpandNodes.push(node);\n        });\n      }\n      shouldExpandNodes.forEach((node) => {\n        let isExpandMutex = false;\n        if (node.parent) {\n          isExpandMutex = node.parent.isExpandMutex();\n        } else {\n          isExpandMutex = tree?.config?.expandMutex;\n        }\n        if (isExpandMutex) {\n          const siblings = node.getSiblings();\n          siblings.forEach((snode) => {\n            map.delete(snode.value);\n          });\n        }\n        map.set(node.value, true);\n      });\n    } else {\n      map.delete(this.value);\n    }\n\n    if (options.directly) {\n      this.afterExpanded();\n      this.update();\n      this.updateChildren();\n    }\n\n    return tree.getExpanded(map);\n  }\n\n  // 切换节点激活态\n  public toggleActived(): TreeNodeValue[] {\n    return this.setActived(!this.isActived());\n  }\n\n  // 设置节点激活态\n  public setActived(actived: boolean, opts?: TypeSettingOptions): TreeNodeValue[] {\n    const { tree } = this;\n    const options = {\n      directly: false,\n      ...opts,\n    };\n    const config = tree.config || {};\n    let map = tree.activedMap;\n    if (!options.directly) {\n      map = new Map(tree.activedMap);\n    }\n    if (this.isActivable()) {\n      if (actived) {\n        if (!config.activeMultiple) {\n          map.clear();\n        }\n        map.set(this.value, true);\n      } else {\n        map.delete(this.value);\n      }\n    }\n    if (options.directly) {\n      this.update();\n    }\n    return tree.getActived(map);\n  }\n\n  // 切换选中态\n  public toggleChecked(): TreeNodeValue[] {\n    return this.setChecked(!this.isChecked());\n  }\n\n  // 更新单个节点的选中态\n  // 返回树选中列表\n  public setChecked(checked: boolean, opts?: TypeSettingOptions): TreeNodeValue[] {\n    const { tree } = this;\n    const config = tree.config || {};\n    const options = {\n      directly: false,\n      ...opts,\n    };\n    let map = tree.checkedMap;\n    if (!options.directly) {\n      map = new Map(tree.checkedMap);\n    }\n    if (this.isCheckable() && checked !== this.isChecked()) {\n      if (config.checkStrictly) {\n        if (checked) {\n          map.set(this.value, true);\n        } else {\n          map.delete(this.value);\n        }\n      } else {\n        const children = this.walk();\n        // 子节点的预期选中态与当前节点同步\n        children.forEach((node) => {\n          if (checked) {\n            map.set(node.value, true);\n          } else {\n            map.delete(node.value);\n          }\n        });\n        // 消除全部父节点的预期选中态\n        // 父节点的预期选中态将通过计算得出\n        const parents = this.getParents();\n        parents.forEach((node) => {\n          map.delete(node.value);\n        });\n      }\n    }\n    if (options.directly) {\n      if (config.checkStrictly) {\n        this.updateChecked();\n      } else {\n        const relatedNodes = tree.getRelatedNodes([this.value]);\n        relatedNodes.forEach((node) => {\n          node.updateChecked();\n        });\n      }\n    }\n    return tree.getChecked(map);\n  }\n\n  /* ------ 节点状态更新 ------ */\n\n  // 更新节点状态\n  public update(): void {\n    this.level = this.getLevel();\n    this.actived = this.isActived();\n    this.expanded = this.isExpanded();\n    this.vmCheckable = this.isCheckable();\n    this.visible = this.isVisible();\n    this.vmIsRest = this.isRest();\n    this.vmIsFirst = this.isFirst();\n    this.vmIsLast = this.isLast();\n    this.vmIsLeaf = this.isLeaf();\n    this.tree.updated(this);\n  }\n\n  // 更新选中态属性值\n  public updateChecked(): void {\n    const { tree } = this;\n    this.vmCheckable = this.isCheckable();\n    if (this.vmCheckable && !this.disabled) {\n      this.checked = this.isChecked();\n      if (this.checked) {\n        tree.checkedMap.set(this.value, true);\n      }\n      this.indeterminate = this.isIndeterminate();\n      tree.updated(this);\n    }\n  }\n\n  // 更新所有子节点状态\n  // 注意:不包含自己\n  public updateChildren(): void {\n    const { children } = this;\n    if (Array.isArray(children)) {\n      children.forEach((node) => {\n        node.update();\n        node.updateChecked();\n        node.updateChildren();\n      });\n    }\n  }\n\n  // 父节点状态更新\n  // 注意:不包含自己\n  public updateParents(): void {\n    const { parent } = this;\n    if (parent) {\n      parent.update();\n      parent.updateChecked();\n      parent.updateParents();\n    }\n  }\n\n  // 更新上下游相关节点\n  public updateRelated() {\n    const { tree } = this;\n    const relatedNodes = tree.getRelatedNodes([this.value]);\n    relatedNodes.forEach((node) => {\n      node.update();\n      node.updateChecked();\n    });\n    tree.reflow();\n  }\n\n  /* ------ 节点遍历 ------ */\n\n  // 获取包含自己在内所有的子节点\n  public walk(): TreeNode[] {\n    const { children } = this;\n    let list: TreeNode[] = [];\n    list.push(this);\n    if (Array.isArray(children) && children.length > 0) {\n      children.forEach((node) => {\n        list = list.concat(node.walk());\n      });\n    }\n    return list;\n  }\n\n  // TreeNode 对象 => TypeTreeNodeModel 对象\n  // 用于 treeNode 对外暴露的 api\n  // 经过封装的对象，减少了对外暴露的 api，利于代码重构\n  public getModel(): TypeTreeNodeModel {\n    let { model } = this;\n    if (!model) {\n      model = createNodeModel(this);\n      this.model = model;\n    }\n    updateNodeModel(model, this);\n    return model;\n  }\n}\n\nexport default TreeNode;\n"],"names":["_classCallCheck","instance","Constructor","TypeError","_defineProperties","target","props","i","length","descriptor","enumerable","configurable","writable","Object","defineProperty","key","_createClass","protoProps","staticProps","prototype","toString","require$$0","idCounter","uniqueId","prefix","id","uniqueId_1","hasOwnProperty","defaultStatus","expandMutex","activable","checkable","disabled","draggable","loading","TreeNode","tree","data","parent","config","keys","get","propChildren","children","propLabel","label","propValue","value","model","vmCheckable","vmIsLeaf","vmIsFirst","vmIsLast","vmIsRest","vmIsLocked","spec","actived","expanded","checked","set","nodeMap","level","visible","initActived","initExpanded","initChecked","update","reflow","Array","isArray","append","lazy","loadChildren","indeterminate","updateChecked","checkStrictly","isChecked","checkedMap","expandLevel","getLevel","expandedMap","expandAll","activedMap","list","push","forEach","item","node","appendTo","updateRelated","index","parentNode","targetParents","getParents","includeCurrent","some","targetIndex","targetPosNode","remove","siblings","splice","nodes","walk","updateNodes","getSiblings","sibling","newData","getIndex","insert","clean","updateParents","load","emit","call","updated","parents","indexOf","unshift","reverse","filterMap","rest","filter","nodeModel","getModel","filterVisible","isRest","expandVisible","every","isExpanded","treeDisabled","map","childIsChecked","childChecked","isIndeterminate","isLeaf","lockState","isVisible","setExpanded","opts","options","directly","Map","shouldExpandNodes","isExpandMutex","snode","afterExpanded","updateChildren","getExpanded","setActived","isActived","isActivable","activeMultiple","clear","getActived","setChecked","isCheckable","relatedNodes","getRelatedNodes","getChecked","isFirst","isLast","concat","createNodeModel","updateNodeModel"],"mappings":";;;;;;;;;;;;;;;AAAe,SAASA,eAAT,CAAyBC,QAAzB,EAAmCC,WAAnC,EAAgD;AAC7D,MAAI,EAAED,QAAQ,YAAYC,WAAtB,CAAJ,EAAwC;AACtC,UAAM,IAAIC,SAAJ,CAAc,mCAAd,CAAN;AACD;AACF;;ACJD,SAASC,iBAAT,CAA2BC,MAA3B,EAAmCC,KAAnC,EAA0C;AACxC,OAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGD,KAAK,CAACE,MAA1B,EAAkCD,CAAC,EAAnC,EAAuC;AACrC,QAAIE,UAAU,GAAGH,KAAK,CAACC,CAAD,CAAtB;AACAE,IAAAA,UAAU,CAACC,UAAX,GAAwBD,UAAU,CAACC,UAAX,IAAyB,KAAjD;AACAD,IAAAA,UAAU,CAACE,YAAX,GAA0B,IAA1B;AACA,QAAI,WAAWF,UAAf,EAA2BA,UAAU,CAACG,QAAX,GAAsB,IAAtB;AAC3BC,IAAAA,MAAM,CAACC,cAAP,CAAsBT,MAAtB,EAA8BI,UAAU,CAACM,GAAzC,EAA8CN,UAA9C;AACD;AACF;;AAEc,SAASO,YAAT,CAAsBd,WAAtB,EAAmCe,UAAnC,EAA+CC,WAA/C,EAA4D;AACzE,MAAID,UAAJ,EAAgBb,iBAAiB,CAACF,WAAW,CAACiB,SAAb,EAAwBF,UAAxB,CAAjB;AAChB,MAAIC,WAAJ,EAAiBd,iBAAiB,CAACF,WAAD,EAAcgB,WAAd,CAAjB;AACjBL,EAAAA,MAAM,CAACC,cAAP,CAAsBZ,WAAtB,EAAmC,WAAnC,EAAgD;AAC9CU,IAAAA,QAAQ,EAAE;AADoC,GAAhD;AAGA,SAAOV,WAAP;AACD;;ACjBD,IAAIkB,QAAQ,GAAGC,qBAAf;AAEA;;AACA,IAAIC,SAAS,GAAG,CAAhB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAkBC,MAAlB,EAA0B;AACxB,MAAIC,EAAE,GAAG,EAAEH,SAAX;AACA,SAAOF,QAAQ,CAACI,MAAD,CAAR,GAAmBC,EAA1B;AACD;;IAEDC,UAAc,GAAGH;;;;;ACrBjB,IAAQI,cAAR,GAA2Bd,MAAM,CAACM,SAAlC,CAAQQ,cAAR;AACA,IAAMC,aAAa,GAAG;AACpBC,EAAAA,WAAW,EAAE,KADO;AAEpBC,EAAAA,SAAS,EAAE,KAFS;AAGpBC,EAAAA,SAAS,EAAE,KAHS;AAIpBC,EAAAA,QAAQ,EAAE,KAJU;AAKpBC,EAAAA,SAAS,EAAE,KALS;AAMpBC,EAAAA,OAAO,EAAE;AANW,CAAtB;IAQaC,QAAb;AA0BE,oBAAYC,IAAZ,EAAkBC,IAAlB,EAAwBC,MAAxB,EAAgC;AAAA;;AAC9B,SAAKD,IAAL,GAAYA,IAAZ;AACA,SAAKD,IAAL,GAAYA,IAAZ;AACA,QAAMG,MAAM,GAAGH,IAAI,CAACG,MAAL,IAAe,EAA9B;AACA,QAAMf,MAAM,GAAGe,MAAM,CAACf,MAAP,IAAiB,GAAhC;AACA,QAAMgB,IAAI,GAAGC,SAAG,CAACL,IAAD,EAAO,aAAP,CAAH,IAA4B,EAAzC;AACA,QAAMM,YAAY,GAAGF,IAAI,CAACG,QAAL,IAAiB,UAAtC;AACA,QAAMC,SAAS,GAAGJ,IAAI,CAACK,KAAL,IAAc,OAAhC;AACA,QAAMC,SAAS,GAAGN,IAAI,CAACO,KAAL,IAAc,OAAhC;AACA,SAAKC,KAAL,GAAa,IAAb;AACA,SAAKL,QAAL,GAAgB,IAAhB;AACA,SAAKM,WAAL,GAAmB,KAAnB;AACA,SAAKC,QAAL,GAAgB,KAAhB;AACA,SAAKC,SAAL,GAAiB,KAAjB;AACA,SAAKC,QAAL,GAAgB,KAAhB;AACA,SAAKC,QAAL,GAAgB,IAAhB;AACA,SAAKC,UAAL,GAAkB,KAAlB;;AACA,QAAMC,IAAI,mCACL3B,aADK;AAER4B,MAAAA,OAAO,EAAE,KAFD;AAGRC,MAAAA,QAAQ,EAAE,KAHF;AAIRC,MAAAA,OAAO,EAAE;AAJD,OAKLrB,IALK,CAAV;;AAOA,QAAMM,QAAQ,GAAGY,IAAI,CAACb,YAAD,CAArB;AACA,SAAKiB,GAAL,CAASJ,IAAT;AACA,SAAKV,KAAL,GAAaU,IAAI,CAACX,SAAD,CAAJ,IAAmB,EAAhC;AACA,SAAKG,KAAL,GAAaQ,IAAI,CAACT,SAAD,CAAJ,IAAmBvB,UAAQ,CAACC,MAAD,CAAxC;AACA,SAAKY,IAAL,CAAUwB,OAAV,CAAkBD,GAAlB,CAAsB,KAAKZ,KAA3B,EAAkC,IAAlC;;AACA,QAAIT,MAAM,IAAIA,MAAM,YAAYH,QAAhC,EAA0C;AACxC,WAAKG,MAAL,GAAcA,MAAd;AACD,KAFD,MAEO;AACL,WAAKA,MAAL,GAAc,IAAd;AACD;;AACD,QAAIK,QAAQ,KAAK,IAAjB,EAAuB;AACrB,WAAKA,QAAL,GAAgBA,QAAhB;AACD;;AACD,SAAKkB,KAAL,GAAa,CAAb;AACA,SAAKC,OAAL,GAAe,IAAf;AACA,SAAKN,OAAL,GAAeD,IAAI,CAACC,OAApB;AACA,SAAKO,WAAL;AACA,SAAKN,QAAL,GAAgBF,IAAI,CAACE,QAArB;AACA,SAAKO,YAAL;AACA,SAAKN,OAAL,GAAeH,IAAI,CAACG,OAApB;AACA,SAAKO,WAAL;AACA,SAAKC,MAAL;AACA9B,IAAAA,IAAI,CAAC+B,MAAL,CAAY,IAAZ;;AACA,QAAIC,KAAK,CAACC,OAAN,CAAc1B,QAAd,CAAJ,EAA6B;AAC3B,WAAK2B,MAAL,CAAY3B,QAAZ;AACD,KAFD,MAEO,IAAIA,QAAQ,KAAK,IAAb,IAAqB,CAACJ,MAAM,CAACgC,IAAjC,EAAuC;AAC5C,WAAKC,YAAL;AACD;;AACD,SAAKd,OAAL,GAAe,KAAf;AACA,SAAKe,aAAL,GAAqB,KAArB;AACA,SAAKC,aAAL;AACD;;AAjFH;AAAA;AAAA,WAkFE,uBAAc;AACZ,UAAQtC,IAAR,GAAgC,IAAhC,CAAQA,IAAR;AAAA,UAAcW,KAAd,GAAgC,IAAhC,CAAcA,KAAd;AAAA,UAAqBT,MAArB,GAAgC,IAAhC,CAAqBA,MAArB;AACA,UAAQqC,aAAR,GAA0BvC,IAAI,CAACG,MAA/B,CAAQoC,aAAR;AACA,UAAMjB,OAAN,GAAkB,IAAlB,CAAMA,OAAN;AACAA,MAAAA,OAAO,GAAGpB,MAAH,aAAGA,MAAH,uBAAGA,MAAM,CAAEsC,SAAR,EAAV;;AACA,UAAIlB,OAAO,IAAI,CAACiB,aAAhB,EAA+B;AAC7BvC,QAAAA,IAAI,CAACyC,UAAL,CAAgBlB,GAAhB,CAAoBZ,KAApB,EAA2B,IAA3B;AACD;;AACD,WAAKW,OAAL,GAAeA,OAAf;AACD;AA3FH;AAAA;AAAA,WA4FE,wBAAe;AACb,UAAQtB,IAAR,GAAiB,IAAjB,CAAQA,IAAR;AACA,UAAMqB,QAAN,GAAmB,IAAnB,CAAMA,QAAN;AACA,UAAQlB,MAAR,GAAmBH,IAAnB,CAAQG,MAAR;;AACA,UAAI,OAAOA,MAAM,CAACuC,WAAd,KAA8B,QAA9B,IAA0C,KAAKC,QAAL,KAAkBxC,MAAM,CAACuC,WAAvE,EAAoF;AAClF1C,QAAAA,IAAI,CAAC4C,WAAL,CAAiBrB,GAAjB,CAAqB,KAAKZ,KAA1B,EAAiC,IAAjC;AACAU,QAAAA,QAAQ,GAAG,IAAX;AACD;;AACD,UAAIlB,MAAM,CAAC0C,SAAX,EAAsB;AACpBxB,QAAAA,QAAQ,GAAG,IAAX;AACD;;AACD,UAAI,KAAKd,QAAL,KAAkB,IAAlB,IAA0BJ,MAAM,CAACgC,IAArC,EAA2C;AACzCd,QAAAA,QAAQ,GAAG,KAAX;AACD;;AACD,UAAIA,QAAJ,EAAc;AACZrB,QAAAA,IAAI,CAAC4C,WAAL,CAAiBrB,GAAjB,CAAqB,KAAKZ,KAA1B,EAAiC,IAAjC;AACD,OAFD,MAEO;AACLX,QAAAA,IAAI,CAAC4C,WAAL,WAAwB,KAAKjC,KAA7B;AACD;;AACD,WAAKU,QAAL,GAAgBA,QAAhB;AACD;AAhHH;AAAA;AAAA,WAiHE,uBAAc;AACZ,UAAQrB,IAAR,GAA0B,IAA1B,CAAQA,IAAR;AAAA,UAAcoB,OAAd,GAA0B,IAA1B,CAAcA,OAAd;;AACA,UAAIA,OAAJ,EAAa;AACXpB,QAAAA,IAAI,CAAC8C,UAAL,CAAgBvB,GAAhB,CAAoB,KAAKZ,KAAzB,EAAgC,IAAhC;AACD;AACF;AAtHH;AAAA;AAAA,WAuHE,gBAAOV,IAAP,EAAa;AAAA;;AACX,UAAM8C,IAAI,GAAG,EAAb;;AACA,UAAI,CAACf,KAAK,CAACC,OAAN,CAAchC,IAAd,CAAL,EAA0B;AACxB8C,QAAAA,IAAI,CAACC,IAAL,CAAU/C,IAAV;AACD,OAFD,MAEO;AACL8C,QAAAA,IAAI,CAACC,IAAL,OAAAD,IAAI,uCAAS9C,IAAT,EAAJ;AACD;;AACD,UAAI8C,IAAI,CAAC3E,MAAL,IAAe,CAAnB,EAAsB;AACpB;AACD;;AACD,UAAI,CAAC4D,KAAK,CAACC,OAAN,CAAc,KAAK1B,QAAnB,CAAL,EAAmC;AACjC,aAAKA,QAAL,GAAgB,EAAhB;AACD;;AACD,UAAQA,QAAR,GAA2B,IAA3B,CAAQA,QAAR;AAAA,UAAkBP,IAAlB,GAA2B,IAA3B,CAAkBA,IAAlB;AACA+C,MAAAA,IAAI,CAACE,OAAL,CAAa,UAACC,IAAD,EAAU;AACrB,YAAIC,IAAI,GAAG,IAAX;;AACA,YAAID,IAAI,YAAYnD,QAApB,EAA8B;AAC5BoD,UAAAA,IAAI,GAAGD,IAAP;AACAC,UAAAA,IAAI,CAACC,QAAL,CAAc,KAAI,CAACpD,IAAnB,EAAyB,KAAzB;AACD,SAHD,MAGO;AACLmD,UAAAA,IAAI,GAAG,IAAIpD,QAAJ,CAAa,KAAI,CAACC,IAAlB,EAAwBkD,IAAxB,EAA8B,KAA9B,CAAP;AACA3C,UAAAA,QAAQ,CAACyC,IAAT,CAAcG,IAAd;AACD;AACF,OATD;AAUAnD,MAAAA,IAAI,CAAC+B,MAAL,CAAY,IAAZ;AACA,WAAKsB,aAAL;AACD;AAjJH;AAAA;AAAA,WAkJE,kBAASrD,IAAT,EAAeE,MAAf,EAAuBoD,KAAvB,EAA8B;AAAA;;AAC5B,UAAMC,UAAU,GAAGrD,MAAnB;AACA,UAAI,CAACqD,UAAL,EACE;AACF,UAAMC,aAAa,GAAGD,UAAU,CAACE,UAAX,EAAtB;AACA,UAAMC,cAAc,GAAGF,aAAa,CAACG,IAAd,CAAmB,UAACR,IAAD;AAAA,eAAUA,IAAI,CAACxC,KAAL,KAAe,MAAI,CAACA,KAA9B;AAAA,OAAnB,CAAvB;;AACA,UAAI+C,cAAJ,EAAoB;AAClB;AACD;;AACD,UAAI1B,KAAK,CAACC,OAAN,CAAcsB,UAAU,CAAChD,QAAzB,CAAJ,EAAwC;AACtC,YAAIqD,WAAW,GAAG,CAAlB;;AACA,YAAI,OAAON,KAAP,KAAiB,QAArB,EAA+B;AAC7BM,UAAAA,WAAW,GAAGN,KAAd;AACD;;AACD,YAAMO,aAAa,GAAGN,UAAU,CAAChD,QAAX,CAAoBqD,WAApB,CAAtB;;AACA,YAAIC,aAAa,CAAClD,KAAd,KAAwB,KAAKA,KAAjC,EAAwC;AACtC;AACD;AACF;;AACD,WAAKmD,MAAL;AACA,WAAK5D,MAAL,GAAcqD,UAAd;AACA,UAAIQ,QAAQ,GAAG,IAAf;;AACA,UAAIR,UAAU,YAAYxD,QAA1B,EAAoC;AAClC,YAAI,CAACiC,KAAK,CAACC,OAAN,CAAcsB,UAAU,CAAChD,QAAzB,CAAL,EAAyC;AACvCgD,UAAAA,UAAU,CAAChD,QAAX,GAAsB,EAAtB;AACD;;AACDwD,QAAAA,QAAQ,GAAG7D,MAAM,CAACK,QAAlB;AACD,OALD,MAKO;AACLwD,QAAAA,QAAQ,GAAG/D,IAAI,CAACO,QAAhB;AACD;;AACD,UAAIyB,KAAK,CAACC,OAAN,CAAc8B,QAAd,CAAJ,EAA6B;AAC3B,YAAI,OAAOT,KAAP,KAAiB,QAArB,EAA+B;AAC7BS,UAAAA,QAAQ,CAACC,MAAT,CAAgBV,KAAhB,EAAuB,CAAvB,EAA0B,IAA1B;AACD,SAFD,MAEO;AACLS,UAAAA,QAAQ,CAACf,IAAT,CAAc,IAAd;AACD;AACF;;AACD,UAAMiB,KAAK,GAAG,KAAKC,IAAL,EAAd;AACAD,MAAAA,KAAK,CAAChB,OAAN,CAAc,UAACC,IAAD,EAAU;AACtB,YAAMC,IAAI,GAAGD,IAAb;AACAC,QAAAA,IAAI,CAACnD,IAAL,GAAYA,IAAZ;AACAA,QAAAA,IAAI,CAACwB,OAAL,CAAaD,GAAb,CAAiB4B,IAAI,CAACxC,KAAtB,EAA6BwC,IAA7B;;AACA,YAAIA,IAAI,CAAC9B,QAAT,EAAmB;AACjBrB,UAAAA,IAAI,CAAC4C,WAAL,CAAiBrB,GAAjB,CAAqB4B,IAAI,CAACxC,KAA1B,EAAiC,IAAjC;AACD;AACF,OAPD;AAQA,UAAMwD,WAAW,GAAGZ,UAAU,CAACW,IAAX,EAApB;AACAC,MAAAA,WAAW,CAAClB,OAAZ,CAAoB,UAACE,IAAD,EAAU;AAC5BA,QAAAA,IAAI,CAACrB,MAAL;AACAqB,QAAAA,IAAI,CAACb,aAAL;AACD,OAHD;AAIAtC,MAAAA,IAAI,CAAC+B,MAAL;AACD;AAtMH;AAAA;AAAA,WAuME,gBAAOmB,IAAP,EAAaI,KAAb,EAAoB;AAClB,UAAQtD,IAAR,GAAyB,IAAzB,CAAQA,IAAR;AAAA,UAAcE,MAAd,GAAyB,IAAzB,CAAcA,MAAd;AACA,UAAM6D,QAAQ,GAAG,KAAKK,WAAL,EAAjB;AACA,UAAIjB,IAAI,GAAG,IAAX;;AACA,UAAID,IAAI,YAAYnD,QAApB,EAA8B;AAC5BoD,QAAAA,IAAI,GAAGD,IAAP;AACAC,QAAAA,IAAI,CAACC,QAAL,CAAcpD,IAAd,EAAoBE,MAApB,EAA4BoD,KAA5B;AACD,OAHD,MAGO,IAAIJ,IAAJ,EAAU;AACfC,QAAAA,IAAI,GAAG,IAAIpD,QAAJ,CAAaC,IAAb,EAAmBkD,IAAnB,EAAyBhD,MAAzB,CAAP;;AACA,YAAI,OAAOoD,KAAP,KAAiB,QAArB,EAA+B;AAC7BS,UAAAA,QAAQ,CAACC,MAAT,CAAgBV,KAAhB,EAAuB,CAAvB,EAA0BH,IAA1B;AACD;;AACDY,QAAAA,QAAQ,CAACd,OAAT,CAAiB,UAACoB,OAAD,EAAa;AAC5BA,UAAAA,OAAO,CAACvC,MAAR;AACD,SAFD;AAGD;;AACD9B,MAAAA,IAAI,CAAC+B,MAAL;AACD;AAxNH;AAAA;AAAA,WAyNE,sBAAauC,OAAb,EAAsB;AACpB,UAAMhB,KAAK,GAAG,KAAKiB,QAAL,EAAd;AACA,WAAKC,MAAL,CAAYF,OAAZ,EAAqBhB,KAArB;AACD;AA5NH;AAAA;AAAA,WA6NE,qBAAYgB,OAAZ,EAAqB;AACnB,UAAMhB,KAAK,GAAG,KAAKiB,QAAL,EAAd;AACA,WAAKC,MAAL,CAAYF,OAAZ,EAAqBhB,KAAK,GAAG,CAA7B;AACD;AAhOH;AAAA;AAAA,WAiOE,kBAAS;AACP,UAAQtD,IAAR,GAAiB,IAAjB,CAAQA,IAAR;AACA,UAAMiE,KAAK,GAAG,KAAKC,IAAL,EAAd;AACA,UAAMH,QAAQ,GAAG,KAAKK,WAAL,EAAjB;AACA,UAAMd,KAAK,GAAG,KAAKiB,QAAL,EAAd;;AACA,UAAIvC,KAAK,CAACC,OAAN,CAAc8B,QAAd,CAAJ,EAA6B;AAC3BA,QAAAA,QAAQ,CAACC,MAAT,CAAgBV,KAAhB,EAAuB,CAAvB;AACD;;AACDW,MAAAA,KAAK,CAAChB,OAAN,CAAc,UAACE,IAAD,EAAU;AACtBA,QAAAA,IAAI,CAACsB,KAAL;AACD,OAFD;AAGAV,MAAAA,QAAQ,CAACd,OAAT,CAAiB,UAACE,IAAD,EAAU;AACzBA,QAAAA,IAAI,CAACrB,MAAL;AACD,OAFD;AAGA,WAAK4C,aAAL;AACA1E,MAAAA,IAAI,CAAC+B,MAAL;AACD;AAjPH;AAAA;AAAA,WAkPE,iBAAQ;AACN,UAAQ/B,IAAR,GAAwB,IAAxB,CAAQA,IAAR;AAAA,UAAcW,KAAd,GAAwB,IAAxB,CAAcA,KAAd;AACAX,MAAAA,IAAI,CAAC8C,UAAL,WAAuBnC,KAAvB;AACAX,MAAAA,IAAI,CAACyC,UAAL,WAAuB9B,KAAvB;AACAX,MAAAA,IAAI,CAAC4C,WAAL,WAAwBjC,KAAxB;AACAX,MAAAA,IAAI,CAACwB,OAAL,WAAoBb,KAApB;AACD;AAxPH;AAAA;AAAA;AAAA,uFAyPE;AAAA;AAAA;AAAA;AAAA;AAAA;AACQR,gBAAAA,MADR,GACiBE,SAAG,CAAC,IAAD,EAAO,aAAP,CAAH,IAA4B,EAD7C;;AAAA,sBAEM,KAAKE,QAAL,KAAkB,IAAlB,IAA0B,CAAC,KAAKT,OAFtC;AAAA;AAAA;AAAA;;AAAA,sBAGQ,OAAOK,MAAM,CAACwE,IAAd,KAAuB,UAH/B;AAAA;AAAA;AAAA;;AAIM,qBAAK7E,OAAL,GAAe,IAAf;AACA,qBAAKgC,MAAL;AACIiB,gBAAAA,IANV,GAMiB,EANjB;AAAA;AAAA,uBAOmB5C,MAAM,CAACwE,IAAP,CAAY,IAAZ,CAPnB;;AAAA;AAOM5B,gBAAAA,IAPN;AAQM,qBAAK/C,IAAL,CAAU4E,IAAV,CAAe,MAAf,EAAuB;AACrBzB,kBAAAA,IAAI,EAAE,IADe;AAErBlD,kBAAAA,IAAI,EAAE8C;AAFe,iBAAvB;AAIA,qBAAKjD,OAAL,GAAe,KAAf;;AACA,oBAAIkC,KAAK,CAACC,OAAN,CAAcc,IAAd,KAAuBA,IAAI,CAAC3E,MAAL,GAAc,CAAzC,EAA4C;AAC1C,uBAAK8D,MAAL,CAAYa,IAAZ;AACD,iBAFD,MAEO;AACL,uBAAKxC,QAAL,GAAgB,KAAhB;AACD;;AACD,qBAAKuB,MAAL;;AAlBN;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAzPF;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA,WA+QE,aAAIoB,IAAJ,EAAU;AAAA;;AACR,UAAQlD,IAAR,GAAiB,IAAjB,CAAQA,IAAR;AACA,UAAMI,IAAI,GAAG3B,MAAM,CAAC2B,IAAP,CAAY8C,IAAZ,CAAb;AACA9C,MAAAA,IAAI,CAAC6C,OAAL,CAAa,UAACtE,GAAD,EAAS;AACpB,YAAIY,cAAc,CAACsF,IAAf,CAAoBrF,aAApB,EAAmCb,GAAnC,KAA2CA,GAAG,KAAK,OAAvD,EAAgE;AAC9D,UAAA,MAAI,CAACA,GAAD,CAAJ,GAAYuE,IAAI,CAACvE,GAAD,CAAhB;AACD;AACF,OAJD;AAKAqB,MAAAA,IAAI,CAAC8E,OAAL,CAAa,IAAb;AACD;AAxRH;AAAA;AAAA,WAyRE,qBAAY;AACV,aAAO,KAAK5E,MAAZ;AACD;AA3RH;AAAA;AAAA,WA4RE,sBAAa;AACX,UAAM6E,OAAO,GAAG,EAAhB;AACA,UAAI5B,IAAI,GAAG,KAAKjD,MAAhB;;AACA,aAAOiD,IAAP,EAAa;AACX4B,QAAAA,OAAO,CAAC/B,IAAR,CAAaG,IAAb;AACAA,QAAAA,IAAI,GAAGA,IAAI,CAACjD,MAAZ;AACD;;AACD,aAAO6E,OAAP;AACD;AApSH;AAAA;AAAA,WAqSE,uBAAc;AACZ,UAAQ7E,MAAR,GAAyB,IAAzB,CAAQA,MAAR;AAAA,UAAgBF,IAAhB,GAAyB,IAAzB,CAAgBA,IAAhB;AACA,UAAI+C,IAAI,GAAG,EAAX;;AACA,UAAI7C,MAAJ,EAAY;AACV,YAAI8B,KAAK,CAACC,OAAN,CAAc/B,MAAM,CAACK,QAArB,CAAJ,EAAoC;AAClCwC,UAAAA,IAAI,GAAG7C,MAAM,CAACK,QAAd;AACD;AACF,OAJD,MAIO,IAAIP,IAAJ,EAAU;AACf+C,QAAAA,IAAI,GAAG/C,IAAI,CAACO,QAAZ;AACD;;AACD,aAAOwC,IAAP;AACD;AAhTH;AAAA;AAAA,WAiTE,mBAAU;AACR,UAAMgC,OAAO,GAAG,KAAKtB,UAAL,EAAhB;AACA,aAAOsB,OAAO,CAACA,OAAO,CAAC3G,MAAR,GAAiB,CAAlB,CAAP,IAA+B,IAAtC;AACD;AApTH;AAAA;AAAA,WAqTE,oBAAW;AACT,UAAM2E,IAAI,GAAG,KAAKqB,WAAL,EAAb;AACA,aAAOrB,IAAI,CAACiC,OAAL,CAAa,IAAb,CAAP;AACD;AAxTH;AAAA;AAAA,WAyTE,mBAAU;AACR,UAAMf,KAAK,GAAG,KAAKR,UAAL,EAAd;AACAQ,MAAAA,KAAK,CAACgB,OAAN,CAAc,IAAd;AACA,aAAOhB,KAAK,CAACiB,OAAN,EAAP;AACD;AA7TH;AAAA;AAAA,WA8TE,oBAAW;AACT,UAAMH,OAAO,GAAG,KAAKtB,UAAL,EAAhB;AACA,aAAOsB,OAAO,CAAC3G,MAAf;AACD;AAjUH;AAAA;AAAA,WAkUE,kBAAS;AACP,uBAGI,KAAK4B,IAHT;AAAA,UACEG,MADF,cACEA,MADF;AAAA,UAEEgF,SAFF,cAEEA,SAFF;AAIA,UAAIC,IAAI,GAAG,IAAX;;AACA,UAAI,OAAOjF,MAAM,CAACkF,MAAd,KAAyB,UAA7B,EAAyC;AACvC,YAAMC,SAAS,GAAG,KAAKC,QAAL,EAAlB;AACAH,QAAAA,IAAI,GAAGjF,MAAM,CAACkF,MAAP,CAAcC,SAAd,CAAP;AACD;;AACD,UAAIF,IAAJ,EAAU;AACRD,QAAAA,SAAS,CAAC5D,GAAV,CAAc,KAAKZ,KAAnB,EAA0B,IAA1B;AACD,OAFD,MAEO,IAAIwE,SAAS,CAAC9E,GAAV,CAAc,KAAKM,KAAnB,CAAJ,EAA+B;AACpCwE,QAAAA,SAAS,UAAT,CAAiB,KAAKxE,KAAtB;AACD;;AACD,aAAOyE,IAAP;AACD;AAlVH;AAAA;AAAA,WAmVE,qBAAY;AACV,UACE5D,OADF,GAEI,KAAKxB,IAFT,CACEwB,OADF;AAGA,UAAIE,OAAO,GAAG,IAAd;;AACA,UAAI,KAAKR,UAAT,EAAqB;AACnB,eAAO,IAAP;AACD;;AACD,UAAIM,OAAO,CAACnB,GAAR,CAAY,KAAKM,KAAjB,CAAJ,EAA6B;AAC3B,YAAM6E,aAAa,GAAG,KAAKC,MAAL,EAAtB;AACA,YAAIC,aAAa,GAAG,IAApB;AACA,YAAMX,OAAO,GAAG,KAAKtB,UAAL,EAAhB;;AACA,YAAIsB,OAAO,CAAC3G,MAAR,GAAiB,CAArB,EAAwB;AACtBsH,UAAAA,aAAa,GAAGX,OAAO,CAACY,KAAR,CAAc,UAACxC,IAAD;AAAA,mBAAUA,IAAI,CAACyC,UAAL,EAAV;AAAA,WAAd,CAAhB;AACD;;AACDlE,QAAAA,OAAO,GAAGgE,aAAa,IAAIF,aAA3B;AACD,OARD,MAQO;AACL9D,QAAAA,OAAO,GAAG,KAAV;AACD;;AACD,aAAOA,OAAP;AACD;AAvWH;AAAA;AAAA,WAwWE,sBAAa;AACX,UAAI,KAAKR,UAAT,EACE,OAAO,IAAP;AACF,UAAM2E,YAAY,GAAGxF,SAAG,CAAC,IAAD,EAAO,sBAAP,CAAxB;AACA,aAAO,CAAC,EAAEwF,YAAY,IAAI,KAAKjG,QAAvB,CAAR;AACD;AA7WH;AAAA;AAAA,WA8WE,yBAAgB;AACd,aAAO,CAAC,EAAES,SAAG,CAAC,IAAD,EAAO,yBAAP,CAAH,IAAwC,KAAKZ,WAA/C,CAAR;AACD;AAhXH;AAAA;AAAA,WAiXE,uBAAc;AACZ,aAAO,CAAC,EAAEY,SAAG,CAAC,IAAD,EAAO,uBAAP,CAAH,IAAsC,KAAKX,SAA7C,CAAR;AACD;AAnXH;AAAA;AAAA,WAoXE,uBAAc;AACZ,aAAO,CAAC,EAAEW,SAAG,CAAC,IAAD,EAAO,uBAAP,CAAH,IAAsC,KAAKV,SAA7C,CAAR;AACD;AAtXH;AAAA;AAAA,WAuXE,mBAAUmG,GAAV,EAAe;AACb,UAAQ9F,IAAR,GAAwB,IAAxB,CAAQA,IAAR;AAAA,UAAcW,KAAd,GAAwB,IAAxB,CAAcA,KAAd;AACA,UAAMmC,UAAU,GAAGgD,GAAG,IAAI9F,IAAI,CAAC8C,UAA/B;AACA,aAAO,CAAC,EAAE9C,IAAI,CAACwB,OAAL,CAAanB,GAAb,CAAiBM,KAAjB,KAA2BmC,UAAU,CAACzC,GAAX,CAAeM,KAAf,CAA7B,CAAR;AACD;AA3XH;AAAA;AAAA,WA4XE,oBAAWmF,GAAX,EAAgB;AACd,UAAQ9F,IAAR,GAAoC,IAApC,CAAQA,IAAR;AAAA,UAAcW,KAAd,GAAoC,IAApC,CAAcA,KAAd;AAAA,UAAqBO,UAArB,GAAoC,IAApC,CAAqBA,UAArB;AACA,UAAIA,UAAJ,EACE,OAAO,IAAP;AACF,UAAM0B,WAAW,GAAGkD,GAAG,IAAI9F,IAAI,CAAC4C,WAAhC;AACA,aAAO,CAAC,EAAE5C,IAAI,CAACwB,OAAL,CAAanB,GAAb,CAAiBM,KAAjB,KAA2BiC,WAAW,CAACvC,GAAZ,CAAgBM,KAAhB,CAA7B,CAAR;AACD;AAlYH;AAAA;AAAA,WAmYE,mBAAUmF,GAAV,EAAe;AACb,UAAQvF,QAAR,GAA2B,IAA3B,CAAQA,QAAR;AAAA,UAAkBP,IAAlB,GAA2B,IAA3B,CAAkBA,IAAlB;AACA,UAAQuC,aAAR,GAA0BvC,IAAI,CAACG,MAA/B,CAAQoC,aAAR;AACA,UAAIjB,OAAO,GAAG,KAAd;AACA,UAAMmB,UAAU,GAAGqD,GAAG,IAAI9F,IAAI,CAACyC,UAA/B;;AACA,UAAIzC,IAAI,CAACwB,OAAL,CAAanB,GAAb,CAAiB,KAAKM,KAAtB,CAAJ,EAAkC;AAChC,YAAI8B,UAAU,CAACpC,GAAX,CAAe,KAAKM,KAApB,CAAJ,EAAgC;AAC9BW,UAAAA,OAAO,GAAG,IAAV;AACD,SAFD,MAEO,IAAIU,KAAK,CAACC,OAAN,CAAc1B,QAAd,KAA2BA,QAAQ,CAACnC,MAAT,GAAkB,CAA7C,IAAkD,CAACmE,aAAvD,EAAsE;AAC3EjB,UAAAA,OAAO,GAAGf,QAAQ,CAACoF,KAAT,CAAe,UAACxC,IAAD,EAAU;AACjC,gBAAM4C,cAAc,GAAG5C,IAAI,CAACX,SAAL,CAAeC,UAAf,CAAvB;AACA,mBAAOsD,cAAP;AACD,WAHS,CAAV;AAID,SALM,MAKA,IAAI,CAACxD,aAAL,EAAoB;AACzB,cAAMwC,OAAO,GAAG,KAAKtB,UAAL,EAAhB;AACAnC,UAAAA,OAAO,GAAGyD,OAAO,CAACpB,IAAR,CAAa,UAACR,IAAD;AAAA,mBAAUV,UAAU,CAACpC,GAAX,CAAe8C,IAAI,CAACxC,KAApB,CAAV;AAAA,WAAb,CAAV;AACD;AACF;;AACD,aAAO,CAAC,CAACW,OAAT;AACD;AAtZH;AAAA;AAAA,WAuZE,2BAAkB;AAChB,UAAQf,QAAR,GAA2B,IAA3B,CAAQA,QAAR;AAAA,UAAkBP,IAAlB,GAA2B,IAA3B,CAAkBA,IAAlB;AACA,UAAQuC,aAAR,GAA0BvC,IAAI,CAACG,MAA/B,CAAQoC,aAAR;;AACA,UAAIA,aAAJ,EAAmB;AACjB,eAAO,KAAP;AACD;;AACD,UAAIF,aAAa,GAAG,KAApB;;AACA,UAAIL,KAAK,CAACC,OAAN,CAAc1B,QAAd,CAAJ,EAA6B;AAC3B,YAAIyF,YAAY,GAAG,IAAnB;AACA3D,QAAAA,aAAa,GAAG9B,QAAQ,CAACoD,IAAT,CAAc,UAACR,IAAD,EAAU;AACtC,cAAIA,IAAI,CAAC8C,eAAL,EAAJ,EAA4B;AAC1B,mBAAO,IAAP;AACD;;AACD,cAAID,YAAY,KAAK,IAArB,EAA2B;AACzBA,YAAAA,YAAY,GAAG7C,IAAI,CAACX,SAAL,EAAf;AACD;;AACD,cAAIwD,YAAY,KAAK7C,IAAI,CAACX,SAAL,EAArB,EAAuC;AACrC,mBAAO,IAAP;AACD;;AACD,iBAAO,KAAP;AACD,SAXe,CAAhB;AAYD;;AACD,aAAOH,aAAP;AACD;AA9aH;AAAA;AAAA,WA+aE,mBAAU;AACR,UAAM0B,QAAQ,GAAG,KAAKK,WAAL,EAAjB;AACA,aAAOL,QAAQ,CAAC,CAAD,CAAR,KAAgB,IAAvB;AACD;AAlbH;AAAA;AAAA,WAmbE,kBAAS;AACP,UAAMA,QAAQ,GAAG,KAAKK,WAAL,EAAjB;AACA,aAAOL,QAAQ,CAACA,QAAQ,CAAC3F,MAAT,GAAkB,CAAnB,CAAR,KAAkC,IAAzC;AACD;AAtbH;AAAA;AAAA,WAubE,kBAAS;AACP,UAAI8H,MAAM,GAAG,KAAb;;AACA,UAAIlE,KAAK,CAACC,OAAN,CAAc,KAAK1B,QAAnB,CAAJ,EAAkC;AAChC2F,QAAAA,MAAM,GAAG,KAAK3F,QAAL,CAAcnC,MAAd,IAAwB,CAAjC;AACD,OAFD,MAEO;AACL8H,QAAAA,MAAM,GAAG,CAAC,KAAK3F,QAAf;AACD;;AACD,aAAO2F,MAAP;AACD;AA/bH;AAAA;AAAA,WAgcE,cAAKC,SAAL,EAAgB;AACd,WAAKjF,UAAL,GAAkBiF,SAAlB;AACA,WAAK9E,QAAL,GAAgB,KAAKuE,UAAL,EAAhB;AACA,WAAKlE,OAAL,GAAe,KAAK0E,SAAL,EAAf;AACD;AApcH;AAAA;AAAA,WAqcE,yBAAgB;AACd,WAAKtE,MAAL;;AACA,UAAI,KAAKT,QAAL,IAAiB,KAAKd,QAAL,KAAkB,IAAvC,EAA6C;AAC3C,aAAK6B,YAAL;AACD;AACF;AA1cH;AAAA;AAAA,WA2cE,0BAAiB;AACf,aAAO,KAAKiE,WAAL,CAAiB,CAAC,KAAKT,UAAL,EAAlB,CAAP;AACD;AA7cH;AAAA;AAAA,WA8cE,qBAAYvE,QAAZ,EAAsBiF,IAAtB,EAA4B;AAC1B,UAAQtG,IAAR,GAAiB,IAAjB,CAAQA,IAAR;;AACA,UAAMuG,OAAO;AACXC,QAAAA,QAAQ,EAAE;AADC,SAERF,IAFQ,CAAb;;AAIA,UAAIR,GAAG,GAAG9F,IAAI,CAAC4C,WAAf;;AACA,UAAI,CAAC2D,OAAO,CAACC,QAAb,EAAuB;AACrBV,QAAAA,GAAG,GAAG,IAAIW,GAAJ,CAAQzG,IAAI,CAAC4C,WAAb,CAAN;AACD;;AACD,UAAIvB,QAAJ,EAAc;AACZ,YAAMqF,iBAAiB,GAAG,EAA1B;AACAA,QAAAA,iBAAiB,CAAC1D,IAAlB,CAAuB,IAAvB;;AACA,YAAI3C,SAAG,CAACL,IAAD,EAAO,qBAAP,CAAP,EAAsC;AACpC,eAAKyD,UAAL,GAAkBR,OAAlB,CAA0B,UAACE,IAAD,EAAU;AAClCuD,YAAAA,iBAAiB,CAAC1D,IAAlB,CAAuBG,IAAvB;AACD,WAFD;AAGD;;AACDuD,QAAAA,iBAAiB,CAACzD,OAAlB,CAA0B,UAACE,IAAD,EAAU;AAClC,cAAIwD,aAAa,GAAG,KAApB;;AACA,cAAIxD,IAAI,CAACjD,MAAT,EAAiB;AACfyG,YAAAA,aAAa,GAAGxD,IAAI,CAACjD,MAAL,CAAYyG,aAAZ,EAAhB;AACD,WAFD,MAEO;AAAA;;AACLA,YAAAA,aAAa,GAAG3G,IAAH,aAAGA,IAAH,uCAAGA,IAAI,CAAEG,MAAT,iDAAG,aAAcV,WAA9B;AACD;;AACD,cAAIkH,aAAJ,EAAmB;AACjB,gBAAM5C,QAAQ,GAAGZ,IAAI,CAACiB,WAAL,EAAjB;AACAL,YAAAA,QAAQ,CAACd,OAAT,CAAiB,UAAC2D,KAAD,EAAW;AAC1Bd,cAAAA,GAAG,UAAH,CAAWc,KAAK,CAACjG,KAAjB;AACD,aAFD;AAGD;;AACDmF,UAAAA,GAAG,CAACvE,GAAJ,CAAQ4B,IAAI,CAACxC,KAAb,EAAoB,IAApB;AACD,SAdD;AAeD,OAvBD,MAuBO;AACLmF,QAAAA,GAAG,UAAH,CAAW,KAAKnF,KAAhB;AACD;;AACD,UAAI4F,OAAO,CAACC,QAAZ,EAAsB;AACpB,aAAKK,aAAL;AACA,aAAK/E,MAAL;AACA,aAAKgF,cAAL;AACD;;AACD,aAAO9G,IAAI,CAAC+G,WAAL,CAAiBjB,GAAjB,CAAP;AACD;AAxfH;AAAA;AAAA,WAyfE,yBAAgB;AACd,aAAO,KAAKkB,UAAL,CAAgB,CAAC,KAAKC,SAAL,EAAjB,CAAP;AACD;AA3fH;AAAA;AAAA,WA4fE,oBAAW7F,OAAX,EAAoBkF,IAApB,EAA0B;AACxB,UAAQtG,IAAR,GAAiB,IAAjB,CAAQA,IAAR;;AACA,UAAMuG,OAAO;AACXC,QAAAA,QAAQ,EAAE;AADC,SAERF,IAFQ,CAAb;;AAIA,UAAMnG,MAAM,GAAGH,IAAI,CAACG,MAAL,IAAe,EAA9B;AACA,UAAI2F,GAAG,GAAG9F,IAAI,CAAC8C,UAAf;;AACA,UAAI,CAACyD,OAAO,CAACC,QAAb,EAAuB;AACrBV,QAAAA,GAAG,GAAG,IAAIW,GAAJ,CAAQzG,IAAI,CAAC8C,UAAb,CAAN;AACD;;AACD,UAAI,KAAKoE,WAAL,EAAJ,EAAwB;AACtB,YAAI9F,OAAJ,EAAa;AACX,cAAI,CAACjB,MAAM,CAACgH,cAAZ,EAA4B;AAC1BrB,YAAAA,GAAG,CAACsB,KAAJ;AACD;;AACDtB,UAAAA,GAAG,CAACvE,GAAJ,CAAQ,KAAKZ,KAAb,EAAoB,IAApB;AACD,SALD,MAKO;AACLmF,UAAAA,GAAG,UAAH,CAAW,KAAKnF,KAAhB;AACD;AACF;;AACD,UAAI4F,OAAO,CAACC,QAAZ,EAAsB;AACpB,aAAK1E,MAAL;AACD;;AACD,aAAO9B,IAAI,CAACqH,UAAL,CAAgBvB,GAAhB,CAAP;AACD;AArhBH;AAAA;AAAA,WAshBE,yBAAgB;AACd,aAAO,KAAKwB,UAAL,CAAgB,CAAC,KAAK9E,SAAL,EAAjB,CAAP;AACD;AAxhBH;AAAA;AAAA,WAyhBE,oBAAWlB,OAAX,EAAoBgF,IAApB,EAA0B;AACxB,UAAQtG,IAAR,GAAiB,IAAjB,CAAQA,IAAR;AACA,UAAMG,MAAM,GAAGH,IAAI,CAACG,MAAL,IAAe,EAA9B;;AACA,UAAMoG,OAAO;AACXC,QAAAA,QAAQ,EAAE;AADC,SAERF,IAFQ,CAAb;;AAIA,UAAIR,GAAG,GAAG9F,IAAI,CAACyC,UAAf;;AACA,UAAI,CAAC8D,OAAO,CAACC,QAAb,EAAuB;AACrBV,QAAAA,GAAG,GAAG,IAAIW,GAAJ,CAAQzG,IAAI,CAACyC,UAAb,CAAN;AACD;;AACD,UAAI,KAAK8E,WAAL,MAAsBjG,OAAO,KAAK,KAAKkB,SAAL,EAAtC,EAAwD;AACtD,YAAIrC,MAAM,CAACoC,aAAX,EAA0B;AACxB,cAAIjB,OAAJ,EAAa;AACXwE,YAAAA,GAAG,CAACvE,GAAJ,CAAQ,KAAKZ,KAAb,EAAoB,IAApB;AACD,WAFD,MAEO;AACLmF,YAAAA,GAAG,UAAH,CAAW,KAAKnF,KAAhB;AACD;AACF,SAND,MAMO;AACL,cAAMJ,QAAQ,GAAG,KAAK2D,IAAL,EAAjB;AACA3D,UAAAA,QAAQ,CAAC0C,OAAT,CAAiB,UAACE,IAAD,EAAU;AACzB,gBAAI7B,OAAJ,EAAa;AACXwE,cAAAA,GAAG,CAACvE,GAAJ,CAAQ4B,IAAI,CAACxC,KAAb,EAAoB,IAApB;AACD,aAFD,MAEO;AACLmF,cAAAA,GAAG,UAAH,CAAW3C,IAAI,CAACxC,KAAhB;AACD;AACF,WAND;AAOA,cAAMoE,OAAO,GAAG,KAAKtB,UAAL,EAAhB;AACAsB,UAAAA,OAAO,CAAC9B,OAAR,CAAgB,UAACE,IAAD,EAAU;AACxB2C,YAAAA,GAAG,UAAH,CAAW3C,IAAI,CAACxC,KAAhB;AACD,WAFD;AAGD;AACF;;AACD,UAAI4F,OAAO,CAACC,QAAZ,EAAsB;AACpB,YAAIrG,MAAM,CAACoC,aAAX,EAA0B;AACxB,eAAKD,aAAL;AACD,SAFD,MAEO;AACL,cAAMkF,YAAY,GAAGxH,IAAI,CAACyH,eAAL,CAAqB,CAAC,KAAK9G,KAAN,CAArB,CAArB;AACA6G,UAAAA,YAAY,CAACvE,OAAb,CAAqB,UAACE,IAAD,EAAU;AAC7BA,YAAAA,IAAI,CAACb,aAAL;AACD,WAFD;AAGD;AACF;;AACD,aAAOtC,IAAI,CAAC0H,UAAL,CAAgB5B,GAAhB,CAAP;AACD;AArkBH;AAAA;AAAA,WAskBE,kBAAS;AACP,WAAKrE,KAAL,GAAa,KAAKkB,QAAL,EAAb;AACA,WAAKvB,OAAL,GAAe,KAAK6F,SAAL,EAAf;AACA,WAAK5F,QAAL,GAAgB,KAAKuE,UAAL,EAAhB;AACA,WAAK/E,WAAL,GAAmB,KAAK0G,WAAL,EAAnB;AACA,WAAK7F,OAAL,GAAe,KAAK0E,SAAL,EAAf;AACA,WAAKnF,QAAL,GAAgB,KAAKwE,MAAL,EAAhB;AACA,WAAK1E,SAAL,GAAiB,KAAK4G,OAAL,EAAjB;AACA,WAAK3G,QAAL,GAAgB,KAAK4G,MAAL,EAAhB;AACA,WAAK9G,QAAL,GAAgB,KAAKoF,MAAL,EAAhB;AACA,WAAKlG,IAAL,CAAU8E,OAAV,CAAkB,IAAlB;AACD;AAjlBH;AAAA;AAAA,WAklBE,yBAAgB;AACd,UAAQ9E,IAAR,GAAiB,IAAjB,CAAQA,IAAR;AACA,WAAKa,WAAL,GAAmB,KAAK0G,WAAL,EAAnB;;AACA,UAAI,KAAK1G,WAAL,IAAoB,CAAC,KAAKjB,QAA9B,EAAwC;AACtC,aAAK0B,OAAL,GAAe,KAAKkB,SAAL,EAAf;;AACA,YAAI,KAAKlB,OAAT,EAAkB;AAChBtB,UAAAA,IAAI,CAACyC,UAAL,CAAgBlB,GAAhB,CAAoB,KAAKZ,KAAzB,EAAgC,IAAhC;AACD;;AACD,aAAK0B,aAAL,GAAqB,KAAK4D,eAAL,EAArB;AACAjG,QAAAA,IAAI,CAAC8E,OAAL,CAAa,IAAb;AACD;AACF;AA7lBH;AAAA;AAAA,WA8lBE,0BAAiB;AACf,UAAQvE,QAAR,GAAqB,IAArB,CAAQA,QAAR;;AACA,UAAIyB,KAAK,CAACC,OAAN,CAAc1B,QAAd,CAAJ,EAA6B;AAC3BA,QAAAA,QAAQ,CAAC0C,OAAT,CAAiB,UAACE,IAAD,EAAU;AACzBA,UAAAA,IAAI,CAACrB,MAAL;AACAqB,UAAAA,IAAI,CAACb,aAAL;AACAa,UAAAA,IAAI,CAAC2D,cAAL;AACD,SAJD;AAKD;AACF;AAvmBH;AAAA;AAAA,WAwmBE,yBAAgB;AACd,UAAQ5G,MAAR,GAAmB,IAAnB,CAAQA,MAAR;;AACA,UAAIA,MAAJ,EAAY;AACVA,QAAAA,MAAM,CAAC4B,MAAP;AACA5B,QAAAA,MAAM,CAACoC,aAAP;AACApC,QAAAA,MAAM,CAACwE,aAAP;AACD;AACF;AA/mBH;AAAA;AAAA,WAgnBE,yBAAgB;AACd,UAAQ1E,IAAR,GAAiB,IAAjB,CAAQA,IAAR;AACA,UAAMwH,YAAY,GAAGxH,IAAI,CAACyH,eAAL,CAAqB,CAAC,KAAK9G,KAAN,CAArB,CAArB;AACA6G,MAAAA,YAAY,CAACvE,OAAb,CAAqB,UAACE,IAAD,EAAU;AAC7BA,QAAAA,IAAI,CAACrB,MAAL;AACAqB,QAAAA,IAAI,CAACb,aAAL;AACD,OAHD;AAIAtC,MAAAA,IAAI,CAAC+B,MAAL;AACD;AAxnBH;AAAA;AAAA,WAynBE,gBAAO;AACL,UAAQxB,QAAR,GAAqB,IAArB,CAAQA,QAAR;AACA,UAAIwC,IAAI,GAAG,EAAX;AACAA,MAAAA,IAAI,CAACC,IAAL,CAAU,IAAV;;AACA,UAAIhB,KAAK,CAACC,OAAN,CAAc1B,QAAd,KAA2BA,QAAQ,CAACnC,MAAT,GAAkB,CAAjD,EAAoD;AAClDmC,QAAAA,QAAQ,CAAC0C,OAAT,CAAiB,UAACE,IAAD,EAAU;AACzBJ,UAAAA,IAAI,GAAGA,IAAI,CAAC8E,MAAL,CAAY1E,IAAI,CAACe,IAAL,EAAZ,CAAP;AACD,SAFD;AAGD;;AACD,aAAOnB,IAAP;AACD;AAnoBH;AAAA;AAAA,WAooBE,oBAAW;AACT,UAAMnC,KAAN,GAAgB,IAAhB,CAAMA,KAAN;;AACA,UAAI,CAACA,KAAL,EAAY;AACVA,QAAAA,KAAK,GAAGkH,6CAAe,CAAC,IAAD,CAAvB;AACA,aAAKlH,KAAL,GAAaA,KAAb;AACD;;AACDmH,MAAAA,6CAAe,CAACnH,KAAD,EAAQ,IAAR,CAAf;AACA,aAAOA,KAAP;AACD;AA5oBH;;AAAA;AAAA;;;;;;"}

package/lib/_chunks/dep-22d0bd2e.js

@@ -0,0 +1,47 @@
+/**
+ * tdesign v0.23.1
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _baseGetTag = require('./dep-a3912276.js');
+
+var _nodeUtil = {exports: {}};
+
+(function (module, exports) {
+  var freeGlobal = _baseGetTag._freeGlobal;
+  /** Detect free variable `exports`. */
+
+  var freeExports = exports && !exports.nodeType && exports;
+  /** Detect free variable `module`. */
+
+  var freeModule = freeExports && 'object' == 'object' && module && !module.nodeType && module;
+  /** Detect the popular CommonJS extension `module.exports`. */
+
+  var moduleExports = freeModule && freeModule.exports === freeExports;
+  /** Detect free variable `process` from Node.js. */
+
+  var freeProcess = moduleExports && freeGlobal.process;
+  /** Used to access faster Node.js helpers. */
+
+  var nodeUtil = function () {
+    try {
+      // Use `util.types` for Node.js 10+.
+      var types = freeModule && freeModule.require && freeModule.require('util').types;
+
+      if (types) {
+        return types;
+      } // Legacy `process.binding('util')` for Node.js < 10.
+
+
+      return freeProcess && freeProcess.binding && freeProcess.binding('util');
+    } catch (e) {}
+  }();
+
+  module.exports = nodeUtil;
+})(_nodeUtil, _nodeUtil.exports);
+
+exports._nodeUtil = _nodeUtil;
+//# sourceMappingURL=dep-22d0bd2e.js.map

package/lib/_chunks/dep-22d0bd2e.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-22d0bd2e.js","sources":["../../node_modules/lodash/_nodeUtil.js"],"sourcesContent":["var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nmodule.exports = nodeUtil;\n"],"names":["freeGlobal","require$$0","freeExports","exports","nodeType","freeModule","module","moduleExports","freeProcess","process","nodeUtil","types","require","binding","e"],"mappings":";;;;;;;;;;;;;AAAA,MAAIA,UAAU,GAAGC,uBAAjB;AAEA;;AACA,MAAIC,WAAW,GAAiCC,OAA9B,IAAyC,CAACA,OAAO,CAACC,QAAlD,IAA8DD,OAAhF;AAEA;;AACA,MAAIE,UAAU,GAAGH,WAAW,IAAI,YAAiB,QAAhC,IAA4CI,MAA5C,IAAsD,CAACA,MAAM,CAACF,QAA9D,IAA0EE,MAA3F;AAEA;;AACA,MAAIC,aAAa,GAAGF,UAAU,IAAIA,UAAU,CAACF,OAAX,KAAuBD,WAAzD;AAEA;;AACA,MAAIM,WAAW,GAAGD,aAAa,IAAIP,UAAU,CAACS,OAA9C;AAEA;;AACA,MAAIC,QAAQ,GAAI,YAAW;AACzB,QAAI;;AAEF,UAAIC,KAAK,GAAGN,UAAU,IAAIA,UAAU,CAACO,OAAzB,IAAoCP,UAAU,CAACO,OAAX,CAAmB,MAAnB,EAA2BD,KAA3E;;AAEA,UAAIA,KAAJ,EAAW;AACT,eAAOA,KAAP;AACD,OANC;;;AASF,aAAOH,WAAW,IAAIA,WAAW,CAACK,OAA3B,IAAsCL,WAAW,CAACK,OAAZ,CAAoB,MAApB,CAA7C;AACD,KAVD,CAUE,OAAOC,CAAP,EAAU;AACb,GAZe,EAAhB;;AAcAR,EAAAA,cAAA,GAAiBI,QAAjB;;;;;"}

package/lib/_chunks/dep-28650e61.js

@@ -0,0 +1,132 @@
+/**
+ * tdesign v0.23.1
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _baseSlice = require('./dep-4e4f173b.js');
+
+var baseSlice = _baseSlice._baseSlice;
+/**
+ * Casts `array` to a slice if it's needed.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {number} start The start position.
+ * @param {number} [end=array.length] The end position.
+ * @returns {Array} Returns the cast slice.
+ */
+
+function castSlice(array, start, end) {
+  var length = array.length;
+  end = end === undefined ? length : end;
+  return !start && end >= length ? array : baseSlice(array, start, end);
+}
+
+var _castSlice = castSlice;
+
+/** Used to compose unicode character classes. */
+var rsAstralRange$1 = "\\ud800-\\udfff",
+    rsComboMarksRange$1 = "\\u0300-\\u036f",
+    reComboHalfMarksRange$1 = "\\ufe20-\\ufe2f",
+    rsComboSymbolsRange$1 = "\\u20d0-\\u20ff",
+    rsComboRange$1 = rsComboMarksRange$1 + reComboHalfMarksRange$1 + rsComboSymbolsRange$1,
+    rsVarRange$1 = "\\ufe0e\\ufe0f";
+/** Used to compose unicode capture groups. */
+
+var rsZWJ$1 = "\\u200d";
+/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */
+
+var reHasUnicode = RegExp('[' + rsZWJ$1 + rsAstralRange$1 + rsComboRange$1 + rsVarRange$1 + ']');
+/**
+ * Checks if `string` contains Unicode symbols.
+ *
+ * @private
+ * @param {string} string The string to inspect.
+ * @returns {boolean} Returns `true` if a symbol is found, else `false`.
+ */
+
+function hasUnicode$1(string) {
+  return reHasUnicode.test(string);
+}
+
+var _hasUnicode = hasUnicode$1;
+
+/**
+ * Converts an ASCII `string` to an array.
+ *
+ * @private
+ * @param {string} string The string to convert.
+ * @returns {Array} Returns the converted array.
+ */
+
+function asciiToArray$1(string) {
+  return string.split('');
+}
+
+var _asciiToArray = asciiToArray$1;
+
+/** Used to compose unicode character classes. */
+var rsAstralRange = "\\ud800-\\udfff",
+    rsComboMarksRange = "\\u0300-\\u036f",
+    reComboHalfMarksRange = "\\ufe20-\\ufe2f",
+    rsComboSymbolsRange = "\\u20d0-\\u20ff",
+    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,
+    rsVarRange = "\\ufe0e\\ufe0f";
+/** Used to compose unicode capture groups. */
+
+var rsAstral = '[' + rsAstralRange + ']',
+    rsCombo = '[' + rsComboRange + ']',
+    rsFitz = "\\ud83c[\\udffb-\\udfff]",
+    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',
+    rsNonAstral = '[^' + rsAstralRange + ']',
+    rsRegional = "(?:\\ud83c[\\udde6-\\uddff]){2}",
+    rsSurrPair = "[\\ud800-\\udbff][\\udc00-\\udfff]",
+    rsZWJ = "\\u200d";
+/** Used to compose unicode regexes. */
+
+var reOptMod = rsModifier + '?',
+    rsOptVar = '[' + rsVarRange + ']?',
+    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',
+    rsSeq = rsOptVar + reOptMod + rsOptJoin,
+    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';
+/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */
+
+var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');
+/**
+ * Converts a Unicode `string` to an array.
+ *
+ * @private
+ * @param {string} string The string to convert.
+ * @returns {Array} Returns the converted array.
+ */
+
+function unicodeToArray$1(string) {
+  return string.match(reUnicode) || [];
+}
+
+var _unicodeToArray = unicodeToArray$1;
+
+var asciiToArray = _asciiToArray,
+    hasUnicode = _hasUnicode,
+    unicodeToArray = _unicodeToArray;
+/**
+ * Converts `string` to an array.
+ *
+ * @private
+ * @param {string} string The string to convert.
+ * @returns {Array} Returns the converted array.
+ */
+
+function stringToArray(string) {
+  return hasUnicode(string) ? unicodeToArray(string) : asciiToArray(string);
+}
+
+var _stringToArray = stringToArray;
+
+exports._castSlice = _castSlice;
+exports._hasUnicode = _hasUnicode;
+exports._stringToArray = _stringToArray;
+//# sourceMappingURL=dep-28650e61.js.map

package/lib/_chunks/dep-28650e61.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-28650e61.js","sources":["../../node_modules/lodash/_castSlice.js","../../node_modules/lodash/_hasUnicode.js","../../node_modules/lodash/_asciiToArray.js","../../node_modules/lodash/_unicodeToArray.js","../../node_modules/lodash/_stringToArray.js"],"sourcesContent":["var baseSlice = require('./_baseSlice');\n\n/**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\nfunction castSlice(array, start, end) {\n  var length = array.length;\n  end = end === undefined ? length : end;\n  return (!start && end >= length) ? array : baseSlice(array, start, end);\n}\n\nmodule.exports = castSlice;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsZWJ = '\\\\u200d';\n\n/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n/**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\nfunction hasUnicode(string) {\n  return reHasUnicode.test(string);\n}\n\nmodule.exports = hasUnicode;\n","/**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction asciiToArray(string) {\n  return string.split('');\n}\n\nmodule.exports = asciiToArray;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction unicodeToArray(string) {\n  return string.match(reUnicode) || [];\n}\n\nmodule.exports = unicodeToArray;\n","var asciiToArray = require('./_asciiToArray'),\n    hasUnicode = require('./_hasUnicode'),\n    unicodeToArray = require('./_unicodeToArray');\n\n/**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction stringToArray(string) {\n  return hasUnicode(string)\n    ? unicodeToArray(string)\n    : asciiToArray(string);\n}\n\nmodule.exports = stringToArray;\n"],"names":["baseSlice","require$$0","castSlice","array","start","end","length","undefined","_castSlice","rsAstralRange","rsComboMarksRange","reComboHalfMarksRange","rsComboSymbolsRange","rsComboRange","rsVarRange","rsZWJ","reHasUnicode","RegExp","hasUnicode","string","test","_hasUnicode","asciiToArray","split","_asciiToArray","rsAstral","rsCombo","rsFitz","rsModifier","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsOptVar","rsOptJoin","join","rsSeq","rsSymbol","reUnicode","unicodeToArray","match","_unicodeToArray","require$$1","require$$2","stringToArray","_stringToArray"],"mappings":";;;;;;;;;;AAAA,IAAIA,SAAS,GAAGC,qBAAhB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,SAAT,CAAmBC,KAAnB,EAA0BC,KAA1B,EAAiCC,GAAjC,EAAsC;AACpC,MAAIC,MAAM,GAAGH,KAAK,CAACG,MAAnB;AACAD,EAAAA,GAAG,GAAGA,GAAG,KAAKE,SAAR,GAAoBD,MAApB,GAA6BD,GAAnC;AACA,SAAQ,CAACD,KAAD,IAAUC,GAAG,IAAIC,MAAlB,GAA4BH,KAA5B,GAAoCH,SAAS,CAACG,KAAD,EAAQC,KAAR,EAAeC,GAAf,CAApD;AACD;;IAEDG,UAAc,GAAGN;;;AChBjB,IAAIO,eAAa,GAAG,iBAApB;AAAA,IACIC,mBAAiB,GAAG,iBADxB;AAAA,IAEIC,uBAAqB,GAAG,iBAF5B;AAAA,IAGIC,qBAAmB,GAAG,iBAH1B;AAAA,IAIIC,cAAY,GAAGH,mBAAiB,GAAGC,uBAApB,GAA4CC,qBAJ/D;AAAA,IAKIE,YAAU,GAAG,gBALjB;AAOA;;AACA,IAAIC,OAAK,GAAG,SAAZ;AAEA;;AACA,IAAIC,YAAY,GAAGC,MAAM,CAAC,MAAMF,OAAN,GAAcN,eAAd,GAA+BI,cAA/B,GAA8CC,YAA9C,GAA2D,GAA5D,CAAzB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASI,YAAT,CAAoBC,MAApB,EAA4B;AAC1B,SAAOH,YAAY,CAACI,IAAb,CAAkBD,MAAlB,CAAP;AACD;;IAEDE,WAAc,GAAGH;;;;;;;;;;AClBjB,SAASI,cAAT,CAAsBH,MAAtB,EAA8B;AAC5B,SAAOA,MAAM,CAACI,KAAP,CAAa,EAAb,CAAP;AACD;;IAEDC,aAAc,GAAGF;;;ACVjB,IAAIb,aAAa,GAAG,iBAApB;AAAA,IACIC,iBAAiB,GAAG,iBADxB;AAAA,IAEIC,qBAAqB,GAAG,iBAF5B;AAAA,IAGIC,mBAAmB,GAAG,iBAH1B;AAAA,IAIIC,YAAY,GAAGH,iBAAiB,GAAGC,qBAApB,GAA4CC,mBAJ/D;AAAA,IAKIE,UAAU,GAAG,gBALjB;AAOA;;AACA,IAAIW,QAAQ,GAAG,MAAMhB,aAAN,GAAsB,GAArC;AAAA,IACIiB,OAAO,GAAG,MAAMb,YAAN,GAAqB,GADnC;AAAA,IAEIc,MAAM,GAAG,0BAFb;AAAA,IAGIC,UAAU,GAAG,QAAQF,OAAR,GAAkB,GAAlB,GAAwBC,MAAxB,GAAiC,GAHlD;AAAA,IAIIE,WAAW,GAAG,OAAOpB,aAAP,GAAuB,GAJzC;AAAA,IAKIqB,UAAU,GAAG,iCALjB;AAAA,IAMIC,UAAU,GAAG,oCANjB;AAAA,IAOIhB,KAAK,GAAG,SAPZ;AASA;;AACA,IAAIiB,QAAQ,GAAGJ,UAAU,GAAG,GAA5B;AAAA,IACIK,QAAQ,GAAG,MAAMnB,UAAN,GAAmB,IADlC;AAAA,IAEIoB,SAAS,GAAG,QAAQnB,KAAR,GAAgB,KAAhB,GAAwB,CAACc,WAAD,EAAcC,UAAd,EAA0BC,UAA1B,EAAsCI,IAAtC,CAA2C,GAA3C,CAAxB,GAA0E,GAA1E,GAAgFF,QAAhF,GAA2FD,QAA3F,GAAsG,IAFtH;AAAA,IAGII,KAAK,GAAGH,QAAQ,GAAGD,QAAX,GAAsBE,SAHlC;AAAA,IAIIG,QAAQ,GAAG,QAAQ,CAACR,WAAW,GAAGH,OAAd,GAAwB,GAAzB,EAA8BA,OAA9B,EAAuCI,UAAvC,EAAmDC,UAAnD,EAA+DN,QAA/D,EAAyEU,IAAzE,CAA8E,GAA9E,CAAR,GAA6F,GAJ5G;AAMA;;AACA,IAAIG,SAAS,GAAGrB,MAAM,CAACU,MAAM,GAAG,KAAT,GAAiBA,MAAjB,GAA0B,IAA1B,GAAiCU,QAAjC,GAA4CD,KAA7C,EAAoD,GAApD,CAAtB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASG,gBAAT,CAAwBpB,MAAxB,EAAgC;AAC9B,SAAOA,MAAM,CAACqB,KAAP,CAAaF,SAAb,KAA2B,EAAlC;AACD;;IAEDG,eAAc,GAAGF;;ACvCjB,IAAIjB,YAAY,GAAGrB,aAAnB;AAAA,IACIiB,UAAU,GAAGwB,WADjB;AAAA,IAEIH,cAAc,GAAGI,eAFrB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,aAAT,CAAuBzB,MAAvB,EAA+B;AAC7B,SAAOD,UAAU,CAACC,MAAD,CAAV,GACHoB,cAAc,CAACpB,MAAD,CADX,GAEHG,YAAY,CAACH,MAAD,CAFhB;AAGD;;IAED0B,cAAc,GAAGD;;;;;;"}

package/lib/_chunks/dep-29390a45.js

@@ -0,0 +1,275 @@
+/**
+ * tdesign v0.23.1
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _cacheHas = require('./dep-980a5bdc.js');
+var toString = require('./dep-02537686.js');
+var _baseUnary = require('./dep-13217692.js');
+var _baseFlatten = require('./dep-3927ac4b.js');
+var identity$1 = require('./dep-36f97978.js');
+var _setToString = require('./dep-53de9512.js');
+var isArrayLike$1 = require('./dep-52fe1e25.js');
+var isObjectLike$1 = require('./dep-9c909570.js');
+
+/**
+ * The base implementation of `_.isNaN` without support for number objects.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
+ */
+
+function baseIsNaN$1(value) {
+  return value !== value;
+}
+
+var _baseIsNaN = baseIsNaN$1;
+
+/**
+ * A specialized version of `_.indexOf` which performs strict equality
+ * comparisons of values, i.e. `===`.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+
+function strictIndexOf$1(array, value, fromIndex) {
+  var index = fromIndex - 1,
+      length = array.length;
+
+  while (++index < length) {
+    if (array[index] === value) {
+      return index;
+    }
+  }
+
+  return -1;
+}
+
+var _strictIndexOf = strictIndexOf$1;
+
+var baseFindIndex = _cacheHas._baseFindIndex,
+    baseIsNaN = _baseIsNaN,
+    strictIndexOf = _strictIndexOf;
+/**
+ * The base implementation of `_.indexOf` without `fromIndex` bounds checks.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+
+function baseIndexOf$1(array, value, fromIndex) {
+  return value === value ? strictIndexOf(array, value, fromIndex) : baseFindIndex(array, baseIsNaN, fromIndex);
+}
+
+var _baseIndexOf = baseIndexOf$1;
+
+var baseIndexOf = _baseIndexOf;
+/**
+ * A specialized version of `_.includes` for arrays without support for
+ * specifying an index to search from.
+ *
+ * @private
+ * @param {Array} [array] The array to inspect.
+ * @param {*} target The value to search for.
+ * @returns {boolean} Returns `true` if `target` is found, else `false`.
+ */
+
+function arrayIncludes$1(array, value) {
+  var length = array == null ? 0 : array.length;
+  return !!length && baseIndexOf(array, value, 0) > -1;
+}
+
+var _arrayIncludes = arrayIncludes$1;
+
+/**
+ * This function is like `arrayIncludes` except that it accepts a comparator.
+ *
+ * @private
+ * @param {Array} [array] The array to inspect.
+ * @param {*} target The value to search for.
+ * @param {Function} comparator The comparator invoked per element.
+ * @returns {boolean} Returns `true` if `target` is found, else `false`.
+ */
+
+function arrayIncludesWith$1(array, value, comparator) {
+  var index = -1,
+      length = array == null ? 0 : array.length;
+
+  while (++index < length) {
+    if (comparator(value, array[index])) {
+      return true;
+    }
+  }
+
+  return false;
+}
+
+var _arrayIncludesWith = arrayIncludesWith$1;
+
+var SetCache = _cacheHas._SetCache,
+    arrayIncludes = _arrayIncludes,
+    arrayIncludesWith = _arrayIncludesWith,
+    arrayMap = toString._arrayMap,
+    baseUnary = _baseUnary._baseUnary,
+    cacheHas = _cacheHas._cacheHas;
+/** Used as the size to enable large array optimizations. */
+
+var LARGE_ARRAY_SIZE = 200;
+/**
+ * The base implementation of methods like `_.difference` without support
+ * for excluding multiple arrays or iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Array} values The values to exclude.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of filtered values.
+ */
+
+function baseDifference$1(array, values, iteratee, comparator) {
+  var index = -1,
+      includes = arrayIncludes,
+      isCommon = true,
+      length = array.length,
+      result = [],
+      valuesLength = values.length;
+
+  if (!length) {
+    return result;
+  }
+
+  if (iteratee) {
+    values = arrayMap(values, baseUnary(iteratee));
+  }
+
+  if (comparator) {
+    includes = arrayIncludesWith;
+    isCommon = false;
+  } else if (values.length >= LARGE_ARRAY_SIZE) {
+    includes = cacheHas;
+    isCommon = false;
+    values = new SetCache(values);
+  }
+
+  outer: while (++index < length) {
+    var value = array[index],
+        computed = iteratee == null ? value : iteratee(value);
+    value = comparator || value !== 0 ? value : 0;
+
+    if (isCommon && computed === computed) {
+      var valuesIndex = valuesLength;
+
+      while (valuesIndex--) {
+        if (values[valuesIndex] === computed) {
+          continue outer;
+        }
+      }
+
+      result.push(value);
+    } else if (!includes(values, computed, comparator)) {
+      result.push(value);
+    }
+  }
+
+  return result;
+}
+
+var _baseDifference = baseDifference$1;
+
+var identity = identity$1.identity_1,
+    overRest = _setToString._overRest,
+    setToString = _setToString._setToString;
+/**
+ * The base implementation of `_.rest` which doesn't validate or coerce arguments.
+ *
+ * @private
+ * @param {Function} func The function to apply a rest parameter to.
+ * @param {number} [start=func.length-1] The start position of the rest parameter.
+ * @returns {Function} Returns the new function.
+ */
+
+function baseRest$1(func, start) {
+  return setToString(overRest(func, start, identity), func + '');
+}
+
+var _baseRest = baseRest$1;
+
+var isArrayLike = isArrayLike$1.isArrayLike_1,
+    isObjectLike = isObjectLike$1.isObjectLike_1;
+/**
+ * This method is like `_.isArrayLike` except that it also checks if `value`
+ * is an object.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an array-like object,
+ *  else `false`.
+ * @example
+ *
+ * _.isArrayLikeObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isArrayLikeObject(document.body.children);
+ * // => true
+ *
+ * _.isArrayLikeObject('abc');
+ * // => false
+ *
+ * _.isArrayLikeObject(_.noop);
+ * // => false
+ */
+
+function isArrayLikeObject$1(value) {
+  return isObjectLike(value) && isArrayLike(value);
+}
+
+var isArrayLikeObject_1 = isArrayLikeObject$1;
+
+var baseDifference = _baseDifference,
+    baseFlatten = _baseFlatten._baseFlatten,
+    baseRest = _baseRest,
+    isArrayLikeObject = isArrayLikeObject_1;
+/**
+ * Creates an array of `array` values not included in the other given arrays
+ * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+ * for equality comparisons. The order and references of result values are
+ * determined by the first array.
+ *
+ * **Note:** Unlike `_.pullAll`, this method returns a new array.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Array
+ * @param {Array} array The array to inspect.
+ * @param {...Array} [values] The values to exclude.
+ * @returns {Array} Returns the new array of filtered values.
+ * @see _.without, _.xor
+ * @example
+ *
+ * _.difference([2, 1], [2, 3]);
+ * // => [1]
+ */
+
+var difference = baseRest(function (array, values) {
+  return isArrayLikeObject(array) ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true)) : [];
+});
+var difference_1 = difference;
+
+exports.difference_1 = difference_1;
+//# sourceMappingURL=dep-29390a45.js.map

package/lib/_chunks/dep-29390a45.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-29390a45.js","sources":["../../node_modules/lodash/_baseIsNaN.js","../../node_modules/lodash/_strictIndexOf.js","../../node_modules/lodash/_baseIndexOf.js","../../node_modules/lodash/_arrayIncludes.js","../../node_modules/lodash/_arrayIncludesWith.js","../../node_modules/lodash/_baseDifference.js","../../node_modules/lodash/_baseRest.js","../../node_modules/lodash/isArrayLikeObject.js","../../node_modules/lodash/difference.js"],"sourcesContent":["/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    arrayMap = require('./_arrayMap'),\n    baseUnary = require('./_baseUnary'),\n    cacheHas = require('./_cacheHas');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\nfunction baseDifference(array, values, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      isCommon = true,\n      length = array.length,\n      result = [],\n      valuesLength = values.length;\n\n  if (!length) {\n    return result;\n  }\n  if (iteratee) {\n    values = arrayMap(values, baseUnary(iteratee));\n  }\n  if (comparator) {\n    includes = arrayIncludesWith;\n    isCommon = false;\n  }\n  else if (values.length >= LARGE_ARRAY_SIZE) {\n    includes = cacheHas;\n    isCommon = false;\n    values = new SetCache(values);\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee == null ? value : iteratee(value);\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var valuesIndex = valuesLength;\n      while (valuesIndex--) {\n        if (values[valuesIndex] === computed) {\n          continue outer;\n        }\n      }\n      result.push(value);\n    }\n    else if (!includes(values, computed, comparator)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseDifference;\n","var identity = require('./identity'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\nmodule.exports = baseRest;\n","var isArrayLike = require('./isArrayLike'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\nmodule.exports = isArrayLikeObject;\n","var baseDifference = require('./_baseDifference'),\n    baseFlatten = require('./_baseFlatten'),\n    baseRest = require('./_baseRest'),\n    isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\nvar difference = baseRest(function(array, values) {\n  return isArrayLikeObject(array)\n    ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n    : [];\n});\n\nmodule.exports = difference;\n"],"names":["baseIsNaN","value","_baseIsNaN","strictIndexOf","array","fromIndex","index","length","_strictIndexOf","baseFindIndex","require$$0","require$$1","require$$2","baseIndexOf","_baseIndexOf","arrayIncludes","_arrayIncludes","arrayIncludesWith","comparator","_arrayIncludesWith","SetCache","arrayMap","require$$3","baseUnary","require$$4","cacheHas","require$$5","LARGE_ARRAY_SIZE","baseDifference","values","iteratee","includes","isCommon","result","valuesLength","outer","computed","valuesIndex","push","_baseDifference","identity","overRest","setToString","baseRest","func","start","_baseRest","isArrayLike","isObjectLike","isArrayLikeObject","isArrayLikeObject_1","baseFlatten","difference","difference_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAOA,SAASA,WAAT,CAAmBC,KAAnB,EAA0B;AACxB,SAAOA,KAAK,KAAKA,KAAjB;AACD;;IAEDC,UAAc,GAAGF;;;;;;;;;;;;;ACDjB,SAASG,eAAT,CAAuBC,KAAvB,EAA8BH,KAA9B,EAAqCI,SAArC,EAAgD;AAC9C,MAAIC,KAAK,GAAGD,SAAS,GAAG,CAAxB;AAAA,MACIE,MAAM,GAAGH,KAAK,CAACG,MADnB;;AAGA,SAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIH,KAAK,CAACE,KAAD,CAAL,KAAiBL,KAArB,EAA4B;AAC1B,aAAOK,KAAP;AACD;AACF;;AACD,SAAO,CAAC,CAAR;AACD;;IAEDE,cAAc,GAAGL;;ACtBjB,IAAIM,aAAa,GAAGC,wBAApB;AAAA,IACIV,SAAS,GAAGW,UADhB;AAAA,IAEIR,aAAa,GAAGS,cAFpB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,aAAT,CAAqBT,KAArB,EAA4BH,KAA5B,EAAmCI,SAAnC,EAA8C;AAC5C,SAAOJ,KAAK,KAAKA,KAAV,GACHE,aAAa,CAACC,KAAD,EAAQH,KAAR,EAAeI,SAAf,CADV,GAEHI,aAAa,CAACL,KAAD,EAAQJ,SAAR,EAAmBK,SAAnB,CAFjB;AAGD;;IAEDS,YAAc,GAAGD;;ACnBjB,IAAIA,WAAW,GAAGH,YAAlB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASK,eAAT,CAAuBX,KAAvB,EAA8BH,KAA9B,EAAqC;AACnC,MAAIM,MAAM,GAAGH,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACG,MAAvC;AACA,SAAO,CAAC,CAACA,MAAF,IAAYM,WAAW,CAACT,KAAD,EAAQH,KAAR,EAAe,CAAf,CAAX,GAA+B,CAAC,CAAnD;AACD;;IAEDe,cAAc,GAAGD;;;;;;;;;;;;ACPjB,SAASE,mBAAT,CAA2Bb,KAA3B,EAAkCH,KAAlC,EAAyCiB,UAAzC,EAAqD;AACnD,MAAIZ,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGH,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACG,MADvC;;AAGA,SAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIW,UAAU,CAACjB,KAAD,EAAQG,KAAK,CAACE,KAAD,CAAb,CAAd,EAAqC;AACnC,aAAO,IAAP;AACD;AACF;;AACD,SAAO,KAAP;AACD;;IAEDa,kBAAc,GAAGF;;ACrBjB,IAAIG,QAAQ,GAAGV,mBAAf;AAAA,IACIK,aAAa,GAAGJ,cADpB;AAAA,IAEIM,iBAAiB,GAAGL,kBAFxB;AAAA,IAGIS,QAAQ,GAAGC,kBAHf;AAAA,IAIIC,SAAS,GAAGC,qBAJhB;AAAA,IAKIC,QAAQ,GAAGC,mBALf;AAOA;;AACA,IAAIC,gBAAgB,GAAG,GAAvB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,gBAAT,CAAwBxB,KAAxB,EAA+ByB,MAA/B,EAAuCC,QAAvC,EAAiDZ,UAAjD,EAA6D;AAC3D,MAAIZ,KAAK,GAAG,CAAC,CAAb;AAAA,MACIyB,QAAQ,GAAGhB,aADf;AAAA,MAEIiB,QAAQ,GAAG,IAFf;AAAA,MAGIzB,MAAM,GAAGH,KAAK,CAACG,MAHnB;AAAA,MAII0B,MAAM,GAAG,EAJb;AAAA,MAKIC,YAAY,GAAGL,MAAM,CAACtB,MAL1B;;AAOA,MAAI,CAACA,MAAL,EAAa;AACX,WAAO0B,MAAP;AACD;;AACD,MAAIH,QAAJ,EAAc;AACZD,IAAAA,MAAM,GAAGR,QAAQ,CAACQ,MAAD,EAASN,SAAS,CAACO,QAAD,CAAlB,CAAjB;AACD;;AACD,MAAIZ,UAAJ,EAAgB;AACda,IAAAA,QAAQ,GAAGd,iBAAX;AACAe,IAAAA,QAAQ,GAAG,KAAX;AACD,GAHD,MAIK,IAAIH,MAAM,CAACtB,MAAP,IAAiBoB,gBAArB,EAAuC;AAC1CI,IAAAA,QAAQ,GAAGN,QAAX;AACAO,IAAAA,QAAQ,GAAG,KAAX;AACAH,IAAAA,MAAM,GAAG,IAAIT,QAAJ,CAAaS,MAAb,CAAT;AACD;;AACDM,EAAAA,KAAK,EACL,OAAO,EAAE7B,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIN,KAAK,GAAGG,KAAK,CAACE,KAAD,CAAjB;AAAA,QACI8B,QAAQ,GAAGN,QAAQ,IAAI,IAAZ,GAAmB7B,KAAnB,GAA2B6B,QAAQ,CAAC7B,KAAD,CADlD;AAGAA,IAAAA,KAAK,GAAIiB,UAAU,IAAIjB,KAAK,KAAK,CAAzB,GAA8BA,KAA9B,GAAsC,CAA9C;;AACA,QAAI+B,QAAQ,IAAII,QAAQ,KAAKA,QAA7B,EAAuC;AACrC,UAAIC,WAAW,GAAGH,YAAlB;;AACA,aAAOG,WAAW,EAAlB,EAAsB;AACpB,YAAIR,MAAM,CAACQ,WAAD,CAAN,KAAwBD,QAA5B,EAAsC;AACpC,mBAASD,KAAT;AACD;AACF;;AACDF,MAAAA,MAAM,CAACK,IAAP,CAAYrC,KAAZ;AACD,KARD,MASK,IAAI,CAAC8B,QAAQ,CAACF,MAAD,EAASO,QAAT,EAAmBlB,UAAnB,CAAb,EAA6C;AAChDe,MAAAA,MAAM,CAACK,IAAP,CAAYrC,KAAZ;AACD;AACF;;AACD,SAAOgC,MAAP;AACD;;IAEDM,eAAc,GAAGX;;AClEjB,IAAIY,QAAQ,GAAG9B,qBAAf;AAAA,IACI+B,QAAQ,GAAG9B,sBADf;AAAA,IAEI+B,WAAW,GAAG9B,yBAFlB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAAS+B,UAAT,CAAkBC,IAAlB,EAAwBC,KAAxB,EAA+B;AAC7B,SAAOH,WAAW,CAACD,QAAQ,CAACG,IAAD,EAAOC,KAAP,EAAcL,QAAd,CAAT,EAAkCI,IAAI,GAAG,EAAzC,CAAlB;AACD;;IAEDE,SAAc,GAAGH;;AChBjB,IAAII,WAAW,GAAGrC,2BAAlB;AAAA,IACIsC,YAAY,GAAGrC,6BADnB;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASsC,mBAAT,CAA2BhD,KAA3B,EAAkC;AAChC,SAAO+C,YAAY,CAAC/C,KAAD,CAAZ,IAAuB8C,WAAW,CAAC9C,KAAD,CAAzC;AACD;;IAEDiD,mBAAc,GAAGD;;AChCjB,IAAIrB,cAAc,GAAGlB,eAArB;AAAA,IACIyC,WAAW,GAAGxC,yBADlB;AAAA,IAEIgC,QAAQ,GAAG/B,SAFf;AAAA,IAGIqC,iBAAiB,GAAG3B,mBAHxB;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAI8B,UAAU,GAAGT,QAAQ,CAAC,UAASvC,KAAT,EAAgByB,MAAhB,EAAwB;AAChD,SAAOoB,iBAAiB,CAAC7C,KAAD,CAAjB,GACHwB,cAAc,CAACxB,KAAD,EAAQ+C,WAAW,CAACtB,MAAD,EAAS,CAAT,EAAYoB,iBAAZ,EAA+B,IAA/B,CAAnB,CADX,GAEH,EAFJ;AAGD,CAJwB,CAAzB;IAMAI,YAAc,GAAGD;;;;"}