@kdcloudjs/table 1.0.0

package/es/table/utils/element.js

@@ -0,0 +1,228 @@
+/** elementUtil html元素用的工具函数 */
+// 获取面板相对屏幕的位置  panel - 面板 trigger - 触发器
+// export function getPanelScreenByTrigger ({ panel, trigger, defaultAlign }) {
+//   if (!panel || !trigger) return {}
+//   // 触发器相对于浏览器的位置
+//   const triggerScreen = trigger.getBoundingClientRect()
+//   // 触发器下方剩余高度
+//   const bottomHeight = window.innerHeight - triggerScreen.top - trigger.offsetHeight
+//   // 触发器上方剩余高度
+//   const topHeight = triggerScreen.top
+//   // 默认优先显示在触发器的下方
+//   let top = bottomHeight >= panel.offsetHeight || bottomHeight > topHeight
+//     ? triggerScreen.top + trigger.offsetHeight // 显示在触发器下方
+//     : triggerScreen.top - panel.offsetHeight // 显示在触发器下方
+//   defaultAlign = defaultAlign || {}
+//   if (defaultAlign.top) { // 优先显示在触发器的上方
+//     top = topHeight >= panel.offsetHeight || topHeight > bottomHeight
+//       ? triggerScreen.top - panel.offsetHeight
+//       : triggerScreen.top + trigger.offsetHeight
+//   }
+//   // 浏览器右侧剩余宽度
+//   const rightWidth = window.innerWidth - triggerScreen.left - trigger.offsetWidth
+//   // 浏览器左侧剩余宽度
+//   const leftWidth = triggerScreen.left
+//   // 默认优先靠左显示
+//   let left = rightWidth + trigger.offsetWidth >= panel.offsetWidth ||
+//     rightWidth > leftWidth
+//     ? triggerScreen.left
+//     : triggerScreen.left + trigger.offsetWidth - panel.offsetWidth
+//   if (defaultAlign.right) { // 优先靠右显示
+//     left = leftWidth + trigger.offsetWidth > panel.offsetWidth ||
+//       leftWidth > rightWidth
+//       ? triggerScreen.left + trigger.offsetWidth - panel.offsetWidth
+//       : triggerScreen.left
+//   }
+//   // 增加左右显示的标识
+//   if (rightWidth >= panel.offsetWidth) {
+//     panel.classList.add('j-left')
+//   } else {
+//     panel.classList.add('j-right')
+//   }
+//   const realHeight = bottomHeight > topHeight ? bottomHeight : topHeight
+//   // 空间不足且显示在上方，top设0避免溢出
+//   if (panel.offsetHeight > realHeight && topHeight > bottomHeight) {
+//     top = 0
+//   }
+//   return { top, left, realHeight }
+// }
+export function getEventPath(event) {
+  if (event.deepPath) {
+    // IE supports deep path
+    return event.deepPath();
+  } else if (event.path) {
+    // Chrome supports path
+    return event.path;
+  } else if (event.composedPath) {
+    // Firefox supports composePath
+    return event.composedPath();
+  }
+
+  return createEventPath(event);
+}
+
+function createEventPath(event) {
+  var res = [];
+  var pointer = event.target;
+
+  while (pointer) {
+    res.push(pointer);
+    pointer = pointer.parentElement;
+  }
+
+  return res;
+}
+
+;
+/**
+ * 获取点击事件是否发生在元素内部
+ * @param ele
+ * @param event
+ */
+
+export function isElementInEventPath(ele, event) {
+  if (!ele || !event) {
+    return false;
+  }
+
+  var path = getEventPath(event);
+  return path.indexOf(ele) >= 0;
+}
+/**
+ * 根据点击路径获取对应元素
+ * @param path
+ * @param isTargetCb
+ */
+
+export function getTargetEleInEventPath(path, isTargetCb) {
+  var target;
+  var l = 0;
+
+  while (!target && l < path.length) {
+    var ele = path[l];
+
+    if (isTargetCb(ele)) {
+      target = ele;
+    }
+
+    l++;
+  }
+
+  return target;
+}
+/**
+ * 获得鼠标点击相对父面板位置
+ * @param event
+ * @param popupParent
+ */
+
+export function calculatePointerRelative(event, popupParent) {
+  var parentRect = popupParent.getBoundingClientRect();
+  var documentRect = document.documentElement.getBoundingClientRect();
+  return {
+    x: event.clientX - (popupParent === document.body ? documentRect.left : parentRect.left),
+    y: event.clientY - (popupParent === document.body ? documentRect.top : parentRect.top)
+  };
+}
+/**
+ * 获取面板相对父面板位置
+ * @param event
+ * @param popupParent
+ */
+
+export function calculatePopupRelative(trigger, popupParent, offset) {
+  var triggerRect = trigger.getBoundingClientRect();
+  var parent = popupParent === document.body ? document.documentElement : popupParent;
+  var parentRect = parent.getBoundingClientRect();
+  return {
+    x: triggerRect.left - parentRect.left - (offset ? offset.x : 0),
+    y: triggerRect.top - parentRect.top - (offset ? offset.y : 0)
+  };
+}
+
+function getPerfectX(_ref) {
+  var x = _ref.x,
+      maxX = _ref.maxX,
+      width = _ref.width,
+      isPerfectX = _ref.isPerfectX;
+
+  if (isPerfectX && Math.max(x, 0) > Math.abs(maxX)) {
+    //看左侧空间是否足够
+    var parentAvailableWidth = x;
+
+    if (width <= parentAvailableWidth) {
+      return x - width; //空间足够，往左侧偏移
+    }
+  } //目前位置，最大支持的位置
+
+
+  return Math.min(Math.max(x, 0), Math.abs(maxX));
+}
+
+function getPerfectY(_ref2) {
+  var y = _ref2.y,
+      maxY = _ref2.maxY,
+      height = _ref2.height,
+      scrollTop = _ref2.scrollTop,
+      isBody = _ref2.isBody,
+      isPerfectY = _ref2.isPerfectY;
+
+  if (isPerfectY && Math.max(y, 0) > Math.abs(maxY)) {
+    //看下上方空间是否足够
+    var parentAvailableHeight = isBody ? y - scrollTop : y;
+
+    if (height <= parentAvailableHeight) {
+      //上方空间足够，向上展示
+      return y - height;
+    }
+  } //目前位置，最大支持的位置
+
+
+  return Math.min(Math.max(y, 0), Math.abs(maxY));
+}
+
+export function keepWithinBounds(popupParent, popup, x, y, isPerfect) {
+  var parentRect = popupParent.getBoundingClientRect();
+  var docElement = document.documentElement;
+  var docRect = docElement.getBoundingClientRect();
+  var popupRect = popup.getBoundingClientRect();
+  var parentAvailableWidth = parentRect.width;
+  var parentAvailableHeight = parentRect.height;
+  var isBody = popupParent === document.body;
+
+  if (isBody) {
+    //ducument的宽度减去 父元素到document边界的的宽度，就是剩余可显示的宽度
+    parentAvailableWidth = docRect.width - Math.abs(docRect.left - parentRect.left); //ducument的高度加上滚动条的高度减去 父元素到document边界的的宽度，就是剩余可显示的高度
+
+    parentAvailableHeight = docRect.height + docElement.scrollTop - Math.abs(docRect.top - parentRect.top);
+  }
+
+  if (x) {
+    var width = popupRect.width;
+    var maxX = parentAvailableWidth - width;
+    x = getPerfectX({
+      x: x,
+      maxX: maxX,
+      width: width,
+      isPerfectX: isPerfect
+    });
+  }
+
+  if (y) {
+    var height = popupRect.height;
+    var maxY = parentAvailableHeight - height;
+    y = getPerfectY({
+      y: y,
+      maxY: maxY,
+      height: height,
+      scrollTop: docElement.scrollTop,
+      isBody: isBody,
+      isPerfectY: isPerfect
+    });
+  }
+
+  return {
+    x: x,
+    y: y
+  };
+}

