@kdcloudjs/table 1.0.0

package/lib/table/utils/groupBy.js

@@ -0,0 +1,48 @@
+"use strict";
+
+var _sliceInstanceProperty = require("@babel/runtime-corejs3/core-js-stable/instance/slice");
+
+var _Array$from = require("@babel/runtime-corejs3/core-js-stable/array/from");
+
+var _Symbol = require("@babel/runtime-corejs3/core-js-stable/symbol");
+
+var _getIteratorMethod = require("@babel/runtime-corejs3/core-js/get-iterator-method");
+
+var _getIterator = require("@babel/runtime-corejs3/core-js/get-iterator");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = groupBy;
+
+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; }
+
+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/lib/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/lib/table/utils/index.js

@@ -0,0 +1,187 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime-corejs3/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "collectNodes", {
+  enumerable: true,
+  get: function get() {
+    return _collectNodes.default;
+  }
+});
+Object.defineProperty(exports, "getTreeDepth", {
+  enumerable: true,
+  get: function get() {
+    return _getTreeDepth.default;
+  }
+});
+Object.defineProperty(exports, "groupBy", {
+  enumerable: true,
+  get: function get() {
+    return _groupBy.default;
+  }
+});
+Object.defineProperty(exports, "isLeafNode", {
+  enumerable: true,
+  get: function get() {
+    return _isLeafNode.default;
+  }
+});
+Object.defineProperty(exports, "isGroupColumn", {
+  enumerable: true,
+  get: function get() {
+    return _isGroupColumn.default;
+  }
+});
+Object.defineProperty(exports, "applyTransforms", {
+  enumerable: true,
+  get: function get() {
+    return _applyTransforms.default;
+  }
+});
+Object.defineProperty(exports, "buildTree", {
+  enumerable: true,
+  get: function get() {
+    return _buildTree.default;
+  }
+});
+Object.defineProperty(exports, "exportTableAsExcel", {
+  enumerable: true,
+  get: function get() {
+    return _exportTableAsExcel.default;
+  }
+});
+Object.defineProperty(exports, "layeredSort", {
+  enumerable: true,
+  get: function get() {
+    return _layeredSort.default;
+  }
+});
+Object.defineProperty(exports, "mergeCellProps", {
+  enumerable: true,
+  get: function get() {
+    return _mergeCellProps.default;
+  }
+});
+Object.defineProperty(exports, "proto", {
+  enumerable: true,
+  get: function get() {
+    return _proto.default;
+  }
+});
+Object.defineProperty(exports, "makeRecursiveMapper", {
+  enumerable: true,
+  get: function get() {
+    return _makeRecursiveMapper.default;
+  }
+});
+Object.defineProperty(exports, "smartCompare", {
+  enumerable: true,
+  get: function get() {
+    return _smartCompare.default;
+  }
+});
+Object.defineProperty(exports, "traverseColumn", {
+  enumerable: true,
+  get: function get() {
+    return _traverseColumn.default;
+  }
+});
+Object.defineProperty(exports, "copyDataToClipboard", {
+  enumerable: true,
+  get: function get() {
+    return _copyToClipboard.copyDataToClipboard;
+  }
+});
+Object.defineProperty(exports, "executeOnTempElement", {
+  enumerable: true,
+  get: function get() {
+    return _copyToClipboard.executeOnTempElement;
+  }
+});
+Object.defineProperty(exports, "layeredFilter", {
+  enumerable: true,
+  get: function get() {
+    return _layeredFilter.default;
+  }
+});
+Object.defineProperty(exports, "getEventPath", {
+  enumerable: true,
+  get: function get() {
+    return _element.getEventPath;
+  }
+});
+Object.defineProperty(exports, "isElementInEventPath", {
+  enumerable: true,
+  get: function get() {
+    return _element.isElementInEventPath;
+  }
+});
+Object.defineProperty(exports, "getTargetEleInEventPath", {
+  enumerable: true,
+  get: function get() {
+    return _element.getTargetEleInEventPath;
+  }
+});
+Object.defineProperty(exports, "calculatePointerRelative", {
+  enumerable: true,
+  get: function get() {
+    return _element.calculatePointerRelative;
+  }
+});
+Object.defineProperty(exports, "calculatePopupRelative", {
+  enumerable: true,
+  get: function get() {
+    return _element.calculatePopupRelative;
+  }
+});
+Object.defineProperty(exports, "keepWithinBounds", {
+  enumerable: true,
+  get: function get() {
+    return _element.keepWithinBounds;
+  }
+});
+Object.defineProperty(exports, "console", {
+  enumerable: true,
+  get: function get() {
+    return _console.default;
+  }
+});
+
+var _collectNodes = _interopRequireDefault(require("./collectNodes"));
+
+var _getTreeDepth = _interopRequireDefault(require("./getTreeDepth"));
+
+var _groupBy = _interopRequireDefault(require("./groupBy"));
+
+var _isLeafNode = _interopRequireDefault(require("./isLeafNode"));
+
+var _isGroupColumn = _interopRequireDefault(require("./isGroupColumn"));
+
+var _applyTransforms = _interopRequireDefault(require("./applyTransforms"));
+
+var _buildTree = _interopRequireDefault(require("./buildTree"));
+
+var _exportTableAsExcel = _interopRequireDefault(require("./exportTableAsExcel"));
+
+var _layeredSort = _interopRequireDefault(require("./layeredSort"));
+
+var _mergeCellProps = _interopRequireDefault(require("./mergeCellProps"));
+
+var _proto = _interopRequireDefault(require("./proto"));
+
+var _makeRecursiveMapper = _interopRequireDefault(require("./makeRecursiveMapper"));
+
+var _smartCompare = _interopRequireDefault(require("./smartCompare"));
+
+var _traverseColumn = _interopRequireDefault(require("./traverseColumn"));
+
+var _copyToClipboard = require("./copyToClipboard");
+
+var _layeredFilter = _interopRequireDefault(require("./layeredFilter"));
+
+var _element = require("./element");
+
+var _console = _interopRequireDefault(require("./console"));

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

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

