@seanhogg/builderforce-memory 2026.10.27 → 2026.10.29

package/dist/knowledge/build.js

@@ -0,0 +1,263 @@
+/**
+ * knowledge/build.ts — `buildGraph`: join perception (extracted, computed) with memory
+ * (stored facts and relations) into one bounded {@link KnowledgeGraph} (PRD 38 §4.1).
+ *
+ *   1. extracted nodes/edges (analyzer output merges its badges into the same refs);
+ *   2. facts become nodes, joined to sources by `fileAnchors.path`; a model fact whose
+ *      anchor hash differs from the source's current hash is `stale`;
+ *   3. stored relations become edges; near-duplicate pairs become `near-duplicate` edges
+ *      (an exact `duplicate` between the same pair wins); live changes badge nodes and
+ *      `runFiles` become `co-changed` edges;
+ *   4. partitions, areas, verdicts; PageRank importance; findings; then truncation.
+ *
+ * Deterministic: equal input ⇒ byte-identical JSON. Every list is sorted, every sort ends
+ * on ref, objects are built with a fixed key order.
+ */
+import { areaOfPath } from '../working/codemapAreas.js';
+import { sha256Hex } from '../retrieval/knowledge-index/sha256.js';
+import { computeFindings } from './findings.js';
+import { pageRank } from './importance.js';
+import { loadPartitions, partitionOf, verdictOf } from './partitions.js';
+import { entityName } from './resolve.js';
+import { basenameOf, canonicalJson, compareStr, factRef, pathOfRef, round6, sortBy, srcRef, } from './refs.js';
+import { truncateGraph } from './truncate.js';
+export const DEFAULT_MAX_NODES = 400;
+export const MAX_NODES_CAP = 2000;
+const LABEL_CHARS = 120;
+const edgeId = (from, to, kind) => `${from}\u0000${to}\u0000${kind}`;
+export const compareEdges = (a, b) => compareStr(a.from, b.from) || compareStr(a.to, b.to) || compareStr(a.kind, b.kind);
+/** sha-256 over the canonical input: equal inputs (in any order) ⇒ equal digests. */
+export function graphDigest(input) {
+    return sha256Hex(canonicalJson({
+        rootId: input.rootId,
+        packs: input.packs.map((p) => p.id).sort(compareStr),
+        extracted: sortBy(input.extracted, (e) => e.sourceRef, (e) => e.sourceHash).map(canonicalExtracted),
+        facts: sortBy(input.facts, (f) => f.key).map((f) => ({ ...f, fileAnchors: sortBy(f.fileAnchors, (a) => a.path) })),
+        relations: sortBy(input.relations, (r) => r.from, (r) => r.to, (r) => r.kind),
+        live: input.live && {
+            changes: sortBy(input.live.changes, (c) => c.path),
+            runFiles: nonEmpty(input.live.runFiles) && [...input.live.runFiles].sort(compareStr),
+        },
+        nearDuplicates: nonEmpty(input.nearDuplicates) && sortBy(input.nearDuplicates, (p) => p.a, (p) => p.b),
+    }));
+}
+/** An absent list and an empty list mean the same input, so they hash the same. */
+const nonEmpty = (xs) => (xs && xs.length > 0) || undefined;
+function canonicalExtracted(e) {
+    return {
+        sourceRef: e.sourceRef, sourceHash: e.sourceHash,
+        nodes: sortBy(e.nodes, (n) => n.ref),
+        edges: [...e.edges].sort(compareEdges),
+        keys: sortBy(e.keys, (k) => k.ref, (k) => k.key),
+    };
+}
+function mergeBadges(a, b) {
+    if (!a)
+        return b && { ...b };
+    if (!b)
+        return { ...a };
+    const out = { ...a };
+    // Commutative: on a conflict the larger value (as a string) wins, whatever the order.
+    for (const [k, v] of Object.entries(b))
+        out[k] = k in out && String(out[k]) >= String(v) ? out[k] : v;
+    return out;
+}
+function oneLine(text) {
+    const flat = text.replace(/\s+/g, ' ').trim();
+    return flat.length > LABEL_CHARS ? `${flat.slice(0, LABEL_CHARS - 1)}…` : flat;
+}
+class GraphBuilder {
+    nodes = new Map();
+    edges = new Map();
+    node(n) {
+        const prior = this.nodes.get(n.ref);
+        if (!prior) {
+            this.nodes.set(n.ref, { ...n, ...(n.badges ? { badges: { ...n.badges } } : {}) });
+            return;
+        }
+        const badges = mergeBadges(prior.badges, n.badges);
+        if (badges)
+            prior.badges = badges;
+    }
+    edge(e) {
+        const id = edgeId(e.from, e.to, e.kind);
+        const prior = this.edges.get(id);
+        if (!prior) {
+            this.edges.set(id, { ...e });
+            return;
+        }
+        prior.weight = Math.max(prior.weight, e.weight);
+        if (e.cycle)
+            prior.cycle = true;
+        if (e.confidence !== undefined)
+            prior.confidence = Math.max(prior.confidence ?? 0, e.confidence);
+    }
+    has(from, to, kind) {
+        return this.edges.has(edgeId(from, to, kind));
+    }
+}
+function factNode(f, rootId, g) {
+    const ref = factRef(f.key);
+    const kind = f.key.startsWith('ent:') ? 'entity' : f.key.startsWith('claim:') ? 'claim' : 'fact';
+    const anchors = sortBy(f.fileAnchors, (a) => a.path);
+    const anchoredPack = anchors.map((a) => g.nodes.get(srcRef(rootId, a.path))?.pack).find(Boolean);
+    const pack = kind === 'entity' ? f.key.split(':')[1] || 'memory' : anchoredPack ?? 'memory';
+    const stale = f.origin === 'model' && anchors.some((a) => {
+        const current = g.nodes.get(srcRef(rootId, a.path))?.sourceHash;
+        return !!a.contentHash && !!current && current !== a.contentHash;
+    });
+    const first = anchors[0];
+    return {
+        ref, kind, label: oneLine(kind === 'entity' ? f.content || entityName(ref) : f.content), pack,
+        importance: 0, origin: f.origin,
+        ...(first?.contentHash ? { sourceHash: first.contentHash } : {}),
+        ...(stale ? { stale: true } : {}),
+        ...(first?.line !== undefined ? { badges: { line: first.line } } : {}),
+    };
+}
+export function buildGraph(input, opts = {}) {
+    const { rootId } = input;
+    const g = new GraphBuilder();
+    const sources = new Set();
+    for (const ex of sortBy(input.extracted, (e) => e.sourceRef, (e) => e.sourceHash)) {
+        if (ex.sourceRef.startsWith('src:'))
+            sources.add(ex.sourceRef);
+        for (const n of sortBy(ex.nodes, (x) => x.ref))
+            g.node({ ...n, origin: 'extracted' });
+        for (const e of [...ex.edges].sort(compareEdges))
+            g.edge({ ...e, origin: 'extracted' });
+    }
+    const facts = sortBy(input.facts, (f) => f.key);
+    for (const f of facts)
+        g.node(factNode(f, rootId, g));
+    for (const f of facts) {
+        for (const a of sortBy(f.fileAnchors, (x) => x.path)) {
+            const to = srcRef(rootId, a.path);
+            if (g.nodes.has(to))
+                g.edge({ from: factRef(f.key), to, kind: 'about', weight: 1, origin: f.origin });
+        }
+    }
+    for (const r of sortBy(input.relations, (x) => x.from, (x) => x.to, (x) => x.kind)) {
+        g.edge({
+            from: r.from, to: r.to, kind: r.kind, weight: r.weight, origin: r.origin,
+            ...(r.confidence !== undefined ? { confidence: r.confidence } : {}),
+        });
+    }
+    for (const p of sortBy(input.nearDuplicates ?? [], (x) => x.a, (x) => x.b)) {
+        if (p.a === p.b || p.a.startsWith('ent:') || p.b.startsWith('ent:'))
+            continue;
+        const [a, b] = (compareStr(p.a, p.b) < 0 ? [p.a, p.b] : [p.b, p.a]);
+        if (!g.nodes.has(a) || !g.nodes.has(b) || g.has(a, b, 'duplicate') || g.has(b, a, 'duplicate'))
+            continue;
+        g.edge({ from: a, to: b, kind: 'near-duplicate', weight: round6(p.similarity), origin: 'extracted' });
+    }
+    const changed = applyLive(input, g);
+    closeEndpoints(g);
+    const registries = new Map(input.packs.map((p) => [p.id, loadPartitions(p)]));
+    placeNodes(rootId, g, registries);
+    const rank = pageRank([...g.nodes.keys()], [...g.edges.values()]);
+    for (const n of g.nodes.values())
+        n.importance = rank.get(n.ref) ?? 0;
+    const allNodes = [...g.nodes.values()].map(finalNode).sort((a, b) => compareStr(a.ref, b.ref));
+    const allEdges = [...g.edges.values()].map(finalEdge).sort(compareEdges);
+    const packs = input.packs.map((p) => p.id).sort(compareStr);
+    const full = {
+        scope: { rootId, packs, digest: graphDigest(input) },
+        nodes: allNodes, edges: allEdges, findings: [],
+        stats: { sources: sources.size, nodes: allNodes.length, edges: allEdges.length, stale: 0, truncated: false },
+    };
+    full.findings = computeFindings(full, input.packs, registries, input.nearDuplicates ?? []);
+    full.stats.stale = allNodes.filter((n) => n.stale).length;
+    const maxNodes = Math.min(MAX_NODES_CAP, Math.max(1, Math.floor(opts.maxNodes ?? DEFAULT_MAX_NODES)));
+    const cut = truncateGraph(full, { maxNodes, focus: opts.focus ?? [], changed });
+    return {
+        ...full,
+        nodes: cut.nodes,
+        edges: cut.edges,
+        stats: { ...full.stats, nodes: cut.nodes.length, edges: cut.edges.length, truncated: cut.truncated },
+    };
+}
+function applyLive(input, g) {
+    const changed = [];
+    if (!input.live)
+        return changed;
+    for (const c of sortBy(input.live.changes, (x) => x.path)) {
+        const ref = srcRef(input.rootId, c.path);
+        if (!g.nodes.has(ref))
+            continue;
+        g.node({ ...g.nodes.get(ref), badges: { added: c.added, removed: c.removed, status: c.status } });
+        changed.push(ref);
+    }
+    const run = [...new Set(input.live.runFiles ?? [])].sort(compareStr)
+        .map((p) => srcRef(input.rootId, p)).filter((r) => g.nodes.has(r));
+    for (let i = 0; i < run.length; i++) {
+        for (let j = i + 1; j < run.length; j++) {
+            g.edge({ from: run[i], to: run[j], kind: 'co-changed', weight: 1, origin: 'agent' });
+        }
+    }
+    return changed;
+}
+/** A missing `src:` endpoint becomes a `missing` placeholder (a broken link); a missing fact drops the edge. */
+function closeEndpoints(g) {
+    for (const [id, e] of [...g.edges.entries()].sort((a, b) => compareStr(a[0], b[0]))) {
+        const ends = [e.from, e.to].filter((end) => !g.nodes.has(end));
+        if (ends.some((end) => pathOfRef(end) === undefined)) {
+            g.edges.delete(id);
+            continue;
+        }
+        for (const end of ends) {
+            const path = pathOfRef(end);
+            const other = g.nodes.get(end === e.from ? e.to : e.from);
+            g.node({
+                ref: end, kind: 'missing', label: basenameOf(path) || path, pack: other?.pack ?? 'memory',
+                importance: 0, origin: 'extracted', badges: { missing: 1 },
+            });
+        }
+    }
+}
+function placeNodes(rootId, g, registries) {
+    for (const n of g.nodes.values()) {
+        const path = pathOfRef(n.ref);
+        if (path === undefined)
+            continue;
+        const reg = registries.get(n.pack);
+        const partition = reg ? partitionOf(path, reg) : undefined;
+        if (partition !== undefined)
+            n.partition = partition;
+        const area = areaOfPath(path);
+        if (area)
+            n.area = srcRef(rootId, area);
+    }
+    for (const e of g.edges.values()) {
+        const from = g.nodes.get(e.from), to = g.nodes.get(e.to);
+        const reg = from && registries.get(from.pack);
+        if (!from || !to || !reg || from.pack !== to.pack)
+            continue;
+        const verdict = verdictOf(from.partition, to.partition, reg);
+        if (verdict)
+            e.verdict = verdict;
+    }
+}
+function finalNode(n) {
+    const badges = n.badges && Object.keys(n.badges).length
+        ? Object.fromEntries(Object.keys(n.badges).sort(compareStr).map((k) => [k, n.badges[k]]))
+        : undefined;
+    return {
+        ref: n.ref, kind: n.kind, label: n.label, pack: n.pack,
+        ...(n.partition !== undefined ? { partition: n.partition } : {}),
+        ...(n.area !== undefined ? { area: n.area } : {}),
+        importance: n.importance, origin: n.origin,
+        ...(n.sourceHash !== undefined ? { sourceHash: n.sourceHash } : {}),
+        ...(n.stale ? { stale: true } : {}),
+        ...(badges ? { badges } : {}),
+    };
+}
+export function finalEdge(e) {
+    return {
+        from: e.from, to: e.to, kind: e.kind, weight: round6(e.weight), origin: e.origin,
+        ...(e.confidence !== undefined ? { confidence: round6(e.confidence) } : {}),
+        ...(e.verdict ? { verdict: e.verdict } : {}),
+        ...(e.cycle ? { cycle: true } : {}),
+    };
+}
+//# sourceMappingURL=build.js.map

