@descryy/core 0.1.0

package/dist/query/row-closure-picture.js

@@ -0,0 +1,131 @@
+/**
+ * DEC-244, extended: the same row can be closed by two different kinds of
+ * evidence at once, and they must never collapse into each other.
+ *
+ * `applyDeclaredValues` (`declared-value-closure.ts`) answers from `.env*`
+ * config alone. `applyConfirmedFacts` (`confirmed-facts.ts`) answers from
+ * human testimony alone, and — since `ConfirmedFact.environment` landed —
+ * testimony can now be scoped to a *named* environment, not just an unscoped
+ * blanket answer. This module is the picture that shows both kinds of
+ * evidence side by side, per environment, without ever letting one stand in
+ * for the other.
+ *
+ * ## The real case that forced this shape
+ *
+ * `sherpa-frontend`'s `import.meta.env.VITE_BACKEND_API_URL` today has, on
+ * disk, in this worktree:
+ *
+ * - `"development"` → `http://localhost:8000`, **declared** — read from
+ *   `.env.development.local`, class A (DEC-244 Row 1).
+ * - `"staging"` → `https://sherpa-backend-staging.up.railway.app`,
+ *   **asserted** — a human-confirmed `ConfirmedFact` with
+ *   `environment: "staging"`, class B. `"staging"` never appears in any
+ *   `.env*` filename here; the *only* reason this module knows it exists at
+ *   all is that a person named it on the fact.
+ * - `"production"` — still entirely unaddressed, by either source, and
+ *   **still unnameable from anything this module reads.**
+ *
+ * ## Why `environment` is never inferred, only ever read
+ *
+ * `ConfirmedFact.environment`'s own doc is explicit: "human-supplied only,
+ * never inferred." This module upholds that by construction — the only
+ * places an environment name enters this picture are `resolve.ts`'s
+ * `knownEnvironments` (from `.env*` **filenames**, DEC-223's own "never
+ * guessed, always refused" rule) and `fact.environment` (typed as the human
+ * literally set it). Nothing here parses `"staging"` out of a hostname; the
+ * hostname's word "staging" and the fact's `environment: "staging"` are
+ * correlated in this specific real case only because a *person* read the
+ * same signal and typed the same word — this module never makes that
+ * connection itself, and would behave identically if the two disagreed.
+ *
+ * ## Why `"closed"` is reserved for fully-declared rows
+ *
+ * A row where every named environment resolves — some from config, some from
+ * testimony — could be called "closed." It is deliberately not: `state`
+ * reaches `"closed"` only when **every** named environment's evidence is
+ * `declared` (class A). One environment resting on testimony keeps the whole
+ * row at `"partially-closed"`, even if nothing is technically unaddressed —
+ * because a caller reading the single word `"closed"` must never have to
+ * re-check `environments[].reliability` to find out whether that word is
+ * hiding an unaudited assertion. This is the concrete answer to "what each
+ * provenance earns, side by side" (DEC-244 Row 1): declared is A, asserted is
+ * B, and the top-level state can never quietly promote a B into looking like
+ * an A.
+ */
+import { askableHandle } from "./refusal-questions.js";
+import { applyConfirmedFacts } from "./confirmed-facts.js";
+import { resolveAgainstDeclared } from "../ledger/resolve.js";
+import { DECLARED_VALUE_RELIABILITY } from "./declared-value-closure.js";
+/** Same bar as `declared-value-closure.ts`, applied to the union of declared + asserted environment names. */
+const MIN_KNOWN_ENVIRONMENTS_FOR_CLOSED = 2;
+function isScoped(fact) {
+    return fact.environment !== undefined;
+}
+/**
+ * Describe every askable row against both sources of evidence at once.
+ *
+ * `declared` and `facts` are both pre-loaded by the caller — same
+ * read-once-apply-many discipline `resolveAgainstDeclared`/
+ * `applyConfirmedFacts` already follow. The fact-matching itself is not
+ * re-derived here: `applyConfirmedFacts` is called once and its output
+ * reused, so the `(repo, blockedBy)` scoping and the askable filter it
+ * already enforces are not re-implemented a second, potentially-diverging
+ * way.
+ */
+export function describeRowClosures(refs, declared, facts, repo) {
+    const factApplication = applyConfirmedFacts(refs, facts, repo);
+    const factsByRef = new Map(factApplication.answered.map((m) => [m.ref, m.facts]));
+    const resolutionCache = new Map();
+    const pictures = [];
+    const notAskable = [];
+    for (const ref of refs) {
+        const blockedBy = askableHandle(ref);
+        if (blockedBy === null) {
+            notAskable.push(ref);
+            continue;
+        }
+        let resolution = resolutionCache.get(blockedBy);
+        if (resolution === undefined) {
+            resolution = resolveAgainstDeclared(blockedBy, declared);
+            resolutionCache.set(blockedBy, resolution);
+        }
+        const matchedFacts = factsByRef.get(ref) ?? [];
+        const scopedFacts = matchedFacts.filter(isScoped);
+        const unscopedAssertions = matchedFacts
+            .filter((f) => !isScoped(f))
+            .map((f) => ({ value: f.value, confirmedBy: f.confirmedBy, confirmedAt: f.confirmedAt }));
+        const environmentNames = new Set(resolution.knownEnvironments);
+        for (const f of scopedFacts)
+            environmentNames.add(f.environment);
+        const environments = [...environmentNames].sort().map((environment) => {
+            const declaredEntry = resolution.resolved.find((r) => r.environment === environment);
+            // First-write-wins is fine here: two scoped facts naming the same
+            // environment is a producer-side data question, not this reader's to
+            // adjudicate — surfacing one rather than silently averaging or
+            // discarding is the honest minimum.
+            const assertedEntry = scopedFacts.find((f) => f.environment === environment);
+            const reliability = declaredEntry !== undefined ? DECLARED_VALUE_RELIABILITY : assertedEntry !== undefined ? "B" : null;
+            return {
+                environment,
+                declaredValue: declaredEntry?.value ?? null,
+                declaredFile: declaredEntry?.file ?? null,
+                declaredLine: declaredEntry?.line ?? null,
+                assertedValue: assertedEntry?.value ?? null,
+                assertedBy: assertedEntry?.confirmedBy ?? null,
+                assertedAt: assertedEntry?.confirmedAt ?? null,
+                reliability,
+            };
+        });
+        const stillUnaddressed = environments.filter((e) => e.reliability === null).map((e) => e.environment);
+        const allDeclared = environments.length > 0 && environments.every((e) => e.reliability === "A");
+        const anyAddressed = environments.some((e) => e.reliability !== null) || unscopedAssertions.length > 0;
+        const state = environments.length >= MIN_KNOWN_ENVIRONMENTS_FOR_CLOSED && allDeclared
+            ? "closed"
+            : anyAddressed
+                ? "partially-closed"
+                : "open";
+        pictures.push({ ref, blockedBy, environments, unscopedAssertions, stillUnaddressed, state });
+    }
+    return { pictures, notAskable };
+}
+//# sourceMappingURL=row-closure-picture.js.map

