@saasontools/strauss-kb 0.1.9 → 0.1.11

package/dist/index.d.ts

@@ -47,13 +47,29 @@ declare const kbVerifiedEventSchema: z.ZodObject<{
  *
  * Symbolic on purpose. These are written while the code is still moving: a
  * `line: 379` recorded at minute five is wrong by minute forty, but
- * `OrderService.cancel` survives every edit that does not rename it. A later
- * pass resolves symbols to line ranges once the change has settled, and records
- * that resolution as a `verified[]` entry.
+ * `OrderService.cancel` survives every edit that does not rename it. Once the
+ * change settles, a resolution pass (`anchor-resolver.ts`) stamps `hash`,
+ * `resolved_at`, and `lines`; drift detection later re-resolves and compares.
+ *
+ * `hash` is prefixed with the algorithm so a future one can coexist with
+ * stored values. `lines` exists because the anchor keeps a hash, not the text:
+ * without the line count at hash time, a drift report could say "changed" but
+ * never how much.
+ *
+ * `repo` and `ref` say *which* code, for bases that describe more than one
+ * repository. They are author-owned identity: a resolver stamps `hash`,
+ * `lines`, and `resolved_at`, and never writes these two. Both are optional and
+ * independent of each other, so every anchor written before they existed stays
+ * valid.
  */
 declare const kbAnchorSchema: z.ZodObject<{
     file: z.ZodString;
     symbol: z.ZodOptional<z.ZodString>;
+    repo: z.ZodOptional<z.ZodString>;
+    ref: z.ZodOptional<z.ZodString>;
+    hash: z.ZodOptional<z.ZodString>;
+    resolved_at: z.ZodOptional<z.ZodString>;
+    lines: z.ZodOptional<z.ZodNumber>;
 }, z.core.$strict>;
 declare const KB_RECORD_TYPES: readonly ["fact", "requirement", "constraint", "decision", "assumption", "open-question", "risk", "contract", "flow", "affected-system", "test-obligation", "source-note"];
 type KbRecordType = (typeof KB_RECORD_TYPES)[number];
@@ -103,6 +119,11 @@ declare const kbRecordFrontmatterSchema: z.ZodObject<{
     strauss_anchors: z.ZodOptional<z.ZodArray<z.ZodObject<{
         file: z.ZodString;
         symbol: z.ZodOptional<z.ZodString>;
+        repo: z.ZodOptional<z.ZodString>;
+        ref: z.ZodOptional<z.ZodString>;
+        hash: z.ZodOptional<z.ZodString>;
+        resolved_at: z.ZodOptional<z.ZodString>;
+        lines: z.ZodOptional<z.ZodNumber>;
     }, z.core.$strict>>>;
     strauss_verify: z.ZodOptional<z.ZodArray<z.ZodString>>;
     strauss_status: z.ZodDefault<z.ZodEnum<{
@@ -145,6 +166,104 @@ type KbRecord = {
     body: string;
 };
 
+/**
+ * Resolves symbolic anchors to text and detects drift against stored hashes.
+ *
+ * Resolvers are pure — source string in, range out; only the file readers touch
+ * disk. Any shape the lexer cannot handle confidently returns `null` and is
+ * reported `unresolved` rather than guessed at.
+ */
+type ResolvedSymbol = {
+    text: string;
+    /** 1-based, inclusive. */
+    startLine: number;
+    endLine: number;
+};
+interface AnchorResolver {
+    name: string;
+    resolve(source: string, symbol: string): ResolvedSymbol | null;
+}
+/** Why an anchor could not be compared. Never an error — always a finding. */
+type AnchorUnresolvedReason = "file-missing" | "symbol-not-found" | "outside-repo" | "file-too-large" | "file-unreadable"
+/**
+ * The anchor names a repository this root is not. Expected rather than
+ * wrong — a base describing several repositories resolves against one tree
+ * at a time — so it is never a drift finding and never reaches a reader as
+ * a warning. Multi-root resolution is SAA-709.
+ */
+ | "foreign-repo";
+/**
+ * v1 heuristic resolver. A dotted symbol like `OrderService.cancel` matches on
+ * its last segment, with the parent used to scope the search: a candidate
+ * counts only if the parent name appears in the fifty lines above it, when any
+ * candidate satisfies that at all.
+ *
+ * Deterministic, and ambiguity is not resolved by guessing — two lines of
+ * equally good shape mean the resolver cannot tell which one the record meant,
+ * and it says so by returning `null`.
+ */
+declare const regexResolver: AnchorResolver;
+/** CRLF normalized to LF before hashing, so checkout style cannot read as drift. */
+declare function hashAnchorText(text: string): string;
+/**
+ * An anchor without a symbol is about the whole file; with one, the resolver
+ * decides. Source newlines are normalized first so line counts and hashes
+ * agree with `hashAnchorText`.
+ *
+ * A file's last line is the last line with content: a trailing newline is a
+ * terminator, not an empty line, and counting it would have made every
+ * whole-file anchor's `lines` one larger than the file.
+ */
+declare function resolveAnchor(source: string, anchor: KbAnchor, resolver?: AnchorResolver): ResolvedSymbol | null;
+type KbAnchorDriftEntry = {
+    file: string;
+    symbol?: string;
+    state: "match" | "drifted" | "unresolved";
+    storedHash: string;
+    currentHash?: string;
+    /** `null` when the anchor recorded no `lines` — size unknown, not zero. */
+    diffSize: number | null;
+    reason?: AnchorUnresolvedReason;
+};
+/**
+ * An anchor's `file` must stay inside the repository root — a record points
+ * at code, not at arbitrary files on the machine reading it. Bundles are
+ * data, so a traversal or absolute path here is untrusted input, not a bug
+ * in the caller. Returns the resolved path, or `null` when it escapes.
+ *
+ * Lexical only, and therefore not the whole containment check: see
+ * `readAnchorFile`, which re-tests the real path after following symlinks.
+ */
+declare function anchorFilePath(repoRoot: string, file: string): string | null;
+type AnchorRead = {
+    ok: true;
+    source: string;
+} | {
+    ok: false;
+    reason: AnchorUnresolvedReason;
+};
+type AnchorFileReader = (file: string) => Promise<AnchorRead>;
+/**
+ * Re-resolves every hash-carrying anchor and compares against the stored hash.
+ *
+ * Anchors without a `hash` are skipped; one naming another repository is
+ * reported `foreign-repo` and never read, and `origin` is asked for once per
+ * run, only when some anchor declares a `repo`. A missing file or unresolvable
+ * symbol is a finding (`unresolved`), never a throw. Each distinct file is read
+ * once per run; all checked entries are returned per record, callers filter.
+ *
+ * Three phases: collect the checkable anchors, read their distinct files with
+ * a bounded pool, then resolve and hash in record order — so the output does
+ * not depend on which read finished first.
+ */
+declare function detectAnchorDrift(records: KbRecord[], options?: {
+    repoRoot?: string;
+    resolver?: AnchorResolver;
+    concurrency?: number;
+    /** Test seam: replaces the disk reader. */
+    reader?: AnchorFileReader;
+}): Promise<Map<string, KbAnchorDriftEntry[]>>;
+
 /**
  * Why a matched record must not be read as a plain answer.
  *
@@ -189,6 +308,18 @@ type KbWarning =
     staleAfter: string;
 } | {
     kind: "unverified";
+}
+/** The code this record anchors to has changed since its hash was recorded —
+ *  the record may describe code that no longer exists in that form. */
+ | {
+    kind: "drifted";
+    anchors: {
+        file: string;
+        symbol?: string;
+        /** `null` when the anchor recorded no line count — size unknown. */
+        diffSize: number | null;
+        reason?: string;
+    }[];
 };
 type KbStanding = "current" | "superseded" | "rejected" | "unsettled" | "open";
 type KbAdjudicated = {
@@ -205,7 +336,7 @@ type KbAdjudicated = {
  * invisible: the caller cannot tell it missed anything, so a dropped record is
  * worse than a flagged one — it turns a knowable gap into an unknowable one.
  */
-declare function adjudicate(hits: KbRecord[], bundle: KbRecord[], now?: Date): KbAdjudicated[];
+declare function adjudicate(hits: KbRecord[], bundle: KbRecord[], now?: Date, anchorDrift?: Map<string, KbAnchorDriftEntry[]>): KbAdjudicated[];
 /**
  * Walks a supersession chain to whatever currently stands in its place.
  *
@@ -311,6 +442,79 @@ type KbPackResult = {
  */
 declare function pack(bundle: KbRecord[], rootId: string, options?: KbPackOptions): KbPackResult;
 
+/** One record as the catalog names it — no body, no description, one line. */
+type KbCatalogEntry = {
+    conceptId: string;
+    type: string;
+    title: string | null;
+    standing: KbStanding;
+    /** Where the supersession chain ends. Empty when broken, cyclic, or n/a. */
+    supersededBy: string[];
+    /** `stale_after` is in the past. The one freshness signal a line can carry. */
+    stale: boolean;
+};
+type KbCatalogResult = {
+    entries: KbCatalogEntry[];
+    /** Every record the catalog names, filter applied. */
+    recordCount: number;
+    /**
+     * How many records hold each standing. Sums to `recordCount` — every record
+     * has exactly one standing, so the reader can see that nothing went missing.
+     */
+    standings: Record<KbStanding, number>;
+    /** Shorthand for `standings.current` — records that simply hold. */
+    currentCount: number;
+    /** Shorthand for `standings.superseded`. */
+    supersededCount: number;
+    /**
+     * Records whose `stale_after` has passed. A flag over the standings rather
+     * than one of them — a current record can be stale — so this deliberately
+     * does not participate in the sum.
+     */
+    staleCount: number;
+};
+/**
+ * The tier-one listing: every record named, nothing spelled out.
+ *
+ * `load` hands over bodies and `pack` hands over a neighbourhood; both have to
+ * decide what the reader can afford. The catalog is the rung below either — one
+ * line per record at roughly thirty tokens, so a base far past `load`'s gate
+ * still fits in a single call. What it buys is the ability to choose: a reader
+ * that can see every id, type, title and standing knows which record to `pack`
+ * and knows when no record covers the question at all, which is the conclusion
+ * a truncated read can never support.
+ *
+ * Standing travels on the line for the same reason it travels with every other
+ * result here: a title is a claim, and a superseded claim reads exactly like a
+ * live one. A superseded entry names its replacement, so the line the reader
+ * should follow instead is already in front of them.
+ *
+ * Unbounded, alone among the read paths. `load` and `pack` refuse past a
+ * ceiling because a partial body set reads as a complete one; a catalog has no
+ * such failure — it is the rung a caller lands on *because* something else
+ * refused, and a second refusal there would leave nowhere to go. The cost is
+ * linear and cheap: roughly thirty tokens a record, so a thousand-record base
+ * is about 30k and five thousand about 150k. Past that the `type` filter
+ * narrows it, and no ceiling is needed to make that available.
+ *
+ * Deterministic given a fixed `now`: no timestamp is emitted, and the ordering
+ * is total down to the concept id, so two catalogs of an unchanged base within
+ * one `stale_after` window are byte-identical and diff to nothing. The default
+ * clock is the wall clock, so a line can still flip to stale as a date passes —
+ * pass `now` when byte-equality has to hold across that boundary.
+ */
+declare function catalog(bundle: KbRecord[], options?: {
+    type?: string;
+    now?: Date;
+}): KbCatalogResult;
+/**
+ * One entry, as one line.
+ *
+ * ` · `-separated rather than a table: a table pays for column alignment on
+ * every row, and nothing downstream parses these.
+ */
+declare function renderCatalogLine(entry: KbCatalogEntry): string;
+
 declare const LOG_FILE = "log.jsonl";
 declare const kbLogEntrySchema: z.ZodObject<{
     at: z.ZodISODateTime;
@@ -391,6 +595,8 @@ type KbLoadResult = {
     recordCount: number;
     approxTokens: number;
     budgetTokens: number;
+    /** The refusal in words, naming the budget and what to call next. */
+    message: string;
 };
 type KbWriteInput = {
     type: string;
@@ -451,6 +657,14 @@ declare class KbStore {
      * timeouts.
      */
     setStatus(bundlePath: string, conceptId: string, status: KbRecordStatus, actor?: string): Promise<KbRecord>;
+    /**
+     * Replaces a record's anchors wholesale, preserving everything else.
+     *
+     * Wholesale rather than merged: the caller just resolved the anchors it is
+     * writing, so it holds the complete current set, and a merge would keep
+     * stale entries the resolution pass deliberately dropped.
+     */
+    updateAnchors(bundlePath: string, conceptId: string, anchors: KbAnchor[], actor?: string): Promise<KbRecord>;
     /**
      * Appends one `verified[]` event: who checked the record, when, and what the
      * check found. Append-only — prior events are history, and are spread into
@@ -488,8 +702,31 @@ declare class KbStore {
     query(bundlePath: string, text: string, options?: {
         type?: string;
         includeNonCurrent?: boolean;
+        repoRoot?: string;
     }): Promise<KbAdjudicated[]>;
     private rank;
+    /**
+     * Anchor drift over the records about to be handed back. Like the search
+     * index, this is an enrichment: a filesystem failure degrades to "no drift
+     * reported" rather than failing the read. Anchors without a stored hash are
+     * skipped inside `detectAnchorDrift`, so a base nobody has stamped pays no
+     * fs cost here. `repoRoot` defaults to the working directory — the CLI runs
+     * at the repo root, and the MCP server's cwd is the workspace.
+     *
+     * Public because `doctor` needs the same map with the same degradation: a
+     * sweep that failed to read the tree should report no drift, not fail.
+     *
+     * When no root was given and not one anchored file was found, the finding is
+     * discarded. A base read from somewhere other than the tree it describes
+     * misses every file at once, and that shape is far likelier to be a wrong
+     * default root than a repository where every anchored file was deleted on
+     * the same day. Reporting it would put a drift warning on every record in
+     * the base, which teaches a reader to ignore the warning — the one outcome
+     * worse than not having it. One file found anywhere makes the root
+     * plausible, and the misses become findings again; an explicit `repoRoot` is
+     * taken at its word either way.
+     */
+    detectDrift(records: KbRecord[], repoRoot?: string): Promise<Map<string, KbAnchorDriftEntry[]> | undefined>;
     /**
      * The whole base, adjudicated, when it is small enough to hand over.
      *
@@ -509,17 +746,30 @@ declare class KbStore {
      * is indistinguishable from a complete one, so a caller would answer "that
      * was never decided" from a slice it did not know was a slice.
      *
-     * That refusal is the default guardrail. `all` bypasses it outright and
-     * always hands back the whole bundle: an explicit, never-accidental escape
-     * hatch for an operator who has the budget to spend, not a wider default.
+     * A token budget decides that, measured over what is actually handed back.
+     * The refusal names the estimate and the budget, because a caller told only
+     * "too big" cannot tell whether to narrow the type filter, raise the budget,
+     * or stop loading the base whole altogether. Past the budget the answer is
+     * the catalog and then a pack, which is what the refusal says.
+     *
+     * That refusal is the default guardrail. `all` bypasses the budget outright
+     * and always hands back the whole bundle: an explicit, never-accidental
+     * escape hatch for an operator who has the budget to spend, not a wider
+     * default.
      */
     load(bundlePath: string, options?: {
         budgetTokens?: number;
         type?: string;
         all?: boolean;
+        repoRoot?: string;
     }): Promise<KbLoadResult>;
     /** How a position was arrived at, as a timeline. See `trace.ts`. */
     trace(bundlePath: string, seedId: string, options?: KbTraceOptions): Promise<KbTraceStep[]>;
+    /** Every record named in one line each. See `catalog.ts`. */
+    catalog(bundlePath: string, options?: {
+        type?: string;
+        now?: Date;
+    }): Promise<KbCatalogResult>;
     /** A bounded neighbourhood around one record. See `pack.ts`. */
     pack(bundlePath: string, rootId: string, options?: KbPackOptions): Promise<KbPackResult>;
     /**
@@ -641,6 +891,7 @@ declare enum Fault {
 declare enum ErrorTypes {
     KbRecordAlreadyExists = "KbRecordAlreadyExists",
     KbInvalidConceptId = "KbInvalidConceptId",
+    KbMissingFlagValue = "KbMissingFlagValue",
     KbPackBudgetExceeded = "KbPackBudgetExceeded",
     KbRecordNotFound = "KbRecordNotFound",
     KbSelfVerification = "KbSelfVerification",
@@ -707,6 +958,18 @@ declare class KbPackBudgetExceededError extends BaseError {
     readonly excluded: string[];
     constructor(recordCount: number, approxTokens: number, budgetTokens: number, excluded: string[]);
 }
+/**
+ * A flag that takes a value, given none.
+ *
+ * `strauss-kb load --budget` used to read the next argv entry, find
+ * nothing, and quietly fall back to the default — so a caller who meant to
+ * raise a ceiling got the ceiling they were trying to move, and a typo looked
+ * exactly like success. Refusing is the only way that stays visible.
+ */
+declare class KbMissingFlagValueError extends BaseError {
+    readonly flag: string;
+    constructor(flag: string);
+}
 declare class KbInvalidConceptIdError extends BaseError {
     constructor(message: string, details: Record<string, string>);
 }
@@ -742,6 +1005,11 @@ declare const composeInputSchema: z.ZodObject<{
     anchors: z.ZodOptional<z.ZodArray<z.ZodObject<{
         file: z.ZodString;
         symbol: z.ZodOptional<z.ZodString>;
+        repo: z.ZodOptional<z.ZodString>;
+        ref: z.ZodOptional<z.ZodString>;
+        hash: z.ZodOptional<z.ZodString>;
+        resolved_at: z.ZodOptional<z.ZodString>;
+        lines: z.ZodOptional<z.ZodNumber>;
     }, z.core.$strict>>>;
     sources: z.ZodOptional<z.ZodArray<z.ZodObject<{
         id: z.ZodString;
@@ -1181,9 +1449,10 @@ declare function validateBundle(records: KbRecord[]): KbValidationProblem[];
  * decay silently, because a stale record reads exactly like a live one and a
  * question nobody answered reads exactly like one nobody asked.
  *
- * Grouped and counted rather than merged into one list: the seven checks are
- * seven different repairs — re-verify, re-date, answer, link, or supersede —
- * and a flat list of "problems" would leave the reader sorting them again.
+ * Grouped and counted rather than merged into one list: the eight checks are
+ * eight different repairs — re-verify, re-date, answer, link, supersede, or
+ * re-anchor — and a flat list of "problems" would leave the reader sorting
+ * them again.
  *
  * Every group is emitted even when empty. A check that found nothing and a
  * check that never ran look identical in a report that only lists findings,
@@ -1192,7 +1461,7 @@ declare function validateBundle(records: KbRecord[]): KbValidationProblem[];
 declare const DEFAULT_EXPIRING_DAYS = 30;
 declare const DEFAULT_UNVERIFIED_DAYS = 90;
 declare const DEFAULT_AGING_DAYS = 90;
-declare const KB_DOCTOR_CHECKS: readonly ["expired", "expiring", "unverified", "aging", "orphaned", "broken-supersession", "superseded-but-cited"];
+declare const KB_DOCTOR_CHECKS: readonly ["expired", "expiring", "unverified", "aging", "orphaned", "broken-supersession", "superseded-but-cited", "drifted"];
 type KbDoctorCheck = (typeof KB_DOCTOR_CHECKS)[number];
 type KbDoctorFinding = {
     conceptId: string;
@@ -1217,7 +1486,7 @@ type KbDoctorReport = {
     recordCount: number;
     thresholds: KbDoctorThresholds;
     counts: Record<KbDoctorCheck, number>;
-    /** All seven, in `KB_DOCTOR_CHECKS` order, empty ones included. */
+    /** All eight, in `KB_DOCTOR_CHECKS` order, empty ones included. */
     groups: KbDoctorGroup[];
     findingCount: number;
     healthy: boolean;
@@ -1230,6 +1499,13 @@ type KbDoctorOptions = {
     /** How long `open` or `proposed` may stand before `aging` reports it. */
     agingDays?: number;
     now?: Date;
+    /**
+     * Anchor drift, precomputed by the caller. `doctor` stays pure and sync for
+     * the same reason `adjudicate` does — the filesystem work of re-resolving
+     * anchors belongs to `detectAnchorDrift`, and a sweep with no map simply
+     * reports the `drifted` check as clean rather than half-running it.
+     */
+    anchorDrift?: Map<string, KbAnchorDriftEntry[]>;
 };
 declare function doctor(bundle: KbRecord[], options?: KbDoctorOptions): KbDoctorReport;
 
@@ -1277,6 +1553,11 @@ declare const decisionInputSchema: z.ZodObject<{
     anchors: z.ZodOptional<z.ZodArray<z.ZodObject<{
         file: z.ZodString;
         symbol: z.ZodOptional<z.ZodString>;
+        repo: z.ZodOptional<z.ZodString>;
+        ref: z.ZodOptional<z.ZodString>;
+        hash: z.ZodOptional<z.ZodString>;
+        resolved_at: z.ZodOptional<z.ZodString>;
+        lines: z.ZodOptional<z.ZodNumber>;
     }, z.core.$strict>>>;
     verify: z.ZodOptional<z.ZodArray<z.ZodString>>;
     relatedConceptIds: z.ZodOptional<z.ZodArray<z.ZodString>>;
@@ -1511,4 +1792,4 @@ declare function parseMarkdownWithFrontmatter<S extends z.ZodType>(text: string,
     frontmatter: ReturnType<S["safeParse"]>;
 };
 
-export { BaseError, CONTEXT_BEGIN, CONTEXT_END, CONTEXT_PROFILES, type ComposeInput, type ComposedRecord, DECISION_TYPE, DEFAULT_AGING_DAYS, DEFAULT_EXPIRING_DAYS, DEFAULT_LOAD_BUDGET, DEFAULT_PACK_HOPS, DEFAULT_PACK_MAX_NODES, DEFAULT_UNVERIFIED_DAYS, type DecisionInput, type DiffFile, type DiffHunk, type DiffMatch, type ErrorDetails, type ErrorProps, ErrorTypes, Fault, INDEX_FILE, KB_COMMANDS, KB_COMMANDS_BY_NAME, KB_CONCEPT_ID_PATTERN, KB_CONFIDENCES, KB_DIR, KB_DOCTOR_CHECKS, KB_EDGE_KINDS, KB_MATERIALITIES, KB_RECORD_STATUSES, KB_RECORD_TYPES, KB_SLUG_PATTERN, type KbActorStamp, type KbAdjudicated, type KbAnchor, KbBaseFrozenError, type KbCommand, type KbCommandContext, type KbContextBudgets, type KbContextOptions, type KbContextResult, type KbDoctorCheck, type KbDoctorFinding, type KbDoctorGroup, type KbDoctorOptions, type KbDoctorReport, type KbDoctorThresholds, type KbEdgeKind, KbInvalidConceptIdError, type KbLoadResult, type KbLogEntry, type KbLogReadResult, type KbLogger, type KbMergedPin, type KbMergedPins, type KbNeighbour, KbPackBudgetExceededError, type KbPackOptions, type KbPackResult, type KbPackedRecord, type KbPin, type KbPinLayer, type KbPinOptions, type KbPinResult, type KbPinStatus, KbPinsMalformedError, type KbPinsManifest, type KbRecord, KbRecordAlreadyExistsError, type KbRecordFrontmatter, KbRecordNotFoundError, type KbRecordStatus, type KbRecordType, type KbRecordTypeSpec, type KbSearchLogger, KbSelfVerificationError, type KbSource, type KbStanding, KbStore, type KbSupersededStub, type KbSyncResult, type KbTraceEdge, type KbTraceOptions, type KbTraceStep, type KbValidationProblem, type KbVerifiedEvent, type KbWarning, KbWriteConflictError, type KbWriteInput, LOG_FILE, type MatchOptions, NO_DECISION_SLUG, PINS_FILE, PINS_LOCAL_FILE, PIN_LAYERS, type QmdModule, RECORD_TYPES, SEARCH_INDEX_FILE, type SearchHit, type SearchOptions, type SymbolRange, TRACE_EDGES, adjudicate, assertBaseNotFrozen, buildContext, composeDecisionRecord, composeInputSchema, composeNoDecisionRecord, composeRecord, contextProfileBudgets, createKbMcpServer, decisionInputSchema, doctor, edgeNeighbours, indexIsStale, isKbRecordType, isNoDecisionRecord, kbActorStampSchema, kbAnchorSchema, kbConceptIdSchema, kbJsonSchemas, kbLogEntrySchema, kbRecordFrontmatterSchema, kbSourceSchema, kbVerifiedEventSchema, listPins, loadQmd, matchToDiff, mergedContextBudgets, neighbours, pack, parseLog, parseMarkdownWithFrontmatter, pinBase, readMergedPins, readPinsLayer, renderIndex, renderIndexLine, renderLogEntry, resolveHeads, resolveHits, resolvePinPath, runKbCli, runKbMcpServer, searchBase, selectDecisions, splitMarkdownFrontmatter, stringifyMarkdownWithFrontmatter, syncInstructions, toHookJson, trace, unpinBase, validateBundle };
+export { type AnchorResolver, BaseError, CONTEXT_BEGIN, CONTEXT_END, CONTEXT_PROFILES, type ComposeInput, type ComposedRecord, DECISION_TYPE, DEFAULT_AGING_DAYS, DEFAULT_EXPIRING_DAYS, DEFAULT_LOAD_BUDGET, DEFAULT_PACK_HOPS, DEFAULT_PACK_MAX_NODES, DEFAULT_UNVERIFIED_DAYS, type DecisionInput, type DiffFile, type DiffHunk, type DiffMatch, type ErrorDetails, type ErrorProps, ErrorTypes, Fault, INDEX_FILE, KB_COMMANDS, KB_COMMANDS_BY_NAME, KB_CONCEPT_ID_PATTERN, KB_CONFIDENCES, KB_DIR, KB_DOCTOR_CHECKS, KB_EDGE_KINDS, KB_MATERIALITIES, KB_RECORD_STATUSES, KB_RECORD_TYPES, KB_SLUG_PATTERN, type KbActorStamp, type KbAdjudicated, type KbAnchor, type KbAnchorDriftEntry, KbBaseFrozenError, type KbCatalogEntry, type KbCatalogResult, type KbCommand, type KbCommandContext, type KbContextBudgets, type KbContextOptions, type KbContextResult, type KbDoctorCheck, type KbDoctorFinding, type KbDoctorGroup, type KbDoctorOptions, type KbDoctorReport, type KbDoctorThresholds, type KbEdgeKind, KbInvalidConceptIdError, type KbLoadResult, type KbLogEntry, type KbLogReadResult, type KbLogger, type KbMergedPin, type KbMergedPins, KbMissingFlagValueError, type KbNeighbour, KbPackBudgetExceededError, type KbPackOptions, type KbPackResult, type KbPackedRecord, type KbPin, type KbPinLayer, type KbPinOptions, type KbPinResult, type KbPinStatus, KbPinsMalformedError, type KbPinsManifest, type KbRecord, KbRecordAlreadyExistsError, type KbRecordFrontmatter, KbRecordNotFoundError, type KbRecordStatus, type KbRecordType, type KbRecordTypeSpec, type KbSearchLogger, KbSelfVerificationError, type KbSource, type KbStanding, KbStore, type KbSupersededStub, type KbSyncResult, type KbTraceEdge, type KbTraceOptions, type KbTraceStep, type KbValidationProblem, type KbVerifiedEvent, type KbWarning, KbWriteConflictError, type KbWriteInput, LOG_FILE, type MatchOptions, NO_DECISION_SLUG, PINS_FILE, PINS_LOCAL_FILE, PIN_LAYERS, type QmdModule, RECORD_TYPES, type ResolvedSymbol, SEARCH_INDEX_FILE, type SearchHit, type SearchOptions, type SymbolRange, TRACE_EDGES, adjudicate, anchorFilePath, assertBaseNotFrozen, buildContext, catalog, composeDecisionRecord, composeInputSchema, composeNoDecisionRecord, composeRecord, contextProfileBudgets, createKbMcpServer, decisionInputSchema, detectAnchorDrift, doctor, edgeNeighbours, hashAnchorText, indexIsStale, isKbRecordType, isNoDecisionRecord, kbActorStampSchema, kbAnchorSchema, kbConceptIdSchema, kbJsonSchemas, kbLogEntrySchema, kbRecordFrontmatterSchema, kbSourceSchema, kbVerifiedEventSchema, listPins, loadQmd, matchToDiff, mergedContextBudgets, neighbours, pack, parseLog, parseMarkdownWithFrontmatter, pinBase, readMergedPins, readPinsLayer, regexResolver, renderCatalogLine, renderIndex, renderIndexLine, renderLogEntry, resolveAnchor, resolveHeads, resolveHits, resolvePinPath, runKbCli, runKbMcpServer, searchBase, selectDecisions, splitMarkdownFrontmatter, stringifyMarkdownWithFrontmatter, syncInstructions, toHookJson, trace, unpinBase, validateBundle };

package/dist/index.js

@@ -1,10 +1,10 @@
 import {
   runKbCli
-} from "./chunk-KVEEISYQ.js";
+} from "./chunk-I3WW4F6X.js";
 import {
   createKbMcpServer,
   runKbMcpServer
-} from "./chunk-MWWDD23L.js";
+} from "./chunk-CWWXMD35.js";
 import {
   BaseError,
   CONTEXT_BEGIN,
@@ -33,6 +33,7 @@ import {
   KB_SLUG_PATTERN,
   KbBaseFrozenError,
   KbInvalidConceptIdError,
+  KbMissingFlagValueError,
   KbPackBudgetExceededError,
   KbPinsMalformedError,
   KbRecordAlreadyExistsError,
@@ -49,16 +50,20 @@ import {
   SEARCH_INDEX_FILE,
   TRACE_EDGES,
   adjudicate,
+  anchorFilePath,
   assertBaseNotFrozen,
   buildContext,
+  catalog,
   composeDecisionRecord,
   composeInputSchema,
   composeNoDecisionRecord,
   composeRecord,
   contextProfileBudgets,
   decisionInputSchema,
+  detectAnchorDrift,
   doctor,
   edgeNeighbours,
+  hashAnchorText,
   indexIsStale,
   isKbRecordType,
   isNoDecisionRecord,
@@ -80,9 +85,12 @@ import {
   pinBase,
   readMergedPins,
   readPinsLayer,
+  regexResolver,
+  renderCatalogLine,
   renderIndex,
   renderIndexLine,
   renderLogEntry,
+  resolveAnchor,
   resolveHeads,
   resolveHits,
   resolvePinPath,
@@ -95,7 +103,7 @@ import {
   trace,
   unpinBase,
   validateBundle
-} from "./chunk-OFDWRMY6.js";
+} from "./chunk-OVRQCQ6P.js";
 
 // src/match-diff.ts
 function matchToDiff(files, records, options = {}) {
@@ -204,6 +212,7 @@ export {
   KB_SLUG_PATTERN,
   KbBaseFrozenError,
   KbInvalidConceptIdError,
+  KbMissingFlagValueError,
   KbPackBudgetExceededError,
   KbPinsMalformedError,
   KbRecordAlreadyExistsError,
@@ -220,8 +229,10 @@ export {
   SEARCH_INDEX_FILE,
   TRACE_EDGES,
   adjudicate,
+  anchorFilePath,
   assertBaseNotFrozen,
   buildContext,
+  catalog,
   composeDecisionRecord,
   composeInputSchema,
   composeNoDecisionRecord,
@@ -229,8 +240,10 @@ export {
   contextProfileBudgets,
   createKbMcpServer,
   decisionInputSchema,
+  detectAnchorDrift,
   doctor,
   edgeNeighbours,
+  hashAnchorText,
   indexIsStale,
   isKbRecordType,
   isNoDecisionRecord,
@@ -253,9 +266,12 @@ export {
   pinBase,
   readMergedPins,
   readPinsLayer,
+  regexResolver,
+  renderCatalogLine,
   renderIndex,
   renderIndexLine,
   renderLogEntry,
+  resolveAnchor,
   resolveHeads,
   resolveHits,
   resolvePinPath,

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/match-diff.ts"],"sourcesContent":["import { adjudicate, type KbAdjudicated } from \"./adjudicate.js\";\nimport type { KbAnchor, KbRecord } from \"./kb-record.schema.js\";\n\n/**\n * Which records apply to which part of a change.\n *\n * Takes a structural description of a diff rather than a patch, so this package\n * carries no diff parser: callers already have one, and a knowledge base has no\n * business preferring a particular flavour of unified diff.\n *\n * Deterministic on purpose. Every step here is mechanical — the one judgment,\n * whether a matched record is worth showing a reviewer, is deliberately absent.\n * A model placed here would sit between the reviewer and their diff on every\n * review, to answer a question nobody has yet shown needs asking.\n *\n * Distinct from `load()`, which hands a reader the whole base. That answers\n * \"does anything address this question\"; this answers \"what is attached to this\n * code\", and an anchor is the author's own statement rather than an inference\n * from one. A reader guessing which record relates to a hunk would be guessing\n * at something already written down — and a diff has dozens of hunks, which is\n * dozens of reader calls against microseconds of matching. Where they compose:\n * this narrows a hunk to a few records, and a reader asked to explain them gets\n * those, not the base.\n */\nexport type DiffHunk = {\n  /** 1-based, inclusive, in the file's post-change line numbering. */\n  startLine: number;\n  endLine: number;\n};\n\nexport type DiffFile = {\n  /** Repo-relative, matching how anchors are written. */\n  filePath: string;\n  hunks: DiffHunk[];\n};\n\n/**\n * A symbol resolved to lines. Supplied by whatever the caller uses to index\n * symbols; absence is tolerated — see `place()`.\n */\nexport type SymbolRange = {\n  file: string;\n  symbol: string;\n  startLine: number;\n  endLine: number;\n};\n\nexport type DiffMatch = {\n  filePath: string;\n  hunk: DiffHunk;\n  /** Current records first — what still holds should be read before what does not. */\n  records: KbAdjudicated[];\n  /**\n   * `symbol` when every record here was placed by a resolved symbol range,\n   * `file` when at least one fell back to the whole file. Reported rather than\n   * hidden: a caller showing a file-level match as though it were pinned to\n   * these lines is claiming a precision it does not have.\n   */\n  precision: \"symbol\" | \"file\";\n};\n\nexport type MatchOptions = {\n  /** Without these, symbol anchors degrade to file level rather than vanishing. */\n  symbolRanges?: SymbolRange[];\n  now?: Date;\n};\n\nexport function matchToDiff(\n  files: DiffFile[],\n  records: KbRecord[],\n  options: MatchOptions = {},\n): DiffMatch[] {\n  const ranges = indexRanges(options.symbolRanges ?? []);\n  const anchored = records.filter(\n    (record) => (record.frontmatter.strauss_anchors ?? []).length > 0,\n  );\n  const matches: DiffMatch[] = [];\n\n  for (const file of files) {\n    const candidates = anchored\n      .map((record) => ({\n        record,\n        anchors: (record.frontmatter.strauss_anchors ?? []).filter(\n          (anchor) => normalize(anchor.file) === normalize(file.filePath),\n        ),\n      }))\n      .filter(({ anchors }) => anchors.length > 0);\n    if (!candidates.length) continue;\n\n    for (const hunk of file.hunks) {\n      const hits: KbRecord[] = [];\n      let precision: DiffMatch[\"precision\"] = \"symbol\";\n\n      for (const { record, anchors } of candidates) {\n        const placement = place(anchors, file.filePath, hunk, ranges);\n        if (placement === \"miss\") continue;\n        if (placement === \"file\") precision = \"file\";\n        hits.push(record);\n      }\n\n      if (!hits.length) continue;\n      matches.push({\n        filePath: file.filePath,\n        hunk,\n        records: order(adjudicate(hits, records, options.now)),\n        precision,\n      });\n    }\n  }\n\n  return matches;\n}\n\n/**\n * Whether any of a record's anchors puts it on this hunk.\n *\n * An anchor naming only a file is about the whole file, so it lands on every\n * hunk in it. One naming a symbol lands only where that symbol's lines overlap\n * — unless nothing resolved the symbol, in which case it falls back to the file\n * rather than disappearing. A record silently absent because a resolver was\n * unavailable is worse than one shown imprecisely and labelled as such.\n */\nfunction place(\n  anchors: KbAnchor[],\n  filePath: string,\n  hunk: DiffHunk,\n  ranges: Map<string, SymbolRange[]>,\n): \"symbol\" | \"file\" | \"miss\" {\n  let fallback: \"file\" | \"miss\" = \"miss\";\n\n  for (const anchor of anchors) {\n    if (!anchor.symbol) return \"file\";\n\n    const resolved = ranges.get(key(filePath, anchor.symbol));\n    if (!resolved?.length) {\n      fallback = \"file\";\n      continue;\n    }\n    if (resolved.some((range) => overlaps(range, hunk))) return \"symbol\";\n  }\n\n  return fallback;\n}\n\nfunction overlaps(range: SymbolRange, hunk: DiffHunk): boolean {\n  return range.startLine <= hunk.endLine && hunk.startLine <= range.endLine;\n}\n\n/** Current before superseded, then oldest first, so an arc reads in order. */\nfunction order(records: KbAdjudicated[]): KbAdjudicated[] {\n  const rank: Record<string, number> = {\n    current: 0,\n    unsettled: 1,\n    open: 2,\n    superseded: 3,\n    rejected: 4,\n  };\n  return [...records].sort(\n    (left, right) =>\n      (rank[left.standing] ?? 9) - (rank[right.standing] ?? 9) ||\n      (left.record.frontmatter.generated?.at ?? \"\").localeCompare(\n        right.record.frontmatter.generated?.at ?? \"\",\n      ),\n  );\n}\n\nfunction indexRanges(ranges: SymbolRange[]): Map<string, SymbolRange[]> {\n  const byKey = new Map<string, SymbolRange[]>();\n  for (const range of ranges) {\n    const id = key(range.file, range.symbol);\n    byKey.set(id, [...(byKey.get(id) ?? []), range]);\n  }\n  return byKey;\n}\n\nfunction key(file: string, symbol: string): string {\n  return `${normalize(file)}#${symbol}`;\n}\n\n/** Anchors are written by hand often enough that `./` shows up. */\nfunction normalize(path: string): string {\n  return path.replace(/^\\.\\//, \"\");\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmEO,SAAS,YACd,OACA,SACA,UAAwB,CAAC,GACZ;AACb,QAAM,SAAS,YAAY,QAAQ,gBAAgB,CAAC,CAAC;AACrD,QAAM,WAAW,QAAQ;AAAA,IACvB,CAAC,YAAY,OAAO,YAAY,mBAAmB,CAAC,GAAG,SAAS;AAAA,EAClE;AACA,QAAM,UAAuB,CAAC;AAE9B,aAAW,QAAQ,OAAO;AACxB,UAAM,aAAa,SAChB,IAAI,CAAC,YAAY;AAAA,MAChB;AAAA,MACA,UAAU,OAAO,YAAY,mBAAmB,CAAC,GAAG;AAAA,QAClD,CAAC,WAAW,UAAU,OAAO,IAAI,MAAM,UAAU,KAAK,QAAQ;AAAA,MAChE;AAAA,IACF,EAAE,EACD,OAAO,CAAC,EAAE,QAAQ,MAAM,QAAQ,SAAS,CAAC;AAC7C,QAAI,CAAC,WAAW,OAAQ;AAExB,eAAW,QAAQ,KAAK,OAAO;AAC7B,YAAM,OAAmB,CAAC;AAC1B,UAAI,YAAoC;AAExC,iBAAW,EAAE,QAAQ,QAAQ,KAAK,YAAY;AAC5C,cAAM,YAAY,MAAM,SAAS,KAAK,UAAU,MAAM,MAAM;AAC5D,YAAI,cAAc,OAAQ;AAC1B,YAAI,cAAc,OAAQ,aAAY;AACtC,aAAK,KAAK,MAAM;AAAA,MAClB;AAEA,UAAI,CAAC,KAAK,OAAQ;AAClB,cAAQ,KAAK;AAAA,QACX,UAAU,KAAK;AAAA,QACf;AAAA,QACA,SAAS,MAAM,WAAW,MAAM,SAAS,QAAQ,GAAG,CAAC;AAAA,QACrD;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAWA,SAAS,MACP,SACA,UACA,MACA,QAC4B;AAC5B,MAAI,WAA4B;AAEhC,aAAW,UAAU,SAAS;AAC5B,QAAI,CAAC,OAAO,OAAQ,QAAO;AAE3B,UAAM,WAAW,OAAO,IAAI,IAAI,UAAU,OAAO,MAAM,CAAC;AACxD,QAAI,CAAC,UAAU,QAAQ;AACrB,iBAAW;AACX;AAAA,IACF;AACA,QAAI,SAAS,KAAK,CAAC,UAAU,SAAS,OAAO,IAAI,CAAC,EAAG,QAAO;AAAA,EAC9D;AAEA,SAAO;AACT;AAEA,SAAS,SAAS,OAAoB,MAAyB;AAC7D,SAAO,MAAM,aAAa,KAAK,WAAW,KAAK,aAAa,MAAM;AACpE;AAGA,SAAS,MAAM,SAA2C;AACxD,QAAM,OAA+B;AAAA,IACnC,SAAS;AAAA,IACT,WAAW;AAAA,IACX,MAAM;AAAA,IACN,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AACA,SAAO,CAAC,GAAG,OAAO,EAAE;AAAA,IAClB,CAAC,MAAM,WACJ,KAAK,KAAK,QAAQ,KAAK,MAAM,KAAK,MAAM,QAAQ,KAAK,OACrD,KAAK,OAAO,YAAY,WAAW,MAAM,IAAI;AAAA,MAC5C,MAAM,OAAO,YAAY,WAAW,MAAM;AAAA,IAC5C;AAAA,EACJ;AACF;AAEA,SAAS,YAAY,QAAmD;AACtE,QAAM,QAAQ,oBAAI,IAA2B;AAC7C,aAAW,SAAS,QAAQ;AAC1B,UAAM,KAAK,IAAI,MAAM,MAAM,MAAM,MAAM;AACvC,UAAM,IAAI,IAAI,CAAC,GAAI,MAAM,IAAI,EAAE,KAAK,CAAC,GAAI,KAAK,CAAC;AAAA,EACjD;AACA,SAAO;AACT;AAEA,SAAS,IAAI,MAAc,QAAwB;AACjD,SAAO,GAAG,UAAU,IAAI,CAAC,IAAI,MAAM;AACrC;AAGA,SAAS,UAAU,MAAsB;AACvC,SAAO,KAAK,QAAQ,SAAS,EAAE;AACjC;","names":[]}
+{"version":3,"sources":["../src/match-diff.ts"],"sourcesContent":["import { adjudicate, type KbAdjudicated } from \"./adjudicate.js\";\nimport type { KbAnchor, KbRecord } from \"./kb-record.schema.js\";\n\n/**\n * Which records apply to which part of a change.\n *\n * Takes a structural description of a diff rather than a patch, so this package\n * carries no diff parser: callers already have one, and a knowledge base has no\n * business preferring a particular flavour of unified diff.\n *\n * Deterministic on purpose. Every step here is mechanical — the one judgment,\n * whether a matched record is worth showing a reviewer, is deliberately absent.\n * A model placed here would sit between the reviewer and their diff on every\n * review, to answer a question nobody has yet shown needs asking.\n *\n * Distinct from `load()`, which hands a reader the whole base. That answers\n * \"does anything address this question\"; this answers \"what is attached to this\n * code\", and an anchor is the author's own statement rather than an inference\n * from one. A reader guessing which record relates to a hunk would be guessing\n * at something already written down — and a diff has dozens of hunks, which is\n * dozens of reader calls against microseconds of matching. Where they compose:\n * this narrows a hunk to a few records, and a reader asked to explain them gets\n * those, not the base.\n */\nexport type DiffHunk = {\n  /** 1-based, inclusive, in the file's post-change line numbering. */\n  startLine: number;\n  endLine: number;\n};\n\nexport type DiffFile = {\n  /** Repo-relative, matching how anchors are written. */\n  filePath: string;\n  hunks: DiffHunk[];\n};\n\n/**\n * A symbol resolved to lines. Supplied by whatever the caller uses to index\n * symbols; absence is tolerated — see `place()`.\n */\nexport type SymbolRange = {\n  file: string;\n  symbol: string;\n  startLine: number;\n  endLine: number;\n};\n\nexport type DiffMatch = {\n  filePath: string;\n  hunk: DiffHunk;\n  /** Current records first — what still holds should be read before what does not. */\n  records: KbAdjudicated[];\n  /**\n   * `symbol` when every record here was placed by a resolved symbol range,\n   * `file` when at least one fell back to the whole file. Reported rather than\n   * hidden: a caller showing a file-level match as though it were pinned to\n   * these lines is claiming a precision it does not have.\n   */\n  precision: \"symbol\" | \"file\";\n};\n\nexport type MatchOptions = {\n  /** Without these, symbol anchors degrade to file level rather than vanishing. */\n  symbolRanges?: SymbolRange[];\n  now?: Date;\n};\n\nexport function matchToDiff(\n  files: DiffFile[],\n  records: KbRecord[],\n  options: MatchOptions = {},\n): DiffMatch[] {\n  const ranges = indexRanges(options.symbolRanges ?? []);\n  const anchored = records.filter(\n    (record) => (record.frontmatter.strauss_anchors ?? []).length > 0,\n  );\n  const matches: DiffMatch[] = [];\n\n  for (const file of files) {\n    const candidates = anchored\n      .map((record) => ({\n        record,\n        anchors: (record.frontmatter.strauss_anchors ?? []).filter(\n          (anchor) => normalize(anchor.file) === normalize(file.filePath),\n        ),\n      }))\n      .filter(({ anchors }) => anchors.length > 0);\n    if (!candidates.length) continue;\n\n    for (const hunk of file.hunks) {\n      const hits: KbRecord[] = [];\n      let precision: DiffMatch[\"precision\"] = \"symbol\";\n\n      for (const { record, anchors } of candidates) {\n        const placement = place(anchors, file.filePath, hunk, ranges);\n        if (placement === \"miss\") continue;\n        if (placement === \"file\") precision = \"file\";\n        hits.push(record);\n      }\n\n      if (!hits.length) continue;\n      matches.push({\n        filePath: file.filePath,\n        hunk,\n        records: order(adjudicate(hits, records, options.now)),\n        precision,\n      });\n    }\n  }\n\n  return matches;\n}\n\n/**\n * Whether any of a record's anchors puts it on this hunk.\n *\n * An anchor naming only a file is about the whole file, so it lands on every\n * hunk in it. One naming a symbol lands only where that symbol's lines overlap\n * — unless nothing resolved the symbol, in which case it falls back to the file\n * rather than disappearing. A record silently absent because a resolver was\n * unavailable is worse than one shown imprecisely and labelled as such.\n */\nfunction place(\n  anchors: KbAnchor[],\n  filePath: string,\n  hunk: DiffHunk,\n  ranges: Map<string, SymbolRange[]>,\n): \"symbol\" | \"file\" | \"miss\" {\n  let fallback: \"file\" | \"miss\" = \"miss\";\n\n  for (const anchor of anchors) {\n    if (!anchor.symbol) return \"file\";\n\n    const resolved = ranges.get(key(filePath, anchor.symbol));\n    if (!resolved?.length) {\n      fallback = \"file\";\n      continue;\n    }\n    if (resolved.some((range) => overlaps(range, hunk))) return \"symbol\";\n  }\n\n  return fallback;\n}\n\nfunction overlaps(range: SymbolRange, hunk: DiffHunk): boolean {\n  return range.startLine <= hunk.endLine && hunk.startLine <= range.endLine;\n}\n\n/** Current before superseded, then oldest first, so an arc reads in order. */\nfunction order(records: KbAdjudicated[]): KbAdjudicated[] {\n  const rank: Record<string, number> = {\n    current: 0,\n    unsettled: 1,\n    open: 2,\n    superseded: 3,\n    rejected: 4,\n  };\n  return [...records].sort(\n    (left, right) =>\n      (rank[left.standing] ?? 9) - (rank[right.standing] ?? 9) ||\n      (left.record.frontmatter.generated?.at ?? \"\").localeCompare(\n        right.record.frontmatter.generated?.at ?? \"\",\n      ),\n  );\n}\n\nfunction indexRanges(ranges: SymbolRange[]): Map<string, SymbolRange[]> {\n  const byKey = new Map<string, SymbolRange[]>();\n  for (const range of ranges) {\n    const id = key(range.file, range.symbol);\n    byKey.set(id, [...(byKey.get(id) ?? []), range]);\n  }\n  return byKey;\n}\n\nfunction key(file: string, symbol: string): string {\n  return `${normalize(file)}#${symbol}`;\n}\n\n/** Anchors are written by hand often enough that `./` shows up. */\nfunction normalize(path: string): string {\n  return path.replace(/^\\.\\//, \"\");\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmEO,SAAS,YACd,OACA,SACA,UAAwB,CAAC,GACZ;AACb,QAAM,SAAS,YAAY,QAAQ,gBAAgB,CAAC,CAAC;AACrD,QAAM,WAAW,QAAQ;AAAA,IACvB,CAAC,YAAY,OAAO,YAAY,mBAAmB,CAAC,GAAG,SAAS;AAAA,EAClE;AACA,QAAM,UAAuB,CAAC;AAE9B,aAAW,QAAQ,OAAO;AACxB,UAAM,aAAa,SAChB,IAAI,CAAC,YAAY;AAAA,MAChB;AAAA,MACA,UAAU,OAAO,YAAY,mBAAmB,CAAC,GAAG;AAAA,QAClD,CAAC,WAAW,UAAU,OAAO,IAAI,MAAM,UAAU,KAAK,QAAQ;AAAA,MAChE;AAAA,IACF,EAAE,EACD,OAAO,CAAC,EAAE,QAAQ,MAAM,QAAQ,SAAS,CAAC;AAC7C,QAAI,CAAC,WAAW,OAAQ;AAExB,eAAW,QAAQ,KAAK,OAAO;AAC7B,YAAM,OAAmB,CAAC;AAC1B,UAAI,YAAoC;AAExC,iBAAW,EAAE,QAAQ,QAAQ,KAAK,YAAY;AAC5C,cAAM,YAAY,MAAM,SAAS,KAAK,UAAU,MAAM,MAAM;AAC5D,YAAI,cAAc,OAAQ;AAC1B,YAAI,cAAc,OAAQ,aAAY;AACtC,aAAK,KAAK,MAAM;AAAA,MAClB;AAEA,UAAI,CAAC,KAAK,OAAQ;AAClB,cAAQ,KAAK;AAAA,QACX,UAAU,KAAK;AAAA,QACf;AAAA,QACA,SAAS,MAAM,WAAW,MAAM,SAAS,QAAQ,GAAG,CAAC;AAAA,QACrD;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAWA,SAAS,MACP,SACA,UACA,MACA,QAC4B;AAC5B,MAAI,WAA4B;AAEhC,aAAW,UAAU,SAAS;AAC5B,QAAI,CAAC,OAAO,OAAQ,QAAO;AAE3B,UAAM,WAAW,OAAO,IAAI,IAAI,UAAU,OAAO,MAAM,CAAC;AACxD,QAAI,CAAC,UAAU,QAAQ;AACrB,iBAAW;AACX;AAAA,IACF;AACA,QAAI,SAAS,KAAK,CAAC,UAAU,SAAS,OAAO,IAAI,CAAC,EAAG,QAAO;AAAA,EAC9D;AAEA,SAAO;AACT;AAEA,SAAS,SAAS,OAAoB,MAAyB;AAC7D,SAAO,MAAM,aAAa,KAAK,WAAW,KAAK,aAAa,MAAM;AACpE;AAGA,SAAS,MAAM,SAA2C;AACxD,QAAM,OAA+B;AAAA,IACnC,SAAS;AAAA,IACT,WAAW;AAAA,IACX,MAAM;AAAA,IACN,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AACA,SAAO,CAAC,GAAG,OAAO,EAAE;AAAA,IAClB,CAAC,MAAM,WACJ,KAAK,KAAK,QAAQ,KAAK,MAAM,KAAK,MAAM,QAAQ,KAAK,OACrD,KAAK,OAAO,YAAY,WAAW,MAAM,IAAI;AAAA,MAC5C,MAAM,OAAO,YAAY,WAAW,MAAM;AAAA,IAC5C;AAAA,EACJ;AACF;AAEA,SAAS,YAAY,QAAmD;AACtE,QAAM,QAAQ,oBAAI,IAA2B;AAC7C,aAAW,SAAS,QAAQ;AAC1B,UAAM,KAAK,IAAI,MAAM,MAAM,MAAM,MAAM;AACvC,UAAM,IAAI,IAAI,CAAC,GAAI,MAAM,IAAI,EAAE,KAAK,CAAC,GAAI,KAAK,CAAC;AAAA,EACjD;AACA,SAAO;AACT;AAEA,SAAS,IAAI,MAAc,QAAwB;AACjD,SAAO,GAAG,UAAU,IAAI,CAAC,IAAI,MAAM;AACrC;AAGA,SAAS,UAAU,MAAsB;AACvC,SAAO,KAAK,QAAQ,SAAS,EAAE;AACjC;","names":[]}