daftari 1.0.0

package/dist/search/bm25.js

@@ -0,0 +1,115 @@
+// BM25 lexical ranking, hand-rolled and dependency-free.
+//
+// BM25 scores a document for a query by summing, over each query term, an IDF
+// weight times a saturating term-frequency factor. It is the lexical half of
+// hybrid search: it rewards exact word overlap, which embeddings tend to blur.
+//
+// The vault is a curated knowledge base (tens to low-hundreds of documents),
+// so the whole corpus is ranked in memory on every query. No inverted index.
+// Okapi BM25 free parameters. k1 controls term-frequency saturation; b controls
+// how strongly document length normalises the score. These are the standard
+// defaults and need no tuning at this corpus size.
+const K1 = 1.5;
+const B = 0.75;
+// Common English words carry no discriminating signal; dropping them keeps IDF
+// meaningful and snippets pointed at content words.
+const STOPWORDS = new Set([
+    "a",
+    "an",
+    "and",
+    "are",
+    "as",
+    "at",
+    "be",
+    "but",
+    "by",
+    "for",
+    "from",
+    "has",
+    "have",
+    "he",
+    "her",
+    "his",
+    "in",
+    "is",
+    "it",
+    "its",
+    "of",
+    "on",
+    "or",
+    "she",
+    "that",
+    "the",
+    "their",
+    "them",
+    "they",
+    "this",
+    "to",
+    "was",
+    "were",
+    "will",
+    "with",
+    "you",
+    "your",
+]);
+// Lowercases, splits on any non-alphanumeric run, and drops stopwords and
+// 1-character fragments. Used identically for documents and queries so the
+// term spaces line up.
+export function tokenize(text) {
+    return text
+        .toLowerCase()
+        .split(/[^a-z0-9]+/)
+        .filter((t) => t.length > 1 && !STOPWORDS.has(t));
+}
+export function buildBm25(docs) {
+    const termFreqs = new Map();
+    const docFreqs = new Map();
+    const docLengths = new Map();
+    let totalLength = 0;
+    for (const doc of docs) {
+        const tf = new Map();
+        for (const term of doc.tokens) {
+            tf.set(term, (tf.get(term) ?? 0) + 1);
+        }
+        termFreqs.set(doc.path, tf);
+        docLengths.set(doc.path, doc.tokens.length);
+        totalLength += doc.tokens.length;
+        for (const term of tf.keys()) {
+            docFreqs.set(term, (docFreqs.get(term) ?? 0) + 1);
+        }
+    }
+    return {
+        termFreqs,
+        docFreqs,
+        docLengths,
+        docCount: docs.length,
+        avgDocLength: docs.length > 0 ? totalLength / docs.length : 0,
+    };
+}
+// Scores every document against the query terms and returns the matches
+// (score > 0) sorted high to low. A document with zero query-term overlap is
+// omitted entirely rather than returned with a zero score.
+export function searchBm25(model, queryTokens) {
+    const hits = [];
+    const uniqueQueryTerms = [...new Set(queryTokens)];
+    for (const [path, tf] of model.termFreqs) {
+        const docLength = model.docLengths.get(path) ?? 0;
+        let score = 0;
+        for (const term of uniqueQueryTerms) {
+            const freq = tf.get(term) ?? 0;
+            if (freq === 0)
+                continue;
+            const df = model.docFreqs.get(term) ?? 0;
+            // IDF with the +1 inside the log keeps it non-negative even for terms
+            // that appear in more than half the corpus.
+            const idf = Math.log(1 + (model.docCount - df + 0.5) / (df + 0.5));
+            const denom = freq + K1 * (1 - B + (B * docLength) / (model.avgDocLength || 1));
+            score += idf * ((freq * (K1 + 1)) / denom);
+        }
+        if (score > 0)
+            hits.push({ path, score });
+    }
+    hits.sort((a, b) => b.score - a.score);
+    return hits;
+}
+//# sourceMappingURL=bm25.js.map

