@framers/agentos 0.1.101 → 0.1.103

package/dist/memory/ingestion/ChunkingEngine.js

@@ -0,0 +1,508 @@
+/**
+ * @fileoverview ChunkingEngine — splits raw document text into `DocumentChunk`
+ * slices ready for embedding and vector-store ingestion.
+ *
+ * Four strategies are supported:
+ *
+ * - **fixed**       — split at a fixed character count with word-boundary
+ *                     awareness and configurable overlap.
+ * - **semantic**    — embed individual sentences and split where cosine
+ *                     similarity drops below a threshold (topic boundaries).
+ *                     Falls back to `fixed` when no `embedFn` is supplied.
+ * - **hierarchical**— honour Markdown heading structure; each heading creates
+ *                     a new chunk boundary with the heading stored in metadata.
+ *                     Long sections are sub-split with `fixed`.
+ * - **layout**      — preserve fenced code blocks and pipe-delimited tables as
+ *                     atomic chunks; surrounding prose is split with `fixed`.
+ *
+ * @module memory/ingestion/ChunkingEngine
+ */
+// ---------------------------------------------------------------------------
+// Internal constants
+// ---------------------------------------------------------------------------
+/** Default target chunk size in characters. */
+const DEFAULT_CHUNK_SIZE = 512;
+/** Default overlap between consecutive chunks in characters. */
+const DEFAULT_CHUNK_OVERLAP = 64;
+/**
+ * Cosine similarity threshold below which two consecutive sentence embeddings
+ * are considered to belong to different topics.  Split points are inserted
+ * wherever similarity falls below this value.
+ */
+const SEMANTIC_SPLIT_THRESHOLD = 0.3;
+/**
+ * Maximum allowed chunk character count for a semantic group before it is
+ * further sub-split with the fixed strategy.  Expressed as a multiplier of
+ * `chunkSize`.
+ */
+const SEMANTIC_MAX_CHUNK_MULTIPLIER = 2;
+// ---------------------------------------------------------------------------
+// Helper — cosine similarity
+// ---------------------------------------------------------------------------
+/**
+ * Computes the cosine similarity between two equal-length dense vectors.
+ *
+ * Returns a value in [-1, 1] where 1 means identical direction and 0 means
+ * orthogonal.  Returns 0 safely when either vector is the zero vector.
+ *
+ * @param a - First vector.
+ * @param b - Second vector.
+ * @returns Cosine similarity scalar.
+ */
+function cosineSimilarity(a, b) {
+    let dot = 0;
+    let magA = 0;
+    let magB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        magA += a[i] * a[i];
+        magB += b[i] * b[i];
+    }
+    return dot / (Math.sqrt(magA) * Math.sqrt(magB) || 1);
+}
+// ---------------------------------------------------------------------------
+// Helper — fixed strategy (used internally by other strategies)
+// ---------------------------------------------------------------------------
+/**
+ * Splits `content` into fixed-size character chunks with optional overlap,
+ * breaking at word boundaries so no word is split mid-token.
+ *
+ * @param content     - Full text to split.
+ * @param chunkSize   - Target character count per chunk.
+ * @param chunkOverlap - Number of trailing characters from the previous chunk
+ *                       prepended to the next chunk.
+ * @param startIndex  - The `DocumentChunk.index` to assign to the first
+ *                      produced chunk.  Useful when merging partial results.
+ * @param baseMetadata - Extra metadata fields merged into every produced chunk.
+ * @returns Array of `DocumentChunk` objects in order.
+ */
+function fixedChunks(content, chunkSize, chunkOverlap, startIndex = 0, baseMetadata) {
+    const chunks = [];
+    let pos = 0;
+    let chunkIndex = startIndex;
+    while (pos < content.length) {
+        // Desired end position for this window.
+        let end = pos + chunkSize;
+        if (end >= content.length) {
+            // We've reached (or exceeded) the end — take whatever remains.
+            const slice = content.slice(pos).trim();
+            if (slice.length > 0) {
+                chunks.push({
+                    content: slice,
+                    index: chunkIndex++,
+                    ...(baseMetadata ? { metadata: { ...baseMetadata } } : {}),
+                });
+            }
+            break;
+        }
+        // Walk backwards from `end` until we land on a whitespace boundary so we
+        // never split a word in the middle.
+        while (end > pos && !/\s/.test(content[end])) {
+            end--;
+        }
+        // Edge case: no whitespace found in the whole window — hard-cut.
+        if (end === pos) {
+            end = pos + chunkSize;
+        }
+        const slice = content.slice(pos, end).trim();
+        if (slice.length > 0) {
+            chunks.push({
+                content: slice,
+                index: chunkIndex++,
+                ...(baseMetadata ? { metadata: { ...baseMetadata } } : {}),
+            });
+        }
+        // Advance position, stepping back by `chunkOverlap` characters.
+        pos = end - chunkOverlap;
+        if (pos <= 0)
+            pos = end; // Guard against infinite loop on tiny content.
+    }
+    return chunks;
+}
+// ---------------------------------------------------------------------------
+// ChunkingEngine
+// ---------------------------------------------------------------------------
+/**
+ * Splits raw document text into an ordered array of `DocumentChunk` objects
+ * suitable for embedding and storage in a vector index.
+ *
+ * @example
+ * ```typescript
+ * const engine = new ChunkingEngine();
+ * const chunks = await engine.chunk(content, { strategy: 'fixed', chunkSize: 512 });
+ * ```
+ */
+export class ChunkingEngine {
+    // -------------------------------------------------------------------------
+    // Public API
+    // -------------------------------------------------------------------------
+    /**
+     * Chunks the provided `content` string according to the given `options`.
+     *
+     * All strategy implementations are async to accommodate the optional
+     * `embedFn` used by the semantic strategy.
+     *
+     * @param content - Full document text to split.
+     * @param options - Chunking strategy and tuning parameters.
+     * @returns Ordered array of `DocumentChunk` objects with sequential indices.
+     */
+    async chunk(content, options) {
+        const chunkSize = options.chunkSize ?? DEFAULT_CHUNK_SIZE;
+        const chunkOverlap = options.chunkOverlap ?? DEFAULT_CHUNK_OVERLAP;
+        switch (options.strategy) {
+            case 'fixed':
+                return this._chunkFixed(content, chunkSize, chunkOverlap);
+            case 'semantic':
+                return this._chunkSemantic(content, chunkSize, chunkOverlap, options.embedFn);
+            case 'hierarchical':
+                return this._chunkHierarchical(content, chunkSize, chunkOverlap);
+            case 'layout':
+                return this._chunkLayout(content, chunkSize, chunkOverlap);
+            default: {
+                // TypeScript exhaustiveness guard.
+                const never = options.strategy;
+                throw new Error(`ChunkingEngine: unknown strategy "${String(never)}"`);
+            }
+        }
+    }
+    // -------------------------------------------------------------------------
+    // Strategy: fixed
+    // -------------------------------------------------------------------------
+    /**
+     * Splits content at a fixed character count with word-boundary awareness
+     * and configurable overlap between consecutive chunks.
+     *
+     * @param content      - Text to split.
+     * @param chunkSize    - Target character count per chunk.
+     * @param chunkOverlap - Overlap in characters between consecutive chunks.
+     * @returns Ordered `DocumentChunk[]`.
+     */
+    _chunkFixed(content, chunkSize, chunkOverlap) {
+        return fixedChunks(content, chunkSize, chunkOverlap, 0);
+    }
+    // -------------------------------------------------------------------------
+    // Strategy: semantic
+    // -------------------------------------------------------------------------
+    /**
+     * Embeds individual sentences and inserts split points wherever the cosine
+     * similarity between consecutive sentence embeddings drops below
+     * {@link SEMANTIC_SPLIT_THRESHOLD} (topic boundary heuristic).
+     *
+     * When `embedFn` is not supplied the method falls back to `_chunkFixed`.
+     *
+     * Any resulting group that exceeds `2 × chunkSize` characters is further
+     * sub-split with the fixed strategy.
+     *
+     * @param content      - Text to split.
+     * @param chunkSize    - Target character count per chunk.
+     * @param chunkOverlap - Overlap used when sub-splitting oversized groups.
+     * @param embedFn      - Optional batch embedding function.
+     * @returns Ordered `DocumentChunk[]`.
+     */
+    async _chunkSemantic(content, chunkSize, chunkOverlap, embedFn) {
+        // No embedding function → fall back to fixed.
+        if (!embedFn) {
+            return this._chunkFixed(content, chunkSize, chunkOverlap);
+        }
+        // Split into sentences.  We use two approaches to cover common patterns:
+        //   1. Lookbehind / lookahead regex (modern engines support this).
+        //   2. Simple split on terminal punctuation + whitespace as fallback.
+        let sentences;
+        try {
+            sentences = content.split(/(?<=[.!?])\s+(?=[A-Z])/).filter((s) => s.trim().length > 0);
+        }
+        catch {
+            // Safari / older engines may not support lookbehind — use simpler split.
+            sentences = content.split(/[.!?]\s+/).filter((s) => s.trim().length > 0);
+        }
+        // Degenerate case: no meaningful sentences.
+        if (sentences.length === 0) {
+            return this._chunkFixed(content, chunkSize, chunkOverlap);
+        }
+        // Single sentence: emit as one chunk.
+        if (sentences.length === 1) {
+            return [{ content: sentences[0].trim(), index: 0 }];
+        }
+        // Batch-embed all sentences.
+        const embeddings = await embedFn(sentences);
+        // Identify split points: positions BETWEEN sentence[i] and sentence[i+1]
+        // where similarity falls below the threshold.
+        const splitAfter = new Set();
+        for (let i = 0; i < sentences.length - 1; i++) {
+            const sim = cosineSimilarity(embeddings[i], embeddings[i + 1]);
+            if (sim < SEMANTIC_SPLIT_THRESHOLD) {
+                splitAfter.add(i);
+            }
+        }
+        // Group sentences into chunks.
+        const groups = [];
+        let currentGroup = [];
+        for (let i = 0; i < sentences.length; i++) {
+            currentGroup.push(sentences[i]);
+            if (splitAfter.has(i) || i === sentences.length - 1) {
+                groups.push(currentGroup);
+                currentGroup = [];
+            }
+        }
+        // Convert groups to DocumentChunks, sub-splitting oversized ones.
+        const maxGroupSize = chunkSize * SEMANTIC_MAX_CHUNK_MULTIPLIER;
+        const result = [];
+        let chunkIndex = 0;
+        for (const group of groups) {
+            const groupText = group.join(' ').trim();
+            if (groupText.length === 0)
+                continue;
+            if (groupText.length > maxGroupSize) {
+                // Sub-split the oversized group with fixed strategy.
+                const subChunks = fixedChunks(groupText, chunkSize, chunkOverlap, chunkIndex);
+                result.push(...subChunks);
+                chunkIndex += subChunks.length;
+            }
+            else {
+                result.push({ content: groupText, index: chunkIndex++ });
+            }
+        }
+        return result;
+    }
+    // -------------------------------------------------------------------------
+    // Strategy: hierarchical
+    // -------------------------------------------------------------------------
+    /**
+     * Recognises Markdown heading lines (`# H1`, `## H2`, …, `###### H6`) and
+     * creates a new chunk boundary at each heading.  The heading text is stored
+     * in `DocumentChunk.heading` and its level in `metadata.headingLevel`.
+     *
+     * Sections whose text exceeds `chunkSize` are sub-split with the fixed
+     * strategy while preserving the heading metadata.
+     *
+     * @param content      - Markdown-formatted text.
+     * @param chunkSize    - Maximum characters per output chunk.
+     * @param chunkOverlap - Overlap used when sub-splitting oversized sections.
+     * @returns Ordered `DocumentChunk[]`.
+     */
+    _chunkHierarchical(content, chunkSize, chunkOverlap) {
+        const headingRegex = /^(#{1,6})\s+(.+)$/gm;
+        const sections = [];
+        // Track a heading stack to capture hierarchy context.
+        const headingStack = [];
+        // Find all heading match positions and slice between them.
+        let lastMatchEnd = 0;
+        let currentHeading;
+        let currentHeadingLevel;
+        let currentAncestors = [];
+        // Collect all matches first so we can slice between them.
+        const matches = [];
+        let m;
+        while ((m = headingRegex.exec(content)) !== null) {
+            matches.push({
+                index: m.index,
+                end: m.index + m[0].length,
+                level: m[1].length,
+                text: m[2].trim(),
+            });
+        }
+        if (matches.length === 0) {
+            // No headings — treat entire content as a single section.
+            sections.push({
+                heading: undefined,
+                headingLevel: undefined,
+                ancestorHeadings: [],
+                text: content,
+            });
+        }
+        else {
+            // Text before the first heading (preamble).
+            const preamble = content.slice(0, matches[0].index).trim();
+            if (preamble.length > 0) {
+                sections.push({
+                    heading: undefined,
+                    headingLevel: undefined,
+                    ancestorHeadings: [],
+                    text: preamble,
+                });
+            }
+            for (let i = 0; i < matches.length; i++) {
+                const match = matches[i];
+                const nextIndex = i + 1 < matches.length ? matches[i + 1].index : content.length;
+                // The body of this section is the text after the heading line.
+                const body = content.slice(match.end, nextIndex).trim();
+                // Update heading stack: pop entries at the same level or deeper.
+                while (headingStack.length > 0 && headingStack[headingStack.length - 1].level >= match.level) {
+                    headingStack.pop();
+                }
+                const ancestors = headingStack.map((h) => h.text);
+                headingStack.push({ level: match.level, text: match.text });
+                sections.push({
+                    heading: match.text,
+                    headingLevel: match.level,
+                    ancestorHeadings: ancestors,
+                    text: body,
+                });
+                void lastMatchEnd; // suppress unused-variable lint
+                void currentHeading;
+                void currentHeadingLevel;
+                void currentAncestors;
+                lastMatchEnd = nextIndex;
+                currentHeading = match.text;
+                currentHeadingLevel = match.level;
+                currentAncestors = [...ancestors];
+            }
+        }
+        // Materialise sections into DocumentChunks.
+        const result = [];
+        let chunkIndex = 0;
+        for (const section of sections) {
+            const text = section.text;
+            if (text.length === 0 && section.heading === undefined)
+                continue;
+            // Build metadata common to all chunks from this section.
+            const sectionMeta = {};
+            if (section.headingLevel !== undefined) {
+                sectionMeta.headingLevel = section.headingLevel;
+            }
+            if (section.ancestorHeadings.length > 0) {
+                sectionMeta.ancestorHeadings = section.ancestorHeadings;
+            }
+            if (text.length === 0) {
+                // Heading with no body — emit an empty-content chunk.
+                result.push({
+                    content: section.heading ?? '',
+                    index: chunkIndex++,
+                    heading: section.heading,
+                    metadata: Object.keys(sectionMeta).length > 0 ? sectionMeta : undefined,
+                });
+                continue;
+            }
+            if (text.length <= chunkSize) {
+                // Fits in a single chunk.
+                result.push({
+                    content: text,
+                    index: chunkIndex++,
+                    heading: section.heading,
+                    metadata: Object.keys(sectionMeta).length > 0 ? sectionMeta : undefined,
+                });
+            }
+            else {
+                // Sub-split the section body with the fixed strategy, preserving heading
+                // metadata on every produced sub-chunk.
+                const subChunks = fixedChunks(text, chunkSize, chunkOverlap, chunkIndex, sectionMeta);
+                for (const sc of subChunks) {
+                    result.push({
+                        ...sc,
+                        heading: section.heading,
+                    });
+                    chunkIndex++;
+                }
+            }
+        }
+        return result;
+    }
+    // -------------------------------------------------------------------------
+    // Strategy: layout
+    // -------------------------------------------------------------------------
+    /**
+     * Detects fenced code blocks (``` … ```) and pipe-delimited tables and
+     * emits each as an atomic chunk (never split mid-block).  Surrounding prose
+     * is split with the fixed strategy.
+     *
+     * Chunk metadata:
+     * - Code blocks:  `{ type: 'code' }`
+     * - Tables:       `{ type: 'table' }`
+     * - Prose:        no special metadata.
+     *
+     * @param content      - Text potentially containing code blocks and tables.
+     * @param chunkSize    - Target character count for prose chunks.
+     * @param chunkOverlap - Overlap for prose fixed-splits.
+     * @returns Ordered `DocumentChunk[]`.
+     */
+    _chunkLayout(content, chunkSize, chunkOverlap) {
+        const segments = [];
+        const lines = content.split('\n');
+        let i = 0;
+        while (i < lines.length) {
+            // ── Fenced code block ────────────────────────────────────────────────
+            if (/^```/.test(lines[i])) {
+                // Flush any preceding prose first (handled after the block ends).
+                const fence = lines[i].match(/^(`{3,})/)?.[1] ?? '```';
+                const blockLines = [lines[i]];
+                i++;
+                while (i < lines.length && !lines[i].startsWith(fence)) {
+                    blockLines.push(lines[i]);
+                    i++;
+                }
+                // Include the closing fence if present.
+                if (i < lines.length) {
+                    blockLines.push(lines[i]);
+                    i++;
+                }
+                segments.push({ kind: 'code', text: blockLines.join('\n') });
+                continue;
+            }
+            // ── Table block ───────────────────────────────────────────────────────
+            // A table is a contiguous run of lines where every non-blank line
+            // contains at least one `|` pipe character.
+            if (/\|/.test(lines[i])) {
+                const tableLines = [];
+                while (i < lines.length && (lines[i].trim() === '' || /\|/.test(lines[i]))) {
+                    // Stop accumulating if we hit a blank line after table content.
+                    if (lines[i].trim() === '' && tableLines.length > 0) {
+                        break;
+                    }
+                    tableLines.push(lines[i]);
+                    i++;
+                }
+                if (tableLines.some((l) => /\|/.test(l))) {
+                    segments.push({ kind: 'table', text: tableLines.join('\n') });
+                }
+                else {
+                    // No actual pipe content — treat as prose.
+                    segments.push({ kind: 'prose', text: tableLines.join('\n') });
+                }
+                continue;
+            }
+            // ── Prose line ───────────────────────────────────────────────────────
+            // Accumulate lines until we hit a code fence or table.
+            const proseLines = [];
+            while (i < lines.length && !/^```/.test(lines[i]) && !/\|/.test(lines[i])) {
+                proseLines.push(lines[i]);
+                i++;
+            }
+            const proseText = proseLines.join('\n').trim();
+            if (proseText.length > 0) {
+                segments.push({ kind: 'prose', text: proseText });
+            }
+        }
+        // Convert segments to DocumentChunks.
+        const result = [];
+        let chunkIndex = 0;
+        for (const seg of segments) {
+            if (seg.text.trim().length === 0)
+                continue;
+            switch (seg.kind) {
+                case 'code':
+                    result.push({
+                        content: seg.text,
+                        index: chunkIndex++,
+                        metadata: { type: 'code' },
+                    });
+                    break;
+                case 'table':
+                    result.push({
+                        content: seg.text,
+                        index: chunkIndex++,
+                        metadata: { type: 'table' },
+                    });
+                    break;
+                case 'prose': {
+                    // Split prose with the fixed strategy.
+                    const proseChunks = fixedChunks(seg.text, chunkSize, chunkOverlap, chunkIndex);
+                    result.push(...proseChunks);
+                    chunkIndex += proseChunks.length;
+                    break;
+                }
+            }
+        }
+        return result;
+    }
+}
+//# sourceMappingURL=ChunkingEngine.js.map

package/dist/memory/ingestion/ChunkingEngine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ChunkingEngine.js","sourceRoot":"","sources":["../../../src/memory/ingestion/ChunkingEngine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAuDH,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E,+CAA+C;AAC/C,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAE/B,gEAAgE;AAChE,MAAM,qBAAqB,GAAG,EAAE,CAAC;AAEjC;;;;GAIG;AACH,MAAM,wBAAwB,GAAG,GAAG,CAAC;AAErC;;;;GAIG;AACH,MAAM,6BAA6B,GAAG,CAAC,CAAC;AAExC,8EAA8E;AAC9E,6BAA6B;AAC7B,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AACxD,CAAC;AAED,8EAA8E;AAC9E,gEAAgE;AAChE,8EAA8E;AAE9E;;;;;;;;;;;;GAYG;AACH,SAAS,WAAW,CAClB,OAAe,EACf,SAAiB,EACjB,YAAoB,EACpB,aAAqB,CAAC,EACtB,YAAsC;IAEtC,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,UAAU,GAAG,UAAU,CAAC;IAE5B,OAAO,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC5B,wCAAwC;QACxC,IAAI,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC;QAE1B,IAAI,GAAG,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YAC1B,+DAA+D;YAC/D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YACxC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,MAAM,CAAC,IAAI,CAAC;oBACV,OAAO,EAAE,KAAK;oBACd,KAAK,EAAE,UAAU,EAAE;oBACnB,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,GAAG,YAAY,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBAC3D,CAAC,CAAC;YACL,CAAC;YACD,MAAM;QACR,CAAC;QAED,yEAAyE;QACzE,oCAAoC;QACpC,OAAO,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC7C,GAAG,EAAE,CAAC;QACR,CAAC;QAED,iEAAiE;QACjE,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;YAChB,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC;QACxB,CAAC;QAED,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC;gBACV,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,UAAU,EAAE;gBACnB,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,GAAG,YAAY,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC3D,CAAC,CAAC;QACL,CAAC;QAED,gEAAgE;QAChE,GAAG,GAAG,GAAG,GAAG,YAAY,CAAC;QACzB,IAAI,GAAG,IAAI,CAAC;YAAE,GAAG,GAAG,GAAG,CAAC,CAAC,+CAA+C;IAC1E,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,OAAO,cAAc;IACzB,4EAA4E;IAC5E,aAAa;IACb,4EAA4E;IAE5E;;;;;;;;;OASG;IACH,KAAK,CAAC,KAAK,CAAC,OAAe,EAAE,OAAqB;QAChD,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,kBAAkB,CAAC;QAC1D,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,qBAAqB,CAAC;QAEnE,QAAQ,OAAO,CAAC,QAAQ,EAAE,CAAC;YACzB,KAAK,OAAO;gBACV,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;YAE5D,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;YAEhF,KAAK,cAAc;gBACjB,OAAO,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;YAEnE,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;YAE7D,OAAO,CAAC,CAAC,CAAC;gBACR,mCAAmC;gBACnC,MAAM,KAAK,GAAU,OAAO,CAAC,QAAQ,CAAC;gBACtC,MAAM,IAAI,KAAK,CAAC,qCAAqC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,kBAAkB;IAClB,4EAA4E;IAE5E;;;;;;;;OAQG;IACK,WAAW,CACjB,OAAe,EACf,SAAiB,EACjB,YAAoB;QAEpB,OAAO,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,4EAA4E;IAC5E,qBAAqB;IACrB,4EAA4E;IAE5E;;;;;;;;;;;;;;;OAeG;IACK,KAAK,CAAC,cAAc,CAC1B,OAAe,EACf,SAAiB,EACjB,YAAoB,EACpB,OAAkD;QAElD,8CAA8C;QAC9C,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QAC5D,CAAC;QAED,yEAAyE;QACzE,mEAAmE;QACnE,sEAAsE;QACtE,IAAI,SAAmB,CAAC;QACxB,IAAI,CAAC;YACH,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzF,CAAC;QAAC,MAAM,CAAC;YACP,yEAAyE;YACzE,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3E,CAAC;QAED,4CAA4C;QAC5C,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QAC5D,CAAC;QAED,sCAAsC;QACtC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACtD,CAAC;QAED,6BAA6B;QAC7B,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,SAAS,CAAC,CAAC;QAE5C,yEAAyE;QACzE,8CAA8C;QAC9C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,GAAG,GAAG,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/D,IAAI,GAAG,GAAG,wBAAwB,EAAE,CAAC;gBACnC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,IAAI,YAAY,GAAa,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpD,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAC1B,YAAY,GAAG,EAAE,CAAC;YACpB,CAAC;QACH,CAAC;QAED,kEAAkE;QAClE,MAAM,YAAY,GAAG,SAAS,GAAG,6BAA6B,CAAC;QAC/D,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YACzC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAErC,IAAI,SAAS,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;gBACpC,qDAAqD;gBACrD,MAAM,SAAS,GAAG,WAAW,CAAC,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;gBAC9E,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;gBAC1B,UAAU,IAAI,SAAS,CAAC,MAAM,CAAC;YACjC,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,4EAA4E;IAC5E,yBAAyB;IACzB,4EAA4E;IAE5E;;;;;;;;;;;;OAYG;IACK,kBAAkB,CACxB,OAAe,EACf,SAAiB,EACjB,YAAoB;QAEpB,MAAM,YAAY,GAAG,qBAAqB,CAAC;QAW3C,MAAM,QAAQ,GAAc,EAAE,CAAC;QAE/B,sDAAsD;QACtD,MAAM,YAAY,GAA2C,EAAE,CAAC;QAEhE,2DAA2D;QAC3D,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,cAAkC,CAAC;QACvC,IAAI,mBAAuC,CAAC;QAC5C,IAAI,gBAAgB,GAAa,EAAE,CAAC;QAEpC,0DAA0D;QAC1D,MAAM,OAAO,GAAuE,EAAE,CAAC;QACvF,IAAI,CAAyB,CAAC;QAC9B,OAAO,CAAC,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YACjD,OAAO,CAAC,IAAI,CAAC;gBACX,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,GAAG,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM;gBAC1B,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM;gBAClB,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;aAClB,CAAC,CAAC;QACL,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,0DAA0D;YAC1D,QAAQ,CAAC,IAAI,CAAC;gBACZ,OAAO,EAAE,SAAS;gBAClB,YAAY,EAAE,SAAS;gBACvB,gBAAgB,EAAE,EAAE;gBACpB,IAAI,EAAE,OAAO;aACd,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,4CAA4C;YAC5C,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;YAC3D,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,QAAQ,CAAC,IAAI,CAAC;oBACZ,OAAO,EAAE,SAAS;oBAClB,YAAY,EAAE,SAAS;oBACvB,gBAAgB,EAAE,EAAE;oBACpB,IAAI,EAAE,QAAQ;iBACf,CAAC,CAAC;YACL,CAAC;YAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;gBACjF,+DAA+D;gBAC/D,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC;gBAExD,iEAAiE;gBACjE,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;oBAC7F,YAAY,CAAC,GAAG,EAAE,CAAC;gBACrB,CAAC;gBACD,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAClD,YAAY,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;gBAE5D,QAAQ,CAAC,IAAI,CAAC;oBACZ,OAAO,EAAE,KAAK,CAAC,IAAI;oBACnB,YAAY,EAAE,KAAK,CAAC,KAAK;oBACzB,gBAAgB,EAAE,SAAS;oBAC3B,IAAI,EAAE,IAAI;iBACX,CAAC,CAAC;gBAEH,KAAK,YAAY,CAAC,CAAC,gCAAgC;gBACnD,KAAK,cAAc,CAAC;gBACpB,KAAK,mBAAmB,CAAC;gBACzB,KAAK,gBAAgB,CAAC;gBACtB,YAAY,GAAG,SAAS,CAAC;gBACzB,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC;gBAC5B,mBAAmB,GAAG,KAAK,CAAC,KAAK,CAAC;gBAClC,gBAAgB,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QAED,4CAA4C;QAC5C,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;YAC1B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS;gBAAE,SAAS;YAEjE,yDAAyD;YACzD,MAAM,WAAW,GAA4B,EAAE,CAAC;YAChD,IAAI,OAAO,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;gBACvC,WAAW,CAAC,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC;YAClD,CAAC;YACD,IAAI,OAAO,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxC,WAAW,CAAC,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,CAAC;YAC1D,CAAC;YAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,sDAAsD;gBACtD,MAAM,CAAC,IAAI,CAAC;oBACV,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,EAAE;oBAC9B,KAAK,EAAE,UAAU,EAAE;oBACnB,OAAO,EAAE,OAAO,CAAC,OAAO;oBACxB,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS;iBACxE,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS,EAAE,CAAC;gBAC7B,0BAA0B;gBAC1B,MAAM,CAAC,IAAI,CAAC;oBACV,OAAO,EAAE,IAAI;oBACb,KAAK,EAAE,UAAU,EAAE;oBACnB,OAAO,EAAE,OAAO,CAAC,OAAO;oBACxB,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS;iBACxE,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,yEAAyE;gBACzE,wCAAwC;gBACxC,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,EAAE,SAAS,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;gBACtF,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;oBAC3B,MAAM,CAAC,IAAI,CAAC;wBACV,GAAG,EAAE;wBACL,OAAO,EAAE,OAAO,CAAC,OAAO;qBACzB,CAAC,CAAC;oBACH,UAAU,EAAE,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,4EAA4E;IAC5E,mBAAmB;IACnB,4EAA4E;IAE5E;;;;;;;;;;;;;;OAcG;IACK,YAAY,CAClB,OAAe,EACf,SAAiB,EACjB,YAAoB;QAWpB,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YACxB,wEAAwE;YACxE,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1B,kEAAkE;gBAClE,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;gBACvD,MAAM,UAAU,GAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxC,CAAC,EAAE,CAAC;gBACJ,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;oBACvD,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1B,CAAC,EAAE,CAAC;gBACN,CAAC;gBACD,wCAAwC;gBACxC,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;oBACrB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1B,CAAC,EAAE,CAAC;gBACN,CAAC;gBACD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC7D,SAAS;YACX,CAAC;YAED,yEAAyE;YACzE,kEAAkE;YAClE,4CAA4C;YAC5C,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxB,MAAM,UAAU,GAAa,EAAE,CAAC;gBAChC,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC3E,gEAAgE;oBAChE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACpD,MAAM;oBACR,CAAC;oBACD,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1B,CAAC,EAAE,CAAC;gBACN,CAAC;gBACD,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACzC,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAChE,CAAC;qBAAM,CAAC;oBACN,2CAA2C;oBAC3C,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAChE,CAAC;gBACD,SAAS;YACX,CAAC;YAED,wEAAwE;YACxE,uDAAuD;YACvD,MAAM,UAAU,GAAa,EAAE,CAAC;YAChC,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1E,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,CAAC,EAAE,CAAC;YACN,CAAC;YACD,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YAC/C,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAE3C,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;gBACjB,KAAK,MAAM;oBACT,MAAM,CAAC,IAAI,CAAC;wBACV,OAAO,EAAE,GAAG,CAAC,IAAI;wBACjB,KAAK,EAAE,UAAU,EAAE;wBACnB,QAAQ,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE;qBAC3B,CAAC,CAAC;oBACH,MAAM;gBAER,KAAK,OAAO;oBACV,MAAM,CAAC,IAAI,CAAC;wBACV,OAAO,EAAE,GAAG,CAAC,IAAI;wBACjB,KAAK,EAAE,UAAU,EAAE;wBACnB,QAAQ,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE;qBAC5B,CAAC,CAAC;oBACH,MAAM;gBAER,KAAK,OAAO,CAAC,CAAC,CAAC;oBACb,uCAAuC;oBACvC,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;oBAC/E,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;oBAC5B,UAAU,IAAI,WAAW,CAAC,MAAM,CAAC;oBACjC,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}

package/dist/memory/ingestion/DoclingLoader.d.ts

@@ -0,0 +1,44 @@
+/**
+ * @fileoverview DoclingLoader — high-fidelity PDF/DOCX extraction via Python Docling.
+ *
+ * Docling (https://github.com/DS4SD/docling) is an IBM Research open-source
+ * library that converts PDFs and office documents to structured JSON, preserving
+ * tables, figures, and layout information far beyond what pure-JS text extraction
+ * can achieve.
+ *
+ * This module provides a factory function {@link createDoclingLoader} that:
+ * 1. Checks whether `python3 -m docling --version` succeeds in the current PATH.
+ * 2. If it does, returns a {@link DoclingLoader} instance that spawns a
+ *    `python3 -m docling` subprocess for each document.
+ * 3. If Docling is not installed, returns `null` gracefully.
+ *
+ * ### Opting in
+ * ```sh
+ * pip install docling
+ * ```
+ *
+ * @module memory/ingestion/DoclingLoader
+ */
+import type { IDocumentLoader } from './IDocumentLoader.js';
+/**
+ * Checks whether `python3 -m docling` is available in the current environment
+ * and, if so, returns a new {@link DoclingLoader} instance; otherwise returns
+ * `null`.
+ *
+ * The availability check runs `python3 -m docling --version` synchronously
+ * via `spawnSync` — it exits quickly and is only called once during registry
+ * initialisation.
+ *
+ * ### Usage
+ * ```ts
+ * import { createDoclingLoader } from './DoclingLoader.js';
+ * import { PdfLoader } from './PdfLoader.js';
+ *
+ * const doclingLoader = createDoclingLoader();
+ * const loader = new PdfLoader(null, doclingLoader);
+ * ```
+ *
+ * @returns A `DoclingLoader` instance when Docling is installed, or `null`.
+ */
+export declare function createDoclingLoader(): IDocumentLoader | null;
+//# sourceMappingURL=DoclingLoader.d.ts.map

package/dist/memory/ingestion/DoclingLoader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"DoclingLoader.d.ts","sourceRoot":"","sources":["../../../src/memory/ingestion/DoclingLoader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAMH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAgO5D;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,mBAAmB,IAAI,eAAe,GAAG,IAAI,CAgB5D"}