package/dist/knowledge/build.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build.js","sourceRoot":"","sources":["../../src/knowledge/build.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AACxD,OAAO,EAAE,SAAS,EAAE,MAAM,wCAAwC,CAAC;AAKnE,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACzE,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EACH,UAAU,EAAE,aAAa,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GACpF,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAE9C,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AACrC,MAAM,CAAC,MAAM,aAAa,GAAG,IAAI,CAAC;AAClC,MAAM,WAAW,GAAG,GAAG,CAAC;AAExB,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,EAAU,EAAE,IAAY,EAAE,EAAE,CAAC,GAAG,IAAI,SAAS,EAAE,SAAS,IAAI,EAAE,CAAC;AAC7F,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAQ,EAAE,CAAQ,EAAU,EAAE,CACvD,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;AAEvF,qFAAqF;AACrF,MAAM,UAAU,WAAW,CAAC,KAAsB;IAC9C,OAAO,SAAS,CAAC,aAAa,CAAC;QAC3B,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;QACpD,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,kBAAkB,CAAC;QACnG,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClH,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QAC7E,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI;YAChB,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAClD,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,QAAS,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;SACxF;QACD,cAAc,EAAE,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,cAAe,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;KAC1G,CAAC,CAAC,CAAC;AACR,CAAC;AAED,mFAAmF;AACnF,MAAM,QAAQ,GAAG,CAAC,EAAkC,EAAuB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,SAAS,CAAC;AAEjH,SAAS,kBAAkB,CAAC,CAAY;IACpC,OAAO;QACH,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU;QAChD,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;QACpC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;QACtC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;KACnD,CAAC;AACN,CAAC;AAED,SAAS,WAAW,CAAC,CAAmC,EAAE,CAAmC;IACzF,IAAI,CAAC,CAAC;QAAE,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;IAC7B,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC;IACxB,MAAM,GAAG,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;IACrB,sFAAsF;IACtF,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvG,OAAO,GAAG,CAAC;AACf,CAAC;AAED,SAAS,OAAO,CAAC,IAAY;IACzB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9C,OAAO,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AACnF,CAAC;AAED,MAAM,YAAY;IACL,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClC,KAAK,GAAG,IAAI,GAAG,EAAiB,CAAC;IAE1C,IAAI,CAAC,CAAQ;QACT,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,EAAE,CAAC;YAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAAC,OAAO;QAAC,CAAC;QAC1G,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,MAAM;YAAE,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;IACtC,CAAC;IAED,IAAI,CAAC,CAAQ;QACT,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,EAAE,CAAC;YAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAAC,OAAO;QAAC,CAAC;QACrD,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,CAAC,CAAC,KAAK;YAAE,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC;QAChC,IAAI,CAAC,CAAC,UAAU,KAAK,SAAS;YAAE,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,IAAI,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC;IACrG,CAAC;IAED,GAAG,CAAC,IAAa,EAAE,EAAW,EAAE,IAAY;QACxC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;IAClD,CAAC;CACJ;AAED,SAAS,QAAQ,CAAC,CAAa,EAAE,MAAc,EAAE,CAAe;IAC5D,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;IACjG,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACrD,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjG,MAAM,IAAI,GAAG,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,YAAY,IAAI,QAAQ,CAAC;IAC5F,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,KAAK,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QACrD,MAAM,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC;QAChE,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,OAAO,IAAI,OAAO,KAAK,CAAC,CAAC,WAAW,CAAC;IACrE,CAAC,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO;QACH,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI;QAC7F,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM;QAC/B,GAAG,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACjC,GAAG,CAAC,KAAK,EAAE,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACzE,CAAC;AACN,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,KAAsB,EAAE,OAA0B,EAAE;IAC3E,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IACzB,MAAM,CAAC,GAAG,IAAI,YAAY,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC;QAChF,IAAI,EAAE,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;QAC/D,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;YAAE,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QACtF,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;YAAE,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;IAC5F,CAAC;IAED,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACnD,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QAC1G,CAAC;IACL,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACjF,CAAC,CAAC,IAAI,CAAC;YACH,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM;YACxE,GAAG,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACtE,CAAC,CAAC;IACP,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,cAAc,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACzE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;YAAE,SAAS;QAC9E,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAuB,CAAC;QAC1F,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC;YAAE,SAAS;QACzG,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;IAC1G,CAAC;IAED,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACpC,cAAc,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,cAAc,CAAC,CAAC,CAAC,CAAU,CAAC,CAAC,CAAC;IACvF,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IAElC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAClE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE;QAAE,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAEtE,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/F,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACzE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC5D,MAAM,IAAI,GAAmB;QACzB,KAAK,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE;QACpD,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE;QAC9C,KAAK,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE;KAC/G,CAAC;IACF,IAAI,CAAC,QAAQ,GAAG,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC;IAC3F,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;IAE1D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;IACtG,MAAM,GAAG,GAAG,aAAa,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IAChF,OAAO;QACH,GAAG,IAAI;QACP,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,KAAK,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE;KACvG,CAAC;AACN,CAAC;AAED,SAAS,SAAS,CAAC,KAAsB,EAAE,CAAe;IACtD,MAAM,OAAO,GAAc,EAAE,CAAC;IAC9B,IAAI,CAAC,KAAK,CAAC,IAAI;QAAE,OAAO,OAAO,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACxD,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAChC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACnG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;SAC/D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAE,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;QAC3F,CAAC;IACL,CAAC;IACD,OAAO,OAAO,CAAC;AACnB,CAAC;AAED,gHAAgH;AAChH,SAAS,cAAc,CAAC,CAAe;IACnC,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAClF,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/D,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EAAE,CAAC;YAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACvF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC1D,CAAC,CAAC,IAAI,CAAC;gBACH,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,IAAI,QAAQ;gBACzF,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE;aAC7D,CAAC,CAAC;QACP,CAAC;IACL,CAAC;AACL,CAAC;AAED,SAAS,UAAU,CAAC,MAAc,EAAE,CAAe,EAAE,UAA0C;IAC3F,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC3D,IAAI,SAAS,KAAK,SAAS;YAAE,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC;QACrD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,IAAI;YAAE,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzD,MAAM,GAAG,GAAG,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI;YAAE,SAAS;QAC5D,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAC7D,IAAI,OAAO;YAAE,CAAC,CAAC,OAAO,GAAG,OAAO,CAAC;IACrC,CAAC;AACL,CAAC;AAED,SAAS,SAAS,CAAC,CAAQ;IACvB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM;QACnD,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;QAC3F,CAAC,CAAC,SAAS,CAAC;IAChB,OAAO;QACH,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI;QACtD,GAAG,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChE,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM;QAC1C,GAAG,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAChC,CAAC;AACN,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,CAAQ;IAC9B,OAAO;QACH,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM;QAChF,GAAG,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3E,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACtC,CAAC;AACN,CAAC"}

