@kdcloudjs/table 1.0.0

package/es/table/utils/makeRecursiveMapper.js

@@ -0,0 +1,76 @@
+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";
+import _toConsumableArray from "@babel/runtime-corejs3/helpers/toConsumableArray";
+import _extends from "@babel/runtime-corejs3/helpers/extends";
+import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/slice";
+
+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';
+export default 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 (isLeafNode(node)) {
+            subResult = fn(node, {
+              // parentStartIndex,
+              startIndex: startIndex,
+              endIndex: startIndex + 1,
+              path: _sliceInstanceProperty(path).call(path),
+              isLeaf: true
+            });
+            flatCount += 1;
+          } else {
+            var dfsResult = dfs(node.children, startIndex, path);
+            subResult = fn(_extends(_extends({}, node), {
+              children: dfsResult.result
+            }), {
+              startIndex: startIndex,
+              endIndex: startIndex + dfsResult.flatCount,
+              path: _sliceInstanceProperty(path).call(path),
+              isLeaf: false
+            });
+            flatCount += dfsResult.flatCount;
+          }
+
+          if (Array.isArray(subResult)) {
+            result.push.apply(result, _toConsumableArray(subResult));
+          } else if (subResult != null) {
+            result.push(subResult);
+          }
+
+          path.pop();
+        }
+      } catch (err) {
+        _iterator.e(err);
+      } finally {
+        _iterator.f();
+      }
+
+      return {
+        result: result,
+        flatCount: flatCount
+      };
+    }
+  };
+}

package/es/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/es/table/utils/mergeCellProps.js

@@ -0,0 +1,67 @@
+import _typeof from "@babel/runtime-corejs3/helpers/typeof";
+import _extends from "@babel/runtime-corejs3/helpers/extends";
+import _Object$keys2 from "@babel/runtime-corejs3/core-js-stable/object/keys";
+import cx from '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 将合并两个对象 */
+
+
+export default function mergeCellProps(base, extra) {
+  if (base == null) {
+    return extra;
+  }
+
+  if (extra == null) {
+    return base;
+  }
+
+  var result = _extends({}, base);
+
+  for (var _i = 0, _Object$keys = _Object$keys2(extra); _i < _Object$keys.length; _i++) {
+    var key = _Object$keys[_i];
+    var value = extra[key];
+
+    var type = _typeof(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] = cx(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] = _extends({}, result[key], value);
+    } // else `type` is 'bigint' or 'symbol', `value` is an invalid cellProp, ignore it
+
+  }
+
+  return result;
+}

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

package/es/table/utils/others.js

@@ -0,0 +1,80 @@
+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";
+import _slicedToArray from "@babel/runtime-corejs3/helpers/slicedToArray";
+import _toConsumableArray from "@babel/runtime-corejs3/helpers/toConsumableArray";
+import _Set from "@babel/runtime-corejs3/core-js-stable/set";
+import _filterInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/filter";
+import _concatInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/concat";
+import _findInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/find";
+
+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 function flatMap(array, callback) {
+  var result = [];
+  array.forEach(function (value, index) {
+    result.push.apply(result, _toConsumableArray(callback(value, index, array)));
+  });
+  return result;
+}
+export function fromEntries(entries) {
+  var result = {};
+
+  var _iterator = _createForOfIteratorHelper(entries),
+      _step;
+
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var _step$value = _slicedToArray(_step.value, 2),
+          key = _step$value[0],
+          value = _step$value[1];
+
+      result[key] = value;
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+
+  return result;
+}
+export var arrayUtils = {
+  diff: function diff(arr1, arr2) {
+    var set = new _Set(arr2);
+    return _filterInstanceProperty(arr1).call(arr1, function (x) {
+      return !set.has(x);
+    });
+  },
+  merge: function merge(arr1, arr2) {
+    var set = new _Set(arr1);
+    return _concatInstanceProperty(arr1).call(arr1, _filterInstanceProperty(arr2).call(arr2, function (x) {
+      return !set.has(x);
+    }));
+  }
+};
+export function always(value) {
+  return function () {
+    return value;
+  };
+}
+export function findByTree(array, callback) {
+  return _findInstanceProperty(array).call(array, function (item, index) {
+    var result = false;
+    var findedIndex = callback(item, index, array);
+
+    if (findedIndex >= 0) {
+      result = true;
+    } else if (item.children) {
+      result = findByTree(item.children, callback);
+    }
+
+    return result;
+  });
+}

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

