@codeledger/engine 0.7.0

package/dist/ecl/ledger.js

@@ -0,0 +1,235 @@
+/**
+ * ECL-Lite — Local Context Ledger
+ *
+ * Provides persistent institutional memory for CodeLedger. Records every
+ * execution cycle to `.codeledger/ecl-lite.jsonl` (JSON Lines, append-only).
+ *
+ * Responsibilities:
+ * - Append execution outcomes (success/failure + context used)
+ * - Build and query success/failure indexes
+ * - Expose ledger status, inspection, and pruning
+ *
+ * Format: JSON Lines — one EclLiteEntry per line. Human-readable, no SQLite
+ * dependency. Safe for concurrent reads; single-writer append model.
+ *
+ * Deterministic: integer weights only, no floats in the index.
+ */
+import { readFileSync, writeFileSync, appendFileSync, existsSync, mkdirSync } from 'fs';
+import { join, dirname } from 'path';
+import { createHash } from 'crypto';
+// ─── Constants ────────────────────────────────────────────────────────────────
+export const ECL_FILENAME = 'ecl-lite.jsonl';
+const MAX_ENTRIES_DEFAULT = 2000;
+// ─── Public API ───────────────────────────────────────────────────────────────
+/** Derive the ECL-lite path for a given repo root */
+export function eclPath(repoRoot) {
+    return join(repoRoot, '.codeledger', ECL_FILENAME);
+}
+/**
+ * Append a new execution cycle entry to the ledger.
+ * Creates the file (and `.codeledger/` dir) if they don't exist.
+ */
+export function recordExecution(repoRoot, entry) {
+    const path = eclPath(repoRoot);
+    ensureDir(dirname(path));
+    appendFileSync(path, JSON.stringify(entry) + '\n', 'utf-8');
+}
+/**
+ * Build an EclLiteEntry from the inputs of a completed execution cycle.
+ * Computes the contextHash deterministically from the sorted file list.
+ */
+export function buildEntry(intentSignature, files, symbols, expansionLevel, outcome, confidenceScore, failureVector, intentCategory) {
+    const sorted = [...files].sort();
+    const contextHash = createHash('sha256')
+        .update(sorted.join('\n'))
+        .digest('hex')
+        .slice(0, 16);
+    return {
+        intentSignature,
+        timestamp: Date.now(),
+        files: sorted,
+        symbols: [...new Set(symbols)].sort(),
+        expansionLevel,
+        outcome,
+        failureVector,
+        contextHash,
+        confidenceScore,
+        intentCategory,
+    };
+}
+/**
+ * Load all entries from the ledger.
+ * Returns empty array if ledger does not exist or is malformed.
+ */
+export function loadEntries(repoRoot) {
+    const path = eclPath(repoRoot);
+    if (!existsSync(path))
+        return [];
+    const lines = readFileSync(path, 'utf-8').split('\n').filter((l) => l.trim());
+    const entries = [];
+    for (const line of lines) {
+        try {
+            entries.push(JSON.parse(line));
+        }
+        catch {
+            // Skip malformed lines — ledger is append-only; partial writes can corrupt a line
+        }
+    }
+    return entries;
+}
+/**
+ * Build the success/failure weight index from ledger entries.
+ *
+ * Uses integer arithmetic only — deterministic, no floats.
+ * successWeight++ on each success, failureWeight++ on each failure.
+ */
+export function buildWeightIndex(entries) {
+    const index = new Map();
+    for (const entry of entries) {
+        const existing = index.get(entry.intentSignature) ?? {
+            intentSignature: entry.intentSignature,
+            successWeight: 0,
+            failureWeight: 0,
+            lastUpdated: 0,
+        };
+        if (entry.outcome === 'success') {
+            existing.successWeight++;
+        }
+        else {
+            existing.failureWeight++;
+        }
+        existing.lastUpdated = Math.max(existing.lastUpdated, entry.timestamp);
+        index.set(entry.intentSignature, existing);
+    }
+    return index;
+}
+/**
+ * Compute the historical success rate for an intent signature.
+ * Returns 0.5 (neutral) if no history exists.
+ */
+export function historicalSuccessRate(entries, intentSignature) {
+    return historicalSuccessContext(entries, intentSignature).rate;
+}
+/**
+ * Returns both the historical success rate AND the sample size used.
+ *
+ * Falls back to category-level aggregation when the specific intent signature
+ * has < 5 entries — avoids early-data noise from single-entry signatures.
+ *
+ * Priority:
+ *   1. Exact intentSignature match (>= 5 entries) → specific rate
+ *   2. intentCategory match (< 5 exact OR no exact) → category rate
+ *   3. No data → 0.5 neutral prior
+ */
+export function historicalSuccessContext(entries, intentSignature, intentCategory) {
+    const exact = entries.filter((e) => e.intentSignature === intentSignature);
+    if (exact.length >= 5) {
+        const successes = exact.filter((e) => e.outcome === 'success').length;
+        return { rate: successes / exact.length, sampleSize: exact.length };
+    }
+    // Fall back to category if available
+    if (intentCategory && intentCategory !== 'general_task') {
+        const byCategory = entries.filter((e) => e.intentCategory === intentCategory);
+        if (byCategory.length > 0) {
+            const successes = byCategory.filter((e) => e.outcome === 'success').length;
+            return { rate: successes / byCategory.length, sampleSize: byCategory.length };
+        }
+    }
+    // Exact match exists but < 5 — still use it (better than nothing), report small size
+    if (exact.length > 0) {
+        const successes = exact.filter((e) => e.outcome === 'success').length;
+        return { rate: successes / exact.length, sampleSize: exact.length };
+    }
+    return { rate: 0.5, sampleSize: 0 }; // neutral prior
+}
+/**
+ * Build the failure hotspot index — files frequently implicated in failures.
+ * Returns hotspots sorted by implicationRate descending.
+ *
+ * v2.1.1: tracks lastFailureTimestamp per file for recency decay in slice-builder.
+ */
+export function buildFailureHotspots(entries) {
+    const failCounts = new Map();
+    const successCounts = new Map();
+    const lastFailTs = new Map();
+    for (const entry of entries) {
+        const implicated = entry.failureVector?.implicated_files ?? [];
+        if (entry.outcome === 'failure') {
+            for (const f of implicated) {
+                failCounts.set(f, (failCounts.get(f) ?? 0) + 1);
+                // Track the most recent failure timestamp for recency decay
+                const prev = lastFailTs.get(f) ?? 0;
+                if (entry.timestamp > prev)
+                    lastFailTs.set(f, entry.timestamp);
+            }
+        }
+        else {
+            // Files in successful bundles count as "success context"
+            for (const f of entry.files) {
+                successCounts.set(f, (successCounts.get(f) ?? 0) + 1);
+            }
+        }
+    }
+    const hotspots = [];
+    for (const [file, failureCount] of failCounts) {
+        const successCount = successCounts.get(file) ?? 0;
+        const total = failureCount + successCount;
+        hotspots.push({
+            file,
+            failureCount,
+            successCount,
+            implicationRate: total > 0 ? failureCount / total : 0,
+            lastFailureTimestamp: lastFailTs.get(file) ?? 0,
+        });
+    }
+    return hotspots.sort((a, b) => b.implicationRate - a.implicationRate);
+}
+/**
+ * Compute overall ledger status summary.
+ */
+export function ledgerStatus(repoRoot) {
+    const path = eclPath(repoRoot);
+    const entries = loadEntries(repoRoot);
+    const successes = entries.filter((e) => e.outcome === 'success').length;
+    const failures = entries.filter((e) => e.outcome === 'failure').length;
+    const total = entries.length;
+    const uniqueSigs = new Set(entries.map((e) => e.intentSignature)).size;
+    const lastEntry = entries[entries.length - 1];
+    return {
+        entry_count: total,
+        success_count: successes,
+        failure_count: failures,
+        overall_success_rate: total > 0 ? successes / total : 0,
+        top_failure_hotspots: buildFailureHotspots(entries).slice(0, 10),
+        unique_intent_signatures: uniqueSigs,
+        ledger_path: path,
+        last_entry_at: lastEntry
+            ? new Date(lastEntry.timestamp).toISOString()
+            : null,
+    };
+}
+/**
+ * Prune old entries to keep the ledger bounded.
+ * Keeps the most recent `maxEntries` entries (default 2000).
+ * Rewrites the entire file atomically (temp-write then rename not available
+ * in pure Node fs sync, so writes to path directly).
+ */
+export function pruneLedger(repoRoot, maxEntries = MAX_ENTRIES_DEFAULT) {
+    const path = eclPath(repoRoot);
+    if (!existsSync(path))
+        return 0;
+    const entries = loadEntries(repoRoot);
+    if (entries.length <= maxEntries)
+        return 0;
+    const pruned = entries.length - maxEntries;
+    const kept = entries.slice(-maxEntries);
+    writeFileSync(path, kept.map((e) => JSON.stringify(e)).join('\n') + '\n', 'utf-8');
+    return pruned;
+}
+// ─── Helpers ──────────────────────────────────────────────────────────────────
+function ensureDir(dir) {
+    if (!existsSync(dir)) {
+        mkdirSync(dir, { recursive: true });
+    }
+}
+//# sourceMappingURL=ledger.js.map

