ebaoferc 0.0.1 → 0.0.2-beta.0

package/dist/components/MindGraph/core/helper/descendant.js

@@ -0,0 +1,28 @@
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { 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 = it.call(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) { 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 _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; }
+/**
+ * 获取某个节点的所有后代
+ * @param node 节点
+ */
+export var descendant = function descendant(node) {
+  var result = [];
+  var recursion = function recursion() {
+    var nodes = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
+    var _iterator = _createForOfIteratorHelper(nodes),
+      _step;
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var disposeNode = _step.value;
+        result.push(disposeNode);
+        recursion(disposeNode.children);
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+  };
+  recursion(node.children);
+  return result;
+};

package/dist/components/MindGraph/core/helper/error.d.ts

@@ -0,0 +1 @@
+export declare const error: (message: string) => Error;

package/dist/components/MindGraph/core/helper/error.js

@@ -0,0 +1,3 @@
+export var error = function error(message) {
+  return new Error("".concat(message));
+};

package/dist/components/MindGraph/core/helper/get-layout-calc-children.d.ts

@@ -0,0 +1,10 @@
+import { Mind } from '../index';
+import { Process } from '../process';
+/**
+ * 获取用于布局计算的子代
+ * - 剔除掉被折叠的部分
+ * @param node
+ * @param rootId
+ * @param getRootHeirOrientation
+ */
+export declare const getLayoutCalcChildren: (node: Mind.Node, rootId: string, getRootHeirOrientation: Process.getRootHeirOrientationFunc) => Mind.Node[];

package/dist/components/MindGraph/core/helper/get-layout-calc-children.js

@@ -0,0 +1,37 @@
+import { Mind } from "../index";
+import { Helper } from "./index";
+
+/**
+ * 获取用于布局计算的子代
+ * - 剔除掉被折叠的部分
+ * @param node
+ * @param rootId
+ * @param getRootHeirOrientation
+ */
+export var getLayoutCalcChildren = function getLayoutCalcChildren(node, rootId, getRootHeirOrientation) {
+  // 判断是否所有子代都折叠了
+  if (Helper.judgeIfAllChildFold(node, rootId)) {
+    return [];
+  }
+  var children = node.children || [];
+  // 非根节点，则直接返回子代（非根节点只有一侧子代）
+  if (node.id !== rootId) {
+    return children;
+  } else {
+    var fold = node.fold || [];
+    // 只有 negative 折叠
+    if (fold[0]) {
+      return children.filter(function (item) {
+        return getRootHeirOrientation(item.id) === Mind.Orientation.positive;
+      });
+    }
+
+    // 只有 positive 折叠
+    if (fold[1]) {
+      return children.filter(function (item) {
+        return getRootHeirOrientation(item.id) === Mind.Orientation.negative;
+      });
+    }
+    return children;
+  }
+};

package/dist/components/MindGraph/core/helper/get-svg-path-id.d.ts

@@ -0,0 +1 @@
+export declare const getSvgPathId: (id: string) => string;

package/dist/components/MindGraph/core/helper/get-svg-path-id.js

@@ -0,0 +1,4 @@
+import { withPrefix } from "./with-prefix";
+export var getSvgPathId = function getSvgPathId(id) {
+  return withPrefix("line-".concat(id));
+};

package/dist/components/MindGraph/core/helper/index.d.ts

@@ -0,0 +1,23 @@
+export declare const Helper: {
+    breadthFirstWalkTree: (node: import("..").Mind.Node, callback: {
+        before: (node: import("..").Mind.Node) => boolean;
+        after: (rank: import("..").Mind.Node[]) => void;
+    }) => void;
+    depthFirstWalkTree: (root: import("..").Mind.Node, callback: {
+        before: (node: import("..").Mind.Node, parent?: import("..").Mind.Node | undefined) => boolean;
+        after: (node: import("..").Mind.Node, parent?: import("..").Mind.Node | undefined) => void;
+    }) => void;
+    descendant: (node: import("..").Mind.Node) => import("..").Mind.Node[];
+    error: (message: string) => Error;
+    getLayoutCalcChildren: (node: import("..").Mind.Node, rootId: string, getRootHeirOrientation: import("../process").Process.getRootHeirOrientationFunc) => import("..").Mind.Node[];
+    getSvgPathId: (id: string) => string;
+    judgeIfAllChildFold: (node: import("..").Mind.Node, rootId: string) => boolean;
+    judgeIfHeirAndFold: (node: import("..").Mind.Node, parent: import("..").Mind.Node | undefined, root: import("..").Mind.Root, getRootHeirOrientation: import("../process").Process.getRootHeirOrientationFunc) => boolean;
+    judgeIfVisualLeaf: (node: import("..").Mind.Node, children?: import("..").Mind.Node[] | undefined) => boolean | boolean[] | undefined;
+    rootToNodeArray: (root: import("..").Mind.Root, callback: (node: import("..").Mind.Node) => void) => import("..").Mind.Node[];
+    transformRootToWalkable: (root: import("..").Mind.Root) => {
+        getRootHeirOrientation: (id: string) => import("..").Mind.Orientation;
+        shadowNode: import("..").Mind.Node;
+    };
+    withPrefix: (message: string) => string;
+};

package/dist/components/MindGraph/core/helper/index.js

@@ -0,0 +1,26 @@
+import { breadthFirstWalkTree } from "./breadth-first-walk-tree";
+import { depthFirstWalkTree } from "./depth-first-walk-tree";
+import { descendant } from "./descendant";
+import { error } from "./error";
+import { getLayoutCalcChildren } from "./get-layout-calc-children";
+import { getSvgPathId } from "./get-svg-path-id";
+import { judgeIfAllChildFold } from "./judge-if-all-child-fold";
+import { judgeIfHeirAndFold } from "./judge-if-heir-and-fold";
+import { judgeIfVisualLeaf } from "./judge-if-visual-leaf";
+import { rootToNodeArray } from "./root-to-node-array";
+import { transformRootToWalkable } from "./transform-root-to-walkable";
+import { withPrefix } from "./with-prefix";
+export var Helper = {
+  breadthFirstWalkTree: breadthFirstWalkTree,
+  depthFirstWalkTree: depthFirstWalkTree,
+  descendant: descendant,
+  error: error,
+  getLayoutCalcChildren: getLayoutCalcChildren,
+  getSvgPathId: getSvgPathId,
+  judgeIfAllChildFold: judgeIfAllChildFold,
+  judgeIfHeirAndFold: judgeIfHeirAndFold,
+  judgeIfVisualLeaf: judgeIfVisualLeaf,
+  rootToNodeArray: rootToNodeArray,
+  transformRootToWalkable: transformRootToWalkable,
+  withPrefix: withPrefix
+};

package/dist/components/MindGraph/core/helper/judge-if-all-child-fold.d.ts

@@ -0,0 +1,7 @@
+import { Mind } from '../index';
+/**
+ * 判断节点是否所有子代都需要被折叠
+ * @param node
+ * @param rootId
+ */
+export declare const judgeIfAllChildFold: (node: Mind.Node, rootId: string) => boolean;

package/dist/components/MindGraph/core/helper/judge-if-all-child-fold.js

@@ -0,0 +1,14 @@
+/**
+ * 判断节点是否所有子代都需要被折叠
+ * @param node
+ * @param rootId
+ */
+export var judgeIfAllChildFold = function judgeIfAllChildFold(node, rootId) {
+  if (node.id === rootId) {
+    return !!node.fold && Array.from(node.fold).length > 0 && Array.from(node.fold).every(function (item) {
+      return item;
+    });
+  } else {
+    return !!node.fold;
+  }
+};

package/dist/components/MindGraph/core/helper/judge-if-heir-and-fold.d.ts

@@ -0,0 +1,10 @@
+import { Mind } from '../index';
+import { Process } from '../process';
+/**
+ * 判断节点是否为root直系子代并且已经被折叠了
+ * @param node
+ * @param parent
+ * @param root
+ * @param getRootHeirOrientation
+ */
+export declare const judgeIfHeirAndFold: (node: Mind.Node, parent: Mind.Node | undefined, root: Mind.Root, getRootHeirOrientation: Process.getRootHeirOrientationFunc) => boolean;

package/dist/components/MindGraph/core/helper/judge-if-heir-and-fold.js

@@ -0,0 +1,26 @@
+import { Mind } from "../index";
+/**
+ * 判断节点是否为root直系子代并且已经被折叠了
+ * @param node
+ * @param parent
+ * @param root
+ * @param getRootHeirOrientation
+ */
+export var judgeIfHeirAndFold = function judgeIfHeirAndFold(node, parent, root, getRootHeirOrientation) {
+  // 是否为根节点直系子代
+  var isRootChild = (parent === null || parent === void 0 ? void 0 : parent.id) === root.node.id;
+  // 保证后续处理节点的节点都没有被折叠
+  // 此处处理根节点只有左侧折叠或者右侧折叠的情况
+  if (isRootChild && root.node.fold) {
+    // negative 折叠，并且节点为root直系negative
+    if (root.node.fold[0] && getRootHeirOrientation(node.id) === Mind.Orientation.negative) {
+      return true;
+    }
+
+    // positive 折叠，并且节点为root直系positive
+    if (root.node.fold[1] && getRootHeirOrientation(node.id) === Mind.Orientation.positive) {
+      return true;
+    }
+  }
+  return false;
+};

package/dist/components/MindGraph/core/helper/judge-if-visual-leaf.d.ts

@@ -0,0 +1,6 @@
+import { Mind } from '../index';
+/**
+ * 判断节点是否为视觉上的叶节点
+ * - 子代被折叠也算视觉上叶节点
+ */
+export declare const judgeIfVisualLeaf: (node: Mind.Node, children?: Mind.Node[]) => boolean | boolean[] | undefined;

package/dist/components/MindGraph/core/helper/judge-if-visual-leaf.js

@@ -0,0 +1,7 @@
+/**
+ * 判断节点是否为视觉上的叶节点
+ * - 子代被折叠也算视觉上叶节点
+ */
+export var judgeIfVisualLeaf = function judgeIfVisualLeaf(node, children) {
+  return !children || children.length === 0 || node.fold;
+};

package/dist/components/MindGraph/core/helper/root-to-node-array.d.ts

@@ -0,0 +1,2 @@
+import { Mind } from '../index';
+export declare const rootToNodeArray: (root: Mind.Root, callback: (node: Mind.Node) => void) => Mind.Node[];

package/dist/components/MindGraph/core/helper/root-to-node-array.js

@@ -0,0 +1,27 @@
+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; }
+export var rootToNodeArray = function rootToNodeArray(root, callback) {
+  var result = [];
+  callback(root.node);
+  result.push(root.node);
+  var dispose = [].concat(_toConsumableArray(root.negative || []), _toConsumableArray(root.positive || []));
+  var _loop = function _loop() {
+    var cache = [];
+    dispose.forEach(function (item) {
+      callback(item);
+      result.push(item);
+    });
+    dispose.forEach(function (item) {
+      return cache.push.apply(cache, _toConsumableArray(item.children || []));
+    });
+    dispose = cache;
+  };
+  while (dispose.length) {
+    _loop();
+  }
+  return result;
+};

