@monstermann/graph 0.1.0 → 0.2.0

package/dist/Graph/batch.d.mts

@@ -1,7 +1,6 @@
 import { Edges, Graph, Node } from "./types.mjs";
 
 //#region src/Graph/batch.d.ts
-
 /**
  * # batch
  *

package/dist/Graph/create.d.mts

@@ -1,7 +1,6 @@
 import { Edges, Graph, Node, NodeType } from "./types.mjs";
 
 //#region src/Graph/create.d.ts
-
 /**
  * # create
  *

package/dist/Graph/findEdge.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeType } from "./types.mjs";
 
 //#region src/Graph/findEdge.d.ts
-
 /**
  * # findEdge
  *

package/dist/Graph/findEdges.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeType } from "./types.mjs";
 
 //#region src/Graph/findEdges.d.ts
-
 /**
  * # findEdges
  *

package/dist/Graph/findNeighbor.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeOfType, NodeType } from "./types.mjs";
 
 //#region src/Graph/findNeighbor.d.ts
-
 /**
  * # findNeighbor
  *

package/dist/Graph/findNeighbors.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeOfType, NodeType } from "./types.mjs";
 
 //#region src/Graph/findNeighbors.d.ts
-
 /**
  * # findNeighbors
  *

package/dist/Graph/findNode.d.mts

@@ -1,7 +1,6 @@
 import { Edges, Graph, Node, NodeOfType, NodeType } from "./types.mjs";
 
 //#region src/Graph/findNode.d.ts
-
 /**
  * # findNode
  *

package/dist/Graph/findNodes.d.mts

@@ -1,7 +1,6 @@
 import { Edges, Graph, Node, NodeOfType, NodeType } from "./types.mjs";
 
 //#region src/Graph/findNodes.d.ts
-
 /**
  * # findNodes
  *

package/dist/Graph/forEachEdge.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeType } from "./types.mjs";
 
 //#region src/Graph/forEachEdge.d.ts
-
 /**
  * # forEachEdge
  *

package/dist/Graph/forEachNeighbor.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeOfType, NodeType } from "./types.mjs";
 
 //#region src/Graph/forEachNeighbor.d.ts
-
 /**
  * # forEachNeighbor
  *

package/dist/Graph/forEachNode.d.mts

@@ -1,7 +1,6 @@
 import { Edges, Graph, Node, NodeOfType, NodeType } from "./types.mjs";
 
 //#region src/Graph/forEachNode.d.ts
-
 /**
  * # forEachNode
  *

package/dist/Graph/fromJS.d.mts

@@ -1,7 +1,6 @@
 import { Edge, Edges, Graph, Node, NodeId } from "./types.mjs";
 
 //#region src/Graph/fromJS.d.ts
-
 /**
  * # fromJS
  *

package/dist/Graph/getEdge.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeType } from "./types.mjs";
 
 //#region src/Graph/getEdge.d.ts
-
 /**
  * # getEdge
  *

package/dist/Graph/getEdges.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeType } from "./types.mjs";
 
 //#region src/Graph/getEdges.d.ts
-
 /**
  * # getEdges
  *

package/dist/Graph/getNeighbor.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeOfType, NodeType } from "./types.mjs";
 
 //#region src/Graph/getNeighbor.d.ts
-
 /**
  * # getNeighbor
  *

package/dist/Graph/getNeighbors.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeOfType, NodeType } from "./types.mjs";
 
 //#region src/Graph/getNeighbors.d.ts
-
 /**
  * # getNeighbors
  *

package/dist/Graph/getNode.d.mts

@@ -1,7 +1,6 @@
 import { Edges, Graph, Node, NodeIdentifier, NodeOfType, NodeType } from "./types.mjs";
 
 //#region src/Graph/getNode.d.ts
-
 /**
  * # getNode
  *

package/dist/Graph/getNodes.d.mts

@@ -1,7 +1,6 @@
 import { Edges, Graph, Node, NodeOfType, NodeType } from "./types.mjs";
 
 //#region src/Graph/getNodes.d.ts
-
 /**
  * # getNodes
  *

package/dist/Graph/hasEdge.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeType } from "./types.mjs";
 
 //#region src/Graph/hasEdge.d.ts
-
 /**
  * # hasEdge
  *

package/dist/Graph/hasNode.d.mts

@@ -1,7 +1,6 @@
 import { Edges, Graph, Node, NodeIdentifier, NodeType } from "./types.mjs";
 
 //#region src/Graph/hasNode.d.ts
-
 /**
  * # hasNode
  *

package/dist/Graph/index.d.mts

@@ -29,7 +29,6 @@ import { setNode } from "./setNode.mjs";
 import { toJS } from "./toJS.mjs";
 
 //#region src/Graph/index.d.ts
-
 type NodeId = PropertyKey;
 type Node = {
   id: NodeId;

package/dist/Graph/internals/types.d.mts

@@ -10,7 +10,7 @@ type TargetTypesMap = ReadonlyMap<any, TargetIdsMap>;
 type TargetIdsMap = ReadonlyMap<NodeId, Edge>;
 type NodeIdsMap<T extends Node, U extends NodeType<T> = NodeType<T>> = ReadonlyMap<NodeId, NodeOfType<T, U>>;
 interface NodeTypesMap<T extends Node> extends ReadonlyMap<NodeType<T>, NodeIdsMap<T, NodeType<T>>> {
-  get: <V$1 extends NodeType<T>>(type: V$1) => NodeIdsMap<T, V$1> | undefined;
+  get: <V extends NodeType<T>>(type: V) => NodeIdsMap<T, V> | undefined;
 }
 //#endregion
 export { Bimap, NodeTypesMap, SourceTypesMap };

package/dist/Graph/mapEdge.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeType } from "./types.mjs";
 
 //#region src/Graph/mapEdge.d.ts
-
 /**
  * # mapEdge
  *

package/dist/Graph/mapNode.d.mts

@@ -1,7 +1,6 @@
 import { Edges, Graph, Node, NodeIdentifier, NodeOfType, NodeType } from "./types.mjs";
 
 //#region src/Graph/mapNode.d.ts
-
 /**
  * # mapNode
  *

package/dist/Graph/mapNode.mjs

@@ -70,12 +70,12 @@ function mapNode(graph, node, update) {
 	const next = update(prev);
 	if (prev === next) return graph;
 	if (prev.id === next.id && prev.type === next.type) return setNode(graph, next);
-	return batch(graph, (graph$1) => {
-		graph$1 = setNode(graph$1, next);
-		const edges = graph$1.get("edges");
-		for (const [targetType, targetIds] of edges?.get(prev.type)?.get(prev.id) ?? []) for (const [targetId, targetData] of targetIds) graph$1 = setEdge(graph$1, [next.type, next.id], [targetType, targetId], targetData);
-		graph$1 = removeNode(graph$1, prev);
-		return graph$1;
+	return batch(graph, (graph) => {
+		graph = setNode(graph, next);
+		const edges = graph.get("edges");
+		for (const [targetType, targetIds] of edges?.get(prev.type)?.get(prev.id) ?? []) for (const [targetId, targetData] of targetIds) graph = setEdge(graph, [next.type, next.id], [targetType, targetId], targetData);
+		graph = removeNode(graph, prev);
+		return graph;
 	});
 }
 

package/dist/Graph/mergeEdge.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeType } from "./types.mjs";
 
 //#region src/Graph/mergeEdge.d.ts
-
 /**
  * # mergeEdge
  *

package/dist/Graph/mergeNode.d.mts

@@ -1,7 +1,6 @@
 import { Edges, Graph, Node, NodeIdentifier, NodeOfType, NodeType } from "./types.mjs";
 
 //#region src/Graph/mergeNode.d.ts
-
 /**
  * # mergeNode
  *

package/dist/Graph/mergeNode.mjs

@@ -46,13 +46,13 @@ import { mapNode } from "./mapNode.mjs";
 *
 */
 function mergeNode(graph, node, update) {
-	return mapNode(graph, node, (node$1) => {
+	return mapNode(graph, node, (node) => {
 		const keys = Object.keys(update);
-		if (keys.length === 0) return node$1;
-		return keys.some((k) => update[k] !== node$1[k]) ? {
-			...node$1,
+		if (keys.length === 0) return node;
+		return keys.some((k) => update[k] !== node[k]) ? {
+			...node,
 			...update
-		} : node$1;
+		} : node;
 	});
 }
 

package/dist/Graph/removeEdge.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeType } from "./types.mjs";
 
 //#region src/Graph/removeEdge.d.ts
-
 /**
  * # removeEdge
  *

package/dist/Graph/removeEdge.mjs

@@ -48,22 +48,22 @@ import { unsetInGraph } from "./internals/core.mjs";
 function removeEdge(graph, source, target) {
 	const [sourceType, sourceId] = parseNodeIdentifier(source);
 	const [targetType, targetId] = parseNodeIdentifier(target);
-	return batch(graph, (graph$1) => {
-		graph$1 = unsetInGraph(graph$1, [
+	return batch(graph, (graph) => {
+		graph = unsetInGraph(graph, [
 			"edges",
 			sourceType,
 			sourceId,
 			targetType,
 			targetId
 		]);
-		graph$1 = unsetInGraph(graph$1, [
+		graph = unsetInGraph(graph, [
 			"edges",
 			targetType,
 			targetId,
 			sourceType,
 			sourceId
 		]);
-		return graph$1;
+		return graph;
 	});
 }
 

package/dist/Graph/removeNode.d.mts

@@ -1,7 +1,6 @@
 import { Edges, Graph, Node, NodeIdentifier, NodeType } from "./types.mjs";
 
 //#region src/Graph/removeNode.d.ts
-
 /**
  * # removeNode
  *

package/dist/Graph/removeNode.mjs

@@ -45,25 +45,25 @@ import { unsetInGraph } from "./internals/core.mjs";
 */
 function removeNode(graph, node) {
 	const [sourceType, sourceId] = parseNodeIdentifier(node);
-	return batch(graph, (graph$1) => {
-		for (const [targetType, targets] of graph$1.get("edges")?.get(sourceType)?.get(sourceId) ?? []) for (const targetId of targets.keys()) graph$1 = unsetInGraph(graph$1, [
+	return batch(graph, (graph) => {
+		for (const [targetType, targets] of graph.get("edges")?.get(sourceType)?.get(sourceId) ?? []) for (const targetId of targets.keys()) graph = unsetInGraph(graph, [
 			"edges",
 			targetType,
 			targetId,
 			sourceType,
 			sourceId
 		]);
-		graph$1 = unsetInGraph(graph$1, [
+		graph = unsetInGraph(graph, [
 			"edges",
 			sourceType,
 			sourceId
 		]);
-		graph$1 = unsetInGraph(graph$1, [
+		graph = unsetInGraph(graph, [
 			"nodes",
 			sourceType,
 			sourceId
 		]);
-		return graph$1;
+		return graph;
 	});
 }
 

package/dist/Graph/setEdge.d.mts

@@ -2,7 +2,6 @@ import { Bimap } from "./internals/types.mjs";
 import { Edges, Graph, Node, NodeIdentifier, NodeType } from "./types.mjs";
 
 //#region src/Graph/setEdge.d.ts
-
 /**
  * # setEdge
  *

package/dist/Graph/setEdge.mjs

@@ -55,22 +55,22 @@ function setEdge(graph, source, target, ...args) {
 	const [targetType, targetId] = parseNodeIdentifier(target);
 	if (!hasNode(graph, source)) return graph;
 	if (!hasNode(graph, target)) return graph;
-	return batch(graph, (graph$1) => {
-		graph$1 = setInGraph(graph$1, [
+	return batch(graph, (graph) => {
+		graph = setInGraph(graph, [
 			"edges",
 			sourceType,
 			sourceId,
 			targetType,
 			targetId
 		], edge);
-		graph$1 = setInGraph(graph$1, [
+		graph = setInGraph(graph, [
 			"edges",
 			targetType,
 			targetId,
 			sourceType,
 			sourceId
 		], edge);
-		return graph$1;
+		return graph;
 	});
 }
 

package/dist/Graph/setNode.d.mts

@@ -1,7 +1,6 @@
 import { Edges, Graph, Node } from "./types.mjs";
 
 //#region src/Graph/setNode.d.ts
-
 /**
  * # setNode
  *

package/dist/Graph/toJS.d.mts

@@ -1,7 +1,6 @@
 import { Edge, Edges, Graph, Node, NodeId } from "./types.mjs";
 
 //#region src/Graph/toJS.d.ts
-
 /**
  * # toJS
  *

package/package.json

@@ -1,7 +1,7 @@
 {
     "name": "@monstermann/graph",
     "type": "module",
-    "version": "0.1.0",
+    "version": "0.2.0",
     "description": "Functional graph data-structure.",
     "author": "Michael Ostermann <michaelostermann@me.com>",
     "license": "MIT",