tdesign-react 0.20.1 → 0.20.2

package/es/_chunks/dep-415e39ec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-415e39ec.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/es/_chunks/dep-430ce0e6.js

@@ -0,0 +1,75 @@
+/**
+ * tdesign v0.20.2
+ * (c) 2021 tdesign
+ * @license MIT
+ */
+
+import './dep-00ccaf0c.js';
+import { _ as _arrayPush } from './dep-8c6f23dd.js';
+import { a as _Symbol$1 } from './dep-88b40b60.js';
+import { i as isArguments_1 } from './dep-97b57b2a.js';
+import { i as isArray_1 } from './dep-cc2481d3.js';
+import './dep-964eef6f.js';
+
+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 { _baseFlatten as _ };
+//# sourceMappingURL=dep-430ce0e6.js.map

package/es/_chunks/dep-430ce0e6.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-430ce0e6.js","sources":["../../node_modules/lodash/_isFlattenable.js","../../node_modules/lodash/_baseFlatten.js"],"sourcesContent":["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":["Symbol","require$$0","isArguments","require$$1","isArray","require$$2","spreadableSymbol","isConcatSpreadable","undefined","isFlattenable","value","_isFlattenable","arrayPush","baseFlatten","array","depth","predicate","isStrict","result","index","length","_baseFlatten"],"mappings":";;;;;;;;;;;;;AAAA,IAAIA,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,IAAIG,SAAS,GAAGX,UAAhB;AAAA,IACIQ,aAAa,GAAGN,cADpB;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASU,WAAT,CAAqBC,KAArB,EAA4BC,KAA5B,EAAmCC,SAAnC,EAA8CC,QAA9C,EAAwDC,MAAxD,EAAgE;AAC9D,MAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGN,KAAK,CAACM,MADnB;AAGAJ,EAAAA,SAAS,KAAKA,SAAS,GAAGP,aAAjB,CAAT;AACAS,EAAAA,MAAM,KAAKA,MAAM,GAAG,EAAd,CAAN;;AAEA,SAAO,EAAEC,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIV,KAAK,GAAGI,KAAK,CAACK,KAAD,CAAjB;;AACA,QAAIJ,KAAK,GAAG,CAAR,IAAaC,SAAS,CAACN,KAAD,CAA1B,EAAmC;AACjC,UAAIK,KAAK,GAAG,CAAZ,EAAe;;AAEbF,QAAAA,WAAW,CAACH,KAAD,EAAQK,KAAK,GAAG,CAAhB,EAAmBC,SAAnB,EAA8BC,QAA9B,EAAwCC,MAAxC,CAAX;AACD,OAHD,MAGO;AACLN,QAAAA,SAAS,CAACM,MAAD,EAASR,KAAT,CAAT;AACD;AACF,KAPD,MAOO,IAAI,CAACO,QAAL,EAAe;AACpBC,MAAAA,MAAM,CAACA,MAAM,CAACE,MAAR,CAAN,GAAwBV,KAAxB;AACD;AACF;;AACD,SAAOQ,MAAP;AACD;;IAEDG,YAAc,GAAGR;;;;"}

package/es/_chunks/dep-447acf5a.js

@@ -0,0 +1,50 @@
+/**
+ * tdesign v0.20.2
+ * (c) 2021 tdesign
+ * @license MIT
+ */
+
+import './dep-00ccaf0c.js';
+import { _ as _baseGetTag } from './dep-88b40b60.js';
+import { i as isObjectLike_1 } from './dep-c5dffd03.js';
+
+var baseGetTag = _baseGetTag,
+    isObjectLike = isObjectLike_1;
+/** `Object#toString` result references. */
+
+var numberTag = '[object Number]';
+/**
+ * Checks if `value` is classified as a `Number` primitive or object.
+ *
+ * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are
+ * classified as numbers, use the `_.isFinite` method.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a number, else `false`.
+ * @example
+ *
+ * _.isNumber(3);
+ * // => true
+ *
+ * _.isNumber(Number.MIN_VALUE);
+ * // => true
+ *
+ * _.isNumber(Infinity);
+ * // => true
+ *
+ * _.isNumber('3');
+ * // => false
+ */
+
+function isNumber(value) {
+  return typeof value == 'number' || isObjectLike(value) && baseGetTag(value) == numberTag;
+}
+
+var isNumber_1 = isNumber;
+
+export { isNumber_1 as i };
+//# sourceMappingURL=dep-447acf5a.js.map

