@jmtrin/opencode-kevin 1.2.0 → 1.3.0

package/dist/plugin/confidence.js

@@ -1,34 +0,0 @@
-// v0.4.0 (K4-010) — shared two-sided confidence formula.
-//
-// Confidence is derived from both positive evidence (confirmed fixes) and
-// negative evidence (recurrences): recurrence of the same fingerprint
-// DEMOTES a pattern's confidence, so that a "causal pattern" with a
-// history of recurring failures stops being presented as reliable.
-//
-//	confidence = clamp(0.5 + 0.1 * evidenceCount - 0.15 * recurrenceCount, 0.05, 0.95)
-//
-// Used by `MemoryService.promoteToPattern`, `MemoryService.mapRow` and
-// `kevin_why` — keep the formula here, never inline it again.
-//
-// v0.5.0 (K5-010 / plan §5.3, D5-02) — human feedback joins the formula as
-// a second, independent evidence axis. Steps are deliberately SMALLER than
-// the causal steps: feedback is sparse, one-sided, and judgemental, while
-// evidence_count counts confirmed, reproducible fixes. A single negative
-// verdict (0.1) can offset one confirmed fix (0.1), but cannot alone sink
-// a well-evidenced pattern — the causal evidence must agree (plan §5.3,
-// "feedback cannot override causal evidence, only nudge it").
-export const CONFIDENCE_MIN = 0.05;
-export const CONFIDENCE_MAX = 0.95;
-export const CONFIDENCE_BASE = 0.5;
-export const EVIDENCE_STEP = 0.1;
-export const RECURRENCE_PENALTY = 0.15;
-export const FEEDBACK_POSITIVE_STEP = 0.05;
-export const FEEDBACK_NEGATIVE_STEP = 0.1;
-export function computeConfidence(evidenceCount, recurrenceCount, positiveFeedback = 0, negativeFeedback = 0) {
-    const raw = CONFIDENCE_BASE +
-        EVIDENCE_STEP * evidenceCount -
-        RECURRENCE_PENALTY * recurrenceCount +
-        FEEDBACK_POSITIVE_STEP * positiveFeedback -
-        FEEDBACK_NEGATIVE_STEP * negativeFeedback;
-    return Math.min(CONFIDENCE_MAX, Math.max(CONFIDENCE_MIN, raw));
-}

package/dist/plugin/contract.d.ts

@@ -1,54 +0,0 @@
-export declare const CONTRACT_VERSION = 1;
-export type Stability = "frozen" | "forward-only";
-export interface ContractClause {
-    readonly id: string;
-    readonly title: string;
-    readonly stability: Stability;
-    readonly since: string;
-    readonly deprecated?: string;
-    readonly replacement?: string;
-    readonly value: unknown;
-}
-export interface PublicContract {
-    readonly contractVersion: number;
-    readonly clauses: readonly ContractClause[];
-}
-export interface ContractInput {
-    readonly packageName?: string;
-    readonly packageVersion?: string;
-}
-export declare const CONTRACT_TOOL_NAMES: readonly string[];
-/**
- * v1.0.0 (K10-018/K10-019 / plan §5.6) — tools added AFTER the initial
- * freeze, each carrying the `since` the deprecation policy requires. A
- * 1.x addition without an entry here fails the contract test as
- * added_bare.
- */
-export declare const CONTRACT_TOOL_ADDITIONS: readonly {
-    name: string;
-    since: string;
-}[];
-/**
- * v1.1.0 (K11-007 / plan §5.1, D11-01) — metric keys added after the freeze,
- * each carrying the `since` the deprecation policy requires (C-05).
- */
-export declare const CONTRACT_METRIC_ADDITIONS: readonly {
-    name: string;
-    since: string;
-}[];
-/**
- * v1.0.0 (K10-027 / plan §5.7) — the C-09 boundary addition. Stored is
- * not trusted: anything reaching an artifact or a prompt is escaped at
- * the single write path, according to its container.
- */
-export declare const BOUNDARY_INVARIANT = "untrusted-input escaping at the single write path";
-export declare function describeContract(_input?: ContractInput): PublicContract;
-export declare function contractDigest(c: PublicContract): string;
-export type ContractDiffKind = "removed" | "changed" | "added_ok" | "added_bare";
-export interface ContractDiff {
-    readonly clauseId: string;
-    readonly path: string;
-    readonly kind: ContractDiffKind;
-    readonly remedy: string;
-}
-export declare function diffContract(golden: PublicContract, live: PublicContract): readonly ContractDiff[];

