@substrate-ai/factory 0.19.54 → 0.20.2

package/dist/__tests__/fixtures/manager-loop.dot.d.ts

@@ -1,34 +0,0 @@
-/**
- * DOT fixture strings for manager loop handler integration tests.
- * Story 50-11.
- *
- * Manager loop handler attributes (verified from manager-loop.ts):
- *   node.attrs['graph_file']   — path to body .dot file (required)
- *   node.attrs['max_cycles']   — maximum loop iterations (default: 10)
- *   node.attrs['stop_condition'] — context key or 'llm:' prefix question
- *
- * IMPORTANT: `parseGraph` does NOT populate `node.attrs`, so tests must
- * construct nodes manually or post-process parsed graphs.
- *
- * Registered type: 'stack.manager_loop' (story 50-8)
- */
-/**
- * Parent graph with a manager loop node.
- * start → manager_loop → exit
- *
- * Note: The manager loop node needs attrs set manually in tests:
- *   node.attrs = { graph_file: '/test/body.dot', max_cycles: '3' }
- */
-export declare const MANAGER_LOOP_DOT = "\ndigraph manager_loop_test {\n  start        [type=\"start\"];\n  manager_loop [type=\"stack.manager_loop\", label=\"Supervised Loop\"];\n  exit         [type=\"exit\"];\n\n  start        -> manager_loop;\n  manager_loop -> exit;\n}\n";
-/**
- * Body graph for the manager loop: start → work → exit
- * Used as the content returned by the mock graphFileLoader.
- */
-export declare const MANAGER_LOOP_BODY_DOT = "\ndigraph loop_body {\n  start [type=\"start\"];\n  work  [type=\"codergen\", label=\"Do Work\"];\n  exit  [type=\"exit\"];\n\n  start -> work;\n  work  -> exit;\n}\n";
-/**
- * Body graph with a stop condition key written to context.
- * The work node sets context key 'task_complete' = true.
- * Used to test context-key-based stop conditions.
- */
-export declare const BODY_WITH_STOP_CONDITION_DOT = "\ndigraph loop_body_stop {\n  start [type=\"start\"];\n  work  [type=\"codergen\", label=\"Complete Task\"];\n  exit  [type=\"exit\"];\n\n  start -> work;\n  work  -> exit;\n}\n";
-//# sourceMappingURL=manager-loop.dot.d.ts.map

package/dist/__tests__/fixtures/manager-loop.dot.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"manager-loop.dot.d.ts","sourceRoot":"","sources":["../../../src/__tests__/fixtures/manager-loop.dot.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH;;;;;;GAMG;AACH,eAAO,MAAM,gBAAgB,gPAS5B,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,qBAAqB,2KASjC,CAAA;AAED;;;;GAIG;AACH,eAAO,MAAM,4BAA4B,sLASxC,CAAA"}

package/dist/__tests__/fixtures/manager-loop.dot.js

