@qsxy/element-plus-react 1.0.2 → 2.0.0

package/dist/Tree/util.js

@@ -1,303 +0,0 @@
-var _excluded = ["children"];
-function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
-function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
-function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
-function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
-function _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }
-function _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }
-function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }
-/* eslint-disable no-lonely-if */
-/**
- * Legacy code. Should avoid to use if you are new to import these code.
- */
-
-import warning from 'rc-util/lib/warning';
-import React from 'react';
-import TreeNode from "./TreeNode";
-import getEntity from "./utils/keyUtil";
-export { getPosition, isTreeNode } from "./utils/treeUtil";
-export function arrDel(list, value) {
-  if (!list) {
-    return [];
-  }
-  var clone = list.slice();
-  var index = clone.indexOf(value);
-  if (index >= 0) {
-    clone.splice(index, 1);
-  }
-  return clone;
-}
-export function arrAdd(list, value) {
-  var clone = (list || []).slice();
-  if (clone.indexOf(value) === -1) {
-    clone.push(value);
-  }
-  return clone;
-}
-export function posToArr(pos) {
-  return pos.split('-');
-}
-export function getDragChildrenKeys(dragNodeKey, keyEntities) {
-  // not contains self
-  // self for left or right drag
-  var dragChildrenKeys = [];
-  var entity = getEntity(keyEntities, dragNodeKey);
-  function dig() {
-    var list = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
-    list.forEach(function (_ref) {
-      var key = _ref.key,
-        children = _ref.children;
-      dragChildrenKeys.push(key);
-      dig(children);
-    });
-  }
-  dig(entity.children);
-  return dragChildrenKeys;
-}
-export function isLastChild(treeNodeEntity) {
-  if (treeNodeEntity.parent) {
-    var posArr = posToArr(treeNodeEntity.pos);
-    return Number(posArr[posArr.length - 1]) === treeNodeEntity.parent.children.length - 1;
-  }
-  return false;
-}
-export function isFirstChild(treeNodeEntity) {
-  var posArr = posToArr(treeNodeEntity.pos);
-  return Number(posArr[posArr.length - 1]) === 0;
-}
-
-// Only used when drag, not affect SSR.
-export function calcDropPosition(event, dragNodeProps, targetNodeProps, indent, startMousePosition, allowDrop, flattenedNodes, keyEntities, expandKeys, direction) {
-  var _abstractDropNodeEnti;
-  var clientX = event.clientX,
-    clientY = event.clientY;
-  var _getBoundingClientRec = event.target.getBoundingClientRect(),
-    top = _getBoundingClientRec.top,
-    height = _getBoundingClientRec.height;
-  // optional chain for testing
-  var horizontalMouseOffset = (direction === 'rtl' ? -1 : 1) * (((startMousePosition === null || startMousePosition === void 0 ? void 0 : startMousePosition.x) || 0) - clientX);
-  var rawDropLevelOffset = (horizontalMouseOffset - 12) / indent;
-
-  // Filter the expanded keys to exclude the node that not has children currently (like async nodes).
-  var filteredExpandKeys = expandKeys.filter(function (key) {
-    var _keyEntities$key;
-    return (_keyEntities$key = keyEntities[key]) === null || _keyEntities$key === void 0 || (_keyEntities$key = _keyEntities$key.children) === null || _keyEntities$key === void 0 ? void 0 : _keyEntities$key.length;
-  });
-
-  // find abstract drop node by horizontal offset
-  var abstractDropNodeEntity = getEntity(keyEntities, targetNodeProps.eventKey);
-  if (clientY < top + height / 2) {
-    // first half, set abstract drop node to previous node
-    var nodeIndex = flattenedNodes.findIndex(function (flattenedNode) {
-      return flattenedNode.key === abstractDropNodeEntity.key;
-    });
-    var prevNodeIndex = nodeIndex <= 0 ? 0 : nodeIndex - 1;
-    var prevNodeKey = flattenedNodes[prevNodeIndex].key;
-    abstractDropNodeEntity = getEntity(keyEntities, prevNodeKey);
-  }
-  var initialAbstractDropNodeKey = abstractDropNodeEntity.key;
-  var abstractDragOverEntity = abstractDropNodeEntity;
-  var dragOverNodeKey = abstractDropNodeEntity.key;
-  var dropPosition = 0;
-  var dropLevelOffset = 0;
-
-  // Only allow cross level drop when dragging on a non-expanded node
-  if (!filteredExpandKeys.includes(initialAbstractDropNodeKey)) {
-    for (var i = 0; i < rawDropLevelOffset; i += 1) {
-      if (isLastChild(abstractDropNodeEntity)) {
-        abstractDropNodeEntity = abstractDropNodeEntity.parent;
-        dropLevelOffset += 1;
-      } else {
-        break;
-      }
-    }
-  }
-  var abstractDragDataNode = dragNodeProps.data;
-  var abstractDropDataNode = abstractDropNodeEntity.node;
-  var dropAllowed = true;
-  if (isFirstChild(abstractDropNodeEntity) && abstractDropNodeEntity.level === 0 && clientY < top + height / 2 && allowDrop({
-    dragNode: abstractDragDataNode,
-    dropNode: abstractDropDataNode,
-    dropPosition: -1
-  }) && abstractDropNodeEntity.key === targetNodeProps.eventKey) {
-    // first half of first node in first level
-    dropPosition = -1;
-  } else if ((abstractDragOverEntity.children || []).length && filteredExpandKeys.includes(dragOverNodeKey)) {
-    // drop on expanded node
-    // only allow drop inside
-    if (allowDrop({
-      dragNode: abstractDragDataNode,
-      dropNode: abstractDropDataNode,
-      dropPosition: 0
-    })) {
-      dropPosition = 0;
-    } else {
-      dropAllowed = false;
-    }
-  } else if (dropLevelOffset === 0) {
-    if (rawDropLevelOffset > -1.5) {
-      // | Node     | <- abstractDropNode
-      // | -^-===== | <- mousePosition
-      // 1. try drop after
-      // 2. do not allow drop
-      if (allowDrop({
-        dragNode: abstractDragDataNode,
-        dropNode: abstractDropDataNode,
-        dropPosition: 1
-      })) {
-        dropPosition = 1;
-      } else {
-        dropAllowed = false;
-      }
-    } else {
-      // | Node     | <- abstractDropNode
-      // | ---==^== | <- mousePosition
-      // whether it has children or doesn't has children
-      // always
-      // 1. try drop inside
-      // 2. try drop after
-      // 3. do not allow drop
-      if (allowDrop({
-        dragNode: abstractDragDataNode,
-        dropNode: abstractDropDataNode,
-        dropPosition: 0
-      })) {
-        dropPosition = 0;
-      } else if (allowDrop({
-        dragNode: abstractDragDataNode,
-        dropNode: abstractDropDataNode,
-        dropPosition: 1
-      })) {
-        dropPosition = 1;
-      } else {
-        dropAllowed = false;
-      }
-    }
-  } else {
-    // | Node1 | <- abstractDropNode
-    //      |  Node2  |
-    // --^--|----=====| <- mousePosition
-    // 1. try insert after Node1
-    // 2. do not allow drop
-    if (allowDrop({
-      dragNode: abstractDragDataNode,
-      dropNode: abstractDropDataNode,
-      dropPosition: 1
-    })) {
-      dropPosition = 1;
-    } else {
-      dropAllowed = false;
-    }
-  }
-  return {
-    dropPosition: dropPosition,
-    dropLevelOffset: dropLevelOffset,
-    dropTargetKey: abstractDropNodeEntity.key,
-    dropTargetPos: abstractDropNodeEntity.pos,
-    dragOverNodeKey: dragOverNodeKey,
-    dropContainerKey: dropPosition === 0 ? null : ((_abstractDropNodeEnti = abstractDropNodeEntity.parent) === null || _abstractDropNodeEnti === void 0 ? void 0 : _abstractDropNodeEnti.key) || null,
-    dropAllowed: dropAllowed
-  };
-}
-
-/**
- * Return selectedKeys according with multiple prop
- * @param selectedKeys
- * @param props
- * @returns [string]
- */
-export function calcSelectedKeys(selectedKeys, props) {
-  if (!selectedKeys) {
-    return undefined;
-  }
-  var multiple = props.multiple;
-  if (multiple) {
-    return selectedKeys.slice();
-  }
-  if (selectedKeys.length) {
-    return [selectedKeys[0]];
-  }
-  return selectedKeys;
-}
-var internalProcessProps = function internalProcessProps(props) {
-  return props;
-};
-export function convertDataToTree(treeData, processor) {
-  if (!treeData) {
-    return [];
-  }
-  var _ref2 = processor || {},
-    _ref2$processProps = _ref2.processProps,
-    processProps = _ref2$processProps === void 0 ? internalProcessProps : _ref2$processProps;
-  var list = Array.isArray(treeData) ? treeData : [treeData];
-  return list.map(function (_ref3) {
-    var children = _ref3.children,
-      props = _objectWithoutProperties(_ref3, _excluded);
-    var childrenNodes = convertDataToTree(children, processor);
-    return /*#__PURE__*/React.createElement(TreeNode, _extends({
-      key: props.key
-    }, processProps(props)), childrenNodes);
-  });
-}
-
-/**
- * Parse `checkedKeys` to { checkedKeys, halfCheckedKeys } style
- */
-export function parseCheckedKeys(keys) {
-  if (!keys) {
-    return null;
-  }
-
-  // Convert keys to object format
-  var keyProps;
-  if (Array.isArray(keys)) {
-    // [Legacy] Follow the api doc
-    keyProps = {
-      checkedKeys: keys,
-      halfCheckedKeys: undefined
-    };
-  } else if (_typeof(keys) === 'object') {
-    keyProps = {
-      checkedKeys: keys.checked || undefined,
-      halfCheckedKeys: keys.halfChecked || undefined
-    };
-  } else {
-    warning(false, '`checkedKeys` is not an array or an object');
-    return null;
-  }
-  return keyProps;
-}
-
-/**
- * If user use `autoExpandParent` we should get the list of parent node
- * @param keyList
- * @param keyEntities
- */
-export function conductExpandParent(keyList, keyEntities) {
-  var expandedKeys = new Set();
-  function conductUp(key) {
-    if (expandedKeys.has(key)) {
-      return;
-    }
-    var entity = getEntity(keyEntities, key);
-    if (!entity) {
-      return;
-    }
-    expandedKeys.add(key);
-    var parent = entity.parent,
-      node = entity.node;
-    if (node.disabled) {
-      return;
-    }
-    if (parent) {
-      conductUp(parent.key);
-    }
-  }
-  (keyList || []).forEach(function (key) {
-    conductUp(key);
-  });
-  return _toConsumableArray(expandedKeys);
-}

