pi-ghost-autocomplete 0.3.2 → 0.4.0

package/dist/context-selector.js

@@ -1,300 +0,0 @@
-/**
- * Relevance-pruned context selection. See PRD §M6b.
- *
- * Replaces the "last N messages" recency window with a scan-then-select
- * design motivated by ChaI-TeA (RESEARCH §2): models can exploit distant
- * conversation history; a pure recency window blinds the selector to
- * high-IDF distant turns.
- *
- * Pipeline:
- *  1. Scan up to `maxScan` candidates from the branch (newest first).
- *  2. Tokenize each candidate's text (lower-case, drop stopwords).
- *  3. Score each candidate as `0.7 * recencyWeight + 0.3 * bm25Score`,
- *     both normalized to [0, 1].
- *  4. Sort by score, take top `maxSelected`, enforce `maxChars` budget by
- *     truncating the lowest-recency tail.
- *
- * Pure module: no I/O, no editor state.
- */
-export const DEFAULT_MAX_SCAN = 200;
-export const DEFAULT_MAX_SELECTED = 8;
-export const DEFAULT_MAX_CHARS = 4000;
-export const DEFAULT_BM25_WEIGHT = 0.3;
-/**
- * Enhancement #1: weight on the edit-history token-overlap locality
- * signal. Default 0 (opt-in). When > 0, the score formula becomes:
- *   `score = (1 - bm25Weight - editLocalityWeight) * recency
- *          + bm25Weight * bm25
- *          + editLocalityWeight * editLocality`
- * where `editLocality` is 1 if the candidate text shares any token with
- * `editTokens`, else 0. `bm25Weight + editLocalityWeight` is clamped to
- * 1; recency coefficient gets whatever remains.
- */
-export const DEFAULT_EDIT_LOCALITY_WEIGHT = 0;
-export const RECENCY_HALF_LIFE = 4;
-const BM25_K1 = 1.5;
-const BM25_B = 0.75;
-/**
- * Small fixed English stopword list. No language detection — when ghost
- * autocomplete moves to non-English prompts, this set may need expansion
- * or a per-language switch. Until then, the cost of leaving these in is
- * higher than the cost of an English-only set.
- */
-export const STOPWORDS = new Set([
-    "the",
-    "a",
-    "an",
-    "of",
-    "and",
-    "or",
-    "to",
-    "in",
-    "on",
-    "for",
-    "is",
-    "are",
-    "this",
-    "that",
-]);
-/**
- * Tokenize text into lower-case alphanumeric words, dropping stopwords and
- * single-character noise. Kept intentionally simple — proper tokenization
- * (subword, punctuation handling, code identifiers) would over-fit the
- * v0.5 prompt corpus.
- *
- * Caveat: camelCase identifiers do NOT split. `getRecentMessages` becomes a
- * single token `getrecentmessages`. File paths and snake_case split on the
- * separator characters and tokenize as expected.
- */
-export function tokenize(text) {
-    const out = [];
-    for (const m of text.toLowerCase().matchAll(/[a-z0-9]+/g)) {
-        const t = m[0];
-        if (t.length < 2)
-            continue;
-        if (STOPWORDS.has(t))
-            continue;
-        out.push(t);
-    }
-    return out;
-}
-/**
- * Compute document frequencies over a candidate pool. Used as the corpus
- * for BM25's IDF term.
- */
-export function computeDocFreqs(candidates) {
-    const docFreqs = new Map();
-    const docLens = [];
-    let totalLen = 0;
-    for (const c of candidates) {
-        const tokens = tokenize(c.text);
-        docLens.push(tokens.length);
-        totalLen += tokens.length;
-        const seen = new Set();
-        for (const t of tokens) {
-            if (seen.has(t))
-                continue;
-            seen.add(t);
-            docFreqs.set(t, (docFreqs.get(t) ?? 0) + 1);
-        }
-    }
-    const avgDocLen = candidates.length > 0 ? totalLen / candidates.length : 0;
-    return { docFreqs, avgDocLen, docLens };
-}
-/**
- * BM25 score for `queryTokens` against a document. Uses an IDF floor
- * `log(1 + 1/N)` so terms appearing in every candidate still contribute a
- * small positive score instead of zero — PRD §M6b "BM25-on-small-corpus
- * caveat".
- */
-export function bm25Score(queryTokens, docTokens, docFreqs, N, avgDocLen) {
-    if (queryTokens.length === 0 || docTokens.length === 0 || N === 0)
-        return 0;
-    const docLen = docTokens.length;
-    const idfFloor = Math.log(1 + 1 / Math.max(1, N));
-    // Term-frequency in the document.
-    const tf = new Map();
-    for (const t of docTokens)
-        tf.set(t, (tf.get(t) ?? 0) + 1);
-    let score = 0;
-    const seenInQuery = new Set();
-    for (const q of queryTokens) {
-        if (seenInQuery.has(q))
-            continue;
-        seenInQuery.add(q);
-        const f = tf.get(q);
-        if (!f)
-            continue;
-        const df = docFreqs.get(q) ?? 0;
-        // Standard Okapi IDF; clamp at the floor so universal terms still count.
-        const idfRaw = Math.log((N - df + 0.5) / (df + 0.5) + 1);
-        const idf = Math.max(idfFloor, idfRaw);
-        const lenNorm = 1 - BM25_B + BM25_B * (docLen / Math.max(1, avgDocLen));
-        const tfNorm = (f * (BM25_K1 + 1)) / (f + BM25_K1 * lenNorm);
-        score += idf * tfNorm;
-    }
-    return score;
-}
-/**
- * Exponential recency weight: 1.0 at the newest position, decays e-fold
- * every `RECENCY_HALF_LIFE` positions. `distance` is positions from the
- * newest end of the candidate pool (0 = newest).
- */
-export function recencyWeight(distance) {
-    return Math.exp(-distance / RECENCY_HALF_LIFE);
-}
-function minMaxNormalize(xs) {
-    if (xs.length === 0)
-        return [];
-    let min = Infinity;
-    let max = -Infinity;
-    for (const x of xs) {
-        if (x < min)
-            min = x;
-        if (x > max)
-            max = x;
-    }
-    const spread = max - min;
-    if (spread < 1e-9)
-        return xs.map(() => 0.5);
-    return xs.map((x) => (x - min) / spread);
-}
-/**
- * Select the most relevant subset of `candidates` for the current prefix.
- * `candidates` should be newest-first (index 0 = newest). Returns selected
- * entries in their original branch order (oldest-first of those selected)
- * for natural prompt rendering.
- */
-export function selectContext(candidates, prefix, opts = {}) {
-    const maxScan = Math.max(0, opts.maxScan ?? DEFAULT_MAX_SCAN);
-    const maxSelected = Math.max(0, opts.maxSelected ?? DEFAULT_MAX_SELECTED);
-    const maxChars = Math.max(0, opts.maxChars ?? DEFAULT_MAX_CHARS);
-    const bm25WeightRaw = Math.min(1, Math.max(0, opts.bm25Weight ?? DEFAULT_BM25_WEIGHT));
-    const editLocalityWeightRaw = Math.min(1, Math.max(0, opts.editLocalityWeight ?? DEFAULT_EDIT_LOCALITY_WEIGHT));
-    // Clamp the sum at 1 so recency coefficient never goes negative. If the
-    // caller asks for bm25=0.7 + editLocality=0.5, scale both proportionally.
-    const sum = bm25WeightRaw + editLocalityWeightRaw;
-    const scale = sum > 1 ? 1 / sum : 1;
-    const bm25Weight = bm25WeightRaw * scale;
-    const editLocalityWeight = editLocalityWeightRaw * scale;
-    const recencyWeightCoef = 1 - bm25Weight - editLocalityWeight;
-    // Normalize editTokens to lowercase to align with the selector's tokenize.
-    // Edit-history tokens preserve identifier case (code identifiers are
-    // case-sensitive); context-selector lowercases (prose tokens). Compare
-    // post-normalization so the two spaces meet.
-    const editTokens = opts.editTokens
-        ? new Set(Array.from(opts.editTokens, (t) => t.toLowerCase()))
-        : undefined;
-    const editLocalityActive = editLocalityWeight > 0 && editTokens && editTokens.size > 0;
-    const scanned = candidates.slice(0, maxScan);
-    if (scanned.length === 0 || maxSelected === 0) {
-        return { candidates: [], scannedCount: 0, selectedCount: 0, totalChars: 0 };
-    }
-    const queryTokens = tokenize(prefix);
-    const { docFreqs, avgDocLen } = computeDocFreqs(scanned);
-    // Per-candidate raw scores.
-    const recencyRaw = scanned.map((_, i) => recencyWeight(i));
-    const docTokens = scanned.map((c) => tokenize(c.text));
-    const bm25Raw = docTokens.map((toks) => bm25Score(queryTokens, toks, docFreqs, scanned.length, avgDocLen));
-    const editLocalityRaw = editLocalityActive
-        ? docTokens.map((toks) => (toks.some((t) => editTokens.has(t)) ? 1 : 0))
-        : scanned.map(() => 0);
-    const recencyNorm = minMaxNormalize(recencyRaw);
-    const bm25Norm = minMaxNormalize(bm25Raw);
-    // editLocality is already in {0, 1} — skip normalization.
-    const combined = scanned.map((c, i) => ({
-        candidate: c,
-        score: recencyWeightCoef * recencyNorm[i] +
-            bm25Weight * bm25Norm[i] +
-            editLocalityWeight * editLocalityRaw[i],
-        // Carry the newest-first index for ordering selected entries back into
-        // chronological order at the end.
-        index: i,
-    }));
-    // Top-N by score; ties broken by recency (lower index = newer).
-    combined.sort((a, b) => {
-        const ds = b.score - a.score;
-        if (Math.abs(ds) > 1e-9)
-            return ds;
-        return a.index - b.index;
-    });
-    const topN = combined.slice(0, maxSelected);
-    // Char-budget enforcement (PRD §M6b: "drop lowest-recency tail").
-    // Sort newest-first then greedily fill — once the budget would be
-    // exceeded, stop. This gives priority to newer entries, which matches
-    // PRD's "drop lowest-recency tail" intent.
-    //
-    // Edge case: the very first (newest) entry's `len` may exceed `maxChars`
-    // on its own. We still keep it (the alternative is no context at all),
-    // even though `totalChars` then exceeds the budget. This is a documented
-    // best-effort policy — a future revision could truncate such entries
-    // mid-text, but that risks splitting mid-token.
-    topN.sort((a, b) => a.index - b.index);
-    let totalChars = 0;
-    const kept = [];
-    for (const c of topN) {
-        const len = c.candidate.text.length;
-        if (totalChars + len > maxChars && kept.length > 0) {
-            break;
-        }
-        totalChars += len;
-        kept.push(c);
-    }
-    // Render oldest-first for natural prompt rendering (newest at the end).
-    kept.sort((a, b) => b.index - a.index);
-    return {
-        candidates: kept.map((k) => k.candidate),
-        scannedCount: scanned.length,
-        selectedCount: kept.length,
-        totalChars,
-    };
-}
-/**
- * Parse `PI_GHOST_CONTEXT_BM25_WEIGHT`. Returns fallback on bad input or
- * outside [0, 1].
- */
-export function parseBm25WeightEnv(raw) {
-    if (raw === undefined)
-        return DEFAULT_BM25_WEIGHT;
-    const v = Number(raw);
-    if (!Number.isFinite(v) || v < 0 || v > 1)
-        return DEFAULT_BM25_WEIGHT;
-    return v;
-}
-/**
- * Parse `PI_GHOST_CONTEXT_EDIT_LOCALITY_WEIGHT`. Returns 0 (no-op) on bad
- * input or outside [0, 1]. Enhancement #1.
- */
-export function parseEditLocalityWeightEnv(raw) {
-    if (raw === undefined)
-        return DEFAULT_EDIT_LOCALITY_WEIGHT;
-    const v = Number(raw);
-    if (!Number.isFinite(v) || v < 0 || v > 1)
-        return DEFAULT_EDIT_LOCALITY_WEIGHT;
-    return v;
-}
-function numEnv(name, fallback, min = 0, max = Number.POSITIVE_INFINITY) {
-    const raw = process.env[name];
-    if (!raw)
-        return fallback;
-    const v = Number(raw);
-    if (!Number.isFinite(v) || v < min || v > max)
-        return fallback;
-    return Math.floor(v);
-}
-/**
- * Build a `ContextSelectorOpts` from the documented env knobs (PRD §M6d).
- * Returns a defaulted opts object. `editTokens` is omitted — the caller
- * must inject the live edit-history token set on each call (env can only
- * configure the weight, not the dynamic data).
- */
-export function readContextEnv() {
-    return {
-        maxScan: numEnv("PI_GHOST_CONTEXT_MAX_SCAN", DEFAULT_MAX_SCAN, 0),
-        maxSelected: numEnv("PI_GHOST_CONTEXT_MAX_SELECTED", DEFAULT_MAX_SELECTED, 0),
-        maxChars: numEnv("PI_GHOST_CONTEXT_MAX_CHARS", DEFAULT_MAX_CHARS, 0),
-        bm25Weight: parseBm25WeightEnv(process.env.PI_GHOST_CONTEXT_BM25_WEIGHT),
-        editLocalityWeight: parseEditLocalityWeightEnv(process.env.PI_GHOST_CONTEXT_EDIT_LOCALITY_WEIGHT),
-    };
-}
-//# sourceMappingURL=context-selector.js.map