@@ -1,61 +0,0 @@
-/**
- * DOT fixture strings for manager loop handler integration tests.
- * Story 50-11.
- *
- * Manager loop handler attributes (verified from manager-loop.ts):
- *   node.attrs['graph_file']   — path to body .dot file (required)
- *   node.attrs['max_cycles']   — maximum loop iterations (default: 10)
- *   node.attrs['stop_condition'] — context key or 'llm:' prefix question
- *
- * IMPORTANT: `parseGraph` does NOT populate `node.attrs`, so tests must
- * construct nodes manually or post-process parsed graphs.
- *
- * Registered type: 'stack.manager_loop' (story 50-8)
- */
-/**
- * Parent graph with a manager loop node.
- * start → manager_loop → exit
- *
- * Note: The manager loop node needs attrs set manually in tests:
- *   node.attrs = { graph_file: '/test/body.dot', max_cycles: '3' }
- */
-export const MANAGER_LOOP_DOT = `
-digraph manager_loop_test {
-  start        [type="start"];
-  manager_loop [type="stack.manager_loop", label="Supervised Loop"];
-  exit         [type="exit"];
-
-  start        -> manager_loop;
-  manager_loop -> exit;
-}
-`;
-/**
- * Body graph for the manager loop: start → work → exit
- * Used as the content returned by the mock graphFileLoader.
- */
-export const MANAGER_LOOP_BODY_DOT = `
-digraph loop_body {
-  start [type="start"];
-  work  [type="codergen", label="Do Work"];
-  exit  [type="exit"];
-
-  start -> work;
-  work  -> exit;
-}
-`;
-/**
- * Body graph with a stop condition key written to context.
- * The work node sets context key 'task_complete' = true.
- * Used to test context-key-based stop conditions.
- */
-export const BODY_WITH_STOP_CONDITION_DOT = `
-digraph loop_body_stop {
-  start [type="start"];
-  work  [type="codergen", label="Complete Task"];
-  exit  [type="exit"];
-
-  start -> work;
-  work  -> exit;
-}
-`;
-//# sourceMappingURL=manager-loop.dot.js.map

package/dist/__tests__/fixtures/manager-loop.dot.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"manager-loop.dot.js","sourceRoot":"","sources":["../../../src/__tests__/fixtures/manager-loop.dot.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG;;;;;;;;;CAS/B,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG;;;;;;;;;CASpC,CAAA;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAAG;;;;;;;;;CAS3C,CAAA"}

package/dist/__tests__/fixtures/parallel-fan-out-fan-in.dot.d.ts

