@deck.gl-community/graph-layers 9.2.0-beta.2 → 9.2.0-beta.3

package/src/utils/rank-grid.ts

@@ -0,0 +1,426 @@
+// deck.gl-community
+// SPDX-License-Identifier: MIT
+// Copyright (c) vis.gl contributors
+
+import type {Node} from '../graph/node';
+
+export type RankAccessor = string | ((node: Node) => number | null | undefined);
+export type LabelAccessor = string | ((node: Node) => string | number | null | undefined);
+
+export type RankPosition = {
+  rank: number;
+  yPosition: number;
+  label: string | number;
+};
+
+export type MapRanksToYPositionsOptions = {
+  rankAccessor?: RankAccessor;
+  labelAccessor?: LabelAccessor;
+  /** Optional target range for the computed y positions. */
+  yRange?: {min?: number; max?: number};
+};
+
+type RankAggregate = {sum: number; count: number; label: string | number | null};
+
+type RankAggregateState = {
+  aggregates: Map<number, RankAggregate>;
+  range: {min: number; max: number};
+};
+
+function distributeEvenSpacing(positions: RankPosition[], start: number, end: number) {
+  const count = positions.length;
+  if (count === 0) {
+    return;
+  }
+
+  if (count === 1) {
+    positions[0].yPosition = start;
+    return;
+  }
+
+  const step = (end - start) / (count - 1);
+  for (let i = 0; i < count; i++) {
+    positions[i].yPosition = start + step * i;
+  }
+}
+
+function fallbackMonotonicSpacing(positions: RankPosition[]) {
+  if (positions.length === 0) {
+    return;
+  }
+
+  let previous = positions[0].yPosition;
+  for (let i = 1; i < positions.length; i++) {
+    const current = positions[i].yPosition;
+    if (!(current > previous)) {
+      previous += 1;
+      positions[i].yPosition = previous;
+    } else {
+      previous = current;
+    }
+  }
+}
+
+function enforceMonotonicPositions(
+  positions: RankPosition[],
+  range: {min: number; max: number}
+) {
+  if (positions.length === 0) {
+    return;
+  }
+
+  const hasFiniteMin = Number.isFinite(range.min);
+  const hasFiniteMax = Number.isFinite(range.max);
+
+  if (positions.length === 1) {
+    if (hasFiniteMin) {
+      positions[0].yPosition = range.min;
+    }
+    return;
+  }
+
+  if (hasFiniteMin && hasFiniteMax && range.max > range.min) {
+    distributeEvenSpacing(positions, range.min, range.max);
+    return;
+  }
+
+  if (hasFiniteMin) {
+    positions[0].yPosition = range.min;
+  }
+
+  fallbackMonotonicSpacing(positions);
+}
+
+function resolveTargetRange(
+  range: {min: number; max: number},
+  override?: {min?: number; max?: number}
+): {min: number; max: number} {
+  const overrideMin = typeof override?.min === 'number' && Number.isFinite(override.min) ? override.min : undefined;
+  const overrideMax = typeof override?.max === 'number' && Number.isFinite(override.max) ? override.max : undefined;
+
+  const candidateMin = overrideMin ?? range.min;
+  const candidateMax = overrideMax ?? range.max;
+
+  const min = Number.isFinite(candidateMin) ? candidateMin : range.min;
+  const max = Number.isFinite(candidateMax) ? candidateMax : range.max;
+
+  return {min, max};
+}
+
+function accumulateRank(
+  node: Node,
+  getRank: (node: Node) => number | null,
+  getLabel: (node: Node) => string | number | null,
+  getPosition: (node: Node) => [number, number] | null | undefined,
+  state: RankAggregateState
+) {
+  const {aggregates, range} = state;
+  const rank = getRank(node);
+  if (typeof rank !== 'number' || !Number.isFinite(rank)) {
+    return;
+  }
+
+  const position = getPosition(node);
+  if (!position) {
+    return;
+  }
+
+  const [, y] = position;
+  if (typeof y !== 'number' || !Number.isFinite(y)) {
+    return;
+  }
+
+  const entry = aggregates.get(rank) ?? {sum: 0, count: 0, label: null};
+  entry.sum += y;
+  entry.count += 1;
+
+  if (entry.label === null) {
+    const label = getLabel(node);
+    if (label !== null) {
+      entry.label = label;
+    }
+  }
+
+  aggregates.set(rank, entry);
+  range.min = Math.min(range.min, y);
+  range.max = Math.max(range.max, y);
+}
+
+function normalizeRankAccessor(accessor: RankAccessor | undefined): (node: Node) => number | null {
+  if (!accessor) {
+    return (node: Node) => {
+      const value = node.getPropertyValue('srank');
+      if (typeof value === 'number' && Number.isFinite(value)) {
+        return value;
+      }
+      if (typeof value === 'string') {
+        const parsed = Number(value);
+        return Number.isFinite(parsed) ? parsed : null;
+      }
+      return null;
+    };
+  }
+
+  if (typeof accessor === 'function') {
+    return (node: Node) => {
+      const value = accessor(node);
+      if (typeof value === 'number' && Number.isFinite(value)) {
+        return value;
+      }
+      if (typeof value === 'string') {
+        const parsed = Number(value);
+        return Number.isFinite(parsed) ? parsed : null;
+      }
+      return null;
+    };
+  }
+
+  return (node: Node) => {
+    const value = node.getPropertyValue(accessor);
+    if (typeof value === 'number' && Number.isFinite(value)) {
+      return value;
+    }
+    if (typeof value === 'string') {
+      const parsed = Number(value);
+      return Number.isFinite(parsed) ? parsed : null;
+    }
+    return null;
+  };
+}
+
+function normalizeLabelAccessor(accessor: LabelAccessor | undefined): (node: Node) => string | number | null {
+  if (!accessor) {
+    return (node: Node) => {
+      const value = node.getPropertyValue('rankLabel');
+      if (value === undefined || value === null || value === '') {
+        return null;
+      }
+      if (typeof value === 'number' || typeof value === 'string') {
+        return value;
+      }
+      return null;
+    };
+  }
+
+  if (typeof accessor === 'function') {
+    return (node: Node) => {
+      const value = accessor(node);
+      if (value === undefined || value === null || value === '') {
+        return null;
+      }
+      if (typeof value === 'number' || typeof value === 'string') {
+        return value;
+      }
+      return null;
+    };
+  }
+
+  return (node: Node) => {
+    const value = node.getPropertyValue(accessor);
+    if (value === undefined || value === null || value === '') {
+      return null;
+    }
+    if (typeof value === 'number' || typeof value === 'string') {
+      return value;
+    }
+    return null;
+  };
+}
+
+/**
+ * Builds a mapping from rank identifiers to averaged y positions.
+ */
+export function mapRanksToYPositions(
+  nodes: Iterable<Node>,
+  getPosition: (node: Node) => [number, number] | null | undefined,
+  options?: MapRanksToYPositionsOptions
+): RankPosition[] {
+  const getRank = normalizeRankAccessor(options?.rankAccessor);
+  const getLabel = normalizeLabelAccessor(options?.labelAccessor);
+
+  const state: RankAggregateState = {
+    aggregates: new Map<number, RankAggregate>(),
+    range: {min: Number.POSITIVE_INFINITY, max: Number.NEGATIVE_INFINITY}
+  };
+
+  for (const node of nodes) {
+    accumulateRank(node, getRank, getLabel, getPosition, state);
+  }
+
+  const {aggregates, range} = state;
+  const positions: RankPosition[] = Array.from(aggregates.entries()).map(([rank, {sum, count, label}]) => ({
+    rank,
+    yPosition: count ? sum / count : 0,
+    label: label ?? rank
+  }));
+
+  positions.sort((a, b) => a.rank - b.rank);
+
+  const needsRemap = positions.some(
+    (entry, index) => index > 0 && entry.yPosition <= positions[index - 1].yPosition
+  );
+  if (needsRemap) {
+    const targetRange = resolveTargetRange(range, options?.yRange);
+    enforceMonotonicPositions(positions, targetRange);
+  }
+
+  return positions;
+}
+
+export type SelectRankLinesOptions = {
+  yMin: number;
+  yMax: number;
+  maxCount?: number;
+};
+
+function locateInsertionIndex(ranks: RankPosition[], target: number): number {
+  let low = 0;
+  let high = ranks.length - 1;
+
+  while (low < high) {
+    const mid = Math.floor((low + high) / 2);
+    if (ranks[mid].yPosition < target) {
+      low = mid + 1;
+    } else {
+      high = mid;
+    }
+  }
+
+  return low;
+}
+
+function pickNearestAvailableIndex(
+  ranks: RankPosition[],
+  target: number,
+  startIndex: number,
+  used: Set<number>
+): number {
+  let bestIndex = -1;
+  let bestDistance = Number.POSITIVE_INFINITY;
+
+  const consider = (index: number) => {
+    if (index < 0 || index >= ranks.length || used.has(index)) {
+      return;
+    }
+    const distance = Math.abs(ranks[index].yPosition - target);
+    const isCloser = distance < bestDistance;
+    const isTie = distance === bestDistance && bestIndex !== -1;
+    if (isCloser || (isTie && (ranks[index].yPosition < ranks[bestIndex].yPosition || index < bestIndex))) {
+      bestDistance = distance;
+      bestIndex = index;
+    }
+  };
+
+  consider(startIndex);
+  consider(startIndex - 1);
+
+  for (let offset = 1; bestIndex === -1 && (startIndex - offset >= 0 || startIndex + offset < ranks.length); offset++) {
+    consider(startIndex - offset);
+    consider(startIndex + offset);
+  }
+
+  return bestIndex;
+}
+
+function findFallbackIndex(ranks: RankPosition[], used: Set<number>): number {
+  for (let i = 0; i < ranks.length; i++) {
+    if (!used.has(i)) {
+      return i;
+    }
+  }
+  return -1;
+}
+
+function findClosestAvailableIndex(
+  ranks: RankPosition[],
+  target: number,
+  used: Set<number>
+): number {
+  if (ranks.length === 0) {
+    return -1;
+  }
+
+  const insertionIndex = locateInsertionIndex(ranks, target);
+  const nearest = pickNearestAvailableIndex(ranks, target, insertionIndex, used);
+  if (nearest !== -1) {
+    return nearest;
+  }
+
+  const fallback = findFallbackIndex(ranks, used);
+  if (fallback !== -1) {
+    return fallback;
+  }
+
+  return Math.min(Math.max(insertionIndex, 0), ranks.length - 1);
+}
+
+function computeTargetRatios(count: number): number[] {
+  if (count <= 1) {
+    return [0.5];
+  }
+  const step = 1 / (count - 1);
+  return Array.from({length: count}, (_, index) => index * step);
+}
+
+function fillRemainingSelections(used: Set<number>, lastIndex: number, maxCount: number) {
+  for (let i = 0; used.size < maxCount && i <= lastIndex; i++) {
+    used.add(i);
+  }
+}
+
+function chooseEvenlySpacedIndices(ranks: RankPosition[], maxCount: number): number[] {
+  const lastIndex = ranks.length - 1;
+  const start = ranks[0].yPosition;
+  const end = ranks[lastIndex].yPosition;
+  const span = end - start;
+  const used = new Set<number>();
+
+  for (const ratio of computeTargetRatios(maxCount)) {
+    const target = span !== 0 ? start + ratio * span : start;
+    const index = findClosestAvailableIndex(ranks, target, used);
+    if (index !== -1) {
+      used.add(index);
+    }
+  }
+
+  fillRemainingSelections(used, lastIndex, maxCount);
+
+  return Array.from(used).sort((a, b) => a - b).slice(0, maxCount);
+}
+
+/**
+ * Selects a subset of rank positions that are evenly distributed within a range.
+ */
+export function selectRankLines(
+  ranks: RankPosition[],
+  {yMin, yMax, maxCount = 8}: SelectRankLinesOptions
+): RankPosition[] {
+  if (!Number.isFinite(yMin) || !Number.isFinite(yMax) || maxCount <= 0) {
+    return [];
+  }
+
+  const min = Math.min(yMin, yMax);
+  const max = Math.max(yMin, yMax);
+
+  const filtered = ranks
+    .filter((entry) => Number.isFinite(entry.yPosition) && entry.yPosition >= min && entry.yPosition <= max)
+    .sort((a, b) => a.yPosition - b.yPosition);
+
+  if (filtered.length === 0) {
+    return [];
+  }
+
+  if (filtered.length <= maxCount) {
+    return filtered;
+  }
+
+  if (maxCount === 1) {
+    const midpoint = (filtered[0].yPosition + filtered[filtered.length - 1].yPosition) / 2;
+    const index = findClosestAvailableIndex(filtered, midpoint, new Set<number>());
+    return index === -1 ? [filtered[0]] : [filtered[index]];
+  }
+
+  const selected = chooseEvenlySpacedIndices(filtered, maxCount);
+  return selected.map((index) => filtered[index]);
+}
+