package/dist/context-selector.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"context-selector.js","sourceRoot":"","sources":["../src/context-selector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,MAAM,CAAC,MAAM,gBAAgB,GAAG,GAAG,CAAC;AACpC,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC;AACtC,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,CAAC;AACtC,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AACvC;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAAC,CAAC;AAC9C,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAEnC,MAAM,OAAO,GAAG,GAAG,CAAC;AACpB,MAAM,MAAM,GAAG,IAAI,CAAC;AAEpB;;;;;GAKG;AACH,MAAM,CAAC,MAAM,SAAS,GAAwB,IAAI,GAAG,CAAC;IACrD,KAAK;IACL,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,KAAK;IACL,MAAM;IACN,MAAM;CACN,CAAC,CAAC;AAkCH;;;;;;;;;GASG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACpC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;QAC3D,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC3B,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC/B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACb,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,UAA8B;IAK7D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5B,QAAQ,IAAI,MAAM,CAAC,MAAM,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACxB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC1B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC;IACF,CAAC;IACD,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AACzC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CACxB,WAAqB,EACrB,SAAmB,EACnB,QAA6B,EAC7B,CAAS,EACT,SAAiB;IAEjB,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC5E,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAElD,kCAAkC;IAClC,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE3D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC7B,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QACjC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,CAAC;YAAE,SAAS;QACjB,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChC,yEAAyE;QACzE,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvC,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,GAAG,MAAM,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QACxE,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC;QAC7D,KAAK,IAAI,GAAG,GAAG,MAAM,CAAC;IACvB,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,QAAgB;IAC7C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,iBAAiB,CAAC,CAAC;AAChD,CAAC;AAED,SAAS,eAAe,CAAC,EAAY;IACpC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC/B,IAAI,GAAG,GAAG,QAAQ,CAAC;IACnB,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;IACpB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACpB,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC;IACzB,IAAI,MAAM,GAAG,IAAI;QAAE,OAAO,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAC5C,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC5B,UAA8B,EAC9B,MAAc,EACd,OAA4B,EAAE;IAE9B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,IAAI,gBAAgB,CAAC,CAAC;IAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,IAAI,oBAAoB,CAAC,CAAC;IAC1E,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC,CAAC;IACjE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,IAAI,mBAAmB,CAAC,CAAC,CAAC;IACvF,MAAM,qBAAqB,GAAG,IAAI,CAAC,GAAG,CACrC,CAAC,EACD,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,kBAAkB,IAAI,4BAA4B,CAAC,CACpE,CAAC;IACF,wEAAwE;IACxE,0EAA0E;IAC1E,MAAM,GAAG,GAAG,aAAa,GAAG,qBAAqB,CAAC;IAClD,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,UAAU,GAAG,aAAa,GAAG,KAAK,CAAC;IACzC,MAAM,kBAAkB,GAAG,qBAAqB,GAAG,KAAK,CAAC;IACzD,MAAM,iBAAiB,GAAG,CAAC,GAAG,UAAU,GAAG,kBAAkB,CAAC;IAC9D,2EAA2E;IAC3E,qEAAqE;IACrE,uEAAuE;IACvE,6CAA6C;IAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU;QACjC,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QAC9D,CAAC,CAAC,SAAS,CAAC;IACb,MAAM,kBAAkB,GAAG,kBAAkB,GAAG,CAAC,IAAI,UAAU,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC;IAEvF,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC7C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;QAC/C,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IAC7E,CAAC;IAED,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IACrC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IAEzD,4BAA4B;IAC5B,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACtC,SAAS,CAAC,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,CACjE,CAAC;IACF,MAAM,eAAe,GAAG,kBAAkB;QACzC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAExB,MAAM,WAAW,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IAC1C,0DAA0D;IAE1D,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACvC,SAAS,EAAE,CAAC;QACZ,KAAK,EACJ,iBAAiB,GAAG,WAAW,CAAC,CAAC,CAAE;YACnC,UAAU,GAAG,QAAQ,CAAC,CAAC,CAAE;YACzB,kBAAkB,GAAG,eAAe,CAAC,CAAC,CAAE;QACzC,uEAAuE;QACvE,kCAAkC;QAClC,KAAK,EAAE,CAAC;KACR,CAAC,CAAC,CAAC;IAEJ,gEAAgE;IAChE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAC7B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI;YAAE,OAAO,EAAE,CAAC;QACnC,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAC1B,CAAC,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAE5C,kEAAkE;IAClE,kEAAkE;IAClE,sEAAsE;IACtE,2CAA2C;IAC3C,EAAE;IACF,yEAAyE;IACzE,uEAAuE;IACvE,yEAAyE;IACzE,qEAAqE;IACrE,gDAAgD;IAChD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,IAAI,GAAgB,EAAE,CAAC;IAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC;QACpC,IAAI,UAAU,GAAG,GAAG,GAAG,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpD,MAAM;QACP,CAAC;QACD,UAAU,IAAI,GAAG,CAAC;QAClB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IAED,wEAAwE;IACxE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAEvC,OAAO;QACN,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QACxC,YAAY,EAAE,OAAO,CAAC,MAAM;QAC5B,aAAa,EAAE,IAAI,CAAC,MAAM;QAC1B,UAAU;KACV,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,GAAuB;IACzD,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,mBAAmB,CAAC;IAClD,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IACtB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,mBAAmB,CAAC;IACtE,OAAO,CAAC,CAAC;AACV,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,0BAA0B,CAAC,GAAuB;IACjE,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,4BAA4B,CAAC;IAC3D,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IACtB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,4BAA4B,CAAC;IAC/E,OAAO,CAAC,CAAC;AACV,CAAC;AAED,SAAS,MAAM,CAAC,IAAY,EAAE,QAAgB,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,iBAAiB;IACtF,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,CAAC,GAAG;QAAE,OAAO,QAAQ,CAAC;IAC1B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IACtB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,GAAG;QAAE,OAAO,QAAQ,CAAC;IAC/D,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACtB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc;IAC7B,OAAO;QACN,OAAO,EAAE,MAAM,CAAC,2BAA2B,EAAE,gBAAgB,EAAE,CAAC,CAAC;QACjE,WAAW,EAAE,MAAM,CAAC,+BAA+B,EAAE,oBAAoB,EAAE,CAAC,CAAC;QAC7E,QAAQ,EAAE,MAAM,CAAC,4BAA4B,EAAE,iBAAiB,EAAE,CAAC,CAAC;QACpE,UAAU,EAAE,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,4BAA4B,CAAC;QACxE,kBAAkB,EAAE,0BAA0B,CAC7C,OAAO,CAAC,GAAG,CAAC,qCAAqC,CACjD;KACD,CAAC;AACH,CAAC"}

