@antv/layout 0.3.11 → 1.0.0-alpha.0

package/lib/util/object.js

@@ -1,43 +0,0 @@
-"use strict";
-var __assign = (this && this.__assign) || function () {
-    __assign = Object.assign || function(t) {
-        for (var s, i = 1, n = arguments.length; i < n; i++) {
-            s = arguments[i];
-            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
-                t[p] = s[p];
-        }
-        return t;
-    };
-    return __assign.apply(this, arguments);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.clone = exports.isObject = void 0;
-var isObject = function (val) {
-    return val !== null && typeof val === 'object';
-};
-exports.isObject = isObject;
-var clone = function (target) {
-    if (target === null) {
-        return target;
-    }
-    if (target instanceof Date) {
-        return new Date(target.getTime());
-    }
-    if (target instanceof Array) {
-        var cp_1 = [];
-        target.forEach(function (v) {
-            cp_1.push(v);
-        });
-        return cp_1.map(function (n) { return (0, exports.clone)(n); });
-    }
-    if (typeof target === 'object' && Object.keys(target).length) {
-        var cp_2 = __assign({}, target);
-        Object.keys(cp_2).forEach(function (k) {
-            cp_2[k] = (0, exports.clone)(cp_2[k]);
-        });
-        return cp_2;
-    }
-    return target;
-};
-exports.clone = clone;
-//# sourceMappingURL=object.js.map

package/lib/util/object.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"object.js","sourceRoot":"","sources":["../../src/util/object.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AAAO,IAAM,QAAQ,GAAG,UAAC,GAAY;IACnC,OAAA,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ;AAAvC,CAAuC,CAAC;AAD7B,QAAA,QAAQ,YACqB;AAEnC,IAAM,KAAK,GAAG,UAAI,MAAS;IAChC,IAAI,MAAM,KAAK,IAAI,EAAE;QACnB,OAAO,MAAM,CAAC;KACf;IACD,IAAI,MAAM,YAAY,IAAI,EAAE;QAC1B,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAQ,CAAC;KAC1C;IACD,IAAI,MAAM,YAAY,KAAK,EAAE;QAC3B,IAAM,IAAE,GAAG,EAAW,CACrB;QAAC,MAAgB,CAAC,OAAO,CAAC,UAAC,CAAC;YAC3B,IAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,CAAC,CAAC,CAAC;QACH,OAAO,IAAE,CAAC,GAAG,CAAC,UAAC,CAAM,IAAK,OAAA,IAAA,aAAK,EAAM,CAAC,CAAC,EAAb,CAAa,CAAQ,CAAC;KACjD;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE;QAC5D,IAAM,IAAE,GAAG,aAAM,MAAiC,CAEjD,CAAC;QACF,MAAM,CAAC,IAAI,CAAC,IAAE,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC;YACxB,IAAE,CAAC,CAAC,CAAC,GAAG,IAAA,aAAK,EAAM,IAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;QACH,OAAO,IAAO,CAAC;KAChB;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAxBW,QAAA,KAAK,SAwBhB"}

package/lib/util/string.js

@@ -1,20 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.camelize = exports.isString = void 0;
-var isString = function (val) { return typeof val === 'string'; };
-exports.isString = isString;
-var cacheStringFunction = function (fn) {
-    var cache = Object.create(null);
-    return (function (str) {
-        var hit = cache[str];
-        return hit || (cache[str] = fn(str));
-    });
-};
-var camelizeRE = /-(\w)/g;
-exports.camelize = cacheStringFunction(function (str) {
-    return str.replace(camelizeRE, function (_, c) { return (c ? c.toUpperCase() : ''); });
-});
-// export const capitalize = cacheStringFunction(
-//   (str: string) => str.charAt(0).toUpperCase() + str.slice(1),
-// )
-//# sourceMappingURL=string.js.map

package/lib/util/string.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"string.js","sourceRoot":"","sources":["../../src/util/string.ts"],"names":[],"mappings":";;;AAAO,IAAM,QAAQ,GAAG,UAAC,GAAY,IAAoB,OAAA,OAAO,GAAG,KAAK,QAAQ,EAAvB,CAAuB,CAAC;AAApE,QAAA,QAAQ,YAA4D;AAEjF,IAAM,mBAAmB,GAAG,UAAoC,EAAK;IACnE,IAAM,KAAK,GAA2B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC1D,OAAO,CAAC,UAAC,GAAW;QAClB,IAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QACvB,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC,CAAQ,CAAC;AACZ,CAAC,CAAC;AAEF,IAAM,UAAU,GAAG,QAAQ,CAAC;AACf,QAAA,QAAQ,GAAG,mBAAmB,CAAC,UAAC,GAAW;IACtD,OAAO,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAA1B,CAA0B,CAAC,CAAC;AACvE,CAAC,CAAC,CAAC;AAEH,iDAAiD;AACjD,iEAAiE;AACjE,IAAI"}