package/dist/ecl/ledger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ledger.js","sourceRoot":"","sources":["../../src/ecl/ledger.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC;AACxF,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AACrC,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AASpC,iFAAiF;AAEjF,MAAM,CAAC,MAAM,YAAY,GAAG,gBAAgB,CAAC;AAC7C,MAAM,mBAAmB,GAAG,IAAI,CAAC;AAEjC,iFAAiF;AAEjF,qDAAqD;AACrD,MAAM,UAAU,OAAO,CAAC,QAAgB;IACtC,OAAO,IAAI,CAAC,QAAQ,EAAE,aAAa,EAAE,YAAY,CAAC,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,QAAgB,EAAE,KAAmB;IACnE,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC/B,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IACzB,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC;AAC9D,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CACxB,eAAuB,EACvB,KAAe,EACf,OAAiB,EACjB,cAAsB,EACtB,OAA8B,EAC9B,eAAuB,EACvB,aAA4D,EAC5D,cAAuB;IAEvB,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IACjC,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,CAAC;SACrC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACzB,MAAM,CAAC,KAAK,CAAC;SACb,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEhB,OAAO;QACL,eAAe;QACf,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;QACrB,KAAK,EAAE,MAAM;QACb,OAAO,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE;QACrC,cAAc;QACd,OAAO;QACP,aAAa;QACb,WAAW;QACX,eAAe;QACf,cAAc;KACf,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,QAAgB;IAC1C,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC/B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAEjC,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9E,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC;YACH,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAiB,CAAC,CAAC;QACjD,CAAC;QAAC,MAAM,CAAC;YACP,kFAAkF;QACpF,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAuB;IACtD,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;IAEhD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI;YACnD,eAAe,EAAE,KAAK,CAAC,eAAe;YACtC,aAAa,EAAE,CAAC;YAChB,aAAa,EAAE,CAAC;YAChB,WAAW,EAAE,CAAC;SACf,CAAC;QAEF,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YAChC,QAAQ,CAAC,aAAa,EAAE,CAAC;QAC3B,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,aAAa,EAAE,CAAC;QAC3B,CAAC;QACD,QAAQ,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;QACvE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACnC,OAAuB,EACvB,eAAuB;IAEvB,OAAO,wBAAwB,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC,IAAI,CAAC;AACjE,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,wBAAwB,CACtC,OAAuB,EACvB,eAAuB,EACvB,cAAuB;IAEvB,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,KAAK,eAAe,CAAC,CAAC;IAE3E,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;QACtE,OAAO,EAAE,IAAI,EAAE,SAAS,GAAG,KAAK,CAAC,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;IACtE,CAAC;IAED,qCAAqC;IACrC,IAAI,cAAc,IAAI,cAAc,KAAK,cAAc,EAAE,CAAC;QACxD,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAC/B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,KAAK,cAAc,CAC3C,CAAC;QACF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;YAC3E,OAAO,EAAE,IAAI,EAAE,SAAS,GAAG,UAAU,CAAC,MAAM,EAAE,UAAU,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC;QAChF,CAAC;IACH,CAAC;IAED,qFAAqF;IACrF,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;QACtE,OAAO,EAAE,IAAI,EAAE,SAAS,GAAG,KAAK,CAAC,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;IACtE,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,gBAAgB;AACvD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,OAAuB;IAC1D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE7C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,KAAK,CAAC,aAAa,EAAE,gBAAgB,IAAI,EAAE,CAAC;QAC/D,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YAChC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;gBAC3B,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAChD,4DAA4D;gBAC5D,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACpC,IAAI,KAAK,CAAC,SAAS,GAAG,IAAI;oBAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;aAAM,CAAC;YACN,yDAAyD;YACzD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC5B,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,UAAU,EAAE,CAAC;QAC9C,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,MAAM,KAAK,GAAG,YAAY,GAAG,YAAY,CAAC;QAC1C,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI;YACJ,YAAY;YACZ,YAAY;YACZ,eAAe,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACrD,oBAAoB,EAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;SAChD,CAAC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC;AACxE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB;IAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC/B,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IAEtC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;IACxE,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;IACvE,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC;IAC7B,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC;IACvE,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE9C,OAAO;QACL,WAAW,EAAE,KAAK;QAClB,aAAa,EAAE,SAAS;QACxB,aAAa,EAAE,QAAQ;QACvB,oBAAoB,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvD,oBAAoB,EAAE,oBAAoB,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;QAChE,wBAAwB,EAAE,UAAU;QACpC,WAAW,EAAE,IAAI;QACjB,aAAa,EAAE,SAAS;YACtB,CAAC,CAAE,IAAI,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,WAAW,EAAkB;YAC9D,CAAC,CAAC,IAAI;KACT,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,QAAgB,EAAE,UAAU,GAAG,mBAAmB;IAC5E,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC/B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAEhC,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IACtC,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU;QAAE,OAAO,CAAC,CAAC;IAE3C,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,UAAU,CAAC;IAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;IACxC,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC;IACnF,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,iFAAiF;AAEjF,SAAS,SAAS,CAAC,GAAW;IAC5B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtC,CAAC;AACH,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,54 @@
+/**
+ * @codeledger/engine — Deterministic Context Orchestration Layer (DCOL)
+ *
+ * v2 subsystems:
+ *
+ * SCE (Structural Context Engine)
+ *   Symbol-level code analysis: build a symbol graph, then extract the
+ *   Minimal Sufficient Code Slice (MSCS) for a task. Reduces token usage
+ *   by including only symbols required for the task + their dependency chain.
+ *   Execution path signals: failure hotspots from ECL-Lite boost symbol ranking.
+ *
+ * IOLE (Intent & Outcome Loop Engine)
+ *   Eliminates agent drift: derive a stable intent signature, parse failure
+ *   vectors from test/build output, escalate context via the 4-level expansion
+ *   ladder, track outcome scores across iterations, and decompose intents into
+ *   structured IntentObjects for exemplar matching and cross-session comparison.
+ *
+ * ECL-Lite (Local Context Ledger)
+ *   Persistent institutional memory: records execution outcomes to
+ *   `.codeledger/ecl-lite.jsonl`, builds success/failure weight indexes, and
+ *   surfaces failure hotspots that feed back into SCE + IOLE.
+ *
+ * CCS (Context Confidence Score)
+ *   Pre-execution certification: deterministic [0,1] score from 5 factors
+ *   (dependency coverage, test coverage, historical success, symbol completeness,
+ *   expansion efficiency). Recommends proceed / expand / block before execution.
+ *
+ * ISC (Intent Sufficiency Check)
+ *   PRE-CONTEXT certification layer (v2.2). Evaluates task prompt quality
+ *   before context construction begins. Five-factor scoring (token signal,
+ *   operation clarity, domain clarity, target specificity, constraint presence)
+ *   gates the pipeline: SUFFICIENT / WEAK / INSUFFICIENT. Deterministic,
+ *   local-only, zero ML.
+ *
+ * Design principles (non-negotiable):
+ * - Deterministic > probabilistic
+ * - Minimal Sufficient Context (not maximum context)
+ * - Local-first, no external APIs
+ * - Bounded execution and termination guarantees
+ * - Outcome-aware: every execution cycle feeds back into future context selection
+ */
+export * from './sce/index.js';
+export * from './iole/index.js';
+export * from './ecl/index.js';
+export * from './ccs/index.js';
+export * from './isc/index.js';
+export * from './license/index.js';
+export * from './team-ledger/index.js';
+export * from './team-policy/index.js';
+export * from './team-metrics/index.js';
+export * from './provenance/index.js';
+export * from './policy-sim/index.js';
+export * from './orchestrator/index.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AAEH,cAAc,gBAAgB,CAAC;AAC/B,cAAc,iBAAiB,CAAC;AAChC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAG/B,cAAc,oBAAoB,CAAC;AAGnC,cAAc,wBAAwB,CAAC;AACvC,cAAc,wBAAwB,CAAC;AACvC,cAAc,yBAAyB,CAAC;AACxC,cAAc,uBAAuB,CAAC;AACtC,cAAc,uBAAuB,CAAC;AACtC,cAAc,yBAAyB,CAAC"}

