@open330/oac 2026.2.5

package/dist/chunk-5GAUWC3L.js

@@ -0,0 +1,469 @@
+// src/budget/complexity.ts
+var SOURCE_LOC_BASELINE = {
+  lint: 8,
+  todo: 16,
+  "test-gap": 48,
+  "dead-code": 36,
+  "github-issue": 88,
+  custom: 40
+};
+var SOURCE_COMPLEXITY_SCORE = {
+  lint: 0,
+  todo: 0,
+  "test-gap": 1,
+  "dead-code": 1,
+  "github-issue": 2,
+  custom: 1
+};
+var ESTIMATED_LOC_KEYS = [
+  "estimatedLoc",
+  "estimatedLOC",
+  "estimatedLocChanges",
+  "estimatedDiffSize",
+  "loc",
+  "locChanges",
+  "linesChanged",
+  "lineCount",
+  "diffSize",
+  "changeSize"
+];
+function parseNumericValue(value) {
+  if (typeof value === "number" && Number.isFinite(value) && value >= 0) {
+    return value;
+  }
+  if (typeof value === "string") {
+    const parsed = Number.parseFloat(value);
+    if (Number.isFinite(parsed) && parsed >= 0) {
+      return parsed;
+    }
+  }
+  return void 0;
+}
+function readMetadataLocEstimate(metadata) {
+  for (const key of ESTIMATED_LOC_KEYS) {
+    const directValue = parseNumericValue(metadata[key]);
+    if (directValue !== void 0) {
+      return directValue;
+    }
+  }
+  const metrics = metadata.metrics;
+  if (metrics && typeof metrics === "object" && !Array.isArray(metrics)) {
+    const metricsRecord = metrics;
+    for (const key of ESTIMATED_LOC_KEYS) {
+      const metricValue = parseNumericValue(metricsRecord[key]);
+      if (metricValue !== void 0) {
+        return metricValue;
+      }
+    }
+  }
+  return void 0;
+}
+function estimateLocChanges(task) {
+  const metadataEstimate = readMetadataLocEstimate(task.metadata);
+  if (metadataEstimate !== void 0) {
+    return Math.max(1, Math.round(metadataEstimate));
+  }
+  const sourceBaseline = SOURCE_LOC_BASELINE[task.source] ?? SOURCE_LOC_BASELINE.custom;
+  const fileAdjustment = Math.max(task.targetFiles.length, 1) * 8;
+  return Math.max(sourceBaseline, fileAdjustment);
+}
+function analyzeTaskComplexity(task) {
+  const fileCount = task.targetFiles.length;
+  const locChanges = estimateLocChanges(task);
+  const fileScore = fileCount <= 1 ? 0 : fileCount <= 3 ? 1 : fileCount <= 6 ? 2 : 3;
+  const locScore = locChanges <= 20 ? 0 : locChanges <= 80 ? 1 : locChanges <= 200 ? 2 : 3;
+  const sourceScore = SOURCE_COMPLEXITY_SCORE[task.source] ?? SOURCE_COMPLEXITY_SCORE.custom;
+  const totalScore = fileScore + locScore + sourceScore;
+  if (totalScore <= 1) {
+    return "trivial";
+  }
+  if (totalScore <= 3) {
+    return "simple";
+  }
+  if (totalScore <= 6) {
+    return "moderate";
+  }
+  return "complex";
+}
+
+// src/budget/estimator.ts
+import { readFile } from "fs/promises";
+import { isAbsolute, resolve } from "path";
+import PQueue from "p-queue";
+
+// src/budget/providers/claude-counter.ts
+import { get_encoding } from "tiktoken";
+var CLAUDE_ENCODING = "cl100k_base";
+var CLAUDE_INVOCATION_OVERHEAD = 1500;
+var CLAUDE_MAX_CONTEXT_TOKENS = 2e5;
+var encoder;
+function getEncoder() {
+  encoder ??= get_encoding(CLAUDE_ENCODING);
+  return encoder;
+}
+var ClaudeTokenCounter = class {
+  invocationOverhead = CLAUDE_INVOCATION_OVERHEAD;
+  maxContextTokens = CLAUDE_MAX_CONTEXT_TOKENS;
+  encoding = CLAUDE_ENCODING;
+  countTokens(text) {
+    return getEncoder().encode(text).length;
+  }
+  /** Free the cached tiktoken encoder so it can be re-created on next use. */
+  reset() {
+    if (encoder) {
+      encoder.free();
+      encoder = void 0;
+    }
+  }
+};
+
+// src/budget/providers/codex-counter.ts
+import { get_encoding as get_encoding2 } from "tiktoken";
+var CODEX_INVOCATION_OVERHEAD = 1e3;
+var CODEX_MAX_CONTEXT_TOKENS = 2e5;
+var PRIMARY_ENCODING = "o200k_base";
+var FALLBACK_ENCODING = "cl100k_base";
+var encoder2;
+var selectedEncoding;
+function getEncoder2() {
+  if (encoder2) {
+    return encoder2;
+  }
+  try {
+    encoder2 = get_encoding2(PRIMARY_ENCODING);
+    selectedEncoding = PRIMARY_ENCODING;
+  } catch {
+    encoder2 = get_encoding2(FALLBACK_ENCODING);
+    selectedEncoding = FALLBACK_ENCODING;
+  }
+  return encoder2;
+}
+var CodexTokenCounter = class {
+  invocationOverhead = CODEX_INVOCATION_OVERHEAD;
+  maxContextTokens = CODEX_MAX_CONTEXT_TOKENS;
+  get encoding() {
+    getEncoder2();
+    return selectedEncoding ?? FALLBACK_ENCODING;
+  }
+  countTokens(text) {
+    return getEncoder2().encode(text).length;
+  }
+  /** Free the cached tiktoken encoder so it can be re-created on next use. */
+  reset() {
+    if (encoder2) {
+      encoder2.free();
+      encoder2 = void 0;
+    }
+    selectedEncoding = void 0;
+  }
+};
+
+// src/budget/estimator.ts
+var ESTIMATION_PADDING_MULTIPLIER = 1.2;
+var FALLBACK_CONFIDENCE = 0.5;
+var COMPLEXITY_MULTIPLIERS = {
+  trivial: 0.5,
+  simple: 1,
+  moderate: 2,
+  complex: 3.5
+};
+var COMPLEXITY_CONFIDENCE = {
+  trivial: 0.9,
+  simple: 0.75,
+  moderate: 0.6,
+  complex: 0.4
+};
+var COMPLEXITY_ORDER = {
+  trivial: 0,
+  simple: 1,
+  moderate: 2,
+  complex: 3
+};
+var claudeCounter = new ClaudeTokenCounter();
+var codexCounter = new CodexTokenCounter();
+function resetCounters() {
+  claudeCounter.reset();
+  codexCounter.reset();
+}
+function getTokenCounter(provider) {
+  if (provider === "claude-code") {
+    return claudeCounter;
+  }
+  return codexCounter;
+}
+function approximateTokenCount(text) {
+  if (text.length === 0) {
+    return 0;
+  }
+  return Math.max(1, Math.ceil(text.length / 4));
+}
+function countTokensWithFallback(text, counter) {
+  try {
+    return {
+      tokens: counter.countTokens(text),
+      usedFallback: false
+    };
+  } catch {
+    return {
+      tokens: approximateTokenCount(text),
+      usedFallback: true
+    };
+  }
+}
+function chooseConservativeComplexity(declaredComplexity, analyzedComplexity) {
+  return COMPLEXITY_ORDER[declaredComplexity] >= COMPLEXITY_ORDER[analyzedComplexity] ? declaredComplexity : analyzedComplexity;
+}
+function clamp(value, min, max) {
+  if (value < min) {
+    return min;
+  }
+  if (value > max) {
+    return max;
+  }
+  return value;
+}
+function resolveTargetFilePath(targetFile) {
+  return isAbsolute(targetFile) ? targetFile : resolve(process.cwd(), targetFile);
+}
+function safeStringify(value) {
+  try {
+    const serialized = JSON.stringify(value);
+    return serialized ?? "null";
+  } catch {
+    return "[unserializable]";
+  }
+}
+async function readContextFile(targetFile, counter) {
+  const resolvedPath = resolveTargetFilePath(targetFile);
+  try {
+    const content = await readFile(resolvedPath, "utf8");
+    const counted = countTokensWithFallback(content, counter);
+    return {
+      ...counted,
+      missing: false
+    };
+  } catch {
+    return {
+      tokens: 0,
+      usedFallback: false,
+      missing: true
+    };
+  }
+}
+async function estimateTokens(task, provider) {
+  const counter = getTokenCounter(provider);
+  const uniqueTargetFiles = [...new Set(task.targetFiles)];
+  const fileQueue = new PQueue({ concurrency: 50 });
+  const fileResults = await Promise.all(
+    uniqueTargetFiles.map(
+      (targetFile) => fileQueue.add(() => readContextFile(targetFile, counter))
+    )
+  );
+  const repoStructureSeed = uniqueTargetFiles.join("\n");
+  const repoStructureCount = countTokensWithFallback(repoStructureSeed, counter);
+  const contextTokens = repoStructureCount.tokens + fileResults.reduce((sum, result) => sum + result.tokens, 0);
+  const promptSeed = [
+    `Task ID: ${task.id}`,
+    `Title: ${task.title}`,
+    `Source: ${task.source}`,
+    `Priority: ${task.priority}`,
+    `Description:
+${task.description}`,
+    `Target Files:
+${uniqueTargetFiles.join("\n") || "(none)"}`,
+    `Metadata: ${safeStringify(task.metadata)}`
+  ].join("\n\n");
+  const promptContentCount = countTokensWithFallback(promptSeed, counter);
+  const promptTokens = counter.invocationOverhead + promptContentCount.tokens;
+  const analyzedComplexity = analyzeTaskComplexity(task);
+  const effectiveComplexity = chooseConservativeComplexity(task.complexity, analyzedComplexity);
+  const expectedOutputTokens = Math.ceil(
+    contextTokens * COMPLEXITY_MULTIPLIERS[effectiveComplexity]
+  );
+  const rawTotalTokens = contextTokens + promptTokens + expectedOutputTokens;
+  const totalEstimatedTokens = Math.ceil(rawTotalTokens * ESTIMATION_PADDING_MULTIPLIER);
+  const usedFallback = repoStructureCount.usedFallback || promptContentCount.usedFallback || fileResults.some((result) => result.usedFallback);
+  const missingFileCount = fileResults.filter((result) => result.missing).length;
+  let confidence = COMPLEXITY_CONFIDENCE[effectiveComplexity];
+  if (usedFallback) {
+    confidence = Math.min(confidence, FALLBACK_CONFIDENCE);
+  }
+  if (missingFileCount > 0) {
+    confidence -= Math.min(0.25, missingFileCount * 0.05);
+  }
+  if (uniqueTargetFiles.length === 0) {
+    confidence -= 0.1;
+  }
+  if (task.complexity !== analyzedComplexity) {
+    confidence -= 0.05;
+  }
+  const feasible = totalEstimatedTokens <= counter.maxContextTokens;
+  return {
+    taskId: task.id,
+    providerId: provider,
+    contextTokens,
+    promptTokens,
+    expectedOutputTokens,
+    totalEstimatedTokens,
+    confidence: clamp(confidence, 0.1, 0.95),
+    feasible
+  };
+}
+var EPIC_CONTEXT_OVERHEAD = 1.2;
+async function estimateEpicTokens(epic, provider) {
+  if (epic.subtasks.length === 0) {
+    return 0;
+  }
+  const epicQueue = new PQueue({ concurrency: 10 });
+  const subtaskEstimates = await Promise.all(
+    epic.subtasks.map(
+      (task) => epicQueue.add(() => estimateTokens(task, provider))
+    )
+  );
+  const subtaskTotal = subtaskEstimates.reduce(
+    (sum, estimate) => sum + estimate.totalEstimatedTokens,
+    0
+  );
+  return Math.ceil(subtaskTotal * EPIC_CONTEXT_OVERHEAD);
+}
+
+// src/budget/planner.ts
+var DEFAULT_RESERVE_PERCENT = 0.1;
+var MIN_CONFIDENCE_THRESHOLD = 0.5;
+var TOO_COMPLEX_BUDGET_SHARE = 0.6;
+function normalizeBudget(budget) {
+  if (!Number.isFinite(budget) || budget <= 0) {
+    return 0;
+  }
+  return Math.floor(budget);
+}
+function getFallbackEstimate(task) {
+  return {
+    taskId: task.id,
+    providerId: "unknown",
+    contextTokens: 0,
+    promptTokens: 0,
+    expectedOutputTokens: 0,
+    totalEstimatedTokens: Number.MAX_SAFE_INTEGER,
+    confidence: 0,
+    feasible: false
+  };
+}
+function classifyDeferredReason(task, estimate, effectiveBudget) {
+  if (!estimate.feasible) {
+    return "budget_exceeded";
+  }
+  if (estimate.confidence < MIN_CONFIDENCE_THRESHOLD) {
+    return "low_confidence";
+  }
+  if (task.complexity === "complex" && effectiveBudget > 0 && estimate.totalEstimatedTokens > effectiveBudget * TOO_COMPLEX_BUDGET_SHARE) {
+    return "too_complex";
+  }
+  return void 0;
+}
+function scoreByPriorityPerToken(task, estimate) {
+  if (estimate.totalEstimatedTokens <= 0) {
+    return task.priority;
+  }
+  return task.priority / estimate.totalEstimatedTokens;
+}
+function buildExecutionPlan(tasks, estimates, budget) {
+  const totalBudget = normalizeBudget(budget);
+  const reserveTokens = Math.floor(totalBudget * DEFAULT_RESERVE_PERCENT);
+  const effectiveBudget = Math.max(0, totalBudget - reserveTokens);
+  const deferredTasks = [];
+  const candidates = [];
+  for (const task of tasks) {
+    const estimate = estimates.get(task.id) ?? getFallbackEstimate(task);
+    const reason = classifyDeferredReason(task, estimate, effectiveBudget);
+    if (reason) {
+      deferredTasks.push({ task, estimate, reason });
+      continue;
+    }
+    candidates.push({ task, estimate });
+  }
+  candidates.sort((left, right) => {
+    const ratioDifference = scoreByPriorityPerToken(right.task, right.estimate) - scoreByPriorityPerToken(left.task, left.estimate);
+    if (ratioDifference !== 0) {
+      return ratioDifference;
+    }
+    const priorityDifference = right.task.priority - left.task.priority;
+    if (priorityDifference !== 0) {
+      return priorityDifference;
+    }
+    return left.estimate.totalEstimatedTokens - right.estimate.totalEstimatedTokens;
+  });
+  const selectedTasks = [];
+  let budgetUsed = 0;
+  for (const candidate of candidates) {
+    const nextBudgetUsed = budgetUsed + candidate.estimate.totalEstimatedTokens;
+    if (nextBudgetUsed <= effectiveBudget) {
+      budgetUsed = nextBudgetUsed;
+      selectedTasks.push({
+        task: candidate.task,
+        estimate: candidate.estimate,
+        cumulativeBudgetUsed: budgetUsed
+      });
+      continue;
+    }
+    deferredTasks.push({
+      task: candidate.task,
+      estimate: candidate.estimate,
+      reason: "budget_exceeded"
+    });
+  }
+  return {
+    totalBudget,
+    selectedTasks,
+    deferredTasks,
+    reserveTokens,
+    remainingTokens: Math.max(0, effectiveBudget - budgetUsed)
+  };
+}
+function buildEpicExecutionPlan(epics, budget) {
+  const totalBudget = normalizeBudget(budget);
+  const reserveTokens = Math.floor(totalBudget * DEFAULT_RESERVE_PERCENT);
+  const effectiveBudget = Math.max(0, totalBudget - reserveTokens);
+  const sorted = [...epics].sort((a, b) => b.priority - a.priority);
+  const selectedEpics = [];
+  const deferredEpics = [];
+  let budgetUsed = 0;
+  for (const epic of sorted) {
+    const tokens = epic.estimatedTokens;
+    const nextBudgetUsed = budgetUsed + tokens;
+    if (nextBudgetUsed <= effectiveBudget) {
+      budgetUsed = nextBudgetUsed;
+      selectedEpics.push({
+        epic,
+        estimatedTokens: tokens,
+        cumulativeBudgetUsed: budgetUsed
+      });
+    } else {
+      deferredEpics.push({
+        epic,
+        estimatedTokens: tokens,
+        reason: "budget_exceeded"
+      });
+    }
+  }
+  return {
+    totalBudget,
+    selectedEpics,
+    deferredEpics,
+    reserveTokens,
+    remainingTokens: Math.max(0, effectiveBudget - budgetUsed)
+  };
+}
+
+export {
+  estimateLocChanges,
+  analyzeTaskComplexity,
+  ClaudeTokenCounter,
+  CodexTokenCounter,
+  resetCounters,
+  estimateTokens,
+  estimateEpicTokens,
+  buildExecutionPlan,
+  buildEpicExecutionPlan
+};
+//# sourceMappingURL=chunk-5GAUWC3L.js.map