package/dist/knowledge/cards.d.ts

@@ -0,0 +1,17 @@
+/**
+ * knowledge/cards.ts — `toCards`: one knowledge-index card per graph node
+ * (design: Builderforce.ai/docs/design/deterministic-knowledge-index.md, "Cards").
+ *
+ * | kind            | text                                                              | keys                          |
+ * |-----------------|-------------------------------------------------------------------|-------------------------------|
+ * | file            | path · area · partition · symbols · doc line · top-5 neighbours   | path, basename, symbols, area |
+ * | section         | file · breadcrumb · first 400 chars · outgoing link targets       | file path, slug, front matter |
+ * | entity (ent:)   | name · type · top-5 mentioning sources                            | normalized name, aliases      |
+ * | claim           | subject predicate object · quote · source section                 | subject/object entity keys    |
+ * | area            | path · partition · top-10 members                                 | path                          |
+ *
+ * `hash` is the index's own text hash (`hashDocText`), so an unchanged card is never re-embedded.
+ */
+import type { IndexDoc, KnowledgeGraph } from './model.js';
+export declare function toCards(g: KnowledgeGraph): IndexDoc[];
+//# sourceMappingURL=cards.d.ts.map

package/dist/knowledge/cards.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cards.d.ts","sourceRoot":"","sources":["../../src/knowledge/cards.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAgB,cAAc,EAAW,MAAM,YAAY,CAAC;AAQlF,wBAAgB,OAAO,CAAC,CAAC,EAAE,cAAc,GAAG,QAAQ,EAAE,CAkBrD"}