package/lib/table/utils/isGroupColumn.js

@@ -0,0 +1,17 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime-corejs3/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = isGroupColumn;
+
+var _findIndex = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/find-index"));
+
+// 是否是叶子节点
+function isGroupColumn(columns) {
+  return (0, _findIndex.default)(columns).call(columns, function (col) {
+    return col.children && col.children.length > 0;
+  }) > -1;
+}

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

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

package/lib/table/utils/isLeafNode.js

@@ -0,0 +1,11 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = isLeafNode;
+
+// 是否是叶子节点
+function isLeafNode(node) {
+  return node.children == null || node.children.length === 0;
+}

package/lib/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/lib/table/utils/layeredFilter.js

@@ -0,0 +1,38 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime-corejs3/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = layeredFilter;
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/extends"));
+
+var _filter = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/filter"));
+
+var _map = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/map"));
+
+var _isLeafNode = _interopRequireDefault(require("./isLeafNode"));
+
+function layeredFilter(array, filter) {
+  return dfs(array);
+
+  function dfs(rows) {
+    var _context;
+
+    if (!Array.isArray(array)) {
+      return array;
+    }
+
+    return (0, _filter.default)(_context = (0, _map.default)(rows).call(rows, function (row) {
+      if ((0, _isLeafNode.default)(row)) {
+        return row;
+      }
+
+      return (0, _extends2.default)((0, _extends2.default)({}, row), {
+        children: dfs(row.children)
+      });
+    })).call(_context, filter);
+  }
+}

package/lib/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/lib/table/utils/layeredSort.js

