tdesign-react 0.17.0-beta.0 → 0.18.1

package/{es/_chunks/dep-e2701664.js.map → esm/_chunks/dep-420a010b.js.map}

@@ -1 +1 @@
-{"version":3,"file":"dep-e2701664.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  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) {\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","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","TreeNode","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"],"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;AACjB,SAAOhB,WAAP;AACD;;ACdD,IAAIkB,QAAQ,GAAGC,UAAf;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;;;;;ACVjB,IAAQI,cAAR,GAA2Bd,OAAOM,SAAlC,CAAQQ,cAAR;AAEA,IAAMC,gBAAgB;AACpBC,EAAAA,aAAa,KADO;AAEpBC,EAAAA,WAAW,KAFS;AAGpBC,EAAAA,WAAW,KAHS;AAIpBC,EAAAA,UAAU,KAJU;AAKpBC,EAAAA,WAAW,KALS;AAMpBC,EAAAA,SAAS;AANW,CAAtB;YAWO;AA4EE,oBACLC,IADK,EAELC,IAFK,EAGLC,MAHK,EAIL;AAAA;;SACKD,OAAOA;SACPD,OAAOA;QAENG,SAASH,KAAKG,MAAL,IAAe;QACxBd,SAASc,OAAOd,MAAP,IAAiB;QAC1Be,OAAOC,MAAIL,MAAM,cAAV,IAA4B;QACnCM,eAAeF,KAAKG,QAAL,IAAiB;QAChCC,YAAYJ,KAAKK,KAAL,IAAc;QAC1BC,YAAYN,KAAKO,KAAL,IAAc;SAE3BC,QAAQ;SACRL,WAAW;SACXM,cAAc;SACdC,WAAW;SACXC,YAAY;SACZC,WAAW;SACXC,WAAW;SACXC,aAAa;;QAEZC,uCACD1B;AACH2B,MAAAA,SAAS;AACTC,MAAAA,UAAU;AACVC,MAAAA,SAAS;OACNrB;;QAECM,WAAWY,KAAKb;SAEjBiB,IAAIJ;SACJV,QAAQU,KAAKX,UAAL,IAAmB;SAC3BG,QAAQQ,KAAKT,UAAL,IAAmBtB,WAASC;SACpCW,KAAKwB,QAAQD,IAAI,KAAKZ,OAAO;;QAE9BT,UAAUA,kBAAkBuB,UAAU;WACnCvB,SAASA;WACT;WACAA,SAAS;;;QAKZK,aAAa,MAAM;WAChBA,WAAWA;;;SAIbmB,QAAQ;SACRC,UAAU;SAEVP,UAAUD,KAAKC;SACfQ;SAEAP,WAAWF,KAAKE;SAChBQ;SAEAP,UAAUH,KAAKG;SACfQ;SAEAC;SACAC,OAAO;;QAIRC,MAAMC,OAAN,CAAc3B,QAAd,GAAyB;WACtB4B,OAAO5B;eACHA,aAAa,IAAb,IAAqB,CAACJ,OAAOiC,MAAM;WACvCC;;;SAKFf,UAAU;SACVgB,gBAAgB;SAChBC;;;AA1JF;AAAA;AAAA,WAgKE,uBAAc;UACXvC,OAAwB,KAAxBA;UAAMW,QAAkB,KAAlBA;UAAOT,SAAW,KAAXA;UACbsC,gBAAkBxC,KAAKG,OAAvBqC;UACFlB,UAAY,KAAZA;gBACIpB,mBAAAA,6BAAAA,OAAQuC,SAAR;;UACNnB,WAAW,CAACkB,eAAe;aACxBE,WAAWnB,IAAIZ,OAAO;;;WAExBW,UAAUA;;AAxKZ;AAAA;AAAA,WA4KE,wBAAqB;UAClBtB,OAAS,KAATA;UACFqB,WAAa,KAAbA;UACElB,SAAWH,KAAXG;;UAEN,OAAOA,OAAOwC,WAAd,KAA8B,QAA9B,IACG,KAAKC,QAAL,KAAkBzC,OAAOwC,aAC5B;aACKE,YAAYtB,IAAI,KAAKZ,OAAO;mBACtB;;;UAETR,OAAO2C,WAAW;mBACT;;;UAET,KAAKvC,QAAL,KAAkB,IAAlB,IAA0BJ,OAAOiC,MAAM;mBAC9B;;;UAETf,UAAU;aACPwB,YAAYtB,IAAI,KAAKZ,OAAO;aAC5B;aACAkC,sBAAmB,KAAKlC;;;WAE1BU,WAAWA;;AAlMb;AAAA;AAAA,WAsME,uBAAoB;UACjBrB,OAAkB,KAAlBA;UAAMoB,UAAY,KAAZA;;UACVA,SAAS;aACN2B,WAAWxB,IAAI,KAAKZ,OAAO;;;AAzM/B;AAAA;AAAA,WAgNE,gBAAOV,IAAP,EAA0D;AAAA;;UACzD+C,OAAO;;UACT,CAACf,MAAMC,OAAN,CAAcjC,IAAd,GAAqB;aACnBgD,KAAKhD;aACL;aACAgD,oCAAQhD;;;UAEX+C,KAAK3E,MAAL,IAAe,GAAG;;;;UAGlB,CAAC4D,MAAMC,OAAN,CAAc,KAAK3B,QAAnB,GAA8B;aAC5BA,WAAW;;;UAEVA,WAAmB,KAAnBA;UAAUP,OAAS,KAATA;WACbkD,QAAQ,UAACC,IAAD,EAAU;YACjBC,OAAO;;YACPD,gBAAgB1B,UAAU;iBACrB0B;eACFE,SAAS,MAAKrD,MAAM;eACpB;iBACE,IAAIyB,QAAJ,CAAa,MAAKzB,IAAlB,EAAwBmD,IAAxB,EAA8B,KAA9B;mBACEF,KAAKG;;;WAGbpB,OAAO;WACPsB;;AAzOF;AAAA;AAAA,WA6OE,kBACLtD,IADK,EAELE,MAFK,EAGLqD,KAHK,EAIC;AAAA;;UACAC,aAAatD;UACf,CAACsD;UAECC,gBAAgBD,WAAWE,UAAX;UAChBC,iBAAiBF,cAAcG,IAAd,CAAmB,UAACR,IAAD;AAAA,eAAUA,KAAKzC,KAAL,KAAe,OAAKA,KAA9B;AAAA,OAAnB;;UACnBgD,gBAAgB;;;;UAKhB1B,MAAMC,OAAN,CAAcsB,WAAWjD,QAAzB,GAAoC;YAClCsD,cAAc;;YACd,OAAON,KAAP,KAAiB,UAAU;wBACfA;;;YAEVO,gBAAgBN,WAAWjD,QAAX,CAAoBsD,WAApB;;YAClBC,cAAcnD,KAAd,KAAwB,KAAKA,OAAO;;;;;WAMrCoD;WACA7D,SAASsD;UAEVQ,WAAW;;UACXR,sBAAsB/B,UAAU;YAC9B,CAACQ,MAAMC,OAAN,CAAcsB,WAAWjD,QAAzB,GAAoC;qBAC5BA,WAAW;;;mBAEbL,OAAOK;aACb;mBACMP,KAAKO;;;UAEd0B,MAAMC,OAAN,CAAc8B,QAAd,GAAyB;YACvB,OAAOT,KAAP,KAAiB,UAAU;mBACpBU,OAAOV,OAAO,GAAG;eACrB;mBACIN,KAAK;;;;UAMZiB,QAAQ,KAAKC,IAAL;YACRjB,QAAQ,UAACC,IAAD,EAAU;YAChBC,OAAOD;aACRnD,OAAOA;aACPwB,QAAQD,IAAI6B,KAAKzC,OAAOyC;;YACzBA,KAAK/B,UAAU;eACZwB,YAAYtB,IAAI6B,KAAKzC,OAAO;;;UAI/ByD,cAAcZ,WAAWW,IAAX;kBACRjB,QAAQ,UAACE,IAAD,EAAU;aACvBrB;aACAQ;;WAGFP;;AA9SF;AAAA;AAAA,WAkTE,gBACLmB,IADK,EAELI,KAFK,EAGC;UACEvD,OAAiB,KAAjBA;UAAME,SAAW,KAAXA;UACR8D,WAAW,KAAKK,WAAL;UACbjB,OAAO;;UACPD,gBAAgB1B,UAAU;eACrB0B;aACFE,SAASrD,MAAME,QAAQqD;iBACnBJ,MAAM;eACR,IAAI1B,QAAJ,CAAazB,IAAb,EAAmBmD,IAAnB,EAAyBjD,MAAzB;;YACH,OAAOqD,KAAP,KAAiB,UAAU;mBACpBU,OAAOV,OAAO,GAAGH;;;iBAEnBF,QAAQ,UAACoB,OAAD,EAAa;kBACpBvC;;;;WAGPC;;AArUF;AAAA;AAAA,WAyUE,sBAAauC,OAAb,EAA0C;UACzChB,QAAQ,KAAKiB,QAAL;WACTC,OAAOF,SAAShB;;AA3UlB;AAAA;AAAA,WA+UE,qBAAYgB,OAAZ,EAAyC;UACxChB,QAAQ,KAAKiB,QAAL;WACTC,OAAOF,SAAShB,QAAQ;;AAjV1B;AAAA;AAAA,WAqVE,kBAAe;UACZvD,OAAS,KAATA;UAEFkE,QAAQ,KAAKC,IAAL;UACRH,WAAW,KAAKK,WAAL;UACXd,QAAQ,KAAKiB,QAAL;;UAGVvC,MAAMC,OAAN,CAAc8B,QAAd,GAAyB;iBAClBC,OAAOV,OAAO;;;YAGnBL,QAAQ,UAACE,IAAD,EAAU;aACjBsB;;eAGExB,QAAQ,UAACE,IAAD,EAAU;aACpBrB;;WAGF4C;WACA3C;;AA1WF;AAAA;AAAA,WA8WE,iBAAc;UACXhC,OAAgB,KAAhBA;UAAMW,QAAU,KAAVA;WACToC,qBAAkBpC;WAClB+B,qBAAkB/B;WAClBkC,sBAAmBlC;WACnBa,kBAAeb;;AAnXjB;AAAA;AAAA;AAAA;;;;;;AAwXGR,gBAAAA,SAASE,MAAI,MAAM,cAAV,IAA4B;;sBACvC,KAAKE,QAAL,KAAkB,IAAlB,IAA0B,CAAC,KAAKR;;;;;sBAC9B,OAAOI,OAAOyE,IAAd,KAAuB;;;;;qBACpB7E,UAAU;qBACVgC;AACDiB,gBAAAA,OAAO;;uBACE7C,OAAOyE,IAAP,CAAY,IAAZ;;;;qBACR5E,KAAK6E,KAAK,QAAQ;AACrBzB,kBAAAA,MAAM,IADe;AAErBnD,kBAAAA,MAAM+C;AAFe;qBAIlBjD,UAAU;;oBACXkC,MAAMC,OAAN,CAAcc,IAAd,KAAuBA,KAAK3E,MAAL,GAAc,GAAG;uBACrC8D,OAAOa;uBACP;uBACAzC,WAAW;;;qBAEbwB;;;;;;;;OAzYN;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA,WA+YE,aAAIoB,IAAJ,EAA+B;AAAA;;UAC5BnD,OAAS,KAATA;UACFI,OAAO1B,OAAO0B,IAAP,CAAY+C,IAAZ;WACRD,QAAQ,UAACtE,GAAD,EAAS;YAChBY,eAAesF,IAAf,CAAoBrF,aAApB,EAAmCb,GAAnC,KAA2CA,QAAQ,SAAS;iBACzDA,OAAOuE,KAAKvE;;;WAGhBmG,QAAQ;;AAvZV;AAAA;AAAA,WA6ZE,qBAAsB;aACpB,KAAK7E;;AA9ZT;AAAA;AAAA,WAkaE,sBAAyB;UACxB8E,UAAU;UACZ5B,OAAO,KAAKlD;;aACTkD,MAAM;gBACHH,KAAKG;eACNA,KAAKlD;;;aAEP8E;;AAzaJ;AAAA;AAAA,WA6aE,uBAA0B;UACvB9E,SAAiB,KAAjBA;UAAQF,OAAS,KAATA;UACZgD,OAAmB;;UACnB9C,QAAQ;YACN+B,MAAMC,OAAN,CAAchC,OAAOK,QAArB,GAAgC;iBAC3BL,OAAOK;;iBAEPP,MAAM;eACRA,KAAKO;;;aAEPyC;;AAvbJ;AAAA;AAAA,WA2bE,mBAAoB;UACnBgC,UAAU,KAAKtB,UAAL;aACTsB,QAAQA,QAAQ3G,MAAR,GAAiB,EAAzB,IAA+B;;AA7bnC;AAAA;AAAA,WAkcE,oBAAmB;UAClB2E,OAAO,KAAKqB,WAAL;aACNrB,KAAKiC,OAAL,CAAa,IAAb;;AApcJ;AAAA;AAAA,WAwcE,mBAAsB;UACrBf,QAAQ,KAAKR,UAAL;YACRwB,QAAQ;aACPhB,MAAMiB,OAAN;;AA3cJ;AAAA;AAAA,WA+cE,oBAAmB;UAClBH,UAAU,KAAKtB,UAAL;aACTsB,QAAQ3G;;AAjdZ;AAAA;AAAA,WAudE,kBAAkB;uBAInB,KAAK2B;UAFPG,oBAAAA;UACAiF,uBAAAA;UAGEC,OAAO;;UACP,OAAOlF,OAAOmF,MAAd,KAAyB,YAAY;YACjCC,YAAY,KAAKC,QAAL;eACXrF,OAAOmF,MAAP,CAAcC,SAAd;;;UAGLF,MAAM;kBACE9D,IAAI,KAAKZ,OAAO;iBACjByE,UAAU/E,GAAV,CAAc,KAAKM,KAAnB,GAA2B;4BACnB,KAAKA;;;aAGjB0E;;AAzeJ;AAAA;AAAA,WA6eE,qBAAqB;UAExB7D,UACE,KAAKxB,KADPwB;UAGEG,UAAU;;UAGV,KAAKT,YAAY;eACZ;;;UAILM,QAAQnB,GAAR,CAAY,KAAKM,KAAjB,GAAyB;YAErB8E,gBAAgB,KAAKC,MAAL;YAGlBC,gBAAgB;YACdX,UAAU,KAAKtB,UAAL;;YACZsB,QAAQ3G,MAAR,GAAiB,GAAG;0BACN2G,QAAQY,KAAR,CAAc,UAACxC,IAAD;AAAA,mBAAoBA,KAAKyC,UAAL,EAApB;AAAA,WAAd;;;kBAIRF,iBAAiBF;aACtB;kBACK;;;aAEL9D;;AA1gBJ;AAAA;AAAA,WA8gBE,sBAAa;UACd,KAAKT,mBAAmB;UACtB4E,eAAezF,MAAI,MAAM;aACxB,CAAC,kBAAkB,KAAKR,QAAvB;;AAjhBL;AAAA;AAAA,WAqhBE,yBAAgB;aACd,CAAC,QAAM,MAAM,8BAA8B,KAAKH,WAA/C;;AAthBL;AAAA;AAAA,WA0hBE,uBAAc;aACZ,CAAC,QAAM,MAAM,4BAA4B,KAAKC,SAA7C;;AA3hBL;AAAA;AAAA,WA+hBE,uBAAc;aACZ,CAAC,QAAM,MAAM,4BAA4B,KAAKC,SAA7C;;AAhiBL;AAAA;AAAA,WAoiBE,mBAAUmG,GAAV,EAA+C;UAC5C/F,OAAgB,KAAhBA;UAAMW,QAAU,KAAVA;UACRoC,aAAagD,OAAO/F,KAAK+C;aACxB,CAAC,OAAOvB,QAAQnB,IAAIM,UAAUoC,WAAW1C,GAAX,CAAeM,KAAf,CAA7B;;AAviBL;AAAA;AAAA,WA2iBE,oBAAWoF,GAAX,EAAgD;UAC7C/F,OAA4B,KAA5BA;UAAMW,QAAsB,KAAtBA;UAAOO,aAAe,KAAfA;UACjBA,mBAAmB;UACjB2B,cAAckD,OAAO/F,KAAK6C;aACzB,CAAC,OAAOrB,QAAQnB,IAAIM,UAAUkC,YAAYxC,GAAZ,CAAgBM,KAAhB,CAA7B;;AA/iBL;AAAA;AAAA,WAojBE,mBAAUoF,GAAV,EAAoC;UACjCxF,WAAmB,KAAnBA;UAAUP,OAAS,KAATA;UACVwC,gBAAkBxC,KAAKG,OAAvBqC;UACJlB,UAAU;UACRoB,aAAaqD,OAAO/F,KAAK0C;;UAC3B1C,KAAKwB,OAAL,CAAanB,GAAb,CAAiB,KAAKM,KAAtB,GAA8B;YAC5B+B,WAAWrC,GAAX,CAAe,KAAKM,KAApB,GAA4B;oBAEpB;mBAEVsB,MAAMC,OAAN,CAAc3B,QAAd,KACGA,SAASlC,MAAT,GAAkB,CADrB,IAEG,CAACmE,eACJ;oBAEUjC,SAASqF,KAAT,CAAe,UAACxC,IAAD,EAAU;gBAC3B4C,iBAAiB5C,KAAKX,SAAL,CAAeC,UAAf;mBAChBsD;WAFC;mBAID,CAACxD,eAAe;cAGnBwC,UAAU,KAAKtB,UAAL;oBACNsB,QAAQpB,IAAR,CAAa,UAACR,IAAD;AAAA,mBAAUV,WAAWrC,GAAX,CAAe+C,KAAKzC,KAApB,CAAV;AAAA,WAAb;;;;aAGP,CAAC,CAACW;;AA9kBN;AAAA;AAAA,WAklBE,2BAA2B;UACxBf,WAAmB,KAAnBA;UAAUP,OAAS,KAATA;UACVwC,gBAAkBxC,KAAKG,OAAvBqC;;UACJA,eAAe;eACV;;;UAELF,gBAAgB;;UAChBL,MAAMC,OAAN,CAAc3B,QAAd,GAAyB;YAEvB0F,eAA+B;wBACnB1F,SAASqD,IAAT,CAAc,UAACR,IAAD,EAAoB;cAC5CA,KAAK8C,eAAL,IAAwB;mBAEnB;;;cAELD,iBAAiB,MAAM;2BACV7C,KAAKX,SAAL;;;cAEbwD,iBAAiB7C,KAAKX,SAAL,IAAkB;mBAE9B;;;iBAEF;SAZO;;;aAeXH;;AA3mBJ;AAAA;AAAA,WA8mBE,mBAAmB;UAClB0B,WAAW,KAAKK,WAAL;aACVL,SAAS,EAAT,KAAgB;;AAhnBpB;AAAA;AAAA,WAmnBE,kBAAkB;UACjBA,WAAW,KAAKK,WAAL;aACVL,SAASA,SAAS3F,MAAT,GAAkB,EAA3B,KAAkC;;AArnBtC;AAAA;AAAA,WAynBE,kBAAkB;UACnB8H,SAAS;;UACTlE,MAAMC,OAAN,CAAc,KAAK3B,QAAnB,GAA8B;iBACvB,KAAKA,QAAL,CAAclC,MAAd,IAAwB;aAC5B;iBACI,CAAC,KAAKkC;;;aAEV4F;;AAhoBJ;AAAA;AAAA,WAuoBE,cAAKC,SAAL,EAA+B;WAC/BlF,aAAakF;WACb/E,WAAW,KAAKwE,UAAL;WACXlE,UAAU,KAAK0E,SAAL;;AA1oBZ;AAAA;AAAA,WA8oBE,yBAAsB;WACtBtE;;UAED,KAAKV,QAAL,IAAiB,KAAKd,QAAL,KAAkB,MAAM;aACtC8B;;;AAlpBJ;AAAA;AAAA,WAupBE,0BAAkC;aAChC,KAAKiE,WAAL,CAAiB,CAAC,KAAKT,UAAL,EAAlB;;AAxpBJ;AAAA;AAAA,WA4pBE,qBAAYxE,QAAZ,EAA+BkF,IAA/B,EAA2E;UACxEvG,OAAS,KAATA;;UACFwG;AACJC,QAAAA,UAAU;SACPF;;UAGDR,MAAM/F,KAAK6C;;UACX,CAAC2D,QAAQC,UAAU;cACf,IAAIC,GAAJ,CAAQ1G,KAAK6C,WAAb;;;UAIJxB,UAAU;YACNsF,oBAAoB;0BACR1D,KAAK;;YACnB5C,MAAIL,MAAM,wBAAwB;eAC/B0D,aAAaR,QAAQ,UAACE,IAAD,EAAU;8BAChBH,KAAKG;;;;0BAGTF,QAAQ,UAACE,IAAD,EAAU;cAC9BwD,gBAAgB;;cAChBxD,KAAKlD,QAAQ;4BACCkD,KAAKlD,MAAL,CAAY0G,aAAZ;iBACX;AAAA;;4BACW5G,iBAAAA,2CAAAA,KAAMG,uDAAN,aAAcT;;;cAE5BkH,eAAe;gBACX5C,WAAWZ,KAAKiB,WAAL;qBACRnB,QAAQ,UAAC2D,KAAD,EAAW;4BACfA,MAAMlG;;;;cAGjBY,IAAI6B,KAAKzC,OAAO;;aAEjB;sBACM,KAAKA;;;UAGd6F,QAAQC,UAAU;aACfK;aACA/E;aACAgF;;;aAGA/G,KAAKgH,WAAL,CAAiBjB,GAAjB;;AA1sBJ;AAAA;AAAA,WA8sBE,yBAAiC;aAC/B,KAAKkB,UAAL,CAAgB,CAAC,KAAKC,SAAL,EAAjB;;AA/sBJ;AAAA;AAAA,WAmtBE,oBAAW9F,OAAX,EAA6BmF,IAA7B,EAAyE;UACtEvG,OAAS,KAATA;;UACFwG;AACJC,QAAAA,UAAU;SACPF;;UAECpG,SAASH,KAAKG,MAAL,IAAe;UAC1B4F,MAAM/F,KAAK+C;;UACX,CAACyD,QAAQC,UAAU;cACf,IAAIC,GAAJ,CAAQ1G,KAAK+C,UAAb;;;UAEJ,KAAKoE,WAAL,IAAoB;YAClB/F,SAAS;cACP,CAACjB,OAAOiH,gBAAgB;gBACtBC;;;cAEF9F,IAAI,KAAKZ,OAAO;eACf;wBACM,KAAKA;;;;UAGhB6F,QAAQC,UAAU;aACf1E;;;aAEA/B,KAAKsH,UAAL,CAAgBvB,GAAhB;;AA3uBJ;AAAA;AAAA,WA+uBE,yBAAiC;aAC/B,KAAKwB,UAAL,CAAgB,CAAC,KAAK9E,SAAL,EAAjB;;AAhvBJ;AAAA;AAAA,WAqvBE,oBAAWnB,OAAX,EAA6BiF,IAA7B,EAAyE;UACtEvG,OAAS,KAATA;UACFG,SAASH,KAAKG,MAAL,IAAe;;UACxBqG;AACJC,QAAAA,UAAU;SACPF;;UAEDR,MAAM/F,KAAK0C;;UACX,CAAC8D,QAAQC,UAAU;cACf,IAAIC,GAAJ,CAAQ1G,KAAK0C,UAAb;;;UAEJ,KAAK8E,WAAL,MAAsBlG,YAAY,KAAKmB,SAAL,IAAkB;YAClDtC,OAAOqC,eAAe;cACpBlB,SAAS;gBACPC,IAAI,KAAKZ,OAAO;iBACf;0BACM,KAAKA;;eAEb;cACCJ,WAAW,KAAK4D,IAAL;mBAERjB,QAAQ,UAACE,IAAD,EAAU;gBACrB9B,SAAS;kBACPC,IAAI6B,KAAKzC,OAAO;mBACf;4BACMyC,KAAKzC;;;cAKdqE,UAAU,KAAKtB,UAAL;kBACRR,QAAQ,UAACE,IAAD,EAAU;0BACbA,KAAKzC;;;;;UAIlB6F,QAAQC,UAAU;YAChBtG,OAAOqC,eAAe;eACnBD;eACA;cACCkF,eAAezH,KAAK0H,eAAL,CAAqB,CAAC,KAAK/G,KAAN,CAArB;uBACRuC,QAAQ,UAACE,IAAD,EAAU;iBACxBb;;;;;aAIJvC,KAAK2H,UAAL,CAAgB5B,GAAhB;;AAnyBJ;AAAA;AAAA,WAyyBE,kBAAe;WACfrE,QAAQ,KAAKkB,QAAL;WACRxB,UAAU,KAAK8F,SAAL;WACV7F,WAAW,KAAKwE,UAAL;WACXhF,cAAc,KAAK2G,WAAL;WACd7F,UAAU,KAAK0E,SAAL;WACVpF,WAAW,KAAKyE,MAAL;WACX3E,YAAY,KAAK6G,OAAL;WACZ5G,WAAW,KAAK6G,MAAL;WACX/G,WAAW,KAAKqF,MAAL;WACXnG,KAAK+E,QAAQ;;AAnzBf;AAAA;AAAA,WAuzBE,yBAAsB;UACnB/E,OAAS,KAATA;WACHa,cAAc,KAAK2G,WAAL;;UACf,KAAK3G,aAAa;aACfS,UAAU,KAAKmB,SAAL;;YACX,KAAKnB,SAAS;eACXoB,WAAWnB,IAAI,KAAKZ,OAAO;;;aAE7B2B,gBAAgB,KAAK4D,eAAL;aAChBnB,QAAQ;;;AAh0BZ;AAAA;AAAA,WAs0BE,0BAAuB;UACpBxE,WAAa,KAAbA;;UACJ0B,MAAMC,OAAN,CAAc3B,QAAd,GAAyB;iBAClB2C,QAAQ,UAACE,IAAD,EAAU;eACpBrB;eACAQ;eACAwE;;;;AA50BN;AAAA;AAAA,WAm1BE,yBAAsB;UACnB7G,SAAW,KAAXA;;UACJA,QAAQ;eACH6B;eACAQ;eACAoC;;;AAx1BN;AAAA;AAAA,WA61BE,yBAAgB;UACb3E,OAAS,KAATA;UACFyH,eAAezH,KAAK0H,eAAL,CAAqB,CAAC,KAAK/G,KAAN,CAArB;mBACRuC,QAAQ,UAACE,IAAD,EAAU;aACxBrB;aACAQ;;WAEFP;;AAp2BF;AAAA;AAAA,WA02BE,gBAAmB;UAChBzB,WAAa,KAAbA;UACJyC,OAAmB;WAClBC,KAAK;;UACNhB,MAAMC,OAAN,CAAc3B,QAAd,KAA2BA,SAASlC,MAAT,GAAkB,GAAG;iBACzC6E,QAAQ,UAACE,IAAD,EAAU;iBAClBJ,KAAK8E,MAAL,CAAY1E,KAAKe,IAAL,EAAZ;;;;aAGJnB;;AAn3BJ;AAAA;AAAA,WAy3BE,oBAA8B;UAC7BpC,QAAU,KAAVA;;UACF,CAACA,OAAO;gBACFmH,gBAAgB;aACnBnH,QAAQA;;;sBAECA,OAAO;aAChBA;;AAh4BJ;;AAAA;AAAA;;;;"}
+{"version":3,"file":"dep-420a010b.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  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) {\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","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","TreeNode","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"],"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;AACjB,SAAOhB,WAAP;AACD;;ACdD,IAAIkB,QAAQ,GAAGC,UAAf;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;;;;;ACVjB,IAAQI,cAAR,GAA2Bd,OAAOM,SAAlC,CAAQQ,cAAR;AAEA,IAAMC,gBAAgB;AACpBC,EAAAA,aAAa,KADO;AAEpBC,EAAAA,WAAW,KAFS;AAGpBC,EAAAA,WAAW,KAHS;AAIpBC,EAAAA,UAAU,KAJU;AAKpBC,EAAAA,WAAW,KALS;AAMpBC,EAAAA,SAAS;AANW,CAAtB;YAWO;AA4EE,oBACLC,IADK,EAELC,IAFK,EAGLC,MAHK,EAIL;AAAA;;SACKD,OAAOA;SACPD,OAAOA;QAENG,SAASH,KAAKG,MAAL,IAAe;QACxBd,SAASc,OAAOd,MAAP,IAAiB;QAC1Be,OAAOC,MAAIL,MAAM,cAAV,IAA4B;QACnCM,eAAeF,KAAKG,QAAL,IAAiB;QAChCC,YAAYJ,KAAKK,KAAL,IAAc;QAC1BC,YAAYN,KAAKO,KAAL,IAAc;SAE3BC,QAAQ;SACRL,WAAW;SACXM,cAAc;SACdC,WAAW;SACXC,YAAY;SACZC,WAAW;SACXC,WAAW;SACXC,aAAa;;QAEZC,uCACD1B;AACH2B,MAAAA,SAAS;AACTC,MAAAA,UAAU;AACVC,MAAAA,SAAS;OACNrB;;QAECM,WAAWY,KAAKb;SAEjBiB,IAAIJ;SACJV,QAAQU,KAAKX,UAAL,IAAmB;SAC3BG,QAAQQ,KAAKT,UAAL,IAAmBtB,WAASC;SACpCW,KAAKwB,QAAQD,IAAI,KAAKZ,OAAO;;QAE9BT,UAAUA,kBAAkBuB,UAAU;WACnCvB,SAASA;WACT;WACAA,SAAS;;;QAKZK,aAAa,MAAM;WAChBA,WAAWA;;;SAIbmB,QAAQ;SACRC,UAAU;SAEVP,UAAUD,KAAKC;SACfQ;SAEAP,WAAWF,KAAKE;SAChBQ;SAEAP,UAAUH,KAAKG;SACfQ;SAEAC;SACAC,OAAO;;QAIRC,MAAMC,OAAN,CAAc3B,QAAd,GAAyB;WACtB4B,OAAO5B;eACHA,aAAa,IAAb,IAAqB,CAACJ,OAAOiC,MAAM;WACvCC;;;SAKFf,UAAU;SACVgB,gBAAgB;SAChBC;;;AA1JF;AAAA;AAAA,WAgKE,uBAAc;UACXvC,OAAwB,KAAxBA;UAAMW,QAAkB,KAAlBA;UAAOT,SAAW,KAAXA;UACbsC,gBAAkBxC,KAAKG,OAAvBqC;UACFlB,UAAY,KAAZA;gBACIpB,mBAAAA,6BAAAA,OAAQuC,SAAR;;UACNnB,WAAW,CAACkB,eAAe;aACxBE,WAAWnB,IAAIZ,OAAO;;;WAExBW,UAAUA;;AAxKZ;AAAA;AAAA,WA4KE,wBAAqB;UAClBtB,OAAS,KAATA;UACFqB,WAAa,KAAbA;UACElB,SAAWH,KAAXG;;UAEN,OAAOA,OAAOwC,WAAd,KAA8B,QAA9B,IACG,KAAKC,QAAL,KAAkBzC,OAAOwC,aAC5B;aACKE,YAAYtB,IAAI,KAAKZ,OAAO;mBACtB;;;UAETR,OAAO2C,WAAW;mBACT;;;UAET,KAAKvC,QAAL,KAAkB,IAAlB,IAA0BJ,OAAOiC,MAAM;mBAC9B;;;UAETf,UAAU;aACPwB,YAAYtB,IAAI,KAAKZ,OAAO;aAC5B;aACAkC,sBAAmB,KAAKlC;;;WAE1BU,WAAWA;;AAlMb;AAAA;AAAA,WAsME,uBAAoB;UACjBrB,OAAkB,KAAlBA;UAAMoB,UAAY,KAAZA;;UACVA,SAAS;aACN2B,WAAWxB,IAAI,KAAKZ,OAAO;;;AAzM/B;AAAA;AAAA,WAgNE,gBAAOV,IAAP,EAA0D;AAAA;;UACzD+C,OAAO;;UACT,CAACf,MAAMC,OAAN,CAAcjC,IAAd,GAAqB;aACnBgD,KAAKhD;aACL;aACAgD,oCAAQhD;;;UAEX+C,KAAK3E,MAAL,IAAe,GAAG;;;;UAGlB,CAAC4D,MAAMC,OAAN,CAAc,KAAK3B,QAAnB,GAA8B;aAC5BA,WAAW;;;UAEVA,WAAmB,KAAnBA;UAAUP,OAAS,KAATA;WACbkD,QAAQ,UAACC,IAAD,EAAU;YACjBC,OAAO;;YACPD,gBAAgB1B,UAAU;iBACrB0B;eACFE,SAAS,MAAKrD,MAAM;eACpB;iBACE,IAAIyB,QAAJ,CAAa,MAAKzB,IAAlB,EAAwBmD,IAAxB,EAA8B,KAA9B;mBACEF,KAAKG;;;WAGbpB,OAAO;WACPsB;;AAzOF;AAAA;AAAA,WA6OE,kBACLtD,IADK,EAELE,MAFK,EAGLqD,KAHK,EAIC;AAAA;;UACAC,aAAatD;UACf,CAACsD;UAECC,gBAAgBD,WAAWE,UAAX;UAChBC,iBAAiBF,cAAcG,IAAd,CAAmB,UAACR,IAAD;AAAA,eAAUA,KAAKzC,KAAL,KAAe,OAAKA,KAA9B;AAAA,OAAnB;;UACnBgD,gBAAgB;;;;UAKhB1B,MAAMC,OAAN,CAAcsB,WAAWjD,QAAzB,GAAoC;YAClCsD,cAAc;;YACd,OAAON,KAAP,KAAiB,UAAU;wBACfA;;;YAEVO,gBAAgBN,WAAWjD,QAAX,CAAoBsD,WAApB;;YAClBC,cAAcnD,KAAd,KAAwB,KAAKA,OAAO;;;;;WAMrCoD;WACA7D,SAASsD;UAEVQ,WAAW;;UACXR,sBAAsB/B,UAAU;YAC9B,CAACQ,MAAMC,OAAN,CAAcsB,WAAWjD,QAAzB,GAAoC;qBAC5BA,WAAW;;;mBAEbL,OAAOK;aACb;mBACMP,KAAKO;;;UAEd0B,MAAMC,OAAN,CAAc8B,QAAd,GAAyB;YACvB,OAAOT,KAAP,KAAiB,UAAU;mBACpBU,OAAOV,OAAO,GAAG;eACrB;mBACIN,KAAK;;;;UAMZiB,QAAQ,KAAKC,IAAL;YACRjB,QAAQ,UAACC,IAAD,EAAU;YAChBC,OAAOD;aACRnD,OAAOA;aACPwB,QAAQD,IAAI6B,KAAKzC,OAAOyC;;YACzBA,KAAK/B,UAAU;eACZwB,YAAYtB,IAAI6B,KAAKzC,OAAO;;;UAI/ByD,cAAcZ,WAAWW,IAAX;kBACRjB,QAAQ,UAACE,IAAD,EAAU;aACvBrB;aACAQ;;WAGFP;;AA9SF;AAAA;AAAA,WAkTE,gBACLmB,IADK,EAELI,KAFK,EAGC;UACEvD,OAAiB,KAAjBA;UAAME,SAAW,KAAXA;UACR8D,WAAW,KAAKK,WAAL;UACbjB,OAAO;;UACPD,gBAAgB1B,UAAU;eACrB0B;aACFE,SAASrD,MAAME,QAAQqD;iBACnBJ,MAAM;eACR,IAAI1B,QAAJ,CAAazB,IAAb,EAAmBmD,IAAnB,EAAyBjD,MAAzB;;YACH,OAAOqD,KAAP,KAAiB,UAAU;mBACpBU,OAAOV,OAAO,GAAGH;;;iBAEnBF,QAAQ,UAACoB,OAAD,EAAa;kBACpBvC;;;;WAGPC;;AArUF;AAAA;AAAA,WAyUE,sBAAauC,OAAb,EAA0C;UACzChB,QAAQ,KAAKiB,QAAL;WACTC,OAAOF,SAAShB;;AA3UlB;AAAA;AAAA,WA+UE,qBAAYgB,OAAZ,EAAyC;UACxChB,QAAQ,KAAKiB,QAAL;WACTC,OAAOF,SAAShB,QAAQ;;AAjV1B;AAAA;AAAA,WAqVE,kBAAe;UACZvD,OAAS,KAATA;UAEFkE,QAAQ,KAAKC,IAAL;UACRH,WAAW,KAAKK,WAAL;UACXd,QAAQ,KAAKiB,QAAL;;UAGVvC,MAAMC,OAAN,CAAc8B,QAAd,GAAyB;iBAClBC,OAAOV,OAAO;;;YAGnBL,QAAQ,UAACE,IAAD,EAAU;aACjBsB;;eAGExB,QAAQ,UAACE,IAAD,EAAU;aACpBrB;;WAGF4C;WACA3C;;AA1WF;AAAA;AAAA,WA8WE,iBAAc;UACXhC,OAAgB,KAAhBA;UAAMW,QAAU,KAAVA;WACToC,qBAAkBpC;WAClB+B,qBAAkB/B;WAClBkC,sBAAmBlC;WACnBa,kBAAeb;;AAnXjB;AAAA;AAAA;AAAA;;;;;;AAwXGR,gBAAAA,SAASE,MAAI,MAAM,cAAV,IAA4B;;sBACvC,KAAKE,QAAL,KAAkB,IAAlB,IAA0B,CAAC,KAAKR;;;;;sBAC9B,OAAOI,OAAOyE,IAAd,KAAuB;;;;;qBACpB7E,UAAU;qBACVgC;AACDiB,gBAAAA,OAAO;;uBACE7C,OAAOyE,IAAP,CAAY,IAAZ;;;;qBACR5E,KAAK6E,KAAK,QAAQ;AACrBzB,kBAAAA,MAAM,IADe;AAErBnD,kBAAAA,MAAM+C;AAFe;qBAIlBjD,UAAU;;oBACXkC,MAAMC,OAAN,CAAcc,IAAd,KAAuBA,KAAK3E,MAAL,GAAc,GAAG;uBACrC8D,OAAOa;uBACP;uBACAzC,WAAW;;;qBAEbwB;;;;;;;;OAzYN;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA,WA+YE,aAAIoB,IAAJ,EAA+B;AAAA;;UAC5BnD,OAAS,KAATA;UACFI,OAAO1B,OAAO0B,IAAP,CAAY+C,IAAZ;WACRD,QAAQ,UAACtE,GAAD,EAAS;YAChBY,eAAesF,IAAf,CAAoBrF,aAApB,EAAmCb,GAAnC,KAA2CA,QAAQ,SAAS;iBACzDA,OAAOuE,KAAKvE;;;WAGhBmG,QAAQ;;AAvZV;AAAA;AAAA,WA6ZE,qBAAsB;aACpB,KAAK7E;;AA9ZT;AAAA;AAAA,WAkaE,sBAAyB;UACxB8E,UAAU;UACZ5B,OAAO,KAAKlD;;aACTkD,MAAM;gBACHH,KAAKG;eACNA,KAAKlD;;;aAEP8E;;AAzaJ;AAAA;AAAA,WA6aE,uBAA0B;UACvB9E,SAAiB,KAAjBA;UAAQF,OAAS,KAATA;UACZgD,OAAmB;;UACnB9C,QAAQ;YACN+B,MAAMC,OAAN,CAAchC,OAAOK,QAArB,GAAgC;iBAC3BL,OAAOK;;iBAEPP,MAAM;eACRA,KAAKO;;;aAEPyC;;AAvbJ;AAAA;AAAA,WA2bE,mBAAoB;UACnBgC,UAAU,KAAKtB,UAAL;aACTsB,QAAQA,QAAQ3G,MAAR,GAAiB,EAAzB,IAA+B;;AA7bnC;AAAA;AAAA,WAkcE,oBAAmB;UAClB2E,OAAO,KAAKqB,WAAL;aACNrB,KAAKiC,OAAL,CAAa,IAAb;;AApcJ;AAAA;AAAA,WAwcE,mBAAsB;UACrBf,QAAQ,KAAKR,UAAL;YACRwB,QAAQ;aACPhB,MAAMiB,OAAN;;AA3cJ;AAAA;AAAA,WA+cE,oBAAmB;UAClBH,UAAU,KAAKtB,UAAL;aACTsB,QAAQ3G;;AAjdZ;AAAA;AAAA,WAudE,kBAAkB;uBAInB,KAAK2B;UAFPG,oBAAAA;UACAiF,uBAAAA;UAGEC,OAAO;;UACP,OAAOlF,OAAOmF,MAAd,KAAyB,YAAY;YACjCC,YAAY,KAAKC,QAAL;eACXrF,OAAOmF,MAAP,CAAcC,SAAd;;;UAGLF,MAAM;kBACE9D,IAAI,KAAKZ,OAAO;iBACjByE,UAAU/E,GAAV,CAAc,KAAKM,KAAnB,GAA2B;4BACnB,KAAKA;;;aAGjB0E;;AAzeJ;AAAA;AAAA,WA6eE,qBAAqB;UAExB7D,UACE,KAAKxB,KADPwB;UAGEG,UAAU;;UAGV,KAAKT,YAAY;eACZ;;;UAILM,QAAQnB,GAAR,CAAY,KAAKM,KAAjB,GAAyB;YAErB8E,gBAAgB,KAAKC,MAAL;YAGlBC,gBAAgB;YACdX,UAAU,KAAKtB,UAAL;;YACZsB,QAAQ3G,MAAR,GAAiB,GAAG;0BACN2G,QAAQY,KAAR,CAAc,UAACxC,IAAD;AAAA,mBAAoBA,KAAKyC,UAAL,EAApB;AAAA,WAAd;;;kBAIRF,iBAAiBF;aACtB;kBACK;;;aAEL9D;;AA1gBJ;AAAA;AAAA,WA8gBE,sBAAa;UACd,KAAKT,mBAAmB;UACtB4E,eAAezF,MAAI,MAAM;aACxB,CAAC,kBAAkB,KAAKR,QAAvB;;AAjhBL;AAAA;AAAA,WAqhBE,yBAAgB;aACd,CAAC,QAAM,MAAM,8BAA8B,KAAKH,WAA/C;;AAthBL;AAAA;AAAA,WA0hBE,uBAAc;aACZ,CAAC,QAAM,MAAM,4BAA4B,KAAKC,SAA7C;;AA3hBL;AAAA;AAAA,WA+hBE,uBAAc;aACZ,CAAC,QAAM,MAAM,4BAA4B,KAAKC,SAA7C;;AAhiBL;AAAA;AAAA,WAoiBE,mBAAUmG,GAAV,EAA+C;UAC5C/F,OAAgB,KAAhBA;UAAMW,QAAU,KAAVA;UACRoC,aAAagD,OAAO/F,KAAK+C;aACxB,CAAC,OAAOvB,QAAQnB,IAAIM,UAAUoC,WAAW1C,GAAX,CAAeM,KAAf,CAA7B;;AAviBL;AAAA;AAAA,WA2iBE,oBAAWoF,GAAX,EAAgD;UAC7C/F,OAA4B,KAA5BA;UAAMW,QAAsB,KAAtBA;UAAOO,aAAe,KAAfA;UACjBA,mBAAmB;UACjB2B,cAAckD,OAAO/F,KAAK6C;aACzB,CAAC,OAAOrB,QAAQnB,IAAIM,UAAUkC,YAAYxC,GAAZ,CAAgBM,KAAhB,CAA7B;;AA/iBL;AAAA;AAAA,WAojBE,mBAAUoF,GAAV,EAAoC;UACjCxF,WAAmB,KAAnBA;UAAUP,OAAS,KAATA;UACVwC,gBAAkBxC,KAAKG,OAAvBqC;UACJlB,UAAU;UACRoB,aAAaqD,OAAO/F,KAAK0C;;UAC3B1C,KAAKwB,OAAL,CAAanB,GAAb,CAAiB,KAAKM,KAAtB,GAA8B;YAC5B+B,WAAWrC,GAAX,CAAe,KAAKM,KAApB,GAA4B;oBAEpB;mBAEVsB,MAAMC,OAAN,CAAc3B,QAAd,KACGA,SAASlC,MAAT,GAAkB,CADrB,IAEG,CAACmE,eACJ;oBAEUjC,SAASqF,KAAT,CAAe,UAACxC,IAAD,EAAU;gBAC3B4C,iBAAiB5C,KAAKX,SAAL,CAAeC,UAAf;mBAChBsD;WAFC;mBAID,CAACxD,eAAe;cAGnBwC,UAAU,KAAKtB,UAAL;oBACNsB,QAAQpB,IAAR,CAAa,UAACR,IAAD;AAAA,mBAAUV,WAAWrC,GAAX,CAAe+C,KAAKzC,KAApB,CAAV;AAAA,WAAb;;;;aAGP,CAAC,CAACW;;AA9kBN;AAAA;AAAA,WAklBE,2BAA2B;UACxBf,WAAmB,KAAnBA;UAAUP,OAAS,KAATA;UACVwC,gBAAkBxC,KAAKG,OAAvBqC;;UACJA,eAAe;eACV;;;UAELF,gBAAgB;;UAChBL,MAAMC,OAAN,CAAc3B,QAAd,GAAyB;YAEvB0F,eAA+B;wBACnB1F,SAASqD,IAAT,CAAc,UAACR,IAAD,EAAoB;cAC5CA,KAAK8C,eAAL,IAAwB;mBAEnB;;;cAELD,iBAAiB,MAAM;2BACV7C,KAAKX,SAAL;;;cAEbwD,iBAAiB7C,KAAKX,SAAL,IAAkB;mBAE9B;;;iBAEF;SAZO;;;aAeXH;;AA3mBJ;AAAA;AAAA,WA8mBE,mBAAmB;UAClB0B,WAAW,KAAKK,WAAL;aACVL,SAAS,EAAT,KAAgB;;AAhnBpB;AAAA;AAAA,WAmnBE,kBAAkB;UACjBA,WAAW,KAAKK,WAAL;aACVL,SAASA,SAAS3F,MAAT,GAAkB,EAA3B,KAAkC;;AArnBtC;AAAA;AAAA,WAynBE,kBAAkB;UACnB8H,SAAS;;UACTlE,MAAMC,OAAN,CAAc,KAAK3B,QAAnB,GAA8B;iBACvB,KAAKA,QAAL,CAAclC,MAAd,IAAwB;aAC5B;iBACI,CAAC,KAAKkC;;;aAEV4F;;AAhoBJ;AAAA;AAAA,WAuoBE,cAAKC,SAAL,EAA+B;WAC/BlF,aAAakF;WACb/E,WAAW,KAAKwE,UAAL;WACXlE,UAAU,KAAK0E,SAAL;;AA1oBZ;AAAA;AAAA,WA8oBE,yBAAsB;WACtBtE;;UAED,KAAKV,QAAL,IAAiB,KAAKd,QAAL,KAAkB,MAAM;aACtC8B;;;AAlpBJ;AAAA;AAAA,WAupBE,0BAAkC;aAChC,KAAKiE,WAAL,CAAiB,CAAC,KAAKT,UAAL,EAAlB;;AAxpBJ;AAAA;AAAA,WA4pBE,qBAAYxE,QAAZ,EAA+BkF,IAA/B,EAA2E;UACxEvG,OAAS,KAATA;;UACFwG;AACJC,QAAAA,UAAU;SACPF;;UAGDR,MAAM/F,KAAK6C;;UACX,CAAC2D,QAAQC,UAAU;cACf,IAAIC,GAAJ,CAAQ1G,KAAK6C,WAAb;;;UAIJxB,UAAU;YACNsF,oBAAoB;0BACR1D,KAAK;;YACnB5C,MAAIL,MAAM,wBAAwB;eAC/B0D,aAAaR,QAAQ,UAACE,IAAD,EAAU;8BAChBH,KAAKG;;;;0BAGTF,QAAQ,UAACE,IAAD,EAAU;cAC9BwD,gBAAgB;;cAChBxD,KAAKlD,QAAQ;4BACCkD,KAAKlD,MAAL,CAAY0G,aAAZ;iBACX;AAAA;;4BACW5G,iBAAAA,2CAAAA,KAAMG,uDAAN,aAAcT;;;cAE5BkH,eAAe;gBACX5C,WAAWZ,KAAKiB,WAAL;qBACRnB,QAAQ,UAAC2D,KAAD,EAAW;4BACfA,MAAMlG;;;;cAGjBY,IAAI6B,KAAKzC,OAAO;;aAEjB;sBACM,KAAKA;;;UAGd6F,QAAQC,UAAU;aACfK;aACA/E;aACAgF;;;aAGA/G,KAAKgH,WAAL,CAAiBjB,GAAjB;;AA1sBJ;AAAA;AAAA,WA8sBE,yBAAiC;aAC/B,KAAKkB,UAAL,CAAgB,CAAC,KAAKC,SAAL,EAAjB;;AA/sBJ;AAAA;AAAA,WAmtBE,oBAAW9F,OAAX,EAA6BmF,IAA7B,EAAyE;UACtEvG,OAAS,KAATA;;UACFwG;AACJC,QAAAA,UAAU;SACPF;;UAECpG,SAASH,KAAKG,MAAL,IAAe;UAC1B4F,MAAM/F,KAAK+C;;UACX,CAACyD,QAAQC,UAAU;cACf,IAAIC,GAAJ,CAAQ1G,KAAK+C,UAAb;;;UAEJ,KAAKoE,WAAL,IAAoB;YAClB/F,SAAS;cACP,CAACjB,OAAOiH,gBAAgB;gBACtBC;;;cAEF9F,IAAI,KAAKZ,OAAO;eACf;wBACM,KAAKA;;;;UAGhB6F,QAAQC,UAAU;aACf1E;;;aAEA/B,KAAKsH,UAAL,CAAgBvB,GAAhB;;AA3uBJ;AAAA;AAAA,WA+uBE,yBAAiC;aAC/B,KAAKwB,UAAL,CAAgB,CAAC,KAAK9E,SAAL,EAAjB;;AAhvBJ;AAAA;AAAA,WAqvBE,oBAAWnB,OAAX,EAA6BiF,IAA7B,EAAyE;UACtEvG,OAAS,KAATA;UACFG,SAASH,KAAKG,MAAL,IAAe;;UACxBqG;AACJC,QAAAA,UAAU;SACPF;;UAEDR,MAAM/F,KAAK0C;;UACX,CAAC8D,QAAQC,UAAU;cACf,IAAIC,GAAJ,CAAQ1G,KAAK0C,UAAb;;;UAEJ,KAAK8E,WAAL,MAAsBlG,YAAY,KAAKmB,SAAL,IAAkB;YAClDtC,OAAOqC,eAAe;cACpBlB,SAAS;gBACPC,IAAI,KAAKZ,OAAO;iBACf;0BACM,KAAKA;;eAEb;cACCJ,WAAW,KAAK4D,IAAL;mBAERjB,QAAQ,UAACE,IAAD,EAAU;gBACrB9B,SAAS;kBACPC,IAAI6B,KAAKzC,OAAO;mBACf;4BACMyC,KAAKzC;;;cAKdqE,UAAU,KAAKtB,UAAL;kBACRR,QAAQ,UAACE,IAAD,EAAU;0BACbA,KAAKzC;;;;;UAIlB6F,QAAQC,UAAU;YAChBtG,OAAOqC,eAAe;eACnBD;eACA;cACCkF,eAAezH,KAAK0H,eAAL,CAAqB,CAAC,KAAK/G,KAAN,CAArB;uBACRuC,QAAQ,UAACE,IAAD,EAAU;iBACxBb;;;;;aAIJvC,KAAK2H,UAAL,CAAgB5B,GAAhB;;AAnyBJ;AAAA;AAAA,WAyyBE,kBAAe;WACfrE,QAAQ,KAAKkB,QAAL;WACRxB,UAAU,KAAK8F,SAAL;WACV7F,WAAW,KAAKwE,UAAL;WACXhF,cAAc,KAAK2G,WAAL;WACd7F,UAAU,KAAK0E,SAAL;WACVpF,WAAW,KAAKyE,MAAL;WACX3E,YAAY,KAAK6G,OAAL;WACZ5G,WAAW,KAAK6G,MAAL;WACX/G,WAAW,KAAKqF,MAAL;WACXnG,KAAK+E,QAAQ;;AAnzBf;AAAA;AAAA,WAuzBE,yBAAsB;UACnB/E,OAAS,KAATA;WACHa,cAAc,KAAK2G,WAAL;;UACf,KAAK3G,aAAa;aACfS,UAAU,KAAKmB,SAAL;;YACX,KAAKnB,SAAS;eACXoB,WAAWnB,IAAI,KAAKZ,OAAO;;;aAE7B2B,gBAAgB,KAAK4D,eAAL;aAChBnB,QAAQ;;;AAh0BZ;AAAA;AAAA,WAs0BE,0BAAuB;UACpBxE,WAAa,KAAbA;;UACJ0B,MAAMC,OAAN,CAAc3B,QAAd,GAAyB;iBAClB2C,QAAQ,UAACE,IAAD,EAAU;eACpBrB;eACAQ;eACAwE;;;;AA50BN;AAAA;AAAA,WAm1BE,yBAAsB;UACnB7G,SAAW,KAAXA;;UACJA,QAAQ;eACH6B;eACAQ;eACAoC;;;AAx1BN;AAAA;AAAA,WA61BE,yBAAgB;UACb3E,OAAS,KAATA;UACFyH,eAAezH,KAAK0H,eAAL,CAAqB,CAAC,KAAK/G,KAAN,CAArB;mBACRuC,QAAQ,UAACE,IAAD,EAAU;aACxBrB;aACAQ;;WAEFP;;AAp2BF;AAAA;AAAA,WA02BE,gBAAmB;UAChBzB,WAAa,KAAbA;UACJyC,OAAmB;WAClBC,KAAK;;UACNhB,MAAMC,OAAN,CAAc3B,QAAd,KAA2BA,SAASlC,MAAT,GAAkB,GAAG;iBACzC6E,QAAQ,UAACE,IAAD,EAAU;iBAClBJ,KAAK8E,MAAL,CAAY1E,KAAKe,IAAL,EAAZ;;;;aAGJnB;;AAn3BJ;AAAA;AAAA,WAy3BE,oBAA8B;UAC7BpC,QAAU,KAAVA;;UACF,CAACA,OAAO;gBACFmH,gBAAgB;aACnBnH,QAAQA;;;sBAECA,OAAO;aAChBA;;AAh4BJ;;AAAA;AAAA;;;;"}