package/dist/search/bm25.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bm25.js","sourceRoot":"","sources":["../../src/search/bm25.ts"],"names":[],"mappings":"AAAA,yDAAyD;AACzD,EAAE;AACF,8EAA8E;AAC9E,6EAA6E;AAC7E,+EAA+E;AAC/E,EAAE;AACF,6EAA6E;AAC7E,6EAA6E;AAE7E,gFAAgF;AAChF,4EAA4E;AAC5E,mDAAmD;AACnD,MAAM,EAAE,GAAG,GAAG,CAAC;AACf,MAAM,CAAC,GAAG,IAAI,CAAC;AAEf,+EAA+E;AAC/E,oDAAoD;AACpD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACxB,GAAG;IACH,IAAI;IACJ,KAAK;IACL,KAAK;IACL,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,KAAK;IACL,MAAM;IACN,KAAK;IACL,MAAM;IACN,IAAI;IACJ,KAAK;IACL,KAAK;IACL,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,MAAM;IACN,KAAK;IACL,OAAO;IACP,MAAM;IACN,MAAM;IACN,MAAM;IACN,IAAI;IACJ,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,KAAK;IACL,MAAM;CACP,CAAC,CAAC;AAEH,0EAA0E;AAC1E,2EAA2E;AAC3E,uBAAuB;AACvB,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,KAAK,CAAC,YAAY,CAAC;SACnB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACtD,CAAC;AAkBD,MAAM,UAAU,SAAS,CAAC,IAAoB;IAC5C,MAAM,SAAS,GAAG,IAAI,GAAG,EAA+B,CAAC;IACzD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAC9B,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC5B,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5C,WAAW,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC;QACjC,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7B,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,OAAO;QACL,SAAS;QACT,QAAQ;QACR,UAAU;QACV,QAAQ,EAAE,IAAI,CAAC,MAAM;QACrB,YAAY,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;KAC9D,CAAC;AACJ,CAAC;AAOD,wEAAwE;AACxE,6EAA6E;AAC7E,2DAA2D;AAC3D,MAAM,UAAU,UAAU,CAAC,KAAgB,EAAE,WAAqB;IAChE,MAAM,IAAI,GAAc,EAAE,CAAC;IAC3B,MAAM,gBAAgB,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;IAEnD,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,gBAAgB,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,IAAI,KAAK,CAAC;gBAAE,SAAS;YACzB,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzC,sEAAsE;YACtE,4CAA4C;YAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;YACnE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC,CAAC;YAChF,KAAK,IAAI,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,KAAK,GAAG,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACvC,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/search/hybrid.d.ts

@@ -0,0 +1,38 @@
+import { type Result } from "../frontmatter/types.js";
+import { type IndexDb } from "../storage/index-db.js";
+export interface HybridWeights {
+    bm25: number;
+    vector: number;
+}
+export declare const DEFAULT_WEIGHTS: HybridWeights;
+export interface HybridHit {
+    path: string;
+    title: string;
+    collection: string;
+    status: string;
+    score: number;
+    bm25Score: number;
+    vectorScore: number;
+    snippet: string;
+}
+export interface HybridSearchResult {
+    query: string;
+    count: number;
+    vectorUsed: boolean;
+    weights: HybridWeights;
+    hits: HybridHit[];
+}
+export interface HybridSearchOptions {
+    weights?: HybridWeights;
+    limit?: number;
+}
+export declare function hybridSearch(db: IndexDb, query: string, options?: HybridSearchOptions): Promise<Result<HybridSearchResult, Error>>;
+export interface RelatedSearchResult {
+    path: string;
+    count: number;
+    vectorUsed: boolean;
+    weights: HybridWeights;
+    hits: HybridHit[];
+}
+export declare function relatedSearch(db: IndexDb, path: string, options?: HybridSearchOptions): Result<RelatedSearchResult, Error>;
+//# sourceMappingURL=hybrid.d.ts.map

package/dist/search/hybrid.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hybrid.d.ts","sourceRoot":"","sources":["../../src/search/hybrid.ts"],"names":[],"mappings":"AAUA,OAAO,EAAM,KAAK,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAKL,KAAK,OAAO,EACb,MAAM,wBAAwB,CAAC;AAIhC,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,eAAO,MAAM,eAAe,EAAE,aAA0C,CAAC;AAEzE,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,OAAO,CAAC;IACpB,OAAO,EAAE,aAAa,CAAC;IACvB,IAAI,EAAE,SAAS,EAAE,CAAC;CACnB;AA8GD,MAAM,WAAW,mBAAmB;IAClC,OAAO,CAAC,EAAE,aAAa,CAAC;IACxB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAGD,wBAAsB,YAAY,CAChC,EAAE,EAAE,OAAO,EACX,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,mBAAwB,GAChC,OAAO,CAAC,MAAM,CAAC,kBAAkB,EAAE,KAAK,CAAC,CAAC,CAqB5C;AAED,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,OAAO,CAAC;IACpB,OAAO,EAAE,aAAa,CAAC;IACvB,IAAI,EAAE,SAAS,EAAE,CAAC;CACnB;AAOD,wBAAgB,aAAa,CAC3B,EAAE,EAAE,OAAO,EACX,IAAI,EAAE,MAAM,EACZ,OAAO,GAAE,mBAAwB,GAChC,MAAM,CAAC,mBAAmB,EAAE,KAAK,CAAC,CA8BpC"}

package/dist/search/hybrid.js