package/dist/loaders/create-graph.d.ts

@@ -1,12 +0,0 @@
-import { Graph } from '../graph/graph';
-/**
- * @deprecated Use `new Graph(name, nodes, edges)`
- * Create a graph from a list of Nodes and edges
- */
-export declare function createGraph(props: {
-    name: any;
-    nodes: any;
-    edges: any;
-    nodeParser: any;
-    edgeParser: any;
-}): Graph;

package/dist/loaders/create-graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"create-graph.d.ts","sourceRoot":"","sources":["../../src/loaders/create-graph.ts"],"names":[],"mappings":"AAMA,OAAO,EAAC,KAAK,EAAC,0BAAuB;AAErC;;;GAGG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE;IAAC,IAAI,MAAC;IAAC,KAAK,MAAC;IAAC,KAAK,MAAC;IAAC,UAAU,MAAC;IAAC,UAAU,MAAA;CAAC,SA8B9E"}

package/dist/loaders/create-graph.js

@@ -1,38 +0,0 @@
-// deck.gl-community
-// SPDX-License-Identifier: MIT
-// Copyright (c) vis.gl contributors
-import { Edge } from '../graph/edge';
-import { Node } from '../graph/node';
-import { Graph } from '../graph/graph';
-/**
- * @deprecated Use `new Graph(name, nodes, edges)`
- * Create a graph from a list of Nodes and edges
- */
-export function createGraph(props) {
-    const { name, nodes, edges, nodeParser, edgeParser } = props;
-    // create a new empty graph
-    const graph = new Graph();
-    const graphName = name || Date.now();
-    graph.setGraphName(graphName);
-    // add nodes
-    const glNodes = nodes.map((node) => {
-        const { id } = nodeParser(node);
-        return new Node({
-            id,
-            data: node
-        });
-    });
-    graph.batchAddNodes(glNodes);
-    const glEdges = edges.map((edge) => {
-        const { id, sourceId, targetId, directed } = edgeParser(edge);
-        return new Edge({
-            id,
-            sourceId,
-            targetId,
-            directed,
-            data: edge
-        });
-    });
-    graph.batchAddEdges(glEdges);
-    return graph;
-}

