@remnic/core 10.0.96 → 10.0.98

package/dist/{chunk-KE3JWIZK.js → chunk-6RW5TONS.js}

@@ -1,12 +1,12 @@
 import {
   rebuildMemoryLifecycleLedger
-} from "./chunk-3VWU3KF3.js";
+} from "./chunk-6VAIFSDG.js";
 import {
   PROJECTION_REBUILD_RUNNER_FLAG
-} from "./chunk-4HK7DYOL.js";
+} from "./chunk-CCQEANCY.js";
 import {
   startLocationAutoSync
-} from "./chunk-EJ23D4JG.js";
+} from "./chunk-ECC6AAEE.js";
 import {
   ensureContradictionScanCron,
   ensureDaySummaryCron,
@@ -21,14 +21,14 @@ import {
   isIsoWeekId,
   msUntilNextIsoWeek,
   previousIsoWeekId
-} from "./chunk-NX4XDDFQ.js";
+} from "./chunk-E3YHIAO3.js";
 import {
   planNamespaceMaintenance,
   runNamespaceMaintenanceBatchPlan
-} from "./chunk-5AJIGWY4.js";
+} from "./chunk-FHQ5SPMD.js";
 import {
   rebuildMemoryProjection
-} from "./chunk-B7L4ZYFY.js";
+} from "./chunk-KI7E3N6Q.js";
 import {
   LocalLlmClient
 } from "./chunk-33C4BK7I.js";
@@ -2874,4 +2874,4 @@ export {
   ActivitySyncScheduler,
   MaintenanceScheduler
 };
-//# sourceMappingURL=chunk-KE3JWIZK.js.map
+//# sourceMappingURL=chunk-6RW5TONS.js.map