@@ -0,0 +1,162 @@
+// Hybrid search: combine BM25 lexical ranking with vector semantic ranking.
+//
+// Each ranker produces raw scores on its own scale, so both are min-normalised
+// to [0, 1] (divide by the top score) before being mixed by weight. Default
+// weighting is an even 0.5 / 0.5 split.
+//
+// Vector ranking is best-effort. If the query cannot be embedded (model
+// unavailable) or the index holds no embeddings, the search degrades to
+// lexical-only and reports vectorUsed: false rather than failing.
+import { ok } from "../frontmatter/types.js";
+import { getAllChunks, getAllDocuments, getChunksForPath, getDocument, } from "../storage/index-db.js";
+import { buildBm25, searchBm25, tokenize } from "./bm25.js";
+import { cosineSimilarity, embedQuery, meanEmbedding } from "./vector.js";
+export const DEFAULT_WEIGHTS = { bm25: 0.5, vector: 0.5 };
+const SNIPPET_RADIUS = 140;
+// Pulls a readable excerpt from a document body, centred on the earliest
+// occurrence of any query term. Falls back to the document head when no term
+// is found (e.g. a purely semantic match).
+function makeSnippet(content, queryTokens) {
+    const collapsed = content.replace(/\s+/g, " ").trim();
+    if (collapsed.length === 0)
+        return "";
+    const lower = collapsed.toLowerCase();
+    let hitAt = -1;
+    for (const term of queryTokens) {
+        const at = lower.indexOf(term);
+        if (at !== -1 && (hitAt === -1 || at < hitAt))
+            hitAt = at;
+    }
+    if (hitAt === -1) {
+        return collapsed.length > SNIPPET_RADIUS * 2
+            ? `${collapsed.slice(0, SNIPPET_RADIUS * 2)}…`
+            : collapsed;
+    }
+    const start = Math.max(0, hitAt - SNIPPET_RADIUS);
+    const end = Math.min(collapsed.length, hitAt + SNIPPET_RADIUS);
+    let snippet = collapsed.slice(start, end);
+    if (start > 0)
+        snippet = `…${snippet}`;
+    if (end < collapsed.length)
+        snippet = `${snippet}…`;
+    return snippet;
+}
+// Divides every score by the largest so the top hit becomes 1.0. An empty or
+// all-zero map normalises to all zeros.
+function normalize(scores) {
+    let max = 0;
+    for (const v of scores.values())
+        if (v > max)
+            max = v;
+    if (max === 0)
+        return new Map([...scores].map(([k]) => [k, 0]));
+    return new Map([...scores].map(([k, v]) => [k, v / max]));
+}
+// Core ranker shared by query search and related-document search. queryTokens
+// drives BM25; queryEmbedding (when present) drives vector similarity against
+// every embedded chunk, taking each document's best-matching chunk.
+function rankDocuments(db, queryTokens, queryEmbedding, opts) {
+    const documents = getAllDocuments(db);
+    const byPath = new Map(documents.map((d) => [d.path, d]));
+    const bm25Model = buildBm25(documents.map((d) => ({ path: d.path, tokens: d.tokens })));
+    const bm25Raw = new Map();
+    for (const hit of searchBm25(bm25Model, queryTokens)) {
+        bm25Raw.set(hit.path, hit.score);
+    }
+    const vectorRaw = new Map();
+    let vectorUsed = false;
+    if (queryEmbedding) {
+        for (const chunk of getAllChunks(db)) {
+            if (!chunk.embedding)
+                continue;
+            vectorUsed = true;
+            const sim = cosineSimilarity(queryEmbedding, chunk.embedding);
+            const prev = vectorRaw.get(chunk.path) ?? -Infinity;
+            if (sim > prev)
+                vectorRaw.set(chunk.path, sim);
+        }
+    }
+    const bm25Norm = normalize(bm25Raw);
+    const vectorNorm = normalize(vectorRaw);
+    // With no usable vector signal, lexical ranking carries the full weight.
+    const weights = vectorUsed ? opts.weights : { bm25: 1, vector: 0 };
+    const candidates = new Set([...bm25Norm.keys(), ...vectorNorm.keys()]);
+    const hits = [];
+    for (const path of candidates) {
+        if (path === opts.excludePath)
+            continue;
+        const doc = byPath.get(path);
+        if (!doc)
+            continue;
+        const bm25Score = bm25Norm.get(path) ?? 0;
+        const vectorScore = vectorNorm.get(path) ?? 0;
+        const score = weights.bm25 * bm25Score + weights.vector * vectorScore;
+        if (score <= 0)
+            continue;
+        hits.push({
+            path,
+            title: doc.title,
+            collection: doc.collection,
+            status: doc.status,
+            score,
+            bm25Score,
+            vectorScore,
+            snippet: makeSnippet(doc.content, queryTokens),
+        });
+    }
+    hits.sort((a, b) => b.score - a.score);
+    return { hits: hits.slice(0, opts.limit), vectorUsed };
+}
+// Ranks vault documents against a free-text query.
+export async function hybridSearch(db, query, options = {}) {
+    const weights = options.weights ?? DEFAULT_WEIGHTS;
+    const limit = options.limit ?? 10;
+    const queryTokens = tokenize(query);
+    const embedResult = await embedQuery(query);
+    const queryEmbedding = embedResult.ok ? embedResult.value : null;
+    const { hits, vectorUsed } = rankDocuments(db, queryTokens, queryEmbedding, {
+        weights,
+        limit,
+        excludePath: undefined,
+    });
+    return ok({
+        query,
+        count: hits.length,
+        vectorUsed,
+        weights: vectorUsed ? weights : { bm25: 1, vector: 0 },
+        hits,
+    });
+}
+// Finds documents related to an already-indexed document. The source document
+// itself is the query: its BM25 tokens drive lexical similarity and the mean
+// of its chunk embeddings drives semantic similarity. The source is excluded
+// from its own results. Needs no embedding model — it reuses vectors already
+// stored in the index.
+export function relatedSearch(db, path, options = {}) {
+    const weights = options.weights ?? DEFAULT_WEIGHTS;
+    const limit = options.limit ?? 10;
+    const doc = getDocument(db, path);
+    if (!doc) {
+        return {
+            ok: false,
+            error: new Error(`document not indexed: ${path} (try vault_reindex)`),
+        };
+    }
+    const chunkVectors = getChunksForPath(db, path)
+        .map((c) => c.embedding)
+        .filter((e) => e !== null);
+    const queryEmbedding = meanEmbedding(chunkVectors);
+    const { hits, vectorUsed } = rankDocuments(db, doc.tokens, queryEmbedding, {
+        weights,
+        limit,
+        excludePath: path,
+    });
+    return ok({
+        path,
+        count: hits.length,
+        vectorUsed,
+        weights: vectorUsed ? weights : { bm25: 1, vector: 0 },
+        hits,
+    });
+}
+//# sourceMappingURL=hybrid.js.map

