@antv/layout 0.2.0 → 0.2.3

package/src/util/gpu.ts

@@ -0,0 +1,254 @@
+import { OutNode, Edge, IndexMap } from '../layout/types';
+import { isNumber } from './';
+import { getEdgeTerminal } from './math';
+
+
+/**
+ * 将 number | Function 类型的参数转换为 return number 的 Function
+ * @param  {number | Function}  value 需要被转换的值
+ * @param  {number}  defaultV 返回函数的默认返回值
+ * @return {Function} 转换后的函数 
+ */
+export const proccessToFunc = (value: number | Function | undefined, defaultV?: number): ((d?: any) => number) => {
+  let func;
+  if (!value) {
+      func = () => {
+          return defaultV || 1;
+      };
+  } else if (isNumber(value)) {
+      func = () => {
+          return value;
+      };
+  } else {
+      func = value;
+  }
+  return func as ((d?: any) => number);
+};
+
+/**
+ * 将节点和边数据转换为 GPU 可读的数组。并返回 maxEdgePerVetex，每个节点上最多的边数
+ * @param  {NodeConfig[]}  nodes 需要被转换的值
+ * @param  {EdgeConfig[]}  edges 返回函数的默认返回值
+ * @return {Object} 转换后的数组及 maxEdgePerVetex 组成的对象
+ */
+export const buildTextureData = (nodes: OutNode[], edges: Edge[]): {
+  array: Float32Array,
+  maxEdgePerVetex: number
+} => {
+  const dataArray = [];
+  const nodeDict: any = [];
+  const mapIdPos: IndexMap = {};
+  let i = 0;
+  for (i = 0; i < nodes.length; i++) {
+    const n = nodes[i];
+    mapIdPos[n.id] = i;
+    dataArray.push(n.x);
+    dataArray.push(n.y);
+    dataArray.push(0);
+    dataArray.push(0);
+    nodeDict.push([]);
+  }
+  for (i = 0; i < edges.length; i++) {
+    const e = edges[i];
+    const source = getEdgeTerminal(e, 'source');
+    const target = getEdgeTerminal(e, 'target');
+    nodeDict[mapIdPos[source]].push(mapIdPos[target]);
+    nodeDict[mapIdPos[target]].push(mapIdPos[source]);
+  }
+
+  let maxEdgePerVetex = 0;
+  for (i = 0; i < nodes.length; i++) {
+    const offset: number = dataArray.length;
+    const dests = nodeDict[i];
+    const len = dests.length;
+    dataArray[i * 4 + 2] = offset;
+    dataArray[i * 4 + 3] = dests.length;
+    maxEdgePerVetex = Math.max(maxEdgePerVetex, dests.length);
+    for (let j = 0; j < len; ++j) {
+    const dest = dests[j];
+    dataArray.push(+dest);
+    }
+  }
+
+  while (dataArray.length % 4 !== 0) {
+      dataArray.push(0);
+  }
+  return {
+    maxEdgePerVetex,
+    array: new Float32Array(dataArray),
+  };
+};
+
+/**
+* 将节点和边数据转换为 GPU 可读的数组，每条边带有一个属性。并返回 maxEdgePerVetex，每个节点上最多的边数
+* @param  {NodeConfig[]}  nodes 节点数组
+* @param  {EdgeConfig[]}  edges 边数组
+* @param  {Function}  attrs 读取边属性的函数
+* @return {Object} 转换后的数组及 maxEdgePerVetex 组成的对象
+*/
+// export const buildTextureDataWithOneEdgeAttr = (nodes: OutNode[], edges: Edge[], attrs: Function): {
+//   array: Float32Array,
+//   maxEdgePerVetex: number
+// } => {
+//   const dataArray = [];
+//   const nodeDict: any = [];
+//   const mapIdPos: IndexMap = {};
+//   let i = 0;
+//   for (i = 0; i < nodes.length; i++) {
+//       const n = nodes[i];
+//       mapIdPos[n.id] = i;
+//       dataArray.push(n.x);
+//       dataArray.push(n.y);
+//       dataArray.push(0);
+//       dataArray.push(0);
+//       nodeDict.push([]);
+//   }
+//   for (i = 0; i < edges.length; i++) {
+//       const e = edges[i];
+//       nodeDict[mapIdPos[e.source]].push(mapIdPos[e.target]);
+//       nodeDict[mapIdPos[e.source]].push(attrs(e)); // 理想边长，后续可以改成每条边不同
+//       nodeDict[mapIdPos[e.target]].push(mapIdPos[e.source]);
+//       nodeDict[mapIdPos[e.target]].push(attrs(e)); // 理想边长，后续可以改成每条边不同
+//   }
+
+//   let maxEdgePerVetex = 0;
+//   for (i = 0; i < nodes.length; i++) {
+//       const offset: number = dataArray.length;
+//       const dests = nodeDict[i]; // dest 中节点 id 与边长间隔存储，即一位节点 id，一位边长……
+//       const len = dests.length;
+//       dataArray[i * 4 + 2] = offset;
+//       dataArray[i * 4 + 3] = len / 2; // 第四位存储与该节点相关的所有节点个数
+//       maxEdgePerVetex = Math.max(maxEdgePerVetex, len / 2);
+//       for (let j = 0; j < len; ++j) {
+//           const dest = dests[j];
+//           dataArray.push(+dest);
+//       }
+//   }
+
+//   // 不是 4 的倍数，填充 0
+//   while (dataArray.length % 4 !== 0) {
+//       dataArray.push(0);
+//   }
+//   return {
+//       array: new Float32Array(dataArray),
+//       maxEdgePerVetex
+//   }
+// }
+
+/**
+* 将节点和边数据转换为 GPU 可读的数组，每条边带有一个以上属性。并返回 maxEdgePerVetex，每个节点上最多的边数
+* @param  {NodeConfig[]}  nodes 节点数组
+* @param  {EdgeConfig[]}  edges 边数组
+* @param  {Function}  attrs 读取边属性的函数
+* @return {Object} 转换后的数组及 maxEdgePerVetex 组成的对象
+*/
+export const buildTextureDataWithTwoEdgeAttr = (nodes: OutNode[], edges: Edge[], attrs1: Function, attrs2: Function): {
+  array: Float32Array,
+  maxEdgePerVetex: number
+} => {
+  const dataArray = [];
+  const nodeDict: any = [];
+  const mapIdPos: IndexMap = {};
+  let i = 0;
+  for (i = 0; i < nodes.length; i++) {
+    const n = nodes[i];
+    mapIdPos[n.id] = i;
+    dataArray.push(n.x);
+    dataArray.push(n.y);
+    dataArray.push(0);
+    dataArray.push(0);
+    nodeDict.push([]);
+  }
+  for (i = 0; i < edges.length; i++) {
+    const e = edges[i];
+    const source = getEdgeTerminal(e, 'source');
+    const target = getEdgeTerminal(e, 'target');
+    nodeDict[mapIdPos[source]].push(mapIdPos[target]);
+    nodeDict[mapIdPos[source]].push(attrs1(e));
+    nodeDict[mapIdPos[source]].push(attrs2(e));
+    nodeDict[mapIdPos[source]].push(0);
+    nodeDict[mapIdPos[target]].push(mapIdPos[source]);
+    nodeDict[mapIdPos[target]].push(attrs1(e));
+    nodeDict[mapIdPos[target]].push(attrs2(e));
+    nodeDict[mapIdPos[target]].push(0);
+  }
+
+  let maxEdgePerVetex = 0;
+  for (i = 0; i < nodes.length; i++) {
+    const offset: number = dataArray.length;
+    const dests = nodeDict[i]; // dest 中节点 id 与边长间隔存储，即一位节点 id，一位边长……
+    const len = dests.length;
+    // dataArray[i * 4 + 2] = offset;
+    // dataArray[i * 4 + 3] = len / 4; // 第四位存储与该节点相关的所有节点个数
+    // pack offset & length into float32: offset 20bit, length 12bit
+    dataArray[i * 4 + 2] = offset + 1048576 * len / 4;
+    dataArray[i * 4 + 3] = 0; // 第四位存储与上一次的距离差值
+    maxEdgePerVetex = Math.max(maxEdgePerVetex, len / 4);
+    for (let j = 0; j < len; ++j) {
+    const dest = dests[j];
+    dataArray.push(+dest);
+    }
+  }
+
+  // 不是 4 的倍数，填充 0
+  while (dataArray.length % 4 !== 0) {
+    dataArray.push(0);
+  }
+  return {
+    maxEdgePerVetex,
+    array: new Float32Array(dataArray),
+  };
+};
+/**
+* transform the extended attributes of nodes or edges to a texture array
+* @param  {string[]}  attributeNames attributes' name to be read from items and put into output array
+* @param  {ModelConfig[]}  items the items to be read
+* @return {Float32Array} the attributes' value array to be read by GPU
+*/
+export const attributesToTextureData = (attributeNames: string[], items: any[]): { array: Float32Array, count: number } => {
+  const dataArray: any[] = [];
+  const attributeNum = attributeNames.length;
+  const attributteStringMap: any = {};
+  items.forEach((item: any) => {
+    attributeNames.forEach((name: string, i) => {
+        if (attributteStringMap[item[name]] === undefined) {
+            attributteStringMap[item[name]] = Object.keys(attributteStringMap).length;
+        }
+        dataArray.push(attributteStringMap[item[name]]);
+        // insure each node's attributes take inter number of grids
+        if (i === attributeNum - 1) {
+            while (dataArray.length % 4 !== 0) {
+                dataArray.push(0);
+            }
+        }
+    });
+  });
+  return {
+      array: new Float32Array(dataArray),
+      count: Object.keys(attributteStringMap).length
+  };
+};
+
+/**
+* transform the number array format of extended attributes of nodes or edges to a texture array
+* @param  {string[]}  attributeNames attributes' name to be read from items and put into output array
+* @return {Float32Array} the attributes' value array to be read by GPU
+*/
+export const arrayToTextureData = (valueArrays: number[][]): Float32Array => {
+  const dataArray: any[] = [];
+  const attributeNum = valueArrays.length;
+  const itemNum = valueArrays[0].length;
+  for (let j = 0; j < itemNum; j++) {
+      valueArrays.forEach((valueArray, i) => {
+          dataArray.push(valueArray[j]);
+          // insure each node's attributes take inter number of grids
+          if (i === attributeNum - 1) {
+              while (dataArray.length % 4 !== 0) {
+                  dataArray.push(0);
+              }
+          }
+      });
+  }
+
+  return new Float32Array(dataArray);
+};