package/dist/loaders/create-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"create-graph.js","sourceRoot":"","sources":["../../src/loaders/create-graph.ts"],"names":[],"mappings":"AAAA,oBAAoB;AACpB,+BAA+B;AAC/B,oCAAoC;AAEpC,OAAO,EAAC,IAAI,EAAC,yBAAsB;AACnC,OAAO,EAAC,IAAI,EAAC,yBAAsB;AACnC,OAAO,EAAC,KAAK,EAAC,0BAAuB;AAErC;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,KAAmD;IAC7E,MAAM,EAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAC,GAAG,KAAK,CAAC;IAC3D,2BAA2B;IAC3B,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;IAE1B,MAAM,SAAS,GAAG,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IACrC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;IAE9B,YAAY;IACZ,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACjC,MAAM,EAAC,EAAE,EAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,IAAI,CAAC;YACd,EAAE;YACF,IAAI,EAAE,IAAI;SACX,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IACH,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAE7B,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACjC,MAAM,EAAC,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC5D,OAAO,IAAI,IAAI,CAAC;YACd,EAAE;YACF,QAAQ;YACR,QAAQ;YACR,QAAQ;YACR,IAAI,EAAE,IAAI;SACX,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IACH,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAC7B,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/loaders/edge-parsers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"edge-parsers.d.ts","sourceRoot":"","sources":["../../src/loaders/edge-parsers.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAC,WAAW,EAAC,yBAAsB;AAG/C,wBAAgB,eAAe,CAAC,IAAI,EAAE,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,CAcpE"}

