hippo-memory 1.43.3 → 1.45.0

package/dist/src/graph-extract.js

@@ -1,314 +0,0 @@
-/**
- * E3.1 deterministic entity extraction (first slice)
- * (docs/plans/2026-06-01-e3-deterministic-extraction.md).
- *
- * Populates the E3 graph from the already-structured consolidated E2-object tables -
- * NO NLP, no precision gate for entities + supersedes. The graph is a pure derived
- * function of the current E2 state, so `extractGraph` is an idempotent REBUILD: clear
- * the tenant's graph, then re-derive entities + `supersedes` relations from decisions /
- * policies / customer_notes / project_briefs (the four E2 types whose kind maps to the
- * `entity_type` enum). All writes go through the src/graph.ts consolidated-source guard
- * (insertEntity / insertRelation / clearGraph); this module issues no raw SQL.
- *
- * Pass 3 (E3 cross-object, docs/plans/2026-06-02-e3-cross-object-references.md) adds the
- * first CROSS-OBJECT relations: a deterministic NAME-MATCH heuristic that emits a
- * `references` edge when one consolidated object's text contains another entity's name.
- * It is conservative (word-boundary, length-bounded, ambiguity-guarded, per-source
- * capped); its precision is measured + reported, not assumed.
- *
- * Deferred (follow-ups): NLP prose-extraction (semantic depends-on / blocked-by / owns);
- * skill/incident/process entities (not in the entity_type enum - needs a migration); the
- * `hippo sleep` enqueue-hook.
- */
-import { clearGraph, insertEntity, insertRelation, runGraphRebuildTransaction, MAX_ENTITY_NAME_LEN } from './graph.js';
-import { loadDecisions } from './decisions.js';
-import { loadPolicies } from './policies.js';
-import { loadCustomerNotes } from './customer-notes.js';
-import { loadProjectBriefs } from './project-briefs.js';
-import { assertTenantId } from './store.js';
-/** Per-type load cap (the loaders default to 100). A type whose active or superseded
- *  set exceeds this is truncated; `ExtractResult.truncated` records it so the
- *  incompleteness is observable rather than silent. */
-export const MAX_EXTRACT_PER_TYPE = 10000;
-// --- Pass 3 (cross-object references) tunables ------------------------------------
-/** A target entity name must be in [MIN, MAX] chars to be matched: MIN skips short /
- *  generic words; MAX skips prose (a decision's prose name is never a target, only a
- *  source). */
-export const MIN_REF_NAME_LEN = 4;
-export const MAX_REF_NAME_LEN = 80;
-/** Per-source cap so one object cannot explode the graph with references edges. */
-export const MAX_REFERENCES_PER_OBJECT = 25;
-/** Regex-size bound: at most this many distinct target names enter the combined
- *  alternation, keeping the scan regex sane on a huge store. */
-export const MAX_TARGET_NAMES = 5000;
-/** Stable map key: entity types share an id space across tables, so key by both. */
-function keyOf(entityType, e2Id) {
-    return `${entityType}:${e2Id}`;
-}
-/** The four E2-derived extraction entity types map 1:1 to source_object_type; the other
- *  two EntityType members ('person', 'system') have no E2 table and stay unmapped. */
-const ENTITY_TYPE_TO_SOURCE_OBJECT = {
-    decision: 'decision',
-    policy: 'policy',
-    customer: 'customer',
-    project: 'project',
-    person: undefined,
-    system: undefined,
-};
-/** The E2 source-object ref for an extraction row (always set: every extracted row is an
- *  E2 object). Throws on an unmappable entityType (a graph invariant violation). */
-function sourceObjectOf(entityType, e2Id) {
-    const type = ENTITY_TYPE_TO_SOURCE_OBJECT[entityType];
-    if (!type)
-        throw new Error(`graph-extract: entityType '${entityType}' has no source_object_type mapping`);
-    return { type, id: e2Id };
-}
-/** Escape a string for safe use as a literal inside a RegExp alternation. */
-function escapeRegex(s) {
-    return s.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
-}
-/** Unordered entity-id pair key, so a relation between a,b is found in either direction. */
-function pairKey(a, b) {
-    return a < b ? `${a}:${b}` : `${b}:${a}`;
-}
-/**
- * Load a type's ACTIVE + SUPERSEDED rows (excluding `closed` = retired), normalised.
- * Calls the loader once per status so MAX_EXTRACT_PER_TYPE is a per-status budget
- * (closed rows never consume it). Sets `hitCap` when either status load is full.
- */
-function loadType(hippoRoot, tenantId, entityType, 
-// eslint-disable-next-line @typescript-eslint/no-explicit-any
-loadFn, 
-// eslint-disable-next-line @typescript-eslint/no-explicit-any
-nameOf, 
-// eslint-disable-next-line @typescript-eslint/no-explicit-any
-textOf) {
-    const rows = [];
-    let hitCap = false;
-    for (const status of ['active', 'superseded']) {
-        const loaded = loadFn(hippoRoot, tenantId, { status, limit: MAX_EXTRACT_PER_TYPE });
-        if (loaded.length === MAX_EXTRACT_PER_TYPE)
-            hitCap = true;
-        for (const r of loaded) {
-            // SAFETY: loadFn is always one of loadDecisions/loadPolicies/loadCustomerNotes/
-            // loadProjectBriefs (wired at each extractGraph call site); every one of their row
-            // types declares id: number, memoryId: string | null, supersededBy: number | null.
-            // `any` here is the deliberate type-erasure boundary (see eslint-disable above)
-            // that lets one loop handle all four E2 row shapes.
-            rows.push({
-                entityType,
-                e2Id: r.id,
-                name: nameOf(r),
-                searchText: textOf(r),
-                memoryId: (r.memoryId ?? null),
-                supersededBy: (r.supersededBy ?? null),
-            });
-        }
-    }
-    return { rows, hitCap };
-}
-/**
- * Idempotent rebuild of the tenant's deterministic graph from its consolidated E2
- * objects. Returns the entity/relation counts (+ which types were truncated at the
- * per-type cap). Safe to re-run: output is a pure function of the current E2 state.
- */
-export function extractGraph(hippoRoot, tenantId) {
-    assertTenantId('extractGraph', tenantId);
-    const sources = [
-        { entityType: 'decision', loadFn: loadDecisions, nameOf: (r) => r.decisionText, textOf: (r) => [r.decisionText, r.context].filter(Boolean).join(' ') },
-        { entityType: 'policy', loadFn: loadPolicies, nameOf: (r) => r.policyName, textOf: (r) => [r.policyName, r.policyText].filter(Boolean).join(' ') },
-        { entityType: 'customer', loadFn: loadCustomerNotes, nameOf: (r) => r.customer, textOf: (r) => [r.customer, r.note].filter(Boolean).join(' ') },
-        { entityType: 'project', loadFn: loadProjectBriefs, nameOf: (r) => r.repo, textOf: (r) => [r.repo, r.summary].filter(Boolean).join(' ') },
-    ];
-    // READ PHASE: load every source's rows on their own connections BEFORE the
-    // write transaction. Holding the rebuild's BEGIN IMMEDIATE write lock while
-    // opening a second connection for these reads dead-locks ('database is
-    // locked'); preloading keeps the transaction single-connection.
-    const loaded = sources.map((src) => {
-        const { rows, hitCap } = loadType(hippoRoot, tenantId, src.entityType, src.loadFn, src.nameOf, src.textOf);
-        return { entityType: src.entityType, rows, hitCap };
-    });
-    // WRITE PHASE (codex P2): clear + every insert run in ONE transaction, so two
-    // concurrent rebuilds serialize on the SQLite write lock (no duplicate rows)
-    // and a throw mid-rebuild rolls back the clear (no bricked graph). No second
-    // connection is opened inside.
-    return runGraphRebuildTransaction(hippoRoot, tenantId, (txDb) => rebuildGraphRows(txDb, hippoRoot, tenantId, loaded));
-}
-/**
- * The deterministic rebuild WRITES, run inside `runGraphRebuildTransaction`'s
- * transaction (`txDb` is its connection). Clears the tenant's graph then
- * re-derives entities + `supersedes` + `references` from the preloaded rows. All
- * DB access here is on `txDb` (or in-memory) — no other connection is opened.
- */
-function rebuildGraphRows(txDb, hippoRoot, tenantId, loaded) {
-    // Rebuild from scratch: the graph is derived, so clear then re-derive.
-    clearGraph(hippoRoot, tenantId, txDb);
-    const byType = {};
-    const truncated = [];
-    const allRows = [];
-    const entityIdByKey = new Map();
-    // The mirror memory per extracted key, null once forgotten/pruned (so a supersedes
-    // edge anchors to the successor's object when the mirror is gone but still passes the
-    // memory through when it lives).
-    const memoryIdByKey = new Map();
-    // Created entities ONLY (drives Pass 3 sources + targets), in stable insertion order.
-    const created = [];
-    // Pass 1: entities. Every ACTIVE/SUPERSEDED E2 row becomes an entity ANCHORED to its
-    // authoritative E2 object (source_object_type/id) - it survives a forgotten mirror
-    // (memory_id NULL). The mirror memory is passed through only when it still exists
-    // (it remains a recall pointer until forgotten/pruned).
-    for (const { entityType, rows, hitCap } of loaded) {
-        if (hitCap)
-            truncated.push(entityType);
-        byType[entityType] = 0;
-        for (const row of rows) {
-            allRows.push(row);
-            // Normalise the label so a long/odd-but-valid E2 name can never throw in
-            // insertEntity and (because clearGraph already ran) brick the rebuild
-            // unrebuildably. E2 name fields (decisionText / policyName) are UNCAPPED at
-            // source, and insertEntity REJECTS (not truncates) both an over-cap name AND an
-            // empty one. So: TRIM FIRST (codex 2026-06-01: >512 leading-whitespace chars
-            // would otherwise slice to a whitespace-only string -> trimmed to '' ->
-            // 'name is required' throw), THEN cap to MAX_ENTITY_NAME_LEN; if the normalised
-            // label is empty (the E2 save APIs forbid this, but be defensive) skip the row
-            // rather than throw. This closes the entire name-brick class.
-            const name = (row.name ?? '').trim().slice(0, MAX_ENTITY_NAME_LEN);
-            if (name.length === 0)
-                continue;
-            const sourceObject = sourceObjectOf(row.entityType, row.e2Id);
-            const entity = insertEntity(hippoRoot, tenantId, {
-                entityType: row.entityType,
-                name,
-                memoryId: row.memoryId,
-                sourceObject,
-            }, txDb);
-            const k = keyOf(row.entityType, row.e2Id);
-            entityIdByKey.set(k, entity.id);
-            memoryIdByKey.set(k, row.memoryId);
-            created.push({ entityId: entity.id, entityType: row.entityType, memoryId: row.memoryId, sourceObject, name, searchText: row.searchText ?? '', superseded: row.supersededBy !== null });
-            byType[entityType] += 1;
-        }
-    }
-    // Pass 2: `supersedes` relations. For X superseded by Y (Y is the successor), emit
-    // "Y supersedes X" - but only when BOTH X and Y were EXTRACTED (e.g. Y may be closed
-    // and absent). The emit guard is ENTITY presence (entityIdByKey), not memory presence:
-    // a forgotten successor mirror must still emit the edge. The relation is anchored to Y's
-    // authoritative E2 object; Y's mirror memory is passed only when it still lives.
-    let relations = 0;
-    // Entity-id pairs already related by supersedes (unordered). Pass 3 skips a references
-    // edge for such a pair: a version-extends-its-predecessor's-name containment (e.g.
-    // "Adopt X (managed)" contains "Adopt X") is a name artifact, not a cross-reference,
-    // and supersedes already captures their relationship.
-    const supersededPairs = new Set();
-    for (const row of allRows) {
-        if (row.supersededBy === null)
-            continue;
-        const xKey = keyOf(row.entityType, row.e2Id);
-        const yKey = keyOf(row.entityType, row.supersededBy);
-        const fromId = entityIdByKey.get(yKey); // successor Y
-        const toId = entityIdByKey.get(xKey); // superseded X
-        if (fromId === undefined || toId === undefined)
-            continue;
-        const yMemoryId = memoryIdByKey.get(yKey) ?? null; // successor's mirror, null if gone
-        insertRelation(hippoRoot, tenantId, {
-            fromEntityId: fromId,
-            toEntityId: toId,
-            relType: 'supersedes',
-            memoryId: yMemoryId,
-            sourceObject: sourceObjectOf(row.entityType, row.supersededBy), // successor Y's object
-        }, txDb);
-        supersededPairs.add(pairKey(fromId, toId));
-        relations += 1;
-    }
-    // Pass 3: cross-object `references` edges via conservative name matching. A source's
-    // text containing a target entity's name -> "source references target". Sources +
-    // targets are CREATED entities only, each anchored to its E2 source object (so the
-    // edge survives a forgotten source mirror).
-    const references = extractReferences(hippoRoot, tenantId, created, supersededPairs, truncated, txDb);
-    relations += references;
-    const entities = created.length;
-    return { entities, relations, references, byType, truncated };
-}
-/**
- * Pass 3. Build a target-name index from the created entities (names within the length
- * bounds, ambiguous names dropped), scan each created entity's text once with one
- * combined word-boundary regex, and emit `references` edges (self-skipped, deduped,
- * per-source capped). Each edge is anchored to the source entity's E2 object (memoryId
- * passed through only when the mirror lives). Returns the number of references edges written.
- */
-function extractReferences(hippoRoot, tenantId, created, supersededPairs, truncated, txDb) {
-    // Build the target index: normalised name -> single entity id. A name is a target only
-    // if its length is in bounds; a name shared by >1 entity is AMBIGUOUS and dropped.
-    const nameToId = new Map();
-    const ambiguous = new Set();
-    for (const e of created) {
-        // References are among ACTIVE entities only: a superseded (outdated) row is not a
-        // current cross-reference target (codex).
-        if (e.superseded)
-            continue;
-        // Decisions are SOURCE-only: their name is decision prose, referenced by supersedes,
-        // not by name-mention. Excluding them as targets also prevents a decision's own name
-        // (== its searchText) from whole-string self-matching and shadowing embedded targets.
-        if (e.entityType === 'decision')
-            continue;
-        const norm = e.name.trim().toLowerCase();
-        if (norm.length < MIN_REF_NAME_LEN || norm.length > MAX_REF_NAME_LEN)
-            continue;
-        if (ambiguous.has(norm))
-            continue;
-        if (nameToId.has(norm)) {
-            // Second distinct entity with this name (and not its own id repeated) -> ambiguous.
-            if (nameToId.get(norm) !== e.entityId) {
-                nameToId.delete(norm);
-                ambiguous.add(norm);
-            }
-            continue;
-        }
-        nameToId.set(norm, e.entityId);
-    }
-    if (nameToId.size === 0)
-        return 0;
-    // Record the truncation (observability, mirroring MAX_EXTRACT_PER_TYPE) so a >cap
-    // store's under-matched references are not silent.
-    if (nameToId.size > MAX_TARGET_NAMES)
-        truncated.push('references-targets');
-    // LONGEST name first, then alphabetical: JS regex alternation is leftmost-first, so
-    // ordering longer names before their prefixes makes the match longest-at-position
-    // (`postgres pro` wins over `postgres`; codex). Deterministic, so truncation is stable.
-    const targetNames = [...nameToId.keys()]
-        .sort((a, b) => b.length - a.length || (a < b ? -1 : a > b ? 1 : 0))
-        .slice(0, MAX_TARGET_NAMES);
-    const pattern = `\\b(?:${targetNames.map(escapeRegex).join('|')})\\b`;
-    const re = new RegExp(pattern, 'gi');
-    let references = 0;
-    for (const src of created) {
-        if (src.superseded)
-            continue; // superseded sources hold only stale references (codex)
-        if (!src.searchText)
-            continue;
-        const targets = new Set();
-        for (const m of src.searchText.matchAll(re)) {
-            const targetId = nameToId.get(m[0].toLowerCase());
-            if (targetId === undefined || targetId === src.entityId)
-                continue; // miss / self
-            if (supersededPairs.has(pairKey(src.entityId, targetId)))
-                continue; // already version-related
-            targets.add(targetId);
-            if (targets.size >= MAX_REFERENCES_PER_OBJECT)
-                break; // per-source cap
-        }
-        for (const targetId of targets) {
-            insertRelation(hippoRoot, tenantId, {
-                fromEntityId: src.entityId,
-                toEntityId: targetId,
-                relType: 'references',
-                // Anchored to the source object; its mirror memory is passed only when it lives.
-                memoryId: src.memoryId,
-                sourceObject: src.sourceObject,
-            }, txDb);
-            references += 1;
-        }
-    }
-    return references;
-}
-//# sourceMappingURL=graph-extract.js.map

