@gnldev/rag 0.1.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 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 2026 Karaca Yılmaz (https://gnl.dev)
+
+   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/README.md

@@ -0,0 +1,40 @@
+# @gnldev/rag
+
+**Vector store + RAG tool** for AI SDK agents. Used as a tool inside `runDurable`, it's automatically
+**replayable** (thanks to durableTool the retrieval is journaled: on resume it comes back from the record
+instead of running again).
+
+> Install: `pnpm add @gnldev/rag` — or use it from a [repo clone](https://github.com/Karaca7/gnldev): `pnpm install && pnpm -r build`.
+
+```bash
+npm i @gnldev/rag   # peer: @gnldev/durable, ai, zod
+```
+
+```ts
+import { InMemoryVectorStore, indexDocuments, createRagTool, llmReranker } from '@gnldev/rag';
+
+const store = new InMemoryVectorStore();
+await indexDocuments(store, embed, [{ id: 'p1', text: 'Return policy: 30 days…' }]);
+
+const searchPolicy = createRagTool({
+  store, embed, topK: 3,
+  rerank: llmReranker({ model }), rerankTopK: 2,   // optional LLM reranker
+});
+
+await runDurable({ runId: 'r1', journal, model, tools: { searchPolicy }, prompt: '…' });
+```
+
+## API
+- `InMemoryVectorStore` · `indexDocuments(store, embed, docs)` · `VectorStore` interface (plug in your own
+  backend)
+- `createRagTool({ store, embed, topK?, rerank?, rerankTopK?, description? })` → AI SDK tool
+- `llmReranker({ model })` → `Reranker`
+- `SemanticMemory` — vector-based recall (memory integration)
+
+## How it works
+Since RAG is a tool, it naturally fits into the durable agent loop: retrieval + rerank are journaled once
+and replayed rather than repeated. For cross-run reuse, it can be combined with `@gnldev/cache`.
+
+## License
+
+Apache-2.0 — see [LICENSE](./LICENSE).

package/dist/chunk.d.ts

@@ -0,0 +1,22 @@
+import type { VectorDoc } from './vector-store.js';
+export interface ChunkOptions {
+    /** Target chunk size (characters). Default 1200. */
+    size?: number;
+    /** Overlap between consecutive chunks (characters, must be smaller than size). Default 120. */
+    overlap?: number;
+    strategy?: 'recursive' | 'markdown' | 'character';
+}
+/** Chunk + (in markdown) heading trail. */
+export interface Chunk {
+    text: string;
+    /** heading breadcrumb of the section in the markdown strategy (e.g. "Setup > Docker"). */
+    heading?: string;
+}
+/** Split raw text into chunks (strategy + size + overlap). */
+export declare function chunkText(text: string, opts?: ChunkOptions): Chunk[];
+/**
+ * Split documents → VectorDoc list ready for `indexDocuments`. Chunk id is `<docId>#<i>`
+ * (deterministic → re-indexing upserts to the same ids, no duplicate records); metadata
+ * is inherited + a `{ source, chunk }` trail is added (and a `heading` breadcrumb in markdown).
+ */
+export declare function chunkDocuments(docs: VectorDoc[], opts?: ChunkOptions): VectorDoc[];

package/dist/chunk.js

@@ -0,0 +1,127 @@
+const DEFAULT_SIZE = 1200;
+const DEFAULT_OVERLAP = 120;
+function resolveOpts(opts) {
+    const size = opts?.size ?? DEFAULT_SIZE;
+    const overlap = opts?.overlap ?? Math.min(DEFAULT_OVERLAP, Math.floor(size / 4));
+    if (size < 1)
+        throw new Error('@gnldev/rag chunk: size must be >= 1');
+    if (overlap < 0 || overlap >= size)
+        throw new Error('@gnldev/rag chunk: 0 <= overlap < size must hold');
+    return { size, overlap, strategy: opts?.strategy ?? 'recursive' };
+}
+/** Separator priority list: paragraph → line → sentence → word. Last resort: hard cut. */
+const SEPARATORS = ['\n\n', '\n', '. ', ' '];
+/** GREEDILY merges pieces up to the target size (preserving the separator); a piece that alone stays over size passes through as-is. */
+function mergeGreedy(pieces, sep, size) {
+    const out = [];
+    let cur = '';
+    for (const p of pieces) {
+        const joined = cur === '' ? p : cur + sep + p;
+        if (joined.length <= size || cur === '')
+            cur = joined;
+        else {
+            out.push(cur);
+            cur = p;
+        }
+    }
+    if (cur !== '')
+        out.push(cur);
+    return out;
+}
+/** Recursive split: start from the coarsest separator; any unit exceeding size is re-split with the next separator. */
+function splitRecursive(text, size, sepIdx = 0) {
+    if (text.length <= size)
+        return text.trim() === '' ? [] : [text];
+    if (sepIdx >= SEPARATORS.length) {
+        const out = []; // no natural boundary left → hard cut
+        for (let i = 0; i < text.length; i += size)
+            out.push(text.slice(i, i + size));
+        return out;
+    }
+    const sep = SEPARATORS[sepIdx];
+    const pieces = text.split(sep).filter((p) => p.trim() !== '');
+    if (pieces.length <= 1)
+        return splitRecursive(text, size, sepIdx + 1);
+    const merged = mergeGreedy(pieces, sep, size);
+    return merged.flatMap((m) => (m.length <= size ? [m] : splitRecursive(m, size, sepIdx + 1)));
+}
+/** Apply overlap to consecutive chunks: the tail of the previous chunk is prepended to each one (context continuity). */
+function applyOverlap(chunks, overlap) {
+    if (overlap === 0 || chunks.length <= 1)
+        return chunks;
+    return chunks.map((c, i) => (i === 0 ? c : chunks[i - 1].slice(-overlap) + c));
+}
+/** Section the markdown by heading hierarchy: each section = breadcrumb + body. */
+function splitMarkdownSections(text) {
+    const lines = text.split('\n');
+    const sections = [];
+    const crumbs = [];
+    let buf = [];
+    const flush = () => {
+        const body = buf.join('\n');
+        if (body.trim() !== '') {
+            const heading = crumbs.map((c) => c.title).join(' > ') || undefined;
+            sections.push({ heading, body });
+        }
+        buf = [];
+    };
+    for (const line of lines) {
+        const m = /^(#{1,6})\s+(.+)$/.exec(line);
+        if (m) {
+            flush();
+            const level = m[1].length;
+            while (crumbs.length && crumbs[crumbs.length - 1].level >= level)
+                crumbs.pop();
+            crumbs.push({ level, title: m[2].trim() });
+        }
+        else {
+            buf.push(line);
+        }
+    }
+    flush();
+    return sections;
+}
+/** Split raw text into chunks (strategy + size + overlap). */
+export function chunkText(text, opts) {
+    const { size, overlap, strategy } = resolveOpts(opts);
+    if (text.trim() === '')
+        return [];
+    if (strategy === 'character') {
+        const out = [];
+        const stride = size - overlap;
+        for (let i = 0; i < text.length; i += stride) {
+            out.push(text.slice(i, i + size));
+            if (i + size >= text.length)
+                break;
+        }
+        return out.map((t) => ({ text: t }));
+    }
+    if (strategy === 'markdown') {
+        return splitMarkdownSections(text).flatMap(({ heading, body }) => applyOverlap(splitRecursive(body.trim(), size), overlap).map((t) => ({ text: t, ...(heading ? { heading } : {}) })));
+    }
+    return applyOverlap(splitRecursive(text, size), overlap).map((t) => ({ text: t }));
+}
+/**
+ * Split documents → VectorDoc list ready for `indexDocuments`. Chunk id is `<docId>#<i>`
+ * (deterministic → re-indexing upserts to the same ids, no duplicate records); metadata
+ * is inherited + a `{ source, chunk }` trail is added (and a `heading` breadcrumb in markdown).
+ */
+export function chunkDocuments(docs, opts) {
+    const out = [];
+    for (const doc of docs) {
+        const chunks = chunkText(doc.text, opts);
+        if (chunks.length <= 1) {
+            out.push(doc); // not split → original id/metadata as-is (no pointless #0 derivation)
+            continue;
+        }
+        chunks.forEach((c, i) => {
+            out.push({
+                id: `${doc.id}#${i}`,
+                text: c.text,
+                metadata: { ...doc.metadata, source: doc.id, chunk: i, ...(c.heading ? { heading: c.heading } : {}) },
+            });
+        });
+    }
+    return out;
+}
+//# sourceMappingURL=chunk.js.map

package/dist/chunk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk.js","sourceRoot":"","sources":["../src/chunk.ts"],"names":[],"mappings":"AA0BA,MAAM,YAAY,GAAG,IAAI,CAAC;AAC1B,MAAM,eAAe,GAAG,GAAG,CAAC;AAE5B,SAAS,WAAW,CAAC,IAAmB;IACtC,MAAM,IAAI,GAAG,IAAI,EAAE,IAAI,IAAI,YAAY,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,EAAE,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACjF,IAAI,IAAI,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IACtE,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,IAAI,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;IACxG,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,IAAI,WAAW,EAAE,CAAC;AACpE,CAAC;AAED,0FAA0F;AAC1F,MAAM,UAAU,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AAE7C,wIAAwI;AACxI,SAAS,WAAW,CAAC,MAAgB,EAAE,GAAW,EAAE,IAAY;IAC9D,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAC9C,IAAI,MAAM,CAAC,MAAM,IAAI,IAAI,IAAI,GAAG,KAAK,EAAE;YAAE,GAAG,GAAG,MAAM,CAAC;aACjD,CAAC;YACJ,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACd,GAAG,GAAG,CAAC,CAAC;QACV,CAAC;IACH,CAAC;IACD,IAAI,GAAG,KAAK,EAAE;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9B,OAAO,GAAG,CAAC;AACb,CAAC;AAED,uHAAuH;AACvH,SAAS,cAAc,CAAC,IAAY,EAAE,IAAY,EAAE,MAAM,GAAG,CAAC;IAC5D,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI;QAAE,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACjE,IAAI,MAAM,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,GAAG,GAAa,EAAE,CAAC,CAAC,sCAAsC;QAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAC9E,OAAO,GAAG,CAAC;IACb,CAAC;IACD,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAE,CAAC;IAChC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IAC9D,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IACtE,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IAC9C,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/F,CAAC;AAED,yHAAyH;AACzH,SAAS,YAAY,CAAC,MAAgB,EAAE,OAAe;IACrD,IAAI,OAAO,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC;IACvD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAClF,CAAC;AAED,mFAAmF;AACnF,SAAS,qBAAqB,CAAC,IAAY;IACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAyC,EAAE,CAAC;IAC1D,MAAM,MAAM,GAAuC,EAAE,CAAC;IACtD,IAAI,GAAG,GAAa,EAAE,CAAC;IACvB,MAAM,KAAK,GAAG,GAAG,EAAE;QACjB,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC;YACpE,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;QACnC,CAAC;QACD,GAAG,GAAG,EAAE,CAAC;IACX,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,CAAC,EAAE,CAAC;YACN,KAAK,EAAE,CAAC;YACR,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC;YAC3B,OAAO,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,KAAK,IAAI,KAAK;gBAAE,MAAM,CAAC,GAAG,EAAE,CAAC;YAChF,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC9C,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,KAAK,EAAE,CAAC;IACR,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,IAAmB;IACzD,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IACtD,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IAClC,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,GAAG,OAAO,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC;YAC7C,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,MAAM;gBAAE,MAAM;QACrC,CAAC;QACD,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,IAAI,QAAQ,KAAK,UAAU,EAAE,CAAC;QAC5B,OAAO,qBAAqB,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,CAC/D,YAAY,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CACpH,CAAC;IACJ,CAAC;IACD,OAAO,YAAY,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACrF,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,IAAiB,EAAE,IAAmB;IACnE,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACzC,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,sEAAsE;YACrF,SAAS;QACX,CAAC;QACD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACtB,GAAG,CAAC,IAAI,CAAC;gBACP,EAAE,EAAE,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE;gBACpB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,QAAQ,EAAE,EAAE,GAAG,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;aACtG,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["// Chunking helpers — the common `document.chunk()` shape (code-first, class-free).\n// `chunkText` splits raw text into chunks; `chunkDocuments` splits VectorDocs and produces a new\n// VectorDoc list ready for `indexDocuments` (id: `<source>#<i>`, metadata inherited + source trail).\n// Strategies:\n// 'recursive' (default): splits preferring paragraph → line → sentence → word boundaries\n//     (the general-purpose strategy with the highest semantic coherence).\n// 'markdown': splits by heading hierarchy; adds a `heading` breadcrumb metadata to each chunk\n//     (for context display during retrieval), large text within a section is split recursively.\n// 'character': fixed window (fastest; when boundary quality doesn't matter).\nimport type { VectorDoc } from './vector-store.js';\n\nexport interface ChunkOptions {\n  /** Target chunk size (characters). Default 1200. */\n  size?: number;\n  /** Overlap between consecutive chunks (characters, must be smaller than size). Default 120. */\n  overlap?: number;\n  strategy?: 'recursive' | 'markdown' | 'character';\n}\n\n/** Chunk + (in markdown) heading trail. */\nexport interface Chunk {\n  text: string;\n  /** heading breadcrumb of the section in the markdown strategy (e.g. \"Setup > Docker\"). */\n  heading?: string;\n}\n\nconst DEFAULT_SIZE = 1200;\nconst DEFAULT_OVERLAP = 120;\n\nfunction resolveOpts(opts?: ChunkOptions): { size: number; overlap: number; strategy: NonNullable<ChunkOptions['strategy']> } {\n  const size = opts?.size ?? DEFAULT_SIZE;\n  const overlap = opts?.overlap ?? Math.min(DEFAULT_OVERLAP, Math.floor(size / 4));\n  if (size < 1) throw new Error('@gnldev/rag chunk: size must be >= 1');\n  if (overlap < 0 || overlap >= size) throw new Error('@gnldev/rag chunk: 0 <= overlap < size must hold');\n  return { size, overlap, strategy: opts?.strategy ?? 'recursive' };\n}\n\n/** Separator priority list: paragraph → line → sentence → word. Last resort: hard cut. */\nconst SEPARATORS = ['\\n\\n', '\\n', '. ', ' '];\n\n/** GREEDILY merges pieces up to the target size (preserving the separator); a piece that alone stays over size passes through as-is. */\nfunction mergeGreedy(pieces: string[], sep: string, size: number): string[] {\n  const out: string[] = [];\n  let cur = '';\n  for (const p of pieces) {\n    const joined = cur === '' ? p : cur + sep + p;\n    if (joined.length <= size || cur === '') cur = joined;\n    else {\n      out.push(cur);\n      cur = p;\n    }\n  }\n  if (cur !== '') out.push(cur);\n  return out;\n}\n\n/** Recursive split: start from the coarsest separator; any unit exceeding size is re-split with the next separator. */\nfunction splitRecursive(text: string, size: number, sepIdx = 0): string[] {\n  if (text.length <= size) return text.trim() === '' ? [] : [text];\n  if (sepIdx >= SEPARATORS.length) {\n    const out: string[] = []; // no natural boundary left → hard cut\n    for (let i = 0; i < text.length; i += size) out.push(text.slice(i, i + size));\n    return out;\n  }\n  const sep = SEPARATORS[sepIdx]!;\n  const pieces = text.split(sep).filter((p) => p.trim() !== '');\n  if (pieces.length <= 1) return splitRecursive(text, size, sepIdx + 1);\n  const merged = mergeGreedy(pieces, sep, size);\n  return merged.flatMap((m) => (m.length <= size ? [m] : splitRecursive(m, size, sepIdx + 1)));\n}\n\n/** Apply overlap to consecutive chunks: the tail of the previous chunk is prepended to each one (context continuity). */\nfunction applyOverlap(chunks: string[], overlap: number): string[] {\n  if (overlap === 0 || chunks.length <= 1) return chunks;\n  return chunks.map((c, i) => (i === 0 ? c : chunks[i - 1]!.slice(-overlap) + c));\n}\n\n/** Section the markdown by heading hierarchy: each section = breadcrumb + body. */\nfunction splitMarkdownSections(text: string): { heading?: string; body: string }[] {\n  const lines = text.split('\\n');\n  const sections: { heading?: string; body: string }[] = [];\n  const crumbs: { level: number; title: string }[] = [];\n  let buf: string[] = [];\n  const flush = () => {\n    const body = buf.join('\\n');\n    if (body.trim() !== '') {\n      const heading = crumbs.map((c) => c.title).join(' > ') || undefined;\n      sections.push({ heading, body });\n    }\n    buf = [];\n  };\n  for (const line of lines) {\n    const m = /^(#{1,6})\\s+(.+)$/.exec(line);\n    if (m) {\n      flush();\n      const level = m[1]!.length;\n      while (crumbs.length && crumbs[crumbs.length - 1]!.level >= level) crumbs.pop();\n      crumbs.push({ level, title: m[2]!.trim() });\n    } else {\n      buf.push(line);\n    }\n  }\n  flush();\n  return sections;\n}\n\n/** Split raw text into chunks (strategy + size + overlap). */\nexport function chunkText(text: string, opts?: ChunkOptions): Chunk[] {\n  const { size, overlap, strategy } = resolveOpts(opts);\n  if (text.trim() === '') return [];\n  if (strategy === 'character') {\n    const out: string[] = [];\n    const stride = size - overlap;\n    for (let i = 0; i < text.length; i += stride) {\n      out.push(text.slice(i, i + size));\n      if (i + size >= text.length) break;\n    }\n    return out.map((t) => ({ text: t }));\n  }\n  if (strategy === 'markdown') {\n    return splitMarkdownSections(text).flatMap(({ heading, body }) =>\n      applyOverlap(splitRecursive(body.trim(), size), overlap).map((t) => ({ text: t, ...(heading ? { heading } : {}) })),\n    );\n  }\n  return applyOverlap(splitRecursive(text, size), overlap).map((t) => ({ text: t }));\n}\n\n/**\n * Split documents → VectorDoc list ready for `indexDocuments`. Chunk id is `<docId>#<i>`\n * (deterministic → re-indexing upserts to the same ids, no duplicate records); metadata\n * is inherited + a `{ source, chunk }` trail is added (and a `heading` breadcrumb in markdown).\n */\nexport function chunkDocuments(docs: VectorDoc[], opts?: ChunkOptions): VectorDoc[] {\n  const out: VectorDoc[] = [];\n  for (const doc of docs) {\n    const chunks = chunkText(doc.text, opts);\n    if (chunks.length <= 1) {\n      out.push(doc); // not split → original id/metadata as-is (no pointless #0 derivation)\n      continue;\n    }\n    chunks.forEach((c, i) => {\n      out.push({\n        id: `${doc.id}#${i}`,\n        text: c.text,\n        metadata: { ...doc.metadata, source: doc.id, chunk: i, ...(c.heading ? { heading: c.heading } : {}) },\n      });\n    });\n  }\n  return out;\n}\n"]}

package/dist/graph-rag.d.ts

@@ -0,0 +1,46 @@
+import type { VectorStore, VectorItem, VectorMatch, QueryOptions } from './vector-store.js';
+export interface GraphRagOptions {
+    /** Edge threshold: two chunks become neighbors in the graph if their cosine similarity exceeds this. Default 0.75. */
+    threshold?: number;
+    /** Neighbor expansion depth (hops). 0 = plain vector search. Default 1. */
+    hops?: number;
+    /** Score decay factor per hop: neighbor's score = source's score × decay × edge weight. Default 0.7. */
+    decay?: number;
+    /** Number of direct results seeding the expansion (independent of query topK). Default 4. */
+    seeds?: number;
+}
+/**
+ * VectorStore that traverses a similarity graph. Edges are built incrementally on upsert (a new
+ * item is compared against all existing ones — O(n) / item). Query: the best `seeds` direct results
+ * are taken, each seed's neighbors join with a `decay`-attenuated score (for `hops` rounds), the
+ * combined list is sorted by score and `topK` is returned. If a node is reached via multiple paths,
+ * the HIGHEST score is kept.
+ */
+export declare class GraphRag implements VectorStore {
+    private items;
+    private byId;
+    private edges;
+    private readonly threshold;
+    private readonly hops;
+    private readonly decay;
+    private readonly seeds;
+    constructor(opts?: GraphRagOptions);
+    upsert(newItems: VectorItem[]): Promise<void>;
+    private rebuildEdgesFor;
+    /**
+     * `opts` was missing from this signature, and TypeScript accepted the class as a `VectorStore`
+     * anyway: a function of fewer parameters is assignable to a type that declares more. So the one
+     * mechanism this module has for keeping two data sets apart was silently absent from one of its
+     * three implementations, and nothing — not `tsc`, not the tests, not a review — said so.
+     *
+     * Measured before this fix, two namespaces with one document each:
+     *   query(q, 5, { namespace: 'org:acme' })  ->  acme-1, globex-1
+     *   query(q, 5, { namespace: 'does-not-exist' })  ->  2 rows
+     */
+    query(embedding: number[], topK: number, opts?: QueryOptions): Promise<VectorMatch[]>;
+    /** Observability/test: graph statistics (node/edge count). */
+    stats(): {
+        nodes: number;
+        edges: number;
+    };
+}

package/dist/graph-rag.js

@@ -0,0 +1,152 @@
+// GraphRAG — retrieval over a similarity GRAPH between chunks (the common "graph RAG" pattern).
+// Catches what plain vector search misses: chunks that don't directly resemble the query but are
+// STRONGLY connected to chunks that do resemble the query (indirect relevance) join the results.
+//
+// Design: implements the `VectorStore` interface → DROP-IN for `createRagTool`/`indexDocuments`.
+// The graph is in-memory and built from upserted chunks (the common graph-RAG approach also works in-memory
+// over chunks); for a persistent corpus, keeping chunks in a persistent store and rebuilding
+// GraphRAG as a query-time layer is the user's pattern. Since it runs durable inside `createRagTool`,
+// the query RESULT is journaled → the graph isn't retraversed on resume/replay (exactly-once RAG preserved).
+import { cosineSimilarity } from 'ai';
+import { matchesFilter } from './vector-store.js';
+/**
+ * VectorStore that traverses a similarity graph. Edges are built incrementally on upsert (a new
+ * item is compared against all existing ones — O(n) / item). Query: the best `seeds` direct results
+ * are taken, each seed's neighbors join with a `decay`-attenuated score (for `hops` rounds), the
+ * combined list is sorted by score and `topK` is returned. If a node is reached via multiple paths,
+ * the HIGHEST score is kept.
+ */
+export class GraphRag {
+    items = [];
+    byId = new Map(); // id → items index
+    edges = new Map(); // id → neighbors (edge weight = similarity)
+    threshold;
+    hops;
+    decay;
+    seeds;
+    constructor(opts = {}) {
+        this.threshold = opts.threshold ?? 0.75;
+        this.hops = opts.hops ?? 1;
+        this.decay = opts.decay ?? 0.7;
+        this.seeds = opts.seeds ?? 4;
+        if (this.threshold < -1 || this.threshold > 1)
+            throw new Error('@gnldev/rag GraphRag: threshold must be in the range [-1,1]');
+        if (this.decay <= 0 || this.decay > 1)
+            throw new Error('@gnldev/rag GraphRag: 0 < decay <= 1 must hold');
+    }
+    async upsert(newItems) {
+        for (const it of newItems) {
+            const existing = this.byId.get(it.id);
+            if (existing !== undefined) {
+                this.items[existing] = it;
+                this.rebuildEdgesFor(it.id); // embedding may have changed → refresh edges
+                continue;
+            }
+            this.byId.set(it.id, this.items.length);
+            this.items.push(it);
+            this.edges.set(it.id, []);
+            // Incremental edge building: the new item is scored once against everyone existing IN ITS OWN
+            // namespace. Filtering at query time is not enough here and that is what makes this store
+            // different from the others: an edge is a permanent structure, so a graph built across two
+            // namespaces lets a walk enter one organization's document from another's and carry its score back.
+            // Measured before this: two namespaces, one document each -> `{"nodes":2,"edges":1}`.
+            for (const other of this.items) {
+                if (other.id === it.id)
+                    continue;
+                if (other.namespace !== it.namespace)
+                    continue;
+                const w = cosineSimilarity(it.embedding, other.embedding);
+                if (w >= this.threshold) {
+                    this.edges.get(it.id).push({ id: other.id, w });
+                    this.edges.get(other.id).push({ id: it.id, w });
+                }
+            }
+        }
+    }
+    rebuildEdgesFor(id) {
+        // Strip the old edges from both directions and recompute (upsert-update path; rare).
+        for (const [k, list] of this.edges) {
+            if (k === id)
+                continue;
+            this.edges.set(k, list.filter((e) => e.id !== id));
+        }
+        const it = this.items[this.byId.get(id)];
+        const mine = [];
+        for (const other of this.items) {
+            if (other.id === id)
+                continue;
+            if (other.namespace !== it.namespace)
+                continue; // same rule as upsert — see the note there
+            const w = cosineSimilarity(it.embedding, other.embedding);
+            if (w >= this.threshold) {
+                mine.push({ id: other.id, w });
+                this.edges.get(other.id).push({ id, w });
+            }
+        }
+        this.edges.set(id, mine);
+    }
+    /**
+     * `opts` was missing from this signature, and TypeScript accepted the class as a `VectorStore`
+     * anyway: a function of fewer parameters is assignable to a type that declares more. So the one
+     * mechanism this module has for keeping two data sets apart was silently absent from one of its
+     * three implementations, and nothing — not `tsc`, not the tests, not a review — said so.
+     *
+     * Measured before this fix, two namespaces with one document each:
+     *   query(q, 5, { namespace: 'org:acme' })  ->  acme-1, globex-1
+     *   query(q, 5, { namespace: 'does-not-exist' })  ->  2 rows
+     */
+    async query(embedding, topK, opts) {
+        if (this.items.length === 0)
+            return [];
+        // Narrow FIRST, then score. Scoring an item this caller may not see and discarding it later would
+        // still let it seed the graph walk below and lend its score to a neighbour.
+        const visible = this.items.filter((it) => (opts?.namespace === undefined || it.namespace === opts.namespace)
+            && matchesFilter(it.metadata, opts?.filter));
+        if (visible.length === 0)
+            return [];
+        const allowed = new Set(visible.map((it) => it.id));
+        // 1) Direct similarity: everyone visible is scored (in-memory corpus; same cost as InMemoryVectorStore).
+        const direct = visible
+            .map((it) => ({ id: it.id, score: cosineSimilarity(embedding, it.embedding) }))
+            .sort((a, b) => b.score - a.score);
+        // 2) Graph expansion: walk from the best `seeds` seeds to their neighbors; score = source × decay × edge.
+        const best = new Map(direct.map((d) => [d.id, d.score])); // id → best known score
+        let frontier = direct.slice(0, this.seeds).map((d) => ({ id: d.id, score: d.score }));
+        for (let hop = 0; hop < this.hops; hop++) {
+            const next = [];
+            for (const node of frontier) {
+                for (const e of this.edges.get(node.id) ?? []) {
+                    // Belt and braces: edges are built within a namespace, so this cannot fire today. It stays
+                    // because a corpus upserted before that rule existed still carries cross-namespace edges,
+                    // and a walk over stale edges is indistinguishable from a walk over correct ones.
+                    if (!allowed.has(e.id))
+                        continue;
+                    const s = node.score * this.decay * e.w;
+                    if (s > (best.get(e.id) ?? -Infinity)) {
+                        best.set(e.id, s);
+                        next.push({ id: e.id, score: s });
+                    }
+                }
+            }
+            frontier = next;
+            if (frontier.length === 0)
+                break;
+        }
+        // 3) Combined ranking → topK.
+        return [...best.entries()]
+            .sort((a, b) => b[1] - a[1] || (a[0] < b[0] ? -1 : 1)) // deterministic tie-break by id on equal score
+            .slice(0, topK)
+            .map(([id, score]) => {
+            const it = this.items[this.byId.get(id)];
+            return { id, text: it.text, metadata: it.metadata, score };
+        });
+    }
+    /** Observability/test: graph statistics (node/edge count). */
+    stats() {
+        let e = 0;
+        for (const list of this.edges.values())
+            e += list.length;
+        return { nodes: this.items.length, edges: e / 2 }; // stored bidirectionally
+    }
+}
+//# sourceMappingURL=graph-rag.js.map

package/dist/graph-rag.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-rag.js","sourceRoot":"","sources":["../src/graph-rag.ts"],"names":[],"mappings":"AAAA,gGAAgG;AAChG,iGAAiG;AACjG,iGAAiG;AACjG,EAAE;AACF,iGAAiG;AACjG,4GAA4G;AAC5G,6FAA6F;AAC7F,sGAAsG;AACtG,6GAA6G;AAC7G,OAAO,EAAE,gBAAgB,EAAE,MAAM,IAAI,CAAC;AACtC,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAclD;;;;;;GAMG;AACH,MAAM,OAAO,QAAQ;IACX,KAAK,GAAiB,EAAE,CAAC;IACzB,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,mBAAmB;IACrD,KAAK,GAAG,IAAI,GAAG,EAAuC,CAAC,CAAC,4CAA4C;IAC3F,SAAS,CAAS;IAClB,IAAI,CAAS;IACb,KAAK,CAAS;IACd,KAAK,CAAS;IAE/B,YAAY,OAAwB,EAAE;QACpC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC;QACxC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAC7B,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;QAC9H,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;IAC3G,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,QAAsB;QACjC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACtC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;gBAC1B,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,6CAA6C;gBAC1E,SAAS;YACX,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,8FAA8F;YAC9F,0FAA0F;YAC1F,2FAA2F;YAC3F,oGAAoG;YACpG,sFAAsF;YACtF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC/B,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;oBAAE,SAAS;gBACjC,IAAI,KAAK,CAAC,SAAS,KAAK,EAAE,CAAC,SAAS;oBAAE,SAAS;gBAC/C,MAAM,CAAC,GAAG,gBAAgB,CAAC,EAAE,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;gBAC1D,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;oBACxB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;oBACjD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAEO,eAAe,CAAC,EAAU;QAChC,qFAAqF;QACrF,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,EAAE;gBAAE,SAAS;YACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QACrD,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAE,CAAC;QAC3C,MAAM,IAAI,GAAgC,EAAE,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE;gBAAE,SAAS;YAC9B,IAAI,KAAK,CAAC,SAAS,KAAK,EAAE,CAAC,SAAS;gBAAE,SAAS,CAAC,2CAA2C;YAC3F,MAAM,CAAC,GAAG,gBAAgB,CAAC,EAAE,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YAC1D,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC/B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC3B,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,KAAK,CAAC,SAAmB,EAAE,IAAY,EAAE,IAAmB;QAChE,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACvC,kGAAkG;QAClG,4EAA4E;QAC5E,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CACvC,CAAC,IAAI,EAAE,SAAS,KAAK,SAAS,IAAI,EAAE,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS,CAAC;eAC/D,aAAa,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QAC/C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAEpD,yGAAyG;QACzG,MAAM,MAAM,GAAG,OAAO;aACnB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,gBAAgB,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;aAC9E,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAErC,0GAA0G;QAC1G,MAAM,IAAI,GAAG,IAAI,GAAG,CAAiB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAwB;QAClG,IAAI,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACtF,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,GAAoC,EAAE,CAAC;YACjD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;oBAC9C,2FAA2F;oBAC3F,0FAA0F;oBAC1F,kFAAkF;oBAClF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBAAE,SAAS;oBACjC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;oBACxC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACtC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBAClB,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;oBACpC,CAAC;gBACH,CAAC;YACH,CAAC;YACD,QAAQ,GAAG,IAAI,CAAC;YAChB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;QACnC,CAAC;QAED,8BAA8B;QAC9B,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;aACvB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,+CAA+C;aACrG,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;aACd,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE;YACnB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAE,CAAC;YAC3C,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC7D,CAAC,CAAC,CAAC;IACP,CAAC;IAED,8DAA8D;IAC9D,KAAK;QACH,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YAAE,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC;QACzD,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,yBAAyB;IAC9E,CAAC;CACF","sourcesContent":["// GraphRAG — retrieval over a similarity GRAPH between chunks (the common \"graph RAG\" pattern).\n// Catches what plain vector search misses: chunks that don't directly resemble the query but are\n// STRONGLY connected to chunks that do resemble the query (indirect relevance) join the results.\n//\n// Design: implements the `VectorStore` interface → DROP-IN for `createRagTool`/`indexDocuments`.\n// The graph is in-memory and built from upserted chunks (the common graph-RAG approach also works in-memory\n// over chunks); for a persistent corpus, keeping chunks in a persistent store and rebuilding\n// GraphRAG as a query-time layer is the user's pattern. Since it runs durable inside `createRagTool`,\n// the query RESULT is journaled → the graph isn't retraversed on resume/replay (exactly-once RAG preserved).\nimport { cosineSimilarity } from 'ai';\nimport { matchesFilter } from './vector-store.js';\nimport type { VectorStore, VectorItem, VectorMatch, QueryOptions } from './vector-store.js';\n\nexport interface GraphRagOptions {\n  /** Edge threshold: two chunks become neighbors in the graph if their cosine similarity exceeds this. Default 0.75. */\n  threshold?: number;\n  /** Neighbor expansion depth (hops). 0 = plain vector search. Default 1. */\n  hops?: number;\n  /** Score decay factor per hop: neighbor's score = source's score × decay × edge weight. Default 0.7. */\n  decay?: number;\n  /** Number of direct results seeding the expansion (independent of query topK). Default 4. */\n  seeds?: number;\n}\n\n/**\n * VectorStore that traverses a similarity graph. Edges are built incrementally on upsert (a new\n * item is compared against all existing ones — O(n) / item). Query: the best `seeds` direct results\n * are taken, each seed's neighbors join with a `decay`-attenuated score (for `hops` rounds), the\n * combined list is sorted by score and `topK` is returned. If a node is reached via multiple paths,\n * the HIGHEST score is kept.\n */\nexport class GraphRag implements VectorStore {\n  private items: VectorItem[] = [];\n  private byId = new Map<string, number>(); // id → items index\n  private edges = new Map<string, { id: string; w: number }[]>(); // id → neighbors (edge weight = similarity)\n  private readonly threshold: number;\n  private readonly hops: number;\n  private readonly decay: number;\n  private readonly seeds: number;\n\n  constructor(opts: GraphRagOptions = {}) {\n    this.threshold = opts.threshold ?? 0.75;\n    this.hops = opts.hops ?? 1;\n    this.decay = opts.decay ?? 0.7;\n    this.seeds = opts.seeds ?? 4;\n    if (this.threshold < -1 || this.threshold > 1) throw new Error('@gnldev/rag GraphRag: threshold must be in the range [-1,1]');\n    if (this.decay <= 0 || this.decay > 1) throw new Error('@gnldev/rag GraphRag: 0 < decay <= 1 must hold');\n  }\n\n  async upsert(newItems: VectorItem[]): Promise<void> {\n    for (const it of newItems) {\n      const existing = this.byId.get(it.id);\n      if (existing !== undefined) {\n        this.items[existing] = it;\n        this.rebuildEdgesFor(it.id); // embedding may have changed → refresh edges\n        continue;\n      }\n      this.byId.set(it.id, this.items.length);\n      this.items.push(it);\n      this.edges.set(it.id, []);\n      // Incremental edge building: the new item is scored once against everyone existing IN ITS OWN\n      // namespace. Filtering at query time is not enough here and that is what makes this store\n      // different from the others: an edge is a permanent structure, so a graph built across two\n      // namespaces lets a walk enter one organization's document from another's and carry its score back.\n      // Measured before this: two namespaces, one document each -> `{\"nodes\":2,\"edges\":1}`.\n      for (const other of this.items) {\n        if (other.id === it.id) continue;\n        if (other.namespace !== it.namespace) continue;\n        const w = cosineSimilarity(it.embedding, other.embedding);\n        if (w >= this.threshold) {\n          this.edges.get(it.id)!.push({ id: other.id, w });\n          this.edges.get(other.id)!.push({ id: it.id, w });\n        }\n      }\n    }\n  }\n\n  private rebuildEdgesFor(id: string): void {\n    // Strip the old edges from both directions and recompute (upsert-update path; rare).\n    for (const [k, list] of this.edges) {\n      if (k === id) continue;\n      this.edges.set(k, list.filter((e) => e.id !== id));\n    }\n    const it = this.items[this.byId.get(id)!]!;\n    const mine: { id: string; w: number }[] = [];\n    for (const other of this.items) {\n      if (other.id === id) continue;\n      if (other.namespace !== it.namespace) continue; // same rule as upsert — see the note there\n      const w = cosineSimilarity(it.embedding, other.embedding);\n      if (w >= this.threshold) {\n        mine.push({ id: other.id, w });\n        this.edges.get(other.id)!.push({ id, w });\n      }\n    }\n    this.edges.set(id, mine);\n  }\n\n  /**\n   * `opts` was missing from this signature, and TypeScript accepted the class as a `VectorStore`\n   * anyway: a function of fewer parameters is assignable to a type that declares more. So the one\n   * mechanism this module has for keeping two data sets apart was silently absent from one of its\n   * three implementations, and nothing — not `tsc`, not the tests, not a review — said so.\n   *\n   * Measured before this fix, two namespaces with one document each:\n   *   query(q, 5, { namespace: 'org:acme' })  ->  acme-1, globex-1\n   *   query(q, 5, { namespace: 'does-not-exist' })  ->  2 rows\n   */\n  async query(embedding: number[], topK: number, opts?: QueryOptions): Promise<VectorMatch[]> {\n    if (this.items.length === 0) return [];\n    // Narrow FIRST, then score. Scoring an item this caller may not see and discarding it later would\n    // still let it seed the graph walk below and lend its score to a neighbour.\n    const visible = this.items.filter((it) =>\n      (opts?.namespace === undefined || it.namespace === opts.namespace)\n      && matchesFilter(it.metadata, opts?.filter));\n    if (visible.length === 0) return [];\n    const allowed = new Set(visible.map((it) => it.id));\n\n    // 1) Direct similarity: everyone visible is scored (in-memory corpus; same cost as InMemoryVectorStore).\n    const direct = visible\n      .map((it) => ({ id: it.id, score: cosineSimilarity(embedding, it.embedding) }))\n      .sort((a, b) => b.score - a.score);\n\n    // 2) Graph expansion: walk from the best `seeds` seeds to their neighbors; score = source × decay × edge.\n    const best = new Map<string, number>(direct.map((d) => [d.id, d.score])); // id → best known score\n    let frontier = direct.slice(0, this.seeds).map((d) => ({ id: d.id, score: d.score }));\n    for (let hop = 0; hop < this.hops; hop++) {\n      const next: { id: string; score: number }[] = [];\n      for (const node of frontier) {\n        for (const e of this.edges.get(node.id) ?? []) {\n          // Belt and braces: edges are built within a namespace, so this cannot fire today. It stays\n          // because a corpus upserted before that rule existed still carries cross-namespace edges,\n          // and a walk over stale edges is indistinguishable from a walk over correct ones.\n          if (!allowed.has(e.id)) continue;\n          const s = node.score * this.decay * e.w;\n          if (s > (best.get(e.id) ?? -Infinity)) {\n            best.set(e.id, s);\n            next.push({ id: e.id, score: s });\n          }\n        }\n      }\n      frontier = next;\n      if (frontier.length === 0) break;\n    }\n\n    // 3) Combined ranking → topK.\n    return [...best.entries()]\n      .sort((a, b) => b[1] - a[1] || (a[0] < b[0] ? -1 : 1)) // deterministic tie-break by id on equal score\n      .slice(0, topK)\n      .map(([id, score]) => {\n        const it = this.items[this.byId.get(id)!]!;\n        return { id, text: it.text, metadata: it.metadata, score };\n      });\n  }\n\n  /** Observability/test: graph statistics (node/edge count). */\n  stats(): { nodes: number; edges: number } {\n    let e = 0;\n    for (const list of this.edges.values()) e += list.length;\n    return { nodes: this.items.length, edges: e / 2 }; // stored bidirectionally\n  }\n}\n"]}