package/dist/chunk-5GAUWC3L.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/budget/complexity.ts","../src/budget/estimator.ts","../src/budget/providers/claude-counter.ts","../src/budget/providers/codex-counter.ts","../src/budget/planner.ts"],"sourcesContent":["import type { Task, TaskComplexity, TaskSource } from \"./estimator.js\";\n\nconst SOURCE_LOC_BASELINE: Record<TaskSource, number> = {\n  lint: 8,\n  todo: 16,\n  \"test-gap\": 48,\n  \"dead-code\": 36,\n  \"github-issue\": 88,\n  custom: 40,\n};\n\nconst SOURCE_COMPLEXITY_SCORE: Record<TaskSource, number> = {\n  lint: 0,\n  todo: 0,\n  \"test-gap\": 1,\n  \"dead-code\": 1,\n  \"github-issue\": 2,\n  custom: 1,\n};\n\nconst ESTIMATED_LOC_KEYS = [\n  \"estimatedLoc\",\n  \"estimatedLOC\",\n  \"estimatedLocChanges\",\n  \"estimatedDiffSize\",\n  \"loc\",\n  \"locChanges\",\n  \"linesChanged\",\n  \"lineCount\",\n  \"diffSize\",\n  \"changeSize\",\n] as const;\n\nfunction parseNumericValue(value: unknown): number | undefined {\n  if (typeof value === \"number\" && Number.isFinite(value) && value >= 0) {\n    return value;\n  }\n\n  if (typeof value === \"string\") {\n    const parsed = Number.parseFloat(value);\n    if (Number.isFinite(parsed) && parsed >= 0) {\n      return parsed;\n    }\n  }\n\n  return undefined;\n}\n\nfunction readMetadataLocEstimate(metadata: Record<string, unknown>): number | undefined {\n  for (const key of ESTIMATED_LOC_KEYS) {\n    const directValue = parseNumericValue(metadata[key]);\n    if (directValue !== undefined) {\n      return directValue;\n    }\n  }\n\n  const metrics = metadata.metrics;\n  if (metrics && typeof metrics === \"object\" && !Array.isArray(metrics)) {\n    const metricsRecord = metrics as Record<string, unknown>;\n    for (const key of ESTIMATED_LOC_KEYS) {\n      const metricValue = parseNumericValue(metricsRecord[key]);\n      if (metricValue !== undefined) {\n        return metricValue;\n      }\n    }\n  }\n\n  return undefined;\n}\n\nexport function estimateLocChanges(task: Task): number {\n  const metadataEstimate = readMetadataLocEstimate(task.metadata);\n  if (metadataEstimate !== undefined) {\n    return Math.max(1, Math.round(metadataEstimate));\n  }\n\n  const sourceBaseline = SOURCE_LOC_BASELINE[task.source] ?? SOURCE_LOC_BASELINE.custom;\n  const fileAdjustment = Math.max(task.targetFiles.length, 1) * 8;\n\n  return Math.max(sourceBaseline, fileAdjustment);\n}\n\nexport function analyzeTaskComplexity(task: Task): TaskComplexity {\n  const fileCount = task.targetFiles.length;\n  const locChanges = estimateLocChanges(task);\n\n  const fileScore = fileCount <= 1 ? 0 : fileCount <= 3 ? 1 : fileCount <= 6 ? 2 : 3;\n  const locScore = locChanges <= 20 ? 0 : locChanges <= 80 ? 1 : locChanges <= 200 ? 2 : 3;\n  const sourceScore = SOURCE_COMPLEXITY_SCORE[task.source] ?? SOURCE_COMPLEXITY_SCORE.custom;\n\n  const totalScore = fileScore + locScore + sourceScore;\n\n  if (totalScore <= 1) {\n    return \"trivial\";\n  }\n\n  if (totalScore <= 3) {\n    return \"simple\";\n  }\n\n  if (totalScore <= 6) {\n    return \"moderate\";\n  }\n\n  return \"complex\";\n}\n","import { readFile } from \"node:fs/promises\";\nimport { isAbsolute, resolve } from \"node:path\";\n\nimport PQueue from \"p-queue\";\nimport type { Epic } from \"../core/types.js\";\nimport { analyzeTaskComplexity } from \"./complexity.js\";\nimport { ClaudeTokenCounter } from \"./providers/claude-counter.js\";\nimport { CodexTokenCounter } from \"./providers/codex-counter.js\";\n\nexport type AgentProviderId = \"claude-code\" | \"codex\" | \"opencode\" | string;\n\nexport type TaskSource = \"lint\" | \"todo\" | \"test-gap\" | \"dead-code\" | \"github-issue\" | \"custom\";\n\nexport type TaskComplexity = \"trivial\" | \"simple\" | \"moderate\" | \"complex\";\n\nexport type ExecutionMode = \"new-pr\" | \"update-pr\" | \"direct-commit\";\n\nexport interface Task {\n  id: string;\n  source: TaskSource;\n  title: string;\n  description: string;\n  targetFiles: string[];\n  priority: number;\n  complexity: TaskComplexity;\n  executionMode: ExecutionMode;\n  linkedIssue?: {\n    number: number;\n    url: string;\n    labels: string[];\n  };\n  metadata: Record<string, unknown>;\n  discoveredAt: string;\n}\n\nexport interface TokenEstimate {\n  taskId: string;\n  providerId: AgentProviderId;\n  contextTokens: number;\n  promptTokens: number;\n  expectedOutputTokens: number;\n  totalEstimatedTokens: number;\n  confidence: number;\n  feasible: boolean;\n  estimatedCostUsd?: number;\n}\n\nexport interface TokenCounter {\n  countTokens(text: string): number;\n  readonly invocationOverhead: number;\n  readonly maxContextTokens: number;\n  /** Free any cached resources (e.g. tiktoken encoders). Optional. */\n  reset?(): void;\n}\n\ninterface TokenCountResult {\n  tokens: number;\n  usedFallback: boolean;\n}\n\ninterface ContextFileResult extends TokenCountResult {\n  missing: boolean;\n}\n\nconst ESTIMATION_PADDING_MULTIPLIER = 1.2;\nconst FALLBACK_CONFIDENCE = 0.5;\n\nconst COMPLEXITY_MULTIPLIERS: Record<TaskComplexity, number> = {\n  trivial: 0.5,\n  simple: 1,\n  moderate: 2,\n  complex: 3.5,\n};\n\nconst COMPLEXITY_CONFIDENCE: Record<TaskComplexity, number> = {\n  trivial: 0.9,\n  simple: 0.75,\n  moderate: 0.6,\n  complex: 0.4,\n};\n\nconst COMPLEXITY_ORDER: Record<TaskComplexity, number> = {\n  trivial: 0,\n  simple: 1,\n  moderate: 2,\n  complex: 3,\n};\n\nconst claudeCounter = new ClaudeTokenCounter();\nconst codexCounter = new CodexTokenCounter();\n\n/**\n * Free cached tiktoken encoders held by the module-level counter singletons.\n * Useful for reclaiming memory in long-lived processes or between test runs.\n */\nexport function resetCounters(): void {\n  claudeCounter.reset();\n  codexCounter.reset();\n}\n\nfunction getTokenCounter(provider: AgentProviderId): TokenCounter {\n  if (provider === \"claude-code\") {\n    return claudeCounter;\n  }\n\n  return codexCounter;\n}\n\nfunction approximateTokenCount(text: string): number {\n  if (text.length === 0) {\n    return 0;\n  }\n\n  return Math.max(1, Math.ceil(text.length / 4));\n}\n\nfunction countTokensWithFallback(text: string, counter: TokenCounter): TokenCountResult {\n  try {\n    return {\n      tokens: counter.countTokens(text),\n      usedFallback: false,\n    };\n  } catch {\n    return {\n      tokens: approximateTokenCount(text),\n      usedFallback: true,\n    };\n  }\n}\n\nfunction chooseConservativeComplexity(\n  declaredComplexity: TaskComplexity,\n  analyzedComplexity: TaskComplexity,\n): TaskComplexity {\n  return COMPLEXITY_ORDER[declaredComplexity] >= COMPLEXITY_ORDER[analyzedComplexity]\n    ? declaredComplexity\n    : analyzedComplexity;\n}\n\nfunction clamp(value: number, min: number, max: number): number {\n  if (value < min) {\n    return min;\n  }\n\n  if (value > max) {\n    return max;\n  }\n\n  return value;\n}\n\nfunction resolveTargetFilePath(targetFile: string): string {\n  return isAbsolute(targetFile) ? targetFile : resolve(process.cwd(), targetFile);\n}\n\nfunction safeStringify(value: unknown): string {\n  try {\n    const serialized = JSON.stringify(value);\n    return serialized ?? \"null\";\n  } catch {\n    return \"[unserializable]\";\n  }\n}\n\nasync function readContextFile(\n  targetFile: string,\n  counter: TokenCounter,\n): Promise<ContextFileResult> {\n  const resolvedPath = resolveTargetFilePath(targetFile);\n\n  try {\n    const content = await readFile(resolvedPath, \"utf8\");\n    const counted = countTokensWithFallback(content, counter);\n\n    return {\n      ...counted,\n      missing: false,\n    };\n  } catch {\n    return {\n      tokens: 0,\n      usedFallback: false,\n      missing: true,\n    };\n  }\n}\n\nexport async function estimateTokens(\n  task: Task,\n  provider: AgentProviderId,\n): Promise<TokenEstimate> {\n  const counter = getTokenCounter(provider);\n  const uniqueTargetFiles = [...new Set(task.targetFiles)];\n\n  const fileQueue = new PQueue({ concurrency: 50 });\n  const fileResults = await Promise.all(\n    uniqueTargetFiles.map((targetFile) =>\n      fileQueue.add(() => readContextFile(targetFile, counter)) as Promise<ContextFileResult>,\n    ),\n  );\n\n  const repoStructureSeed = uniqueTargetFiles.join(\"\\n\");\n  const repoStructureCount = countTokensWithFallback(repoStructureSeed, counter);\n\n  const contextTokens =\n    repoStructureCount.tokens + fileResults.reduce((sum, result) => sum + result.tokens, 0);\n\n  const promptSeed = [\n    `Task ID: ${task.id}`,\n    `Title: ${task.title}`,\n    `Source: ${task.source}`,\n    `Priority: ${task.priority}`,\n    `Description:\\n${task.description}`,\n    `Target Files:\\n${uniqueTargetFiles.join(\"\\n\") || \"(none)\"}`,\n    `Metadata: ${safeStringify(task.metadata)}`,\n  ].join(\"\\n\\n\");\n\n  const promptContentCount = countTokensWithFallback(promptSeed, counter);\n  const promptTokens = counter.invocationOverhead + promptContentCount.tokens;\n\n  const analyzedComplexity = analyzeTaskComplexity(task);\n  const effectiveComplexity = chooseConservativeComplexity(task.complexity, analyzedComplexity);\n  const expectedOutputTokens = Math.ceil(\n    contextTokens * COMPLEXITY_MULTIPLIERS[effectiveComplexity],\n  );\n\n  const rawTotalTokens = contextTokens + promptTokens + expectedOutputTokens;\n  const totalEstimatedTokens = Math.ceil(rawTotalTokens * ESTIMATION_PADDING_MULTIPLIER);\n\n  const usedFallback =\n    repoStructureCount.usedFallback ||\n    promptContentCount.usedFallback ||\n    fileResults.some((result) => result.usedFallback);\n\n  const missingFileCount = fileResults.filter((result) => result.missing).length;\n\n  let confidence = COMPLEXITY_CONFIDENCE[effectiveComplexity];\n  if (usedFallback) {\n    confidence = Math.min(confidence, FALLBACK_CONFIDENCE);\n  }\n\n  if (missingFileCount > 0) {\n    confidence -= Math.min(0.25, missingFileCount * 0.05);\n  }\n\n  if (uniqueTargetFiles.length === 0) {\n    confidence -= 0.1;\n  }\n\n  if (task.complexity !== analyzedComplexity) {\n    confidence -= 0.05;\n  }\n\n  const feasible = totalEstimatedTokens <= counter.maxContextTokens;\n\n  return {\n    taskId: task.id,\n    providerId: provider,\n    contextTokens,\n    promptTokens,\n    expectedOutputTokens,\n    totalEstimatedTokens,\n    confidence: clamp(confidence, 0.1, 0.95),\n    feasible,\n  };\n}\n\n// ── Epic token estimation ────────────────────────────────────\n\nconst EPIC_CONTEXT_OVERHEAD = 1.2; // 20% overhead for shared module understanding\n\n/**\n * Estimate tokens for an entire epic by summing subtask estimates\n * plus a 20% context overhead for shared module understanding.\n */\nexport async function estimateEpicTokens(epic: Epic, provider: AgentProviderId): Promise<number> {\n  if (epic.subtasks.length === 0) {\n    return 0;\n  }\n\n  const epicQueue = new PQueue({ concurrency: 10 });\n  const subtaskEstimates = await Promise.all(\n    epic.subtasks.map((task) =>\n      epicQueue.add(() => estimateTokens(task, provider)) as Promise<TokenEstimate>,\n    ),\n  );\n\n  const subtaskTotal = subtaskEstimates.reduce(\n    (sum, estimate) => sum + estimate.totalEstimatedTokens,\n    0,\n  );\n\n  return Math.ceil(subtaskTotal * EPIC_CONTEXT_OVERHEAD);\n}\n","import { type Tiktoken, get_encoding } from \"tiktoken\";\n\nconst CLAUDE_ENCODING = \"cl100k_base\";\nconst CLAUDE_INVOCATION_OVERHEAD = 1_500;\nconst CLAUDE_MAX_CONTEXT_TOKENS = 200_000;\n\nlet encoder: Tiktoken | undefined;\n\nfunction getEncoder(): Tiktoken {\n  encoder ??= get_encoding(CLAUDE_ENCODING);\n  return encoder;\n}\n\nexport class ClaudeTokenCounter {\n  readonly invocationOverhead = CLAUDE_INVOCATION_OVERHEAD;\n  readonly maxContextTokens = CLAUDE_MAX_CONTEXT_TOKENS;\n  readonly encoding = CLAUDE_ENCODING;\n\n  countTokens(text: string): number {\n    return getEncoder().encode(text).length;\n  }\n\n  /** Free the cached tiktoken encoder so it can be re-created on next use. */\n  reset(): void {\n    if (encoder) {\n      encoder.free();\n      encoder = undefined;\n    }\n  }\n}\n","import { type Tiktoken, get_encoding } from \"tiktoken\";\n\nconst CODEX_INVOCATION_OVERHEAD = 1_000;\nconst CODEX_MAX_CONTEXT_TOKENS = 200_000;\nconst PRIMARY_ENCODING = \"o200k_base\";\nconst FALLBACK_ENCODING = \"cl100k_base\";\n\ntype SupportedCodexEncoding = typeof PRIMARY_ENCODING | typeof FALLBACK_ENCODING;\n\nlet encoder: Tiktoken | undefined;\nlet selectedEncoding: SupportedCodexEncoding | undefined;\n\nfunction getEncoder(): Tiktoken {\n  if (encoder) {\n    return encoder;\n  }\n\n  try {\n    encoder = get_encoding(PRIMARY_ENCODING);\n    selectedEncoding = PRIMARY_ENCODING;\n  } catch {\n    encoder = get_encoding(FALLBACK_ENCODING);\n    selectedEncoding = FALLBACK_ENCODING;\n  }\n\n  return encoder;\n}\n\nexport class CodexTokenCounter {\n  readonly invocationOverhead = CODEX_INVOCATION_OVERHEAD;\n  readonly maxContextTokens = CODEX_MAX_CONTEXT_TOKENS;\n\n  get encoding(): SupportedCodexEncoding {\n    getEncoder();\n    return selectedEncoding ?? FALLBACK_ENCODING;\n  }\n\n  countTokens(text: string): number {\n    return getEncoder().encode(text).length;\n  }\n\n  /** Free the cached tiktoken encoder so it can be re-created on next use. */\n  reset(): void {\n    if (encoder) {\n      encoder.free();\n      encoder = undefined;\n    }\n    selectedEncoding = undefined;\n  }\n}\n","import type { Epic } from \"../core/types.js\";\nimport type { AgentProviderId, Task, TokenEstimate } from \"./estimator.js\";\n\nconst DEFAULT_RESERVE_PERCENT = 0.1;\nconst MIN_CONFIDENCE_THRESHOLD = 0.5;\nconst TOO_COMPLEX_BUDGET_SHARE = 0.6;\n\ntype DeferredReason = \"budget_exceeded\" | \"low_confidence\" | \"too_complex\";\n\nexport interface ExecutionPlan {\n  totalBudget: number;\n  selectedTasks: Array<{\n    task: Task;\n    estimate: TokenEstimate;\n    cumulativeBudgetUsed: number;\n  }>;\n  deferredTasks: Array<{\n    task: Task;\n    estimate: TokenEstimate;\n    reason: DeferredReason;\n  }>;\n  reserveTokens: number;\n  remainingTokens: number;\n}\n\ninterface CandidateTask {\n  task: Task;\n  estimate: TokenEstimate;\n}\n\nfunction normalizeBudget(budget: number): number {\n  if (!Number.isFinite(budget) || budget <= 0) {\n    return 0;\n  }\n\n  return Math.floor(budget);\n}\n\nfunction getFallbackEstimate(task: Task): TokenEstimate {\n  return {\n    taskId: task.id,\n    providerId: \"unknown\" as AgentProviderId,\n    contextTokens: 0,\n    promptTokens: 0,\n    expectedOutputTokens: 0,\n    totalEstimatedTokens: Number.MAX_SAFE_INTEGER,\n    confidence: 0,\n    feasible: false,\n  };\n}\n\nfunction classifyDeferredReason(\n  task: Task,\n  estimate: TokenEstimate,\n  effectiveBudget: number,\n): DeferredReason | undefined {\n  if (!estimate.feasible) {\n    return \"budget_exceeded\";\n  }\n\n  if (estimate.confidence < MIN_CONFIDENCE_THRESHOLD) {\n    return \"low_confidence\";\n  }\n\n  if (\n    task.complexity === \"complex\" &&\n    effectiveBudget > 0 &&\n    estimate.totalEstimatedTokens > effectiveBudget * TOO_COMPLEX_BUDGET_SHARE\n  ) {\n    return \"too_complex\";\n  }\n\n  return undefined;\n}\n\nfunction scoreByPriorityPerToken(task: Task, estimate: TokenEstimate): number {\n  if (estimate.totalEstimatedTokens <= 0) {\n    return task.priority;\n  }\n\n  return task.priority / estimate.totalEstimatedTokens;\n}\n\nexport function buildExecutionPlan(\n  tasks: Task[],\n  estimates: Map<string, TokenEstimate>,\n  budget: number,\n): ExecutionPlan {\n  const totalBudget = normalizeBudget(budget);\n  const reserveTokens = Math.floor(totalBudget * DEFAULT_RESERVE_PERCENT);\n  const effectiveBudget = Math.max(0, totalBudget - reserveTokens);\n\n  const deferredTasks: ExecutionPlan[\"deferredTasks\"] = [];\n  const candidates: CandidateTask[] = [];\n\n  for (const task of tasks) {\n    const estimate = estimates.get(task.id) ?? getFallbackEstimate(task);\n    const reason = classifyDeferredReason(task, estimate, effectiveBudget);\n\n    if (reason) {\n      deferredTasks.push({ task, estimate, reason });\n      continue;\n    }\n\n    candidates.push({ task, estimate });\n  }\n\n  candidates.sort((left, right) => {\n    const ratioDifference =\n      scoreByPriorityPerToken(right.task, right.estimate) -\n      scoreByPriorityPerToken(left.task, left.estimate);\n\n    if (ratioDifference !== 0) {\n      return ratioDifference;\n    }\n\n    const priorityDifference = right.task.priority - left.task.priority;\n    if (priorityDifference !== 0) {\n      return priorityDifference;\n    }\n\n    return left.estimate.totalEstimatedTokens - right.estimate.totalEstimatedTokens;\n  });\n\n  const selectedTasks: ExecutionPlan[\"selectedTasks\"] = [];\n  let budgetUsed = 0;\n\n  for (const candidate of candidates) {\n    const nextBudgetUsed = budgetUsed + candidate.estimate.totalEstimatedTokens;\n\n    if (nextBudgetUsed <= effectiveBudget) {\n      budgetUsed = nextBudgetUsed;\n      selectedTasks.push({\n        task: candidate.task,\n        estimate: candidate.estimate,\n        cumulativeBudgetUsed: budgetUsed,\n      });\n      continue;\n    }\n\n    deferredTasks.push({\n      task: candidate.task,\n      estimate: candidate.estimate,\n      reason: \"budget_exceeded\",\n    });\n  }\n\n  return {\n    totalBudget,\n    selectedTasks,\n    deferredTasks,\n    reserveTokens,\n    remainingTokens: Math.max(0, effectiveBudget - budgetUsed),\n  };\n}\n\n// ── Epic execution plan ─────────────────────────────────────\n\nexport interface EpicExecutionPlan {\n  totalBudget: number;\n  selectedEpics: Array<{\n    epic: Epic;\n    estimatedTokens: number;\n    cumulativeBudgetUsed: number;\n  }>;\n  deferredEpics: Array<{\n    epic: Epic;\n    estimatedTokens: number;\n    reason: \"budget_exceeded\";\n  }>;\n  reserveTokens: number;\n  remainingTokens: number;\n}\n\n/**\n * Build an execution plan for epics. Unlike task-level planning, epics are\n * sorted purely by priority (not priority/tokens ratio) since they are\n * already coherent units of work.\n */\nexport function buildEpicExecutionPlan(epics: Epic[], budget: number): EpicExecutionPlan {\n  const totalBudget = normalizeBudget(budget);\n  const reserveTokens = Math.floor(totalBudget * DEFAULT_RESERVE_PERCENT);\n  const effectiveBudget = Math.max(0, totalBudget - reserveTokens);\n\n  // Sort by priority descending (highest priority first)\n  const sorted = [...epics].sort((a, b) => b.priority - a.priority);\n\n  const selectedEpics: EpicExecutionPlan[\"selectedEpics\"] = [];\n  const deferredEpics: EpicExecutionPlan[\"deferredEpics\"] = [];\n  let budgetUsed = 0;\n\n  for (const epic of sorted) {\n    const tokens = epic.estimatedTokens;\n    const nextBudgetUsed = budgetUsed + tokens;\n\n    if (nextBudgetUsed <= effectiveBudget) {\n      budgetUsed = nextBudgetUsed;\n      selectedEpics.push({\n        epic,\n        estimatedTokens: tokens,\n        cumulativeBudgetUsed: budgetUsed,\n      });\n    } else {\n      deferredEpics.push({\n        epic,\n        estimatedTokens: tokens,\n        reason: \"budget_exceeded\",\n      });\n    }\n  }\n\n  return {\n    totalBudget,\n    selectedEpics,\n    deferredEpics,\n    reserveTokens,\n    remainingTokens: Math.max(0, effectiveBudget - budgetUsed),\n  };\n}\n"],"mappings":";AAEA,IAAM,sBAAkD;AAAA,EACtD,MAAM;AAAA,EACN,MAAM;AAAA,EACN,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,gBAAgB;AAAA,EAChB,QAAQ;AACV;AAEA,IAAM,0BAAsD;AAAA,EAC1D,MAAM;AAAA,EACN,MAAM;AAAA,EACN,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,gBAAgB;AAAA,EAChB,QAAQ;AACV;AAEA,IAAM,qBAAqB;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,SAAS,kBAAkB,OAAoC;AAC7D,MAAI,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,KAAK,SAAS,GAAG;AACrE,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,SAAS,OAAO,WAAW,KAAK;AACtC,QAAI,OAAO,SAAS,MAAM,KAAK,UAAU,GAAG;AAC1C,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,wBAAwB,UAAuD;AACtF,aAAW,OAAO,oBAAoB;AACpC,UAAM,cAAc,kBAAkB,SAAS,GAAG,CAAC;AACnD,QAAI,gBAAgB,QAAW;AAC7B,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,UAAU,SAAS;AACzB,MAAI,WAAW,OAAO,YAAY,YAAY,CAAC,MAAM,QAAQ,OAAO,GAAG;AACrE,UAAM,gBAAgB;AACtB,eAAW,OAAO,oBAAoB;AACpC,YAAM,cAAc,kBAAkB,cAAc,GAAG,CAAC;AACxD,UAAI,gBAAgB,QAAW;AAC7B,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,mBAAmB,MAAoB;AACrD,QAAM,mBAAmB,wBAAwB,KAAK,QAAQ;AAC9D,MAAI,qBAAqB,QAAW;AAClC,WAAO,KAAK,IAAI,GAAG,KAAK,MAAM,gBAAgB,CAAC;AAAA,EACjD;AAEA,QAAM,iBAAiB,oBAAoB,KAAK,MAAM,KAAK,oBAAoB;AAC/E,QAAM,iBAAiB,KAAK,IAAI,KAAK,YAAY,QAAQ,CAAC,IAAI;AAE9D,SAAO,KAAK,IAAI,gBAAgB,cAAc;AAChD;AAEO,SAAS,sBAAsB,MAA4B;AAChE,QAAM,YAAY,KAAK,YAAY;AACnC,QAAM,aAAa,mBAAmB,IAAI;AAE1C,QAAM,YAAY,aAAa,IAAI,IAAI,aAAa,IAAI,IAAI,aAAa,IAAI,IAAI;AACjF,QAAM,WAAW,cAAc,KAAK,IAAI,cAAc,KAAK,IAAI,cAAc,MAAM,IAAI;AACvF,QAAM,cAAc,wBAAwB,KAAK,MAAM,KAAK,wBAAwB;AAEpF,QAAM,aAAa,YAAY,WAAW;AAE1C,MAAI,cAAc,GAAG;AACnB,WAAO;AAAA,EACT;AAEA,MAAI,cAAc,GAAG;AACnB,WAAO;AAAA,EACT;AAEA,MAAI,cAAc,GAAG;AACnB,WAAO;AAAA,EACT;AAEA,SAAO;AACT;;;ACzGA,SAAS,gBAAgB;AACzB,SAAS,YAAY,eAAe;AAEpC,OAAO,YAAY;;;ACHnB,SAAwB,oBAAoB;AAE5C,IAAM,kBAAkB;AACxB,IAAM,6BAA6B;AACnC,IAAM,4BAA4B;AAElC,IAAI;AAEJ,SAAS,aAAuB;AAC9B,cAAY,aAAa,eAAe;AACxC,SAAO;AACT;AAEO,IAAM,qBAAN,MAAyB;AAAA,EACrB,qBAAqB;AAAA,EACrB,mBAAmB;AAAA,EACnB,WAAW;AAAA,EAEpB,YAAY,MAAsB;AAChC,WAAO,WAAW,EAAE,OAAO,IAAI,EAAE;AAAA,EACnC;AAAA;AAAA,EAGA,QAAc;AACZ,QAAI,SAAS;AACX,cAAQ,KAAK;AACb,gBAAU;AAAA,IACZ;AAAA,EACF;AACF;;;AC7BA,SAAwB,gBAAAA,qBAAoB;AAE5C,IAAM,4BAA4B;AAClC,IAAM,2BAA2B;AACjC,IAAM,mBAAmB;AACzB,IAAM,oBAAoB;AAI1B,IAAIC;AACJ,IAAI;AAEJ,SAASC,cAAuB;AAC9B,MAAID,UAAS;AACX,WAAOA;AAAA,EACT;AAEA,MAAI;AACF,IAAAA,WAAUD,cAAa,gBAAgB;AACvC,uBAAmB;AAAA,EACrB,QAAQ;AACN,IAAAC,WAAUD,cAAa,iBAAiB;AACxC,uBAAmB;AAAA,EACrB;AAEA,SAAOC;AACT;AAEO,IAAM,oBAAN,MAAwB;AAAA,EACpB,qBAAqB;AAAA,EACrB,mBAAmB;AAAA,EAE5B,IAAI,WAAmC;AACrC,IAAAC,YAAW;AACX,WAAO,oBAAoB;AAAA,EAC7B;AAAA,EAEA,YAAY,MAAsB;AAChC,WAAOA,YAAW,EAAE,OAAO,IAAI,EAAE;AAAA,EACnC;AAAA;AAAA,EAGA,QAAc;AACZ,QAAID,UAAS;AACX,MAAAA,SAAQ,KAAK;AACb,MAAAA,WAAU;AAAA,IACZ;AACA,uBAAmB;AAAA,EACrB;AACF;;;AFeA,IAAM,gCAAgC;AACtC,IAAM,sBAAsB;AAE5B,IAAM,yBAAyD;AAAA,EAC7D,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,SAAS;AACX;AAEA,IAAM,wBAAwD;AAAA,EAC5D,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,SAAS;AACX;AAEA,IAAM,mBAAmD;AAAA,EACvD,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,SAAS;AACX;AAEA,IAAM,gBAAgB,IAAI,mBAAmB;AAC7C,IAAM,eAAe,IAAI,kBAAkB;AAMpC,SAAS,gBAAsB;AACpC,gBAAc,MAAM;AACpB,eAAa,MAAM;AACrB;AAEA,SAAS,gBAAgB,UAAyC;AAChE,MAAI,aAAa,eAAe;AAC9B,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEA,SAAS,sBAAsB,MAAsB;AACnD,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO;AAAA,EACT;AAEA,SAAO,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,SAAS,CAAC,CAAC;AAC/C;AAEA,SAAS,wBAAwB,MAAc,SAAyC;AACtF,MAAI;AACF,WAAO;AAAA,MACL,QAAQ,QAAQ,YAAY,IAAI;AAAA,MAChC,cAAc;AAAA,IAChB;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,MACL,QAAQ,sBAAsB,IAAI;AAAA,MAClC,cAAc;AAAA,IAChB;AAAA,EACF;AACF;AAEA,SAAS,6BACP,oBACA,oBACgB;AAChB,SAAO,iBAAiB,kBAAkB,KAAK,iBAAiB,kBAAkB,IAC9E,qBACA;AACN;AAEA,SAAS,MAAM,OAAe,KAAa,KAAqB;AAC9D,MAAI,QAAQ,KAAK;AACf,WAAO;AAAA,EACT;AAEA,MAAI,QAAQ,KAAK;AACf,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEA,SAAS,sBAAsB,YAA4B;AACzD,SAAO,WAAW,UAAU,IAAI,aAAa,QAAQ,QAAQ,IAAI,GAAG,UAAU;AAChF;AAEA,SAAS,cAAc,OAAwB;AAC7C,MAAI;AACF,UAAM,aAAa,KAAK,UAAU,KAAK;AACvC,WAAO,cAAc;AAAA,EACvB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,gBACb,YACA,SAC4B;AAC5B,QAAM,eAAe,sBAAsB,UAAU;AAErD,MAAI;AACF,UAAM,UAAU,MAAM,SAAS,cAAc,MAAM;AACnD,UAAM,UAAU,wBAAwB,SAAS,OAAO;AAExD,WAAO;AAAA,MACL,GAAG;AAAA,MACH,SAAS;AAAA,IACX;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,cAAc;AAAA,MACd,SAAS;AAAA,IACX;AAAA,EACF;AACF;AAEA,eAAsB,eACpB,MACA,UACwB;AACxB,QAAM,UAAU,gBAAgB,QAAQ;AACxC,QAAM,oBAAoB,CAAC,GAAG,IAAI,IAAI,KAAK,WAAW,CAAC;AAEvD,QAAM,YAAY,IAAI,OAAO,EAAE,aAAa,GAAG,CAAC;AAChD,QAAM,cAAc,MAAM,QAAQ;AAAA,IAChC,kBAAkB;AAAA,MAAI,CAAC,eACrB,UAAU,IAAI,MAAM,gBAAgB,YAAY,OAAO,CAAC;AAAA,IAC1D;AAAA,EACF;AAEA,QAAM,oBAAoB,kBAAkB,KAAK,IAAI;AACrD,QAAM,qBAAqB,wBAAwB,mBAAmB,OAAO;AAE7E,QAAM,gBACJ,mBAAmB,SAAS,YAAY,OAAO,CAAC,KAAK,WAAW,MAAM,OAAO,QAAQ,CAAC;AAExF,QAAM,aAAa;AAAA,IACjB,YAAY,KAAK,EAAE;AAAA,IACnB,UAAU,KAAK,KAAK;AAAA,IACpB,WAAW,KAAK,MAAM;AAAA,IACtB,aAAa,KAAK,QAAQ;AAAA,IAC1B;AAAA,EAAiB,KAAK,WAAW;AAAA,IACjC;AAAA,EAAkB,kBAAkB,KAAK,IAAI,KAAK,QAAQ;AAAA,IAC1D,aAAa,cAAc,KAAK,QAAQ,CAAC;AAAA,EAC3C,EAAE,KAAK,MAAM;AAEb,QAAM,qBAAqB,wBAAwB,YAAY,OAAO;AACtE,QAAM,eAAe,QAAQ,qBAAqB,mBAAmB;AAErE,QAAM,qBAAqB,sBAAsB,IAAI;AACrD,QAAM,sBAAsB,6BAA6B,KAAK,YAAY,kBAAkB;AAC5F,QAAM,uBAAuB,KAAK;AAAA,IAChC,gBAAgB,uBAAuB,mBAAmB;AAAA,EAC5D;AAEA,QAAM,iBAAiB,gBAAgB,eAAe;AACtD,QAAM,uBAAuB,KAAK,KAAK,iBAAiB,6BAA6B;AAErF,QAAM,eACJ,mBAAmB,gBACnB,mBAAmB,gBACnB,YAAY,KAAK,CAAC,WAAW,OAAO,YAAY;AAElD,QAAM,mBAAmB,YAAY,OAAO,CAAC,WAAW,OAAO,OAAO,EAAE;AAExE,MAAI,aAAa,sBAAsB,mBAAmB;AAC1D,MAAI,cAAc;AAChB,iBAAa,KAAK,IAAI,YAAY,mBAAmB;AAAA,EACvD;AAEA,MAAI,mBAAmB,GAAG;AACxB,kBAAc,KAAK,IAAI,MAAM,mBAAmB,IAAI;AAAA,EACtD;AAEA,MAAI,kBAAkB,WAAW,GAAG;AAClC,kBAAc;AAAA,EAChB;AAEA,MAAI,KAAK,eAAe,oBAAoB;AAC1C,kBAAc;AAAA,EAChB;AAEA,QAAM,WAAW,wBAAwB,QAAQ;AAEjD,SAAO;AAAA,IACL,QAAQ,KAAK;AAAA,IACb,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY,MAAM,YAAY,KAAK,IAAI;AAAA,IACvC;AAAA,EACF;AACF;AAIA,IAAM,wBAAwB;AAM9B,eAAsB,mBAAmB,MAAY,UAA4C;AAC/F,MAAI,KAAK,SAAS,WAAW,GAAG;AAC9B,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,IAAI,OAAO,EAAE,aAAa,GAAG,CAAC;AAChD,QAAM,mBAAmB,MAAM,QAAQ;AAAA,IACrC,KAAK,SAAS;AAAA,MAAI,CAAC,SACjB,UAAU,IAAI,MAAM,eAAe,MAAM,QAAQ,CAAC;AAAA,IACpD;AAAA,EACF;AAEA,QAAM,eAAe,iBAAiB;AAAA,IACpC,CAAC,KAAK,aAAa,MAAM,SAAS;AAAA,IAClC;AAAA,EACF;AAEA,SAAO,KAAK,KAAK,eAAe,qBAAqB;AACvD;;;AGlSA,IAAM,0BAA0B;AAChC,IAAM,2BAA2B;AACjC,IAAM,2BAA2B;AAyBjC,SAAS,gBAAgB,QAAwB;AAC/C,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,GAAG;AAC3C,WAAO;AAAA,EACT;AAEA,SAAO,KAAK,MAAM,MAAM;AAC1B;AAEA,SAAS,oBAAoB,MAA2B;AACtD,SAAO;AAAA,IACL,QAAQ,KAAK;AAAA,IACb,YAAY;AAAA,IACZ,eAAe;AAAA,IACf,cAAc;AAAA,IACd,sBAAsB;AAAA,IACtB,sBAAsB,OAAO;AAAA,IAC7B,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AACF;AAEA,SAAS,uBACP,MACA,UACA,iBAC4B;AAC5B,MAAI,CAAC,SAAS,UAAU;AACtB,WAAO;AAAA,EACT;AAEA,MAAI,SAAS,aAAa,0BAA0B;AAClD,WAAO;AAAA,EACT;AAEA,MACE,KAAK,eAAe,aACpB,kBAAkB,KAClB,SAAS,uBAAuB,kBAAkB,0BAClD;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEA,SAAS,wBAAwB,MAAY,UAAiC;AAC5E,MAAI,SAAS,wBAAwB,GAAG;AACtC,WAAO,KAAK;AAAA,EACd;AAEA,SAAO,KAAK,WAAW,SAAS;AAClC;AAEO,SAAS,mBACd,OACA,WACA,QACe;AACf,QAAM,cAAc,gBAAgB,MAAM;AAC1C,QAAM,gBAAgB,KAAK,MAAM,cAAc,uBAAuB;AACtE,QAAM,kBAAkB,KAAK,IAAI,GAAG,cAAc,aAAa;AAE/D,QAAM,gBAAgD,CAAC;AACvD,QAAM,aAA8B,CAAC;AAErC,aAAW,QAAQ,OAAO;AACxB,UAAM,WAAW,UAAU,IAAI,KAAK,EAAE,KAAK,oBAAoB,IAAI;AACnE,UAAM,SAAS,uBAAuB,MAAM,UAAU,eAAe;AAErE,QAAI,QAAQ;AACV,oBAAc,KAAK,EAAE,MAAM,UAAU,OAAO,CAAC;AAC7C;AAAA,IACF;AAEA,eAAW,KAAK,EAAE,MAAM,SAAS,CAAC;AAAA,EACpC;AAEA,aAAW,KAAK,CAAC,MAAM,UAAU;AAC/B,UAAM,kBACJ,wBAAwB,MAAM,MAAM,MAAM,QAAQ,IAClD,wBAAwB,KAAK,MAAM,KAAK,QAAQ;AAElD,QAAI,oBAAoB,GAAG;AACzB,aAAO;AAAA,IACT;AAEA,UAAM,qBAAqB,MAAM,KAAK,WAAW,KAAK,KAAK;AAC3D,QAAI,uBAAuB,GAAG;AAC5B,aAAO;AAAA,IACT;AAEA,WAAO,KAAK,SAAS,uBAAuB,MAAM,SAAS;AAAA,EAC7D,CAAC;AAED,QAAM,gBAAgD,CAAC;AACvD,MAAI,aAAa;AAEjB,aAAW,aAAa,YAAY;AAClC,UAAM,iBAAiB,aAAa,UAAU,SAAS;AAEvD,QAAI,kBAAkB,iBAAiB;AACrC,mBAAa;AACb,oBAAc,KAAK;AAAA,QACjB,MAAM,UAAU;AAAA,QAChB,UAAU,UAAU;AAAA,QACpB,sBAAsB;AAAA,MACxB,CAAC;AACD;AAAA,IACF;AAEA,kBAAc,KAAK;AAAA,MACjB,MAAM,UAAU;AAAA,MAChB,UAAU,UAAU;AAAA,MACpB,QAAQ;AAAA,IACV,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB,KAAK,IAAI,GAAG,kBAAkB,UAAU;AAAA,EAC3D;AACF;AAyBO,SAAS,uBAAuB,OAAe,QAAmC;AACvF,QAAM,cAAc,gBAAgB,MAAM;AAC1C,QAAM,gBAAgB,KAAK,MAAM,cAAc,uBAAuB;AACtE,QAAM,kBAAkB,KAAK,IAAI,GAAG,cAAc,aAAa;AAG/D,QAAM,SAAS,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AAEhE,QAAM,gBAAoD,CAAC;AAC3D,QAAM,gBAAoD,CAAC;AAC3D,MAAI,aAAa;AAEjB,aAAW,QAAQ,QAAQ;AACzB,UAAM,SAAS,KAAK;AACpB,UAAM,iBAAiB,aAAa;AAEpC,QAAI,kBAAkB,iBAAiB;AACrC,mBAAa;AACb,oBAAc,KAAK;AAAA,QACjB;AAAA,QACA,iBAAiB;AAAA,QACjB,sBAAsB;AAAA,MACxB,CAAC;AAAA,IACH,OAAO;AACL,oBAAc,KAAK;AAAA,QACjB;AAAA,QACA,iBAAiB;AAAA,QACjB,QAAQ;AAAA,MACV,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB,KAAK,IAAI,GAAG,kBAAkB,UAAU;AAAA,EAC3D;AACF;","names":["get_encoding","encoder","getEncoder"]}