package/esm/_chunks/{dep-124a41a4.js → dep-45dee455.js}

@@ -1,5 +1,5 @@
 /**
- * tdesign v0.17.0-beta.0
+ * tdesign v0.18.1
  * (c) 2021 tdesign
  * @license MIT
  */
@@ -21,4 +21,4 @@ function _typeof(obj) {
 }
 
 export { _typeof as _ };
-//# sourceMappingURL=dep-124a41a4.js.map
+//# sourceMappingURL=dep-45dee455.js.map

package/esm/_chunks/dep-45dee455.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-45dee455.js","sources":["../../node_modules/node_modules/@babel/runtime/helpers/esm/typeof.js"],"sourcesContent":["export default function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") {\n    _typeof = function _typeof(obj) {\n      return typeof obj;\n    };\n  } else {\n    _typeof = function _typeof(obj) {\n      return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n    };\n  }\n\n  return _typeof(obj);\n}"],"names":["_typeof","obj","Symbol","iterator","constructor","prototype"],"mappings":";;;;;;AAAe,SAASA,OAAT,CAAiBC,GAAjB,EAAsB;AACnC;;AAEA,MAAI,OAAOC,MAAP,KAAkB,UAAlB,IAAgC,OAAOA,MAAM,CAACC,QAAd,KAA2B,QAA/D,EAAyE;AACvEH,IAAAA,OAAO,GAAG,SAASA,OAAT,CAAiBC,GAAjB,EAAsB;AAC9B,aAAO,OAAOA,GAAd;AACD,KAFD;AAGD,GAJD,MAIO;AACLD,IAAAA,OAAO,GAAG,SAASA,OAAT,CAAiBC,GAAjB,EAAsB;AAC9B,aAAOA,GAAG,IAAI,OAAOC,MAAP,KAAkB,UAAzB,IAAuCD,GAAG,CAACG,WAAJ,KAAoBF,MAA3D,IAAqED,GAAG,KAAKC,MAAM,CAACG,SAApF,GAAgG,QAAhG,GAA2G,OAAOJ,GAAzH;AACD,KAFD;AAGD;;AAED,SAAOD,OAAO,CAACC,GAAD,CAAd;AACD;;;;"}

