@adonis-agora/agent 0.35.0 → 0.37.0

package/dist/src/rag/tree/navigate.d.ts

@@ -0,0 +1,137 @@
+import type { Passage, RetrieveOptions, Retriever } from '../../spi/retriever.js';
+import { type TreeBudget, type TreeLlm } from './llm.js';
+import type { DocumentTreeStore } from './store.js';
+export interface TreeNavigationRetrieverOptions {
+    store: DocumentTreeStore;
+    llm: TreeLlm;
+    /**
+     * A tree whose outline (titles, pages, summaries) fits in this many characters is navigated in
+     * **one** call that sees the whole outline — PageIndex's tree search, the variant measured in the
+     * benchmark. Bigger trees are walked level by level (a beam). Default 40 000 (~10k tokens).
+     */
+    singlePassMaxChars?: number;
+    /** Nodes the navigator may expand or read per beam step. Default 4. */
+    beamWidth?: number;
+    /** Beam levels, at most. Nodes still marked "expand" at the last level are read whole. Default 4. */
+    maxSteps?: number;
+    /** Nodes returned per document, at most. Default 5. */
+    maxNodes?: number;
+    /**
+     * Hard per-document limits for one navigation. Defaults: 6 calls, 60k input tokens, 4k output
+     * tokens, 60 s. Running out mid-walk returns what was chosen so far (the nodes last marked for
+     * expansion are read whole) and records `stoppedBy: 'budget'`.
+     */
+    budget?: TreeBudget;
+    /** Characters of text per returned node. Default 12 000. */
+    maxPassageChars?: number;
+    /** Units (pages/sections) read per returned node, at most. Default 25. */
+    maxUnitsPerNode?: number;
+    /** Characters across all passages of one navigation (every document). Default 48 000 (~12k tokens). */
+    maxContextChars?: number;
+    /**
+     * {@link TreeNavigationRetriever.retrieve} with no first stage: documents navigated per query. When
+     * more trees pass the filter, the LLM picks this many from their titles and descriptions
+     * (PageIndex's document selection). Default 3.
+     */
+    maxDocuments?: number;
+    /** Trees shown to document selection, at most. Default 200. */
+    maxSelectionCandidates?: number;
+    /** Documents navigated in parallel. Default 3. */
+    concurrency?: number;
+}
+/** One step of a navigation, for the audit trail. */
+export interface NavigationStep {
+    step: number;
+    /** Node ids shown to the LLM this step. */
+    shown: string[];
+    /** Node ids it chose to open further. */
+    expanded: string[];
+    /** Node ids it chose to read. */
+    read: string[];
+    /** The LLM's stated reasoning, verbatim (capped). */
+    reasoning?: string;
+}
+/** A node navigation chose, with the path that led to it. */
+export interface NavigatedNode {
+    nodeId: string;
+    title: string;
+    /** Ancestors from the top level down, then the node itself. */
+    path: {
+        id: string;
+        title: string;
+    }[];
+    pageStart?: number;
+    pageEnd?: number;
+    unitStart: number;
+    unitEnd: number;
+}
+/** The auditable record of navigating one document. */
+export interface DocumentNavigation {
+    documentId: string;
+    title?: string;
+    mode: 'single-pass' | 'beam';
+    steps: NavigationStep[];
+    nodes: NavigatedNode[];
+    llmCalls: number;
+    inputTokens: number;
+    outputTokens: number;
+    /** Why the walk stopped early, when it did. */
+    stoppedBy?: 'budget' | 'timeout' | 'maxSteps' | 'error' | 'not-found';
+    error?: string;
+}
+export interface NavigationResult {
+    passages: Passage[];
+    documents: DocumentNavigation[];
+    /** Set when {@link TreeNavigationRetriever.retrieve} had the LLM pick the documents. */
+    selection?: {
+        candidates: number;
+        selected: string[];
+        reasoning?: string;
+        error?: string;
+    };
+}
+export interface NavigateOptions {
+    /** Access filter applied to every tree read (vector-store semantics). */
+    filter?: Record<string, unknown>;
+    /** Overrides the retriever's per-document budget. */
+    budget?: TreeBudget;
+    signal?: AbortSignal;
+}
+/**
+ * Tree navigation retrieval ("vectorless", reasoning-based — PageIndex's method): an LLM reads a
+ * document's table of contents (titles, page ranges, summaries — no body text) and picks the
+ * sections that answer the question; their text comes back as passages, with the path taken and the
+ * model's reasoning recorded so the choice is auditable.
+ *
+ * A small tree is navigated in one call over the whole outline. A large one is walked level by
+ * level: the model sees one level of candidates, opens (`expand`) the promising ones and takes
+ * (`read`) the ones that already answer, until it reaches leaves, runs out of `maxSteps`, or runs
+ * out of its hard per-document {@link TreeBudget} — in which case it returns what it had.
+ *
+ * It pays off on **long structured documents** (regulations, contracts, filings, manuals) where
+ * chunk ranking struggles among hundreds of look-alike passages; on short notes it costs seconds and
+ * LLM spend for nothing. Compose it behind a first stage with {@link TwoStageRetriever}, or give it
+ * to the agent as a tool with {@link createNavigateDocumentTool}.
+ *
+ * As a plain `Retriever`, `retrieve(query, { filter })` navigates the trees that pass `filter`:
+ * all of them when there are at most `maxDocuments`, otherwise the ones the LLM picks from their
+ * descriptions.
+ */
+export declare class TreeNavigationRetriever implements Retriever {
+    private readonly options;
+    readonly store: DocumentTreeStore;
+    private readonly llm;
+    constructor(options: TreeNavigationRetrieverOptions);
+    retrieve(query: string, options?: RetrieveOptions): Promise<Passage[]>;
+    /** {@link retrieve} with the audit trail: which documents, which nodes, why. */
+    search(query: string, options?: NavigateOptions): Promise<NavigationResult>;
+    /**
+     * Navigate the given documents (in parallel, up to `concurrency`) and return their passages in
+     * the order given, within `maxContextChars`. Documents without a tree, or whose tree fails
+     * `filter`, yield no passages and `stoppedBy: 'not-found'`.
+     */
+    navigate(query: string, documentIds: readonly string[], options?: NavigateOptions): Promise<NavigationResult>;
+    private walk;
+    private passagesOf;
+}
+//# sourceMappingURL=navigate.d.ts.map