@@ -1,42 +0,0 @@
-/**
- * DOT fixture strings for parallel fan-out/fan-in integration tests.
- * Story 50-11.
- *
- * Node type strings verified via:
- *   grep -rn "registry.register" packages/factory/src/handlers/registry.ts
- *
- * Registered types used here:
- *   'parallel'       – fan-out node (story 50-1)
- *   'parallel.fan_in'– fan-in/merge node (story 50-2)
- *   'start'          – start node
- *   'exit'           – exit node
- *   'codergen'       – branch execution nodes
- *
- * Join policy is set via the DOT attribute `joinPolicy` (camelCase),
- * which the parser maps to `node.joinPolicy`. The parallel handler reads
- * `node.attrs?.['join_policy'] ?? node.joinPolicy ?? 'wait_all'`.
- */
-/**
- * 3-branch wait_all parallel graph.
- * fan_out → [branch_a, branch_b, branch_c] → fan_in → exit
- */
-export declare const PARALLEL_FAN_OUT_DOT = "\ndigraph parallel_wait_all {\n  start    [type=\"start\"];\n  fan_out  [type=\"parallel\"];\n  branch_a [type=\"codergen\", label=\"Branch A\"];\n  branch_b [type=\"codergen\", label=\"Branch B\"];\n  branch_c [type=\"codergen\", label=\"Branch C\"];\n  fan_in   [type=\"parallel.fan_in\"];\n  exit     [type=\"exit\"];\n\n  start    -> fan_out;\n  fan_out  -> branch_a;\n  fan_out  -> branch_b;\n  fan_out  -> branch_c;\n  branch_a -> fan_in;\n  branch_b -> fan_in;\n  branch_c -> fan_in;\n  fan_in   -> exit;\n}\n";
-/**
- * 2-branch first_success parallel graph.
- * fan_out → [branch_a, branch_b] → fan_in → exit
- * Policy: first_success — resolves on the first branch to return SUCCESS.
- */
-export declare const FIRST_SUCCESS_POLICY_DOT = "\ndigraph parallel_first_success {\n  start    [type=\"start\"];\n  fan_out  [type=\"parallel\", joinPolicy=\"first_success\"];\n  branch_a [type=\"codergen\", label=\"Branch A\"];\n  branch_b [type=\"codergen\", label=\"Branch B\"];\n  fan_in   [type=\"parallel.fan_in\"];\n  exit     [type=\"exit\"];\n\n  start    -> fan_out;\n  fan_out  -> branch_a;\n  fan_out  -> branch_b;\n  branch_a -> fan_in;\n  branch_b -> fan_in;\n  fan_in   -> exit;\n}\n";
-/**
- * 3-branch quorum parallel graph.
- * fan_out → [branch_a, branch_b, branch_c] → fan_in → exit
- * Policy: quorum — resolves after quorum_size branches succeed.
- * quorum_size must be added to fan_out.attrs after parsing (parser does not populate attrs).
- */
-export declare const QUORUM_POLICY_DOT = "\ndigraph parallel_quorum {\n  start    [type=\"start\"];\n  fan_out  [type=\"parallel\", joinPolicy=\"quorum\"];\n  branch_a [type=\"codergen\", label=\"Branch A\"];\n  branch_b [type=\"codergen\", label=\"Branch B\"];\n  branch_c [type=\"codergen\", label=\"Branch C\"];\n  fan_in   [type=\"parallel.fan_in\"];\n  exit     [type=\"exit\"];\n\n  start    -> fan_out;\n  fan_out  -> branch_a;\n  fan_out  -> branch_b;\n  fan_out  -> branch_c;\n  branch_a -> fan_in;\n  branch_b -> fan_in;\n  branch_c -> fan_in;\n  fan_in   -> exit;\n}\n";
-/**
- * 4-branch bounded-concurrency graph.
- * maxParallel=2 limits concurrent branch execution to at most 2 at a time.
- */
-export declare const BOUNDED_CONCURRENCY_DOT = "\ndigraph parallel_bounded {\n  start    [type=\"start\"];\n  fan_out  [type=\"parallel\", maxParallel=2];\n  branch_a [type=\"codergen\", label=\"Branch A\"];\n  branch_b [type=\"codergen\", label=\"Branch B\"];\n  branch_c [type=\"codergen\", label=\"Branch C\"];\n  branch_d [type=\"codergen\", label=\"Branch D\"];\n  fan_in   [type=\"parallel.fan_in\"];\n  exit     [type=\"exit\"];\n\n  start    -> fan_out;\n  fan_out  -> branch_a;\n  fan_out  -> branch_b;\n  fan_out  -> branch_c;\n  fan_out  -> branch_d;\n  branch_a -> fan_in;\n  branch_b -> fan_in;\n  branch_c -> fan_in;\n  branch_d -> fan_in;\n  fan_in   -> exit;\n}\n";
-//# sourceMappingURL=parallel-fan-out-fan-in.dot.d.ts.map

package/dist/__tests__/fixtures/parallel-fan-out-fan-in.dot.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"parallel-fan-out-fan-in.dot.d.ts","sourceRoot":"","sources":["../../../src/__tests__/fixtures/parallel-fan-out-fan-in.dot.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH;;;GAGG;AACH,eAAO,MAAM,oBAAoB,ygBAmBhC,CAAA;AAED;;;;GAIG;AACH,eAAO,MAAM,wBAAwB,ucAgBpC,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,iBAAiB,8hBAmB7B,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,uBAAuB,4nBAsBnC,CAAA"}

package/dist/__tests__/fixtures/parallel-fan-out-fan-in.dot.js