package/dist/cycle-manager.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cycle-manager.d.ts","sourceRoot":"","sources":["../src/cycle-manager.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AA4BH;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,IAAI,CAK7F;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAInD;AAED;;;GAGG;AACH,qBAAa,YAAY;IACxB,OAAO,CAAC,KAAK,CAA4B;IAEzC,KAAK,IAAI,IAAI;IAIb;;;;;OAKG;IACH,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI;IAWpC;;;OAGG;IACH,IAAI,UAAU,IAAI,SAAS,MAAM,EAAE,CAElC;IAED;;;;;OAKG;IACH,IAAI,OAAO,IAAI,MAAM,GAAG,IAAI,CAI3B;IAED,IAAI,WAAW,IAAI,MAAM,CAExB;IAED,IAAI,cAAc,IAAI,MAAM,CAE3B;IAED,IAAI,YAAY,IAAI,MAAM,CAEzB;IAED;;;;;OAKG;IACH,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO;IAc3B;;;;;;;;;;;;OAYG;IACH,uBAAuB,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE;IAgBtE;;OAEG;IACH,QAAQ,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE;CAQ5E"}

package/dist/cycle-manager.js

@@ -1,168 +0,0 @@
-/**
- * CycleManager — owns multi-candidate state and word-level partial-accept
- * gestures for the GREAT Ghost autocomplete.
- *
- * PRD §M3e (Alt+]/Alt+[ cycling with clamp-at-edges, no wrap) +
- * PRD §M3f (Ctrl+Right word-by-word acceptance in append mode).
- *
- * Design notes:
- *
- *  - Candidate list is stored read-only (frozen) so that future refactors
- *    don't accidentally mutate ranked text. Per-candidate consumption from
- *    word-level accepts is tracked separately in `consumed[idx]`.
- *  - `current` returns `string | null` — `null` distinguishes "no candidates
- *    installed" from "current candidate is empty after full consumption".
- *  - `acceptPartialWordAppend()` is named to make the append-mode invariant
- *    impossible to forget at call sites. Replace-mode ghosts (fuzzy/path)
- *    accept atomically; word-by-word doesn't apply.
- *  - No hidden auto-reset: caller is responsible for `reset()` after the
- *    final-chunk accept so the lifecycle is explicit.
- *
- * Extracted as part of refactor #57 so `GhostEditor` stays thin.
- */
-function emptyState() {
-    return {
-        originals: Object.freeze([]),
-        consumed: [],
-        candidateIdx: 0,
-        cycledCount: 0,
-        partialAccepts: 0,
-    };
-}
-/**
- * Pure helper: compute the next index for Alt+]/Alt[+ cycle.
- * Returns null when the move would go past an edge (no wrap, per PRD).
- */
-export function cycleCandidateIdx(currentIdx, len, dir) {
-    if (len <= 1)
-        return null;
-    const next = currentIdx + dir;
-    if (next < 0 || next >= len)
-        return null;
-    return next;
-}
-/**
- * Extract the next lexical "word" chunk from the start of a ghost string.
- * Skips leading whitespace, then either consumes an identifier run (`\w+`)
- * OR a single non-word non-space char so code like `foo("bar")` accepts as
- * `foo`, `(`, `"`, `bar`, `"`, `)` rather than gulping the whole
- * expression. Used by Ctrl+Right partial accept.
- *
- * Returns the empty string when the ghost is empty or contains only
- * whitespace — caller treats that as a no-op.
- */
-export function nextWordChunk(ghost) {
-    if (!ghost)
-        return "";
-    const m = /^\s*(\w+|[^\s\w])/.exec(ghost);
-    return m ? m[0] : "";
-}
-/**
- * CycleManager — small mutable facade over CycleState.
- * All mutation goes through the manager so editor code stays declarative.
- */
-export class CycleManager {
-    state = emptyState();
-    reset() {
-        this.state = emptyState();
-    }
-    /**
-     * Install a fresh ranked candidate list for a newly shown ghost.
-     * Always resets indices, cycledCount, partialAccepts, and consumed
-     * offsets. The stored list is frozen — partial-accepts shrink the
-     * per-candidate `consumed` offset, never the underlying text.
-     */
-    setCandidates(texts) {
-        const originals = Object.freeze(texts.length > 0 ? [...texts] : []);
-        this.state = {
-            originals,
-            consumed: new Array(originals.length).fill(0),
-            candidateIdx: 0,
-            cycledCount: 0,
-            partialAccepts: 0,
-        };
-    }
-    /**
-     * Read-only view of the ranked candidate list as installed. Stable across
-     * partial accepts (consumption is tracked separately via `current`).
-     */
-    get candidates() {
-        return this.state.originals;
-    }
-    /**
-     * Currently displayed ghost text — the un-consumed remainder of the
-     * candidate at `candidateIdx`. Returns `null` when no candidates are
-     * installed; returns `""` when the current candidate has been fully
-     * consumed by partial accepts (caller must then `reset()`).
-     */
-    get current() {
-        const o = this.state.originals[this.state.candidateIdx];
-        if (o === undefined)
-            return null;
-        return o.slice(this.state.consumed[this.state.candidateIdx] ?? 0);
-    }
-    get cycledCount() {
-        return this.state.cycledCount;
-    }
-    get partialAccepts() {
-        return this.state.partialAccepts;
-    }
-    get candidateIdx() {
-        return this.state.candidateIdx;
-    }
-    /**
-     * Attempt a cycle in the given direction. Returns true if the ghost text
-     * actually changed (i.e., a legal non-edge move occurred). Each
-     * candidate retains its own `consumed` offset across cycles so the user
-     * can partial-accept on A, cycle to B, cycle back to A and resume.
-     */
-    cycle(dir) {
-        const nextIdx = cycleCandidateIdx(this.state.candidateIdx, this.state.originals.length, dir);
-        if (nextIdx === null) {
-            return false;
-        }
-        this.state.candidateIdx = nextIdx;
-        this.state.cycledCount++;
-        return true;
-    }
-    /**
-     * Perform a word-level partial accept on the currently displayed
-     * candidate. APPEND MODE ONLY — callers must check
-     * `!ghostReplaceFrom && cursorAtEnd()` before invoking. Naming
-     * deliberately includes `Append` so the invariant is impossible to
-     * forget at the call site.
-     *
-     * Returns the chunk that should be inserted now, plus the remaining
-     * ghost suffix (or `null` if this was the final chunk). When `remaining`
-     * is `null` the caller is responsible for finalizing and calling
-     * `reset()` — the manager does NOT auto-reset so lifecycle stays
-     * explicit.
-     */
-    acceptPartialWordAppend() {
-        const cur = this.current;
-        if (cur === null || cur.length === 0) {
-            return { chunk: "", remaining: null };
-        }
-        const chunk = nextWordChunk(cur);
-        if (!chunk) {
-            return { chunk: "", remaining: null };
-        }
-        const idx = this.state.candidateIdx;
-        this.state.consumed[idx] = (this.state.consumed[idx] ?? 0) + chunk.length;
-        this.state.partialAccepts++;
-        const tail = cur.slice(chunk.length);
-        return { chunk, remaining: tail.length === 0 ? null : tail };
-    }
-    /**
-     * Snapshot for diagnostics / metrics (no raw candidate text leaked).
-     */
-    snapshot() {
-        return {
-            count: this.state.originals.length,
-            idx: this.state.candidateIdx,
-            cycled: this.state.cycledCount,
-            partials: this.state.partialAccepts,
-        };
-    }
-}
-//# sourceMappingURL=cycle-manager.js.map