package/dist/query/row-closure-picture.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"row-closure-picture.js","sourceRoot":"","sources":["../../src/query/row-closure-picture.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqDG;AAIH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AAE3D,OAAO,EAAE,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AAC9D,OAAO,EAAE,0BAA0B,EAAqB,MAAM,6BAA6B,CAAC;AAE5F,8GAA8G;AAC9G,MAAM,iCAAiC,GAAG,CAAC,CAAC;AA4C5C,SAAS,QAAQ,CAAC,IAAmB;IACnC,OAAO,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC;AACxC,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAA8B,EAC9B,QAAqC,EACrC,KAA+B,EAC/B,IAAY;IAEZ,MAAM,eAAe,GAAG,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IAC/D,MAAM,UAAU,GAAG,IAAI,GAAG,CACxB,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CACtD,CAAC;IAEF,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoC,CAAC;IACpE,MAAM,QAAQ,GAAwB,EAAE,CAAC;IACzC,MAAM,UAAU,GAAoB,EAAE,CAAC;IAEvC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACvB,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrB,SAAS;QACX,CAAC;QAED,IAAI,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAChD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,UAAU,GAAG,sBAAsB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;YACzD,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QAC7C,CAAC;QAED,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAC/C,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAClD,MAAM,kBAAkB,GAAoB,YAAY;aACrD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;aAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAE5F,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAS,UAAU,CAAC,iBAAiB,CAAC,CAAC;QACvE,KAAK,MAAM,CAAC,IAAI,WAAW;YAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QAEjE,MAAM,YAAY,GAAuB,CAAC,GAAG,gBAAgB,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,EAAE;YACxF,MAAM,aAAa,GAAG,UAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,WAAW,CAAC,CAAC;YACtF,kEAAkE;YAClE,qEAAqE;YACrE,+DAA+D;YAC/D,oCAAoC;YACpC,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,WAAW,CAAC,CAAC;YAC7E,MAAM,WAAW,GACf,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,0BAA0B,CAAC,CAAC,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YACtG,OAAO;gBACL,WAAW;gBACX,aAAa,EAAE,aAAa,EAAE,KAAK,IAAI,IAAI;gBAC3C,YAAY,EAAE,aAAa,EAAE,IAAI,IAAI,IAAI;gBACzC,YAAY,EAAE,aAAa,EAAE,IAAI,IAAI,IAAI;gBACzC,aAAa,EAAE,aAAa,EAAE,KAAK,IAAI,IAAI;gBAC3C,UAAU,EAAE,aAAa,EAAE,WAAW,IAAI,IAAI;gBAC9C,UAAU,EAAE,aAAa,EAAE,WAAW,IAAI,IAAI;gBAC9C,WAAW;aACZ,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,MAAM,gBAAgB,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACtG,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,GAAG,CAAC,CAAC;QAChG,MAAM,YAAY,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC;QAEvG,MAAM,KAAK,GACT,YAAY,CAAC,MAAM,IAAI,iCAAiC,IAAI,WAAW;YACrE,CAAC,CAAC,QAAQ;YACV,CAAC,CAAC,YAAY;gBACZ,CAAC,CAAC,kBAAkB;gBACpB,CAAC,CAAC,MAAM,CAAC;QAEf,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,SAAS,EAAE,YAAY,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC,CAAC;IAC/F,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;AAClC,CAAC"}

package/dist/query/similar-incidents.d.ts