package/dist/components/MindGraph/core/helper/transform-root-to-walkable.d.ts

@@ -0,0 +1,5 @@
+import { Mind } from '../index';
+export declare const transformRootToWalkable: (root: Mind.Root) => {
+    getRootHeirOrientation: (id: string) => Mind.Orientation;
+    shadowNode: Mind.Node;
+};

package/dist/components/MindGraph/core/helper/transform-root-to-walkable.js

@@ -0,0 +1,32 @@
+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); }
+import { Mind } from "../index";
+export var transformRootToWalkable = function transformRootToWalkable(root) {
+  var negative = root.negative || [];
+  var positive = root.positive || [];
+  var shadowNode = _objectSpread({}, root.node);
+  shadowNode.children = [].concat(_toConsumableArray(negative), _toConsumableArray(positive));
+  var cache = new Map();
+  negative.forEach(function (item) {
+    return cache.set(item.id, Mind.Orientation.negative);
+  });
+  positive.forEach(function (item) {
+    return cache.set(item.id, Mind.Orientation.positive);
+  });
+  return {
+    getRootHeirOrientation: function getRootHeirOrientation(id) {
+      return cache.get(id);
+    },
+    shadowNode: shadowNode
+  };
+};

package/dist/components/MindGraph/core/helper/with-prefix.d.ts

@@ -0,0 +1 @@
+export declare const withPrefix: (message: string) => string;

package/dist/components/MindGraph/core/helper/with-prefix.js

@@ -0,0 +1,3 @@
+export var withPrefix = function withPrefix(message) {
+  return "mind__".concat(message);
+};