package/dist/knowledge/cards.js

@@ -0,0 +1,118 @@
+/**
+ * knowledge/cards.ts — `toCards`: one knowledge-index card per graph node
+ * (design: Builderforce.ai/docs/design/deterministic-knowledge-index.md, "Cards").
+ *
+ * | kind            | text                                                              | keys                          |
+ * |-----------------|-------------------------------------------------------------------|-------------------------------|
+ * | file            | path · area · partition · symbols · doc line · top-5 neighbours   | path, basename, symbols, area |
+ * | section         | file · breadcrumb · first 400 chars · outgoing link targets       | file path, slug, front matter |
+ * | entity (ent:)   | name · type · top-5 mentioning sources                            | normalized name, aliases      |
+ * | claim           | subject predicate object · quote · source section                 | subject/object entity keys    |
+ * | area            | path · partition · top-10 members                                 | path                          |
+ *
+ * `hash` is the index's own text hash (`hashDocText`), so an unchanged card is never re-embedded.
+ */
+import { hashDocText } from '../retrieval/knowledge-index/digest.js';
+import { byImportance } from './importance.js';
+import { entityName } from './resolve.js';
+import { basenameOf, compareStr, fileRefOf, normalizeKey, pathOfRef, slugOf } from './refs.js';
+const SEP = ' · ';
+const EXCERPT_CHARS = 400;
+export function toCards(g) {
+    const byRef = new Map(g.nodes.map((n) => [n.ref, n]));
+    const outEdges = new Map();
+    const inEdges = new Map();
+    const push = (m, k, e) => {
+        const l = m.get(k) ?? [];
+        l.push(e);
+        m.set(k, l);
+    };
+    for (const e of g.edges) {
+        push(outEdges, e.from, e);
+        push(inEdges, e.to, e);
+    }
+    const label = (r) => byRef.get(r)?.label ?? pathOfRef(r) ?? r;
+    const ctx = { byRef, outEdges, inEdges, label, members: membersByArea(g.nodes) };
+    return g.nodes.map((n) => {
+        const { text, keys } = cardOf(n, ctx);
+        const uniqueKeys = [...new Set(keys.filter(Boolean))].sort(compareStr);
+        return { id: n.ref, text, ...(uniqueKeys.length ? { keys: uniqueKeys } : {}), hash: hashDocText(text) };
+    }).sort((a, b) => compareStr(a.id, b.id));
+}
+function membersByArea(nodes) {
+    const out = new Map();
+    for (const n of nodes) {
+        if (!n.area || n.kind !== 'file')
+            continue;
+        const l = out.get(n.area) ?? [];
+        l.push(n);
+        out.set(n.area, l);
+    }
+    return out;
+}
+/** Neighbour refs (either direction), heaviest first, then by ref. */
+function topNeighbours(ref, ctx, n) {
+    const scored = new Map();
+    for (const e of ctx.outEdges.get(ref) ?? [])
+        scored.set(e.to, Math.max(scored.get(e.to) ?? 0, e.weight));
+    for (const e of ctx.inEdges.get(ref) ?? [])
+        scored.set(e.from, Math.max(scored.get(e.from) ?? 0, e.weight));
+    return [...scored].sort((a, b) => b[1] - a[1] || compareStr(a[0], b[0])).slice(0, n).map(([r]) => r);
+}
+const badge = (n, k) => {
+    const v = n?.badges?.[k];
+    return v === undefined || v === '' ? undefined : String(v);
+};
+const frontMatter = (n) => Object.keys(n?.badges ?? {}).filter((k) => k.startsWith('fm.')).sort(compareStr)
+    .flatMap((k) => String(n.badges[k]).split(',').map((v) => normalizeKey(v)));
+function cardOf(n, ctx) {
+    const path = pathOfRef(n.ref) ?? '';
+    const join = (parts) => parts.filter((p) => p !== undefined && p !== '').join(SEP);
+    switch (n.kind) {
+        case 'file': {
+            const contained = (ctx.outEdges.get(n.ref) ?? []).filter((e) => e.kind === 'contains')
+                .map((e) => ctx.byRef.get(e.to)).filter((c) => c?.kind === 'symbol');
+            const symbols = contained.map((s) => s.label).sort(compareStr);
+            return {
+                text: join([path, n.area && pathOfRef(n.area), n.partition, symbols.join(', '), badge(n, 'doc'),
+                    topNeighbours(n.ref, ctx, 5).map(ctx.label).join(', ')]),
+                keys: [path, basenameOf(path), ...symbols, n.area ? pathOfRef(n.area) ?? '' : ''],
+            };
+        }
+        case 'section': {
+            const file = ctx.byRef.get(fileRefOf(n.ref));
+            const links = (ctx.outEdges.get(n.ref) ?? []).filter((e) => e.kind === 'links')
+                .map((e) => pathOfRef(e.to) ?? e.to).sort(compareStr);
+            return {
+                text: join([path, badge(n, 'breadcrumb') ?? n.label, badge(n, 'excerpt')?.slice(0, EXCERPT_CHARS), links.join(', ')]),
+                keys: [path, slugOf(n.label), ...frontMatter(file)],
+            };
+        }
+        case 'entity': {
+            const sources = (ctx.inEdges.get(n.ref) ?? []).filter((e) => e.kind === 'mentions' || e.kind === 'about')
+                .map((e) => ctx.byRef.get(e.from)).filter((s) => !!s);
+            const about = (ctx.outEdges.get(n.ref) ?? []).filter((e) => e.kind === 'about')
+                .map((e) => ctx.byRef.get(e.to)).filter((s) => !!s);
+            const top = [...new Map([...sources, ...about].map((s) => [s.ref, s])).values()].sort(byImportance).slice(0, 5);
+            const name = entityName(n.ref);
+            return {
+                text: join([n.label, badge(n, 'type'), top.map((s) => s.label).join(', ')]),
+                keys: [normalizeKey(name), normalizeKey(n.label.replace(/\s*\([^)]*\)\s*$/, '')),
+                    ...String(badge(n, 'aliases') ?? '').split(',').map(normalizeKey)],
+            };
+        }
+        case 'claim': {
+            const out = ctx.outEdges.get(n.ref) ?? [];
+            const sections = out.filter((e) => e.kind === 'about').map((e) => ctx.label(e.to)).sort(compareStr);
+            const entities = out.filter((e) => e.kind === 'mentions' && e.to.startsWith('ent:')).map((e) => normalizeKey(entityName(e.to)));
+            return { text: join([n.label, sections.join(', ')]), keys: entities };
+        }
+        case 'area': {
+            const members = [...(ctx.members.get(n.ref) ?? [])].sort(byImportance).slice(0, 10).map((m) => m.label);
+            return { text: join([path, n.partition, members.join(', ')]), keys: [path] };
+        }
+        default:
+            return { text: join([n.label, n.kind, path]), keys: [normalizeKey(n.label), path] };
+    }
+}
+//# sourceMappingURL=cards.js.map