@@ -0,0 +1,76 @@
+/**
+ * The deterministic "have we seen this failure before" matcher — DEC-274.
+ *
+ * DEC-274 declined to build embedding/pgvector similarity search until a
+ * measurement showed what the *existing* graph machinery already answers.
+ * `rootCauseSearch` (queries.ts) is half of that existing machinery: it walks
+ * `INCIDENT_CORRELATED`/`FIXED_BY` edges from a node **already in the graph**.
+ * It cannot help with a brand-new failure that has no node yet — a stack
+ * trace or a set of touched files observed just now, before anything about
+ * this run has been written to the store.
+ *
+ * This module is the other half: given a new failure described only as
+ * "these files were touched" and/or "this is the error text", rank the
+ * `INCIDENT` nodes already in the graph by how much they resemble it, using
+ * two signals computed from data the graph already has — no embeddings, no
+ * new dependency, no model call:
+ *
+ * 1. **File-overlap Jaccard** — the new failure's touched-file set against
+ *    each `INCIDENT`'s `INCIDENT_CORRELATED` file set (§11.6's own
+ *    correlation edge, read in bulk instead of from one seed node).
+ * 2. **Token-set Jaccard on the error text** — the new failure's message
+ *    against each `INCIDENT` node's `name` (today, always a commit subject
+ *    line — real signal, but thin; see the git source's own module doc).
+ *
+ * Both are O(1) string/set operations, not a search index, so this scans
+ * every `INCIDENT` node per call. That is deliberate for now: the corpus
+ * measured in DEC-274 is a handful of incidents, and a linear scan over a
+ * few hundred nodes is not where this decision's cost lives. Revisit if the
+ * `INCIDENT` count ever reaches a size where that stops being true — it is
+ * not a reason to reach for embeddings, just for an index over this same
+ * data.
+ */
+import type { IRNode } from "@descryy/ir";
+import type { AdjacencyProvider, QueryResult } from "./provider.ts";
+/**
+ * Jaccard similarity of the two strings' token sets: `|intersection| / |union|`.
+ *
+ * Exported so the measurement script and the tests can assert on it directly
+ * rather than only through the combined ranking, per the "caller must see
+ * why" requirement below.
+ */
+export declare function tokenSetSimilarity(a: string, b: string): number;
+/** Jaccard similarity of two file-path sets. Exported for the same reason as above. */
+export declare function fileOverlapSimilarity(a: readonly string[], b: readonly string[]): number;
+export interface SimilarFailureQuery {
+    /** Repo-relative paths touched by the new failure, if known. */
+    readonly touchedFiles?: readonly string[];
+    /** The new failure's error/exception text, if known. */
+    readonly errorMessage?: string;
+}
+export type SimilarIncidentSignalKind = "file-overlap" | "message-similarity";
+export interface SimilarIncidentSignal {
+    readonly kind: SimilarIncidentSignalKind;
+    /** Jaccard similarity, 0..1. */
+    readonly score: number;
+}
+export interface SimilarIncidentMatch {
+    readonly incident: IRNode;
+    /** The FIX_PATTERN this incident resolved to, if the graph has one via FIXED_BY. */
+    readonly fix: IRNode | null;
+    /** Every signal that fired (score > 0) for this candidate — the "why". */
+    readonly signals: readonly SimilarIncidentSignal[];
+    /** Weighted combination of the fired signals. See `combine` below for the weights. */
+    readonly combinedScore: number;
+}
+export interface SimilarIncidentOptions {
+    /** Drop candidates whose combined score falls below this. Default: >0 (any signal fired). */
+    readonly minScore?: number;
+    readonly limit?: number;
+}
+/**
+ * Rank existing `INCIDENT` nodes by resemblance to a new, not-yet-recorded
+ * failure — graph identity only, explicitly not embeddings (DEC-274).
+ */
+export declare function similarIncidents(provider: AdjacencyProvider, query: SimilarFailureQuery, options?: SimilarIncidentOptions): QueryResult<SimilarIncidentMatch[]>;
+//# sourceMappingURL=similar-incidents.d.ts.map

package/dist/query/similar-incidents.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"similar-incidents.d.ts","sourceRoot":"","sources":["../../src/query/similar-incidents.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAmB,MAAM,aAAa,CAAC;AAE3D,OAAO,KAAK,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAiBpE;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAQ/D;AAED,uFAAuF;AACvF,wBAAgB,qBAAqB,CACnC,CAAC,EAAE,SAAS,MAAM,EAAE,EACpB,CAAC,EAAE,SAAS,MAAM,EAAE,GACnB,MAAM,CAQR;AAMD,MAAM,WAAW,mBAAmB;IAClC,gEAAgE;IAChE,QAAQ,CAAC,YAAY,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1C,wDAAwD;IACxD,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;CAChC;AAED,MAAM,MAAM,yBAAyB,GAAG,cAAc,GAAG,oBAAoB,CAAC;AAE9E,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,IAAI,EAAE,yBAAyB,CAAC;IACzC,gCAAgC;IAChC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,oFAAoF;IACpF,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,0EAA0E;IAC1E,QAAQ,CAAC,OAAO,EAAE,SAAS,qBAAqB,EAAE,CAAC;IACnD,sFAAsF;IACtF,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAChC;AAED,MAAM,WAAW,sBAAsB;IACrC,6FAA6F;IAC7F,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AA+BD;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,iBAAiB,EAC3B,KAAK,EAAE,mBAAmB,EAC1B,OAAO,GAAE,sBAA2B,GACnC,WAAW,CAAC,oBAAoB,EAAE,CAAC,CAiErC"}

package/dist/query/similar-incidents.js

