@tenphi/akno-core 0.1.0

package/dist/recall/search.js

@@ -0,0 +1,530 @@
+import { allocateLlmRerankIds, rerankWithLlm } from "./llm-rerank.js";
+import { nativeRerankerCalibration } from "./reranker-calibration.js";
+/**
+ * Pipeline: query expansion → vector + FTS5 hybrid → rerank → group hits by
+ * page → build cards → fill budget. This module is the middle: two arms, fused.
+ *
+ * FTS5 does not care about size — it is sub-millisecond at 2,000 chunks and at
+ * 100,000. The vector arm is brute force by decision, which is exact and
+ * fast enough an order of magnitude past the knowledge base this is built for.
+ */
+export async function hybridSearch(store, embedding, options) {
+    const degraded = [];
+    const notes = [];
+    const lexical = lexicalSearch(store, options.queries, options.candidatesPerArm, options.chunkIds);
+    let vector = [];
+    if (embedding.available) {
+        const embedded = await embedding.embed(options.vectorTexts);
+        if (embedded.ok && embedded.value) {
+            // Candidate pre-filtering. Scoring only the lexical candidate
+            // set instead of every vector raises the ceiling several-fold for free —
+            // but it cannot help a purely semantic query with no lexical overlap, so it
+            // is a fallback for a knowledge base past the brute-force threshold, not
+            // the default. Below the threshold, an exact scan of everything is both
+            // faster than it needs to be and strictly more accurate.
+            const lexicalPrefilter = options.prefilterAbove !== undefined && store.vectors.count() > options.prefilterAbove
+                ? new Set(lexical.map((hit) => hit.chunkId))
+                : undefined;
+            const prefilter = intersect(options.chunkIds, lexicalPrefilter);
+            if (lexicalPrefilter)
+                notes.push(`vector scan pre-filtered to ${prefilter?.size ?? 0} lexical candidates`);
+            vector = vectorSearch(store, embedded.value, options.candidatesPerArm, prefilter);
+        }
+        else {
+            degraded.push(embedding.degradedReason(embedded));
+            if (embedded.error)
+                notes.push(embedded.error);
+        }
+    }
+    else {
+        degraded.push(embedding.degradedReason({}));
+        if (embedding.unavailableReason)
+            notes.push(embedding.unavailableReason);
+    }
+    const arms = [lexical, vector];
+    return { hits: fuseHits(arms), arms, degraded, notes };
+}
+/**
+ * FTS5 with bm25 ranking. Every query in the expansion runs separately and the
+ * results fuse, rather than being OR-ed into one giant MATCH — a single query
+ * with eight alternatives ranks a chunk matching one weak term above a chunk
+ * matching the original phrase.
+ */
+function lexicalSearch(store, queries, limit, chunkIds) {
+    const perQuery = [];
+    for (const query of queries) {
+        const match = toMatchExpression(query);
+        if (!match)
+            continue;
+        try {
+            const rows = store.db
+                .prepare(`SELECT c.id AS chunk_id, c.page_id, c.document_id,
+                  bm25(chunks_fts, 1.0, 2.0) AS rank
+             FROM chunks_fts
+             JOIN chunks c ON c.id = chunks_fts.rowid
+            WHERE chunks_fts MATCH ?
+              ${chunkIds ? 'AND c.id IN (SELECT value FROM json_each(?))' : ''}
+            ORDER BY rank
+            LIMIT ?`)
+                .all(match, ...(chunkIds ? [JSON.stringify([...chunkIds])] : []), limit);
+            perQuery.push(rows
+                // bm25 returns negative numbers, more negative being better.
+                .map((row) => ({
+                chunkId: row.chunk_id,
+                pageId: row.page_id,
+                documentId: row.document_id,
+                score: -row.rank,
+                from: ['lexical'],
+            })));
+        }
+        catch {
+            // A MATCH expression FTS5 rejects is a bad query, not a broken index.
+            continue;
+        }
+    }
+    return fuseHits(perQuery);
+}
+function vectorSearch(store, vectors, limit, prefilter) {
+    const perVector = [];
+    const identityOf = store.db.prepare('SELECT page_id, document_id FROM chunks WHERE id = ?');
+    for (const vector of vectors) {
+        if (vector.length !== store.vectors.dimensions)
+            continue;
+        const hits = store.vectors.search(vector, limit, prefilter);
+        const mapped = [];
+        for (const hit of hits) {
+            const row = identityOf.get(hit.chunkId);
+            if (!row)
+                continue;
+            mapped.push({
+                chunkId: hit.chunkId,
+                pageId: row.page_id,
+                documentId: row.document_id,
+                score: hit.score,
+                from: ['vector'],
+                // Cosine is already an absolute similarity, so it survives fusion as the
+                // answer to "is this actually a good match?" — which the fused rank is not.
+                relevance: Math.max(0, Math.min(1, hit.score)),
+            });
+        }
+        perVector.push(mapped);
+    }
+    return fuseHits(perVector);
+}
+/** Undefined means unrestricted; when both restrictions exist, both must hold. */
+function intersect(left, right) {
+    if (!left)
+        return right;
+    if (!right)
+        return left;
+    const out = new Set();
+    for (const value of left)
+        if (right.has(value))
+            out.add(value);
+    return out;
+}
+/**
+ * Reciprocal rank fusion. Chosen over score normalization because bm25 and
+ * cosine are not on comparable scales and never will be — RRF only needs the
+ * ordering within each arm, which is the one thing both arms are reliable about.
+ */
+const RRF_K = 60;
+/**
+ * The LLM still judges exactly `topK` candidates. One boundary slot is selected by vector rank from a
+ * bounded 2× fusion pool, which lets a strong paraphrase just outside the fused window compete without
+ * increasing model tokens or comparing cosine with reciprocal-rank scores.
+ */
+export const RERANK_CANDIDATE_SELECTION_VERSION = 'fusion-semantic-tail-v1';
+export const RERANK_CANDIDATE_POOL_MULTIPLIER = 2;
+export function selectRerankCandidates(hits, topK) {
+    if (topK <= 0 || hits.length === 0)
+        return [];
+    if (hits.length <= topK || topK < 2)
+        return hits.slice(0, topK);
+    const fixed = hits.slice(0, topK - 1);
+    const boundary = hits.slice(topK - 1, topK * RERANK_CANDIDATE_POOL_MULTIPLIER);
+    let selected = boundary[0];
+    for (const candidate of boundary.slice(1)) {
+        if (candidate.relevance !== undefined && candidate.relevance > (selected.relevance ?? -Infinity)) {
+            selected = candidate;
+        }
+    }
+    return [...fixed, selected];
+}
+export function fuseHits(lists) {
+    const populated = lists.filter((list) => list.length > 0);
+    // One list needs no fusion, and passing it through keeps its own scores rather
+    // than flattening them all onto the reciprocal-rank scale.
+    if (populated.length <= 1)
+        return populated[0] ?? [];
+    const merged = new Map();
+    for (const list of populated) {
+        const sorted = [...list].sort((a, b) => b.score - a.score);
+        for (let rank = 0; rank < sorted.length; rank++) {
+            const hit = sorted[rank];
+            const contribution = 1 / (RRF_K + rank + 1);
+            const existing = merged.get(hit.chunkId);
+            if (existing) {
+                existing.score += contribution;
+                for (const arm of hit.from)
+                    if (!existing.from.includes(arm))
+                        existing.from.push(arm);
+                existing.graphPaths = mergeGraphPaths(existing.graphPaths, hit.graphPaths);
+                if (hit.relevance !== undefined) {
+                    existing.relevance = Math.max(existing.relevance ?? 0, hit.relevance);
+                }
+            }
+            else {
+                merged.set(hit.chunkId, { ...hit, score: contribution, from: [...hit.from] });
+            }
+        }
+    }
+    return [...merged.values()].sort((a, b) => b.score - a.score);
+}
+function mergeGraphPaths(left, right) {
+    if (!left?.length)
+        return right?.length ? [...right] : undefined;
+    if (!right?.length)
+        return left;
+    const merged = new Map(left.map((path) => [graphPathKey(path), path]));
+    for (const path of right)
+        merged.set(graphPathKey(path), path);
+    return [...merged.values()].slice(0, 3);
+}
+function graphPathKey(path) {
+    return `${path.nodes.map((node) => node.id).join('\0')}\0${path.relations.join('\0')}\0${path.evidence
+        .map((locator) => [
+        locator.kind,
+        locator.slug,
+        locator.document,
+        locator.event,
+        locator.fact,
+        locator.line_start,
+        locator.line_end,
+        locator.field,
+    ].join('\0'))
+        .join('\0')}`;
+}
+/**
+ * FTS5's MATCH syntax will happily reject a natural-language query — a bare `?`,
+ * an unbalanced quote, a stray `NEAR`. Quoting every token and OR-ing them makes
+ * any user input a legal expression, which matters because a thrown syntax error
+ * here would read to the caller as "nothing matched".
+ */
+export function toMatchExpression(query) {
+    const tokens = query
+        .toLowerCase()
+        .replace(/[^\p{L}\p{N}\s'-]/gu, ' ')
+        .split(/\s+/)
+        .map((token) => token.replace(/^[-']+|[-']+$/g, ''))
+        .filter((token) => token.length > 1);
+    if (tokens.length === 0)
+        return null;
+    // A quoted phrase for the whole query, plus each token, so an exact phrase
+    // outranks a bag of words without excluding partial matches.
+    const quoted = tokens.map((token) => `"${token.replace(/"/g, '')}"`);
+    const phrase = tokens.length > 1 ? `"${tokens.join(' ')}" OR ` : '';
+    return `${phrase}${quoted.join(' OR ')}`;
+}
+/**
+ * Without a reranker, hybrid score ordering stands. With one, the top
+ * candidates are re-scored against the original query. A native cross-encoder
+ * sees each query/passage pair; LLM mode applies one guarded listwise prompt.
+ *
+ * Two measured facts about cost, since they are counter-intuitive: the reranker is
+ * by far the most expensive stage in the pipeline (≈1s against ≈33ms for embedding
+ * and ≈4ms for the lexical arm on a local bge-reranker-v2-m3), and its cost is per
+ * *candidate*, not per character. So `topK` is the only real latency dial, and
+ * turning it down trades away which pages come back — see `config/default.jsonc`.
+ *
+ * The output is on **one scale with the un-reranked tail**, which is not a detail.
+ * A cross-encoder emits logits (bge-reranker spans roughly -12 to +8) while fusion
+ * emits reciprocal ranks around 0.01-0.2. Returning both in one array means any
+ * later `Math.max` over a page's chunks prefers a mediocre fused hit to a
+ * confidently-judged one, and the reranker silently stops mattering.
+ */
+export async function rerankHits(store, reranker, query, hits, topK, maxChars = 800, 
+/**
+ * Where this model puts the relevant/irrelevant boundary on its own logit scale. Subtracted
+ * before the sigmoid so that boundary lands on 0.5, which is what every threshold downstream
+ * already assumes. 0 leaves a model already centred there untouched.
+ */
+scoreOffset = 0, excludeIrrelevant = false) {
+    if (!reranker.available || hits.length === 0) {
+        return reranker.available
+            ? { hits, degraded: null, note: null, qualification: null }
+            : {
+                hits,
+                degraded: reranker.degradedReason({}),
+                note: reranker.unavailableReason,
+                qualification: null,
+            };
+    }
+    const candidates = reranker.rerankerMode === 'llm' ? selectRerankCandidates(hits, topK) : hits.slice(0, topK);
+    // One prepared statement for the whole batch rather than one per candidate.
+    const select = store.db.prepare('SELECT heading_path, text FROM chunks WHERE id = ?');
+    const graphEvidence = graphEvidenceReader(store);
+    const texts = candidates.map((hit) => {
+        const row = select.get(hit.chunkId);
+        if (!row)
+            return '';
+        const full = row.heading_path ? `${row.heading_path}\n${row.text}` : row.text;
+        const graphContext = renderGraphRerankContext(hit.graphPaths, graphEvidence);
+        const graphBudget = graphContext ? Math.floor(maxChars / 2) : 0;
+        const boundedGraph = graphContext.slice(0, graphBudget);
+        const boundedContent = full.slice(0, maxChars - boundedGraph.length);
+        const candidateText = boundedGraph
+            ? `[Graph path and its cited evidence]\n${boundedGraph}\n[Candidate]\n${boundedContent}`
+            : boundedContent;
+        // Bounds the request payload. Measured as *free* rather than fast: truncating
+        // from the 4,000-char chunk cap to 800 changed neither latency (1036 → 1028 ms)
+        // nor a single result across 8 queries, because this reranker's cost is per
+        // candidate, not per character. `topK` is the latency dial, and lowering that
+        // does change which pages come back. Kept anyway — a cross-encoder's relevance
+        // signal is front-loaded, and an unbounded payload is worth not having.
+        return candidateText.slice(0, maxChars);
+    });
+    if (reranker.rerankerMode === 'llm') {
+        const ids = allocateLlmRerankIds(query, candidates.map((hit) => `${hit.pageId ?? 'document'}:${hit.chunkId}`));
+        const llmCandidates = candidates.map((hit, index) => {
+            return {
+                id: ids[index],
+                text: texts[index] ?? '',
+                sourceKind: hit.pageId ? 'page' : 'document',
+                matchedBy: hit.from,
+            };
+        });
+        const result = await rerankWithLlm(reranker, query, llmCandidates);
+        if (!result.ok || !result.value) {
+            return {
+                hits,
+                degraded: reranker.degradedReason(result),
+                note: result.error ?? null,
+                qualification: null,
+            };
+        }
+        // The listwise model supplies the order. Scores encode only that order; the separately
+        // returned relevance label is the absolute signal consumers may threshold.
+        const rejected = result.value.filter((entry) => excludeIrrelevant && entry.relevance === 0).length;
+        const reordered = result.value
+            .map((entry, rank) => ({ entry, rank }))
+            .filter(({ entry }) => !excludeIrrelevant || entry.relevance > 0)
+            .map(({ entry, rank }) => {
+            const hit = candidates[entry.index];
+            return {
+                ...hit,
+                score: (candidates.length - rank) / candidates.length,
+                relevance: entry.relevance / 3,
+            };
+        });
+        return finishRerank(hits, candidates, reordered, {
+            model: 'llm',
+            model_id: reranker.modelId ?? undefined,
+            latency_ms: result.latencyMs,
+            input_tokens: result.usage?.inputTokens ?? null,
+            output_tokens: result.usage?.outputTokens ?? null,
+            total_tokens: result.usage?.totalTokens ?? null,
+            applied: excludeIrrelevant,
+            judged: candidates.length,
+            rejected,
+            unjudged: hits.length - candidates.length,
+            basis: excludeIrrelevant ? 'llm_grade' : 'disabled',
+            threshold: null,
+        });
+    }
+    const result = await reranker.rerank(query, texts, candidates.length);
+    if (!result.ok || !result.value) {
+        return {
+            hits,
+            degraded: reranker.degradedReason(result),
+            note: result.error ?? null,
+            qualification: null,
+        };
+    }
+    const entries = completeNativeRerank(result.value, candidates.length);
+    if (!entries) {
+        return {
+            hits,
+            degraded: 'rerank_failed',
+            note: 'rerank returned an incomplete or invalid candidate permutation',
+            qualification: null,
+        };
+    }
+    let resolvedOffset;
+    let calibration;
+    if (scoreOffset === 'auto') {
+        const outcome = await nativeRerankerCalibration(store, reranker);
+        if (!outcome.ok || !outcome.value) {
+            // Ordering remains useful, but without a trustworthy boundary these are relative ranks and
+            // qualification must stay off. Guessing here is how an unfamiliar model erases good recall.
+            const reordered = entries
+                .sort((a, b) => b.score - a.score)
+                .map((entry, rank) => ({
+                ...candidates[entry.index],
+                score: (candidates.length - rank) / candidates.length,
+            }));
+            return finishRerank(hits, candidates, reordered, {
+                model: 'native',
+                model_id: reranker.modelId ?? undefined,
+                latency_ms: result.latencyMs,
+                applied: false,
+                judged: candidates.length,
+                rejected: 0,
+                unjudged: hits.length - candidates.length,
+                basis: 'calibration_failed',
+                threshold: null,
+            }, outcome.error ?? 'native reranker auto-calibration failed; qualification was not applied');
+        }
+        resolvedOffset = outcome.value.scoreOffset;
+        calibration = 'native_auto';
+    }
+    else {
+        resolvedOffset = scoreOffset;
+        calibration = 'native_manual';
+    }
+    const judged = [];
+    for (const entry of entries) {
+        const hit = candidates[entry.index];
+        // A logit through a sigmoid is a relevance in (0, 1) — comparable across
+        // queries, and readable as a score rather than as a model internal.
+        // The cross-encoder saw the query and the passage together, so its judgement
+        // replaces cosine as the absolute signal rather than merging with it.
+        //
+        // `scoreOffset` is what makes "comparable" true across *models* as well as queries. Two
+        // cross-encoders that rank a set identically can sit on entirely different scales: measured
+        // here, an irrelevant pair scores ~−11 on bge-reranker-v2-m3 and ~−0.3 on
+        // gte-reranker-modernbert-base, so the same 0.5 cutoff admits 0.8% of irrelevant pairs on
+        // one and 42.5% on the other. Recentring here keeps every threshold downstream honest.
+        const relevance = sigmoid(entry.score - resolvedOffset);
+        if (hit)
+            judged.push({ ...hit, score: relevance, relevance });
+    }
+    judged.sort((a, b) => b.score - a.score);
+    const reordered = excludeIrrelevant ? judged.filter((hit) => (hit.relevance ?? 0) >= 0.5) : judged;
+    return finishRerank(hits, candidates, reordered, {
+        model: 'native',
+        model_id: reranker.modelId ?? undefined,
+        latency_ms: result.latencyMs,
+        applied: excludeIrrelevant,
+        judged: candidates.length,
+        rejected: excludeIrrelevant ? judged.length - reordered.length : 0,
+        unjudged: hits.length - candidates.length,
+        basis: excludeIrrelevant ? calibration : 'disabled',
+        threshold: resolvedOffset,
+    });
+}
+function graphEvidenceReader(store) {
+    let page;
+    let document;
+    try {
+        page = store.db.prepare(`SELECT c.text
+         FROM chunks c
+         JOIN pages p ON p.id = c.page_id
+        WHERE p.slug = ? AND c.document_id IS NULL
+        ORDER BY CASE WHEN ? BETWEEN c.line_start AND c.line_end THEN 0 ELSE 1 END, c.ord
+        LIMIT 1`);
+        document = store.db.prepare(`SELECT text
+         FROM chunks
+        WHERE document_id = ?
+        ORDER BY ord
+        LIMIT 1`);
+    }
+    catch {
+        // Small embedders may supply only the chunk table. Path identities still help their reranker even when
+        // this optional supporting excerpt cannot be loaded from the handle.
+        return () => '';
+    }
+    const cache = new Map();
+    return (locator) => {
+        const key = `${locator.kind}\0${locator.slug ?? ''}\0${locator.document ?? ''}\0${locator.line_start ?? ''}`;
+        const cached = cache.get(key);
+        if (cached !== undefined)
+            return cached;
+        const row = locator.slug
+            ? page.get(locator.slug, locator.line_start ?? -1)
+            : locator.document
+                ? document.get(locator.document)
+                : undefined;
+        const text = row?.text.replace(/\s+/g, ' ').trim().slice(0, 180) ?? '';
+        cache.set(key, text);
+        return text;
+    };
+}
+function renderGraphRerankContext(paths, evidenceText) {
+    if (!paths?.length)
+        return '';
+    return paths
+        .slice(0, 2)
+        .map((path) => {
+        const route = [];
+        for (let index = 0; index < path.nodes.length; index++) {
+            const node = path.nodes[index];
+            route.push(node.slug ?? node.document ?? node.label ?? node.id);
+            const relation = path.relations[index];
+            if (relation)
+                route.push(`-${relation}->`);
+        }
+        const evidence = path.evidence
+            .map(evidenceText)
+            .filter(Boolean)
+            .map((text) => `Evidence: ${text}`);
+        return [`Path: ${route.join(' ')}`, ...evidence].join('\n');
+    })
+        .join('\n');
+}
+function finishRerank(hits, judged, reordered, qualification, note = null) {
+    // Qualification is a claim about what may be shown. Candidates outside the bounded window
+    // were not judged, so filling empty slots from that tail would silently undo the filter.
+    if (qualification.applied)
+        return { hits: reordered, degraded: null, note, qualification };
+    const seen = new Set(reordered.map((hit) => hit.chunkId));
+    const judgedIds = new Set(judged.map((hit) => hit.chunkId));
+    const tail = hits.filter((hit) => !seen.has(hit.chunkId) && !judgedIds.has(hit.chunkId));
+    // The reranker judged the bounded selection; the tail was never looked at, so it cannot
+    // outrank a judged hit. Compress it into the band below the weakest judged one,
+    // preserving its fused order.
+    const floor = reordered.at(-1)?.score ?? 0;
+    const rescaledTail = tail.map((hit, index) => ({
+        ...hit,
+        score: (floor * (tail.length - index)) / (tail.length + 1),
+    }));
+    return { hits: [...reordered, ...rescaledTail], degraded: null, note, qualification };
+}
+function completeNativeRerank(entries, count) {
+    if (entries.length !== count)
+        return null;
+    const seen = new Set();
+    for (const entry of entries) {
+        if (!Number.isInteger(entry.index) ||
+            entry.index < 0 ||
+            entry.index >= count ||
+            !Number.isFinite(entry.score) ||
+            seen.has(entry.index)) {
+            return null;
+        }
+        seen.add(entry.index);
+    }
+    return entries;
+}
+function sigmoid(logit) {
+    return 1 / (1 + Math.exp(-logit));
+}
+/**
+ * Puts fused scores on a readable 0..1 scale when no reranker ran. Reciprocal
+ * rank fusion produces values around 0.016 whose absolute magnitude means
+ * nothing, and a card reporting `score: 0.016` reads as "barely a match" when it
+ * is in fact the best hit in the knowledge base.
+ *
+ * The result is **relative within one result set** — it says how this hit compares
+ * to the best hit here, not how relevant it is in the abstract. That is the only
+ * honest reading of a fused rank, and it is what the field is documented as.
+ */
+export function normalizeScores(hits) {
+    if (hits.length === 0)
+        return hits;
+    const best = Math.max(...hits.map((hit) => hit.score));
+    if (!Number.isFinite(best) || best <= 0)
+        return hits;
+    return hits.map((hit) => ({ ...hit, score: hit.score / best }));
+}
+//# sourceMappingURL=search.js.map

package/dist/recall/search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.js","sourceRoot":"","sources":["../../src/recall/search.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,oBAAoB,EAAE,aAAa,EAA2B,MAAM,iBAAiB,CAAC;AAC/F,OAAO,EAAE,yBAAyB,EAAE,MAAM,2BAA2B,CAAC;AAyCtE;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,KAAY,EACZ,SAAsB,EACtB,OAAsB;IAEtB,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,gBAAgB,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;IAElG,IAAI,MAAM,GAAe,EAAE,CAAC;IAC5B,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;QACxB,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAC5D,IAAI,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAClC,8DAA8D;YAC9D,yEAAyE;YACzE,4EAA4E;YAC5E,yEAAyE;YACzE,wEAAwE;YACxE,yDAAyD;YACzD,MAAM,gBAAgB,GACpB,OAAO,CAAC,cAAc,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,OAAO,CAAC,cAAc;gBACpF,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC5C,CAAC,CAAC,SAAS,CAAC;YAChB,MAAM,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;YAChE,IAAI,gBAAgB;gBAClB,KAAK,CAAC,IAAI,CAAC,+BAA+B,SAAS,EAAE,IAAI,IAAI,CAAC,qBAAqB,CAAC,CAAC;YACvF,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC;QACpF,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC;YAClD,IAAI,QAAQ,CAAC,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;SAAM,CAAC;QACN,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAI,SAAS,CAAC,iBAAiB;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;IAC3E,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC/B,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;AACzD,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CAAC,KAAY,EAAE,OAAiB,EAAE,KAAa,EAAE,QAAsB;IAC3F,MAAM,QAAQ,GAAiB,EAAE,CAAC;IAElC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,KAAK,CAAC,EAAE;iBAClB,OAAO,CACN;;;;;gBAKM,QAAQ,CAAC,CAAC,CAAC,8CAA8C,CAAC,CAAC,CAAC,EAAE;;oBAE1D,CACX;iBACA,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAKtE,CAAC;YAEJ,QAAQ,CAAC,IAAI,CACX,IAAI;gBACF,6DAA6D;iBAC5D,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBACb,OAAO,EAAE,GAAG,CAAC,QAAQ;gBACrB,MAAM,EAAE,GAAG,CAAC,OAAO;gBACnB,UAAU,EAAE,GAAG,CAAC,WAAW;gBAC3B,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI;gBAChB,IAAI,EAAE,CAAC,SAAkB,CAAC;aAC3B,CAAC,CAAC,CACN,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,sEAAsE;YACtE,SAAS;QACX,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAC5B,CAAC;AAED,SAAS,YAAY,CACnB,KAAY,EACZ,OAAuB,EACvB,KAAa,EACb,SAAuB;IAEvB,MAAM,SAAS,GAAiB,EAAE,CAAC;IACnC,MAAM,UAAU,GAAG,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,sDAAsD,CAAC,CAAC;IAE5F,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,OAAO,CAAC,UAAU;YAAE,SAAS;QACzD,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC5D,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAC8B,CAAC;YACrE,IAAI,CAAC,GAAG;gBAAE,SAAS;YACnB,MAAM,CAAC,IAAI,CAAC;gBACV,OAAO,EAAE,GAAG,CAAC,OAAO;gBACpB,MAAM,EAAE,GAAG,CAAC,OAAO;gBACnB,UAAU,EAAE,GAAG,CAAC,WAAW;gBAC3B,KAAK,EAAE,GAAG,CAAC,KAAK;gBAChB,IAAI,EAAE,CAAC,QAAQ,CAAC;gBAChB,yEAAyE;gBACzE,4EAA4E;gBAC5E,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;aAC/C,CAAC,CAAC;QACL,CAAC;QACD,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,QAAQ,CAAC,SAAS,CAAC,CAAC;AAC7B,CAAC;AAED,kFAAkF;AAClF,SAAS,SAAS,CAAC,IAAkB,EAAE,KAAmB;IACxD,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACxB,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,KAAK,IAAI,IAAI;QAAE,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/D,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,KAAK,GAAG,EAAE,CAAC;AAEjB;;;;GAIG;AACH,MAAM,CAAC,MAAM,kCAAkC,GAAG,yBAAyB,CAAC;AAC5E,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAElD,MAAM,UAAU,sBAAsB,CAAmC,IAAS,EAAE,IAAY;IAC9F,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC9C,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAEhE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,gCAAgC,CAAC,CAAC;IAC/E,IAAI,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;IAC5B,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1C,IAAI,SAAS,CAAC,SAAS,KAAK,SAAS,IAAI,SAAS,CAAC,SAAS,GAAG,CAAC,QAAQ,CAAC,SAAS,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACjG,QAAQ,GAAG,SAAS,CAAC;QACvB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,KAAK,EAAE,QAAQ,CAAC,CAAC;AAC9B,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,KAAmB;IAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1D,+EAA+E;IAC/E,2DAA2D;IAC3D,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAErD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC3D,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YAChD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAE,CAAC;YAC1B,MAAM,YAAY,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;YAC5C,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACzC,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,KAAK,IAAI,YAAY,CAAC;gBAC/B,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI;oBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;wBAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACtF,QAAQ,CAAC,UAAU,GAAG,eAAe,CAAC,QAAQ,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC3E,IAAI,GAAG,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;oBAChC,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,IAAI,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;gBACxE,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,GAAG,GAAG,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChF,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAChE,CAAC;AAED,SAAS,eAAe,CACtB,IAAmC,EACnC,KAAoC;IAEpC,IAAI,CAAC,IAAI,EAAE,MAAM;QAAE,OAAO,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACjE,IAAI,CAAC,KAAK,EAAE,MAAM;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACvE,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;IAC/D,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED,SAAS,YAAY,CAAC,IAAqB;IACzC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,QAAQ;SACnG,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CACf;QACE,OAAO,CAAC,IAAI;QACZ,OAAO,CAAC,IAAI;QACZ,OAAO,CAAC,QAAQ;QAChB,OAAO,CAAC,KAAK;QACb,OAAO,CAAC,IAAI;QACZ,OAAO,CAAC,UAAU;QAClB,OAAO,CAAC,QAAQ;QAChB,OAAO,CAAC,KAAK;KACd,CAAC,IAAI,CAAC,IAAI,CAAC,CACb;SACA,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa;IAC7C,MAAM,MAAM,GAAG,KAAK;SACjB,WAAW,EAAE;SACb,OAAO,CAAC,qBAAqB,EAAE,GAAG,CAAC;SACnC,KAAK,CAAC,KAAK,CAAC;SACZ,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;SACnD,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEvC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,2EAA2E;IAC3E,6DAA6D;IAC7D,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IACpE,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,KAAY,EACZ,QAAqB,EACrB,KAAa,EACb,IAAgB,EAChB,IAAY,EACZ,QAAQ,GAAG,GAAG;AACd;;;;GAIG;AACH,cAA+B,CAAC,EAChC,iBAAiB,GAAG,KAAK;IAOzB,IAAI,CAAC,QAAQ,CAAC,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7C,OAAO,QAAQ,CAAC,SAAS;YACvB,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE;YAC3D,CAAC,CAAC;gBACE,IAAI;gBACJ,QAAQ,EAAE,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;gBACrC,IAAI,EAAE,QAAQ,CAAC,iBAAiB;gBAChC,aAAa,EAAE,IAAI;aACpB,CAAC;IACR,CAAC;IAED,MAAM,UAAU,GACd,QAAQ,CAAC,YAAY,KAAK,KAAK,CAAC,CAAC,CAAC,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC7F,4EAA4E;IAC5E,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,oDAAoD,CAAC,CAAC;IACtF,MAAM,aAAa,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACnC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAuD,CAAC;QAC1F,IAAI,CAAC,GAAG;YAAE,OAAO,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,YAAY,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;QAC9E,MAAM,YAAY,GAAG,wBAAwB,CAAC,GAAG,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;QAC7E,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,YAAY,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;QACxD,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;QACrE,MAAM,aAAa,GAAG,YAAY;YAChC,CAAC,CAAC,wCAAwC,YAAY,kBAAkB,cAAc,EAAE;YACxF,CAAC,CAAC,cAAc,CAAC;QACnB,8EAA8E;QAC9E,gFAAgF;QAChF,4EAA4E;QAC5E,8EAA8E;QAC9E,+EAA+E;QAC/E,wEAAwE;QACxE,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAI,QAAQ,CAAC,YAAY,KAAK,KAAK,EAAE,CAAC;QACpC,MAAM,GAAG,GAAG,oBAAoB,CAC9B,KAAK,EACL,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,IAAI,UAAU,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC,CACtE,CAAC;QACF,MAAM,aAAa,GAAyB,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;YACxE,OAAO;gBACL,EAAE,EAAE,GAAG,CAAC,KAAK,CAAE;gBACf,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE;gBACxB,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU;gBAC5C,SAAS,EAAE,GAAG,CAAC,IAAI;aACpB,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,QAAQ,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC;QACnE,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,OAAO;gBACL,IAAI;gBACJ,QAAQ,EAAE,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC;gBACzC,IAAI,EAAE,MAAM,CAAC,KAAK,IAAI,IAAI;gBAC1B,aAAa,EAAE,IAAI;aACpB,CAAC;QACJ,CAAC;QAED,uFAAuF;QACvF,2EAA2E;QAC3E,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QACnG,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK;aAC3B,GAAG,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;aACvC,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,iBAAiB,IAAI,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;aAChE,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE;YACvB,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC;YACrC,OAAO;gBACL,GAAG,GAAG;gBACN,KAAK,EAAE,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM;gBACrD,SAAS,EAAE,KAAK,CAAC,SAAS,GAAG,CAAC;aAC/B,CAAC;QACJ,CAAC,CAAC,CAAC;QACL,OAAO,YAAY,CAAC,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE;YAC/C,KAAK,EAAE,KAAK;YACZ,QAAQ,EAAE,QAAQ,CAAC,OAAO,IAAI,SAAS;YACvC,UAAU,EAAE,MAAM,CAAC,SAAS;YAC5B,YAAY,EAAE,MAAM,CAAC,KAAK,EAAE,WAAW,IAAI,IAAI;YAC/C,aAAa,EAAE,MAAM,CAAC,KAAK,EAAE,YAAY,IAAI,IAAI;YACjD,YAAY,EAAE,MAAM,CAAC,KAAK,EAAE,WAAW,IAAI,IAAI;YAC/C,OAAO,EAAE,iBAAiB;YAC1B,MAAM,EAAE,UAAU,CAAC,MAAM;YACzB,QAAQ;YACR,QAAQ,EAAE,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM;YACzC,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU;YACnD,SAAS,EAAE,IAAI;SAChB,CAAC,CAAC;IACL,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;IACtE,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,OAAO;YACL,IAAI;YACJ,QAAQ,EAAE,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC;YACzC,IAAI,EAAE,MAAM,CAAC,KAAK,IAAI,IAAI;YAC1B,aAAa,EAAE,IAAI;SACpB,CAAC;IACJ,CAAC;IACD,MAAM,OAAO,GAAG,oBAAoB,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;IACtE,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,OAAO;YACL,IAAI;YACJ,QAAQ,EAAE,eAAe;YACzB,IAAI,EAAE,gEAAgE;YACtE,aAAa,EAAE,IAAI;SACpB,CAAC;IACJ,CAAC;IAED,IAAI,cAAsB,CAAC;IAC3B,IAAI,WAAyC,CAAC;IAC9C,IAAI,WAAW,KAAK,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,MAAM,yBAAyB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACjE,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YAClC,2FAA2F;YAC3F,4FAA4F;YAC5F,MAAM,SAAS,GAAG,OAAO;iBACtB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;iBACjC,GAAG,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;gBACrB,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAE;gBAC3B,KAAK,EAAE,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM;aACtD,CAAC,CAAC,CAAC;YACN,OAAO,YAAY,CACjB,IAAI,EACJ,UAAU,EACV,SAAS,EACT;gBACE,KAAK,EAAE,QAAQ;gBACf,QAAQ,EAAE,QAAQ,CAAC,OAAO,IAAI,SAAS;gBACvC,UAAU,EAAE,MAAM,CAAC,SAAS;gBAC5B,OAAO,EAAE,KAAK;gBACd,MAAM,EAAE,UAAU,CAAC,MAAM;gBACzB,QAAQ,EAAE,CAAC;gBACX,QAAQ,EAAE,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM;gBACzC,KAAK,EAAE,oBAAoB;gBAC3B,SAAS,EAAE,IAAI;aAChB,EACD,OAAO,CAAC,KAAK,IAAI,wEAAwE,CAC1F,CAAC;QACJ,CAAC;QACD,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC;QAC3C,WAAW,GAAG,aAAa,CAAC;IAC9B,CAAC;SAAM,CAAC;QACN,cAAc,GAAG,WAAW,CAAC;QAC7B,WAAW,GAAG,eAAe,CAAC;IAChC,CAAC;IAED,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACpC,yEAAyE;QACzE,oEAAoE;QACpE,6EAA6E;QAC7E,sEAAsE;QACtE,EAAE;QACF,wFAAwF;QACxF,4FAA4F;QAC5F,0EAA0E;QAC1E,0FAA0F;QAC1F,uFAAuF;QACvF,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,GAAG,cAAc,CAAC,CAAC;QACxD,IAAI,GAAG;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAEnG,OAAO,YAAY,CAAC,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE;QAC/C,KAAK,EAAE,QAAQ;QACf,QAAQ,EAAE,QAAQ,CAAC,OAAO,IAAI,SAAS;QACvC,UAAU,EAAE,MAAM,CAAC,SAAS;QAC5B,OAAO,EAAE,iBAAiB;QAC1B,MAAM,EAAE,UAAU,CAAC,MAAM;QACzB,QAAQ,EAAE,iBAAiB,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAClE,QAAQ,EAAE,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM;QACzC,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU;QACnD,SAAS,EAAE,cAAc;KAC1B,CAAC,CAAC;AACL,CAAC;AAED,SAAS,mBAAmB,CAAC,KAAY;IACvC,IAAI,IAAI,CAAC;IACT,IAAI,QAAQ,CAAC;IACb,IAAI,CAAC;QACH,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC,OAAO,CACrB;;;;;gBAKU,CACX,CAAC;QACF,QAAQ,GAAG,KAAK,CAAC,EAAE,CAAC,OAAO,CACzB;;;;gBAIU,CACX,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,uGAAuG;QACvG,qEAAqE;QACrE,OAAO,GAAG,EAAE,CAAC,EAAE,CAAC;IAClB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IAExC,OAAO,CAAC,OAAO,EAAE,EAAE;QACjB,MAAM,GAAG,GAAG,GAAG,OAAO,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,IAAI,EAAE,KAAK,OAAO,CAAC,QAAQ,IAAI,EAAE,KAAK,OAAO,CAAC,UAAU,IAAI,EAAE,EAAE,CAAC;QAC7G,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QACxC,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI;YACtB,CAAC,CAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,UAAU,IAAI,CAAC,CAAC,CAAkC;YACpF,CAAC,CAAC,OAAO,CAAC,QAAQ;gBAChB,CAAC,CAAE,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAkC;gBAClE,CAAC,CAAC,SAAS,CAAC;QAChB,MAAM,IAAI,GAAG,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;QACvE,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,wBAAwB,CAC/B,KAAoC,EACpC,YAAsE;IAEtE,IAAI,CAAC,KAAK,EAAE,MAAM;QAAE,OAAO,EAAE,CAAC;IAC9B,OAAO,KAAK;SACT,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACZ,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YACvD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC;YAChC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC;YAChE,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACvC,IAAI,QAAQ;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,QAAQ,IAAI,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ;aAC3B,GAAG,CAAC,YAAY,CAAC;aACjB,MAAM,CAAC,OAAO,CAAC;aACf,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,IAAI,EAAE,CAAC,CAAC;QACtC,OAAO,CAAC,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9D,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAC;AAChB,CAAC;AAED,SAAS,YAAY,CACnB,IAAgB,EAChB,MAAkB,EAClB,SAAqB,EACrB,aAAkC,EAClC,OAAsB,IAAI;IAO1B,0FAA0F;IAC1F,yFAAyF;IACzF,IAAI,aAAa,CAAC,OAAO;QAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC;IAE3F,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAC1D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAC5D,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAEzF,wFAAwF;IACxF,gFAAgF;IAChF,8BAA8B;IAC9B,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;IAC3C,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QAC7C,GAAG,GAAG;QACN,KAAK,EAAE,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;KAC3D,CAAC,CAAC,CAAC;IAEJ,OAAO,EAAE,IAAI,EAAE,CAAC,GAAG,SAAS,EAAE,GAAG,YAAY,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC;AACxF,CAAC;AAED,SAAS,oBAAoB,CAC3B,OAA2C,EAC3C,KAAa;IAEb,IAAI,OAAO,CAAC,MAAM,KAAK,KAAK;QAAE,OAAO,IAAI,CAAC;IAC1C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IACE,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC;YAC9B,KAAK,CAAC,KAAK,GAAG,CAAC;YACf,KAAK,CAAC,KAAK,IAAI,KAAK;YACpB,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EACrB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,OAAO,CAAC,KAAa;IAC5B,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AACpC,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAAC,IAAgB;IAC9C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACvD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACrD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC;AAClE,CAAC"}

package/dist/reserved.d.ts

@@ -0,0 +1,39 @@
+import type { AknoConfig } from './config/schema.ts';
+/**
+ * Reserved paths. Almost everything in a knowledge base is the user's; this
+ * is the whole list of what is not, and the rule that governs all of it is the
+ * same: **if a reserved path already exists and isn't what Akno expects, leave
+ * it completely alone.**
+ *
+ * Both `open()` (which refuses to start rather than adopt one) and `doctor`
+ * (which reports it) need the same predicate, and two copies that could disagree
+ * about whether a file is a ledger is exactly the bug worth not having.
+ */
+/**
+ * The ledger's slug — `timeline.md` becomes `timeline`.
+ *
+ * One derivation, three callers. It used to be written out separately in the write path and
+ * in the indexer, which is two chances to disagree about which page is the ledger, and
+ * whichever one was wrong would be wrong silently.
+ */
+export declare function ledgerSlug(config: AknoConfig): string;
+/**
+ * **Every slug prefix a caller must not aim a page write at.**
+ *
+ * These are Akno's own structures, not the user's notes: the ledger is maintained by
+ * `insertEvent` and nothing else, the inbox is a queue that empties itself, observations are
+ * written by the cycle with their own evidence, and the journal is a record of what happened.
+ * A claim landing on any of them is a claim in a file whose shape means something specific —
+ * and on the ledger, where prose is invisible to the event parser, it is a claim in a file
+ * that will never be read back.
+ */
+export declare function reservedSlugs(config: AknoConfig): string[];
+/** True when `slug` is a reserved path or lives underneath one. */
+export declare function isReserved(slug: string, config: AknoConfig): boolean;
+/**
+ * An event ledger has event lines in it. A project plan someone happens to have
+ * called `timeline.md` does not, and appending `- **2026-08-06** | …` into the
+ * middle of their document is not a recoverable mistake.
+ */
+export declare function looksLikeLedger(absPath: string): boolean;
+//# sourceMappingURL=reserved.d.ts.map

package/dist/reserved.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reserved.d.ts","sourceRoot":"","sources":["../src/reserved.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAErD;;;;;;;;;GASG;AAEH;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM,CAErD;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM,EAAE,CAO1D;AAED,mEAAmE;AACnE,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,GAAG,OAAO,CAEpE;AAMD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CASxD"}