package/dist/search/hybrid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hybrid.js","sourceRoot":"","sources":["../../src/search/hybrid.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,EAAE;AACF,+EAA+E;AAC/E,4EAA4E;AAC5E,wCAAwC;AACxC,EAAE;AACF,wEAAwE;AACxE,wEAAwE;AACxE,kEAAkE;AAElE,OAAO,EAAE,EAAE,EAAe,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EACL,YAAY,EACZ,eAAe,EACf,gBAAgB,EAChB,WAAW,GAEZ,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC5D,OAAO,EAAE,gBAAgB,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAO1E,MAAM,CAAC,MAAM,eAAe,GAAkB,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;AAqBzE,MAAM,cAAc,GAAG,GAAG,CAAC;AAE3B,yEAAyE;AACzE,6EAA6E;AAC7E,2CAA2C;AAC3C,SAAS,WAAW,CAAC,OAAe,EAAE,WAAqB;IACzD,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACtD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACtC,MAAM,KAAK,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;IAEtC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC;YAAE,KAAK,GAAG,EAAE,CAAC;IAC5D,CAAC;IAED,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;QACjB,OAAO,SAAS,CAAC,MAAM,GAAG,cAAc,GAAG,CAAC;YAC1C,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,GAAG,CAAC,CAAC,GAAG;YAC9C,CAAC,CAAC,SAAS,CAAC;IAChB,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,cAAc,CAAC,CAAC;IAClD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,GAAG,cAAc,CAAC,CAAC;IAC/D,IAAI,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAC1C,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,GAAG,IAAI,OAAO,EAAE,CAAC;IACvC,IAAI,GAAG,GAAG,SAAS,CAAC,MAAM;QAAE,OAAO,GAAG,GAAG,OAAO,GAAG,CAAC;IACpD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,6EAA6E;AAC7E,wCAAwC;AACxC,SAAS,SAAS,CAAC,MAA2B;IAC5C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE;QAAE,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;IACtD,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAC5D,CAAC;AAQD,8EAA8E;AAC9E,8EAA8E;AAC9E,oEAAoE;AACpE,SAAS,aAAa,CACpB,EAAW,EACX,WAAqB,EACrB,cAAmC,EACnC,IAAiB;IAEjB,MAAM,SAAS,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;IACtC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1D,MAAM,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;IACxF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,SAAS,EAAE,WAAW,CAAC,EAAE,CAAC;QACrD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,IAAI,cAAc,EAAE,CAAC;QACnB,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC;YACrC,IAAI,CAAC,KAAK,CAAC,SAAS;gBAAE,SAAS;YAC/B,UAAU,GAAG,IAAI,CAAC;YAClB,MAAM,GAAG,GAAG,gBAAgB,CAAC,cAAc,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YAC9D,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;YACpD,IAAI,GAAG,GAAG,IAAI;gBAAE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IACpC,MAAM,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;IAExC,yEAAyE;IACzE,MAAM,OAAO,GAAkB,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAElF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAE/E,MAAM,IAAI,GAAgB,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,IAAI,KAAK,IAAI,CAAC,WAAW;YAAE,SAAS;QACxC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,GAAG,SAAS,GAAG,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC;QACtE,IAAI,KAAK,IAAI,CAAC;YAAE,SAAS;QACzB,IAAI,CAAC,IAAI,CAAC;YACR,IAAI;YACJ,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,KAAK;YACL,SAAS;YACT,WAAW;YACX,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC;SAC/C,CAAC,CAAC;IACL,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACvC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC;AACzD,CAAC;AAOD,mDAAmD;AACnD,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,EAAW,EACX,KAAa,EACb,UAA+B,EAAE;IAEjC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,eAAe,CAAC;IACnD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;IAClC,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAEpC,MAAM,WAAW,GAAG,MAAM,UAAU,CAAC,KAAK,CAAC,CAAC;IAC5C,MAAM,cAAc,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IAEjE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,aAAa,CAAC,EAAE,EAAE,WAAW,EAAE,cAAc,EAAE;QAC1E,OAAO;QACP,KAAK;QACL,WAAW,EAAE,SAAS;KACvB,CAAC,CAAC;IAEH,OAAO,EAAE,CAAC;QACR,KAAK;QACL,KAAK,EAAE,IAAI,CAAC,MAAM;QAClB,UAAU;QACV,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;QACtD,IAAI;KACL,CAAC,CAAC;AACL,CAAC;AAUD,8EAA8E;AAC9E,6EAA6E;AAC7E,6EAA6E;AAC7E,6EAA6E;AAC7E,uBAAuB;AACvB,MAAM,UAAU,aAAa,CAC3B,EAAW,EACX,IAAY,EACZ,UAA+B,EAAE;IAEjC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,eAAe,CAAC;IACnD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;IAElC,MAAM,GAAG,GAAG,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAClC,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,IAAI,KAAK,CAAC,yBAAyB,IAAI,sBAAsB,CAAC;SACtE,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAG,gBAAgB,CAAC,EAAE,EAAE,IAAI,CAAC;SAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;SACvB,MAAM,CAAC,CAAC,CAAC,EAAqB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IAChD,MAAM,cAAc,GAAG,aAAa,CAAC,YAAY,CAAC,CAAC;IAEnD,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,aAAa,CAAC,EAAE,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,EAAE;QACzE,OAAO;QACP,KAAK;QACL,WAAW,EAAE,IAAI;KAClB,CAAC,CAAC;IAEH,OAAO,EAAE,CAAC;QACR,IAAI;QACJ,KAAK,EAAE,IAAI,CAAC,MAAM;QAClB,UAAU;QACV,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;QACtD,IAAI;KACL,CAAC,CAAC;AACL,CAAC"}