@@ -0,0 +1,169 @@
+/**
+ * The deterministic "have we seen this failure before" matcher — DEC-274.
+ *
+ * DEC-274 declined to build embedding/pgvector similarity search until a
+ * measurement showed what the *existing* graph machinery already answers.
+ * `rootCauseSearch` (queries.ts) is half of that existing machinery: it walks
+ * `INCIDENT_CORRELATED`/`FIXED_BY` edges from a node **already in the graph**.
+ * It cannot help with a brand-new failure that has no node yet — a stack
+ * trace or a set of touched files observed just now, before anything about
+ * this run has been written to the store.
+ *
+ * This module is the other half: given a new failure described only as
+ * "these files were touched" and/or "this is the error text", rank the
+ * `INCIDENT` nodes already in the graph by how much they resemble it, using
+ * two signals computed from data the graph already has — no embeddings, no
+ * new dependency, no model call:
+ *
+ * 1. **File-overlap Jaccard** — the new failure's touched-file set against
+ *    each `INCIDENT`'s `INCIDENT_CORRELATED` file set (§11.6's own
+ *    correlation edge, read in bulk instead of from one seed node).
+ * 2. **Token-set Jaccard on the error text** — the new failure's message
+ *    against each `INCIDENT` node's `name` (today, always a commit subject
+ *    line — real signal, but thin; see the git source's own module doc).
+ *
+ * Both are O(1) string/set operations, not a search index, so this scans
+ * every `INCIDENT` node per call. That is deliberate for now: the corpus
+ * measured in DEC-274 is a handful of incidents, and a linear scan over a
+ * few hundred nodes is not where this decision's cost lives. Revisit if the
+ * `INCIDENT` count ever reaches a size where that stops being true — it is
+ * not a reason to reach for embeddings, just for an index over this same
+ * data.
+ */
+// ---------------------------------------------------------------------------
+// Token-set Jaccard — the deterministic stand-in for "fuzzy" text matching.
+// ---------------------------------------------------------------------------
+/**
+ * Lowercased alphanumeric tokens. No stemming, no stopword list — either
+ * would be a modelling decision this function has no business making, and
+ * DEC-274 asks for "a real string-similarity measure", not a bespoke NLP
+ * pipeline standing in for the embeddings this decision is deferring.
+ */
+function tokenize(text) {
+    const matches = text.toLowerCase().match(/[a-z0-9]+/g);
+    return new Set(matches ?? []);
+}
+/**
+ * Jaccard similarity of the two strings' token sets: `|intersection| / |union|`.
+ *
+ * Exported so the measurement script and the tests can assert on it directly
+ * rather than only through the combined ranking, per the "caller must see
+ * why" requirement below.
+ */
+export function tokenSetSimilarity(a, b) {
+    const ta = tokenize(a);
+    const tb = tokenize(b);
+    if (ta.size === 0 || tb.size === 0)
+        return 0;
+    let intersection = 0;
+    for (const token of ta)
+        if (tb.has(token))
+            intersection += 1;
+    const union = ta.size + tb.size - intersection;
+    return union === 0 ? 0 : intersection / union;
+}
+/** Jaccard similarity of two file-path sets. Exported for the same reason as above. */
+export function fileOverlapSimilarity(a, b) {
+    const sa = new Set(a);
+    const sb = new Set(b);
+    if (sa.size === 0 || sb.size === 0)
+        return 0;
+    let intersection = 0;
+    for (const path of sa)
+        if (sb.has(path))
+            intersection += 1;
+    const union = sa.size + sb.size - intersection;
+    return union === 0 ? 0 : intersection / union;
+}
+/**
+ * File overlap is weighted above message similarity: which files broke is a
+ * fact about the code, while a commit subject line is an incidental label a
+ * human happened to type. Both are real signal; neither is authoritative
+ * alone, which is exactly why DEC-274 asks for both rather than one.
+ */
+const FILE_OVERLAP_WEIGHT = 0.6;
+const MESSAGE_SIMILARITY_WEIGHT = 0.4;
+/**
+ * Weighted average over the signals the *query* attempted, not just the ones
+ * that scored above zero. Normalising over only the non-zero scores would let
+ * a candidate matching on one signal alone outrank a candidate matching on
+ * both signals whenever the second signal's score is imperfect — a single
+ * exact file match would beat a near-exact file match paired with a partial
+ * message match, which inverts the whole point of combining two signals:
+ * corroborating evidence should rank *above* single-signal evidence, never
+ * below it. Zero-scoring an attempted-but-absent signal keeps that true.
+ */
+function combine(attempted) {
+    if (attempted.length === 0)
+        return 0;
+    const weightOf = (kind) => kind === "file-overlap" ? FILE_OVERLAP_WEIGHT : MESSAGE_SIMILARITY_WEIGHT;
+    const totalWeight = attempted.reduce((sum, s) => sum + weightOf(s.kind), 0);
+    if (totalWeight === 0)
+        return 0;
+    const weighted = attempted.reduce((sum, s) => sum + weightOf(s.kind) * s.score, 0);
+    return weighted / totalWeight;
+}
+/**
+ * Rank existing `INCIDENT` nodes by resemblance to a new, not-yet-recorded
+ * failure — graph identity only, explicitly not embeddings (DEC-274).
+ */
+export function similarIncidents(provider, query, options = {}) {
+    const minScore = options.minScore ?? 0;
+    const { nodes: incidents, truncated } = provider.nodesOfType("INCIDENT");
+    const queryFiles = query.touchedFiles ?? [];
+    const queryMessage = query.errorMessage ?? "";
+    const matches = [];
+    let floor = 4;
+    for (const incident of incidents) {
+        // Every signal the query attempted, including zero-scoring ones — the
+        // denominator `combine` needs. `signals` (below) keeps only the ones that
+        // actually fired, since that is the "why" a caller should see.
+        const attempted = [];
+        if (queryFiles.length > 0) {
+            const correlated = provider.outgoing(incident.id, { types: ["INCIDENT_CORRELATED"] });
+            const incidentFiles = [];
+            for (const edge of correlated) {
+                const node = provider.node(edge.to);
+                if (node?.file != null)
+                    incidentFiles.push(node.file);
+                if (edge.resolution < floor)
+                    floor = edge.resolution;
+            }
+            attempted.push({ kind: "file-overlap", score: fileOverlapSimilarity(queryFiles, incidentFiles) });
+        }
+        if (queryMessage.length > 0) {
+            attempted.push({ kind: "message-similarity", score: tokenSetSimilarity(queryMessage, incident.name) });
+        }
+        const signals = attempted.filter((s) => s.score > 0);
+        if (signals.length === 0)
+            continue;
+        const combinedScore = combine(attempted);
+        if (combinedScore < minScore || (minScore === 0 && combinedScore === 0))
+            continue;
+        let fix = null;
+        const fixedBy = provider.outgoing(incident.id, { types: ["FIXED_BY"] });
+        if (fixedBy.length > 0) {
+            fix = provider.node(fixedBy[0].to) ?? null;
+            if (fixedBy[0].resolution < floor)
+                floor = fixedBy[0].resolution;
+        }
+        matches.push({ incident, fix, signals, combinedScore });
+    }
+    matches.sort((a, b) => b.combinedScore - a.combinedScore || a.incident.id.localeCompare(b.incident.id));
+    const ranked = options.limit === undefined ? matches : matches.slice(0, Math.max(0, options.limit));
+    const notes = [
+        "Graph-structural + fuzzy-text matching only (DEC-274). No embedding similarity was run — " +
+            "a past incident with neither an overlapping file nor a similar commit subject will not " +
+            "appear here even if it was, in substance, the same failure.",
+    ];
+    if (queryFiles.length === 0 && queryMessage.length === 0) {
+        notes.push("Neither touchedFiles nor errorMessage was given, so no candidate could score above 0.");
+    }
+    return {
+        data: ranked,
+        stamp: { ...provider.baseStamp(), resolutionFloor: matches.length === 0 ? 0 : floor },
+        truncated: truncated || (options.limit !== undefined && matches.length > options.limit),
+        notes,
+    };
+}
+//# sourceMappingURL=similar-incidents.js.map