@@ -1,118 +0,0 @@
-/**
- * DOT fixture strings for parallel fan-out/fan-in integration tests.
- * Story 50-11.
- *
- * Node type strings verified via:
- *   grep -rn "registry.register" packages/factory/src/handlers/registry.ts
- *
- * Registered types used here:
- *   'parallel'       – fan-out node (story 50-1)
- *   'parallel.fan_in'– fan-in/merge node (story 50-2)
- *   'start'          – start node
- *   'exit'           – exit node
- *   'codergen'       – branch execution nodes
- *
- * Join policy is set via the DOT attribute `joinPolicy` (camelCase),
- * which the parser maps to `node.joinPolicy`. The parallel handler reads
- * `node.attrs?.['join_policy'] ?? node.joinPolicy ?? 'wait_all'`.
- */
-/**
- * 3-branch wait_all parallel graph.
- * fan_out → [branch_a, branch_b, branch_c] → fan_in → exit
- */
-export const PARALLEL_FAN_OUT_DOT = `
-digraph parallel_wait_all {
-  start    [type="start"];
-  fan_out  [type="parallel"];
-  branch_a [type="codergen", label="Branch A"];
-  branch_b [type="codergen", label="Branch B"];
-  branch_c [type="codergen", label="Branch C"];
-  fan_in   [type="parallel.fan_in"];
-  exit     [type="exit"];
-
-  start    -> fan_out;
-  fan_out  -> branch_a;
-  fan_out  -> branch_b;
-  fan_out  -> branch_c;
-  branch_a -> fan_in;
-  branch_b -> fan_in;
-  branch_c -> fan_in;
-  fan_in   -> exit;
-}
-`;
-/**
- * 2-branch first_success parallel graph.
- * fan_out → [branch_a, branch_b] → fan_in → exit
- * Policy: first_success — resolves on the first branch to return SUCCESS.
- */
-export const FIRST_SUCCESS_POLICY_DOT = `
-digraph parallel_first_success {
-  start    [type="start"];
-  fan_out  [type="parallel", joinPolicy="first_success"];
-  branch_a [type="codergen", label="Branch A"];
-  branch_b [type="codergen", label="Branch B"];
-  fan_in   [type="parallel.fan_in"];
-  exit     [type="exit"];
-
-  start    -> fan_out;
-  fan_out  -> branch_a;
-  fan_out  -> branch_b;
-  branch_a -> fan_in;
-  branch_b -> fan_in;
-  fan_in   -> exit;
-}
-`;
-/**
- * 3-branch quorum parallel graph.
- * fan_out → [branch_a, branch_b, branch_c] → fan_in → exit
- * Policy: quorum — resolves after quorum_size branches succeed.
- * quorum_size must be added to fan_out.attrs after parsing (parser does not populate attrs).
- */
-export const QUORUM_POLICY_DOT = `
-digraph parallel_quorum {
-  start    [type="start"];
-  fan_out  [type="parallel", joinPolicy="quorum"];
-  branch_a [type="codergen", label="Branch A"];
-  branch_b [type="codergen", label="Branch B"];
-  branch_c [type="codergen", label="Branch C"];
-  fan_in   [type="parallel.fan_in"];
-  exit     [type="exit"];
-
-  start    -> fan_out;
-  fan_out  -> branch_a;
-  fan_out  -> branch_b;
-  fan_out  -> branch_c;
-  branch_a -> fan_in;
-  branch_b -> fan_in;
-  branch_c -> fan_in;
-  fan_in   -> exit;
-}
-`;
-/**
- * 4-branch bounded-concurrency graph.
- * maxParallel=2 limits concurrent branch execution to at most 2 at a time.
- */
-export const BOUNDED_CONCURRENCY_DOT = `
-digraph parallel_bounded {
-  start    [type="start"];
-  fan_out  [type="parallel", maxParallel=2];
-  branch_a [type="codergen", label="Branch A"];
-  branch_b [type="codergen", label="Branch B"];
-  branch_c [type="codergen", label="Branch C"];
-  branch_d [type="codergen", label="Branch D"];
-  fan_in   [type="parallel.fan_in"];
-  exit     [type="exit"];
-
-  start    -> fan_out;
-  fan_out  -> branch_a;
-  fan_out  -> branch_b;
-  fan_out  -> branch_c;
-  fan_out  -> branch_d;
-  branch_a -> fan_in;
-  branch_b -> fan_in;
-  branch_c -> fan_in;
-  branch_d -> fan_in;
-  fan_in   -> exit;
-}
-`;
-//# sourceMappingURL=parallel-fan-out-fan-in.dot.js.map

