tdesign-react 0.20.0 → 0.20.1

package/cjs/_chunks/dep-7e499d5c.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-7e499d5c.js","sources":["../../node_modules/lodash/_getPrototype.js","../../node_modules/lodash/isPlainObject.js","../../src/_common/js/tree/tree-store.ts"],"sourcesContent":["var overArg = require('./_overArg');\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nmodule.exports = getPrototype;\n","var baseGetTag = require('./_baseGetTag'),\n    getPrototype = require('./_getPrototype'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n  if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n    return false;\n  }\n  var proto = getPrototype(value);\n  if (proto === null) {\n    return true;\n  }\n  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n  return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n    funcToString.call(Ctor) == objectCtorString;\n}\n\nmodule.exports = isPlainObject;\n","import difference from 'lodash/difference';\nimport camelCase from 'lodash/camelCase';\nimport isPlainObject from 'lodash/isPlainObject';\nimport { TreeNode } from './tree-node';\nimport {\n  TreeNodeValue,\n  TypeIdMap,\n  TypeTimer,\n  TypeTargetNode,\n  TypeTreeNodeData,\n  TypeTreeStoreOptions,\n  TypeTreeFilter,\n  TypeTreeFilterOptions,\n  TypeRelatedNodesOptions,\n  TypeTreeEventState,\n} from './types';\n\n// 构建一个树的数据模型\n// 基本设计思想：写入时更新，减少读取消耗，以减少未来实现虚拟滚动所需的计算量\n// 任何一次数据写入，会触发相应节点的状态更新\nexport class TreeStore {\n  // 根节点集合\n  public children: TreeNode[];\n\n  // 所有节点集合\n  public nodes: TreeNode[];\n\n  // 所有节点映射\n  public nodeMap: Map<TreeNodeValue, TreeNode>;\n\n  // 配置选项\n  public config: TypeTreeStoreOptions;\n\n  // 活动节点集合\n  public activedMap: TypeIdMap;\n\n  // 数据被更新的节点集合\n  public updatedMap: TypeIdMap;\n\n  // 选中节点集合\n  public checkedMap: TypeIdMap;\n\n  // 展开节点的集合\n  public expandedMap: TypeIdMap;\n\n  // 符合过滤条件的节点的集合\n  public filterMap: TypeIdMap;\n\n  // 数据更新计时器\n  public updateTimer: TypeTimer;\n\n  // 识别是否需要重排\n  public shouldReflow: boolean;\n\n  // 树节点过滤器\n  public prevFilter: TypeTreeFilter;\n\n  public constructor(options: TypeTreeStoreOptions) {\n    const config: TypeTreeStoreOptions = {\n      prefix: 't',\n      keys: {},\n      expandAll: false,\n      expandLevel: 0,\n      expandMutex: false,\n      expandParent: false,\n      activable: false,\n      activeMultiple: false,\n      checkable: false,\n      checkStrictly: false,\n      disabled: false,\n      load: null,\n      lazy: false,\n      valueMode: 'onlyLeaf',\n      filter: null,\n      onLoad: null,\n      onReflow: null,\n      onUpdate: null,\n      ...options,\n    };\n    this.config = config;\n    this.nodes = [];\n    this.children = [];\n    this.nodeMap = new Map();\n    this.activedMap = new Map();\n    this.expandedMap = new Map();\n    this.checkedMap = new Map();\n    this.updatedMap = new Map();\n    this.filterMap = new Map();\n    this.prevFilter = null;\n    // 这个计时器确保频繁的 update 事件被归纳为1次完整数据更新后的触发\n    this.updateTimer = null;\n    // 在子节点增删改查时，将此属性设置为 true，来触发视图更新\n    this.shouldReflow = false;\n  }\n\n  // 配置选项\n  public setConfig(options: TypeTreeStoreOptions) {\n    let hasChanged = false;\n    Object.keys(options).forEach((key) => {\n      const val = options[key];\n      if (val !== this.config[key]) {\n        hasChanged = true;\n        this.config[key] = val;\n      }\n    });\n    if (hasChanged) {\n      // 在 td-tree 的 render 方法中调用 setConfig\n      // 这样减少了 watch 属性\n      // 仅在属性变更后刷新状态\n      // 这样可以避免触发渲染死循环\n      this.refreshState();\n    }\n  }\n\n  // 获取根孩子节点列表\n  public getChildren() {\n    return this.children;\n  }\n\n  // 获取节点对象\n  public getNode(item: TypeTargetNode): TreeNode {\n    let node = null;\n    if (typeof item === 'string' || typeof item === 'number') {\n      node = this.nodeMap.get(item);\n    } else if (item instanceof TreeNode) {\n      node = this.nodeMap.get(item.value);\n    }\n    return node;\n  }\n\n  // 获取节点在总节点列表中的位置\n  public getIndex(node: TreeNode): number {\n    return this.nodes.indexOf(node);\n  }\n\n  // 获取指定节点的父节点\n  public getParent(value: TypeTargetNode): TreeNode {\n    let parent = null;\n    const node = this.getNode(value);\n    if (node) {\n      parent = node.getParent();\n    }\n    return parent;\n  }\n\n  // 获取指定节点的所有父节点\n  public getParents(value: TypeTargetNode): TreeNode[] {\n    const node = this.getNode(value);\n    let parents: TreeNode[] = [];\n    if (node) {\n      parents = node.getParents();\n    }\n    return parents;\n  }\n\n  // 获取指定节点在其所在 children 中的位置\n  public getNodeIndex(value: TypeTargetNode): number {\n    const node = this.getNode(value);\n    let index = -1;\n    if (node) {\n      index = node.getIndex();\n    }\n    return index;\n  }\n\n  // 获取所有符合条件的节点\n  public getNodes(\n    item?: TypeTargetNode,\n    options?: TypeTreeFilterOptions,\n  ): TreeNode[] {\n    let nodes: TreeNode[] = [];\n    let val: TreeNodeValue = '';\n    if (typeof item === 'string' || typeof item === 'number') {\n      val = item;\n    } else if (item instanceof TreeNode) {\n      val = item.value;\n    }\n    if (!val) {\n      nodes = this.nodes.slice(0);\n    } else {\n      const node = this.getNode(val);\n      if (node) {\n        nodes = node.walk();\n      }\n    }\n\n    if (options) {\n      const conf: TypeTreeFilterOptions = {\n        filter: null,\n        level: Infinity,\n        ...options,\n      };\n      if (typeof conf.level === 'number' && conf.level !== Infinity) {\n        nodes = nodes.filter((node) => node.level <= conf.level);\n      }\n      if (typeof conf.filter === 'function') {\n        nodes = nodes.filter((node) => {\n          const nodeModel = node.getModel();\n          return conf.filter(nodeModel);\n        });\n      }\n      if (isPlainObject(conf.props)) {\n        nodes = nodes.filter((node) => {\n          const result = Object.keys(conf.props).every((key) => {\n            const propEqual = node[key] === conf.props[key];\n            return propEqual;\n          });\n          return result;\n        });\n      }\n    }\n    return nodes;\n  }\n\n  // 给树添加节点数据\n  public append(list: TypeTreeNodeData[]): void {\n    list.forEach((item) => {\n      const node = new TreeNode(this, item);\n      this.children.push(node);\n    });\n    this.reflow();\n  }\n\n  // 重新加载数据\n  public reload(list: TypeTreeNodeData[]): void {\n    this.expandedMap.clear();\n    this.checkedMap.clear();\n    this.activedMap.clear();\n    this.filterMap.clear();\n    this.removeAll();\n    this.append(list);\n  }\n\n  // 解析节点数据，适配多种节点类型\n  public parseNodeData(\n    para: TreeNodeValue | TreeNode | TypeTreeNodeData,\n    item: TypeTreeNodeData | TypeTreeNodeData[] | TreeNode,\n  ) {\n    let value: TreeNodeValue = '';\n    let node = null;\n    let data = null;\n\n    if (typeof para === 'string' || typeof para === 'number') {\n      value = para;\n      data = item;\n      node = this.getNode(value);\n    } else if (para instanceof TreeNode) {\n      node = para;\n      data = item;\n    } else {\n      data = para;\n    }\n    const spec = {\n      node,\n      data,\n    };\n    return spec;\n  }\n\n  /**\n   * 向指定节点追加节点或者数据\n   * 支持下列使用方式\n   * item: 节点数据, TreeNode: 节点实例, value: 节点值(ID)\n   * appendNodes(item)\n   * appendNodes(TreeNode)\n   * appendNodes(value, item)\n   * appendNodes(value, TreeNode)\n   * appendNodes(TreeNode, item)\n   * appendNodes(TreeNode, TreeNode)\n   */\n  public appendNodes(\n    para?: TypeTargetNode | TypeTreeNodeData,\n    item?: TypeTreeNodeData | TreeNode,\n  ): void {\n    const spec = this.parseNodeData(para, item);\n    if (spec.data) {\n      if (!spec.node) {\n        // 在根节点插入\n        if (spec.data instanceof TreeNode) {\n          spec.data.appendTo(this);\n        } else if (Array.isArray(spec.data)) {\n          this.append(spec.data);\n        } else {\n          this.append([spec.data]);\n        }\n      } else {\n        // 插入到目标节点之下\n        if (spec.data instanceof TreeNode) {\n          spec.data.appendTo(this, spec.node);\n        } else if (Array.isArray(spec.data)) {\n          spec.node.append(spec.data);\n        } else {\n          spec.node.append([spec.data]);\n        }\n        spec.node.updateRelated();\n      }\n    }\n  }\n\n  // 在目标节点之前插入节点\n  public insertBefore(value: TypeTargetNode, item: TypeTreeNodeData): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.insertBefore(item);\n    }\n  }\n\n  // 在目标节点之后插入节点\n  public insertAfter(value: TypeTargetNode, item: TypeTreeNodeData): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.insertAfter(item);\n    }\n  }\n\n  // 更新树结构\n  // 清空 nodes 数组，然后遍历所有根节点重新插入 node\n  public refreshNodes(): void {\n    const { children, nodes } = this;\n    nodes.length = 0;\n    children.forEach((node) => {\n      const list = node.walk();\n      Array.prototype.push.apply(nodes, list);\n    });\n  }\n\n  // 更新所有树节点状态\n  public refreshState(): void {\n    const { nodes } = this;\n    nodes.forEach((node) => {\n      node.update();\n      node.updateChecked();\n    });\n  }\n\n  // 节点重排\n  // 应该仅在树节点增删改查时调用\n  public reflow(node?: TreeNode): void {\n    this.shouldReflow = true;\n    this.updated(node);\n  }\n\n  // 触发更新事件\n  // 节点属性变更时调用\n  public updated(node?: TreeNode): void {\n    if (node?.value) {\n      this.updatedMap.set(node.value, true);\n    }\n    if (this.updateTimer) return;\n    this.updateTimer = +setTimeout(() => {\n      clearTimeout(this.updateTimer);\n      this.updateTimer = null;\n\n      // 检查节点是否需要回流，重排数组\n      if (this.shouldReflow) {\n        this.refreshNodes();\n        this.emit('reflow');\n      }\n\n      // 检查节点是否有被过滤，锁定路径节点\n      // 在此之前要遍历节点生成一个经过排序的节点数组\n      // 以便于优化锁定检查算法\n      this.lockFilterPathNodes();\n\n      const updatedList = Array.from(this.updatedMap.keys());\n      if (updatedList.length > 0) {\n        // 统计需要更新状态的节点，派发更新事件\n        const updatedNodes = updatedList.map((value) => this.getNode(value));\n        this.emit('update', {\n          nodes: updatedNodes,\n          map: this.updatedMap,\n        });\n      } else if (this.shouldReflow) {\n        // 单纯的回流不需要更新节点状态\n        // 但需要触发更新事件\n        this.emit('update', {\n          nodes: [],\n          map: this.updatedMap,\n        });\n      }\n\n      // 每次回流检查完毕，还原检查状态\n      this.shouldReflow = false;\n      this.updatedMap.clear();\n    });\n  }\n\n  // 获取激活节点集合\n  public getActived(map?: TypeIdMap): TreeNodeValue[] {\n    const activedMap = map || this.activedMap;\n    return Array.from(activedMap.keys());\n  }\n\n  // 获取指定范围的高亮节点\n  public getActivedNodes(item?: TypeTargetNode): TreeNode[] {\n    let nodes = this.getNodes(item);\n    nodes = nodes.filter((node) => node.isActived());\n    return nodes;\n  }\n\n  // 替换激活态\n  public replaceActived(list: TreeNodeValue[]): void {\n    this.resetActived();\n    this.setActived(list);\n  }\n\n  // 设置激活态\n  public setActived(actived: TreeNodeValue[]): void {\n    const { activeMultiple } = this.config;\n    const list = actived.slice(0);\n    if (!activeMultiple) {\n      list.length = 1;\n    }\n    list.forEach((val) => {\n      this.activedMap.set(val, true);\n      const node = this.getNode(val);\n      if (node) {\n        node.update();\n      }\n    });\n  }\n\n  // 重置激活态\n  public resetActived(): void {\n    const actived = this.getActived();\n    this.activedMap.clear();\n    const relatedNodes = this.getRelatedNodes(actived);\n    relatedNodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  // 获取展开节点集合\n  public getExpanded(map?: TypeIdMap): TreeNodeValue[] {\n    const expandedMap = map || this.expandedMap;\n    return Array.from(expandedMap.keys());\n  }\n\n  // 替换展开节点\n  public replaceExpanded(list: TreeNodeValue[]): void {\n    const expanded = this.getExpanded();\n    const added = difference(list, expanded);\n    const removed = difference(expanded, list);\n    this.setExpandedDirectly(removed, false);\n    this.updateExpanded(removed);\n    this.setExpanded(added);\n  }\n\n  // 批量设置展开节点\n  public setExpanded(list: TreeNodeValue[]): void {\n    this.setExpandedDirectly(list);\n    this.updateExpanded(list);\n  }\n\n  // 直接设置展开节点数据，不更新节点状态\n  public setExpandedDirectly(list: TreeNodeValue[], expanded = true): void {\n    list.forEach((val) => {\n      if (expanded) {\n        this.expandedMap.set(val, true);\n        const node = this.getNode(val);\n        if (node) {\n          node.afterExpanded();\n        }\n      } else {\n        this.expandedMap.delete(val);\n      }\n    });\n  }\n\n  // 清除所有展开节点\n  public resetExpanded(): void {\n    const expanded = this.getExpanded();\n    this.expandedMap.clear();\n    this.updateExpanded(expanded);\n  }\n\n  // 更新展开节点相关节点的状态\n  public updateExpanded(list: TreeNodeValue[]): void {\n    const relatedNodes = this.getRelatedNodes(list, {\n      withParents: false,\n    });\n    relatedNodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  // 获取选中态节点 value 数组\n  public getChecked(map?: TypeIdMap): TreeNodeValue[] {\n    const { nodes, config } = this;\n    const { valueMode, checkStrictly } = config;\n    const list: TreeNodeValue[] = [];\n    const checkedMap = map || this.checkedMap;\n    nodes.forEach((node) => {\n      if (node.isChecked(checkedMap)) {\n        if (valueMode === 'parentFirst' && !checkStrictly) {\n          if (!node.parent || !node.parent.isChecked(checkedMap)) {\n            list.push(node.value);\n          }\n        } else if (valueMode === 'onlyLeaf' && !checkStrictly) {\n          if (node.isLeaf()) {\n            list.push(node.value);\n          }\n        } else {\n          list.push(node.value);\n        }\n      }\n    });\n    return list;\n  }\n\n  // 获取指定节点下的选中节点\n  public getCheckedNodes(item?: TypeTargetNode): TreeNode[] {\n    let nodes = this.getNodes(item);\n    nodes = nodes.filter((node) => node.isChecked());\n    return nodes;\n  }\n\n  // 替换选中态列表\n  public replaceChecked(list: TreeNodeValue[]): void {\n    this.resetChecked();\n    this.setChecked(list);\n  }\n\n  // 批量设置选中态\n  public setChecked(list: TreeNodeValue[]): void {\n    const { valueMode, checkStrictly, checkable } = this.config;\n    if (!checkable) return;\n    list.forEach((val: TreeNodeValue) => {\n      const node = this.getNode(val);\n      if (node) {\n        if (valueMode === 'parentFirst' && !checkStrictly) {\n          const childrenNodes = node.walk();\n          childrenNodes.forEach((childNode) => {\n            this.checkedMap.set(childNode.value, true);\n          });\n        } else {\n          this.checkedMap.set(val, true);\n          node.updateChecked();\n        }\n      }\n    });\n    if (!checkStrictly) {\n      const checked = this.getChecked();\n      const relatedNodes = this.getRelatedNodes(checked);\n      relatedNodes.forEach((node) => {\n        node.updateChecked();\n      });\n    }\n  }\n\n  // 清除所有选中节点\n  public resetChecked(): void {\n    const checked = this.getChecked();\n    const relatedNodes = this.getRelatedNodes(checked);\n    this.checkedMap.clear();\n    relatedNodes.forEach((node) => {\n      node.updateChecked();\n    });\n  }\n\n  // 更新全部节点状态\n  public updateAll(): void {\n    const nodes = this.getNodes();\n    nodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  // 移除指定节点\n  public remove(value?: TypeTargetNode): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.remove();\n    }\n  }\n\n  // 清空所有节点\n  public removeAll(): void {\n    const nodes = this.getNodes();\n    nodes.forEach((node) => {\n      node.remove();\n    });\n  }\n\n  // 获取节点状态变化可能影响的周边节点\n  // 实现最小遍历集合\n  public getRelatedNodes(\n    list: TreeNodeValue[],\n    options?: TypeRelatedNodesOptions,\n  ): TreeNode[] {\n    const conf = {\n      withParents: true,\n      ...options,\n    };\n    const map = new Map();\n    list.forEach((value) => {\n      if (map.get(value)) return;\n      const node = this.getNode(value);\n      if (node) {\n        const parents = node.getParents();\n        const children = node.walk();\n        let related = [];\n        if (conf.withParents) {\n          related = parents.concat(children);\n        } else {\n          related = children;\n        }\n        related.forEach((relatedNode) => {\n          map.set(relatedNode.value, relatedNode);\n        });\n      }\n    });\n    const relatedNodes = Array.from(map.values());\n    return relatedNodes;\n  }\n\n  // 触发绑定的事件\n  public emit(name: string, state?: TypeTreeEventState): void {\n    const config = this.config || {};\n    const methodName = camelCase(`on-${name}`);\n    const method = config[methodName];\n    if (typeof method === 'function') {\n      method(state);\n    }\n  }\n\n  // 锁定过滤节点的路径节点\n  // 使得路径节点展开，可见，且不可操作\n  public lockFilterPathNodes() {\n    const {\n      config,\n      filterMap,\n    } = this;\n\n    // 之前没有设置过过滤器\n    // 当前也没有过滤器\n    // 则无需处理锁定节点\n    if (!config.filter && !this.prevFilter) {\n      return;\n    }\n    this.prevFilter = config.filter;\n\n    const allNodes = this.getNodes();\n    allNodes.forEach((node: TreeNode) => {\n      node.lock(false);\n    });\n    if (allNodes.length === filterMap.size) {\n      // 未经任何过滤，则无需处理锁定节点\n      return;\n    }\n\n    // 构造路径节点map\n    const map = new Map();\n\n    // 全部节点要经过排序，才能使用这个算法\n    // 比起每个过滤节点调用 getParents 方法检查父节点状态\n    // 算法复杂度 O(N*log(N)) => O(N)\n    allNodes.reverse().forEach((item: TreeNode) => {\n      const node = item;\n\n      // 被过滤节点父节点固定为展开状态\n      const parent = node.getParent();\n      if (node.vmIsRest) {\n        if (parent) {\n          parent.expanded = true;\n        }\n        // 被过滤节点固定为展示状态\n        node.visible = true;\n      }\n      if (node.vmIsRest || map.get(node.value)) {\n        if (parent && !parent.vmIsRest) {\n          map.set(parent.value, true);\n        }\n      }\n    });\n\n    // 锁定路径节点展示样式\n    const filterPathValues = Array.from(map.keys());\n    filterPathValues.forEach((value: TreeNodeValue) => {\n      const node = this.getNode(value);\n      if (node) {\n        node.lock(true);\n      }\n    });\n  }\n}\n\nexport default TreeStore;\n"],"names":["overArg","require$$0","getPrototype","Object","getPrototypeOf","_getPrototype","baseGetTag","require$$1","isObjectLike","require$$2","objectTag","funcProto","Function","prototype","objectProto","funcToString","toString","hasOwnProperty","objectCtorString","call","isPlainObject","value","proto","Ctor","constructor","isPlainObject_1","options","config","prefix","keys","expandAll","expandLevel","expandMutex","expandParent","activable","activeMultiple","checkable","checkStrictly","disabled","load","lazy","valueMode","filter","onLoad","onReflow","onUpdate","nodes","children","nodeMap","Map","activedMap","expandedMap","checkedMap","updatedMap","filterMap","prevFilter","updateTimer","shouldReflow","hasChanged","forEach","key","val","refreshState","item","node","get","TreeNode","indexOf","parent","getNode","getParent","parents","getParents","index","getIndex","slice","walk","conf","level","Infinity","nodeModel","getModel","props","result","every","propEqual","list","push","reflow","clear","removeAll","append","para","data","spec","parseNodeData","appendTo","Array","isArray","updateRelated","insertBefore","insertAfter","length","apply","update","updateChecked","updated","set","setTimeout","refreshNodes","emit","lockFilterPathNodes","updatedList","from","updatedNodes","map","getNodes","isActived","resetActived","setActived","actived","getActived","relatedNodes","getRelatedNodes","expanded","getExpanded","added","difference","removed","setExpandedDirectly","updateExpanded","setExpanded","afterExpanded","withParents","isChecked","isLeaf","resetChecked","setChecked","childrenNodes","childNode","checked","getChecked","remove","related","concat","relatedNode","values","name","state","methodName","camelCase","method","allNodes","lock","size","reverse","vmIsRest","visible","filterPathValues"],"mappings":";;;;;;;;;;;;;;;;AAAA,IAAIA,OAAO,GAAGC,iBAAd;AAEA;;AACA,IAAIC,cAAY,GAAGF,OAAO,CAACG,MAAM,CAACC,cAAR,EAAwBD,MAAxB,CAA1B;IAEAE,aAAc,GAAGH;;ACLjB,IAAII,UAAU,GAAGL,uBAAjB;AAAA,IACIC,YAAY,GAAGK,aADnB;AAAA,IAEIC,YAAY,GAAGC,6BAFnB;AAIA;;AACA,IAAIC,SAAS,GAAG,iBAAhB;AAEA;;AACA,IAAIC,SAAS,GAAGC,QAAQ,CAACC,SAAzB;AAAA,IACIC,WAAW,GAAGX,MAAM,CAACU,SADzB;AAGA;;AACA,IAAIE,YAAY,GAAGJ,SAAS,CAACK,QAA7B;AAEA;;AACA,IAAIC,cAAc,GAAGH,WAAW,CAACG,cAAjC;AAEA;;AACA,IAAIC,gBAAgB,GAAGH,YAAY,CAACI,IAAb,CAAkBhB,MAAlB,CAAvB;AAEA;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;AACA;;AACA,SAASiB,aAAT,CAAuBC,KAAvB,EAA8B;AAC5B,MAAI,CAACb,YAAY,CAACa,KAAD,CAAb,IAAwBf,UAAU,CAACe,KAAD,CAAV,IAAqBX,SAAjD,EAA4D;AAC1D,WAAO,KAAP;AACD;;AACD,MAAIY,KAAK,GAAGpB,YAAY,CAACmB,KAAD,CAAxB;;AACA,MAAIC,KAAK,KAAK,IAAd,EAAoB;AAClB,WAAO,IAAP;AACD;;AACD,MAAIC,IAAI,GAAGN,cAAc,CAACE,IAAf,CAAoBG,KAApB,EAA2B,aAA3B,KAA6CA,KAAK,CAACE,WAA9D;AACA,SAAO,OAAOD,IAAP,IAAe,UAAf,IAA6BA,IAAI,YAAYA,IAA7C,IACLR,YAAY,CAACI,IAAb,CAAkBI,IAAlB,KAA2BL,gBAD7B;AAED;;IAEDO,eAAc,GAAGL;;;;;aCzCV;AAqCE,qBAAYM,OAAZ,EAA2C;AAAA;;QAC1CC;AACJC,MAAAA,QAAQ;AACRC,MAAAA,MAAM;AACNC,MAAAA,WAAW;AACXC,MAAAA,aAAa;AACbC,MAAAA,aAAa;AACbC,MAAAA,cAAc;AACdC,MAAAA,WAAW;AACXC,MAAAA,gBAAgB;AAChBC,MAAAA,WAAW;AACXC,MAAAA,eAAe;AACfC,MAAAA,UAAU;AACVC,MAAAA,MAAM;AACNC,MAAAA,MAAM;AACNC,MAAAA,WAAW;AACXC,MAAAA,QAAQ;AACRC,MAAAA,QAAQ;AACRC,MAAAA,UAAU;AACVC,MAAAA,UAAU;OACPnB;;SAEAC,SAASA;SACTmB,QAAQ;SACRC,WAAW;SACXC,UAAU,IAAIC,GAAJ;SACVC,aAAa,IAAID,GAAJ;SACbE,cAAc,IAAIF,GAAJ;SACdG,aAAa,IAAIH,GAAJ;SACbI,aAAa,IAAIJ,GAAJ;SACbK,YAAY,IAAIL,GAAJ;SACZM,aAAa;SAEbC,cAAc;SAEdC,eAAe;;;AAxEjB;AAAA;AAAA,WA4EE,mBAAU/B,OAAV,EAAyC;AAAA;;UAC1CgC,aAAa;aACV7B,KAAKH,SAASiC,QAAQ,UAACC,GAAD,EAAS;YAC9BC,MAAMnC,QAAQkC;;YAChBC,QAAQ,MAAKlC,MAAL,CAAYiC,GAAZ,GAAkB;uBACf;gBACRjC,OAAOiC,OAAOC;;;;UAGnBH,YAAY;aAKTI;;;AA1FJ;AAAA;AAAA,WA+FE,uBAAc;aACZ,KAAKf;;AAhGT;AAAA;AAAA,WAoGE,iBAAQgB,IAAR,EAAwC;UACzCC,OAAO;;UACP,OAAOD,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,UAAU;eACjD,KAAKf,OAAL,CAAaiB,GAAb,CAAiBF,IAAjB;iBACEA,gBAAgBG,mCAAU;eAC5B,KAAKlB,OAAL,CAAaiB,GAAb,CAAiBF,KAAK1C,KAAtB;;;aAEF2C;;AA3GJ;AAAA;AAAA,WA+GE,kBAASA,IAAT,EAAiC;aAC/B,KAAKlB,KAAL,CAAWqB,OAAX,CAAmBH,IAAnB;;AAhHJ;AAAA;AAAA,WAoHE,mBAAU3C,KAAV,EAA2C;UAC5C+C,SAAS;UACPJ,OAAO,KAAKK,OAAL,CAAahD,KAAb;;UACT2C,MAAM;iBACCA,KAAKM,SAAL;;;aAEJF;;AA1HJ;AAAA;AAAA,WA8HE,oBAAW/C,KAAX,EAA8C;UAC7C2C,OAAO,KAAKK,OAAL,CAAahD,KAAb;UACTkD,UAAsB;;UACtBP,MAAM;kBACEA,KAAKQ,UAAL;;;aAELD;;AApIJ;AAAA;AAAA,WAwIE,sBAAalD,KAAb,EAA4C;UAC3C2C,OAAO,KAAKK,OAAL,CAAahD,KAAb;UACToD,QAAQ;;UACRT,MAAM;gBACAA,KAAKU,QAAL;;;aAEHD;;AA9IJ;AAAA;AAAA,WAkJE,kBACLV,IADK,EAELrC,OAFK,EAGO;UACRoB,QAAoB;UACpBe,MAAqB;;UACrB,OAAOE,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,UAAU;cAClDA;iBACGA,gBAAgBG,mCAAU;cAC7BH,KAAK1C;;;UAET,CAACwC,KAAK;gBACA,KAAKf,KAAL,CAAW6B,KAAX,CAAiB,CAAjB;aACH;YACCX,OAAO,KAAKK,OAAL,CAAaR,GAAb;;YACTG,MAAM;kBACAA,KAAKY,IAAL;;;;UAIRlD,SAAS;YACLmD;AACJnC,UAAAA,QAAQ;AACRoC,UAAAA,OAAOC;WACJrD;;YAED,OAAOmD,KAAKC,KAAZ,KAAsB,QAAtB,IAAkCD,KAAKC,KAAL,KAAeC,UAAU;kBACrDjC,MAAMJ,MAAN,CAAa,UAACsB,IAAD;AAAA,mBAAUA,KAAKc,KAAL,IAAcD,KAAKC,KAA7B;AAAA,WAAb;;;YAEN,OAAOD,KAAKnC,MAAZ,KAAuB,YAAY;kBAC7BI,MAAMJ,MAAN,CAAa,UAACsB,IAAD,EAAU;gBACvBgB,YAAYhB,KAAKiB,QAAL;mBACXJ,KAAKnC,MAAL,CAAYsC,SAAZ;WAFD;;;YAKN5D,gBAAcyD,KAAKK,QAAQ;kBACrBpC,MAAMJ,MAAN,CAAa,UAACsB,IAAD,EAAU;gBACvBmB,SAAShF,OAAO0B,IAAP,CAAYgD,KAAKK,KAAjB,EAAwBE,KAAxB,CAA8B,UAACxB,GAAD,EAAS;kBAC9CyB,YAAYrB,KAAKJ,IAAL,KAAciB,KAAKK,KAAL,CAAWtB,GAAX;qBACzByB;aAFM;mBAIRF;WALD;;;;aASLrC;;AA/LJ;AAAA;AAAA,WAmME,gBAAOwC,IAAP,EAAuC;AAAA;;WACvC3B,QAAQ,UAACI,IAAD,EAAU;YACfC,OAAO,IAAIE,iCAAJ,CAAa,MAAb,EAAmBH,IAAnB;;eACRhB,SAASwC,KAAKvB;;WAEhBwB;;AAxMF;AAAA;AAAA,WA4ME,gBAAOF,IAAP,EAAuC;WACvCnC,YAAYsC;WACZrC,WAAWqC;WACXvC,WAAWuC;WACXnC,UAAUmC;WACVC;WACAC,OAAOL;;AAlNT;AAAA;AAAA,WAsNE,uBACLM,IADK,EAEL7B,IAFK,EAGL;UACI1C,QAAuB;UACvB2C,OAAO;UACP6B,OAAO;;UAEP,OAAOD,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,UAAU;gBAChDA;eACD7B;eACA,KAAKM,OAAL,CAAahD,KAAb;iBACEuE,gBAAgB1B,mCAAU;eAC5B0B;eACA7B;aACF;eACE6B;;;UAEHE,OAAO;AACX9B,QAAAA,MAAAA,IADW;AAEX6B,QAAAA,MAAAA;AAFW;aAINC;;AA5OJ;AAAA;AAAA,WA0PE,qBACLF,IADK,EAEL7B,IAFK,EAGC;UACA+B,OAAO,KAAKC,aAAL,CAAmBH,IAAnB,EAAyB7B,IAAzB;;UACT+B,KAAKD,MAAM;YACT,CAACC,KAAK9B,MAAM;cAEV8B,KAAKD,IAAL,YAAqB3B,mCAAU;iBAC5B2B,KAAKG,SAAS;qBACVC,MAAMC,OAAN,CAAcJ,KAAKD,IAAnB,GAA0B;iBAC9BF,OAAOG,KAAKD;iBACZ;iBACAF,OAAO,CAACG,KAAKD,IAAN;;eAET;cAEDC,KAAKD,IAAL,YAAqB3B,mCAAU;iBAC5B2B,KAAKG,SAAS,MAAMF,KAAK9B;qBACrBiC,MAAMC,OAAN,CAAcJ,KAAKD,IAAnB,GAA0B;iBAC9B7B,KAAK2B,OAAOG,KAAKD;iBACjB;iBACA7B,KAAK2B,OAAO,CAACG,KAAKD,IAAN;;;eAEd7B,KAAKmC;;;;AAlRX;AAAA;AAAA,WAwRE,sBAAa9E,KAAb,EAAoC0C,IAApC,EAAkE;UACjEC,OAAO,KAAKK,OAAL,CAAahD,KAAb;;UACT2C,MAAM;aACHoC,aAAarC;;;AA3RjB;AAAA;AAAA,WAgSE,qBAAY1C,KAAZ,EAAmC0C,IAAnC,EAAiE;UAChEC,OAAO,KAAKK,OAAL,CAAahD,KAAb;;UACT2C,MAAM;aACHqC,YAAYtC;;;AAnShB;AAAA;AAAA,WAySE,wBAAqB;UAClBhB,WAAoB,KAApBA;UAAUD,QAAU,KAAVA;YACZwD,SAAS;eACN3C,QAAQ,UAACK,IAAD,EAAU;YACnBsB,OAAOtB,KAAKY,IAAL;cACP/D,UAAU0E,KAAKgB,MAAMzD,OAAOwC;;;AA9SjC;AAAA;AAAA,WAmTE,wBAAqB;UAClBxC,QAAU,KAAVA;YACFa,QAAQ,UAACK,IAAD,EAAU;aACjBwC;aACAC;;;AAvTJ;AAAA;AAAA,WA6TE,gBAAOzC,IAAP,EAA8B;WAC9BP,eAAe;WACfiD,QAAQ1C;;AA/TV;AAAA;AAAA,WAoUE,iBAAQA,IAAR,EAA+B;AAAA;;UAChCA,iBAAAA,mBAAAA,KAAM3C,OAAO;aACVgC,WAAWsD,IAAI3C,KAAK3C,OAAO;;;UAE9B,KAAKmC;WACJA,cAAc,CAACoD,WAAW,YAAM;qBACtB,OAAKpD;eACbA,cAAc;;YAGf,OAAKC,cAAc;iBAChBoD;;iBACAC,KAAK;;;eAMPC;;YAECC,cAAcf,MAAMgB,IAAN,CAAW,OAAK5D,UAAL,CAAgBxB,IAAhB,EAAX;;YAChBmF,YAAYV,MAAZ,GAAqB,GAAG;cAEpBY,eAAeF,YAAYG,GAAZ,CAAgB,UAAC9F,KAAD;AAAA,mBAAW,OAAKgD,OAAL,CAAahD,KAAb,CAAX;AAAA,WAAhB;;iBAChByF,KAAK,UAAU;AAClBhE,YAAAA,OAAOoE,YADW;AAElBC,YAAAA,KAAK,OAAK9D;AAFQ;mBAIX,OAAKI,cAAc;iBAGvBqD,KAAK,UAAU;AAClBhE,YAAAA,OAAO,EADW;AAElBqE,YAAAA,KAAK,OAAK9D;AAFQ;;;eAOjBI,eAAe;;eACfJ,WAAWoC;;;AA3Wf;AAAA;AAAA,WAgXE,oBAAW0B,GAAX,EAA6C;UAC5CjE,aAAaiE,OAAO,KAAKjE;aACxB+C,MAAMgB,IAAN,CAAW/D,WAAWrB,IAAX,EAAX;;AAlXJ;AAAA;AAAA,WAsXE,yBAAgBkC,IAAhB,EAAmD;UACpDjB,QAAQ,KAAKsE,QAAL,CAAcrD,IAAd;cACJjB,MAAMJ,MAAN,CAAa,UAACsB,IAAD;AAAA,eAAUA,KAAKqD,SAAL,EAAV;AAAA,OAAb;aACDvE;;AAzXJ;AAAA;AAAA,WA6XE,wBAAewC,IAAf,EAA4C;WAC5CgC;WACAC,WAAWjC;;AA/Xb;AAAA;AAAA,WAmYE,oBAAWkC,OAAX,EAA2C;AAAA;;UACxCrF,iBAAmB,KAAKR,OAAxBQ;UACFmD,OAAOkC,QAAQ7C,KAAR,CAAc,CAAd;;UACT,CAACxC,gBAAgB;aACdmE,SAAS;;;WAEX3C,QAAQ,UAACE,GAAD,EAAS;eACfX,WAAWyD,IAAI9C,KAAK;;YACnBG,OAAO,OAAKK,OAAL,CAAaR,GAAb;;YACTG,MAAM;eACHwC;;;;AA7YN;AAAA;AAAA,WAmZE,wBAAqB;UACpBgB,UAAU,KAAKC,UAAL;WACXvE,WAAWuC;UACViC,eAAe,KAAKC,eAAL,CAAqBH,OAArB;mBACR7D,QAAQ,UAACK,IAAD,EAAU;aACxBwC;;;AAxZJ;AAAA;AAAA,WA6ZE,qBAAYW,GAAZ,EAA8C;UAC7ChE,cAAcgE,OAAO,KAAKhE;aACzB8C,MAAMgB,IAAN,CAAW9D,YAAYtB,IAAZ,EAAX;;AA/ZJ;AAAA;AAAA,WAmaE,yBAAgByD,IAAhB,EAA6C;UAC5CsC,WAAW,KAAKC,WAAL;UACXC,QAAQC,wBAAWzC,MAAMsC;UACzBI,UAAUD,wBAAWH,UAAUtC;WAChC2C,oBAAoBD,SAAS;WAC7BE,eAAeF;WACfG,YAAYL;;AAzad;AAAA;AAAA,WA6aE,qBAAYxC,IAAZ,EAAyC;WACzC2C,oBAAoB3C;WACpB4C,eAAe5C;;AA/ajB;AAAA;AAAA,WAmbE,6BAAoBA,IAApB,EAAkE;AAAA;;AAAA,UAAvBsC,QAAuB,uEAAZ,IAAY;WAClEjE,QAAQ,UAACE,GAAD,EAAS;YAChB+D,UAAU;iBACPzE,YAAYwD,IAAI9C,KAAK;;cACpBG,OAAO,OAAKK,OAAL,CAAaR,GAAb;;cACTG,MAAM;iBACHoE;;eAEF;iBACAjF,sBAAmBU;;;;AA5bzB;AAAA;AAAA,WAkcE,yBAAsB;UACrB+D,WAAW,KAAKC,WAAL;WACZ1E,YAAYsC;WACZyC,eAAeN;;AArcjB;AAAA;AAAA,WAycE,wBAAetC,IAAf,EAA4C;UAC3CoC,eAAe,KAAKC,eAAL,CAAqBrC,IAArB,EAA2B;AAC9C+C,QAAAA,aAAa;AADiC,OAA3B;mBAGR1E,QAAQ,UAACK,IAAD,EAAU;aACxBwC;;;AA9cJ;AAAA;AAAA,WAmdE,oBAAWW,GAAX,EAA6C;UAC1CrE,QAAkB,KAAlBA;UAAOnB,SAAW,KAAXA;UACPc,YAA6Bd,OAA7Bc;UAAWJ,gBAAkBV,OAAlBU;UACbiD,OAAwB;UACxBlC,aAAa+D,OAAO,KAAK/D;YACzBO,QAAQ,UAACK,IAAD,EAAU;YAClBA,KAAKsE,SAAL,CAAelF,UAAf,GAA4B;cAC1BX,cAAc,aAAd,IAA+B,CAACJ,eAAe;gBAC7C,CAAC2B,KAAKI,MAAN,IAAgB,CAACJ,KAAKI,MAAL,CAAYkE,SAAZ,CAAsBlF,UAAtB,GAAmC;mBACjDmC,KAAKvB,KAAK3C;;qBAERoB,cAAc,UAAd,IAA4B,CAACJ,eAAe;gBACjD2B,KAAKuE,MAAL,IAAe;mBACZhD,KAAKvB,KAAK3C;;iBAEZ;iBACAkE,KAAKvB,KAAK3C;;;;aAIdiE;;AAveJ;AAAA;AAAA,WA2eE,yBAAgBvB,IAAhB,EAAmD;UACpDjB,QAAQ,KAAKsE,QAAL,CAAcrD,IAAd;cACJjB,MAAMJ,MAAN,CAAa,UAACsB,IAAD;AAAA,eAAUA,KAAKsE,SAAL,EAAV;AAAA,OAAb;aACDxF;;AA9eJ;AAAA;AAAA,WAkfE,wBAAewC,IAAf,EAA4C;WAC5CkD;WACAC,WAAWnD;;AApfb;AAAA;AAAA,WAwfE,oBAAWA,IAAX,EAAwC;AAAA;;yBACG,KAAK3D;UAA7Cc,yBAAAA;UAAWJ,6BAAAA;UAAeD,yBAAAA;UAC9B,CAACA;WACAuB,QAAQ,UAACE,GAAD,EAAwB;YAC7BG,OAAO,OAAKK,OAAL,CAAaR,GAAb;;YACTG,MAAM;cACJvB,cAAc,aAAd,IAA+B,CAACJ,eAAe;gBAC3CqG,gBAAgB1E,KAAKY,IAAL;0BACRjB,QAAQ,UAACgF,SAAD,EAAe;qBAC9BvF,WAAWuD,IAAIgC,UAAUtH,OAAO;;iBAElC;mBACA+B,WAAWuD,IAAI9C,KAAK;;iBACpB4C;;;;;UAIP,CAACpE,eAAe;YACZuG,UAAU,KAAKC,UAAL;YACVnB,eAAe,KAAKC,eAAL,CAAqBiB,OAArB;qBACRjF,QAAQ,UAACK,IAAD,EAAU;eACxByC;;;;AA7gBN;AAAA;AAAA,WAmhBE,wBAAqB;UACpBmC,UAAU,KAAKC,UAAL;UACVnB,eAAe,KAAKC,eAAL,CAAqBiB,OAArB;WAChBxF,WAAWqC;mBACH9B,QAAQ,UAACK,IAAD,EAAU;aACxByC;;;AAxhBJ;AAAA;AAAA,WA6hBE,qBAAkB;UACjB3D,QAAQ,KAAKsE,QAAL;YACRzD,QAAQ,UAACK,IAAD,EAAU;aACjBwC;;;AAhiBJ;AAAA;AAAA,WAqiBE,gBAAOnF,KAAP,EAAqC;UACpC2C,OAAO,KAAKK,OAAL,CAAahD,KAAb;;UACT2C,MAAM;aACH8E;;;AAxiBJ;AAAA;AAAA,WA6iBE,qBAAkB;UACjBhG,QAAQ,KAAKsE,QAAL;YACRzD,QAAQ,UAACK,IAAD,EAAU;aACjB8E;;;AAhjBJ;AAAA;AAAA,WAsjBE,yBACLxD,IADK,EAEL5D,OAFK,EAGO;AAAA;;UACNmD;AACJwD,QAAAA,aAAa;SACV3G;;UAECyF,MAAM,IAAIlE,GAAJ;WACPU,QAAQ,UAACtC,KAAD,EAAW;YAClB8F,IAAIlD,GAAJ,CAAQ5C,KAAR;;YACE2C,OAAO,OAAKK,OAAL,CAAahD,KAAb;;YACT2C,MAAM;cACFO,UAAUP,KAAKQ,UAAL;cACVzB,WAAWiB,KAAKY,IAAL;cACbmE,UAAU;;cACVlE,KAAKwD,aAAa;sBACV9D,QAAQyE,MAAR,CAAejG,QAAf;iBACL;sBACKA;;;kBAEJY,QAAQ,UAACsF,WAAD,EAAiB;gBAC3BtC,IAAIsC,YAAY5H,OAAO4H;;;;UAI3BvB,eAAezB,MAAMgB,IAAN,CAAWE,IAAI+B,MAAJ,EAAX;aACdxB;;AAjlBJ;AAAA;AAAA,WAqlBE,cAAKyB,IAAL,EAAmBC,KAAnB,EAAqD;UACpDzH,SAAS,KAAKA,MAAL,IAAe;UACxB0H,aAAaC,mCAAgBH;UAC7BI,SAAS5H,OAAO0H;;UAClB,OAAOE,MAAP,KAAkB,YAAY;eACzBH;;;AA1lBN;AAAA;AAAA,WAgmBE,+BAAsB;AAAA;;UAEzBzH,SAEE,KAFFA;UACA2B,YACE,KADFA;;UAME,CAAC3B,OAAOe,MAAR,IAAkB,CAAC,KAAKa,YAAY;;;;WAGnCA,aAAa5B,OAAOe;UAEnB8G,WAAW,KAAKpC,QAAL;eACRzD,QAAQ,UAACK,IAAD,EAAoB;aAC9ByF,KAAK;;;UAERD,SAASlD,MAAT,KAAoBhD,UAAUoG,MAAM;;;;UAMlCvC,MAAM,IAAIlE,GAAJ;eAKH0G,UAAUhG,QAAQ,UAACI,IAAD,EAAoB;YACvCC,OAAOD;YAGPK,SAASJ,KAAKM,SAAL;;YACXN,KAAK4F,UAAU;cACbxF,QAAQ;mBACHwD,WAAW;;;eAGfiC,UAAU;;;YAEb7F,KAAK4F,QAAL,IAAiBzC,IAAIlD,GAAJ,CAAQD,KAAK3C,KAAb,GAAqB;cACpC+C,UAAU,CAACA,OAAOwF,UAAU;gBAC1BjD,IAAIvC,OAAO/C,OAAO;;;;UAMtByI,mBAAmB7D,MAAMgB,IAAN,CAAWE,IAAItF,IAAJ,EAAX;uBACR8B,QAAQ,UAACtC,KAAD,EAA0B;YAC3C2C,OAAO,OAAKK,OAAL,CAAahD,KAAb;;YACT2C,MAAM;eACHyF,KAAK;;;;AArpBX;;AAAA;AAAA;;;;;"}