@@ -0,0 +1,37 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime-corejs3/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = layeredSort;
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/extends"));
+
+var _map = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/map"));
+
+var _isLeafNode = _interopRequireDefault(require("./isLeafNode"));
+
+/** 对树状结构的数据进行排序.
+ * layeredSort 是一个递归的过程，针对树上的每一个父节点，该函数都会重新对其子节点数组（children) 进行排序.
+ * */
+function layeredSort(array, compare) {
+  return dfs(array);
+
+  function dfs(rows) {
+    if (!Array.isArray(array)) {
+      return array;
+    }
+
+    return (0, _map.default)(rows).call(rows, function (row) {
+      if ((0, _isLeafNode.default)(row)) {
+        return row;
+      }
+
+      return (0, _extends2.default)((0, _extends2.default)({}, row), {
+        children: dfs(row.children)
+      });
+    }).sort(compare);
+  }
+}

package/lib/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 {};

package/lib/table/utils/makeRecursiveMapper.js

@@ -0,0 +1,94 @@
+"use strict";
+
+var _sliceInstanceProperty2 = require("@babel/runtime-corejs3/core-js-stable/instance/slice");
+
+var _Array$from = require("@babel/runtime-corejs3/core-js-stable/array/from");
+
+var _Symbol = require("@babel/runtime-corejs3/core-js-stable/symbol");
+
+var _getIteratorMethod = require("@babel/runtime-corejs3/core-js/get-iterator-method");
+
+var _getIterator = require("@babel/runtime-corejs3/core-js/get-iterator");
+
+var _interopRequireDefault = require("@babel/runtime-corejs3/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = makeRecursiveMapper;
+
+var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/toConsumableArray"));
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/extends"));
+
+var _slice = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/instance/slice"));
+
+var _isLeafNode = _interopRequireDefault(require("./isLeafNode"));
+
+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 = _sliceInstanceProperty2(_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; }
+
+function makeRecursiveMapper(fn) {
+  return function (tree) {
+    return dfs(tree, 0, []).result;
+
+    function dfs(nodes, parentStartIndex, path) {
+      var flatCount = 0;
+      var result = [];
+
+      var _iterator = _createForOfIteratorHelper(nodes),
+          _step;
+
+      try {
+        for (_iterator.s(); !(_step = _iterator.n()).done;) {
+          var node = _step.value;
+          path.push(node);
+          var startIndex = parentStartIndex + flatCount;
+          var subResult = void 0;
+
+          if ((0, _isLeafNode.default)(node)) {
+            subResult = fn(node, {
+              // parentStartIndex,
+              startIndex: startIndex,
+              endIndex: startIndex + 1,
+              path: (0, _slice.default)(path).call(path),
+              isLeaf: true
+            });
+            flatCount += 1;
+          } else {
+            var dfsResult = dfs(node.children, startIndex, path);
+            subResult = fn((0, _extends2.default)((0, _extends2.default)({}, node), {
+              children: dfsResult.result
+            }), {
+              startIndex: startIndex,
+              endIndex: startIndex + dfsResult.flatCount,
+              path: (0, _slice.default)(path).call(path),
+              isLeaf: false
+            });
+            flatCount += dfsResult.flatCount;
+          }
+
+          if (Array.isArray(subResult)) {
+            result.push.apply(result, (0, _toConsumableArray2.default)(subResult));
+          } else if (subResult != null) {
+            result.push(subResult);
+          }
+
+          path.pop();
+        }
+      } catch (err) {
+        _iterator.e(err);
+      } finally {
+        _iterator.f();
+      }
+
+      return {
+        result: result,
+        flatCount: flatCount
+      };
+    }
+  };
+}

package/lib/table/utils/mergeCellProps.d.ts

@@ -0,0 +1,8 @@
+import { CellProps } from '../interfaces';
+/** 合并两个 cellProps（单元格属性）对象，返回一个合并后的全新对象。
+ *
+ * mergeCellProps 会按照以下规则来合并两个对象：
+ * * 对于 数字、字符串、布尔值类型的字段，extra 中的字段值将直接覆盖 base 中的字段值（className 是个特例，会进行字符串拼接）
+ * * 对于函数/方法类型的字段（对应单元格的事件回调函数），mergeCellProps 将生成一个新的函数，新函数将按序调用 base 和 extra 中的方法
+ * * 对于普通对象类型的字段（对应单元格的样式），mergeCellProps 将合并两个对象 */
+export default function mergeCellProps(base: CellProps, extra: CellProps): CellProps;

package/lib/table/utils/mergeCellProps.js

@@ -0,0 +1,78 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime-corejs3/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = mergeCellProps;
+
+var _keys = _interopRequireDefault(require("@babel/runtime-corejs3/core-js-stable/object/keys"));
+
+var _typeof2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/typeof"));
+
+var _extends2 = _interopRequireDefault(require("@babel/runtime-corejs3/helpers/extends"));
+
+var _classnames = _interopRequireDefault(require("classnames"));
+
+function composeEventHandler(handler1, handler2) {
+  return function () {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+
+    // 先执行原有的事件回调函数
+    handler1(args);
+    handler2(args); // 事件回调函数没有返回值，故这里不进行 return
+  };
+}
+/** 合并两个 cellProps（单元格属性）对象，返回一个合并后的全新对象。
+ *
+ * mergeCellProps 会按照以下规则来合并两个对象：
+ * * 对于 数字、字符串、布尔值类型的字段，extra 中的字段值将直接覆盖 base 中的字段值（className 是个特例，会进行字符串拼接）
+ * * 对于函数/方法类型的字段（对应单元格的事件回调函数），mergeCellProps 将生成一个新的函数，新函数将按序调用 base 和 extra 中的方法
+ * * 对于普通对象类型的字段（对应单元格的样式），mergeCellProps 将合并两个对象 */
+
+
+function mergeCellProps(base, extra) {
+  if (base == null) {
+    return extra;
+  }
+
+  if (extra == null) {
+    return base;
+  }
+
+  var result = (0, _extends2.default)({}, base);
+
+  for (var _i = 0, _Object$keys = (0, _keys.default)(extra); _i < _Object$keys.length; _i++) {
+    var key = _Object$keys[_i];
+    var value = extra[key];
+    var type = (0, _typeof2.default)(value);
+
+    if (value === null) {
+      // value=null 时 覆盖原来的值
+      result[key] = null;
+    } else if (value === undefined) {// value=undefined 时 保留原来的值
+    } else if (type === 'number' || type === 'string' || type === 'boolean') {
+      if (key === 'className') {
+        result[key] = (0, _classnames.default)(result[key], value);
+      } else {
+        result[key] = value;
+      }
+    } else if (type === 'function') {
+      var prev = result[key];
+
+      if (prev == null) {
+        result[key] = value;
+      } else {
+        result[key] = composeEventHandler(prev, value);
+      }
+    } else if (type === 'object') {
+      result[key] = (0, _extends2.default)({}, result[key], value);
+    } // else `type` is 'bigint' or 'symbol', `value` is an invalid cellProp, ignore it
+
+  }
+
+  return result;
+}

package/lib/table/utils/others.d.ts

@@ -0,0 +1,16 @@
+export declare function flatMap<T, U>(array: T[], callback: (value: T, index: number, array: T[]) => U[]): U[];
+export declare function fromEntries<T = any>(entries: Iterable<readonly [PropertyKey, T]>): {
+    [x: string]: T;
+    [x: number]: T;
+};
+export declare const arrayUtils: {
+    readonly diff: (arr1: string[], arr2: Iterable<string>) => string[];
+    readonly merge: (arr1: string[], arr2: string[]) => string[];
+};
+export declare function always<T>(value: T): (...args: any[]) => T;
+interface treeItem {
+    children?: any[];
+    code?: string;
+}
+export declare function findByTree<T extends treeItem, U>(array: T[], callback: (value: T, index: number, array: T[]) => number): T;
+export {};