package/src/util/index.ts

@@ -0,0 +1,6 @@
+export * from './string';
+export * from './array';
+export * from './number';
+export * from './math';
+export * from './object';
+export * from './function';

package/src/util/math.ts

@@ -0,0 +1,158 @@
+import { Matrix, Model, IndexMap, Edge, OutNode } from '../layout/types';
+import { isObject } from './object';
+
+export const getEdgeTerminal = (edge: Edge, type: 'source' | 'target') => {
+  const terminal = edge[type];
+  if (isObject(terminal)) {
+    return terminal.cell;
+  }
+  return terminal;
+};
+
+export const getDegree = (n: number, nodeIdxMap: IndexMap, edges: Edge[] | null) => {
+  const degrees: number[] = [];
+  for (let i = 0; i < n; i++) {
+    degrees[i] = 0;
+  }
+  if (!edges) return degrees;
+  edges.forEach((e) => {
+    const source = getEdgeTerminal(e, 'source');
+    const target = getEdgeTerminal(e, 'target');
+    if (source) {
+      degrees[nodeIdxMap[source]] += 1;
+    }
+    if (target) {
+      degrees[nodeIdxMap[target]] += 1;
+    }
+  });
+  return degrees;
+};
+
+export const floydWarshall = (adjMatrix: Matrix[]): Matrix[] => {
+  // initialize
+  const dist: Matrix[] = [];
+  const size = adjMatrix.length;
+  for (let i = 0; i < size; i += 1) {
+    dist[i] = [];
+    for (let j = 0; j < size; j += 1) {
+      if (i === j) {
+        dist[i][j] = 0;
+      } else if (adjMatrix[i][j] === 0 || !adjMatrix[i][j]) {
+        dist[i][j] = Infinity;
+      } else {
+        dist[i][j] = adjMatrix[i][j];
+      }
+    }
+  }
+  // floyd
+  for (let k = 0; k < size; k += 1) {
+    for (let i = 0; i < size; i += 1) {
+      for (let j = 0; j < size; j += 1) {
+        if (dist[i][j] > dist[i][k] + dist[k][j]) {
+          dist[i][j] = dist[i][k] + dist[k][j];
+        }
+      }
+    }
+  }
+  return dist;
+};
+
+export const getAdjMatrix = (data: Model, directed: boolean): Matrix[] => {
+  const {
+    nodes,
+    edges
+  } = data;
+  const matrix: Matrix[] = [];
+  // map node with index in data.nodes
+  const nodeMap: {
+    [key: string]: number;
+  } = {};
+
+  if (!nodes) {
+    throw new Error('invalid nodes data!');
+  }
+  if (nodes) {
+    nodes.forEach((node, i) => {
+      nodeMap[node.id] = i;
+      const row: number[] = [];
+      matrix.push(row);
+    });
+  }
+
+  if (edges) {
+    edges.forEach((e) => {
+      const source = getEdgeTerminal(e, 'source');
+      const target = getEdgeTerminal(e, 'target');
+      const sIndex = nodeMap[source as string];
+      const tIndex = nodeMap[target as string];
+      matrix[sIndex][tIndex] = 1;
+      if (!directed) {
+        matrix[tIndex][sIndex] = 1;
+      }
+    });
+  }
+
+  return matrix;
+};
+
+/**
+ * scale matrix
+ * @param matrix [ [], [], [] ]
+ * @param ratio
+ */
+export const scaleMatrix = (matrix: Matrix[], ratio: number) => {
+  const result: Matrix[] = [];
+  matrix.forEach((row) => {
+    const newRow: number[] = [];
+    row.forEach((v) => {
+      newRow.push(v * ratio);
+    });
+    result.push(newRow);
+  });
+  return result;
+};
+
+/**
+ * depth first traverse, from leaves to root, children in inverse order
+ *  if the fn returns false, terminate the traverse
+ */
+const traverseUp = <T extends { children?: T[] }>(data: T, fn: (param: T) => boolean) => {
+  if (data && data.children) {
+    for (let i = data.children.length - 1; i >= 0; i--) {
+      if (!traverseUp(data.children[i], fn)) return;
+    }
+  }
+
+  if (!fn(data)) {
+    return false;
+  }
+  return true;
+};
+
+/**
+ * depth first traverse, from leaves to root, children in inverse order
+ * if the fn returns false, terminate the traverse
+ */
+export const traverseTreeUp = <T extends { children?: T[] }>(
+  data: T,
+  fn: (param: T) => boolean,
+) => {
+  if (typeof fn !== 'function') {
+    return;
+  }
+  traverseUp(data, fn);
+};
+
+export const findMinMaxNodeXY = (nodes: OutNode[]) => {
+  let minX = Infinity;
+  let minY = Infinity;
+  let maxX = -Infinity;
+  let maxY = -Infinity;
+  nodes.forEach((node) => {
+    if (minX > node.x) minX = node.x;
+    if (minY > node.y) minY = node.y;
+    if (maxX < node.x) maxX = node.x;
+    if (maxY < node.y) maxY = node.y;
+  });
+  return { minX, minY, maxX, maxY };
+};

