tdesign-react 0.18.2 → 0.19.0

package/lib/_chunks/dep-b1e981b1.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-b1e981b1.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/lib/_chunks/dep-b3d60655.js

@@ -0,0 +1,42 @@
+/**
+ * tdesign v0.19.0
+ * (c) 2021 tdesign
+ * @license MIT
+ */
+
+function _objectWithoutPropertiesLoose(source, excluded) {
+  if (source == null) return {};
+  var target = {};
+  var sourceKeys = Object.keys(source);
+  var key, i;
+
+  for (i = 0; i < sourceKeys.length; i++) {
+    key = sourceKeys[i];
+    if (excluded.indexOf(key) >= 0) continue;
+    target[key] = source[key];
+  }
+
+  return target;
+}
+
+function _objectWithoutProperties(source, excluded) {
+  if (source == null) return {};
+  var target = _objectWithoutPropertiesLoose(source, excluded);
+  var key, i;
+
+  if (Object.getOwnPropertySymbols) {
+    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);
+
+    for (i = 0; i < sourceSymbolKeys.length; i++) {
+      key = sourceSymbolKeys[i];
+      if (excluded.indexOf(key) >= 0) continue;
+      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;
+      target[key] = source[key];
+    }
+  }
+
+  return target;
+}
+
+export { _objectWithoutProperties as _ };
+//# sourceMappingURL=dep-b3d60655.js.map

package/lib/_chunks/dep-b3d60655.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-b3d60655.js","sources":["../../node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js","../../node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js"],"sourcesContent":["export default function _objectWithoutPropertiesLoose(source, excluded) {\n  if (source == null) return {};\n  var target = {};\n  var sourceKeys = Object.keys(source);\n  var key, i;\n\n  for (i = 0; i < sourceKeys.length; i++) {\n    key = sourceKeys[i];\n    if (excluded.indexOf(key) >= 0) continue;\n    target[key] = source[key];\n  }\n\n  return target;\n}","import objectWithoutPropertiesLoose from \"./objectWithoutPropertiesLoose.js\";\nexport default function _objectWithoutProperties(source, excluded) {\n  if (source == null) return {};\n  var target = objectWithoutPropertiesLoose(source, excluded);\n  var key, i;\n\n  if (Object.getOwnPropertySymbols) {\n    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);\n\n    for (i = 0; i < sourceSymbolKeys.length; i++) {\n      key = sourceSymbolKeys[i];\n      if (excluded.indexOf(key) >= 0) continue;\n      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;\n      target[key] = source[key];\n    }\n  }\n\n  return target;\n}"],"names":["_objectWithoutPropertiesLoose","source","excluded","target","sourceKeys","Object","keys","key","i","length","indexOf","_objectWithoutProperties","objectWithoutPropertiesLoose","getOwnPropertySymbols","sourceSymbolKeys","prototype","propertyIsEnumerable","call"],"mappings":";;;;;;AAAe,SAASA,6BAAT,CAAuCC,MAAvC,EAA+CC,QAA/C,EAAyD;AACtE,MAAID,MAAM,IAAI,IAAd,EAAoB,OAAO,EAAP;AACpB,MAAIE,MAAM,GAAG,EAAb;AACA,MAAIC,UAAU,GAAGC,MAAM,CAACC,IAAP,CAAYL,MAAZ,CAAjB;AACA,MAAIM,GAAJ,EAASC,CAAT;;AAEA,OAAKA,CAAC,GAAG,CAAT,EAAYA,CAAC,GAAGJ,UAAU,CAACK,MAA3B,EAAmCD,CAAC,EAApC,EAAwC;AACtCD,IAAAA,GAAG,GAAGH,UAAU,CAACI,CAAD,CAAhB;AACA,QAAIN,QAAQ,CAACQ,OAAT,CAAiBH,GAAjB,KAAyB,CAA7B,EAAgC;AAChCJ,IAAAA,MAAM,CAACI,GAAD,CAAN,GAAcN,MAAM,CAACM,GAAD,CAApB;AACD;;AAED,SAAOJ,MAAP;AACD;;ACZc,SAASQ,wBAAT,CAAkCV,MAAlC,EAA0CC,QAA1C,EAAoD;AACjE,MAAID,MAAM,IAAI,IAAd,EAAoB,OAAO,EAAP;AACpB,MAAIE,MAAM,GAAGS,6BAA4B,CAACX,MAAD,EAASC,QAAT,CAAzC;AACA,MAAIK,GAAJ,EAASC,CAAT;;AAEA,MAAIH,MAAM,CAACQ,qBAAX,EAAkC;AAChC,QAAIC,gBAAgB,GAAGT,MAAM,CAACQ,qBAAP,CAA6BZ,MAA7B,CAAvB;;AAEA,SAAKO,CAAC,GAAG,CAAT,EAAYA,CAAC,GAAGM,gBAAgB,CAACL,MAAjC,EAAyCD,CAAC,EAA1C,EAA8C;AAC5CD,MAAAA,GAAG,GAAGO,gBAAgB,CAACN,CAAD,CAAtB;AACA,UAAIN,QAAQ,CAACQ,OAAT,CAAiBH,GAAjB,KAAyB,CAA7B,EAAgC;AAChC,UAAI,CAACF,MAAM,CAACU,SAAP,CAAiBC,oBAAjB,CAAsCC,IAAtC,CAA2ChB,MAA3C,EAAmDM,GAAnD,CAAL,EAA8D;AAC9DJ,MAAAA,MAAM,CAACI,GAAD,CAAN,GAAcN,MAAM,CAACM,GAAD,CAApB;AACD;AACF;;AAED,SAAOJ,MAAP;AACD;;;;"}

