shineout
Version:
A components library for React
94 lines (93 loc) • 6.1 kB
JavaScript
;
Object.defineProperty(exports, "__esModule", {
value: true
});
exports.mergeFilteredTree = exports.getFlattenTree = exports.getFilterTree = void 0;
var _immer = require("immer");
var _clone = require("./clone");
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 _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 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); }
var getFilterTree = exports.getFilterTree = function getFilterTree(treeNodes, filterFunc, filterExpandKeys, keyFunc) {
var childrenKey = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 'children';
var showHitDescendants = arguments.length > 5 ? arguments[5] : undefined;
var firstMatchNode = arguments.length > 6 ? arguments[6] : undefined;
var _ref = arguments.length > 7 && arguments[7] !== undefined ? arguments[7] : {},
advanced = _ref.advanced;
var mapFilteredNodeToData = function mapFilteredNodeToData(node) {
if (!node) return null;
var match = false;
if (filterFunc(node)) {
if (firstMatchNode) firstMatchNode(node);
match = true;
}
//@ts-ignore
var children = (node[childrenKey] || []).map(mapFilteredNodeToData)
//@ts-ignore
.filter(function (n) {
return n;
});
if (children.length || match) {
var key = keyFunc(node);
if (filterExpandKeys && children.length > 0) filterExpandKeys.push(key);
if (!node[childrenKey]) return node;
var childNodes = showHitDescendants && match ? node[childrenKey] || [] : children;
if (advanced && match && children.length > 0) childNodes = children;
return _objectSpread(_objectSpread({}, node), {}, _defineProperty({}, childrenKey, childNodes));
}
return null;
};
return treeNodes.map(mapFilteredNodeToData).filter(function (node) {
return node;
});
};
var getFlattenTree = exports.getFlattenTree = function getFlattenTree(data) {
var childrenKey = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'children';
var wide = arguments.length > 2 ? arguments[2] : undefined;
var arr = [];
var flatten = function flatten(list, path) {
list.forEach(function (item) {
var children = item[childrenKey];
if (children && children.length > 0) {
var clonedPath = _toConsumableArray(path);
clonedPath.push(item);
if (wide) arr.push(clonedPath);
flatten(children, clonedPath);
} else {
arr.push([].concat(_toConsumableArray(path), [item]));
}
});
};
flatten(data, []);
return arr;
};
var mergeFilteredTree = exports.mergeFilteredTree = function mergeFilteredTree(filterDatum, rawDatum, tiledId) {
var filterData = filterDatum.data;
var childrenKey = filterDatum.childrenKey;
if (tiledId.length === 0) return filterData;
var recursion = function recursion(node) {
var nodeKey = filterDatum.getKey(node);
if (tiledId.indexOf(nodeKey) >= 0) {
node[childrenKey] = (0, _clone.deepClone)(rawDatum.getDataById(nodeKey)[childrenKey] || []);
} else {
var item = filterDatum.getDataById(nodeKey);
if (item && item[childrenKey]) {
node[childrenKey] = (0, _clone.deepClone)(item[childrenKey] || []);
}
}
var children = node[childrenKey] || [];
children.map(recursion);
};
return (0, _immer.produce)(filterData, function (draft) {
draft.map(recursion);
});
};