package/dist/search/reindex.d.ts

@@ -0,0 +1,15 @@
+import { type Result } from "../frontmatter/types.js";
+export interface ReindexResult {
+    documentCount: number;
+    chunkCount: number;
+    vectorEnabled: boolean;
+    skipped: string[];
+    indexedAt: string;
+}
+export declare function reindexVault(vaultRoot: string): Promise<Result<ReindexResult, Error>>;
+export interface IndexDocumentResult {
+    chunkCount: number;
+    vectorEnabled: boolean;
+}
+export declare function indexDocument(vaultRoot: string, relPath: string): Promise<Result<IndexDocumentResult, Error>>;
+//# sourceMappingURL=reindex.d.ts.map

package/dist/search/reindex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reindex.d.ts","sourceRoot":"","sources":["../../src/search/reindex.ts"],"names":[],"mappings":"AAWA,OAAO,EAAW,KAAK,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAgB/D,MAAM,WAAW,aAAa;IAC5B,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,OAAO,CAAC;IACvB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAyFD,wBAAsB,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC,CAsC3F;AAED,MAAM,WAAW,mBAAmB;IAClC,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,OAAO,CAAC;CACxB;AAQD,wBAAsB,aAAa,CACjC,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,GACd,OAAO,CAAC,MAAM,CAAC,mBAAmB,EAAE,KAAK,CAAC,CAAC,CAmD7C"}

package/dist/search/reindex.js