@@ -0,0 +1,21 @@
+declare type SameKeysWith<T> = T extends object ? {
+    [key in keyof T]?: any;
+} : T;
+interface ObjectProto<T> {
+    (v: SameKeysWith<T>): T;
+    extends(ext: SameKeysWith<T>): ObjectProto<T>;
+}
+interface ArrayProto<T> {
+    (items: SameKeysWith<T>[]): T[];
+    extends(extRecord: SameKeysWith<T>): ArrayProto<T>;
+}
+export interface ProtoStatic {
+    string(v: string): string;
+    number(v: number): number;
+    notNull<T = any>(v: any): T;
+    object<O extends object = any>(base: SameKeysWith<O>): ObjectProto<O>;
+    array<T extends object = any>(base: SameKeysWith<T>): ArrayProto<T>;
+    readonly empty: unique symbol;
+}
+declare const _default: ProtoStatic;
+export default _default;

package/es/table/utils/proto.js

@@ -0,0 +1,106 @@
+import _extends from "@babel/runtime-corejs3/helpers/extends";
+import _Symbol from "@babel/runtime-corejs3/core-js-stable/symbol";
+import _Object$keys from "@babel/runtime-corejs3/core-js-stable/object/keys";
+import _mapInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/map";
+
+var factorySymbol = _Symbol('factory-symbol');
+
+function isProtoFactory(v) {
+  return v && v[factorySymbol];
+}
+
+function proto(baseRecord) {
+  var ensureArray = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'auto';
+
+  var baseKeys = _Object$keys(baseRecord);
+
+  function process(record) {
+    var result = _extends({}, record);
+
+    baseKeys.forEach(function (key) {
+      var _a;
+
+      if (result[key] === proto.empty) {
+        delete result[key];
+        return;
+      }
+
+      var base = baseRecord[key];
+
+      if (isProtoFactory(base)) {
+        result[key] = base(result[key]);
+      } else {
+        result[key] = (_a = result[key]) !== null && _a !== void 0 ? _a : base;
+      }
+    });
+    return result;
+  }
+
+  function factory(arg) {
+    var isEnsureArray = ensureArray === 'auto' ? Array.isArray(arg) : ensureArray;
+
+    if (isEnsureArray) {
+      if (arg == null) {
+        return [];
+      }
+
+      return _mapInstanceProperty(arg).call(arg, process);
+    } else {
+      return process(arg);
+    }
+  } // @ts-ignore
+
+
+  factory[factorySymbol] = true;
+
+  factory.extends = function (extRecord) {
+    var extFactory = proto(extRecord, ensureArray);
+    return function (arg) {
+      return factory(extFactory(arg));
+    };
+  };
+
+  return factory;
+}
+
+proto.empty = _Symbol('proto.empty');
+
+proto.string = function (v) {
+  if (v != null && typeof v !== 'string') {
+    throw new Error('must be string');
+  }
+
+  return v;
+};
+
+proto.string[factorySymbol] = true;
+
+proto.number = function (v) {
+  if (v != null && typeof v !== 'number') {
+    throw new Error('must be number');
+  }
+
+  return v;
+};
+
+proto.number[factorySymbol] = true;
+
+proto.notNull = function (v) {
+  if (v == null) {
+    throw new Error('must be not null');
+  }
+
+  return v;
+};
+
+proto.notNull[factorySymbol] = true;
+
+proto.object = function (baseRecord) {
+  return proto(baseRecord, false);
+};
+
+proto.array = function (baseRecord) {
+  return proto(baseRecord, true);
+};
+
+export default proto;

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

@@ -0,0 +1,9 @@
+/** 比较函数，支持字符串、数字、数组和 null。
+ * * 对于字符串将比较两者的字典序；
+ * * 对数字将比较两者大小；
+ * * null 值在比较时总是小于另一个值；
+ * * 对于数组来说，将逐个比较数组中的元素，第一个不相等的比较结果将作为整个数组的比较结果
+ *
+ * 数组的比较可参考 python 中的元祖比较：
+ * https://stackoverflow.com/questions/5292303/how-does-tuple-comparison-work-in-python */
+export default function smartCompare(x: any, y: any): number;

package/es/table/utils/smartCompare.js