package/dist/chunk-6A37SKAJ.js

@@ -0,0 +1,58 @@
+// src/core/memory.ts
+var DEFAULT_PRESSURE_RATIO = 0.85;
+function getMemorySnapshot(pressureRatio = DEFAULT_PRESSURE_RATIO) {
+  const mem = process.memoryUsage();
+  const heapUsedMB = mem.heapUsed / 1048576;
+  const heapTotalMB = mem.heapTotal / 1048576;
+  const rssUsedMB = mem.rss / 1048576;
+  const heapPressure = mem.heapTotal > 0 ? mem.heapUsed / mem.heapTotal : 0;
+  return {
+    heapUsedMB: Math.round(heapUsedMB * 10) / 10,
+    heapTotalMB: Math.round(heapTotalMB * 10) / 10,
+    rssUsedMB: Math.round(rssUsedMB * 10) / 10,
+    heapPressure: Math.round(heapPressure * 1e3) / 1e3,
+    isUnderPressure: heapPressure >= pressureRatio
+  };
+}
+function createMemoryMonitor(options) {
+  const intervalMs = options.intervalMs ?? 5e3;
+  const pressureRatio = options.pressureRatio ?? DEFAULT_PRESSURE_RATIO;
+  let wasPressured = false;
+  const timer = setInterval(() => {
+    const snapshot = getMemorySnapshot(pressureRatio);
+    if (snapshot.isUnderPressure && !wasPressured) {
+      wasPressured = true;
+      options.onPressure(snapshot);
+    } else if (!snapshot.isUnderPressure && wasPressured) {
+      wasPressured = false;
+      options.onRelief?.(snapshot);
+    }
+  }, intervalMs);
+  if (typeof timer === "object" && "unref" in timer) {
+    timer.unref();
+  }
+  return {
+    stop() {
+      clearInterval(timer);
+    }
+  };
+}
+
+// src/core/utils.ts
+function truncate(value, maxLength, ellipsis = "\u2026") {
+  if (value.length <= maxLength) {
+    return value;
+  }
+  return `${value.slice(0, Math.max(0, maxLength - ellipsis.length))}${ellipsis}`;
+}
+function isRecord(value) {
+  return typeof value === "object" && value !== null;
+}
+
+export {
+  getMemorySnapshot,
+  createMemoryMonitor,
+  truncate,
+  isRecord
+};
+//# sourceMappingURL=chunk-6A37SKAJ.js.map