package/dist/index.js

@@ -0,0 +1,56 @@
+/**
+ * @codeledger/engine — Deterministic Context Orchestration Layer (DCOL)
+ *
+ * v2 subsystems:
+ *
+ * SCE (Structural Context Engine)
+ *   Symbol-level code analysis: build a symbol graph, then extract the
+ *   Minimal Sufficient Code Slice (MSCS) for a task. Reduces token usage
+ *   by including only symbols required for the task + their dependency chain.
+ *   Execution path signals: failure hotspots from ECL-Lite boost symbol ranking.
+ *
+ * IOLE (Intent & Outcome Loop Engine)
+ *   Eliminates agent drift: derive a stable intent signature, parse failure
+ *   vectors from test/build output, escalate context via the 4-level expansion
+ *   ladder, track outcome scores across iterations, and decompose intents into
+ *   structured IntentObjects for exemplar matching and cross-session comparison.
+ *
+ * ECL-Lite (Local Context Ledger)
+ *   Persistent institutional memory: records execution outcomes to
+ *   `.codeledger/ecl-lite.jsonl`, builds success/failure weight indexes, and
+ *   surfaces failure hotspots that feed back into SCE + IOLE.
+ *
+ * CCS (Context Confidence Score)
+ *   Pre-execution certification: deterministic [0,1] score from 5 factors
+ *   (dependency coverage, test coverage, historical success, symbol completeness,
+ *   expansion efficiency). Recommends proceed / expand / block before execution.
+ *
+ * ISC (Intent Sufficiency Check)
+ *   PRE-CONTEXT certification layer (v2.2). Evaluates task prompt quality
+ *   before context construction begins. Five-factor scoring (token signal,
+ *   operation clarity, domain clarity, target specificity, constraint presence)
+ *   gates the pipeline: SUFFICIENT / WEAK / INSUFFICIENT. Deterministic,
+ *   local-only, zero ML.
+ *
+ * Design principles (non-negotiable):
+ * - Deterministic > probabilistic
+ * - Minimal Sufficient Context (not maximum context)
+ * - Local-first, no external APIs
+ * - Bounded execution and termination guarantees
+ * - Outcome-aware: every execution cycle feeds back into future context selection
+ */
+export * from './sce/index.js';
+export * from './iole/index.js';
+export * from './ecl/index.js';
+export * from './ccs/index.js';
+export * from './isc/index.js';
+// v2.4 — License verification (Ed25519 signed licenses)
+export * from './license/index.js';
+// v2.3 — Team + Enterprise Control Plane
+export * from './team-ledger/index.js';
+export * from './team-policy/index.js';
+export * from './team-metrics/index.js';
+export * from './provenance/index.js';
+export * from './policy-sim/index.js';
+export * from './orchestrator/index.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AAEH,cAAc,gBAAgB,CAAC;AAC/B,cAAc,iBAAiB,CAAC;AAChC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAE/B,wDAAwD;AACxD,cAAc,oBAAoB,CAAC;AAEnC,yCAAyC;AACzC,cAAc,wBAAwB,CAAC;AACvC,cAAc,wBAAwB,CAAC;AACvC,cAAc,yBAAyB,CAAC;AACxC,cAAc,uBAAuB,CAAC;AACtC,cAAc,uBAAuB,CAAC;AACtC,cAAc,yBAAyB,CAAC"}