package/dist/__tests__/fixtures/parallel-fan-out-fan-in.dot.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parallel-fan-out-fan-in.dot.js","sourceRoot":"","sources":["../../../src/__tests__/fixtures/parallel-fan-out-fan-in.dot.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH;;;GAGG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG;;;;;;;;;;;;;;;;;;;CAmBnC,CAAA;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG;;;;;;;;;;;;;;;;CAgBvC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG;;;;;;;;;;;;;;;;;;;CAmBhC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG;;;;;;;;;;;;;;;;;;;;;;CAsBtC,CAAA"}

package/dist/__tests__/fixtures/subgraph-parent.dot.d.ts

@@ -1,35 +0,0 @@
-/**
- * DOT fixture strings for subgraph execution integration tests.
- * Story 50-11.
- *
- * The `subgraph` handler type reads `node.attrs['graph_file']` for the
- * path to the child .dot file. Since `parseGraph` does not populate
- * `node.attrs`, tests must post-process the parsed graph to add attrs:
- *   const graph = parseGraph(SUBGRAPH_PARENT_DOT)
- *   graph.nodes.get('sg_node')!.attrs = { graph_file: '/test/child.dot' }
- *
- * Registered type: 'subgraph' (story 50-5)
- */
-/**
- * Parent graph with a single subgraph node.
- * start → sg_node (subgraph) → exit
- *
- * Note: `graph_file` attribute must be added via post-processing after parsing:
- *   parentGraph.nodes.get('sg_node')!.attrs = { graph_file: '/test/child.dot' }
- */
-export declare const SUBGRAPH_PARENT_DOT = "\ndigraph subgraph_parent_test {\n  start   [type=\"start\"];\n  sg_node [type=\"subgraph\", label=\"Child Pipeline\"];\n  exit    [type=\"exit\"];\n\n  start   -> sg_node;\n  sg_node -> exit;\n}\n";
-/**
- * Minimal child graph: start → codergen → exit
- * Used as the body graph loaded by the mock graphFileLoader.
- */
-export declare const CHILD_GRAPH_DOT = "\ndigraph child_graph {\n  start  [type=\"start\"];\n  work   [type=\"codergen\", label=\"Child Work\"];\n  exit   [type=\"exit\"];\n\n  start -> work;\n  work  -> exit;\n}\n";
-/**
- * Child graph that itself contains a subgraph node (for nested depth tests).
- * The grandchild subgraph node needs attrs post-processing in tests too.
- */
-export declare const CHILD_WITH_SUBGRAPH_DOT = "\ndigraph child_with_subgraph {\n  start        [type=\"start\"];\n  nested_sg    [type=\"subgraph\", label=\"Grandchild Pipeline\"];\n  exit         [type=\"exit\"];\n\n  start     -> nested_sg;\n  nested_sg -> exit;\n}\n";
-/**
- * Minimal grandchild graph: start → exit (no codergen needed)
- */
-export declare const GRANDCHILD_GRAPH_DOT = "\ndigraph grandchild_graph {\n  start [type=\"start\"];\n  exit  [type=\"exit\"];\n\n  start -> exit;\n}\n";
-//# sourceMappingURL=subgraph-parent.dot.d.ts.map

package/dist/__tests__/fixtures/subgraph-parent.dot.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"subgraph-parent.dot.d.ts","sourceRoot":"","sources":["../../../src/__tests__/fixtures/subgraph-parent.dot.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH;;;;;;GAMG;AACH,eAAO,MAAM,mBAAmB,0MAS/B,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,eAAe,mLAS3B,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,uBAAuB,mOASnC,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,oBAAoB,+GAOhC,CAAA"}

package/dist/__tests__/fixtures/subgraph-parent.dot.js