package/dist/chunk-6A37SKAJ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/memory.ts","../src/core/utils.ts"],"sourcesContent":["/**\n * Memory pressure monitoring utilities.\n *\n * Provides lightweight heap-usage checks that callers can use to\n * throttle work when the process is approaching memory limits.\n */\n\n/** Default threshold: pause work when heap usage exceeds 85% of the limit. */\nconst DEFAULT_PRESSURE_RATIO = 0.85;\n\nexport interface MemorySnapshot {\n  heapUsedMB: number;\n  heapTotalMB: number;\n  rssUsedMB: number;\n  /** Ratio of heapUsed / heapTotal (0–1). */\n  heapPressure: number;\n  /** True when heapPressure exceeds the configured threshold. */\n  isUnderPressure: boolean;\n}\n\n/**\n * Take a snapshot of current memory usage.\n *\n * @param pressureRatio - Threshold ratio (0–1) above which `isUnderPressure`\n *   is set to `true`. Defaults to 0.85.\n */\nexport function getMemorySnapshot(pressureRatio = DEFAULT_PRESSURE_RATIO): MemorySnapshot {\n  const mem = process.memoryUsage();\n  const heapUsedMB = mem.heapUsed / 1_048_576;\n  const heapTotalMB = mem.heapTotal / 1_048_576;\n  const rssUsedMB = mem.rss / 1_048_576;\n  const heapPressure = mem.heapTotal > 0 ? mem.heapUsed / mem.heapTotal : 0;\n\n  return {\n    heapUsedMB: Math.round(heapUsedMB * 10) / 10,\n    heapTotalMB: Math.round(heapTotalMB * 10) / 10,\n    rssUsedMB: Math.round(rssUsedMB * 10) / 10,\n    heapPressure: Math.round(heapPressure * 1000) / 1000,\n    isUnderPressure: heapPressure >= pressureRatio,\n  };\n}\n\n/**\n * Creates a monitor that periodically checks memory pressure and calls\n * `onPressure` when the threshold is exceeded.  The monitor can be used\n * to pause a PQueue or reduce concurrency under load.\n *\n * Returns a `stop` function to clear the interval.\n */\nexport function createMemoryMonitor(options: {\n  /** Polling interval in milliseconds (default: 5 000). */\n  intervalMs?: number;\n  /** Heap pressure ratio threshold (default: 0.85). */\n  pressureRatio?: number;\n  /** Called when heap pressure exceeds the threshold. */\n  onPressure: (snapshot: MemorySnapshot) => void;\n  /** Called when heap pressure drops back below the threshold. */\n  onRelief?: (snapshot: MemorySnapshot) => void;\n}): { stop: () => void } {\n  const intervalMs = options.intervalMs ?? 5_000;\n  const pressureRatio = options.pressureRatio ?? DEFAULT_PRESSURE_RATIO;\n  let wasPressured = false;\n\n  const timer = setInterval(() => {\n    const snapshot = getMemorySnapshot(pressureRatio);\n\n    if (snapshot.isUnderPressure && !wasPressured) {\n      wasPressured = true;\n      options.onPressure(snapshot);\n    } else if (!snapshot.isUnderPressure && wasPressured) {\n      wasPressured = false;\n      options.onRelief?.(snapshot);\n    }\n  }, intervalMs);\n\n  // Unref so this doesn't keep the process alive\n  if (typeof timer === \"object\" && \"unref\" in timer) {\n    timer.unref();\n  }\n\n  return {\n    stop() {\n      clearInterval(timer);\n    },\n  };\n}\n\n","/**\n * Shared utility functions used across the codebase.\n */\n\n/**\n * Truncate a string to `maxLength`, appending an ellipsis when trimmed.\n * Defaults to the unicode ellipsis `\"…\"` (1 char).  Pass `\"...\"` for the\n * three-dot ASCII variant.\n */\nexport function truncate(\n  value: string,\n  maxLength: number,\n  ellipsis = \"…\",\n): string {\n  if (value.length <= maxLength) {\n    return value;\n  }\n  return `${value.slice(0, Math.max(0, maxLength - ellipsis.length))}${ellipsis}`;\n}\n\n/**\n * Type guard: returns `true` when `value` is a non-null object\n * (i.e.\\ a `Record<string, unknown>`).\n */\nexport function isRecord(value: unknown): value is Record<string, unknown> {\n  return typeof value === \"object\" && value !== null;\n}\n\n"],"mappings":";AAQA,IAAM,yBAAyB;AAkBxB,SAAS,kBAAkB,gBAAgB,wBAAwC;AACxF,QAAM,MAAM,QAAQ,YAAY;AAChC,QAAM,aAAa,IAAI,WAAW;AAClC,QAAM,cAAc,IAAI,YAAY;AACpC,QAAM,YAAY,IAAI,MAAM;AAC5B,QAAM,eAAe,IAAI,YAAY,IAAI,IAAI,WAAW,IAAI,YAAY;AAExE,SAAO;AAAA,IACL,YAAY,KAAK,MAAM,aAAa,EAAE,IAAI;AAAA,IAC1C,aAAa,KAAK,MAAM,cAAc,EAAE,IAAI;AAAA,IAC5C,WAAW,KAAK,MAAM,YAAY,EAAE,IAAI;AAAA,IACxC,cAAc,KAAK,MAAM,eAAe,GAAI,IAAI;AAAA,IAChD,iBAAiB,gBAAgB;AAAA,EACnC;AACF;AASO,SAAS,oBAAoB,SASX;AACvB,QAAM,aAAa,QAAQ,cAAc;AACzC,QAAM,gBAAgB,QAAQ,iBAAiB;AAC/C,MAAI,eAAe;AAEnB,QAAM,QAAQ,YAAY,MAAM;AAC9B,UAAM,WAAW,kBAAkB,aAAa;AAEhD,QAAI,SAAS,mBAAmB,CAAC,cAAc;AAC7C,qBAAe;AACf,cAAQ,WAAW,QAAQ;AAAA,IAC7B,WAAW,CAAC,SAAS,mBAAmB,cAAc;AACpD,qBAAe;AACf,cAAQ,WAAW,QAAQ;AAAA,IAC7B;AAAA,EACF,GAAG,UAAU;AAGb,MAAI,OAAO,UAAU,YAAY,WAAW,OAAO;AACjD,UAAM,MAAM;AAAA,EACd;AAEA,SAAO;AAAA,IACL,OAAO;AACL,oBAAc,KAAK;AAAA,IACrB;AAAA,EACF;AACF;;;AC5EO,SAAS,SACd,OACA,WACA,WAAW,UACH;AACR,MAAI,MAAM,UAAU,WAAW;AAC7B,WAAO;AAAA,EACT;AACA,SAAO,GAAG,MAAM,MAAM,GAAG,KAAK,IAAI,GAAG,YAAY,SAAS,MAAM,CAAC,CAAC,GAAG,QAAQ;AAC/E;AAMO,SAAS,SAAS,OAAkD;AACzE,SAAO,OAAO,UAAU,YAAY,UAAU;AAChD;","names":[]}