package/dist/Tree/utils/conductUtil.d.ts

@@ -1,17 +0,0 @@
-import type { BasicDataNode, DataNode, GetCheckDisabled, Key, KeyEntities } from '../typings';
-interface ConductReturnType {
-    checkedKeys: Key[];
-    halfCheckedKeys: Key[];
-}
-export declare function isCheckDisabled<TreeDataType>(node: TreeDataType): boolean;
-/**
- * Conduct with keys.
- * @param keyList current key list
- * @param keyEntities key - dataEntity map
- * @param mode `fill` to fill missing key, `clean` to remove useless key
- */
-export declare function conductCheck<TreeDataType extends BasicDataNode = DataNode>(keyList: Key[], checked: true | {
-    checked: false;
-    halfCheckedKeys: Key[];
-}, keyEntities: KeyEntities<TreeDataType>, getCheckDisabled?: GetCheckDisabled<TreeDataType>): ConductReturnType;
-export {};

package/dist/Tree/utils/conductUtil.js

@@ -1,209 +0,0 @@
-import warning from 'rc-util/lib/warning';
-import getEntity from "./keyUtil";
-function removeFromCheckedKeys(halfCheckedKeys, checkedKeys) {
-  var filteredKeys = new Set();
-  halfCheckedKeys.forEach(function (key) {
-    if (!checkedKeys.has(key)) {
-      filteredKeys.add(key);
-    }
-  });
-  return filteredKeys;
-}
-export function isCheckDisabled(node) {
-  var _ref = node || {},
-    disabled = _ref.disabled,
-    disableCheckbox = _ref.disableCheckbox,
-    checkable = _ref.checkable;
-  return !!(disabled || disableCheckbox) || checkable === false;
-}
-
-// Fill miss keys
-function fillConductCheck(keys, levelEntities, maxLevel, syntheticGetCheckDisabled) {
-  var checkedKeys = new Set(keys);
-  var halfCheckedKeys = new Set();
-
-  // Add checked keys top to bottom
-  for (var level = 0; level <= maxLevel; level += 1) {
-    var entities = levelEntities.get(level) || new Set();
-    entities.forEach(function (entity) {
-      var key = entity.key,
-        node = entity.node,
-        _entity$children = entity.children,
-        children = _entity$children === void 0 ? [] : _entity$children;
-      if (checkedKeys.has(key) && !syntheticGetCheckDisabled(node)) {
-        children.filter(function (childEntity) {
-          return !syntheticGetCheckDisabled(childEntity.node);
-        }).forEach(function (childEntity) {
-          checkedKeys.add(childEntity.key);
-        });
-      }
-    });
-  }
-
-  // Add checked keys from bottom to top
-  var visitedKeys = new Set();
-  for (var _level = maxLevel; _level >= 0; _level -= 1) {
-    var _entities = levelEntities.get(_level) || new Set();
-    _entities.forEach(function (entity) {
-      var parent = entity.parent,
-        node = entity.node;
-
-      // Skip if no need to check
-      if (syntheticGetCheckDisabled(node) || !entity.parent || visitedKeys.has(entity.parent.key)) {
-        return;
-      }
-
-      // Skip if parent is disabled
-      if (syntheticGetCheckDisabled(entity.parent.node)) {
-        visitedKeys.add(parent.key);
-        return;
-      }
-      var allChecked = true;
-      var partialChecked = false;
-      (parent.children || []).filter(function (childEntity) {
-        return !syntheticGetCheckDisabled(childEntity.node);
-      }).forEach(function (_ref2) {
-        var key = _ref2.key;
-        var checked = checkedKeys.has(key);
-        if (allChecked && !checked) {
-          allChecked = false;
-        }
-        if (!partialChecked && (checked || halfCheckedKeys.has(key))) {
-          partialChecked = true;
-        }
-      });
-      if (allChecked) {
-        checkedKeys.add(parent.key);
-      }
-      if (partialChecked) {
-        halfCheckedKeys.add(parent.key);
-      }
-      visitedKeys.add(parent.key);
-    });
-  }
-  return {
-    checkedKeys: Array.from(checkedKeys),
-    halfCheckedKeys: Array.from(removeFromCheckedKeys(halfCheckedKeys, checkedKeys))
-  };
-}
-
-// Remove useless key
-function cleanConductCheck(keys, halfKeys, levelEntities, maxLevel, syntheticGetCheckDisabled) {
-  var checkedKeys = new Set(keys);
-  var halfCheckedKeys = new Set(halfKeys);
-
-  // Remove checked keys from top to bottom
-  for (var level = 0; level <= maxLevel; level += 1) {
-    var entities = levelEntities.get(level) || new Set();
-    entities.forEach(function (entity) {
-      var key = entity.key,
-        node = entity.node,
-        _entity$children2 = entity.children,
-        children = _entity$children2 === void 0 ? [] : _entity$children2;
-      if (!checkedKeys.has(key) && !halfCheckedKeys.has(key) && !syntheticGetCheckDisabled(node)) {
-        children.filter(function (childEntity) {
-          return !syntheticGetCheckDisabled(childEntity.node);
-        }).forEach(function (childEntity) {
-          checkedKeys.delete(childEntity.key);
-        });
-      }
-    });
-  }
-
-  // Remove checked keys form bottom to top
-  halfCheckedKeys = new Set();
-  var visitedKeys = new Set();
-  for (var _level2 = maxLevel; _level2 >= 0; _level2 -= 1) {
-    var _entities2 = levelEntities.get(_level2) || new Set();
-    _entities2.forEach(function (entity) {
-      var parent = entity.parent,
-        node = entity.node;
-
-      // Skip if no need to check
-      if (syntheticGetCheckDisabled(node) || !entity.parent || visitedKeys.has(entity.parent.key)) {
-        return;
-      }
-
-      // Skip if parent is disabled
-      if (syntheticGetCheckDisabled(entity.parent.node)) {
-        visitedKeys.add(parent.key);
-        return;
-      }
-      var allChecked = true;
-      var partialChecked = false;
-      (parent.children || []).filter(function (childEntity) {
-        return !syntheticGetCheckDisabled(childEntity.node);
-      }).forEach(function (_ref3) {
-        var key = _ref3.key;
-        var checked = checkedKeys.has(key);
-        if (allChecked && !checked) {
-          allChecked = false;
-        }
-        if (!partialChecked && (checked || halfCheckedKeys.has(key))) {
-          partialChecked = true;
-        }
-      });
-      if (!allChecked) {
-        checkedKeys.delete(parent.key);
-      }
-      if (partialChecked) {
-        halfCheckedKeys.add(parent.key);
-      }
-      visitedKeys.add(parent.key);
-    });
-  }
-  return {
-    checkedKeys: Array.from(checkedKeys),
-    halfCheckedKeys: Array.from(removeFromCheckedKeys(halfCheckedKeys, checkedKeys))
-  };
-}
-
-/**
- * Conduct with keys.
- * @param keyList current key list
- * @param keyEntities key - dataEntity map
- * @param mode `fill` to fill missing key, `clean` to remove useless key
- */
-export function conductCheck(keyList, checked, keyEntities, getCheckDisabled) {
-  var warningMissKeys = [];
-  var syntheticGetCheckDisabled;
-  if (getCheckDisabled) {
-    syntheticGetCheckDisabled = getCheckDisabled;
-  } else {
-    syntheticGetCheckDisabled = isCheckDisabled;
-  }
-
-  // We only handle exist keys
-  var keys = new Set(keyList.filter(function (key) {
-    var hasEntity = !!getEntity(keyEntities, key);
-    if (!hasEntity) {
-      warningMissKeys.push(key);
-    }
-    return hasEntity;
-  }));
-  var levelEntities = new Map();
-  var maxLevel = 0;
-
-  // Convert entities by level for calculation
-  Object.keys(keyEntities).forEach(function (key) {
-    var entity = keyEntities[key];
-    var level = entity.level;
-    var levelSet = levelEntities.get(level);
-    if (!levelSet) {
-      levelSet = new Set();
-      levelEntities.set(level, levelSet);
-    }
-    levelSet.add(entity);
-    maxLevel = Math.max(maxLevel, level);
-  });
-  warning(!warningMissKeys.length, "Tree missing follow keys: ".concat(warningMissKeys.slice(0, 100).map(function (key) {
-    return "'".concat(key, "'");
-  }).join(', ')));
-  var result;
-  if (checked === true) {
-    result = fillConductCheck(keys, levelEntities, maxLevel, syntheticGetCheckDisabled);
-  } else {
-    result = cleanConductCheck(keys, checked.halfCheckedKeys, levelEntities, maxLevel, syntheticGetCheckDisabled);
-  }
-  return result;
-}

