@equationalapplications/core-llm-wiki 7.7.5 → 7.7.6

package/dist/index.d.mts

@@ -1,5 +1,5 @@
-import { M as MemoryBundle, F as FormatContextOptions, G as GraphNeighborhood, a as MemoryDump, b as FormattedMemoryDump, R as ReadOptions, S as SQLiteAdapter, W as WikiOptions, c as WikiMemory } from './testing-CH_Kk34-.mjs';
-export { C as ChunkFailure, d as ClassifierAnswer, e as ClassifierQuestion, f as ClassifyRequest, g as ClassifyResponse, D as DegradedRecord, h as DraftPage, E as EmbedFactResult, i as EmbedFailureKind, j as EmbeddingMarkerKind, k as EntityStatus, l as ExtractedFact, m as ExtractedFactEdge, n as ExtractedFactWithOntology, o as ExtractedTask, p as GraphTraversalOptions, q as GroundingConfig, H as HEAL_BATCH_SIZE, r as HEAL_RECHECK_MS, s as HOOK_TIMEOUT_MARKER, t as HealResult, I as IngestDocumentResult, L as LLMProvider, O as ONTOLOGY_BACKFILL_BATCH_SIZE, u as ONTOLOGY_BACKFILL_MAX_PROMPT_CHARS, v as ONTOLOGY_BACKFILL_RECHECK_MS, w as OntologyBackfillResult, x as OntologyConfig, y as OntologyEdgeType, z as OntologyManifest, A as OntologyMode, B as OntologyNodeType, J as OntologyPromptContext, K as OntologyUpdates, P as PendingSourceStatus, N as PromptOverrides, Q as PromptService, T as PrunePartialFailureError, U as ReembedResult, V as VectorRanker, X as VectorRankerFallback, Y as VectorRankerRankArgs, Z as VectorRankerSemanticResult, _ as WikiBusyError, $ as WikiBusyOperation, a0 as WikiCheckpoint, a1 as WikiConfig, a2 as WikiDiagnostic, a3 as WikiDiagnosticCode, a4 as WikiDiagnosticDetail, a5 as WikiDiagnosticOperation, a6 as WikiDiagnosticSeverity, a7 as WikiDiagnosticTrigger, a8 as WikiDraftNotFound, a9 as WikiDuplicateHashError, aa as WikiEdge, ab as WikiEvent, ac as WikiFact, ad as WikiGraphNodeOwnershipConflict, ae as WikiIngestEmptyError, af as WikiInstructions, ag as WikiInvalidReadOptions, ah as WikiLintReport, ai as WikiMemoryTestAccess, aj as WikiOutboxEvent, ak as WikiParseError, al as WikiSourceRefHashCollision, am as WikiStrictOntologyViolation, an as WikiTask, ao as WikiTransactionError, ap as validateManifest } from './testing-CH_Kk34-.mjs';
+import { M as MemoryBundle, F as FormatContextOptions, G as GraphNeighborhood, a as MemoryDump, b as FormattedMemoryDump, R as ReadOptions, S as SQLiteAdapter, W as WikiOptions, c as WikiMemory } from './testing-BIFNLUva.mjs';
+export { C as ChunkFailure, d as ClassifierAnswer, e as ClassifierQuestion, f as ClassifyRequest, g as ClassifyResponse, D as DegradedRecord, h as DraftPage, E as EmbedFactResult, i as EmbedFailureKind, j as EmbeddingMarkerKind, k as EntityStatus, l as ExtractedFact, m as ExtractedFactEdge, n as ExtractedFactWithOntology, o as ExtractedTask, p as GraphTraversalOptions, q as GroundingConfig, H as HEAL_BATCH_SIZE, r as HEAL_RECHECK_MS, s as HOOK_TIMEOUT_MARKER, t as HealResult, I as IngestDocumentResult, L as LLMProvider, O as ONTOLOGY_BACKFILL_BATCH_SIZE, u as ONTOLOGY_BACKFILL_MAX_PROMPT_CHARS, v as ONTOLOGY_BACKFILL_RECHECK_MS, w as OntologyBackfillResult, x as OntologyConfig, y as OntologyEdgeType, z as OntologyManifest, A as OntologyMode, B as OntologyNodeType, J as OntologyPromptContext, K as OntologyUpdates, P as PendingSourceStatus, N as PromptOverrides, Q as PromptService, T as PrunePartialFailureError, U as ReembedResult, V as VectorRanker, X as VectorRankerFallback, Y as VectorRankerRankArgs, Z as VectorRankerSemanticResult, _ as WikiBusyError, $ as WikiBusyOperation, a0 as WikiCheckpoint, a1 as WikiConfig, a2 as WikiDiagnostic, a3 as WikiDiagnosticCode, a4 as WikiDiagnosticDetail, a5 as WikiDiagnosticOperation, a6 as WikiDiagnosticSeverity, a7 as WikiDiagnosticTrigger, a8 as WikiDraftNotFound, a9 as WikiDuplicateHashError, aa as WikiEdge, ab as WikiEvent, ac as WikiFact, ad as WikiGraphNodeOwnershipConflict, ae as WikiIngestEmptyError, af as WikiInstructions, ag as WikiInvalidReadOptions, ah as WikiLintReport, ai as WikiMemoryTestAccess, aj as WikiOutboxEvent, ak as WikiParseError, al as WikiSourceRefHashCollision, am as WikiStrictOntologyViolation, an as WikiTask, ao as WikiTransactionError, ap as validateManifest } from './testing-BIFNLUva.mjs';
 import { OkfFile } from '@equationalapplications/core-okf';
 import 'minisearch';
 

