@loomwork/knowledge 0.0.0-stage → 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+

package/NOTICE

@@ -0,0 +1,8 @@
+Loom
+Copyright 2026 Sushil Chhetri
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this project except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0

package/README.md

@@ -1,3 +1,73 @@
-# Temporary Holding Version
+# @loomwork/knowledge — document corpora over memory
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+A corpus of documents you ingest, revise, delete and retrieve passages from, built on the memory seam. There
+is no `knowledge$` construct and no separate embedding interface (ADR 0090): this package owns the one thing
+a `MemoryStore` cannot, which is the mapping from a document (what you edit) to its passages (what you
+search). Re-ingesting a revised document supersedes its old passages instead of indexing both. Use it for
+retrieval-augmented answers over a runbook, wiki or policy set. `app.knowledge(scope)` opens one over the
+same `memoryStore` that backs `app.memory`.
+
+```ts
+import { InMemoryMemoryStore } from "@loomwork/memory";
+import { assertGrounded, groundedRequest, openKnowledgeBase } from "@loomwork/knowledge";
+import type { ExecutionContext } from "@loomwork/workflow-runtime";
+
+const kb = openKnowledgeBase(new InMemoryMemoryStore(), { scope: "runbooks" });
+
+// `sync` takes the COMPLETE set: new or changed documents are written, absent ones are removed.
+await kb.sync([
+  { id: "restart-db", title: "Restarting the database", text: "Drain connections first.\n\nThen restart." },
+]);
+
+export async function ask(ctx: ExecutionContext, question: string) {
+  // `decide` is required: the retrieved passages are recorded, so a replay rebuilds the same prompt.
+  const passages = await kb.retrieve(question, { decide: ctx.decide, limit: 4 });
+  // Passages go in fenced user messages, never the system prompt.
+  const request = groundedRequest({ instructions: "Answer from the passages only.", question, passages });
+  // After the model answers, check the document ids it cited: throws for one it was never shown.
+  const cited = assertGrounded(["restart-db"], passages);
+  return { request, cited };
+}
+```
+
+## Surface
+
+- **Corpus.** `openKnowledgeBase(store, { scope, tier?, chunker?, origin? })`, or `new KnowledgeBase({ memory,
+  scope, ... })` over a `TieredMemory` you share with something else. Methods: `putDoc` (upsert), `sync`,
+  `planSync` (dry run, same result shape), `removeDoc`, `listDocs`, `retrieve`.
+- **Chunking.** `packParagraphs(maxChars = 1000)` is the default: split on blank lines, then pack. Pass
+  your own `Chunker` for structured text.
+- **Prompt boundary.** `groundedRequest` and `passageMessages` build the request; `checkCitations`,
+  `assertGrounded` and `UngroundedCitationError` check which documents an answer claims.
+- **Types.** `KnowledgeDoc` (`id`, `title?`, `text`, `meta?`), `Passage`, `DocRecord`, `SyncResult`
+  (`written`, `unchanged`, `removed`, `retained`), `SourceOptions`, `RetrieveOptions`.
+- **CLI.** `loom knowledge` operates a corpus from the command line.
+
+## Behaviour that surprises people
+
+- **Passage text is tainted at ingest** (ADR 0085) and stays tainted into the model request, so
+  `guardRequest` refuses it in a system prompt. That is why `groundedRequest` types `instructions` as a
+  plain string and sends one `user` message per passage.
+- **`sync` is a destructive reconcile.** Passing a subset removes every other document of that writer.
+  Unchanged documents are skipped by fingerprint over title, text and `meta`.
+- **One document, one writer.** Pass `{ source }` to name a writer; a `sync` leaves other sources'
+  documents alone and reports them as `retained`, and `putDoc` on a document another writer owns throws.
+- **The tier must not evict.** A tier with `ttlMs` or `maxEntries` is refused at construction, and
+  `app.knowledge` throws if a `memory$` with those limits shares the tier. Use `semantic` (the default) or
+  `procedural`, or give the corpus its own tier.
+- **Retrieval records content, not ids**, so a replay still works after the document behind a passage was
+  revised. `assertGrounded` compares exact document ids and does not judge whether a claim follows from a
+  passage.
+- **`putDoc` is crash-safe by write order** (an uncommitted manifest row first), so a crash converges on a
+  rewrite instead of a document that the status views call present but that has no passages.
+
+## Install
+
+Unpublished for now: inside this repo use `workspace:*`; from a sibling checkout use a `link:` override (see [AGENTS.md](../../AGENTS.md)).
+
+## See also
+
+- API reference: section "`@loomwork/knowledge` — a corpus over the memory seam" in [docs/api-reference.org](../../docs/api-reference.org). It shows `openKnowledgeBase(config)`; the source takes `(store, options)`.
+- Guide: [user guide, section 8: intent, planner and memory](../../docs/user-guide.md#8-intent-planner--memory).
+- ADRs: [0090 knowledge is retrieval over memory](../../docs/adr/0090-knowledge-is-retrieval-over-memory.md), [0091 corpus lifecycle](../../docs/adr/0091-corpus-lifecycle-and-the-knowledge-package.md), [0085 untrusted content](../../docs/adr/0085-untrusted-content-integrity-axis.md).
+- Source: `packages/knowledge/src`. Storage and tiers: [`@loomwork/memory`](../memory/README.md).

package/dist/KnowledgeBase.d.ts

@@ -0,0 +1,212 @@
+import { TieredMemory } from "@loomwork/memory";
+import type { MemoryStore } from "@loomwork/memory";
+import type { Chunker, DocRecord, KnowledgeDoc, Passage } from "./types";
+/** The `decide` a retrieval is recorded through — structurally `ctx.decide`. */
+export type DecideFn = <T>(key: string, compute: () => Promise<T> | T) => Promise<T>;
+export interface KnowledgeBaseConfig {
+    /** The memory the corpus lives in. Its tier must not evict — see {@link KnowledgeBase}. */
+    memory: TieredMemory;
+    /** Names this corpus within the tier. One knowledge base, one scope. */
+    scope: string;
+    /** Defaults to `"semantic"` — the tier that never evicts. */
+    tier?: string;
+    /** Defaults to {@link packParagraphs}. */
+    chunker?: Chunker;
+    /**
+     * The provenance label stamped on every passage's taint, shown to the model when
+     * `guardRequest` fences the content. Defaults to `knowledge:<scope>:<docId>`.
+     */
+    origin?: (doc: KnowledgeDoc) => string;
+}
+export interface RetrieveOptions {
+    /** REQUIRED — `ctx.decide`. See {@link KnowledgeBase.retrieve}. */
+    decide: DecideFn;
+    limit?: number;
+    /** Overrides the recorded decision key. Defaults to the tier/scope/query triple. */
+    decisionKey?: string;
+}
+export interface SyncResult {
+    /** Documents written because they were new or their fingerprint changed. */
+    written: string[];
+    /** Documents already present at the same fingerprint — not rewritten. */
+    unchanged: string[];
+    /** Documents removed because the source no longer lists them. */
+    removed: string[];
+    /**
+     * Documents left alone because another writer owns them (see {@link DocRecord.source}).
+     *
+     * Reported rather than silent: "your sync deleted nothing" and "your sync protected four
+     * documents it does not own" describe very different corpora, and only one of them is
+     * something an operator should stop noticing in a nightly job's output.
+     */
+    retained: string[];
+}
+/** Names the writer a call speaks for. Omitted means the corpus's default writer. */
+export interface SourceOptions {
+    source?: string;
+}
+/**
+ * A document corpus over a memory tier: ingest, revise, delete, retrieve — with the
+ * provenance and the recorded retrieval that make the result usable in a prompt.
+ *
+ * ## What this is not
+ *
+ * It is not a construct, an SPI, or a retrieval engine. Ranking is the `MemoryStore`'s
+ * (FTS5, `tsvector`, cosine — whichever backend is configured), reproducibility is
+ * `ctx.decide`'s, safety is ADR 0085's, and the corpus is an ordinary `semantic` tier
+ * anyone can read with `recall`. What lives here is the one thing none of those provide:
+ * the mapping from a DOCUMENT — the unit a corpus is edited in — to the PASSAGES it is
+ * searched in, so that revising a document supersedes its old passages instead of
+ * duplicating them.
+ *
+ * ## The tier must not evict
+ *
+ * A corpus is kept until someone deletes it, so the tier it lives in must have no `ttlMs`
+ * and no `maxEntries`. Under eviction, the store would drop passages the manifest still
+ * counts, and a document would silently retrieve as a fragment of itself. `semantic` and
+ * `procedural` are unbounded by default, which is exactly why they are the tiers a corpus
+ * belongs in — and the constructor refuses a bounded one rather than letting it rot.
+ *
+ * ## Two scopes
+ *
+ * Passages live in `scope`; the manifest lives in `scope::docs`, one small row per
+ * document. They are separate because they are searched differently: a manifest row in
+ * the corpus would be an entry that matches queries and answers nothing.
+ */
+export declare class KnowledgeBase {
+    private readonly memory;
+    private readonly tier;
+    private readonly scope;
+    private readonly manifestScope;
+    private readonly chunker;
+    private readonly origin;
+    constructor(config: KnowledgeBaseConfig);
+    /** `docId#index` — derived, never stored, so a document's passage ids are its count. */
+    private passageId;
+    private fingerprint;
+    private toPassages;
+    /**
+     * What is actually WRITTEN for a passage: its `text`, and its `title`/`meta` if any.
+     *
+     * `docId` and `index` are deliberately NOT stored, because a store indexes the string
+     * and number leaves of `content` — so storing them would make a document's own id a term
+     * matching all of its passages, and the chunk ordinal a term matching the first passage
+     * of every document in the corpus. That is the same widening that made a tainted value's
+     * `origin` unindexable (ADR 0090), and the same rule the SPI states for `MemoryEntry.id`.
+     *
+     * They are not lost: the entry id IS `docId#index`, ids are required to round-trip
+     * (SPI 2.0.0), and ids are not indexed. The requirement earns its keep twice.
+     */
+    private storedPassage;
+    /**
+     * The tiered memory the corpus lives in, for a caller that also wants to `recall` it,
+     * point a second corpus at the same store, or inspect it from ops code.
+     */
+    get tieredMemory(): TieredMemory;
+    /** `docId#revision` — a manifest row's id. Rows are appended; the highest revision wins. */
+    private rowId;
+    /**
+     * The manifest: the live record per document, plus every row id currently standing for
+     * it so superseded rows can be pruned.
+     *
+     * One read of a small scope — rows are ids, counts and hashes, never passage text — which
+     * is what keeps `sync` proportional to the number of DOCUMENTS rather than to the size of
+     * the corpus. Read order is append order (the SPI guarantees it), so the last row for a
+     * document is the live one.
+     */
+    private manifest;
+    private appendRecord;
+    /**
+     * Remove a document's passages, by the count the manifest holds. Idempotent — a document
+     * that is absent, or whose passages were already deleted, is a no-op.
+     */
+    removeDoc(docId: string): Promise<void>;
+    private removeRecordedPassages;
+    /**
+     * Ingest a document, superseding any previous revision of it. Returns the passages now
+     * stored for it (empty if the document chunked to nothing).
+     *
+     * UPSERT, not append. Ingesting the same document twice must not double it in the index
+     * — retrieval would then return the stale passage beside the current one, and a citation
+     * could not say which is live. That is the operation a `MemoryStore` alone cannot
+     * express, and the reason this class exists.
+     *
+     * The write order is the crash contract, and it is deliberate:
+     *
+     *  1. APPEND an uncommitted manifest row at the new count and fingerprint;
+     *  2. delete the previous revision's passages (by the count the old row holds);
+     *  3. append the new passages;
+     *  4. APPEND the committed manifest row, then prune the superseded rows.
+     *
+     * A crash before (4) leaves an uncommitted row, which {@link sync} and every later
+     * `putDoc` treat as changed no matter what the fingerprint says — so the document is
+     * rewritten rather than skipped.
+     *
+     * Two orderings look more natural and neither survives. Passages first: passages nothing
+     * counts are passages nothing can remove, and they stay retrievable forever. Manifest
+     * updated in place (delete the old row, write the new one): the crash window between
+     * them leaves the document with NO row, which is the same orphaning by a shorter path —
+     * which is why rows are appended and superseded ones are pruned only afterwards.
+     */
+    putDoc(doc: KnowledgeDoc, opts?: SourceOptions): Promise<Passage[]>;
+    private write;
+    /**
+     * Reconcile the corpus against the documents the source currently has: write what is new
+     * or changed, leave what is identical, remove what the source dropped.
+     *
+     * This is the operation a knowledge base is actually run with — a wiki export, a docs
+     * directory, a table of policies — and it is what makes deletion complete rather than
+     * best-effort. Without it, a document deleted upstream keeps answering questions.
+     *
+     * Cost is one manifest read (rows are ids and counts) plus writes for the documents that
+     * genuinely changed — NOT a rewrite of the corpus, which is the whole point of the
+     * fingerprint. Re-running it on an unchanged source writes nothing.
+     *
+     * `docs` is the COMPLETE set. Passing a subset removes everything not in it, which is
+     * the correct reading of "reconcile" and the wrong thing to do with a page of results.
+     */
+    sync(docs: readonly KnowledgeDoc[], opts?: SourceOptions): Promise<SyncResult>;
+    /**
+     * What {@link sync} WOULD do, without doing it. Read-only.
+     *
+     * Exists because a corpus sync is a destructive reconcile — `docs` is the complete set,
+     * so anything missing from it is deleted — and the operator command that runs it
+     * (`loom knowledge sync`) defaults to a dry run for that reason. A preview computed by a
+     * separate code path would be a preview of a different operation, so both go through the
+     * same classification and only `sync` writes.
+     */
+    planSync(docs: readonly KnowledgeDoc[], opts?: SourceOptions): Promise<SyncResult>;
+    /** Pure: which documents are new/changed, unchanged, or no longer in the source. */
+    private classify;
+    /** The documents this corpus holds, in manifest order. Ids and counts — no passage text. */
+    listDocs(): Promise<DocRecord[]>;
+    /**
+     * Retrieve the passages most relevant to a question, best first.
+     *
+     * `decide` is REQUIRED, and it is a type requirement rather than advice for the reason
+     * ADR 0090 gives: a corpus grows and is edited, so the passages a question retrieves
+     * genuinely differ between a run and its replay. Recorded, the retrieval is a fact and
+     * the replay rebuilds the prompt that actually ran; unrecorded, "reproducing" an
+     * incident quietly means asking today's corpus yesterday's question.
+     *
+     * What is recorded is the passage CONTENT, not passage ids — ids do not reconstruct a
+     * prompt once the document behind them has been revised.
+     */
+    retrieve(query: string, opts: RetrieveOptions): Promise<Passage[]>;
+}
+/**
+ * Open a corpus over a `MemoryStore` directly — the two-line form of the four every
+ * consumer was writing by hand.
+ *
+ * A corpus needs exactly one memory tier and that tier must not evict, which is a fact
+ * about corpora and not a decision each application should be re-deriving. Both first
+ * consumers built the identical `new TieredMemory({ tiers: { semantic: {} }, store })`
+ * before they could construct anything, and an application wiring `defineConfig` cannot
+ * pass `app.memory` here at all — that is a {@link MemoryRuntime}, one layer below
+ * `TieredMemory` — so the boilerplate was mandatory rather than incidental.
+ *
+ * Reach for the constructor instead when the corpus shares a memory with something else
+ * (a conversation in `episodic`, say), which is exactly when the tier set is a decision.
+ */
+export declare function openKnowledgeBase(store: MemoryStore, opts: Omit<KnowledgeBaseConfig, "memory">): KnowledgeBase;
+//# sourceMappingURL=KnowledgeBase.d.ts.map

package/dist/KnowledgeBase.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"KnowledgeBase.d.ts","sourceRoot":"","sources":["../src/KnowledgeBase.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,EAAe,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAGjE,OAAO,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAEzE,gFAAgF;AAChF,MAAM,MAAM,QAAQ,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC;AAErF,MAAM,WAAW,mBAAmB;IAClC,2FAA2F;IAC3F,MAAM,EAAE,YAAY,CAAC;IACrB,wEAAwE;IACxE,KAAK,EAAE,MAAM,CAAC;IACd,6DAA6D;IAC7D,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,0CAA0C;IAC1C,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB;;;OAGG;IACH,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,YAAY,KAAK,MAAM,CAAC;CACxC;AAED,MAAM,WAAW,eAAe;IAC9B,mEAAmE;IACnE,MAAM,EAAE,QAAQ,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,oFAAoF;IACpF,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,UAAU;IACzB,4EAA4E;IAC5E,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,yEAAyE;IACzE,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,iEAAiE;IACjE,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB;;;;;;OAMG;IACH,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,qFAAqF;AACrF,MAAM,WAAW,aAAa;IAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAe;IACtC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAS;IAC9B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAS;IACvC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAU;IAClC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAgC;gBAE3C,MAAM,EAAE,mBAAmB;IAqBvC,wFAAwF;IACxF,OAAO,CAAC,SAAS;IAIjB,OAAO,CAAC,WAAW;IAanB,OAAO,CAAC,UAAU;IAWlB;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,aAAa;IAQrB;;;OAGG;IACH,IAAI,YAAY,IAAI,YAAY,CAE/B;IAED,4FAA4F;IAC5F,OAAO,CAAC,KAAK;IAIb;;;;;;;;OAQG;YACW,QAAQ;YAgBR,YAAY;IAO1B;;;OAGG;IACG,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;YAO/B,sBAAsB;IAOpC;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACG,MAAM,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,GAAE,aAAkB,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;YAQ/D,KAAK;IAgCnB;;;;;;;;;;;;;;OAcG;IACG,IAAI,CAAC,IAAI,EAAE,SAAS,YAAY,EAAE,EAAE,IAAI,GAAE,aAAkB,GAAG,OAAO,CAAC,UAAU,CAAC;IAqBxF;;;;;;;;OAQG;IACG,QAAQ,CAAC,IAAI,EAAE,SAAS,YAAY,EAAE,EAAE,IAAI,GAAE,aAAkB,GAAG,OAAO,CAAC,UAAU,CAAC;IAI5F,oFAAoF;IACpF,OAAO,CAAC,QAAQ;IAgChB,4FAA4F;IACtF,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IAItC;;;;;;;;;;;OAWG;IACG,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,eAAe,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;CAQzE;AAUD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,WAAW,EAClB,IAAI,EAAE,IAAI,CAAC,mBAAmB,EAAE,QAAQ,CAAC,GACxC,aAAa,CAMf"}