@remnic/core 9.69.40 → 9.69.42

package/dist/{chunk-KY236SP5.js → chunk-AHHFBJX7.js}

@@ -1,9 +1,9 @@
 import {
   NamespaceStorageRouter
-} from "./chunk-2SNCQHJZ.js";
+} from "./chunk-CQ4BTPX6.js";
 import {
   namespaceCollectionName
-} from "./chunk-TZ44E732.js";
+} from "./chunk-AIVRD66I.js";
 import {
   isSafeRouteNamespace
 } from "./chunk-PCXDUHQH.js";
@@ -213,4 +213,4 @@ export {
   verifyNamespaces,
   runNamespaceMigration
 };
-//# sourceMappingURL=chunk-KY236SP5.js.map
+//# sourceMappingURL=chunk-AHHFBJX7.js.map

package/dist/{chunk-TZ44E732.js → chunk-AIVRD66I.js}

@@ -1,6 +1,6 @@
 import {
   createSearchBackend
-} from "./chunk-JOP7W24J.js";
+} from "./chunk-PLJ2MQFT.js";
 import {
   namespaceIdentityToken,
   normalizeNamespaceIdentity
@@ -508,4 +508,4 @@ export {
   NamespaceSearchRouter,
   normalizeQmdResultPath
 };
-//# sourceMappingURL=chunk-TZ44E732.js.map
+//# sourceMappingURL=chunk-AIVRD66I.js.map

package/dist/{chunk-OEDW4ER7.js → chunk-AJBWVDRV.js}

@@ -32,6 +32,7 @@ function createDeepRecallSeedSearch(deps) {
       namespaces: [deps.namespace],
       maxResults: limit,
       execution: {
+        ...deps.signal ? { signal: deps.signal } : {},
         onDegradation: (degradation) => {
           if (degradation.code === "backend_unavailable") unavailable.push(degradation);
         }
@@ -59,4 +60,4 @@ function createDeepRecallSeedSearch(deps) {
 export {
   createDeepRecallSeedSearch
 };
-//# sourceMappingURL=chunk-OEDW4ER7.js.map
+//# sourceMappingURL=chunk-AJBWVDRV.js.map

package/dist/chunk-AJBWVDRV.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/deep-recall-seeds.ts"],"sourcesContent":["/**\n * Deep-recall seed retrieval (issue #2332 review).\n *\n * Seeds route through the SAME namespace search router the rest of the read\n * path uses, so a non-default caller searches its own suffixed collection\n * instead of the base (default-namespace) collection — read and write resolve\n * through one resolver, never two (§30).\n *\n * Each hit is resolved to a real memory id through the shared QMD result\n * resolver (`QmdResultResolver.readQmdResultMemory`), per hit and bounded by\n * the requested limit, instead of pre-scanning the whole namespace corpus to\n * build a path index. With namespaces disabled the fanout queries the QMD\n * backend directly, so hits keep the indexer's raw path forms; the resolver\n * decodes `qmd://<collection>/` URIs and `<collection>/`-prefixed relatives,\n * and the two forms it cannot decode (`qmd:///`, a leading `/`) are stripped\n * for one retry. A hit with no path is dropped: its namespace membership\n * cannot be verified, and a bare docid from a foreign collection must never\n * enter the working set as a resolved memory.\n *\n * An unavailable namespace backend (or a missing collection) contributes an\n * empty result set and reports itself only through `execution.onDegradation`,\n * so the observer is REQUIRED here: without it a dead index is indistinguishable\n * from a healthy empty one and deep recall would answer `ok: true` with zero\n * entries instead of the advertised `backend_unavailable` failure.\n */\n\nimport type { DeepRecallSeedHit } from \"./deep-recall.js\";\nimport type { SearchDegradation } from \"./search/port.js\";\n\n/** Namespace-scoped search entrypoint (satisfied by `Orchestrator.searchAcrossNamespaces`). */\nexport interface DeepRecallSeedRouter {\n  searchAcrossNamespaces(options: {\n    query: string;\n    namespaces: string[];\n    maxResults?: number;\n    execution?: {\n      signal?: AbortSignal;\n      onDegradation?: (degradation: SearchDegradation) => void;\n    };\n  }): Promise<ReadonlyArray<{ path?: string; docid?: string; score?: number }>>;\n}\n\n/** Namespace-scoped storage read (satisfied by `StorageManager`). */\nexport interface DeepRecallSeedStorage {\n  readonly dir: string;\n  readMemoryByPath(filePath: string): Promise<{ frontmatter: { id?: string } } | null>;\n}\n\n/** Full QMD hit -> memory resolver (satisfied by `QmdResultResolver#readQmdResultMemory`). */\nexport interface DeepRecallSeedResultResolver {\n  readQmdResultMemory(\n    resultPath: string,\n    fallbackStorage: DeepRecallSeedStorage,\n    recallNamespaces?: readonly string[],\n    preferredNamespace?: string,\n  ): Promise<{ frontmatter: { id?: string } } | null>;\n}\n\n/**\n * Strip the collection-qualified forms the indexer can emit but\n * `readQmdResultMemory` cannot decode: the empty-hostname `qmd:///` URI and\n * the root-relative `/` path both reach its fallback probe still prefixed and\n * miss. Returns `null` when the path carries no such prefix — including a\n * decodable `qmd://<collection>/` or `<collection>/` form, which the resolver\n * owns, and a foreign collection prefix, which must stay a miss.\n */\nfunction collectionPrefixStrippedPath(resultPath: string): string | null {\n  const trimmed = resultPath.trim();\n  if (trimmed.startsWith(\"qmd:///\")) {\n    const relative = trimmed.slice(\"qmd:///\".length).replace(/^\\/+/, \"\");\n    return relative.length > 0 ? relative : null;\n  }\n  if (trimmed.startsWith(\"/\")) {\n    const relative = trimmed.replace(/^\\/+/, \"\");\n    return relative.length > 0 ? relative : null;\n  }\n  return null;\n}\n\nasync function resolveSeedMemoryId(\n  resolver: DeepRecallSeedResultResolver,\n  storage: DeepRecallSeedStorage,\n  namespace: string,\n  resultPath: string | undefined,\n): Promise<string | null> {\n  if (typeof resultPath !== \"string\" || resultPath.length === 0) return null;\n  const attempts = [resultPath];\n  const stripped = collectionPrefixStrippedPath(resultPath);\n  if (stripped !== null) attempts.push(stripped);\n  for (const attempt of attempts) {\n    const memory = await resolver.readQmdResultMemory(attempt, storage, [namespace]);\n    const id = memory?.frontmatter?.id;\n    if (typeof id === \"string\" && id.length > 0) return id;\n  }\n  return null;\n}\n\nexport function createDeepRecallSeedSearch(deps: {\n  namespace: string;\n  storage: DeepRecallSeedStorage;\n  router: DeepRecallSeedRouter;\n  resolver: DeepRecallSeedResultResolver;\n  /** Transport cancellation (issue #2915); forwarded to the search router. */\n  signal?: AbortSignal;\n}): (query: string, limit: number) => Promise<DeepRecallSeedHit[]> {\n  return async (query, limit) => {\n    if (limit <= 0) return [];\n    const unavailable: SearchDegradation[] = [];\n    const hits = await deps.router.searchAcrossNamespaces({\n      query,\n      namespaces: [deps.namespace],\n      maxResults: limit,\n      execution: {\n        ...(deps.signal ? { signal: deps.signal } : {}),\n        onDegradation: (degradation) => {\n          if (degradation.code === \"backend_unavailable\") unavailable.push(degradation);\n        },\n      },\n    });\n    // The requested namespace has no usable index: a seed-search failure, which\n    // is the one condition deep recall reports as `backend_unavailable`.\n    if (unavailable.length > 0) {\n      throw new Error(\n        `deep recall seed search unavailable: ${unavailable.map((d) => d.detail ?? d.code).join(\"; \")}`,\n      );\n    }\n    const seeds: DeepRecallSeedHit[] = [];\n    for (const hit of hits) {\n      if (typeof hit.path !== \"string\" || hit.path.length === 0) continue;\n      const memoryId =\n        (await resolveSeedMemoryId(deps.resolver, deps.storage, deps.namespace, hit.path)) ?? hit.docid;\n      if (typeof memoryId !== \"string\" || memoryId.length === 0) continue;\n      seeds.push({\n        memoryId,\n        score: typeof hit.score === \"number\" && Number.isFinite(hit.score) ? hit.score : 0,\n      });\n    }\n    return seeds;\n  };\n}\n"],"mappings":";AAkEA,SAAS,6BAA6B,YAAmC;AACvE,QAAM,UAAU,WAAW,KAAK;AAChC,MAAI,QAAQ,WAAW,SAAS,GAAG;AACjC,UAAM,WAAW,QAAQ,MAAM,UAAU,MAAM,EAAE,QAAQ,QAAQ,EAAE;AACnE,WAAO,SAAS,SAAS,IAAI,WAAW;AAAA,EAC1C;AACA,MAAI,QAAQ,WAAW,GAAG,GAAG;AAC3B,UAAM,WAAW,QAAQ,QAAQ,QAAQ,EAAE;AAC3C,WAAO,SAAS,SAAS,IAAI,WAAW;AAAA,EAC1C;AACA,SAAO;AACT;AAEA,eAAe,oBACb,UACA,SACA,WACA,YACwB;AACxB,MAAI,OAAO,eAAe,YAAY,WAAW,WAAW,EAAG,QAAO;AACtE,QAAM,WAAW,CAAC,UAAU;AAC5B,QAAM,WAAW,6BAA6B,UAAU;AACxD,MAAI,aAAa,KAAM,UAAS,KAAK,QAAQ;AAC7C,aAAW,WAAW,UAAU;AAC9B,UAAM,SAAS,MAAM,SAAS,oBAAoB,SAAS,SAAS,CAAC,SAAS,CAAC;AAC/E,UAAM,KAAK,QAAQ,aAAa;AAChC,QAAI,OAAO,OAAO,YAAY,GAAG,SAAS,EAAG,QAAO;AAAA,EACtD;AACA,SAAO;AACT;AAEO,SAAS,2BAA2B,MAOwB;AACjE,SAAO,OAAO,OAAO,UAAU;AAC7B,QAAI,SAAS,EAAG,QAAO,CAAC;AACxB,UAAM,cAAmC,CAAC;AAC1C,UAAM,OAAO,MAAM,KAAK,OAAO,uBAAuB;AAAA,MACpD;AAAA,MACA,YAAY,CAAC,KAAK,SAAS;AAAA,MAC3B,YAAY;AAAA,MACZ,WAAW;AAAA,QACT,GAAI,KAAK,SAAS,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;AAAA,QAC7C,eAAe,CAAC,gBAAgB;AAC9B,cAAI,YAAY,SAAS,sBAAuB,aAAY,KAAK,WAAW;AAAA,QAC9E;AAAA,MACF;AAAA,IACF,CAAC;AAGD,QAAI,YAAY,SAAS,GAAG;AAC1B,YAAM,IAAI;AAAA,QACR,wCAAwC,YAAY,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC;AAAA,MAC/F;AAAA,IACF;AACA,UAAM,QAA6B,CAAC;AACpC,eAAW,OAAO,MAAM;AACtB,UAAI,OAAO,IAAI,SAAS,YAAY,IAAI,KAAK,WAAW,EAAG;AAC3D,YAAM,WACH,MAAM,oBAAoB,KAAK,UAAU,KAAK,SAAS,KAAK,WAAW,IAAI,IAAI,KAAM,IAAI;AAC5F,UAAI,OAAO,aAAa,YAAY,SAAS,WAAW,EAAG;AAC3D,YAAM,KAAK;AAAA,QACT;AAAA,QACA,OAAO,OAAO,IAAI,UAAU,YAAY,OAAO,SAAS,IAAI,KAAK,IAAI,IAAI,QAAQ;AAAA,MACnF,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AACF;","names":[]}

package/dist/{chunk-YRIFXXMI.js → chunk-AOGICQMH.js}

@@ -1,6 +1,9 @@
 import {
   resolveDefaultNamespaceRoot
-} from "./chunk-2SNCQHJZ.js";
+} from "./chunk-CQ4BTPX6.js";
+import {
+  StorageManager
+} from "./chunk-I65KB36L.js";
 import {
   composeLocationDayBody,
   composeLocationDayMeta,
@@ -20,10 +23,7 @@ import {
   serializeLocationDay,
   updateLocationSourceDay,
   writeLocationDay
-} from "./chunk-6P4REYKL.js";
-import {
-  StorageManager
-} from "./chunk-MVG3KXON.js";
+} from "./chunk-UDAUULK2.js";
 import {
   resolveNamespaceCapabilities
 } from "./chunk-JUOZ62Y7.js";
@@ -728,4 +728,4 @@ export {
   runLocationBackfill,
   runLocationCliCommand
 };
-//# sourceMappingURL=chunk-YRIFXXMI.js.map
+//# sourceMappingURL=chunk-AOGICQMH.js.map

package/dist/{chunk-KOTG3RXE.js → chunk-AUSRUOMQ.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-SOBJ6NEY.js";
 import {
   summarizeDisclosureTokens
-} from "./chunk-BXIJSPCL.js";
+} from "./chunk-Q62GA5U2.js";
 import {
   summarizeRetrievedMemoryProvenance
 } from "./chunk-I4WBNM3M.js";
@@ -610,4 +610,4 @@ export {
   renderRecallExplain,
   parseRecallExplainFormat
 };
-//# sourceMappingURL=chunk-KOTG3RXE.js.map
+//# sourceMappingURL=chunk-AUSRUOMQ.js.map

package/dist/{chunk-C5R73BON.js → chunk-BIANISES.js}

@@ -1,6 +1,6 @@
 import {
   runLocationSync
-} from "./chunk-YRIFXXMI.js";
+} from "./chunk-AOGICQMH.js";
 import {
   log
 } from "./chunk-3WCASNQZ.js";