@@ -1,69 +0,0 @@
-/**
- * DOT fixture strings for subgraph execution integration tests.
- * Story 50-11.
- *
- * The `subgraph` handler type reads `node.attrs['graph_file']` for the
- * path to the child .dot file. Since `parseGraph` does not populate
- * `node.attrs`, tests must post-process the parsed graph to add attrs:
- *   const graph = parseGraph(SUBGRAPH_PARENT_DOT)
- *   graph.nodes.get('sg_node')!.attrs = { graph_file: '/test/child.dot' }
- *
- * Registered type: 'subgraph' (story 50-5)
- */
-/**
- * Parent graph with a single subgraph node.
- * start → sg_node (subgraph) → exit
- *
- * Note: `graph_file` attribute must be added via post-processing after parsing:
- *   parentGraph.nodes.get('sg_node')!.attrs = { graph_file: '/test/child.dot' }
- */
-export const SUBGRAPH_PARENT_DOT = `
-digraph subgraph_parent_test {
-  start   [type="start"];
-  sg_node [type="subgraph", label="Child Pipeline"];
-  exit    [type="exit"];
-
-  start   -> sg_node;
-  sg_node -> exit;
-}
-`;
-/**
- * Minimal child graph: start → codergen → exit
- * Used as the body graph loaded by the mock graphFileLoader.
- */
-export const CHILD_GRAPH_DOT = `
-digraph child_graph {
-  start  [type="start"];
-  work   [type="codergen", label="Child Work"];
-  exit   [type="exit"];
-
-  start -> work;
-  work  -> exit;
-}
-`;
-/**
- * Child graph that itself contains a subgraph node (for nested depth tests).
- * The grandchild subgraph node needs attrs post-processing in tests too.
- */
-export const CHILD_WITH_SUBGRAPH_DOT = `
-digraph child_with_subgraph {
-  start        [type="start"];
-  nested_sg    [type="subgraph", label="Grandchild Pipeline"];
-  exit         [type="exit"];
-
-  start     -> nested_sg;
-  nested_sg -> exit;
-}
-`;
-/**
- * Minimal grandchild graph: start → exit (no codergen needed)
- */
-export const GRANDCHILD_GRAPH_DOT = `
-digraph grandchild_graph {
-  start [type="start"];
-  exit  [type="exit"];
-
-  start -> exit;
-}
-`;
-//# sourceMappingURL=subgraph-parent.dot.js.map

package/dist/__tests__/fixtures/subgraph-parent.dot.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"subgraph-parent.dot.js","sourceRoot":"","sources":["../../../src/__tests__/fixtures/subgraph-parent.dot.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG;;;;;;;;;CASlC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG;;;;;;;;;CAS9B,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG;;;;;;;;;CAStC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG;;;;;;;CAOnC,CAAA"}

package/dist/__tests__/integration/advanced-graph-events.test.d.ts

@@ -1,19 +0,0 @@
-/**
- * Integration tests for advanced graph event stream patterns.
- * Story 50-11 AC5.
- *
- * Tests cover event payload completeness and multi-handler event sequencing:
- *   - graph:subgraph-started payload fields (nodeId, graphFile, depth, runId)
- *   - graph:subgraph-completed payload fields (status, durationMs, graphFile, depth)
- *   - Event ordering: started before completed
- *   - Depth tracking in event payloads (root vs nested)
- *   - runId resolution: context.__runId vs options.runId fallback
- *   - Absent eventBus: handlers run without crash
- *   - LLM edge event: graph:llm-edge-evaluated carries nodeId + question + result + runId
- *   - Combined: LLM edge and subgraph events in the same bus (cross-feature coexistence)
- *   - Event bus receives events from both selectEdge and subgraph handler in one test
- *
- * ≥8 `it(...)` cases required (AC7).
- */
-export {};
-//# sourceMappingURL=advanced-graph-events.test.d.ts.map

package/dist/__tests__/integration/advanced-graph-events.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"advanced-graph-events.test.d.ts","sourceRoot":"","sources":["../../../src/__tests__/integration/advanced-graph-events.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG"}