package/es/_chunks/dep-447acf5a.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-447acf5a.js","sources":["../../node_modules/lodash/isNumber.js"],"sourcesContent":["var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar numberTag = '[object Number]';\n\n/**\n * Checks if `value` is classified as a `Number` primitive or object.\n *\n * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n * classified as numbers, use the `_.isFinite` method.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n * @example\n *\n * _.isNumber(3);\n * // => true\n *\n * _.isNumber(Number.MIN_VALUE);\n * // => true\n *\n * _.isNumber(Infinity);\n * // => true\n *\n * _.isNumber('3');\n * // => false\n */\nfunction isNumber(value) {\n  return typeof value == 'number' ||\n    (isObjectLike(value) && baseGetTag(value) == numberTag);\n}\n\nmodule.exports = isNumber;\n"],"names":["baseGetTag","require$$0","isObjectLike","require$$1","numberTag","isNumber","value","isNumber_1"],"mappings":";;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,WAAjB;AAAA,IACIC,YAAY,GAAGC,cADnB;AAGA;;AACA,IAAIC,SAAS,GAAG,iBAAhB;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,SAASC,QAAT,CAAkBC,KAAlB,EAAyB;AACvB,SAAO,OAAOA,KAAP,IAAgB,QAAhB,IACJJ,YAAY,CAACI,KAAD,CAAZ,IAAuBN,UAAU,CAACM,KAAD,CAAV,IAAqBF,SAD/C;AAED;;IAEDG,UAAc,GAAGF;;;;"}

package/es/_chunks/dep-49ece696.js