package/src/index.ts

@@ -1,7 +0,0 @@
-import { registerLayout, unRegisterLayout, getLayoutByName } from "./registy";
-
-// register layout
-export { registerLayout, unRegisterLayout, getLayoutByName };
-
-// layout, layout types file, worker
-export * from "./layout";

package/src/layout/base.ts

@@ -1,57 +0,0 @@
-import { Node, Edge, Combo, Model, PointTuple } from './types';
-
-export class Base {
-  public nodes: Node[] | null = [];
-  public edges: Edge[] | null = [];
-  public combos: Combo[] | null = [];
-  public comboEdges: Edge[] | null = [];
-  public hiddenNodes: Node[] | null = [];
-  public hiddenEdges: Edge[] | null = [];
-  public hiddenCombos: Combo[] | null = [];
-  // temp edges e.g. the edge generated for releated collapsed combo
-  public vedges: Edge[] | null = [];
-  public positions: PointTuple[] | null = [];
-  public destroyed: boolean = false;
-  public onLayoutEnd: () => void = () => { }; 
-
-  public layout(data: Model): Model {
-    this.init(data);
-    return this.execute(true);
-  }
-
-  public init(data: Model) {
-    this.nodes = data.nodes || [];
-    this.edges = data.edges || [];
-    this.combos = data.combos || [];
-    this.comboEdges = data.comboEdges || [];
-    this.hiddenNodes = data.hiddenNodes || [];
-    this.hiddenEdges = data.hiddenEdges || [];
-    this.hiddenCombos = data.hiddenCombos || [];
-    this.vedges = data.vedges || [];
-  }
-
-  public execute(reloadData?: boolean): any {}
-  public executeWithWorker() {}
-
-  public getDefaultCfg() {
-    return {};
-  }
-
-  public updateCfg(cfg: any) {
-    if (cfg) {
-      Object.assign(this, cfg);
-    }
-  }
-
-  public getType() {
-    return 'base';
-  }
-
-  public destroy() {
-    this.nodes = null;
-    this.edges = null;
-    this.combos = null;
-    this.positions = null;
-    this.destroyed = true;
-  }
-}

package/src/layout/circular.ts

