@visulima/task-runner 1.0.0-alpha.1 → 1.0.0-alpha.11

package/dist/packem_shared/findCycle-DF4_BRdO.js

@@ -1,212 +0,0 @@
-const findCycle = (taskGraph) => {
-  const visited = /* @__PURE__ */ new Set();
-  const inStack = /* @__PURE__ */ new Set();
-  const parent = /* @__PURE__ */ new Map();
-  for (const taskId of Object.keys(taskGraph.tasks)) {
-    if (visited.has(taskId)) {
-      continue;
-    }
-    const stack = [taskId];
-    while (stack.length > 0) {
-      const current = stack[stack.length - 1];
-      if (!visited.has(current)) {
-        visited.add(current);
-        inStack.add(current);
-      }
-      const deps = taskGraph.dependencies[current] ?? [];
-      let foundUnvisited = false;
-      for (const dep of deps) {
-        if (inStack.has(dep)) {
-          const cycle = [dep];
-          let node = current;
-          while (node !== dep) {
-            cycle.push(node);
-            node = parent.get(node) ?? dep;
-          }
-          cycle.push(dep);
-          cycle.reverse();
-          return cycle;
-        }
-        if (!visited.has(dep)) {
-          parent.set(dep, current);
-          stack.push(dep);
-          foundUnvisited = true;
-          break;
-        }
-      }
-      if (!foundUnvisited) {
-        stack.pop();
-        inStack.delete(current);
-      }
-    }
-  }
-  return void 0;
-};
-const findCycles = (taskGraph) => {
-  const cycles = [];
-  const visited = /* @__PURE__ */ new Set();
-  const inStack = /* @__PURE__ */ new Set();
-  const stack = [];
-  const dfs = (taskId) => {
-    visited.add(taskId);
-    inStack.add(taskId);
-    stack.push(taskId);
-    const deps = taskGraph.dependencies[taskId] ?? [];
-    for (const dep of deps) {
-      if (inStack.has(dep)) {
-        const cycleStart = stack.indexOf(dep);
-        const cycle = [...stack.slice(cycleStart), dep];
-        cycles.push(cycle);
-      } else if (!visited.has(dep)) {
-        dfs(dep);
-      }
-    }
-    stack.pop();
-    inStack.delete(taskId);
-  };
-  for (const taskId of Object.keys(taskGraph.tasks)) {
-    if (!visited.has(taskId)) {
-      dfs(taskId);
-    }
-  }
-  return cycles;
-};
-const walkTaskGraph = (taskGraph, callback) => {
-  const dependencyCount = /* @__PURE__ */ new Map();
-  for (const taskId of Object.keys(taskGraph.tasks)) {
-    dependencyCount.set(taskId, (taskGraph.dependencies[taskId] ?? []).length);
-  }
-  const dependents = /* @__PURE__ */ new Map();
-  for (const [taskId, deps] of Object.entries(taskGraph.dependencies)) {
-    for (const dep of deps) {
-      let list = dependents.get(dep);
-      if (!list) {
-        list = [];
-        dependents.set(dep, list);
-      }
-      list.push(taskId);
-    }
-  }
-  const queue = [];
-  for (const [taskId, count] of dependencyCount) {
-    if (count === 0) {
-      queue.push(taskId);
-    }
-  }
-  while (queue.length > 0) {
-    const taskId = queue.shift();
-    callback(taskId);
-    const taskDependents = dependents.get(taskId) ?? [];
-    for (const dependent of taskDependents) {
-      const newCount = (dependencyCount.get(dependent) ?? 1) - 1;
-      dependencyCount.set(dependent, newCount);
-      if (newCount === 0) {
-        queue.push(dependent);
-      }
-    }
-  }
-};
-const reverseTaskGraph = (taskGraph) => {
-  const reversedDependencies = {};
-  for (const taskId of Object.keys(taskGraph.tasks)) {
-    reversedDependencies[taskId] = [];
-  }
-  for (const [taskId, deps] of Object.entries(taskGraph.dependencies)) {
-    for (const dep of deps) {
-      reversedDependencies[dep]?.push(taskId);
-    }
-  }
-  const roots = Object.keys(taskGraph.tasks).filter((taskId) => (reversedDependencies[taskId]?.length ?? 0) === 0);
-  return {
-    dependencies: reversedDependencies,
-    roots,
-    tasks: { ...taskGraph.tasks }
-  };
-};
-const getLeafTasks = (taskGraph) => Object.keys(taskGraph.tasks).filter((taskId) => (taskGraph.dependencies[taskId]?.length ?? 0) === 0);
-const makeAcyclic = (taskGraph) => {
-  const visited = /* @__PURE__ */ new Set();
-  const inStack = /* @__PURE__ */ new Set();
-  const edgesToRemove = [];
-  const dfs = (taskId) => {
-    visited.add(taskId);
-    inStack.add(taskId);
-    const deps = taskGraph.dependencies[taskId] ?? [];
-    for (const dep of deps) {
-      if (inStack.has(dep)) {
-        edgesToRemove.push({ from: taskId, to: dep });
-      } else if (!visited.has(dep)) {
-        dfs(dep);
-      }
-    }
-    inStack.delete(taskId);
-  };
-  for (const taskId of Object.keys(taskGraph.tasks)) {
-    if (!visited.has(taskId)) {
-      dfs(taskId);
-    }
-  }
-  const newDependencies = {};
-  for (const [taskId, deps] of Object.entries(taskGraph.dependencies)) {
-    newDependencies[taskId] = deps.filter((dep) => !edgesToRemove.some((edge) => edge.from === taskId && edge.to === dep));
-  }
-  const allDeps = /* @__PURE__ */ new Set();
-  for (const deps of Object.values(newDependencies)) {
-    for (const dep of deps) {
-      allDeps.add(dep);
-    }
-  }
-  const roots = Object.keys(taskGraph.tasks).filter((taskId) => !allDeps.has(taskId));
-  return {
-    dependencies: newDependencies,
-    roots,
-    tasks: { ...taskGraph.tasks }
-  };
-};
-const getDependentTasks = (taskGraph, taskId) => {
-  const reversed = reverseTaskGraph(taskGraph);
-  const result = [];
-  const visited = /* @__PURE__ */ new Set();
-  const queue = [taskId];
-  while (queue.length > 0) {
-    const current = queue.shift();
-    if (visited.has(current)) {
-      continue;
-    }
-    visited.add(current);
-    if (current !== taskId) {
-      result.push(current);
-    }
-    const deps = reversed.dependencies[current] ?? [];
-    for (const dep of deps) {
-      if (!visited.has(dep)) {
-        queue.push(dep);
-      }
-    }
-  }
-  return result;
-};
-const getTransitiveDependencies = (taskGraph, taskId) => {
-  const result = [];
-  const visited = /* @__PURE__ */ new Set();
-  const queue = [taskId];
-  while (queue.length > 0) {
-    const current = queue.shift();
-    if (visited.has(current)) {
-      continue;
-    }
-    visited.add(current);
-    if (current !== taskId) {
-      result.push(current);
-    }
-    const deps = taskGraph.dependencies[current] ?? [];
-    for (const dep of deps) {
-      if (!visited.has(dep)) {
-        queue.push(dep);
-      }
-    }
-  }
-  return result;
-};
-
-export { findCycle, findCycles, getDependentTasks, getLeafTasks, getTransitiveDependencies, makeAcyclic, reverseTaskGraph, walkTaskGraph };