package/{es/_chunks/dep-7c858e55.js → esm/_chunks/dep-4758c2cb.js}

@@ -1,22 +1,22 @@
 /**
- * tdesign v0.17.0-beta.0
+ * tdesign v0.18.1
  * (c) 2021 tdesign
  * @license MIT
  */
 
-import { _ as _defineProperty$1 } from './dep-a0803fb6.js';
-import './dep-f10228f2.js';
-import { c as _castPath, d as _toKey, b as _baseGet } from './dep-7ff0c58a.js';
-import { a as _getNative } from './dep-18aceb94.js';
-import { e as eq_1 } from './dep-7dd0fd27.js';
-import { _ as _isIndex } from './dep-c4f120c5.js';
-import { i as isObject_1 } from './dep-d5cf8459.js';
-import './dep-caea8b6e.js';
-import { i as isArguments_1 } from './dep-074c7dd6.js';
-import { i as isArray_1 } from './dep-2a177d24.js';
-import './dep-3e26b918.js';
-import { i as isLength_1 } from './dep-d54a9111.js';
-import { f as flatten_1 } from './dep-86eac0a0.js';
+import { _ as _defineProperty$1 } from './dep-b05711f1.js';
+import './dep-9052d175.js';
+import { c as _castPath, d as _toKey, b as _baseGet } from './dep-cd8b9911.js';
+import { a as _getNative } from './dep-ac24e8fd.js';
+import { e as eq_1 } from './dep-9c3437dc.js';
+import { _ as _isIndex } from './dep-1d2d6811.js';
+import { i as isObject_1 } from './dep-b78554de.js';
+import './dep-c7c70ac0.js';
+import { i as isArguments_1 } from './dep-b5420e42.js';
+import { i as isArray_1 } from './dep-776ae9a7.js';
+import './dep-66287469.js';
+import { i as isLength_1 } from './dep-766ddb96.js';
+import { f as flatten_1 } from './dep-7fd82250.js';
 
 var getNative = _getNative;
 
