61 lines
3.2 KiB
JavaScript
61 lines
3.2 KiB
JavaScript
|
"use strict";
|
||
|
|
|
||
|
|
var _typeof = require("@babel/runtime/helpers/typeof");
|
||
|
|
Object.defineProperty(exports, "__esModule", {
|
||
|
|
value: true
|
||
|
|
});
|
||
|
|
exports.default = useFlattenRecords;
|
||
|
|
var React = _interopRequireWildcard(require("react"));
|
||
|
|
function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
|
||
|
|
function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || _typeof(obj) !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
|
||
|
|
// recursion (flat tree structure)
|
||
|
|
function fillRecords(list, record, indent, childrenColumnName, expandedKeys, getRowKey, index) {
|
||
|
|
list.push({
|
||
|
|
record: record,
|
||
|
|
indent: indent,
|
||
|
|
index: index
|
||
|
|
});
|
||
|
|
var key = getRowKey(record);
|
||
|
|
var expanded = expandedKeys === null || expandedKeys === void 0 ? void 0 : expandedKeys.has(key);
|
||
|
|
if (record && Array.isArray(record[childrenColumnName]) && expanded) {
|
||
|
|
// expanded state, flat record
|
||
|
|
for (var i = 0; i < record[childrenColumnName].length; i += 1) {
|
||
|
|
fillRecords(list, record[childrenColumnName][i], indent + 1, childrenColumnName, expandedKeys, getRowKey, i);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* flat tree data on expanded state
|
||
|
|
*
|
||
|
|
* @export
|
||
|
|
* @template T
|
||
|
|
* @param {*} data : table data
|
||
|
|
* @param {string} childrenColumnName : 指定树形结构的列名
|
||
|
|
* @param {Set<Key>} expandedKeys : 展开的行对应的keys
|
||
|
|
* @param {GetRowKey<T>} getRowKey : 获取当前rowKey的方法
|
||
|
|
* @returns flattened data
|
||
|
|
*/
|
||
|
|
function useFlattenRecords(data, childrenColumnName, expandedKeys, getRowKey) {
|
||
|
|
var arr = React.useMemo(function () {
|
||
|
|
if (expandedKeys !== null && expandedKeys !== void 0 && expandedKeys.size) {
|
||
|
|
var list = [];
|
||
|
|
|
||
|
|
// collect flattened record
|
||
|
|
for (var i = 0; i < (data === null || data === void 0 ? void 0 : data.length); i += 1) {
|
||
|
|
var record = data[i];
|
||
|
|
|
||
|
|
// using array.push or spread operator may cause "Maximum call stack size exceeded" exception if array size is big enough.
|
||
|
|
fillRecords(list, record, 0, childrenColumnName, expandedKeys, getRowKey, i);
|
||
|
|
}
|
||
|
|
return list;
|
||
|
|
}
|
||
|
|
return data === null || data === void 0 ? void 0 : data.map(function (item, index) {
|
||
|
|
return {
|
||
|
|
record: item,
|
||
|
|
indent: 0,
|
||
|
|
index: index
|
||
|
|
};
|
||
|
|
});
|
||
|
|
}, [data, childrenColumnName, expandedKeys, getRowKey]);
|
||
|
|
return arr;
|
||
|
|
}
|