package/dist/query/similar-incidents.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"similar-incidents.js","sourceRoot":"","sources":["../../src/query/similar-incidents.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAMH,8EAA8E;AAC9E,4EAA4E;AAC5E,8EAA8E;AAE9E;;;;;GAKG;AACH,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IACvD,OAAO,IAAI,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;AAChC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAS,EAAE,CAAS;IACrD,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC7C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,KAAK,IAAI,EAAE;QAAE,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,YAAY,IAAI,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,GAAG,YAAY,CAAC;IAC/C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;AAChD,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,qBAAqB,CACnC,CAAoB,EACpB,CAAoB;IAEpB,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC7C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,EAAE;QAAE,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,YAAY,IAAI,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,GAAG,YAAY,CAAC;IAC/C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;AAChD,CAAC;AAqCD;;;;;GAKG;AACH,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAChC,MAAM,yBAAyB,GAAG,GAAG,CAAC;AAEtC;;;;;;;;;GASG;AACH,SAAS,OAAO,CAAC,SAA2C;IAC1D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAG,CAAC,IAA+B,EAAU,EAAE,CAC3D,IAAI,KAAK,cAAc,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,yBAAyB,CAAC;IAC5E,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5E,IAAI,WAAW,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAChC,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACnF,OAAO,QAAQ,GAAG,WAAW,CAAC;AAChC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAA2B,EAC3B,KAA0B,EAC1B,UAAkC,EAAE;IAEpC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC;IACvC,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;IAEzE,MAAM,UAAU,GAAG,KAAK,CAAC,YAAY,IAAI,EAAE,CAAC;IAC5C,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,IAAI,EAAE,CAAC;IAE9C,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,IAAI,KAAK,GAAoB,CAAC,CAAC;IAE/B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,sEAAsE;QACtE,0EAA0E;QAC1E,+DAA+D;QAC/D,MAAM,SAAS,GAA4B,EAAE,CAAC;QAE9C,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,UAAU,GAAG,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;YACtF,MAAM,aAAa,GAAa,EAAE,CAAC;YACnC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;gBAC9B,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpC,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI;oBAAE,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtD,IAAI,IAAI,CAAC,UAAU,GAAG,KAAK;oBAAE,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;YACvD,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,qBAAqB,CAAC,UAAU,EAAE,aAAa,CAAC,EAAE,CAAC,CAAC;QACpG,CAAC;QAED,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,oBAAoB,EAAE,KAAK,EAAE,kBAAkB,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzG,CAAC;QAED,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACrD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACnC,MAAM,aAAa,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,aAAa,GAAG,QAAQ,IAAI,CAAC,QAAQ,KAAK,CAAC,IAAI,aAAa,KAAK,CAAC,CAAC;YAAE,SAAS;QAElF,IAAI,GAAG,GAAkB,IAAI,CAAC;QAC9B,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACxE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;YAC5C,IAAI,OAAO,CAAC,CAAC,CAAE,CAAC,UAAU,GAAG,KAAK;gBAAE,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,UAAU,CAAC;QACrE,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAExG,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IAEpG,MAAM,KAAK,GAAa;QACtB,2FAA2F;YACzF,yFAAyF;YACzF,6DAA6D;KAChE,CAAC;IACF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzD,KAAK,CAAC,IAAI,CAAC,uFAAuF,CAAC,CAAC;IACtG,CAAC;IAED,OAAO;QACL,IAAI,EAAE,MAAM;QACZ,KAAK,EAAE,EAAE,GAAG,QAAQ,CAAC,SAAS,EAAE,EAAE,eAAe,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE;QACrF,SAAS,EAAE,SAAS,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,IAAI,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC;QACvF,KAAK;KACN,CAAC;AACJ,CAAC"}

package/dist/query/sqlite.d.ts

@@ -0,0 +1,13 @@
+/**
+ * The store-backed `AdjacencyProvider`.
+ *
+ * One implementation of the interface, not the interface's reason for existing.
+ * Everything above it is written against `AdjacencyProvider`, so swapping this
+ * for a Postgres or worker-hosted provider changes this file and nothing else.
+ */
+import { type AdjacencyProvider } from "./provider.ts";
+import type { SqlDriver } from "../store/driver/driver.ts";
+export declare function createStoreProvider(driver: SqlDriver): AdjacencyProvider;
+/** How many distinct commits the stored graph spans. One is healthy; more is not. */
+export declare function commitSpread(driver: SqlDriver): number;
+//# sourceMappingURL=sqlite.d.ts.map

package/dist/query/sqlite.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite.d.ts","sourceRoot":"","sources":["../../src/query/sqlite.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAGL,KAAK,iBAAiB,EAEvB,MAAM,eAAe,CAAC;AAGvB,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAQ3D,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,SAAS,GAAG,iBAAiB,CA4BxE;AAED,qFAAqF;AACrF,wBAAgB,YAAY,CAAC,MAAM,EAAE,SAAS,GAAG,MAAM,CAMtD"}

package/dist/query/sqlite.js

