tdesign-react 0.17.0 → 0.18.2

package/cjs/_chunks/dep-341fc0a3.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-341fc0a3.js","sources":["../../node_modules/lodash/_getPrototype.js","../../node_modules/lodash/_setCacheAdd.js","../../node_modules/lodash/_setCacheHas.js","../../node_modules/lodash/_SetCache.js","../../node_modules/lodash/_cacheHas.js","../../node_modules/lodash/_baseFindIndex.js","../../node_modules/lodash/_baseIsNaN.js","../../node_modules/lodash/_strictIndexOf.js","../../node_modules/lodash/_baseIndexOf.js","../../node_modules/lodash/_arrayIncludes.js","../../node_modules/lodash/_arrayIncludesWith.js","../../node_modules/lodash/_baseDifference.js","../../node_modules/lodash/_baseRest.js","../../node_modules/lodash/isArrayLikeObject.js","../../node_modules/lodash/difference.js","../../node_modules/lodash/isPlainObject.js","../../src/_common/js/tree/tree-store.ts"],"sourcesContent":["var overArg = require('./_overArg');\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nmodule.exports = getPrototype;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nmodule.exports = setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","var MapCache = require('./_MapCache'),\n    setCacheAdd = require('./_setCacheAdd'),\n    setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\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 cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseFindIndex;\n","/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    arrayMap = require('./_arrayMap'),\n    baseUnary = require('./_baseUnary'),\n    cacheHas = require('./_cacheHas');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\nfunction baseDifference(array, values, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      isCommon = true,\n      length = array.length,\n      result = [],\n      valuesLength = values.length;\n\n  if (!length) {\n    return result;\n  }\n  if (iteratee) {\n    values = arrayMap(values, baseUnary(iteratee));\n  }\n  if (comparator) {\n    includes = arrayIncludesWith;\n    isCommon = false;\n  }\n  else if (values.length >= LARGE_ARRAY_SIZE) {\n    includes = cacheHas;\n    isCommon = false;\n    values = new SetCache(values);\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee == null ? value : iteratee(value);\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var valuesIndex = valuesLength;\n      while (valuesIndex--) {\n        if (values[valuesIndex] === computed) {\n          continue outer;\n        }\n      }\n      result.push(value);\n    }\n    else if (!includes(values, computed, comparator)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseDifference;\n","var identity = require('./identity'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\nmodule.exports = baseRest;\n","var isArrayLike = require('./isArrayLike'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\nmodule.exports = isArrayLikeObject;\n","var baseDifference = require('./_baseDifference'),\n    baseFlatten = require('./_baseFlatten'),\n    baseRest = require('./_baseRest'),\n    isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\nvar difference = baseRest(function(array, values) {\n  return isArrayLikeObject(array)\n    ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n    : [];\n});\n\nmodule.exports = difference;\n","var baseGetTag = require('./_baseGetTag'),\n    getPrototype = require('./_getPrototype'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n  if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n    return false;\n  }\n  var proto = getPrototype(value);\n  if (proto === null) {\n    return true;\n  }\n  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n  return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n    funcToString.call(Ctor) == objectCtorString;\n}\n\nmodule.exports = isPlainObject;\n","import difference from 'lodash/difference';\nimport camelCase from 'lodash/camelCase';\nimport isPlainObject from 'lodash/isPlainObject';\nimport { TreeNode } from './tree-node';\nimport {\n  TreeNodeValue,\n  TypeIdMap,\n  TypeTimer,\n  TypeTargetNode,\n  TypeTreeNodeData,\n  TypeTreeStoreOptions,\n  TypeTreeFilter,\n  TypeTreeFilterOptions,\n  TypeRelatedNodesOptions,\n  TypeTreeEventState,\n} from './types';\n\nfunction parseNodeData(\n  tree: TreeStore,\n  para: TreeNodeValue | TreeNode | TypeTreeNodeData,\n  item: TypeTreeNodeData | TypeTreeNodeData[] | TreeNode,\n) {\n  let value: TreeNodeValue = '';\n  let node = null;\n  let data = null;\n\n  if (typeof para === 'string' || typeof para === 'number') {\n    value = para;\n    data = item;\n    node = tree.getNode(value);\n  } else if (para instanceof TreeNode) {\n    node = para;\n    data = item;\n  } else {\n    data = para;\n  }\n  const spec = {\n    node,\n    data,\n  };\n  return spec;\n}\n\n// 构建一个树的数据模型\n// 基本设计思想：写入时更新，减少读取消耗，以减少未来实现虚拟滚动所需的计算量\n// 任何一次数据写入，会触发相应节点的状态更新\nexport class TreeStore {\n  // 根节点集合\n  public children: TreeNode[];\n\n  // 所有节点集合\n  public nodes: TreeNode[];\n\n  // 所有节点映射\n  public nodeMap: Map<TreeNodeValue, TreeNode>;\n\n  // 配置选项\n  public config: TypeTreeStoreOptions;\n\n  // 活动节点集合\n  public activedMap: TypeIdMap;\n\n  // 数据被更新的节点集合\n  public updatedMap: TypeIdMap;\n\n  // 选中节点集合\n  public checkedMap: TypeIdMap;\n\n  // 展开节点的集合\n  public expandedMap: TypeIdMap;\n\n  // 符合过滤条件的节点的集合\n  public filterMap: TypeIdMap;\n\n  // 数据更新计时器\n  public updateTimer: TypeTimer;\n\n  // 识别是否需要重排\n  public shouldReflow: boolean;\n\n  // 树节点过滤器\n  public prevFilter: TypeTreeFilter;\n\n  public constructor(options: TypeTreeStoreOptions) {\n    const config: TypeTreeStoreOptions = {\n      prefix: 't',\n      keys: {},\n      expandAll: false,\n      expandLevel: 0,\n      expandMutex: false,\n      expandParent: false,\n      activable: false,\n      activeMultiple: false,\n      checkable: false,\n      checkStrictly: false,\n      disabled: false,\n      load: null,\n      lazy: false,\n      valueMode: 'onlyLeaf',\n      filter: null,\n      onLoad: null,\n      onReflow: null,\n      onUpdate: null,\n      ...options,\n    };\n    this.config = config;\n    this.nodes = [];\n    this.children = [];\n    this.nodeMap = new Map();\n    this.activedMap = new Map();\n    this.expandedMap = new Map();\n    this.checkedMap = new Map();\n    this.updatedMap = new Map();\n    this.filterMap = new Map();\n    this.prevFilter = null;\n    // 这个计时器确保频繁的 update 事件被归纳为1次完整数据更新后的触发\n    this.updateTimer = null;\n    // 在子节点增删改查时，将此属性设置为 true，来触发视图更新\n    this.shouldReflow = false;\n  }\n\n  // 配置选项\n  public setConfig(options: TypeTreeStoreOptions) {\n    Object.assign(this.config, options);\n    this.refreshState();\n  }\n\n  // 获取根孩子节点列表\n  public getChildren() {\n    return this.children;\n  }\n\n  // 获取节点对象\n  public getNode(item: TypeTargetNode): TreeNode {\n    let node = null;\n    if (typeof item === 'string' || typeof item === 'number') {\n      node = this.nodeMap.get(item);\n    } else if (item instanceof TreeNode) {\n      node = this.nodeMap.get(item.value);\n    }\n    return node;\n  }\n\n  // 获取节点在总节点列表中的位置\n  public getIndex(node: TreeNode): number {\n    return this.nodes.indexOf(node);\n  }\n\n  // 获取指定节点的父节点\n  public getParent(value: TypeTargetNode): TreeNode {\n    let parent = null;\n    const node = this.getNode(value);\n    if (node) {\n      parent = node.getParent();\n    }\n    return parent;\n  }\n\n  // 获取指定节点的所有父节点\n  public getParents(value: TypeTargetNode): TreeNode[] {\n    const node = this.getNode(value);\n    let parents: TreeNode[] = [];\n    if (node) {\n      parents = node.getParents();\n    }\n    return parents;\n  }\n\n  // 获取指定节点在其所在 children 中的位置\n  public getNodeIndex(value: TypeTargetNode): number {\n    const node = this.getNode(value);\n    let index = -1;\n    if (node) {\n      index = node.getIndex();\n    }\n    return index;\n  }\n\n  // 获取所有符合条件的节点\n  public getNodes(\n    item?: TypeTargetNode,\n    options?: TypeTreeFilterOptions,\n  ): TreeNode[] {\n    let nodes: TreeNode[] = [];\n    let val: TreeNodeValue = '';\n    if (typeof item === 'string' || typeof item === 'number') {\n      val = item;\n    } else if (item instanceof TreeNode) {\n      val = item.value;\n    }\n    if (!val) {\n      nodes = this.nodes.slice(0);\n    } else {\n      const node = this.getNode(val);\n      if (node) {\n        nodes = node.walk();\n      }\n    }\n\n    if (options) {\n      const conf: TypeTreeFilterOptions = {\n        filter: null,\n        level: Infinity,\n        ...options,\n      };\n      if (typeof conf.level === 'number' && conf.level !== Infinity) {\n        nodes = nodes.filter((node) => node.level <= conf.level);\n      }\n      if (typeof conf.filter === 'function') {\n        nodes = nodes.filter((node) => {\n          const nodeModel = node.getModel();\n          return conf.filter(nodeModel);\n        });\n      }\n      if (isPlainObject(conf.props)) {\n        nodes = nodes.filter((node) => {\n          const result = Object.keys(conf.props).every((key) => {\n            const propEqual = node[key] === conf.props[key];\n            return propEqual;\n          });\n          return result;\n        });\n      }\n    }\n    return nodes;\n  }\n\n  // 给树添加节点数据\n  public append(list: TypeTreeNodeData[]): void {\n    list.forEach((item) => {\n      const node = new TreeNode(this, item);\n      this.children.push(node);\n    });\n    this.reflow();\n  }\n\n  // 重新加载数据\n  public reload(list: TypeTreeNodeData[]): void {\n    this.expandedMap.clear();\n    this.checkedMap.clear();\n    this.activedMap.clear();\n    this.filterMap.clear();\n    this.removeAll();\n    this.append(list);\n  }\n\n  /**\n   * 向指定节点追加节点或者数据\n   * 支持下列使用方式\n   * item: 节点数据, TreeNode: 节点实例, value: 节点值(ID)\n   * appendNodes(item)\n   * appendNodes(TreeNode)\n   * appendNodes(value, item)\n   * appendNodes(value, TreeNode)\n   * appendNodes(TreeNode, item)\n   * appendNodes(TreeNode, TreeNode)\n   */\n  public appendNodes(\n    para?: TypeTargetNode | TypeTreeNodeData,\n    item?: TypeTreeNodeData | TreeNode,\n  ): void {\n    const spec = parseNodeData(this, para, item);\n    if (spec.data) {\n      if (!spec.node) {\n        // 在根节点插入\n        if (spec.data instanceof TreeNode) {\n          spec.data.appendTo(this);\n        } else if (Array.isArray(spec.data)) {\n          this.append(spec.data);\n        } else {\n          this.append([spec.data]);\n        }\n      } else {\n        // 插入到目标节点之下\n        if (spec.data instanceof TreeNode) {\n          spec.data.appendTo(this, spec.node);\n        } else if (Array.isArray(spec.data)) {\n          spec.node.append(spec.data);\n        } else {\n          spec.node.append([spec.data]);\n        }\n        spec.node.updateRelated();\n      }\n    }\n  }\n\n  // 在目标节点之前插入节点\n  public insertBefore(value: TypeTargetNode, item: TypeTreeNodeData): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.insertBefore(item);\n    }\n  }\n\n  // 在目标节点之后插入节点\n  public insertAfter(value: TypeTargetNode, item: TypeTreeNodeData): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.insertAfter(item);\n    }\n  }\n\n  // 更新树结构\n  // 清空 nodes 数组，然后遍历所有根节点重新插入 node\n  public refreshNodes(): void {\n    const { children, nodes } = this;\n    nodes.length = 0;\n    children.forEach((node) => {\n      const list = node.walk();\n      Array.prototype.push.apply(nodes, list);\n    });\n  }\n\n  // 更新所有树节点状态\n  public refreshState(): void {\n    const { nodes } = this;\n    nodes.forEach((node) => {\n      node.update();\n      node.updateChecked();\n    });\n  }\n\n  // 节点重排\n  // 应该仅在树节点增删改查时调用\n  public reflow(node?: TreeNode): void {\n    this.shouldReflow = true;\n    this.updated(node);\n  }\n\n  // 触发更新事件\n  // 节点属性变更时调用\n  public updated(node?: TreeNode): void {\n    if (node?.value) {\n      this.updatedMap.set(node.value, true);\n    }\n    if (this.updateTimer) return;\n    this.updateTimer = +setTimeout(() => {\n      clearTimeout(this.updateTimer);\n      this.updateTimer = null;\n\n      // 检查节点是否需要回流，重排数组\n      if (this.shouldReflow) {\n        this.refreshNodes();\n        this.emit('reflow');\n      }\n\n      // 检查节点是否有被过滤，锁定路径节点\n      // 在此之前要遍历节点生成一个经过排序的节点数组\n      // 以便于优化锁定检查算法\n      this.lockFilterPathNodes();\n\n      const updatedList = Array.from(this.updatedMap.keys());\n      if (updatedList.length > 0) {\n        // 统计需要更新状态的节点，派发更新事件\n        const updatedNodes = updatedList.map((value) => this.getNode(value));\n        this.emit('update', {\n          nodes: updatedNodes,\n          map: this.updatedMap,\n        });\n      } else if (this.shouldReflow) {\n        // 单纯的回流不需要更新节点状态\n        // 但需要触发更新事件\n        this.emit('update', {\n          nodes: [],\n          map: this.updatedMap,\n        });\n      }\n\n      // 每次回流检查完毕，还原检查状态\n      this.shouldReflow = false;\n      this.updatedMap.clear();\n    });\n  }\n\n  // 获取激活节点集合\n  public getActived(map?: TypeIdMap): TreeNodeValue[] {\n    const activedMap = map || this.activedMap;\n    return Array.from(activedMap.keys());\n  }\n\n  // 获取指定范围的高亮节点\n  public getActivedNodes(item?: TypeTargetNode): TreeNode[] {\n    let nodes = this.getNodes(item);\n    nodes = nodes.filter((node) => node.isActived());\n    return nodes;\n  }\n\n  // 替换激活态\n  public replaceActived(list: TreeNodeValue[]): void {\n    this.resetActived();\n    this.setActived(list);\n  }\n\n  // 设置激活态\n  public setActived(actived: TreeNodeValue[]): void {\n    const { activeMultiple } = this.config;\n    const list = actived.slice(0);\n    if (!activeMultiple) {\n      list.length = 1;\n    }\n    list.forEach((val) => {\n      this.activedMap.set(val, true);\n      const node = this.getNode(val);\n      if (node) {\n        node.update();\n      }\n    });\n  }\n\n  // 重置激活态\n  public resetActived(): void {\n    const actived = this.getActived();\n    this.activedMap.clear();\n    const relatedNodes = this.getRelatedNodes(actived);\n    relatedNodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  // 获取展开节点集合\n  public getExpanded(map?: TypeIdMap): TreeNodeValue[] {\n    const expandedMap = map || this.expandedMap;\n    return Array.from(expandedMap.keys());\n  }\n\n  // 替换展开节点\n  public replaceExpanded(list: TreeNodeValue[]): void {\n    const expanded = this.getExpanded();\n    const added = difference(list, expanded);\n    const removed = difference(expanded, list);\n    this.setExpandedDirectly(removed, false);\n    this.updateExpanded(removed);\n    this.setExpanded(added);\n  }\n\n  // 批量设置展开节点\n  public setExpanded(list: TreeNodeValue[]): void {\n    this.setExpandedDirectly(list);\n    this.updateExpanded(list);\n  }\n\n  // 直接设置展开节点数据，不更新节点状态\n  public setExpandedDirectly(list: TreeNodeValue[], expanded = true): void {\n    list.forEach((val) => {\n      if (expanded) {\n        this.expandedMap.set(val, true);\n        const node = this.getNode(val);\n        if (node) {\n          node.afterExpanded();\n        }\n      } else {\n        this.expandedMap.delete(val);\n      }\n    });\n  }\n\n  // 清除所有展开节点\n  public resetExpanded(): void {\n    const expanded = this.getExpanded();\n    this.expandedMap.clear();\n    this.updateExpanded(expanded);\n  }\n\n  // 更新展开节点相关节点的状态\n  public updateExpanded(list: TreeNodeValue[]): void {\n    const relatedNodes = this.getRelatedNodes(list, {\n      withParents: false,\n    });\n    relatedNodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  // 获取选中态节点 value 数组\n  public getChecked(map?: TypeIdMap): TreeNodeValue[] {\n    const { nodes, config } = this;\n    const { valueMode, checkStrictly } = config;\n    const list: TreeNodeValue[] = [];\n    const checkedMap = map || this.checkedMap;\n    nodes.forEach((node) => {\n      if (node.isChecked(checkedMap)) {\n        if (valueMode === 'parentFirst' && !checkStrictly) {\n          if (!node.parent || !node.parent.isChecked(checkedMap)) {\n            list.push(node.value);\n          }\n        } else if (valueMode === 'onlyLeaf' && !checkStrictly) {\n          if (node.isLeaf()) {\n            list.push(node.value);\n          }\n        } else {\n          list.push(node.value);\n        }\n      }\n    });\n    return list;\n  }\n\n  // 获取指定节点下的选中节点\n  public getCheckedNodes(item?: TypeTargetNode): TreeNode[] {\n    let nodes = this.getNodes(item);\n    nodes = nodes.filter((node) => node.isChecked());\n    return nodes;\n  }\n\n  // 替换选中态列表\n  public replaceChecked(list: TreeNodeValue[]): void {\n    this.resetChecked();\n    this.setChecked(list);\n  }\n\n  // 批量设置选中态\n  public setChecked(list: TreeNodeValue[]): void {\n    const { valueMode, checkStrictly, checkable } = this.config;\n    if (!checkable) return;\n    list.forEach((val: TreeNodeValue) => {\n      const node = this.getNode(val);\n      if (node) {\n        if (valueMode === 'parentFirst' && !checkStrictly) {\n          const childrenNodes = node.walk();\n          childrenNodes.forEach((childNode) => {\n            this.checkedMap.set(childNode.value, true);\n          });\n        } else {\n          this.checkedMap.set(val, true);\n          node.updateChecked();\n        }\n      }\n    });\n    if (!checkStrictly) {\n      const checked = this.getChecked();\n      const relatedNodes = this.getRelatedNodes(checked);\n      relatedNodes.forEach((node) => {\n        node.updateChecked();\n      });\n    }\n  }\n\n  // 清除所有选中节点\n  public resetChecked(): void {\n    const checked = this.getChecked();\n    const relatedNodes = this.getRelatedNodes(checked);\n    this.checkedMap.clear();\n    relatedNodes.forEach((node) => {\n      node.updateChecked();\n    });\n  }\n\n  // 更新全部节点状态\n  public updateAll(): void {\n    const nodes = this.getNodes();\n    nodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  // 移除指定节点\n  public remove(value?: TypeTargetNode): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.remove();\n    }\n  }\n\n  // 清空所有节点\n  public removeAll(): void {\n    const nodes = this.getNodes();\n    nodes.forEach((node) => {\n      node.remove();\n    });\n  }\n\n  // 获取节点状态变化可能影响的周边节点\n  // 实现最小遍历集合\n  public getRelatedNodes(\n    list: TreeNodeValue[],\n    options?: TypeRelatedNodesOptions,\n  ): TreeNode[] {\n    const conf = {\n      withParents: true,\n      ...options,\n    };\n    const map = new Map();\n    list.forEach((value) => {\n      if (map.get(value)) return;\n      const node = this.getNode(value);\n      if (node) {\n        const parents = node.getParents();\n        const children = node.walk();\n        let related = [];\n        if (conf.withParents) {\n          related = parents.concat(children);\n        } else {\n          related = children;\n        }\n        related.forEach((relatedNode) => {\n          map.set(relatedNode.value, relatedNode);\n        });\n      }\n    });\n    const relatedNodes = Array.from(map.values());\n    return relatedNodes;\n  }\n\n  // 触发绑定的事件\n  public emit(name: string, state?: TypeTreeEventState): void {\n    const config = this.config || {};\n    const methodName = camelCase(`on-${name}`);\n    const method = config[methodName];\n    if (typeof method === 'function') {\n      method(state);\n    }\n  }\n\n  // 锁定过滤节点的路径节点\n  // 使得路径节点展开，可见，且不可操作\n  public lockFilterPathNodes() {\n    const {\n      config,\n      filterMap,\n    } = this;\n\n    // 之前没有设置过过滤器\n    // 当前也没有过滤器\n    // 则无需处理锁定节点\n    if (!config.filter && !this.prevFilter) {\n      return;\n    }\n    this.prevFilter = config.filter;\n\n    const allNodes = this.getNodes();\n    allNodes.forEach((node: TreeNode) => {\n      node.lock(false);\n    });\n    if (allNodes.length === filterMap.size) {\n      // 未经任何过滤，则无需处理锁定节点\n      return;\n    }\n\n    // 构造路径节点map\n    const map = new Map();\n\n    // 全部节点要经过排序，才能使用这个算法\n    // 比起每个过滤节点调用 getParents 方法检查父节点状态\n    // 算法复杂度 O(N*log(N)) => O(N)\n    allNodes.reverse().forEach((item: TreeNode) => {\n      const node = item;\n\n      // 被过滤节点父节点固定为展开状态\n      const parent = node.getParent();\n      if (node.vmIsRest) {\n        if (parent) {\n          parent.expanded = true;\n        }\n        // 被过滤节点固定为展示状态\n        node.visible = true;\n      }\n      if (node.vmIsRest || map.get(node.value)) {\n        if (parent && !parent.vmIsRest) {\n          map.set(parent.value, true);\n        }\n      }\n    });\n\n    // 锁定路径节点展示样式\n    const filterPathValues = Array.from(map.keys());\n    filterPathValues.forEach((value: TreeNodeValue) => {\n      const node = this.getNode(value);\n      if (node) {\n        node.lock(true);\n      }\n    });\n  }\n}\n\nexport default TreeStore;\n"],"names":["overArg","require$$0","getPrototype","Object","getPrototypeOf","_getPrototype","HASH_UNDEFINED","setCacheAdd","value","__data__","set","_setCacheAdd","setCacheHas","has","_setCacheHas","MapCache","require$$1","require$$2","SetCache","values","index","length","add","prototype","push","_SetCache","cacheHas","cache","key","_cacheHas","baseFindIndex","array","predicate","fromIndex","fromRight","_baseFindIndex","baseIsNaN","_baseIsNaN","strictIndexOf","_strictIndexOf","baseIndexOf","_baseIndexOf","arrayIncludes","_arrayIncludes","arrayIncludesWith","comparator","_arrayIncludesWith","arrayMap","require$$3","baseUnary","require$$4","require$$5","LARGE_ARRAY_SIZE","baseDifference","iteratee","includes","isCommon","result","valuesLength","outer","computed","valuesIndex","_baseDifference","identity","overRest","setToString","baseRest","func","start","_baseRest","isArrayLike","isObjectLike","isArrayLikeObject","isArrayLikeObject_1","baseFlatten","difference","difference_1","baseGetTag","objectTag","funcProto","Function","objectProto","funcToString","toString","hasOwnProperty","objectCtorString","call","isPlainObject","proto","Ctor","constructor","isPlainObject_1","tree","para","item","node","data","getNode","TreeNode","spec","options","config","prefix","keys","expandAll","expandLevel","expandMutex","expandParent","activable","activeMultiple","checkable","checkStrictly","disabled","load","lazy","valueMode","filter","onLoad","onReflow","onUpdate","nodes","children","nodeMap","Map","activedMap","expandedMap","checkedMap","updatedMap","filterMap","prevFilter","updateTimer","shouldReflow","assign","refreshState","get","indexOf","parent","getParent","parents","getParents","getIndex","val","slice","walk","conf","level","Infinity","nodeModel","getModel","props","every","propEqual","list","forEach","reflow","clear","removeAll","append","parseNodeData","appendTo","Array","isArray","updateRelated","insertBefore","insertAfter","apply","update","updateChecked","updated","setTimeout","refreshNodes","emit","lockFilterPathNodes","updatedList","from","updatedNodes","map","getNodes","isActived","resetActived","setActived","actived","getActived","relatedNodes","getRelatedNodes","expanded","getExpanded","added","removed","setExpandedDirectly","updateExpanded","setExpanded","afterExpanded","withParents","isChecked","isLeaf","resetChecked","setChecked","childrenNodes","childNode","checked","getChecked","remove","related","concat","relatedNode","name","state","methodName","camelCase","method","allNodes","lock","size","reverse","vmIsRest","visible","filterPathValues"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,IAAIA,OAAO,GAAGC,iBAAd;AAEA;;AACA,IAAIC,cAAY,GAAGF,OAAO,CAACG,MAAM,CAACC,cAAR,EAAwBD,MAAxB,CAA1B;IAEAE,aAAc,GAAGH;;;ACJjB,IAAII,cAAc,GAAG,2BAArB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,aAAT,CAAqBC,KAArB,EAA4B;AAC1B,OAAKC,QAAL,CAAcC,GAAd,CAAkBF,KAAlB,EAAyBF,cAAzB;;AACA,SAAO,IAAP;AACD;;IAEDK,YAAc,GAAGJ;;;;;;;;;;;;ACTjB,SAASK,aAAT,CAAqBJ,KAArB,EAA4B;AAC1B,SAAO,KAAKC,QAAL,CAAcI,GAAd,CAAkBL,KAAlB,CAAP;AACD;;IAEDM,YAAc,GAAGF;;ACbjB,IAAIG,QAAQ,GAAGd,kBAAf;AAAA,IACIM,WAAW,GAAGS,YADlB;AAAA,IAEIJ,WAAW,GAAGK,YAFlB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkBC,MAAlB,EAA0B;AACxB,MAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGF,MAAM,IAAI,IAAV,GAAiB,CAAjB,GAAqBA,MAAM,CAACE,MADzC;AAGA,OAAKZ,QAAL,GAAgB,IAAIM,QAAJ,EAAhB;;AACA,SAAO,EAAEK,KAAF,GAAUC,MAAjB,EAAyB;AACvB,SAAKC,GAAL,CAASH,MAAM,CAACC,KAAD,CAAf;AACD;AACF;;;AAGDF,UAAQ,CAACK,SAAT,CAAmBD,GAAnB,GAAyBJ,UAAQ,CAACK,SAAT,CAAmBC,IAAnB,GAA0BjB,WAAnD;AACAW,UAAQ,CAACK,SAAT,CAAmBV,GAAnB,GAAyBD,WAAzB;IAEAa,SAAc,GAAGP;;;;;;;;;;;AClBjB,SAASQ,UAAT,CAAkBC,KAAlB,EAAyBC,GAAzB,EAA8B;AAC5B,SAAOD,KAAK,CAACd,GAAN,CAAUe,GAAV,CAAP;AACD;;IAEDC,SAAc,GAAGH;;;;;;;;;;;;;;ACDjB,SAASI,eAAT,CAAuBC,KAAvB,EAA8BC,SAA9B,EAAyCC,SAAzC,EAAoDC,SAApD,EAA+D;AAC7D,MAAIb,MAAM,GAAGU,KAAK,CAACV,MAAnB;AAAA,MACID,KAAK,GAAGa,SAAS,IAAIC,SAAS,GAAG,CAAH,GAAO,CAAC,CAArB,CADrB;;AAGA,SAAQA,SAAS,GAAGd,KAAK,EAAR,GAAa,EAAEA,KAAF,GAAUC,MAAxC,EAAiD;AAC/C,QAAIW,SAAS,CAACD,KAAK,CAACX,KAAD,CAAN,EAAeA,KAAf,EAAsBW,KAAtB,CAAb,EAA2C;AACzC,aAAOX,KAAP;AACD;AACF;;AACD,SAAO,CAAC,CAAR;AACD;;IAEDe,cAAc,GAAGL;;;;;;;;;;AChBjB,SAASM,WAAT,CAAmB5B,KAAnB,EAA0B;AACxB,SAAOA,KAAK,KAAKA,KAAjB;AACD;;IAED6B,UAAc,GAAGD;;;;;;;;;;;;;ACDjB,SAASE,eAAT,CAAuBP,KAAvB,EAA8BvB,KAA9B,EAAqCyB,SAArC,EAAgD;AAC9C,MAAIb,KAAK,GAAGa,SAAS,GAAG,CAAxB;AAAA,MACIZ,MAAM,GAAGU,KAAK,CAACV,MADnB;;AAGA,SAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIU,KAAK,CAACX,KAAD,CAAL,KAAiBZ,KAArB,EAA4B;AAC1B,aAAOY,KAAP;AACD;AACF;;AACD,SAAO,CAAC,CAAR;AACD;;IAEDmB,cAAc,GAAGD;;ACtBjB,IAAIR,aAAa,GAAG7B,cAApB;AAAA,IACImC,SAAS,GAAGpB,UADhB;AAAA,IAEIsB,aAAa,GAAGrB,cAFpB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASuB,aAAT,CAAqBT,KAArB,EAA4BvB,KAA5B,EAAmCyB,SAAnC,EAA8C;AAC5C,SAAOzB,KAAK,KAAKA,KAAV,GACH8B,aAAa,CAACP,KAAD,EAAQvB,KAAR,EAAeyB,SAAf,CADV,GAEHH,aAAa,CAACC,KAAD,EAAQK,SAAR,EAAmBH,SAAnB,CAFjB;AAGD;;IAEDQ,YAAc,GAAGD;;ACnBjB,IAAIA,WAAW,GAAGvC,YAAlB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASyC,eAAT,CAAuBX,KAAvB,EAA8BvB,KAA9B,EAAqC;AACnC,MAAIa,MAAM,GAAGU,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACV,MAAvC;AACA,SAAO,CAAC,CAACA,MAAF,IAAYmB,WAAW,CAACT,KAAD,EAAQvB,KAAR,EAAe,CAAf,CAAX,GAA+B,CAAC,CAAnD;AACD;;IAEDmC,cAAc,GAAGD;;;;;;;;;;;;ACPjB,SAASE,mBAAT,CAA2Bb,KAA3B,EAAkCvB,KAAlC,EAAyCqC,UAAzC,EAAqD;AACnD,MAAIzB,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGU,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACV,MADvC;;AAGA,SAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIwB,UAAU,CAACrC,KAAD,EAAQuB,KAAK,CAACX,KAAD,CAAb,CAAd,EAAqC;AACnC,aAAO,IAAP;AACD;AACF;;AACD,SAAO,KAAP;AACD;;IAED0B,kBAAc,GAAGF;;ACrBjB,IAAI1B,QAAQ,GAAGjB,SAAf;AAAA,IACIyC,aAAa,GAAG1B,cADpB;AAAA,IAEI4B,iBAAiB,GAAG3B,kBAFxB;AAAA,IAGI8B,QAAQ,GAAGC,kBAHf;AAAA,IAIIC,SAAS,GAAGC,mBAJhB;AAAA,IAKIxB,QAAQ,GAAGyB,SALf;AAOA;;AACA,IAAIC,gBAAgB,GAAG,GAAvB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,gBAAT,CAAwBtB,KAAxB,EAA+BZ,MAA/B,EAAuCmC,QAAvC,EAAiDT,UAAjD,EAA6D;AAC3D,MAAIzB,KAAK,GAAG,CAAC,CAAb;AAAA,MACImC,QAAQ,GAAGb,aADf;AAAA,MAEIc,QAAQ,GAAG,IAFf;AAAA,MAGInC,MAAM,GAAGU,KAAK,CAACV,MAHnB;AAAA,MAIIoC,MAAM,GAAG,EAJb;AAAA,MAKIC,YAAY,GAAGvC,MAAM,CAACE,MAL1B;;AAOA,MAAI,CAACA,MAAL,EAAa;AACX,WAAOoC,MAAP;AACD;;AACD,MAAIH,QAAJ,EAAc;AACZnC,IAAAA,MAAM,GAAG4B,QAAQ,CAAC5B,MAAD,EAAS8B,SAAS,CAACK,QAAD,CAAlB,CAAjB;AACD;;AACD,MAAIT,UAAJ,EAAgB;AACdU,IAAAA,QAAQ,GAAGX,iBAAX;AACAY,IAAAA,QAAQ,GAAG,KAAX;AACD,GAHD,MAIK,IAAIrC,MAAM,CAACE,MAAP,IAAiB+B,gBAArB,EAAuC;AAC1CG,IAAAA,QAAQ,GAAG7B,QAAX;AACA8B,IAAAA,QAAQ,GAAG,KAAX;AACArC,IAAAA,MAAM,GAAG,IAAID,QAAJ,CAAaC,MAAb,CAAT;AACD;;AACDwC,EAAAA,KAAK,EACL,OAAO,EAAEvC,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIb,KAAK,GAAGuB,KAAK,CAACX,KAAD,CAAjB;AAAA,QACIwC,QAAQ,GAAGN,QAAQ,IAAI,IAAZ,GAAmB9C,KAAnB,GAA2B8C,QAAQ,CAAC9C,KAAD,CADlD;AAGAA,IAAAA,KAAK,GAAIqC,UAAU,IAAIrC,KAAK,KAAK,CAAzB,GAA8BA,KAA9B,GAAsC,CAA9C;;AACA,QAAIgD,QAAQ,IAAII,QAAQ,KAAKA,QAA7B,EAAuC;AACrC,UAAIC,WAAW,GAAGH,YAAlB;;AACA,aAAOG,WAAW,EAAlB,EAAsB;AACpB,YAAI1C,MAAM,CAAC0C,WAAD,CAAN,KAAwBD,QAA5B,EAAsC;AACpC,mBAASD,KAAT;AACD;AACF;;AACDF,MAAAA,MAAM,CAACjC,IAAP,CAAYhB,KAAZ;AACD,KARD,MASK,IAAI,CAAC+C,QAAQ,CAACpC,MAAD,EAASyC,QAAT,EAAmBf,UAAnB,CAAb,EAA6C;AAChDY,MAAAA,MAAM,CAACjC,IAAP,CAAYhB,KAAZ;AACD;AACF;;AACD,SAAOiD,MAAP;AACD;;IAEDK,eAAc,GAAGT;;AClEjB,IAAIU,QAAQ,GAAG9D,wCAAf;AAAA,IACI+D,QAAQ,GAAGhD,uCADf;AAAA,IAEIiD,WAAW,GAAGhD,0CAFlB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASiD,UAAT,CAAkBC,IAAlB,EAAwBC,KAAxB,EAA+B;AAC7B,SAAOH,WAAW,CAACD,QAAQ,CAACG,IAAD,EAAOC,KAAP,EAAcL,QAAd,CAAT,EAAkCI,IAAI,GAAG,EAAzC,CAAlB;AACD;;IAEDE,SAAc,GAAGH;;AChBjB,IAAII,WAAW,GAAGrE,2BAAlB;AAAA,IACIsE,cAAY,GAAGvD,6BADnB;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASwD,mBAAT,CAA2BhE,KAA3B,EAAkC;AAChC,SAAO+D,cAAY,CAAC/D,KAAD,CAAZ,IAAuB8D,WAAW,CAAC9D,KAAD,CAAzC;AACD;;IAEDiE,mBAAc,GAAGD;;AChCjB,IAAInB,cAAc,GAAGpD,eAArB;AAAA,IACIyE,WAAW,GAAG1D,oBADlB;AAAA,IAEIkD,QAAQ,GAAGjD,SAFf;AAAA,IAGIuD,iBAAiB,GAAGxB,mBAHxB;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAI2B,UAAU,GAAGT,QAAQ,CAAC,UAASnC,KAAT,EAAgBZ,MAAhB,EAAwB;AAChD,SAAOqD,iBAAiB,CAACzC,KAAD,CAAjB,GACHsB,cAAc,CAACtB,KAAD,EAAQ2C,WAAW,CAACvD,MAAD,EAAS,CAAT,EAAYqD,iBAAZ,EAA+B,IAA/B,CAAnB,CADX,GAEH,EAFJ;AAGD,CAJwB,CAAzB;IAMAI,YAAc,GAAGD;;AChCjB,IAAIE,UAAU,GAAG5E,uBAAjB;AAAA,IACIC,YAAY,GAAGc,aADnB;AAAA,IAEIuD,YAAY,GAAGtD,6BAFnB;AAIA;;AACA,IAAI6D,SAAS,GAAG,iBAAhB;AAEA;;AACA,IAAIC,SAAS,GAAGC,QAAQ,CAACzD,SAAzB;AAAA,IACI0D,WAAW,GAAG9E,MAAM,CAACoB,SADzB;AAGA;;AACA,IAAI2D,YAAY,GAAGH,SAAS,CAACI,QAA7B;AAEA;;AACA,IAAIC,cAAc,GAAGH,WAAW,CAACG,cAAjC;AAEA;;AACA,IAAIC,gBAAgB,GAAGH,YAAY,CAACI,IAAb,CAAkBnF,MAAlB,CAAvB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASoF,aAAT,CAAuB/E,KAAvB,EAA8B;AAC5B,MAAI,CAAC+D,YAAY,CAAC/D,KAAD,CAAb,IAAwBqE,UAAU,CAACrE,KAAD,CAAV,IAAqBsE,SAAjD,EAA4D;AAC1D,WAAO,KAAP;AACD;;AACD,MAAIU,KAAK,GAAGtF,YAAY,CAACM,KAAD,CAAxB;;AACA,MAAIgF,KAAK,KAAK,IAAd,EAAoB;AAClB,WAAO,IAAP;AACD;;AACD,MAAIC,IAAI,GAAGL,cAAc,CAACE,IAAf,CAAoBE,KAApB,EAA2B,aAA3B,KAA6CA,KAAK,CAACE,WAA9D;AACA,SAAO,OAAOD,IAAP,IAAe,UAAf,IAA6BA,IAAI,YAAYA,IAA7C,IACLP,YAAY,CAACI,IAAb,CAAkBG,IAAlB,KAA2BJ,gBAD7B;AAED;;IAEDM,eAAc,GAAGJ;;;;;;AC5CjB,sBAAA,CACEK,IADF,EAEEC,IAFF,EAGEC,IAHF,EAIE;MACItF,QAAuB;MACvBuF,OAAO;MACPC,OAAO;;MAEP,OAAOH,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,UAAU;YAChDA;WACDC;WACAF,KAAKK,OAAL,CAAazF,KAAb;aACEqF,gBAAgBK,mCAAU;WAC5BL;WACAC;SACF;WACED;;;MAEHM,OAAO;AACXJ,IAAAA,MAAAA,IADW;AAEXC,IAAAA,MAAAA;AAFW;SAING;;;aAMF;AAqCE,qBAAYC,OAAZ,EAA2C;AAAA;;QAC1CC;AACJC,MAAAA,QAAQ;AACRC,MAAAA,MAAM;AACNC,MAAAA,WAAW;AACXC,MAAAA,aAAa;AACbC,MAAAA,aAAa;AACbC,MAAAA,cAAc;AACdC,MAAAA,WAAW;AACXC,MAAAA,gBAAgB;AAChBC,MAAAA,WAAW;AACXC,MAAAA,eAAe;AACfC,MAAAA,UAAU;AACVC,MAAAA,MAAM;AACNC,MAAAA,MAAM;AACNC,MAAAA,WAAW;AACXC,MAAAA,QAAQ;AACRC,MAAAA,QAAQ;AACRC,MAAAA,UAAU;AACVC,MAAAA,UAAU;OACPnB;;SAEAC,SAASA;SACTmB,QAAQ;SACRC,WAAW;SACXC,UAAU,IAAIC,GAAJ;SACVC,aAAa,IAAID,GAAJ;SACbE,cAAc,IAAIF,GAAJ;SACdG,aAAa,IAAIH,GAAJ;SACbI,aAAa,IAAIJ,GAAJ;SACbK,YAAY,IAAIL,GAAJ;SACZM,aAAa;SAEbC,cAAc;SAEdC,eAAe;;;AAxEjB;AAAA;AAAA,WA4EE,mBAAU/B,OAAV,EAAyC;aACvCgC,OAAO,KAAK/B,QAAQD;WACtBiC;;AA9EF;AAAA;AAAA,WAkFE,uBAAc;aACZ,KAAKZ;;AAnFT;AAAA;AAAA,WAuFE,iBAAQ3B,IAAR,EAAwC;UACzCC,OAAO;;UACP,OAAOD,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,UAAU;eACjD,KAAK4B,OAAL,CAAaY,GAAb,CAAiBxC,IAAjB;iBACEA,gBAAgBI,mCAAU;eAC5B,KAAKwB,OAAL,CAAaY,GAAb,CAAiBxC,KAAKtF,KAAtB;;;aAEFuF;;AA9FJ;AAAA;AAAA,WAkGE,kBAASA,IAAT,EAAiC;aAC/B,KAAKyB,KAAL,CAAWe,OAAX,CAAmBxC,IAAnB;;AAnGJ;AAAA;AAAA,WAuGE,mBAAUvF,KAAV,EAA2C;UAC5CgI,SAAS;UACPzC,OAAO,KAAKE,OAAL,CAAazF,KAAb;;UACTuF,MAAM;iBACCA,KAAK0C,SAAL;;;aAEJD;;AA7GJ;AAAA;AAAA,WAiHE,oBAAWhI,KAAX,EAA8C;UAC7CuF,OAAO,KAAKE,OAAL,CAAazF,KAAb;UACTkI,UAAsB;;UACtB3C,MAAM;kBACEA,KAAK4C,UAAL;;;aAELD;;AAvHJ;AAAA;AAAA,WA2HE,sBAAalI,KAAb,EAA4C;UAC3CuF,OAAO,KAAKE,OAAL,CAAazF,KAAb;UACTY,QAAQ;;UACR2E,MAAM;gBACAA,KAAK6C,QAAL;;;aAEHxH;;AAjIJ;AAAA;AAAA,WAqIE,kBACL0E,IADK,EAELM,OAFK,EAGO;UACRoB,QAAoB;UACpBqB,MAAqB;;UACrB,OAAO/C,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,UAAU;cAClDA;iBACGA,gBAAgBI,mCAAU;cAC7BJ,KAAKtF;;;UAET,CAACqI,KAAK;gBACA,KAAKrB,KAAL,CAAWsB,KAAX,CAAiB,CAAjB;aACH;YACC/C,OAAO,KAAKE,OAAL,CAAa4C,GAAb;;YACT9C,MAAM;kBACAA,KAAKgD,IAAL;;;;UAIR3C,SAAS;YACL4C;AACJ5B,UAAAA,QAAQ;AACR6B,UAAAA,OAAOC;WACJ9C;;YAED,OAAO4C,KAAKC,KAAZ,KAAsB,QAAtB,IAAkCD,KAAKC,KAAL,KAAeC,UAAU;kBACrD1B,MAAMJ,MAAN,CAAa,UAACrB,IAAD;AAAA,mBAAUA,KAAKkD,KAAL,IAAcD,KAAKC,KAA7B;AAAA,WAAb;;;YAEN,OAAOD,KAAK5B,MAAZ,KAAuB,YAAY;kBAC7BI,MAAMJ,MAAN,CAAa,UAACrB,IAAD,EAAU;gBACvBoD,YAAYpD,KAAKqD,QAAL;mBACXJ,KAAK5B,MAAL,CAAY+B,SAAZ;WAFD;;;YAKN5D,gBAAcyD,KAAKK,QAAQ;kBACrB7B,MAAMJ,MAAN,CAAa,UAACrB,IAAD,EAAU;gBACvBtC,SAAStD,OAAOoG,IAAP,CAAYyC,KAAKK,KAAjB,EAAwBC,KAAxB,CAA8B,UAAC1H,GAAD,EAAS;kBAC9C2H,YAAYxD,KAAKnE,IAAL,KAAcoH,KAAKK,KAAL,CAAWzH,GAAX;qBACzB2H;aAFM;mBAIR9F;WALD;;;;aASL+D;;AAlLJ;AAAA;AAAA,WAsLE,gBAAOgC,IAAP,EAAuC;AAAA;;WACvCC,QAAQ,UAAC3D,IAAD,EAAU;YACfC,OAAO,IAAIG,iCAAJ,CAAa,KAAb,EAAmBJ,IAAnB;;cACR2B,SAASjG,KAAKuE;;WAEhB2D;;AA3LF;AAAA;AAAA,WA+LE,gBAAOF,IAAP,EAAuC;WACvC3B,YAAY8B;WACZ7B,WAAW6B;WACX/B,WAAW+B;WACX3B,UAAU2B;WACVC;WACAC,OAAOL;;AArMT;AAAA;AAAA,WAmNE,qBACL3D,IADK,EAELC,IAFK,EAGC;UACAK,OAAO2D,cAAc,MAAMjE,MAAMC;;UACnCK,KAAKH,MAAM;YACT,CAACG,KAAKJ,MAAM;cAEVI,KAAKH,IAAL,YAAqBE,mCAAU;iBAC5BF,KAAK+D,SAAS;qBACVC,MAAMC,OAAN,CAAc9D,KAAKH,IAAnB,GAA0B;iBAC9B6D,OAAO1D,KAAKH;iBACZ;iBACA6D,OAAO,CAAC1D,KAAKH,IAAN;;eAET;cAEDG,KAAKH,IAAL,YAAqBE,mCAAU;iBAC5BF,KAAK+D,SAAS,MAAM5D,KAAKJ;qBACrBiE,MAAMC,OAAN,CAAc9D,KAAKH,IAAnB,GAA0B;iBAC9BD,KAAK8D,OAAO1D,KAAKH;iBACjB;iBACAD,KAAK8D,OAAO,CAAC1D,KAAKH,IAAN;;;eAEdD,KAAKmE;;;;AA3OX;AAAA;AAAA,WAiPE,sBAAa1J,KAAb,EAAoCsF,IAApC,EAAkE;UACjEC,OAAO,KAAKE,OAAL,CAAazF,KAAb;;UACTuF,MAAM;aACHoE,aAAarE;;;AApPjB;AAAA;AAAA,WAyPE,qBAAYtF,KAAZ,EAAmCsF,IAAnC,EAAiE;UAChEC,OAAO,KAAKE,OAAL,CAAazF,KAAb;;UACTuF,MAAM;aACHqE,YAAYtE;;;AA5PhB;AAAA;AAAA,WAkQE,wBAAqB;UAClB2B,WAAoB,KAApBA;UAAUD,QAAU,KAAVA;YACZnG,SAAS;eACNoI,QAAQ,UAAC1D,IAAD,EAAU;YACnByD,OAAOzD,KAAKgD,IAAL;cACPxH,UAAUC,KAAK6I,MAAM7C,OAAOgC;;;AAvQjC;AAAA;AAAA,WA4QE,wBAAqB;UAClBhC,QAAU,KAAVA;YACFiC,QAAQ,UAAC1D,IAAD,EAAU;aACjBuE;aACAC;;;AAhRJ;AAAA;AAAA,WAsRE,gBAAOxE,IAAP,EAA8B;WAC9BoC,eAAe;WACfqC,QAAQzE;;AAxRV;AAAA;AAAA,WA6RE,iBAAQA,IAAR,EAA+B;AAAA;;UAChCA,iBAAAA,mBAAAA,KAAMvF,OAAO;aACVuH,WAAWrH,IAAIqF,KAAKvF,OAAO;;;UAE9B,KAAK0H;WACJA,cAAc,CAACuC,WAAW,YAAM;qBACtB,OAAKvC;eACbA,cAAc;;YAGf,OAAKC,cAAc;iBAChBuC;;iBACAC,KAAK;;;eAMPC;;YAECC,cAAcb,MAAMc,IAAN,CAAW,OAAK/C,UAAL,CAAgBxB,IAAhB,EAAX;;YAChBsE,YAAYxJ,MAAZ,GAAqB,GAAG;cAEpB0J,eAAeF,YAAYG,GAAZ,CAAgB,UAACxK,KAAD;AAAA,mBAAW,OAAKyF,OAAL,CAAazF,KAAb,CAAX;AAAA,WAAhB;;iBAChBmK,KAAK,UAAU;AAClBnD,YAAAA,OAAOuD,YADW;AAElBC,YAAAA,KAAK,OAAKjD;AAFQ;mBAIX,OAAKI,cAAc;iBAGvBwC,KAAK,UAAU;AAClBnD,YAAAA,OAAO,EADW;AAElBwD,YAAAA,KAAK,OAAKjD;AAFQ;;;eAOjBI,eAAe;;eACfJ,WAAW4B;;;AApUf;AAAA;AAAA,WAyUE,oBAAWqB,GAAX,EAA6C;UAC5CpD,aAAaoD,OAAO,KAAKpD;aACxBoC,MAAMc,IAAN,CAAWlD,WAAWrB,IAAX,EAAX;;AA3UJ;AAAA;AAAA,WA+UE,yBAAgBT,IAAhB,EAAmD;UACpD0B,QAAQ,KAAKyD,QAAL,CAAcnF,IAAd;cACJ0B,MAAMJ,MAAN,CAAa,UAACrB,IAAD;AAAA,eAAUA,KAAKmF,SAAL,EAAV;AAAA,OAAb;aACD1D;;AAlVJ;AAAA;AAAA,WAsVE,wBAAegC,IAAf,EAA4C;WAC5C2B;WACAC,WAAW5B;;AAxVb;AAAA;AAAA,WA4VE,oBAAW6B,OAAX,EAA2C;AAAA;;UACxCxE,iBAAmB,KAAKR,OAAxBQ;UACF2C,OAAO6B,QAAQvC,KAAR,CAAc,CAAd;;UACT,CAACjC,gBAAgB;aACdxF,SAAS;;;WAEXoI,QAAQ,UAACZ,GAAD,EAAS;eACfjB,WAAWlH,IAAImI,KAAK;;YACnB9C,OAAO,OAAKE,OAAL,CAAa4C,GAAb;;YACT9C,MAAM;eACHuE;;;;AAtWN;AAAA;AAAA,WA4WE,wBAAqB;UACpBe,UAAU,KAAKC,UAAL;WACX1D,WAAW+B;UACV4B,eAAe,KAAKC,eAAL,CAAqBH,OAArB;mBACR5B,QAAQ,UAAC1D,IAAD,EAAU;aACxBuE;;;AAjXJ;AAAA;AAAA,WAsXE,qBAAYU,GAAZ,EAA8C;UAC7CnD,cAAcmD,OAAO,KAAKnD;aACzBmC,MAAMc,IAAN,CAAWjD,YAAYtB,IAAZ,EAAX;;AAxXJ;AAAA;AAAA,WA4XE,yBAAgBiD,IAAhB,EAA6C;UAC5CiC,WAAW,KAAKC,WAAL;UACXC,QAAQhH,aAAW6E,MAAMiC;UACzBG,UAAUjH,aAAW8G,UAAUjC;WAChCqC,oBAAoBD,SAAS;WAC7BE,eAAeF;WACfG,YAAYJ;;AAlYd;AAAA;AAAA,WAsYE,qBAAYnC,IAAZ,EAAyC;WACzCqC,oBAAoBrC;WACpBsC,eAAetC;;AAxYjB;AAAA;AAAA,WA4YE,6BAAoBA,IAApB,EAAkE;AAAA;;AAAA,UAAvBiC,QAAuB,uEAAZ,IAAY;WAClEhC,QAAQ,UAACZ,GAAD,EAAS;YAChB4C,UAAU;iBACP5D,YAAYnH,IAAImI,KAAK;;cACpB9C,OAAO,OAAKE,OAAL,CAAa4C,GAAb;;cACT9C,MAAM;iBACHiG;;eAEF;iBACAnE,sBAAmBgB;;;;AArZzB;AAAA;AAAA,WA2ZE,yBAAsB;UACrB4C,WAAW,KAAKC,WAAL;WACZ7D,YAAY8B;WACZmC,eAAeL;;AA9ZjB;AAAA;AAAA,WAkaE,wBAAejC,IAAf,EAA4C;UAC3C+B,eAAe,KAAKC,eAAL,CAAqBhC,IAArB,EAA2B;AAC9CyC,QAAAA,aAAa;AADiC,OAA3B;mBAGRxC,QAAQ,UAAC1D,IAAD,EAAU;aACxBuE;;;AAvaJ;AAAA;AAAA,WA4aE,oBAAWU,GAAX,EAA6C;UAC1CxD,QAAkB,KAAlBA;UAAOnB,SAAW,KAAXA;UACPc,YAA6Bd,OAA7Bc;UAAWJ,gBAAkBV,OAAlBU;UACbyC,OAAwB;UACxB1B,aAAakD,OAAO,KAAKlD;YACzB2B,QAAQ,UAAC1D,IAAD,EAAU;YAClBA,KAAKmG,SAAL,CAAepE,UAAf,GAA4B;cAC1BX,cAAc,aAAd,IAA+B,CAACJ,eAAe;gBAC7C,CAAChB,KAAKyC,MAAN,IAAgB,CAACzC,KAAKyC,MAAL,CAAY0D,SAAZ,CAAsBpE,UAAtB,GAAmC;mBACjDtG,KAAKuE,KAAKvF;;qBAER2G,cAAc,UAAd,IAA4B,CAACJ,eAAe;gBACjDhB,KAAKoG,MAAL,IAAe;mBACZ3K,KAAKuE,KAAKvF;;iBAEZ;iBACAgB,KAAKuE,KAAKvF;;;;aAIdgJ;;AAhcJ;AAAA;AAAA,WAocE,yBAAgB1D,IAAhB,EAAmD;UACpD0B,QAAQ,KAAKyD,QAAL,CAAcnF,IAAd;cACJ0B,MAAMJ,MAAN,CAAa,UAACrB,IAAD;AAAA,eAAUA,KAAKmG,SAAL,EAAV;AAAA,OAAb;aACD1E;;AAvcJ;AAAA;AAAA,WA2cE,wBAAegC,IAAf,EAA4C;WAC5C4C;WACAC,WAAW7C;;AA7cb;AAAA;AAAA,WAidE,oBAAWA,IAAX,EAAwC;AAAA;;yBACG,KAAKnD;UAA7Cc,yBAAAA;UAAWJ,6BAAAA;UAAeD,yBAAAA;UAC9B,CAACA;WACA2C,QAAQ,UAACZ,GAAD,EAAwB;YAC7B9C,OAAO,OAAKE,OAAL,CAAa4C,GAAb;;YACT9C,MAAM;cACJoB,cAAc,aAAd,IAA+B,CAACJ,eAAe;gBAC3CuF,gBAAgBvG,KAAKgD,IAAL;0BACRU,QAAQ,UAAC8C,SAAD,EAAe;qBAC9BzE,WAAWpH,IAAI6L,UAAU/L,OAAO;;iBAElC;mBACAsH,WAAWpH,IAAImI,KAAK;;iBACpB0B;;;;;UAIP,CAACxD,eAAe;YACZyF,UAAU,KAAKC,UAAL;YACVlB,eAAe,KAAKC,eAAL,CAAqBgB,OAArB;qBACR/C,QAAQ,UAAC1D,IAAD,EAAU;eACxBwE;;;;AAteN;AAAA;AAAA,WA4eE,wBAAqB;UACpBiC,UAAU,KAAKC,UAAL;UACVlB,eAAe,KAAKC,eAAL,CAAqBgB,OAArB;WAChB1E,WAAW6B;mBACHF,QAAQ,UAAC1D,IAAD,EAAU;aACxBwE;;;AAjfJ;AAAA;AAAA,WAsfE,qBAAkB;UACjB/C,QAAQ,KAAKyD,QAAL;YACRxB,QAAQ,UAAC1D,IAAD,EAAU;aACjBuE;;;AAzfJ;AAAA;AAAA,WA8fE,gBAAO9J,KAAP,EAAqC;UACpCuF,OAAO,KAAKE,OAAL,CAAazF,KAAb;;UACTuF,MAAM;aACH2G;;;AAjgBJ;AAAA;AAAA,WAsgBE,qBAAkB;UACjBlF,QAAQ,KAAKyD,QAAL;YACRxB,QAAQ,UAAC1D,IAAD,EAAU;aACjB2G;;;AAzgBJ;AAAA;AAAA,WA+gBE,yBACLlD,IADK,EAELpD,OAFK,EAGO;AAAA;;UACN4C;AACJiD,QAAAA,aAAa;SACV7F;;UAEC4E,MAAM,IAAIrD,GAAJ;WACP8B,QAAQ,UAACjJ,KAAD,EAAW;YAClBwK,IAAI1C,GAAJ,CAAQ9H,KAAR;;YACEuF,OAAO,OAAKE,OAAL,CAAazF,KAAb;;YACTuF,MAAM;cACF2C,UAAU3C,KAAK4C,UAAL;cACVlB,WAAW1B,KAAKgD,IAAL;cACb4D,UAAU;;cACV3D,KAAKiD,aAAa;sBACVvD,QAAQkE,MAAR,CAAenF,QAAf;iBACL;sBACKA;;;kBAEJgC,QAAQ,UAACoD,WAAD,EAAiB;gBAC3BnM,IAAImM,YAAYrM,OAAOqM;;;;UAI3BtB,eAAevB,MAAMc,IAAN,CAAWE,IAAI7J,MAAJ,EAAX;aACdoK;;AA1iBJ;AAAA;AAAA,WA8iBE,cAAKuB,IAAL,EAAmBC,KAAnB,EAAqD;UACpD1G,SAAS,KAAKA,MAAL,IAAe;UACxB2G,aAAaC,mCAAgBH;UAC7BI,SAAS7G,OAAO2G;;UAClB,OAAOE,MAAP,KAAkB,YAAY;eACzBH;;;AAnjBN;AAAA;AAAA,WAyjBE,+BAAsB;AAAA;;UAEzB1G,SAEE,KAFFA;UACA2B,YACE,KADFA;;UAME,CAAC3B,OAAOe,MAAR,IAAkB,CAAC,KAAKa,YAAY;;;;WAGnCA,aAAa5B,OAAOe;UAEnB+F,WAAW,KAAKlC,QAAL;eACRxB,QAAQ,UAAC1D,IAAD,EAAoB;aAC9BqH,KAAK;;;UAERD,SAAS9L,MAAT,KAAoB2G,UAAUqF,MAAM;;;;UAMlCrC,MAAM,IAAIrD,GAAJ;eAKH2F,UAAU7D,QAAQ,UAAC3D,IAAD,EAAoB;YACvCC,OAAOD;YAGP0C,SAASzC,KAAK0C,SAAL;;YACX1C,KAAKwH,UAAU;cACb/E,QAAQ;mBACHiD,WAAW;;;eAGf+B,UAAU;;;YAEbzH,KAAKwH,QAAL,IAAiBvC,IAAI1C,GAAJ,CAAQvC,KAAKvF,KAAb,GAAqB;cACpCgI,UAAU,CAACA,OAAO+E,UAAU;gBAC1B7M,IAAI8H,OAAOhI,OAAO;;;;UAMtBiN,mBAAmBzD,MAAMc,IAAN,CAAWE,IAAIzE,IAAJ,EAAX;uBACRkD,QAAQ,UAACjJ,KAAD,EAA0B;YAC3CuF,OAAO,OAAKE,OAAL,CAAazF,KAAb;;YACTuF,MAAM;eACHqH,KAAK;;;;AA9mBX;;AAAA;AAAA;;;;;;;"}

package/cjs/_chunks/dep-4484c339.js

@@ -1,46 +0,0 @@
-/**
- * tdesign v0.17.0
- * (c) 2021 tdesign
- * @license MIT
- */
-
-'use strict';
-
-var _baseGet = require('./dep-72731322.js');
-
-var baseGet = _baseGet._baseGet;
-/**
- * Gets the value at `path` of `object`. If the resolved value is
- * `undefined`, the `defaultValue` is returned in its place.
- *
- * @static
- * @memberOf _
- * @since 3.7.0
- * @category Object
- * @param {Object} object The object to query.
- * @param {Array|string} path The path of the property to get.
- * @param {*} [defaultValue] The value returned for `undefined` resolved values.
- * @returns {*} Returns the resolved value.
- * @example
- *
- * var object = { 'a': [{ 'b': { 'c': 3 } }] };
- *
- * _.get(object, 'a[0].b.c');
- * // => 3
- *
- * _.get(object, ['a', '0', 'b', 'c']);
- * // => 3
- *
- * _.get(object, 'a.b.c', 'default');
- * // => 'default'
- */
-
-function get(object, path, defaultValue) {
-  var result = object == null ? undefined : baseGet(object, path);
-  return result === undefined ? defaultValue : result;
-}
-
-var get_1 = get;
-
-exports.get_1 = get_1;
-//# sourceMappingURL=dep-4484c339.js.map

package/cjs/_chunks/dep-4484c339.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-4484c339.js","sources":["../../node_modules/lodash/get.js"],"sourcesContent":["var baseGet = require('./_baseGet');\n\n/**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\nfunction get(object, path, defaultValue) {\n  var result = object == null ? undefined : baseGet(object, path);\n  return result === undefined ? defaultValue : result;\n}\n\nmodule.exports = get;\n"],"names":["baseGet","require$$0","get","object","path","defaultValue","result","undefined","get_1"],"mappings":";;;;;;;;;;AAAA,IAAIA,OAAO,GAAGC,iBAAd;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,SAASC,GAAT,CAAaC,MAAb,EAAqBC,IAArB,EAA2BC,YAA3B,EAAyC;AACvC,MAAIC,MAAM,GAAGH,MAAM,IAAI,IAAV,GAAiBI,SAAjB,GAA6BP,OAAO,CAACG,MAAD,EAASC,IAAT,CAAjD;AACA,SAAOE,MAAM,KAAKC,SAAX,GAAuBF,YAAvB,GAAsCC,MAA7C;AACD;;IAEDE,KAAc,GAAGN;;;;"}

package/cjs/_chunks/dep-44e119d1.js

@@ -1,110 +0,0 @@
-/**
- * tdesign v0.17.0
- * (c) 2021 tdesign
- * @license MIT
- */
-
-'use strict';
-
-var _baseGetTag = require('./dep-e3c11611.js');
-var isArray$1 = require('./dep-8b42f281.js');
-var isSymbol$1 = require('./dep-04587b3a.js');
-
-/**
- * A specialized version of `_.map` for arrays without support for iteratee
- * shorthands.
- *
- * @private
- * @param {Array} [array] The array to iterate over.
- * @param {Function} iteratee The function invoked per iteration.
- * @returns {Array} Returns the new mapped array.
- */
-
-function arrayMap$1(array, iteratee) {
-  var index = -1,
-      length = array == null ? 0 : array.length,
-      result = Array(length);
-
-  while (++index < length) {
-    result[index] = iteratee(array[index], index, array);
-  }
-
-  return result;
-}
-
-var _arrayMap = arrayMap$1;
-
-var _Symbol = _baseGetTag._Symbol,
-    arrayMap = _arrayMap,
-    isArray = isArray$1.isArray_1,
-    isSymbol = isSymbol$1.isSymbol_1;
-/** Used as references for various `Number` constants. */
-
-var INFINITY = 1 / 0;
-/** Used to convert symbols to primitives and strings. */
-
-var symbolProto = _Symbol ? _Symbol.prototype : undefined,
-    symbolToString = symbolProto ? symbolProto.toString : undefined;
-/**
- * The base implementation of `_.toString` which doesn't convert nullish
- * values to empty strings.
- *
- * @private
- * @param {*} value The value to process.
- * @returns {string} Returns the string.
- */
-
-function baseToString$1(value) {
-  // Exit early for strings to avoid a performance hit in some environments.
-  if (typeof value == 'string') {
-    return value;
-  }
-
-  if (isArray(value)) {
-    // Recursively convert values (susceptible to call stack limits).
-    return arrayMap(value, baseToString$1) + '';
-  }
-
-  if (isSymbol(value)) {
-    return symbolToString ? symbolToString.call(value) : '';
-  }
-
-  var result = value + '';
-  return result == '0' && 1 / value == -INFINITY ? '-0' : result;
-}
-
-var _baseToString = baseToString$1;
-
-var baseToString = _baseToString;
-/**
- * Converts `value` to a string. An empty string is returned for `null`
- * and `undefined` values. The sign of `-0` is preserved.
- *
- * @static
- * @memberOf _
- * @since 4.0.0
- * @category Lang
- * @param {*} value The value to convert.
- * @returns {string} Returns the converted string.
- * @example
- *
- * _.toString(null);
- * // => ''
- *
- * _.toString(-0);
- * // => '-0'
- *
- * _.toString([1, 2, 3]);
- * // => '1,2,3'
- */
-
-function toString(value) {
-  return value == null ? '' : baseToString(value);
-}
-
-var toString_1 = toString;
-
-exports._arrayMap = _arrayMap;
-exports._baseToString = _baseToString;
-exports.toString_1 = toString_1;
-//# sourceMappingURL=dep-44e119d1.js.map

package/cjs/_chunks/dep-44e119d1.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-44e119d1.js","sources":["../../node_modules/lodash/_arrayMap.js","../../node_modules/lodash/_baseToString.js","../../node_modules/lodash/toString.js"],"sourcesContent":["/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nmodule.exports = arrayMap;\n","var Symbol = require('./_Symbol'),\n    arrayMap = require('./_arrayMap'),\n    isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n","var baseToString = require('./_baseToString');\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nmodule.exports = toString;\n"],"names":["arrayMap","array","iteratee","index","length","result","Array","_arrayMap","Symbol","require$$0","require$$1","isArray","require$$2","isSymbol","require$$3","INFINITY","symbolProto","prototype","undefined","symbolToString","toString","baseToString","value","call","_baseToString","toString_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AASA,SAASA,UAAT,CAAkBC,KAAlB,EAAyBC,QAAzB,EAAmC;AACjC,MAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGH,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACG,MADvC;AAAA,MAEIC,MAAM,GAAGC,KAAK,CAACF,MAAD,CAFlB;;AAIA,SAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;AACvBC,IAAAA,MAAM,CAACF,KAAD,CAAN,GAAgBD,QAAQ,CAACD,KAAK,CAACE,KAAD,CAAN,EAAeA,KAAf,EAAsBF,KAAtB,CAAxB;AACD;;AACD,SAAOI,MAAP;AACD;;IAEDE,SAAc,GAAGP;;ACpBjB,IAAIQ,OAAM,GAAGC,mBAAb;AAAA,IACIT,QAAQ,GAAGU,SADf;AAAA,IAEIC,OAAO,GAAGC,mBAFd;AAAA,IAGIC,QAAQ,GAAGC,qBAHf;AAKA;;AACA,IAAIC,QAAQ,GAAG,IAAI,CAAnB;AAEA;;AACA,IAAIC,WAAW,GAAGR,OAAM,GAAGA,OAAM,CAACS,SAAV,GAAsBC,SAA9C;AAAA,IACIC,cAAc,GAAGH,WAAW,GAAGA,WAAW,CAACI,QAAf,GAA0BF,SAD1D;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASG,cAAT,CAAsBC,KAAtB,EAA6B;;AAE3B,MAAI,OAAOA,KAAP,IAAgB,QAApB,EAA8B;AAC5B,WAAOA,KAAP;AACD;;AACD,MAAIX,OAAO,CAACW,KAAD,CAAX,EAAoB;;AAElB,WAAOtB,QAAQ,CAACsB,KAAD,EAAQD,cAAR,CAAR,GAAgC,EAAvC;AACD;;AACD,MAAIR,QAAQ,CAACS,KAAD,CAAZ,EAAqB;AACnB,WAAOH,cAAc,GAAGA,cAAc,CAACI,IAAf,CAAoBD,KAApB,CAAH,GAAgC,EAArD;AACD;;AACD,MAAIjB,MAAM,GAAIiB,KAAK,GAAG,EAAtB;AACA,SAAQjB,MAAM,IAAI,GAAV,IAAkB,IAAIiB,KAAL,IAAe,CAACP,QAAlC,GAA8C,IAA9C,GAAqDV,MAA5D;AACD;;IAEDmB,aAAc,GAAGH;;ACpCjB,IAAIA,YAAY,GAAGZ,aAAnB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASW,QAAT,CAAkBE,KAAlB,EAAyB;AACvB,SAAOA,KAAK,IAAI,IAAT,GAAgB,EAAhB,GAAqBD,YAAY,CAACC,KAAD,CAAxC;AACD;;IAEDG,UAAc,GAAGL;;;;;;"}

package/cjs/_chunks/dep-4dd68199.js

@@ -1,47 +0,0 @@
-/**
- * tdesign v0.17.0
- * (c) 2021 tdesign
- * @license MIT
- */
-
-'use strict';
-
-var _typeof = require('./dep-18990b3e.js');
-var eq$1 = require('./dep-bd49604b.js');
-var isArrayLike$1 = require('./dep-1c56c0c1.js');
-var _isIndex = require('./dep-58e09809.js');
-var isObject$1 = require('./dep-dc9b08b7.js');
-
-var eq = eq$1.eq_1,
-    isArrayLike = isArrayLike$1.isArrayLike_1,
-    isIndex = _isIndex._isIndex,
-    isObject = isObject$1.isObject_1;
-/**
- * Checks if the given arguments are from an iteratee call.
- *
- * @private
- * @param {*} value The potential iteratee value argument.
- * @param {*} index The potential iteratee index or key argument.
- * @param {*} object The potential iteratee object argument.
- * @returns {boolean} Returns `true` if the arguments are from an iteratee call,
- *  else `false`.
- */
-
-function isIterateeCall(value, index, object) {
-  if (!isObject(object)) {
-    return false;
-  }
-
-  var type = _typeof._typeof(index);
-
-  if (type == 'number' ? isArrayLike(object) && isIndex(index, object.length) : type == 'string' && index in object) {
-    return eq(object[index], value);
-  }
-
-  return false;
-}
-
-var _isIterateeCall = isIterateeCall;
-
-exports._isIterateeCall = _isIterateeCall;
-//# sourceMappingURL=dep-4dd68199.js.map

package/cjs/_chunks/dep-4dd68199.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-4dd68199.js","sources":["../../node_modules/lodash/_isIterateeCall.js"],"sourcesContent":["var eq = require('./eq'),\n    isArrayLike = require('./isArrayLike'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject');\n\n/**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n *  else `false`.\n */\nfunction isIterateeCall(value, index, object) {\n  if (!isObject(object)) {\n    return false;\n  }\n  var type = typeof index;\n  if (type == 'number'\n        ? (isArrayLike(object) && isIndex(index, object.length))\n        : (type == 'string' && index in object)\n      ) {\n    return eq(object[index], value);\n  }\n  return false;\n}\n\nmodule.exports = isIterateeCall;\n"],"names":["eq","require$$0","isArrayLike","require$$1","isIndex","require$$2","isObject","require$$3","isIterateeCall","value","index","object","type","length","_isIterateeCall"],"mappings":";;;;;;;;;;;;;;AAAA,IAAIA,EAAE,GAAGC,SAAT;AAAA,IACIC,WAAW,GAAGC,2BADlB;AAAA,IAEIC,OAAO,GAAGC,iBAFd;AAAA,IAGIC,QAAQ,GAAGC,qBAHf;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,cAAT,CAAwBC,KAAxB,EAA+BC,KAA/B,EAAsCC,MAAtC,EAA8C;AAC5C,MAAI,CAACL,QAAQ,CAACK,MAAD,CAAb,EAAuB;AACrB,WAAO,KAAP;AACD;;AACD,MAAIC,IAAI,mBAAUF,KAAV,CAAR;;AACA,MAAIE,IAAI,IAAI,QAAR,GACKV,WAAW,CAACS,MAAD,CAAX,IAAuBP,OAAO,CAACM,KAAD,EAAQC,MAAM,CAACE,MAAf,CADnC,GAEKD,IAAI,IAAI,QAAR,IAAoBF,KAAK,IAAIC,MAFtC,EAGM;AACJ,WAAOX,EAAE,CAACW,MAAM,CAACD,KAAD,CAAP,EAAgBD,KAAhB,CAAT;AACD;;AACD,SAAO,KAAP;AACD;;IAEDK,eAAc,GAAGN;;;;"}

package/cjs/_chunks/dep-4ffbaf14.js

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

package/cjs/_chunks/dep-4ffbaf14.js.map

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

package/cjs/_chunks/dep-58e09809.js

@@ -1,34 +0,0 @@
-/**
- * tdesign v0.17.0
- * (c) 2021 tdesign
- * @license MIT
- */
-
-'use strict';
-
-var _typeof = require('./dep-18990b3e.js');
-
-var MAX_SAFE_INTEGER = 9007199254740991;
-/** Used to detect unsigned integer values. */
-
-var reIsUint = /^(?:0|[1-9]\d*)$/;
-/**
- * Checks if `value` is a valid array-like index.
- *
- * @private
- * @param {*} value The value to check.
- * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
- * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
- */
-
-function isIndex(value, length) {
-  var type = _typeof._typeof(value);
-
-  length = length == null ? MAX_SAFE_INTEGER : length;
-  return !!length && (type == 'number' || type != 'symbol' && reIsUint.test(value)) && value > -1 && value % 1 == 0 && value < length;
-}
-
-var _isIndex = isIndex;
-
-exports._isIndex = _isIndex;
-//# sourceMappingURL=dep-58e09809.js.map

package/cjs/_chunks/dep-58e09809.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-58e09809.js","sources":["../../node_modules/lodash/_isIndex.js"],"sourcesContent":["/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nmodule.exports = isIndex;\n"],"names":["MAX_SAFE_INTEGER","reIsUint","isIndex","value","length","type","test","_isIndex"],"mappings":";;;;;;;;;;AACA,IAAIA,gBAAgB,GAAG,gBAAvB;AAEA;;AACA,IAAIC,QAAQ,GAAG,kBAAf;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,OAAT,CAAiBC,KAAjB,EAAwBC,MAAxB,EAAgC;AAC9B,MAAIC,IAAI,mBAAUF,KAAV,CAAR;;AACAC,EAAAA,MAAM,GAAGA,MAAM,IAAI,IAAV,GAAiBJ,gBAAjB,GAAoCI,MAA7C;AAEA,SAAO,CAAC,CAACA,MAAF,KACJC,IAAI,IAAI,QAAR,IACEA,IAAI,IAAI,QAAR,IAAoBJ,QAAQ,CAACK,IAAT,CAAcH,KAAd,CAFlB,KAGAA,KAAK,GAAG,CAAC,CAAT,IAAcA,KAAK,GAAG,CAAR,IAAa,CAA3B,IAAgCA,KAAK,GAAGC,MAH/C;AAID;;IAEDG,QAAc,GAAGL;;;;"}

package/cjs/_chunks/dep-5bf14784.js

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

package/cjs/_chunks/dep-5bf14784.js.map

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

package/cjs/_chunks/dep-645869f2.js

@@ -1,47 +0,0 @@
-/**
- * tdesign v0.17.0
- * (c) 2021 tdesign
- * @license MIT
- */
-
-'use strict';
-
-/**
- * The base implementation of `_.slice` without an iteratee call guard.
- *
- * @private
- * @param {Array} array The array to slice.
- * @param {number} [start=0] The start position.
- * @param {number} [end=array.length] The end position.
- * @returns {Array} Returns the slice of `array`.
- */
-
-function baseSlice(array, start, end) {
-  var index = -1,
-      length = array.length;
-
-  if (start < 0) {
-    start = -start > length ? 0 : length + start;
-  }
-
-  end = end > length ? length : end;
-
-  if (end < 0) {
-    end += length;
-  }
-
-  length = start > end ? 0 : end - start >>> 0;
-  start >>>= 0;
-  var result = Array(length);
-
-  while (++index < length) {
-    result[index] = array[index + start];
-  }
-
-  return result;
-}
-
-var _baseSlice = baseSlice;
-
-exports._baseSlice = _baseSlice;
-//# sourceMappingURL=dep-645869f2.js.map