package/dist/knowledge/cards.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cards.js","sourceRoot":"","sources":["../../src/knowledge/cards.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,wCAAwC,CAAC;AAErE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAE/F,MAAM,GAAG,GAAG,KAAK,CAAC;AAClB,MAAM,aAAa,GAAG,GAAG,CAAC;AAE1B,MAAM,UAAU,OAAO,CAAC,CAAiB;IACrC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAU,CAAC,CAAC,CAAC;IAC/D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,MAAM,IAAI,GAAG,CAAC,CAAwB,EAAE,CAAU,EAAE,CAAQ,EAAE,EAAE;QAC5D,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACzB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACV,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChB,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAAC,CAAC;IAC/E,MAAM,KAAK,GAAG,CAAC,CAAU,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACvE,MAAM,GAAG,GAAY,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;IAE1F,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACrB,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACtC,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;IAC5G,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9C,CAAC;AAUD,SAAS,aAAa,CAAC,KAAuB;IAC1C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS;QAC3C,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAChC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACV,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED,sEAAsE;AACtE,SAAS,aAAa,CAAC,GAAY,EAAE,GAAY,EAAE,CAAS;IACxD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACzG,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAC5G,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AACzG,CAAC;AAED,MAAM,KAAK,GAAG,CAAC,CAAoB,EAAE,CAAS,EAAsB,EAAE;IAClE,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AAC/D,CAAC,CAAC;AAEF,MAAM,WAAW,GAAG,CAAC,CAAoB,EAAY,EAAE,CACnD,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;KAC3E,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAE,CAAC,MAAO,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAEtF,SAAS,MAAM,CAAC,CAAQ,EAAE,GAAY;IAClC,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IACpC,MAAM,IAAI,GAAG,CAAC,KAAgC,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9G,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACb,KAAK,MAAM,CAAC,CAAC,CAAC;YACV,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC;iBACjF,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAc,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,QAAQ,CAAC,CAAC;YACrF,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC/D,OAAO;gBACH,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;oBAC3F,aAAa,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC5D,IAAI,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACpF,CAAC;QACN,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACb,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7C,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC;iBAC1E,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC1D,OAAO;gBACH,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBACrH,IAAI,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;aACtD,CAAC;QACN,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACZ,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC;iBACpG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAc,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtE,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC;iBAC1E,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAc,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpE,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAChH,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC/B,OAAO;gBACH,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC3E,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC;oBAC5E,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;aACzE,CAAC;QACN,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACX,MAAM,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACpG,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAChI,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;QAC1E,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACV,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACxG,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACjF,CAAC;QACD;YACI,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;IAC5F,CAAC;AACL,CAAC"}