package/dist/plugin/contract.js

@@ -1,386 +0,0 @@
-// v1.0.0 (K10-006 / plan §5.1) — the surface, as data.
-import { MARKER_BEGIN, MARKER_END } from "./ArtifactWriter.js";
-import { METRIC_KEY_LABELS } from "./Retrospective.js";
-import { fnv1a64 } from "./fingerprint.js";
-import { KEVIN_CONFIG_KEYS } from "./index.js";
-import { MAX_ENTRIES, MAX_LINE_BYTES } from "./okf.js";
-export const CONTRACT_VERSION = 1;
-// Tool names — the live source of truth for C-03. Any rename here must
-// flow to the contract (K10-006 AC: renaming a tool changes C-03).
-// Keep this array adjacent to the actual tool registrations in index.ts
-// (checked by a test that parses both files).
-export const CONTRACT_TOOL_NAMES = [
-    "kevin_save",
-    "kevin_query",
-    "kevin_get",
-    "kevin_recall",
-    "kevin_status",
-    "kevin_project",
-    "kevin_audit",
-    "kevin_doctor",
-    "kevin_native",
-    "kevin_retrospective",
-    "kevin_why",
-    "kevin_feedback",
-    "kevin_trace",
-    "kevin_export",
-    "kevin_import",
-    "kevin_config",
-    "kevin_facts",
-    "kevin_conflicts",
-    "kevin_propose",
-    "kevin_publish",
-    "kevin_approve",
-    "kevin_share",
-    "kevin_sync",
-];
-/**
- * v1.0.0 (K10-018/K10-019 / plan §5.6) — tools added AFTER the initial
- * freeze, each carrying the `since` the deprecation policy requires. A
- * 1.x addition without an entry here fails the contract test as
- * added_bare.
- */
-export const CONTRACT_TOOL_ADDITIONS = [
-    { name: "kevin_bench", since: "1.0.0" },
-    { name: "kevin_contract", since: "1.0.0" },
-    { name: "kevin_forget", since: "1.1.0" },
-];
-/**
- * v1.1.0 (K11-007 / plan §5.1, D11-01) — metric keys added after the freeze,
- * each carrying the `since` the deprecation policy requires (C-05).
- */
-export const CONTRACT_METRIC_ADDITIONS = [
-    { name: "bench_regression_failures", since: "1.1.0" },
-    { name: "forget_requests_total", since: "1.1.0" },
-    { name: "forget_tombstones_published", since: "1.1.0" },
-    // v1.2.0 (K12-001 / plan §4, D12-??) — surface metrics (no migration this release)
-    { name: "tui_snapshots_flushed", since: "1.2.0" },
-    { name: "tui_actions_invoked", since: "1.2.0" },
-];
-/**
- * v1.0.0 (K10-027 / plan §5.7) — the C-09 boundary addition. Stored is
- * not trusted: anything reaching an artifact or a prompt is escaped at
- * the single write path, according to its container.
- */
-export const BOUNDARY_INVARIANT = "untrusted-input escaping at the single write path";
-// For canonical JSON: sort keys recursively, no floats.
-function canonicalJson(value) {
-    if (value === null)
-        return "null";
-    if (typeof value === "boolean")
-        return value ? "true" : "false";
-    if (typeof value === "number") {
-        if (!Number.isFinite(value) || !Number.isInteger(value))
-            throw new Error("contract: non-integer number in canonical JSON");
-        return String(value);
-    }
-    if (typeof value === "string")
-        return JSON.stringify(value);
-    if (Array.isArray(value))
-        return `[${value.map(canonicalJson).join(",")}]`;
-    if (typeof value === "object") {
-        const obj = value;
-        const keys = Object.keys(obj).sort();
-        return `{${keys.map((k) => `${JSON.stringify(k)}:${canonicalJson(obj[k])}`).join(",")}}`;
-    }
-    return JSON.stringify(value);
-}
-export function describeContract(_input) {
-    // Derive clause values from live source wherever possible (plan §5.1).
-    // C-03 members added after the freeze carry their `since` as objects;
-    // the original frozen set stays plain strings.
-    const toolAdditions = [...CONTRACT_TOOL_ADDITIONS].sort((a, b) => a.name.localeCompare(b.name));
-    const toolValue = {
-        tools: [[...CONTRACT_TOOL_NAMES].sort(), toolAdditions].flat(),
-    };
-    const settingValue = { keys: [...KEVIN_CONFIG_KEYS].sort() };
-    // v1.1.0 — metric keys added after freeze carry `since` (C-05)
-    const metricAdditions = [...CONTRACT_METRIC_ADDITIONS].sort((a, b) => a.name.localeCompare(b.name));
-    const baseMetricKeys = Object.keys(METRIC_KEY_LABELS)
-        .filter((k) => !metricAdditions.some((a) => a.name === k))
-        .sort();
-    const metricValue = { keys: [...baseMetricKeys, ...metricAdditions].flat() };
-    const clauses = [
-        {
-            id: "C-01",
-            title: "AGENTS.md marker pair",
-            stability: "frozen",
-            since: "0.6.0",
-            value: {
-                markers: [MARKER_BEGIN, MARKER_END],
-                splice_rule: "bytes outside markers preserved verbatim",
-            },
-        },
-        {
-            id: "C-02",
-            title: "OKF v2 wire format",
-            stability: "frozen",
-            since: "0.8.0",
-            value: {
-                header_lines: 3,
-                field_order: ["entry_id", "type", "content", "scope", "created_at"],
-                entry_id_derivation: "fnv1a64 over canonical field ordering",
-                eol: "LF",
-                integers_only: true,
-                sort_order: "entry_id ascending",
-                max_line_bytes: MAX_LINE_BYTES,
-                max_entries: MAX_ENTRIES,
-            },
-        },
-        {
-            id: "C-03",
-            title: "Tool names and argument shapes",
-            stability: "frozen",
-            since: "0.2.0",
-            value: toolValue,
-        },
-        {
-            id: "C-04",
-            title: "Setting keys, types and defaults",
-            stability: "frozen",
-            since: "0.2.0",
-            value: settingValue,
-        },
-        {
-            id: "C-05",
-            title: "Metric key names",
-            stability: "frozen",
-            since: "0.2.0",
-            value: metricValue,
-        },
-        {
-            id: "C-06",
-            title: "Package entry points",
-            stability: "frozen",
-            since: "0.1.0",
-            value: {
-                name: "@jmtrin/opencode-kevin",
-                main: "dist/plugin/index.js",
-                types: "dist/plugin/index.d.ts",
-                exports_order: ["types", "import"],
-                engines: ">=22.5.0",
-            },
-        },
-        {
-            id: "C-07",
-            title: "Database schema",
-            stability: "forward-only",
-            since: "0.1.0",
-            value: {
-                schema_version: "012",
-                migrations_forward_only: true,
-            },
-        },
-        {
-            id: "C-08",
-            title: "Filesystem locations",
-            stability: "frozen",
-            since: "0.2.0",
-            value: {
-                db: "~/.opencode-kevin/kevin.db",
-                refs: "refs/",
-                skills: "skills/",
-                okf: ".kevin/knowledge.okf",
-            },
-        },
-        {
-            id: "C-09",
-            title: "Behavioural invariants",
-            stability: "frozen",
-            since: "0.8.0",
-            value: {
-                invariants: [
-                    "zero process spawns",
-                    "zero network calls",
-                    "no raw author email written",
-                    "single write path: ArtifactWriter is the only artifact writer",
-                ],
-                // v1.0.0 (K10-027 / plan §5.7) — the untrusted-input boundary
-                // joins the clause as an addition carrying its `since`; the
-                // frozen invariant strings above are untouched.
-                boundary: [{ name: BOUNDARY_INVARIANT, since: "1.0.0" }],
-            },
-        },
-    ];
-    return { contractVersion: CONTRACT_VERSION, clauses };
-}
-export function contractDigest(c) {
-    const payload = canonicalJson(c.clauses);
-    return fnv1a64(payload);
-}
-function valueMembers(value) {
-    // Normalize clause value into a flat member map for diffing.
-    // If value is { tools: [...] } => members are tool names.
-    // If { keys: [...] } => member per key.
-    // Otherwise flatten object keys.
-    if (value !== null && typeof value === "object") {
-        const obj = value;
-        if (Array.isArray(obj.tools)) {
-            const m = new Map();
-            for (const t of obj.tools) {
-                if (typeof t === "string")
-                    m.set(t, undefined);
-                else if (t !== null &&
-                    typeof t === "object" &&
-                    "name" in t)
-                    m.set(t.name, t);
-            }
-            return m;
-        }
-        if (Array.isArray(obj.keys)) {
-            const m = new Map();
-            for (const k of obj.keys) {
-                if (typeof k === "string")
-                    m.set(k, undefined);
-                else if (k !== null &&
-                    typeof k === "object" &&
-                    "name" in k)
-                    m.set(k.name, k);
-            }
-            return m;
-        }
-        if (Array.isArray(obj.markers) || Array.isArray(obj.invariants)) {
-            const arr = (obj.markers ?? obj.invariants);
-            const m = new Map();
-            for (const v of arr)
-                m.set(v, v);
-            // v1.0.0 (K10-027) — boundary additions sit beside the frozen
-            // invariant strings and carry their `since` like tool additions.
-            if (Array.isArray(obj.boundary)) {
-                for (const b of obj.boundary) {
-                    if (b !== null &&
-                        typeof b === "object" &&
-                        "name" in b)
-                        m.set(b.name, b);
-                }
-            }
-            return m;
-        }
-        // Generic object: each key is a member
-        const m = new Map();
-        for (const [k, v] of Object.entries(obj))
-            m.set(k, v);
-        return m;
-    }
-    return new Map([["value", value]]);
-}
-export function diffContract(golden, live) {
-    const diffs = [];
-    const goldenById = new Map(golden.clauses.map((c) => [c.id, c]));
-    const liveById = new Map(live.clauses.map((c) => [c.id, c]));
-    // Removed clauses
-    for (const g of golden.clauses) {
-        if (!liveById.has(g.id)) {
-            diffs.push({
-                clauseId: g.id,
-                path: g.id,
-                kind: "removed",
-                remedy: `Clause ${g.id} was removed. Revert, or open a 2.0.0.`,
-            });
-        }
-    }
-    // Added clauses — check since
-    for (const l of live.clauses) {
-        if (!goldenById.has(l.id)) {
-            const hasSince = typeof l.since === "string" &&
-                l.since.length > 0;
-            diffs.push({
-                clauseId: l.id,
-                path: l.id,
-                kind: hasSince ? "added_ok" : "added_bare",
-                remedy: hasSince
-                    ? `Clause ${l.id} was added with since. Allowed in 1.x.`
-                    : `Clause ${l.id} was added without since. Add since or revert, or open a 2.0.0.`,
-            });
-        }
-    }
-    // Within-clause diff
-    for (const g of golden.clauses) {
-        const l = liveById.get(g.id);
-        if (!l)
-            continue;
-        const gMembers = valueMembers(g.value);
-        const lMembers = valueMembers(l.value);
-        // Normalize members: for arrays we care about set equality
-        for (const [mem, _gv] of gMembers) {
-            if (!lMembers.has(mem)) {
-                diffs.push({
-                    clauseId: g.id,
-                    path: `${g.id}.${mem}`,
-                    kind: "removed",
-                    remedy: `Member ${mem} in ${g.id} was removed. Revert, or open a 2.0.0.`,
-                });
-            }
-            else {
-                const lv = lMembers.get(mem);
-                const gv = gMembers.get(mem);
-                if (JSON.stringify(lv) !== JSON.stringify(gv)) {
-                    // Member present on both sides but its value moved (e.g. an
-                    // addition object whose `since` was edited). Report it here,
-                    // at member granularity, instead of letting it fall through
-                    // to the coarser clause-level check below.
-                    diffs.push({
-                        clauseId: g.id,
-                        path: `${g.id}.${mem}`,
-                        kind: "changed",
-                        remedy: `Member ${mem} in ${g.id} changed. Revert, or open a 2.0.0.`,
-                    });
-                }
-            }
-        }
-        for (const [mem, _lv] of lMembers) {
-            if (!gMembers.has(mem)) {
-                const liveVal = l.value;
-                // Check if the live member carries `since` (additions may ride
-                // in the keys, tools or boundary arrays — K10-018/K10-027).
-                const lists = [liveVal.keys, liveVal.tools, liveVal.boundary];
-                let hasSince = false;
-                for (const list of lists) {
-                    if (!Array.isArray(list))
-                        continue;
-                    const entry = list.find((e) => {
-                        if (typeof e === "string")
-                            return e === mem;
-                        if (e !== null &&
-                            typeof e === "object" &&
-                            "name" in e)
-                            return e.name === mem;
-                        return false;
-                    });
-                    if (entry !== null &&
-                        typeof entry === "object" &&
-                        typeof entry.since === "string") {
-                        hasSince = true;
-                        break;
-                    }
-                }
-                diffs.push({
-                    clauseId: g.id,
-                    path: `${g.id}.${mem}`,
-                    kind: hasSince ? "added_ok" : "added_bare",
-                    remedy: hasSince
-                        ? `Member ${mem} in ${g.id} was added with since. Allowed in 1.x.`
-                        : `Member ${mem} in ${g.id} was added without since. Add since or revert, or open a 2.0.0.`,
-                });
-            }
-        }
-        // Also compare clause-level metadata that is not in valueMembers (e.g., package version in C-06)
-        // If the whole value JSON differs but members didn't capture it (e.g., name change), mark changed.
-        if (JSON.stringify(g.value) !== JSON.stringify(l.value)) {
-            // Only emit clause-level changed if no finer-grained diff already emitted for this clause
-            const hasFiner = diffs.some((d) => d.clauseId === g.id && d.path !== g.id);
-            if (!hasFiner) {
-                diffs.push({
-                    clauseId: g.id,
-                    path: g.id,
-                    kind: "changed",
-                    remedy: `Clause ${g.id} changed. Revert, or open a 2.0.0.`,
-                });
-            }
-        }
-    }
-    diffs.sort((a, b) => a.clauseId === b.clauseId
-        ? a.path.localeCompare(b.path)
-        : a.clauseId.localeCompare(b.clauseId));
-    return diffs;
-}