package/cjs/_chunks/dep-80e6fb7e.js

@@ -1,69 +0,0 @@
-/**
- * tdesign v0.20.0
- * (c) 2021 tdesign
- * @license MIT
- */
-
-'use strict';
-
-var _baseGetTag = require('./dep-6b1174cd.js');
-var isObjectLike$2 = require('./dep-2302f518.js');
-
-var baseGetTag = _baseGetTag._baseGetTag,
-    isObjectLike$1 = isObjectLike$2.isObjectLike_1;
-/** `Object#toString` result references. */
-
-var argsTag = '[object Arguments]';
-/**
- * The base implementation of `_.isArguments`.
- *
- * @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is an `arguments` object,
- */
-
-function baseIsArguments$1(value) {
-  return isObjectLike$1(value) && baseGetTag(value) == argsTag;
-}
-
-var _baseIsArguments = baseIsArguments$1;
-
-var baseIsArguments = _baseIsArguments,
-    isObjectLike = isObjectLike$2.isObjectLike_1;
-/** Used for built-in method references. */
-
-var objectProto = Object.prototype;
-/** Used to check objects for own properties. */
-
-var hasOwnProperty = objectProto.hasOwnProperty;
-/** Built-in value references. */
-
-var propertyIsEnumerable = objectProto.propertyIsEnumerable;
-/**
- * Checks if `value` is likely an `arguments` object.
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Lang
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is an `arguments` object,
- *  else `false`.
- * @example
- *
- * _.isArguments(function() { return arguments; }());
- * // => true
- *
- * _.isArguments([1, 2, 3]);
- * // => false
- */
-
-var isArguments = baseIsArguments(function () {
-  return arguments;
-}()) ? baseIsArguments : function (value) {
-  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') && !propertyIsEnumerable.call(value, 'callee');
-};
-var isArguments_1 = isArguments;
-
-exports.isArguments_1 = isArguments_1;
-//# sourceMappingURL=dep-80e6fb7e.js.map