package/dist/Tree/utils/dictUtil.d.ts

@@ -1,13 +0,0 @@
-import { TreeProps } from '../RCTree';
-import { DataNode, Key } from '../typings';
-type FieldNames = TreeProps['fieldNames'];
-/** 计算选中范围，只考虑expanded情况以优化性能 */
-export declare function calcRangeKeys({ treeData, expandedKeys, startKey, endKey, fieldNames, }: {
-    treeData: DataNode[];
-    expandedKeys: Key[];
-    startKey?: Key;
-    endKey?: Key;
-    fieldNames?: FieldNames;
-}): Key[];
-export declare function convertDirectoryKeysToNodes(treeData: DataNode[], keys: Key[], fieldNames?: FieldNames): DataNode[];
-export {};

package/dist/Tree/utils/dictUtil.js

@@ -1,75 +0,0 @@
-function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
-function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
-function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
-import { fillFieldNames } from "./treeUtil";
-var RECORD_NONE = 0;
-var RECORD_START = 1;
-var RECORD_END = 2;
-function traverseNodesKey(treeData, callback, fieldNames) {
-  var fieldKey = fieldNames.key,
-    fieldChildren = fieldNames.children;
-  function processNode(dataNode) {
-    var key = dataNode[fieldKey];
-    var children = dataNode[fieldChildren];
-    if (callback(key, dataNode) !== false) {
-      traverseNodesKey(children || [], callback, fieldNames);
-    }
-  }
-  treeData.forEach(processNode);
-}
-
-/** 计算选中范围，只考虑expanded情况以优化性能 */
-export function calcRangeKeys(_ref) {
-  var treeData = _ref.treeData,
-    expandedKeys = _ref.expandedKeys,
-    startKey = _ref.startKey,
-    endKey = _ref.endKey,
-    fieldNames = _ref.fieldNames;
-  var keys = [];
-  var record = RECORD_NONE;
-  if (startKey && startKey === endKey) {
-    return [startKey];
-  }
-  if (!startKey || !endKey) {
-    return [];
-  }
-  function matchKey(key) {
-    return key === startKey || key === endKey;
-  }
-  traverseNodesKey(treeData, function (key) {
-    if (record === RECORD_END) {
-      return false;
-    }
-    if (matchKey(key)) {
-      // Match test
-      keys.push(key);
-      if (record === RECORD_NONE) {
-        record = RECORD_START;
-      } else if (record === RECORD_START) {
-        record = RECORD_END;
-        return false;
-      }
-    } else if (record === RECORD_START) {
-      // Append selection
-      keys.push(key);
-    }
-    return expandedKeys.includes(key);
-  }, fillFieldNames(fieldNames));
-  return keys;
-}
-export function convertDirectoryKeysToNodes(treeData, keys, fieldNames) {
-  var restKeys = _toConsumableArray(keys);
-  var nodes = [];
-  traverseNodesKey(treeData, function (key, node) {
-    var index = restKeys.indexOf(key);
-    if (index !== -1) {
-      nodes.push(node);
-      restKeys.splice(index, 1);
-    }
-    return !!restKeys.length;
-  }, fillFieldNames(fieldNames));
-  return nodes;
-}

