react-admin-kit/lib/utils/treeUtil.js

A react based UI components for admin system

"use strict";

var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault").default;
Object.defineProperty(exports, "__esModule", {
  value: true
});
exports.filterTree = filterTree;
exports.getTreeChain = getTreeChain;
exports.normalizeTree = normalizeTree;
var _objectWithoutProperties2 = _interopRequireDefault(require("@babel/runtime/helpers/objectWithoutProperties"));
var _objectSpread2 = _interopRequireDefault(require("@babel/runtime/helpers/objectSpread2"));
var _cloneDeepWith = _interopRequireDefault(require("lodash/cloneDeepWith"));
var _isElement = _interopRequireDefault(require("lodash/isElement"));
var _react = require("react");
var _excluded = ["children"];
/** jsx 元素和 element 元素不做深拷贝 */
function clone(value) {
  return (0, _cloneDeepWith.default)(value, function (val) {
    if ((0, _isElement.default)(val) || /*#__PURE__*/(0, _react.isValidElement)(val)) {
      return true;
    }
  });
}
function normalizeTreeItem(item, patchItem, options) {
  var _ref = options || {},
    replace = _ref.replace;
  var patchResult = patchItem ? patchItem(item) || {} : {};
  var mergeItem = replace ? (0, _objectSpread2.default)({}, patchResult) : (0, _objectSpread2.default)((0, _objectSpread2.default)({}, item), patchResult);
  if (!mergeItem.children) {
    var children = mergeItem.children,
      rest = (0, _objectWithoutProperties2.default)(mergeItem, _excluded);
    return rest;
  }
  return (0, _objectSpread2.default)((0, _objectSpread2.default)({}, mergeItem), {}, {
    children: mergeItem.children ? mergeItem.children.map(function (child) {
      return normalizeTreeItem(child, patchItem, options);
    }) : []
  });
}
/**
 * 利用一个 patchItem 方法来处理 tree item
 * @param data
 * @param patchFunction
 * @param options patch 结果是否覆盖
 * @returns
 */
function normalizeTree() {
  var data = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
  var patchFunction = arguments.length > 1 ? arguments[1] : undefined;
  var options = arguments.length > 2 ? arguments[2] : undefined;
  var _ref2 = options || {},
    _ref2$replace = _ref2.replace,
    replace = _ref2$replace === void 0 ? false : _ref2$replace;
  return data.map(function (row) {
    return normalizeTreeItem(row, patchFunction, {
      replace: replace
    });
  });
}
/**
 * 通过传入一个函数来过滤树, 不符合条件的tree item 会被过滤掉
 * @param data
 * @param filter
 * @returns
 */
function filterTree() {
  var _data = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
  var filter = arguments.length > 1 ? arguments[1] : undefined;
  var depth = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
  var data = depth === 0 ? clone(_data) : _data;
  var result = [];
  data.forEach(function (item) {
    var verified = filter(item);
    if (!verified) return;
    if (verified && item.children) {
      item.children = filterTree(item.children, filter, depth + 1);
    }
    return result.push(item);
  });
  return result;
}

/**
 * 寻找树中的目标节点.
 * 如果找不到返回 []
 * 如果找到返回从头到目标节点的数组链
 * @param {Array} data
 * @param {string | number} value
 * @param {string} keyName
 * @returns
 */
function getTreeChain() {
  var _data = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
  var findFunction = arguments.length > 1 ? arguments[1] : undefined;
  var chain = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
  var depth = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;
  var result;
  var data = depth === 0 ? clone(_data) : _data;
  for (var i = 0; i < data.length; i++) {
    var _node = data[i];
    var target = findTreeItem(_node, findFunction, chain, depth);
    if (target) {
      result = target;
      break;
    } else {
      chain.splice(depth);
    }
  }
  return depth > 0 ? result : chain;
}
function findTreeItem(node, findFunction, chain, depth) {
  chain.push(node);
  if (findFunction(node)) {
    return node;
  }
  if (node.children && node.children.length) {
    return getTreeChain(node.children, findFunction, chain, depth + 1);
  }
  return undefined;
}