package/dist/knowledge/findings.d.ts

@@ -0,0 +1,24 @@
+/**
+ * knowledge/findings.ts — what a person can act on (PRD 38 §3.5).
+ *
+ * Generic findings, for every pack: cycle, clone group, near-duplicate, partition
+ * violation, unpartitioned share, stale knowledge — plus `possible-same` entities. Packs
+ * add their own through {@link FindingRule}s. Every finding has a stable id (a hash of its
+ * kind and refs) and a `requestKey` under `knowledgeGraph.fix.*`: the fixed, prefilled
+ * Fix-with-agent request, never a model call.
+ */
+import type { Finding, KEdge, KnowledgeGraph, KnowledgePack, NodeRef, PartitionRegistry } from './model.js';
+import type { SimilarPair } from '../retrieval/knowledge-index/types.js';
+/** Node badge naming the clone group (e.g. a jscpd issue id) its `duplicate` edges belong to. */
+export declare const CLONE_GROUP_BADGE = "cloneGroup";
+/** Refs listed on one grouped finding, at most (the count rides in params). */
+export declare const MAX_FINDING_NODES = 50;
+export declare function findingId(kind: string, refs: readonly string[]): string;
+/** `clone-group` → `knowledgeGraph.fix.cloneGroup`. */
+export declare function requestKeyFor(kind: string): string;
+/** Connected components over edges, each sorted; components sorted by first ref. */
+export declare function components(edges: readonly KEdge[]): NodeRef[][];
+export declare function genericFindings(g: KnowledgeGraph, registries: ReadonlyMap<string, PartitionRegistry>): Finding[];
+/** Generic + possible-same + every pack's rules; deduped by id; severity, then id. */
+export declare function computeFindings(g: KnowledgeGraph, packs: readonly KnowledgePack[], registries: ReadonlyMap<string, PartitionRegistry>, nearDuplicates: readonly SimilarPair[]): Finding[];
+//# sourceMappingURL=findings.d.ts.map