package/src/util/number.ts

@@ -0,0 +1,8 @@
+export const isNumber = (val: unknown): val is Number => typeof val === 'number';
+
+export const isNaN = (num: unknown) => Number.isNaN(Number(num));
+
+export const toNumber = (val: any): any => {
+  const n = parseFloat(val);
+  return isNaN(n) ? val : n;
+};

package/src/util/object.ts

@@ -0,0 +1,28 @@
+export const isObject = (val: unknown): val is Record<any, any> =>
+  val !== null && typeof val === 'object';
+
+export const clone = <T>(target: T): T => {
+  if (target === null) {
+    return target;
+  }
+  if (target instanceof Date) {
+    return new Date(target.getTime()) as any;
+  }
+  if (target instanceof Array) {
+    const cp = [] as any[]
+    ;(target as any[]).forEach((v) => {
+      cp.push(v);
+    });
+    return cp.map((n: any) => clone<any>(n)) as any;
+  }
+  if (typeof target === 'object' && target !== {}) {
+    const cp = { ...(target as { [key: string]: any }) } as {
+      [key: string]: any
+    };
+    Object.keys(cp).forEach((k) => {
+      cp[k] = clone<any>(cp[k]);
+    });
+    return cp as T;
+  }
+  return target;
+};

package/src/util/string.ts