package/lib/_chunks/dep-b573d9f2.js

@@ -0,0 +1,95 @@
+/**
+ * tdesign v0.19.0
+ * (c) 2021 tdesign
+ * @license MIT
+ */
+
+import { b as _Symbol$1 } from './dep-3072ff80.js';
+import { i as isArguments_1 } from './dep-c5b8c162.js';
+import { i as isArray_1 } from './dep-785f8869.js';
+
+/**
+ * Appends the elements of `values` to `array`.
+ *
+ * @private
+ * @param {Array} array The array to modify.
+ * @param {Array} values The values to append.
+ * @returns {Array} Returns `array`.
+ */
+
+function arrayPush$1(array, values) {
+  var index = -1,
+      length = values.length,
+      offset = array.length;
+
+  while (++index < length) {
+    array[offset + index] = values[index];
+  }
+
+  return array;
+}
+
+var _arrayPush = arrayPush$1;
+
+var _Symbol = _Symbol$1,
+    isArguments = isArguments_1,
+    isArray = isArray_1;
+/** Built-in value references. */
+
+var spreadableSymbol = _Symbol ? _Symbol.isConcatSpreadable : undefined;
+/**
+ * Checks if `value` is a flattenable `arguments` object or array.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.
+ */
+
+function isFlattenable$1(value) {
+  return isArray(value) || isArguments(value) || !!(spreadableSymbol && value && value[spreadableSymbol]);
+}
+
+var _isFlattenable = isFlattenable$1;
+
+var arrayPush = _arrayPush,
+    isFlattenable = _isFlattenable;
+/**
+ * The base implementation of `_.flatten` with support for restricting flattening.
+ *
+ * @private
+ * @param {Array} array The array to flatten.
+ * @param {number} depth The maximum recursion depth.
+ * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.
+ * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.
+ * @param {Array} [result=[]] The initial result value.
+ * @returns {Array} Returns the new flattened array.
+ */
+
+function baseFlatten(array, depth, predicate, isStrict, result) {
+  var index = -1,
+      length = array.length;
+  predicate || (predicate = isFlattenable);
+  result || (result = []);
+
+  while (++index < length) {
+    var value = array[index];
+
+    if (depth > 0 && predicate(value)) {
+      if (depth > 1) {
+        // Recursively flatten arrays (susceptible to call stack limits).
+        baseFlatten(value, depth - 1, predicate, isStrict, result);
+      } else {
+        arrayPush(result, value);
+      }
+    } else if (!isStrict) {
+      result[result.length] = value;
+    }
+  }
+
+  return result;
+}
+
+var _baseFlatten = baseFlatten;
+
+export { _arrayPush as _, _baseFlatten as a };
+//# sourceMappingURL=dep-b573d9f2.js.map