package/dist/index.d.ts

@@ -1,5 +1,5 @@
-import { M as MemoryBundle, F as FormatContextOptions, G as GraphNeighborhood, a as MemoryDump, b as FormattedMemoryDump, R as ReadOptions, S as SQLiteAdapter, W as WikiOptions, c as WikiMemory } from './testing-CH_Kk34-.js';
-export { C as ChunkFailure, d as ClassifierAnswer, e as ClassifierQuestion, f as ClassifyRequest, g as ClassifyResponse, D as DegradedRecord, h as DraftPage, E as EmbedFactResult, i as EmbedFailureKind, j as EmbeddingMarkerKind, k as EntityStatus, l as ExtractedFact, m as ExtractedFactEdge, n as ExtractedFactWithOntology, o as ExtractedTask, p as GraphTraversalOptions, q as GroundingConfig, H as HEAL_BATCH_SIZE, r as HEAL_RECHECK_MS, s as HOOK_TIMEOUT_MARKER, t as HealResult, I as IngestDocumentResult, L as LLMProvider, O as ONTOLOGY_BACKFILL_BATCH_SIZE, u as ONTOLOGY_BACKFILL_MAX_PROMPT_CHARS, v as ONTOLOGY_BACKFILL_RECHECK_MS, w as OntologyBackfillResult, x as OntologyConfig, y as OntologyEdgeType, z as OntologyManifest, A as OntologyMode, B as OntologyNodeType, J as OntologyPromptContext, K as OntologyUpdates, P as PendingSourceStatus, N as PromptOverrides, Q as PromptService, T as PrunePartialFailureError, U as ReembedResult, V as VectorRanker, X as VectorRankerFallback, Y as VectorRankerRankArgs, Z as VectorRankerSemanticResult, _ as WikiBusyError, $ as WikiBusyOperation, a0 as WikiCheckpoint, a1 as WikiConfig, a2 as WikiDiagnostic, a3 as WikiDiagnosticCode, a4 as WikiDiagnosticDetail, a5 as WikiDiagnosticOperation, a6 as WikiDiagnosticSeverity, a7 as WikiDiagnosticTrigger, a8 as WikiDraftNotFound, a9 as WikiDuplicateHashError, aa as WikiEdge, ab as WikiEvent, ac as WikiFact, ad as WikiGraphNodeOwnershipConflict, ae as WikiIngestEmptyError, af as WikiInstructions, ag as WikiInvalidReadOptions, ah as WikiLintReport, ai as WikiMemoryTestAccess, aj as WikiOutboxEvent, ak as WikiParseError, al as WikiSourceRefHashCollision, am as WikiStrictOntologyViolation, an as WikiTask, ao as WikiTransactionError, ap as validateManifest } from './testing-CH_Kk34-.js';
+import { M as MemoryBundle, F as FormatContextOptions, G as GraphNeighborhood, a as MemoryDump, b as FormattedMemoryDump, R as ReadOptions, S as SQLiteAdapter, W as WikiOptions, c as WikiMemory } from './testing-BIFNLUva.js';
+export { C as ChunkFailure, d as ClassifierAnswer, e as ClassifierQuestion, f as ClassifyRequest, g as ClassifyResponse, D as DegradedRecord, h as DraftPage, E as EmbedFactResult, i as EmbedFailureKind, j as EmbeddingMarkerKind, k as EntityStatus, l as ExtractedFact, m as ExtractedFactEdge, n as ExtractedFactWithOntology, o as ExtractedTask, p as GraphTraversalOptions, q as GroundingConfig, H as HEAL_BATCH_SIZE, r as HEAL_RECHECK_MS, s as HOOK_TIMEOUT_MARKER, t as HealResult, I as IngestDocumentResult, L as LLMProvider, O as ONTOLOGY_BACKFILL_BATCH_SIZE, u as ONTOLOGY_BACKFILL_MAX_PROMPT_CHARS, v as ONTOLOGY_BACKFILL_RECHECK_MS, w as OntologyBackfillResult, x as OntologyConfig, y as OntologyEdgeType, z as OntologyManifest, A as OntologyMode, B as OntologyNodeType, J as OntologyPromptContext, K as OntologyUpdates, P as PendingSourceStatus, N as PromptOverrides, Q as PromptService, T as PrunePartialFailureError, U as ReembedResult, V as VectorRanker, X as VectorRankerFallback, Y as VectorRankerRankArgs, Z as VectorRankerSemanticResult, _ as WikiBusyError, $ as WikiBusyOperation, a0 as WikiCheckpoint, a1 as WikiConfig, a2 as WikiDiagnostic, a3 as WikiDiagnosticCode, a4 as WikiDiagnosticDetail, a5 as WikiDiagnosticOperation, a6 as WikiDiagnosticSeverity, a7 as WikiDiagnosticTrigger, a8 as WikiDraftNotFound, a9 as WikiDuplicateHashError, aa as WikiEdge, ab as WikiEvent, ac as WikiFact, ad as WikiGraphNodeOwnershipConflict, ae as WikiIngestEmptyError, af as WikiInstructions, ag as WikiInvalidReadOptions, ah as WikiLintReport, ai as WikiMemoryTestAccess, aj as WikiOutboxEvent, ak as WikiParseError, al as WikiSourceRefHashCollision, am as WikiStrictOntologyViolation, an as WikiTask, ao as WikiTransactionError, ap as validateManifest } from './testing-BIFNLUva.js';
 import { OkfFile } from '@equationalapplications/core-okf';
 import 'minisearch';
 

