@babsey/code-graph 0.9.3 → 0.9.6

package/dist/codeEngine/topologicalSorting.d.ts

@@ -0,0 +1,22 @@
+import { IConnection } from '@baklavajs/core';
+import { AbstractCodeNode } from '../codeNode';
+import { CodeGraph } from '../codeGraph';
+export interface ITopologicalSortingResult {
+    calculationOrder: AbstractCodeNode[];
+    connectionsFromNode: Map<AbstractCodeNode, IConnection[]>;
+    /** NodeInterface.id -> parent Node.id */
+    interfaceIdToNodeId: Map<string, string>;
+}
+export declare class CycleError extends Error {
+    constructor();
+}
+/** Uses Kahn's algorithm to topologically sort the nodes in the graph */
+export declare function sortTopologically(graph: CodeGraph): ITopologicalSortingResult;
+/** Uses Kahn's algorithm to topologically sort the nodes in the graph */
+export declare function sortTopologically(nodes: ReadonlyArray<AbstractCodeNode>, connections: ReadonlyArray<IConnection>): ITopologicalSortingResult;
+/** This overload is only used for internal purposes */
+export declare function sortTopologically(nodesorGraph: ReadonlyArray<AbstractCodeNode> | CodeGraph, connections?: ReadonlyArray<IConnection>): ITopologicalSortingResult;
+/** Checks whether a graph contains a cycle */
+export declare function containsCycle(graph: CodeGraph): boolean;
+/** Checks whether the provided set of nodes and connections contains a cycle */
+export declare function containsCycle(nodes: ReadonlyArray<AbstractCodeNode>, connections: ReadonlyArray<IConnection>): boolean;

package/dist/codeGraph/codeGraph.d.ts

@@ -50,6 +50,10 @@ export declare class CodeGraph extends Graph implements IBaklavaEventEmitter, IB
      * @param to code node interface
      */
     addConnection(from: CodeNodeInterface, to: CodeNodeInterface): void;
+    /**
+     * Execute calls of nodes before running graph.
+     */
+    beforeRun(): void;
     /**
      * Clear code graph.
      */

package/dist/codeNode/codeNode.d.ts

@@ -48,6 +48,7 @@ export declare abstract class AbstractCodeNode extends AbstractNode {
     set variableName(value: string);
     abstract afterGraphLoaded(): void;
     abstract afterLoaded(): void;
+    abstract beforeRun(): void;
     abstract onConnected(): void;
     abstract onGraphUpdate(): void;
     abstract onUnconnected(): void;

package/dist/codeNode/defineCodeNode.d.ts

@@ -5,6 +5,7 @@ export type NodeInstanceOf<T> = T extends new () => Node<infer A, infer B> ? Nod
 export interface ICodeNodeDefinition<I, O> extends INodeDefinition<I, O> {
     afterGraphLoaded?: () => void;
     afterLoaded?: () => void;
+    beforeRun?: () => void;
     codeTemplate?: (node?: AbstractCodeNode) => string;
     modules?: string[];
     name?: string;

package/dist/codeNode/dynamicCodeNode.d.ts

@@ -21,6 +21,7 @@ export interface DynamicNodeUpdateResult {
 export interface IDynamicCodeNodeDefinition<I, O> extends IDynamicNodeDefinition<I, O> {
     afterGraphLoaded?: () => void;
     afterLoaded?: () => void;
+    beforeRun?: () => void;
     codeTemplate?: (node?: AbstractCodeNode) => string;
     name?: string;
     modules?: string[];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@babsey/code-graph",
-  "version": "0.9.3",
+  "version": "0.9.6",
   "author": "babsey <spreizer@web.de>",
   "license": "MIT",
   "type": "module",
@@ -55,10 +55,10 @@
     "@vue/language-core": "~3.2",
     "@vue/tsconfig": "~0.8",
     "eslint": "~9.39",
-    "eslint-plugin-vue": "~10.6",
+    "eslint-plugin-vue": "~10.7",
     "jiti": "~2.6",
     "npm-run-all2": "~8.0",
-    "prettier": "~3.7",
+    "prettier": "~3.8",
     "rimraf": "~6.1",
     "sass-embedded": "~1.97",
     "typescript": "~5.9",