package/lib/_chunks/dep-b573d9f2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-b573d9f2.js","sources":["../../node_modules/lodash/_arrayPush.js","../../node_modules/lodash/_isFlattenable.js","../../node_modules/lodash/_baseFlatten.js"],"sourcesContent":["/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nmodule.exports = arrayPush;\n","var Symbol = require('./_Symbol'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray');\n\n/** Built-in value references. */\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nmodule.exports = isFlattenable;\n","var arrayPush = require('./_arrayPush'),\n    isFlattenable = require('./_isFlattenable');\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseFlatten;\n"],"names":["arrayPush","array","values","index","length","offset","_arrayPush","Symbol","require$$0","isArguments","require$$1","isArray","require$$2","spreadableSymbol","isConcatSpreadable","undefined","isFlattenable","value","_isFlattenable","baseFlatten","depth","predicate","isStrict","result","_baseFlatten"],"mappings":";;;;;;;;;;;;;;;;;;;AAQA,SAASA,WAAT,CAAmBC,KAAnB,EAA0BC,MAA1B,EAAkC;AAChC,MAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGF,MAAM,CAACE,MADpB;AAAA,MAEIC,MAAM,GAAGJ,KAAK,CAACG,MAFnB;;AAIA,SAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;AACvBH,IAAAA,KAAK,CAACI,MAAM,GAAGF,KAAV,CAAL,GAAwBD,MAAM,CAACC,KAAD,CAA9B;AACD;;AACD,SAAOF,KAAP;AACD;;IAEDK,UAAc,GAAGN;;ACnBjB,IAAIO,OAAM,GAAGC,SAAb;AAAA,IACIC,WAAW,GAAGC,aADlB;AAAA,IAEIC,OAAO,GAAGC,SAFd;AAIA;;AACA,IAAIC,gBAAgB,GAAGN,OAAM,GAAGA,OAAM,CAACO,kBAAV,GAA+BC,SAA5D;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,eAAT,CAAuBC,KAAvB,EAA8B;AAC5B,SAAON,OAAO,CAACM,KAAD,CAAP,IAAkBR,WAAW,CAACQ,KAAD,CAA7B,IACL,CAAC,EAAEJ,gBAAgB,IAAII,KAApB,IAA6BA,KAAK,CAACJ,gBAAD,CAApC,CADH;AAED;;IAEDK,cAAc,GAAGF;;ACnBjB,IAAIhB,SAAS,GAAGQ,UAAhB;AAAA,IACIQ,aAAa,GAAGN,cADpB;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASS,WAAT,CAAqBlB,KAArB,EAA4BmB,KAA5B,EAAmCC,SAAnC,EAA8CC,QAA9C,EAAwDC,MAAxD,EAAgE;AAC9D,MAAIpB,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGH,KAAK,CAACG,MADnB;AAGAiB,EAAAA,SAAS,KAAKA,SAAS,GAAGL,aAAjB,CAAT;AACAO,EAAAA,MAAM,KAAKA,MAAM,GAAG,EAAd,CAAN;;AAEA,SAAO,EAAEpB,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIa,KAAK,GAAGhB,KAAK,CAACE,KAAD,CAAjB;;AACA,QAAIiB,KAAK,GAAG,CAAR,IAAaC,SAAS,CAACJ,KAAD,CAA1B,EAAmC;AACjC,UAAIG,KAAK,GAAG,CAAZ,EAAe;;AAEbD,QAAAA,WAAW,CAACF,KAAD,EAAQG,KAAK,GAAG,CAAhB,EAAmBC,SAAnB,EAA8BC,QAA9B,EAAwCC,MAAxC,CAAX;AACD,OAHD,MAGO;AACLvB,QAAAA,SAAS,CAACuB,MAAD,EAASN,KAAT,CAAT;AACD;AACF,KAPD,MAOO,IAAI,CAACK,QAAL,EAAe;AACpBC,MAAAA,MAAM,CAACA,MAAM,CAACnB,MAAR,CAAN,GAAwBa,KAAxB;AACD;AACF;;AACD,SAAOM,MAAP;AACD;;IAEDC,YAAc,GAAGL;;;;"}

package/lib/_chunks/dep-bd015982.js

@@ -0,0 +1,41 @@
+/**
+ * tdesign v0.19.0
+ * (c) 2021 tdesign
+ * @license MIT
+ */
+
+/**
+ * The base implementation of `_.unary` without support for storing metadata.
+ *
+ * @private
+ * @param {Function} func The function to cap arguments for.
+ * @returns {Function} Returns the new capped function.
+ */
+
+function baseUnary(func) {
+  return function (value) {
+    return func(value);
+  };
+}
+
+var _baseUnary = baseUnary;
+
+/**
+ * Creates a unary function that invokes `func` with its argument transformed.
+ *
+ * @private
+ * @param {Function} func The function to wrap.
+ * @param {Function} transform The argument transform.
+ * @returns {Function} Returns the new function.
+ */
+
+function overArg(func, transform) {
+  return function (arg) {
+    return func(transform(arg));
+  };
+}
+
+var _overArg = overArg;
+
+export { _baseUnary as _, _overArg as a };
+//# sourceMappingURL=dep-bd015982.js.map

package/lib/_chunks/dep-bd015982.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-bd015982.js","sources":["../../node_modules/lodash/_baseUnary.js","../../node_modules/lodash/_overArg.js"],"sourcesContent":["/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nmodule.exports = baseUnary;\n","/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nmodule.exports = overArg;\n"],"names":["baseUnary","func","value","_baseUnary","overArg","transform","arg","_overArg"],"mappings":";;;;;;;;;;;;;;AAOA,SAASA,SAAT,CAAmBC,IAAnB,EAAyB;AACvB,SAAO,UAASC,KAAT,EAAgB;AACrB,WAAOD,IAAI,CAACC,KAAD,CAAX;AACD,GAFD;AAGD;;IAEDC,UAAc,GAAGH;;;;;;;;;;;ACLjB,SAASI,OAAT,CAAiBH,IAAjB,EAAuBI,SAAvB,EAAkC;AAChC,SAAO,UAASC,GAAT,EAAc;AACnB,WAAOL,IAAI,CAACI,SAAS,CAACC,GAAD,CAAV,CAAX;AACD,GAFD;AAGD;;IAEDC,QAAc,GAAGH;;;;"}

package/lib/_chunks/dep-bf8d732e.js

@@ -0,0 +1,230 @@
+/**
+ * tdesign v0.19.0
+ * (c) 2021 tdesign
+ * @license MIT
+ */
+
+import { i as isObject_1 } from './dep-204550b9.js';
+import { a as _root } from './dep-3072ff80.js';
+import { t as toNumber_1 } from './dep-a7333da6.js';
+
+var root = _root;
+/**
+ * Gets the timestamp of the number of milliseconds that have elapsed since
+ * the Unix epoch (1 January 1970 00:00:00 UTC).
+ *
+ * @static
+ * @memberOf _
+ * @since 2.4.0
+ * @category Date
+ * @returns {number} Returns the timestamp.
+ * @example
+ *
+ * _.defer(function(stamp) {
+ *   console.log(_.now() - stamp);
+ * }, _.now());
+ * // => Logs the number of milliseconds it took for the deferred invocation.
+ */
+
+var now$1 = function now() {
+  return root.Date.now();
+};
+
+var now_1 = now$1;
+
+var isObject = isObject_1,
+    now = now_1,
+    toNumber = toNumber_1;
+/** Error message constants. */
+
+var FUNC_ERROR_TEXT = 'Expected a function';
+/* Built-in method references for those with the same name as other `lodash` methods. */
+
+var nativeMax = Math.max,
+    nativeMin = Math.min;
+/**
+ * Creates a debounced function that delays invoking `func` until after `wait`
+ * milliseconds have elapsed since the last time the debounced function was
+ * invoked. The debounced function comes with a `cancel` method to cancel
+ * delayed `func` invocations and a `flush` method to immediately invoke them.
+ * Provide `options` to indicate whether `func` should be invoked on the
+ * leading and/or trailing edge of the `wait` timeout. The `func` is invoked
+ * with the last arguments provided to the debounced function. Subsequent
+ * calls to the debounced function return the result of the last `func`
+ * invocation.
+ *
+ * **Note:** If `leading` and `trailing` options are `true`, `func` is
+ * invoked on the trailing edge of the timeout only if the debounced function
+ * is invoked more than once during the `wait` timeout.
+ *
+ * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred
+ * until to the next tick, similar to `setTimeout` with a timeout of `0`.
+ *
+ * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)
+ * for details over the differences between `_.debounce` and `_.throttle`.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Function
+ * @param {Function} func The function to debounce.
+ * @param {number} [wait=0] The number of milliseconds to delay.
+ * @param {Object} [options={}] The options object.
+ * @param {boolean} [options.leading=false]
+ *  Specify invoking on the leading edge of the timeout.
+ * @param {number} [options.maxWait]
+ *  The maximum time `func` is allowed to be delayed before it's invoked.
+ * @param {boolean} [options.trailing=true]
+ *  Specify invoking on the trailing edge of the timeout.
+ * @returns {Function} Returns the new debounced function.
+ * @example
+ *
+ * // Avoid costly calculations while the window size is in flux.
+ * jQuery(window).on('resize', _.debounce(calculateLayout, 150));
+ *
+ * // Invoke `sendMail` when clicked, debouncing subsequent calls.
+ * jQuery(element).on('click', _.debounce(sendMail, 300, {
+ *   'leading': true,
+ *   'trailing': false
+ * }));
+ *
+ * // Ensure `batchLog` is invoked once after 1 second of debounced calls.
+ * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });
+ * var source = new EventSource('/stream');
+ * jQuery(source).on('message', debounced);
+ *
+ * // Cancel the trailing debounced invocation.
+ * jQuery(window).on('popstate', debounced.cancel);
+ */
+
+function debounce(func, wait, options) {
+  var lastArgs,
+      lastThis,
+      maxWait,
+      result,
+      timerId,
+      lastCallTime,
+      lastInvokeTime = 0,
+      leading = false,
+      maxing = false,
+      trailing = true;
+
+  if (typeof func != 'function') {
+    throw new TypeError(FUNC_ERROR_TEXT);
+  }
+
+  wait = toNumber(wait) || 0;
+
+  if (isObject(options)) {
+    leading = !!options.leading;
+    maxing = 'maxWait' in options;
+    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;
+    trailing = 'trailing' in options ? !!options.trailing : trailing;
+  }
+
+  function invokeFunc(time) {
+    var args = lastArgs,
+        thisArg = lastThis;
+    lastArgs = lastThis = undefined;
+    lastInvokeTime = time;
+    result = func.apply(thisArg, args);
+    return result;
+  }
+
+  function leadingEdge(time) {
+    // Reset any `maxWait` timer.
+    lastInvokeTime = time; // Start the timer for the trailing edge.
+
+    timerId = setTimeout(timerExpired, wait); // Invoke the leading edge.
+
+    return leading ? invokeFunc(time) : result;
+  }
+
+  function remainingWait(time) {
+    var timeSinceLastCall = time - lastCallTime,
+        timeSinceLastInvoke = time - lastInvokeTime,
+        timeWaiting = wait - timeSinceLastCall;
+    return maxing ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke) : timeWaiting;
+  }
+
+  function shouldInvoke(time) {
+    var timeSinceLastCall = time - lastCallTime,
+        timeSinceLastInvoke = time - lastInvokeTime; // Either this is the first call, activity has stopped and we're at the
+    // trailing edge, the system time has gone backwards and we're treating
+    // it as the trailing edge, or we've hit the `maxWait` limit.
+
+    return lastCallTime === undefined || timeSinceLastCall >= wait || timeSinceLastCall < 0 || maxing && timeSinceLastInvoke >= maxWait;
+  }
+
+  function timerExpired() {
+    var time = now();
+
+    if (shouldInvoke(time)) {
+      return trailingEdge(time);
+    } // Restart the timer.
+
+
+    timerId = setTimeout(timerExpired, remainingWait(time));
+  }
+
+  function trailingEdge(time) {
+    timerId = undefined; // Only invoke if we have `lastArgs` which means `func` has been
+    // debounced at least once.
+
+    if (trailing && lastArgs) {
+      return invokeFunc(time);
+    }
+
+    lastArgs = lastThis = undefined;
+    return result;
+  }
+
+  function cancel() {
+    if (timerId !== undefined) {
+      clearTimeout(timerId);
+    }
+
+    lastInvokeTime = 0;
+    lastArgs = lastCallTime = lastThis = timerId = undefined;
+  }
+
+  function flush() {
+    return timerId === undefined ? result : trailingEdge(now());
+  }
+
+  function debounced() {
+    var time = now(),
+        isInvoking = shouldInvoke(time);
+    lastArgs = arguments;
+    lastThis = this;
+    lastCallTime = time;
+
+    if (isInvoking) {
+      if (timerId === undefined) {
+        return leadingEdge(lastCallTime);
+      }
+
+      if (maxing) {
+        // Handle invocations in a tight loop.
+        clearTimeout(timerId);
+        timerId = setTimeout(timerExpired, wait);
+        return invokeFunc(lastCallTime);
+      }
+    }
+
+    if (timerId === undefined) {
+      timerId = setTimeout(timerExpired, wait);
+    }
+
+    return result;
+  }
+
+  debounced.cancel = cancel;
+  debounced.flush = flush;
+  return debounced;
+}
+
+var debounce_1 = debounce;
+
+export { debounce_1 as d };
+//# sourceMappingURL=dep-bf8d732e.js.map