package/es/table/utils/exportTableAsExcel.d.ts

@@ -0,0 +1,4 @@
+import type XLSX_NS from 'xlsx';
+import { ArtColumn } from '../interfaces';
+/** 根据 BaseTable 的 dataSource 和 column，将表格数据导出为 Excel 文件 */
+export default function exportTableAsExcel(xlsxPackage: typeof XLSX_NS, dataSource: any[], columns: ArtColumn[], filename: string): void;

package/es/table/utils/exportTableAsExcel.js

@@ -0,0 +1,188 @@
+import _filterInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/filter";
+import _mapInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/map";
+import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/slice";
+import _Array$from from "@babel/runtime-corejs3/core-js-stable/array/from";
+import _Symbol from "@babel/runtime-corejs3/core-js-stable/symbol";
+import _getIteratorMethod from "@babel/runtime-corejs3/core-js/get-iterator-method";
+import _getIterator from "@babel/runtime-corejs3/core-js/get-iterator";
+
+function _createForOfIteratorHelper(o, allowArrayLike) { var it; if (typeof _Symbol === "undefined" || _getIteratorMethod(o) == null) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = _getIterator(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { var _context2; if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = _sliceInstanceProperty(_context2 = Object.prototype.toString.call(o)).call(_context2, 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 _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 SpanManager from '../base/helpers/SpanManager';
+import { internals } from '../internals';
+import collectNodes from './collectNodes';
+import getTreeDepth from './getTreeDepth';
+import isLeafNode from './isLeafNode';
+
+function safeGetSpanRect(column, record, rowIndex, colIndex) {
+  var colSpan = 1;
+  var rowSpan = 1;
+
+  if (column.getSpanRect) {
+    var value = internals.safeGetValue(column, record, rowIndex);
+    var spanRect = column.getSpanRect(value, record, rowIndex);
+    colSpan = spanRect == null ? 1 : spanRect.right - colIndex;
+    rowSpan = spanRect == null ? 1 : spanRect.bottom - rowIndex;
+  } else {
+    var cellProps = internals.safeGetCellProps(column, record, rowIndex);
+
+    if (cellProps.colSpan != null) {
+      colSpan = cellProps.colSpan;
+    }
+
+    if (cellProps.rowSpan != null) {
+      rowSpan = cellProps.rowSpan;
+    }
+  } // 注意这里没有考虑「rowSpan/colSpan 不能过大，避免 rowSpan/colSpan 影响因虚拟滚动而未渲染的单元格」
+
+
+  return {
+    top: rowIndex,
+    bottom: rowIndex + rowSpan,
+    left: colIndex,
+    right: colIndex + colSpan
+  };
+}
+
+function move(_ref, dx, dy) {
+  var c = _ref.c,
+      r = _ref.r;
+  return {
+    c: c + dx,
+    r: r + dy
+  };
+}
+
+function sanitizeCellDatum(value) {
+  if (value === Infinity || value === -Infinity || typeof value === 'number' && isNaN(value)) {
+    return null;
+  } else {
+    return value;
+  }
+}
+/** 根据 BaseTable 的 dataSource 和 column，将表格数据导出为 Excel 文件 */
+
+
+export default function exportTableAsExcel(xlsxPackage, dataSource, columns, filename) {
+  var sheet = xlsxPackage.utils.aoa_to_sheet([]);
+  var topHeaderHeight = getTreeDepth(columns) + 1;
+  var origin = {
+    c: 0,
+    r: 0
+  };
+  addTopHeaders(origin);
+  addDataPart(move(origin, 0, topHeaderHeight));
+  xlsxPackage.writeFile({
+    SheetNames: ['Sheet1'],
+    Sheets: {
+      Sheet1: sheet
+    }
+  }, filename);
+
+  function addTopHeaders(origin) {
+    dfs(columns, 0, 0);
+
+    function dfs(cols, startDx, startDy) {
+      var _a;
+
+      var start = move(origin, startDx, startDy);
+      var offsetX = 0;
+
+      var _iterator = _createForOfIteratorHelper(cols),
+          _step;
+
+      try {
+        for (_iterator.s(); !(_step = _iterator.n()).done;) {
+          var col = _step.value;
+
+          if ((_a = col.features) === null || _a === void 0 ? void 0 : _a.noExport) {
+            continue;
+          }
+
+          var current = move(start, offsetX, 0);
+          addOne(col.name, current);
+
+          if (isLeafNode(col)) {
+            offsetX += 1;
+            mergeCells(current, 1, topHeaderHeight - startDy);
+          } else {
+            var childrenWidth = dfs(col.children, startDx + offsetX, startDy + 1);
+            mergeCells(current, childrenWidth, 1);
+            offsetX += childrenWidth;
+          }
+        }
+      } catch (err) {
+        _iterator.e(err);
+      } finally {
+        _iterator.f();
+      }
+
+      return offsetX;
+    }
+  }
+
+  function addDataPart(origin) {
+    var _context;
+
+    var leafColumns = _filterInstanceProperty(_context = collectNodes(columns, 'leaf-only')).call(_context, function (col) {
+      var _a;
+
+      return !((_a = col.features) === null || _a === void 0 ? void 0 : _a.noExport);
+    });
+
+    var spanManager = new SpanManager();
+
+    var dataPart = _mapInstanceProperty(dataSource).call(dataSource, function (record, rowIndex) {
+      spanManager.stripUpwards(rowIndex);
+      return _mapInstanceProperty(leafColumns).call(leafColumns, function (col, colIndex) {
+        if (spanManager.testSkip(rowIndex, colIndex)) {
+          return null;
+        }
+
+        var spanRect = safeGetSpanRect(col, record, rowIndex, colIndex);
+        var rowSpan = spanRect.bottom - spanRect.top;
+        var colSpan = spanRect.right - spanRect.left;
+
+        if (rowSpan > 1 || colSpan > 1) {
+          spanManager.add(spanRect.top, spanRect.left, colSpan, rowSpan);
+          mergeCells(move(origin, spanRect.left, spanRect.top), colSpan, rowSpan);
+        }
+
+        return sanitizeCellDatum(internals.safeGetValue(col, record, rowIndex));
+      });
+    });
+
+    add(dataPart, origin);
+  }
+
+  function add(data, origin) {
+    xlsxPackage.utils.sheet_add_aoa(sheet, data, {
+      origin: origin
+    });
+  }
+
+  function addOne(datum, origin) {
+    xlsxPackage.utils.sheet_add_aoa(sheet, [[datum]], {
+      origin: origin
+    });
+  }
+
+  function mergeCells(addr, width, height) {
+    if (width === 1 && height === 1) {
+      return;
+    }
+
+    if (sheet['!merges'] == null) {
+      sheet['!merges'] = [];
+    }
+
+    sheet['!merges'].push({
+      s: addr,
+      e: move(addr, width - 1, height - 1)
+    });
+  }
+}

package/es/table/utils/getTreeDepth.d.ts

@@ -0,0 +1,3 @@
+import { AbstractTreeNode } from '../interfaces';
+/** 获取一棵树的高度/深度 (0-based) */
+export default function getTreeDepth(nodes: AbstractTreeNode[]): number;

package/es/table/utils/getTreeDepth.js

@@ -0,0 +1,41 @@
+import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/slice";
+import _Array$from from "@babel/runtime-corejs3/core-js-stable/array/from";
+import _Symbol from "@babel/runtime-corejs3/core-js-stable/symbol";
+import _getIteratorMethod from "@babel/runtime-corejs3/core-js/get-iterator-method";
+import _getIterator from "@babel/runtime-corejs3/core-js/get-iterator";
+
+function _createForOfIteratorHelper(o, allowArrayLike) { var it; if (typeof _Symbol === "undefined" || _getIteratorMethod(o) == null) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = _getIterator(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { var _context; if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = _sliceInstanceProperty(_context = Object.prototype.toString.call(o)).call(_context, 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 _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 isLeafNode from './isLeafNode';
+/** 获取一棵树的高度/深度 (0-based) */
+
+export default function getTreeDepth(nodes) {
+  var maxDepth = -1;
+  dfs(nodes, 0);
+  return maxDepth;
+
+  function dfs(columns, depth) {
+    var _iterator = _createForOfIteratorHelper(columns),
+        _step;
+
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var column = _step.value;
+
+        if (isLeafNode(column)) {
+          maxDepth = Math.max(maxDepth, depth);
+        } else {
+          dfs(column.children, depth + 1);
+        }
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+  }
+}

package/es/table/utils/groupBy.d.ts

@@ -0,0 +1 @@
+export default function groupBy<T, K extends string>(list: T[], iteratee: (t: T) => K): { [key in K]: T[]; };

package/es/table/utils/groupBy.js

@@ -0,0 +1,37 @@
+import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/slice";
+import _Array$from from "@babel/runtime-corejs3/core-js-stable/array/from";
+import _Symbol from "@babel/runtime-corejs3/core-js-stable/symbol";
+import _getIteratorMethod from "@babel/runtime-corejs3/core-js/get-iterator-method";
+import _getIterator from "@babel/runtime-corejs3/core-js/get-iterator";
+
+function _createForOfIteratorHelper(o, allowArrayLike) { var it; if (typeof _Symbol === "undefined" || _getIteratorMethod(o) == null) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = _getIterator(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { var _context; if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = _sliceInstanceProperty(_context = Object.prototype.toString.call(o)).call(_context, 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 _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; }
+
+export default function groupBy(list, iteratee) {
+  var groups = {};
+
+  var _iterator = _createForOfIteratorHelper(list),
+      _step;
+
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var item = _step.value;
+      var key = iteratee(item);
+
+      if (groups[key] == null) {
+        groups[key] = [];
+      }
+
+      groups[key].push(item);
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+
+  return groups;
+}

package/es/table/utils/index.d.ts

@@ -0,0 +1,18 @@
+export { default as collectNodes } from './collectNodes';
+export { default as getTreeDepth } from './getTreeDepth';
+export { default as groupBy } from './groupBy';
+export { default as isLeafNode } from './isLeafNode';
+export { default as isGroupColumn } from './isGroupColumn';
+export { default as applyTransforms } from './applyTransforms';
+export { default as buildTree } from './buildTree';
+export { default as exportTableAsExcel } from './exportTableAsExcel';
+export { default as layeredSort } from './layeredSort';
+export { default as mergeCellProps } from './mergeCellProps';
+export { default as proto } from './proto';
+export { default as makeRecursiveMapper } from './makeRecursiveMapper';
+export { default as smartCompare } from './smartCompare';
+export { default as traverseColumn } from './traverseColumn';
+export { copyDataToClipboard, executeOnTempElement } from './copyToClipboard';
+export { default as layeredFilter } from './layeredFilter';
+export { getEventPath, isElementInEventPath, getTargetEleInEventPath, calculatePointerRelative, calculatePopupRelative, keepWithinBounds } from './element';
+export { default as console } from './console';

package/es/table/utils/index.js

@@ -0,0 +1,18 @@
+export { default as collectNodes } from './collectNodes';
+export { default as getTreeDepth } from './getTreeDepth';
+export { default as groupBy } from './groupBy';
+export { default as isLeafNode } from './isLeafNode';
+export { default as isGroupColumn } from './isGroupColumn';
+export { default as applyTransforms } from './applyTransforms';
+export { default as buildTree } from './buildTree';
+export { default as exportTableAsExcel } from './exportTableAsExcel';
+export { default as layeredSort } from './layeredSort';
+export { default as mergeCellProps } from './mergeCellProps';
+export { default as proto } from './proto';
+export { default as makeRecursiveMapper } from './makeRecursiveMapper';
+export { default as smartCompare } from './smartCompare';
+export { default as traverseColumn } from './traverseColumn';
+export { copyDataToClipboard, executeOnTempElement } from './copyToClipboard';
+export { default as layeredFilter } from './layeredFilter';
+export { getEventPath, isElementInEventPath, getTargetEleInEventPath, calculatePointerRelative, calculatePopupRelative, keepWithinBounds } from './element';
+export { default as console } from './console';

package/es/table/utils/isGroupColumn.d.ts

@@ -0,0 +1,2 @@
+import { ArtColumn } from '../interfaces';
+export default function isGroupColumn(columns: ArtColumn[]): boolean;

package/es/table/utils/isGroupColumn.js

@@ -0,0 +1,7 @@
+import _findIndexInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/find-index";
+// 是否是叶子节点
+export default function isGroupColumn(columns) {
+  return _findIndexInstanceProperty(columns).call(columns, function (col) {
+    return col.children && col.children.length > 0;
+  }) > -1;
+}

package/es/table/utils/isLeafNode.d.ts

@@ -0,0 +1,2 @@
+import { AbstractTreeNode } from '../interfaces';
+export default function isLeafNode(node: AbstractTreeNode): boolean;

package/es/table/utils/isLeafNode.js

@@ -0,0 +1,4 @@
+// 是否是叶子节点
+export default function isLeafNode(node) {
+  return node.children == null || node.children.length === 0;
+}

package/es/table/utils/layeredFilter.d.ts

@@ -0,0 +1,2 @@
+import { AbstractTreeNode } from '../interfaces';
+export default function layeredFilter<T extends AbstractTreeNode>(array: T[], filter: (x: T, index: number) => boolean): T[];

package/es/table/utils/layeredFilter.js

@@ -0,0 +1,25 @@
+import _extends from "@babel/runtime-corejs3/helpers/extends";
+import _filterInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/filter";
+import _mapInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/map";
+import isLeafNode from './isLeafNode';
+export default function layeredFilter(array, filter) {
+  return dfs(array);
+
+  function dfs(rows) {
+    var _context;
+
+    if (!Array.isArray(array)) {
+      return array;
+    }
+
+    return _filterInstanceProperty(_context = _mapInstanceProperty(rows).call(rows, function (row) {
+      if (isLeafNode(row)) {
+        return row;
+      }
+
+      return _extends(_extends({}, row), {
+        children: dfs(row.children)
+      });
+    })).call(_context, filter);
+  }
+}

package/es/table/utils/layeredSort.d.ts

@@ -0,0 +1,5 @@
+import { AbstractTreeNode } from '../interfaces';
+/** 对树状结构的数据进行排序.
+ * layeredSort 是一个递归的过程，针对树上的每一个父节点，该函数都会重新对其子节点数组（children) 进行排序.
+ * */
+export default function layeredSort<T extends AbstractTreeNode>(array: T[], compare: (x: T, y: T) => number): T[];

package/es/table/utils/layeredSort.js

@@ -0,0 +1,26 @@
+import _extends from "@babel/runtime-corejs3/helpers/extends";
+import _mapInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/map";
+import isLeafNode from './isLeafNode';
+/** 对树状结构的数据进行排序.
+ * layeredSort 是一个递归的过程，针对树上的每一个父节点，该函数都会重新对其子节点数组（children) 进行排序.
+ * */
+
+export default function layeredSort(array, compare) {
+  return dfs(array);
+
+  function dfs(rows) {
+    if (!Array.isArray(array)) {
+      return array;
+    }
+
+    return _mapInstanceProperty(rows).call(rows, function (row) {
+      if (isLeafNode(row)) {
+        return row;
+      }
+
+      return _extends(_extends({}, row), {
+        children: dfs(row.children)
+      });
+    }).sort(compare);
+  }
+}

package/es/table/utils/makeRecursiveMapper.d.ts

@@ -0,0 +1,9 @@
+import { AbstractTreeNode } from '../interfaces';
+declare type RecursiveFlatMapInfo<T> = {
+    startIndex: number;
+    endIndex: number;
+    path: T[];
+    isLeaf: boolean;
+};
+export default function makeRecursiveMapper<T extends AbstractTreeNode>(fn: (node: T, info: RecursiveFlatMapInfo<T>) => null | T | T[]): (tree: T[]) => T[];
+export {};