package/dist/src/rag/tree/navigate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"navigate.d.ts","sourceRoot":"","sources":["../../../../src/rag/tree/navigate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAElF,OAAO,EAIL,KAAK,UAAU,EAEf,KAAK,OAAO,EAEb,MAAM,UAAU,CAAC;AAClB,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAIpD,MAAM,WAAW,8BAA8B;IAC7C,KAAK,EAAE,iBAAiB,CAAC;IACzB,GAAG,EAAE,OAAO,CAAC;IACb;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,uEAAuE;IACvE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,qGAAqG;IACrG,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,uDAAuD;IACvD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB,4DAA4D;IAC5D,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,0EAA0E;IAC1E,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,uGAAuG;IACvG,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,+DAA+D;IAC/D,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC,kDAAkD;IAClD,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,qDAAqD;AACrD,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,2CAA2C;IAC3C,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,yCAAyC;IACzC,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,iCAAiC;IACjC,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,qDAAqD;IACrD,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,6DAA6D;AAC7D,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,+DAA+D;IAC/D,IAAI,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IACtC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,uDAAuD;AACvD,MAAM,WAAW,kBAAkB;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,aAAa,GAAG,MAAM,CAAC;IAC7B,KAAK,EAAE,cAAc,EAAE,CAAC;IACxB,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;IACrB,+CAA+C;IAC/C,SAAS,CAAC,EAAE,QAAQ,GAAG,SAAS,GAAG,UAAU,GAAG,OAAO,GAAG,WAAW,CAAC;IACtE,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,SAAS,EAAE,kBAAkB,EAAE,CAAC;IAChC,wFAAwF;IACxF,SAAS,CAAC,EAAE;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,EAAE,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;CAC5F;AAED,MAAM,WAAW,eAAe;IAC9B,yEAAyE;IACzE,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,qDAAqD;IACrD,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAoED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,qBAAa,uBAAwB,YAAW,SAAS;IAI3C,OAAO,CAAC,QAAQ,CAAC,OAAO;IAHpC,QAAQ,CAAC,KAAK,EAAE,iBAAiB,CAAC;IAClC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAU;IAE9B,YAA6B,OAAO,EAAE,8BAA8B,EAGnE;IAEK,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,eAAoB,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAM/E;IAED,gFAAgF;IAC1E,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,eAAoB,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAiEpF;IAED;;;;OAIG;IACG,QAAQ,CACZ,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,SAAS,MAAM,EAAE,EAC9B,OAAO,GAAE,eAAoB,GAC5B,OAAO,CAAC,gBAAgB,CAAC,CA4C3B;YAEa,IAAI;YAwLJ,UAAU;CAuCzB"}

package/dist/src/rag/tree/navigate.js