package/dist/plugin/diff.d.ts

@@ -1,8 +0,0 @@
-/**
- * Unified diff between `before` and `after` for `path`, in git's format:
- * `--- a/<path>` / `+++ b/<path>` headers, `@@ -l,s +l,s @@` hunk headers
- * (count omitted when 1, `0,0` for an empty side), three lines of context and
- * adjacent hunks merged when their context windows overlap. Identical inputs
- * yield the empty string.
- */
-export declare function unifiedDiff(path: string, before: string, after: string): string;

package/dist/plugin/diff.js

@@ -1,182 +0,0 @@
-// v0.6.0 (K6-006 / plan §5.2, D6-05) — a minimal deterministic unified-diff
-// generator. Pure, dependency-free, byte-for-byte compatible with
-// `git diff -U3 --no-index` for the fixtures the tests compare.
-//
-// It exists for exactly one reason: approval prompts must show a diff, never
-// prose (D6-05). Determinism is a hard requirement: the output is persisted
-// into `curation_proposals.diff` and compared across runs. No timestamps, no
-// `Object.keys` iteration, no `Set` iteration — arrays only.
-const CONTEXT = 3;
-/**
- * Split text into logical lines. A trailing newline is not part of the line
- * model, so a file that merely gains or loses its final newline produces no
- * spurious final-line hunk.
- */
-function linesOf(text) {
-    if (text === "")
-        return [];
-    const parts = text.split("\n");
-    if (parts[parts.length - 1] === "")
-        parts.pop();
-    return parts;
-}
-/**
- * LCS over lines via dynamic programming, then a deterministic walk emitting
- * context / deletion / addition ops. Within each change region deletions are
- * emitted before additions, matching git's block ordering exactly.
- */
-function computeOps(a, b) {
-    const m = a.length;
-    const n = b.length;
-    const w = n + 1;
-    const dp = new Int32Array((m + 1) * w);
-    for (let i = m - 1; i >= 0; i--) {
-        for (let j = n - 1; j >= 0; j--) {
-            dp[i * w + j] =
-                a[i] === b[j]
-                    ? dp[(i + 1) * w + j + 1] + 1
-                    : Math.max(dp[(i + 1) * w + j], dp[i * w + j + 1]);
-        }
-    }
-    const ops = [];
-    const pendingDel = [];
-    const pendingAdd = [];
-    const flush = () => {
-        for (const line of pendingDel)
-            ops.push({ type: "del", line });
-        for (const line of pendingAdd)
-            ops.push({ type: "add", line });
-        pendingDel.length = 0;
-        pendingAdd.length = 0;
-    };
-    let i = 0;
-    let j = 0;
-    while (i < m && j < n) {
-        if (a[i] === b[j]) {
-            flush();
-            ops.push({ type: "ctx", line: a[i] });
-            i++;
-            j++;
-        }
-        else if (dp[(i + 1) * w + j] >= dp[i * w + j + 1]) {
-            pendingDel.push(a[i]);
-            i++;
-        }
-        else {
-            pendingAdd.push(b[j]);
-            j++;
-        }
-    }
-    flush();
-    while (i < m) {
-        pendingDel.push(a[i]);
-        i++;
-    }
-    flush();
-    while (j < n) {
-        pendingAdd.push(b[j]);
-        j++;
-    }
-    flush();
-    return ops;
-}
-function buildHunks(ops) {
-    // Maximal change regions: runs of ops containing at least one del/add.
-    const regions = [];
-    let regionStart = -1;
-    for (let k = 0; k < ops.length; k++) {
-        if (ops[k].type !== "ctx") {
-            if (regionStart === -1)
-                regionStart = k;
-        }
-        else if (regionStart !== -1) {
-            regions.push([regionStart, k]);
-            regionStart = -1;
-        }
-    }
-    if (regionStart !== -1)
-        regions.push([regionStart, ops.length]);
-    // Extend each region by CONTEXT lines and merge overlapping windows.
-    const windows = [];
-    for (const [rs, re] of regions) {
-        const start = Math.max(0, rs - CONTEXT);
-        const end = Math.min(ops.length, re + CONTEXT);
-        const prev = windows[windows.length - 1];
-        if (prev !== undefined && start <= prev.end) {
-            prev.end = end;
-        }
-        else {
-            windows.push({ start, end });
-        }
-    }
-    const hunks = [];
-    for (const win of windows) {
-        let beforeStart = 0;
-        let afterStart = 0;
-        let countA = 0;
-        let countB = 0;
-        for (let k = 0; k < win.end; k++) {
-            const op = ops[k];
-            const inside = k >= win.start;
-            if (op.type === "del") {
-                if (!inside)
-                    beforeStart++;
-                if (inside)
-                    countA++;
-            }
-            else if (op.type === "add") {
-                if (!inside)
-                    afterStart++;
-                if (inside)
-                    countB++;
-            }
-            else {
-                if (!inside) {
-                    beforeStart++;
-                    afterStart++;
-                }
-                if (inside) {
-                    countA++;
-                    countB++;
-                }
-            }
-        }
-        // 1-based start lines; a side with zero lines starts at 0.
-        const startA = countA > 0 ? beforeStart + 1 : 0;
-        const startB = countB > 0 ? afterStart + 1 : 0;
-        const rangeA = countA === 1 ? `-${startA}` : `-${startA},${countA}`;
-        const rangeB = countB === 1 ? `+${startB}` : `+${startB},${countB}`;
-        const lines = [];
-        for (let k = win.start; k < win.end; k++) {
-            const op = ops[k];
-            if (op.type === "del")
-                lines.push(`-${op.line}`);
-            else if (op.type === "add")
-                lines.push(`+${op.line}`);
-            else
-                lines.push(` ${op.line}`);
-        }
-        hunks.push({ header: `@@ ${rangeA} ${rangeB} @@`, lines });
-    }
-    return hunks;
-}
-/**
- * Unified diff between `before` and `after` for `path`, in git's format:
- * `--- a/<path>` / `+++ b/<path>` headers, `@@ -l,s +l,s @@` hunk headers
- * (count omitted when 1, `0,0` for an empty side), three lines of context and
- * adjacent hunks merged when their context windows overlap. Identical inputs
- * yield the empty string.
- */
-export function unifiedDiff(path, before, after) {
-    const ops = computeOps(linesOf(before), linesOf(after));
-    const hunks = buildHunks(ops);
-    if (hunks.length === 0)
-        return "";
-    const parts = [];
-    for (const hunk of hunks) {
-        parts.push(hunk.header);
-        parts.push(...hunk.lines);
-    }
-    const header = `--- a/${path}\n+++ b/${path}\n`;
-    return `${header}${parts.join("\n")}\n`;
-}