package/dist/knowledge/findings.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findings.d.ts","sourceRoot":"","sources":["../../src/knowledge/findings.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,KAAK,EAAS,cAAc,EAAE,aAAa,EAAE,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AACnH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uCAAuC,CAAC;AAIzE,iGAAiG;AACjG,eAAO,MAAM,iBAAiB,eAAe,CAAC;AAC9C,+EAA+E;AAC/E,eAAO,MAAM,iBAAiB,KAAK,CAAC;AAIpC,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAEvE;AAED,uDAAuD;AACvD,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAElD;AAUD,oFAAoF;AACpF,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,KAAK,EAAE,GAAG,OAAO,EAAE,EAAE,CAqB/D;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,cAAc,EAAE,UAAU,EAAE,WAAW,CAAC,MAAM,EAAE,iBAAiB,CAAC,GAAG,OAAO,EAAE,CAqDhH;AAkBD,sFAAsF;AACtF,wBAAgB,eAAe,CAC3B,CAAC,EAAE,cAAc,EACjB,KAAK,EAAE,SAAS,aAAa,EAAE,EAC/B,UAAU,EAAE,WAAW,CAAC,MAAM,EAAE,iBAAiB,CAAC,EAClD,cAAc,EAAE,SAAS,WAAW,EAAE,GACvC,OAAO,EAAE,CAiBX"}

package/dist/knowledge/findings.js