@@ -0,0 +1,54 @@
+/**
+ * The store-backed `AdjacencyProvider`.
+ *
+ * One implementation of the interface, not the interface's reason for existing.
+ * Everything above it is written against `AdjacencyProvider`, so swapping this
+ * for a Postgres or worker-hosted provider changes this file and nothing else.
+ */
+import { DEFAULT_NODE_SET_LIMIT, } from "./provider.js";
+import { getNode, incoming, nodesOfType, outgoing, unresolvedRefs } from "../store/reader.js";
+import { IR_SCHEMA_VERSION } from "../store/schema.js";
+export function createStoreProvider(driver) {
+    return {
+        node: (id) => getNode(driver, id),
+        outgoing: (id, options) => withOptions(outgoing(driver, id, options), options),
+        incoming: (id, options) => withOptions(incoming(driver, id, options), options),
+        nodesOfType: (type, limit = DEFAULT_NODE_SET_LIMIT) => nodesOfType(driver, type, limit),
+        unresolvedRefs: (options) => unresolvedRefs(driver, options ?? {}),
+        baseStamp() {
+            // The most recent run's commit, plus how many distinct commits are in the
+            // graph at all. More than one is a real staleness signal — it means part
+            // of the graph describes code that is no longer what the other part
+            // describes — and it is surfaced as a note rather than averaged away.
+            const row = driver
+                .prepare(`SELECT
+             (SELECT commit_sha FROM adapter_runs ORDER BY written_at DESC, id ASC LIMIT 1) AS commit_sha,
+             (SELECT MAX(written_at) FROM adapter_runs) AS built_at,
+             (SELECT COUNT(DISTINCT commit_sha) FROM adapter_runs) AS commits`)
+                .get();
+            return {
+                commitSha: row?.commit_sha ?? null,
+                graphBuiltAt: row?.built_at ?? null,
+                irSchemaVersion: IR_SCHEMA_VERSION,
+            };
+        },
+    };
+}
+/** How many distinct commits the stored graph spans. One is healthy; more is not. */
+export function commitSpread(driver) {
+    return (driver
+        .prepare("SELECT COUNT(DISTINCT commit_sha) AS n FROM adapter_runs")
+        .get()?.n ?? 0);
+}
+/**
+ * The reader already filters by type and applies a limit in SQL. The confidence
+ * floor is applied here rather than pushed down, so that a provider swap cannot
+ * silently change which edges a traversal sees.
+ */
+function withOptions(edges, options = {}) {
+    if (options.minConfidence === undefined)
+        return [...edges];
+    const floor = options.minConfidence;
+    return edges.filter((e) => e.confidence >= floor);
+}
+//# sourceMappingURL=sqlite.js.map

package/dist/query/sqlite.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite.js","sourceRoot":"","sources":["../../src/query/sqlite.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EACL,sBAAsB,GAIvB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAC9F,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AASvD,MAAM,UAAU,mBAAmB,CAAC,MAAiB;IACnD,OAAO;QACL,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACjC,QAAQ,EAAE,CAAC,EAAE,EAAE,OAA0B,EAAE,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC;QACjG,QAAQ,EAAE,CAAC,EAAE,EAAE,OAA0B,EAAE,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC;QACjG,WAAW,EAAE,CAAC,IAAI,EAAE,KAAK,GAAG,sBAAsB,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC;QACvF,cAAc,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,OAAO,IAAI,EAAE,CAAC;QAElE,SAAS;YACP,0EAA0E;YAC1E,yEAAyE;YACzE,oEAAoE;YACpE,sEAAsE;YACtE,MAAM,GAAG,GAAG,MAAM;iBACf,OAAO,CACN;;;8EAGoE,CACrE;iBACA,GAAG,EAAE,CAAC;YACT,OAAO;gBACL,SAAS,EAAE,GAAG,EAAE,UAAU,IAAI,IAAI;gBAClC,YAAY,EAAE,GAAG,EAAE,QAAQ,IAAI,IAAI;gBACnC,eAAe,EAAE,iBAAiB;aACnC,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,YAAY,CAAC,MAAiB;IAC5C,OAAO,CACL,MAAM;SACH,OAAO,CAAgB,0DAA0D,CAAC;SAClF,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,CACjB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAClB,KAAmB,EACnB,UAA4B,EAAE;IAE9B,IAAI,OAAO,CAAC,aAAa,KAAK,SAAS;QAAE,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,OAAO,CAAC,aAAa,CAAC;IACpC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,KAAK,CAAC,CAAC;AACpD,CAAC"}

package/dist/query/traverse.d.ts