@@ -0,0 +1,404 @@
+import { mapLimit } from './build.js';
+import { BudgetedLlm, parseJsonReply, stringList, TreeBudgetExceededError, } from './llm.js';
+import { indexTree, walkTree } from './types.js';
+const NAVIGATE_SYSTEM = 'You navigate the table of contents of a document to find where a question is answered. You answer with JSON only.';
+const DEFAULT_BUDGET = {
+    maxCalls: 6,
+    maxInputTokens: 60_000,
+    maxOutputTokens: 4_000,
+    timeoutMs: 60_000,
+};
+function pages(node) {
+    if (node.pageStart === undefined) {
+        return undefined;
+    }
+    return node.pageEnd === undefined || node.pageEnd === node.pageStart
+        ? `p. ${node.pageStart}`
+        : `pp. ${node.pageStart}-${node.pageEnd}`;
+}
+function candidate(node, summaryChars, depth) {
+    const shownPages = pages(node);
+    let summary = node.summary;
+    if (summary !== undefined && summary.length > summaryChars) {
+        summary = `${summary.slice(0, Math.max(0, summaryChars - 1))}…`;
+    }
+    if (node.keyItems !== undefined && node.keyItems.length > 0 && summaryChars > 0) {
+        summary = `${summary ?? ''}${summary ? ' ' : ''}Includes: ${node.keyItems.slice(0, 12).join('; ')}`;
+    }
+    return {
+        id: node.id,
+        title: node.title,
+        ...(summary && summaryChars > 0 ? { summary } : {}),
+        ...(shownPages !== undefined ? { pages: shownPages } : {}),
+        ...(depth !== undefined ? { depth } : { hasChildren: node.children.length > 0 }),
+    };
+}
+function render(candidates) {
+    return candidates
+        .map((entry) => {
+        const indent = '  '.repeat(entry.depth ?? 0);
+        const meta = [entry.pages, entry.hasChildren ? 'has subsections' : undefined]
+            .filter(Boolean)
+            .join(', ');
+        return `${indent}[${entry.id}] ${entry.title}${meta ? ` (${meta})` : ''}${entry.summary ? ` — ${entry.summary}` : ''}`;
+    })
+        .join('\n');
+}
+/** Candidates rendered within `maxChars`: full summaries, then shorter, then titles only. */
+function fitCandidates(nodes, maxChars) {
+    let last;
+    for (const summaryChars of [400, 160, 0]) {
+        const candidates = nodes.map(({ node, depth }) => candidate(node, summaryChars, depth));
+        const text = render(candidates);
+        last = { candidates, text };
+        if (text.length <= maxChars) {
+            break;
+        }
+    }
+    return last;
+}
+/**
+ * Tree navigation retrieval ("vectorless", reasoning-based — PageIndex's method): an LLM reads a
+ * document's table of contents (titles, page ranges, summaries — no body text) and picks the
+ * sections that answer the question; their text comes back as passages, with the path taken and the
+ * model's reasoning recorded so the choice is auditable.
+ *
+ * A small tree is navigated in one call over the whole outline. A large one is walked level by
+ * level: the model sees one level of candidates, opens (`expand`) the promising ones and takes
+ * (`read`) the ones that already answer, until it reaches leaves, runs out of `maxSteps`, or runs
+ * out of its hard per-document {@link TreeBudget} — in which case it returns what it had.
+ *
+ * It pays off on **long structured documents** (regulations, contracts, filings, manuals) where
+ * chunk ranking struggles among hundreds of look-alike passages; on short notes it costs seconds and
+ * LLM spend for nothing. Compose it behind a first stage with {@link TwoStageRetriever}, or give it
+ * to the agent as a tool with {@link createNavigateDocumentTool}.
+ *
+ * As a plain `Retriever`, `retrieve(query, { filter })` navigates the trees that pass `filter`:
+ * all of them when there are at most `maxDocuments`, otherwise the ones the LLM picks from their
+ * descriptions.
+ */
+export class TreeNavigationRetriever {
+    options;
+    store;
+    llm;
+    constructor(options) {
+        this.options = options;
+        this.store = options.store;
+        this.llm = options.llm;
+    }
+    async retrieve(query, options = {}) {
+        const result = await this.search(query, options.filter !== undefined ? { filter: options.filter } : {});
+        return result.passages.slice(0, options.topK ?? result.passages.length);
+    }
+    /** {@link retrieve} with the audit trail: which documents, which nodes, why. */
+    async search(query, options = {}) {
+        const maxDocuments = Math.max(1, this.options.maxDocuments ?? 3);
+        const maxCandidates = Math.max(maxDocuments, this.options.maxSelectionCandidates ?? 200);
+        const headers = await this.store.list({
+            ...(options.filter !== undefined ? { filter: options.filter } : {}),
+            limit: maxCandidates,
+        });
+        if (headers.length <= maxDocuments) {
+            return this.navigate(query, headers.map((header) => header.documentId), options);
+        }
+        const budget = new BudgetedLlm(this.llm, { ...DEFAULT_BUDGET, ...this.options.budget, ...options.budget }, options.signal);
+        const documents = headers.map((header) => ({
+            id: header.documentId,
+            ...(header.title !== undefined ? { title: header.title } : {}),
+            ...(header.description !== undefined
+                ? { description: header.description.slice(0, 600) }
+                : {}),
+        }));
+        const prompt = `Select the documents that may contain the answer to the question, most relevant first, at most ${maxDocuments}.
+
+Question: ${query}
+
+Documents:
+${documents.map((document) => `[${document.id}] ${document.title ?? ''}${document.description ? ` — ${document.description}` : ''}`).join('\n')}
+
+Reply with JSON only: {"thinking": "<why>", "documents": ["<document id>", ...]} — an empty list if none is relevant.`;
+        const known = new Set(documents.map((document) => document.id));
+        try {
+            const reply = parseJsonReply(await budget.call({ kind: 'select', query, documents, maxDocuments }, NAVIGATE_SYSTEM, prompt, 800));
+            const selected = [
+                ...new Set(stringList(reply?.documents ?? reply?.answer).filter((id) => known.has(id))),
+            ].slice(0, maxDocuments);
+            const result = await this.navigate(query, selected, options);
+            const reasoning = typeof reply?.thinking === 'string' ? reply.thinking.slice(0, 2_000) : undefined;
+            return {
+                ...result,
+                selection: {
+                    candidates: documents.length,
+                    selected,
+                    ...(reasoning !== undefined ? { reasoning } : {}),
+                },
+            };
+        }
+        catch (error) {
+            return {
+                passages: [],
+                documents: [],
+                selection: { candidates: documents.length, selected: [], error: error.message },
+            };
+        }
+    }
+    /**
+     * Navigate the given documents (in parallel, up to `concurrency`) and return their passages in
+     * the order given, within `maxContextChars`. Documents without a tree, or whose tree fails
+     * `filter`, yield no passages and `stoppedBy: 'not-found'`.
+     */
+    async navigate(query, documentIds, options = {}) {
+        const ids = [...new Set(documentIds)];
+        const trees = new Map((await this.store.getMany(ids, options.filter)).map((tree) => [tree.documentId, tree]));
+        const navigations = await mapLimit(ids, Math.max(1, this.options.concurrency ?? 3), async (id) => {
+            const tree = trees.get(id);
+            if (tree === undefined) {
+                return {
+                    navigation: {
+                        documentId: id,
+                        mode: 'single-pass',
+                        steps: [],
+                        nodes: [],
+                        llmCalls: 0,
+                        inputTokens: 0,
+                        outputTokens: 0,
+                        stoppedBy: 'not-found',
+                    },
+                    passages: [],
+                };
+            }
+            const navigation = await this.walk(query, tree, options);
+            return { navigation, passages: await this.passagesOf(tree, navigation) };
+        });
+        // Share the context budget across documents in the order given.
+        const maxContextChars = this.options.maxContextChars ?? 48_000;
+        let used = 0;
+        const passages = [];
+        for (const entry of navigations) {
+            for (const passage of entry.passages) {
+                if (used >= maxContextChars) {
+                    break;
+                }
+                const text = passage.text.slice(0, maxContextChars - used);
+                used += text.length;
+                passages.push({ ...passage, text });
+            }
+        }
+        return { passages, documents: navigations.map((entry) => entry.navigation) };
+    }
+    async walk(query, tree, options) {
+        const budget = new BudgetedLlm(this.llm, { ...DEFAULT_BUDGET, ...this.options.budget, ...options.budget }, options.signal);
+        const maxNodes = Math.max(1, this.options.maxNodes ?? 5);
+        const singlePassMaxChars = this.options.singlePassMaxChars ?? 40_000;
+        const index = indexTree(tree);
+        const whole = [...walkTree(tree.nodes)].map(({ node, path }) => ({ node, depth: path.length }));
+        const outline = fitCandidates(whole, Number.POSITIVE_INFINITY);
+        const title = tree.title ?? tree.source ?? tree.documentId;
+        const steps = [];
+        const chosen = [];
+        let stoppedBy;
+        let error;
+        const mode = outline.text.length <= singlePassMaxChars ? 'single-pass' : 'beam';
+        const stop = (caught) => {
+            if (caught instanceof TreeBudgetExceededError) {
+                stoppedBy = caught.limit === 'timeout' ? 'timeout' : 'budget';
+            }
+            else {
+                stoppedBy = 'error';
+            }
+            error = caught.message;
+        };
+        if (mode === 'single-pass') {
+            const prompt = `Find the sections of the document that are likely to contain the answer to the question. Prefer the most specific (deepest) sections; list at most ${maxNodes}, most relevant first.
+
+Question: ${query}
+
+Document: ${title}${tree.description ? `\nAbout: ${tree.description}` : ''}
+Table of contents ([id] title (pages) — summary):
+${outline.text}
+
+Reply with JSON only: {"thinking": "<which sections answer and why>", "read": ["<id>", ...]} — an empty list if none does.`;
+            try {
+                const reply = requireJson(await budget.call({ kind: 'navigate', query, mode, candidates: outline.candidates, maxNodes }, NAVIGATE_SYSTEM, prompt, 1_500));
+                const read = [...new Set(stringList(reply?.read ?? reply?.node_list ?? reply?.nodes))]
+                    .map((id) => resolveId(index, id))
+                    .filter((id) => id !== undefined)
+                    .slice(0, maxNodes);
+                chosen.push(...read);
+                steps.push({
+                    step: 1,
+                    shown: outline.candidates.map((entry) => entry.id),
+                    expanded: [],
+                    read,
+                    ...reasoningOf(reply),
+                });
+            }
+            catch (caught) {
+                stop(caught);
+            }
+        }
+        else {
+            const beamWidth = Math.max(1, this.options.beamWidth ?? 4);
+            const maxSteps = Math.max(1, this.options.maxSteps ?? 4);
+            let frontier = tree.nodes;
+            let pendingExpand = [];
+            for (let step = 1; frontier.length > 0 && chosen.length < maxNodes; step++) {
+                if (step > maxSteps) {
+                    stoppedBy = 'maxSteps';
+                    break;
+                }
+                const shown = fitCandidates(frontier.map((node) => ({ node })), singlePassMaxChars);
+                const path = index.get(frontier[0]?.id ?? '')?.path ?? [];
+                const where = path.length > 0 ? `\nYou are inside: ${path.map((node) => node.title).join(' > ')}` : '';
+                const prompt = `Find where the question is answered in the document by walking its table of contents.
+For each relevant section below, either "expand" it (open its subsections, only for sections that have subsections) or "read" it (its text answers the question). Choose at most ${beamWidth} in total, most relevant first; choose none if nothing here is relevant.
+
+Question: ${query}
+
+Document: ${title}${tree.description ? `\nAbout: ${tree.description}` : ''}${where}
+Sections ([id] title (pages) — summary):
+${shown.text}
+
+Reply with JSON only: {"thinking": "<why>", "expand": ["<id>", ...], "read": ["<id>", ...]}`;
+                let reply;
+                try {
+                    reply = requireJson(await budget.call({ kind: 'navigate', query, mode, candidates: shown.candidates, maxNodes: beamWidth }, NAVIGATE_SYSTEM, prompt, 1_200));
+                }
+                catch (caught) {
+                    stop(caught);
+                    break;
+                }
+                const onFrontier = new Set(frontier.map((node) => node.id));
+                const pick = (value) => [...new Set(stringList(value))]
+                    .map((id) => resolveId(index, id))
+                    .filter((id) => id !== undefined && onFrontier.has(id));
+                let expand = pick(reply?.expand);
+                let read = pick(reply?.read);
+                // A leaf cannot be expanded: reading it is what was meant.
+                read = [
+                    ...read,
+                    ...expand.filter((id) => (index.get(id)?.node.children.length ?? 0) === 0),
+                ];
+                expand = expand.filter((id) => (index.get(id)?.node.children.length ?? 0) > 0);
+                const limited = [...expand, ...read].slice(0, beamWidth);
+                expand = expand.filter((id) => limited.includes(id));
+                read = [...new Set(read.filter((id) => limited.includes(id)))];
+                steps.push({
+                    step,
+                    shown: shown.candidates.map((entry) => entry.id),
+                    expanded: expand,
+                    read,
+                    ...reasoningOf(reply),
+                });
+                chosen.push(...read);
+                pendingExpand = expand;
+                frontier = expand.flatMap((id) => index.get(id)?.node.children ?? []);
+                if (frontier.length === 0) {
+                    pendingExpand = [];
+                }
+            }
+            // Anything still marked for expansion when the walk stopped is read whole.
+            if (stoppedBy !== undefined) {
+                chosen.push(...pendingExpand);
+            }
+        }
+        // A section chosen together with one of its own subsections adds nothing but length: the
+        // more specific choice wins.
+        const unique = [...new Set(chosen)];
+        const specific = unique.filter((id) => !unique.some((other) => other !== id && index.get(other)?.path.some((node) => node.id === id)));
+        const nodes = specific.slice(0, maxNodes).flatMap((id) => {
+            const entry = index.get(id);
+            if (entry === undefined) {
+                return [];
+            }
+            const { node, path } = entry;
+            return [
+                {
+                    nodeId: node.id,
+                    title: node.title,
+                    path: [...path, node].map((step) => ({ id: step.id, title: step.title })),
+                    ...(node.pageStart !== undefined ? { pageStart: node.pageStart } : {}),
+                    ...(node.pageEnd !== undefined ? { pageEnd: node.pageEnd } : {}),
+                    unitStart: node.unitStart,
+                    unitEnd: node.unitEnd,
+                },
+            ];
+        });
+        return {
+            documentId: tree.documentId,
+            ...(tree.title !== undefined ? { title: tree.title } : {}),
+            mode,
+            steps,
+            nodes,
+            llmCalls: budget.calls,
+            inputTokens: budget.inputTokens,
+            outputTokens: budget.outputTokens,
+            ...(stoppedBy !== undefined ? { stoppedBy } : {}),
+            ...(error !== undefined ? { error } : {}),
+        };
+    }
+    async passagesOf(tree, navigation) {
+        const maxPassageChars = this.options.maxPassageChars ?? 12_000;
+        const maxUnits = Math.max(1, this.options.maxUnitsPerNode ?? 25);
+        const reasoning = navigation.steps
+            .map((step) => step.reasoning)
+            .filter((text) => text !== undefined)
+            .join('\n');
+        const passages = [];
+        for (const [rank, node] of navigation.nodes.entries()) {
+            const units = await this.store.readUnits(tree.documentId, node.unitStart, Math.min(node.unitEnd, node.unitStart + maxUnits - 1));
+            let text = units.map((unit) => unit.text).join('\n\n');
+            if (text.length > maxPassageChars) {
+                text = `${text.slice(0, maxPassageChars - 1)}…`;
+            }
+            passages.push({
+                id: `${tree.documentId}#node:${node.nodeId}`,
+                text,
+                // Rank within the document's choice; not a similarity.
+                score: 1 / (rank + 1),
+                source: tree.source ?? tree.title ?? tree.documentId,
+                metadata: {
+                    ...tree.metadata,
+                    documentId: tree.documentId,
+                    nodeId: node.nodeId,
+                    title: node.title,
+                    ...(node.pageStart !== undefined ? { pageStart: node.pageStart } : {}),
+                    ...(node.pageEnd !== undefined ? { pageEnd: node.pageEnd } : {}),
+                    path: node.path,
+                    retrieval: 'tree-navigation',
+                    ...(reasoning ? { reasoning: reasoning.slice(0, 2_000) } : {}),
+                },
+            });
+        }
+        return passages;
+    }
+}
+/** Accept `0003`, `3`, `"[0003]"` for node `0003`. */
+function resolveId(index, raw) {
+    const id = raw.trim().replace(/^\[|\]$/g, '');
+    if (index.has(id)) {
+        return id;
+    }
+    if (/^\d+$/.test(id)) {
+        const padded = id.padStart(4, '0');
+        if (index.has(padded)) {
+            return padded;
+        }
+    }
+    return undefined;
+}
+/** The reply's JSON object, or an error naming what came back (a truncated or chatty reply). */
+function requireJson(reply) {
+    const json = parseJsonReply(reply);
+    if (json === undefined) {
+        throw new Error(`navigation reply was not JSON: ${JSON.stringify(reply.slice(0, 120))}`);
+    }
+    return json;
+}
+function reasoningOf(reply) {
+    const thinking = reply?.thinking ?? reply?.reasoning;
+    return typeof thinking === 'string' && thinking.trim()
+        ? { reasoning: thinking.slice(0, 2_000) }
+        : {};
+}
+//# sourceMappingURL=navigate.js.map