package/cjs/_chunks/dep-80e6fb7e.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-80e6fb7e.js","sources":["../../node_modules/lodash/_baseIsArguments.js","../../node_modules/lodash/isArguments.js"],"sourcesContent":["var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nmodule.exports = baseIsArguments;\n","var baseIsArguments = require('./_baseIsArguments'),\n    isObjectLike = require('./isObjectLike');\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/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` 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 an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nmodule.exports = isArguments;\n"],"names":["baseGetTag","require$$0","isObjectLike","require$$1","argsTag","baseIsArguments","value","_baseIsArguments","objectProto","Object","prototype","hasOwnProperty","propertyIsEnumerable","isArguments","arguments","call","isArguments_1"],"mappings":";;;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,uBAAjB;AAAA,IACIC,cAAY,GAAGC,6BADnB;AAGA;;AACA,IAAIC,OAAO,GAAG,oBAAd;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,iBAAT,CAAyBC,KAAzB,EAAgC;AAC9B,SAAOJ,cAAY,CAACI,KAAD,CAAZ,IAAuBN,UAAU,CAACM,KAAD,CAAV,IAAqBF,OAAnD;AACD;;IAEDG,gBAAc,GAAGF;;ACjBjB,IAAIA,eAAe,GAAGJ,gBAAtB;AAAA,IACIC,YAAY,GAAGC,6BADnB;AAGA;;AACA,IAAIK,WAAW,GAAGC,MAAM,CAACC,SAAzB;AAEA;;AACA,IAAIC,cAAc,GAAGH,WAAW,CAACG,cAAjC;AAEA;;AACA,IAAIC,oBAAoB,GAAGJ,WAAW,CAACI,oBAAvC;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIC,WAAW,GAAGR,eAAe,CAAC,YAAW;AAAE,SAAOS,SAAP;AAAmB,CAAhC,EAAD,CAAf,GAAsDT,eAAtD,GAAwE,UAASC,KAAT,EAAgB;AACxG,SAAOJ,YAAY,CAACI,KAAD,CAAZ,IAAuBK,cAAc,CAACI,IAAf,CAAoBT,KAApB,EAA2B,QAA3B,CAAvB,IACL,CAACM,oBAAoB,CAACG,IAArB,CAA0BT,KAA1B,EAAiC,QAAjC,CADH;AAED,CAHD;IAKAU,aAAc,GAAGH;;;;"}

package/cjs/_chunks/dep-9e3e211f.js

@@ -1,36 +0,0 @@
-/**
- * tdesign v0.20.0
- * (c) 2021 tdesign
- * @license MIT
- */
-
-'use strict';
-
-/**
- * Checks if `value` is classified as an `Array` object.
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Lang
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is an array, else `false`.
- * @example
- *
- * _.isArray([1, 2, 3]);
- * // => true
- *
- * _.isArray(document.body.children);
- * // => false
- *
- * _.isArray('abc');
- * // => false
- *
- * _.isArray(_.noop);
- * // => false
- */
-var isArray = Array.isArray;
-var isArray_1 = isArray;
-
-exports.isArray_1 = isArray_1;
-//# sourceMappingURL=dep-9e3e211f.js.map

package/cjs/_chunks/dep-9e3e211f.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-9e3e211f.js","sources":["../../node_modules/lodash/isArray.js"],"sourcesContent":["/**\n * Checks if `value` is classified as an `Array` 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 an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n"],"names":["isArray","Array","isArray_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuBA,IAAIA,OAAO,GAAGC,KAAK,CAACD,OAApB;IAEAE,SAAc,GAAGF;;;;"}

package/cjs/_chunks/dep-9ee20113.js

@@ -1,44 +0,0 @@
-/**
- * tdesign v0.20.0
- * (c) 2021 tdesign
- * @license MIT
- */
-
-'use strict';
-
-var _baseGetTag = require('./dep-6b1174cd.js');
-var isArray$1 = require('./dep-9e3e211f.js');
-var isObjectLike$1 = require('./dep-2302f518.js');
-
-var baseGetTag = _baseGetTag._baseGetTag,
-    isArray = isArray$1.isArray_1,
-    isObjectLike = isObjectLike$1.isObjectLike_1;
-/** `Object#toString` result references. */
-
-var stringTag = '[object String]';
-/**
- * Checks if `value` is classified as a `String` primitive or object.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Lang
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is a string, else `false`.
- * @example
- *
- * _.isString('abc');
- * // => true
- *
- * _.isString(1);
- * // => false
- */
-
-function isString(value) {
-  return typeof value == 'string' || !isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag;
-}
-
-var isString_1 = isString;
-
-exports.isString_1 = isString_1;
-//# sourceMappingURL=dep-9ee20113.js.map