package/dist/loaders/edge-parsers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"edge-parsers.js","sourceRoot":"","sources":["../../src/loaders/edge-parsers.ts"],"names":[],"mappings":"AAAA,oBAAoB;AACpB,+BAA+B;AAC/B,oCAAoC;AAGpC,OAAO,EAAC,KAAK,EAAC,wBAAqB;AAEnC,MAAM,UAAU,eAAe,CAAC,IAAS;IACvC,MAAM,EAAC,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAC,GAAG,IAAI,CAAC;IAEhD,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QACrD,KAAK,CAAC,gDAAgD,CAAC,CAAC;QACxD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,EAAE;QACF,QAAQ,EAAE,QAAQ,IAAI,KAAK;QAC3B,QAAQ;QACR,QAAQ;KACT,CAAC;AACJ,CAAC"}

package/dist/loaders/json-loader.d.ts

@@ -1,7 +0,0 @@
-import { basicNodeParser } from './node-parsers';
-import { basicEdgeParser } from './edge-parsers';
-export declare const JSONLoader: ({ json, nodeParser, edgeParser }: {
-    json: any;
-    nodeParser?: typeof basicNodeParser;
-    edgeParser?: typeof basicEdgeParser;
-}) => import("..").Graph;

package/dist/loaders/json-loader.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"json-loader.d.ts","sourceRoot":"","sources":["../../src/loaders/json-loader.ts"],"names":[],"mappings":"AAKA,OAAO,EAAC,eAAe,EAAC,0BAAuB;AAC/C,OAAO,EAAC,eAAe,EAAC,0BAAuB;AAG/C,eAAO,MAAM,UAAU,GAAI;;;;CAAkE,uBAS5F,CAAC"}