package/dist/src/graph-extract.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-extract.js","sourceRoot":"","sources":["../../src/graph-extract.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,cAAc,EAAE,0BAA0B,EAAE,mBAAmB,EAAgF,MAAM,YAAY,CAAC;AACrM,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAC7C,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE5C;;uDAEuD;AACvD,MAAM,CAAC,MAAM,oBAAoB,GAAG,KAAK,CAAC;AAE1C,qFAAqF;AACrF;;eAEe;AACf,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAClC,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC;AACnC,mFAAmF;AACnF,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,CAAC;AAC5C;gEACgE;AAChE,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,CAAC;AA4BrC,oFAAoF;AACpF,SAAS,KAAK,CAAC,UAAsB,EAAE,IAAY;IACjD,OAAO,GAAG,UAAU,IAAI,IAAI,EAAE,CAAC;AACjC,CAAC;AAED;sFACsF;AACtF,MAAM,4BAA4B,GAAG;IACnC,QAAQ,EAAE,UAAU;IACpB,MAAM,EAAE,QAAQ;IAChB,QAAQ,EAAE,UAAU;IACpB,OAAO,EAAE,SAAS;IAClB,MAAM,EAAE,SAAS;IACjB,MAAM,EAAE,SAAS;CACyC,CAAC;AAE7D;oFACoF;AACpF,SAAS,cAAc,CAAC,UAAsB,EAAE,IAAY;IAC1D,MAAM,IAAI,GAAG,4BAA4B,CAAC,UAAU,CAAC,CAAC;IACtD,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,UAAU,qCAAqC,CAAC,CAAC;IAC1G,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AAC5B,CAAC;AAED,6EAA6E;AAC7E,SAAS,WAAW,CAAC,CAAS;IAC5B,OAAO,CAAC,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC;AAED,4FAA4F;AAC5F,SAAS,OAAO,CAAC,CAAS,EAAE,CAAS;IACnC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAC3C,CAAC;AAED;;;;GAIG;AACH,SAAS,QAAQ,CACf,SAAiB,EACjB,QAAgB,EAChB,UAAsB;AACtB,8DAA8D;AAC9D,MAA0D;AAC1D,8DAA8D;AAC9D,MAA4B;AAC5B,8DAA8D;AAC9D,MAA4B;IAE5B,MAAM,IAAI,GAAiB,EAAE,CAAC;IAC9B,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,MAAM,MAAM,IAAI,CAAC,QAAQ,EAAE,YAAY,CAAU,EAAE,CAAC;QACvD,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,oBAAoB,EAAE,CAAC,CAAC;QACpF,IAAI,MAAM,CAAC,MAAM,KAAK,oBAAoB;YAAE,MAAM,GAAG,IAAI,CAAC;QAC1D,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,gFAAgF;YAChF,mFAAmF;YACnF,mFAAmF;YACnF,gFAAgF;YAChF,oDAAoD;YACpD,IAAI,CAAC,IAAI,CAAC;gBACR,UAAU;gBACV,IAAI,EAAE,CAAC,CAAC,EAAY;gBACpB,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;gBACf,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC;gBACrB,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAkB;gBAC/C,YAAY,EAAE,CAAC,CAAC,CAAC,YAAY,IAAI,IAAI,CAAkB;aACxD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAC1B,CAAC;AAqBD;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,SAAiB,EAAE,QAAgB;IAC9D,cAAc,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;IAEzC,MAAM,OAAO,GAQR;QACH,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;QACtJ,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;QAClJ,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;QAC/I,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;KAC1I,CAAC;IAEF,2EAA2E;IAC3E,4EAA4E;IAC5E,uEAAuE;IACvE,gEAAgE;IAChE,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACjC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,QAAQ,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3G,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,8EAA8E;IAC9E,6EAA6E;IAC7E,6EAA6E;IAC7E,+BAA+B;IAC/B,OAAO,0BAA0B,CAAC,SAAS,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAC9D,gBAAgB,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CACpD,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CACvB,IAAe,EACf,SAAiB,EACjB,QAAgB,EAChB,MAA8E;IAE9E,uEAAuE;IACvE,UAAU,CAAC,SAAS,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;IAEtC,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,mFAAmF;IACnF,sFAAsF;IACtF,iCAAiC;IACjC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAyB,CAAC;IACvD,sFAAsF;IACtF,MAAM,OAAO,GAAoB,EAAE,CAAC;IAEpC,qFAAqF;IACrF,mFAAmF;IACnF,kFAAkF;IAClF,wDAAwD;IACxD,KAAK,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QAClD,IAAI,MAAM;YAAE,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACvB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,yEAAyE;YACzE,sEAAsE;YACtE,4EAA4E;YAC5E,gFAAgF;YAChF,6EAA6E;YAC7E,wEAAwE;YACxE,gFAAgF;YAChF,+EAA+E;YAC/E,8DAA8D;YAC9D,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;YACnE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAChC,MAAM,YAAY,GAAG,cAAc,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9D,MAAM,MAAM,GAAG,YAAY,CAAC,SAAS,EAAE,QAAQ,EAAE;gBAC/C,UAAU,EAAE,GAAG,CAAC,UAAU;gBAC1B,IAAI;gBACJ,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,YAAY;aACb,EAAE,IAAI,CAAC,CAAC;YACT,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YAC1C,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;YAChC,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;YACnC,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,YAAY,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,IAAI,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,YAAY,KAAK,IAAI,EAAE,CAAC,CAAC;YACvL,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,mFAAmF;IACnF,qFAAqF;IACrF,uFAAuF;IACvF,yFAAyF;IACzF,iFAAiF;IACjF,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,uFAAuF;IACvF,mFAAmF;IACnF,qFAAqF;IACrF,sDAAsD;IACtD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC1C,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,YAAY,KAAK,IAAI;YAAE,SAAS;QACxC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,cAAc;QACtD,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe;QACrD,IAAI,MAAM,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACzD,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,mCAAmC;QACtF,cAAc,CAAC,SAAS,EAAE,QAAQ,EAAE;YAClC,YAAY,EAAE,MAAM;YACpB,UAAU,EAAE,IAAI;YAChB,OAAO,EAAE,YAAY;YACrB,QAAQ,EAAE,SAAS;YACnB,YAAY,EAAE,cAAc,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,YAAY,CAAC,EAAE,uBAAuB;SACxF,EAAE,IAAI,CAAC,CAAC;QACT,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;QAC3C,SAAS,IAAI,CAAC,CAAC;IACjB,CAAC;IAED,qFAAqF;IACrF,kFAAkF;IAClF,mFAAmF;IACnF,4CAA4C;IAC5C,MAAM,UAAU,GAAG,iBAAiB,CAAC,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IACrG,SAAS,IAAI,UAAU,CAAC;IAExB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC;IAChC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;AAChE,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CACxB,SAAiB,EACjB,QAAgB,EAChB,OAAwB,EACxB,eAA4B,EAC5B,SAAmB,EACnB,IAAe;IAEf,uFAAuF;IACvF,mFAAmF;IACnF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,kFAAkF;QAClF,0CAA0C;QAC1C,IAAI,CAAC,CAAC,UAAU;YAAE,SAAS;QAC3B,qFAAqF;QACrF,qFAAqF;QACrF,sFAAsF;QACtF,IAAI,CAAC,CAAC,UAAU,KAAK,UAAU;YAAE,SAAS;QAC1C,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,MAAM,GAAG,gBAAgB,IAAI,IAAI,CAAC,MAAM,GAAG,gBAAgB;YAAE,SAAS;QAC/E,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAClC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,oFAAoF;YACpF,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACtC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACtB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;YACD,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;IACjC,CAAC;IACD,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAElC,kFAAkF;IAClF,mDAAmD;IACnD,IAAI,QAAQ,CAAC,IAAI,GAAG,gBAAgB;QAAE,SAAS,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAC3E,oFAAoF;IACpF,kFAAkF;IAClF,wFAAwF;IACxF,MAAM,WAAW,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;SACrC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACnE,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,SAAS,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;IACtE,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAErC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,UAAU;YAAE,SAAS,CAAC,wDAAwD;QACtF,IAAI,CAAC,GAAG,CAAC,UAAU;YAAE,SAAS;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5C,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;YAClD,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,GAAG,CAAC,QAAQ;gBAAE,SAAS,CAAC,cAAc;YACjF,IAAI,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBAAE,SAAS,CAAC,0BAA0B;YAC9F,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtB,IAAI,OAAO,CAAC,IAAI,IAAI,yBAAyB;gBAAE,MAAM,CAAC,iBAAiB;QACzE,CAAC;QACD,KAAK,MAAM,QAAQ,IAAI,OAAO,EAAE,CAAC;YAC/B,cAAc,CAAC,SAAS,EAAE,QAAQ,EAAE;gBAClC,YAAY,EAAE,GAAG,CAAC,QAAQ;gBAC1B,UAAU,EAAE,QAAQ;gBACpB,OAAO,EAAE,YAAY;gBACrB,iFAAiF;gBACjF,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,YAAY,EAAE,GAAG,CAAC,YAAY;aAC/B,EAAE,IAAI,CAAC,CAAC;YACT,UAAU,IAAI,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/src/graph-recall.js