package/dist/cycle-manager.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cycle-manager.js","sourceRoot":"","sources":["../src/cycle-manager.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAkBH,SAAS,UAAU;IAClB,OAAO;QACN,SAAS,EAAE,MAAM,CAAC,MAAM,CAAW,EAAE,CAAC;QACtC,QAAQ,EAAE,EAAE;QACZ,YAAY,EAAE,CAAC;QACf,WAAW,EAAE,CAAC;QACd,cAAc,EAAE,CAAC;KACjB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,UAAkB,EAAE,GAAW,EAAE,GAAW;IAC7E,IAAI,GAAG,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1B,MAAM,IAAI,GAAG,UAAU,GAAG,GAAG,CAAC;IAC9B,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,GAAG;QAAE,OAAO,IAAI,CAAC;IACzC,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa;IAC1C,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IACtB,MAAM,CAAC,GAAG,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACtB,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,YAAY;IAChB,KAAK,GAAe,UAAU,EAAE,CAAC;IAEzC,KAAK;QACJ,IAAI,CAAC,KAAK,GAAG,UAAU,EAAE,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,KAAe;QAC5B,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpE,IAAI,CAAC,KAAK,GAAG;YACZ,SAAS;YACT,QAAQ,EAAE,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7C,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,CAAC;YACd,cAAc,EAAE,CAAC;SACjB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,IAAI,UAAU;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;IAC7B,CAAC;IAED;;;;;OAKG;IACH,IAAI,OAAO;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACxD,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACjC,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,IAAI,WAAW;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC;IAC/B,CAAC;IAED,IAAI,cAAc;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC;IAClC,CAAC;IAED,IAAI,YAAY;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC;IAChC,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,GAAW;QAChB,MAAM,OAAO,GAAG,iBAAiB,CAChC,IAAI,CAAC,KAAK,CAAC,YAAY,EACvB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAC3B,GAAG,CACH,CAAC;QACF,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACtB,OAAO,KAAK,CAAC;QACd,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,OAAO,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,uBAAuB;QACtB,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC;QACzB,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtC,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;QACvC,CAAC;QACD,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,EAAE,CAAC;YACZ,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;QACvC,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC;QACpC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QAC1E,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9D,CAAC;IAED;;OAEG;IACH,QAAQ;QACP,OAAO;YACN,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM;YAClC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY;YAC5B,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW;YAC9B,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc;SACnC,CAAC;IACH,CAAC;CACD"}

