tdesign-react 0.17.0 → 0.18.2

package/lib/_chunks/dep-fc7e0774.js

@@ -0,0 +1,1112 @@
+/**
+ * tdesign v0.18.2
+ * (c) 2021 tdesign
+ * @license MIT
+ */
+
+import { _ as _defineProperty } from './dep-efe7433b.js';
+import { _ as _createClass, T as TreeNode, a as _classCallCheck } from './dep-7c923347.js';
+import { b as _MapCache } from './dep-a573ca40.js';
+import { _ as _arrayMap } from './dep-79cd2b4c.js';
+import { a as _overArg, _ as _baseUnary } from './dep-c6319c67.js';
+import { a as _baseFlatten } from './dep-52c068bd.js';
+import { b as _overRest, c as _setToString, i as identity_1 } from './dep-55f421f1.js';
+import { i as isArrayLike_1 } from './dep-d5ea2e86.js';
+import { i as isObjectLike_1 } from './dep-4c6e8221.js';
+import { c as camelCase_1 } from './dep-9df99dbb.js';
+import { _ as _baseGetTag } from './dep-f879eead.js';
+
+var overArg = _overArg;
+/** Built-in value references. */
+
+var getPrototype$1 = overArg(Object.getPrototypeOf, Object);
+var _getPrototype = getPrototype$1;
+
+/** Used to stand-in for `undefined` hash values. */
+var HASH_UNDEFINED = '__lodash_hash_undefined__';
+/**
+ * Adds `value` to the array cache.
+ *
+ * @private
+ * @name add
+ * @memberOf SetCache
+ * @alias push
+ * @param {*} value The value to cache.
+ * @returns {Object} Returns the cache instance.
+ */
+
+function setCacheAdd$1(value) {
+  this.__data__.set(value, HASH_UNDEFINED);
+
+  return this;
+}
+
+var _setCacheAdd = setCacheAdd$1;
+
+/**
+ * Checks if `value` is in the array cache.
+ *
+ * @private
+ * @name has
+ * @memberOf SetCache
+ * @param {*} value The value to search for.
+ * @returns {number} Returns `true` if `value` is found, else `false`.
+ */
+
+function setCacheHas$1(value) {
+  return this.__data__.has(value);
+}
+
+var _setCacheHas = setCacheHas$1;
+
+var MapCache = _MapCache,
+    setCacheAdd = _setCacheAdd,
+    setCacheHas = _setCacheHas;
+/**
+ *
+ * Creates an array cache object to store unique values.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [values] The values to cache.
+ */
+
+function SetCache$1(values) {
+  var index = -1,
+      length = values == null ? 0 : values.length;
+  this.__data__ = new MapCache();
+
+  while (++index < length) {
+    this.add(values[index]);
+  }
+} // Add methods to `SetCache`.
+
+
+SetCache$1.prototype.add = SetCache$1.prototype.push = setCacheAdd;
+SetCache$1.prototype.has = setCacheHas;
+var _SetCache = SetCache$1;
+
+/**
+ * Checks if a `cache` value for `key` exists.
+ *
+ * @private
+ * @param {Object} cache The cache to query.
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+
+function cacheHas$1(cache, key) {
+  return cache.has(key);
+}
+
+var _cacheHas = cacheHas$1;
+
+/**
+ * The base implementation of `_.findIndex` and `_.findLastIndex` without
+ * support for iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} predicate The function invoked per iteration.
+ * @param {number} fromIndex The index to search from.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+
+function baseFindIndex$1(array, predicate, fromIndex, fromRight) {
+  var length = array.length,
+      index = fromIndex + (fromRight ? 1 : -1);
+
+  while (fromRight ? index-- : ++index < length) {
+    if (predicate(array[index], index, array)) {
+      return index;
+    }
+  }
+
+  return -1;
+}
+
+var _baseFindIndex = baseFindIndex$1;
+
+/**
+ * The base implementation of `_.isNaN` without support for number objects.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
+ */
+
+function baseIsNaN$1(value) {
+  return value !== value;
+}
+
+var _baseIsNaN = baseIsNaN$1;
+
+/**
+ * A specialized version of `_.indexOf` which performs strict equality
+ * comparisons of values, i.e. `===`.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+
+function strictIndexOf$1(array, value, fromIndex) {
+  var index = fromIndex - 1,
+      length = array.length;
+
+  while (++index < length) {
+    if (array[index] === value) {
+      return index;
+    }
+  }
+
+  return -1;
+}
+
+var _strictIndexOf = strictIndexOf$1;
+
+var baseFindIndex = _baseFindIndex,
+    baseIsNaN = _baseIsNaN,
+    strictIndexOf = _strictIndexOf;
+/**
+ * The base implementation of `_.indexOf` without `fromIndex` bounds checks.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+
+function baseIndexOf$1(array, value, fromIndex) {
+  return value === value ? strictIndexOf(array, value, fromIndex) : baseFindIndex(array, baseIsNaN, fromIndex);
+}
+
+var _baseIndexOf = baseIndexOf$1;
+
+var baseIndexOf = _baseIndexOf;
+/**
+ * A specialized version of `_.includes` for arrays without support for
+ * specifying an index to search from.
+ *
+ * @private
+ * @param {Array} [array] The array to inspect.
+ * @param {*} target The value to search for.
+ * @returns {boolean} Returns `true` if `target` is found, else `false`.
+ */
+
+function arrayIncludes$1(array, value) {
+  var length = array == null ? 0 : array.length;
+  return !!length && baseIndexOf(array, value, 0) > -1;
+}
+
+var _arrayIncludes = arrayIncludes$1;
+
+/**
+ * This function is like `arrayIncludes` except that it accepts a comparator.
+ *
+ * @private
+ * @param {Array} [array] The array to inspect.
+ * @param {*} target The value to search for.
+ * @param {Function} comparator The comparator invoked per element.
+ * @returns {boolean} Returns `true` if `target` is found, else `false`.
+ */
+
+function arrayIncludesWith$1(array, value, comparator) {
+  var index = -1,
+      length = array == null ? 0 : array.length;
+
+  while (++index < length) {
+    if (comparator(value, array[index])) {
+      return true;
+    }
+  }
+
+  return false;
+}
+
+var _arrayIncludesWith = arrayIncludesWith$1;
+
+var SetCache = _SetCache,
+    arrayIncludes = _arrayIncludes,
+    arrayIncludesWith = _arrayIncludesWith,
+    arrayMap = _arrayMap,
+    baseUnary = _baseUnary,
+    cacheHas = _cacheHas;
+/** Used as the size to enable large array optimizations. */
+
+var LARGE_ARRAY_SIZE = 200;
+/**
+ * The base implementation of methods like `_.difference` without support
+ * for excluding multiple arrays or iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Array} values The values to exclude.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of filtered values.
+ */
+
+function baseDifference$1(array, values, iteratee, comparator) {
+  var index = -1,
+      includes = arrayIncludes,
+      isCommon = true,
+      length = array.length,
+      result = [],
+      valuesLength = values.length;
+
+  if (!length) {
+    return result;
+  }
+
+  if (iteratee) {
+    values = arrayMap(values, baseUnary(iteratee));
+  }
+
+  if (comparator) {
+    includes = arrayIncludesWith;
+    isCommon = false;
+  } else if (values.length >= LARGE_ARRAY_SIZE) {
+    includes = cacheHas;
+    isCommon = false;
+    values = new SetCache(values);
+  }
+
+  outer: while (++index < length) {
+    var value = array[index],
+        computed = iteratee == null ? value : iteratee(value);
+    value = comparator || value !== 0 ? value : 0;
+
+    if (isCommon && computed === computed) {
+      var valuesIndex = valuesLength;
+
+      while (valuesIndex--) {
+        if (values[valuesIndex] === computed) {
+          continue outer;
+        }
+      }
+
+      result.push(value);
+    } else if (!includes(values, computed, comparator)) {
+      result.push(value);
+    }
+  }
+
+  return result;
+}
+
+var _baseDifference = baseDifference$1;
+
+var identity = identity_1,
+    overRest = _overRest,
+    setToString = _setToString;
+/**
+ * The base implementation of `_.rest` which doesn't validate or coerce arguments.
+ *
+ * @private
+ * @param {Function} func The function to apply a rest parameter to.
+ * @param {number} [start=func.length-1] The start position of the rest parameter.
+ * @returns {Function} Returns the new function.
+ */
+
+function baseRest$1(func, start) {
+  return setToString(overRest(func, start, identity), func + '');
+}
+
+var _baseRest = baseRest$1;
+
+var isArrayLike = isArrayLike_1,
+    isObjectLike$1 = isObjectLike_1;
+/**
+ * This method is like `_.isArrayLike` except that it also checks if `value`
+ * is an object.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an array-like object,
+ *  else `false`.
+ * @example
+ *
+ * _.isArrayLikeObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isArrayLikeObject(document.body.children);
+ * // => true
+ *
+ * _.isArrayLikeObject('abc');
+ * // => false
+ *
+ * _.isArrayLikeObject(_.noop);
+ * // => false
+ */
+
+function isArrayLikeObject$1(value) {
+  return isObjectLike$1(value) && isArrayLike(value);
+}
+
+var isArrayLikeObject_1 = isArrayLikeObject$1;
+
+var baseDifference = _baseDifference,
+    baseFlatten = _baseFlatten,
+    baseRest = _baseRest,
+    isArrayLikeObject = isArrayLikeObject_1;
+/**
+ * Creates an array of `array` values not included in the other given arrays
+ * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+ * for equality comparisons. The order and references of result values are
+ * determined by the first array.
+ *
+ * **Note:** Unlike `_.pullAll`, this method returns a new array.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Array
+ * @param {Array} array The array to inspect.
+ * @param {...Array} [values] The values to exclude.
+ * @returns {Array} Returns the new array of filtered values.
+ * @see _.without, _.xor
+ * @example
+ *
+ * _.difference([2, 1], [2, 3]);
+ * // => [1]
+ */
+
+var difference = baseRest(function (array, values) {
+  return isArrayLikeObject(array) ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true)) : [];
+});
+var difference_1 = difference;
+
+var baseGetTag = _baseGetTag,
+    getPrototype = _getPrototype,
+    isObjectLike = isObjectLike_1;
+/** `Object#toString` result references. */
+
+var objectTag = '[object Object]';
+/** Used for built-in method references. */
+
+var funcProto = Function.prototype,
+    objectProto = Object.prototype;
+/** Used to resolve the decompiled source of functions. */
+
+var funcToString = funcProto.toString;
+/** Used to check objects for own properties. */
+
+var hasOwnProperty = objectProto.hasOwnProperty;
+/** Used to infer the `Object` constructor. */
+
+var objectCtorString = funcToString.call(Object);
+/**
+ * Checks if `value` is a plain object, that is, an object created by the
+ * `Object` constructor or one with a `[[Prototype]]` of `null`.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.8.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.
+ * @example
+ *
+ * function Foo() {
+ *   this.a = 1;
+ * }
+ *
+ * _.isPlainObject(new Foo);
+ * // => false
+ *
+ * _.isPlainObject([1, 2, 3]);
+ * // => false
+ *
+ * _.isPlainObject({ 'x': 0, 'y': 0 });
+ * // => true
+ *
+ * _.isPlainObject(Object.create(null));
+ * // => true
+ */
+
+function isPlainObject(value) {
+  if (!isObjectLike(value) || baseGetTag(value) != objectTag) {
+    return false;
+  }
+
+  var proto = getPrototype(value);
+
+  if (proto === null) {
+    return true;
+  }
+
+  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;
+  return typeof Ctor == 'function' && Ctor instanceof Ctor && funcToString.call(Ctor) == objectCtorString;
+}
+
+var isPlainObject_1 = isPlainObject;
+
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) { symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); } keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }
+var TreeStore = /*#__PURE__*/function () {
+  function TreeStore(options) {
+    _classCallCheck(this, TreeStore);
+
+    var config = _objectSpread({
+      prefix: "t",
+      keys: {},
+      expandAll: false,
+      expandLevel: 0,
+      expandMutex: false,
+      expandParent: false,
+      activable: false,
+      activeMultiple: false,
+      checkable: false,
+      checkStrictly: false,
+      disabled: false,
+      load: null,
+      lazy: false,
+      valueMode: "onlyLeaf",
+      filter: null,
+      onLoad: null,
+      onReflow: null,
+      onUpdate: null
+    }, options);
+
+    this.config = config;
+    this.nodes = [];
+    this.children = [];
+    this.nodeMap = new Map();
+    this.activedMap = new Map();
+    this.expandedMap = new Map();
+    this.checkedMap = new Map();
+    this.updatedMap = new Map();
+    this.filterMap = new Map();
+    this.prevFilter = null;
+    this.updateTimer = null;
+    this.shouldReflow = false;
+  }
+
+  _createClass(TreeStore, [{
+    key: "setConfig",
+    value: function setConfig(options) {
+      var _this = this;
+
+      var hasChanged = false;
+      Object.keys(options).forEach(function (key) {
+        var val = options[key];
+
+        if (val !== _this.config[key]) {
+          hasChanged = true;
+          _this.config[key] = val;
+        }
+      });
+
+      if (hasChanged) {
+        this.refreshState();
+      }
+    }
+  }, {
+    key: "getChildren",
+    value: function getChildren() {
+      return this.children;
+    }
+  }, {
+    key: "getNode",
+    value: function getNode(item) {
+      var node = null;
+
+      if (typeof item === "string" || typeof item === "number") {
+        node = this.nodeMap.get(item);
+      } else if (item instanceof TreeNode) {
+        node = this.nodeMap.get(item.value);
+      }
+
+      return node;
+    }
+  }, {
+    key: "getIndex",
+    value: function getIndex(node) {
+      return this.nodes.indexOf(node);
+    }
+  }, {
+    key: "getParent",
+    value: function getParent(value) {
+      var parent = null;
+      var node = this.getNode(value);
+
+      if (node) {
+        parent = node.getParent();
+      }
+
+      return parent;
+    }
+  }, {
+    key: "getParents",
+    value: function getParents(value) {
+      var node = this.getNode(value);
+      var parents = [];
+
+      if (node) {
+        parents = node.getParents();
+      }
+
+      return parents;
+    }
+  }, {
+    key: "getNodeIndex",
+    value: function getNodeIndex(value) {
+      var node = this.getNode(value);
+      var index = -1;
+
+      if (node) {
+        index = node.getIndex();
+      }
+
+      return index;
+    }
+  }, {
+    key: "getNodes",
+    value: function getNodes(item, options) {
+      var nodes = [];
+      var val = "";
+
+      if (typeof item === "string" || typeof item === "number") {
+        val = item;
+      } else if (item instanceof TreeNode) {
+        val = item.value;
+      }
+
+      if (!val) {
+        nodes = this.nodes.slice(0);
+      } else {
+        var node = this.getNode(val);
+
+        if (node) {
+          nodes = node.walk();
+        }
+      }
+
+      if (options) {
+        var conf = _objectSpread({
+          filter: null,
+          level: Infinity
+        }, options);
+
+        if (typeof conf.level === "number" && conf.level !== Infinity) {
+          nodes = nodes.filter(function (node) {
+            return node.level <= conf.level;
+          });
+        }
+
+        if (typeof conf.filter === "function") {
+          nodes = nodes.filter(function (node) {
+            var nodeModel = node.getModel();
+            return conf.filter(nodeModel);
+          });
+        }
+
+        if (isPlainObject_1(conf.props)) {
+          nodes = nodes.filter(function (node) {
+            var result = Object.keys(conf.props).every(function (key) {
+              var propEqual = node[key] === conf.props[key];
+              return propEqual;
+            });
+            return result;
+          });
+        }
+      }
+
+      return nodes;
+    }
+  }, {
+    key: "append",
+    value: function append(list) {
+      var _this2 = this;
+
+      list.forEach(function (item) {
+        var node = new TreeNode(_this2, item);
+
+        _this2.children.push(node);
+      });
+      this.reflow();
+    }
+  }, {
+    key: "reload",
+    value: function reload(list) {
+      this.expandedMap.clear();
+      this.checkedMap.clear();
+      this.activedMap.clear();
+      this.filterMap.clear();
+      this.removeAll();
+      this.append(list);
+    }
+  }, {
+    key: "parseNodeData",
+    value: function parseNodeData(para, item) {
+      var value = "";
+      var node = null;
+      var data = null;
+
+      if (typeof para === "string" || typeof para === "number") {
+        value = para;
+        data = item;
+        node = this.getNode(value);
+      } else if (para instanceof TreeNode) {
+        node = para;
+        data = item;
+      } else {
+        data = para;
+      }
+
+      var spec = {
+        node: node,
+        data: data
+      };
+      return spec;
+    }
+  }, {
+    key: "appendNodes",
+    value: function appendNodes(para, item) {
+      var spec = this.parseNodeData(para, item);
+
+      if (spec.data) {
+        if (!spec.node) {
+          if (spec.data instanceof TreeNode) {
+            spec.data.appendTo(this);
+          } else if (Array.isArray(spec.data)) {
+            this.append(spec.data);
+          } else {
+            this.append([spec.data]);
+          }
+        } else {
+          if (spec.data instanceof TreeNode) {
+            spec.data.appendTo(this, spec.node);
+          } else if (Array.isArray(spec.data)) {
+            spec.node.append(spec.data);
+          } else {
+            spec.node.append([spec.data]);
+          }
+
+          spec.node.updateRelated();
+        }
+      }
+    }
+  }, {
+    key: "insertBefore",
+    value: function insertBefore(value, item) {
+      var node = this.getNode(value);
+
+      if (node) {
+        node.insertBefore(item);
+      }
+    }
+  }, {
+    key: "insertAfter",
+    value: function insertAfter(value, item) {
+      var node = this.getNode(value);
+
+      if (node) {
+        node.insertAfter(item);
+      }
+    }
+  }, {
+    key: "refreshNodes",
+    value: function refreshNodes() {
+      var children = this.children,
+          nodes = this.nodes;
+      nodes.length = 0;
+      children.forEach(function (node) {
+        var list = node.walk();
+        Array.prototype.push.apply(nodes, list);
+      });
+    }
+  }, {
+    key: "refreshState",
+    value: function refreshState() {
+      var nodes = this.nodes;
+      nodes.forEach(function (node) {
+        node.update();
+        node.updateChecked();
+      });
+    }
+  }, {
+    key: "reflow",
+    value: function reflow(node) {
+      this.shouldReflow = true;
+      this.updated(node);
+    }
+  }, {
+    key: "updated",
+    value: function updated(node) {
+      var _this3 = this;
+
+      if (node !== null && node !== void 0 && node.value) {
+        this.updatedMap.set(node.value, true);
+      }
+
+      if (this.updateTimer) return;
+      this.updateTimer = +setTimeout(function () {
+        clearTimeout(_this3.updateTimer);
+        _this3.updateTimer = null;
+
+        if (_this3.shouldReflow) {
+          _this3.refreshNodes();
+
+          _this3.emit("reflow");
+        }
+
+        _this3.lockFilterPathNodes();
+
+        var updatedList = Array.from(_this3.updatedMap.keys());
+
+        if (updatedList.length > 0) {
+          var updatedNodes = updatedList.map(function (value) {
+            return _this3.getNode(value);
+          });
+
+          _this3.emit("update", {
+            nodes: updatedNodes,
+            map: _this3.updatedMap
+          });
+        } else if (_this3.shouldReflow) {
+          _this3.emit("update", {
+            nodes: [],
+            map: _this3.updatedMap
+          });
+        }
+
+        _this3.shouldReflow = false;
+
+        _this3.updatedMap.clear();
+      });
+    }
+  }, {
+    key: "getActived",
+    value: function getActived(map) {
+      var activedMap = map || this.activedMap;
+      return Array.from(activedMap.keys());
+    }
+  }, {
+    key: "getActivedNodes",
+    value: function getActivedNodes(item) {
+      var nodes = this.getNodes(item);
+      nodes = nodes.filter(function (node) {
+        return node.isActived();
+      });
+      return nodes;
+    }
+  }, {
+    key: "replaceActived",
+    value: function replaceActived(list) {
+      this.resetActived();
+      this.setActived(list);
+    }
+  }, {
+    key: "setActived",
+    value: function setActived(actived) {
+      var _this4 = this;
+
+      var activeMultiple = this.config.activeMultiple;
+      var list = actived.slice(0);
+
+      if (!activeMultiple) {
+        list.length = 1;
+      }
+
+      list.forEach(function (val) {
+        _this4.activedMap.set(val, true);
+
+        var node = _this4.getNode(val);
+
+        if (node) {
+          node.update();
+        }
+      });
+    }
+  }, {
+    key: "resetActived",
+    value: function resetActived() {
+      var actived = this.getActived();
+      this.activedMap.clear();
+      var relatedNodes = this.getRelatedNodes(actived);
+      relatedNodes.forEach(function (node) {
+        node.update();
+      });
+    }
+  }, {
+    key: "getExpanded",
+    value: function getExpanded(map) {
+      var expandedMap = map || this.expandedMap;
+      return Array.from(expandedMap.keys());
+    }
+  }, {
+    key: "replaceExpanded",
+    value: function replaceExpanded(list) {
+      var expanded = this.getExpanded();
+      var added = difference_1(list, expanded);
+      var removed = difference_1(expanded, list);
+      this.setExpandedDirectly(removed, false);
+      this.updateExpanded(removed);
+      this.setExpanded(added);
+    }
+  }, {
+    key: "setExpanded",
+    value: function setExpanded(list) {
+      this.setExpandedDirectly(list);
+      this.updateExpanded(list);
+    }
+  }, {
+    key: "setExpandedDirectly",
+    value: function setExpandedDirectly(list) {
+      var _this5 = this;
+
+      var expanded = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
+      list.forEach(function (val) {
+        if (expanded) {
+          _this5.expandedMap.set(val, true);
+
+          var node = _this5.getNode(val);
+
+          if (node) {
+            node.afterExpanded();
+          }
+        } else {
+          _this5.expandedMap["delete"](val);
+        }
+      });
+    }
+  }, {
+    key: "resetExpanded",
+    value: function resetExpanded() {
+      var expanded = this.getExpanded();
+      this.expandedMap.clear();
+      this.updateExpanded(expanded);
+    }
+  }, {
+    key: "updateExpanded",
+    value: function updateExpanded(list) {
+      var relatedNodes = this.getRelatedNodes(list, {
+        withParents: false
+      });
+      relatedNodes.forEach(function (node) {
+        node.update();
+      });
+    }
+  }, {
+    key: "getChecked",
+    value: function getChecked(map) {
+      var nodes = this.nodes,
+          config = this.config;
+      var valueMode = config.valueMode,
+          checkStrictly = config.checkStrictly;
+      var list = [];
+      var checkedMap = map || this.checkedMap;
+      nodes.forEach(function (node) {
+        if (node.isChecked(checkedMap)) {
+          if (valueMode === "parentFirst" && !checkStrictly) {
+            if (!node.parent || !node.parent.isChecked(checkedMap)) {
+              list.push(node.value);
+            }
+          } else if (valueMode === "onlyLeaf" && !checkStrictly) {
+            if (node.isLeaf()) {
+              list.push(node.value);
+            }
+          } else {
+            list.push(node.value);
+          }
+        }
+      });
+      return list;
+    }
+  }, {
+    key: "getCheckedNodes",
+    value: function getCheckedNodes(item) {
+      var nodes = this.getNodes(item);
+      nodes = nodes.filter(function (node) {
+        return node.isChecked();
+      });
+      return nodes;
+    }
+  }, {
+    key: "replaceChecked",
+    value: function replaceChecked(list) {
+      this.resetChecked();
+      this.setChecked(list);
+    }
+  }, {
+    key: "setChecked",
+    value: function setChecked(list) {
+      var _this6 = this;
+
+      var _this$config = this.config,
+          valueMode = _this$config.valueMode,
+          checkStrictly = _this$config.checkStrictly,
+          checkable = _this$config.checkable;
+      if (!checkable) return;
+      list.forEach(function (val) {
+        var node = _this6.getNode(val);
+
+        if (node) {
+          if (valueMode === "parentFirst" && !checkStrictly) {
+            var childrenNodes = node.walk();
+            childrenNodes.forEach(function (childNode) {
+              _this6.checkedMap.set(childNode.value, true);
+            });
+          } else {
+            _this6.checkedMap.set(val, true);
+
+            node.updateChecked();
+          }
+        }
+      });
+
+      if (!checkStrictly) {
+        var checked = this.getChecked();
+        var relatedNodes = this.getRelatedNodes(checked);
+        relatedNodes.forEach(function (node) {
+          node.updateChecked();
+        });
+      }
+    }
+  }, {
+    key: "resetChecked",
+    value: function resetChecked() {
+      var checked = this.getChecked();
+      var relatedNodes = this.getRelatedNodes(checked);
+      this.checkedMap.clear();
+      relatedNodes.forEach(function (node) {
+        node.updateChecked();
+      });
+    }
+  }, {
+    key: "updateAll",
+    value: function updateAll() {
+      var nodes = this.getNodes();
+      nodes.forEach(function (node) {
+        node.update();
+      });
+    }
+  }, {
+    key: "remove",
+    value: function remove(value) {
+      var node = this.getNode(value);
+
+      if (node) {
+        node.remove();
+      }
+    }
+  }, {
+    key: "removeAll",
+    value: function removeAll() {
+      var nodes = this.getNodes();
+      nodes.forEach(function (node) {
+        node.remove();
+      });
+    }
+  }, {
+    key: "getRelatedNodes",
+    value: function getRelatedNodes(list, options) {
+      var _this7 = this;
+
+      var conf = _objectSpread({
+        withParents: true
+      }, options);
+
+      var map = new Map();
+      list.forEach(function (value) {
+        if (map.get(value)) return;
+
+        var node = _this7.getNode(value);
+
+        if (node) {
+          var parents = node.getParents();
+          var children = node.walk();
+          var related = [];
+
+          if (conf.withParents) {
+            related = parents.concat(children);
+          } else {
+            related = children;
+          }
+
+          related.forEach(function (relatedNode) {
+            map.set(relatedNode.value, relatedNode);
+          });
+        }
+      });
+      var relatedNodes = Array.from(map.values());
+      return relatedNodes;
+    }
+  }, {
+    key: "emit",
+    value: function emit(name, state) {
+      var config = this.config || {};
+      var methodName = camelCase_1("on-".concat(name));
+      var method = config[methodName];
+
+      if (typeof method === "function") {
+        method(state);
+      }
+    }
+  }, {
+    key: "lockFilterPathNodes",
+    value: function lockFilterPathNodes() {
+      var _this8 = this;
+
+      var config = this.config,
+          filterMap = this.filterMap;
+
+      if (!config.filter && !this.prevFilter) {
+        return;
+      }
+
+      this.prevFilter = config.filter;
+      var allNodes = this.getNodes();
+      allNodes.forEach(function (node) {
+        node.lock(false);
+      });
+
+      if (allNodes.length === filterMap.size) {
+        return;
+      }
+
+      var map = new Map();
+      allNodes.reverse().forEach(function (item) {
+        var node = item;
+        var parent = node.getParent();
+
+        if (node.vmIsRest) {
+          if (parent) {
+            parent.expanded = true;
+          }
+
+          node.visible = true;
+        }
+
+        if (node.vmIsRest || map.get(node.value)) {
+          if (parent && !parent.vmIsRest) {
+            map.set(parent.value, true);
+          }
+        }
+      });
+      var filterPathValues = Array.from(map.keys());
+      filterPathValues.forEach(function (value) {
+        var node = _this8.getNode(value);
+
+        if (node) {
+          node.lock(true);
+        }
+      });
+    }
+  }]);
+
+  return TreeStore;
+}();
+
+export { TreeStore as T, _getPrototype as _, _SetCache as a, _cacheHas as b };
+//# sourceMappingURL=dep-fc7e0774.js.map