@@ -0,0 +1,18 @@
+export const isString = (val: unknown): val is string => typeof val === 'string';
+
+const cacheStringFunction = <T extends (str: string) => string>(fn: T): T => {
+  const cache: Record<string, string> = Object.create(null);
+  return ((str: string) => {
+    const hit = cache[str];
+    return hit || (cache[str] = fn(str));
+  }) as any;
+};
+
+const camelizeRE = /-(\w)/g;
+export const camelize = cacheStringFunction((str: string): string => {
+  return str.replace(camelizeRE, (_, c) => (c ? c.toUpperCase() : ''));
+});
+
+// export const capitalize = cacheStringFunction(
+//   (str: string) => str.charAt(0).toUpperCase() + str.slice(1),
+// )

package/CHANGELOG.md

@@ -1,78 +0,0 @@
-# ChangeLog
-
-#### 0.2.0
-
-- chore: the beta features;
-
-#### 0.2.0-beta.4
-
-- feat: dagre layout support radial configuration;
-
-#### 0.2.0-beta.3
-
-- feat: dagreCompoud layout;
-
-#### 0.2.0-beta.0
-
-- feat: comboCombined layout;
-- feat: add source and target node to the parameters of gForce linkDistance;
-- feat: add hiddenNodes hiddenEdges hiddenCombos to the data of layout instance;
-
-#### 0.1.31
-
-- fix: dagre with sortByCombo error;
-
-#### 0.1.30
-
-- fix: flat problem;
-
-#### 0.1.29
-
-- fix: dagre error;
-
-#### 0.1.28
-
-- fix: dagre error;
-
-#### 0.1.27
-
-- fix: dagre error;
-
-#### 0.1.26
-
-- fix: dagre error;
-
-#### 0.1.25
- 
- - fix: array flat and Infinite param problem;
- - fix: dagre with NaN node rank;
- - chore: lint;
-
-#### 0.1.23
-
-- fix: array flat compatibility;
-
-#### 0.1.22
-
-- fix: fruchterman without init clusterMap problem;
-
-#### 0.1.21
-
-- fix: comboForce with unnecessary positions for combos;
-- fix: dagre bug;
-
-#### 0.1.20
-
-- chore: migrate dagre from https://github.com/brickmaker/dagre to @antv/layout and re-write in es6 standard;
-- chore: fruchterman cluster re-computing problem;
-- feat: dagre supports begin position for the layout;
-
-#### 0.1.19
-
-- feat: dagre supports assigning order and layer, import from https://github.com/brickmaker/dagre;
-- feat: ER layout;
-
-#### 0.1.18
-
-- fix: add return value for grid layout;
-- fix: force atlas 2 default prune and barnesHut;