@@ -58,4 +58,4 @@ export {
   LOCATION_SYNC_DEFAULT_INTERVAL_MS,
   startLocationAutoSync
 };
-//# sourceMappingURL=chunk-C5R73BON.js.map
+//# sourceMappingURL=chunk-BIANISES.js.map

package/dist/{chunk-IMBQFHRV.js → chunk-BPXJINHW.js}

@@ -1,16 +1,19 @@
-import {
-  tagPersistedMemories
-} from "./chunk-6P4REYKL.js";
 import {
   raceRecallAbort,
   throwIfRecallAborted
-} from "./chunk-K75A5XWU.js";
+} from "./chunk-F6PTJLEM.js";
 import {
   classifyOrigin
 } from "./chunk-6Q3ZTEF6.js";
+import {
+  tagPersistedMemories
+} from "./chunk-UDAUULK2.js";
 import {
   resolveScopeProfilePlan
 } from "./chunk-MNIPH6LD.js";
+import {
+  parseFlexibleIsoTimestamp
+} from "./chunk-P7FMDTKL.js";
 import {
   defaultNamespaceForPrincipal,
   resolvePrincipal
@@ -19,9 +22,6 @@ import {
   resolveMemoryLifecycleCapabilities,
   resolvePresentationCapabilities
 } from "./chunk-JUOZ62Y7.js";
-import {
-  parseFlexibleIsoTimestamp
-} from "./chunk-P7FMDTKL.js";
 import {
   resolveCodingNamespaceOverlay
 } from "./chunk-3Q3N35W7.js";
@@ -1081,4 +1081,4 @@ export {
   ExtractionDeadlineError,
   ExtractionRunCoordinator
 };
-//# sourceMappingURL=chunk-IMBQFHRV.js.map
+//# sourceMappingURL=chunk-BPXJINHW.js.map

package/dist/{chunk-2NLLXCJG.js → chunk-BXLOS5AJ.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-765K3SAT.js";
 import {
   encryptCapsuleFile
-} from "./chunk-X7Y7WX73.js";
+} from "./chunk-DQEMWVMT.js";
 import {
   computeTransferOutputRel,
   isTransferPathExcluded
@@ -109,4 +109,4 @@ async function enforceRetention(outDirAbs, retentionDays) {
 export {
   backupMemoryDir
 };
-//# sourceMappingURL=chunk-2NLLXCJG.js.map
+//# sourceMappingURL=chunk-BXLOS5AJ.js.map

package/dist/{chunk-2J3V5QEO.js → chunk-C3QXITIP.js}

@@ -2,12 +2,12 @@ import {
   buildCodingGraphInstallHint,
   tryLoadCodingGraphModule
 } from "./chunk-VQ7B2Q6M.js";
-import {
-  composeMemoryEnvelope
-} from "./chunk-GDYU6VF4.js";
 import {
   isCodingKnowledgeFeatureEnabled
 } from "./chunk-FEHIOYML.js";
+import {
+  composeMemoryEnvelope
+} from "./chunk-GDYU6VF4.js";
 import {
   displayErrorDetail
 } from "./chunk-RL6NEVXT.js";
@@ -1463,4 +1463,4 @@ export {
   serializeDecisionRecord,
   parseDecisionRecord
 };
-//# sourceMappingURL=chunk-2J3V5QEO.js.map
+//# sourceMappingURL=chunk-C3QXITIP.js.map

package/dist/{chunk-2SNCQHJZ.js → chunk-CQ4BTPX6.js}

@@ -1,6 +1,10 @@
 import {
   StorageManager
-} from "./chunk-MVG3KXON.js";
+} from "./chunk-I65KB36L.js";
+import {
+  keyring_exports,
+  secureStoreDir
+} from "./chunk-BJMBJZ2Y.js";
 import {
   MutationSerializer
 } from "./chunk-FFAZ2XFU.js";
@@ -16,10 +20,6 @@ import {
   resolveNamespaceCapabilities,
   resolveRecallAuxiliaryCapabilities
 } from "./chunk-JUOZ62Y7.js";
-import {
-  keyring_exports,
-  secureStoreDir
-} from "./chunk-BJMBJZ2Y.js";
 import {
   ALL_CATEGORY_DIRS
 } from "./chunk-VS2IYZRU.js";
@@ -412,4 +412,4 @@ export {
   resolveNamespaceStorageRoot,
   NamespaceStorageRouter
 };
-//# sourceMappingURL=chunk-2SNCQHJZ.js.map
+//# sourceMappingURL=chunk-CQ4BTPX6.js.map

package/dist/{chunk-3QEVOQF5.js → chunk-CTETTVDN.js}

@@ -1,6 +1,6 @@
 import {
   isNamespaceKind
-} from "./chunk-W23JARAQ.js";
+} from "./chunk-DLPMOSNH.js";
 import {
   EngramAccessInputError
 } from "./chunk-2Z24E5W2.js";
@@ -40,4 +40,4 @@ export {
   positiveIntQueryParam,
   optionalNamespaceKindQueryParam
 };
-//# sourceMappingURL=chunk-3QEVOQF5.js.map
+//# sourceMappingURL=chunk-CTETTVDN.js.map

package/dist/{chunk-DFVSJFHK.js → chunk-DBB5JPSL.js}

@@ -1,6 +1,6 @@
 import {
   widenRecallStateViews
-} from "./chunk-6L2II3KS.js";
+} from "./chunk-3D75XIYO.js";
 
 // src/recall-state-view-wire.ts
 function applyRecallStateViews(results, query, config, stateViewActive, asOfMs) {
@@ -10,4 +10,4 @@ function applyRecallStateViews(results, query, config, stateViewActive, asOfMs)
 export {
   applyRecallStateViews
 };
-//# sourceMappingURL=chunk-DFVSJFHK.js.map
+//# sourceMappingURL=chunk-DBB5JPSL.js.map

package/dist/{chunk-W23JARAQ.js → chunk-DLPMOSNH.js}

@@ -1,7 +1,7 @@
 import {
   resolveDefaultNamespaceRoot,
   resolveNamespaceStorageRoot
-} from "./chunk-2SNCQHJZ.js";
+} from "./chunk-CQ4BTPX6.js";
 import {
   MutationSerializer,
   withHeldFileLock
@@ -1473,4 +1473,4 @@ export {
   isNamespaceKind,
   NamespaceCatalog
 };
-//# sourceMappingURL=chunk-W23JARAQ.js.map
+//# sourceMappingURL=chunk-DLPMOSNH.js.map

package/dist/{chunk-BGRTZOJB.js → chunk-DMTSKY4W.js}

@@ -7,24 +7,21 @@ import {
 import {
   listMemoryGovernanceRuns,
   readMemoryGovernanceRunArtifact
-} from "./chunk-2SKMZUOW.js";
+} from "./chunk-U26LB4WA.js";
 import {
   StorageManager
-} from "./chunk-MVG3KXON.js";
+} from "./chunk-I65KB36L.js";
 import {
   normalizeProjectionPreview,
   normalizeProjectionTags
 } from "./chunk-SCU65EZI.js";