@@ -0,0 +1,110 @@
+/**
+ * Traversal primitives — blueprint 1.1's `bfs`, `weightedBfs` and `findPath`.
+ *
+ * All written against `AdjacencyProvider`, never against the store. §11.8 chose
+ * application-code traversal over recursive SQL so that decay scoring, budgets
+ * and per-edge weights behave identically on SQLite and Postgres; that only
+ * holds while the traversal cannot tell which it is talking to.
+ *
+ * ## The termination trap, guarded here rather than at Step 12
+ *
+ * §12.4 scores a hop as
+ *
+ *     new = parent × edgeWeight × coupling × incident × confidence
+ *
+ * and the coupling and incident factors *boost* — they can exceed 1.0. Three
+ * things break the moment the product can reach 1.0:
+ *
+ * - score stops decreasing monotonically, so best-first is no longer optimal;
+ * - a node can be reached later by a better path than the one that first found
+ *   it, so a plain visited-set silently keeps the worse score;
+ * - on a cycle where the product is ≥ 1, traversal **does not terminate**.
+ *
+ * Two fixes, both here: `weightedBfs` keeps a best-score map and re-pushes on
+ * improvement (relaxation), and any hop whose combined factor reaches 1.0 is
+ * rejected with an error naming the edge. Step 12 supplies the weights; this is
+ * the layer that refuses to run with weights that cannot terminate.
+ */
+import type { EdgeType, IREdge, ResolutionLevel } from "@descryy/ir";
+import type { AdjacencyProvider } from "./provider.ts";
+export type Direction = "out" | "in" | "both";
+/**
+ * `USES_API`/`SERVES_API` edges, the two halves DEC-115 joins at one
+ * `API_ENDPOINT` node — a caller reaches it from one side, a route serves it
+ * from the other, and either side can exist without the other (golden
+ * pattern 08's own note). Named once so `crossApiEndpoint` and its tests read
+ * the same list rather than two copies drifting.
+ */
+export declare const API_JOIN_EDGE_TYPES: readonly EdgeType[];
+export interface TraversalOptions {
+    readonly types?: readonly EdgeType[];
+    readonly direction?: Direction;
+    readonly maxDepth?: number;
+    /** Node budget — DEC-007's 200 / 1,000 / 5,000. Truncation is always reported. */
+    readonly budget?: number;
+    readonly minConfidence?: number;
+    /** Fan-out cap per hop. Guards against hub nodes with in-degree in the thousands. */
+    readonly perNodeLimit?: number;
+    /**
+     * Opt-in, default off. At an `API_ENDPOINT` node specifically, also follow
+     * `USES_API`/`SERVES_API` edges in the direction the walk is not already
+     * using — DEC-138's measured gap: a walk reaching the shared endpoint from
+     * one side (say, a frontend caller's `USES_API` edge, direction `out`)
+     * cannot see the route that serves it, because `SERVES_API` is stored
+     * route -> endpoint and a uniform `out` walk never looks incoming at that
+     * one node. Off by default because it is a real, deliberate exception to
+     * "the walk means one direction throughout" — every other node keeps that
+     * property; only the join node DEC-115 designed to be crossed does not.
+     */
+    readonly crossApiEndpoint?: boolean;
+}
+export interface Reached {
+    readonly id: string;
+    readonly depth: number;
+    /** 1.0 at the seed, decaying outward. Always 1.0 for unweighted traversal. */
+    readonly score: number;
+    /** The edge that produced the best-known path to this node. Null at a seed. */
+    readonly via: IREdge | null;
+}
+export interface TraversalOutcome {
+    readonly reached: readonly Reached[];
+    readonly truncated: boolean;
+    /** Lowest resolution on any edge the answer traversed. Caps the reliability class. */
+    readonly resolutionFloor: ResolutionLevel;
+}
+/**
+ * Breadth-first reachability. Unweighted: every reached node scores 1.0.
+ *
+ * Terminates on a cyclic graph by construction — a plain visited-set is correct
+ * here precisely because there is no score to improve on a second visit.
+ */
+export declare function bfs(provider: AdjacencyProvider, seeds: readonly string[], options?: TraversalOptions): TraversalOutcome;
+export interface WeightedOptions extends TraversalOptions {
+    /**
+     * The per-hop decay factor for an edge. Must be strictly less than 1.0 —
+     * see the note at the top of this file. Defaults to the edge's own confidence,
+     * which §12.4 makes one term of the real formula.
+     */
+    readonly weightFor?: (edge: IREdge) => number;
+    /** Stop expanding below this score. The main reason traversal ends before the budget. */
+    readonly minScore?: number;
+}
+/**
+ * Best-first traversal with score decay and relaxation.
+ *
+ * "Relaxation" is not an optimisation here, it is what makes the result correct:
+ * with boosting factors in play a node can be reached later by a better path,
+ * and a visited-set that refuses to revisit would keep the worse score
+ * permanently. The best-score map plus re-push on improvement is the fix, and
+ * it costs nothing when scores do decrease monotonically.
+ */
+export declare function weightedBfs(provider: AdjacencyProvider, seeds: readonly string[], options?: WeightedOptions): TraversalOutcome;
+/**
+ * Shortest path by hop count, as a list of edges. Empty when unreachable.
+ *
+ * Hop count rather than score: "how is this connected" and "how much impact
+ * propagates" are different questions, and answering the first with the second's
+ * machinery gives a path that is heavier but shorter-looking.
+ */
+export declare function findPath(provider: AdjacencyProvider, from: string, to: string, options?: TraversalOptions): readonly IREdge[];
+//# sourceMappingURL=traverse.d.ts.map

package/dist/query/traverse.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"traverse.d.ts","sourceRoot":"","sources":["../../src/query/traverse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAErE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAEvD,MAAM,MAAM,SAAS,GAAG,KAAK,GAAG,IAAI,GAAG,MAAM,CAAC;AAE9C;;;;;;GAMG;AACH,eAAO,MAAM,mBAAmB,EAAE,SAAS,QAAQ,EAA+B,CAAC;AAEnF,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;IACrC,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;IAC/B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,kFAAkF;IAClF,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,qFAAqF;IACrF,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,OAAO,CAAC;CACrC;AAED,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,8EAA8E;IAC9E,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,+EAA+E;IAC/E,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;CAC7B;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,OAAO,EAAE,SAAS,OAAO,EAAE,CAAC;IACrC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,sFAAsF;IACtF,QAAQ,CAAC,eAAe,EAAE,eAAe,CAAC;CAC3C;AA2CD;;;;;GAKG;AACH,wBAAgB,GAAG,CACjB,QAAQ,EAAE,iBAAiB,EAC3B,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,OAAO,GAAE,gBAAqB,GAC7B,gBAAgB,CAkClB;AAED,MAAM,WAAW,eAAgB,SAAQ,gBAAgB;IACvD;;;;OAIG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,CAAC;IAC9C,yFAAyF;IACzF,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CACzB,QAAQ,EAAE,iBAAiB,EAC3B,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,OAAO,GAAE,eAAoB,GAC5B,gBAAgB,CAsDlB;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CACtB,QAAQ,EAAE,iBAAiB,EAC3B,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,EACV,OAAO,GAAE,gBAAqB,GAC7B,SAAS,MAAM,EAAE,CA8BnB"}