package/dist/loaders/json-loader.js

@@ -1,16 +0,0 @@
-// deck.gl-community
-// SPDX-License-Identifier: MIT
-// Copyright (c) vis.gl contributors
-import { createGraph } from './create-graph';
-import { basicNodeParser } from './node-parsers';
-import { basicEdgeParser } from './edge-parsers';
-import { error } from '../utils/log';
-export const JSONLoader = ({ json, nodeParser = basicNodeParser, edgeParser = basicEdgeParser }) => {
-    const { name = 'default', nodes, edges } = json;
-    if (!nodes) {
-        error('Invalid graph: nodes is missing.');
-        return null;
-    }
-    const graph = createGraph({ name, nodes, edges, nodeParser, edgeParser });
-    return graph;
-};

package/dist/loaders/json-loader.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"json-loader.js","sourceRoot":"","sources":["../../src/loaders/json-loader.ts"],"names":[],"mappings":"AAAA,oBAAoB;AACpB,+BAA+B;AAC/B,oCAAoC;AAEpC,OAAO,EAAC,WAAW,EAAC,0BAAuB;AAC3C,OAAO,EAAC,eAAe,EAAC,0BAAuB;AAC/C,OAAO,EAAC,eAAe,EAAC,0BAAuB;AAC/C,OAAO,EAAC,KAAK,EAAC,wBAAqB;AAEnC,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,EAAC,IAAI,EAAE,UAAU,GAAG,eAAe,EAAE,UAAU,GAAG,eAAe,EAAC,EAAE,EAAE;IAC/F,MAAM,EAAC,IAAI,GAAG,SAAS,EAAE,KAAK,EAAE,KAAK,EAAC,GAAG,IAAI,CAAC;IAC9C,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,KAAK,CAAC,kCAAkC,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,KAAK,GAAG,WAAW,CAAC,EAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAC,CAAC,CAAC;IACxE,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}

package/dist/loaders/node-parsers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"node-parsers.d.ts","sourceRoot":"","sources":["../../src/loaders/node-parsers.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAC,WAAW,EAAC,yBAAsB;AAG/C,wBAAgB,eAAe,CAAC,IAAI,EAAE,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAMlE"}

package/dist/loaders/node-parsers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"node-parsers.js","sourceRoot":"","sources":["../../src/loaders/node-parsers.ts"],"names":[],"mappings":"AAAA,oBAAoB;AACpB,+BAA+B;AAC/B,oCAAoC;AAGpC,OAAO,EAAC,KAAK,EAAC,wBAAqB;AAEnC,MAAM,UAAU,eAAe,CAAC,IAAS;IACvC,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;QAC1B,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,EAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAC,CAAC;AACvB,CAAC"}

package/dist/loaders/simple-json-graph-loader.d.ts

@@ -1,11 +0,0 @@
-/** @deprecated Use loadSimpleJSONGraph */
-export declare const JSONLoader: ({ json, nodeParser, edgeParser }: {
-    json: any;
-    nodeParser: any;
-    edgeParser: any;
-}) => import("..").Graph;
-/** A loader for a simple graph format  */
-export declare function loadSimpleJSONGraph(json: Record<string, unknown>, options?: {
-    nodeParser: any;
-    edgeParser: any;
-}): import("..").Graph;

package/dist/loaders/simple-json-graph-loader.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"simple-json-graph-loader.d.ts","sourceRoot":"","sources":["../../src/loaders/simple-json-graph-loader.ts"],"names":[],"mappings":"AASA,0CAA0C;AAC1C,eAAO,MAAM,UAAU,GAAI;;;;CAA8B,uBACJ,CAAC;AAEtD,0CAA0C;AAC1C,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC7B,OAAO,CAAC,EAAE;IAAC,UAAU,MAAC;IAAC,UAAU,MAAA;CAAC,sBAWnC"}