@@ -0,0 +1,189 @@
+// Rebuilds the SQLite search index from the markdown files on disk.
+//
+// The index is a derived cache, so a reindex always clears it and rebuilds
+// from scratch — there is no incremental update path to drift out of sync.
+// Called on server start and by the vault_reindex tool / --reindex CLI flag.
+//
+// Embedding is best-effort: every chunk across the whole vault is embedded in
+// one batch. If the model is unavailable the documents (and their BM25 tokens)
+// still index; only the vector column is left NULL and vectorEnabled is false.
+import { parseDocument } from "../frontmatter/parser.js";
+import { err, ok } from "../frontmatter/types.js";
+import { clearIndex, deleteDocument, documentCount, insertChunk, insertDocument, openIndexDb, setMeta, } from "../storage/index-db.js";
+import { listFiles, readFile, resolveVaultPath } from "../storage/local.js";
+import { tokenize } from "./bm25.js";
+import { chunkText, EMBEDDING_DIM, embed } from "./vector.js";
+// Reads and parses a single markdown file into the shape the index needs.
+// Returns null when the file should be skipped (unreadable, or malformed YAML
+// frontmatter) so a reindex never aborts on one bad file.
+async function stageOne(vaultRoot, relPath) {
+    const resolved = resolveVaultPath(vaultRoot, relPath);
+    if (!resolved.ok)
+        return null;
+    const file = await readFile(resolved.value);
+    if (!file.ok)
+        return null;
+    const parsed = parseDocument(file.value);
+    if (!parsed.ok)
+        return null;
+    const fm = parsed.value.frontmatter;
+    const body = parsed.value.content;
+    // BM25 indexes title, tags, and body together so a title- or tag-only
+    // match still ranks.
+    const tokens = tokenize(`${fm.title} ${fm.tags.join(" ")} ${body}`);
+    return {
+        doc: {
+            path: relPath,
+            title: fm.title,
+            collection: fm.collection || (relPath.split("/")[0] ?? ""),
+            domain: fm.domain,
+            status: fm.status,
+            confidence: fm.confidence,
+            updated: fm.updated,
+            tags: fm.tags,
+            content: body,
+            tokens,
+        },
+        chunks: chunkText(body),
+    };
+}
+// Reads and parses every markdown file into the shape the index needs. A file
+// that stageOne rejects is skipped (recorded in `skipped`) rather than
+// aborting the whole rebuild.
+async function stageDocuments(vaultRoot) {
+    const list = await listFiles(vaultRoot);
+    if (!list.ok)
+        return list;
+    const staged = [];
+    const skipped = [];
+    for (const relPath of list.value) {
+        const one = await stageOne(vaultRoot, relPath);
+        if (one)
+            staged.push(one);
+        else
+            skipped.push(relPath);
+    }
+    return ok({ staged, skipped });
+}
+function writeIndex(db, staged, embeddings) {
+    let chunkCount = 0;
+    let cursor = 0;
+    const write = db.transaction(() => {
+        clearIndex(db);
+        for (const { doc, chunks } of staged) {
+            insertDocument(db, doc);
+            chunks.forEach((text, chunkIndex) => {
+                insertChunk(db, {
+                    path: doc.path,
+                    chunkIndex,
+                    text,
+                    embedding: embeddings[cursor] ?? null,
+                });
+                cursor += 1;
+                chunkCount += 1;
+            });
+        }
+    });
+    write();
+    return chunkCount;
+}
+export async function reindexVault(vaultRoot) {
+    const staging = await stageDocuments(vaultRoot);
+    if (!staging.ok)
+        return staging;
+    const { staged, skipped } = staging.value;
+    // One flat list of every chunk's text, embedded in a single batch.
+    const allChunkTexts = [];
+    for (const s of staged)
+        allChunkTexts.push(...s.chunks);
+    const embedResult = await embed(allChunkTexts);
+    const vectorEnabled = embedResult.ok;
+    const embeddings = embedResult.ok
+        ? embedResult.value
+        : allChunkTexts.map(() => null);
+    const dbResult = openIndexDb(vaultRoot);
+    if (!dbResult.ok)
+        return dbResult;
+    const db = dbResult.value;
+    const indexedAt = new Date().toISOString();
+    try {
+        const chunkCount = writeIndex(db, staged, embeddings);
+        setMeta(db, "indexed_at", indexedAt);
+        setMeta(db, "vector_enabled", String(vectorEnabled));
+        setMeta(db, "embedding_dim", String(EMBEDDING_DIM));
+        return ok({
+            documentCount: staged.length,
+            chunkCount,
+            vectorEnabled,
+            skipped,
+            indexedAt,
+        });
+    }
+    catch (e) {
+        const reason = e instanceof Error ? e.message : String(e);
+        return err(new Error(`reindex write failed: ${reason}`));
+    }
+    finally {
+        db.close();
+    }
+}
+// Incrementally updates the index for a single document after a write.
+//
+// If the index has never been built it falls back to a full reindex, so the
+// first write to a fresh vault still produces a complete index rather than a
+// one-document one. Otherwise it re-stages just `relPath`, evicts its stale
+// rows, and re-inserts — embedding only that document's chunks.
+export async function indexDocument(vaultRoot, relPath) {
+    const dbCheck = openIndexDb(vaultRoot);
+    if (!dbCheck.ok)
+        return dbCheck;
+    const indexEmpty = documentCount(dbCheck.value) === 0;
+    dbCheck.value.close();
+    if (indexEmpty) {
+        const full = await reindexVault(vaultRoot);
+        if (!full.ok)
+            return full;
+        return ok({
+            chunkCount: full.value.chunkCount,
+            vectorEnabled: full.value.vectorEnabled,
+        });
+    }
+    const staged = await stageOne(vaultRoot, relPath);
+    if (!staged) {
+        return err(new Error(`cannot index document: ${relPath}`));
+    }
+    const { doc, chunks } = staged;
+    const embedResult = await embed(chunks);
+    const vectorEnabled = embedResult.ok;
+    const embeddings = embedResult.ok
+        ? embedResult.value
+        : chunks.map(() => null);
+    const dbResult = openIndexDb(vaultRoot);
+    if (!dbResult.ok)
+        return dbResult;
+    const db = dbResult.value;
+    try {
+        const write = db.transaction(() => {
+            deleteDocument(db, doc.path);
+            insertDocument(db, doc);
+            chunks.forEach((text, chunkIndex) => {
+                insertChunk(db, {
+                    path: doc.path,
+                    chunkIndex,
+                    text,
+                    embedding: embeddings[chunkIndex] ?? null,
+                });
+            });
+        });
+        write();
+        return ok({ chunkCount: chunks.length, vectorEnabled });
+    }
+    catch (e) {
+        const reason = e instanceof Error ? e.message : String(e);
+        return err(new Error(`index update failed: ${reason}`));
+    }
+    finally {
+        db.close();
+    }
+}
+//# sourceMappingURL=reindex.js.map