package/dist/query/traverse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traverse.js","sourceRoot":"","sources":["../../src/query/traverse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAQH;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAwB,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;AAyCnF,SAAS,UAAU,CACjB,QAA2B,EAC3B,EAAU,EACV,OAAyB;IAEzB,MAAM,SAAS,GAAG;QAChB,GAAG,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC;QAChE,GAAG,CAAC,OAAO,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC;QACxF,GAAG,CAAC,OAAO,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC;KAC/E,CAAC;IACF,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,KAAK,CAAC;IAC7C,MAAM,MAAM,GAAqC,EAAE,CAAC;IACpD,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;IAC5F,CAAC;IACD,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9F,CAAC;IAED,4EAA4E;IAC5E,2EAA2E;IAC3E,wEAAwE;IACxE,qEAAqE;IACrE,IAAI,OAAO,CAAC,gBAAgB,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,KAAK,cAAc,EAAE,CAAC;QAC5G,MAAM,SAAS,GAAG,CAAC,OAAO,CAAC,KAAK,IAAI,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACxG,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,aAAa,GAAG,EAAE,GAAG,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;YACzD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC9F,MAAM,KAAK,GAAG,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;YAChH,MAAM,SAAS,GAAG,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;YACtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACnD,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBACpC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,GAAG,CACjB,QAA2B,EAC3B,KAAwB,EACxB,UAA4B,EAAE;IAE9B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAC1D,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAC9D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAmB,CAAC;IACxC,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,IAAI,KAAK,GAAoB,CAAC,CAAC;IAC/B,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC7B,MAAM,KAAK,GAAY,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QACnE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACtB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpB,CAAC;IAED,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAClD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC;QAC7B,IAAI,OAAO,CAAC,KAAK,IAAI,QAAQ;YAAE,SAAS;QAExC,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC;YACvE,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC7B,IAAI,IAAI,CAAC,IAAI,IAAI,MAAM,EAAE,CAAC;gBACxB,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM;YACR,CAAC;YACD,IAAI,IAAI,CAAC,UAAU,GAAG,KAAK;gBAAE,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;YACrD,MAAM,KAAK,GAAY,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;YACnF,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;QACD,IAAI,SAAS;YAAE,MAAM;IACvB,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,eAAe,EAAE,KAAK,EAAE,CAAC;AAC5E,CAAC;AAaD;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CACzB,QAA2B,EAC3B,KAAwB,EACxB,UAA2B,EAAE;IAE7B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAC1D,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAC9D,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC;IACvC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC,IAAY,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAE3E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAmB,CAAC;IACxC,MAAM,IAAI,GAAG,IAAI,SAAS,EAAE,CAAC;IAC7B,IAAI,KAAK,GAAoB,CAAC,CAAC;IAC/B,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAY,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QACnE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;IAED,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAG,CAAC;QAC5B,yEAAyE;QACzE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK;YAAE,SAAS;QACjE,IAAI,OAAO,CAAC,KAAK,IAAI,QAAQ;YAAE,SAAS;QAExC,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC;YACvE,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;gBACjC,MAAM,IAAI,UAAU,CAClB,4DAA4D,MAAM,OAAO;oBACvE,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,iDAAiD;oBACtF,wFAAwF,CAC3F,CAAC;YACJ,CAAC;YAED,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,GAAG,MAAM,CAAC;YACrC,IAAI,KAAK,IAAI,QAAQ;gBAAE,SAAS;YAEhC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,KAAK,IAAI,KAAK;gBAAE,SAAS;YAChE,IAAI,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,IAAI,MAAM,EAAE,CAAC;gBAClD,SAAS,GAAG,IAAI,CAAC;gBACjB,SAAS;YACX,CAAC;YAED,IAAI,IAAI,CAAC,UAAU,GAAG,KAAK;gBAAE,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;YACrD,MAAM,KAAK,GAAY,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;YAChF,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACtB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CACrC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CACxD,CAAC;IACF,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,KAAK,EAAE,CAAC;AACxD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CACtB,QAA2B,EAC3B,IAAY,EACZ,EAAU,EACV,UAA4B,EAAE;IAE9B,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAC9D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA4C,CAAC;IACrE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IACrC,MAAM,KAAK,GAAoC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAExE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAClD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC;QAC7B,IAAI,OAAO,CAAC,KAAK,IAAI,QAAQ;YAAE,SAAS;QAExC,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC;YACvE,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACf,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC;YACjD,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;gBAChB,MAAM,IAAI,GAAa,EAAE,CAAC;gBAC1B,IAAI,MAAM,GAAG,EAAE,CAAC;gBAChB,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;oBACvB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAClC,IAAI,IAAI,KAAK,SAAS;wBAAE,OAAO,EAAE,CAAC;oBAClC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACrB,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;gBACvB,CAAC;gBACD,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;YACxB,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,SAAS;IACJ,MAAM,GAAc,EAAE,CAAC;IAEhC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,IAAI,CAAC,KAAc;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClB,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,MAAM,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,KAAK,CAAC,MAAM,CAAE,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAE,CAAC,KAAK;gBAAE,MAAM;YACvD,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAE,EAAE,KAAK,CAAC,MAAM,CAAE,CAAC,CAAC;YAChE,KAAK,GAAG,MAAM,CAAC;QACjB,CAAC;IACH,CAAC;IAED,GAAG;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YAC3C,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YAChB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,SAAS,CAAC;gBACR,MAAM,IAAI,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC3B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;gBACvB,IAAI,OAAO,GAAG,KAAK,CAAC;gBACpB,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,IAAI,CAAE,CAAC,KAAK,GAAG,KAAK,CAAC,OAAO,CAAE,CAAC,KAAK;oBAAE,OAAO,GAAG,IAAI,CAAC;gBACtF,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAE,CAAC,KAAK,GAAG,KAAK,CAAC,OAAO,CAAE,CAAC,KAAK;oBAAE,OAAO,GAAG,KAAK,CAAC;gBACzF,IAAI,OAAO,KAAK,KAAK;oBAAE,MAAM;gBAC7B,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAE,EAAE,KAAK,CAAC,OAAO,CAAE,CAAC,CAAC;gBAClE,KAAK,GAAG,OAAO,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF"}