package/dist/Tree/utils/diffUtil.d.ts

@@ -1,7 +0,0 @@
-/// <reference types="react" />
-import type { FlattenNode, Key } from '../typings';
-export declare function findExpandedKeys(prev?: Key[], next?: Key[]): {
-    add: boolean;
-    key: import("react").Key;
-};
-export declare function getExpandRange(shorter: FlattenNode[], longer: FlattenNode[], key: Key): FlattenNode<import("../typings").DataNode>[];

package/dist/Tree/utils/diffUtil.js

@@ -1,48 +0,0 @@
-export function findExpandedKeys() {
-  var prev = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
-  var next = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
-  var prevLen = prev.length;
-  var nextLen = next.length;
-  if (Math.abs(prevLen - nextLen) !== 1) {
-    return {
-      add: false,
-      key: null
-    };
-  }
-  function find(shorter, longer) {
-    var cache = new Map();
-    shorter.forEach(function (key) {
-      cache.set(key, true);
-    });
-    var keys = longer.filter(function (key) {
-      return !cache.has(key);
-    });
-    return keys.length === 1 ? keys[0] : null;
-  }
-  if (prevLen < nextLen) {
-    return {
-      add: true,
-      key: find(prev, next)
-    };
-  }
-  return {
-    add: false,
-    key: find(next, prev)
-  };
-}
-export function getExpandRange(shorter, longer, key) {
-  var shorterStartIndex = shorter.findIndex(function (data) {
-    return data.key === key;
-  });
-  var shorterEndNode = shorter[shorterStartIndex + 1];
-  var longerStartIndex = longer.findIndex(function (data) {
-    return data.key === key;
-  });
-  if (shorterEndNode) {
-    var longerEndIndex = longer.findIndex(function (data) {
-      return data.key === shorterEndNode.key;
-    });
-    return longer.slice(longerStartIndex + 1, longerEndIndex);
-  }
-  return longer.slice(longerStartIndex + 1);
-}

package/dist/Tree/utils/dropIndicator.d.ts

@@ -1,11 +0,0 @@
-import React from 'react';
-export declare const offset = 4;
-interface Props {
-    dropPosition: -1 | 0 | 1;
-    dropLevelOffset: number;
-    indent: number;
-    prefixCls: string;
-    direction: 'ltr' | 'rtl';
-}
-declare const DropIndicatorRender: (props: Props) => React.JSX.Element;
-export default DropIndicatorRender;