@@ -1,277 +0,0 @@
-/**
- * E3.2 multi-hop graph recall (docs/plans/2026-06-02-e3.2-multihop-recall.md).
- *
- * READ-ONLY consumer of the E3 graph substrate (entities/relations built by E3.1,
- * guarded by E3.3). Given the lexical recall seeds, walk the relations graph up to N
- * hops and surface the memories of reached entities that the lexical search did not
- * already return.
- *
- * Relation-type-AGNOSTIC: it walks whatever edges exist. Today the graph holds only
- * `supersedes` edges (so a 1-hop walk surfaces a supersession-linked predecessor/
- * successor a lexical search may miss); the moment E3.1 emits cross-object edges
- * (owns/depends-on/blocked-by/references) the SAME traversal lights up cross-entity
- * multi-hop with zero rework here.
- *
- * Design points (the first two were forced by the verify-stage benchmark, the rest by
- * codex review — all root-cause, not patches):
- *  1. Graph-reached memories are loaded DIRECTLY by id (tenant-scoped PK fetch), NOT
- *     intersected with the recall handler's candidate set — that set is lexically
- *     prefiltered (loadSearchRows filters by query tokens), so intersecting would exclude
- *     exactly the lexically-orthogonal neighbours graph recall exists to surface. We
- *     re-apply the recall HARD filters to the directly-loaded rows: the FULL bi-temporal
- *     as-of rule (valid_from <= asOf AND, for a superseded row, successor.valid_from >
- *     asOf — same as cmdRecall) and the default superseded-drop. SCOPE is intentionally
- *     NOT re-applied: the CLI caller (cmdRecall) does not hard-filter scope either (it
- *     only soft-boosts it). Rows are tenant-scoped + archived-excluded (loadEntriesByIds).
- *  2. A graph hit inherits its origin seed's relevance (minus a per-hop discount) and is
- *     placed adjacent to that seed; budget selection is by score so a high-value hit wins
- *     a token slot over a noise distractor. Dead-last appending made the feature do
- *     nothing at realistic budgets.
- *  3. BOTH the local and global stores are expanded — a global seed's entities/relations
- *     live under the global root, so graph recall must traverse each seed in the store its
- *     graph lives in (codex review).
- *  4. By-id loads are chunked at 500 (loadEntriesByIds caps at 500/call), so a high-fanout
- *     traversal (--hops 3 --max-neighbors 200 -> up to 600 ids) loses none (codex review).
- *
- * No graph writes (only SELECTs via graph.ts read helpers + store reads), so the E3.3
- * check-graph-writes lint permits this module living outside graph.ts.
- */
-import { loadEntriesByIds } from './store.js';
-import { estimateTokens } from './search.js';
-import { compareEntryIdentity } from './compare.js';
-import { loadEntitiesByMemoryId, loadEntitiesByIds, loadNeighborRelations, } from './graph.js';
-import { passesCliRecallScopeFilter, passesScopeFilterForRecall } from './recall-scope.js';
-/** Hard cap on `--hops` (a higher value just walks more of a finite graph; this bounds
- *  worst-case work and keeps the flag honest). */
-export const MAX_HOPS = 3;
-/** Default per-hop fanout cap (bounds blow-up on a future dense graph). */
-export const DEFAULT_MAX_NEIGHBORS = 25;
-/** Per-hop relevance discount: a graph hit inherits its origin seed's score, scaled down
- *  1% per hop, so it ranks just below its seed and orders by hop-distance. */
-const HOP_DISCOUNT = 0.01;
-/** loadEntriesByIds caps each call at 500 ids; chunk to lose none on high fanout. */
-const LOAD_CHUNK = 500;
-/** Load memories by id in <=500-id chunks (loadEntriesByIds caps each call at 500). */
-function loadByIdsChunked(root, tenantId, ids) {
-    if (ids.length === 0)
-        return [];
-    const out = [];
-    for (let i = 0; i < ids.length; i += LOAD_CHUNK) {
-        out.push(...loadEntriesByIds(root, ids.slice(i, i + LOAD_CHUNK), tenantId));
-    }
-    return out;
-}
-/**
- * Traverse one store's graph from the seeds present in it and accumulate new graph hits
- * into `hitsByOrigin`. Mutates `seenMemoryIds` so a memory is surfaced at most once across
- * stores. Pure reads.
- */
-function produceHitsForRoot(root, baseResults, baseScoreByMemId, seenMemoryIds, hitsByOrigin, opts) {
-    const { hops, maxNeighbors, tenantId, includeSuperseded, asOfDate, recallScope } = opts;
-    // Seeds = graph entities (in THIS store) whose source memory is a base result.
-    const seedEntities = loadEntitiesByMemoryId(root, tenantId, baseResults.map((r) => r.entry.id));
-    if (seedEntities.length === 0)
-        return;
-    // BFS, both directions, up to `hops`. `visited` prevents re-expansion (cycle-safe).
-    // `originMemByEntityId` propagates the base-result memory id each reached node descends
-    // from (for adjacency placement + score inheritance).
-    const visitedEntityIds = new Set(seedEntities.map((e) => e.id));
-    const reached = new Map();
-    // A seed/reached entity whose mirror was forgotten/pruned has a null memoryId; the map
-    // tolerates null so traversal still propagates origin, and the null is dropped before
-    // any memory load below (a mirror-less node has no memory to surface).
-    const originMemByEntityId = new Map();
-    for (const se of seedEntities)
-        originMemByEntityId.set(se.id, se.memoryId);
-    let frontier = seedEntities.map((e) => e.id);
-    for (let depth = 1; depth <= hops && frontier.length > 0; depth++) {
-        const frontierSet = new Set(frontier);
-        const rels = loadNeighborRelations(root, tenantId, frontier, {
-            limit: Math.max(maxNeighbors, maxNeighbors * frontier.length),
-        });
-        const nextFrontier = [];
-        for (const rel of rels) {
-            const fromIn = frontierSet.has(rel.fromEntityId);
-            const toIn = frontierSet.has(rel.toEntityId);
-            let neighborId;
-            let reacherId;
-            let direction;
-            if (fromIn && !toIn) {
-                neighborId = rel.toEntityId;
-                reacherId = rel.fromEntityId;
-                direction = 'to';
-            }
-            else if (toIn && !fromIn) {
-                neighborId = rel.fromEntityId;
-                reacherId = rel.toEntityId;
-                direction = 'from';
-            }
-            else
-                continue;
-            if (visitedEntityIds.has(neighborId))
-                continue;
-            visitedEntityIds.add(neighborId);
-            reached.set(neighborId, { hops: depth, relType: rel.relType, direction });
-            const origin = originMemByEntityId.get(reacherId);
-            if (origin !== undefined)
-                originMemByEntityId.set(neighborId, origin);
-            nextFrontier.push(neighborId);
-            if (nextFrontier.length >= maxNeighbors)
-                break; // per-hop fanout cap
-        }
-        frontier = nextFrontier;
-    }
-    if (reached.size === 0)
-        return;
-    // Reached entities -> source memory ids -> load DIRECTLY by id (chunked), not lexical.
-    // A mirror-less reached entity (memoryId === null) has no memory to load: drop its null
-    // id BEFORE it reaches loadByIdsChunked / the Set<string> (it cannot be recall-surfaced;
-    // it stays in entities/relations for graph extract / visualization).
-    const reachedEntities = loadEntitiesByIds(root, tenantId, [...reached.keys()]);
-    const needLoad = [...new Set(reachedEntities
-            .map((e) => e.memoryId)
-            .filter((id) => id !== null && !seenMemoryIds.has(id)))];
-    const loadedById = new Map(loadByIdsChunked(root, tenantId, needLoad).map((m) => [m.id, m]));
-    // For the bi-temporal as-of rule on a superseded reached row we need its successor's
-    // valid_from. Batch-load the successors referenced by the loaded rows.
-    let successorValidFrom = new Map();
-    if (asOfDate) {
-        const succIds = [...new Set([...loadedById.values()].map((m) => m.superseded_by).filter((id) => !!id))];
-        successorValidFrom = new Map(loadByIdsChunked(root, tenantId, succIds).map((m) => [m.id, m.valid_from]));
-    }
-    for (const ent of reachedEntities) {
-        if (ent.memoryId === null)
-            continue; // mirror-less node: not recall-surfaced
-        const mem = loadedById.get(ent.memoryId);
-        if (!mem)
-            continue; // not found / wrong tenant / already in base
-        if (seenMemoryIds.has(mem.id))
-            continue; // another reached entity already added it
-        const via = reached.get(ent.id);
-        // A node reached as the `to` endpoint of a `supersedes` edge IS the superseded
-        // (older) version — the graph is the authoritative signal (the memory mirror's
-        // `superseded_by` is NOT set by `hippo decide`, only the decisions table is). By
-        // default recall shows current truth, so drop it unless --include-superseded; the
-        // `from` endpoint (the newer successor) is always kept.
-        const isSupersededEndpoint = via.relType === 'supersedes' && via.direction === 'to';
-        if (asOfDate) {
-            if (new Date(mem.valid_from) > asOfDate)
-                continue; // not yet valid at asOf
-            if (mem.superseded_by) {
-                const succVf = successorValidFrom.get(mem.superseded_by);
-                // Visible only while its successor was NOT yet valid at asOf (matches cmdRecall).
-                if (succVf && new Date(succVf) <= asOfDate)
-                    continue;
-            }
-        }
-        else if (!includeSuperseded && (mem.superseded_by || isSupersededEndpoint)) {
-            continue; // default recall drops superseded
-        }
-        const scopeOk = recallScope.additive
-            ? passesCliRecallScopeFilter(mem.scope ?? null, recallScope.requested)
-            : passesScopeFilterForRecall(mem.scope ?? null, recallScope.requested);
-        if (!scopeOk)
-            continue;
-        const origin = originMemByEntityId.get(ent.id) ?? baseResults[0].entry.id;
-        const originScore = baseScoreByMemId.get(origin) ?? baseResults[baseResults.length - 1].score;
-        seenMemoryIds.add(mem.id);
-        const hit = {
-            entry: mem,
-            score: originScore * (1 - HOP_DISCOUNT * via.hops),
-            bm25: 0, cosine: 0,
-            tokens: estimateTokens(mem.content),
-            graphVia: via,
-        };
-        if (!hitsByOrigin.has(origin))
-            hitsByOrigin.set(origin, []);
-        hitsByOrigin.get(origin).push(hit);
-    }
-}
-/**
- * Augment `baseResults` with memories reached by walking the graph `hops` edges out from
- * the seed results' entities (across the local AND global stores). Each graph hit is
- * inserted directly after the base result it descends from, scored just below that seed;
- * the base list's own order is preserved. Token-budget-bounded; deduped against the base
- * set and across stores.
- *
- * No-op (returns `baseResults` unchanged) when `hops <= 0`, there are no base results, the
- * graph is empty, no seed maps to an entity, or nothing new survives the filters/budget.
- */
-export function graphExpandRecall(baseResults, opts) {
-    const { hops, hippoRoot, globalRoot, tenantId } = opts;
-    if (hops <= 0 || baseResults.length === 0)
-        return baseResults;
-    const maxNeighbors = opts.maxNeighbors ?? DEFAULT_MAX_NEIGHBORS;
-    const budget = opts.budget ?? 4000;
-    const includeSuperseded = opts.includeSuperseded ?? false;
-    const asOfDate = opts.asOf ? new Date(opts.asOf) : null;
-    const minResults = opts.minResults ?? 1;
-    const recallScope = opts.recallScope ?? {};
-    const baseScoreByMemId = new Map(baseResults.map((r) => [r.entry.id, r.score]));
-    const seenMemoryIds = new Set(baseResults.map((r) => r.entry.id));
-    const hitsByOrigin = new Map();
-    // Expand against each distinct store the seeds may live in (local + global).
-    const roots = globalRoot && globalRoot !== hippoRoot ? [hippoRoot, globalRoot] : [hippoRoot];
-    for (const root of roots) {
-        produceHitsForRoot(root, baseResults, baseScoreByMemId, seenMemoryIds, hitsByOrigin, {
-            hops, maxNeighbors, tenantId, includeSuperseded, asOfDate, recallScope,
-        });
-    }
-    if (hitsByOrigin.size === 0)
-        return baseResults;
-    // Closer hops first within each origin group, then by inherited score.
-    // Hops asc and score desc are both true primary keys (unchanged);
-    // compareEntryIdentity is only the TAIL for a same-hop, same-score tie
-    // (T2, deterministic tie keys).
-    for (const hits of hitsByOrigin.values()) {
-        hits.sort((a, b) => {
-            const byHops = a.graphVia.hops - b.graphVia.hops;
-            if (byHops !== 0)
-                return byHops;
-            const byScore = b.score - a.score;
-            return byScore !== 0 ? byScore : compareEntryIdentity(a.entry, b.entry);
-        });
-    }
-    const allHits = [...hitsByOrigin.values()].flat();
-    // Budget SELECTION by score (not by position): a high-value graph hit (it inherits its
-    // origin seed's relevance) must be able to win a token slot over a low-score lexical
-    // distractor — otherwise a tight --budget keeps the noise and drops the memory --hops
-    // surfaced. The greedy pack uses `continue` (not `break`), so a hit's origin seed is
-    // NOT guaranteed kept just because the hit is; the DISPLAY loop guards that (a hit is
-    // emitted ONLY under a kept seed, never orphaned). At least one result is always kept.
-    // (NOTE: at a tight budget a new graph hit can displace a weakly-scored base result;
-    // aggregate recall stays >= baseline, the displaced item is the lowest-value one.)
-    // Protect the top --min-results base rows from eviction (graph expansion must not
-    // violate the recall min-results floor; codex P2). They are kept regardless of budget;
-    // baseResults is score-ordered, so slice(0, N) is the top N.
-    const protectedCount = Math.min(Math.max(minResults, 1), baseResults.length);
-    const keep = new Set(baseResults.slice(0, protectedCount));
-    let usedTokens = [...keep].reduce((s, r) => s + r.tokens, 0);
-    // T2 note: PLAIN stable score sort on purpose -- both input lists are
-    // deterministically ordered by this point, stability inherits that, and a
-    // base-vs-graph-hit tie keeps the BASE result first (the concat order),
-    // preserving pre-T2 semantics.
-    for (const r of [...baseResults.slice(protectedCount), ...allHits].sort((a, b) => b.score - a.score)) {
-        if (usedTokens + r.tokens > budget)
-            continue;
-        usedTokens += r.tokens;
-        keep.add(r);
-    }
-    // DISPLAY order: base order preserved (it may be MMR-diversified); each kept new hit
-    // placed directly after the seed it descends from. Hits emit ONLY under a kept seed.
-    const merged = [];
-    let emittedHit = false;
-    for (const r of baseResults) {
-        if (!keep.has(r))
-            continue;
-        merged.push(r);
-        for (const hit of hitsByOrigin.get(r.entry.id) ?? []) {
-            if (keep.has(hit)) {
-                merged.push(hit);
-                emittedHit = true;
-            }
-        }
-    }
-    return emittedHit ? merged : baseResults; // nothing new survived budget -> original base
-}
-//# sourceMappingURL=graph-recall.js.map