package/dist/{chunk-3VWU3KF3.js → chunk-6VAIFSDG.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-KJTKLXTH.js";
 import {
   StorageManager
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   assertInjectedStorageRooted
 } from "./chunk-BNZAR6PO.js";
@@ -260,4 +260,4 @@ export {
   backupExistingLedger,
   rebuildMemoryLifecycleLedger
 };
-//# sourceMappingURL=chunk-3VWU3KF3.js.map
+//# sourceMappingURL=chunk-6VAIFSDG.js.map

package/dist/{chunk-NT772J7I.js → chunk-A2D5WZRO.js}

@@ -1,6 +1,6 @@
 import {
   runPostConsolidationMaterialize
-} from "./chunk-XPCUKWLE.js";
+} from "./chunk-3DQZ2GAY.js";
 import {
   discoverMemoryExtensions,
   renderExtensionsBlock,
@@ -220,4 +220,4 @@ export {
   buildExtensionsBlockForConsolidation,
   materializeAfterSemanticConsolidation
 };
-//# sourceMappingURL=chunk-NT772J7I.js.map
+//# sourceMappingURL=chunk-A2D5WZRO.js.map

package/dist/{chunk-IBKGQ6EY.js → chunk-B2BMTXIF.js}

@@ -10,7 +10,7 @@ import {
 } from "./chunk-GZFKCLRC.js";
 import {
   StorageManager
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   normalizeEntityName
 } from "./chunk-YXZG5TVN.js";
@@ -974,4 +974,4 @@ export {
   resolveBriefingSaveDir,
   briefingFilename
 };
-//# sourceMappingURL=chunk-IBKGQ6EY.js.map
+//# sourceMappingURL=chunk-B2BMTXIF.js.map

package/dist/{chunk-WVIWDMFB.js → chunk-BUOP3DOK.js}

@@ -413,7 +413,11 @@ var NamespaceSearchAbortError = class extends Error {
 };
 function awaitWithAbort(operation, signal) {
   if (!signal) return operation;
-  if (signal.aborted) return Promise.reject(new NamespaceSearchAbortError());
+  if (signal.aborted) {
+    operation.catch(() => {
+    });
+    return Promise.reject(new NamespaceSearchAbortError());
+  }
   return new Promise((resolve, reject) => {
     const onAbort = () => {
       signal.removeEventListener("abort", onAbort);
@@ -568,4 +572,4 @@ export {
   normalizeQmdResultPath,
   resolveNamespaceResultPath
 };
-//# sourceMappingURL=chunk-WVIWDMFB.js.map
+//# sourceMappingURL=chunk-BUOP3DOK.js.map

package/dist/{chunk-WVIWDMFB.js.map → chunk-BUOP3DOK.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/namespaces/search.ts"],"sourcesContent":["import { resolveNamespaceCapabilities } from \"../capabilities.js\";\nimport path from \"node:path\";\nimport { realpathSync } from \"node:fs\";\nimport type { PluginConfig, QmdSearchResult } from \"../types.js\";\nimport type {\n  SearchBackend,\n  SearchExecutionOptions,\n  SearchQueryOptions,\n} from \"../search/port.js\";\nimport { reportSearchDegradation } from \"../search/port.js\";\nimport { createSearchBackend } from \"../search/factory.js\";\nimport { namespaceIdentityToken, normalizeNamespaceIdentity } from \"./identity.js\";\nimport { ALL_CATEGORY_DIRS } from \"../utils/category-dir.js\";\n\nconst NESTED_NAMESPACE_FILTER_OVERFETCH_FACTOR = 4;\nconst NESTED_NAMESPACE_FILTER_OVERFETCH_MIN = 50;\n\n// Short TTL so repeated health polls skip a full QMD re-probe (~1.5s).\nconst HEALTH_RESULT_CACHE_TTL_MS = 10_000;\n\n// Each cross-namespace search leg gets this budget; a stalled backend leg\n// degrades its own namespace instead of holding the whole search (#3139).\nexport const NAMESPACE_SEARCH_LEG_TIMEOUT_MS = 25_000;\n\nexport function namespaceCollectionName(\n  baseCollection: string,\n  namespace: string,\n  options?: {\n    defaultNamespace?: string;\n    useLegacyDefaultCollection?: boolean;\n  },\n): string {\n  const trimmed = normalizeNamespaceIdentity(namespace);\n  const defaultNamespace = normalizeNamespaceIdentity(options?.defaultNamespace ?? \"\") || \"default\";\n  if (\n    options?.useLegacyDefaultCollection === true &&\n    trimmed === defaultNamespace\n  ) {\n    return baseCollection;\n  }\n\n  return `${baseCollection}--${namespaceIdentityToken(trimmed || defaultNamespace)}`;\n}\n\ntype StorageRouterLike = {\n  storageFor(namespace: string): Promise<{ dir: string }>;\n};\n\ntype NamespaceBackendRecord = {\n  backend: SearchBackend;\n  collection: string;\n  memoryDir: string;\n  available: boolean;\n  collectionState: CollectionState;\n  filtersNestedNamespaces: boolean;\n  disposed: boolean;\n};\n\nexport interface NamespaceUpdateResult {\n  backendCount: number;\n  eligibleNamespaces: string[];\n}\n\nexport type CollectionState = \"present\" | \"missing\" | \"unknown\" | \"skipped\";\n\nexport interface NamespaceSearchHealth {\n  collection: string;\n  memoryDir: string;\n  available: boolean;\n  collectionState: CollectionState;\n  debugStatus: string;\n  installedVersion: string | null;\n  supportedVersion: string | null;\n  supported: boolean | null;\n  upgradeAvailable: boolean | null;\n  doctorAvailable: boolean | null;\n  daemonMode: boolean | null;\n  pendingEmbeddings: number | null;\n  oldestPendingAgeMs: number | null;\n  embeddingBacklogThreshold: number;\n}\n\n/** True when the pending-embedding count is above a positive backlog threshold. */\nexport function embeddingBacklogExceeds(pending: number | null, threshold: number): boolean {\n  return threshold > 0 && pending !== null && pending > threshold;\n}\n\n/**\n * The one definition of a degraded search answer. The readiness consumer\n * reports it, and `healthForNamespace` refuses to cache it.\n */\nexport function isSearchHealthDegraded(\n  health: Pick<NamespaceSearchHealth, \"available\" | \"collectionState\" | \"pendingEmbeddings\">,\n  backlogThreshold: number,\n): boolean {\n  const active = health.available && health.collectionState !== \"missing\";\n  return (\n    !active ||\n    health.collectionState === \"unknown\" ||\n    embeddingBacklogExceeds(health.pendingEmbeddings, backlogThreshold)\n  );\n}\n\ntype NamespaceScopedSearchConfig = PluginConfig & {\n  hostEmbeddingProviderScope?: string;\n};\n\ntype BackendRecordOptions = {\n  autoCreateCollection: boolean;\n  abortAsUnavailable: boolean;\n  failOpenMissingGuardedCollection: boolean;\n};\n\nexport class NamespaceSearchRouter {\n  private readonly cache = new Map<string, Promise<NamespaceBackendRecord>>();\n  private readonly healthResultCache = new Map<\n    string,\n    { expiresAt: number; value: NamespaceSearchHealth }\n  >();\n\n  private readonly pendingDisposals = new Set<Promise<void>>();\n\n  constructor(\n    private readonly config: PluginConfig,\n    private readonly storageRouter: StorageRouterLike,\n    private readonly createBackend: (config: PluginConfig) => SearchBackend = createSearchBackend,\n  ) {}\n\n  async collectionForNamespace(namespace: string): Promise<string> {\n    return (await this.backendRecordFor(namespace)).collection;\n  }\n\n  /**\n   * Resolve the search backend for a namespace (#2019). Returns `unknown` so\n   * callers (e.g. the prioritized-embed path) duck-type for capability like\n   * `embedFiles` rather than depending on a concrete QMD shape. Reuses the\n   * cached backend record, so this never re-creates a backend. Returns `null`\n   * when the namespace backend is unavailable.\n   */\n  async backendForNamespace(namespace: string): Promise<unknown> {\n    const record = await this.backendRecordFor(namespace);\n    return record.available ? record.backend : null;\n  }\n\n  async searchAcrossNamespaces(options: {\n    query: string;\n    namespaces: string[];\n    maxResults?: number;\n    mode?: \"search\" | \"hybrid\" | \"bm25\" | \"vector\";\n    searchOptions?: SearchQueryOptions;\n    execution?: SearchExecutionOptions;\n  }): Promise<QmdSearchResult[]> {\n    const query = options.query.trim();\n    if (!query) return [];\n    const maxResults = Math.max(0, Math.floor(options.maxResults ?? this.config.qmdMaxResults));\n    if (maxResults === 0) return [];\n\n    const method = options.mode ?? \"search\";\n    const namespaces = Array.from(new Set(options.namespaces.map((value) => value.trim()).filter(Boolean)));\n    if (namespaces.length === 0) return [];\n\n    const resultsByNamespace = await Promise.all(\n      namespaces.map(async (namespace) => {\n        const record = await this.backendRecordFor(namespace);\n        if (!record.available || record.collectionState === \"missing\") {\n          // A per-namespace backend that is unavailable (or missing its\n          // collection) must report like any other QMD skip (#1536): its\n          // empty contribution is otherwise indistinguishable from a true\n          // no-matches for that namespace (codex round-5 review on #1544).\n          try {\n            options.execution?.onDegradation?.({\n              backend: \"qmd\",\n              code: \"backend_unavailable\",\n              detail:\n                record.collectionState === \"missing\"\n                  ? `namespace collection missing: ${namespace}`\n                  : `namespace backend unavailable: ${namespace}`,\n            });\n          } catch {\n            // Observers must never break search.\n          }\n          return { namespace, results: [] as QmdSearchResult[] };\n        }\n        const backendLimit = backendSearchLimit(record, maxResults);\n        // One stalled backend leg must not hold the whole cross-namespace\n        // search (#3139). The backend gets the deadline signal so it cancels\n        // its own work, and the await is raced against the same budget. A leg\n        // that outlives its budget degrades only its own namespace; real\n        // backend errors and caller aborts propagate as before.\n        const legAbort = new AbortController();\n        const legTimer = setTimeout(() => legAbort.abort(), NAMESPACE_SEARCH_LEG_TIMEOUT_MS);\n        const legSignal = options.execution?.signal\n          ? AbortSignal.any([options.execution.signal, legAbort.signal])\n          : legAbort.signal;\n        const legExecution: SearchExecutionOptions = { ...options.execution, signal: legSignal };\n        let leg: Promise<QmdSearchResult[]>;\n        switch (method) {\n          case \"hybrid\":\n            leg = record.backend.hybridSearch(\n              query,\n              record.collection,\n              backendLimit,\n              legExecution,\n            );\n            break;\n          case \"bm25\":\n            leg = record.backend.bm25Search(\n              query,\n              record.collection,\n              backendLimit,\n              legExecution,\n            );\n            break;\n          case \"vector\":\n            leg = record.backend.vectorSearch(\n              query,\n              record.collection,\n              backendLimit,\n              legExecution,\n            );\n            break;\n          default:\n            leg = record.backend.search(\n              query,\n              record.collection,\n              backendLimit,\n              options.searchOptions,\n              legExecution,\n            );\n            break;\n        }\n        let results: QmdSearchResult[];\n        try {\n          results = await awaitWithAbort(leg, legSignal);\n        } catch (error) {\n          if (options.execution?.signal?.aborted || !legAbort.signal.aborted) throw error;\n          reportSearchDegradation(options.execution, {\n            backend: \"qmd\",\n            code: \"deadline_exceeded\",\n            detail: `namespace search deadline exceeded: ${namespace}`,\n          });\n          return { namespace, results: [] };\n        } finally {\n          clearTimeout(legTimer);\n        }\n        results = filterNamespaceSubtreeResults(record, results)\n          .map((result) => ({\n            ...result,\n            namespace,\n            // Resolve to an absolute path so the (namespace, path) identity is\n            // globally unique — same-relative-path hits from different namespaces\n            // stay distinct across every downstream consumer with no special\n            // handling. Display/citation surfaces relativize for portability (#2020).\n            path: resolveNamespaceResultPath(record.memoryDir, record.collection, result.path),\n          }))\n          // Reject hits whose resolved path escapes the queried namespace's\n          // storage root (#2077). A stale/corrupt per-namespace collection can\n          // return a path owned by another namespace; stamping it would let\n          // downstream scope checks (which trust the stamped namespace) and\n          // absolute-path resolution surface a foreign-namespace memory.\n          .filter((result) => resolvedPathIsInsideNamespaceRoot(record.memoryDir, result.path));\n        return { namespace, results };\n      }),\n    );\n\n    return mergeNamespaceSearchResults(resultsByNamespace, maxResults);\n  }\n\n  /**\n   * Update all namespace backends.\n   * Returns the number of backends for which an update was attempted\n   * (i.e., available and collection present).  Callers can treat 0 as a\n   * signal that no backend was eligible — useful for success-verification in\n   * startup-sync when namespacesEnabled is true.\n   */\n  async updateNamespaces(\n    namespaces: string[],\n    execution?: SearchExecutionOptions,\n    options?: { strict?: boolean; force?: boolean },\n  ): Promise<number> {\n    return (await this.updateNamespacesDetailed(namespaces, execution, options)).backendCount;\n  }\n\n  async updateNamespacesDetailed(\n    namespaces: string[],\n    execution?: SearchExecutionOptions,\n    options?: { strict?: boolean; force?: boolean },\n  ): Promise<NamespaceUpdateResult> {\n    const unique = Array.from(new Set(namespaces.map((value) => value.trim()).filter(Boolean)));\n    const eligible = (await Promise.all(\n      unique.map(async (namespace) => {\n        const record = await this.backendRecordFor(namespace);\n        return record.available && record.collectionState !== \"missing\"\n          ? { namespace, record }\n          : null;\n      }),\n    )).filter((entry): entry is { namespace: string; record: NamespaceBackendRecord } => entry !== null);\n\n    const globalEntry = eligible.find(({ record }) => record.backend.updatesAllCollections?.() === true);\n    const scopedEntries = globalEntry\n      ? eligible.filter(({ record }) => record.backend.updatesAllCollections?.() !== true)\n      : eligible;\n\n    await Promise.all([\n      globalEntry\n        ? updateBackendRecord(globalEntry.record, execution, options)\n        : Promise.resolve(),\n      ...scopedEntries.map(({ record }) => updateBackendRecord(record, execution, options)),\n    ]);\n\n    return {\n      backendCount: (globalEntry ? 1 : 0) + scopedEntries.length,\n      eligibleNamespaces: eligible.map(({ namespace }) => namespace),\n    };\n  }\n\n  async embedNamespaces(namespaces: string[], options?: { strict?: boolean }): Promise<void> {\n    const unique = Array.from(new Set(namespaces.map((value) => value.trim()).filter(Boolean)));\n    await Promise.all(\n      unique.map(async (namespace) => {\n        const record = await this.backendRecordFor(namespace);\n        if (!record.available || record.collectionState === \"missing\") return;\n        await embedBackendRecord(record, options);\n      }),\n    );\n  }\n\n  async ensureNamespaceCollection(\n    namespace: string,\n    execution?: SearchExecutionOptions,\n  ): Promise<\"present\" | \"missing\" | \"unknown\" | \"skipped\"> {\n    const record = await this.backendRecordFor(namespace, execution);\n    return record.collectionState;\n  }\n\n  async healthForNamespace(\n    namespace: string,\n    execution?: SearchExecutionOptions,\n  ): Promise<NamespaceSearchHealth> {\n    const key = namespace.trim() || this.config.defaultNamespace;\n    const cached = this.healthResultCache.get(key);\n    if (cached && cached.expiresAt > Date.now()) {\n      return { ...cached.value };\n    }\n\n    const record = await this.createBackendRecordFor(\n      key,\n      execution,\n      {\n        autoCreateCollection: false,\n        abortAsUnavailable: true,\n        failOpenMissingGuardedCollection: false,\n      },\n    );\n    try {\n      const liveRecord = await this.liveCachedRecordForHealth(key, record, execution);\n      const diagnosticBackend = liveRecord?.backend ?? record.backend;\n      const versionStatus =\n        \"getVersionStatus\" in diagnosticBackend &&\n        typeof diagnosticBackend.getVersionStatus === \"function\"\n          ? diagnosticBackend.getVersionStatus()\n          : null;\n      const daemonMode = daemonModeForBackend(diagnosticBackend);\n      const backendStatus =\n        \"status\" in diagnosticBackend &&\n        typeof diagnosticBackend.status === \"function\"\n          ? await Promise.race([\n              diagnosticBackend.status().catch(() => null),\n              new Promise<null>((resolve) => setTimeout(() => resolve(null), 5_000).unref?.()),\n            ])\n          : null;\n      const collectionState =\n        liveRecord?.collectionState === \"missing\"\n          ? \"missing\"\n          : record.collectionState;\n\n      const health: NamespaceSearchHealth = {\n        collection: record.collection,\n        memoryDir: record.memoryDir,\n        available: liveRecord?.available ?? record.available,\n        collectionState,\n        debugStatus: diagnosticBackend.debugStatus(),\n        installedVersion: versionStatus?.installedVersion ?? null,\n        supportedVersion: versionStatus?.supportedVersion ?? null,\n        supported: versionStatus?.supported ?? null,\n        upgradeAvailable: versionStatus?.upgradeAvailable ?? null,\n        doctorAvailable: versionStatus?.capabilities?.doctor ?? null,\n        daemonMode,\n        pendingEmbeddings: backendStatus?.pendingEmbeddings ?? null,\n        oldestPendingAgeMs: backendStatus?.oldestPendingAgeMs ?? null,\n        embeddingBacklogThreshold: this.config.qmdEmbeddingBacklogThreshold,\n      };\n\n      // Cache only a healthy answer that carries backlog data when the backend\n      // reports status. A degraded or incomplete answer must re-probe so a\n      // readiness poll sees recovery on the next call, not one TTL late.\n      const statusMissing = backendStatus === null && \"status\" in diagnosticBackend;\n      if (\n        execution?.signal?.aborted !== true &&\n        !statusMissing &&\n        !isSearchHealthDegraded(health, health.embeddingBacklogThreshold)\n      ) {\n        this.healthResultCache.set(key, {\n          expiresAt: Date.now() + HEALTH_RESULT_CACHE_TTL_MS,\n          value: { ...health },\n        });\n      }\n      return { ...health };\n    } finally {\n      const dispose = (record.backend as { dispose?: () => void | Promise<void> }).dispose;\n      await dispose?.call(record.backend);\n    }\n  }\n\n  private async liveCachedRecordForHealth(\n    key: string,\n    disposableRecord: NamespaceBackendRecord,\n    execution?: SearchExecutionOptions,\n  ): Promise<NamespaceBackendRecord | null> {\n    const pending = this.cache.get(key);\n    if (!pending) return null;\n    const cachedRecord = await awaitWithAbort(pending, execution?.signal).catch(() => null);\n    if (!cachedRecord) return null;\n    if (cachedRecord.collection !== disposableRecord.collection) return null;\n    if (cachedRecord.memoryDir !== disposableRecord.memoryDir) return null;\n    return cachedRecord;\n  }\n\n  private trackDisposal(promise: Promise<void>): void {\n    this.pendingDisposals.add(promise);\n    void promise.finally(() => this.pendingDisposals.delete(promise));\n  }\n\n  private async drainPendingDisposals(): Promise<void> {\n    if (this.pendingDisposals.size === 0) return;\n    await Promise.allSettled(this.pendingDisposals);\n  }\n\n  /** Clear cached backend records so the next access re-probes availability. */\n  clearCache(): void {\n    this.healthResultCache.clear();\n    const pendingRecords = Array.from(this.cache.values());\n    this.cache.clear();\n    const disposal = Promise.allSettled(pendingRecords).then(async (settled) => {\n      await Promise.allSettled(\n        settled.flatMap((entry) =>\n          entry.status === \"fulfilled\" ? [this.disposeRecord(entry.value)] : []),\n      );\n    });\n    this.trackDisposal(disposal);\n  }\n\n  private async disposeRecord(record: NamespaceBackendRecord): Promise<void> {\n    if (record.disposed) return;\n    record.disposed = true;\n    const dispose = (record.backend as { dispose?: () => void | Promise<void> }).dispose;\n    await dispose?.call(record.backend);\n  }\n\n  /** Release any per-namespace backend handles held by cached records. */\n  async dispose(): Promise<void> {\n    await this.drainPendingDisposals();\n    this.healthResultCache.clear();\n    const pendingRecords = Array.from(this.cache.values());\n    this.cache.clear();\n    const settled = await Promise.allSettled(pendingRecords);\n    await Promise.allSettled(\n      settled.flatMap((entry) =>\n        entry.status === \"fulfilled\" ? [this.disposeRecord(entry.value)] : []),\n    );\n  }\n\n  /**\n   * Disable namespace search for this runtime while retaining the resolved\n   * records as unavailable/missing. This releases concrete QMD/daemon handles\n   * without letting later reads recreate a search backend after the root path\n   * has been switched to NoopSearchBackend for a missing collection.\n   */\n  async disableSearchBackends(): Promise<void> {\n    this.healthResultCache.clear();\n    const settled = await Promise.allSettled(this.cache.values());\n    await Promise.allSettled(\n      settled.flatMap((entry) => {\n        if (entry.status !== \"fulfilled\") return [];\n        entry.value.available = false;\n        entry.value.collectionState = \"missing\";\n        return [this.disposeRecord(entry.value)];\n      }),\n    );\n  }\n\n  private async backendRecordFor(\n    namespace: string,\n    execution?: SearchExecutionOptions,\n  ): Promise<NamespaceBackendRecord> {\n    await this.drainPendingDisposals();\n    const key = namespace.trim() || this.config.defaultNamespace;\n    const existing = this.cache.get(key);\n    if (existing) return await existing;\n\n    const pending = this.createBackendRecordFor(key, execution, {\n      autoCreateCollection: true,\n      abortAsUnavailable: false,\n      failOpenMissingGuardedCollection: true,\n    }).catch((error) => {\n      this.cache.delete(key);\n      throw error;\n    });\n\n    this.cache.set(key, pending);\n    return await pending;\n  }\n\n  private async createBackendRecordFor(\n    namespace: string,\n    execution: SearchExecutionOptions | undefined,\n    options: BackendRecordOptions,\n  ): Promise<NamespaceBackendRecord> {\n    const key = namespace.trim() || this.config.defaultNamespace;\n    const storage = await this.storageRouter.storageFor(key);\n    const useLegacyDefaultCollection =\n      key === this.config.defaultNamespace && storage.dir === this.config.memoryDir;\n    const filtersNestedNamespaces =\n      resolveNamespaceCapabilities(this.config).namespaces === true && useLegacyDefaultCollection;\n    const rootHostEmbeddingScope =\n      (this.config as NamespaceScopedSearchConfig).hostEmbeddingProviderScope ??\n      this.config.memoryDir;\n    const scopedConfig: NamespaceScopedSearchConfig = {\n      ...this.config,\n      memoryDir: storage.dir,\n      hostEmbeddingProviderScope: rootHostEmbeddingScope,\n      qmdCollection: namespaceCollectionName(this.config.qmdCollection, key, {\n        defaultNamespace: this.config.defaultNamespace,\n        useLegacyDefaultCollection,\n      }),\n    };\n\n    const backend = this.createBackend(scopedConfig);\n    try {\n      const availabilityProbe =\n        options.autoCreateCollection || typeof backend.checkAvailability !== \"function\"\n          ? backend.probe(execution)\n          : backend.checkAvailability({ signal: execution?.signal });\n      const available = await awaitWithAbort(availabilityProbe, execution?.signal).catch((error) => {\n        if (error instanceof NamespaceSearchAbortError && !options.abortAsUnavailable) {\n          throw error;\n        }\n        return false;\n      });\n      const collectionState = available\n        ? await awaitWithAbort(\n          // The legacy default namespace at the flat root (`filtersNestedNamespaces`)\n          // shares its `memoryDir` with the `namespaces/` container, so its base\n          // collection is a \"broad root\" that also indexes nested-namespace files.\n          // We STILL auto-create it (issue #1929): the search side already targets\n          // this exact base collection and `filterNamespaceSubtreeResults` strips\n          // the nested `namespaces/` subtree out of its results, so index and\n          // search stay symmetric. Skipping creation left a configured default\n          // namespace (e.g. `geek`) with maintenance \"ran\" but no collection and 0\n          // recall results. `ensureCollection` is a no-op when the collection is\n          // already present, so legacy installs that pre-created the broad root are\n          // unaffected.\n          this.collectionStateForBackend(backend, storage.dir, scopedConfig.qmdCollection, {\n            autoCreate: options.autoCreateCollection,\n            failOpenMissingGuardedCollection: options.failOpenMissingGuardedCollection,\n            execution,\n          }),\n          execution?.signal,\n        ).catch((error) => {\n          if (error instanceof NamespaceSearchAbortError && !options.abortAsUnavailable) {\n            throw error;\n          }\n          return \"unknown\" as const;\n        })\n        : \"unknown\";\n      return {\n        backend,\n        collection: scopedConfig.qmdCollection,\n        memoryDir: storage.dir,\n        available,\n        collectionState,\n        filtersNestedNamespaces,\n        disposed: false,\n      };\n    } catch (error) {\n      const dispose = (backend as { dispose?: () => void | Promise<void> }).dispose;\n      if (dispose) {\n        await Promise.resolve(dispose.call(backend)).catch(() => {});\n      }\n      throw error;\n    }\n  }\n\n  private async collectionStateForBackend(\n    backend: SearchBackend,\n    memoryDir: string,\n    collection: string,\n    options: {\n      autoCreate: boolean;\n      failOpenMissingGuardedCollection: boolean;\n      execution?: SearchExecutionOptions;\n    },\n  ): Promise<CollectionState> {\n    if (!options.autoCreate) {\n      if (!backend.checkCollection) return \"unknown\";\n      const collectionState = await backend\n        .checkCollection(collection, options.execution)\n        .catch(() => \"unknown\" as const);\n      return options.failOpenMissingGuardedCollection && collectionState === \"missing\"\n        ? \"unknown\"\n        : collectionState;\n    }\n    return await backend.ensureCollection(memoryDir, collection, options.execution).catch(() => \"unknown\" as const);\n  }\n}\n\nclass NamespaceSearchAbortError extends Error {\n  constructor() {\n    super(\"operation aborted\");\n  }\n}\n\nfunction awaitWithAbort<T>(operation: Promise<T>, signal?: AbortSignal): Promise<T> {\n  if (!signal) return operation;\n  if (signal.aborted) return Promise.reject(new NamespaceSearchAbortError());\n\n  return new Promise<T>((resolve, reject) => {\n    const onAbort = () => {\n      signal.removeEventListener(\"abort\", onAbort);\n      reject(new NamespaceSearchAbortError());\n    };\n    signal.addEventListener(\"abort\", onAbort, { once: true });\n    operation.then(resolve, reject).finally(() => {\n      signal.removeEventListener(\"abort\", onAbort);\n    });\n  });\n}\n\nfunction filterNamespaceSubtreeResults(\n  record: NamespaceBackendRecord,\n  results: QmdSearchResult[],\n): QmdSearchResult[] {\n  if (!record.filtersNestedNamespaces) return results;\n  return results.filter((result) =>\n    !pathIsInsideNamespaceSubtree(record.memoryDir, record.collection, result.path)\n  );\n}\n\nfunction backendSearchLimit(\n  record: NamespaceBackendRecord,\n  maxResults: number,\n): number {\n  if (!record.filtersNestedNamespaces) return maxResults;\n  return Math.max(\n    maxResults,\n    maxResults * NESTED_NAMESPACE_FILTER_OVERFETCH_FACTOR,\n    NESTED_NAMESPACE_FILTER_OVERFETCH_MIN,\n  );\n}\n\nasync function updateBackendRecord(\n  record: NamespaceBackendRecord,\n  execution?: SearchExecutionOptions,\n  options?: { strict?: boolean; force?: boolean },\n): Promise<void> {\n  if (options?.strict === true) {\n    if (\n      // Forced refreshes must skip the throttled all-collections update: its\n      // success has to prove the current writes are indexed, which a throttle\n      // skip cannot.\n      options.force !== true &&\n      record.backend.updatesAllCollections?.() === true &&\n      typeof record.backend.updateStrict === \"function\"\n    ) {\n      await record.backend.updateStrict(execution);\n      return;\n    }\n    if (typeof record.backend.updateCollectionStrict === \"function\") {\n      await record.backend.updateCollectionStrict(record.collection, execution);\n      return;\n    }\n    // Backends with no strict variant (Orama, LanceDB, Meilisearch, remote) have a fail-open\n    // update(): it resolves when it returned early or failed. Their updateCompleted() says\n    // whether the refresh ran, so strict callers get a failure instead of a fake success.\n    const completed = await record.backend.updateCompleted?.(execution);\n    if (completed !== undefined) {\n      if (!completed) throw new Error(\"search backend update did not complete\");\n      return;\n    }\n  }\n  await record.backend.update(execution);\n}\n\nasync function embedBackendRecord(\n  record: NamespaceBackendRecord,\n  options?: { strict?: boolean },\n): Promise<void> {\n  if (options?.strict === true) {\n    if (typeof record.backend.embedCollectionStrict === \"function\") {\n      await record.backend.embedCollectionStrict(record.collection);\n      return;\n    }\n    if (typeof record.backend.embedStrict === \"function\") {\n      await record.backend.embedStrict();\n      return;\n    }\n  }\n  if (typeof record.backend.embedCollection === \"function\") {\n    await record.backend.embedCollection(record.collection);\n    return;\n  }\n  await record.backend.embed();\n}\n\nfunction daemonModeForBackend(backend: SearchBackend): boolean | null {\n  return \"isDaemonMode\" in backend && typeof backend.isDaemonMode === \"function\"\n    ? backend.isDaemonMode() === true\n    : null;\n}\n\nfunction isContainedPath(root: string, candidate: string): boolean {\n  const relative = path.relative(root, candidate);\n  return (\n    relative === \"\" ||\n    (relative !== \"..\" && !relative.startsWith(`..${path.sep}`) && !path.isAbsolute(relative))\n  );\n}\n\nfunction pathIsInsideNamespaceSubtree(\n  memoryDir: string,\n  collection: string,\n  resultPath: string | undefined,\n): boolean {\n  if (!resultPath) return false;\n  const normalizedResultPath = normalizeQmdResultPath(resultPath, collection);\n  const memoryRoot = path.resolve(memoryDir);\n  const namespacesRoot = path.join(memoryRoot, \"namespaces\");\n  const candidate = path.isAbsolute(normalizedResultPath)\n    ? path.normalize(normalizedResultPath)\n    : path.resolve(memoryRoot, normalizedResultPath);\n  return isContainedPath(namespacesRoot, candidate);\n}\n\n/**\n * Reject a QMD hit whose resolved path escapes the queried namespace's storage\n * root (#2077). `resolvedPath` is the already-resolved value produced by\n * `resolveNamespaceResultPath`; a stale/corrupt per-namespace collection can\n * yield an absolute path owned by another namespace, and stamping it with the\n * queried namespace would surface a foreign-namespace memory downstream.\n *\n * Lexical containment runs first — it is cheap and the only check possible when\n * the file is not yet on disk (a stale collection may cite a since-deleted\n * path). When both root and candidate exist, their filesystem realpaths are\n * canonicalized and re-checked so a symlink planted inside the namespace root\n * cannot resolve into another namespace or outside storage. An unresolved path\n * (ENOENT) keeps the lexical result rather than rejecting the stale-collection\n * case this guard targets.\n */\nfunction resolvedPathIsInsideNamespaceRoot(memoryDir: string, resolvedPath: string): boolean {\n  const root = path.resolve(memoryDir);\n  const candidate = path.isAbsolute(resolvedPath)\n    ? path.normalize(resolvedPath)\n    : path.resolve(root, resolvedPath);\n  if (!isContainedPath(root, candidate)) return false;\n  try {\n    return isContainedPath(realpathSync.native(root), realpathSync.native(candidate));\n  } catch {\n    return true;\n  }\n}\nexport function normalizeQmdResultPath(resultPath: string, collection: string): string {\n  let value = resultPath.trim();\n  if (value.startsWith(\"qmd://\")) {\n    try {\n      const parsed = new URL(value);\n      if (parsed.protocol === \"qmd:\" && parsed.hostname === collection) {\n        value = decodeURIComponent(parsed.pathname.replace(/^\\/+/, \"\"));\n      }\n    } catch {\n      const remainder = value.slice(\"qmd://\".length);\n      const slashIndex = remainder.indexOf(\"/\");\n      if (slashIndex !== -1) {\n        value = remainder.slice(slashIndex + 1);\n      }\n    }\n  }\n\n  // Only strip a genuine QMD collection prefix — never when the collection name\n  // collides with a memory category dir (e.g. qmdCollection == \"facts\"), or a\n  // bare \"facts/<id>.md\" hit would be corrupted to \"<id>.md\" and fail namespace\n  // reads/access tracking (#2020).\n  const collectionPrefix = `${collection}/`;\n  if (value.startsWith(collectionPrefix) && !ALL_CATEGORY_DIRS.includes(collection)) {\n    value = value.slice(collectionPrefix.length);\n  }\n  return value;\n}\nexport function resolveNamespaceResultPath(\n  memoryDir: string,\n  collection: string,\n  resultPath: string,\n): string {\n  const normalized = normalizeQmdResultPath(resultPath, collection);\n  if (path.isAbsolute(normalized)) return normalized;\n  const root = path.resolve(memoryDir);\n  const resolved = path.resolve(root, normalized);\n  const relative = path.relative(root, resolved);\n  if (relative === \"\" || relative.startsWith(\"..\") || path.isAbsolute(relative)) {\n    return resultPath;\n  }\n  return resolved;\n}\nfunction mergeNamespaceSearchResults(\n  lists: Array<{ namespace: string; results: QmdSearchResult[] }>,\n  maxResults: number,\n): QmdSearchResult[] {\n  const merged = new Map<string, QmdSearchResult>();\n\n  for (const { namespace, results } of lists) {\n    for (const result of results) {\n      const key = `${namespace}\\0${result.path || result.docid}`;\n      const existing = merged.get(key);\n      if (!existing) {\n        merged.set(key, { ...result, namespace });\n        continue;\n      }\n      if (result.score > existing.score) {\n        merged.set(key, {\n          ...result,\n          namespace,\n          snippet: existing.snippet || result.snippet || \"\",\n        });\n      }\n    }\n  }\n\n  return [...merged.values()]\n    .sort((a, b) => b.score - a.score)\n    .slice(0, maxResults);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AACA,OAAO,UAAU;AACjB,SAAS,oBAAoB;AAY7B,IAAM,2CAA2C;AACjD,IAAM,wCAAwC;AAG9C,IAAM,6BAA6B;AAI5B,IAAM,kCAAkC;AAExC,SAAS,wBACd,gBACA,WACA,SAIQ;AACR,QAAM,UAAU,2BAA2B,SAAS;AACpD,QAAM,mBAAmB,2BAA2B,SAAS,oBAAoB,EAAE,KAAK;AACxF,MACE,SAAS,+BAA+B,QACxC,YAAY,kBACZ;AACA,WAAO;AAAA,EACT;AAEA,SAAO,GAAG,cAAc,KAAK,uBAAuB,WAAW,gBAAgB,CAAC;AAClF;AAyCO,SAAS,wBAAwB,SAAwB,WAA4B;AAC1F,SAAO,YAAY,KAAK,YAAY,QAAQ,UAAU;AACxD;AAMO,SAAS,uBACd,QACA,kBACS;AACT,QAAM,SAAS,OAAO,aAAa,OAAO,oBAAoB;AAC9D,SACE,CAAC,UACD,OAAO,oBAAoB,aAC3B,wBAAwB,OAAO,mBAAmB,gBAAgB;AAEtE;AAYO,IAAM,wBAAN,MAA4B;AAAA,EASjC,YACmB,QACA,eACA,gBAAyD,qBAC1E;AAHiB;AACA;AACA;AAAA,EAChB;AAAA,EAHgB;AAAA,EACA;AAAA,EACA;AAAA,EAXF,QAAQ,oBAAI,IAA6C;AAAA,EACzD,oBAAoB,oBAAI,IAGvC;AAAA,EAEe,mBAAmB,oBAAI,IAAmB;AAAA,EAQ3D,MAAM,uBAAuB,WAAoC;AAC/D,YAAQ,MAAM,KAAK,iBAAiB,SAAS,GAAG;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,oBAAoB,WAAqC;AAC7D,UAAM,SAAS,MAAM,KAAK,iBAAiB,SAAS;AACpD,WAAO,OAAO,YAAY,OAAO,UAAU;AAAA,EAC7C;AAAA,EAEA,MAAM,uBAAuB,SAOE;AAC7B,UAAM,QAAQ,QAAQ,MAAM,KAAK;AACjC,QAAI,CAAC,MAAO,QAAO,CAAC;AACpB,UAAM,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,cAAc,KAAK,OAAO,aAAa,CAAC;AAC1F,QAAI,eAAe,EAAG,QAAO,CAAC;AAE9B,UAAM,SAAS,QAAQ,QAAQ;AAC/B,UAAM,aAAa,MAAM,KAAK,IAAI,IAAI,QAAQ,WAAW,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,EAAE,OAAO,OAAO,CAAC,CAAC;AACtG,QAAI,WAAW,WAAW,EAAG,QAAO,CAAC;AAErC,UAAM,qBAAqB,MAAM,QAAQ;AAAA,MACvC,WAAW,IAAI,OAAO,cAAc;AAClC,cAAM,SAAS,MAAM,KAAK,iBAAiB,SAAS;AACpD,YAAI,CAAC,OAAO,aAAa,OAAO,oBAAoB,WAAW;AAK7D,cAAI;AACF,oBAAQ,WAAW,gBAAgB;AAAA,cACjC,SAAS;AAAA,cACT,MAAM;AAAA,cACN,QACE,OAAO,oBAAoB,YACvB,iCAAiC,SAAS,KAC1C,kCAAkC,SAAS;AAAA,YACnD,CAAC;AAAA,UACH,QAAQ;AAAA,UAER;AACA,iBAAO,EAAE,WAAW,SAAS,CAAC,EAAuB;AAAA,QACvD;AACA,cAAM,eAAe,mBAAmB,QAAQ,UAAU;AAM1D,cAAM,WAAW,IAAI,gBAAgB;AACrC,cAAM,WAAW,WAAW,MAAM,SAAS,MAAM,GAAG,+BAA+B;AACnF,cAAM,YAAY,QAAQ,WAAW,SACjC,YAAY,IAAI,CAAC,QAAQ,UAAU,QAAQ,SAAS,MAAM,CAAC,IAC3D,SAAS;AACb,cAAM,eAAuC,EAAE,GAAG,QAAQ,WAAW,QAAQ,UAAU;AACvF,YAAI;AACJ,gBAAQ,QAAQ;AAAA,UACd,KAAK;AACH,kBAAM,OAAO,QAAQ;AAAA,cACnB;AAAA,cACA,OAAO;AAAA,cACP;AAAA,cACA;AAAA,YACF;AACA;AAAA,UACF,KAAK;AACH,kBAAM,OAAO,QAAQ;AAAA,cACnB;AAAA,cACA,OAAO;AAAA,cACP;AAAA,cACA;AAAA,YACF;AACA;AAAA,UACF,KAAK;AACH,kBAAM,OAAO,QAAQ;AAAA,cACnB;AAAA,cACA,OAAO;AAAA,cACP;AAAA,cACA;AAAA,YACF;AACA;AAAA,UACF;AACE,kBAAM,OAAO,QAAQ;AAAA,cACnB;AAAA,cACA,OAAO;AAAA,cACP;AAAA,cACA,QAAQ;AAAA,cACR;AAAA,YACF;AACA;AAAA,QACJ;AACA,YAAI;AACJ,YAAI;AACF,oBAAU,MAAM,eAAe,KAAK,SAAS;AAAA,QAC/C,SAAS,OAAO;AACd,cAAI,QAAQ,WAAW,QAAQ,WAAW,CAAC,SAAS,OAAO,QAAS,OAAM;AAC1E,kCAAwB,QAAQ,WAAW;AAAA,YACzC,SAAS;AAAA,YACT,MAAM;AAAA,YACN,QAAQ,uCAAuC,SAAS;AAAA,UAC1D,CAAC;AACD,iBAAO,EAAE,WAAW,SAAS,CAAC,EAAE;AAAA,QAClC,UAAE;AACA,uBAAa,QAAQ;AAAA,QACvB;AACA,kBAAU,8BAA8B,QAAQ,OAAO,EACpD,IAAI,CAAC,YAAY;AAAA,UAChB,GAAG;AAAA,UACH;AAAA;AAAA;AAAA;AAAA;AAAA,UAKA,MAAM,2BAA2B,OAAO,WAAW,OAAO,YAAY,OAAO,IAAI;AAAA,QACnF,EAAE,EAMD,OAAO,CAAC,WAAW,kCAAkC,OAAO,WAAW,OAAO,IAAI,CAAC;AACtF,eAAO,EAAE,WAAW,QAAQ;AAAA,MAC9B,CAAC;AAAA,IACH;AAEA,WAAO,4BAA4B,oBAAoB,UAAU;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,iBACJ,YACA,WACA,SACiB;AACjB,YAAQ,MAAM,KAAK,yBAAyB,YAAY,WAAW,OAAO,GAAG;AAAA,EAC/E;AAAA,EAEA,MAAM,yBACJ,YACA,WACA,SACgC;AAChC,UAAM,SAAS,MAAM,KAAK,IAAI,IAAI,WAAW,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,EAAE,OAAO,OAAO,CAAC,CAAC;AAC1F,UAAM,YAAY,MAAM,QAAQ;AAAA,MAC9B,OAAO,IAAI,OAAO,cAAc;AAC9B,cAAM,SAAS,MAAM,KAAK,iBAAiB,SAAS;AACpD,eAAO,OAAO,aAAa,OAAO,oBAAoB,YAClD,EAAE,WAAW,OAAO,IACpB;AAAA,MACN,CAAC;AAAA,IACH,GAAG,OAAO,CAAC,UAA0E,UAAU,IAAI;AAEnG,UAAM,cAAc,SAAS,KAAK,CAAC,EAAE,OAAO,MAAM,OAAO,QAAQ,wBAAwB,MAAM,IAAI;AACnG,UAAM,gBAAgB,cAClB,SAAS,OAAO,CAAC,EAAE,OAAO,MAAM,OAAO,QAAQ,wBAAwB,MAAM,IAAI,IACjF;AAEJ,UAAM,QAAQ,IAAI;AAAA,MAChB,cACI,oBAAoB,YAAY,QAAQ,WAAW,OAAO,IAC1D,QAAQ,QAAQ;AAAA,MACpB,GAAG,cAAc,IAAI,CAAC,EAAE,OAAO,MAAM,oBAAoB,QAAQ,WAAW,OAAO,CAAC;AAAA,IACtF,CAAC;AAED,WAAO;AAAA,MACL,eAAe,cAAc,IAAI,KAAK,cAAc;AAAA,MACpD,oBAAoB,SAAS,IAAI,CAAC,EAAE,UAAU,MAAM,SAAS;AAAA,IAC/D;AAAA,EACF;AAAA,EAEA,MAAM,gBAAgB,YAAsB,SAA+C;AACzF,UAAM,SAAS,MAAM,KAAK,IAAI,IAAI,WAAW,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,EAAE,OAAO,OAAO,CAAC,CAAC;AAC1F,UAAM,QAAQ;AAAA,MACZ,OAAO,IAAI,OAAO,cAAc;AAC9B,cAAM,SAAS,MAAM,KAAK,iBAAiB,SAAS;AACpD,YAAI,CAAC,OAAO,aAAa,OAAO,oBAAoB,UAAW;AAC/D,cAAM,mBAAmB,QAAQ,OAAO;AAAA,MAC1C,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,MAAM,0BACJ,WACA,WACwD;AACxD,UAAM,SAAS,MAAM,KAAK,iBAAiB,WAAW,SAAS;AAC/D,WAAO,OAAO;AAAA,EAChB;AAAA,EAEA,MAAM,mBACJ,WACA,WACgC;AAChC,UAAM,MAAM,UAAU,KAAK,KAAK,KAAK,OAAO;AAC5C,UAAM,SAAS,KAAK,kBAAkB,IAAI,GAAG;AAC7C,QAAI,UAAU,OAAO,YAAY,KAAK,IAAI,GAAG;AAC3C,aAAO,EAAE,GAAG,OAAO,MAAM;AAAA,IAC3B;AAEA,UAAM,SAAS,MAAM,KAAK;AAAA,MACxB;AAAA,MACA;AAAA,MACA;AAAA,QACE,sBAAsB;AAAA,QACtB,oBAAoB;AAAA,QACpB,kCAAkC;AAAA,MACpC;AAAA,IACF;AACA,QAAI;AACF,YAAM,aAAa,MAAM,KAAK,0BAA0B,KAAK,QAAQ,SAAS;AAC9E,YAAM,oBAAoB,YAAY,WAAW,OAAO;AACxD,YAAM,gBACJ,sBAAsB,qBACtB,OAAO,kBAAkB,qBAAqB,aAC1C,kBAAkB,iBAAiB,IACnC;AACN,YAAM,aAAa,qBAAqB,iBAAiB;AACzD,YAAM,gBACJ,YAAY,qBACZ,OAAO,kBAAkB,WAAW,aAChC,MAAM,QAAQ,KAAK;AAAA,QACjB,kBAAkB,OAAO,EAAE,MAAM,MAAM,IAAI;AAAA,QAC3C,IAAI,QAAc,CAAC,YAAY,WAAW,MAAM,QAAQ,IAAI,GAAG,GAAK,EAAE,QAAQ,CAAC;AAAA,MACjF,CAAC,IACD;AACN,YAAM,kBACJ,YAAY,oBAAoB,YAC5B,YACA,OAAO;AAEb,YAAM,SAAgC;AAAA,QACpC,YAAY,OAAO;AAAA,QACnB,WAAW,OAAO;AAAA,QAClB,WAAW,YAAY,aAAa,OAAO;AAAA,QAC3C;AAAA,QACA,aAAa,kBAAkB,YAAY;AAAA,QAC3C,kBAAkB,eAAe,oBAAoB;AAAA,QACrD,kBAAkB,eAAe,oBAAoB;AAAA,QACrD,WAAW,eAAe,aAAa;AAAA,QACvC,kBAAkB,eAAe,oBAAoB;AAAA,QACrD,iBAAiB,eAAe,cAAc,UAAU;AAAA,QACxD;AAAA,QACA,mBAAmB,eAAe,qBAAqB;AAAA,QACvD,oBAAoB,eAAe,sBAAsB;AAAA,QACzD,2BAA2B,KAAK,OAAO;AAAA,MACzC;AAKA,YAAM,gBAAgB,kBAAkB,QAAQ,YAAY;AAC5D,UACE,WAAW,QAAQ,YAAY,QAC/B,CAAC,iBACD,CAAC,uBAAuB,QAAQ,OAAO,yBAAyB,GAChE;AACA,aAAK,kBAAkB,IAAI,KAAK;AAAA,UAC9B,WAAW,KAAK,IAAI,IAAI;AAAA,UACxB,OAAO,EAAE,GAAG,OAAO;AAAA,QACrB,CAAC;AAAA,MACH;AACA,aAAO,EAAE,GAAG,OAAO;AAAA,IACrB,UAAE;AACA,YAAM,UAAW,OAAO,QAAqD;AAC7E,YAAM,SAAS,KAAK,OAAO,OAAO;AAAA,IACpC;AAAA,EACF;AAAA,EAEA,MAAc,0BACZ,KACA,kBACA,WACwC;AACxC,UAAM,UAAU,KAAK,MAAM,IAAI,GAAG;AAClC,QAAI,CAAC,QAAS,QAAO;AACrB,UAAM,eAAe,MAAM,eAAe,SAAS,WAAW,MAAM,EAAE,MAAM,MAAM,IAAI;AACtF,QAAI,CAAC,aAAc,QAAO;AAC1B,QAAI,aAAa,eAAe,iBAAiB,WAAY,QAAO;AACpE,QAAI,aAAa,cAAc,iBAAiB,UAAW,QAAO;AAClE,WAAO;AAAA,EACT;AAAA,EAEQ,cAAc,SAA8B;AAClD,SAAK,iBAAiB,IAAI,OAAO;AACjC,SAAK,QAAQ,QAAQ,MAAM,KAAK,iBAAiB,OAAO,OAAO,CAAC;AAAA,EAClE;AAAA,EAEA,MAAc,wBAAuC;AACnD,QAAI,KAAK,iBAAiB,SAAS,EAAG;AACtC,UAAM,QAAQ,WAAW,KAAK,gBAAgB;AAAA,EAChD;AAAA;AAAA,EAGA,aAAmB;AACjB,SAAK,kBAAkB,MAAM;AAC7B,UAAM,iBAAiB,MAAM,KAAK,KAAK,MAAM,OAAO,CAAC;AACrD,SAAK,MAAM,MAAM;AACjB,UAAM,WAAW,QAAQ,WAAW,cAAc,EAAE,KAAK,OAAO,YAAY;AAC1E,YAAM,QAAQ;AAAA,QACZ,QAAQ,QAAQ,CAAC,UACf,MAAM,WAAW,cAAc,CAAC,KAAK,cAAc,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC;AAAA,MACzE;AAAA,IACF,CAAC;AACD,SAAK,cAAc,QAAQ;AAAA,EAC7B;AAAA,EAEA,MAAc,cAAc,QAA+C;AACzE,QAAI,OAAO,SAAU;AACrB,WAAO,WAAW;AAClB,UAAM,UAAW,OAAO,QAAqD;AAC7E,UAAM,SAAS,KAAK,OAAO,OAAO;AAAA,EACpC;AAAA;AAAA,EAGA,MAAM,UAAyB;AAC7B,UAAM,KAAK,sBAAsB;AACjC,SAAK,kBAAkB,MAAM;AAC7B,UAAM,iBAAiB,MAAM,KAAK,KAAK,MAAM,OAAO,CAAC;AACrD,SAAK,MAAM,MAAM;AACjB,UAAM,UAAU,MAAM,QAAQ,WAAW,cAAc;AACvD,UAAM,QAAQ;AAAA,MACZ,QAAQ,QAAQ,CAAC,UACf,MAAM,WAAW,cAAc,CAAC,KAAK,cAAc,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC;AAAA,IACzE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,wBAAuC;AAC3C,SAAK,kBAAkB,MAAM;AAC7B,UAAM,UAAU,MAAM,QAAQ,WAAW,KAAK,MAAM,OAAO,CAAC;AAC5D,UAAM,QAAQ;AAAA,MACZ,QAAQ,QAAQ,CAAC,UAAU;AACzB,YAAI,MAAM,WAAW,YAAa,QAAO,CAAC;AAC1C,cAAM,MAAM,YAAY;AACxB,cAAM,MAAM,kBAAkB;AAC9B,eAAO,CAAC,KAAK,cAAc,MAAM,KAAK,CAAC;AAAA,MACzC,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,MAAc,iBACZ,WACA,WACiC;AACjC,UAAM,KAAK,sBAAsB;AACjC,UAAM,MAAM,UAAU,KAAK,KAAK,KAAK,OAAO;AAC5C,UAAM,WAAW,KAAK,MAAM,IAAI,GAAG;AACnC,QAAI,SAAU,QAAO,MAAM;AAE3B,UAAM,UAAU,KAAK,uBAAuB,KAAK,WAAW;AAAA,MAC1D,sBAAsB;AAAA,MACtB,oBAAoB;AAAA,MACpB,kCAAkC;AAAA,IACpC,CAAC,EAAE,MAAM,CAAC,UAAU;AAClB,WAAK,MAAM,OAAO,GAAG;AACrB,YAAM;AAAA,IACR,CAAC;AAED,SAAK,MAAM,IAAI,KAAK,OAAO;AAC3B,WAAO,MAAM;AAAA,EACf;AAAA,EAEA,MAAc,uBACZ,WACA,WACA,SACiC;AACjC,UAAM,MAAM,UAAU,KAAK,KAAK,KAAK,OAAO;AAC5C,UAAM,UAAU,MAAM,KAAK,cAAc,WAAW,GAAG;AACvD,UAAM,6BACJ,QAAQ,KAAK,OAAO,oBAAoB,QAAQ,QAAQ,KAAK,OAAO;AACtE,UAAM,0BACJ,6BAA6B,KAAK,MAAM,EAAE,eAAe,QAAQ;AACnE,UAAM,yBACH,KAAK,OAAuC,8BAC7C,KAAK,OAAO;AACd,UAAM,eAA4C;AAAA,MAChD,GAAG,KAAK;AAAA,MACR,WAAW,QAAQ;AAAA,MACnB,4BAA4B;AAAA,MAC5B,eAAe,wBAAwB,KAAK,OAAO,eAAe,KAAK;AAAA,QACrE,kBAAkB,KAAK,OAAO;AAAA,QAC9B;AAAA,MACF,CAAC;AAAA,IACH;AAEA,UAAM,UAAU,KAAK,cAAc,YAAY;AAC/C,QAAI;AACF,YAAM,oBACJ,QAAQ,wBAAwB,OAAO,QAAQ,sBAAsB,aACjE,QAAQ,MAAM,SAAS,IACvB,QAAQ,kBAAkB,EAAE,QAAQ,WAAW,OAAO,CAAC;AAC7D,YAAM,YAAY,MAAM,eAAe,mBAAmB,WAAW,MAAM,EAAE,MAAM,CAAC,UAAU;AAC5F,YAAI,iBAAiB,6BAA6B,CAAC,QAAQ,oBAAoB;AAC7E,gBAAM;AAAA,QACR;AACA,eAAO;AAAA,MACT,CAAC;AACD,YAAM,kBAAkB,YACpB,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAYN,KAAK,0BAA0B,SAAS,QAAQ,KAAK,aAAa,eAAe;AAAA,UAC/E,YAAY,QAAQ;AAAA,UACpB,kCAAkC,QAAQ;AAAA,UAC1C;AAAA,QACF,CAAC;AAAA,QACD,WAAW;AAAA,MACb,EAAE,MAAM,CAAC,UAAU;AACjB,YAAI,iBAAiB,6BAA6B,CAAC,QAAQ,oBAAoB;AAC7E,gBAAM;AAAA,QACR;AACA,eAAO;AAAA,MACT,CAAC,IACC;AACJ,aAAO;AAAA,QACL;AAAA,QACA,YAAY,aAAa;AAAA,QACzB,WAAW,QAAQ;AAAA,QACnB;AAAA,QACA;AAAA,QACA;AAAA,QACA,UAAU;AAAA,MACZ;AAAA,IACF,SAAS,OAAO;AACd,YAAM,UAAW,QAAqD;AACtE,UAAI,SAAS;AACX,cAAM,QAAQ,QAAQ,QAAQ,KAAK,OAAO,CAAC,EAAE,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MAC7D;AACA,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAc,0BACZ,SACA,WACA,YACA,SAK0B;AAC1B,QAAI,CAAC,QAAQ,YAAY;AACvB,UAAI,CAAC,QAAQ,gBAAiB,QAAO;AACrC,YAAM,kBAAkB,MAAM,QAC3B,gBAAgB,YAAY,QAAQ,SAAS,EAC7C,MAAM,MAAM,SAAkB;AACjC,aAAO,QAAQ,oCAAoC,oBAAoB,YACnE,YACA;AAAA,IACN;AACA,WAAO,MAAM,QAAQ,iBAAiB,WAAW,YAAY,QAAQ,SAAS,EAAE,MAAM,MAAM,SAAkB;AAAA,EAChH;AACF;AAEA,IAAM,4BAAN,cAAwC,MAAM;AAAA,EAC5C,cAAc;AACZ,UAAM,mBAAmB;AAAA,EAC3B;AACF;AAEA,SAAS,eAAkB,WAAuB,QAAkC;AAClF,MAAI,CAAC,OAAQ,QAAO;AACpB,MAAI,OAAO,QAAS,QAAO,QAAQ,OAAO,IAAI,0BAA0B,CAAC;AAEzE,SAAO,IAAI,QAAW,CAAC,SAAS,WAAW;AACzC,UAAM,UAAU,MAAM;AACpB,aAAO,oBAAoB,SAAS,OAAO;AAC3C,aAAO,IAAI,0BAA0B,CAAC;AAAA,IACxC;AACA,WAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AACxD,cAAU,KAAK,SAAS,MAAM,EAAE,QAAQ,MAAM;AAC5C,aAAO,oBAAoB,SAAS,OAAO;AAAA,IAC7C,CAAC;AAAA,EACH,CAAC;AACH;AAEA,SAAS,8BACP,QACA,SACmB;AACnB,MAAI,CAAC,OAAO,wBAAyB,QAAO;AAC5C,SAAO,QAAQ;AAAA,IAAO,CAAC,WACrB,CAAC,6BAA6B,OAAO,WAAW,OAAO,YAAY,OAAO,IAAI;AAAA,EAChF;AACF;AAEA,SAAS,mBACP,QACA,YACQ;AACR,MAAI,CAAC,OAAO,wBAAyB,QAAO;AAC5C,SAAO,KAAK;AAAA,IACV;AAAA,IACA,aAAa;AAAA,IACb;AAAA,EACF;AACF;AAEA,eAAe,oBACb,QACA,WACA,SACe;AACf,MAAI,SAAS,WAAW,MAAM;AAC5B;AAAA;AAAA;AAAA;AAAA,MAIE,QAAQ,UAAU,QAClB,OAAO,QAAQ,wBAAwB,MAAM,QAC7C,OAAO,OAAO,QAAQ,iBAAiB;AAAA,MACvC;AACA,YAAM,OAAO,QAAQ,aAAa,SAAS;AAC3C;AAAA,IACF;AACA,QAAI,OAAO,OAAO,QAAQ,2BAA2B,YAAY;AAC/D,YAAM,OAAO,QAAQ,uBAAuB,OAAO,YAAY,SAAS;AACxE;AAAA,IACF;AAIA,UAAM,YAAY,MAAM,OAAO,QAAQ,kBAAkB,SAAS;AAClE,QAAI,cAAc,QAAW;AAC3B,UAAI,CAAC,UAAW,OAAM,IAAI,MAAM,wCAAwC;AACxE;AAAA,IACF;AAAA,EACF;AACA,QAAM,OAAO,QAAQ,OAAO,SAAS;AACvC;AAEA,eAAe,mBACb,QACA,SACe;AACf,MAAI,SAAS,WAAW,MAAM;AAC5B,QAAI,OAAO,OAAO,QAAQ,0BAA0B,YAAY;AAC9D,YAAM,OAAO,QAAQ,sBAAsB,OAAO,UAAU;AAC5D;AAAA,IACF;AACA,QAAI,OAAO,OAAO,QAAQ,gBAAgB,YAAY;AACpD,YAAM,OAAO,QAAQ,YAAY;AACjC;AAAA,IACF;AAAA,EACF;AACA,MAAI,OAAO,OAAO,QAAQ,oBAAoB,YAAY;AACxD,UAAM,OAAO,QAAQ,gBAAgB,OAAO,UAAU;AACtD;AAAA,EACF;AACA,QAAM,OAAO,QAAQ,MAAM;AAC7B;AAEA,SAAS,qBAAqB,SAAwC;AACpE,SAAO,kBAAkB,WAAW,OAAO,QAAQ,iBAAiB,aAChE,QAAQ,aAAa,MAAM,OAC3B;AACN;AAEA,SAAS,gBAAgB,MAAc,WAA4B;AACjE,QAAM,WAAW,KAAK,SAAS,MAAM,SAAS;AAC9C,SACE,aAAa,MACZ,aAAa,QAAQ,CAAC,SAAS,WAAW,KAAK,KAAK,GAAG,EAAE,KAAK,CAAC,KAAK,WAAW,QAAQ;AAE5F;AAEA,SAAS,6BACP,WACA,YACA,YACS;AACT,MAAI,CAAC,WAAY,QAAO;AACxB,QAAM,uBAAuB,uBAAuB,YAAY,UAAU;AAC1E,QAAM,aAAa,KAAK,QAAQ,SAAS;AACzC,QAAM,iBAAiB,KAAK,KAAK,YAAY,YAAY;AACzD,QAAM,YAAY,KAAK,WAAW,oBAAoB,IAClD,KAAK,UAAU,oBAAoB,IACnC,KAAK,QAAQ,YAAY,oBAAoB;AACjD,SAAO,gBAAgB,gBAAgB,SAAS;AAClD;AAiBA,SAAS,kCAAkC,WAAmB,cAA+B;AAC3F,QAAM,OAAO,KAAK,QAAQ,SAAS;AACnC,QAAM,YAAY,KAAK,WAAW,YAAY,IAC1C,KAAK,UAAU,YAAY,IAC3B,KAAK,QAAQ,MAAM,YAAY;AACnC,MAAI,CAAC,gBAAgB,MAAM,SAAS,EAAG,QAAO;AAC9C,MAAI;AACF,WAAO,gBAAgB,aAAa,OAAO,IAAI,GAAG,aAAa,OAAO,SAAS,CAAC;AAAA,EAClF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AACO,SAAS,uBAAuB,YAAoB,YAA4B;AACrF,MAAI,QAAQ,WAAW,KAAK;AAC5B,MAAI,MAAM,WAAW,QAAQ,GAAG;AAC9B,QAAI;AACF,YAAM,SAAS,IAAI,IAAI,KAAK;AAC5B,UAAI,OAAO,aAAa,UAAU,OAAO,aAAa,YAAY;AAChE,gBAAQ,mBAAmB,OAAO,SAAS,QAAQ,QAAQ,EAAE,CAAC;AAAA,MAChE;AAAA,IACF,QAAQ;AACN,YAAM,YAAY,MAAM,MAAM,SAAS,MAAM;AAC7C,YAAM,aAAa,UAAU,QAAQ,GAAG;AACxC,UAAI,eAAe,IAAI;AACrB,gBAAQ,UAAU,MAAM,aAAa,CAAC;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAMA,QAAM,mBAAmB,GAAG,UAAU;AACtC,MAAI,MAAM,WAAW,gBAAgB,KAAK,CAAC,kBAAkB,SAAS,UAAU,GAAG;AACjF,YAAQ,MAAM,MAAM,iBAAiB,MAAM;AAAA,EAC7C;AACA,SAAO;AACT;AACO,SAAS,2BACd,WACA,YACA,YACQ;AACR,QAAM,aAAa,uBAAuB,YAAY,UAAU;AAChE,MAAI,KAAK,WAAW,UAAU,EAAG,QAAO;AACxC,QAAM,OAAO,KAAK,QAAQ,SAAS;AACnC,QAAM,WAAW,KAAK,QAAQ,MAAM,UAAU;AAC9C,QAAM,WAAW,KAAK,SAAS,MAAM,QAAQ;AAC7C,MAAI,aAAa,MAAM,SAAS,WAAW,IAAI,KAAK,KAAK,WAAW,QAAQ,GAAG;AAC7E,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACA,SAAS,4BACP,OACA,YACmB;AACnB,QAAM,SAAS,oBAAI,IAA6B;AAEhD,aAAW,EAAE,WAAW,QAAQ,KAAK,OAAO;AAC1C,eAAW,UAAU,SAAS;AAC5B,YAAM,MAAM,GAAG,SAAS,KAAK,OAAO,QAAQ,OAAO,KAAK;AACxD,YAAM,WAAW,OAAO,IAAI,GAAG;AAC/B,UAAI,CAAC,UAAU;AACb,eAAO,IAAI,KAAK,EAAE,GAAG,QAAQ,UAAU,CAAC;AACxC;AAAA,MACF;AACA,UAAI,OAAO,QAAQ,SAAS,OAAO;AACjC,eAAO,IAAI,KAAK;AAAA,UACd,GAAG;AAAA,UACH;AAAA,UACA,SAAS,SAAS,WAAW,OAAO,WAAW;AAAA,QACjD,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EACvB,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,UAAU;AACxB;","names":[]}
+{"version":3,"sources":["../src/namespaces/search.ts"],"sourcesContent":["import { resolveNamespaceCapabilities } from \"../capabilities.js\";\nimport path from \"node:path\";\nimport { realpathSync } from \"node:fs\";\nimport type { PluginConfig, QmdSearchResult } from \"../types.js\";\nimport type {\n  SearchBackend,\n  SearchExecutionOptions,\n  SearchQueryOptions,\n} from \"../search/port.js\";\nimport { reportSearchDegradation } from \"../search/port.js\";\nimport { createSearchBackend } from \"../search/factory.js\";\nimport { namespaceIdentityToken, normalizeNamespaceIdentity } from \"./identity.js\";\nimport { ALL_CATEGORY_DIRS } from \"../utils/category-dir.js\";\n\nconst NESTED_NAMESPACE_FILTER_OVERFETCH_FACTOR = 4;\nconst NESTED_NAMESPACE_FILTER_OVERFETCH_MIN = 50;\n\n// Short TTL so repeated health polls skip a full QMD re-probe (~1.5s).\nconst HEALTH_RESULT_CACHE_TTL_MS = 10_000;\n\n// Each cross-namespace search leg gets this budget; a stalled backend leg\n// degrades its own namespace instead of holding the whole search (#3139).\nexport const NAMESPACE_SEARCH_LEG_TIMEOUT_MS = 25_000;\n\nexport function namespaceCollectionName(\n  baseCollection: string,\n  namespace: string,\n  options?: {\n    defaultNamespace?: string;\n    useLegacyDefaultCollection?: boolean;\n  },\n): string {\n  const trimmed = normalizeNamespaceIdentity(namespace);\n  const defaultNamespace = normalizeNamespaceIdentity(options?.defaultNamespace ?? \"\") || \"default\";\n  if (\n    options?.useLegacyDefaultCollection === true &&\n    trimmed === defaultNamespace\n  ) {\n    return baseCollection;\n  }\n\n  return `${baseCollection}--${namespaceIdentityToken(trimmed || defaultNamespace)}`;\n}\n\ntype StorageRouterLike = {\n  storageFor(namespace: string): Promise<{ dir: string }>;\n};\n\ntype NamespaceBackendRecord = {\n  backend: SearchBackend;\n  collection: string;\n  memoryDir: string;\n  available: boolean;\n  collectionState: CollectionState;\n  filtersNestedNamespaces: boolean;\n  disposed: boolean;\n};\n\nexport interface NamespaceUpdateResult {\n  backendCount: number;\n  eligibleNamespaces: string[];\n}\n\nexport type CollectionState = \"present\" | \"missing\" | \"unknown\" | \"skipped\";\n\nexport interface NamespaceSearchHealth {\n  collection: string;\n  memoryDir: string;\n  available: boolean;\n  collectionState: CollectionState;\n  debugStatus: string;\n  installedVersion: string | null;\n  supportedVersion: string | null;\n  supported: boolean | null;\n  upgradeAvailable: boolean | null;\n  doctorAvailable: boolean | null;\n  daemonMode: boolean | null;\n  pendingEmbeddings: number | null;\n  oldestPendingAgeMs: number | null;\n  embeddingBacklogThreshold: number;\n}\n\n/** True when the pending-embedding count is above a positive backlog threshold. */\nexport function embeddingBacklogExceeds(pending: number | null, threshold: number): boolean {\n  return threshold > 0 && pending !== null && pending > threshold;\n}\n\n/**\n * The one definition of a degraded search answer. The readiness consumer\n * reports it, and `healthForNamespace` refuses to cache it.\n */\nexport function isSearchHealthDegraded(\n  health: Pick<NamespaceSearchHealth, \"available\" | \"collectionState\" | \"pendingEmbeddings\">,\n  backlogThreshold: number,\n): boolean {\n  const active = health.available && health.collectionState !== \"missing\";\n  return (\n    !active ||\n    health.collectionState === \"unknown\" ||\n    embeddingBacklogExceeds(health.pendingEmbeddings, backlogThreshold)\n  );\n}\n\ntype NamespaceScopedSearchConfig = PluginConfig & {\n  hostEmbeddingProviderScope?: string;\n};\n\ntype BackendRecordOptions = {\n  autoCreateCollection: boolean;\n  abortAsUnavailable: boolean;\n  failOpenMissingGuardedCollection: boolean;\n};\n\nexport class NamespaceSearchRouter {\n  private readonly cache = new Map<string, Promise<NamespaceBackendRecord>>();\n  private readonly healthResultCache = new Map<\n    string,\n    { expiresAt: number; value: NamespaceSearchHealth }\n  >();\n\n  private readonly pendingDisposals = new Set<Promise<void>>();\n\n  constructor(\n    private readonly config: PluginConfig,\n    private readonly storageRouter: StorageRouterLike,\n    private readonly createBackend: (config: PluginConfig) => SearchBackend = createSearchBackend,\n  ) {}\n\n  async collectionForNamespace(namespace: string): Promise<string> {\n    return (await this.backendRecordFor(namespace)).collection;\n  }\n\n  /**\n   * Resolve the search backend for a namespace (#2019). Returns `unknown` so\n   * callers (e.g. the prioritized-embed path) duck-type for capability like\n   * `embedFiles` rather than depending on a concrete QMD shape. Reuses the\n   * cached backend record, so this never re-creates a backend. Returns `null`\n   * when the namespace backend is unavailable.\n   */\n  async backendForNamespace(namespace: string): Promise<unknown> {\n    const record = await this.backendRecordFor(namespace);\n    return record.available ? record.backend : null;\n  }\n\n  async searchAcrossNamespaces(options: {\n    query: string;\n    namespaces: string[];\n    maxResults?: number;\n    mode?: \"search\" | \"hybrid\" | \"bm25\" | \"vector\";\n    searchOptions?: SearchQueryOptions;\n    execution?: SearchExecutionOptions;\n  }): Promise<QmdSearchResult[]> {\n    const query = options.query.trim();\n    if (!query) return [];\n    const maxResults = Math.max(0, Math.floor(options.maxResults ?? this.config.qmdMaxResults));\n    if (maxResults === 0) return [];\n\n    const method = options.mode ?? \"search\";\n    const namespaces = Array.from(new Set(options.namespaces.map((value) => value.trim()).filter(Boolean)));\n    if (namespaces.length === 0) return [];\n\n    const resultsByNamespace = await Promise.all(\n      namespaces.map(async (namespace) => {\n        const record = await this.backendRecordFor(namespace);\n        if (!record.available || record.collectionState === \"missing\") {\n          // A per-namespace backend that is unavailable (or missing its\n          // collection) must report like any other QMD skip (#1536): its\n          // empty contribution is otherwise indistinguishable from a true\n          // no-matches for that namespace (codex round-5 review on #1544).\n          try {\n            options.execution?.onDegradation?.({\n              backend: \"qmd\",\n              code: \"backend_unavailable\",\n              detail:\n                record.collectionState === \"missing\"\n                  ? `namespace collection missing: ${namespace}`\n                  : `namespace backend unavailable: ${namespace}`,\n            });\n          } catch {\n            // Observers must never break search.\n          }\n          return { namespace, results: [] as QmdSearchResult[] };\n        }\n        const backendLimit = backendSearchLimit(record, maxResults);\n        // One stalled backend leg must not hold the whole cross-namespace\n        // search (#3139). The backend gets the deadline signal so it cancels\n        // its own work, and the await is raced against the same budget. A leg\n        // that outlives its budget degrades only its own namespace; real\n        // backend errors and caller aborts propagate as before.\n        const legAbort = new AbortController();\n        const legTimer = setTimeout(() => legAbort.abort(), NAMESPACE_SEARCH_LEG_TIMEOUT_MS);\n        const legSignal = options.execution?.signal\n          ? AbortSignal.any([options.execution.signal, legAbort.signal])\n          : legAbort.signal;\n        const legExecution: SearchExecutionOptions = { ...options.execution, signal: legSignal };\n        let leg: Promise<QmdSearchResult[]>;\n        switch (method) {\n          case \"hybrid\":\n            leg = record.backend.hybridSearch(\n              query,\n              record.collection,\n              backendLimit,\n              legExecution,\n            );\n            break;\n          case \"bm25\":\n            leg = record.backend.bm25Search(\n              query,\n              record.collection,\n              backendLimit,\n              legExecution,\n            );\n            break;\n          case \"vector\":\n            leg = record.backend.vectorSearch(\n              query,\n              record.collection,\n              backendLimit,\n              legExecution,\n            );\n            break;\n          default:\n            leg = record.backend.search(\n              query,\n              record.collection,\n              backendLimit,\n              options.searchOptions,\n              legExecution,\n            );\n            break;\n        }\n        let results: QmdSearchResult[];\n        try {\n          results = await awaitWithAbort(leg, legSignal);\n        } catch (error) {\n          if (options.execution?.signal?.aborted || !legAbort.signal.aborted) throw error;\n          reportSearchDegradation(options.execution, {\n            backend: \"qmd\",\n            code: \"deadline_exceeded\",\n            detail: `namespace search deadline exceeded: ${namespace}`,\n          });\n          return { namespace, results: [] };\n        } finally {\n          clearTimeout(legTimer);\n        }\n        results = filterNamespaceSubtreeResults(record, results)\n          .map((result) => ({\n            ...result,\n            namespace,\n            // Resolve to an absolute path so the (namespace, path) identity is\n            // globally unique — same-relative-path hits from different namespaces\n            // stay distinct across every downstream consumer with no special\n            // handling. Display/citation surfaces relativize for portability (#2020).\n            path: resolveNamespaceResultPath(record.memoryDir, record.collection, result.path),\n          }))\n          // Reject hits whose resolved path escapes the queried namespace's\n          // storage root (#2077). A stale/corrupt per-namespace collection can\n          // return a path owned by another namespace; stamping it would let\n          // downstream scope checks (which trust the stamped namespace) and\n          // absolute-path resolution surface a foreign-namespace memory.\n          .filter((result) => resolvedPathIsInsideNamespaceRoot(record.memoryDir, result.path));\n        return { namespace, results };\n      }),\n    );\n\n    return mergeNamespaceSearchResults(resultsByNamespace, maxResults);\n  }\n\n  /**\n   * Update all namespace backends.\n   * Returns the number of backends for which an update was attempted\n   * (i.e., available and collection present).  Callers can treat 0 as a\n   * signal that no backend was eligible — useful for success-verification in\n   * startup-sync when namespacesEnabled is true.\n   */\n  async updateNamespaces(\n    namespaces: string[],\n    execution?: SearchExecutionOptions,\n    options?: { strict?: boolean; force?: boolean },\n  ): Promise<number> {\n    return (await this.updateNamespacesDetailed(namespaces, execution, options)).backendCount;\n  }\n\n  async updateNamespacesDetailed(\n    namespaces: string[],\n    execution?: SearchExecutionOptions,\n    options?: { strict?: boolean; force?: boolean },\n  ): Promise<NamespaceUpdateResult> {\n    const unique = Array.from(new Set(namespaces.map((value) => value.trim()).filter(Boolean)));\n    const eligible = (await Promise.all(\n      unique.map(async (namespace) => {\n        const record = await this.backendRecordFor(namespace);\n        return record.available && record.collectionState !== \"missing\"\n          ? { namespace, record }\n          : null;\n      }),\n    )).filter((entry): entry is { namespace: string; record: NamespaceBackendRecord } => entry !== null);\n\n    const globalEntry = eligible.find(({ record }) => record.backend.updatesAllCollections?.() === true);\n    const scopedEntries = globalEntry\n      ? eligible.filter(({ record }) => record.backend.updatesAllCollections?.() !== true)\n      : eligible;\n\n    await Promise.all([\n      globalEntry\n        ? updateBackendRecord(globalEntry.record, execution, options)\n        : Promise.resolve(),\n      ...scopedEntries.map(({ record }) => updateBackendRecord(record, execution, options)),\n    ]);\n\n    return {\n      backendCount: (globalEntry ? 1 : 0) + scopedEntries.length,\n      eligibleNamespaces: eligible.map(({ namespace }) => namespace),\n    };\n  }\n\n  async embedNamespaces(namespaces: string[], options?: { strict?: boolean }): Promise<void> {\n    const unique = Array.from(new Set(namespaces.map((value) => value.trim()).filter(Boolean)));\n    await Promise.all(\n      unique.map(async (namespace) => {\n        const record = await this.backendRecordFor(namespace);\n        if (!record.available || record.collectionState === \"missing\") return;\n        await embedBackendRecord(record, options);\n      }),\n    );\n  }\n\n  async ensureNamespaceCollection(\n    namespace: string,\n    execution?: SearchExecutionOptions,\n  ): Promise<\"present\" | \"missing\" | \"unknown\" | \"skipped\"> {\n    const record = await this.backendRecordFor(namespace, execution);\n    return record.collectionState;\n  }\n\n  async healthForNamespace(\n    namespace: string,\n    execution?: SearchExecutionOptions,\n  ): Promise<NamespaceSearchHealth> {\n    const key = namespace.trim() || this.config.defaultNamespace;\n    const cached = this.healthResultCache.get(key);\n    if (cached && cached.expiresAt > Date.now()) {\n      return { ...cached.value };\n    }\n\n    const record = await this.createBackendRecordFor(\n      key,\n      execution,\n      {\n        autoCreateCollection: false,\n        abortAsUnavailable: true,\n        failOpenMissingGuardedCollection: false,\n      },\n    );\n    try {\n      const liveRecord = await this.liveCachedRecordForHealth(key, record, execution);\n      const diagnosticBackend = liveRecord?.backend ?? record.backend;\n      const versionStatus =\n        \"getVersionStatus\" in diagnosticBackend &&\n        typeof diagnosticBackend.getVersionStatus === \"function\"\n          ? diagnosticBackend.getVersionStatus()\n          : null;\n      const daemonMode = daemonModeForBackend(diagnosticBackend);\n      const backendStatus =\n        \"status\" in diagnosticBackend &&\n        typeof diagnosticBackend.status === \"function\"\n          ? await Promise.race([\n              diagnosticBackend.status().catch(() => null),\n              new Promise<null>((resolve) => setTimeout(() => resolve(null), 5_000).unref?.()),\n            ])\n          : null;\n      const collectionState =\n        liveRecord?.collectionState === \"missing\"\n          ? \"missing\"\n          : record.collectionState;\n\n      const health: NamespaceSearchHealth = {\n        collection: record.collection,\n        memoryDir: record.memoryDir,\n        available: liveRecord?.available ?? record.available,\n        collectionState,\n        debugStatus: diagnosticBackend.debugStatus(),\n        installedVersion: versionStatus?.installedVersion ?? null,\n        supportedVersion: versionStatus?.supportedVersion ?? null,\n        supported: versionStatus?.supported ?? null,\n        upgradeAvailable: versionStatus?.upgradeAvailable ?? null,\n        doctorAvailable: versionStatus?.capabilities?.doctor ?? null,\n        daemonMode,\n        pendingEmbeddings: backendStatus?.pendingEmbeddings ?? null,\n        oldestPendingAgeMs: backendStatus?.oldestPendingAgeMs ?? null,\n        embeddingBacklogThreshold: this.config.qmdEmbeddingBacklogThreshold,\n      };\n\n      // Cache only a healthy answer that carries backlog data when the backend\n      // reports status. A degraded or incomplete answer must re-probe so a\n      // readiness poll sees recovery on the next call, not one TTL late.\n      const statusMissing = backendStatus === null && \"status\" in diagnosticBackend;\n      if (\n        execution?.signal?.aborted !== true &&\n        !statusMissing &&\n        !isSearchHealthDegraded(health, health.embeddingBacklogThreshold)\n      ) {\n        this.healthResultCache.set(key, {\n          expiresAt: Date.now() + HEALTH_RESULT_CACHE_TTL_MS,\n          value: { ...health },\n        });\n      }\n      return { ...health };\n    } finally {\n      const dispose = (record.backend as { dispose?: () => void | Promise<void> }).dispose;\n      await dispose?.call(record.backend);\n    }\n  }\n\n  private async liveCachedRecordForHealth(\n    key: string,\n    disposableRecord: NamespaceBackendRecord,\n    execution?: SearchExecutionOptions,\n  ): Promise<NamespaceBackendRecord | null> {\n    const pending = this.cache.get(key);\n    if (!pending) return null;\n    const cachedRecord = await awaitWithAbort(pending, execution?.signal).catch(() => null);\n    if (!cachedRecord) return null;\n    if (cachedRecord.collection !== disposableRecord.collection) return null;\n    if (cachedRecord.memoryDir !== disposableRecord.memoryDir) return null;\n    return cachedRecord;\n  }\n\n  private trackDisposal(promise: Promise<void>): void {\n    this.pendingDisposals.add(promise);\n    void promise.finally(() => this.pendingDisposals.delete(promise));\n  }\n\n  private async drainPendingDisposals(): Promise<void> {\n    if (this.pendingDisposals.size === 0) return;\n    await Promise.allSettled(this.pendingDisposals);\n  }\n\n  /** Clear cached backend records so the next access re-probes availability. */\n  clearCache(): void {\n    this.healthResultCache.clear();\n    const pendingRecords = Array.from(this.cache.values());\n    this.cache.clear();\n    const disposal = Promise.allSettled(pendingRecords).then(async (settled) => {\n      await Promise.allSettled(\n        settled.flatMap((entry) =>\n          entry.status === \"fulfilled\" ? [this.disposeRecord(entry.value)] : []),\n      );\n    });\n    this.trackDisposal(disposal);\n  }\n\n  private async disposeRecord(record: NamespaceBackendRecord): Promise<void> {\n    if (record.disposed) return;\n    record.disposed = true;\n    const dispose = (record.backend as { dispose?: () => void | Promise<void> }).dispose;\n    await dispose?.call(record.backend);\n  }\n\n  /** Release any per-namespace backend handles held by cached records. */\n  async dispose(): Promise<void> {\n    await this.drainPendingDisposals();\n    this.healthResultCache.clear();\n    const pendingRecords = Array.from(this.cache.values());\n    this.cache.clear();\n    const settled = await Promise.allSettled(pendingRecords);\n    await Promise.allSettled(\n      settled.flatMap((entry) =>\n        entry.status === \"fulfilled\" ? [this.disposeRecord(entry.value)] : []),\n    );\n  }\n\n  /**\n   * Disable namespace search for this runtime while retaining the resolved\n   * records as unavailable/missing. This releases concrete QMD/daemon handles\n   * without letting later reads recreate a search backend after the root path\n   * has been switched to NoopSearchBackend for a missing collection.\n   */\n  async disableSearchBackends(): Promise<void> {\n    this.healthResultCache.clear();\n    const settled = await Promise.allSettled(this.cache.values());\n    await Promise.allSettled(\n      settled.flatMap((entry) => {\n        if (entry.status !== \"fulfilled\") return [];\n        entry.value.available = false;\n        entry.value.collectionState = \"missing\";\n        return [this.disposeRecord(entry.value)];\n      }),\n    );\n  }\n\n  private async backendRecordFor(\n    namespace: string,\n    execution?: SearchExecutionOptions,\n  ): Promise<NamespaceBackendRecord> {\n    await this.drainPendingDisposals();\n    const key = namespace.trim() || this.config.defaultNamespace;\n    const existing = this.cache.get(key);\n    if (existing) return await existing;\n\n    const pending = this.createBackendRecordFor(key, execution, {\n      autoCreateCollection: true,\n      abortAsUnavailable: false,\n      failOpenMissingGuardedCollection: true,\n    }).catch((error) => {\n      this.cache.delete(key);\n      throw error;\n    });\n\n    this.cache.set(key, pending);\n    return await pending;\n  }\n\n  private async createBackendRecordFor(\n    namespace: string,\n    execution: SearchExecutionOptions | undefined,\n    options: BackendRecordOptions,\n  ): Promise<NamespaceBackendRecord> {\n    const key = namespace.trim() || this.config.defaultNamespace;\n    const storage = await this.storageRouter.storageFor(key);\n    const useLegacyDefaultCollection =\n      key === this.config.defaultNamespace && storage.dir === this.config.memoryDir;\n    const filtersNestedNamespaces =\n      resolveNamespaceCapabilities(this.config).namespaces === true && useLegacyDefaultCollection;\n    const rootHostEmbeddingScope =\n      (this.config as NamespaceScopedSearchConfig).hostEmbeddingProviderScope ??\n      this.config.memoryDir;\n    const scopedConfig: NamespaceScopedSearchConfig = {\n      ...this.config,\n      memoryDir: storage.dir,\n      hostEmbeddingProviderScope: rootHostEmbeddingScope,\n      qmdCollection: namespaceCollectionName(this.config.qmdCollection, key, {\n        defaultNamespace: this.config.defaultNamespace,\n        useLegacyDefaultCollection,\n      }),\n    };\n\n    const backend = this.createBackend(scopedConfig);\n    try {\n      const availabilityProbe =\n        options.autoCreateCollection || typeof backend.checkAvailability !== \"function\"\n          ? backend.probe(execution)\n          : backend.checkAvailability({ signal: execution?.signal });\n      const available = await awaitWithAbort(availabilityProbe, execution?.signal).catch((error) => {\n        if (error instanceof NamespaceSearchAbortError && !options.abortAsUnavailable) {\n          throw error;\n        }\n        return false;\n      });\n      const collectionState = available\n        ? await awaitWithAbort(\n          // The legacy default namespace at the flat root (`filtersNestedNamespaces`)\n          // shares its `memoryDir` with the `namespaces/` container, so its base\n          // collection is a \"broad root\" that also indexes nested-namespace files.\n          // We STILL auto-create it (issue #1929): the search side already targets\n          // this exact base collection and `filterNamespaceSubtreeResults` strips\n          // the nested `namespaces/` subtree out of its results, so index and\n          // search stay symmetric. Skipping creation left a configured default\n          // namespace (e.g. `geek`) with maintenance \"ran\" but no collection and 0\n          // recall results. `ensureCollection` is a no-op when the collection is\n          // already present, so legacy installs that pre-created the broad root are\n          // unaffected.\n          this.collectionStateForBackend(backend, storage.dir, scopedConfig.qmdCollection, {\n            autoCreate: options.autoCreateCollection,\n            failOpenMissingGuardedCollection: options.failOpenMissingGuardedCollection,\n            execution,\n          }),\n          execution?.signal,\n        ).catch((error) => {\n          if (error instanceof NamespaceSearchAbortError && !options.abortAsUnavailable) {\n            throw error;\n          }\n          return \"unknown\" as const;\n        })\n        : \"unknown\";\n      return {\n        backend,\n        collection: scopedConfig.qmdCollection,\n        memoryDir: storage.dir,\n        available,\n        collectionState,\n        filtersNestedNamespaces,\n        disposed: false,\n      };\n    } catch (error) {\n      const dispose = (backend as { dispose?: () => void | Promise<void> }).dispose;\n      if (dispose) {\n        await Promise.resolve(dispose.call(backend)).catch(() => {});\n      }\n      throw error;\n    }\n  }\n\n  private async collectionStateForBackend(\n    backend: SearchBackend,\n    memoryDir: string,\n    collection: string,\n    options: {\n      autoCreate: boolean;\n      failOpenMissingGuardedCollection: boolean;\n      execution?: SearchExecutionOptions;\n    },\n  ): Promise<CollectionState> {\n    if (!options.autoCreate) {\n      if (!backend.checkCollection) return \"unknown\";\n      const collectionState = await backend\n        .checkCollection(collection, options.execution)\n        .catch(() => \"unknown\" as const);\n      return options.failOpenMissingGuardedCollection && collectionState === \"missing\"\n        ? \"unknown\"\n        : collectionState;\n    }\n    return await backend.ensureCollection(memoryDir, collection, options.execution).catch(() => \"unknown\" as const);\n  }\n}\n\nclass NamespaceSearchAbortError extends Error {\n  constructor() {\n    super(\"operation aborted\");\n  }\n}\n\nfunction awaitWithAbort<T>(operation: Promise<T>, signal?: AbortSignal): Promise<T> {\n  if (!signal) return operation;\n  if (signal.aborted) {\n    // The operation was started with this same aborted signal and will reject\n    // on its own. Without a handler that second rejection is unhandled and\n    // ends the process.\n    operation.catch(() => {});\n    return Promise.reject(new NamespaceSearchAbortError());\n  }\n\n  return new Promise<T>((resolve, reject) => {\n    const onAbort = () => {\n      signal.removeEventListener(\"abort\", onAbort);\n      reject(new NamespaceSearchAbortError());\n    };\n    signal.addEventListener(\"abort\", onAbort, { once: true });\n    operation.then(resolve, reject).finally(() => {\n      signal.removeEventListener(\"abort\", onAbort);\n    });\n  });\n}\n\nfunction filterNamespaceSubtreeResults(\n  record: NamespaceBackendRecord,\n  results: QmdSearchResult[],\n): QmdSearchResult[] {\n  if (!record.filtersNestedNamespaces) return results;\n  return results.filter((result) =>\n    !pathIsInsideNamespaceSubtree(record.memoryDir, record.collection, result.path)\n  );\n}\n\nfunction backendSearchLimit(\n  record: NamespaceBackendRecord,\n  maxResults: number,\n): number {\n  if (!record.filtersNestedNamespaces) return maxResults;\n  return Math.max(\n    maxResults,\n    maxResults * NESTED_NAMESPACE_FILTER_OVERFETCH_FACTOR,\n    NESTED_NAMESPACE_FILTER_OVERFETCH_MIN,\n  );\n}\n\nasync function updateBackendRecord(\n  record: NamespaceBackendRecord,\n  execution?: SearchExecutionOptions,\n  options?: { strict?: boolean; force?: boolean },\n): Promise<void> {\n  if (options?.strict === true) {\n    if (\n      // Forced refreshes must skip the throttled all-collections update: its\n      // success has to prove the current writes are indexed, which a throttle\n      // skip cannot.\n      options.force !== true &&\n      record.backend.updatesAllCollections?.() === true &&\n      typeof record.backend.updateStrict === \"function\"\n    ) {\n      await record.backend.updateStrict(execution);\n      return;\n    }\n    if (typeof record.backend.updateCollectionStrict === \"function\") {\n      await record.backend.updateCollectionStrict(record.collection, execution);\n      return;\n    }\n    // Backends with no strict variant (Orama, LanceDB, Meilisearch, remote) have a fail-open\n    // update(): it resolves when it returned early or failed. Their updateCompleted() says\n    // whether the refresh ran, so strict callers get a failure instead of a fake success.\n    const completed = await record.backend.updateCompleted?.(execution);\n    if (completed !== undefined) {\n      if (!completed) throw new Error(\"search backend update did not complete\");\n      return;\n    }\n  }\n  await record.backend.update(execution);\n}\n\nasync function embedBackendRecord(\n  record: NamespaceBackendRecord,\n  options?: { strict?: boolean },\n): Promise<void> {\n  if (options?.strict === true) {\n    if (typeof record.backend.embedCollectionStrict === \"function\") {\n      await record.backend.embedCollectionStrict(record.collection);\n      return;\n    }\n    if (typeof record.backend.embedStrict === \"function\") {\n      await record.backend.embedStrict();\n      return;\n    }\n  }\n  if (typeof record.backend.embedCollection === \"function\") {\n    await record.backend.embedCollection(record.collection);\n    return;\n  }\n  await record.backend.embed();\n}\n\nfunction daemonModeForBackend(backend: SearchBackend): boolean | null {\n  return \"isDaemonMode\" in backend && typeof backend.isDaemonMode === \"function\"\n    ? backend.isDaemonMode() === true\n    : null;\n}\n\nfunction isContainedPath(root: string, candidate: string): boolean {\n  const relative = path.relative(root, candidate);\n  return (\n    relative === \"\" ||\n    (relative !== \"..\" && !relative.startsWith(`..${path.sep}`) && !path.isAbsolute(relative))\n  );\n}\n\nfunction pathIsInsideNamespaceSubtree(\n  memoryDir: string,\n  collection: string,\n  resultPath: string | undefined,\n): boolean {\n  if (!resultPath) return false;\n  const normalizedResultPath = normalizeQmdResultPath(resultPath, collection);\n  const memoryRoot = path.resolve(memoryDir);\n  const namespacesRoot = path.join(memoryRoot, \"namespaces\");\n  const candidate = path.isAbsolute(normalizedResultPath)\n    ? path.normalize(normalizedResultPath)\n    : path.resolve(memoryRoot, normalizedResultPath);\n  return isContainedPath(namespacesRoot, candidate);\n}\n\n/**\n * Reject a QMD hit whose resolved path escapes the queried namespace's storage\n * root (#2077). `resolvedPath` is the already-resolved value produced by\n * `resolveNamespaceResultPath`; a stale/corrupt per-namespace collection can\n * yield an absolute path owned by another namespace, and stamping it with the\n * queried namespace would surface a foreign-namespace memory downstream.\n *\n * Lexical containment runs first — it is cheap and the only check possible when\n * the file is not yet on disk (a stale collection may cite a since-deleted\n * path). When both root and candidate exist, their filesystem realpaths are\n * canonicalized and re-checked so a symlink planted inside the namespace root\n * cannot resolve into another namespace or outside storage. An unresolved path\n * (ENOENT) keeps the lexical result rather than rejecting the stale-collection\n * case this guard targets.\n */\nfunction resolvedPathIsInsideNamespaceRoot(memoryDir: string, resolvedPath: string): boolean {\n  const root = path.resolve(memoryDir);\n  const candidate = path.isAbsolute(resolvedPath)\n    ? path.normalize(resolvedPath)\n    : path.resolve(root, resolvedPath);\n  if (!isContainedPath(root, candidate)) return false;\n  try {\n    return isContainedPath(realpathSync.native(root), realpathSync.native(candidate));\n  } catch {\n    return true;\n  }\n}\nexport function normalizeQmdResultPath(resultPath: string, collection: string): string {\n  let value = resultPath.trim();\n  if (value.startsWith(\"qmd://\")) {\n    try {\n      const parsed = new URL(value);\n      if (parsed.protocol === \"qmd:\" && parsed.hostname === collection) {\n        value = decodeURIComponent(parsed.pathname.replace(/^\\/+/, \"\"));\n      }\n    } catch {\n      const remainder = value.slice(\"qmd://\".length);\n      const slashIndex = remainder.indexOf(\"/\");\n      if (slashIndex !== -1) {\n        value = remainder.slice(slashIndex + 1);\n      }\n    }\n  }\n\n  // Only strip a genuine QMD collection prefix — never when the collection name\n  // collides with a memory category dir (e.g. qmdCollection == \"facts\"), or a\n  // bare \"facts/<id>.md\" hit would be corrupted to \"<id>.md\" and fail namespace\n  // reads/access tracking (#2020).\n  const collectionPrefix = `${collection}/`;\n  if (value.startsWith(collectionPrefix) && !ALL_CATEGORY_DIRS.includes(collection)) {\n    value = value.slice(collectionPrefix.length);\n  }\n  return value;\n}\nexport function resolveNamespaceResultPath(\n  memoryDir: string,\n  collection: string,\n  resultPath: string,\n): string {\n  const normalized = normalizeQmdResultPath(resultPath, collection);\n  if (path.isAbsolute(normalized)) return normalized;\n  const root = path.resolve(memoryDir);\n  const resolved = path.resolve(root, normalized);\n  const relative = path.relative(root, resolved);\n  if (relative === \"\" || relative.startsWith(\"..\") || path.isAbsolute(relative)) {\n    return resultPath;\n  }\n  return resolved;\n}\nfunction mergeNamespaceSearchResults(\n  lists: Array<{ namespace: string; results: QmdSearchResult[] }>,\n  maxResults: number,\n): QmdSearchResult[] {\n  const merged = new Map<string, QmdSearchResult>();\n\n  for (const { namespace, results } of lists) {\n    for (const result of results) {\n      const key = `${namespace}\\0${result.path || result.docid}`;\n      const existing = merged.get(key);\n      if (!existing) {\n        merged.set(key, { ...result, namespace });\n        continue;\n      }\n      if (result.score > existing.score) {\n        merged.set(key, {\n          ...result,\n          namespace,\n          snippet: existing.snippet || result.snippet || \"\",\n        });\n      }\n    }\n  }\n\n  return [...merged.values()]\n    .sort((a, b) => b.score - a.score)\n    .slice(0, maxResults);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AACA,OAAO,UAAU;AACjB,SAAS,oBAAoB;AAY7B,IAAM,2CAA2C;AACjD,IAAM,wCAAwC;AAG9C,IAAM,6BAA6B;AAI5B,IAAM,kCAAkC;AAExC,SAAS,wBACd,gBACA,WACA,SAIQ;AACR,QAAM,UAAU,2BAA2B,SAAS;AACpD,QAAM,mBAAmB,2BAA2B,SAAS,oBAAoB,EAAE,KAAK;AACxF,MACE,SAAS,+BAA+B,QACxC,YAAY,kBACZ;AACA,WAAO;AAAA,EACT;AAEA,SAAO,GAAG,cAAc,KAAK,uBAAuB,WAAW,gBAAgB,CAAC;AAClF;AAyCO,SAAS,wBAAwB,SAAwB,WAA4B;AAC1F,SAAO,YAAY,KAAK,YAAY,QAAQ,UAAU;AACxD;AAMO,SAAS,uBACd,QACA,kBACS;AACT,QAAM,SAAS,OAAO,aAAa,OAAO,oBAAoB;AAC9D,SACE,CAAC,UACD,OAAO,oBAAoB,aAC3B,wBAAwB,OAAO,mBAAmB,gBAAgB;AAEtE;AAYO,IAAM,wBAAN,MAA4B;AAAA,EASjC,YACmB,QACA,eACA,gBAAyD,qBAC1E;AAHiB;AACA;AACA;AAAA,EAChB;AAAA,EAHgB;AAAA,EACA;AAAA,EACA;AAAA,EAXF,QAAQ,oBAAI,IAA6C;AAAA,EACzD,oBAAoB,oBAAI,IAGvC;AAAA,EAEe,mBAAmB,oBAAI,IAAmB;AAAA,EAQ3D,MAAM,uBAAuB,WAAoC;AAC/D,YAAQ,MAAM,KAAK,iBAAiB,SAAS,GAAG;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,oBAAoB,WAAqC;AAC7D,UAAM,SAAS,MAAM,KAAK,iBAAiB,SAAS;AACpD,WAAO,OAAO,YAAY,OAAO,UAAU;AAAA,EAC7C;AAAA,EAEA,MAAM,uBAAuB,SAOE;AAC7B,UAAM,QAAQ,QAAQ,MAAM,KAAK;AACjC,QAAI,CAAC,MAAO,QAAO,CAAC;AACpB,UAAM,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,cAAc,KAAK,OAAO,aAAa,CAAC;AAC1F,QAAI,eAAe,EAAG,QAAO,CAAC;AAE9B,UAAM,SAAS,QAAQ,QAAQ;AAC/B,UAAM,aAAa,MAAM,KAAK,IAAI,IAAI,QAAQ,WAAW,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,EAAE,OAAO,OAAO,CAAC,CAAC;AACtG,QAAI,WAAW,WAAW,EAAG,QAAO,CAAC;AAErC,UAAM,qBAAqB,MAAM,QAAQ;AAAA,MACvC,WAAW,IAAI,OAAO,cAAc;AAClC,cAAM,SAAS,MAAM,KAAK,iBAAiB,SAAS;AACpD,YAAI,CAAC,OAAO,aAAa,OAAO,oBAAoB,WAAW;AAK7D,cAAI;AACF,oBAAQ,WAAW,gBAAgB;AAAA,cACjC,SAAS;AAAA,cACT,MAAM;AAAA,cACN,QACE,OAAO,oBAAoB,YACvB,iCAAiC,SAAS,KAC1C,kCAAkC,SAAS;AAAA,YACnD,CAAC;AAAA,UACH,QAAQ;AAAA,UAER;AACA,iBAAO,EAAE,WAAW,SAAS,CAAC,EAAuB;AAAA,QACvD;AACA,cAAM,eAAe,mBAAmB,QAAQ,UAAU;AAM1D,cAAM,WAAW,IAAI,gBAAgB;AACrC,cAAM,WAAW,WAAW,MAAM,SAAS,MAAM,GAAG,+BAA+B;AACnF,cAAM,YAAY,QAAQ,WAAW,SACjC,YAAY,IAAI,CAAC,QAAQ,UAAU,QAAQ,SAAS,MAAM,CAAC,IAC3D,SAAS;AACb,cAAM,eAAuC,EAAE,GAAG,QAAQ,WAAW,QAAQ,UAAU;AACvF,YAAI;AACJ,gBAAQ,QAAQ;AAAA,UACd,KAAK;AACH,kBAAM,OAAO,QAAQ;AAAA,cACnB;AAAA,cACA,OAAO;AAAA,cACP;AAAA,cACA;AAAA,YACF;AACA;AAAA,UACF,KAAK;AACH,kBAAM,OAAO,QAAQ;AAAA,cACnB;AAAA,cACA,OAAO;AAAA,cACP;AAAA,cACA;AAAA,YACF;AACA;AAAA,UACF,KAAK;AACH,kBAAM,OAAO,QAAQ;AAAA,cACnB;AAAA,cACA,OAAO;AAAA,cACP;AAAA,cACA;AAAA,YACF;AACA;AAAA,UACF;AACE,kBAAM,OAAO,QAAQ;AAAA,cACnB;AAAA,cACA,OAAO;AAAA,cACP;AAAA,cACA,QAAQ;AAAA,cACR;AAAA,YACF;AACA;AAAA,QACJ;AACA,YAAI;AACJ,YAAI;AACF,oBAAU,MAAM,eAAe,KAAK,SAAS;AAAA,QAC/C,SAAS,OAAO;AACd,cAAI,QAAQ,WAAW,QAAQ,WAAW,CAAC,SAAS,OAAO,QAAS,OAAM;AAC1E,kCAAwB,QAAQ,WAAW;AAAA,YACzC,SAAS;AAAA,YACT,MAAM;AAAA,YACN,QAAQ,uCAAuC,SAAS;AAAA,UAC1D,CAAC;AACD,iBAAO,EAAE,WAAW,SAAS,CAAC,EAAE;AAAA,QAClC,UAAE;AACA,uBAAa,QAAQ;AAAA,QACvB;AACA,kBAAU,8BAA8B,QAAQ,OAAO,EACpD,IAAI,CAAC,YAAY;AAAA,UAChB,GAAG;AAAA,UACH;AAAA;AAAA;AAAA;AAAA;AAAA,UAKA,MAAM,2BAA2B,OAAO,WAAW,OAAO,YAAY,OAAO,IAAI;AAAA,QACnF,EAAE,EAMD,OAAO,CAAC,WAAW,kCAAkC,OAAO,WAAW,OAAO,IAAI,CAAC;AACtF,eAAO,EAAE,WAAW,QAAQ;AAAA,MAC9B,CAAC;AAAA,IACH;AAEA,WAAO,4BAA4B,oBAAoB,UAAU;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,iBACJ,YACA,WACA,SACiB;AACjB,YAAQ,MAAM,KAAK,yBAAyB,YAAY,WAAW,OAAO,GAAG;AAAA,EAC/E;AAAA,EAEA,MAAM,yBACJ,YACA,WACA,SACgC;AAChC,UAAM,SAAS,MAAM,KAAK,IAAI,IAAI,WAAW,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,EAAE,OAAO,OAAO,CAAC,CAAC;AAC1F,UAAM,YAAY,MAAM,QAAQ;AAAA,MAC9B,OAAO,IAAI,OAAO,cAAc;AAC9B,cAAM,SAAS,MAAM,KAAK,iBAAiB,SAAS;AACpD,eAAO,OAAO,aAAa,OAAO,oBAAoB,YAClD,EAAE,WAAW,OAAO,IACpB;AAAA,MACN,CAAC;AAAA,IACH,GAAG,OAAO,CAAC,UAA0E,UAAU,IAAI;AAEnG,UAAM,cAAc,SAAS,KAAK,CAAC,EAAE,OAAO,MAAM,OAAO,QAAQ,wBAAwB,MAAM,IAAI;AACnG,UAAM,gBAAgB,cAClB,SAAS,OAAO,CAAC,EAAE,OAAO,MAAM,OAAO,QAAQ,wBAAwB,MAAM,IAAI,IACjF;AAEJ,UAAM,QAAQ,IAAI;AAAA,MAChB,cACI,oBAAoB,YAAY,QAAQ,WAAW,OAAO,IAC1D,QAAQ,QAAQ;AAAA,MACpB,GAAG,cAAc,IAAI,CAAC,EAAE,OAAO,MAAM,oBAAoB,QAAQ,WAAW,OAAO,CAAC;AAAA,IACtF,CAAC;AAED,WAAO;AAAA,MACL,eAAe,cAAc,IAAI,KAAK,cAAc;AAAA,MACpD,oBAAoB,SAAS,IAAI,CAAC,EAAE,UAAU,MAAM,SAAS;AAAA,IAC/D;AAAA,EACF;AAAA,EAEA,MAAM,gBAAgB,YAAsB,SAA+C;AACzF,UAAM,SAAS,MAAM,KAAK,IAAI,IAAI,WAAW,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,EAAE,OAAO,OAAO,CAAC,CAAC;AAC1F,UAAM,QAAQ;AAAA,MACZ,OAAO,IAAI,OAAO,cAAc;AAC9B,cAAM,SAAS,MAAM,KAAK,iBAAiB,SAAS;AACpD,YAAI,CAAC,OAAO,aAAa,OAAO,oBAAoB,UAAW;AAC/D,cAAM,mBAAmB,QAAQ,OAAO;AAAA,MAC1C,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,MAAM,0BACJ,WACA,WACwD;AACxD,UAAM,SAAS,MAAM,KAAK,iBAAiB,WAAW,SAAS;AAC/D,WAAO,OAAO;AAAA,EAChB;AAAA,EAEA,MAAM,mBACJ,WACA,WACgC;AAChC,UAAM,MAAM,UAAU,KAAK,KAAK,KAAK,OAAO;AAC5C,UAAM,SAAS,KAAK,kBAAkB,IAAI,GAAG;AAC7C,QAAI,UAAU,OAAO,YAAY,KAAK,IAAI,GAAG;AAC3C,aAAO,EAAE,GAAG,OAAO,MAAM;AAAA,IAC3B;AAEA,UAAM,SAAS,MAAM,KAAK;AAAA,MACxB;AAAA,MACA;AAAA,MACA;AAAA,QACE,sBAAsB;AAAA,QACtB,oBAAoB;AAAA,QACpB,kCAAkC;AAAA,MACpC;AAAA,IACF;AACA,QAAI;AACF,YAAM,aAAa,MAAM,KAAK,0BAA0B,KAAK,QAAQ,SAAS;AAC9E,YAAM,oBAAoB,YAAY,WAAW,OAAO;AACxD,YAAM,gBACJ,sBAAsB,qBACtB,OAAO,kBAAkB,qBAAqB,aAC1C,kBAAkB,iBAAiB,IACnC;AACN,YAAM,aAAa,qBAAqB,iBAAiB;AACzD,YAAM,gBACJ,YAAY,qBACZ,OAAO,kBAAkB,WAAW,aAChC,MAAM,QAAQ,KAAK;AAAA,QACjB,kBAAkB,OAAO,EAAE,MAAM,MAAM,IAAI;AAAA,QAC3C,IAAI,QAAc,CAAC,YAAY,WAAW,MAAM,QAAQ,IAAI,GAAG,GAAK,EAAE,QAAQ,CAAC;AAAA,MACjF,CAAC,IACD;AACN,YAAM,kBACJ,YAAY,oBAAoB,YAC5B,YACA,OAAO;AAEb,YAAM,SAAgC;AAAA,QACpC,YAAY,OAAO;AAAA,QACnB,WAAW,OAAO;AAAA,QAClB,WAAW,YAAY,aAAa,OAAO;AAAA,QAC3C;AAAA,QACA,aAAa,kBAAkB,YAAY;AAAA,QAC3C,kBAAkB,eAAe,oBAAoB;AAAA,QACrD,kBAAkB,eAAe,oBAAoB;AAAA,QACrD,WAAW,eAAe,aAAa;AAAA,QACvC,kBAAkB,eAAe,oBAAoB;AAAA,QACrD,iBAAiB,eAAe,cAAc,UAAU;AAAA,QACxD;AAAA,QACA,mBAAmB,eAAe,qBAAqB;AAAA,QACvD,oBAAoB,eAAe,sBAAsB;AAAA,QACzD,2BAA2B,KAAK,OAAO;AAAA,MACzC;AAKA,YAAM,gBAAgB,kBAAkB,QAAQ,YAAY;AAC5D,UACE,WAAW,QAAQ,YAAY,QAC/B,CAAC,iBACD,CAAC,uBAAuB,QAAQ,OAAO,yBAAyB,GAChE;AACA,aAAK,kBAAkB,IAAI,KAAK;AAAA,UAC9B,WAAW,KAAK,IAAI,IAAI;AAAA,UACxB,OAAO,EAAE,GAAG,OAAO;AAAA,QACrB,CAAC;AAAA,MACH;AACA,aAAO,EAAE,GAAG,OAAO;AAAA,IACrB,UAAE;AACA,YAAM,UAAW,OAAO,QAAqD;AAC7E,YAAM,SAAS,KAAK,OAAO,OAAO;AAAA,IACpC;AAAA,EACF;AAAA,EAEA,MAAc,0BACZ,KACA,kBACA,WACwC;AACxC,UAAM,UAAU,KAAK,MAAM,IAAI,GAAG;AAClC,QAAI,CAAC,QAAS,QAAO;AACrB,UAAM,eAAe,MAAM,eAAe,SAAS,WAAW,MAAM,EAAE,MAAM,MAAM,IAAI;AACtF,QAAI,CAAC,aAAc,QAAO;AAC1B,QAAI,aAAa,eAAe,iBAAiB,WAAY,QAAO;AACpE,QAAI,aAAa,cAAc,iBAAiB,UAAW,QAAO;AAClE,WAAO;AAAA,EACT;AAAA,EAEQ,cAAc,SAA8B;AAClD,SAAK,iBAAiB,IAAI,OAAO;AACjC,SAAK,QAAQ,QAAQ,MAAM,KAAK,iBAAiB,OAAO,OAAO,CAAC;AAAA,EAClE;AAAA,EAEA,MAAc,wBAAuC;AACnD,QAAI,KAAK,iBAAiB,SAAS,EAAG;AACtC,UAAM,QAAQ,WAAW,KAAK,gBAAgB;AAAA,EAChD;AAAA;AAAA,EAGA,aAAmB;AACjB,SAAK,kBAAkB,MAAM;AAC7B,UAAM,iBAAiB,MAAM,KAAK,KAAK,MAAM,OAAO,CAAC;AACrD,SAAK,MAAM,MAAM;AACjB,UAAM,WAAW,QAAQ,WAAW,cAAc,EAAE,KAAK,OAAO,YAAY;AAC1E,YAAM,QAAQ;AAAA,QACZ,QAAQ,QAAQ,CAAC,UACf,MAAM,WAAW,cAAc,CAAC,KAAK,cAAc,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC;AAAA,MACzE;AAAA,IACF,CAAC;AACD,SAAK,cAAc,QAAQ;AAAA,EAC7B;AAAA,EAEA,MAAc,cAAc,QAA+C;AACzE,QAAI,OAAO,SAAU;AACrB,WAAO,WAAW;AAClB,UAAM,UAAW,OAAO,QAAqD;AAC7E,UAAM,SAAS,KAAK,OAAO,OAAO;AAAA,EACpC;AAAA;AAAA,EAGA,MAAM,UAAyB;AAC7B,UAAM,KAAK,sBAAsB;AACjC,SAAK,kBAAkB,MAAM;AAC7B,UAAM,iBAAiB,MAAM,KAAK,KAAK,MAAM,OAAO,CAAC;AACrD,SAAK,MAAM,MAAM;AACjB,UAAM,UAAU,MAAM,QAAQ,WAAW,cAAc;AACvD,UAAM,QAAQ;AAAA,MACZ,QAAQ,QAAQ,CAAC,UACf,MAAM,WAAW,cAAc,CAAC,KAAK,cAAc,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC;AAAA,IACzE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,wBAAuC;AAC3C,SAAK,kBAAkB,MAAM;AAC7B,UAAM,UAAU,MAAM,QAAQ,WAAW,KAAK,MAAM,OAAO,CAAC;AAC5D,UAAM,QAAQ;AAAA,MACZ,QAAQ,QAAQ,CAAC,UAAU;AACzB,YAAI,MAAM,WAAW,YAAa,QAAO,CAAC;AAC1C,cAAM,MAAM,YAAY;AACxB,cAAM,MAAM,kBAAkB;AAC9B,eAAO,CAAC,KAAK,cAAc,MAAM,KAAK,CAAC;AAAA,MACzC,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEA,MAAc,iBACZ,WACA,WACiC;AACjC,UAAM,KAAK,sBAAsB;AACjC,UAAM,MAAM,UAAU,KAAK,KAAK,KAAK,OAAO;AAC5C,UAAM,WAAW,KAAK,MAAM,IAAI,GAAG;AACnC,QAAI,SAAU,QAAO,MAAM;AAE3B,UAAM,UAAU,KAAK,uBAAuB,KAAK,WAAW;AAAA,MAC1D,sBAAsB;AAAA,MACtB,oBAAoB;AAAA,MACpB,kCAAkC;AAAA,IACpC,CAAC,EAAE,MAAM,CAAC,UAAU;AAClB,WAAK,MAAM,OAAO,GAAG;AACrB,YAAM;AAAA,IACR,CAAC;AAED,SAAK,MAAM,IAAI,KAAK,OAAO;AAC3B,WAAO,MAAM;AAAA,EACf;AAAA,EAEA,MAAc,uBACZ,WACA,WACA,SACiC;AACjC,UAAM,MAAM,UAAU,KAAK,KAAK,KAAK,OAAO;AAC5C,UAAM,UAAU,MAAM,KAAK,cAAc,WAAW,GAAG;AACvD,UAAM,6BACJ,QAAQ,KAAK,OAAO,oBAAoB,QAAQ,QAAQ,KAAK,OAAO;AACtE,UAAM,0BACJ,6BAA6B,KAAK,MAAM,EAAE,eAAe,QAAQ;AACnE,UAAM,yBACH,KAAK,OAAuC,8BAC7C,KAAK,OAAO;AACd,UAAM,eAA4C;AAAA,MAChD,GAAG,KAAK;AAAA,MACR,WAAW,QAAQ;AAAA,MACnB,4BAA4B;AAAA,MAC5B,eAAe,wBAAwB,KAAK,OAAO,eAAe,KAAK;AAAA,QACrE,kBAAkB,KAAK,OAAO;AAAA,QAC9B;AAAA,MACF,CAAC;AAAA,IACH;AAEA,UAAM,UAAU,KAAK,cAAc,YAAY;AAC/C,QAAI;AACF,YAAM,oBACJ,QAAQ,wBAAwB,OAAO,QAAQ,sBAAsB,aACjE,QAAQ,MAAM,SAAS,IACvB,QAAQ,kBAAkB,EAAE,QAAQ,WAAW,OAAO,CAAC;AAC7D,YAAM,YAAY,MAAM,eAAe,mBAAmB,WAAW,MAAM,EAAE,MAAM,CAAC,UAAU;AAC5F,YAAI,iBAAiB,6BAA6B,CAAC,QAAQ,oBAAoB;AAC7E,gBAAM;AAAA,QACR;AACA,eAAO;AAAA,MACT,CAAC;AACD,YAAM,kBAAkB,YACpB,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAYN,KAAK,0BAA0B,SAAS,QAAQ,KAAK,aAAa,eAAe;AAAA,UAC/E,YAAY,QAAQ;AAAA,UACpB,kCAAkC,QAAQ;AAAA,UAC1C;AAAA,QACF,CAAC;AAAA,QACD,WAAW;AAAA,MACb,EAAE,MAAM,CAAC,UAAU;AACjB,YAAI,iBAAiB,6BAA6B,CAAC,QAAQ,oBAAoB;AAC7E,gBAAM;AAAA,QACR;AACA,eAAO;AAAA,MACT,CAAC,IACC;AACJ,aAAO;AAAA,QACL;AAAA,QACA,YAAY,aAAa;AAAA,QACzB,WAAW,QAAQ;AAAA,QACnB;AAAA,QACA;AAAA,QACA;AAAA,QACA,UAAU;AAAA,MACZ;AAAA,IACF,SAAS,OAAO;AACd,YAAM,UAAW,QAAqD;AACtE,UAAI,SAAS;AACX,cAAM,QAAQ,QAAQ,QAAQ,KAAK,OAAO,CAAC,EAAE,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MAC7D;AACA,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAc,0BACZ,SACA,WACA,YACA,SAK0B;AAC1B,QAAI,CAAC,QAAQ,YAAY;AACvB,UAAI,CAAC,QAAQ,gBAAiB,QAAO;AACrC,YAAM,kBAAkB,MAAM,QAC3B,gBAAgB,YAAY,QAAQ,SAAS,EAC7C,MAAM,MAAM,SAAkB;AACjC,aAAO,QAAQ,oCAAoC,oBAAoB,YACnE,YACA;AAAA,IACN;AACA,WAAO,MAAM,QAAQ,iBAAiB,WAAW,YAAY,QAAQ,SAAS,EAAE,MAAM,MAAM,SAAkB;AAAA,EAChH;AACF;AAEA,IAAM,4BAAN,cAAwC,MAAM;AAAA,EAC5C,cAAc;AACZ,UAAM,mBAAmB;AAAA,EAC3B;AACF;AAEA,SAAS,eAAkB,WAAuB,QAAkC;AAClF,MAAI,CAAC,OAAQ,QAAO;AACpB,MAAI,OAAO,SAAS;AAIlB,cAAU,MAAM,MAAM;AAAA,IAAC,CAAC;AACxB,WAAO,QAAQ,OAAO,IAAI,0BAA0B,CAAC;AAAA,EACvD;AAEA,SAAO,IAAI,QAAW,CAAC,SAAS,WAAW;AACzC,UAAM,UAAU,MAAM;AACpB,aAAO,oBAAoB,SAAS,OAAO;AAC3C,aAAO,IAAI,0BAA0B,CAAC;AAAA,IACxC;AACA,WAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AACxD,cAAU,KAAK,SAAS,MAAM,EAAE,QAAQ,MAAM;AAC5C,aAAO,oBAAoB,SAAS,OAAO;AAAA,IAC7C,CAAC;AAAA,EACH,CAAC;AACH;AAEA,SAAS,8BACP,QACA,SACmB;AACnB,MAAI,CAAC,OAAO,wBAAyB,QAAO;AAC5C,SAAO,QAAQ;AAAA,IAAO,CAAC,WACrB,CAAC,6BAA6B,OAAO,WAAW,OAAO,YAAY,OAAO,IAAI;AAAA,EAChF;AACF;AAEA,SAAS,mBACP,QACA,YACQ;AACR,MAAI,CAAC,OAAO,wBAAyB,QAAO;AAC5C,SAAO,KAAK;AAAA,IACV;AAAA,IACA,aAAa;AAAA,IACb;AAAA,EACF;AACF;AAEA,eAAe,oBACb,QACA,WACA,SACe;AACf,MAAI,SAAS,WAAW,MAAM;AAC5B;AAAA;AAAA;AAAA;AAAA,MAIE,QAAQ,UAAU,QAClB,OAAO,QAAQ,wBAAwB,MAAM,QAC7C,OAAO,OAAO,QAAQ,iBAAiB;AAAA,MACvC;AACA,YAAM,OAAO,QAAQ,aAAa,SAAS;AAC3C;AAAA,IACF;AACA,QAAI,OAAO,OAAO,QAAQ,2BAA2B,YAAY;AAC/D,YAAM,OAAO,QAAQ,uBAAuB,OAAO,YAAY,SAAS;AACxE;AAAA,IACF;AAIA,UAAM,YAAY,MAAM,OAAO,QAAQ,kBAAkB,SAAS;AAClE,QAAI,cAAc,QAAW;AAC3B,UAAI,CAAC,UAAW,OAAM,IAAI,MAAM,wCAAwC;AACxE;AAAA,IACF;AAAA,EACF;AACA,QAAM,OAAO,QAAQ,OAAO,SAAS;AACvC;AAEA,eAAe,mBACb,QACA,SACe;AACf,MAAI,SAAS,WAAW,MAAM;AAC5B,QAAI,OAAO,OAAO,QAAQ,0BAA0B,YAAY;AAC9D,YAAM,OAAO,QAAQ,sBAAsB,OAAO,UAAU;AAC5D;AAAA,IACF;AACA,QAAI,OAAO,OAAO,QAAQ,gBAAgB,YAAY;AACpD,YAAM,OAAO,QAAQ,YAAY;AACjC;AAAA,IACF;AAAA,EACF;AACA,MAAI,OAAO,OAAO,QAAQ,oBAAoB,YAAY;AACxD,UAAM,OAAO,QAAQ,gBAAgB,OAAO,UAAU;AACtD;AAAA,EACF;AACA,QAAM,OAAO,QAAQ,MAAM;AAC7B;AAEA,SAAS,qBAAqB,SAAwC;AACpE,SAAO,kBAAkB,WAAW,OAAO,QAAQ,iBAAiB,aAChE,QAAQ,aAAa,MAAM,OAC3B;AACN;AAEA,SAAS,gBAAgB,MAAc,WAA4B;AACjE,QAAM,WAAW,KAAK,SAAS,MAAM,SAAS;AAC9C,SACE,aAAa,MACZ,aAAa,QAAQ,CAAC,SAAS,WAAW,KAAK,KAAK,GAAG,EAAE,KAAK,CAAC,KAAK,WAAW,QAAQ;AAE5F;AAEA,SAAS,6BACP,WACA,YACA,YACS;AACT,MAAI,CAAC,WAAY,QAAO;AACxB,QAAM,uBAAuB,uBAAuB,YAAY,UAAU;AAC1E,QAAM,aAAa,KAAK,QAAQ,SAAS;AACzC,QAAM,iBAAiB,KAAK,KAAK,YAAY,YAAY;AACzD,QAAM,YAAY,KAAK,WAAW,oBAAoB,IAClD,KAAK,UAAU,oBAAoB,IACnC,KAAK,QAAQ,YAAY,oBAAoB;AACjD,SAAO,gBAAgB,gBAAgB,SAAS;AAClD;AAiBA,SAAS,kCAAkC,WAAmB,cAA+B;AAC3F,QAAM,OAAO,KAAK,QAAQ,SAAS;AACnC,QAAM,YAAY,KAAK,WAAW,YAAY,IAC1C,KAAK,UAAU,YAAY,IAC3B,KAAK,QAAQ,MAAM,YAAY;AACnC,MAAI,CAAC,gBAAgB,MAAM,SAAS,EAAG,QAAO;AAC9C,MAAI;AACF,WAAO,gBAAgB,aAAa,OAAO,IAAI,GAAG,aAAa,OAAO,SAAS,CAAC;AAAA,EAClF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AACO,SAAS,uBAAuB,YAAoB,YAA4B;AACrF,MAAI,QAAQ,WAAW,KAAK;AAC5B,MAAI,MAAM,WAAW,QAAQ,GAAG;AAC9B,QAAI;AACF,YAAM,SAAS,IAAI,IAAI,KAAK;AAC5B,UAAI,OAAO,aAAa,UAAU,OAAO,aAAa,YAAY;AAChE,gBAAQ,mBAAmB,OAAO,SAAS,QAAQ,QAAQ,EAAE,CAAC;AAAA,MAChE;AAAA,IACF,QAAQ;AACN,YAAM,YAAY,MAAM,MAAM,SAAS,MAAM;AAC7C,YAAM,aAAa,UAAU,QAAQ,GAAG;AACxC,UAAI,eAAe,IAAI;AACrB,gBAAQ,UAAU,MAAM,aAAa,CAAC;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAMA,QAAM,mBAAmB,GAAG,UAAU;AACtC,MAAI,MAAM,WAAW,gBAAgB,KAAK,CAAC,kBAAkB,SAAS,UAAU,GAAG;AACjF,YAAQ,MAAM,MAAM,iBAAiB,MAAM;AAAA,EAC7C;AACA,SAAO;AACT;AACO,SAAS,2BACd,WACA,YACA,YACQ;AACR,QAAM,aAAa,uBAAuB,YAAY,UAAU;AAChE,MAAI,KAAK,WAAW,UAAU,EAAG,QAAO;AACxC,QAAM,OAAO,KAAK,QAAQ,SAAS;AACnC,QAAM,WAAW,KAAK,QAAQ,MAAM,UAAU;AAC9C,QAAM,WAAW,KAAK,SAAS,MAAM,QAAQ;AAC7C,MAAI,aAAa,MAAM,SAAS,WAAW,IAAI,KAAK,KAAK,WAAW,QAAQ,GAAG;AAC7E,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACA,SAAS,4BACP,OACA,YACmB;AACnB,QAAM,SAAS,oBAAI,IAA6B;AAEhD,aAAW,EAAE,WAAW,QAAQ,KAAK,OAAO;AAC1C,eAAW,UAAU,SAAS;AAC5B,YAAM,MAAM,GAAG,SAAS,KAAK,OAAO,QAAQ,OAAO,KAAK;AACxD,YAAM,WAAW,OAAO,IAAI,GAAG;AAC/B,UAAI,CAAC,UAAU;AACb,eAAO,IAAI,KAAK,EAAE,GAAG,QAAQ,UAAU,CAAC;AACxC;AAAA,MACF;AACA,UAAI,OAAO,QAAQ,SAAS,OAAO;AACjC,eAAO,IAAI,KAAK;AAAA,UACd,GAAG;AAAA,UACH;AAAA,UACA,SAAS,SAAS,WAAW,OAAO,WAAW;AAAA,QACjD,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EACvB,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,UAAU;AACxB;","names":[]}

package/dist/{chunk-4HK7DYOL.js → chunk-CCQEANCY.js}

@@ -1,7 +1,7 @@
 import {
   rebuildMemoryProjection,
   watchProjectionRebuildParent
-} from "./chunk-B7L4ZYFY.js";
+} from "./chunk-KI7E3N6Q.js";
 import {
   initLogger,
   log
@@ -77,4 +77,4 @@ if (invokedAsRunner) {
 export {
   PROJECTION_REBUILD_RUNNER_FLAG
 };
-//# sourceMappingURL=chunk-4HK7DYOL.js.map
+//# sourceMappingURL=chunk-CCQEANCY.js.map

package/dist/{chunk-HA5DASDG.js → chunk-CH2N4XCJ.js}

@@ -34,7 +34,7 @@ import {
 } from "./chunk-2DQ2XREU.js";
 import {
   compareEntityTimestamps
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   normalizeEntityText,
   resolveRequestedEntitySectionKeys
@@ -927,4 +927,4 @@ export {
   entityIndexVersion,
   entityRecentTranscriptLookbackHours
 };
-//# sourceMappingURL=chunk-HA5DASDG.js.map
+//# sourceMappingURL=chunk-CH2N4XCJ.js.map

package/dist/{chunk-4CXK3GT3.js → chunk-D6WJNWZG.js}

@@ -26,7 +26,7 @@ import {
 import {
   normalizeQmdResultPath,
   resolveNamespaceResultPath
-} from "./chunk-WVIWDMFB.js";
+} from "./chunk-BUOP3DOK.js";
 import {
   withholdToolScopedFromSharedNamespace
 } from "./chunk-S2V7RUCL.js";
@@ -13304,4 +13304,4 @@ export {
   isValidBufferSurpriseEvent,
   StorageManager3 as StorageManager
 };
-//# sourceMappingURL=chunk-4CXK3GT3.js.map
+//# sourceMappingURL=chunk-D6WJNWZG.js.map

package/dist/{chunk-NX4XDDFQ.js → chunk-E3YHIAO3.js}

@@ -8,11 +8,11 @@ import {
 } from "./chunk-5CO5G4MN.js";
 import {
   resolveDefaultNamespaceRoot
-} from "./chunk-2LCX6TAD.js";
+} from "./chunk-SW3WUUYA.js";
 import {
   StorageManager,
   readRawMemoryDocument
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   parseContinuityImprovementLoops
 } from "./chunk-LDXUBPMO.js";
@@ -1869,4 +1869,4 @@ export {
   defaultTierMigrationCycleBudget,
   CompoundingEngine
 };
-//# sourceMappingURL=chunk-NX4XDDFQ.js.map
+//# sourceMappingURL=chunk-E3YHIAO3.js.map

package/dist/{chunk-EJ23D4JG.js → chunk-ECC6AAEE.js}

@@ -1,9 +1,9 @@
 import {
   resolveDefaultNamespaceRoot
-} from "./chunk-2LCX6TAD.js";
+} from "./chunk-SW3WUUYA.js";
 import {
   StorageManager
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   resolveNamespaceCapabilities
 } from "./chunk-C5LWPYS3.js";
@@ -779,4 +779,4 @@ export {
   LOCATION_SYNC_DEFAULT_INTERVAL_MS,
   startLocationAutoSync
 };
-//# sourceMappingURL=chunk-EJ23D4JG.js.map
+//# sourceMappingURL=chunk-ECC6AAEE.js.map

package/dist/{chunk-DWWX3FU3.js → chunk-EHJ2RYR7.js}

@@ -1,9 +1,9 @@
 import {
   NamespaceStorageRouter
-} from "./chunk-2LCX6TAD.js";
+} from "./chunk-SW3WUUYA.js";
 import {
   namespaceCollectionName
-} from "./chunk-WVIWDMFB.js";
+} from "./chunk-BUOP3DOK.js";
 import {
   isSafeRouteNamespace
 } from "./chunk-PCXDUHQH.js";
@@ -213,4 +213,4 @@ export {
   verifyNamespaces,
   runNamespaceMigration
 };
-//# sourceMappingURL=chunk-DWWX3FU3.js.map
+//# sourceMappingURL=chunk-EHJ2RYR7.js.map

package/dist/{chunk-5AJIGWY4.js → chunk-FHQ5SPMD.js}

@@ -1,7 +1,7 @@
 import {
   resolveDefaultNamespaceRoot,
   resolveNamespaceStorageRoot
-} from "./chunk-2LCX6TAD.js";
+} from "./chunk-SW3WUUYA.js";
 import {
   getConfiguredNamespaces
 } from "./chunk-QRMG4HK4.js";
@@ -2308,4 +2308,4 @@ export {
   runNamespaceMaintenancePlan,
   runNamespaceMaintenanceBatchPlan
 };
-//# sourceMappingURL=chunk-5AJIGWY4.js.map
+//# sourceMappingURL=chunk-FHQ5SPMD.js.map

package/dist/{chunk-53ZVHXVZ.js → chunk-FVPWQWIK.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-B7RWBZXW.js";
 import {
   StorageManager
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   countRecallTokenOverlap,
   normalizeRecallTokens
@@ -109,4 +109,4 @@ export {
   compareVerifiedEpisodeResults,
   searchVerifiedEpisodes
 };
-//# sourceMappingURL=chunk-53ZVHXVZ.js.map
+//# sourceMappingURL=chunk-FVPWQWIK.js.map

package/dist/{chunk-B7L4ZYFY.js → chunk-KI7E3N6Q.js}

@@ -4,13 +4,13 @@ import {
 import {
   listMemoryGovernanceRuns,
   readMemoryGovernanceRunArtifact
-} from "./chunk-GLDIMGOS.js";
+} from "./chunk-PWATRW3H.js";
 import {
   loadPersistedNativeKnowledgeChunks
 } from "./chunk-2DQ2XREU.js";
 import {
   StorageManager
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   normalizeProjectionPreview,
   normalizeProjectionTags
@@ -1156,4 +1156,4 @@ export {
   verifyMemoryProjection,
   repairMemoryProjection
 };
-//# sourceMappingURL=chunk-B7L4ZYFY.js.map
+//# sourceMappingURL=chunk-KI7E3N6Q.js.map

package/dist/{chunk-U6TC6Z5B.js → chunk-MXXTU4R2.js}

@@ -2,7 +2,7 @@ import {
   WHO_KNOWS_DEFAULT_LIMIT,
   WHO_KNOWS_MAX_LIMIT,
   validateWhoKnowsInput
-} from "./chunk-R4JYSBZE.js";
+} from "./chunk-RXL67CV6.js";
 
 // src/who-knows-cli.ts
 function extractWhoKnowsRawArgs(rest) {
@@ -74,4 +74,4 @@ export {
   renderWhoKnowsText,
   renderWhoKnows
 };
-//# sourceMappingURL=chunk-U6TC6Z5B.js.map
+//# sourceMappingURL=chunk-MXXTU4R2.js.map

package/dist/{chunk-7E7J7QXB.js → chunk-OTSRGZRU.js}

@@ -1,6 +1,6 @@
 import {
   listNamespaces
-} from "./chunk-DWWX3FU3.js";
+} from "./chunk-EHJ2RYR7.js";
 import {
   corpusScanWorker
 } from "./chunk-4LZ7SVKM.js";
@@ -292,4 +292,4 @@ export {
   computeServiceCorpusWatermarks,
   computeServiceCorpusCensus
 };
-//# sourceMappingURL=chunk-7E7J7QXB.js.map
+//# sourceMappingURL=chunk-OTSRGZRU.js.map

package/dist/{chunk-GLDIMGOS.js → chunk-PWATRW3H.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-TBBDFYXW.js";
 import {
   StorageManager
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   requestEntityCanonicalIdReconcile
 } from "./chunk-O3GZPLVY.js";
@@ -769,4 +769,4 @@ export {
   listMemoryGovernanceRuns,
   readMemoryGovernanceRunArtifact
 };
-//# sourceMappingURL=chunk-GLDIMGOS.js.map
+//# sourceMappingURL=chunk-PWATRW3H.js.map

package/dist/{chunk-R4JYSBZE.js → chunk-RXL67CV6.js}

@@ -1,6 +1,6 @@
 import {
   parseEntityFile
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   inferMemoryStatus
 } from "./chunk-7RJUVTVF.js";
@@ -253,4 +253,4 @@ export {
   WHO_KNOWS_MCP_TOOLS,
   handleWhoKnowsHttpQuery
 };
-//# sourceMappingURL=chunk-R4JYSBZE.js.map
+//# sourceMappingURL=chunk-RXL67CV6.js.map

package/dist/{chunk-JH5AV542.js → chunk-SFZEJJ6V.js}

@@ -1,6 +1,6 @@
 import {
   rebuildMemoryProjection
-} from "./chunk-B7L4ZYFY.js";
+} from "./chunk-KI7E3N6Q.js";
 
 // src/convergence-refresh.ts
 async function refreshConvergedNamespaces(namespaces, namespaceSearchRouter, getStorage, searchEnabled) {
@@ -32,4 +32,4 @@ async function refreshConvergedNamespaces(namespaces, namespaceSearchRouter, get
 export {
   refreshConvergedNamespaces
 };
-//# sourceMappingURL=chunk-JH5AV542.js.map
+//# sourceMappingURL=chunk-SFZEJJ6V.js.map

package/dist/{chunk-2LCX6TAD.js → chunk-SW3WUUYA.js}

@@ -1,6 +1,6 @@
 import {
   StorageManager
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   isSafeRouteNamespace
 } from "./chunk-PCXDUHQH.js";
@@ -416,4 +416,4 @@ export {
   resolveNamespaceStorageRoot,
   NamespaceStorageRouter
 };
-//# sourceMappingURL=chunk-2LCX6TAD.js.map
+//# sourceMappingURL=chunk-SW3WUUYA.js.map

package/dist/{chunk-F4BUSX3D.js → chunk-TFI2Y5AR.js}

@@ -1,6 +1,6 @@
 import {
   parseFrontmatter
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   activityDigestPath,
   isValidActivityDate
@@ -199,4 +199,4 @@ export {
   buildStandup,
   standupHelp
 };
-//# sourceMappingURL=chunk-F4BUSX3D.js.map
+//# sourceMappingURL=chunk-TFI2Y5AR.js.map

package/dist/{chunk-LRLQ2PRP.js → chunk-TZKK72BY.js}

@@ -2,7 +2,7 @@ import {
   ExtractionDrain,
   TurnIngestionCoordinator,
   shouldSkipImplicitExtraction
-} from "./chunk-TFMLRVMW.js";
+} from "./chunk-5DGK7E4W.js";
 import {
   headerConnector,
   renderExtractionConversation,
@@ -13,7 +13,7 @@ import {
 } from "./chunk-5NFF2TSD.js";
 import {
   selfDeps
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   describeError,
   groupTurnsByExtractionScope
@@ -447,4 +447,4 @@ export {
   ClaimBufferStorage,
   BufferDrainRunner
 };
-//# sourceMappingURL=chunk-LRLQ2PRP.js.map
+//# sourceMappingURL=chunk-TZKK72BY.js.map

package/dist/{chunk-RUQE5C32.js → chunk-UG54AEUG.js}

@@ -1,6 +1,6 @@
 import {
   StorageManager
-} from "./chunk-4CXK3GT3.js";
+} from "./chunk-D6WJNWZG.js";
 import {
   composeMemoryEnvelope
 } from "./chunk-X26YOFGS.js";
@@ -546,4 +546,4 @@ export {
   setSemanticRulePromotionTestHooks,
   promoteSemanticRuleFromMemory
 };
-//# sourceMappingURL=chunk-RUQE5C32.js.map
+//# sourceMappingURL=chunk-UG54AEUG.js.map