package/dist/edit-history-ring.d.ts

@@ -1,148 +0,0 @@
-/**
- * Edit-history ring + aggregated index. Enhancement #1
- * (Next-Edit-Prediction motivated). See `docs/edit-history-signals-spec.md`.
- *
- * Records the most recent K edits (default 32) made in-session, then
- * exposes:
- *  - a `snapshot()` of newest-first events with age filtering, and
- *  - an `index()` of decayed token frequencies + per-URI line proximity.
- *
- * The reranker reads `index()` to compute `editProximityBoost`; the M6
- * context selector reads it (opt-in) for a token-overlap locality bit.
- *
- * Privacy: events are pre-sanitized at capture (`containsSensitive` on
- * the raw added/removed text — caller is responsible for invoking it
- * before calling `record`). Only tokens + scalars + URIs survive. No
- * raw text is ever stored on the ring. The ring lives in-process only —
- * no persistence in v0.5.
- */
-export declare const TOKEN_CAP_PER_EVENT = 16;
-export declare const DEFAULT_CAPACITY = 32;
-export declare const DEFAULT_MAX_AGE_MS: number;
-export declare const DEFAULT_HALF_LIFE_MS: number;
-export interface EditEvent {
-    ts: number;
-    uri: string;
-    rangeStartLine: number;
-    addedTokens: string[];
-    removedTokens: string[];
-    netCharDelta: number;
-}
-export interface EditHistoryIndex {
-    addedFreq: Map<string, number>;
-    removedFreq: Map<string, number>;
-    recentUris: Set<string>;
-    lastEditLineByUri: Map<string, number>;
-    totalEvents: number;
-}
-export interface EditHistoryOpts {
-    capacity?: number;
-    maxAgeMs?: number;
-    halfLifeMs?: number;
-}
-/**
- * Tokenize text using the same regex as `profile.ts` (`\b[\w][\w-]*\b`).
- * Code identifiers are case-sensitive — we do NOT lowercase. Result is
- * capped at `TOKEN_CAP_PER_EVENT` to bound memory per event.
- */
-export declare function tokenize(text: string): string[];
-/**
- * Exponential time-decay weight: 1.0 at `ageMs=0`, halves every
- * `halfLifeMs`. Pure helper for tests + index().
- */
-export declare function timeDecayWeight(ageMs: number, halfLifeMs?: number): number;
-export declare class EditHistoryRing {
-    private readonly events;
-    readonly capacity: number;
-    readonly maxAgeMs: number;
-    readonly halfLifeMs: number;
-    constructor(opts?: EditHistoryOpts);
-    /**
-     * Append an event. `ts` defaults to `Date.now()`. Caller is responsible
-     * for sanitization — the ring does not re-validate. Overflow drops the
-     * oldest event.
-     */
-    record(ev: Omit<EditEvent, "ts"> & {
-        ts?: number;
-    }): void;
-    /**
-     * Newest-first list of events not older than `maxAgeMs`. Returns a
-     * copy — safe for the caller to retain.
-     *
-     * Scans without early-break: we cannot assume `record()` was called in
-     * ts-monotonic order (a backfill or test clock could insert older
-     * events after newer ones). At capacity=32 the scan cost is trivial.
-     */
-    snapshot(now?: number): EditEvent[];
-    /**
-     * Aggregated index of recent edit signals, with exponential time-decay
-     * applied to token frequencies. URIs touched within `maxAgeMs` are
-     * collected; the *most recent* edit line per URI is kept (used by the
-     * reranker for line-proximity scoring).
-     */
-    index(now?: number): EditHistoryIndex;
-    clear(): void;
-    get size(): number;
-}
-/** Default per-entry size cap. 1 MB — large enough for any realistic
- *  source file, small enough that 16 × 1MB = 16MB worst-case is bounded. */
-export declare const DEFAULT_PRE_EDIT_MAX_BYTES: number;
-/**
- * Per-document pre-edit text cache. Holds the most recent `capacity`
- * document texts so we can derive the *removed* slice of an edit before
- * the on-disk text mutates. LRU-bounded to avoid pinning every project
- * file in RAM. v0.5 stores transiently in process only — never persisted.
- *
- * Per-entry size is capped at `maxBytesPerEntry` (default 1 MB). Texts
- * exceeding the cap are stored as empty string — the next edit on that
- * document will derive empty `removedTokens`, which is the same
- * degradation as a fresh LRU miss. This bounds worst-case memory at
- * `capacity * maxBytesPerEntry` regardless of project file sizes.
- */
-export declare class PreEditTextCache {
-    private readonly map;
-    readonly capacity: number;
-    readonly maxBytesPerEntry: number;
-    constructor(capacity?: number, maxBytesPerEntry?: number);
-    /** Returns the snapshot for `uri` (or `""` if absent) without touching LRU order. */
-    peek(uri: string): string;
-    /**
-     * Update the snapshot. Move-to-front semantics; oldest is evicted when
-     * capacity is exceeded. Texts exceeding `maxBytesPerEntry` are stored
-     * as empty string (the next edit on this URI gets no `removedTokens`,
-     * matching the LRU-miss degradation path).
-     *
-     * Byte length uses UTF-16 code units (`text.length`), not UTF-8 bytes —
-     * the cap is approximate but stable across machines.
-     */
-    update(uri: string, text: string): void;
-    clear(): void;
-    get size(): number;
-}
-/**
- * Spec §5.1 — compute the raw `editProximityScore` for a candidate. Pure
- * function. Returns 0 when the ring is empty (zero events). Output is
- * un-normalized: the reranker's min-max normalization re-maps the value
- * across the candidate set so absolute scale doesn't matter — only the
- * relative ordering does. The same un-normalized value is reported on
- * the `MetricRecord` for observability.
- *
- * `currentUri` / `currentLine` describe the user's cursor at predict
- * time. The prompt-buffer editor uses a static `"prompt"` URI sentinel
- * and the current cursor line.
- */
-export declare function editProximityScore(text: string, index: EditHistoryIndex, currentUri: string, currentLine: number): number;
-/**
- * Pure character-diff helper. Returns the minimal `{ added, removed }`
- * slice between two strings by stripping the common prefix + suffix.
- * Caller is responsible for `containsSensitive` checks before tokenizing
- * the result. Returns empty strings for both sides when texts are equal.
- */
-export declare function diffStrings(prev: string, next: string): {
-    added: string;
-    removed: string;
-};
-export declare function readEditHistoryEnv(env?: Record<string, string | undefined>): Required<EditHistoryOpts> & {
-    enabled: boolean;
-};
-//# sourceMappingURL=edit-history-ring.d.ts.map