package/dist/packem_shared/generateRunSummary-qn-_jKwt.js

@@ -1,134 +0,0 @@
-import { createRequire as __cjs_createRequire } from "node:module";
-
-const __cjs_require = __cjs_createRequire(import.meta.url);
-
-const __cjs_getProcess = typeof globalThis !== "undefined" && typeof globalThis.process !== "undefined" ? globalThis.process : process;
-
-const __cjs_getBuiltinModule = (module) => {
-    // Check if we're in Node.js and version supports getBuiltinModule
-    if (typeof __cjs_getProcess !== "undefined" && __cjs_getProcess.versions && __cjs_getProcess.versions.node) {
-        const [major, minor] = __cjs_getProcess.versions.node.split(".").map(Number);
-        // Node.js 20.16.0+ and 22.3.0+
-        if (major > 22 || (major === 22 && minor >= 3) || (major === 20 && minor >= 16)) {
-            return __cjs_getProcess.getBuiltinModule(module);
-        }
-    }
-    // Fallback to createRequire
-    return __cjs_require(module);
-};
-
-const {
-  mkdir,
-  writeFile
-} = __cjs_getBuiltinModule("node:fs/promises");
-import { join } from '@visulima/path';
-import { u as uniqueId } from './utils-zO0ZRgtf.js';
-
-const getCacheStatus = (result) => {
-  switch (result.status) {
-    case "local-cache":
-    case "local-cache-kept-existing": {
-      return "HIT";
-    }
-    case "remote-cache": {
-      return "REMOTE_HIT";
-    }
-    case "skipped": {
-      return "SKIPPED";
-    }
-    default: {
-      return "MISS";
-    }
-  }
-};
-const generateRunSummary = (results, taskGraph, startTime) => {
-  const endTime = Date.now();
-  const id = `${new Date(startTime).toISOString().replaceAll(/[:.]/g, "-")}_${uniqueId()}`;
-  const tasks = [];
-  let succeeded = 0;
-  let failed = 0;
-  let cached = 0;
-  let skipped = 0;
-  for (const [taskId, result] of results) {
-    const taskDeps = taskGraph.dependencies[taskId] ?? [];
-    const summary = {
-      cacheable: result.task.cache !== false,
-      cacheStatus: getCacheStatus(result),
-      dependencies: taskDeps,
-      duration: result.startTime && result.endTime ? result.endTime - result.startTime : void 0,
-      endTime: result.endTime ? new Date(result.endTime).toISOString() : void 0,
-      exitCode: result.code,
-      hash: result.task.hash,
-      hashDetails: result.task.hashDetails,
-      outputs: result.task.outputs,
-      startTime: result.startTime ? new Date(result.startTime).toISOString() : void 0,
-      target: {
-        configuration: result.task.target.configuration,
-        project: result.task.target.project,
-        target: result.task.target.target
-      },
-      taskId
-    };
-    tasks.push(summary);
-    switch (result.status) {
-      case "failure": {
-        failed += 1;
-        break;
-      }
-      case "local-cache":
-      // falls through
-      case "local-cache-kept-existing":
-      case "remote-cache": {
-        cached += 1;
-        break;
-      }
-      case "skipped": {
-        skipped += 1;
-        break;
-      }
-      case "success": {
-        succeeded += 1;
-        break;
-      }
-    }
-  }
-  const sortedTasks = tasks.toSorted((a, b) => {
-    if (!a.startTime || !b.startTime) {
-      return 0;
-    }
-    return a.startTime.localeCompare(b.startTime);
-  });
-  return {
-    duration: endTime - startTime,
-    endTime: new Date(endTime).toISOString(),
-    environment: {
-      arch: process.arch,
-      nodeVersion: process.version,
-      platform: process.platform
-    },
-    id,
-    startTime: new Date(startTime).toISOString(),
-    stats: {
-      cached,
-      failed,
-      skipped,
-      succeeded,
-      total: results.size
-    },
-    taskGraph: {
-      dependencies: taskGraph.dependencies,
-      roots: taskGraph.roots
-    },
-    tasks: sortedTasks
-  };
-};
-const writeRunSummary = async (summary, workspaceRoot) => {
-  const runsDirectory = join(workspaceRoot, ".task-runner", "runs");
-  await mkdir(runsDirectory, { recursive: true });
-  const filename = `${summary.id}.json`;
-  const filePath = join(runsDirectory, filename);
-  await writeFile(filePath, JSON.stringify(summary, void 0, 2));
-  return filePath;
-};
-
-export { generateRunSummary, writeRunSummary };