package/dist/search/reindex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reindex.js","sourceRoot":"","sources":["../../src/search/reindex.ts"],"names":[],"mappings":"AAAA,oEAAoE;AACpE,EAAE;AACF,2EAA2E;AAC3E,2EAA2E;AAC3E,6EAA6E;AAC7E,EAAE;AACF,8EAA8E;AAC9E,+EAA+E;AAC/E,+EAA+E;AAE/E,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACzD,OAAO,EAAE,GAAG,EAAE,EAAE,EAAe,MAAM,yBAAyB,CAAC;AAC/D,OAAO,EACL,UAAU,EACV,cAAc,EACd,aAAa,EAGb,WAAW,EACX,cAAc,EACd,WAAW,EACX,OAAO,GACR,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAC5E,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrC,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAe9D,0EAA0E;AAC1E,8EAA8E;AAC9E,0DAA0D;AAC1D,KAAK,UAAU,QAAQ,CAAC,SAAiB,EAAE,OAAe;IACxD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACtD,IAAI,CAAC,QAAQ,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAC9B,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC5C,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAC1B,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,CAAC,MAAM,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAE5B,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC;IACpC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC;IAClC,sEAAsE;IACtE,qBAAqB;IACrB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;IAEpE,OAAO;QACL,GAAG,EAAE;YACH,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,EAAE,CAAC,KAAK;YACf,UAAU,EAAE,EAAE,CAAC,UAAU,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC1D,MAAM,EAAE,EAAE,CAAC,MAAM;YACjB,MAAM,EAAE,EAAE,CAAC,MAAM;YACjB,UAAU,EAAE,EAAE,CAAC,UAAU;YACzB,OAAO,EAAE,EAAE,CAAC,OAAO;YACnB,IAAI,EAAE,EAAE,CAAC,IAAI;YACb,OAAO,EAAE,IAAI;YACb,MAAM;SACP;QACD,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC;KACxB,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,uEAAuE;AACvE,8BAA8B;AAC9B,KAAK,UAAU,cAAc,CAC3B,SAAiB;IAEjB,MAAM,IAAI,GAAG,MAAM,SAAS,CAAC,SAAS,CAAC,CAAC;IACxC,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAE1B,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC/C,IAAI,GAAG;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YACrB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;AACjC,CAAC;AAED,SAAS,UAAU,CACjB,EAAW,EACX,MAAwB,EACxB,UAAmC;IAEnC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;QAChC,UAAU,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACrC,cAAc,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACxB,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE;gBAClC,WAAW,CAAC,EAAE,EAAE;oBACd,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,UAAU;oBACV,IAAI;oBACJ,SAAS,EAAE,UAAU,CAAC,MAAM,CAAC,IAAI,IAAI;iBACtC,CAAC,CAAC;gBACH,MAAM,IAAI,CAAC,CAAC;gBACZ,UAAU,IAAI,CAAC,CAAC;YAClB,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC;IACH,KAAK,EAAE,CAAC;IACR,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,SAAiB;IAClD,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,SAAS,CAAC,CAAC;IAChD,IAAI,CAAC,OAAO,CAAC,EAAE;QAAE,OAAO,OAAO,CAAC;IAChC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC;IAE1C,mEAAmE;IACnE,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAExD,MAAM,WAAW,GAAG,MAAM,KAAK,CAAC,aAAa,CAAC,CAAC;IAC/C,MAAM,aAAa,GAAG,WAAW,CAAC,EAAE,CAAC;IACrC,MAAM,UAAU,GAA4B,WAAW,CAAC,EAAE;QACxD,CAAC,CAAC,WAAW,CAAC,KAAK;QACnB,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;IAElC,MAAM,QAAQ,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IACxC,IAAI,CAAC,QAAQ,CAAC,EAAE;QAAE,OAAO,QAAQ,CAAC;IAClC,MAAM,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC;IAE1B,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC3C,IAAI,CAAC;QACH,MAAM,UAAU,GAAG,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;QACtD,OAAO,CAAC,EAAE,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;QACrC,OAAO,CAAC,EAAE,EAAE,gBAAgB,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC;QACrD,OAAO,CAAC,EAAE,EAAE,eAAe,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC;QACpD,OAAO,EAAE,CAAC;YACR,aAAa,EAAE,MAAM,CAAC,MAAM;YAC5B,UAAU;YACV,aAAa;YACb,OAAO;YACP,SAAS;SACV,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,MAAM,MAAM,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1D,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,yBAAyB,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3D,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;AACH,CAAC;AAOD,uEAAuE;AACvE,EAAE;AACF,4EAA4E;AAC5E,6EAA6E;AAC7E,4EAA4E;AAC5E,gEAAgE;AAChE,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,SAAiB,EACjB,OAAe;IAEf,MAAM,OAAO,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IACvC,IAAI,CAAC,OAAO,CAAC,EAAE;QAAE,OAAO,OAAO,CAAC;IAChC,MAAM,UAAU,GAAG,aAAa,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACtD,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IAEtB,IAAI,UAAU,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,MAAM,YAAY,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO,IAAI,CAAC;QAC1B,OAAO,EAAE,CAAC;YACR,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU;YACjC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa;SACxC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAClD,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,0BAA0B,OAAO,EAAE,CAAC,CAAC,CAAC;IAC7D,CAAC;IACD,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;IAE/B,MAAM,WAAW,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC;IACxC,MAAM,aAAa,GAAG,WAAW,CAAC,EAAE,CAAC;IACrC,MAAM,UAAU,GAA4B,WAAW,CAAC,EAAE;QACxD,CAAC,CAAC,WAAW,CAAC,KAAK;QACnB,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;IAE3B,MAAM,QAAQ,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IACxC,IAAI,CAAC,QAAQ,CAAC,EAAE;QAAE,OAAO,QAAQ,CAAC;IAClC,MAAM,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC;IAC1B,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YAChC,cAAc,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YAC7B,cAAc,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACxB,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE;gBAClC,WAAW,CAAC,EAAE,EAAE;oBACd,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,UAAU;oBACV,IAAI;oBACJ,SAAS,EAAE,UAAU,CAAC,UAAU,CAAC,IAAI,IAAI;iBAC1C,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QACH,KAAK,EAAE,CAAC;QACR,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,CAAC,CAAC;IAC1D,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,MAAM,MAAM,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1D,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,wBAAwB,MAAM,EAAE,CAAC,CAAC,CAAC;IAC1D,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;AACH,CAAC"}