@@ -1,370 +0,0 @@
-/**
- * @fileOverview random layout
- * @author shiwu.wyy@antfin.com
- */
-
-import {
-  OutNode,
-  Edge,
-  PointTuple,
-  IndexMap,
-  CircularLayoutOptions,
-  Degree
-} from "./types";
-import { Base } from "./base";
-import { getDegree, clone, getEdgeTerminal, getFuncByUnknownType } from "../util";
-
-type INode = OutNode & {
-  degree: number;
-  size: number | PointTuple;
-  weight: number;
-  children: string[];
-  parent: string[];
-};
-
-function initHierarchy(
-  nodes: INode[],
-  edges: Edge[],
-  nodeMap: IndexMap,
-  directed: boolean
-) {
-  nodes.forEach((_, i: number) => {
-    nodes[i].children = [];
-    nodes[i].parent = [];
-  });
-  if (directed) {
-    edges.forEach((e) => {
-      const source = getEdgeTerminal(e, 'source');
-      const target = getEdgeTerminal(e, 'target');
-      let sourceIdx = 0;
-      if (source) {
-        sourceIdx = nodeMap[source];
-      }
-      let targetIdx = 0;
-      if (target) {
-        targetIdx = nodeMap[target];
-      }
-      const child = nodes[sourceIdx].children!;
-      const parent = nodes[targetIdx].parent!;
-      child.push(nodes[targetIdx].id);
-      parent.push(nodes[sourceIdx].id);
-    });
-  } else {
-    edges.forEach((e) => {
-      const source = getEdgeTerminal(e, 'source');
-      const target = getEdgeTerminal(e, 'target');
-      let sourceIdx = 0;
-      if (source) {
-        sourceIdx = nodeMap[source];
-      }
-      let targetIdx = 0;
-      if (target) {
-        targetIdx = nodeMap[target];
-      }
-      const sourceChildren = nodes[sourceIdx].children!;
-      const targetChildren = nodes[targetIdx].children!;
-      sourceChildren.push(nodes[targetIdx].id);
-      targetChildren.push(nodes[sourceIdx].id);
-    });
-  }
-}
-
-function connect(a: INode, b: INode, edges: Edge[]) {
-  const m = edges.length;
-  for (let i = 0; i < m; i++) {
-    const source = getEdgeTerminal(edges[i], 'source');
-    const target = getEdgeTerminal(edges[i], 'target');
-    if (
-      (a.id === source && b.id === target) ||
-      (b.id === source && a.id === target)
-    ) {
-      return true;
-    }
-  }
-  return false;
-}
-
-function compareDegree(a: INode, b: INode) {
-  const aDegree = a.degree!;
-  const bDegree = b.degree!;
-  if (aDegree < bDegree) {
-    return -1;
-  }
-  if (aDegree > bDegree) {
-    return 1;
-  }
-  return 0;
-}
-
-/**
- * 圆形布局
- */
-export class CircularLayout extends Base {
-  /** 布局中心 */
-  public center: PointTuple;
-
-  /** 固定半径，若设置了 radius，则 startRadius 与 endRadius 不起效 */
-  public radius: number | null = null;
-
-  /** 节点间距，若设置 nodeSpacing，则 radius 将被自动计算，即设置 radius 不生效 */
-  public nodeSpacing: ((d?: unknown) => number) | number | undefined;
-
-  /** 节点大小，配合 nodeSpacing，一起用于计算 radius。若不配置，节点大小默认为 30 */
-  public nodeSize: number | undefined = undefined;
-
-  /** 起始半径 */
-  public startRadius: number | null = null;
-
-  /** 终止半径 */
-  public endRadius: number | null = null;
-
-  /** 起始角度 */
-  public startAngle: number = 0;
-
-  /** 终止角度 */
-  public endAngle: number = 2 * Math.PI;
-
-  /** 是否顺时针 */
-  public clockwise: boolean = true;
-
-  /** 节点在环上分成段数（几个段将均匀分布），在 endRadius - startRadius != 0 时生效 */
-  public divisions: number = 1;
-
-  /** 节点在环上排序的依据，可选: 'topology', 'degree', 'null' */
-  public ordering: "topology" | "topology-directed" | "degree" | null = null;
-
-  /** how many 2*pi from first to last nodes */
-  public angleRatio = 1;
-
-  public nodes: INode[] = [];
-
-  public edges: Edge[] = [];
-
-  private nodeMap: IndexMap = {};
-
-  private degrees: Degree[] = [];
-
-  public width: number = 300;
-
-  public height: number = 300;
-
-  public onLayoutEnd: () => void;
-
-  constructor(options?: CircularLayoutOptions) {
-    super();
-    this.updateCfg(options);
-  }
-
-  public getDefaultCfg() {
-    return {
-      radius: null,
-      startRadius: null,
-      endRadius: null,
-      startAngle: 0,
-      endAngle: 2 * Math.PI,
-      clockwise: true,
-      divisions: 1,
-      ordering: null,
-      angleRatio: 1
-    };
-  }
-
-  /**
-   * 执行布局
-   */
-  public execute() {
-    const self = this;
-    const nodes = self.nodes;
-    const edges = self.edges;
-    const n = nodes.length;
-    if (n === 0) {
-      if (self.onLayoutEnd) self.onLayoutEnd();
-      return;
-    }
-
-    if (!self.width && typeof window !== "undefined") {
-      self.width = window.innerWidth;
-    }
-    if (!self.height && typeof window !== "undefined") {
-      self.height = window.innerHeight;
-    }
-    if (!self.center) {
-      self.center = [self.width / 2, self.height / 2];
-    }
-    const center = self.center;
-
-    if (n === 1) {
-      nodes[0].x = center[0];
-      nodes[0].y = center[1];
-      if (self.onLayoutEnd) self.onLayoutEnd();
-      return;
-    }
-
-    let { radius, startRadius, endRadius } = self;
-    const { divisions, startAngle, endAngle, angleRatio, ordering, clockwise, nodeSpacing: paramNodeSpacing, nodeSize: paramNodeSize } = self;
-    const angleStep = (endAngle - startAngle) / n;
-    // layout
-    const nodeMap: IndexMap = {};
-    nodes.forEach((node, i) => {
-      nodeMap[node.id] = i;
-    });
-    self.nodeMap = nodeMap;
-    const degrees = getDegree(nodes.length, nodeMap, edges);
-    self.degrees = degrees;
-    if (paramNodeSpacing) {
-      const nodeSpacing: Function = getFuncByUnknownType(10, paramNodeSpacing);
-      const nodeSize: Function = getFuncByUnknownType(10, paramNodeSize);
-      let maxNodeSize = -Infinity;
-      nodes.forEach((node) => {
-        const nSize = nodeSize(node);
-        if (maxNodeSize < nSize) maxNodeSize = nSize;
-      });
-      let length = 0;
-      nodes.forEach((node, i) => {
-        if (i === 0) length += (maxNodeSize || 10);
-        else length += (nodeSpacing(node) || 0) + (maxNodeSize || 10);
-      });
-      radius = length / (2 * Math.PI);
-    } else if (!radius && !startRadius && !endRadius) {
-      radius = self.height > self.width ? self.width / 2 : self.height / 2;
-    } else if (!startRadius && endRadius) {
-      startRadius = endRadius;
-    } else if (startRadius && !endRadius) {
-      endRadius = startRadius;
-    }
-    const astep = angleStep * angleRatio;
-
-    let layoutNodes = [];
-    if (ordering === "topology") {
-      // layout according to the topology
-      layoutNodes = self.topologyOrdering();
-    } else if (ordering === "topology-directed") {
-      // layout according to the topology
-      layoutNodes = self.topologyOrdering(true);
-    } else if (ordering === "degree") {
-      // layout according to the descent order of degrees
-      layoutNodes = self.degreeOrdering();
-    } else {
-      // layout according to the original order in the data.nodes
-      layoutNodes = nodes;
-    }
-
-    const divN = Math.ceil(n / divisions); // node number in each division
-    for (let i = 0; i < n; ++i) {
-      let r = radius;
-      if (!r && startRadius !== null && endRadius !== null) {
-        r = startRadius + (i * (endRadius - startRadius)) / (n - 1);
-      }
-      if (!r) {
-        r = 10 + (i * 100) / (n - 1);
-      }
-      let angle =
-        startAngle +
-        (i % divN) * astep +
-        ((2 * Math.PI) / divisions) * Math.floor(i / divN);
-      if (!clockwise) {
-        angle =
-          endAngle -
-          (i % divN) * astep -
-          ((2 * Math.PI) / divisions) * Math.floor(i / divN);
-      }
-      layoutNodes[i].x = center[0] + Math.cos(angle) * r;
-      layoutNodes[i].y = center[1] + Math.sin(angle) * r;
-      layoutNodes[i].weight = degrees[i].all;
-    }
-
-    self.onLayoutEnd?.();
-
-    return {
-      nodes: layoutNodes,
-      edges: this.edges
-    };
-  }
-
-  /**
-   * 根据节点的拓扑结构排序
-   * @return {array} orderedNodes 排序后的结果
-   */
-  public topologyOrdering(directed: boolean = false) {
-    const self = this;
-    const degrees = self.degrees;
-    const edges = self.edges;
-    const nodes = self.nodes;
-    const cnodes = clone(nodes);
-    const nodeMap = self.nodeMap;
-    const orderedCNodes = [cnodes[0]];
-    const resNodes = [nodes[0]];
-    const pickFlags: boolean[] = [];
-    const n = nodes.length;
-    pickFlags[0] = true;
-    initHierarchy(cnodes, edges, nodeMap, directed);
-    let k = 0;
-    cnodes.forEach((cnode, i) => {
-      if (i !== 0) {
-        if (
-          (i === n - 1 ||
-            degrees[i].all !== degrees[i + 1].all ||
-            connect(
-              orderedCNodes[k],
-              cnode,
-              edges
-            )) &&
-          !pickFlags[i]
-        ) {
-          orderedCNodes.push(cnode);
-          resNodes.push(nodes[nodeMap[cnode.id]]);
-          pickFlags[i] = true;
-          k++;
-        } else {
-          const children = orderedCNodes[k].children!;
-          let foundChild = false;
-          for (let j = 0; j < children.length; j++) {
-            const childIdx = nodeMap[children[j]];
-            if (degrees[childIdx].all === degrees[i].all && !pickFlags[childIdx]) {
-              orderedCNodes.push(cnodes[childIdx]);
-              resNodes.push(nodes[nodeMap[cnodes[childIdx].id]]);
-              pickFlags[childIdx] = true;
-              foundChild = true;
-              break;
-            }
-          }
-          let ii = 0;
-          while (!foundChild) {
-            if (!pickFlags[ii]) {
-              orderedCNodes.push(cnodes[ii]);
-              resNodes.push(nodes[nodeMap[cnodes[ii].id]]);
-              pickFlags[ii] = true;
-              foundChild = true;
-            }
-            ii++;
-            if (ii === n) {
-              break;
-            }
-          }
-        }
-      }
-    });
-    return resNodes;
-  }
-
-  /**
-   * 根据节点度数大小排序
-   * @return {array} orderedNodes 排序后的结果
-   */
-  public degreeOrdering(): INode[] {
-    const self = this;
-    const nodes = self.nodes;
-    const orderedNodes: INode[] = [];
-    const degrees = self.degrees;
-    nodes.forEach((node, i) => {
-      node.degree = degrees[i].all;
-      orderedNodes.push(node);
-    });
-    orderedNodes.sort(compareDegree);
-    return orderedNodes;
-  }
-
-  public getType() {
-    return "circular";
-  }
-}