package/dist/iole/expansion-ladder.d.ts

@@ -0,0 +1,51 @@
+/**
+ * IOLE — Context Expansion Ladder
+ *
+ * Implements deterministic context escalation when an agent is stuck.
+ * The ladder has 4 levels — each expands the context in a principled,
+ * bounded way. Escalation happens ONLY on confirmed failure; never randomly.
+ *
+ * Level 1: Minimal slice (seeds + immediate deps)
+ * Level 2: Add validation helpers + error infrastructure
+ * Level 3: Add upstream dependency chain (transitive)
+ * Level 4: Add architectural context (full module + tests)
+ *
+ * Deterministic: escalation triggered by failure count, not guesses.
+ */
+import type { ExpansionLevel, ExpansionLadderState, FailureVector } from '@codeledger/types';
+/**
+ * Initialize the expansion ladder for a new task.
+ */
+export declare function initExpansionLadder(task: string, intentHash: string): ExpansionLadderState;
+/**
+ * Record a completed iteration (pass or fail) and compute the next state.
+ *
+ * - On pass: mark resolved, stay at current level
+ * - On fail: increment failure counter; if threshold reached, escalate
+ */
+export declare function recordOutcome(state: ExpansionLadderState, passed: boolean, failureVector?: FailureVector): ExpansionLadderState;
+/**
+ * Get the expansion parameters for the current ladder level.
+ *
+ * These parameters are passed to the selector to widen context.
+ */
+export declare function getLevelParams(level: ExpansionLevel): LevelParams;
+/**
+ * Detect if the agent is stuck in a loop (no improvement across levels).
+ *
+ * Returns true if:
+ * - At max level AND still failing
+ * - OR the same failure hash has appeared 3+ times
+ */
+export declare function isStuck(state: ExpansionLadderState, failureHashes: string[]): boolean;
+export interface LevelParams {
+    description: string;
+    dependency_depth: number;
+    include_tests: boolean;
+    include_validation: boolean;
+    include_error_infra: boolean;
+    /** Multiplier applied to selector's default max_files */
+    max_files_multiplier: number;
+    scope: 'seeds_only' | 'seeds_plus_helpers' | 'full_dependency_chain' | 'full_module';
+}
+//# sourceMappingURL=expansion-ladder.d.ts.map

