@saasontools/strauss-kb 0.1.14 → 0.1.16

package/dist/index.d.ts

@@ -187,12 +187,14 @@ type KbRecord = {
     body: string;
 };
 
+/** Where bare mirrors live. Overridable so a test never writes to `$HOME`. */
+declare function repoCacheDir(override?: string): string;
+
 /**
- * Resolves symbolic anchors to text and detects drift against stored hashes.
+ * The vocabulary anchor resolution is reported in.
  *
- * 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.
+ * Every failure is a finding with a reason, never a throw: a record pointing
+ * at code that moved is information, not a broken run.
  */
 type ResolvedSymbol = {
     text: string;
@@ -206,36 +208,22 @@ interface AnchorResolver {
 }
 /** 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;
+/** The remote could not be fetched, or `--offline` found nothing cached. */
+ | "remote-unreachable"
+/** The anchor's `ref` is not on the remote any more. */
+ | "ref-not-found" | "repo-unauthorized"
+/** No default branch, so there is no "current" to compare against. */
+ | "default-branch-unknown"
+/** The anchor's `ref` is not a name git may safely be handed. */
+ | "ref-invalid"
+/** The anchor's `repo` is not a remote we will fetch from. */
+ | "repo-invalid";
+/**
+ * How a ref-pinned foreign anchor stands. `drifted-on-default` is the one a
+ * working-tree anchor has no equivalent of: the evidence is still true at the
+ * commit it was taken from, and the code has moved since.
+ */
+type RemoteAnchorState = "matches-ref" | "drifted-from-ref" | "drifted-on-default";
 type KbAnchorDriftEntry = {
     file: string;
     symbol?: string;
@@ -245,17 +233,10 @@ type KbAnchorDriftEntry = {
     /** `null` when the anchor recorded no `lines` — size unknown, not zero. */
     diffSize: number | null;
     reason?: AnchorUnresolvedReason;
+    /** Set only when the anchor was resolved against another repository. */
+    repo?: string;
+    remoteState?: RemoteAnchorState;
 };
-/**
- * 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;
@@ -264,26 +245,109 @@ type AnchorRead = {
     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.
+ * A foreign anchor's file at one rev. `ref` absent means the remote's default
+ * branch — the "current" side of a ref-pinned comparison.
+ */
+type RemoteWant = {
+    repo: string;
+    ref?: string;
+    file: string;
+};
+type RemoteRead = {
+    ok: true;
+    source: string;
+} | {
+    ok: false;
+    reason: AnchorUnresolvedReason;
+};
+type RemoteOptions = {
+    /** Cache only: no `fetch`, no `ls-remote`. */
+    offline?: boolean;
+    cacheDir?: string;
+    fetchTimeoutMs?: number;
+    /** Repositories worked on at once; fetches within one repo stay serial. */
+    concurrency?: number;
+};
+
+/**
+ * Reads each wanted (repo, rev, file) out of a bare cache under
+ * `~/.strauss/repo-cache`, fetching once per (repo, rev) and never per anchor.
  *
- * 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.
+ * Every failure lands as an `unresolved` reason on the wants it affects; no
+ * path is read from disk, so containment does not apply here.
  */
-declare function detectAnchorDrift(records: KbRecord[], options?: {
+declare function readRemoteAnchors(wants: readonly RemoteWant[], options?: RemoteOptions): Promise<Map<string, RemoteRead>>;
+
+type AnchorDriftOptions = {
     repoRoot?: string;
     resolver?: AnchorResolver;
     concurrency?: number;
     /** Test seam: replaces the disk reader. */
     reader?: AnchorFileReader;
-}): Promise<Map<string, KbAnchorDriftEntry[]>>;
+    /** Remote resolution of foreign anchors; `offline` keeps a run off the wire. */
+    remote?: RemoteOptions;
+    /** Test seam: replaces the remote blob reader. */
+    readRemote?: typeof readRemoteAnchors;
+};
+/**
+ * Re-resolves every hash-carrying anchor and compares against the stored hash.
+ *
+ * An anchor naming another repository is read from that repository's remote
+ * through a bare cache; everything else is read from the working tree. A
+ * missing file, an unreachable remote, or an unresolvable symbol is a finding
+ * (`unresolved`), never a throw.
+ *
+ * Four phases: collect the checkable anchors, read the working tree's distinct
+ * files and the remotes' distinct (repo, rev, file) blobs, then resolve and
+ * hash in record order — so the output never depends on which read finished
+ * first.
+ */
+declare function detectAnchorDrift(records: KbRecord[], options?: AnchorDriftOptions): Promise<Map<string, KbAnchorDriftEntry[]>>;
+
+/**
+ * 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;
+
+/**
+ * Does this spelling say where the repository lives?
+ *
+ * Only a full URL can be fetched from. A short form still matches this root's
+ * own origin, which is why `validate` warns rather than rejects.
+ */
+declare function isCanonicalRepoUrl(value: string): boolean;
+
+/**
+ * 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;
 
 /**
  * Why a matched record must not be read as a plain answer.
@@ -334,13 +398,23 @@ type KbWarning =
  *  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;
-    }[];
+    anchors: KbWarningAnchor[];
+}
+/** A foreign anchor nothing could check: the remote was unreachable, refused,
+ *  or the run was offline. Neither drift nor a clean match. */
+ | {
+    kind: "unchecked";
+    anchors: KbWarningAnchor[];
+};
+type KbWarningAnchor = {
+    file: string;
+    symbol?: string;
+    /** `null` when the anchor recorded no line count — size unknown. */
+    diffSize: number | null;
+    reason?: string;
+    /** Set only for an anchor resolved against another repository. */
+    repo?: string;
+    remoteState?: string;
 };
 type KbStanding = "current" | "superseded" | "rejected" | "unsettled" | "open";
 type KbAdjudicated = {
@@ -376,6 +450,11 @@ declare function resolveHeads(from: KbRecord, byId: Map<string, KbRecord>): {
     warnings: KbWarning[];
 };
 
+type KbRecordStamp = {
+    conceptId: string;
+    digest: string;
+};
+
 /**
  * Edges a trace may follow — the shared kb-edges.ts definitions, minus
  * `body-link`: body links can reach most of a bundle from anywhere, which
@@ -742,6 +821,16 @@ type KbLoadResult = {
      */
     digest: string;
 };
+/** What `stamp` reports for one base. See `kb-stamp.ts`. */
+type KbStampResult = {
+    path: string;
+    digest: string;
+    recordCount: number;
+    superseded: number;
+    /** Newest `generated.at` across the base, or null when none carries one. */
+    newestAt: string | null;
+    records: KbRecordStamp[];
+};
 type KbWriteInput = {
     type: string;
     slug: string;
@@ -858,7 +947,8 @@ declare class KbStore {
      * 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.
+     * sweep that failed to read the tree should report no drift, not fail — and
+     * `offline: false` there, because a sweep is worth a fetch.
      *
      * 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
@@ -870,7 +960,9 @@ declare class KbStore {
      * 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>;
+    detectDrift(records: KbRecord[], repoRoot?: string, options?: {
+        offline?: boolean;
+    }): Promise<Map<string, KbAnchorDriftEntry[]> | undefined>;
     /**
      * The whole base, adjudicated, when it is small enough to hand over.
      *
@@ -907,6 +999,13 @@ declare class KbStore {
         all?: boolean;
         repoRoot?: string;
     }): Promise<KbLoadResult>;
+    /**
+     * `load`'s digest without `load`'s bodies — the same records, adjudicated
+     * the same way, handed back as a stamp. Skips the anchor drift pass, which
+     * reads source files and only ever adds warnings: no warning reaches the
+     * digest, so the value is identical to the one `load` returns.
+     */
+    stamp(bundlePath: string): Promise<KbStampResult>;
     /** 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`. */
@@ -1043,6 +1142,8 @@ declare enum ErrorTypes {
     KbPackBudgetExceeded = "KbPackBudgetExceeded",
     KbRecordNotFound = "KbRecordNotFound",
     KbSelfVerification = "KbSelfVerification",
+    KbStampBaselineUnreadable = "KbStampBaselineUnreadable",
+    KbStampDigestBaselineAmbiguous = "KbStampDigestBaselineAmbiguous",
     KbUnknownLinkRel = "KbUnknownLinkRel",
     KbWriteConflict = "KbWriteConflict"
 }
@@ -1727,7 +1828,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", "drifted"];
+declare const KB_DOCTOR_CHECKS: readonly ["expired", "expiring", "unverified", "aging", "orphaned", "broken-supersession", "superseded-but-cited", "drifted", "unchecked"];
 type KbDoctorCheck = (typeof KB_DOCTOR_CHECKS)[number];
 type KbDoctorFinding = {
     conceptId: string;
@@ -1904,8 +2005,12 @@ type KbCommand<Shape extends z.ZodRawShape = z.ZodRawShape> = {
     /** Shown to an agent choosing a tool, so it carries the judgment too. */
     description: string;
     input: z.ZodObject<Shape>;
-    /** Positional argv → the same object MCP receives. */
-    fromArgv(argv: string[], bundlePath: string, stdin: () => Promise<string>): Promise<unknown> | unknown;
+    /**
+     * Positional argv → the same object MCP receives. `bundleExplicit` says
+     * whether `--bundle` was actually passed, for the one command whose meaning
+     * turns on it: `stamp` with no bundle stamps every pinned base.
+     */
+    fromArgv(argv: string[], bundlePath: string, stdin: () => Promise<string>, bundleExplicit?: boolean): Promise<unknown> | unknown;
     run(ctx: KbCommandContext, input: z.infer<z.ZodObject<Shape>>): Promise<unknown>;
     /**
      * A human-readable form of the result, for the CLI. Where it exists the CLI
@@ -2071,4 +2176,4 @@ declare function parseMarkdownWithFrontmatter<S extends z.ZodType>(text: string,
     frontmatter: ReturnType<S["safeParse"]>;
 };
 
-export { type AnchorResolver, BaseError, CONTEXT_BEGIN, CONTEXT_END, CONTEXT_PROFILES, type ComposeInput, type ComposeLink, type ComposedRecord, DECISION_TYPE, DEFAULT_AGING_DAYS, DEFAULT_EXPIRING_DAYS, DEFAULT_LOAD_BUDGET, DEFAULT_PACK_HOPS, DEFAULT_PACK_MAX_NODES, DEFAULT_TYPED_LINK_RELS, DEFAULT_UNVERIFIED_DAYS, type DecisionInput, type DiffFile, type DiffHunk, type DiffMatch, type ErrorDetails, type ErrorProps, ErrorTypes, Fault, INDEX_FILE, KB_CAUSAL_LINK_RELS, KB_COMMANDS, KB_COMMANDS_BY_NAME, KB_CONCEPT_ID_PATTERN, KB_CONFIDENCES, KB_DIR, KB_DOCTOR_CHECKS, KB_EDGE_KINDS, KB_LINK_RELS, KB_MATERIALITIES, KB_RECORD_STATUSES, KB_RECORD_TYPES, KB_SLUG_PATTERN, type KbActorStamp, type KbAdjudicated, type KbAnchor, type KbAnchorDriftEntry, type KbBacklink, type KbBacklinksResult, 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, type KbImpactOptions, type KbImpactResult, type KbImpactedRecord, type KbInboundEdge, KbInvalidConceptIdError, type KbLink, type KbLinkEdge, type KbLinkRel, type KbLinkRelSpec, 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, KbUnknownLinkRelError, type KbValidationProblem, type KbValidationSeverity, type KbVerifiedEvent, type KbWarning, KbWriteConflictError, type KbWriteInput, LINK_RELS, 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, backlinks, buildContext, catalog, composeDecisionRecord, composeInputSchema, composeLinkSchema, composeNoDecisionRecord, composeRecord, contextProfileBudgets, createKbMcpServer, decisionInputSchema, detectAnchorDrift, doctor, edgeNeighbours, hashAnchorText, impact, inboundIndex, indexIsStale, isKbLinkRel, isKbRecordType, isNoDecisionRecord, kbActorStampSchema, kbAnchorSchema, kbConceptIdSchema, kbJsonSchemas, kbLinkSchema, 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 };
+export { type AnchorResolver, BaseError, CONTEXT_BEGIN, CONTEXT_END, CONTEXT_PROFILES, type ComposeInput, type ComposeLink, type ComposedRecord, DECISION_TYPE, DEFAULT_AGING_DAYS, DEFAULT_EXPIRING_DAYS, DEFAULT_LOAD_BUDGET, DEFAULT_PACK_HOPS, DEFAULT_PACK_MAX_NODES, DEFAULT_TYPED_LINK_RELS, DEFAULT_UNVERIFIED_DAYS, type DecisionInput, type DiffFile, type DiffHunk, type DiffMatch, type ErrorDetails, type ErrorProps, ErrorTypes, Fault, INDEX_FILE, KB_CAUSAL_LINK_RELS, KB_COMMANDS, KB_COMMANDS_BY_NAME, KB_CONCEPT_ID_PATTERN, KB_CONFIDENCES, KB_DIR, KB_DOCTOR_CHECKS, KB_EDGE_KINDS, KB_LINK_RELS, KB_MATERIALITIES, KB_RECORD_STATUSES, KB_RECORD_TYPES, KB_SLUG_PATTERN, type KbActorStamp, type KbAdjudicated, type KbAnchor, type KbAnchorDriftEntry, type KbBacklink, type KbBacklinksResult, 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, type KbImpactOptions, type KbImpactResult, type KbImpactedRecord, type KbInboundEdge, KbInvalidConceptIdError, type KbLink, type KbLinkEdge, type KbLinkRel, type KbLinkRelSpec, 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, KbUnknownLinkRelError, type KbValidationProblem, type KbValidationSeverity, type KbVerifiedEvent, type KbWarning, KbWriteConflictError, type KbWriteInput, LINK_RELS, LOG_FILE, type MatchOptions, NO_DECISION_SLUG, PINS_FILE, PINS_LOCAL_FILE, PIN_LAYERS, type QmdModule, RECORD_TYPES, type RemoteAnchorState, type RemoteOptions, type RemoteRead, type ResolvedSymbol, SEARCH_INDEX_FILE, type SearchHit, type SearchOptions, type SymbolRange, TRACE_EDGES, adjudicate, anchorFilePath, assertBaseNotFrozen, backlinks, buildContext, catalog, composeDecisionRecord, composeInputSchema, composeLinkSchema, composeNoDecisionRecord, composeRecord, contextProfileBudgets, createKbMcpServer, decisionInputSchema, detectAnchorDrift, doctor, edgeNeighbours, hashAnchorText, impact, inboundIndex, indexIsStale, isCanonicalRepoUrl, isKbLinkRel, isKbRecordType, isNoDecisionRecord, kbActorStampSchema, kbAnchorSchema, kbConceptIdSchema, kbJsonSchemas, kbLinkSchema, kbLogEntrySchema, kbRecordFrontmatterSchema, kbSourceSchema, kbVerifiedEventSchema, listPins, loadQmd, matchToDiff, mergedContextBudgets, neighbours, pack, parseLog, parseMarkdownWithFrontmatter, pinBase, readMergedPins, readPinsLayer, readRemoteAnchors, regexResolver, renderCatalogLine, renderIndex, renderIndexLine, renderLogEntry, repoCacheDir, 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-MBXNCZ4V.js";
+} from "./chunk-RINBOAQZ.js";
 import {
   createKbMcpServer,
   runKbMcpServer
-} from "./chunk-PYA5E7FL.js";
+} from "./chunk-MEZCF646.js";
 import {
   BaseError,
   CONTEXT_BEGIN,
@@ -74,6 +74,7 @@ import {
   impact,
   inboundIndex,
   indexIsStale,
+  isCanonicalRepoUrl,
   isKbLinkRel,
   isKbRecordType,
   isNoDecisionRecord,
@@ -96,11 +97,13 @@ import {
   pinBase,
   readMergedPins,
   readPinsLayer,
+  readRemoteAnchors,
   regexResolver,
   renderCatalogLine,
   renderIndex,
   renderIndexLine,
   renderLogEntry,
+  repoCacheDir,
   resolveAnchor,
   resolveHeads,
   resolveHits,
@@ -114,7 +117,7 @@ import {
   trace,
   unpinBase,
   validateBundle
-} from "./chunk-43KALLFU.js";
+} from "./chunk-H5W53NVU.js";
 
 // src/match-diff.ts
 function matchToDiff(files, records, options = {}) {
@@ -265,6 +268,7 @@ export {
   impact,
   inboundIndex,
   indexIsStale,
+  isCanonicalRepoUrl,
   isKbLinkRel,
   isKbRecordType,
   isNoDecisionRecord,
@@ -288,11 +292,13 @@ export {
   pinBase,
   readMergedPins,
   readPinsLayer,
+  readRemoteAnchors,
   regexResolver,
   renderCatalogLine,
   renderIndex,
   renderIndexLine,
   renderLogEntry,
+  repoCacheDir,
   resolveAnchor,
   resolveHeads,
   resolveHits,

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":[]}