package/dist/src/graph-recall.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-recall.js","sourceRoot":"","sources":["../../src/graph-recall.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AACH,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAE9C,OAAO,EAAqB,cAAc,EAAE,MAAM,aAAa,CAAC;AAChE,OAAO,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AACpD,OAAO,EACL,sBAAsB,EACtB,iBAAiB,EACjB,qBAAqB,GACtB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,0BAA0B,EAAE,0BAA0B,EAAE,MAAM,mBAAmB,CAAC;AAE3F;kDACkD;AAClD,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAC;AAC1B,2EAA2E;AAC3E,MAAM,CAAC,MAAM,qBAAqB,GAAG,EAAE,CAAC;AACxC;8EAC8E;AAC9E,MAAM,YAAY,GAAG,IAAI,CAAC;AAC1B,qFAAqF;AACrF,MAAM,UAAU,GAAG,GAAG,CAAC;AAqCvB,uFAAuF;AACvF,SAAS,gBAAgB,CAAC,IAAY,EAAE,QAAgB,EAAE,GAAa;IACrE,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAChC,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC;QAChD,GAAG,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC9E,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,kBAAkB,CACzB,IAAY,EACZ,WAA2B,EAC3B,gBAAqC,EACrC,aAA0B,EAC1B,YAAqC,EACrC,IAGC;IAED,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,iBAAiB,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC;IAExF,+EAA+E;IAC/E,MAAM,YAAY,GAAG,sBAAsB,CAAC,IAAI,EAAE,QAAQ,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAChG,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAEtC,oFAAoF;IACpF,wFAAwF;IACxF,sDAAsD;IACtD,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAS,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,uFAAuF;IACvF,sFAAsF;IACtF,uEAAuE;IACvE,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC7D,KAAK,MAAM,EAAE,IAAI,YAAY;QAAE,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC;IAC3E,IAAI,QAAQ,GAAa,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEvD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,IAAI,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QAClE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE;YAC3D,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC;SAC9D,CAAC,CAAC;QACH,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YACjD,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC7C,IAAI,UAAkB,CAAC;YACvB,IAAI,SAAiB,CAAC;YACtB,IAAI,SAAwB,CAAC;YAC7B,IAAI,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;gBAAC,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;gBAAC,SAAS,GAAG,GAAG,CAAC,YAAY,CAAC;gBAAC,SAAS,GAAG,IAAI,CAAC;YAAC,CAAC;iBAChG,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAAC,UAAU,GAAG,GAAG,CAAC,YAAY,CAAC;gBAAC,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC;gBAAC,SAAS,GAAG,MAAM,CAAC;YAAC,CAAC;;gBACvG,SAAS;YACd,IAAI,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,SAAS;YAC/C,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACjC,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;YAC1E,MAAM,MAAM,GAAG,mBAAmB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAClD,IAAI,MAAM,KAAK,SAAS;gBAAE,mBAAmB,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;YACtE,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC9B,IAAI,YAAY,CAAC,MAAM,IAAI,YAAY;gBAAE,MAAM,CAAC,qBAAqB;QACvE,CAAC;QACD,QAAQ,GAAG,YAAY,CAAC;IAC1B,CAAC;IACD,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO;IAE/B,uFAAuF;IACvF,wFAAwF;IACxF,yFAAyF;IACzF,qEAAqE;IACrE,MAAM,eAAe,GAAG,iBAAiB,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC/E,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAC1B,eAAe;aACZ,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;aACtB,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CACvE,CAAC,CAAC;IACH,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7F,qFAAqF;IACrF,uEAAuE;IACvE,IAAI,kBAAkB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtH,kBAAkB,GAAG,IAAI,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC3G,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QAClC,IAAI,GAAG,CAAC,QAAQ,KAAK,IAAI;YAAE,SAAS,CAAM,wCAAwC;QAClF,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,GAAG;YAAE,SAAS,CAAuB,6CAA6C;QACvF,IAAI,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS,CAAE,0CAA0C;QACpF,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QACjC,+EAA+E;QAC/E,+EAA+E;QAC/E,iFAAiF;QACjF,kFAAkF;QAClF,wDAAwD;QACxD,MAAM,oBAAoB,GAAG,GAAG,CAAC,OAAO,KAAK,YAAY,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,CAAC;QACpF,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,QAAQ;gBAAE,SAAS,CAAQ,wBAAwB;YAClF,IAAI,GAAG,CAAC,aAAa,EAAE,CAAC;gBACtB,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;gBACzD,kFAAkF;gBAClF,IAAI,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,QAAQ;oBAAE,SAAS;YACvD,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,iBAAiB,IAAI,CAAC,GAAG,CAAC,aAAa,IAAI,oBAAoB,CAAC,EAAE,CAAC;YAC7E,SAAS,CAAiD,kCAAkC;QAC9F,CAAC;QACD,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ;YAClC,CAAC,CAAC,0BAA0B,CAAC,GAAG,CAAC,KAAK,IAAI,IAAI,EAAE,WAAW,CAAC,SAAS,CAAC;YACtE,CAAC,CAAC,0BAA0B,CAAC,GAAG,CAAC,KAAK,IAAI,IAAI,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC;QACzE,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,MAAM,MAAM,GAAG,mBAAmB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1E,MAAM,WAAW,GAAG,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;QAC9F,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE,GAAG;YACV,KAAK,EAAE,WAAW,GAAG,CAAC,CAAC,GAAG,YAAY,GAAG,GAAG,CAAC,IAAI,CAAC;YAClD,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;YAClB,MAAM,EAAE,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC;YACnC,QAAQ,EAAE,GAAG;SACd,CAAC;QACF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAC5D,YAAY,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACtC,CAAC;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAC/B,WAA2B,EAC3B,IAAqB;IAErB,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;IACvD,IAAI,IAAI,IAAI,CAAC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,WAAW,CAAC;IAC9D,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,qBAAqB,CAAC;IAChE,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC;IACnC,MAAM,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,IAAI,KAAK,CAAC;IAC1D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACxD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC;IACxC,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC;IAE3C,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChF,MAAM,aAAa,GAAG,IAAI,GAAG,CAAS,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1E,MAAM,YAAY,GAAG,IAAI,GAAG,EAAsB,CAAC;IAEnD,6EAA6E;IAC7E,MAAM,KAAK,GAAG,UAAU,IAAI,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC7F,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,kBAAkB,CAAC,IAAI,EAAE,WAAW,EAAE,gBAAgB,EAAE,aAAa,EAAE,YAAY,EAAE;YACnF,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,iBAAiB,EAAE,QAAQ,EAAE,WAAW;SACvE,CAAC,CAAC;IACL,CAAC;IAED,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,WAAW,CAAC;IAChD,uEAAuE;IACvE,kEAAkE;IAClE,uEAAuE;IACvE,gCAAgC;IAChC,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACjB,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;YACjD,IAAI,MAAM,KAAK,CAAC;gBAAE,OAAO,MAAM,CAAC;YAChC,MAAM,OAAO,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;YAClC,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;IACL,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAElD,uFAAuF;IACvF,qFAAqF;IACrF,sFAAsF;IACtF,qFAAqF;IACrF,sFAAsF;IACtF,uFAAuF;IACvF,qFAAqF;IACrF,mFAAmF;IACnF,kFAAkF;IAClF,uFAAuF;IACvF,6DAA6D;IAC7D,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC7E,MAAM,IAAI,GAAG,IAAI,GAAG,CAAe,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC;IACzE,IAAI,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC7D,sEAAsE;IACtE,0EAA0E;IAC1E,wEAAwE;IACxE,+BAA+B;IAC/B,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,cAAc,CAAC,EAAE,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QACrG,IAAI,UAAU,GAAG,CAAC,CAAC,MAAM,GAAG,MAAM;YAAE,SAAS;QAC7C,UAAU,IAAI,CAAC,CAAC,MAAM,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IAED,qFAAqF;IACrF,qFAAqF;IACrF,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC3B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,KAAK,MAAM,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACrD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAAC,UAAU,GAAG,IAAI,CAAC;YAAC,CAAC;QAC7D,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,+CAA+C;AAC3F,CAAC"}