package/lib/_chunks/dep-bf8d732e.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-bf8d732e.js","sources":["../../node_modules/lodash/now.js","../../node_modules/lodash/debounce.js"],"sourcesContent":["var root = require('./_root');\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nmodule.exports = now;\n","var isObject = require('./isObject'),\n    now = require('./now'),\n    toNumber = require('./toNumber');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        timeWaiting = wait - timeSinceLastCall;\n\n    return maxing\n      ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n      : timeWaiting;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        clearTimeout(timerId);\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\nmodule.exports = debounce;\n"],"names":["root","require$$0","now","Date","now_1","isObject","require$$1","toNumber","require$$2","FUNC_ERROR_TEXT","nativeMax","Math","max","nativeMin","min","debounce","func","wait","options","lastArgs","lastThis","maxWait","result","timerId","lastCallTime","lastInvokeTime","leading","maxing","trailing","TypeError","invokeFunc","time","args","thisArg","undefined","apply","leadingEdge","setTimeout","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","timeWaiting","shouldInvoke","trailingEdge","cancel","clearTimeout","flush","debounced","isInvoking","arguments","debounce_1"],"mappings":";;;;;;;;;;AAAA,IAAIA,IAAI,GAAGC,KAAX;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIC,KAAG,GAAG,SAANA,GAAM,GAAW;AACnB,SAAOF,IAAI,CAACG,IAAL,CAAUD,GAAV,EAAP;AACD,CAFD;;IAIAE,KAAc,GAAGF;;ACtBjB,IAAIG,QAAQ,GAAGJ,UAAf;AAAA,IACIC,GAAG,GAAGI,KADV;AAAA,IAEIC,QAAQ,GAAGC,UAFf;AAIA;;AACA,IAAIC,eAAe,GAAG,qBAAtB;AAEA;;AACA,IAAIC,SAAS,GAAGC,IAAI,CAACC,GAArB;AAAA,IACIC,SAAS,GAAGF,IAAI,CAACG,GADrB;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;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,SAASC,QAAT,CAAkBC,IAAlB,EAAwBC,IAAxB,EAA8BC,OAA9B,EAAuC;AACrC,MAAIC,QAAJ;AAAA,MACIC,QADJ;AAAA,MAEIC,OAFJ;AAAA,MAGIC,MAHJ;AAAA,MAIIC,OAJJ;AAAA,MAKIC,YALJ;AAAA,MAMIC,cAAc,GAAG,CANrB;AAAA,MAOIC,OAAO,GAAG,KAPd;AAAA,MAQIC,MAAM,GAAG,KARb;AAAA,MASIC,QAAQ,GAAG,IATf;;AAWA,MAAI,OAAOZ,IAAP,IAAe,UAAnB,EAA+B;AAC7B,UAAM,IAAIa,SAAJ,CAAcpB,eAAd,CAAN;AACD;;AACDQ,EAAAA,IAAI,GAAGV,QAAQ,CAACU,IAAD,CAAR,IAAkB,CAAzB;;AACA,MAAIZ,QAAQ,CAACa,OAAD,CAAZ,EAAuB;AACrBQ,IAAAA,OAAO,GAAG,CAAC,CAACR,OAAO,CAACQ,OAApB;AACAC,IAAAA,MAAM,GAAG,aAAaT,OAAtB;AACAG,IAAAA,OAAO,GAAGM,MAAM,GAAGjB,SAAS,CAACH,QAAQ,CAACW,OAAO,CAACG,OAAT,CAAR,IAA6B,CAA9B,EAAiCJ,IAAjC,CAAZ,GAAqDI,OAArE;AACAO,IAAAA,QAAQ,GAAG,cAAcV,OAAd,GAAwB,CAAC,CAACA,OAAO,CAACU,QAAlC,GAA6CA,QAAxD;AACD;;AAED,WAASE,UAAT,CAAoBC,IAApB,EAA0B;AACxB,QAAIC,IAAI,GAAGb,QAAX;AAAA,QACIc,OAAO,GAAGb,QADd;AAGAD,IAAAA,QAAQ,GAAGC,QAAQ,GAAGc,SAAtB;AACAT,IAAAA,cAAc,GAAGM,IAAjB;AACAT,IAAAA,MAAM,GAAGN,IAAI,CAACmB,KAAL,CAAWF,OAAX,EAAoBD,IAApB,CAAT;AACA,WAAOV,MAAP;AACD;;AAED,WAASc,WAAT,CAAqBL,IAArB,EAA2B;;AAEzBN,IAAAA,cAAc,GAAGM,IAAjB,CAFyB;;AAIzBR,IAAAA,OAAO,GAAGc,UAAU,CAACC,YAAD,EAAerB,IAAf,CAApB,CAJyB;;AAMzB,WAAOS,OAAO,GAAGI,UAAU,CAACC,IAAD,CAAb,GAAsBT,MAApC;AACD;;AAED,WAASiB,aAAT,CAAuBR,IAAvB,EAA6B;AAC3B,QAAIS,iBAAiB,GAAGT,IAAI,GAAGP,YAA/B;AAAA,QACIiB,mBAAmB,GAAGV,IAAI,GAAGN,cADjC;AAAA,QAEIiB,WAAW,GAAGzB,IAAI,GAAGuB,iBAFzB;AAIA,WAAOb,MAAM,GACTd,SAAS,CAAC6B,WAAD,EAAcrB,OAAO,GAAGoB,mBAAxB,CADA,GAETC,WAFJ;AAGD;;AAED,WAASC,YAAT,CAAsBZ,IAAtB,EAA4B;AAC1B,QAAIS,iBAAiB,GAAGT,IAAI,GAAGP,YAA/B;AAAA,QACIiB,mBAAmB,GAAGV,IAAI,GAAGN,cADjC,CAD0B;;;;AAO1B,WAAQD,YAAY,KAAKU,SAAjB,IAA+BM,iBAAiB,IAAIvB,IAApD,IACLuB,iBAAiB,GAAG,CADf,IACsBb,MAAM,IAAIc,mBAAmB,IAAIpB,OAD/D;AAED;;AAED,WAASiB,YAAT,GAAwB;AACtB,QAAIP,IAAI,GAAG7B,GAAG,EAAd;;AACA,QAAIyC,YAAY,CAACZ,IAAD,CAAhB,EAAwB;AACtB,aAAOa,YAAY,CAACb,IAAD,CAAnB;AACD,KAJqB;;;AAMtBR,IAAAA,OAAO,GAAGc,UAAU,CAACC,YAAD,EAAeC,aAAa,CAACR,IAAD,CAA5B,CAApB;AACD;;AAED,WAASa,YAAT,CAAsBb,IAAtB,EAA4B;AAC1BR,IAAAA,OAAO,GAAGW,SAAV,CAD0B;;;AAK1B,QAAIN,QAAQ,IAAIT,QAAhB,EAA0B;AACxB,aAAOW,UAAU,CAACC,IAAD,CAAjB;AACD;;AACDZ,IAAAA,QAAQ,GAAGC,QAAQ,GAAGc,SAAtB;AACA,WAAOZ,MAAP;AACD;;AAED,WAASuB,MAAT,GAAkB;AAChB,QAAItB,OAAO,KAAKW,SAAhB,EAA2B;AACzBY,MAAAA,YAAY,CAACvB,OAAD,CAAZ;AACD;;AACDE,IAAAA,cAAc,GAAG,CAAjB;AACAN,IAAAA,QAAQ,GAAGK,YAAY,GAAGJ,QAAQ,GAAGG,OAAO,GAAGW,SAA/C;AACD;;AAED,WAASa,KAAT,GAAiB;AACf,WAAOxB,OAAO,KAAKW,SAAZ,GAAwBZ,MAAxB,GAAiCsB,YAAY,CAAC1C,GAAG,EAAJ,CAApD;AACD;;AAED,WAAS8C,SAAT,GAAqB;AACnB,QAAIjB,IAAI,GAAG7B,GAAG,EAAd;AAAA,QACI+C,UAAU,GAAGN,YAAY,CAACZ,IAAD,CAD7B;AAGAZ,IAAAA,QAAQ,GAAG+B,SAAX;AACA9B,IAAAA,QAAQ,GAAG,IAAX;AACAI,IAAAA,YAAY,GAAGO,IAAf;;AAEA,QAAIkB,UAAJ,EAAgB;AACd,UAAI1B,OAAO,KAAKW,SAAhB,EAA2B;AACzB,eAAOE,WAAW,CAACZ,YAAD,CAAlB;AACD;;AACD,UAAIG,MAAJ,EAAY;;AAEVmB,QAAAA,YAAY,CAACvB,OAAD,CAAZ;AACAA,QAAAA,OAAO,GAAGc,UAAU,CAACC,YAAD,EAAerB,IAAf,CAApB;AACA,eAAOa,UAAU,CAACN,YAAD,CAAjB;AACD;AACF;;AACD,QAAID,OAAO,KAAKW,SAAhB,EAA2B;AACzBX,MAAAA,OAAO,GAAGc,UAAU,CAACC,YAAD,EAAerB,IAAf,CAApB;AACD;;AACD,WAAOK,MAAP;AACD;;AACD0B,EAAAA,SAAS,CAACH,MAAV,GAAmBA,MAAnB;AACAG,EAAAA,SAAS,CAACD,KAAV,GAAkBA,KAAlB;AACA,SAAOC,SAAP;AACD;;IAEDG,UAAc,GAAGpC;;;;"}

package/lib/_chunks/dep-c5b8c162.js

@@ -0,0 +1,67 @@
+/**
+ * tdesign v0.19.0
+ * (c) 2021 tdesign
+ * @license MIT
+ */
+
+import { _ as _baseGetTag } from './dep-3072ff80.js';
+import { i as isObjectLike_1 } from './dep-aa8beec4.js';
+
+var baseGetTag = _baseGetTag,
+    isObjectLike$1 = 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_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;
+
+export { isArguments_1 as i };
+//# sourceMappingURL=dep-c5b8c162.js.map

package/lib/_chunks/dep-c5b8c162.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-c5b8c162.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,WAAjB;AAAA,IACIC,cAAY,GAAGC,cADnB;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,cADnB;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;;;;"}