package/dist/src/rag/tree/navigate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"navigate.js","sourceRoot":"","sources":["../../../../src/rag/tree/navigate.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EACL,WAAW,EACX,cAAc,EACd,UAAU,EAEV,uBAAuB,GAGxB,MAAM,UAAU,CAAC;AAGlB,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAgGjD,MAAM,eAAe,GACnB,mHAAmH,CAAC;AAEtH,MAAM,cAAc,GAAG;IACrB,QAAQ,EAAE,CAAC;IACX,cAAc,EAAE,MAAM;IACtB,eAAe,EAAE,KAAK;IACtB,SAAS,EAAE,MAAM;CACT,CAAC;AAEX,SAAS,KAAK,CAAC,IAAqD;IAClE,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;QACjC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,OAAO,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,SAAS;QAClE,CAAC,CAAC,MAAM,IAAI,CAAC,SAAS,EAAE;QACxB,CAAC,CAAC,OAAO,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;AAC9C,CAAC;AAED,SAAS,SAAS,CAAC,IAAsB,EAAE,YAAoB,EAAE,KAAc;IAC7E,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;IAC3B,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;QAC3D,OAAO,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAClE,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;QAChF,OAAO,GAAG,GAAG,OAAO,IAAI,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,aAAa,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IACtG,CAAC;IACD,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,GAAG,CAAC,OAAO,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnD,GAAG,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;KACjF,CAAC;AACJ,CAAC;AAED,SAAS,MAAM,CAAC,UAA8B;IAC5C,OAAO,UAAU;SACd,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QACb,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC;aAC1E,MAAM,CAAC,OAAO,CAAC;aACf,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,OAAO,GAAG,MAAM,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IACzH,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAC;AAChB,CAAC;AAED,6FAA6F;AAC7F,SAAS,aAAa,CACpB,KAAmD,EACnD,QAAgB;IAEhB,IAAI,IAAkE,CAAC;IACvE,KAAK,MAAM,YAAY,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;QACzC,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC;QACxF,MAAM,IAAI,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QAChC,IAAI,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO,IAAwD,CAAC;AAClE,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,uBAAuB;IAIL,OAAO;IAH3B,KAAK,CAAoB;IACjB,GAAG,CAAU;IAE9B,YAA6B,OAAuC;uBAAvC,OAAO;QAClC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,KAAa,EAAE,OAAO,GAAoB,EAAE;QACzD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAC9B,KAAK,EACL,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAC/D,CAAC;QACF,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC1E,CAAC;IAED,gFAAgF;IAChF,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,OAAO,GAAoB,EAAE;QACvD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC;QACjE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,OAAO,CAAC,sBAAsB,IAAI,GAAG,CAAC,CAAC;QACzF,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;YACpC,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACnE,KAAK,EAAE,aAAa;SACrB,CAAC,CAAC;QACH,IAAI,OAAO,CAAC,MAAM,IAAI,YAAY,EAAE,CAAC;YACnC,OAAO,IAAI,CAAC,QAAQ,CAClB,KAAK,EACL,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,EAC1C,OAAO,CACR,CAAC;QACJ,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,WAAW,CAC5B,IAAI,CAAC,GAAG,EACR,EAAE,GAAG,cAAc,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAChE,OAAO,CAAC,MAAM,CACf,CAAC;QACF,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACzC,EAAE,EAAE,MAAM,CAAC,UAAU;YACrB,GAAG,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9D,GAAG,CAAC,MAAM,CAAC,WAAW,KAAK,SAAS;gBAClC,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE;gBACnD,CAAC,CAAC,EAAE,CAAC;SACR,CAAC,CAAC,CAAC;QACJ,MAAM,MAAM,GAAG,kGAAkG,YAAY;;YAErH,KAAK;;;EAGf,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,IAAI,QAAQ,CAAC,EAAE,KAAK,QAAQ,CAAC,KAAK,IAAI,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;;sHAEzB,CAAC;QACnH,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QAChE,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,cAAc,CAC1B,MAAM,MAAM,CAAC,IAAI,CACf,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,EAClD,eAAe,EACf,MAAM,EACN,GAAG,CACJ,CACF,CAAC;YACF,MAAM,QAAQ,GAAG;gBACf,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,SAAS,IAAI,KAAK,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;aACxF,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;YACzB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC7D,MAAM,SAAS,GACb,OAAO,KAAK,EAAE,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACnF,OAAO;gBACL,GAAG,MAAM;gBACT,SAAS,EAAE;oBACT,UAAU,EAAE,SAAS,CAAC,MAAM;oBAC5B,QAAQ;oBACR,GAAG,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBAClD;aACF,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO;gBACL,QAAQ,EAAE,EAAE;gBACZ,SAAS,EAAE,EAAE;gBACb,SAAS,EAAE,EAAE,UAAU,EAAE,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAG,KAAe,CAAC,OAAO,EAAE;aAC3F,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,QAAQ,CACZ,KAAa,EACb,WAA8B,EAC9B,OAAO,GAAoB,EAAE;QAE7B,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,GAAG,CACnB,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CACvF,CAAC;QACF,MAAM,WAAW,GAAG,MAAM,QAAQ,CAChC,GAAG,EACH,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,EAC1C,KAAK,EAAE,EAAE,EAAE,EAAE;YACX,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC3B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO;oBACL,UAAU,EAAE;wBACV,UAAU,EAAE,EAAE;wBACd,IAAI,EAAE,aAAa;wBACnB,KAAK,EAAE,EAAE;wBACT,KAAK,EAAE,EAAE;wBACT,QAAQ,EAAE,CAAC;wBACX,WAAW,EAAE,CAAC;wBACd,YAAY,EAAE,CAAC;wBACf,SAAS,EAAE,WAAW;qBACM;oBAC9B,QAAQ,EAAE,EAAe;iBAC1B,CAAC;YACJ,CAAC;YACD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;YACzD,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC;QAC3E,CAAC,CACF,CAAC;QACF,gEAAgE;QAChE,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,eAAe,IAAI,MAAM,CAAC;QAC/D,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;YAChC,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACrC,IAAI,IAAI,IAAI,eAAe,EAAE,CAAC;oBAC5B,MAAM;gBACR,CAAC;gBACD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,GAAG,IAAI,CAAC,CAAC;gBAC3D,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC;gBACpB,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;IAC/E,CAAC;IAEO,KAAK,CAAC,IAAI,CAChB,KAAa,EACb,IAAkB,EAClB,OAAwB;QAExB,MAAM,MAAM,GAAG,IAAI,WAAW,CAC5B,IAAI,CAAC,GAAG,EACR,EAAE,GAAG,cAAc,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAChE,OAAO,CAAC,MAAM,CACf,CAAC;QACF,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC;QACzD,MAAM,kBAAkB,GAAG,IAAI,CAAC,OAAO,CAAC,kBAAkB,IAAI,MAAM,CAAC;QACrE,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAChG,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;QAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC;QAC3D,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,SAA0C,CAAC;QAC/C,IAAI,KAAyB,CAAC;QAC9B,MAAM,IAAI,GACR,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,kBAAkB,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC;QAErE,MAAM,IAAI,GAAG,CAAC,MAAe,EAAE,EAAE;YAC/B,IAAI,MAAM,YAAY,uBAAuB,EAAE,CAAC;gBAC9C,SAAS,GAAG,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;YAChE,CAAC;iBAAM,CAAC;gBACN,SAAS,GAAG,OAAO,CAAC;YACtB,CAAC;YACD,KAAK,GAAI,MAAgB,CAAC,OAAO,CAAC;QACpC,CAAC,CAAC;QAEF,IAAI,IAAI,KAAK,aAAa,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAG,sJAAsJ,QAAQ;;YAEvK,KAAK;;YAEL,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE;;EAExE,OAAO,CAAC,IAAI;;2HAE6G,CAAC;YACtH,IAAI,CAAC;gBACH,MAAM,KAAK,GAAG,WAAW,CACvB,MAAM,MAAM,CAAC,IAAI,CACf,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,QAAQ,EAAE,EAC3E,eAAe,EACf,MAAM,EACN,KAAK,CACN,CACF,CAAC;gBACF,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,SAAS,IAAI,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;qBACnF,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;qBACjC,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,EAAE,KAAK,SAAS,CAAC;qBAC9C,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC;oBACT,IAAI,EAAE,CAAC;oBACP,KAAK,EAAE,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;oBAClD,QAAQ,EAAE,EAAE;oBACZ,IAAI;oBACJ,GAAG,WAAW,CAAC,KAAK,CAAC;iBACtB,CAAC,CAAC;YACL,CAAC;YAAC,OAAO,MAAM,EAAE,CAAC;gBAChB,IAAI,CAAC,MAAM,CAAC,CAAC;YACf,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC;YAC3D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC;YACzD,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC1B,IAAI,aAAa,GAAa,EAAE,CAAC;YACjC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC;gBAC3E,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;oBACpB,SAAS,GAAG,UAAU,CAAC;oBACvB,MAAM;gBACR,CAAC;gBACD,MAAM,KAAK,GAAG,aAAa,CACzB,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAClC,kBAAkB,CACnB,CAAC;gBACF,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,IAAI,EAAE,CAAC;gBAC1D,MAAM,KAAK,GACT,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,qBAAqB,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC3F,MAAM,MAAM,GAAG;mLAC4J,SAAS;;YAEhL,KAAK;;YAEL,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK;;EAEhF,KAAK,CAAC,IAAI;;4FAEgF,CAAC;gBACrF,IAAI,KAA0C,CAAC;gBAC/C,IAAI,CAAC;oBACH,KAAK,GAAG,WAAW,CACjB,MAAM,MAAM,CAAC,IAAI,CACf,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,EACpF,eAAe,EACf,MAAM,EACN,KAAK,CACN,CACF,CAAC;gBACJ,CAAC;gBAAC,OAAO,MAAM,EAAE,CAAC;oBAChB,IAAI,CAAC,MAAM,CAAC,CAAC;oBACb,MAAM;gBACR,CAAC;gBACD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC5D,MAAM,IAAI,GAAG,CAAC,KAAc,EAAE,EAAE,CAC9B,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;qBAC5B,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;qBACjC,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,EAAE,KAAK,SAAS,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC1E,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACjC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC7B,2DAA2D;gBAC3D,IAAI,GAAG;oBACL,GAAG,IAAI;oBACP,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;iBAC3E,CAAC;gBACF,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/E,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;gBACzD,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;gBACrD,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/D,KAAK,CAAC,IAAI,CAAC;oBACT,IAAI;oBACJ,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;oBAChD,QAAQ,EAAE,MAAM;oBAChB,IAAI;oBACJ,GAAG,WAAW,CAAC,KAAK,CAAC;iBACtB,CAAC,CAAC;gBACH,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;gBACrB,aAAa,GAAG,MAAM,CAAC;gBACvB,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;gBACtE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC1B,aAAa,GAAG,EAAE,CAAC;gBACrB,CAAC;YACH,CAAC;YACD,2EAA2E;YAC3E,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,yFAAyF;QACzF,6BAA6B;QAC7B,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QACpC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAC5B,CAAC,EAAE,EAAE,EAAE,CACL,CAAC,MAAM,CAAC,IAAI,CACV,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CACjF,CACJ,CAAC;QACF,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE;YACvD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;YAC7B,OAAO;gBACL;oBACE,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;oBACzE,GAAG,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACtE,GAAG,CAAC,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChE,SAAS,EAAE,IAAI,CAAC,SAAS;oBACzB,OAAO,EAAE,IAAI,CAAC,OAAO;iBACE;aAC1B,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1D,IAAI;YACJ,KAAK;YACL,KAAK;YACL,QAAQ,EAAE,MAAM,CAAC,KAAK;YACtB,WAAW,EAAE,MAAM,CAAC,WAAW;YAC/B,YAAY,EAAE,MAAM,CAAC,YAAY;YACjC,GAAG,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACjD,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC1C,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,UAAU,CAAC,IAAkB,EAAE,UAA8B;QACzE,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,eAAe,IAAI,MAAM,CAAC;QAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,eAAe,IAAI,EAAE,CAAC,CAAC;QACjE,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK;aAC/B,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC;aAC7B,MAAM,CAAC,CAAC,IAAI,EAAkB,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC;aACpD,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACtD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,SAAS,CACtC,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC,CACtD,CAAC;YACF,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvD,IAAI,IAAI,CAAC,MAAM,GAAG,eAAe,EAAE,CAAC;gBAClC,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,GAAG,CAAC,CAAC,GAAG,CAAC;YAClD,CAAC;YACD,QAAQ,CAAC,IAAI,CAAC;gBACZ,EAAE,EAAE,GAAG,IAAI,CAAC,UAAU,SAAS,IAAI,CAAC,MAAM,EAAE;gBAC5C,IAAI;gBACJ,uDAAuD;gBACvD,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;gBACrB,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,UAAU;gBACpD,QAAQ,EAAE;oBACR,GAAG,IAAI,CAAC,QAAQ;oBAChB,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,GAAG,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACtE,GAAG,CAAC,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChE,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,SAAS,EAAE,iBAAiB;oBAC5B,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBAC/D;aACF,CAAC,CAAC;QACL,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAED,sDAAsD;AACtD,SAAS,SAAS,CAAC,KAA2B,EAAE,GAAW;IACzD,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;IAC9C,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;QAClB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;QACrB,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACtB,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,gGAAgG;AAChG,SAAS,WAAW,CAAC,KAAa;IAChC,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACnC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,kCAAkC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAAC,KAA0C;IAC7D,MAAM,QAAQ,GAAG,KAAK,EAAE,QAAQ,IAAI,KAAK,EAAE,SAAS,CAAC;IACrD,OAAO,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,CAAC,IAAI,EAAE;QACpD,CAAC,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE;QACzC,CAAC,CAAC,EAAE,CAAC;AACT,CAAC"}