package/cjs/_chunks/dep-9ee20113.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-9ee20113.js","sources":["../../node_modules/lodash/isString.js"],"sourcesContent":["var baseGetTag = require('./_baseGetTag'),\n    isArray = require('./isArray'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n  return typeof value == 'string' ||\n    (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nmodule.exports = isString;\n"],"names":["baseGetTag","require$$0","isArray","require$$1","isObjectLike","require$$2","stringTag","isString","value","isString_1"],"mappings":";;;;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,uBAAjB;AAAA,IACIC,OAAO,GAAGC,mBADd;AAAA,IAEIC,YAAY,GAAGC,6BAFnB;AAIA;;AACA,IAAIC,SAAS,GAAG,iBAAhB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAkBC,KAAlB,EAAyB;AACvB,SAAO,OAAOA,KAAP,IAAgB,QAAhB,IACJ,CAACN,OAAO,CAACM,KAAD,CAAR,IAAmBJ,YAAY,CAACI,KAAD,CAA/B,IAA0CR,UAAU,CAACQ,KAAD,CAAV,IAAqBF,SADlE;AAED;;IAEDG,UAAc,GAAGF;;;;"}

package/cjs/_chunks/dep-a6f54d19.js

@@ -1,352 +0,0 @@
-/**
- * tdesign v0.20.0
- * (c) 2021 tdesign
- * @license MIT
- */
-
-'use strict';
-
-var defineProperty$1 = require('./dep-3b16b729.js');
-var _baseGet = require('./dep-666ca657.js');
-var _setToString = require('./dep-e362b4db.js');
-var eq$1 = require('./dep-bef84f1b.js');
-var _isIndex = require('./dep-ab3a5c32.js');
-var isObject$1 = require('./dep-b0e9bbd3.js');
-var hasIn$1 = require('./dep-065c8047.js');
-var flatten$1 = require('./dep-cafc6029.js');
-
-var defineProperty = _setToString._defineProperty;
-/**
- * The base implementation of `assignValue` and `assignMergeValue` without
- * value checks.
- *
- * @private
- * @param {Object} object The object to modify.
- * @param {string} key The key of the property to assign.
- * @param {*} value The value to assign.
- */
-
-function baseAssignValue$1(object, key, value) {
-  if (key == '__proto__' && defineProperty) {
-    defineProperty(object, key, {
-      'configurable': true,
-      'enumerable': true,
-      'value': value,
-      'writable': true
-    });
-  } else {
-    object[key] = value;
-  }
-}
-
-var _baseAssignValue = baseAssignValue$1;
-
-var baseAssignValue = _baseAssignValue,
-    eq = eq$1.eq_1;
-/** Used for built-in method references. */
-
-var objectProto = Object.prototype;
-/** Used to check objects for own properties. */
-
-var hasOwnProperty = objectProto.hasOwnProperty;
-/**
- * Assigns `value` to `key` of `object` if the existing value is not equivalent
- * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
- * for equality comparisons.
- *
- * @private
- * @param {Object} object The object to modify.
- * @param {string} key The key of the property to assign.
- * @param {*} value The value to assign.
- */
-
-function assignValue$1(object, key, value) {
-  var objValue = object[key];
-
-  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) || value === undefined && !(key in object)) {
-    baseAssignValue(object, key, value);
-  }
-}
-
-var _assignValue = assignValue$1;
-
-var assignValue = _assignValue,
-    castPath$1 = _baseGet._castPath,
-    isIndex = _isIndex._isIndex,
-    isObject = isObject$1.isObject_1,
-    toKey = _baseGet._toKey;
-/**
- * The base implementation of `_.set`.
- *
- * @private
- * @param {Object} object The object to modify.
- * @param {Array|string} path The path of the property to set.
- * @param {*} value The value to set.
- * @param {Function} [customizer] The function to customize path creation.
- * @returns {Object} Returns `object`.
- */
-
-function baseSet$1(object, path, value, customizer) {
-  if (!isObject(object)) {
-    return object;
-  }
-
-  path = castPath$1(path, object);
-  var index = -1,
-      length = path.length,
-      lastIndex = length - 1,
-      nested = object;
-
-  while (nested != null && ++index < length) {
-    var key = toKey(path[index]),
-        newValue = value;
-
-    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {
-      return object;
-    }
-
-    if (index != lastIndex) {
-      var objValue = nested[key];
-      newValue = customizer ? customizer(objValue, key, nested) : undefined;
-
-      if (newValue === undefined) {
-        newValue = isObject(objValue) ? objValue : isIndex(path[index + 1]) ? [] : {};
-      }
-    }
-
-    assignValue(nested, key, newValue);
-    nested = nested[key];
-  }
-
-  return object;
-}
-
-var _baseSet = baseSet$1;
-
-var baseGet = _baseGet._baseGet,
-    baseSet = _baseSet,
-    castPath = _baseGet._castPath;
-/**
- * The base implementation of  `_.pickBy` without support for iteratee shorthands.
- *
- * @private
- * @param {Object} object The source object.
- * @param {string[]} paths The property paths to pick.
- * @param {Function} predicate The function invoked per property.
- * @returns {Object} Returns the new object.
- */
-
-function basePickBy$1(object, paths, predicate) {
-  var index = -1,
-      length = paths.length,
-      result = {};
-
-  while (++index < length) {
-    var path = paths[index],
-        value = baseGet(object, path);
-
-    if (predicate(value, path)) {
-      baseSet(result, castPath(path, object), value);
-    }
-  }
-
-  return result;
-}
-
-var _basePickBy = basePickBy$1;
-
-var basePickBy = _basePickBy,
-    hasIn = hasIn$1.hasIn_1;
-/**
- * The base implementation of `_.pick` without support for individual
- * property identifiers.
- *
- * @private
- * @param {Object} object The source object.
- * @param {string[]} paths The property paths to pick.
- * @returns {Object} Returns the new object.
- */
-
-function basePick$1(object, paths) {
-  return basePickBy(object, paths, function (value, path) {
-    return hasIn(object, path);
-  });
-}
-
-var _basePick = basePick$1;
-
-var flatten = flatten$1.flatten_1,
-    overRest = _setToString._overRest,
-    setToString = _setToString._setToString;
-/**
- * A specialized version of `baseRest` which flattens the rest array.
- *
- * @private
- * @param {Function} func The function to apply a rest parameter to.
- * @returns {Function} Returns the new function.
- */
-
-function flatRest$1(func) {
-  return setToString(overRest(func, undefined, flatten), func + '');
-}
-
-var _flatRest = flatRest$1;
-
-var basePick = _basePick,
-    flatRest = _flatRest;
-/**
- * Creates an object composed of the picked `object` properties.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Object
- * @param {Object} object The source object.
- * @param {...(string|string[])} [paths] The property paths to pick.
- * @returns {Object} Returns the new object.
- * @example
- *
- * var object = { 'a': 1, 'b': '2', 'c': 3 };
- *
- * _.pick(object, ['a', 'c']);
- * // => { 'a': 1, 'c': 3 }
- */
-
-var pick = flatRest(function (object, paths) {
-  return object == null ? {} : basePick(object, paths);
-});
-var pick_1 = pick;
-
-function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
-
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { defineProperty$1._defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
-
-function getExposedProps(node) {
-  var props = pick_1(node, ["value", "label", "data", "actived", "expanded", "checked", "indeterminate", "loading"]);
-  return props;
-}
-
-function createNodeModel(node) {
-  var props = getExposedProps(node);
-
-  var model = _objectSpread(_objectSpread({}, props), {}, {
-    getLevel: function getLevel() {
-      return node.getLevel();
-    },
-    getIndex: function getIndex() {
-      return node.getIndex();
-    },
-    isFirst: function isFirst() {
-      return node.isFirst();
-    },
-    isLast: function isLast() {
-      return node.isLast();
-    },
-    isLeaf: function isLeaf() {
-      return node.isLeaf();
-    },
-    insertBefore: function insertBefore(newData) {
-      return node.insertBefore(newData);
-    },
-    insertAfter: function insertAfter(newData) {
-      return node.insertAfter(newData);
-    },
-    appendData: function appendData(data) {
-      return node.append(data);
-    },
-    getPath: function getPath() {
-      var nodes = node.getPath();
-      return nodes.map(function (item) {
-        return item.getModel();
-      });
-    },
-    getParent: function getParent() {
-      var _node$parent;
-
-      return (_node$parent = node.parent) === null || _node$parent === void 0 ? void 0 : _node$parent.getModel();
-    },
-    getParents: function getParents() {
-      var nodes = node.getParents();
-      return nodes.map(function (item) {
-        return item.getModel();
-      });
-    },
-    getRoot: function getRoot() {
-      var root = node.getRoot();
-      return root === null || root === void 0 ? void 0 : root.getModel();
-    },
-    getSiblings: function getSiblings() {
-      var nodes = node.getSiblings();
-      return nodes.map(function (item) {
-        return item.getModel();
-      });
-    },
-    getChildren: function getChildren(deep) {
-      var childrenModel = false;
-      var children = node.children;
-
-      if (Array.isArray(children)) {
-        if (children.length > 0) {
-          if (deep) {
-            var nodes = node.walk();
-            nodes.shift();
-            childrenModel = nodes.map(function (item) {
-              return item.getModel();
-            });
-          } else {
-            childrenModel = children.map(function (item) {
-              return item.getModel();
-            });
-          }
-        } else {
-          childrenModel = false;
-        }
-      } else if (typeof children === "boolean") {
-        childrenModel = children;
-      }
-
-      return childrenModel;
-    },
-    remove: function remove(value) {
-      if (!value) {
-        node.remove();
-        return;
-      }
-
-      var tree = node.tree;
-      var targetNode = tree.getNode(value);
-
-      if (!targetNode) {
-        console.warn("TDesign Tree Warn: `".concat(value, "` is not exist"));
-        return;
-      }
-
-      var parents = targetNode.getParents();
-      var parentValues = parents.map(function (pnode) {
-        return pnode.value;
-      });
-
-      if (parentValues.indexOf(node.value) < 0) {
-        console.warn("TDesign Tree Warn: `".concat(value, "` is not a childNode of current node"));
-        return;
-      }
-
-      targetNode.remove();
-    },
-    setData: function setData(data) {
-      Object.assign(node.data, data);
-    }
-  });
-
-  return model;
-}
-function updateNodeModel(model, node) {
-  var props = getExposedProps(node);
-  Object.assign(model, props);
-}
-
-exports._assignValue = _assignValue;
-exports._baseAssignValue = _baseAssignValue;
-exports.createNodeModel = createNodeModel;
-exports.updateNodeModel = updateNodeModel;
-//# sourceMappingURL=dep-a6f54d19.js.map

package/cjs/_chunks/dep-a6f54d19.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-a6f54d19.js","sources":["../../node_modules/lodash/_baseAssignValue.js","../../node_modules/lodash/_assignValue.js","../../node_modules/lodash/_baseSet.js","../../node_modules/lodash/_basePickBy.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 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","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","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 { OptionData } from '../common';\nimport {\n  TreeNodeValue,\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    // 删除本节点，或者 value 指定的子节点\n    remove(value?: TreeNodeValue) {\n      if (!value) {\n        node.remove();\n        return;\n      }\n\n      const { tree } = node;\n      const targetNode = tree.getNode(value);\n      if (!targetNode) {\n        // eslint-disable-next-line no-console\n        console.warn(`TDesign Tree Warn: \\`${value}\\` is not exist`);\n        return;\n      }\n\n      const parents = targetNode.getParents();\n      const parentValues = parents.map((pnode) => (pnode.value));\n      if (parentValues.indexOf(node.value) < 0) {\n        // eslint-disable-next-line no-console\n        console.warn(`TDesign Tree Warn: \\`${value}\\` is not a childNode of current node`);\n        return;\n      }\n      targetNode.remove();\n    },\n\n    // 设置本节点携带的元数据\n    setData(data: OptionData) {\n      Object.assign(node.data, data);\n    },\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":["defineProperty","require$$0","baseAssignValue","object","key","value","_baseAssignValue","eq","require$$1","objectProto","Object","prototype","hasOwnProperty","assignValue","objValue","call","undefined","_assignValue","castPath","isIndex","require$$2","isObject","require$$3","toKey","require$$4","baseSet","path","customizer","index","length","lastIndex","nested","newValue","_baseSet","baseGet","basePickBy","paths","predicate","result","_basePickBy","hasIn","basePick","_basePick","flatten","overRest","setToString","flatRest","func","_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","Array","isArray","walk","shift","remove","tree","targetNode","getNode","warn","parents","parentValues","pnode","indexOf","setData","assign"],"mappings":";;;;;;;;;;;;;;;;;AAAA,IAAIA,cAAc,GAAGC,4BAArB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,iBAAT,CAAyBC,MAAzB,EAAiCC,GAAjC,EAAsCC,KAAtC,EAA6C;AAC3C,MAAID,GAAG,IAAI,WAAP,IAAsBJ,cAA1B,EAA0C;AACxCA,IAAAA,cAAc,CAACG,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,GAAGD,gBAAtB;AAAA,IACIM,EAAE,GAAGC,SADT;AAGA;;AACA,IAAIC,WAAW,GAAGC,MAAM,CAACC,SAAzB;AAEA;;AACA,IAAIC,cAAc,GAAGH,WAAW,CAACG,cAAjC;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,aAAT,CAAqBV,MAArB,EAA6BC,GAA7B,EAAkCC,KAAlC,EAAyC;AACvC,MAAIS,QAAQ,GAAGX,MAAM,CAACC,GAAD,CAArB;;AACA,MAAI,EAAEQ,cAAc,CAACG,IAAf,CAAoBZ,MAApB,EAA4BC,GAA5B,KAAoCG,EAAE,CAACO,QAAD,EAAWT,KAAX,CAAxC,KACCA,KAAK,KAAKW,SAAV,IAAuB,EAAEZ,GAAG,IAAID,MAAT,CAD5B,EAC+C;AAC7CD,IAAAA,eAAe,CAACC,MAAD,EAASC,GAAT,EAAcC,KAAd,CAAf;AACD;AACF;;IAEDY,YAAc,GAAGJ;;AC3BjB,IAAIA,WAAW,GAAGZ,YAAlB;AAAA,IACIiB,UAAQ,GAAGV,kBADf;AAAA,IAEIW,OAAO,GAAGC,iBAFd;AAAA,IAGIC,QAAQ,GAAGC,qBAHf;AAAA,IAIIC,KAAK,GAAGC,eAJZ;AAMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,SAAT,CAAiBtB,MAAjB,EAAyBuB,IAAzB,EAA+BrB,KAA/B,EAAsCsB,UAAtC,EAAkD;AAChD,MAAI,CAACN,QAAQ,CAAClB,MAAD,CAAb,EAAuB;AACrB,WAAOA,MAAP;AACD;;AACDuB,EAAAA,IAAI,GAAGR,UAAQ,CAACQ,IAAD,EAAOvB,MAAP,CAAf;AAEA,MAAIyB,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGH,IAAI,CAACG,MADlB;AAAA,MAEIC,SAAS,GAAGD,MAAM,GAAG,CAFzB;AAAA,MAGIE,MAAM,GAAG5B,MAHb;;AAKA,SAAO4B,MAAM,IAAI,IAAV,IAAkB,EAAEH,KAAF,GAAUC,MAAnC,EAA2C;AACzC,QAAIzB,GAAG,GAAGmB,KAAK,CAACG,IAAI,CAACE,KAAD,CAAL,CAAf;AAAA,QACII,QAAQ,GAAG3B,KADf;;AAGA,QAAID,GAAG,KAAK,WAAR,IAAuBA,GAAG,KAAK,aAA/B,IAAgDA,GAAG,KAAK,WAA5D,EAAyE;AACvE,aAAOD,MAAP;AACD;;AAED,QAAIyB,KAAK,IAAIE,SAAb,EAAwB;AACtB,UAAIhB,QAAQ,GAAGiB,MAAM,CAAC3B,GAAD,CAArB;AACA4B,MAAAA,QAAQ,GAAGL,UAAU,GAAGA,UAAU,CAACb,QAAD,EAAWV,GAAX,EAAgB2B,MAAhB,CAAb,GAAuCf,SAA5D;;AACA,UAAIgB,QAAQ,KAAKhB,SAAjB,EAA4B;AAC1BgB,QAAAA,QAAQ,GAAGX,QAAQ,CAACP,QAAD,CAAR,GACPA,QADO,GAENK,OAAO,CAACO,IAAI,CAACE,KAAK,GAAG,CAAT,CAAL,CAAP,GAA2B,EAA3B,GAAgC,EAFrC;AAGD;AACF;;AACDf,IAAAA,WAAW,CAACkB,MAAD,EAAS3B,GAAT,EAAc4B,QAAd,CAAX;AACAD,IAAAA,MAAM,GAAGA,MAAM,CAAC3B,GAAD,CAAf;AACD;;AACD,SAAOD,MAAP;AACD;;IAED8B,QAAc,GAAGR;;AClDjB,IAAIS,OAAO,GAAGjC,iBAAd;AAAA,IACIwB,OAAO,GAAGjB,QADd;AAAA,IAEIU,QAAQ,GAAGE,kBAFf;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASe,YAAT,CAAoBhC,MAApB,EAA4BiC,KAA5B,EAAmCC,SAAnC,EAA8C;AAC5C,MAAIT,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGO,KAAK,CAACP,MADnB;AAAA,MAEIS,MAAM,GAAG,EAFb;;AAIA,SAAO,EAAEV,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIH,IAAI,GAAGU,KAAK,CAACR,KAAD,CAAhB;AAAA,QACIvB,KAAK,GAAG6B,OAAO,CAAC/B,MAAD,EAASuB,IAAT,CADnB;;AAGA,QAAIW,SAAS,CAAChC,KAAD,EAAQqB,IAAR,CAAb,EAA4B;AAC1BD,MAAAA,OAAO,CAACa,MAAD,EAASpB,QAAQ,CAACQ,IAAD,EAAOvB,MAAP,CAAjB,EAAiCE,KAAjC,CAAP;AACD;AACF;;AACD,SAAOiC,MAAP;AACD;;IAEDC,WAAc,GAAGJ;;AC7BjB,IAAIA,UAAU,GAAGlC,WAAjB;AAAA,IACIuC,KAAK,GAAGhC,eADZ;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASiC,UAAT,CAAkBtC,MAAlB,EAA0BiC,KAA1B,EAAiC;AAC/B,SAAOD,UAAU,CAAChC,MAAD,EAASiC,KAAT,EAAgB,UAAS/B,KAAT,EAAgBqB,IAAhB,EAAsB;AACrD,WAAOc,KAAK,CAACrC,MAAD,EAASuB,IAAT,CAAZ;AACD,GAFgB,CAAjB;AAGD;;IAEDgB,SAAc,GAAGD;;AClBjB,IAAIE,OAAO,GAAG1C,mBAAd;AAAA,IACI2C,QAAQ,GAAGpC,sBADf;AAAA,IAEIqC,WAAW,GAAGzB,yBAFlB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAAS0B,UAAT,CAAkBC,IAAlB,EAAwB;AACtB,SAAOF,WAAW,CAACD,QAAQ,CAACG,IAAD,EAAO/B,SAAP,EAAkB2B,OAAlB,CAAT,EAAqCI,IAAI,GAAG,EAA5C,CAAlB;AACD;;IAEDC,SAAc,GAAGF;;ACfjB,IAAIL,QAAQ,GAAGxC,SAAf;AAAA,IACI6C,QAAQ,GAAGtC,SADf;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIyC,IAAI,GAAGH,QAAQ,CAAC,UAAS3C,MAAT,EAAiBiC,KAAjB,EAAwB;AAC1C,SAAOjC,MAAM,IAAI,IAAV,GAAiB,EAAjB,GAAsBsC,QAAQ,CAACtC,MAAD,EAASiC,KAAT,CAArC;AACD,CAFkB,CAAnB;IAIAc,MAAc,GAAGD;;;;;;ACZjB,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;;UACJC,MAAMC,OAAN,CAAcF,QAAd,GAAyB;YACvBA,SAASnD,MAAT,GAAkB,GAAG;cACnBiD,MAAM;gBACFX,QAAQhB,KAAKgC,IAAL;kBACRC;4BACUjB,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;;AAITM,IAAAA,wBAAOhF,OAAuB;UACxB,CAACA,OAAO;aACLgF;;;;UAICC,OAASnC,KAATmC;UACFC,aAAaD,KAAKE,OAAL,CAAanF,KAAb;;UACf,CAACkF,YAAY;gBAEPE,mCAA6BpF;;;;UAIjCqF,UAAUH,WAAWd,UAAX;UACVkB,eAAeD,QAAQtB,GAAR,CAAY,UAACwB,KAAD;AAAA,eAAYA,MAAMvF,KAAlB;AAAA,OAAZ;;UACjBsF,aAAaE,OAAb,CAAqB1C,KAAK9C,KAA1B,IAAmC,GAAG;gBAEhCoF,mCAA6BpF;;;;iBAG5BgF;;AAIbS,IAAAA,0BAAQ9B,MAAkB;aACjB+B,OAAO5C,KAAKa,MAAMA;;;;SAItBV;;yBAIuBA,OAA0BH,MAAgB;MAElEC,QAAQC,gBAAgBF;SACvB4C,OAAOzC,OAAOF;;;;;;;;"}