@@ -620,4 +620,4 @@ function updateNodeModel(model, node) {
 }
 
 export { _assignValue as _, _baseAssignValue as a, _overRest as b, _setToString as c, createNodeModel as d, identity_1 as i, updateNodeModel as u };
-//# sourceMappingURL=dep-7c858e55.js.map
+//# sourceMappingURL=dep-4758c2cb.js.map

package/{es/_chunks/dep-7c858e55.js.map → esm/_chunks/dep-4758c2cb.js.map}

@@ -1 +1 @@
-{"version":3,"file":"dep-7c858e55.js","sources":["../../node_modules/lodash/_defineProperty.js","../../node_modules/lodash/_baseAssignValue.js","../../node_modules/lodash/_assignValue.js","../../node_modules/lodash/identity.js","../../node_modules/lodash/_apply.js","../../node_modules/lodash/_overRest.js","../../node_modules/lodash/constant.js","../../node_modules/lodash/_baseSetToString.js","../../node_modules/lodash/_shortOut.js","../../node_modules/lodash/_setToString.js","../../node_modules/lodash/_baseSet.js","../../node_modules/lodash/_basePickBy.js","../../node_modules/lodash/_baseHasIn.js","../../node_modules/lodash/_hasPath.js","../../node_modules/lodash/hasIn.js","../../node_modules/lodash/_basePick.js","../../node_modules/lodash/_flatRest.js","../../node_modules/lodash/pick.js","../../src/_common/js/tree/tree-node-model.ts"],"sourcesContent":["var getNative = require('./_getNative');\n\nvar defineProperty = (function() {\n  try {\n    var func = getNative(Object, 'defineProperty');\n    func({}, '', {});\n    return func;\n  } catch (e) {}\n}());\n\nmodule.exports = defineProperty;\n","var defineProperty = require('./_defineProperty');\n\n/**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction baseAssignValue(object, key, value) {\n  if (key == '__proto__' && defineProperty) {\n    defineProperty(object, key, {\n      'configurable': true,\n      'enumerable': true,\n      'value': value,\n      'writable': true\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\nmodule.exports = baseAssignValue;\n","var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\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 * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignValue;\n","/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nmodule.exports = identity;\n","/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\nmodule.exports = apply;\n","var apply = require('./_apply');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * A specialized version of `baseRest` which transforms the rest array.\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 * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\nfunction overRest(func, start, transform) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = transform(array);\n    return apply(func, this, otherArgs);\n  };\n}\n\nmodule.exports = overRest;\n","/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n  return function() {\n    return value;\n  };\n}\n\nmodule.exports = constant;\n","var constant = require('./constant'),\n    defineProperty = require('./_defineProperty'),\n    identity = require('./identity');\n\n/**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n  return defineProperty(func, 'toString', {\n    'configurable': true,\n    'enumerable': false,\n    'value': constant(string),\n    'writable': true\n  });\n};\n\nmodule.exports = baseSetToString;\n","/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n    HOT_SPAN = 16;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeNow = Date.now;\n\n/**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\nfunction shortOut(func) {\n  var count = 0,\n      lastCalled = 0;\n\n  return function() {\n    var stamp = nativeNow(),\n        remaining = HOT_SPAN - (stamp - lastCalled);\n\n    lastCalled = stamp;\n    if (remaining > 0) {\n      if (++count >= HOT_COUNT) {\n        return arguments[0];\n      }\n    } else {\n      count = 0;\n    }\n    return func.apply(undefined, arguments);\n  };\n}\n\nmodule.exports = shortOut;\n","var baseSetToString = require('./_baseSetToString'),\n    shortOut = require('./_shortOut');\n\n/**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar setToString = shortOut(baseSetToString);\n\nmodule.exports = setToString;\n","var assignValue = require('./_assignValue'),\n    castPath = require('./_castPath'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nmodule.exports = baseSet;\n","var baseGet = require('./_baseGet'),\n    baseSet = require('./_baseSet'),\n    castPath = require('./_castPath');\n\n/**\n * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n  var index = -1,\n      length = paths.length,\n      result = {};\n\n  while (++index < length) {\n    var path = paths[index],\n        value = baseGet(object, path);\n\n    if (predicate(value, path)) {\n      baseSet(result, castPath(path, object), value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = basePickBy;\n","/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nmodule.exports = baseHasIn;\n","var castPath = require('./_castPath'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isIndex = require('./_isIndex'),\n    isLength = require('./isLength'),\n    toKey = require('./_toKey');\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nmodule.exports = hasPath;\n","var baseHasIn = require('./_baseHasIn'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nmodule.exports = hasIn;\n","var basePickBy = require('./_basePickBy'),\n    hasIn = require('./hasIn');\n\n/**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\nfunction basePick(object, paths) {\n  return basePickBy(object, paths, function(value, path) {\n    return hasIn(object, path);\n  });\n}\n\nmodule.exports = basePick;\n","var flatten = require('./flatten'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\nfunction flatRest(func) {\n  return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nmodule.exports = flatRest;\n","var basePick = require('./_basePick'),\n    flatRest = require('./_flatRest');\n\n/**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\nvar pick = flatRest(function(object, paths) {\n  return object == null ? {} : basePick(object, paths);\n});\n\nmodule.exports = pick;\n","import pick from 'lodash/pick';\nimport { TreeNode } from './tree-node';\nimport {\n  TypeTreeNodeModel,\n  TypeTreeNodeData,\n  TypeTreeItem,\n  TreeNodeModelProps,\n} from './types';\n\n// 获取节点需要暴露的属性\nfunction getExposedProps(node: TreeNode): TreeNodeModelProps {\n  const props = pick(node, [\n    'value',\n    'label',\n    'data',\n    'actived',\n    'expanded',\n    'checked',\n    'indeterminate',\n    'loading',\n  ]) as TreeNodeModelProps;\n  return props;\n}\n\n// 封装对外暴露的对象\nexport function createNodeModel(node: TreeNode): TypeTreeNodeModel {\n  const props = getExposedProps(node);\n\n  const model: TypeTreeNodeModel = {\n    ...props,\n\n    // 获取节点所处层级\n    getLevel() {\n      return node.getLevel();\n    },\n\n    // 获取节点在 children 中的位置\n    getIndex() {\n      return node.getIndex();\n    },\n\n    // 判断节点是否为 children 中的第一个节点\n    isFirst() {\n      return node.isFirst();\n    },\n\n    // 判断节点是否为 children 中的最后一个节点\n    isLast() {\n      return node.isLast();\n    },\n\n    // 判断节点是否为叶节点\n    isLeaf() {\n      return node.isLeaf();\n    },\n\n    // 插入数据到节点之前\n    insertBefore(newData: TypeTreeItem) {\n      return node.insertBefore(newData);\n    },\n\n    // 插入数据到节点之后\n    insertAfter(newData: TypeTreeItem) {\n      return node.insertAfter(newData);\n    },\n\n    // 给当前节点添加子节点数据\n    appendData(data: TypeTreeNodeData | TypeTreeNodeData[]) {\n      return node.append(data);\n    },\n\n    // 返回路径节点数据集合\n    getPath(): TypeTreeNodeModel[] {\n      const nodes = node.getPath();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 获取单个父节点数据\n    getParent(): TypeTreeNodeModel {\n      return node.parent?.getModel();\n    },\n\n    // 获取所有父节点数据\n    getParents(): TypeTreeNodeModel[] {\n      const nodes = node.getParents();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 获取根节点\n    getRoot(): TypeTreeNodeModel {\n      const root = node.getRoot();\n      return root?.getModel();\n    },\n\n    // 获取兄弟节点，包含自己在内\n    getSiblings(): TypeTreeNodeModel[] {\n      const nodes = node.getSiblings();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 返回当前节点的第一层子节点数据集合\n    getChildren(deep?: boolean): boolean | TypeTreeNodeModel[] {\n      let childrenModel: boolean | TypeTreeNodeModel[] = false;\n      const { children } = node;\n      if (Array.isArray(children)) {\n        if (children.length > 0) {\n          if (deep) {\n            const nodes = node.walk();\n            nodes.shift();\n            childrenModel = nodes.map((item) => item.getModel());\n          } else {\n            childrenModel = children.map((item) => item.getModel());\n          }\n        } else {\n          childrenModel = false;\n        }\n      } else if (typeof children === 'boolean') {\n        childrenModel = children;\n      }\n      return childrenModel;\n    },\n  };\n  return model;\n}\n\n// 更新封装对象\nexport function updateNodeModel(model: TypeTreeNodeModel, node: TreeNode) {\n  // 同步节点属性\n  const props = getExposedProps(node);\n  Object.assign(model, props);\n}\n"],"names":["getNative","require$$0","defineProperty","func","Object","e","_defineProperty","baseAssignValue","object","key","value","_baseAssignValue","eq","require$$1","objectProto","prototype","hasOwnProperty","assignValue","objValue","call","undefined","_assignValue","identity","identity_1","apply","thisArg","args","length","_apply","nativeMax","Math","max","overRest","start","transform","arguments","index","array","Array","otherArgs","_overRest","constant","constant_1","require$$2","baseSetToString","string","_baseSetToString","HOT_COUNT","HOT_SPAN","nativeNow","Date","now","shortOut","count","lastCalled","stamp","remaining","_shortOut","setToString","_setToString","castPath","isIndex","isObject","require$$3","toKey","require$$4","baseSet","path","customizer","lastIndex","nested","newValue","_baseSet","baseGet","basePickBy","paths","predicate","result","_basePickBy","baseHasIn","_baseHasIn","isArguments","isArray","isLength","require$$5","hasPath","hasFunc","_hasPath","hasIn","hasIn_1","basePick","_basePick","flatten","flatRest","_flatRest","pick","pick_1","node","props","getExposedProps","model","getLevel","getIndex","isFirst","isLast","isLeaf","insertBefore","newData","insertAfter","appendData","data","append","getPath","nodes","map","item","getModel","getParent","parent","getParents","getRoot","root","getSiblings","getChildren","deep","childrenModel","children","walk","shift","assign"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,IAAIA,SAAS,GAAGC,UAAhB;;AAEA,IAAIC,gBAAc,GAAI,YAAW;AAC/B,MAAI;AACF,QAAIC,IAAI,GAAGH,SAAS,CAACI,MAAD,EAAS,gBAAT,CAApB;AACAD,IAAAA,IAAI,CAAC,EAAD,EAAK,EAAL,EAAS,EAAT,CAAJ;AACA,WAAOA,IAAP;AACD,GAJD,CAIE,OAAOE,CAAP,EAAU;AACb,CANqB,EAAtB;;IAQAC,eAAc,GAAGJ;;ACVjB,IAAIA,gBAAc,GAAGD,eAArB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASM,iBAAT,CAAyBC,MAAzB,EAAiCC,GAAjC,EAAsCC,KAAtC,EAA6C;AAC3C,MAAID,GAAG,IAAI,WAAP,IAAsBP,gBAA1B,EAA0C;AACxCA,IAAAA,gBAAc,CAACM,MAAD,EAASC,GAAT,EAAc;AAC1B,sBAAgB,IADU;AAE1B,oBAAc,IAFY;AAG1B,eAASC,KAHiB;AAI1B,kBAAY;AAJc,KAAd,CAAd;AAMD,GAPD,MAOO;AACLF,IAAAA,MAAM,CAACC,GAAD,CAAN,GAAcC,KAAd;AACD;AACF;;IAEDC,gBAAc,GAAGJ;;ACxBjB,IAAIA,eAAe,GAAGN,gBAAtB;AAAA,IACIW,EAAE,GAAGC,IADT;AAGA;;AACA,IAAIC,WAAW,GAAGV,MAAM,CAACW,SAAzB;AAEA;;AACA,IAAIC,cAAc,GAAGF,WAAW,CAACE,cAAjC;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,aAAT,CAAqBT,MAArB,EAA6BC,GAA7B,EAAkCC,KAAlC,EAAyC;AACvC,MAAIQ,QAAQ,GAAGV,MAAM,CAACC,GAAD,CAArB;;AACA,MAAI,EAAEO,cAAc,CAACG,IAAf,CAAoBX,MAApB,EAA4BC,GAA5B,KAAoCG,EAAE,CAACM,QAAD,EAAWR,KAAX,CAAxC,KACCA,KAAK,KAAKU,SAAV,IAAuB,EAAEX,GAAG,IAAID,MAAT,CAD5B,EAC+C;AAC7CD,IAAAA,eAAe,CAACC,MAAD,EAASC,GAAT,EAAcC,KAAd,CAAf;AACD;AACF;;IAEDW,YAAc,GAAGJ;;;;;;;;;;;;;;;;;;;ACXjB,SAASK,UAAT,CAAkBZ,KAAlB,EAAyB;AACvB,SAAOA,KAAP;AACD;;IAEDa,UAAc,GAAGD;;;;;;;;;;;;;ACVjB,SAASE,OAAT,CAAerB,IAAf,EAAqBsB,OAArB,EAA8BC,IAA9B,EAAoC;AAClC,UAAQA,IAAI,CAACC,MAAb;AACE,SAAK,CAAL;AAAQ,aAAOxB,IAAI,CAACgB,IAAL,CAAUM,OAAV,CAAP;;AACR,SAAK,CAAL;AAAQ,aAAOtB,IAAI,CAACgB,IAAL,CAAUM,OAAV,EAAmBC,IAAI,CAAC,CAAD,CAAvB,CAAP;;AACR,SAAK,CAAL;AAAQ,aAAOvB,IAAI,CAACgB,IAAL,CAAUM,OAAV,EAAmBC,IAAI,CAAC,CAAD,CAAvB,EAA4BA,IAAI,CAAC,CAAD,CAAhC,CAAP;;AACR,SAAK,CAAL;AAAQ,aAAOvB,IAAI,CAACgB,IAAL,CAAUM,OAAV,EAAmBC,IAAI,CAAC,CAAD,CAAvB,EAA4BA,IAAI,CAAC,CAAD,CAAhC,EAAqCA,IAAI,CAAC,CAAD,CAAzC,CAAP;AAJV;;AAMA,SAAOvB,IAAI,CAACqB,KAAL,CAAWC,OAAX,EAAoBC,IAApB,CAAP;AACD;;IAEDE,MAAc,GAAGJ;;ACpBjB,IAAIA,KAAK,GAAGvB,MAAZ;AAEA;;AACA,IAAI4B,SAAS,GAAGC,IAAI,CAACC,GAArB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkB7B,IAAlB,EAAwB8B,KAAxB,EAA+BC,SAA/B,EAA0C;AACxCD,EAAAA,KAAK,GAAGJ,SAAS,CAACI,KAAK,KAAKb,SAAV,GAAuBjB,IAAI,CAACwB,MAAL,GAAc,CAArC,GAA0CM,KAA3C,EAAkD,CAAlD,CAAjB;AACA,SAAO,YAAW;AAChB,QAAIP,IAAI,GAAGS,SAAX;AAAA,QACIC,KAAK,GAAG,CAAC,CADb;AAAA,QAEIT,MAAM,GAAGE,SAAS,CAACH,IAAI,CAACC,MAAL,GAAcM,KAAf,EAAsB,CAAtB,CAFtB;AAAA,QAGII,KAAK,GAAGC,KAAK,CAACX,MAAD,CAHjB;;AAKA,WAAO,EAAES,KAAF,GAAUT,MAAjB,EAAyB;AACvBU,MAAAA,KAAK,CAACD,KAAD,CAAL,GAAeV,IAAI,CAACO,KAAK,GAAGG,KAAT,CAAnB;AACD;;AACDA,IAAAA,KAAK,GAAG,CAAC,CAAT;AACA,QAAIG,SAAS,GAAGD,KAAK,CAACL,KAAK,GAAG,CAAT,CAArB;;AACA,WAAO,EAAEG,KAAF,GAAUH,KAAjB,EAAwB;AACtBM,MAAAA,SAAS,CAACH,KAAD,CAAT,GAAmBV,IAAI,CAACU,KAAD,CAAvB;AACD;;AACDG,IAAAA,SAAS,CAACN,KAAD,CAAT,GAAmBC,SAAS,CAACG,KAAD,CAA5B;AACA,WAAOb,KAAK,CAACrB,IAAD,EAAO,IAAP,EAAaoC,SAAb,CAAZ;AACD,GAhBD;AAiBD;;IAEDC,SAAc,GAAGR;;;;;;;;;;;;;;;;;;;;;;AChBjB,SAASS,UAAT,CAAkB/B,KAAlB,EAAyB;AACvB,SAAO,YAAW;AAChB,WAAOA,KAAP;AACD,GAFD;AAGD;;IAEDgC,UAAc,GAAGD;;ACzBjB,IAAIA,QAAQ,GAAGxC,UAAf;AAAA,IACIC,cAAc,GAAGW,eADrB;AAAA,IAEIS,QAAQ,GAAGqB,UAFf;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIC,iBAAe,GAAG,CAAC1C,cAAD,GAAkBoB,QAAlB,GAA6B,UAASnB,IAAT,EAAe0C,MAAf,EAAuB;AACxE,SAAO3C,cAAc,CAACC,IAAD,EAAO,UAAP,EAAmB;AACtC,oBAAgB,IADsB;AAEtC,kBAAc,KAFwB;AAGtC,aAASsC,QAAQ,CAACI,MAAD,CAHqB;AAItC,gBAAY;AAJ0B,GAAnB,CAArB;AAMD,CAPD;IASAC,gBAAc,GAAGF;;;ACpBjB,IAAIG,SAAS,GAAG,GAAhB;AAAA,IACIC,QAAQ,GAAG,EADf;AAGA;;AACA,IAAIC,SAAS,GAAGC,IAAI,CAACC,GAArB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkBjD,IAAlB,EAAwB;AACtB,MAAIkD,KAAK,GAAG,CAAZ;AAAA,MACIC,UAAU,GAAG,CADjB;AAGA,SAAO,YAAW;AAChB,QAAIC,KAAK,GAAGN,SAAS,EAArB;AAAA,QACIO,SAAS,GAAGR,QAAQ,IAAIO,KAAK,GAAGD,UAAZ,CADxB;AAGAA,IAAAA,UAAU,GAAGC,KAAb;;AACA,QAAIC,SAAS,GAAG,CAAhB,EAAmB;AACjB,UAAI,EAAEH,KAAF,IAAWN,SAAf,EAA0B;AACxB,eAAOZ,SAAS,CAAC,CAAD,CAAhB;AACD;AACF,KAJD,MAIO;AACLkB,MAAAA,KAAK,GAAG,CAAR;AACD;;AACD,WAAOlD,IAAI,CAACqB,KAAL,CAAWJ,SAAX,EAAsBe,SAAtB,CAAP;AACD,GAbD;AAcD;;IAEDsB,SAAc,GAAGL;;ACpCjB,IAAIR,eAAe,GAAG3C,gBAAtB;AAAA,IACImD,QAAQ,GAAGvC,SADf;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAI6C,aAAW,GAAGN,QAAQ,CAACR,eAAD,CAA1B;IAEAe,YAAc,GAAGD;;ACbjB,IAAIzC,WAAW,GAAGhB,YAAlB;AAAA,IACI2D,UAAQ,GAAG/C,SADf;AAAA,IAEIgD,SAAO,GAAGlB,QAFd;AAAA,IAGImB,QAAQ,GAAGC,UAHf;AAAA,IAIIC,OAAK,GAAGC,MAJZ;AAMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,SAAT,CAAiB1D,MAAjB,EAAyB2D,IAAzB,EAA+BzD,KAA/B,EAAsC0D,UAAtC,EAAkD;AAChD,MAAI,CAACN,QAAQ,CAACtD,MAAD,CAAb,EAAuB;AACrB,WAAOA,MAAP;AACD;;AACD2D,EAAAA,IAAI,GAAGP,UAAQ,CAACO,IAAD,EAAO3D,MAAP,CAAf;AAEA,MAAI4B,KAAK,GAAG,CAAC,CAAb;AAAA,MACIT,MAAM,GAAGwC,IAAI,CAACxC,MADlB;AAAA,MAEI0C,SAAS,GAAG1C,MAAM,GAAG,CAFzB;AAAA,MAGI2C,MAAM,GAAG9D,MAHb;;AAKA,SAAO8D,MAAM,IAAI,IAAV,IAAkB,EAAElC,KAAF,GAAUT,MAAnC,EAA2C;AACzC,QAAIlB,GAAG,GAAGuD,OAAK,CAACG,IAAI,CAAC/B,KAAD,CAAL,CAAf;AAAA,QACImC,QAAQ,GAAG7D,KADf;;AAGA,QAAID,GAAG,KAAK,WAAR,IAAuBA,GAAG,KAAK,aAA/B,IAAgDA,GAAG,KAAK,WAA5D,EAAyE;AACvE,aAAOD,MAAP;AACD;;AAED,QAAI4B,KAAK,IAAIiC,SAAb,EAAwB;AACtB,UAAInD,QAAQ,GAAGoD,MAAM,CAAC7D,GAAD,CAArB;AACA8D,MAAAA,QAAQ,GAAGH,UAAU,GAAGA,UAAU,CAAClD,QAAD,EAAWT,GAAX,EAAgB6D,MAAhB,CAAb,GAAuClD,SAA5D;;AACA,UAAImD,QAAQ,KAAKnD,SAAjB,EAA4B;AAC1BmD,QAAAA,QAAQ,GAAGT,QAAQ,CAAC5C,QAAD,CAAR,GACPA,QADO,GAEN2C,SAAO,CAACM,IAAI,CAAC/B,KAAK,GAAG,CAAT,CAAL,CAAP,GAA2B,EAA3B,GAAgC,EAFrC;AAGD;AACF;;AACDnB,IAAAA,WAAW,CAACqD,MAAD,EAAS7D,GAAT,EAAc8D,QAAd,CAAX;AACAD,IAAAA,MAAM,GAAGA,MAAM,CAAC7D,GAAD,CAAf;AACD;;AACD,SAAOD,MAAP;AACD;;IAEDgE,QAAc,GAAGN;;AClDjB,IAAIO,OAAO,GAAGxE,QAAd;AAAA,IACIiE,OAAO,GAAGrD,QADd;AAAA,IAEI+C,UAAQ,GAAGjB,SAFf;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAAS+B,YAAT,CAAoBlE,MAApB,EAA4BmE,KAA5B,EAAmCC,SAAnC,EAA8C;AAC5C,MAAIxC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIT,MAAM,GAAGgD,KAAK,CAAChD,MADnB;AAAA,MAEIkD,MAAM,GAAG,EAFb;;AAIA,SAAO,EAAEzC,KAAF,GAAUT,MAAjB,EAAyB;AACvB,QAAIwC,IAAI,GAAGQ,KAAK,CAACvC,KAAD,CAAhB;AAAA,QACI1B,KAAK,GAAG+D,OAAO,CAACjE,MAAD,EAAS2D,IAAT,CADnB;;AAGA,QAAIS,SAAS,CAAClE,KAAD,EAAQyD,IAAR,CAAb,EAA4B;AAC1BD,MAAAA,OAAO,CAACW,MAAD,EAASjB,UAAQ,CAACO,IAAD,EAAO3D,MAAP,CAAjB,EAAiCE,KAAjC,CAAP;AACD;AACF;;AACD,SAAOmE,MAAP;AACD;;IAEDC,WAAc,GAAGJ;;;;;;;;;;;ACrBjB,SAASK,WAAT,CAAmBvE,MAAnB,EAA2BC,GAA3B,EAAgC;AAC9B,SAAOD,MAAM,IAAI,IAAV,IAAkBC,GAAG,IAAIL,MAAM,CAACI,MAAD,CAAtC;AACD;;IAEDwE,UAAc,GAAGD;;ACZjB,IAAInB,QAAQ,GAAG3D,SAAf;AAAA,IACIgF,WAAW,GAAGpE,aADlB;AAAA,IAEIqE,OAAO,GAAGvC,SAFd;AAAA,IAGIkB,OAAO,GAAGE,QAHd;AAAA,IAIIoB,QAAQ,GAAGlB,UAJf;AAAA,IAKID,KAAK,GAAGoB,MALZ;AAOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,SAAT,CAAiB7E,MAAjB,EAAyB2D,IAAzB,EAA+BmB,OAA/B,EAAwC;AACtCnB,EAAAA,IAAI,GAAGP,QAAQ,CAACO,IAAD,EAAO3D,MAAP,CAAf;AAEA,MAAI4B,KAAK,GAAG,CAAC,CAAb;AAAA,MACIT,MAAM,GAAGwC,IAAI,CAACxC,MADlB;AAAA,MAEIkD,MAAM,GAAG,KAFb;;AAIA,SAAO,EAAEzC,KAAF,GAAUT,MAAjB,EAAyB;AACvB,QAAIlB,GAAG,GAAGuD,KAAK,CAACG,IAAI,CAAC/B,KAAD,CAAL,CAAf;;AACA,QAAI,EAAEyC,MAAM,GAAGrE,MAAM,IAAI,IAAV,IAAkB8E,OAAO,CAAC9E,MAAD,EAASC,GAAT,CAApC,CAAJ,EAAwD;AACtD;AACD;;AACDD,IAAAA,MAAM,GAAGA,MAAM,CAACC,GAAD,CAAf;AACD;;AACD,MAAIoE,MAAM,IAAI,EAAEzC,KAAF,IAAWT,MAAzB,EAAiC;AAC/B,WAAOkD,MAAP;AACD;;AACDlD,EAAAA,MAAM,GAAGnB,MAAM,IAAI,IAAV,GAAiB,CAAjB,GAAqBA,MAAM,CAACmB,MAArC;AACA,SAAO,CAAC,CAACA,MAAF,IAAYwD,QAAQ,CAACxD,MAAD,CAApB,IAAgCkC,OAAO,CAACpD,GAAD,EAAMkB,MAAN,CAAvC,KACJuD,OAAO,CAAC1E,MAAD,CAAP,IAAmByE,WAAW,CAACzE,MAAD,CAD1B,CAAP;AAED;;IAED+E,QAAc,GAAGF;;ACtCjB,IAAIN,SAAS,GAAG9E,UAAhB;AAAA,IACIoF,OAAO,GAAGxE,QADd;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;;AACA,SAAS2E,OAAT,CAAehF,MAAf,EAAuB2D,IAAvB,EAA6B;AAC3B,SAAO3D,MAAM,IAAI,IAAV,IAAkB6E,OAAO,CAAC7E,MAAD,EAAS2D,IAAT,EAAeY,SAAf,CAAhC;AACD;;IAEDU,OAAc,GAAGD;;ACjCjB,IAAId,UAAU,GAAGzE,WAAjB;AAAA,IACIuF,KAAK,GAAG3E,OADZ;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAAS6E,UAAT,CAAkBlF,MAAlB,EAA0BmE,KAA1B,EAAiC;AAC/B,SAAOD,UAAU,CAAClE,MAAD,EAASmE,KAAT,EAAgB,UAASjE,KAAT,EAAgByD,IAAhB,EAAsB;AACrD,WAAOqB,KAAK,CAAChF,MAAD,EAAS2D,IAAT,CAAZ;AACD,GAFgB,CAAjB;AAGD;;IAEDwB,SAAc,GAAGD;;AClBjB,IAAIE,OAAO,GAAG3F,SAAd;AAAA,IACI+B,QAAQ,GAAGnB,SADf;AAAA,IAEI6C,WAAW,GAAGf,YAFlB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASkD,UAAT,CAAkB1F,IAAlB,EAAwB;AACtB,SAAOuD,WAAW,CAAC1B,QAAQ,CAAC7B,IAAD,EAAOiB,SAAP,EAAkBwE,OAAlB,CAAT,EAAqCzF,IAAI,GAAG,EAA5C,CAAlB;AACD;;IAED2F,SAAc,GAAGD;;ACfjB,IAAIH,QAAQ,GAAGzF,SAAf;AAAA,IACI4F,QAAQ,GAAGhF,SADf;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIkF,IAAI,GAAGF,QAAQ,CAAC,UAASrF,MAAT,EAAiBmE,KAAjB,EAAwB;AAC1C,SAAOnE,MAAM,IAAI,IAAV,GAAiB,EAAjB,GAAsBkF,QAAQ,CAAClF,MAAD,EAASmE,KAAT,CAArC;AACD,CAFkB,CAAnB;IAIAqB,MAAc,GAAGD;;;;;;ACdjB,wBAAA,CAAyBE,IAAzB,EAA6D;MACrDC,QAAQH,OAAKE,MAAM,CACvB,OADuB,EAEvB,OAFuB,EAGvB,MAHuB,EAIvB,SAJuB,EAKvB,UALuB,EAMvB,SANuB,EAOvB,eAPuB,EAQvB,SARuB;SAUlBC;;;yBAIuBD,MAAmC;MAC3DC,QAAQC,gBAAgBF;;MAExBG,wCACDF;AAGHG,IAAAA,8BAAW;aACFJ,KAAKI,QAAL;;AAITC,IAAAA,8BAAW;aACFL,KAAKK,QAAL;;AAITC,IAAAA,4BAAU;aACDN,KAAKM,OAAL;;AAITC,IAAAA,0BAAS;aACAP,KAAKO,MAAL;;AAITC,IAAAA,0BAAS;aACAR,KAAKQ,MAAL;;AAITC,IAAAA,oCAAaC,SAAuB;aAC3BV,KAAKS,YAAL,CAAkBC,OAAlB;;AAITC,IAAAA,kCAAYD,SAAuB;aAC1BV,KAAKW,WAAL,CAAiBD,OAAjB;;AAITE,IAAAA,gCAAWC,MAA6C;aAC/Cb,KAAKc,MAAL,CAAYD,IAAZ;;AAITE,IAAAA,4BAA+B;UACvBC,QAAQhB,KAAKe,OAAL;aACPC,MAAMC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAoBA,KAAKC,QAAL,EAApB;AAAA,OAAV;;AAITC,IAAAA,gCAA+B;AAAA;;6BACtBpB,KAAKqB,uDAAL,aAAaF,QAAb;;AAITG,IAAAA,kCAAkC;UAC1BN,QAAQhB,KAAKsB,UAAL;aACPN,MAAMC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAoBA,KAAKC,QAAL,EAApB;AAAA,OAAV;;AAITI,IAAAA,4BAA6B;UACrBC,OAAOxB,KAAKuB,OAAL;aACNC,iBAAAA,2BAAAA,KAAML,QAAN;;AAITM,IAAAA,oCAAmC;UAC3BT,QAAQhB,KAAKyB,WAAL;aACPT,MAAMC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAoBA,KAAKC,QAAL,EAApB;AAAA,OAAV;;AAITO,IAAAA,kCAAYC,MAA+C;UACrDC,gBAA+C;UAC3CC,WAAa7B,KAAb6B;;UACJxF,MAAM4C,OAAN,CAAc4C,QAAd,GAAyB;YACvBA,SAASnG,MAAT,GAAkB,GAAG;cACnBiG,MAAM;gBACFX,QAAQhB,KAAK8B,IAAL;kBACRC;4BACUf,MAAMC,GAAN,CAAU,UAACC,IAAD;AAAA,qBAAUA,KAAKC,QAAL,EAAV;AAAA,aAAV;iBACX;4BACWU,SAASZ,GAAT,CAAa,UAACC,IAAD;AAAA,qBAAUA,KAAKC,QAAL,EAAV;AAAA,aAAb;;eAEb;0BACW;;iBAET,OAAOU,QAAP,KAAoB,WAAW;wBACxBA;;;aAEXD;;;;SAGJzB;;yBAIuBA,OAA0BH,MAAgB;MAElEC,QAAQC,gBAAgBF;SACvBgC,OAAO7B,OAAOF;;;;;"}
+{"version":3,"file":"dep-4758c2cb.js","sources":["../../node_modules/lodash/_defineProperty.js","../../node_modules/lodash/_baseAssignValue.js","../../node_modules/lodash/_assignValue.js","../../node_modules/lodash/identity.js","../../node_modules/lodash/_apply.js","../../node_modules/lodash/_overRest.js","../../node_modules/lodash/constant.js","../../node_modules/lodash/_baseSetToString.js","../../node_modules/lodash/_shortOut.js","../../node_modules/lodash/_setToString.js","../../node_modules/lodash/_baseSet.js","../../node_modules/lodash/_basePickBy.js","../../node_modules/lodash/_baseHasIn.js","../../node_modules/lodash/_hasPath.js","../../node_modules/lodash/hasIn.js","../../node_modules/lodash/_basePick.js","../../node_modules/lodash/_flatRest.js","../../node_modules/lodash/pick.js","../../src/_common/js/tree/tree-node-model.ts"],"sourcesContent":["var getNative = require('./_getNative');\n\nvar defineProperty = (function() {\n  try {\n    var func = getNative(Object, 'defineProperty');\n    func({}, '', {});\n    return func;\n  } catch (e) {}\n}());\n\nmodule.exports = defineProperty;\n","var defineProperty = require('./_defineProperty');\n\n/**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction baseAssignValue(object, key, value) {\n  if (key == '__proto__' && defineProperty) {\n    defineProperty(object, key, {\n      'configurable': true,\n      'enumerable': true,\n      'value': value,\n      'writable': true\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\nmodule.exports = baseAssignValue;\n","var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\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 * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignValue;\n","/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nmodule.exports = identity;\n","/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\nmodule.exports = apply;\n","var apply = require('./_apply');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * A specialized version of `baseRest` which transforms the rest array.\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 * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\nfunction overRest(func, start, transform) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = transform(array);\n    return apply(func, this, otherArgs);\n  };\n}\n\nmodule.exports = overRest;\n","/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n  return function() {\n    return value;\n  };\n}\n\nmodule.exports = constant;\n","var constant = require('./constant'),\n    defineProperty = require('./_defineProperty'),\n    identity = require('./identity');\n\n/**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n  return defineProperty(func, 'toString', {\n    'configurable': true,\n    'enumerable': false,\n    'value': constant(string),\n    'writable': true\n  });\n};\n\nmodule.exports = baseSetToString;\n","/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n    HOT_SPAN = 16;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeNow = Date.now;\n\n/**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\nfunction shortOut(func) {\n  var count = 0,\n      lastCalled = 0;\n\n  return function() {\n    var stamp = nativeNow(),\n        remaining = HOT_SPAN - (stamp - lastCalled);\n\n    lastCalled = stamp;\n    if (remaining > 0) {\n      if (++count >= HOT_COUNT) {\n        return arguments[0];\n      }\n    } else {\n      count = 0;\n    }\n    return func.apply(undefined, arguments);\n  };\n}\n\nmodule.exports = shortOut;\n","var baseSetToString = require('./_baseSetToString'),\n    shortOut = require('./_shortOut');\n\n/**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar setToString = shortOut(baseSetToString);\n\nmodule.exports = setToString;\n","var assignValue = require('./_assignValue'),\n    castPath = require('./_castPath'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nmodule.exports = baseSet;\n","var baseGet = require('./_baseGet'),\n    baseSet = require('./_baseSet'),\n    castPath = require('./_castPath');\n\n/**\n * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n  var index = -1,\n      length = paths.length,\n      result = {};\n\n  while (++index < length) {\n    var path = paths[index],\n        value = baseGet(object, path);\n\n    if (predicate(value, path)) {\n      baseSet(result, castPath(path, object), value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = basePickBy;\n","/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nmodule.exports = baseHasIn;\n","var castPath = require('./_castPath'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isIndex = require('./_isIndex'),\n    isLength = require('./isLength'),\n    toKey = require('./_toKey');\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nmodule.exports = hasPath;\n","var baseHasIn = require('./_baseHasIn'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nmodule.exports = hasIn;\n","var basePickBy = require('./_basePickBy'),\n    hasIn = require('./hasIn');\n\n/**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\nfunction basePick(object, paths) {\n  return basePickBy(object, paths, function(value, path) {\n    return hasIn(object, path);\n  });\n}\n\nmodule.exports = basePick;\n","var flatten = require('./flatten'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\nfunction flatRest(func) {\n  return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nmodule.exports = flatRest;\n","var basePick = require('./_basePick'),\n    flatRest = require('./_flatRest');\n\n/**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\nvar pick = flatRest(function(object, paths) {\n  return object == null ? {} : basePick(object, paths);\n});\n\nmodule.exports = pick;\n","import pick from 'lodash/pick';\nimport { TreeNode } from './tree-node';\nimport {\n  TypeTreeNodeModel,\n  TypeTreeNodeData,\n  TypeTreeItem,\n  TreeNodeModelProps,\n} from './types';\n\n// 获取节点需要暴露的属性\nfunction getExposedProps(node: TreeNode): TreeNodeModelProps {\n  const props = pick(node, [\n    'value',\n    'label',\n    'data',\n    'actived',\n    'expanded',\n    'checked',\n    'indeterminate',\n    'loading',\n  ]) as TreeNodeModelProps;\n  return props;\n}\n\n// 封装对外暴露的对象\nexport function createNodeModel(node: TreeNode): TypeTreeNodeModel {\n  const props = getExposedProps(node);\n\n  const model: TypeTreeNodeModel = {\n    ...props,\n\n    // 获取节点所处层级\n    getLevel() {\n      return node.getLevel();\n    },\n\n    // 获取节点在 children 中的位置\n    getIndex() {\n      return node.getIndex();\n    },\n\n    // 判断节点是否为 children 中的第一个节点\n    isFirst() {\n      return node.isFirst();\n    },\n\n    // 判断节点是否为 children 中的最后一个节点\n    isLast() {\n      return node.isLast();\n    },\n\n    // 判断节点是否为叶节点\n    isLeaf() {\n      return node.isLeaf();\n    },\n\n    // 插入数据到节点之前\n    insertBefore(newData: TypeTreeItem) {\n      return node.insertBefore(newData);\n    },\n\n    // 插入数据到节点之后\n    insertAfter(newData: TypeTreeItem) {\n      return node.insertAfter(newData);\n    },\n\n    // 给当前节点添加子节点数据\n    appendData(data: TypeTreeNodeData | TypeTreeNodeData[]) {\n      return node.append(data);\n    },\n\n    // 返回路径节点数据集合\n    getPath(): TypeTreeNodeModel[] {\n      const nodes = node.getPath();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 获取单个父节点数据\n    getParent(): TypeTreeNodeModel {\n      return node.parent?.getModel();\n    },\n\n    // 获取所有父节点数据\n    getParents(): TypeTreeNodeModel[] {\n      const nodes = node.getParents();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 获取根节点\n    getRoot(): TypeTreeNodeModel {\n      const root = node.getRoot();\n      return root?.getModel();\n    },\n\n    // 获取兄弟节点，包含自己在内\n    getSiblings(): TypeTreeNodeModel[] {\n      const nodes = node.getSiblings();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 返回当前节点的第一层子节点数据集合\n    getChildren(deep?: boolean): boolean | TypeTreeNodeModel[] {\n      let childrenModel: boolean | TypeTreeNodeModel[] = false;\n      const { children } = node;\n      if (Array.isArray(children)) {\n        if (children.length > 0) {\n          if (deep) {\n            const nodes = node.walk();\n            nodes.shift();\n            childrenModel = nodes.map((item) => item.getModel());\n          } else {\n            childrenModel = children.map((item) => item.getModel());\n          }\n        } else {\n          childrenModel = false;\n        }\n      } else if (typeof children === 'boolean') {\n        childrenModel = children;\n      }\n      return childrenModel;\n    },\n  };\n  return model;\n}\n\n// 更新封装对象\nexport function updateNodeModel(model: TypeTreeNodeModel, node: TreeNode) {\n  // 同步节点属性\n  const props = getExposedProps(node);\n  Object.assign(model, props);\n}\n"],"names":["getNative","require$$0","defineProperty","func","Object","e","_defineProperty","baseAssignValue","object","key","value","_baseAssignValue","eq","require$$1","objectProto","prototype","hasOwnProperty","assignValue","objValue","call","undefined","_assignValue","identity","identity_1","apply","thisArg","args","length","_apply","nativeMax","Math","max","overRest","start","transform","arguments","index","array","Array","otherArgs","_overRest","constant","constant_1","require$$2","baseSetToString","string","_baseSetToString","HOT_COUNT","HOT_SPAN","nativeNow","Date","now","shortOut","count","lastCalled","stamp","remaining","_shortOut","setToString","_setToString","castPath","isIndex","isObject","require$$3","toKey","require$$4","baseSet","path","customizer","lastIndex","nested","newValue","_baseSet","baseGet","basePickBy","paths","predicate","result","_basePickBy","baseHasIn","_baseHasIn","isArguments","isArray","isLength","require$$5","hasPath","hasFunc","_hasPath","hasIn","hasIn_1","basePick","_basePick","flatten","flatRest","_flatRest","pick","pick_1","node","props","getExposedProps","model","getLevel","getIndex","isFirst","isLast","isLeaf","insertBefore","newData","insertAfter","appendData","data","append","getPath","nodes","map","item","getModel","getParent","parent","getParents","getRoot","root","getSiblings","getChildren","deep","childrenModel","children","walk","shift","assign"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,IAAIA,SAAS,GAAGC,UAAhB;;AAEA,IAAIC,gBAAc,GAAI,YAAW;AAC/B,MAAI;AACF,QAAIC,IAAI,GAAGH,SAAS,CAACI,MAAD,EAAS,gBAAT,CAApB;AACAD,IAAAA,IAAI,CAAC,EAAD,EAAK,EAAL,EAAS,EAAT,CAAJ;AACA,WAAOA,IAAP;AACD,GAJD,CAIE,OAAOE,CAAP,EAAU;AACb,CANqB,EAAtB;;IAQAC,eAAc,GAAGJ;;ACVjB,IAAIA,gBAAc,GAAGD,eAArB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASM,iBAAT,CAAyBC,MAAzB,EAAiCC,GAAjC,EAAsCC,KAAtC,EAA6C;AAC3C,MAAID,GAAG,IAAI,WAAP,IAAsBP,gBAA1B,EAA0C;AACxCA,IAAAA,gBAAc,CAACM,MAAD,EAASC,GAAT,EAAc;AAC1B,sBAAgB,IADU;AAE1B,oBAAc,IAFY;AAG1B,eAASC,KAHiB;AAI1B,kBAAY;AAJc,KAAd,CAAd;AAMD,GAPD,MAOO;AACLF,IAAAA,MAAM,CAACC,GAAD,CAAN,GAAcC,KAAd;AACD;AACF;;IAEDC,gBAAc,GAAGJ;;ACxBjB,IAAIA,eAAe,GAAGN,gBAAtB;AAAA,IACIW,EAAE,GAAGC,IADT;AAGA;;AACA,IAAIC,WAAW,GAAGV,MAAM,CAACW,SAAzB;AAEA;;AACA,IAAIC,cAAc,GAAGF,WAAW,CAACE,cAAjC;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,aAAT,CAAqBT,MAArB,EAA6BC,GAA7B,EAAkCC,KAAlC,EAAyC;AACvC,MAAIQ,QAAQ,GAAGV,MAAM,CAACC,GAAD,CAArB;;AACA,MAAI,EAAEO,cAAc,CAACG,IAAf,CAAoBX,MAApB,EAA4BC,GAA5B,KAAoCG,EAAE,CAACM,QAAD,EAAWR,KAAX,CAAxC,KACCA,KAAK,KAAKU,SAAV,IAAuB,EAAEX,GAAG,IAAID,MAAT,CAD5B,EAC+C;AAC7CD,IAAAA,eAAe,CAACC,MAAD,EAASC,GAAT,EAAcC,KAAd,CAAf;AACD;AACF;;IAEDW,YAAc,GAAGJ;;;;;;;;;;;;;;;;;;;ACXjB,SAASK,UAAT,CAAkBZ,KAAlB,EAAyB;AACvB,SAAOA,KAAP;AACD;;IAEDa,UAAc,GAAGD;;;;;;;;;;;;;ACVjB,SAASE,OAAT,CAAerB,IAAf,EAAqBsB,OAArB,EAA8BC,IAA9B,EAAoC;AAClC,UAAQA,IAAI,CAACC,MAAb;AACE,SAAK,CAAL;AAAQ,aAAOxB,IAAI,CAACgB,IAAL,CAAUM,OAAV,CAAP;;AACR,SAAK,CAAL;AAAQ,aAAOtB,IAAI,CAACgB,IAAL,CAAUM,OAAV,EAAmBC,IAAI,CAAC,CAAD,CAAvB,CAAP;;AACR,SAAK,CAAL;AAAQ,aAAOvB,IAAI,CAACgB,IAAL,CAAUM,OAAV,EAAmBC,IAAI,CAAC,CAAD,CAAvB,EAA4BA,IAAI,CAAC,CAAD,CAAhC,CAAP;;AACR,SAAK,CAAL;AAAQ,aAAOvB,IAAI,CAACgB,IAAL,CAAUM,OAAV,EAAmBC,IAAI,CAAC,CAAD,CAAvB,EAA4BA,IAAI,CAAC,CAAD,CAAhC,EAAqCA,IAAI,CAAC,CAAD,CAAzC,CAAP;AAJV;;AAMA,SAAOvB,IAAI,CAACqB,KAAL,CAAWC,OAAX,EAAoBC,IAApB,CAAP;AACD;;IAEDE,MAAc,GAAGJ;;ACpBjB,IAAIA,KAAK,GAAGvB,MAAZ;AAEA;;AACA,IAAI4B,SAAS,GAAGC,IAAI,CAACC,GAArB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkB7B,IAAlB,EAAwB8B,KAAxB,EAA+BC,SAA/B,EAA0C;AACxCD,EAAAA,KAAK,GAAGJ,SAAS,CAACI,KAAK,KAAKb,SAAV,GAAuBjB,IAAI,CAACwB,MAAL,GAAc,CAArC,GAA0CM,KAA3C,EAAkD,CAAlD,CAAjB;AACA,SAAO,YAAW;AAChB,QAAIP,IAAI,GAAGS,SAAX;AAAA,QACIC,KAAK,GAAG,CAAC,CADb;AAAA,QAEIT,MAAM,GAAGE,SAAS,CAACH,IAAI,CAACC,MAAL,GAAcM,KAAf,EAAsB,CAAtB,CAFtB;AAAA,QAGII,KAAK,GAAGC,KAAK,CAACX,MAAD,CAHjB;;AAKA,WAAO,EAAES,KAAF,GAAUT,MAAjB,EAAyB;AACvBU,MAAAA,KAAK,CAACD,KAAD,CAAL,GAAeV,IAAI,CAACO,KAAK,GAAGG,KAAT,CAAnB;AACD;;AACDA,IAAAA,KAAK,GAAG,CAAC,CAAT;AACA,QAAIG,SAAS,GAAGD,KAAK,CAACL,KAAK,GAAG,CAAT,CAArB;;AACA,WAAO,EAAEG,KAAF,GAAUH,KAAjB,EAAwB;AACtBM,MAAAA,SAAS,CAACH,KAAD,CAAT,GAAmBV,IAAI,CAACU,KAAD,CAAvB;AACD;;AACDG,IAAAA,SAAS,CAACN,KAAD,CAAT,GAAmBC,SAAS,CAACG,KAAD,CAA5B;AACA,WAAOb,KAAK,CAACrB,IAAD,EAAO,IAAP,EAAaoC,SAAb,CAAZ;AACD,GAhBD;AAiBD;;IAEDC,SAAc,GAAGR;;;;;;;;;;;;;;;;;;;;;;AChBjB,SAASS,UAAT,CAAkB/B,KAAlB,EAAyB;AACvB,SAAO,YAAW;AAChB,WAAOA,KAAP;AACD,GAFD;AAGD;;IAEDgC,UAAc,GAAGD;;ACzBjB,IAAIA,QAAQ,GAAGxC,UAAf;AAAA,IACIC,cAAc,GAAGW,eADrB;AAAA,IAEIS,QAAQ,GAAGqB,UAFf;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIC,iBAAe,GAAG,CAAC1C,cAAD,GAAkBoB,QAAlB,GAA6B,UAASnB,IAAT,EAAe0C,MAAf,EAAuB;AACxE,SAAO3C,cAAc,CAACC,IAAD,EAAO,UAAP,EAAmB;AACtC,oBAAgB,IADsB;AAEtC,kBAAc,KAFwB;AAGtC,aAASsC,QAAQ,CAACI,MAAD,CAHqB;AAItC,gBAAY;AAJ0B,GAAnB,CAArB;AAMD,CAPD;IASAC,gBAAc,GAAGF;;;ACpBjB,IAAIG,SAAS,GAAG,GAAhB;AAAA,IACIC,QAAQ,GAAG,EADf;AAGA;;AACA,IAAIC,SAAS,GAAGC,IAAI,CAACC,GAArB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkBjD,IAAlB,EAAwB;AACtB,MAAIkD,KAAK,GAAG,CAAZ;AAAA,MACIC,UAAU,GAAG,CADjB;AAGA,SAAO,YAAW;AAChB,QAAIC,KAAK,GAAGN,SAAS,EAArB;AAAA,QACIO,SAAS,GAAGR,QAAQ,IAAIO,KAAK,GAAGD,UAAZ,CADxB;AAGAA,IAAAA,UAAU,GAAGC,KAAb;;AACA,QAAIC,SAAS,GAAG,CAAhB,EAAmB;AACjB,UAAI,EAAEH,KAAF,IAAWN,SAAf,EAA0B;AACxB,eAAOZ,SAAS,CAAC,CAAD,CAAhB;AACD;AACF,KAJD,MAIO;AACLkB,MAAAA,KAAK,GAAG,CAAR;AACD;;AACD,WAAOlD,IAAI,CAACqB,KAAL,CAAWJ,SAAX,EAAsBe,SAAtB,CAAP;AACD,GAbD;AAcD;;IAEDsB,SAAc,GAAGL;;ACpCjB,IAAIR,eAAe,GAAG3C,gBAAtB;AAAA,IACImD,QAAQ,GAAGvC,SADf;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAI6C,aAAW,GAAGN,QAAQ,CAACR,eAAD,CAA1B;IAEAe,YAAc,GAAGD;;ACbjB,IAAIzC,WAAW,GAAGhB,YAAlB;AAAA,IACI2D,UAAQ,GAAG/C,SADf;AAAA,IAEIgD,SAAO,GAAGlB,QAFd;AAAA,IAGImB,QAAQ,GAAGC,UAHf;AAAA,IAIIC,OAAK,GAAGC,MAJZ;AAMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,SAAT,CAAiB1D,MAAjB,EAAyB2D,IAAzB,EAA+BzD,KAA/B,EAAsC0D,UAAtC,EAAkD;AAChD,MAAI,CAACN,QAAQ,CAACtD,MAAD,CAAb,EAAuB;AACrB,WAAOA,MAAP;AACD;;AACD2D,EAAAA,IAAI,GAAGP,UAAQ,CAACO,IAAD,EAAO3D,MAAP,CAAf;AAEA,MAAI4B,KAAK,GAAG,CAAC,CAAb;AAAA,MACIT,MAAM,GAAGwC,IAAI,CAACxC,MADlB;AAAA,MAEI0C,SAAS,GAAG1C,MAAM,GAAG,CAFzB;AAAA,MAGI2C,MAAM,GAAG9D,MAHb;;AAKA,SAAO8D,MAAM,IAAI,IAAV,IAAkB,EAAElC,KAAF,GAAUT,MAAnC,EAA2C;AACzC,QAAIlB,GAAG,GAAGuD,OAAK,CAACG,IAAI,CAAC/B,KAAD,CAAL,CAAf;AAAA,QACImC,QAAQ,GAAG7D,KADf;;AAGA,QAAID,GAAG,KAAK,WAAR,IAAuBA,GAAG,KAAK,aAA/B,IAAgDA,GAAG,KAAK,WAA5D,EAAyE;AACvE,aAAOD,MAAP;AACD;;AAED,QAAI4B,KAAK,IAAIiC,SAAb,EAAwB;AACtB,UAAInD,QAAQ,GAAGoD,MAAM,CAAC7D,GAAD,CAArB;AACA8D,MAAAA,QAAQ,GAAGH,UAAU,GAAGA,UAAU,CAAClD,QAAD,EAAWT,GAAX,EAAgB6D,MAAhB,CAAb,GAAuClD,SAA5D;;AACA,UAAImD,QAAQ,KAAKnD,SAAjB,EAA4B;AAC1BmD,QAAAA,QAAQ,GAAGT,QAAQ,CAAC5C,QAAD,CAAR,GACPA,QADO,GAEN2C,SAAO,CAACM,IAAI,CAAC/B,KAAK,GAAG,CAAT,CAAL,CAAP,GAA2B,EAA3B,GAAgC,EAFrC;AAGD;AACF;;AACDnB,IAAAA,WAAW,CAACqD,MAAD,EAAS7D,GAAT,EAAc8D,QAAd,CAAX;AACAD,IAAAA,MAAM,GAAGA,MAAM,CAAC7D,GAAD,CAAf;AACD;;AACD,SAAOD,MAAP;AACD;;IAEDgE,QAAc,GAAGN;;AClDjB,IAAIO,OAAO,GAAGxE,QAAd;AAAA,IACIiE,OAAO,GAAGrD,QADd;AAAA,IAEI+C,UAAQ,GAAGjB,SAFf;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAAS+B,YAAT,CAAoBlE,MAApB,EAA4BmE,KAA5B,EAAmCC,SAAnC,EAA8C;AAC5C,MAAIxC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIT,MAAM,GAAGgD,KAAK,CAAChD,MADnB;AAAA,MAEIkD,MAAM,GAAG,EAFb;;AAIA,SAAO,EAAEzC,KAAF,GAAUT,MAAjB,EAAyB;AACvB,QAAIwC,IAAI,GAAGQ,KAAK,CAACvC,KAAD,CAAhB;AAAA,QACI1B,KAAK,GAAG+D,OAAO,CAACjE,MAAD,EAAS2D,IAAT,CADnB;;AAGA,QAAIS,SAAS,CAAClE,KAAD,EAAQyD,IAAR,CAAb,EAA4B;AAC1BD,MAAAA,OAAO,CAACW,MAAD,EAASjB,UAAQ,CAACO,IAAD,EAAO3D,MAAP,CAAjB,EAAiCE,KAAjC,CAAP;AACD;AACF;;AACD,SAAOmE,MAAP;AACD;;IAEDC,WAAc,GAAGJ;;;;;;;;;;;ACrBjB,SAASK,WAAT,CAAmBvE,MAAnB,EAA2BC,GAA3B,EAAgC;AAC9B,SAAOD,MAAM,IAAI,IAAV,IAAkBC,GAAG,IAAIL,MAAM,CAACI,MAAD,CAAtC;AACD;;IAEDwE,UAAc,GAAGD;;ACZjB,IAAInB,QAAQ,GAAG3D,SAAf;AAAA,IACIgF,WAAW,GAAGpE,aADlB;AAAA,IAEIqE,OAAO,GAAGvC,SAFd;AAAA,IAGIkB,OAAO,GAAGE,QAHd;AAAA,IAIIoB,QAAQ,GAAGlB,UAJf;AAAA,IAKID,KAAK,GAAGoB,MALZ;AAOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,SAAT,CAAiB7E,MAAjB,EAAyB2D,IAAzB,EAA+BmB,OAA/B,EAAwC;AACtCnB,EAAAA,IAAI,GAAGP,QAAQ,CAACO,IAAD,EAAO3D,MAAP,CAAf;AAEA,MAAI4B,KAAK,GAAG,CAAC,CAAb;AAAA,MACIT,MAAM,GAAGwC,IAAI,CAACxC,MADlB;AAAA,MAEIkD,MAAM,GAAG,KAFb;;AAIA,SAAO,EAAEzC,KAAF,GAAUT,MAAjB,EAAyB;AACvB,QAAIlB,GAAG,GAAGuD,KAAK,CAACG,IAAI,CAAC/B,KAAD,CAAL,CAAf;;AACA,QAAI,EAAEyC,MAAM,GAAGrE,MAAM,IAAI,IAAV,IAAkB8E,OAAO,CAAC9E,MAAD,EAASC,GAAT,CAApC,CAAJ,EAAwD;AACtD;AACD;;AACDD,IAAAA,MAAM,GAAGA,MAAM,CAACC,GAAD,CAAf;AACD;;AACD,MAAIoE,MAAM,IAAI,EAAEzC,KAAF,IAAWT,MAAzB,EAAiC;AAC/B,WAAOkD,MAAP;AACD;;AACDlD,EAAAA,MAAM,GAAGnB,MAAM,IAAI,IAAV,GAAiB,CAAjB,GAAqBA,MAAM,CAACmB,MAArC;AACA,SAAO,CAAC,CAACA,MAAF,IAAYwD,QAAQ,CAACxD,MAAD,CAApB,IAAgCkC,OAAO,CAACpD,GAAD,EAAMkB,MAAN,CAAvC,KACJuD,OAAO,CAAC1E,MAAD,CAAP,IAAmByE,WAAW,CAACzE,MAAD,CAD1B,CAAP;AAED;;IAED+E,QAAc,GAAGF;;ACtCjB,IAAIN,SAAS,GAAG9E,UAAhB;AAAA,IACIoF,OAAO,GAAGxE,QADd;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;;AACA,SAAS2E,OAAT,CAAehF,MAAf,EAAuB2D,IAAvB,EAA6B;AAC3B,SAAO3D,MAAM,IAAI,IAAV,IAAkB6E,OAAO,CAAC7E,MAAD,EAAS2D,IAAT,EAAeY,SAAf,CAAhC;AACD;;IAEDU,OAAc,GAAGD;;ACjCjB,IAAId,UAAU,GAAGzE,WAAjB;AAAA,IACIuF,KAAK,GAAG3E,OADZ;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAAS6E,UAAT,CAAkBlF,MAAlB,EAA0BmE,KAA1B,EAAiC;AAC/B,SAAOD,UAAU,CAAClE,MAAD,EAASmE,KAAT,EAAgB,UAASjE,KAAT,EAAgByD,IAAhB,EAAsB;AACrD,WAAOqB,KAAK,CAAChF,MAAD,EAAS2D,IAAT,CAAZ;AACD,GAFgB,CAAjB;AAGD;;IAEDwB,SAAc,GAAGD;;AClBjB,IAAIE,OAAO,GAAG3F,SAAd;AAAA,IACI+B,QAAQ,GAAGnB,SADf;AAAA,IAEI6C,WAAW,GAAGf,YAFlB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASkD,UAAT,CAAkB1F,IAAlB,EAAwB;AACtB,SAAOuD,WAAW,CAAC1B,QAAQ,CAAC7B,IAAD,EAAOiB,SAAP,EAAkBwE,OAAlB,CAAT,EAAqCzF,IAAI,GAAG,EAA5C,CAAlB;AACD;;IAED2F,SAAc,GAAGD;;ACfjB,IAAIH,QAAQ,GAAGzF,SAAf;AAAA,IACI4F,QAAQ,GAAGhF,SADf;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIkF,IAAI,GAAGF,QAAQ,CAAC,UAASrF,MAAT,EAAiBmE,KAAjB,EAAwB;AAC1C,SAAOnE,MAAM,IAAI,IAAV,GAAiB,EAAjB,GAAsBkF,QAAQ,CAAClF,MAAD,EAASmE,KAAT,CAArC;AACD,CAFkB,CAAnB;IAIAqB,MAAc,GAAGD;;;;;;ACdjB,wBAAA,CAAyBE,IAAzB,EAA6D;MACrDC,QAAQH,OAAKE,MAAM,CACvB,OADuB,EAEvB,OAFuB,EAGvB,MAHuB,EAIvB,SAJuB,EAKvB,UALuB,EAMvB,SANuB,EAOvB,eAPuB,EAQvB,SARuB;SAUlBC;;;yBAIuBD,MAAmC;MAC3DC,QAAQC,gBAAgBF;;MAExBG,wCACDF;AAGHG,IAAAA,8BAAW;aACFJ,KAAKI,QAAL;;AAITC,IAAAA,8BAAW;aACFL,KAAKK,QAAL;;AAITC,IAAAA,4BAAU;aACDN,KAAKM,OAAL;;AAITC,IAAAA,0BAAS;aACAP,KAAKO,MAAL;;AAITC,IAAAA,0BAAS;aACAR,KAAKQ,MAAL;;AAITC,IAAAA,oCAAaC,SAAuB;aAC3BV,KAAKS,YAAL,CAAkBC,OAAlB;;AAITC,IAAAA,kCAAYD,SAAuB;aAC1BV,KAAKW,WAAL,CAAiBD,OAAjB;;AAITE,IAAAA,gCAAWC,MAA6C;aAC/Cb,KAAKc,MAAL,CAAYD,IAAZ;;AAITE,IAAAA,4BAA+B;UACvBC,QAAQhB,KAAKe,OAAL;aACPC,MAAMC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAoBA,KAAKC,QAAL,EAApB;AAAA,OAAV;;AAITC,IAAAA,gCAA+B;AAAA;;6BACtBpB,KAAKqB,uDAAL,aAAaF,QAAb;;AAITG,IAAAA,kCAAkC;UAC1BN,QAAQhB,KAAKsB,UAAL;aACPN,MAAMC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAoBA,KAAKC,QAAL,EAApB;AAAA,OAAV;;AAITI,IAAAA,4BAA6B;UACrBC,OAAOxB,KAAKuB,OAAL;aACNC,iBAAAA,2BAAAA,KAAML,QAAN;;AAITM,IAAAA,oCAAmC;UAC3BT,QAAQhB,KAAKyB,WAAL;aACPT,MAAMC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAoBA,KAAKC,QAAL,EAApB;AAAA,OAAV;;AAITO,IAAAA,kCAAYC,MAA+C;UACrDC,gBAA+C;UAC3CC,WAAa7B,KAAb6B;;UACJxF,MAAM4C,OAAN,CAAc4C,QAAd,GAAyB;YACvBA,SAASnG,MAAT,GAAkB,GAAG;cACnBiG,MAAM;gBACFX,QAAQhB,KAAK8B,IAAL;kBACRC;4BACUf,MAAMC,GAAN,CAAU,UAACC,IAAD;AAAA,qBAAUA,KAAKC,QAAL,EAAV;AAAA,aAAV;iBACX;4BACWU,SAASZ,GAAT,CAAa,UAACC,IAAD;AAAA,qBAAUA,KAAKC,QAAL,EAAV;AAAA,aAAb;;eAEb;0BACW;;iBAET,OAAOU,QAAP,KAAoB,WAAW;wBACxBA;;;aAEXD;;;;SAGJzB;;yBAIuBA,OAA0BH,MAAgB;MAElEC,QAAQC,gBAAgBF;SACvBgC,OAAO7B,OAAOF;;;;;"}

package/{es/_chunks/dep-7fc224ab.js → esm/_chunks/dep-4adf27fa.js}

@@ -1,13 +1,13 @@
 /**
- * tdesign v0.17.0-beta.0
+ * tdesign v0.18.1
  * (c) 2021 tdesign
  * @license MIT
  */
 
-import './dep-f10228f2.js';
-import { i as isFunction_1 } from './dep-9e89d07e.js';
-import './dep-77c01d8f.js';
-import { i as isLength_1 } from './dep-d54a9111.js';
+import './dep-9052d175.js';
+import { i as isFunction_1 } from './dep-53a5fcb7.js';
+import './dep-c4d6268b.js';
+import { i as isLength_1 } from './dep-766ddb96.js';
 
 var isFunction = isFunction_1,
     isLength = isLength_1;
@@ -44,4 +44,4 @@ function isArrayLike(value) {
 var isArrayLike_1 = isArrayLike;
 
 export { isArrayLike_1 as i };
-//# sourceMappingURL=dep-7fc224ab.js.map
+//# sourceMappingURL=dep-4adf27fa.js.map

package/{es/_chunks/dep-7fc224ab.js.map → esm/_chunks/dep-4adf27fa.js.map}

@@ -1 +1 @@
-{"version":3,"file":"dep-7fc224ab.js","sources":["../../node_modules/lodash/isArrayLike.js"],"sourcesContent":["var isFunction = require('./isFunction'),\n    isLength = require('./isLength');\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\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 array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n"],"names":["isFunction","require$$0","isLength","require$$1","isArrayLike","value","length","isArrayLike_1"],"mappings":";;;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,YAAjB;AAAA,IACIC,QAAQ,GAAGC,UADf;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,SAASC,WAAT,CAAqBC,KAArB,EAA4B;AAC1B,SAAOA,KAAK,IAAI,IAAT,IAAiBH,QAAQ,CAACG,KAAK,CAACC,MAAP,CAAzB,IAA2C,CAACN,UAAU,CAACK,KAAD,CAA7D;AACD;;IAEDE,aAAc,GAAGH;;;;"}
+{"version":3,"file":"dep-4adf27fa.js","sources":["../../node_modules/lodash/isArrayLike.js"],"sourcesContent":["var isFunction = require('./isFunction'),\n    isLength = require('./isLength');\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\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 array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n"],"names":["isFunction","require$$0","isLength","require$$1","isArrayLike","value","length","isArrayLike_1"],"mappings":";;;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,YAAjB;AAAA,IACIC,QAAQ,GAAGC,UADf;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,SAASC,WAAT,CAAqBC,KAArB,EAA4B;AAC1B,SAAOA,KAAK,IAAI,IAAT,IAAiBH,QAAQ,CAACG,KAAK,CAACC,MAAP,CAAzB,IAA2C,CAACN,UAAU,CAACK,KAAD,CAA7D;AACD;;IAEDE,aAAc,GAAGH;;;;"}

package/esm/_chunks/{dep-9e89d07e.js → dep-53a5fcb7.js}

@@ -1,13 +1,13 @@
 /**
- * tdesign v0.17.0-beta.0
+ * tdesign v0.18.1
  * (c) 2021 tdesign
  * @license MIT
  */
 
-import './dep-f10228f2.js';
-import { _ as _baseGetTag } from './dep-fbff26c5.js';
-import { i as isObject_1 } from './dep-d5cf8459.js';
-import './dep-caea8b6e.js';
+import './dep-9052d175.js';
+import { _ as _baseGetTag } from './dep-2f74dba2.js';
+import { i as isObject_1 } from './dep-b78554de.js';
+import './dep-c7c70ac0.js';
 
 var baseGetTag = _baseGetTag,
     isObject = isObject_1;
@@ -49,4 +49,4 @@ function isFunction(value) {
 var isFunction_1 = isFunction;
 
 export { isFunction_1 as i };
-//# sourceMappingURL=dep-9e89d07e.js.map
+//# sourceMappingURL=dep-53a5fcb7.js.map

package/esm/_chunks/{dep-9e89d07e.js.map → dep-53a5fcb7.js.map}

@@ -1 +1 @@
-{"version":3,"file":"dep-9e89d07e.js","sources":["../../node_modules/lodash/isFunction.js"],"sourcesContent":["var baseGetTag = require('./_baseGetTag'),\n    isObject = require('./isObject');\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n"],"names":["baseGetTag","require$$0","isObject","require$$1","asyncTag","funcTag","genTag","proxyTag","isFunction","value","tag","isFunction_1"],"mappings":";;;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,WAAjB;AAAA,IACIC,QAAQ,GAAGC,UADf;AAGA;;AACA,IAAIC,QAAQ,GAAG,wBAAf;AAAA,IACIC,OAAO,GAAG,mBADd;AAAA,IAEIC,MAAM,GAAG,4BAFb;AAAA,IAGIC,QAAQ,GAAG,gBAHf;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAoBC,KAApB,EAA2B;AACzB,MAAI,CAACP,QAAQ,CAACO,KAAD,CAAb,EAAsB;AACpB,WAAO,KAAP;AACD,GAHwB;;;;AAMzB,MAAIC,GAAG,GAAGV,UAAU,CAACS,KAAD,CAApB;AACA,SAAOC,GAAG,IAAIL,OAAP,IAAkBK,GAAG,IAAIJ,MAAzB,IAAmCI,GAAG,IAAIN,QAA1C,IAAsDM,GAAG,IAAIH,QAApE;AACD;;IAEDI,YAAc,GAAGH;;;;"}
+{"version":3,"file":"dep-53a5fcb7.js","sources":["../../node_modules/lodash/isFunction.js"],"sourcesContent":["var baseGetTag = require('./_baseGetTag'),\n    isObject = require('./isObject');\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n"],"names":["baseGetTag","require$$0","isObject","require$$1","asyncTag","funcTag","genTag","proxyTag","isFunction","value","tag","isFunction_1"],"mappings":";;;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,WAAjB;AAAA,IACIC,QAAQ,GAAGC,UADf;AAGA;;AACA,IAAIC,QAAQ,GAAG,wBAAf;AAAA,IACIC,OAAO,GAAG,mBADd;AAAA,IAEIC,MAAM,GAAG,4BAFb;AAAA,IAGIC,QAAQ,GAAG,gBAHf;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAoBC,KAApB,EAA2B;AACzB,MAAI,CAACP,QAAQ,CAACO,KAAD,CAAb,EAAsB;AACpB,WAAO,KAAP;AACD,GAHwB;;;;AAMzB,MAAIC,GAAG,GAAGV,UAAU,CAACS,KAAD,CAApB;AACA,SAAOC,GAAG,IAAIL,OAAP,IAAkBK,GAAG,IAAIJ,MAAzB,IAAmCI,GAAG,IAAIN,QAA1C,IAAsDM,GAAG,IAAIH,QAApE;AACD;;IAEDI,YAAc,GAAGH;;;;"}

package/esm/_chunks/dep-66287469.js

@@ -0,0 +1,8 @@
+/**
+ * tdesign v0.18.1
+ * (c) 2021 tdesign
+ * @license MIT
+ */
+
+import './dep-776ae9a7.js';
+//# sourceMappingURL=dep-66287469.js.map

package/esm/_chunks/dep-66287469.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-66287469.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;"}

package/esm/_chunks/dep-6d4c74ed.js

@@ -0,0 +1,24 @@
+/**
+ * tdesign v0.18.1
+ * (c) 2021 tdesign
+ * @license MIT
+ */
+
+function _typeof(obj) {
+  "@babel/helpers - typeof";
+
+  if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") {
+    _typeof = function _typeof(obj) {
+      return typeof obj;
+    };
+  } else {
+    _typeof = function _typeof(obj) {
+      return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj;
+    };
+  }
+
+  return _typeof(obj);
+}
+
+export { _typeof as _ };
+//# sourceMappingURL=dep-6d4c74ed.js.map

package/esm/_chunks/{dep-124a41a4.js.map → dep-6d4c74ed.js.map}

@@ -1 +1 @@
-{"version":3,"file":"dep-124a41a4.js","sources":["../../node_modules/@babel/runtime/helpers/esm/typeof.js"],"sourcesContent":["export default function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") {\n    _typeof = function _typeof(obj) {\n      return typeof obj;\n    };\n  } else {\n    _typeof = function _typeof(obj) {\n      return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n    };\n  }\n\n  return _typeof(obj);\n}"],"names":["_typeof","obj","Symbol","iterator","constructor","prototype"],"mappings":";;;;;;AAAe,SAASA,OAAT,CAAiBC,GAAjB,EAAsB;AACnC;;AAEA,MAAI,OAAOC,MAAP,KAAkB,UAAlB,IAAgC,OAAOA,MAAM,CAACC,QAAd,KAA2B,QAA/D,EAAyE;AACvEH,IAAAA,OAAO,GAAG,SAASA,OAAT,CAAiBC,GAAjB,EAAsB;AAC9B,aAAO,OAAOA,GAAd;AACD,KAFD;AAGD,GAJD,MAIO;AACLD,IAAAA,OAAO,GAAG,SAASA,OAAT,CAAiBC,GAAjB,EAAsB;AAC9B,aAAOA,GAAG,IAAI,OAAOC,MAAP,KAAkB,UAAzB,IAAuCD,GAAG,CAACG,WAAJ,KAAoBF,MAA3D,IAAqED,GAAG,KAAKC,MAAM,CAACG,SAApF,GAAgG,QAAhG,GAA2G,OAAOJ,GAAzH;AACD,KAFD;AAGD;;AAED,SAAOD,OAAO,CAACC,GAAD,CAAd;AACD;;;;"}
+{"version":3,"file":"dep-6d4c74ed.js","sources":["../../node_modules/@babel/runtime/helpers/esm/typeof.js"],"sourcesContent":["export default function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") {\n    _typeof = function _typeof(obj) {\n      return typeof obj;\n    };\n  } else {\n    _typeof = function _typeof(obj) {\n      return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n    };\n  }\n\n  return _typeof(obj);\n}"],"names":["_typeof","obj","Symbol","iterator","constructor","prototype"],"mappings":";;;;;;AAAe,SAASA,OAAT,CAAiBC,GAAjB,EAAsB;AACnC;;AAEA,MAAI,OAAOC,MAAP,KAAkB,UAAlB,IAAgC,OAAOA,MAAM,CAACC,QAAd,KAA2B,QAA/D,EAAyE;AACvEH,IAAAA,OAAO,GAAG,SAASA,OAAT,CAAiBC,GAAjB,EAAsB;AAC9B,aAAO,OAAOA,GAAd;AACD,KAFD;AAGD,GAJD,MAIO;AACLD,IAAAA,OAAO,GAAG,SAASA,OAAT,CAAiBC,GAAjB,EAAsB;AAC9B,aAAOA,GAAG,IAAI,OAAOC,MAAP,KAAkB,UAAzB,IAAuCD,GAAG,CAACG,WAAJ,KAAoBF,MAA3D,IAAqED,GAAG,KAAKC,MAAM,CAACG,SAApF,GAAgG,QAAhG,GAA2G,OAAOJ,GAAzH;AACD,KAFD;AAGD;;AAED,SAAOD,OAAO,CAACC,GAAD,CAAd;AACD;;;;"}

package/{es/_chunks/dep-ef0a1e48.js → esm/_chunks/dep-7500c6cf.js}

@@ -1,17 +1,17 @@
 /**
- * tdesign v0.17.0-beta.0
+ * tdesign v0.18.1
  * (c) 2021 tdesign
  * @license MIT
  */
 
-import { _ as _typeof } from './dep-124a41a4.js';
-import { _ as _slicedToArray } from './dep-bd3f1446.js';
+import { _ as _typeof } from './dep-6d4c74ed.js';
+import { _ as _slicedToArray } from './dep-24340815.js';
 import * as React from 'react';
 import { CheckCircleFilledIcon, InfoCircleFilledIcon, CloseIcon } from 'tdesign-icons-react';
 import noop from '../_util/noop.js';
 import useConfig from '../_util/useConfig.js';
-import { _ as _defineProperty } from './dep-a0803fb6.js';
-import { _ as _toConsumableArray } from './dep-0859ba52.js';
+import { _ as _defineProperty } from './dep-b05711f1.js';
+import { _ as _toConsumableArray } from './dep-222f3011.js';
 import * as ReactDOM from 'react-dom';
 
 function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) { symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); } keys.push.apply(keys, symbols); } return keys; }
@@ -378,4 +378,4 @@ Notification.closeAll = function () {
 };
 
 export { Notification as N, NotificationComponent as a, fetchListInstance as f, listMap as l };
-//# sourceMappingURL=dep-ef0a1e48.js.map
+//# sourceMappingURL=dep-7500c6cf.js.map