package/dist/src/rag/tree/pg-tree-store.d.ts

@@ -0,0 +1,45 @@
+import type { LucidRawRunner } from '../../stores/lucid.js';
+import { type DocumentTreeHeader, type DocumentTreeStore } from './store.js';
+import type { DocumentTree, TreeUnit } from './types.js';
+export interface PgDocumentTreeStoreOptions {
+    /** Trees table. Default `agent_rag_trees`. Validated against the identifier regex. */
+    table?: string;
+    /** Units (page/section text) table. Default `${table}_units`, i.e. `agent_rag_trees_units`. */
+    unitsTable?: string;
+    /** Unit rows per multi-row `INSERT`. Default 200. */
+    insertBatchSize?: number;
+}
+/**
+ * A Postgres {@link DocumentTreeStore} over Lucid's raw runner (`db` or `db.connection(name)` — the
+ * same structural {@link LucidRawRunner} `PgVectorStore` takes, so `@adonisjs/lucid` stays an
+ * optional peer): one row per tree (header columns, `metadata` as `jsonb` for filtering, the nodes as
+ * `jsonb`) and one row per unit of text. Filters compile through the same builder as `PgVectorStore`'s
+ * — scalar `@>` containment, array match-any, empty array denies — so the filter you pass the vector
+ * store works here unchanged.
+ *
+ * Provision it with the published `create_agent_rag_trees` migration, or {@link ensureSchema} /
+ * {@link schemaStatements}. Needs no extension. Writes run in one transaction when the runner has one.
+ */
+export declare class PgDocumentTreeStore implements DocumentTreeStore {
+    protected readonly db: LucidRawRunner;
+    protected readonly table: string;
+    protected readonly unitsTable: string;
+    private readonly insertBatchSize;
+    constructor(db: LucidRawRunner, options?: PgDocumentTreeStoreOptions);
+    /** The idempotent DDL {@link ensureSchema} runs, in order. */
+    schemaStatements(): string[];
+    ensureSchema(): Promise<void>;
+    private write;
+    /** Replace the tree and its units (one transaction when the runner has one). */
+    put(tree: DocumentTree, units: TreeUnit[]): Promise<void>;
+    get(documentId: string, filter?: Record<string, unknown>): Promise<DocumentTree | undefined>;
+    getMany(documentIds: readonly string[], filter?: Record<string, unknown>): Promise<DocumentTree[]>;
+    list(options?: {
+        filter?: Record<string, unknown>;
+        documentIds?: readonly string[];
+        limit?: number;
+    }): Promise<DocumentTreeHeader[]>;
+    readUnits(documentId: string, start: number, end: number): Promise<TreeUnit[]>;
+    remove(documentId: string): Promise<void>;
+}
+//# sourceMappingURL=pg-tree-store.d.ts.map