package/dist/loaders/simple-json-graph-loader.js

@@ -1,20 +0,0 @@
-// deck.gl-community
-// SPDX-License-Identifier: MIT
-// Copyright (c) vis.gl contributors
-import { createGraph } from './create-graph';
-import { error } from '../utils/log';
-import { basicNodeParser } from './node-parsers';
-import { basicEdgeParser } from './edge-parsers';
-/** @deprecated Use loadSimpleJSONGraph */
-export const JSONLoader = ({ json, nodeParser, edgeParser }) => loadSimpleJSONGraph(json, { nodeParser, edgeParser });
-/** A loader for a simple graph format  */
-export function loadSimpleJSONGraph(json, options) {
-    const { nodeParser = basicNodeParser, edgeParser = basicEdgeParser } = options;
-    const { name = 'default', nodes, edges } = json;
-    if (!nodes) {
-        error('Invalid graph: nodes is missing.');
-        return null;
-    }
-    const graph = createGraph({ name, nodes, edges, nodeParser, edgeParser });
-    return graph;
-}

package/dist/loaders/simple-json-graph-loader.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"simple-json-graph-loader.js","sourceRoot":"","sources":["../../src/loaders/simple-json-graph-loader.ts"],"names":[],"mappings":"AAAA,oBAAoB;AACpB,+BAA+B;AAC/B,oCAAoC;AAEpC,OAAO,EAAC,WAAW,EAAC,0BAAuB;AAC3C,OAAO,EAAC,KAAK,EAAC,wBAAqB;AACnC,OAAO,EAAC,eAAe,EAAC,0BAAuB;AAC/C,OAAO,EAAC,eAAe,EAAC,0BAAuB;AAE/C,0CAA0C;AAC1C,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,EAAC,IAAI,EAAE,UAAU,EAAE,UAAU,EAAC,EAAE,EAAE,CAC3D,mBAAmB,CAAC,IAAI,EAAE,EAAC,UAAU,EAAE,UAAU,EAAC,CAAC,CAAC;AAEtD,0CAA0C;AAC1C,MAAM,UAAU,mBAAmB,CACjC,IAA6B,EAC7B,OAAkC;IAElC,MAAM,EAAC,UAAU,GAAG,eAAe,EAAE,UAAU,GAAG,eAAe,EAAC,GAAG,OAAO,CAAC;IAC7E,MAAM,EAAC,IAAI,GAAG,SAAS,EAAE,KAAK,EAAE,KAAK,EAAC,GAAG,IAAI,CAAC;IAC9C,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,KAAK,CAAC,kCAAkC,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,KAAK,GAAG,WAAW,CAAC,EAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAC,CAAC,CAAC;IACxE,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/loaders/table-graph-loader.d.ts

@@ -1,16 +0,0 @@
-import type { NodeOptions } from '../graph/node';
-import type { EdgeOptions } from '../graph/edge';
-import { Graph } from '../graph/graph';
-export type ParseGraphOptions = {
-    nodeIdField?: string;
-    edgeSourceField?: string;
-    edgeTargetField?: string;
-    edgeDirectedField?: string;
-    edgeDirected?: boolean;
-    nodeParser?: (nodeRow: any) => NodeOptions;
-    edgeParser?: (edgeRow: any) => EdgeOptions;
-};
-export declare function tableGraphLoader(tables: {
-    nodes: any[];
-    edges: any[];
-}, options?: ParseGraphOptions): Graph;

package/dist/loaders/table-graph-loader.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"table-graph-loader.d.ts","sourceRoot":"","sources":["../../src/loaders/table-graph-loader.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAC,WAAW,EAAC,yBAAsB;AAC/C,OAAO,KAAK,EAAC,WAAW,EAAC,yBAAsB;AAG/C,OAAO,EAAC,KAAK,EAAC,0BAAuB;AAIrC,MAAM,MAAM,iBAAiB,GAAG;IAC9B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,KAAK,WAAW,CAAC;IAC3C,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,KAAK,WAAW,CAAC;CAC5C,CAAC;AAqBF,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE;IAAC,KAAK,EAAE,GAAG,EAAE,CAAC;IAAC,KAAK,EAAE,GAAG,EAAE,CAAA;CAAC,EACpC,OAAO,CAAC,EAAE,iBAAiB,GAC1B,KAAK,CAuDP"}