package/dist/iole/expansion-ladder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expansion-ladder.d.ts","sourceRoot":"","sources":["../../src/iole/expansion-ladder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EACV,cAAc,EACd,oBAAoB,EACpB,aAAa,EACd,MAAM,mBAAmB,CAAC;AAI3B;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,MAAM,GACjB,oBAAoB,CAWtB;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,oBAAoB,EAC3B,MAAM,EAAE,OAAO,EACf,aAAa,CAAC,EAAE,aAAa,GAC5B,oBAAoB,CAkCtB;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,cAAc,GAAG,WAAW,CA6CjE;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,EAAE,GAAG,OAAO,CAerF;AAoBD,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,OAAO,CAAC;IACvB,kBAAkB,EAAE,OAAO,CAAC;IAC5B,mBAAmB,EAAE,OAAO,CAAC;IAC7B,yDAAyD;IACzD,oBAAoB,EAAE,MAAM,CAAC;IAC7B,KAAK,EAAE,YAAY,GAAG,oBAAoB,GAAG,uBAAuB,GAAG,aAAa,CAAC;CACtF"}

package/dist/iole/expansion-ladder.js

@@ -0,0 +1,153 @@
+/**
+ * IOLE — Context Expansion Ladder
+ *
+ * Implements deterministic context escalation when an agent is stuck.
+ * The ladder has 4 levels — each expands the context in a principled,
+ * bounded way. Escalation happens ONLY on confirmed failure; never randomly.
+ *
+ * Level 1: Minimal slice (seeds + immediate deps)
+ * Level 2: Add validation helpers + error infrastructure
+ * Level 3: Add upstream dependency chain (transitive)
+ * Level 4: Add architectural context (full module + tests)
+ *
+ * Deterministic: escalation triggered by failure count, not guesses.
+ */
+// ─── Public API ───────────────────────────────────────────────────────────────
+/**
+ * Initialize the expansion ladder for a new task.
+ */
+export function initExpansionLadder(task, intentHash) {
+    return {
+        intent_hash: intentHash,
+        task,
+        current_level: 1,
+        max_level: 4,
+        iteration_count: 0,
+        failure_count: 0,
+        escalation_log: [],
+        resolved: false,
+    };
+}
+/**
+ * Record a completed iteration (pass or fail) and compute the next state.
+ *
+ * - On pass: mark resolved, stay at current level
+ * - On fail: increment failure counter; if threshold reached, escalate
+ */
+export function recordOutcome(state, passed, failureVector) {
+    const next = {
+        ...state,
+        iteration_count: state.iteration_count + 1,
+        escalation_log: [...state.escalation_log],
+    };
+    if (passed) {
+        next.resolved = true;
+        return next;
+    }
+    next.failure_count = state.failure_count + 1;
+    // Escalate if: failure threshold reached and not yet at max level
+    const threshold = escalationThreshold(state.current_level);
+    if (next.failure_count >= threshold && state.current_level < state.max_level) {
+        const reason = failureVector
+            ? `${failureVector.kind} after ${next.failure_count} failures`
+            : `${next.failure_count} consecutive failures`;
+        next.escalation_log.push({
+            from_level: state.current_level,
+            to_level: (state.current_level + 1),
+            at_iteration: next.iteration_count,
+            reason,
+            implicated_files: failureVector?.implicated_files ?? [],
+        });
+        next.current_level = (state.current_level + 1);
+        next.failure_count = 0; // reset per level
+    }
+    return next;
+}
+/**
+ * Get the expansion parameters for the current ladder level.
+ *
+ * These parameters are passed to the selector to widen context.
+ */
+export function getLevelParams(level) {
+    switch (level) {
+        case 1:
+            return {
+                description: 'Minimal slice — seeds + immediate dependencies',
+                dependency_depth: 1,
+                include_tests: false,
+                include_validation: false,
+                include_error_infra: false,
+                max_files_multiplier: 1.0,
+                scope: 'seeds_only',
+            };
+        case 2:
+            return {
+                description: 'Add validation helpers + error infrastructure',
+                dependency_depth: 2,
+                include_tests: false,
+                include_validation: true,
+                include_error_infra: true,
+                max_files_multiplier: 1.5,
+                scope: 'seeds_plus_helpers',
+            };
+        case 3:
+            return {
+                description: 'Add upstream dependency chain (transitive)',
+                dependency_depth: 4,
+                include_tests: true,
+                include_validation: true,
+                include_error_infra: true,
+                max_files_multiplier: 2.0,
+                scope: 'full_dependency_chain',
+            };
+        case 4:
+            return {
+                description: 'Full architectural context — complete module + tests',
+                dependency_depth: 8,
+                include_tests: true,
+                include_validation: true,
+                include_error_infra: true,
+                max_files_multiplier: 3.0,
+                scope: 'full_module',
+            };
+        default:
+            return getLevelParams(4);
+    }
+}
+/**
+ * Detect if the agent is stuck in a loop (no improvement across levels).
+ *
+ * Returns true if:
+ * - At max level AND still failing
+ * - OR the same failure hash has appeared 3+ times
+ */
+export function isStuck(state, failureHashes) {
+    if (state.current_level >= state.max_level && state.failure_count >= 2) {
+        return true;
+    }
+    // Detect repeated identical failures
+    const counts = new Map();
+    for (const h of failureHashes) {
+        counts.set(h, (counts.get(h) ?? 0) + 1);
+    }
+    for (const count of counts.values()) {
+        if (count >= 3)
+            return true;
+    }
+    return false;
+}
+// ─── Helpers ──────────────────────────────────────────────────────────────────
+/**
+ * How many failures at a given level before escalating.
+ * Lower levels escalate faster; level 3+ is patient.
+ */
+function escalationThreshold(level) {
+    switch (level) {
+        case 1: return 2; // escalate after 2 failures at level 1
+        case 2: return 3; // escalate after 3 failures at level 2
+        case 3: return 4; // escalate after 4 failures at level 3
+        case 4: return Infinity; // no further escalation — this is the ceiling
+        default: return 2;
+    }
+}
+//# sourceMappingURL=expansion-ladder.js.map