@@ -0,0 +1,51 @@
+/** 比较函数，支持字符串、数字、数组和 null。
+ * * 对于字符串将比较两者的字典序；
+ * * 对数字将比较两者大小；
+ * * null 值在比较时总是小于另一个值；
+ * * 对于数组来说，将逐个比较数组中的元素，第一个不相等的比较结果将作为整个数组的比较结果
+ *
+ * 数组的比较可参考 python 中的元祖比较：
+ * https://stackoverflow.com/questions/5292303/how-does-tuple-comparison-work-in-python */
+export default function smartCompare(x, y) {
+  // 将 null 排在最后面
+  if (x == null) {
+    return 1;
+  }
+
+  if (y == null) {
+    return -1;
+  }
+
+  if (typeof x === 'number' && typeof y === 'number') {
+    return x - y;
+  }
+
+  if (typeof x === 'string' && typeof y === 'string') {
+    // 字符串使用 默认的字典序
+    if (x < y) {
+      return -1;
+    } else if (x > y) {
+      return 1;
+    } else {
+      return 0;
+    }
+  }
+
+  if (Array.isArray(x) && Array.isArray(y)) {
+    var len = Math.min(x.length, y.length);
+
+    for (var i = 0; i < len; i++) {
+      var cmp = smartCompare(x[i], y[i]);
+
+      if (cmp !== 0) {
+        return cmp;
+      }
+    } // 数组长度不等时，元素少的字段放在前面
+
+
+    return x.length - y.length;
+  } // 对于不认识的数据类型，返回 0
+
+
+  return 0;
+}

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

@@ -0,0 +1,11 @@
+import { ArtColumn, TableTransform } from '../interfaces';
+declare type NormalizeAsArrayInput<T> = null | T | T[];
+/** @deprecated 该 API 已经过时，请使用 makeRecursiveMapper */
+export default function traverseColumn(fn: (column: ArtColumn, ctx: {
+    range: {
+        start: number;
+        end: number;
+    };
+    dataSource: any[];
+}) => NormalizeAsArrayInput<ArtColumn>): TableTransform;
+export {};

package/es/table/utils/traverseColumn.js

@@ -0,0 +1,88 @@
+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";
+import _toConsumableArray from "@babel/runtime-corejs3/helpers/toConsumableArray";
+import _extends from "@babel/runtime-corejs3/helpers/extends";
+
+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';
+
+function normalizeAsArray(input) {
+  if (input == null) {
+    return [];
+  } else if (Array.isArray(input)) {
+    return input;
+  } else {
+    return [input];
+  }
+}
+/** @deprecated 该 API 已经过时，请使用 makeRecursiveMapper */
+
+
+export default function traverseColumn(fn) {
+  return function (_ref) {
+    var columns = _ref.columns,
+        dataSource = _ref.dataSource;
+    return {
+      dataSource: dataSource,
+      columns: dfs(columns, 0).result
+    };
+
+    function dfs(columns, parentStartColIndex) {
+      var flatColCount = 0;
+      var result = [];
+
+      var _iterator = _createForOfIteratorHelper(columns),
+          _step;
+
+      try {
+        for (_iterator.s(); !(_step = _iterator.n()).done;) {
+          var col = _step.value;
+          var startColIndex = parentStartColIndex + flatColCount;
+          var unNormalized = void 0;
+
+          if (isLeafNode(col)) {
+            unNormalized = fn(col, {
+              range: {
+                start: startColIndex,
+                end: startColIndex + 1
+              },
+              dataSource: dataSource
+            });
+            flatColCount += 1;
+          } else {
+            var dfsResult = dfs(col.children, startColIndex);
+            unNormalized = fn(_extends(_extends({}, col), {
+              children: dfsResult.result
+            }), {
+              range: {
+                start: startColIndex,
+                end: startColIndex + dfsResult.flatColCount
+              },
+              dataSource: dataSource
+            });
+            flatColCount += dfsResult.flatColCount;
+          }
+
+          result.push.apply(result, _toConsumableArray(normalizeAsArray(unNormalized)));
+        }
+      } catch (err) {
+        _iterator.e(err);
+      } finally {
+        _iterator.f();
+      }
+
+      return {
+        result: result,
+        flatColCount: flatColCount
+      };
+    }
+  };
+}

package/es/table/utils/tree-data-helpers/StrictTreeDataHelper.d.ts

@@ -0,0 +1,22 @@
+import { AbstractTreeNode } from '../../interfaces';
+export interface StrictTreeDataHelperOptions<N extends AbstractTreeNode> {
+    tree: N[];
+    getNodeValue(node: N): string;
+    value: string[];
+}
+export default class StrictTreeDataHelper<N extends AbstractTreeNode> {
+    private readonly opts;
+    private readonly valueSet;
+    private wrapperMap;
+    private rootWrapper;
+    constructor(opts: StrictTreeDataHelperOptions<N>);
+    private initWrapperTree;
+    private get value();
+    isIndeterminate(nodeValue: string): boolean;
+    isChecked(nodeValue: string): boolean;
+    getValueAfterCheck(nodeValue: string): string[];
+    getValueAfterUncheck(nodeValue: string): string[];
+    getValueAfterToggle(nodeValue: string): string[];
+    getNode(nodeValue: string): N;
+    getCleanValue(): string[];
+}