-import {
-  commitPreparedFileAtomically
-} from "./chunk-AW4QUFQF.js";
 import {
   assertInjectedStorageRooted,
   readProjectedEntityMentionRows,
   readProjectedGovernanceRows,
   readProjectedNativeKnowledgeRows,
   writeProjectionMetaHighWater
-} from "./chunk-TBXAY2SS.js";
+} from "./chunk-SGHGCFVV.js";
 import {
   MEMORY_PROJECTION_SCHEMA_VERSION,
   getMemoryProjectionPath,
@@ -39,7 +36,7 @@ import {
 } from "./chunk-RL6NEVXT.js";
 import {
   isSupportPassportPrivateMemory
-} from "./chunk-37CAEC7E.js";
+} from "./chunk-PWPIERBM.js";
 import {
   MEMORY_LIFECYCLE_EVENT_SORT_ORDER,
   buildLifecycleEventsForMemory,
@@ -48,6 +45,9 @@ import {
   sortMemoryLifecycleEvents,
   toMemoryPathRel
 } from "./chunk-7RJUVTVF.js";
+import {
+  commitPreparedFileAtomically
+} from "./chunk-AW4QUFQF.js";
 import {
   isErrnoCode
 } from "./chunk-KNA3BXXL.js";
@@ -1005,4 +1005,4 @@ export {
   verifyMemoryProjection,
   repairMemoryProjection
 };
-//# sourceMappingURL=chunk-BGRTZOJB.js.map
+//# sourceMappingURL=chunk-DMTSKY4W.js.map

package/dist/{chunk-X7Y7WX73.js → chunk-DQEMWVMT.js}

@@ -246,4 +246,4 @@ export {
   decryptCapsuleFile,
   decryptCapsuleFileInMemory
 };
-//# sourceMappingURL=chunk-X7Y7WX73.js.map
+//# sourceMappingURL=chunk-DQEMWVMT.js.map

package/dist/{chunk-QS5Q5RBV.js → chunk-E4FRR4MA.js}

@@ -1,3 +1,9 @@
+import {
+  checkEntityRecallAbort,
+  entityRecallSectionAbsent,
+  yieldEntityRecallScan,
+  yieldEntityRecallScanEvery
+} from "./chunk-5AUY5Z5E.js";
 import {
   containsPhrase
 } from "./chunk-SVH57F5Z.js";
@@ -9,12 +15,6 @@ import {
   buildOriginStructuredSections,
   sanitizeOriginatedFacts
 } from "./chunk-GKUA4MGB.js";
-import {
-  checkEntityRecallAbort,
-  entityRecallSectionAbsent,
-  yieldEntityRecallScan,
-  yieldEntityRecallScanEvery
-} from "./chunk-5AUY5Z5E.js";
 import {
   collectNativeKnowledgeChunks
 } from "./chunk-2DQ2XREU.js";
@@ -23,7 +23,7 @@ import {
 } from "./chunk-7ZNJN5WZ.js";
 import {
   compareEntityTimestamps
-} from "./chunk-MVG3KXON.js";
+} from "./chunk-I65KB36L.js";
 import {
   normalizeEntityName
 } from "./chunk-YXZG5TVN.js";
@@ -918,4 +918,4 @@ export {
   entityIndexVersion,
   entityRecentTranscriptLookbackHours
 };
-//# sourceMappingURL=chunk-QS5Q5RBV.js.map
+//# sourceMappingURL=chunk-E4FRR4MA.js.map

package/dist/{chunk-NETQXOPY.js → chunk-EH3HNCAM.js}

@@ -157,10 +157,7 @@ function reconcileStateViewPairs(results) {
   }
   return kept;
 }