package/dist/index.js

@@ -744,7 +744,7 @@ function mapRowToFactWithBlobs(row) {
   const embeddingBlob = normalizeEmbeddingBlobValue(row.embedding_blob);
   return embeddingBlob ? { ...base, embedding_blob: embeddingBlob } : base;
 }
-var EntryRepository = class extends BaseRepository {
+var _EntryRepository = class _EntryRepository extends BaseRepository {
   constructor(db, prefix, outbox) {
     super(db, prefix);
     this.outbox = outbox;
@@ -1429,14 +1429,34 @@ var EntryRepository = class extends BaseRepository {
     const executor = this.getExecutor(tx);
     if (entityId !== void 0) {
       return executor.getAllAsync(
-        `SELECT id, entity_id, title, body, tags FROM ${this.prefix}entries WHERE deleted_at IS NULL AND entity_id = ?`,
+        `SELECT ${_EntryRepository.MINI_SEARCH_COLUMNS} FROM ${this.prefix}entries ${_EntryRepository.MINI_SEARCH_LIVE_WHERE} AND entity_id = ?`,
         [entityId]
       );
     }
     return executor.getAllAsync(
-      `SELECT id, entity_id, title, body, tags FROM ${this.prefix}entries WHERE deleted_at IS NULL`
+      `SELECT ${_EntryRepository.MINI_SEARCH_COLUMNS} FROM ${this.prefix}entries ${_EntryRepository.MINI_SEARCH_LIVE_WHERE}`
     );
   }
+  /**
+   * Keyword-index rows for specific ids — the incremental counterpart of
+   * {@link findMiniSearchRows}, with identical columns. Soft-deleted rows and
+   * rows of other entities are omitted, so a caller can pass every id a write
+   * touched and get back exactly what should be indexed. Spec 2026-09-28 §4.4.
+   */
+  async findMiniSearchRowsByIds(entityId, ids, tx) {
+    if (ids.length === 0) return [];
+    const executor = this.getExecutor(tx);
+    const rows = [];
+    for (let i = 0; i < ids.length; i += this.chunkSize) {
+      const chunk = ids.slice(i, i + this.chunkSize);
+      const placeholders = chunk.map(() => "?").join(",");
+      rows.push(...await executor.getAllAsync(
+        `SELECT ${_EntryRepository.MINI_SEARCH_COLUMNS} FROM ${this.prefix}entries ${_EntryRepository.MINI_SEARCH_LIVE_WHERE} AND entity_id = ? AND id IN (${placeholders})`,
+        [entityId, ...chunk]
+      ));
+    }
+    return rows;
+  }
   async updateEmbeddingBlob(id, blob, tx) {
     const executor = this.getExecutor(tx);
     await executor.runAsync(
@@ -1977,6 +1997,15 @@ var EntryRepository = class extends BaseRepository {
     return rows.map((r) => ({ id: r.id, title: r.title }));
   }
 };
+/**
+ * Column list and liveness predicate shared by findMiniSearchRows and
+ * findMiniSearchRowsByIds, so the full rebuild and the incremental read
+ * can never drift apart (spec 2026-09-28 §4.4: both must produce
+ * identical documents).
+ */
+_EntryRepository.MINI_SEARCH_COLUMNS = "id, entity_id, title, body, tags";
+_EntryRepository.MINI_SEARCH_LIVE_WHERE = "WHERE deleted_at IS NULL";
+var EntryRepository = _EntryRepository;
 
 // src/utils/ids.ts
 var _injectedGetRandomValues = null;
@@ -3113,7 +3142,31 @@ var _SearchService = class _SearchService {
      * auto-vacuum debt behind the TypeError in #64.
      */
     this.syncChain = Promise.resolve();
-    this.miniSearch = new MiniSearch__default.default({
+    /**
+     * Entities whose index may have drifted from SQLite: an incremental update
+     * failed part-way, or core wrote rows it could not index (upsertGraph runs in
+     * the host's transaction). Their next syncEntries rebuilds the entity in full.
+     * See spec 2026-09-28 §5.
+     */
+    this.staleEntities = /* @__PURE__ */ new Set();
+    /**
+     * Per-entity count of markStale() calls. A rebuild clears an entity's stale
+     * flag only when the count it snapshotted before its read still holds
+     * afterwards: markStale() runs inside the host's still-open transaction, so
+     * a call landing mid-read belongs to rows the read cannot have seen, and
+     * its flag must outlive the turn (#233 review).
+     */
+    this.staleEpochs = /* @__PURE__ */ new Map();
+    this.miniSearch = this.createMiniSearch();
+  }
+  /**
+   * A fresh index with the production options. clearAll() swaps one in because
+   * MiniSearch.removeAll() empties the index but leaves dirtCount (and its
+   * vacuum bookkeeping) at its old value, which would trip syncEntries'
+   * conditional vacuum early after a clear.
+   */
+  createMiniSearch() {
+    return new MiniSearch__default.default({
       fields: ["title", "body", "tags"],
       storeFields: ["entity_id"],
       // Vacuuming is driven explicitly at the end of each serialized rebuild
@@ -3140,7 +3193,19 @@ var _SearchService = class _SearchService {
     const work = this.syncChain.then(async () => {
       try {
         try {
+          const epochsBefore = new Map(this.staleEpochs);
           await this.rebuildIndex(entityId);
+          if (entityId) {
+            if ((this.staleEpochs.get(entityId) ?? 0) === (epochsBefore.get(entityId) ?? 0)) {
+              this.staleEntities.delete(entityId);
+            }
+          } else {
+            for (const id of [...this.staleEntities]) {
+              if ((this.staleEpochs.get(id) ?? 0) === (epochsBefore.get(id) ?? 0)) {
+                this.staleEntities.delete(id);
+              }
+            }
+          }
           await this.miniSearch.vacuum();
         } finally {
           this.evictCache(entityId);
@@ -3152,6 +3217,68 @@ var _SearchService = class _SearchService {
     this.syncChain = work;
     return work;
   }
+  /**
+   * Re-indexes only `ids` for `entityId`: drops each from the index, then
+   * re-adds the ones still live in SQLite, so soft-deleted or missing ids end
+   * up absent. Costs O(ids), where sync(entityId) costs O(entity) — callers that
+   * know what a write touched use this so chunked imports stay linear (#232).
+   *
+   * Serialized with sync() on the same chain and, like it, never rejects. An
+   * entity that is stale or has never been indexed gets a full rebuild instead
+   * — including on an empty `ids` list, which is a no-op only for an entity
+   * the index already tracks, and even then one that waits for rebuilds
+   * already queued on the chain.
+   */
+  async syncEntries(entityId, ids) {
+    const uniqueIds = [...new Set(ids)];
+    if (uniqueIds.length === 0 && !this.staleEntities.has(entityId) && this.miniSearchEntryIdsByEntity.has(entityId)) {
+      return this.syncChain;
+    }
+    const work = this.syncChain.then(async () => {
+      try {
+        try {
+          const epochsBefore = new Map(this.staleEpochs);
+          const needsRebuild = () => this.staleEntities.has(entityId) || !this.miniSearchEntryIdsByEntity.has(entityId);
+          if (!needsRebuild()) {
+            const rows = await this.entryRepo.findMiniSearchRowsByIds(entityId, uniqueIds);
+            const tracked = this.miniSearchEntryIdsByEntity.get(entityId);
+            if (tracked && !this.staleEntities.has(entityId)) {
+              for (const id of uniqueIds) {
+                if (tracked.delete(id) && this.miniSearch.has(id)) this.miniSearch.discard(id);
+              }
+              const documents = rows.map((row) => this.normalizeMiniSearchRow(row));
+              if (documents.length > 0) this.miniSearch.addAll(documents);
+              for (const document of documents) tracked.add(document.id);
+              if (this.miniSearch.dirtCount > 0) {
+                await this.miniSearch.vacuum();
+              }
+              return;
+            }
+          }
+          await this.rebuildIndex(entityId);
+          if ((this.staleEpochs.get(entityId) ?? 0) === (epochsBefore.get(entityId) ?? 0)) {
+            this.staleEntities.delete(entityId);
+          }
+          await this.miniSearch.vacuum();
+        } finally {
+          this.evictCache(entityId);
+        }
+      } catch (err) {
+        this.staleEntities.add(entityId);
+        console.warn(`[WikiMemory] search index incremental sync failed for ${entityId}:`, err);
+      }
+    });
+    this.syncChain = work;
+    return work;
+  }
+  /**
+   * Forces the entity's next syncEntries to rebuild it in full. For writes core
+   * cannot index itself, such as upsertGraph inside a host transaction.
+   */
+  markStale(entityId) {
+    this.staleEntities.add(entityId);
+    this.staleEpochs.set(entityId, (this.staleEpochs.get(entityId) ?? 0) + 1);
+  }
   /**
    * Clears the parsed vector cache. Useful for mid-loop flush guarantees
    * or memory pressure evictions.
@@ -3168,8 +3295,10 @@ var _SearchService = class _SearchService {
    */
   clearAll() {
     this.vectorCache.clear();
-    this.miniSearch.removeAll();
+    this.miniSearch = this.createMiniSearch();
     this.miniSearchEntryIdsByEntity.clear();
+    this.staleEntities.clear();
+    this.staleEpochs.clear();
   }
   /**
    * Executes a keyword search against the active MiniSearch index.
@@ -3180,7 +3309,7 @@ var _SearchService = class _SearchService {
       filter: (r) => entityIdSet.has(r.entity_id),
       combineWith: "OR"
     });
-    return results.slice(0, limit);
+    return results.sort((a, b) => this._compareSearchResults(a, b)).slice(0, limit);
   }
   /**
    * Pre-fetches MiniSearch scores for candidate hydration, used during hybrid weighting.
@@ -3190,7 +3319,7 @@ var _SearchService = class _SearchService {
     let results = this.miniSearch.search(query, {
       filter: (r) => entityIdSet.has(r.entity_id),
       combineWith: "OR"
-    });
+    }).sort((a, b) => this._compareSearchResults(a, b));
     if (preFilterLimit !== void 0) {
       results = results.slice(0, preFilterLimit);
     }
@@ -3318,6 +3447,18 @@ var _SearchService = class _SearchService {
     if (updatedAtDiff !== 0) return updatedAtDiff;
     return a.id.localeCompare(b.id);
   }
+  /**
+   * MiniSearch breaks equal-score ties by internal insertion order, which
+   * syncEntries changes: a discarded-and-re-added id moves to the end. Every
+   * caller truncates these results to a limit, so which ids survive a tie at
+   * the boundary must not depend on write history. Re-sort exact score ties
+   * by id — the same final tie-break _compareScoredRows applies.
+   */
+  _compareSearchResults(a, b) {
+    const scoreDiff = b.score - a.score;
+    if (!Number.isNaN(scoreDiff) && scoreDiff !== 0) return scoreDiff;
+    return a.id.localeCompare(b.id);
+  }
 };
 /**
  * Maximum number of entities whose parsed embedding vectors are held in
@@ -4971,7 +5112,10 @@ var IngestionService = class {
         return zeroChunkResult(canonical);
       }
       diagBuffer.flush(this.options);
-      await this.searchService.sync(entityId);
+      await this.searchService.syncEntries(
+        entityId,
+        [...deletedSourceFactIds, ...insertedFacts.map((fact) => fact.id)]
+      );
       if (failedChunks === 0) {
         const uniqueDeletedSourceFactIds = Array.from(new Set(deletedSourceFactIds));
         for (const factId of uniqueDeletedSourceFactIds) {
@@ -6974,7 +7118,11 @@ var ImportExportService = class {
         );
       }
     });
-    await this.searchService.sync(entityId);
+    if (merge) {
+      await this.searchService.syncEntries(entityId, [...upsertedFactIds]);
+    } else {
+      await this.searchService.sync(entityId);
+    }
     for (const fact of bundle.facts) {
       if (!fact.deleted_at && upsertedFactIds.has(fact.id) && !factsWithPreservedBlob.has(fact.id)) {
         const clipped = clippedTextByFactId.get(fact.id);
@@ -9112,6 +9260,7 @@ var WikiMemory = class {
       adapter,
       { diag: { buffer: diagBuffer, operation: "upsertGraph" } }
     );
+    this.searchService.markStale(entityId);
     diagBuffer.flush(this.options);
     return result;
   }