@@ -0,0 +1,388 @@
+/**
+ * tdesign v0.20.2
+ * (c) 2021 tdesign
+ * @license MIT
+ */
+
+import './dep-00ccaf0c.js';
+import { e as _ListCache, c as _MapCache } from './dep-1ba197d7.js';
+import { a as _Map } from './dep-e3057b1a.js';
+import { _ as _arrayPush } from './dep-8c6f23dd.js';
+import { i as isArray_1 } from './dep-cc2481d3.js';
+import './dep-964eef6f.js';
+import { i as isArguments_1 } from './dep-97b57b2a.js';
+import { i as isBuffer$1, a as isTypedArray_1, d as _baseKeys } from './dep-267d748a.js';
+import { _ as _isIndex } from './dep-b654ad92.js';
+import { i as isArrayLike_1 } from './dep-56958a5c.js';
+import { b as _root } from './dep-88b40b60.js';
+
+var ListCache$2 = _ListCache;
+/**
+ * Removes all key-value entries from the stack.
+ *
+ * @private
+ * @name clear
+ * @memberOf Stack
+ */
+
+function stackClear$1() {
+  this.__data__ = new ListCache$2();
+  this.size = 0;
+}
+
+var _stackClear = stackClear$1;
+
+/**
+ * Removes `key` and its value from the stack.
+ *
+ * @private
+ * @name delete
+ * @memberOf Stack
+ * @param {string} key The key of the value to remove.
+ * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+ */
+
+function stackDelete$1(key) {
+  var data = this.__data__,
+      result = data['delete'](key);
+  this.size = data.size;
+  return result;
+}
+
+var _stackDelete = stackDelete$1;
+
+/**
+ * Gets the stack value for `key`.
+ *
+ * @private
+ * @name get
+ * @memberOf Stack
+ * @param {string} key The key of the value to get.
+ * @returns {*} Returns the entry value.
+ */
+
+function stackGet$1(key) {
+  return this.__data__.get(key);
+}
+
+var _stackGet = stackGet$1;
+
+/**
+ * Checks if a stack value for `key` exists.
+ *
+ * @private
+ * @name has
+ * @memberOf Stack
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+
+function stackHas$1(key) {
+  return this.__data__.has(key);
+}
+
+var _stackHas = stackHas$1;
+
+var ListCache$1 = _ListCache,
+    Map = _Map,
+    MapCache = _MapCache;
+/** Used as the size to enable large array optimizations. */
+
+var LARGE_ARRAY_SIZE = 200;
+/**
+ * Sets the stack `key` to `value`.
+ *
+ * @private
+ * @name set
+ * @memberOf Stack
+ * @param {string} key The key of the value to set.
+ * @param {*} value The value to set.
+ * @returns {Object} Returns the stack cache instance.
+ */
+
+function stackSet$1(key, value) {
+  var data = this.__data__;
+
+  if (data instanceof ListCache$1) {
+    var pairs = data.__data__;
+
+    if (!Map || pairs.length < LARGE_ARRAY_SIZE - 1) {
+      pairs.push([key, value]);
+      this.size = ++data.size;
+      return this;
+    }
+
+    data = this.__data__ = new MapCache(pairs);
+  }
+
+  data.set(key, value);
+  this.size = data.size;
+  return this;
+}
+
+var _stackSet = stackSet$1;
+
+var ListCache = _ListCache,
+    stackClear = _stackClear,
+    stackDelete = _stackDelete,
+    stackGet = _stackGet,
+    stackHas = _stackHas,
+    stackSet = _stackSet;
+/**
+ * Creates a stack cache object to store key-value pairs.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [entries] The key-value pairs to cache.
+ */
+
+function Stack(entries) {
+  var data = this.__data__ = new ListCache(entries);
+  this.size = data.size;
+} // Add methods to `Stack`.
+
+
+Stack.prototype.clear = stackClear;
+Stack.prototype['delete'] = stackDelete;
+Stack.prototype.get = stackGet;
+Stack.prototype.has = stackHas;
+Stack.prototype.set = stackSet;
+var _Stack = Stack;
+
+/**
+ * The base implementation of `_.times` without support for iteratee shorthands
+ * or max array length checks.
+ *
+ * @private
+ * @param {number} n The number of times to invoke `iteratee`.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns the array of results.
+ */
+
+function baseTimes$1(n, iteratee) {
+  var index = -1,
+      result = Array(n);
+
+  while (++index < n) {
+    result[index] = iteratee(index);
+  }
+
+  return result;
+}
+
+var _baseTimes = baseTimes$1;
+
+var baseTimes = _baseTimes,
+    isArguments = isArguments_1,
+    isArray$1 = isArray_1,
+    isBuffer = isBuffer$1.exports,
+    isIndex = _isIndex,
+    isTypedArray = isTypedArray_1;
+/** Used for built-in method references. */
+
+var objectProto$1 = Object.prototype;
+/** Used to check objects for own properties. */
+
+var hasOwnProperty = objectProto$1.hasOwnProperty;
+/**
+ * Creates an array of the enumerable property names of the array-like `value`.
+ *
+ * @private
+ * @param {*} value The value to query.
+ * @param {boolean} inherited Specify returning inherited property names.
+ * @returns {Array} Returns the array of property names.
+ */
+
+function arrayLikeKeys$1(value, inherited) {
+  var isArr = isArray$1(value),
+      isArg = !isArr && isArguments(value),
+      isBuff = !isArr && !isArg && isBuffer(value),
+      isType = !isArr && !isArg && !isBuff && isTypedArray(value),
+      skipIndexes = isArr || isArg || isBuff || isType,
+      result = skipIndexes ? baseTimes(value.length, String) : [],
+      length = result.length;
+
+  for (var key in value) {
+    if ((inherited || hasOwnProperty.call(value, key)) && !(skipIndexes && ( // Safari 9 has enumerable `arguments.length` in strict mode.
+    key == 'length' || // Node.js 0.10 has enumerable non-index properties on buffers.
+    isBuff && (key == 'offset' || key == 'parent') || // PhantomJS 2 has enumerable non-index properties on typed arrays.
+    isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset') || // Skip index properties.
+    isIndex(key, length)))) {
+      result.push(key);
+    }
+  }
+
+  return result;
+}
+
+var _arrayLikeKeys = arrayLikeKeys$1;
+
+var arrayLikeKeys = _arrayLikeKeys,
+    baseKeys = _baseKeys,
+    isArrayLike = isArrayLike_1;
+/**
+ * Creates an array of the own enumerable property names of `object`.
+ *
+ * **Note:** Non-object values are coerced to objects. See the
+ * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
+ * for more details.
+ *
+ * @static
+ * @since 0.1.0
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names.
+ * @example
+ *
+ * function Foo() {
+ *   this.a = 1;
+ *   this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.keys(new Foo);
+ * // => ['a', 'b'] (iteration order is not guaranteed)
+ *
+ * _.keys('hi');
+ * // => ['0', '1']
+ */
+
+function keys$1(object) {
+  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);
+}
+
+var keys_1 = keys$1;
+
+/**
+ * A specialized version of `_.filter` for arrays without support for
+ * iteratee shorthands.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {Array} Returns the new filtered array.
+ */
+
+function arrayFilter$1(array, predicate) {
+  var index = -1,
+      length = array == null ? 0 : array.length,
+      resIndex = 0,
+      result = [];
+
+  while (++index < length) {
+    var value = array[index];
+
+    if (predicate(value, index, array)) {
+      result[resIndex++] = value;
+    }
+  }
+
+  return result;
+}
+
+var _arrayFilter = arrayFilter$1;
+
+/**
+ * This method returns a new empty array.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.13.0
+ * @category Util
+ * @returns {Array} Returns the new empty array.
+ * @example
+ *
+ * var arrays = _.times(2, _.stubArray);
+ *
+ * console.log(arrays);
+ * // => [[], []]
+ *
+ * console.log(arrays[0] === arrays[1]);
+ * // => false
+ */
+
+function stubArray$1() {
+  return [];
+}
+
+var stubArray_1 = stubArray$1;
+
+var arrayFilter = _arrayFilter,
+    stubArray = stubArray_1;
+/** Used for built-in method references. */
+
+var objectProto = Object.prototype;
+/** Built-in value references. */
+
+var propertyIsEnumerable = objectProto.propertyIsEnumerable;
+/* Built-in method references for those with the same name as other `lodash` methods. */
+
+var nativeGetSymbols = Object.getOwnPropertySymbols;
+/**
+ * Creates an array of the own enumerable symbols of `object`.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of symbols.
+ */
+
+var getSymbols$1 = !nativeGetSymbols ? stubArray : function (object) {
+  if (object == null) {
+    return [];
+  }
+
+  object = Object(object);
+  return arrayFilter(nativeGetSymbols(object), function (symbol) {
+    return propertyIsEnumerable.call(object, symbol);
+  });
+};
+var _getSymbols = getSymbols$1;
+
+var arrayPush = _arrayPush,
+    isArray = isArray_1;
+/**
+ * The base implementation of `getAllKeys` and `getAllKeysIn` which uses
+ * `keysFunc` and `symbolsFunc` to get the enumerable property names and
+ * symbols of `object`.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @param {Function} keysFunc The function to get the keys of `object`.
+ * @param {Function} symbolsFunc The function to get the symbols of `object`.
+ * @returns {Array} Returns the array of property names and symbols.
+ */
+
+function baseGetAllKeys$1(object, keysFunc, symbolsFunc) {
+  var result = keysFunc(object);
+  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));
+}
+
+var _baseGetAllKeys = baseGetAllKeys$1;
+
+var baseGetAllKeys = _baseGetAllKeys,
+    getSymbols = _getSymbols,
+    keys = keys_1;
+/**
+ * Creates an array of own enumerable property names and symbols of `object`.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names and symbols.
+ */
+
+function getAllKeys(object) {
+  return baseGetAllKeys(object, keys, getSymbols);
+}
+
+var _getAllKeys = getAllKeys;
+
+var root = _root;
+/** Built-in value references. */
+
+var Uint8Array = root.Uint8Array;
+var _Uint8Array = Uint8Array;
+
+export { _Uint8Array as _, _getAllKeys as a, _Stack as b, _arrayLikeKeys as c, _getSymbols as d, _baseGetAllKeys as e, keys_1 as k, stubArray_1 as s };
+//# sourceMappingURL=dep-49ece696.js.map