package/dist/edit-history-ring.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"edit-history-ring.d.ts","sourceRoot":"","sources":["../src/edit-history-ring.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAGH,eAAO,MAAM,mBAAmB,KAAK,CAAC;AACtC,eAAO,MAAM,gBAAgB,KAAK,CAAC;AACnC,eAAO,MAAM,kBAAkB,QAAiB,CAAC;AACjD,eAAO,MAAM,oBAAoB,QAAgB,CAAC;AAElD,MAAM,WAAW,SAAS;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,GAAG,EAAE,MAAM,CAAC;IACZ,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,gBAAgB;IAChC,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACxB,iBAAiB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACvC,WAAW,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,eAAe;IAC/B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAQ/C;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,GAAE,MAA6B,GAAG,MAAM,CAIhG;AAED,qBAAa,eAAe;IAC3B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAmB;IAC1C,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;gBAEhB,IAAI,GAAE,eAAoB;IAMtC;;;;OAIG;IACH,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,GAAG;QAAE,EAAE,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI;IAazD;;;;;;;OAOG;IACH,QAAQ,CAAC,GAAG,GAAE,MAAmB,GAAG,SAAS,EAAE;IAU/C;;;;;OAKG;IACH,KAAK,CAAC,GAAG,GAAE,MAAmB,GAAG,gBAAgB;IAsBjD,KAAK,IAAI,IAAI;IAIb,IAAI,IAAI,IAAI,MAAM,CAEjB;CACD;AAED;4EAC4E;AAC5E,eAAO,MAAM,0BAA0B,QAAc,CAAC;AAEtD;;;;;;;;;;;GAWG;AACH,qBAAa,gBAAgB;IAC5B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAA6B;IACjD,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;gBAEtB,QAAQ,SAAK,EAAE,gBAAgB,GAAE,MAAmC;IAKhF,qFAAqF;IACrF,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAIzB;;;;;;;;OAQG;IACH,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAWvC,KAAK,IAAI,IAAI;IAIb,IAAI,IAAI,IAAI,MAAM,CAEjB;CACD;AAaD;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CACjC,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,gBAAgB,EACvB,UAAU,EAAE,MAAM,EAClB,WAAW,EAAE,MAAM,GACjB,MAAM,CAeR;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAgB1F;AAED,wBAAgB,kBAAkB,CACjC,GAAG,GAAE,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAe,GACnD,QAAQ,CAAC,eAAe,CAAC,GAAG;IAAE,OAAO,EAAE,OAAO,CAAA;CAAE,CAiBlD"}