package/dist/packem_shared/isNativeAvailable-BWhnZ4ES.js

@@ -1,19 +0,0 @@
-import __cjs_mod__ from "node:module"; // -- packem CommonJS require shim --
-const require = __cjs_mod__.createRequire(import.meta.url);
-let nativeBindings;
-let loadAttempted = false;
-const loadNativeBindings = () => {
-  if (loadAttempted) {
-    return nativeBindings;
-  }
-  loadAttempted = true;
-  try {
-    nativeBindings = require("../binding.js");
-  } catch {
-    nativeBindings = void 0;
-  }
-  return nativeBindings;
-};
-const isNativeAvailable = () => loadNativeBindings() !== void 0;
-
-export { isNativeAvailable, loadNativeBindings };

package/dist/packem_shared/projectGraphToDot-VdTjHcVp.js

@@ -1,202 +0,0 @@
-var __freeze = Object.freeze;
-var __defProp = Object.defineProperty;
-var __template = (cooked, raw) => __freeze(__defProp(cooked, "raw", { value: __freeze(raw || cooked.slice()) }));
-const getNodeColor = (taskId, focused, statuses) => {
-  if (focused && !focused.has(taskId)) {
-    return "#eeeeee";
-  }
-  const status = statuses?.get(taskId);
-  switch (status) {
-    case "failure": {
-      return "#FFB6C1";
-    }
-    case "local-cache":
-    case "local-cache-kept-existing":
-    case "remote-cache": {
-      return "#87CEEB";
-    }
-    case "running": {
-      return "#FFD700";
-    }
-    case "skipped": {
-      return "#D3D3D3";
-    }
-    case "success": {
-      return "#90EE90";
-    }
-    default: {
-      return "#FFFFFF";
-    }
-  }
-};
-const getStatusIcon = (status) => {
-  switch (status) {
-    case "failure": {
-      return "[FAIL] ";
-    }
-    case "local-cache":
-    case "local-cache-kept-existing":
-    case "remote-cache": {
-      return "[cache] ";
-    }
-    case "running": {
-      return "[...] ";
-    }
-    case "skipped": {
-      return "[skip] ";
-    }
-    case "success": {
-      return "[ok] ";
-    }
-    default: {
-      return "";
-    }
-  }
-};
-const formatTaskLine = (taskId, statuses) => {
-  const icon = getStatusIcon(statuses?.get(taskId));
-  return `${icon}${taskId}`;
-};
-const printTree = (taskId, prefix, isLast, taskGraph, printed, lines, statuses) => {
-  let connector;
-  if (prefix === "") {
-    connector = "";
-  } else if (isLast) {
-    connector = "└── ";
-  } else {
-    connector = "├── ";
-  }
-  const isDuplicate = printed.has(taskId);
-  const suffix = isDuplicate ? " (*)" : "";
-  const statusIcon = getStatusIcon(statuses?.get(taskId));
-  lines.push(`${prefix}${connector}${statusIcon}${taskId}${suffix}`);
-  if (isDuplicate) {
-    return;
-  }
-  printed.add(taskId);
-  const deps = taskGraph.dependencies[taskId] ?? [];
-  let childPrefix;
-  if (prefix === "") {
-    childPrefix = "";
-  } else if (isLast) {
-    childPrefix = `${prefix}    `;
-  } else {
-    childPrefix = `${prefix}│   `;
-  }
-  for (let i = 0; i < deps.length; i += 1) {
-    const isChildLast = i === deps.length - 1;
-    const dependency = deps[i];
-    if (dependency) {
-      printTree(dependency, childPrefix, isChildLast, taskGraph, printed, lines, statuses);
-    }
-  }
-};
-const toGraphvizDot = (taskGraph, options = {}) => {
-  const { focusedTasks, groupByProject = true, taskStatuses } = options;
-  const focused = focusedTasks ? new Set(focusedTasks) : void 0;
-  const lines = ["digraph TaskGraph {", "  rankdir=LR;", '  node [shape=box, style=filled, fontname="monospace"];'];
-  if (groupByProject) {
-    const projectTasks = /* @__PURE__ */ new Map();
-    for (const task of Object.values(taskGraph.tasks)) {
-      const { project } = task.target;
-      const list = projectTasks.get(project) ?? [];
-      list.push(task);
-      projectTasks.set(project, list);
-    }
-    for (const [project, tasks] of projectTasks) {
-      lines.push(`  subgraph "cluster_${project}" {`, `    label="${project}";`, "    style=dashed;", '    color="#888888";');
-      for (const task of tasks) {
-        const color = getNodeColor(task.id, focused, taskStatuses);
-        lines.push(`    "${task.id}" [label="${task.target.target}", fillcolor="${color}"];`);
-      }
-      lines.push("  }");
-    }
-  } else {
-    for (const task of Object.values(taskGraph.tasks)) {
-      const color = getNodeColor(task.id, focused, taskStatuses);
-      lines.push(`  "${task.id}" [fillcolor="${color}"];`);
-    }
-  }
-  for (const [taskId, deps] of Object.entries(taskGraph.dependencies)) {
-    for (const dep of deps) {
-      const edgeColor = focused && !focused.has(taskId) ? "#cccccc" : "#333333";
-      lines.push(`  "${taskId}" -> "${dep}" [color="${edgeColor}"];`);
-    }
-  }
-  lines.push("}");
-  return lines.join("\n");
-};
-const toGraphJson = (taskGraph, taskStatuses) => {
-  const nodes = Object.values(taskGraph.tasks).map((task) => {
-    return {
-      configuration: task.target.configuration,
-      id: task.id,
-      project: task.target.project,
-      status: taskStatuses?.get(task.id),
-      target: task.target.target
-    };
-  });
-  const edges = [];
-  for (const [source, deps] of Object.entries(taskGraph.dependencies)) {
-    for (const target of deps) {
-      edges.push({ source, target });
-    }
-  }
-  return { edges, nodes, roots: taskGraph.roots };
-};
-var _a;
-const toGraphHtml = (taskGraph, options = {}) => {
-  const graphData = toGraphJson(taskGraph, options.taskStatuses);
-  if (options.focusedTasks && options.focusedTasks.length > 0) {
-    const focused = new Set(options.focusedTasks);
-    graphData.nodes = graphData.nodes.filter((n) => focused.has(n.id));
-    graphData.edges = graphData.edges.filter((e) => focused.has(e.source) && focused.has(e.target));
-    graphData.roots = graphData.roots.filter((r) => focused.has(r));
-  }
-  return String.raw(_a || (_a = __template(['<!DOCTYPE html>\n<html lang="en">\n<head>\n<meta charset="UTF-8">\n<title>Task Graph</title>\n<style>\n  * { margin: 0; padding: 0; box-sizing: border-box; }\n  body { font-family: system-ui, -apple-system, sans-serif; background: #1a1a2e; color: #eee; }\n  svg { width: 100vw; height: 100vh; }\n  .node rect { rx: 6; ry: 6; stroke: #555; stroke-width: 1.5; cursor: pointer; }\n  .node text { font-size: 11px; fill: #1a1a2e; font-weight: 600; pointer-events: none; }\n  .node:hover rect { stroke: #fff; stroke-width: 2; }\n  .edge { stroke: #444; stroke-width: 1.5; fill: none; marker-end: url(#arrow); }\n  .label { font-size: 10px; fill: #888; }\n  #info { position: fixed; top: 12px; right: 12px; background: #16213e; padding: 12px 16px; border-radius: 8px; font-size: 13px; }\n  #info b { color: #e94560; }\n</style>\n</head>\n<body>\n<div id="info">\n  <b>', "</b> tasks &middot; <b>", "</b> dependencies &middot; <b>", '</b> roots\n</div>\n<svg id="graph">\n  <defs>\n    <marker id="arrow" viewBox="0 0 10 10" refX="10" refY="5" markerWidth="6" markerHeight="6" orient="auto">\n      <path d="M 0 0 L 10 5 L 0 10 z" fill="#666"/>\n    </marker>\n  </defs>\n</svg>\n<script>\nconst data = ', ";\nconst svg = document.getElementById('graph');\nconst W = window.innerWidth, H = window.innerHeight;\nconst statusColors = {\n  success: '#2ecc71', 'local-cache': '#3498db', 'remote-cache': '#9b59b6',\n  failure: '#e74c3c', running: '#f39c12', skipped: '#95a5a6', pending: '#ecf0f1'\n};\nconst projectColors = {};\nconst palette = ['#e94560','#0f3460','#533483','#16c79a','#f39c12','#2ecc71','#3498db','#e67e22','#9b59b6','#1abc9c'];\nlet ci = 0;\ndata.nodes.forEach(n => {\n  if (!projectColors[n.project]) projectColors[n.project] = palette[ci++ % palette.length];\n});\n\n// Simple force-directed layout\nconst nodes = data.nodes.map((n, i) => ({\n  ...n, x: W/2 + (Math.random()-0.5)*400, y: H/2 + (Math.random()-0.5)*300, vx: 0, vy: 0\n}));\nconst nodeMap = new Map(nodes.map(n => [n.id, n]));\nconst edges = data.edges.map(e => ({ source: nodeMap.get(e.source), target: nodeMap.get(e.target) }));\n\nfunction simulate() {\n  for (let iter = 0; iter < 300; iter++) {\n    // Repulsion\n    for (let i = 0; i < nodes.length; i++) {\n      for (let j = i+1; j < nodes.length; j++) {\n        let dx = nodes[j].x - nodes[i].x, dy = nodes[j].y - nodes[i].y;\n        let d = Math.sqrt(dx*dx + dy*dy) || 1;\n        let f = 8000 / (d * d);\n        nodes[i].vx -= dx/d * f; nodes[i].vy -= dy/d * f;\n        nodes[j].vx += dx/d * f; nodes[j].vy += dy/d * f;\n      }\n    }\n    // Attraction (edges)\n    edges.forEach(e => {\n      if (!e.source || !e.target) return;\n      let dx = e.target.x - e.source.x, dy = e.target.y - e.source.y;\n      let d = Math.sqrt(dx*dx + dy*dy) || 1;\n      let f = (d - 150) * 0.01;\n      e.source.vx += dx/d * f; e.source.vy += dy/d * f;\n      e.target.vx -= dx/d * f; e.target.vy -= dy/d * f;\n    });\n    // Gravity\n    nodes.forEach(n => {\n      n.vx += (W/2 - n.x) * 0.001;\n      n.vy += (H/2 - n.y) * 0.001;\n      n.x += n.vx * 0.3; n.y += n.vy * 0.3;\n      n.vx *= 0.8; n.vy *= 0.8;\n      n.x = Math.max(60, Math.min(W-60, n.x));\n      n.y = Math.max(30, Math.min(H-30, n.y));\n    });\n  }\n}\nsimulate();\n\n// Render\nedges.forEach(e => {\n  if (!e.source || !e.target) return;\n  const line = document.createElementNS('http://www.w3.org/2000/svg','line');\n  line.setAttribute('x1', e.source.x); line.setAttribute('y1', e.source.y);\n  line.setAttribute('x2', e.target.x); line.setAttribute('y2', e.target.y);\n  line.setAttribute('class','edge');\n  svg.appendChild(line);\n});\nnodes.forEach(n => {\n  const g = document.createElementNS('http://www.w3.org/2000/svg','g');\n  g.setAttribute('class','node');\n  g.setAttribute('transform','translate('+(n.x-50)+','+(n.y-14)+')');\n  const rect = document.createElementNS('http://www.w3.org/2000/svg','rect');\n  rect.setAttribute('width','100'); rect.setAttribute('height','28');\n  rect.setAttribute('fill', n.status ? (statusColors[n.status]||'#ecf0f1') : projectColors[n.project]);\n  g.appendChild(rect);\n  const text = document.createElementNS('http://www.w3.org/2000/svg','text');\n  text.setAttribute('x','50'); text.setAttribute('y','18'); text.setAttribute('text-anchor','middle');\n  text.textContent = n.id.length > 14 ? n.target : n.id;\n  g.appendChild(text);\n  g.addEventListener('click', () => {\n    const deps = data.edges.filter(e => e.source === n.id).map(e => e.target);\n    const rdeps = data.edges.filter(e => e.target === n.id).map(e => e.source);\n    alert(n.id + '\n\nDepends on: ' + (deps.join(', ')||'none') + '\nRequired by: ' + (rdeps.join(', ')||'none'));\n  });\n  svg.appendChild(g);\n});\n<\/script>\n</body>\n</html>"], ['<!DOCTYPE html>\n<html lang="en">\n<head>\n<meta charset="UTF-8">\n<title>Task Graph</title>\n<style>\n  * { margin: 0; padding: 0; box-sizing: border-box; }\n  body { font-family: system-ui, -apple-system, sans-serif; background: #1a1a2e; color: #eee; }\n  svg { width: 100vw; height: 100vh; }\n  .node rect { rx: 6; ry: 6; stroke: #555; stroke-width: 1.5; cursor: pointer; }\n  .node text { font-size: 11px; fill: #1a1a2e; font-weight: 600; pointer-events: none; }\n  .node:hover rect { stroke: #fff; stroke-width: 2; }\n  .edge { stroke: #444; stroke-width: 1.5; fill: none; marker-end: url(#arrow); }\n  .label { font-size: 10px; fill: #888; }\n  #info { position: fixed; top: 12px; right: 12px; background: #16213e; padding: 12px 16px; border-radius: 8px; font-size: 13px; }\n  #info b { color: #e94560; }\n</style>\n</head>\n<body>\n<div id="info">\n  <b>', "</b> tasks &middot; <b>", "</b> dependencies &middot; <b>", '</b> roots\n</div>\n<svg id="graph">\n  <defs>\n    <marker id="arrow" viewBox="0 0 10 10" refX="10" refY="5" markerWidth="6" markerHeight="6" orient="auto">\n      <path d="M 0 0 L 10 5 L 0 10 z" fill="#666"/>\n    </marker>\n  </defs>\n</svg>\n<script>\nconst data = ', ";\nconst svg = document.getElementById('graph');\nconst W = window.innerWidth, H = window.innerHeight;\nconst statusColors = {\n  success: '#2ecc71', 'local-cache': '#3498db', 'remote-cache': '#9b59b6',\n  failure: '#e74c3c', running: '#f39c12', skipped: '#95a5a6', pending: '#ecf0f1'\n};\nconst projectColors = {};\nconst palette = ['#e94560','#0f3460','#533483','#16c79a','#f39c12','#2ecc71','#3498db','#e67e22','#9b59b6','#1abc9c'];\nlet ci = 0;\ndata.nodes.forEach(n => {\n  if (!projectColors[n.project]) projectColors[n.project] = palette[ci++ % palette.length];\n});\n\n// Simple force-directed layout\nconst nodes = data.nodes.map((n, i) => ({\n  ...n, x: W/2 + (Math.random()-0.5)*400, y: H/2 + (Math.random()-0.5)*300, vx: 0, vy: 0\n}));\nconst nodeMap = new Map(nodes.map(n => [n.id, n]));\nconst edges = data.edges.map(e => ({ source: nodeMap.get(e.source), target: nodeMap.get(e.target) }));\n\nfunction simulate() {\n  for (let iter = 0; iter < 300; iter++) {\n    // Repulsion\n    for (let i = 0; i < nodes.length; i++) {\n      for (let j = i+1; j < nodes.length; j++) {\n        let dx = nodes[j].x - nodes[i].x, dy = nodes[j].y - nodes[i].y;\n        let d = Math.sqrt(dx*dx + dy*dy) || 1;\n        let f = 8000 / (d * d);\n        nodes[i].vx -= dx/d * f; nodes[i].vy -= dy/d * f;\n        nodes[j].vx += dx/d * f; nodes[j].vy += dy/d * f;\n      }\n    }\n    // Attraction (edges)\n    edges.forEach(e => {\n      if (!e.source || !e.target) return;\n      let dx = e.target.x - e.source.x, dy = e.target.y - e.source.y;\n      let d = Math.sqrt(dx*dx + dy*dy) || 1;\n      let f = (d - 150) * 0.01;\n      e.source.vx += dx/d * f; e.source.vy += dy/d * f;\n      e.target.vx -= dx/d * f; e.target.vy -= dy/d * f;\n    });\n    // Gravity\n    nodes.forEach(n => {\n      n.vx += (W/2 - n.x) * 0.001;\n      n.vy += (H/2 - n.y) * 0.001;\n      n.x += n.vx * 0.3; n.y += n.vy * 0.3;\n      n.vx *= 0.8; n.vy *= 0.8;\n      n.x = Math.max(60, Math.min(W-60, n.x));\n      n.y = Math.max(30, Math.min(H-30, n.y));\n    });\n  }\n}\nsimulate();\n\n// Render\nedges.forEach(e => {\n  if (!e.source || !e.target) return;\n  const line = document.createElementNS('http://www.w3.org/2000/svg','line');\n  line.setAttribute('x1', e.source.x); line.setAttribute('y1', e.source.y);\n  line.setAttribute('x2', e.target.x); line.setAttribute('y2', e.target.y);\n  line.setAttribute('class','edge');\n  svg.appendChild(line);\n});\nnodes.forEach(n => {\n  const g = document.createElementNS('http://www.w3.org/2000/svg','g');\n  g.setAttribute('class','node');\n  g.setAttribute('transform','translate('+(n.x-50)+','+(n.y-14)+')');\n  const rect = document.createElementNS('http://www.w3.org/2000/svg','rect');\n  rect.setAttribute('width','100'); rect.setAttribute('height','28');\n  rect.setAttribute('fill', n.status ? (statusColors[n.status]||'#ecf0f1') : projectColors[n.project]);\n  g.appendChild(rect);\n  const text = document.createElementNS('http://www.w3.org/2000/svg','text');\n  text.setAttribute('x','50'); text.setAttribute('y','18'); text.setAttribute('text-anchor','middle');\n  text.textContent = n.id.length > 14 ? n.target : n.id;\n  g.appendChild(text);\n  g.addEventListener('click', () => {\n    const deps = data.edges.filter(e => e.source === n.id).map(e => e.target);\n    const rdeps = data.edges.filter(e => e.target === n.id).map(e => e.source);\n    alert(n.id + '\\n\\nDepends on: ' + (deps.join(', ')||'none') + '\\nRequired by: ' + (rdeps.join(', ')||'none'));\n  });\n  svg.appendChild(g);\n});\n<\/script>\n</body>\n</html>"])), graphData.nodes.length, graphData.edges.length, graphData.roots.length, JSON.stringify(graphData).replaceAll("</", String.raw`<\/`));
-};
-const toGraphAscii = (taskGraph, options = {}) => {
-  const { taskStatuses } = options;
-  const lines = [];
-  const taskCount = Object.keys(taskGraph.tasks).length;
-  const edgeCount = Object.values(taskGraph.dependencies).reduce((s, d) => s + d.length, 0);
-  lines.push(`Task Graph (${taskCount} tasks, ${edgeCount} dependencies)`, "");
-  const allDeps = /* @__PURE__ */ new Set();
-  for (const deps of Object.values(taskGraph.dependencies)) {
-    for (const dep of deps) {
-      allDeps.add(dep);
-    }
-  }
-  const roots = Object.keys(taskGraph.tasks).filter((id) => !allDeps.has(id));
-  if (roots.length === 0) {
-    for (const taskId of Object.keys(taskGraph.tasks)) {
-      lines.push(formatTaskLine(taskId, taskStatuses));
-    }
-    return lines.join("\n");
-  }
-  const printed = /* @__PURE__ */ new Set();
-  for (const root of roots) {
-    printTree(root, "", true, taskGraph, printed, lines, taskStatuses);
-  }
-  if (printed.size < taskCount) {
-    lines.push("", "(*) = already shown above");
-  }
-  return lines.join("\n");
-};
-const projectGraphToDot = (projectGraph) => {
-  const lines = ["digraph ProjectGraph {", "  rankdir=LR;", '  node [shape=box, style=filled, fillcolor="#87CEEB", fontname="monospace"];'];
-  for (const node of Object.values(projectGraph.nodes)) {
-    const color = node.type === "application" ? "#FFD700" : "#87CEEB";
-    lines.push(`  "${node.name}" [fillcolor="${color}"];`);
-  }
-  for (const [project, deps] of Object.entries(projectGraph.dependencies)) {
-    for (const dep of deps) {
-      const style = dep.type === "implicit" ? "dashed" : "solid";
-      lines.push(`  "${project}" -> "${dep.target}" [style=${style}];`);
-    }
-  }
-  lines.push("}");
-  return lines.join("\n");
-};
-
-export { projectGraphToDot, toGraphAscii, toGraphHtml, toGraphJson, toGraphvizDot };