package/dist/iole/expansion-ladder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"expansion-ladder.js","sourceRoot":"","sources":["../../src/iole/expansion-ladder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAQH,iFAAiF;AAEjF;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAY,EACZ,UAAkB;IAElB,OAAO;QACL,WAAW,EAAE,UAAU;QACvB,IAAI;QACJ,aAAa,EAAE,CAAC;QAChB,SAAS,EAAE,CAAC;QACZ,eAAe,EAAE,CAAC;QAClB,aAAa,EAAE,CAAC;QAChB,cAAc,EAAE,EAAE;QAClB,QAAQ,EAAE,KAAK;KAChB,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC3B,KAA2B,EAC3B,MAAe,EACf,aAA6B;IAE7B,MAAM,IAAI,GAAyB;QACjC,GAAG,KAAK;QACR,eAAe,EAAE,KAAK,CAAC,eAAe,GAAG,CAAC;QAC1C,cAAc,EAAE,CAAC,GAAG,KAAK,CAAC,cAAc,CAAC;KAC1C,CAAC;IAEF,IAAI,MAAM,EAAE,CAAC;QACX,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,GAAG,CAAC,CAAC;IAE7C,kEAAkE;IAClE,MAAM,SAAS,GAAG,mBAAmB,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;IAC3D,IAAI,IAAI,CAAC,aAAa,IAAI,SAAS,IAAI,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;QAC7E,MAAM,MAAM,GAAG,aAAa;YAC1B,CAAC,CAAC,GAAG,aAAa,CAAC,IAAI,UAAU,IAAI,CAAC,aAAa,WAAW;YAC9D,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,uBAAuB,CAAC;QAEjD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;YACvB,UAAU,EAAE,KAAK,CAAC,aAAa;YAC/B,QAAQ,EAAE,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,CAAmB;YACrD,YAAY,EAAE,IAAI,CAAC,eAAe;YAClC,MAAM;YACN,gBAAgB,EAAE,aAAa,EAAE,gBAAgB,IAAI,EAAE;SACxD,CAAC,CAAC;QAEH,IAAI,CAAC,aAAa,GAAG,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,CAAmB,CAAC;QACjE,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,kBAAkB;IAC5C,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,KAAqB;IAClD,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,CAAC;YACJ,OAAO;gBACL,WAAW,EAAE,gDAAgD;gBAC7D,gBAAgB,EAAE,CAAC;gBACnB,aAAa,EAAE,KAAK;gBACpB,kBAAkB,EAAE,KAAK;gBACzB,mBAAmB,EAAE,KAAK;gBAC1B,oBAAoB,EAAE,GAAG;gBACzB,KAAK,EAAE,YAAY;aACpB,CAAC;QACJ,KAAK,CAAC;YACJ,OAAO;gBACL,WAAW,EAAE,+CAA+C;gBAC5D,gBAAgB,EAAE,CAAC;gBACnB,aAAa,EAAE,KAAK;gBACpB,kBAAkB,EAAE,IAAI;gBACxB,mBAAmB,EAAE,IAAI;gBACzB,oBAAoB,EAAE,GAAG;gBACzB,KAAK,EAAE,oBAAoB;aAC5B,CAAC;QACJ,KAAK,CAAC;YACJ,OAAO;gBACL,WAAW,EAAE,4CAA4C;gBACzD,gBAAgB,EAAE,CAAC;gBACnB,aAAa,EAAE,IAAI;gBACnB,kBAAkB,EAAE,IAAI;gBACxB,mBAAmB,EAAE,IAAI;gBACzB,oBAAoB,EAAE,GAAG;gBACzB,KAAK,EAAE,uBAAuB;aAC/B,CAAC;QACJ,KAAK,CAAC;YACJ,OAAO;gBACL,WAAW,EAAE,sDAAsD;gBACnE,gBAAgB,EAAE,CAAC;gBACnB,aAAa,EAAE,IAAI;gBACnB,kBAAkB,EAAE,IAAI;gBACxB,mBAAmB,EAAE,IAAI;gBACzB,oBAAoB,EAAE,GAAG;gBACzB,KAAK,EAAE,aAAa;aACrB,CAAC;QACJ;YACE,OAAO,cAAc,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,KAA2B,EAAE,aAAuB;IAC1E,IAAI,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,aAAa,IAAI,CAAC,EAAE,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,qCAAqC;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACpC,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;IAC9B,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,iFAAiF;AAEjF;;;GAGG;AACH,SAAS,mBAAmB,CAAC,KAAqB;IAChD,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,uCAAuC;QACzD,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,uCAAuC;QACzD,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,uCAAuC;QACzD,KAAK,CAAC,CAAC,CAAC,OAAO,QAAQ,CAAC,CAAC,8CAA8C;QACvE,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC;IACpB,CAAC;AACH,CAAC"}

package/dist/iole/failure-vector.d.ts

@@ -0,0 +1,21 @@
+/**
+ * IOLE — Failure Vector
+ *
+ * Parses agent execution failures (test output, stack traces, rejected diffs)
+ * into a structured FailureVector that the expansion ladder uses to determine
+ * which files to add in the next context iteration.
+ *
+ * Deterministic: parses raw strings, no ML, no embeddings.
+ */
+import type { FailureVector } from '@codeledger/types';
+/**
+ * Parse raw output strings into a structured FailureVector.
+ *
+ * Handles:
+ * - Test runner output (vitest, jest, mocha patterns)
+ * - Node.js/TypeScript stack traces
+ * - Build errors (tsc, esbuild)
+ * - Rejected diffs (conflict markers)
+ */
+export declare function parseFailureVector(outputs: string[]): FailureVector;
+//# sourceMappingURL=failure-vector.d.ts.map

package/dist/iole/failure-vector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"failure-vector.d.ts","sourceRoot":"","sources":["../../src/iole/failure-vector.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAe,MAAM,mBAAmB,CAAC;AAIpE;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,aAAa,CAsCnE"}