-function capStateViewPackets(ordered, limit) {
-  const safeLimit = typeof limit === "number" && Number.isFinite(limit) ? Math.max(0, Math.floor(limit)) : 0;
-  if (safeLimit === 0) return [];
-  if (ordered.length === 0) return [];
+function stateViewPacketKeys(ordered) {
   const byPred = buildSuccessorMap(ordered, []);
   const parent = /* @__PURE__ */ new Map();
   const root = (key) => {
@@ -194,13 +191,20 @@ function capStateViewPackets(ordered, limit) {
     const succIdx = keyToIndex.get(succKey);
     if (predIdx !== void 0 && succIdx !== void 0) union(keys[predIdx], keys[succIdx]);
   }
+  return keys.map((key) => root(key));
+}
+function capStateViewPackets(ordered, limit) {
+  const safeLimit = typeof limit === "number" && Number.isFinite(limit) ? Math.max(0, Math.floor(limit)) : 0;
+  if (safeLimit === 0) return [];
+  if (ordered.length === 0) return [];
+  const keys = stateViewPacketKeys(ordered);
   const selectedRoots = /* @__PURE__ */ new Set();
   for (let i = 0; i < ordered.length && selectedRoots.size < safeLimit; i += 1) {
-    selectedRoots.add(root(keys[i]));
+    selectedRoots.add(keys[i]);
   }
   const selected = [];
   for (let i = 0; i < ordered.length; i += 1) {
-    if (selectedRoots.has(root(keys[i]))) selected.push(ordered[i]);
+    if (selectedRoots.has(keys[i])) selected.push(ordered[i]);
   }
   return selected;
 }
@@ -216,6 +220,7 @@ export {
   resultStateViewKey,
   annotateStateView,
   reconcileStateViewPairs,
+  stateViewPacketKeys,
   capStateViewPackets
 };
-//# sourceMappingURL=chunk-NETQXOPY.js.map
+//# sourceMappingURL=chunk-EH3HNCAM.js.map

package/dist/{chunk-NETQXOPY.js.map → chunk-EH3HNCAM.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/recall-state-view.ts"],"sourcesContent":["/**\n * Recall state views (issue #1952).\n *\n * Config key: `recallStateViews` (default false). When false, annotateStateView\n * is identity: same array reference, no `stateLabel`. config.ts is at its\n * fileSizeGrandfather ceiling, so parseConfig wiring waits for a later PR.\n * Call `parseRecallStateViews` at the recall seam when that lands.\n *\n * Change-intent morphology lives here (do not grow intent.ts). A superseded\n * memory is admitted only when its successor is also in the candidate set.\n *\n * #2859 — chain identities are namespace-qualified (`namespace\\0id`): the\n * same id in two namespaces never cross-anchors. The reverse chain derives\n * from the successor's `supersedes` back-pointer when a predecessor lacks\n * `supersededBy`, and asOf snapshot labels use the temporal validity\n * boundary (predecessor `invalidAt` / successor `validAt`), not the\n * `supersededAt` write time.\n */\nimport { coerceBooleanLike } from \"./connectors/coerce.js\";\n\nexport type StateLabel = \"current\" | \"historical\" | \"transition\";\n\nexport interface StateViewChain {\n  predecessorId: string;\n  successorId: string;\n  supersededAt?: string;\n  /** #2859 — namespace scope; a chain link never crosses namespaces. */\n  namespace?: string;\n}\n\nexport interface StateViewResult {\n  id?: string;\n  docid?: string;\n  status?: string;\n  /** #2859 — namespace that owns this row; qualifies every chain identity. */\n  namespace?: string;\n  /** #2859 — back-pointer: id of the row this one replaced. */\n  supersedes?: string;\n  supersededBy?: string;\n  supersededAt?: string;\n  /** #2859 — fact validity start (frontmatter `valid_at`). */\n  validAt?: string;\n  /** #2859 — fact validity end (frontmatter `invalid_at`). */\n  invalidAt?: string;\n  stateLabel?: StateLabel;\n}\n\nexport const DEFAULT_RECALL_STATE_VIEWS = false;\n\nconst CHANGE_WORDS = [\"switch\", \"switches\", \"switched\", \"switching\", \"change\", \"changes\", \"changed\", \"changing\"];\n\n// Phrase matches are token-bounded: \"when Didi\" must not fire the\n// \"when did\" phrase, and \"confused to\" must not fire \"used to\".\nconst CHANGE_PHRASE_RE = /\\bwhen\\s+did\\b|\\bused\\s+to\\b/;\nconst CHANGE_WORD_RE = new RegExp(`\\\\b(?:${CHANGE_WORDS.join(\"|\")})\\\\b`);\n// Bare \"before\"/\"after\" are ordinary sequencing (\"before lunch\",\n// \"after install\"). They carry change intent only when they point at a\n// specific event through a determiner (\"before the move\", \"after the\n// cutover\").\nconst EVENT_POINTER_RE = /\\b(?:before|after)\\s+(?:the|a|an|this|that|these|those)\\b/;\n\nexport function parseRecallStateViews(raw: unknown): boolean {\n  return coerceBooleanLike(raw, \"recallStateViews\") === true;\n}\n\nexport function isChangeOrientedQuery(query: string): boolean {\n  const lower = query.toLowerCase();\n  return CHANGE_PHRASE_RE.test(lower) || CHANGE_WORD_RE.test(lower) || EVENT_POINTER_RE.test(lower);\n}\n\nexport function shouldWidenSuperseded(\n  successorId: string | undefined,\n  candidateIds: ReadonlySet<string>,\n): boolean {\n  return typeof successorId === \"string\" && successorId.length > 0 && candidateIds.has(successorId);\n}\n\nexport function formatSupersededPrefix(date: string, successorId: string): string {\n  return `[superseded ${date} by ${successorId}]`;\n}\n\nexport function resultStateViewId(result: StateViewResult): string {\n  return result.id ?? result.docid ?? \"\";\n}\n\n/**\n * #2859 — namespace-qualified chain identity. Namespace fanout can surface\n * the same id from two namespaces; every successor/admission match runs on\n * `namespace\\0id` keys so a row in one namespace can never anchor (or be\n * anchored by) an identically-named row in another.\n */\nexport function stateViewKey(namespace: string | undefined, id: string): string {\n  return `${typeof namespace === \"string\" ? namespace : \"\"}\\u0000${id}`;\n}\n\nexport function resultStateViewKey(result: StateViewResult): string {\n  const id = resultStateViewId(result);\n  return id ? stateViewKey(result.namespace, id) : \"\";\n}\n\n/** Inverse of {@link stateViewKey}: the id after the namespace separator. */\nfunction stateViewIdFromKey(key: string): string {\n  const sep = key.indexOf(\"\\u0000\");\n  return sep === -1 ? key : key.slice(sep + 1);\n}\n\n/**\n * predecessorKey → successorKey, namespace-qualified. Precedence: explicit\n * chains, then successor rows' `supersedes` back-pointers (#2859 — derives\n * the reverse chain when the predecessor lacks `supersededBy`), then the\n * predecessor's own `supersededBy` (authoritative when present).\n */\nfunction buildSuccessorMap(\n  results: readonly StateViewResult[],\n  chains: readonly StateViewChain[],\n): Map<string, string> {\n  const byPred = new Map<string, string>();\n  const link = (predKey: string, succKey: string, overwrite: boolean): void => {\n    if (!predKey || !succKey) return;\n    if (overwrite || !byPred.has(predKey)) byPred.set(predKey, succKey);\n  };\n  for (const chain of chains) {\n    if (chain.predecessorId && chain.successorId) {\n      link(\n        stateViewKey(chain.namespace, chain.predecessorId),\n        stateViewKey(chain.namespace, chain.successorId),\n        false,\n      );\n    }\n  }\n  for (const result of results) {\n    const key = resultStateViewKey(result);\n    if (key && result.supersedes) {\n      link(stateViewKey(result.namespace, result.supersedes), key, false);\n    }\n  }\n  for (const result of results) {\n    const key = resultStateViewKey(result);\n    if (key && result.supersededBy) {\n      link(key, stateViewKey(result.namespace, result.supersededBy), true);\n    }\n  }\n  return byPred;\n}\n\nfunction successorLinkOf(\n  result: StateViewResult,\n  byPred: ReadonlyMap<string, string>,\n): { superseded: boolean; successorKey: string | undefined } {\n  const key = resultStateViewKey(result);\n  return {\n    superseded:\n      result.status === \"superseded\" ||\n      Boolean(result.supersededBy) ||\n      byPred.has(key),\n    successorKey: result.supersededBy\n      ? stateViewKey(result.namespace, result.supersededBy)\n      : byPred.get(key),\n  };\n}\n\nfunction labelFor(\n  key: string,\n  result: StateViewResult,\n  byPred: Map<string, string>,\n  admittedIds: ReadonlySet<string>,\n  asOfMs: number | null,\n): StateLabel {\n  const { successorKey } = successorLinkOf(result, byPred);\n  const isPred = shouldWidenSuperseded(successorKey, admittedIds);\n  let isSucc = false;\n  for (const [predId, succId] of byPred) {\n    if (succId === key && admittedIds.has(predId)) {\n      isSucc = true;\n      break;\n    }\n  }\n  if (isPred && isSucc) return \"transition\";\n  if (isPred) return \"historical\";\n  if (isSucc) return \"current\";\n  if (result.status === \"superseded\") {\n    // #1952 asOf mode: the successor is legitimately absent under the\n    // historical pin (a linked successor takes the pair branches above).\n    // The row was the live fact at the snapshot when the temporal\n    // validity boundary postdates the pin (\"current\" relative to the\n    // snapshot); already replaced at the pin is \"historical\". #2859: the\n    // boundary is the fact's validity flip — `invalidAt` (the supersession\n    // pipeline sets it to the successor's valid_at) — not the\n    // `supersededAt` write time; legacy rows without a window fall back\n    // to supersededAt.\n    return asOfMs === null ? \"historical\" : snapshotStateLabel(result, asOfMs);\n  }\n  return \"current\";\n}\n\nfunction snapshotStateLabel(result: StateViewResult, asOfMs: number): StateLabel {\n  const invalidAtMs = Date.parse(result.invalidAt ?? \"\");\n  const boundaryMs = Number.isFinite(invalidAtMs)\n    ? invalidAtMs\n    : Date.parse(result.supersededAt ?? \"\");\n  return Number.isFinite(boundaryMs) && boundaryMs <= asOfMs ? \"historical\" : \"current\";\n}\n\nexport function annotateStateView<T extends StateViewResult>(\n  results: T[],\n  query: string,\n  chains: readonly StateViewChain[],\n  options: { enabled?: boolean; asOfMs?: number; changeIntent?: boolean } = {},\n): T[] {\n  const enabled = options.enabled === true;\n  // #2893 — changeIntent:true marks intent as already classified from the\n  // ORIGINAL prompt; `query` may be cron-normalized (intent signal\n  // truncated or stop-worded away) and must not be re-checked then.\n  if (!enabled || (options.changeIntent !== true && !isChangeOrientedQuery(query))) return results;\n  // #1952 asOf mode: under a historical pin the pipeline's isValidAsOf\n  // gate already decided validity at the pinned instant, so a predecessor\n  // must not be discarded merely because its successor is absent under\n  // the same filter. A valid asOf result is never emptied here.\n  const asOfMs =\n    typeof options.asOfMs === \"number\" && Number.isFinite(options.asOfMs)\n      ? options.asOfMs\n      : null;\n\n  const byPred = buildSuccessorMap(results, chains);\n  const candidateIds = new Set<string>();\n  for (const result of results) {\n    const key = resultStateViewKey(result);\n    if (key) candidateIds.add(key);\n  }\n  let admitted: T[];\n  if (asOfMs !== null) {\n    admitted = results.slice();\n  } else {\n    admitted = [];\n    for (const result of results) {\n      const { superseded, successorKey } = successorLinkOf(result, byPred);\n      if (!superseded || shouldWidenSuperseded(successorKey, candidateIds)) {\n        admitted.push(result);\n      }\n    }\n\n    // #1952 contract: superseded never appears without its successor. A\n    // successor can itself be dropped (filtered elsewhere, or transitively\n    // orphaned), so reconcile to a fixpoint instead of trusting the first pass.\n    let admittedIds = new Set(admitted.map(resultStateViewKey).filter(Boolean));\n    for (let changed = true; changed; ) {\n      changed = false;\n      for (let i = admitted.length - 1; i >= 0; i -= 1) {\n        const row = admitted[i]!;\n        const { superseded, successorKey } = successorLinkOf(row, byPred);\n        if (superseded && !shouldWidenSuperseded(successorKey, admittedIds)) {\n          admitted.splice(i, 1);\n          changed = true;\n        }\n      }\n      if (changed) admittedIds = new Set(admitted.map(resultStateViewKey).filter(Boolean));\n    }\n  }\n\n  const admittedIds = new Set(admitted.map(resultStateViewKey).filter(Boolean));\n  return admitted.map((result) => {\n    const key = resultStateViewKey(result);\n    const { successorKey } = successorLinkOf(result, byPred);\n    const stateLabel = labelFor(key, result, byPred, admittedIds, asOfMs);\n    if (result.supersededBy || !successorKey) return { ...result, stateLabel };\n    return { ...result, stateLabel, supersededBy: stateViewIdFromKey(successorKey) };\n  });\n}\n\n/**\n * #2859 — drop superseded rows whose successor is not in the pool BEFORE\n * the user cap/MMR runs, so post-cap orphan removal can never underfill\n * the result set. Reconciles to a fixpoint (a dropped successor orphans\n * its own predecessors). Rows with no successor links pass through in\n * order. ponytail: repeated full-pool passes are O(n²) on one long chain;\n * recall pools stay small, memoize per-key if pools ever grow.\n */\nexport function reconcileStateViewPairs<T extends StateViewResult>(results: readonly T[]): T[] {\n  const byPred = buildSuccessorMap(results, []);\n  let kept = results.slice();\n  for (let changed = true; changed; ) {\n    changed = false;\n    const keptKeys = new Set(kept.map(resultStateViewKey).filter(Boolean));\n    const next: T[] = [];\n    for (const row of kept) {\n      const { superseded, successorKey } = successorLinkOf(row, byPred);\n      if (superseded && !shouldWidenSuperseded(successorKey, keptKeys)) {\n        changed = true;\n        continue;\n      }\n      next.push(row);\n    }\n    if (changed) kept = next;\n  }\n  return kept;\n}\n\n/**\n * #2859 — packet-counting cap. A predecessor/successor chain admitted\n * together is ONE complete evidence packet: it consumes a single slot of\n * the user cap, and the slice never splits a packet at the boundary (no\n * underfill from post-cap orphan removal). Rows keep their incoming\n * (MMR) order; packets are ordered by first appearance. Call\n * reconcileStateViewPairs first so orphans never consume a slot.\n */\nexport function capStateViewPackets<T extends StateViewResult>(\n  ordered: readonly T[],\n  limit: number,\n): T[] {\n  const safeLimit =\n    typeof limit === \"number\" && Number.isFinite(limit) ? Math.max(0, Math.floor(limit)) : 0;\n  if (safeLimit === 0) return [];\n  if (ordered.length === 0) return [];\n\n  const byPred = buildSuccessorMap(ordered, []);\n  // Union-find over row keys; blank-key rows become per-index singletons.\n  const parent = new Map<string, string>();\n  const root = (key: string): string => {\n    let current = key;\n    for (;;) {\n      const up = parent.get(current);\n      if (up === undefined || up === current) {\n        parent.set(current, current);\n        return current;\n      }\n      current = up;\n    }\n  };\n  const union = (a: string, b: string): void => {\n    const ra = root(a);\n    const rb = root(b);\n    if (ra !== rb) parent.set(ra, rb);\n  };\n  const keys: string[] = [];\n  const keyToIndex = new Map<string, number>();\n  for (let i = 0; i < ordered.length; i += 1) {\n    // ponytail: blank-key rows must stay distinct singletons; index-keyed.\n    const key = resultStateViewKey(ordered[i]!) || `#idx${i}`;\n    keys.push(key);\n    if (!parent.has(key)) parent.set(key, key);\n    const first = keyToIndex.get(key);\n    if (first !== undefined) union(keys[first]!, key);\n    else keyToIndex.set(key, i);\n  }\n  for (const [predKey, succKey] of byPred) {\n    const predIdx = keyToIndex.get(predKey);\n    const succIdx = keyToIndex.get(succKey);\n    if (predIdx !== undefined && succIdx !== undefined) union(keys[predIdx]!, keys[succIdx]!);\n  }\n  // Packets ordered by first appearance; admit whole packets until the cap.\n  const selectedRoots = new Set<string>();\n  for (let i = 0; i < ordered.length && selectedRoots.size < safeLimit; i += 1) {\n    selectedRoots.add(root(keys[i]!));\n  }\n  const selected: T[] = [];\n  for (let i = 0; i < ordered.length; i += 1) {\n    if (selectedRoots.has(root(keys[i]!))) selected.push(ordered[i]!);\n  }\n  return selected;\n}\n"],"mappings":";;;;;AA+CO,IAAM,6BAA6B;AAE1C,IAAM,eAAe,CAAC,UAAU,YAAY,YAAY,aAAa,UAAU,WAAW,WAAW,UAAU;AAI/G,IAAM,mBAAmB;AACzB,IAAM,iBAAiB,IAAI,OAAO,SAAS,aAAa,KAAK,GAAG,CAAC,MAAM;AAKvE,IAAM,mBAAmB;AAElB,SAAS,sBAAsB,KAAuB;AAC3D,SAAO,kBAAkB,KAAK,kBAAkB,MAAM;AACxD;AAEO,SAAS,sBAAsB,OAAwB;AAC5D,QAAM,QAAQ,MAAM,YAAY;AAChC,SAAO,iBAAiB,KAAK,KAAK,KAAK,eAAe,KAAK,KAAK,KAAK,iBAAiB,KAAK,KAAK;AAClG;AAEO,SAAS,sBACd,aACA,cACS;AACT,SAAO,OAAO,gBAAgB,YAAY,YAAY,SAAS,KAAK,aAAa,IAAI,WAAW;AAClG;AAEO,SAAS,uBAAuB,MAAc,aAA6B;AAChF,SAAO,eAAe,IAAI,OAAO,WAAW;AAC9C;AAEO,SAAS,kBAAkB,QAAiC;AACjE,SAAO,OAAO,MAAM,OAAO,SAAS;AACtC;AAQO,SAAS,aAAa,WAA+B,IAAoB;AAC9E,SAAO,GAAG,OAAO,cAAc,WAAW,YAAY,EAAE,KAAS,EAAE;AACrE;AAEO,SAAS,mBAAmB,QAAiC;AAClE,QAAM,KAAK,kBAAkB,MAAM;AACnC,SAAO,KAAK,aAAa,OAAO,WAAW,EAAE,IAAI;AACnD;AAGA,SAAS,mBAAmB,KAAqB;AAC/C,QAAM,MAAM,IAAI,QAAQ,IAAQ;AAChC,SAAO,QAAQ,KAAK,MAAM,IAAI,MAAM,MAAM,CAAC;AAC7C;AAQA,SAAS,kBACP,SACA,QACqB;AACrB,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,OAAO,CAAC,SAAiB,SAAiB,cAA6B;AAC3E,QAAI,CAAC,WAAW,CAAC,QAAS;AAC1B,QAAI,aAAa,CAAC,OAAO,IAAI,OAAO,EAAG,QAAO,IAAI,SAAS,OAAO;AAAA,EACpE;AACA,aAAW,SAAS,QAAQ;AAC1B,QAAI,MAAM,iBAAiB,MAAM,aAAa;AAC5C;AAAA,QACE,aAAa,MAAM,WAAW,MAAM,aAAa;AAAA,QACjD,aAAa,MAAM,WAAW,MAAM,WAAW;AAAA,QAC/C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,mBAAmB,MAAM;AACrC,QAAI,OAAO,OAAO,YAAY;AAC5B,WAAK,aAAa,OAAO,WAAW,OAAO,UAAU,GAAG,KAAK,KAAK;AAAA,IACpE;AAAA,EACF;AACA,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,mBAAmB,MAAM;AACrC,QAAI,OAAO,OAAO,cAAc;AAC9B,WAAK,KAAK,aAAa,OAAO,WAAW,OAAO,YAAY,GAAG,IAAI;AAAA,IACrE;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gBACP,QACA,QAC2D;AAC3D,QAAM,MAAM,mBAAmB,MAAM;AACrC,SAAO;AAAA,IACL,YACE,OAAO,WAAW,gBAClB,QAAQ,OAAO,YAAY,KAC3B,OAAO,IAAI,GAAG;AAAA,IAChB,cAAc,OAAO,eACjB,aAAa,OAAO,WAAW,OAAO,YAAY,IAClD,OAAO,IAAI,GAAG;AAAA,EACpB;AACF;AAEA,SAAS,SACP,KACA,QACA,QACA,aACA,QACY;AACZ,QAAM,EAAE,aAAa,IAAI,gBAAgB,QAAQ,MAAM;AACvD,QAAM,SAAS,sBAAsB,cAAc,WAAW;AAC9D,MAAI,SAAS;AACb,aAAW,CAAC,QAAQ,MAAM,KAAK,QAAQ;AACrC,QAAI,WAAW,OAAO,YAAY,IAAI,MAAM,GAAG;AAC7C,eAAS;AACT;AAAA,IACF;AAAA,EACF;AACA,MAAI,UAAU,OAAQ,QAAO;AAC7B,MAAI,OAAQ,QAAO;AACnB,MAAI,OAAQ,QAAO;AACnB,MAAI,OAAO,WAAW,cAAc;AAUlC,WAAO,WAAW,OAAO,eAAe,mBAAmB,QAAQ,MAAM;AAAA,EAC3E;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,QAAyB,QAA4B;AAC/E,QAAM,cAAc,KAAK,MAAM,OAAO,aAAa,EAAE;AACrD,QAAM,aAAa,OAAO,SAAS,WAAW,IAC1C,cACA,KAAK,MAAM,OAAO,gBAAgB,EAAE;AACxC,SAAO,OAAO,SAAS,UAAU,KAAK,cAAc,SAAS,eAAe;AAC9E;AAEO,SAAS,kBACd,SACA,OACA,QACA,UAA0E,CAAC,GACtE;AACL,QAAM,UAAU,QAAQ,YAAY;AAIpC,MAAI,CAAC,WAAY,QAAQ,iBAAiB,QAAQ,CAAC,sBAAsB,KAAK,EAAI,QAAO;AAKzF,QAAM,SACJ,OAAO,QAAQ,WAAW,YAAY,OAAO,SAAS,QAAQ,MAAM,IAChE,QAAQ,SACR;AAEN,QAAM,SAAS,kBAAkB,SAAS,MAAM;AAChD,QAAM,eAAe,oBAAI,IAAY;AACrC,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,mBAAmB,MAAM;AACrC,QAAI,IAAK,cAAa,IAAI,GAAG;AAAA,EAC/B;AACA,MAAI;AACJ,MAAI,WAAW,MAAM;AACnB,eAAW,QAAQ,MAAM;AAAA,EAC3B,OAAO;AACL,eAAW,CAAC;AACZ,eAAW,UAAU,SAAS;AAC5B,YAAM,EAAE,YAAY,aAAa,IAAI,gBAAgB,QAAQ,MAAM;AACnE,UAAI,CAAC,cAAc,sBAAsB,cAAc,YAAY,GAAG;AACpE,iBAAS,KAAK,MAAM;AAAA,MACtB;AAAA,IACF;AAKA,QAAIA,eAAc,IAAI,IAAI,SAAS,IAAI,kBAAkB,EAAE,OAAO,OAAO,CAAC;AAC1E,aAAS,UAAU,MAAM,WAAW;AAClC,gBAAU;AACV,eAAS,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;AAChD,cAAM,MAAM,SAAS,CAAC;AACtB,cAAM,EAAE,YAAY,aAAa,IAAI,gBAAgB,KAAK,MAAM;AAChE,YAAI,cAAc,CAAC,sBAAsB,cAAcA,YAAW,GAAG;AACnE,mBAAS,OAAO,GAAG,CAAC;AACpB,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,UAAI,QAAS,CAAAA,eAAc,IAAI,IAAI,SAAS,IAAI,kBAAkB,EAAE,OAAO,OAAO,CAAC;AAAA,IACrF;AAAA,EACF;AAEA,QAAM,cAAc,IAAI,IAAI,SAAS,IAAI,kBAAkB,EAAE,OAAO,OAAO,CAAC;AAC5E,SAAO,SAAS,IAAI,CAAC,WAAW;AAC9B,UAAM,MAAM,mBAAmB,MAAM;AACrC,UAAM,EAAE,aAAa,IAAI,gBAAgB,QAAQ,MAAM;AACvD,UAAM,aAAa,SAAS,KAAK,QAAQ,QAAQ,aAAa,MAAM;AACpE,QAAI,OAAO,gBAAgB,CAAC,aAAc,QAAO,EAAE,GAAG,QAAQ,WAAW;AACzE,WAAO,EAAE,GAAG,QAAQ,YAAY,cAAc,mBAAmB,YAAY,EAAE;AAAA,EACjF,CAAC;AACH;AAUO,SAAS,wBAAmD,SAA4B;AAC7F,QAAM,SAAS,kBAAkB,SAAS,CAAC,CAAC;AAC5C,MAAI,OAAO,QAAQ,MAAM;AACzB,WAAS,UAAU,MAAM,WAAW;AAClC,cAAU;AACV,UAAM,WAAW,IAAI,IAAI,KAAK,IAAI,kBAAkB,EAAE,OAAO,OAAO,CAAC;AACrE,UAAM,OAAY,CAAC;AACnB,eAAW,OAAO,MAAM;AACtB,YAAM,EAAE,YAAY,aAAa,IAAI,gBAAgB,KAAK,MAAM;AAChE,UAAI,cAAc,CAAC,sBAAsB,cAAc,QAAQ,GAAG;AAChE,kBAAU;AACV;AAAA,MACF;AACA,WAAK,KAAK,GAAG;AAAA,IACf;AACA,QAAI,QAAS,QAAO;AAAA,EACtB;AACA,SAAO;AACT;AAUO,SAAS,oBACd,SACA,OACK;AACL,QAAM,YACJ,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC,IAAI;AACzF,MAAI,cAAc,EAAG,QAAO,CAAC;AAC7B,MAAI,QAAQ,WAAW,EAAG,QAAO,CAAC;AAElC,QAAM,SAAS,kBAAkB,SAAS,CAAC,CAAC;AAE5C,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,OAAO,CAAC,QAAwB;AACpC,QAAI,UAAU;AACd,eAAS;AACP,YAAM,KAAK,OAAO,IAAI,OAAO;AAC7B,UAAI,OAAO,UAAa,OAAO,SAAS;AACtC,eAAO,IAAI,SAAS,OAAO;AAC3B,eAAO;AAAA,MACT;AACA,gBAAU;AAAA,IACZ;AAAA,EACF;AACA,QAAM,QAAQ,CAAC,GAAW,MAAoB;AAC5C,UAAM,KAAK,KAAK,CAAC;AACjB,UAAM,KAAK,KAAK,CAAC;AACjB,QAAI,OAAO,GAAI,QAAO,IAAI,IAAI,EAAE;AAAA,EAClC;AACA,QAAM,OAAiB,CAAC;AACxB,QAAM,aAAa,oBAAI,IAAoB;AAC3C,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;AAE1C,UAAM,MAAM,mBAAmB,QAAQ,CAAC,CAAE,KAAK,OAAO,CAAC;AACvD,SAAK,KAAK,GAAG;AACb,QAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,GAAG;AACzC,UAAM,QAAQ,WAAW,IAAI,GAAG;AAChC,QAAI,UAAU,OAAW,OAAM,KAAK,KAAK,GAAI,GAAG;AAAA,QAC3C,YAAW,IAAI,KAAK,CAAC;AAAA,EAC5B;AACA,aAAW,CAAC,SAAS,OAAO,KAAK,QAAQ;AACvC,UAAM,UAAU,WAAW,IAAI,OAAO;AACtC,UAAM,UAAU,WAAW,IAAI,OAAO;AACtC,QAAI,YAAY,UAAa,YAAY,OAAW,OAAM,KAAK,OAAO,GAAI,KAAK,OAAO,CAAE;AAAA,EAC1F;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AACtC,WAAS,IAAI,GAAG,IAAI,QAAQ,UAAU,cAAc,OAAO,WAAW,KAAK,GAAG;AAC5E,kBAAc,IAAI,KAAK,KAAK,CAAC,CAAE,CAAC;AAAA,EAClC;AACA,QAAM,WAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;AAC1C,QAAI,cAAc,IAAI,KAAK,KAAK,CAAC,CAAE,CAAC,EAAG,UAAS,KAAK,QAAQ,CAAC,CAAE;AAAA,EAClE;AACA,SAAO;AACT;","names":["admittedIds"]}
+{"version":3,"sources":["../src/recall-state-view.ts"],"sourcesContent":["/**\n * Recall state views (issue #1952).\n *\n * Config key: `recallStateViews` (default false). When false, annotateStateView\n * is identity: same array reference, no `stateLabel`. config.ts is at its\n * fileSizeGrandfather ceiling, so parseConfig wiring waits for a later PR.\n * Call `parseRecallStateViews` at the recall seam when that lands.\n *\n * Change-intent morphology lives here (do not grow intent.ts). A superseded\n * memory is admitted only when its successor is also in the candidate set.\n *\n * #2859 — chain identities are namespace-qualified (`namespace\\0id`): the\n * same id in two namespaces never cross-anchors. The reverse chain derives\n * from the successor's `supersedes` back-pointer when a predecessor lacks\n * `supersededBy`, and asOf snapshot labels use the temporal validity\n * boundary (predecessor `invalidAt` / successor `validAt`), not the\n * `supersededAt` write time.\n */\nimport { coerceBooleanLike } from \"./connectors/coerce.js\";\n\nexport type StateLabel = \"current\" | \"historical\" | \"transition\";\n\nexport interface StateViewChain {\n  predecessorId: string;\n  successorId: string;\n  supersededAt?: string;\n  /** #2859 — namespace scope; a chain link never crosses namespaces. */\n  namespace?: string;\n}\n\nexport interface StateViewResult {\n  id?: string;\n  docid?: string;\n  status?: string;\n  /** #2859 — namespace that owns this row; qualifies every chain identity. */\n  namespace?: string;\n  /** #2859 — back-pointer: id of the row this one replaced. */\n  supersedes?: string;\n  supersededBy?: string;\n  supersededAt?: string;\n  /** #2859 — fact validity start (frontmatter `valid_at`). */\n  validAt?: string;\n  /** #2859 — fact validity end (frontmatter `invalid_at`). */\n  invalidAt?: string;\n  stateLabel?: StateLabel;\n}\n\nexport const DEFAULT_RECALL_STATE_VIEWS = false;\n\nconst CHANGE_WORDS = [\"switch\", \"switches\", \"switched\", \"switching\", \"change\", \"changes\", \"changed\", \"changing\"];\n\n// Phrase matches are token-bounded: \"when Didi\" must not fire the\n// \"when did\" phrase, and \"confused to\" must not fire \"used to\".\nconst CHANGE_PHRASE_RE = /\\bwhen\\s+did\\b|\\bused\\s+to\\b/;\nconst CHANGE_WORD_RE = new RegExp(`\\\\b(?:${CHANGE_WORDS.join(\"|\")})\\\\b`);\n// Bare \"before\"/\"after\" are ordinary sequencing (\"before lunch\",\n// \"after install\"). They carry change intent only when they point at a\n// specific event through a determiner (\"before the move\", \"after the\n// cutover\").\nconst EVENT_POINTER_RE = /\\b(?:before|after)\\s+(?:the|a|an|this|that|these|those)\\b/;\n\nexport function parseRecallStateViews(raw: unknown): boolean {\n  return coerceBooleanLike(raw, \"recallStateViews\") === true;\n}\n\nexport function isChangeOrientedQuery(query: string): boolean {\n  const lower = query.toLowerCase();\n  return CHANGE_PHRASE_RE.test(lower) || CHANGE_WORD_RE.test(lower) || EVENT_POINTER_RE.test(lower);\n}\n\nexport function shouldWidenSuperseded(\n  successorId: string | undefined,\n  candidateIds: ReadonlySet<string>,\n): boolean {\n  return typeof successorId === \"string\" && successorId.length > 0 && candidateIds.has(successorId);\n}\n\nexport function formatSupersededPrefix(date: string, successorId: string): string {\n  return `[superseded ${date} by ${successorId}]`;\n}\n\nexport function resultStateViewId(result: StateViewResult): string {\n  return result.id ?? result.docid ?? \"\";\n}\n\n/**\n * #2859 — namespace-qualified chain identity. Namespace fanout can surface\n * the same id from two namespaces; every successor/admission match runs on\n * `namespace\\0id` keys so a row in one namespace can never anchor (or be\n * anchored by) an identically-named row in another.\n */\nexport function stateViewKey(namespace: string | undefined, id: string): string {\n  return `${typeof namespace === \"string\" ? namespace : \"\"}\\u0000${id}`;\n}\n\nexport function resultStateViewKey(result: StateViewResult): string {\n  const id = resultStateViewId(result);\n  return id ? stateViewKey(result.namespace, id) : \"\";\n}\n\n/** Inverse of {@link stateViewKey}: the id after the namespace separator. */\nfunction stateViewIdFromKey(key: string): string {\n  const sep = key.indexOf(\"\\u0000\");\n  return sep === -1 ? key : key.slice(sep + 1);\n}\n\n/**\n * predecessorKey → successorKey, namespace-qualified. Precedence: explicit\n * chains, then successor rows' `supersedes` back-pointers (#2859 — derives\n * the reverse chain when the predecessor lacks `supersededBy`), then the\n * predecessor's own `supersededBy` (authoritative when present).\n */\nfunction buildSuccessorMap(\n  results: readonly StateViewResult[],\n  chains: readonly StateViewChain[],\n): Map<string, string> {\n  const byPred = new Map<string, string>();\n  const link = (predKey: string, succKey: string, overwrite: boolean): void => {\n    if (!predKey || !succKey) return;\n    if (overwrite || !byPred.has(predKey)) byPred.set(predKey, succKey);\n  };\n  for (const chain of chains) {\n    if (chain.predecessorId && chain.successorId) {\n      link(\n        stateViewKey(chain.namespace, chain.predecessorId),\n        stateViewKey(chain.namespace, chain.successorId),\n        false,\n      );\n    }\n  }\n  for (const result of results) {\n    const key = resultStateViewKey(result);\n    if (key && result.supersedes) {\n      link(stateViewKey(result.namespace, result.supersedes), key, false);\n    }\n  }\n  for (const result of results) {\n    const key = resultStateViewKey(result);\n    if (key && result.supersededBy) {\n      link(key, stateViewKey(result.namespace, result.supersededBy), true);\n    }\n  }\n  return byPred;\n}\n\nfunction successorLinkOf(\n  result: StateViewResult,\n  byPred: ReadonlyMap<string, string>,\n): { superseded: boolean; successorKey: string | undefined } {\n  const key = resultStateViewKey(result);\n  return {\n    superseded:\n      result.status === \"superseded\" ||\n      Boolean(result.supersededBy) ||\n      byPred.has(key),\n    successorKey: result.supersededBy\n      ? stateViewKey(result.namespace, result.supersededBy)\n      : byPred.get(key),\n  };\n}\n\nfunction labelFor(\n  key: string,\n  result: StateViewResult,\n  byPred: Map<string, string>,\n  admittedIds: ReadonlySet<string>,\n  asOfMs: number | null,\n): StateLabel {\n  const { successorKey } = successorLinkOf(result, byPred);\n  const isPred = shouldWidenSuperseded(successorKey, admittedIds);\n  let isSucc = false;\n  for (const [predId, succId] of byPred) {\n    if (succId === key && admittedIds.has(predId)) {\n      isSucc = true;\n      break;\n    }\n  }\n  if (isPred && isSucc) return \"transition\";\n  if (isPred) return \"historical\";\n  if (isSucc) return \"current\";\n  if (result.status === \"superseded\") {\n    // #1952 asOf mode: the successor is legitimately absent under the\n    // historical pin (a linked successor takes the pair branches above).\n    // The row was the live fact at the snapshot when the temporal\n    // validity boundary postdates the pin (\"current\" relative to the\n    // snapshot); already replaced at the pin is \"historical\". #2859: the\n    // boundary is the fact's validity flip — `invalidAt` (the supersession\n    // pipeline sets it to the successor's valid_at) — not the\n    // `supersededAt` write time; legacy rows without a window fall back\n    // to supersededAt.\n    return asOfMs === null ? \"historical\" : snapshotStateLabel(result, asOfMs);\n  }\n  return \"current\";\n}\n\nfunction snapshotStateLabel(result: StateViewResult, asOfMs: number): StateLabel {\n  const invalidAtMs = Date.parse(result.invalidAt ?? \"\");\n  const boundaryMs = Number.isFinite(invalidAtMs)\n    ? invalidAtMs\n    : Date.parse(result.supersededAt ?? \"\");\n  return Number.isFinite(boundaryMs) && boundaryMs <= asOfMs ? \"historical\" : \"current\";\n}\n\nexport function annotateStateView<T extends StateViewResult>(\n  results: T[],\n  query: string,\n  chains: readonly StateViewChain[],\n  options: { enabled?: boolean; asOfMs?: number; changeIntent?: boolean } = {},\n): T[] {\n  const enabled = options.enabled === true;\n  // #2893 — changeIntent:true marks intent as already classified from the\n  // ORIGINAL prompt; `query` may be cron-normalized (intent signal\n  // truncated or stop-worded away) and must not be re-checked then.\n  if (!enabled || (options.changeIntent !== true && !isChangeOrientedQuery(query))) return results;\n  // #1952 asOf mode: under a historical pin the pipeline's isValidAsOf\n  // gate already decided validity at the pinned instant, so a predecessor\n  // must not be discarded merely because its successor is absent under\n  // the same filter. A valid asOf result is never emptied here.\n  const asOfMs =\n    typeof options.asOfMs === \"number\" && Number.isFinite(options.asOfMs)\n      ? options.asOfMs\n      : null;\n\n  const byPred = buildSuccessorMap(results, chains);\n  const candidateIds = new Set<string>();\n  for (const result of results) {\n    const key = resultStateViewKey(result);\n    if (key) candidateIds.add(key);\n  }\n  let admitted: T[];\n  if (asOfMs !== null) {\n    admitted = results.slice();\n  } else {\n    admitted = [];\n    for (const result of results) {\n      const { superseded, successorKey } = successorLinkOf(result, byPred);\n      if (!superseded || shouldWidenSuperseded(successorKey, candidateIds)) {\n        admitted.push(result);\n      }\n    }\n\n    // #1952 contract: superseded never appears without its successor. A\n    // successor can itself be dropped (filtered elsewhere, or transitively\n    // orphaned), so reconcile to a fixpoint instead of trusting the first pass.\n    let admittedIds = new Set(admitted.map(resultStateViewKey).filter(Boolean));\n    for (let changed = true; changed; ) {\n      changed = false;\n      for (let i = admitted.length - 1; i >= 0; i -= 1) {\n        const row = admitted[i]!;\n        const { superseded, successorKey } = successorLinkOf(row, byPred);\n        if (superseded && !shouldWidenSuperseded(successorKey, admittedIds)) {\n          admitted.splice(i, 1);\n          changed = true;\n        }\n      }\n      if (changed) admittedIds = new Set(admitted.map(resultStateViewKey).filter(Boolean));\n    }\n  }\n\n  const admittedIds = new Set(admitted.map(resultStateViewKey).filter(Boolean));\n  return admitted.map((result) => {\n    const key = resultStateViewKey(result);\n    const { successorKey } = successorLinkOf(result, byPred);\n    const stateLabel = labelFor(key, result, byPred, admittedIds, asOfMs);\n    if (result.supersededBy || !successorKey) return { ...result, stateLabel };\n    return { ...result, stateLabel, supersededBy: stateViewIdFromKey(successorKey) };\n  });\n}\n\n/**\n * #2859 — drop superseded rows whose successor is not in the pool BEFORE\n * the user cap/MMR runs, so post-cap orphan removal can never underfill\n * the result set. Reconciles to a fixpoint (a dropped successor orphans\n * its own predecessors). Rows with no successor links pass through in\n * order. ponytail: repeated full-pool passes are O(n²) on one long chain;\n * recall pools stay small, memoize per-key if pools ever grow.\n */\nexport function reconcileStateViewPairs<T extends StateViewResult>(results: readonly T[]): T[] {\n  const byPred = buildSuccessorMap(results, []);\n  let kept = results.slice();\n  for (let changed = true; changed; ) {\n    changed = false;\n    const keptKeys = new Set(kept.map(resultStateViewKey).filter(Boolean));\n    const next: T[] = [];\n    for (const row of kept) {\n      const { superseded, successorKey } = successorLinkOf(row, byPred);\n      if (superseded && !shouldWidenSuperseded(successorKey, keptKeys)) {\n        changed = true;\n        continue;\n      }\n      next.push(row);\n    }\n    if (changed) kept = next;\n  }\n  return kept;\n}\n\n/**\n * #2928 — per-row packet root keys for the final output budget. Runs the\n * same namespace-qualified union-find as {@link capStateViewPackets}:\n * every row of one evidence packet shares the root key, so a downstream\n * budget that admits one row of the packet can admit them all or none.\n * Blank-key rows get unique per-index roots (distinct singletons).\n */\nexport function stateViewPacketKeys<T extends StateViewResult>(\n  ordered: readonly T[],\n): string[] {\n  const byPred = buildSuccessorMap(ordered, []);\n  // Union-find over row keys; blank-key rows become per-index singletons.\n  const parent = new Map<string, string>();\n  const root = (key: string): string => {\n    let current = key;\n    for (;;) {\n      const up = parent.get(current);\n      if (up === undefined || up === current) {\n        parent.set(current, current);\n        return current;\n      }\n      current = up;\n    }\n  };\n  const union = (a: string, b: string): void => {\n    const ra = root(a);\n    const rb = root(b);\n    if (ra !== rb) parent.set(ra, rb);\n  };\n  const keys: string[] = [];\n  const keyToIndex = new Map<string, number>();\n  for (let i = 0; i < ordered.length; i += 1) {\n    // ponytail: blank-key rows must stay distinct singletons; index-keyed.\n    const key = resultStateViewKey(ordered[i]!) || `#idx${i}`;\n    keys.push(key);\n    if (!parent.has(key)) parent.set(key, key);\n    const first = keyToIndex.get(key);\n    if (first !== undefined) union(keys[first]!, key);\n    else keyToIndex.set(key, i);\n  }\n  for (const [predKey, succKey] of byPred) {\n    const predIdx = keyToIndex.get(predKey);\n    const succIdx = keyToIndex.get(succKey);\n    if (predIdx !== undefined && succIdx !== undefined) union(keys[predIdx]!, keys[succIdx]!);\n  }\n  return keys.map((key) => root(key));\n}\n\n/**\n * #2859 — packet-counting cap. A predecessor/successor chain admitted\n * together is ONE complete evidence packet: it consumes a single slot of\n * the user cap, and the slice never splits a packet at the boundary (no\n * underfill from post-cap orphan removal). Rows keep their incoming\n * (MMR) order; packets are ordered by first appearance. Call\n * reconcileStateViewPairs first so orphans never consume a slot.\n */\nexport function capStateViewPackets<T extends StateViewResult>(\n  ordered: readonly T[],\n  limit: number,\n): T[] {\n  const safeLimit =\n    typeof limit === \"number\" && Number.isFinite(limit) ? Math.max(0, Math.floor(limit)) : 0;\n  if (safeLimit === 0) return [];\n  if (ordered.length === 0) return [];\n\n  const keys = stateViewPacketKeys(ordered);\n  // Packets ordered by first appearance; admit whole packets until the cap.\n  const selectedRoots = new Set<string>();\n  for (let i = 0; i < ordered.length && selectedRoots.size < safeLimit; i += 1) {\n    selectedRoots.add(keys[i]!);\n  }\n  const selected: T[] = [];\n  for (let i = 0; i < ordered.length; i += 1) {\n    if (selectedRoots.has(keys[i]!)) selected.push(ordered[i]!);\n  }\n  return selected;\n}\n"],"mappings":";;;;;AA+CO,IAAM,6BAA6B;AAE1C,IAAM,eAAe,CAAC,UAAU,YAAY,YAAY,aAAa,UAAU,WAAW,WAAW,UAAU;AAI/G,IAAM,mBAAmB;AACzB,IAAM,iBAAiB,IAAI,OAAO,SAAS,aAAa,KAAK,GAAG,CAAC,MAAM;AAKvE,IAAM,mBAAmB;AAElB,SAAS,sBAAsB,KAAuB;AAC3D,SAAO,kBAAkB,KAAK,kBAAkB,MAAM;AACxD;AAEO,SAAS,sBAAsB,OAAwB;AAC5D,QAAM,QAAQ,MAAM,YAAY;AAChC,SAAO,iBAAiB,KAAK,KAAK,KAAK,eAAe,KAAK,KAAK,KAAK,iBAAiB,KAAK,KAAK;AAClG;AAEO,SAAS,sBACd,aACA,cACS;AACT,SAAO,OAAO,gBAAgB,YAAY,YAAY,SAAS,KAAK,aAAa,IAAI,WAAW;AAClG;AAEO,SAAS,uBAAuB,MAAc,aAA6B;AAChF,SAAO,eAAe,IAAI,OAAO,WAAW;AAC9C;AAEO,SAAS,kBAAkB,QAAiC;AACjE,SAAO,OAAO,MAAM,OAAO,SAAS;AACtC;AAQO,SAAS,aAAa,WAA+B,IAAoB;AAC9E,SAAO,GAAG,OAAO,cAAc,WAAW,YAAY,EAAE,KAAS,EAAE;AACrE;AAEO,SAAS,mBAAmB,QAAiC;AAClE,QAAM,KAAK,kBAAkB,MAAM;AACnC,SAAO,KAAK,aAAa,OAAO,WAAW,EAAE,IAAI;AACnD;AAGA,SAAS,mBAAmB,KAAqB;AAC/C,QAAM,MAAM,IAAI,QAAQ,IAAQ;AAChC,SAAO,QAAQ,KAAK,MAAM,IAAI,MAAM,MAAM,CAAC;AAC7C;AAQA,SAAS,kBACP,SACA,QACqB;AACrB,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,OAAO,CAAC,SAAiB,SAAiB,cAA6B;AAC3E,QAAI,CAAC,WAAW,CAAC,QAAS;AAC1B,QAAI,aAAa,CAAC,OAAO,IAAI,OAAO,EAAG,QAAO,IAAI,SAAS,OAAO;AAAA,EACpE;AACA,aAAW,SAAS,QAAQ;AAC1B,QAAI,MAAM,iBAAiB,MAAM,aAAa;AAC5C;AAAA,QACE,aAAa,MAAM,WAAW,MAAM,aAAa;AAAA,QACjD,aAAa,MAAM,WAAW,MAAM,WAAW;AAAA,QAC/C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,mBAAmB,MAAM;AACrC,QAAI,OAAO,OAAO,YAAY;AAC5B,WAAK,aAAa,OAAO,WAAW,OAAO,UAAU,GAAG,KAAK,KAAK;AAAA,IACpE;AAAA,EACF;AACA,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,mBAAmB,MAAM;AACrC,QAAI,OAAO,OAAO,cAAc;AAC9B,WAAK,KAAK,aAAa,OAAO,WAAW,OAAO,YAAY,GAAG,IAAI;AAAA,IACrE;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gBACP,QACA,QAC2D;AAC3D,QAAM,MAAM,mBAAmB,MAAM;AACrC,SAAO;AAAA,IACL,YACE,OAAO,WAAW,gBAClB,QAAQ,OAAO,YAAY,KAC3B,OAAO,IAAI,GAAG;AAAA,IAChB,cAAc,OAAO,eACjB,aAAa,OAAO,WAAW,OAAO,YAAY,IAClD,OAAO,IAAI,GAAG;AAAA,EACpB;AACF;AAEA,SAAS,SACP,KACA,QACA,QACA,aACA,QACY;AACZ,QAAM,EAAE,aAAa,IAAI,gBAAgB,QAAQ,MAAM;AACvD,QAAM,SAAS,sBAAsB,cAAc,WAAW;AAC9D,MAAI,SAAS;AACb,aAAW,CAAC,QAAQ,MAAM,KAAK,QAAQ;AACrC,QAAI,WAAW,OAAO,YAAY,IAAI,MAAM,GAAG;AAC7C,eAAS;AACT;AAAA,IACF;AAAA,EACF;AACA,MAAI,UAAU,OAAQ,QAAO;AAC7B,MAAI,OAAQ,QAAO;AACnB,MAAI,OAAQ,QAAO;AACnB,MAAI,OAAO,WAAW,cAAc;AAUlC,WAAO,WAAW,OAAO,eAAe,mBAAmB,QAAQ,MAAM;AAAA,EAC3E;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,QAAyB,QAA4B;AAC/E,QAAM,cAAc,KAAK,MAAM,OAAO,aAAa,EAAE;AACrD,QAAM,aAAa,OAAO,SAAS,WAAW,IAC1C,cACA,KAAK,MAAM,OAAO,gBAAgB,EAAE;AACxC,SAAO,OAAO,SAAS,UAAU,KAAK,cAAc,SAAS,eAAe;AAC9E;AAEO,SAAS,kBACd,SACA,OACA,QACA,UAA0E,CAAC,GACtE;AACL,QAAM,UAAU,QAAQ,YAAY;AAIpC,MAAI,CAAC,WAAY,QAAQ,iBAAiB,QAAQ,CAAC,sBAAsB,KAAK,EAAI,QAAO;AAKzF,QAAM,SACJ,OAAO,QAAQ,WAAW,YAAY,OAAO,SAAS,QAAQ,MAAM,IAChE,QAAQ,SACR;AAEN,QAAM,SAAS,kBAAkB,SAAS,MAAM;AAChD,QAAM,eAAe,oBAAI,IAAY;AACrC,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,mBAAmB,MAAM;AACrC,QAAI,IAAK,cAAa,IAAI,GAAG;AAAA,EAC/B;AACA,MAAI;AACJ,MAAI,WAAW,MAAM;AACnB,eAAW,QAAQ,MAAM;AAAA,EAC3B,OAAO;AACL,eAAW,CAAC;AACZ,eAAW,UAAU,SAAS;AAC5B,YAAM,EAAE,YAAY,aAAa,IAAI,gBAAgB,QAAQ,MAAM;AACnE,UAAI,CAAC,cAAc,sBAAsB,cAAc,YAAY,GAAG;AACpE,iBAAS,KAAK,MAAM;AAAA,MACtB;AAAA,IACF;AAKA,QAAIA,eAAc,IAAI,IAAI,SAAS,IAAI,kBAAkB,EAAE,OAAO,OAAO,CAAC;AAC1E,aAAS,UAAU,MAAM,WAAW;AAClC,gBAAU;AACV,eAAS,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;AAChD,cAAM,MAAM,SAAS,CAAC;AACtB,cAAM,EAAE,YAAY,aAAa,IAAI,gBAAgB,KAAK,MAAM;AAChE,YAAI,cAAc,CAAC,sBAAsB,cAAcA,YAAW,GAAG;AACnE,mBAAS,OAAO,GAAG,CAAC;AACpB,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,UAAI,QAAS,CAAAA,eAAc,IAAI,IAAI,SAAS,IAAI,kBAAkB,EAAE,OAAO,OAAO,CAAC;AAAA,IACrF;AAAA,EACF;AAEA,QAAM,cAAc,IAAI,IAAI,SAAS,IAAI,kBAAkB,EAAE,OAAO,OAAO,CAAC;AAC5E,SAAO,SAAS,IAAI,CAAC,WAAW;AAC9B,UAAM,MAAM,mBAAmB,MAAM;AACrC,UAAM,EAAE,aAAa,IAAI,gBAAgB,QAAQ,MAAM;AACvD,UAAM,aAAa,SAAS,KAAK,QAAQ,QAAQ,aAAa,MAAM;AACpE,QAAI,OAAO,gBAAgB,CAAC,aAAc,QAAO,EAAE,GAAG,QAAQ,WAAW;AACzE,WAAO,EAAE,GAAG,QAAQ,YAAY,cAAc,mBAAmB,YAAY,EAAE;AAAA,EACjF,CAAC;AACH;AAUO,SAAS,wBAAmD,SAA4B;AAC7F,QAAM,SAAS,kBAAkB,SAAS,CAAC,CAAC;AAC5C,MAAI,OAAO,QAAQ,MAAM;AACzB,WAAS,UAAU,MAAM,WAAW;AAClC,cAAU;AACV,UAAM,WAAW,IAAI,IAAI,KAAK,IAAI,kBAAkB,EAAE,OAAO,OAAO,CAAC;AACrE,UAAM,OAAY,CAAC;AACnB,eAAW,OAAO,MAAM;AACtB,YAAM,EAAE,YAAY,aAAa,IAAI,gBAAgB,KAAK,MAAM;AAChE,UAAI,cAAc,CAAC,sBAAsB,cAAc,QAAQ,GAAG;AAChE,kBAAU;AACV;AAAA,MACF;AACA,WAAK,KAAK,GAAG;AAAA,IACf;AACA,QAAI,QAAS,QAAO;AAAA,EACtB;AACA,SAAO;AACT;AASO,SAAS,oBACd,SACU;AACV,QAAM,SAAS,kBAAkB,SAAS,CAAC,CAAC;AAE5C,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,OAAO,CAAC,QAAwB;AACpC,QAAI,UAAU;AACd,eAAS;AACP,YAAM,KAAK,OAAO,IAAI,OAAO;AAC7B,UAAI,OAAO,UAAa,OAAO,SAAS;AACtC,eAAO,IAAI,SAAS,OAAO;AAC3B,eAAO;AAAA,MACT;AACA,gBAAU;AAAA,IACZ;AAAA,EACF;AACA,QAAM,QAAQ,CAAC,GAAW,MAAoB;AAC5C,UAAM,KAAK,KAAK,CAAC;AACjB,UAAM,KAAK,KAAK,CAAC;AACjB,QAAI,OAAO,GAAI,QAAO,IAAI,IAAI,EAAE;AAAA,EAClC;AACA,QAAM,OAAiB,CAAC;AACxB,QAAM,aAAa,oBAAI,IAAoB;AAC3C,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;AAE1C,UAAM,MAAM,mBAAmB,QAAQ,CAAC,CAAE,KAAK,OAAO,CAAC;AACvD,SAAK,KAAK,GAAG;AACb,QAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,GAAG;AACzC,UAAM,QAAQ,WAAW,IAAI,GAAG;AAChC,QAAI,UAAU,OAAW,OAAM,KAAK,KAAK,GAAI,GAAG;AAAA,QAC3C,YAAW,IAAI,KAAK,CAAC;AAAA,EAC5B;AACA,aAAW,CAAC,SAAS,OAAO,KAAK,QAAQ;AACvC,UAAM,UAAU,WAAW,IAAI,OAAO;AACtC,UAAM,UAAU,WAAW,IAAI,OAAO;AACtC,QAAI,YAAY,UAAa,YAAY,OAAW,OAAM,KAAK,OAAO,GAAI,KAAK,OAAO,CAAE;AAAA,EAC1F;AACA,SAAO,KAAK,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC;AACpC;AAUO,SAAS,oBACd,SACA,OACK;AACL,QAAM,YACJ,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC,IAAI;AACzF,MAAI,cAAc,EAAG,QAAO,CAAC;AAC7B,MAAI,QAAQ,WAAW,EAAG,QAAO,CAAC;AAElC,QAAM,OAAO,oBAAoB,OAAO;AAExC,QAAM,gBAAgB,oBAAI,IAAY;AACtC,WAAS,IAAI,GAAG,IAAI,QAAQ,UAAU,cAAc,OAAO,WAAW,KAAK,GAAG;AAC5E,kBAAc,IAAI,KAAK,CAAC,CAAE;AAAA,EAC5B;AACA,QAAM,WAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;AAC1C,QAAI,cAAc,IAAI,KAAK,CAAC,CAAE,EAAG,UAAS,KAAK,QAAQ,CAAC,CAAE;AAAA,EAC5D;AACA,SAAO;AACT;","names":["admittedIds"]}

package/dist/{chunk-RJQAP333.js → chunk-ETE3SGAH.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-7T4TOGMS.js";
 import {
   defineOperation
-} from "./chunk-SFHLQPBF.js";
+} from "./chunk-IUTYNDFS.js";
 
 // src/external-wiki-access.ts
 import { z } from "zod";
@@ -26,4 +26,4 @@ var externalWikiSearchOperation = defineOperation({
 export {
   externalWikiSearchOperation
 };
-//# sourceMappingURL=chunk-RJQAP333.js.map
+//# sourceMappingURL=chunk-ETE3SGAH.js.map

package/dist/{chunk-YNDLCWXS.js → chunk-EZ25VE3G.js}

@@ -1,9 +1,9 @@
-import {
-  diffGraphSnapshots
-} from "./chunk-AUDJPF4N.js";
 import {
   graphSnapshotFromMemoryDir
 } from "./chunk-44442YCH.js";
+import {
+  diffGraphSnapshots
+} from "./chunk-AUDJPF4N.js";
 
 // src/dashboard-runtime.ts
 import { createHash, timingSafeEqual } from "crypto";
@@ -370,4 +370,4 @@ var GraphDashboardServer = class {
 export {
   GraphDashboardServer
 };
-//# sourceMappingURL=chunk-YNDLCWXS.js.map
+//# sourceMappingURL=chunk-EZ25VE3G.js.map

package/dist/{chunk-RLU2Y5GV.js → chunk-F2FJTOV6.js}

@@ -1,15 +1,15 @@
 import {
   applyRecallStateViews
-} from "./chunk-DFVSJFHK.js";
+} from "./chunk-DBB5JPSL.js";
 import {
   isGenericRecallExcludedPath
-} from "./chunk-NVVZPBKI.js";
+} from "./chunk-46FVFU7S.js";
 import {
   shouldFilterSupersededFromRecall
 } from "./chunk-5WITETWU.js";
 import {
   isChangeOrientedQuery
-} from "./chunk-NETQXOPY.js";
+} from "./chunk-EH3HNCAM.js";
 
 // src/recall-state-view-admission.ts
 function resolveRecallStateViewActive(options, config, query) {
@@ -69,4 +69,4 @@ export {
   filterRecentScanMemoriesForStateView,
   indexStateViewAnnotatedResults
 };
-//# sourceMappingURL=chunk-RLU2Y5GV.js.map
+//# sourceMappingURL=chunk-F2FJTOV6.js.map

package/dist/{chunk-V2ZA4YWE.js → chunk-F5H6YG5P.js}

@@ -1,6 +1,6 @@
 import {
   formatSupersededPrefix
-} from "./chunk-NETQXOPY.js";
+} from "./chunk-EH3HNCAM.js";
 
 // src/recall-state-view-render.ts
 function renderStateViewLine(result, options = {}) {
@@ -17,4 +17,4 @@ function renderStateViewLine(result, options = {}) {
 export {
   renderStateViewLine
 };
-//# sourceMappingURL=chunk-V2ZA4YWE.js.map
+//# sourceMappingURL=chunk-F5H6YG5P.js.map

package/dist/{chunk-K75A5XWU.js → chunk-F6PTJLEM.js}

@@ -5,12 +5,12 @@ import {
 import {
   buildCompressionGuidelinesMarkdown
 } from "./chunk-OD4FM2U7.js";
-import {
-  parseQmdExplain
-} from "./chunk-KG2OOAFF.js";
 import {
   resolveLifecycleState
 } from "./chunk-TBBDFYXW.js";
+import {
+  parseQmdExplain
+} from "./chunk-KG2OOAFF.js";
 import {
   parseFlexibleIsoTimestamp
 } from "./chunk-P7FMDTKL.js";
@@ -645,4 +645,4 @@ export {
   appendMemoryToGraphContext,
   resolvePersistedMemoryRelativePath
 };
-//# sourceMappingURL=chunk-K75A5XWU.js.map
+//# sourceMappingURL=chunk-F6PTJLEM.js.map