package/dist/src/rag/tree/pg-tree-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pg-tree-store.d.ts","sourceRoot":"","sources":["../../../../src/rag/tree/pg-tree-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAE5D,OAAO,EAAE,KAAK,kBAAkB,EAAE,KAAK,iBAAiB,EAAY,MAAM,YAAY,CAAC;AACvF,OAAO,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEzD,MAAM,WAAW,0BAA0B;IACzC,sFAAsF;IACtF,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,+FAA+F;IAC/F,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,qDAAqD;IACrD,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAoCD;;;;;;;;;;GAUG;AACH,qBAAa,mBAAoB,YAAW,iBAAiB;IAMzD,SAAS,CAAC,QAAQ,CAAC,EAAE,EAAE,cAAc;IALvC,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACjC,SAAS,CAAC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IACtC,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAS;IAEzC,YACqB,EAAE,EAAE,cAAc,EACrC,OAAO,GAAE,0BAA+B,EAKzC;IAED,8DAA8D;IAC9D,gBAAgB,IAAI,MAAM,EAAE,CAuB3B;IAEK,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC,CAIlC;YAEa,KAAK;IAYnB,gFAAgF;IAC1E,GAAG,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CA0C9D;IAEK,GAAG,CACP,UAAU,EAAE,MAAM,EAClB,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC/B,OAAO,CAAC,YAAY,GAAG,SAAS,CAAC,CAEnC;IAEK,OAAO,CACX,WAAW,EAAE,SAAS,MAAM,EAAE,EAC9B,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC/B,OAAO,CAAC,YAAY,EAAE,CAAC,CAiBzB;IAEK,IAAI,CACR,OAAO,GAAE;QACP,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACjC,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;QAChC,KAAK,CAAC,EAAE,MAAM,CAAC;KACX,GACL,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAoD/B;IAEK,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAanF;IAEK,MAAM,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAK9C;CACF"}