package/es/layout/dagre/src/graphlib.d.ts

@@ -1,2 +0,0 @@
-declare let graphlib: any;
-export default graphlib;

package/es/layout/dagre/src/graphlib.js

@@ -1,51 +0,0 @@
-// @ts-ignore
-import glib from '@dagrejs/graphlib';
-let graphlib = glib;
-if (!graphlib && typeof window !== "undefined") {
-    graphlib = window.graphlib;
-}
-if (!Array.prototype.flat) {
-    // @ts-ignore
-    Array.prototype.flat = function (count) {
-        let c = count || 1;
-        if (!isFinite(c))
-            return;
-        const len = this.length;
-        let ret = [];
-        if (this.length === 0)
-            return this;
-        while (c--) {
-            const arr = [];
-            let flag = false;
-            if (ret.length === 0) {
-                flag = true;
-                for (let i = 0; i < len; i++) {
-                    if (this[i] instanceof Array) {
-                        ret.push(...this[i]);
-                    }
-                    else {
-                        ret.push(this[i]);
-                    }
-                }
-            }
-            else {
-                for (let i = 0; i < ret.length; i++) {
-                    if (ret[i] instanceof Array) {
-                        flag = true;
-                        arr.push(...ret[i]);
-                    }
-                    else {
-                        arr.push(ret[i]);
-                    }
-                }
-                ret = arr;
-            }
-            if (!flag && c === Infinity) {
-                break;
-            }
-        }
-        return ret;
-    };
-}
-export default graphlib;
-//# sourceMappingURL=graphlib.js.map

package/es/layout/dagre/src/graphlib.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graphlib.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/graphlib.ts"],"names":[],"mappings":"AAAA,aAAa;AACb,OAAO,IAAI,MAAM,mBAAmB,CAAC;AAErC,IAAI,QAAQ,GAAG,IAAI,CAAC;AAGpB,IAAI,CAAC,QAAQ,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;IAC9C,QAAQ,GAAI,MAAc,CAAC,QAAQ,CAAC;CACrC;AAED,IAAI,CAAE,KAAa,CAAC,SAAS,CAAC,IAAI,EAAE;IAClC,aAAa;IACZ,KAAa,CAAC,SAAS,CAAC,IAAI,GAAG,UAAS,KAAK;QAC5C,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,GAAG,GAAQ,EAAE,CAAC;QAClB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACnC,OAAO,CAAC,EAAE,EAAE;YACV,MAAM,GAAG,GAAG,EAAE,CAAC;YACf,IAAI,IAAI,GAAG,KAAK,CAAC;YACjB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;gBACpB,IAAI,GAAG,IAAI,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;oBAC5B,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,KAAK,EAAE;wBAC5B,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;qBACtB;yBAAM;wBACL,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;qBACnB;iBACF;aACF;iBAAM;gBACL,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACnC,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,KAAK,EAAE;wBAC3B,IAAI,GAAG,IAAI,CAAC;wBACZ,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;qBACrB;yBAAM;wBACL,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;qBAClB;iBACF;gBACD,GAAG,GAAG,GAAG,CAAC;aACX;YACD,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,QAAQ,EAAE;gBAC3B,MAAM;aACP;SACF;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;CAEH;AAED,eAAe,QAAQ,CAAC"}