package/es/_chunks/dep-49ece696.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-49ece696.js","sources":["../../node_modules/lodash/_stackClear.js","../../node_modules/lodash/_stackDelete.js","../../node_modules/lodash/_stackGet.js","../../node_modules/lodash/_stackHas.js","../../node_modules/lodash/_stackSet.js","../../node_modules/lodash/_Stack.js","../../node_modules/lodash/_baseTimes.js","../../node_modules/lodash/_arrayLikeKeys.js","../../node_modules/lodash/keys.js","../../node_modules/lodash/_arrayFilter.js","../../node_modules/lodash/stubArray.js","../../node_modules/lodash/_getSymbols.js","../../node_modules/lodash/_baseGetAllKeys.js","../../node_modules/lodash/_getAllKeys.js","../../node_modules/lodash/_Uint8Array.js"],"sourcesContent":["var ListCache = require('./_ListCache');\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nmodule.exports = stackClear;\n","/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nmodule.exports = stackDelete;\n","/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nmodule.exports = stackGet;\n","/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\nmodule.exports = stackHas;\n","var ListCache = require('./_ListCache'),\n    Map = require('./_Map'),\n    MapCache = require('./_MapCache');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\nmodule.exports = stackSet;\n","var ListCache = require('./_ListCache'),\n    stackClear = require('./_stackClear'),\n    stackDelete = require('./_stackDelete'),\n    stackGet = require('./_stackGet'),\n    stackHas = require('./_stackHas'),\n    stackSet = require('./_stackSet');\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nmodule.exports = Stack;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = baseTimes;\n","var baseTimes = require('./_baseTimes'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isIndex = require('./_isIndex'),\n    isTypedArray = require('./isTypedArray');\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 * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayLikeKeys;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeys = require('./_baseKeys'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nmodule.exports = keys;\n","/**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction arrayFilter(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (predicate(value, index, array)) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayFilter;\n","/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nmodule.exports = stubArray;\n","var arrayFilter = require('./_arrayFilter'),\n    stubArray = require('./stubArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n  if (object == null) {\n    return [];\n  }\n  object = Object(object);\n  return arrayFilter(nativeGetSymbols(object), function(symbol) {\n    return propertyIsEnumerable.call(object, symbol);\n  });\n};\n\nmodule.exports = getSymbols;\n","var arrayPush = require('./_arrayPush'),\n    isArray = require('./isArray');\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nmodule.exports = baseGetAllKeys;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbols = require('./_getSymbols'),\n    keys = require('./keys');\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\nmodule.exports = getAllKeys;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nmodule.exports = Uint8Array;\n"],"names":["ListCache","require$$0","stackClear","__data__","size","_stackClear","stackDelete","key","data","result","_stackDelete","stackGet","get","_stackGet","stackHas","has","_stackHas","Map","require$$1","MapCache","require$$2","LARGE_ARRAY_SIZE","stackSet","value","pairs","length","push","set","_stackSet","require$$3","require$$4","require$$5","Stack","entries","prototype","clear","_Stack","baseTimes","n","iteratee","index","Array","_baseTimes","isArguments","isArray","isBuffer","isIndex","isTypedArray","objectProto","Object","hasOwnProperty","arrayLikeKeys","inherited","isArr","isArg","isBuff","isType","skipIndexes","String","call","_arrayLikeKeys","baseKeys","isArrayLike","keys","object","keys_1","arrayFilter","array","predicate","resIndex","_arrayFilter","stubArray","stubArray_1","propertyIsEnumerable","nativeGetSymbols","getOwnPropertySymbols","getSymbols","symbol","_getSymbols","arrayPush","baseGetAllKeys","keysFunc","symbolsFunc","_baseGetAllKeys","getAllKeys","_getAllKeys","root","Uint8Array","_Uint8Array"],"mappings":";;;;;;;;;;;;;;;;;;AAAA,IAAIA,WAAS,GAAGC,UAAhB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,YAAT,GAAsB;AACpB,OAAKC,QAAL,GAAgB,IAAIH,WAAJ,EAAhB;AACA,OAAKI,IAAL,GAAY,CAAZ;AACD;;IAEDC,WAAc,GAAGH;;;;;;;;;;;;ACLjB,SAASI,aAAT,CAAqBC,GAArB,EAA0B;AACxB,MAAIC,IAAI,GAAG,KAAKL,QAAhB;AAAA,MACIM,MAAM,GAAGD,IAAI,CAAC,QAAD,CAAJ,CAAeD,GAAf,CADb;AAGA,OAAKH,IAAL,GAAYI,IAAI,CAACJ,IAAjB;AACA,SAAOK,MAAP;AACD;;IAEDC,YAAc,GAAGJ;;;;;;;;;;;;ACRjB,SAASK,UAAT,CAAkBJ,GAAlB,EAAuB;AACrB,SAAO,KAAKJ,QAAL,CAAcS,GAAd,CAAkBL,GAAlB,CAAP;AACD;;IAEDM,SAAc,GAAGF;;;;;;;;;;;;ACJjB,SAASG,UAAT,CAAkBP,GAAlB,EAAuB;AACrB,SAAO,KAAKJ,QAAL,CAAcY,GAAd,CAAkBR,GAAlB,CAAP;AACD;;IAEDS,SAAc,GAAGF;;ACbjB,IAAId,WAAS,GAAGC,UAAhB;AAAA,IACIgB,GAAG,GAAGC,IADV;AAAA,IAEIC,QAAQ,GAAGC,SAFf;AAIA;;AACA,IAAIC,gBAAgB,GAAG,GAAvB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkBf,GAAlB,EAAuBgB,KAAvB,EAA8B;AAC5B,MAAIf,IAAI,GAAG,KAAKL,QAAhB;;AACA,MAAIK,IAAI,YAAYR,WAApB,EAA+B;AAC7B,QAAIwB,KAAK,GAAGhB,IAAI,CAACL,QAAjB;;AACA,QAAI,CAACc,GAAD,IAASO,KAAK,CAACC,MAAN,GAAeJ,gBAAgB,GAAG,CAA/C,EAAmD;AACjDG,MAAAA,KAAK,CAACE,IAAN,CAAW,CAACnB,GAAD,EAAMgB,KAAN,CAAX;AACA,WAAKnB,IAAL,GAAY,EAAEI,IAAI,CAACJ,IAAnB;AACA,aAAO,IAAP;AACD;;AACDI,IAAAA,IAAI,GAAG,KAAKL,QAAL,GAAgB,IAAIgB,QAAJ,CAAaK,KAAb,CAAvB;AACD;;AACDhB,EAAAA,IAAI,CAACmB,GAAL,CAASpB,GAAT,EAAcgB,KAAd;AACA,OAAKnB,IAAL,GAAYI,IAAI,CAACJ,IAAjB;AACA,SAAO,IAAP;AACD;;IAEDwB,SAAc,GAAGN;;ACjCjB,IAAItB,SAAS,GAAGC,UAAhB;AAAA,IACIC,UAAU,GAAGgB,WADjB;AAAA,IAEIZ,WAAW,GAAGc,YAFlB;AAAA,IAGIT,QAAQ,GAAGkB,SAHf;AAAA,IAIIf,QAAQ,GAAGgB,SAJf;AAAA,IAKIR,QAAQ,GAAGS,SALf;AAOA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,KAAT,CAAeC,OAAf,EAAwB;AACtB,MAAIzB,IAAI,GAAG,KAAKL,QAAL,GAAgB,IAAIH,SAAJ,CAAciC,OAAd,CAA3B;AACA,OAAK7B,IAAL,GAAYI,IAAI,CAACJ,IAAjB;AACD;;;AAGD4B,KAAK,CAACE,SAAN,CAAgBC,KAAhB,GAAwBjC,UAAxB;AACA8B,KAAK,CAACE,SAAN,CAAgB,QAAhB,IAA4B5B,WAA5B;AACA0B,KAAK,CAACE,SAAN,CAAgBtB,GAAhB,GAAsBD,QAAtB;AACAqB,KAAK,CAACE,SAAN,CAAgBnB,GAAhB,GAAsBD,QAAtB;AACAkB,KAAK,CAACE,SAAN,CAAgBP,GAAhB,GAAsBL,QAAtB;IAEAc,MAAc,GAAGJ;;;;;;;;;;;;ACjBjB,SAASK,WAAT,CAAmBC,CAAnB,EAAsBC,QAAtB,EAAgC;AAC9B,MAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACI/B,MAAM,GAAGgC,KAAK,CAACH,CAAD,CADlB;;AAGA,SAAO,EAAEE,KAAF,GAAUF,CAAjB,EAAoB;AAClB7B,IAAAA,MAAM,CAAC+B,KAAD,CAAN,GAAgBD,QAAQ,CAACC,KAAD,CAAxB;AACD;;AACD,SAAO/B,MAAP;AACD;;IAEDiC,UAAc,GAAGL;;ACnBjB,IAAIA,SAAS,GAAGpC,UAAhB;AAAA,IACI0C,WAAW,GAAGzB,aADlB;AAAA,IAEI0B,SAAO,GAAGxB,SAFd;AAAA,IAGIyB,QAAQ,GAAGhB,kBAHf;AAAA,IAIIiB,OAAO,GAAGhB,QAJd;AAAA,IAKIiB,YAAY,GAAGhB,cALnB;AAOA;;AACA,IAAIiB,aAAW,GAAGC,MAAM,CAACf,SAAzB;AAEA;;AACA,IAAIgB,cAAc,GAAGF,aAAW,CAACE,cAAjC;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,eAAT,CAAuB5B,KAAvB,EAA8B6B,SAA9B,EAAyC;AACvC,MAAIC,KAAK,GAAGT,SAAO,CAACrB,KAAD,CAAnB;AAAA,MACI+B,KAAK,GAAG,CAACD,KAAD,IAAUV,WAAW,CAACpB,KAAD,CADjC;AAAA,MAEIgC,MAAM,GAAG,CAACF,KAAD,IAAU,CAACC,KAAX,IAAoBT,QAAQ,CAACtB,KAAD,CAFzC;AAAA,MAGIiC,MAAM,GAAG,CAACH,KAAD,IAAU,CAACC,KAAX,IAAoB,CAACC,MAArB,IAA+BR,YAAY,CAACxB,KAAD,CAHxD;AAAA,MAIIkC,WAAW,GAAGJ,KAAK,IAAIC,KAAT,IAAkBC,MAAlB,IAA4BC,MAJ9C;AAAA,MAKI/C,MAAM,GAAGgD,WAAW,GAAGpB,SAAS,CAACd,KAAK,CAACE,MAAP,EAAeiC,MAAf,CAAZ,GAAqC,EAL7D;AAAA,MAMIjC,MAAM,GAAGhB,MAAM,CAACgB,MANpB;;AAQA,OAAK,IAAIlB,GAAT,IAAgBgB,KAAhB,EAAuB;AACrB,QAAI,CAAC6B,SAAS,IAAIF,cAAc,CAACS,IAAf,CAAoBpC,KAApB,EAA2BhB,GAA3B,CAAd,KACA,EAAEkD,WAAW;AAEVlD,IAAAA,GAAG,IAAI,QAAP;AAECgD,IAAAA,MAAM,KAAKhD,GAAG,IAAI,QAAP,IAAmBA,GAAG,IAAI,QAA/B,CAFP;AAICiD,IAAAA,MAAM,KAAKjD,GAAG,IAAI,QAAP,IAAmBA,GAAG,IAAI,YAA1B,IAA0CA,GAAG,IAAI,YAAtD,CAJP;AAMAuC,IAAAA,OAAO,CAACvC,GAAD,EAAMkB,MAAN,CARG,CAAb,CADJ,EAUQ;AACNhB,MAAAA,MAAM,CAACiB,IAAP,CAAYnB,GAAZ;AACD;AACF;;AACD,SAAOE,MAAP;AACD;;IAEDmD,cAAc,GAAGT;;AChDjB,IAAIA,aAAa,GAAGlD,cAApB;AAAA,IACI4D,QAAQ,GAAG3C,SADf;AAAA,IAEI4C,WAAW,GAAG1C,aAFlB;AAIA;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,SAAS2C,MAAT,CAAcC,MAAd,EAAsB;AACpB,SAAOF,WAAW,CAACE,MAAD,CAAX,GAAsBb,aAAa,CAACa,MAAD,CAAnC,GAA8CH,QAAQ,CAACG,MAAD,CAA7D;AACD;;IAEDC,MAAc,GAAGF;;;;;;;;;;;;AC3BjB,SAASG,aAAT,CAAqBC,KAArB,EAA4BC,SAA5B,EAAuC;AACrC,MAAI5B,KAAK,GAAG,CAAC,CAAb;AAAA,MACIf,MAAM,GAAG0C,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAAC1C,MADvC;AAAA,MAEI4C,QAAQ,GAAG,CAFf;AAAA,MAGI5D,MAAM,GAAG,EAHb;;AAKA,SAAO,EAAE+B,KAAF,GAAUf,MAAjB,EAAyB;AACvB,QAAIF,KAAK,GAAG4C,KAAK,CAAC3B,KAAD,CAAjB;;AACA,QAAI4B,SAAS,CAAC7C,KAAD,EAAQiB,KAAR,EAAe2B,KAAf,CAAb,EAAoC;AAClC1D,MAAAA,MAAM,CAAC4D,QAAQ,EAAT,CAAN,GAAqB9C,KAArB;AACD;AACF;;AACD,SAAOd,MAAP;AACD;;IAED6D,YAAc,GAAGJ;;;;;;;;;;;;;;;;;;;;;ACNjB,SAASK,WAAT,GAAqB;AACnB,SAAO,EAAP;AACD;;IAEDC,WAAc,GAAGD;;ACtBjB,IAAIL,WAAW,GAAGjE,YAAlB;AAAA,IACIsE,SAAS,GAAGrD,WADhB;AAGA;;AACA,IAAI8B,WAAW,GAAGC,MAAM,CAACf,SAAzB;AAEA;;AACA,IAAIuC,oBAAoB,GAAGzB,WAAW,CAACyB,oBAAvC;AAEA;;AACA,IAAIC,gBAAgB,GAAGzB,MAAM,CAAC0B,qBAA9B;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIC,YAAU,GAAG,CAACF,gBAAD,GAAoBH,SAApB,GAAgC,UAASP,MAAT,EAAiB;AAChE,MAAIA,MAAM,IAAI,IAAd,EAAoB;AAClB,WAAO,EAAP;AACD;;AACDA,EAAAA,MAAM,GAAGf,MAAM,CAACe,MAAD,CAAf;AACA,SAAOE,WAAW,CAACQ,gBAAgB,CAACV,MAAD,CAAjB,EAA2B,UAASa,MAAT,EAAiB;AAC5D,WAAOJ,oBAAoB,CAACd,IAArB,CAA0BK,MAA1B,EAAkCa,MAAlC,CAAP;AACD,GAFiB,CAAlB;AAGD,CARD;IAUAC,WAAc,GAAGF;;AC7BjB,IAAIG,SAAS,GAAG9E,UAAhB;AAAA,IACI2C,OAAO,GAAG1B,SADd;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAAS8D,gBAAT,CAAwBhB,MAAxB,EAAgCiB,QAAhC,EAA0CC,WAA1C,EAAuD;AACrD,MAAIzE,MAAM,GAAGwE,QAAQ,CAACjB,MAAD,CAArB;AACA,SAAOpB,OAAO,CAACoB,MAAD,CAAP,GAAkBvD,MAAlB,GAA2BsE,SAAS,CAACtE,MAAD,EAASyE,WAAW,CAAClB,MAAD,CAApB,CAA3C;AACD;;IAEDmB,eAAc,GAAGH;;ACnBjB,IAAIA,cAAc,GAAG/E,eAArB;AAAA,IACI2E,UAAU,GAAG1D,WADjB;AAAA,IAEI6C,IAAI,GAAG3C,MAFX;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASgE,UAAT,CAAoBpB,MAApB,EAA4B;AAC1B,SAAOgB,cAAc,CAAChB,MAAD,EAASD,IAAT,EAAea,UAAf,CAArB;AACD;;IAEDS,WAAc,GAAGD;;ACfjB,IAAIE,IAAI,GAAGrF,KAAX;AAEA;;AACA,IAAIsF,UAAU,GAAGD,IAAI,CAACC,UAAtB;IAEAC,WAAc,GAAGD;;;;"}