package/dist/search/vector.d.ts

@@ -0,0 +1,9 @@
+import { type Result } from "../frontmatter/types.js";
+export declare const EMBEDDING_MODEL = "Xenova/all-MiniLM-L6-v2";
+export declare const EMBEDDING_DIM = 384;
+export declare function chunkText(text: string): string[];
+export declare function cosineSimilarity(a: Float32Array, b: Float32Array): number;
+export declare function meanEmbedding(vectors: Float32Array[]): Float32Array | null;
+export declare function embed(texts: string[]): Promise<Result<Float32Array[], Error>>;
+export declare function embedQuery(text: string): Promise<Result<Float32Array, Error>>;
+//# sourceMappingURL=vector.d.ts.map

package/dist/search/vector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector.d.ts","sourceRoot":"","sources":["../../src/search/vector.ts"],"names":[],"mappings":"AAYA,OAAO,EAAW,KAAK,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAE/D,eAAO,MAAM,eAAe,4BAA4B,CAAC;AACzD,eAAO,MAAM,aAAa,MAAM,CAAC;AAQjC,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CA4BhD;AAGD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAczE;AAID,wBAAgB,aAAa,CAAC,OAAO,EAAE,YAAY,EAAE,GAAG,YAAY,GAAG,IAAI,CAW1E;AAqBD,wBAAsB,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,KAAK,CAAC,CAAC,CAkBnF;AAGD,wBAAsB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC,CAMnF"}