@@ -0,0 +1,152 @@
+/**
+ * knowledge/findings.ts — what a person can act on (PRD 38 §3.5).
+ *
+ * Generic findings, for every pack: cycle, clone group, near-duplicate, partition
+ * violation, unpartitioned share, stale knowledge — plus `possible-same` entities. Packs
+ * add their own through {@link FindingRule}s. Every finding has a stable id (a hash of its
+ * kind and refs) and a `requestKey` under `knowledgeGraph.fix.*`: the fixed, prefilled
+ * Fix-with-agent request, never a model call.
+ */
+import { hashText } from '../ingest/hash.js';
+import { possibleSameFindings } from './resolve.js';
+import { compareStr, round6 } from './refs.js';
+/** Node badge naming the clone group (e.g. a jscpd issue id) its `duplicate` edges belong to. */
+export const CLONE_GROUP_BADGE = 'cloneGroup';
+/** Refs listed on one grouped finding, at most (the count rides in params). */
+export const MAX_FINDING_NODES = 50;
+const SEVERITY_RANK = { error: 0, warn: 1, info: 2 };
+export function findingId(kind, refs) {
+    return `${kind}:${hashText([...refs].sort(compareStr).join('\u0000'))}`;
+}
+/** `clone-group` → `knowledgeGraph.fix.cloneGroup`. */
+export function requestKeyFor(kind) {
+    return `knowledgeGraph.fix.${kind.replace(/-([a-z])/g, (_, c) => c.toUpperCase())}`;
+}
+function finding(kind, pack, nodes, severity, params) {
+    const sorted = [...new Set(nodes)].sort(compareStr);
+    return {
+        id: findingId(kind, sorted), kind, pack, nodes: sorted.slice(0, MAX_FINDING_NODES), severity, params,
+        requestKey: requestKeyFor(kind),
+    };
+}
+/** Connected components over edges, each sorted; components sorted by first ref. */
+export function components(edges) {
+    const parent = new Map();
+    const find = (x) => {
+        let r = x;
+        while (parent.get(r) !== r)
+            r = parent.get(r);
+        parent.set(x, r);
+        return r;
+    };
+    for (const e of edges) {
+        for (const r of [e.from, e.to])
+            if (!parent.has(r))
+                parent.set(r, r);
+        const a = find(e.from), b = find(e.to);
+        if (a !== b)
+            parent.set(compareStr(a, b) < 0 ? b : a, compareStr(a, b) < 0 ? a : b);
+    }
+    const groups = new Map();
+    for (const r of [...parent.keys()].sort(compareStr)) {
+        const root = find(r);
+        let g = groups.get(root);
+        if (!g)
+            groups.set(root, (g = []));
+        g.push(r);
+    }
+    return [...groups.values()].sort((a, b) => compareStr(a[0], b[0]));
+}
+export function genericFindings(g, registries) {
+    const byRef = new Map(g.nodes.map((n) => [n.ref, n]));
+    const packOf = (ref) => byRef.get(ref)?.pack ?? 'memory';
+    const out = [];
+    for (const refs of components(g.edges.filter((e) => e.cycle))) {
+        out.push(finding('cycle', packOf(refs[0]), refs, 'warn', { nodes: refs.length }));
+    }
+    // Clone groups: duplicate edges grouped by the clone-group badge, else by component.
+    const dup = g.edges.filter((e) => e.kind === 'duplicate');
+    const byBadge = new Map();
+    const unbadged = [];
+    for (const e of dup) {
+        const badge = byRef.get(e.from)?.badges?.[CLONE_GROUP_BADGE] ?? byRef.get(e.to)?.badges?.[CLONE_GROUP_BADGE];
+        if (badge === undefined) {
+            unbadged.push(e);
+            continue;
+        }
+        const list = byBadge.get(String(badge)) ?? [];
+        list.push(e);
+        byBadge.set(String(badge), list);
+    }
+    const groups = [
+        ...[...byBadge].map(([group, es]) => ({ group, refs: es.flatMap((e) => [e.from, e.to]) })),
+        ...components(unbadged).map((refs) => ({ group: '', refs })),
+    ];
+    for (const { group, refs } of groups) {
+        const unique = [...new Set(refs)];
+        out.push(finding('clone-group', packOf(unique.sort(compareStr)[0]), unique, 'warn', { group, members: unique.length }));
+    }
+    for (const e of g.edges) {
+        if (e.kind === 'near-duplicate') {
+            out.push(finding('near-duplicate', packOf(e.from), [e.from, e.to], 'info', { similarity: round6(e.weight) }));
+        }
+        if (e.verdict === 'upward' || e.verdict === 'skips') {
+            const from = byRef.get(e.from), to = byRef.get(e.to);
+            out.push(finding('partition-violation', packOf(e.from), [e.from, e.to], e.verdict === 'upward' ? 'error' : 'warn', {
+                verdict: e.verdict, from: from?.partition ?? '', to: to?.partition ?? '', kind: e.kind,
+            }));
+        }
+    }
+    for (const [pack, reg] of [...registries].sort((a, b) => compareStr(a[0], b[0]))) {
+        if (!reg.allow)
+            continue;
+        const files = g.nodes.filter((n) => n.pack === pack && n.kind === 'file');
+        const loose = files.filter((n) => n.partition === undefined).map((n) => n.ref);
+        if (loose.length === 0)
+            continue;
+        out.push(finding('unpartitioned', pack, loose, 'info', {
+            count: loose.length, total: files.length, share: Math.round((loose.length / files.length) * 100),
+        }));
+    }
+    out.push(...staleFindings(g, byRef));
+    return out;
+}
+/** One finding per source whose stored knowledge went stale (unanchored stale nodes: one each). */
+function staleFindings(g, byRef) {
+    const about = new Map();
+    for (const e of g.edges)
+        if (e.kind === 'about' && !about.has(e.from))
+            about.set(e.from, e.to);
+    const bySource = new Map();
+    for (const n of g.nodes) {
+        if (!n.stale)
+            continue;
+        const target = about.get(n.ref) ?? n.ref;
+        const list = bySource.get(target) ?? [];
+        list.push(n.ref);
+        bySource.set(target, list);
+    }
+    return [...bySource].map(([source, refs]) => finding('stale', byRef.get(source)?.pack ?? 'memory', [source, ...refs], 'warn', { count: refs.length }));
+}
+/** Generic + possible-same + every pack's rules; deduped by id; severity, then id. */
+export function computeFindings(g, packs, registries, nearDuplicates) {
+    const all = [...genericFindings(g, registries), ...possibleSameFindings(nearDuplicates)];
+    for (const pack of [...packs].sort((a, b) => compareStr(a.id, b.id))) {
+        for (const rule of pack.findings ?? []) {
+            for (const f of rule.find(g)) {
+                all.push({
+                    ...f,
+                    id: f.id || findingId(f.kind, f.nodes),
+                    nodes: [...new Set(f.nodes)].sort(compareStr),
+                    requestKey: f.requestKey ?? requestKeyFor(f.kind),
+                });
+            }
+        }
+    }
+    const byId = new Map();
+    for (const f of all)
+        if (!byId.has(f.id))
+            byId.set(f.id, f);
+    return [...byId.values()].sort((a, b) => SEVERITY_RANK[a.severity] - SEVERITY_RANK[b.severity] || compareStr(a.id, b.id));
+}
+//# sourceMappingURL=findings.js.map