@mark1russell7/collections 0.9.4 → 0.9.5

package/README.md

@@ -103,12 +103,16 @@ Each guide has examples, and a test runs each example:
 - [Lists](https://github.com/mark1russell7/collections/blob/main/docs/guides/lists.md): `arrayList` and `linkedList`
 - [Maps and sets](https://github.com/mark1russell7/collections/blob/main/docs/guides/maps-and-sets.md): hash maps, tree maps, linked maps, and their sets
 - [Queues](https://github.com/mark1russell7/collections/blob/main/docs/guides/queues.md): `arrayDeque` and `priorityQueue`
+- [Equality, hashes and order](https://github.com/mark1russell7/collections/blob/main/docs/guides/equality-and-order.md): `deepEq`, `defaultHash`, the comparators and their rules
+- [Async queues and tasks](https://github.com/mark1russell7/collections/blob/main/docs/guides/async.md): `asyncQueue`, `semaphore` and `asSettled`
 - [Dependency graphs](https://github.com/mark1russell7/collections/blob/main/docs/guides/dag.md): levels, the topological order, and a run with `executeDAG`
 - [Graph orders](https://github.com/mark1russell7/collections/blob/main/docs/guides/graph.md): `hubBreadthFirstOrder`
 - [Layers](https://github.com/mark1russell7/collections/blob/main/docs/guides/layers.md): `compose`, its types and its laws, and behaviors on a collection
 - [Behaviors](https://github.com/mark1russell7/collections/blob/main/docs/guides/behaviors.md): readonly views, safe reads and the locks
+- [Events and caches](https://github.com/mark1russell7/collections/blob/main/docs/guides/caches.md): `eventedMap`, `eventedList`, `lruMap`, `ttlMap` and their stacks
 - [Iterables and collectors](https://github.com/mark1russell7/collections/blob/main/docs/guides/iterables.md): lazy functions, reducers, collectors and the names of the root
 - [Rank keys](https://github.com/mark1russell7/collections/blob/main/docs/guides/rank-keys.md): the keys of a list that a user can reorder, and the writes of a move
+- [Summary trees](https://github.com/mark1russell7/collections/blob/main/docs/guides/summary-tree.md): the spec, a search by a summary, positions in a text, the edits and `merge`
 
 ## Contract checks
 

package/build/dag/index.d.ts

@@ -90,7 +90,7 @@ interface DAGResult<TNode extends DAGNode = DAGNode> {
  */
 type NodeProcessor<TNode extends DAGNode = DAGNode> = (node: TNode) => Promise<NodeResult<TNode>>;
 /**
- * Build a leveled DAG from nodes using Kahn's algorithm
+ * This function builds a leveled DAG from nodes, with Kahn's algorithm.
  *
  * This assigns levels to each node where:
  * - Level 0: Nodes with no dependencies (leaves)
@@ -102,7 +102,7 @@ type NodeProcessor<TNode extends DAGNode = DAGNode> = (node: TNode) => Promise<N
  */
 export declare function buildLeveledDAG<TNode extends DAGNode>(nodes: Map<string, TNode>): DependencyDAG<TNode>;
 /**
- * Get the topological order (flat list, leaves first)
+ * This function gives the topological order: a flat list, leaves first.
  */
 export declare function getTopologicalOrder<TNode extends DAGNode>(dag: DependencyDAG<TNode>): TNode[];
 /**
@@ -110,7 +110,7 @@ export declare function getTopologicalOrder<TNode extends DAGNode>(dag: Dependen
  */
 export declare function visualizeDAG<TNode extends DAGNode>(dag: DependencyDAG<TNode>): string;
 /**
- * Start DAG with level-based parallelization
+ * This function starts a DAG level by level, with the nodes of each level in parallel.
  *
  * - Levels are processed sequentially (level 0 first, then level 1, and so on)
  * - Within each level, nodes are processed in parallel up to concurrency limit
@@ -130,31 +130,31 @@ export declare function visualizeDAG<TNode extends DAGNode>(dag: DependencyDAG<T
  */
 export declare function executeDAG<TNode extends DAGNode>(dag: DependencyDAG<TNode>, processor: (node: TNode) => Promise<NodeResult<TNode>>, options?: DAGExecutionOptions<TNode>): Promise<DAGResult<TNode>>;
 /**
- * Start DAG sequentially (no parallelization)
+ * This function starts a DAG one node at a time, with no nodes in parallel.
  */
 export declare function executeDAGSequential<TNode extends DAGNode>(dag: DependencyDAG<TNode>, processor: (node: TNode) => Promise<NodeResult<TNode>>, options?: Omit<DAGExecutionOptions<TNode>, "concurrency">): Promise<DAGResult<TNode>>;
 /**
- * Make a simple processor that wraps an async function
+ * This function makes a simple processor that wraps an async function.
  */
 export declare function createProcessor<TNode extends DAGNode>(fn: (node: TNode) => Promise<void>): (node: TNode) => Promise<NodeResult<TNode>>;
 /**
- * Filter DAG to only include nodes reachable from a root
+ * This function filters a DAG to the nodes that a root can reach.
  */
 export declare function filterDAGFromRoot<TNode extends DAGNode>(nodes: Map<string, TNode>, rootId: string): Map<string, TNode>;
 /**
- * Get all ancestors of a node (nodes that this node depends on, transitively)
+ * This function gives all ancestors of a node: the nodes that this node depends on, transitively.
  */
 export declare function getAncestors<TNode extends DAGNode>(nodes: Map<string, TNode>, id: string): Set<string>;
 /**
- * Get all descendants of a node (nodes that depend on this node, transitively)
+ * This function gives all descendants of a node: the nodes that depend on this node, transitively.
  */
 export declare function getDescendants<TNode extends DAGNode>(nodes: Map<string, TNode>, id: string): Set<string>;
 /**
- * Make a DAG node from minimal input
+ * This function makes a DAG node from a minimal input.
  */
 export declare function createNode<TData = unknown>(id: string, dependencies?: string[], data?: TData | undefined): DAGNode<TData>;
 /**
- * Build a Map of nodes from an array
+ * This function builds a Map of nodes from an array.
  */
 export declare function buildNodeMap<TNode extends DAGNode>(nodes: TNode[]): Map<string, TNode>;
 export type { DAGExecutionOptions, DAGNode, DAGResult, DependencyDAG, NodeProcessor, NodeResult };

package/build/dag/index.js

@@ -1,6 +1,6 @@
 // src/dag/traversal.ts
 /**
-* Build a leveled DAG from nodes using Kahn's algorithm
+* This function builds a leveled DAG from nodes, with Kahn's algorithm.
 *
 * This assigns levels to each node where:
 * - Level 0: Nodes with no dependencies (leaves)
@@ -60,7 +60,7 @@ function buildLeveledDAG(nodes) {
 	};
 }
 /**
-* Get the topological order (flat list, leaves first)
+* This function gives the topological order: a flat list, leaves first.
 */
 function getTopologicalOrder(dag) {
 	return dag.levels.flat();
@@ -82,7 +82,7 @@ function visualizeDAG(dag) {
 }
 // src/dag/executor.ts
 /**
-* Start a batch of items with concurrency limit
+* This function starts a batch of items with a limit of concurrency.
 */
 async function executeWithConcurrency(items, fn, limit) {
 	const results = [];
@@ -100,7 +100,7 @@ async function executeWithConcurrency(items, fn, limit) {
 	return results;
 }
 /**
-* Call a listener. A listener that throws does not stop the run: the function gives a log
+* This function calls a listener. A listener that throws does not stop the run: the function gives a log
 * line for its error (deep dive DATA-21).
 */
 function notify(name, listener, arg) {
@@ -113,7 +113,7 @@ function notify(name, listener, arg) {
 	}
 }
 /**
-* Start DAG with level-based parallelization
+* This function starts a DAG level by level, with the nodes of each level in parallel.
 *
 * - Levels are processed sequentially (level 0 first, then level 1, and so on)
 * - Within each level, nodes are processed in parallel up to concurrency limit
@@ -201,7 +201,7 @@ async function executeDAG(dag, processor, options = {}) {
 	};
 }
 /**
-* Start DAG sequentially (no parallelization)
+* This function starts a DAG one node at a time, with no nodes in parallel.
 */
 async function executeDAGSequential(dag, processor, options = {}) {
 	return executeDAG(dag, processor, {
@@ -210,7 +210,7 @@ async function executeDAGSequential(dag, processor, options = {}) {
 	});
 }
 /**
-* Make a simple processor that wraps an async function
+* This function makes a simple processor that wraps an async function.
 */
 function createProcessor(fn) {
 	return async (node) => {
@@ -241,7 +241,7 @@ function createProcessor(fn) {
 }
 // src/dag/builder.ts
 /**
-* Filter DAG to only include nodes reachable from a root
+* This function filters a DAG to the nodes that a root can reach.
 */
 function filterDAGFromRoot(nodes, rootId) {
 	const filtered = /* @__PURE__ */ new Map();
@@ -258,7 +258,7 @@ function filterDAGFromRoot(nodes, rootId) {
 	return filtered;
 }
 /**
-* Get all ancestors of a node (nodes that this node depends on, transitively)
+* This function gives all ancestors of a node: the nodes that this node depends on, transitively.
 */
 function getAncestors(nodes, id) {
 	const ancestors = /* @__PURE__ */ new Set();
@@ -277,7 +277,7 @@ function getAncestors(nodes, id) {
 	return ancestors;
 }
 /**
-* Get all descendants of a node (nodes that depend on this node, transitively)
+* This function gives all descendants of a node: the nodes that depend on this node, transitively.
 */
 function getDescendants(nodes, id) {
 	const descendants = /* @__PURE__ */ new Set();
@@ -301,7 +301,7 @@ function getDescendants(nodes, id) {
 	return descendants;
 }
 /**
-* Make a DAG node from minimal input
+* This function makes a DAG node from a minimal input.
 */
 function createNode(id, dependencies = [], data) {
 	const node = {
@@ -312,7 +312,7 @@ function createNode(id, dependencies = [], data) {
 	return node;
 }
 /**
-* Build a Map of nodes from an array
+* This function builds a Map of nodes from an array.
 */
 function buildNodeMap(nodes) {
 	return new Map(nodes.map((n) => [n.id, n]));

package/build/dag/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../src/dag/traversal.ts","../../src/dag/executor.ts","../../src/dag/builder.ts"],"sourcesContent":["/**\n * DAG Traversal using Kahn's Algorithm\n *\n * This module implements topological sort with level assignment for parallel execution.\n * Level 0 = leaves (no dependencies), higher levels depend on lower levels.\n */\n\nimport type { DAGNode, DependencyDAG } from \"./types.js\";\n\n/**\n * Build a leveled DAG from nodes using Kahn's algorithm\n *\n * This assigns levels to each node where:\n * - Level 0: Nodes with no dependencies (leaves)\n * - Level N: Nodes whose dependencies are all at level < N\n *\n * Nodes at the same level can be processed in parallel.\n *\n * @throws Error if a cycle is detected\n */\nexport function buildLeveledDAG<TNode extends DAGNode>(\n  nodes: Map<string, TNode>\n): DependencyDAG<TNode> {\n  const inDegree = new Map<string, number>();\n  const dependents = new Map<string, Set<string>>();\n\n  for (const [name, node] of nodes) {\n    // A set: a dependency that a node lists twice counts once. (`dependents` is a set, so it\n    // takes the in-degree down once: a repeated dependency was \"Circular\": deep dive DATA-21.)\n    const depsInDag = new Set(node.dependencies.filter((dep) => nodes.has(dep)));\n    inDegree.set(name, depsInDag.size);\n    dependents.set(name, new Set());\n  }\n\n  for (const [name, node] of nodes) {\n    for (const dep of node.dependencies) {\n      if (dependents.has(dep)) {\n        dependents.get(dep)!.add(name);\n      }\n    }\n  }\n\n  let queue: string[] = [];\n  for (const [name, degree] of inDegree) {\n    if (degree === 0) {\n      queue.push(name);\n    }\n  }\n\n  const levels: TNode[][] = [];\n  const nodeLevel = new Map<string, number>();\n  let processedCount = 0;\n\n  while (queue.length > 0) {\n    const currentLevel = levels.length;\n    const levelNodes: TNode[] = [];\n    const nextQueue: string[] = [];\n\n    for (const name of queue) {\n      const node = nodes.get(name)!;\n      node.level = currentLevel;\n      nodeLevel.set(name, currentLevel);\n      levelNodes.push(node);\n      processedCount++;\n\n      for (const dependent of dependents.get(name) ?? []) {\n        const newDegree = inDegree.get(dependent)! - 1;\n        inDegree.set(dependent, newDegree);\n\n        if (newDegree === 0) {\n          nextQueue.push(dependent);\n        }\n      }\n    }\n\n    levels.push(levelNodes);\n    queue = nextQueue;\n  }\n\n  if (processedCount !== nodes.size) {\n    const cycleNodes = [...nodes.keys()].filter((n) => !nodeLevel.has(n));\n    throw new Error(\"Circular dependency detected involving: \" + cycleNodes.join(\", \"));\n  }\n\n  const roots = [...nodes.keys()].filter((name) => {\n    const deps = dependents.get(name);\n    return !deps || deps.size === 0;\n  });\n\n  const leaves = [...nodes.keys()].filter((name) => {\n    const node = nodes.get(name)!;\n    const depsInDag = node.dependencies.filter((dep) => nodes.has(dep));\n    return depsInDag.length === 0;\n  });\n\n  return { nodes, levels, roots, leaves };\n}\n\n/**\n * Get the topological order (flat list, leaves first)\n */\nexport function getTopologicalOrder<TNode extends DAGNode>(\n  dag: DependencyDAG<TNode>\n): TNode[] {\n  return dag.levels.flat();\n}\n\n/**\n * Visualize the DAG structure (for debugging)\n */\nexport function visualizeDAG<TNode extends DAGNode>(\n  dag: DependencyDAG<TNode>\n): string {\n  const lines = [\"DAG Structure:\"];\n\n  for (let i = 0; i < dag.levels.length; i++) {\n    const level = dag.levels[i]!;\n    lines.push(\"  Level \" + i + \":\");\n    for (const node of level) {\n      const deps =\n        node.dependencies.length > 0\n          ? \" -> [\" + node.dependencies.join(\", \") + \"]\"\n          : \" (leaf)\";\n      lines.push(\"    - \" + node.id + deps);\n    }\n  }\n\n  return lines.join(\"\\n\");\n}\n","/**\n * DAG Executor with parallel level-based execution\n */\n\nimport type {\n  DependencyDAG,\n  DAGNode,\n  DAGExecutionOptions,\n  NodeResult,\n  DAGResult,\n} from \"./types.js\";\n\n/**\n * Start a batch of items with concurrency limit\n */\nasync function executeWithConcurrency<T, R>(\n  items: T[],\n  fn: (item: T) => Promise<R>,\n  limit: number\n): Promise<R[]> {\n  const results: R[] = [];\n  const executing = new Set<Promise<void>>();\n\n  for (const item of items) {\n    const promise = fn(item)\n      .then((result) => {\n        results.push(result);\n      })\n      .finally(() => {\n        // Rejection-safe cleanup: always remove the settled promise from the\n        // executing set, even if `fn` rejected, so the set never leaks a\n        // settled (possibly rejected) promise into later `race`/`all` waits.\n        executing.delete(promise);\n      });\n\n    executing.add(promise);\n\n    if (executing.size >= limit) {\n      await Promise.race(executing);\n    }\n  }\n\n  await Promise.all(executing);\n  return results;\n}\n\n/**\n * Call a listener. A listener that throws does not stop the run: the function gives a log\n * line for its error (deep dive DATA-21).\n */\nfunction notify<T>(name: string, listener: ((arg: T) => void) | undefined, arg: T): string | undefined {\n  if (!listener) return undefined;\n  try {\n    listener(arg);\n    return undefined;\n  } catch (error) {\n    return name + \" threw: \" + (error instanceof Error ? error.message : String(error));\n  }\n}\n\n/**\n * Start DAG with level-based parallelization\n *\n * - Levels are processed sequentially (level 0 first, then level 1, and so on)\n * - Within each level, nodes are processed in parallel up to concurrency limit\n * - Supports fail-fast or continue-on-error modes\n *\n * A processor that throws does NOT reject the whole run. The run records the throw\n * as a failed NodeResult, so partial results are always given.\n *\n * With `skipDependents` (the default), a node whose dependency failed or was skipped does not start. Its result has\n * `skipped: true` and an error that names those dependencies. A dependency outside the DAG does not count.\n *\n * `failFast` operates on levels. When a node of a level fails, each node of that level continues to its end.\n * This includes the nodes that did not start before the failure, when `concurrency` is less than the\n * size of the level. No later level starts. The run does not cancel a node.\n *\n * A node that did not start (`skipped: true`) calls neither `onNodeStart` nor `onNodeComplete`.\n */\nexport async function executeDAG<TNode extends DAGNode>(\n  dag: DependencyDAG<TNode>,\n  processor: (node: TNode) => Promise<NodeResult<TNode>>,\n  options: DAGExecutionOptions<TNode> = {}\n): Promise<DAGResult<TNode>> {\n  const {\n    concurrency = 4,\n    failFast = true,\n    skipDependents = true,\n    onNodeStart,\n    onNodeComplete,\n  } = options;\n\n  const results = new Map<string, NodeResult<TNode>>();\n  const failedNodes: string[] = [];\n  const skippedNodes: string[] = [];\n  // The ids of the nodes that failed or were skipped\n  const blocked = new Set<string>();\n  const startTime = Date.now();\n  let shouldStop = false;\n\n  for (const level of dag.levels) {\n    if (shouldStop) break;\n\n    const runnable: TNode[] = [];\n    for (const node of level) {\n      const blockers = skipDependents ? node.dependencies.filter((dep) => blocked.has(dep)) : [];\n      if (blockers.length === 0) {\n        runnable.push(node);\n        continue;\n      }\n      const message = \"Skipped \" + node.id + \": the dependencies \" + blockers.join(\", \") + \" failed or were skipped\";\n      results.set(node.id, { node, success: false, skipped: true, error: new Error(message), duration: 0, logs: [message] });\n      skippedNodes.push(node.id);\n      blocked.add(node.id);\n    }\n\n    const levelResults = await executeWithConcurrency(\n      runnable,\n      async (node) => {\n        const startError = notify(\"onNodeStart\", onNodeStart, node);\n        const nodeStart = Date.now();\n        let result: NodeResult<TNode>;\n        try {\n          result = await processor(node);\n        } catch (error) {\n          // Convert a thrown processor error into a failed NodeResult instead\n          // of rejecting the entire run and discarding partial results.\n          const err =\n            error instanceof Error ? error : new Error(String(error));\n          result = {\n            node,\n            success: false,\n            error: err,\n            duration: Date.now() - nodeStart,\n            logs: [\"Processor threw: \" + err.message],\n          };\n        }\n        const completeError = notify(\"onNodeComplete\", onNodeComplete, result);\n        const listenerErrors = [startError, completeError].filter((line): line is string => line !== undefined);\n        if (listenerErrors.length > 0) {\n          result = { ...result, logs: [...(result.logs ?? []), ...listenerErrors] };\n        }\n        return result;\n      },\n      concurrency\n    );\n\n    for (const result of levelResults) {\n      results.set(result.node.id, result);\n      if (!result.success) {\n        failedNodes.push(result.node.id);\n        blocked.add(result.node.id);\n        if (failFast) {\n          shouldStop = true;\n        }\n      }\n    }\n  }\n\n  return {\n    success: failedNodes.length === 0 && skippedNodes.length === 0,\n    results,\n    failedNodes,\n    skippedNodes,\n    totalDuration: Date.now() - startTime,\n  };\n}\n\n/**\n * Start DAG sequentially (no parallelization)\n */\nexport async function executeDAGSequential<TNode extends DAGNode>(\n  dag: DependencyDAG<TNode>,\n  processor: (node: TNode) => Promise<NodeResult<TNode>>,\n  options: Omit<DAGExecutionOptions<TNode>, \"concurrency\"> = {}\n): Promise<DAGResult<TNode>> {\n  return executeDAG(dag, processor, { ...options, concurrency: 1 });\n}\n\n/**\n * Make a simple processor that wraps an async function\n */\nexport function createProcessor<TNode extends DAGNode>(\n  fn: (node: TNode) => Promise<void>\n): (node: TNode) => Promise<NodeResult<TNode>> {\n  return async (node: TNode): Promise<NodeResult<TNode>> => {\n    const startTime = Date.now();\n    const logs: string[] = [];\n\n    try {\n      logs.push(\"Starting \" + node.id);\n      await fn(node);\n      logs.push(\"Completed \" + node.id);\n\n      return {\n        node,\n        success: true,\n        duration: Date.now() - startTime,\n        logs,\n      };\n    } catch (error) {\n      const err = error instanceof Error ? error : new Error(String(error));\n      logs.push(\"Failed \" + node.id + \": \" + err.message);\n\n      return {\n        node,\n        success: false,\n        error: err,\n        duration: Date.now() - startTime,\n        logs,\n      };\n    }\n  };\n}\n","/**\n * DAG Builder utilities\n */\n\nimport type { DAGNode } from \"./types.js\";\n\n/**\n * Filter DAG to only include nodes reachable from a root\n */\nexport function filterDAGFromRoot<TNode extends DAGNode>(\n  nodes: Map<string, TNode>,\n  rootId: string\n): Map<string, TNode> {\n  const filtered = new Map<string, TNode>();\n  const visited = new Set<string>();\n\n  function visit(id: string): void {\n    if (visited.has(id)) return;\n    visited.add(id);\n\n    const node = nodes.get(id);\n    if (!node) return;\n\n    filtered.set(id, node);\n\n    for (const dep of node.dependencies) {\n      visit(dep);\n    }\n  }\n\n  visit(rootId);\n  return filtered;\n}\n\n/**\n * Get all ancestors of a node (nodes that this node depends on, transitively)\n */\nexport function getAncestors<TNode extends DAGNode>(\n  nodes: Map<string, TNode>,\n  id: string\n): Set<string> {\n  const ancestors = new Set<string>();\n  const visited = new Set<string>();\n\n  function visit(n: string): void {\n    if (visited.has(n)) return;\n    visited.add(n);\n\n    const node = nodes.get(n);\n    if (!node) return;\n\n    for (const dep of node.dependencies) {\n      if (nodes.has(dep)) {\n        ancestors.add(dep);\n        visit(dep);\n      }\n    }\n  }\n\n  visit(id);\n  return ancestors;\n}\n\n/**\n * Get all descendants of a node (nodes that depend on this node, transitively)\n */\nexport function getDescendants<TNode extends DAGNode>(\n  nodes: Map<string, TNode>,\n  id: string\n): Set<string> {\n  const descendants = new Set<string>();\n  const visited = new Set<string>();\n\n  // Build reverse dependency map\n  const dependents = new Map<string, Set<string>>();\n  for (const [nodeId, node] of nodes) {\n    for (const dep of node.dependencies) {\n      if (!dependents.has(dep)) {\n        dependents.set(dep, new Set());\n      }\n      dependents.get(dep)!.add(nodeId);\n    }\n  }\n\n  function visit(n: string): void {\n    if (visited.has(n)) return;\n    visited.add(n);\n\n    const deps = dependents.get(n);\n    if (!deps) return;\n\n    for (const dep of deps) {\n      descendants.add(dep);\n      visit(dep);\n    }\n  }\n\n  visit(id);\n  return descendants;\n}\n\n/**\n * Make a DAG node from minimal input\n */\nexport function createNode<TData = unknown>(\n  id: string,\n  dependencies: string[] = [],\n  data?: TData | undefined\n): DAGNode<TData> {\n  const node: DAGNode<TData> = { id, dependencies };\n  if (data !== undefined) {\n    node.data = data;\n  }\n  return node;\n}\n\n/**\n * Build a Map of nodes from an array\n */\nexport function buildNodeMap<TNode extends DAGNode>(\n  nodes: TNode[]\n): Map<string, TNode> {\n  return new Map(nodes.map((n) => [n.id, n]));\n}\n"],"mappings":";;;;;;;;;;;;AAoBA,SAAgB,gBACd,OACsB;CACtB,MAAM,2BAAW,IAAI,IAAoB;CACzC,MAAM,6BAAa,IAAI,IAAyB;CAEhD,KAAK,MAAM,CAAC,MAAM,SAAS,OAAO;EAGhC,MAAM,YAAY,IAAI,IAAI,KAAK,aAAa,QAAQ,QAAQ,MAAM,IAAI,GAAG,CAAC,CAAC;EAC3E,SAAS,IAAI,MAAM,UAAU,IAAI;EACjC,WAAW,IAAI,sBAAM,IAAI,IAAI,CAAC;CAChC;CAEA,KAAK,MAAM,CAAC,MAAM,SAAS,OACzB,KAAK,MAAM,OAAO,KAAK,cACrB,IAAI,WAAW,IAAI,GAAG,GACpB,WAAW,IAAI,GAAG,CAAC,CAAE,IAAI,IAAI;CAKnC,IAAI,QAAkB,CAAC;CACvB,KAAK,MAAM,CAAC,MAAM,WAAW,UAC3B,IAAI,WAAW,GACb,MAAM,KAAK,IAAI;CAInB,MAAM,SAAoB,CAAC;CAC3B,MAAM,4BAAY,IAAI,IAAoB;CAC1C,IAAI,iBAAiB;CAErB,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,eAAe,OAAO;EAC5B,MAAM,aAAsB,CAAC;EAC7B,MAAM,YAAsB,CAAC;EAE7B,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,OAAO,MAAM,IAAI,IAAI;GAC3B,KAAK,QAAQ;GACb,UAAU,IAAI,MAAM,YAAY;GAChC,WAAW,KAAK,IAAI;GACpB;GAEA,KAAK,MAAM,aAAa,WAAW,IAAI,IAAI,KAAK,CAAC,GAAG;IAClD,MAAM,YAAY,SAAS,IAAI,SAAS,IAAK;IAC7C,SAAS,IAAI,WAAW,SAAS;IAEjC,IAAI,cAAc,GAChB,UAAU,KAAK,SAAS;GAE5B;EACF;EAEA,OAAO,KAAK,UAAU;EACtB,QAAQ;CACV;CAEA,IAAI,mBAAmB,MAAM,MAAM;EACjC,MAAM,aAAa,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,QAAQ,MAAM,CAAC,UAAU,IAAI,CAAC,CAAC;EACpE,MAAM,IAAI,MAAM,6CAA6C,WAAW,KAAK,IAAI,CAAC;CACpF;CAaA,OAAO;EAAE;EAAO;EAAQ,OAXV,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,QAAQ,SAAS;GAC/C,MAAM,OAAO,WAAW,IAAI,IAAI;GAChC,OAAO,CAAC,QAAQ,KAAK,SAAS;EAChC,CAQ4B;EAAG,QANhB,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,QAAQ,SAAS;GAGhD,OAFa,MAAM,IAAI,IACF,CAAC,CAAC,aAAa,QAAQ,QAAQ,MAAM,IAAI,GAAG,CAClD,CAAC,CAAC,WAAW;EAC9B,CAEoC;CAAE;AACxC;;;;AAKA,SAAgB,oBACd,KACS;CACT,OAAO,IAAI,OAAO,KAAK;AACzB;;;;AAKA,SAAgB,aACd,KACQ;CACR,MAAM,QAAQ,CAAC,gBAAgB;CAE/B,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,OAAO,QAAQ,KAAK;EAC1C,MAAM,QAAQ,IAAI,OAAO;EACzB,MAAM,KAAK,aAAa,IAAI,GAAG;EAC/B,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,OACJ,KAAK,aAAa,SAAS,IACvB,UAAU,KAAK,aAAa,KAAK,IAAI,IAAI,MACzC;GACN,MAAM,KAAK,WAAW,KAAK,KAAK,IAAI;EACtC;CACF;CAEA,OAAO,MAAM,KAAK,IAAI;AACxB;;;;;ACjHA,eAAe,uBACb,OACA,IACA,OACc;CACd,MAAM,UAAe,CAAC;CACtB,MAAM,4BAAY,IAAI,IAAmB;CAEzC,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,UAAU,GAAG,IAAI,CAAC,CACrB,MAAM,WAAW;GAChB,QAAQ,KAAK,MAAM;EACrB,CAAC,CAAC,CACD,cAAc;GAIb,UAAU,OAAO,OAAO;EAC1B,CAAC;EAEH,UAAU,IAAI,OAAO;EAErB,IAAI,UAAU,QAAQ,OACpB,MAAM,QAAQ,KAAK,SAAS;CAEhC;CAEA,MAAM,QAAQ,IAAI,SAAS;CAC3B,OAAO;AACT;;;;;AAMA,SAAS,OAAU,MAAc,UAA0C,KAA4B;CACrG,IAAI,CAAC,UAAU,OAAO,KAAA;CACtB,IAAI;EACF,SAAS,GAAG;EACZ;CACF,SAAS,OAAO;EACd,OAAO,OAAO,cAAc,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;CACnF;AACF;;;;;;;;;;;;;;;;;;;;AAqBA,eAAsB,WACpB,KACA,WACA,UAAsC,CAAC,GACZ;CAC3B,MAAM,EACJ,cAAc,GACd,WAAW,MACX,iBAAiB,MACjB,aACA,mBACE;CAEJ,MAAM,0BAAU,IAAI,IAA+B;CACnD,MAAM,cAAwB,CAAC;CAC/B,MAAM,eAAyB,CAAC;CAEhC,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,YAAY,KAAK,IAAI;CAC3B,IAAI,aAAa;CAEjB,KAAK,MAAM,SAAS,IAAI,QAAQ;EAC9B,IAAI,YAAY;EAEhB,MAAM,WAAoB,CAAC;EAC3B,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,WAAW,iBAAiB,KAAK,aAAa,QAAQ,QAAQ,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC;GACzF,IAAI,SAAS,WAAW,GAAG;IACzB,SAAS,KAAK,IAAI;IAClB;GACF;GACA,MAAM,UAAU,aAAa,KAAK,KAAK,wBAAwB,SAAS,KAAK,IAAI,IAAI;GACrF,QAAQ,IAAI,KAAK,IAAI;IAAE;IAAM,SAAS;IAAO,SAAS;IAAM,OAAO,IAAI,MAAM,OAAO;IAAG,UAAU;IAAG,MAAM,CAAC,OAAO;GAAE,CAAC;GACrH,aAAa,KAAK,KAAK,EAAE;GACzB,QAAQ,IAAI,KAAK,EAAE;EACrB;EAEA,MAAM,eAAe,MAAM,uBACzB,UACA,OAAO,SAAS;GACd,MAAM,aAAa,OAAO,eAAe,aAAa,IAAI;GAC1D,MAAM,YAAY,KAAK,IAAI;GAC3B,IAAI;GACJ,IAAI;IACF,SAAS,MAAM,UAAU,IAAI;GAC/B,SAAS,OAAO;IAGd,MAAM,MACJ,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC;IAC1D,SAAS;KACP;KACA,SAAS;KACT,OAAO;KACP,UAAU,KAAK,IAAI,IAAI;KACvB,MAAM,CAAC,sBAAsB,IAAI,OAAO;IAC1C;GACF;GAEA,MAAM,iBAAiB,CAAC,YADF,OAAO,kBAAkB,gBAAgB,MACf,CAAC,CAAC,CAAC,QAAQ,SAAyB,SAAS,KAAA,CAAS;GACtG,IAAI,eAAe,SAAS,GAC1B,SAAS;IAAE,GAAG;IAAQ,MAAM,CAAC,GAAI,OAAO,QAAQ,CAAC,GAAI,GAAG,cAAc;GAAE;GAE1E,OAAO;EACT,GACA,WACF;EAEA,KAAK,MAAM,UAAU,cAAc;GACjC,QAAQ,IAAI,OAAO,KAAK,IAAI,MAAM;GAClC,IAAI,CAAC,OAAO,SAAS;IACnB,YAAY,KAAK,OAAO,KAAK,EAAE;IAC/B,QAAQ,IAAI,OAAO,KAAK,EAAE;IAC1B,IAAI,UACF,aAAa;GAEjB;EACF;CACF;CAEA,OAAO;EACL,SAAS,YAAY,WAAW,KAAK,aAAa,WAAW;EAC7D;EACA;EACA;EACA,eAAe,KAAK,IAAI,IAAI;CAC9B;AACF;;;;AAKA,eAAsB,qBACpB,KACA,WACA,UAA2D,CAAC,GACjC;CAC3B,OAAO,WAAW,KAAK,WAAW;EAAE,GAAG;EAAS,aAAa;CAAE,CAAC;AAClE;;;;AAKA,SAAgB,gBACd,IAC6C;CAC7C,OAAO,OAAO,SAA4C;EACxD,MAAM,YAAY,KAAK,IAAI;EAC3B,MAAM,OAAiB,CAAC;EAExB,IAAI;GACF,KAAK,KAAK,cAAc,KAAK,EAAE;GAC/B,MAAM,GAAG,IAAI;GACb,KAAK,KAAK,eAAe,KAAK,EAAE;GAEhC,OAAO;IACL;IACA,SAAS;IACT,UAAU,KAAK,IAAI,IAAI;IACvB;GACF;EACF,SAAS,OAAO;GACd,MAAM,MAAM,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC;GACpE,KAAK,KAAK,YAAY,KAAK,KAAK,OAAO,IAAI,OAAO;GAElD,OAAO;IACL;IACA,SAAS;IACT,OAAO;IACP,UAAU,KAAK,IAAI,IAAI;IACvB;GACF;EACF;CACF;AACF;;;;;AC5MA,SAAgB,kBACd,OACA,QACoB;CACpB,MAAM,2BAAW,IAAI,IAAmB;CACxC,MAAM,0BAAU,IAAI,IAAY;CAEhC,SAAS,MAAM,IAAkB;EAC/B,IAAI,QAAQ,IAAI,EAAE,GAAG;EACrB,QAAQ,IAAI,EAAE;EAEd,MAAM,OAAO,MAAM,IAAI,EAAE;EACzB,IAAI,CAAC,MAAM;EAEX,SAAS,IAAI,IAAI,IAAI;EAErB,KAAK,MAAM,OAAO,KAAK,cACrB,MAAM,GAAG;CAEb;CAEA,MAAM,MAAM;CACZ,OAAO;AACT;;;;AAKA,SAAgB,aACd,OACA,IACa;CACb,MAAM,4BAAY,IAAI,IAAY;CAClC,MAAM,0BAAU,IAAI,IAAY;CAEhC,SAAS,MAAM,GAAiB;EAC9B,IAAI,QAAQ,IAAI,CAAC,GAAG;EACpB,QAAQ,IAAI,CAAC;EAEb,MAAM,OAAO,MAAM,IAAI,CAAC;EACxB,IAAI,CAAC,MAAM;EAEX,KAAK,MAAM,OAAO,KAAK,cACrB,IAAI,MAAM,IAAI,GAAG,GAAG;GAClB,UAAU,IAAI,GAAG;GACjB,MAAM,GAAG;EACX;CAEJ;CAEA,MAAM,EAAE;CACR,OAAO;AACT;;;;AAKA,SAAgB,eACd,OACA,IACa;CACb,MAAM,8BAAc,IAAI,IAAY;CACpC,MAAM,0BAAU,IAAI,IAAY;CAGhC,MAAM,6BAAa,IAAI,IAAyB;CAChD,KAAK,MAAM,CAAC,QAAQ,SAAS,OAC3B,KAAK,MAAM,OAAO,KAAK,cAAc;EACnC,IAAI,CAAC,WAAW,IAAI,GAAG,GACrB,WAAW,IAAI,qBAAK,IAAI,IAAI,CAAC;EAE/B,WAAW,IAAI,GAAG,CAAC,CAAE,IAAI,MAAM;CACjC;CAGF,SAAS,MAAM,GAAiB;EAC9B,IAAI,QAAQ,IAAI,CAAC,GAAG;EACpB,QAAQ,IAAI,CAAC;EAEb,MAAM,OAAO,WAAW,IAAI,CAAC;EAC7B,IAAI,CAAC,MAAM;EAEX,KAAK,MAAM,OAAO,MAAM;GACtB,YAAY,IAAI,GAAG;GACnB,MAAM,GAAG;EACX;CACF;CAEA,MAAM,EAAE;CACR,OAAO;AACT;;;;AAKA,SAAgB,WACd,IACA,eAAyB,CAAC,GAC1B,MACgB;CAChB,MAAM,OAAuB;EAAE;EAAI;CAAa;CAChD,IAAI,SAAS,KAAA,GACX,KAAK,OAAO;CAEd,OAAO;AACT;;;;AAKA,SAAgB,aACd,OACoB;CACpB,OAAO,IAAI,IAAI,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC5C"}
+{"version":3,"file":"index.js","names":[],"sources":["../../src/dag/traversal.ts","../../src/dag/executor.ts","../../src/dag/builder.ts"],"sourcesContent":["/**\n * DAG Traversal using Kahn's Algorithm\n *\n * This module implements topological sort with level assignment for parallel execution.\n * Level 0 = leaves (no dependencies), higher levels depend on lower levels.\n */\n\nimport type { DAGNode, DependencyDAG } from \"./types.js\";\n\n/**\n * This function builds a leveled DAG from nodes, with Kahn's algorithm.\n *\n * This assigns levels to each node where:\n * - Level 0: Nodes with no dependencies (leaves)\n * - Level N: Nodes whose dependencies are all at level < N\n *\n * Nodes at the same level can be processed in parallel.\n *\n * @throws Error if a cycle is detected\n */\nexport function buildLeveledDAG<TNode extends DAGNode>(\n  nodes: Map<string, TNode>\n): DependencyDAG<TNode> {\n  const inDegree = new Map<string, number>();\n  const dependents = new Map<string, Set<string>>();\n\n  for (const [name, node] of nodes) {\n    // A set: a dependency that a node lists twice counts once. (`dependents` is a set, so it\n    // takes the in-degree down once: a repeated dependency was \"Circular\": deep dive DATA-21.)\n    const depsInDag = new Set(node.dependencies.filter((dep) => nodes.has(dep)));\n    inDegree.set(name, depsInDag.size);\n    dependents.set(name, new Set());\n  }\n\n  for (const [name, node] of nodes) {\n    for (const dep of node.dependencies) {\n      if (dependents.has(dep)) {\n        dependents.get(dep)!.add(name);\n      }\n    }\n  }\n\n  let queue: string[] = [];\n  for (const [name, degree] of inDegree) {\n    if (degree === 0) {\n      queue.push(name);\n    }\n  }\n\n  const levels: TNode[][] = [];\n  const nodeLevel = new Map<string, number>();\n  let processedCount = 0;\n\n  while (queue.length > 0) {\n    const currentLevel = levels.length;\n    const levelNodes: TNode[] = [];\n    const nextQueue: string[] = [];\n\n    for (const name of queue) {\n      const node = nodes.get(name)!;\n      node.level = currentLevel;\n      nodeLevel.set(name, currentLevel);\n      levelNodes.push(node);\n      processedCount++;\n\n      for (const dependent of dependents.get(name) ?? []) {\n        const newDegree = inDegree.get(dependent)! - 1;\n        inDegree.set(dependent, newDegree);\n\n        if (newDegree === 0) {\n          nextQueue.push(dependent);\n        }\n      }\n    }\n\n    levels.push(levelNodes);\n    queue = nextQueue;\n  }\n\n  if (processedCount !== nodes.size) {\n    const cycleNodes = [...nodes.keys()].filter((n) => !nodeLevel.has(n));\n    throw new Error(\"Circular dependency detected involving: \" + cycleNodes.join(\", \"));\n  }\n\n  const roots = [...nodes.keys()].filter((name) => {\n    const deps = dependents.get(name);\n    return !deps || deps.size === 0;\n  });\n\n  const leaves = [...nodes.keys()].filter((name) => {\n    const node = nodes.get(name)!;\n    const depsInDag = node.dependencies.filter((dep) => nodes.has(dep));\n    return depsInDag.length === 0;\n  });\n\n  return { nodes, levels, roots, leaves };\n}\n\n/**\n * This function gives the topological order: a flat list, leaves first.\n */\nexport function getTopologicalOrder<TNode extends DAGNode>(\n  dag: DependencyDAG<TNode>\n): TNode[] {\n  return dag.levels.flat();\n}\n\n/**\n * Visualize the DAG structure (for debugging)\n */\nexport function visualizeDAG<TNode extends DAGNode>(\n  dag: DependencyDAG<TNode>\n): string {\n  const lines = [\"DAG Structure:\"];\n\n  for (let i = 0; i < dag.levels.length; i++) {\n    const level = dag.levels[i]!;\n    lines.push(\"  Level \" + i + \":\");\n    for (const node of level) {\n      const deps =\n        node.dependencies.length > 0\n          ? \" -> [\" + node.dependencies.join(\", \") + \"]\"\n          : \" (leaf)\";\n      lines.push(\"    - \" + node.id + deps);\n    }\n  }\n\n  return lines.join(\"\\n\");\n}\n","/**\n * DAG Executor with parallel level-based execution\n */\n\nimport type {\n  DependencyDAG,\n  DAGNode,\n  DAGExecutionOptions,\n  NodeResult,\n  DAGResult,\n} from \"./types.js\";\n\n/**\n * This function starts a batch of items with a limit of concurrency.\n */\nasync function executeWithConcurrency<T, R>(\n  items: T[],\n  fn: (item: T) => Promise<R>,\n  limit: number\n): Promise<R[]> {\n  const results: R[] = [];\n  const executing = new Set<Promise<void>>();\n\n  for (const item of items) {\n    const promise = fn(item)\n      .then((result) => {\n        results.push(result);\n      })\n      .finally(() => {\n        // Rejection-safe cleanup: always remove the settled promise from the\n        // executing set, even if `fn` rejected, so the set never leaks a\n        // settled (possibly rejected) promise into later `race`/`all` waits.\n        executing.delete(promise);\n      });\n\n    executing.add(promise);\n\n    if (executing.size >= limit) {\n      await Promise.race(executing);\n    }\n  }\n\n  await Promise.all(executing);\n  return results;\n}\n\n/**\n * This function calls a listener. A listener that throws does not stop the run: the function gives a log\n * line for its error (deep dive DATA-21).\n */\nfunction notify<T>(name: string, listener: ((arg: T) => void) | undefined, arg: T): string | undefined {\n  if (!listener) return undefined;\n  try {\n    listener(arg);\n    return undefined;\n  } catch (error) {\n    return name + \" threw: \" + (error instanceof Error ? error.message : String(error));\n  }\n}\n\n/**\n * This function starts a DAG level by level, with the nodes of each level in parallel.\n *\n * - Levels are processed sequentially (level 0 first, then level 1, and so on)\n * - Within each level, nodes are processed in parallel up to concurrency limit\n * - Supports fail-fast or continue-on-error modes\n *\n * A processor that throws does NOT reject the whole run. The run records the throw\n * as a failed NodeResult, so partial results are always given.\n *\n * With `skipDependents` (the default), a node whose dependency failed or was skipped does not start. Its result has\n * `skipped: true` and an error that names those dependencies. A dependency outside the DAG does not count.\n *\n * `failFast` operates on levels. When a node of a level fails, each node of that level continues to its end.\n * This includes the nodes that did not start before the failure, when `concurrency` is less than the\n * size of the level. No later level starts. The run does not cancel a node.\n *\n * A node that did not start (`skipped: true`) calls neither `onNodeStart` nor `onNodeComplete`.\n */\nexport async function executeDAG<TNode extends DAGNode>(\n  dag: DependencyDAG<TNode>,\n  processor: (node: TNode) => Promise<NodeResult<TNode>>,\n  options: DAGExecutionOptions<TNode> = {}\n): Promise<DAGResult<TNode>> {\n  const {\n    concurrency = 4,\n    failFast = true,\n    skipDependents = true,\n    onNodeStart,\n    onNodeComplete,\n  } = options;\n\n  const results = new Map<string, NodeResult<TNode>>();\n  const failedNodes: string[] = [];\n  const skippedNodes: string[] = [];\n  // The ids of the nodes that failed or were skipped\n  const blocked = new Set<string>();\n  const startTime = Date.now();\n  let shouldStop = false;\n\n  for (const level of dag.levels) {\n    if (shouldStop) break;\n\n    const runnable: TNode[] = [];\n    for (const node of level) {\n      const blockers = skipDependents ? node.dependencies.filter((dep) => blocked.has(dep)) : [];\n      if (blockers.length === 0) {\n        runnable.push(node);\n        continue;\n      }\n      const message = \"Skipped \" + node.id + \": the dependencies \" + blockers.join(\", \") + \" failed or were skipped\";\n      results.set(node.id, { node, success: false, skipped: true, error: new Error(message), duration: 0, logs: [message] });\n      skippedNodes.push(node.id);\n      blocked.add(node.id);\n    }\n\n    const levelResults = await executeWithConcurrency(\n      runnable,\n      async (node) => {\n        const startError = notify(\"onNodeStart\", onNodeStart, node);\n        const nodeStart = Date.now();\n        let result: NodeResult<TNode>;\n        try {\n          result = await processor(node);\n        } catch (error) {\n          // Convert a thrown processor error into a failed NodeResult instead\n          // of rejecting the entire run and discarding partial results.\n          const err =\n            error instanceof Error ? error : new Error(String(error));\n          result = {\n            node,\n            success: false,\n            error: err,\n            duration: Date.now() - nodeStart,\n            logs: [\"Processor threw: \" + err.message],\n          };\n        }\n        const completeError = notify(\"onNodeComplete\", onNodeComplete, result);\n        const listenerErrors = [startError, completeError].filter((line): line is string => line !== undefined);\n        if (listenerErrors.length > 0) {\n          result = { ...result, logs: [...(result.logs ?? []), ...listenerErrors] };\n        }\n        return result;\n      },\n      concurrency\n    );\n\n    for (const result of levelResults) {\n      results.set(result.node.id, result);\n      if (!result.success) {\n        failedNodes.push(result.node.id);\n        blocked.add(result.node.id);\n        if (failFast) {\n          shouldStop = true;\n        }\n      }\n    }\n  }\n\n  return {\n    success: failedNodes.length === 0 && skippedNodes.length === 0,\n    results,\n    failedNodes,\n    skippedNodes,\n    totalDuration: Date.now() - startTime,\n  };\n}\n\n/**\n * This function starts a DAG one node at a time, with no nodes in parallel.\n */\nexport async function executeDAGSequential<TNode extends DAGNode>(\n  dag: DependencyDAG<TNode>,\n  processor: (node: TNode) => Promise<NodeResult<TNode>>,\n  options: Omit<DAGExecutionOptions<TNode>, \"concurrency\"> = {}\n): Promise<DAGResult<TNode>> {\n  return executeDAG(dag, processor, { ...options, concurrency: 1 });\n}\n\n/**\n * This function makes a simple processor that wraps an async function.\n */\nexport function createProcessor<TNode extends DAGNode>(\n  fn: (node: TNode) => Promise<void>\n): (node: TNode) => Promise<NodeResult<TNode>> {\n  return async (node: TNode): Promise<NodeResult<TNode>> => {\n    const startTime = Date.now();\n    const logs: string[] = [];\n\n    try {\n      logs.push(\"Starting \" + node.id);\n      await fn(node);\n      logs.push(\"Completed \" + node.id);\n\n      return {\n        node,\n        success: true,\n        duration: Date.now() - startTime,\n        logs,\n      };\n    } catch (error) {\n      const err = error instanceof Error ? error : new Error(String(error));\n      logs.push(\"Failed \" + node.id + \": \" + err.message);\n\n      return {\n        node,\n        success: false,\n        error: err,\n        duration: Date.now() - startTime,\n        logs,\n      };\n    }\n  };\n}\n","/**\n * DAG Builder utilities\n */\n\nimport type { DAGNode } from \"./types.js\";\n\n/**\n * This function filters a DAG to the nodes that a root can reach.\n */\nexport function filterDAGFromRoot<TNode extends DAGNode>(\n  nodes: Map<string, TNode>,\n  rootId: string\n): Map<string, TNode> {\n  const filtered = new Map<string, TNode>();\n  const visited = new Set<string>();\n\n  function visit(id: string): void {\n    if (visited.has(id)) return;\n    visited.add(id);\n\n    const node = nodes.get(id);\n    if (!node) return;\n\n    filtered.set(id, node);\n\n    for (const dep of node.dependencies) {\n      visit(dep);\n    }\n  }\n\n  visit(rootId);\n  return filtered;\n}\n\n/**\n * This function gives all ancestors of a node: the nodes that this node depends on, transitively.\n */\nexport function getAncestors<TNode extends DAGNode>(\n  nodes: Map<string, TNode>,\n  id: string\n): Set<string> {\n  const ancestors = new Set<string>();\n  const visited = new Set<string>();\n\n  function visit(n: string): void {\n    if (visited.has(n)) return;\n    visited.add(n);\n\n    const node = nodes.get(n);\n    if (!node) return;\n\n    for (const dep of node.dependencies) {\n      if (nodes.has(dep)) {\n        ancestors.add(dep);\n        visit(dep);\n      }\n    }\n  }\n\n  visit(id);\n  return ancestors;\n}\n\n/**\n * This function gives all descendants of a node: the nodes that depend on this node, transitively.\n */\nexport function getDescendants<TNode extends DAGNode>(\n  nodes: Map<string, TNode>,\n  id: string\n): Set<string> {\n  const descendants = new Set<string>();\n  const visited = new Set<string>();\n\n  // Build reverse dependency map\n  const dependents = new Map<string, Set<string>>();\n  for (const [nodeId, node] of nodes) {\n    for (const dep of node.dependencies) {\n      if (!dependents.has(dep)) {\n        dependents.set(dep, new Set());\n      }\n      dependents.get(dep)!.add(nodeId);\n    }\n  }\n\n  function visit(n: string): void {\n    if (visited.has(n)) return;\n    visited.add(n);\n\n    const deps = dependents.get(n);\n    if (!deps) return;\n\n    for (const dep of deps) {\n      descendants.add(dep);\n      visit(dep);\n    }\n  }\n\n  visit(id);\n  return descendants;\n}\n\n/**\n * This function makes a DAG node from a minimal input.\n */\nexport function createNode<TData = unknown>(\n  id: string,\n  dependencies: string[] = [],\n  data?: TData | undefined\n): DAGNode<TData> {\n  const node: DAGNode<TData> = { id, dependencies };\n  if (data !== undefined) {\n    node.data = data;\n  }\n  return node;\n}\n\n/**\n * This function builds a Map of nodes from an array.\n */\nexport function buildNodeMap<TNode extends DAGNode>(\n  nodes: TNode[]\n): Map<string, TNode> {\n  return new Map(nodes.map((n) => [n.id, n]));\n}\n"],"mappings":";;;;;;;;;;;;AAoBA,SAAgB,gBACd,OACsB;CACtB,MAAM,2BAAW,IAAI,IAAoB;CACzC,MAAM,6BAAa,IAAI,IAAyB;CAEhD,KAAK,MAAM,CAAC,MAAM,SAAS,OAAO;EAGhC,MAAM,YAAY,IAAI,IAAI,KAAK,aAAa,QAAQ,QAAQ,MAAM,IAAI,GAAG,CAAC,CAAC;EAC3E,SAAS,IAAI,MAAM,UAAU,IAAI;EACjC,WAAW,IAAI,sBAAM,IAAI,IAAI,CAAC;CAChC;CAEA,KAAK,MAAM,CAAC,MAAM,SAAS,OACzB,KAAK,MAAM,OAAO,KAAK,cACrB,IAAI,WAAW,IAAI,GAAG,GACpB,WAAW,IAAI,GAAG,CAAC,CAAE,IAAI,IAAI;CAKnC,IAAI,QAAkB,CAAC;CACvB,KAAK,MAAM,CAAC,MAAM,WAAW,UAC3B,IAAI,WAAW,GACb,MAAM,KAAK,IAAI;CAInB,MAAM,SAAoB,CAAC;CAC3B,MAAM,4BAAY,IAAI,IAAoB;CAC1C,IAAI,iBAAiB;CAErB,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,eAAe,OAAO;EAC5B,MAAM,aAAsB,CAAC;EAC7B,MAAM,YAAsB,CAAC;EAE7B,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,OAAO,MAAM,IAAI,IAAI;GAC3B,KAAK,QAAQ;GACb,UAAU,IAAI,MAAM,YAAY;GAChC,WAAW,KAAK,IAAI;GACpB;GAEA,KAAK,MAAM,aAAa,WAAW,IAAI,IAAI,KAAK,CAAC,GAAG;IAClD,MAAM,YAAY,SAAS,IAAI,SAAS,IAAK;IAC7C,SAAS,IAAI,WAAW,SAAS;IAEjC,IAAI,cAAc,GAChB,UAAU,KAAK,SAAS;GAE5B;EACF;EAEA,OAAO,KAAK,UAAU;EACtB,QAAQ;CACV;CAEA,IAAI,mBAAmB,MAAM,MAAM;EACjC,MAAM,aAAa,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,QAAQ,MAAM,CAAC,UAAU,IAAI,CAAC,CAAC;EACpE,MAAM,IAAI,MAAM,6CAA6C,WAAW,KAAK,IAAI,CAAC;CACpF;CAaA,OAAO;EAAE;EAAO;EAAQ,OAXV,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,QAAQ,SAAS;GAC/C,MAAM,OAAO,WAAW,IAAI,IAAI;GAChC,OAAO,CAAC,QAAQ,KAAK,SAAS;EAChC,CAQ4B;EAAG,QANhB,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,QAAQ,SAAS;GAGhD,OAFa,MAAM,IAAI,IACF,CAAC,CAAC,aAAa,QAAQ,QAAQ,MAAM,IAAI,GAAG,CAClD,CAAC,CAAC,WAAW;EAC9B,CAEoC;CAAE;AACxC;;;;AAKA,SAAgB,oBACd,KACS;CACT,OAAO,IAAI,OAAO,KAAK;AACzB;;;;AAKA,SAAgB,aACd,KACQ;CACR,MAAM,QAAQ,CAAC,gBAAgB;CAE/B,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,OAAO,QAAQ,KAAK;EAC1C,MAAM,QAAQ,IAAI,OAAO;EACzB,MAAM,KAAK,aAAa,IAAI,GAAG;EAC/B,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,OACJ,KAAK,aAAa,SAAS,IACvB,UAAU,KAAK,aAAa,KAAK,IAAI,IAAI,MACzC;GACN,MAAM,KAAK,WAAW,KAAK,KAAK,IAAI;EACtC;CACF;CAEA,OAAO,MAAM,KAAK,IAAI;AACxB;;;;;ACjHA,eAAe,uBACb,OACA,IACA,OACc;CACd,MAAM,UAAe,CAAC;CACtB,MAAM,4BAAY,IAAI,IAAmB;CAEzC,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,UAAU,GAAG,IAAI,CAAC,CACrB,MAAM,WAAW;GAChB,QAAQ,KAAK,MAAM;EACrB,CAAC,CAAC,CACD,cAAc;GAIb,UAAU,OAAO,OAAO;EAC1B,CAAC;EAEH,UAAU,IAAI,OAAO;EAErB,IAAI,UAAU,QAAQ,OACpB,MAAM,QAAQ,KAAK,SAAS;CAEhC;CAEA,MAAM,QAAQ,IAAI,SAAS;CAC3B,OAAO;AACT;;;;;AAMA,SAAS,OAAU,MAAc,UAA0C,KAA4B;CACrG,IAAI,CAAC,UAAU,OAAO,KAAA;CACtB,IAAI;EACF,SAAS,GAAG;EACZ;CACF,SAAS,OAAO;EACd,OAAO,OAAO,cAAc,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;CACnF;AACF;;;;;;;;;;;;;;;;;;;;AAqBA,eAAsB,WACpB,KACA,WACA,UAAsC,CAAC,GACZ;CAC3B,MAAM,EACJ,cAAc,GACd,WAAW,MACX,iBAAiB,MACjB,aACA,mBACE;CAEJ,MAAM,0BAAU,IAAI,IAA+B;CACnD,MAAM,cAAwB,CAAC;CAC/B,MAAM,eAAyB,CAAC;CAEhC,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,YAAY,KAAK,IAAI;CAC3B,IAAI,aAAa;CAEjB,KAAK,MAAM,SAAS,IAAI,QAAQ;EAC9B,IAAI,YAAY;EAEhB,MAAM,WAAoB,CAAC;EAC3B,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,WAAW,iBAAiB,KAAK,aAAa,QAAQ,QAAQ,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC;GACzF,IAAI,SAAS,WAAW,GAAG;IACzB,SAAS,KAAK,IAAI;IAClB;GACF;GACA,MAAM,UAAU,aAAa,KAAK,KAAK,wBAAwB,SAAS,KAAK,IAAI,IAAI;GACrF,QAAQ,IAAI,KAAK,IAAI;IAAE;IAAM,SAAS;IAAO,SAAS;IAAM,OAAO,IAAI,MAAM,OAAO;IAAG,UAAU;IAAG,MAAM,CAAC,OAAO;GAAE,CAAC;GACrH,aAAa,KAAK,KAAK,EAAE;GACzB,QAAQ,IAAI,KAAK,EAAE;EACrB;EAEA,MAAM,eAAe,MAAM,uBACzB,UACA,OAAO,SAAS;GACd,MAAM,aAAa,OAAO,eAAe,aAAa,IAAI;GAC1D,MAAM,YAAY,KAAK,IAAI;GAC3B,IAAI;GACJ,IAAI;IACF,SAAS,MAAM,UAAU,IAAI;GAC/B,SAAS,OAAO;IAGd,MAAM,MACJ,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC;IAC1D,SAAS;KACP;KACA,SAAS;KACT,OAAO;KACP,UAAU,KAAK,IAAI,IAAI;KACvB,MAAM,CAAC,sBAAsB,IAAI,OAAO;IAC1C;GACF;GAEA,MAAM,iBAAiB,CAAC,YADF,OAAO,kBAAkB,gBAAgB,MACf,CAAC,CAAC,CAAC,QAAQ,SAAyB,SAAS,KAAA,CAAS;GACtG,IAAI,eAAe,SAAS,GAC1B,SAAS;IAAE,GAAG;IAAQ,MAAM,CAAC,GAAI,OAAO,QAAQ,CAAC,GAAI,GAAG,cAAc;GAAE;GAE1E,OAAO;EACT,GACA,WACF;EAEA,KAAK,MAAM,UAAU,cAAc;GACjC,QAAQ,IAAI,OAAO,KAAK,IAAI,MAAM;GAClC,IAAI,CAAC,OAAO,SAAS;IACnB,YAAY,KAAK,OAAO,KAAK,EAAE;IAC/B,QAAQ,IAAI,OAAO,KAAK,EAAE;IAC1B,IAAI,UACF,aAAa;GAEjB;EACF;CACF;CAEA,OAAO;EACL,SAAS,YAAY,WAAW,KAAK,aAAa,WAAW;EAC7D;EACA;EACA;EACA,eAAe,KAAK,IAAI,IAAI;CAC9B;AACF;;;;AAKA,eAAsB,qBACpB,KACA,WACA,UAA2D,CAAC,GACjC;CAC3B,OAAO,WAAW,KAAK,WAAW;EAAE,GAAG;EAAS,aAAa;CAAE,CAAC;AAClE;;;;AAKA,SAAgB,gBACd,IAC6C;CAC7C,OAAO,OAAO,SAA4C;EACxD,MAAM,YAAY,KAAK,IAAI;EAC3B,MAAM,OAAiB,CAAC;EAExB,IAAI;GACF,KAAK,KAAK,cAAc,KAAK,EAAE;GAC/B,MAAM,GAAG,IAAI;GACb,KAAK,KAAK,eAAe,KAAK,EAAE;GAEhC,OAAO;IACL;IACA,SAAS;IACT,UAAU,KAAK,IAAI,IAAI;IACvB;GACF;EACF,SAAS,OAAO;GACd,MAAM,MAAM,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC;GACpE,KAAK,KAAK,YAAY,KAAK,KAAK,OAAO,IAAI,OAAO;GAElD,OAAO;IACL;IACA,SAAS;IACT,OAAO;IACP,UAAU,KAAK,IAAI,IAAI;IACvB;GACF;EACF;CACF;AACF;;;;;AC5MA,SAAgB,kBACd,OACA,QACoB;CACpB,MAAM,2BAAW,IAAI,IAAmB;CACxC,MAAM,0BAAU,IAAI,IAAY;CAEhC,SAAS,MAAM,IAAkB;EAC/B,IAAI,QAAQ,IAAI,EAAE,GAAG;EACrB,QAAQ,IAAI,EAAE;EAEd,MAAM,OAAO,MAAM,IAAI,EAAE;EACzB,IAAI,CAAC,MAAM;EAEX,SAAS,IAAI,IAAI,IAAI;EAErB,KAAK,MAAM,OAAO,KAAK,cACrB,MAAM,GAAG;CAEb;CAEA,MAAM,MAAM;CACZ,OAAO;AACT;;;;AAKA,SAAgB,aACd,OACA,IACa;CACb,MAAM,4BAAY,IAAI,IAAY;CAClC,MAAM,0BAAU,IAAI,IAAY;CAEhC,SAAS,MAAM,GAAiB;EAC9B,IAAI,QAAQ,IAAI,CAAC,GAAG;EACpB,QAAQ,IAAI,CAAC;EAEb,MAAM,OAAO,MAAM,IAAI,CAAC;EACxB,IAAI,CAAC,MAAM;EAEX,KAAK,MAAM,OAAO,KAAK,cACrB,IAAI,MAAM,IAAI,GAAG,GAAG;GAClB,UAAU,IAAI,GAAG;GACjB,MAAM,GAAG;EACX;CAEJ;CAEA,MAAM,EAAE;CACR,OAAO;AACT;;;;AAKA,SAAgB,eACd,OACA,IACa;CACb,MAAM,8BAAc,IAAI,IAAY;CACpC,MAAM,0BAAU,IAAI,IAAY;CAGhC,MAAM,6BAAa,IAAI,IAAyB;CAChD,KAAK,MAAM,CAAC,QAAQ,SAAS,OAC3B,KAAK,MAAM,OAAO,KAAK,cAAc;EACnC,IAAI,CAAC,WAAW,IAAI,GAAG,GACrB,WAAW,IAAI,qBAAK,IAAI,IAAI,CAAC;EAE/B,WAAW,IAAI,GAAG,CAAC,CAAE,IAAI,MAAM;CACjC;CAGF,SAAS,MAAM,GAAiB;EAC9B,IAAI,QAAQ,IAAI,CAAC,GAAG;EACpB,QAAQ,IAAI,CAAC;EAEb,MAAM,OAAO,WAAW,IAAI,CAAC;EAC7B,IAAI,CAAC,MAAM;EAEX,KAAK,MAAM,OAAO,MAAM;GACtB,YAAY,IAAI,GAAG;GACnB,MAAM,GAAG;EACX;CACF;CAEA,MAAM,EAAE;CACR,OAAO;AACT;;;;AAKA,SAAgB,WACd,IACA,eAAyB,CAAC,GAC1B,MACgB;CAChB,MAAM,OAAuB;EAAE;EAAI;CAAa;CAChD,IAAI,SAAS,KAAA,GACX,KAAK,OAAO;CAEd,OAAO;AACT;;;;AAKA,SAAgB,aACd,OACoB;CACpB,OAAO,IAAI,IAAI,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC5C"}