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

A react based UI components for admin system

var _excluded = ["children"];
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 _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; }
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : String(i); }
function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
import { cloneDeepWith, isElement } from 'lodash-es';
import { isValidElement } from 'react';

/** jsx 元素和 element 元素不做深拷贝 */
function clone(value) {
  return cloneDeepWith(value, function (val) {
    if (isElement(val) || /*#__PURE__*/isValidElement(val)) {
      return true;
    }
  });
}
function normalizeTreeItem(item, patchItem, options) {
  var _ref = options || {},
    replace = _ref.replace;
  var patchResult = patchItem ? patchItem(item) || {} : {};
  var mergeItem = replace ? _objectSpread({}, patchResult) : _objectSpread(_objectSpread({}, item), patchResult);
  if (!mergeItem.children) {
    var children = mergeItem.children,
      rest = _objectWithoutProperties(mergeItem, _excluded);
    return rest;
  }
  return _objectSpread(_objectSpread({}, 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
 */
export 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
 */
export 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
 */
export 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;
}