package/lib/layout/dagre/src/graphlib.d.ts

@@ -1,2 +0,0 @@
-declare let graphlib: any;
-export default graphlib;

package/lib/layout/dagre/src/graphlib.js

@@ -1,56 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-// @ts-ignore
-var graphlib_1 = __importDefault(require("@dagrejs/graphlib"));
-var graphlib = graphlib_1.default;
-if (!graphlib && typeof window !== "undefined") {
-    graphlib = window.graphlib;
-}
-if (!Array.prototype.flat) {
-    // @ts-ignore
-    Array.prototype.flat = function (count) {
-        var c = count || 1;
-        if (!isFinite(c))
-            return;
-        var len = this.length;
-        var ret = [];
-        if (this.length === 0)
-            return this;
-        while (c--) {
-            var arr = [];
-            var flag = false;
-            if (ret.length === 0) {
-                flag = true;
-                for (var i = 0; i < len; i++) {
-                    if (this[i] instanceof Array) {
-                        ret.push.apply(ret, this[i]);
-                    }
-                    else {
-                        ret.push(this[i]);
-                    }
-                }
-            }
-            else {
-                for (var i = 0; i < ret.length; i++) {
-                    if (ret[i] instanceof Array) {
-                        flag = true;
-                        arr.push.apply(arr, ret[i]);
-                    }
-                    else {
-                        arr.push(ret[i]);
-                    }
-                }
-                ret = arr;
-            }
-            if (!flag && c === Infinity) {
-                break;
-            }
-        }
-        return ret;
-    };
-}
-exports.default = graphlib;
-//# sourceMappingURL=graphlib.js.map

package/lib/layout/dagre/src/graphlib.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graphlib.js","sourceRoot":"","sources":["../../../../src/layout/dagre/src/graphlib.ts"],"names":[],"mappings":";;;;;AAAA,aAAa;AACb,+DAAqC;AAErC,IAAI,QAAQ,GAAG,kBAAI,CAAC;AAGpB,IAAI,CAAC,QAAQ,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;IAC9C,QAAQ,GAAI,MAAc,CAAC,QAAQ,CAAC;CACrC;AAED,IAAI,CAAE,KAAa,CAAC,SAAS,CAAC,IAAI,EAAE;IAClC,aAAa;IACZ,KAAa,CAAC,SAAS,CAAC,IAAI,GAAG,UAAS,KAAK;QAC5C,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO;QACzB,IAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,GAAG,GAAQ,EAAE,CAAC;QAClB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACnC,OAAO,CAAC,EAAE,EAAE;YACV,IAAM,GAAG,GAAG,EAAE,CAAC;YACf,IAAI,IAAI,GAAG,KAAK,CAAC;YACjB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;gBACpB,IAAI,GAAG,IAAI,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;oBAC5B,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,KAAK,EAAE;wBAC5B,GAAG,CAAC,IAAI,OAAR,GAAG,EAAS,IAAI,CAAC,CAAC,CAAC,EAAE;qBACtB;yBAAM;wBACL,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;qBACnB;iBACF;aACF;iBAAM;gBACL,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACnC,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,KAAK,EAAE;wBAC3B,IAAI,GAAG,IAAI,CAAC;wBACZ,GAAG,CAAC,IAAI,OAAR,GAAG,EAAS,GAAG,CAAC,CAAC,CAAC,EAAE;qBACrB;yBAAM;wBACL,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;qBAClB;iBACF;gBACD,GAAG,GAAG,GAAG,CAAC;aACX;YACD,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,QAAQ,EAAE;gBAC3B,MAAM;aACP;SACF;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;CAEH;AAED,kBAAe,QAAQ,CAAC"}