@rubytech/create-realagent 1.0.406

package/payload/platform/plugins/memory/mcp/dist/lib/semantic-chunker.js

@@ -0,0 +1,266 @@
+// ---------------------------------------------------------------------------
+// Semantic document chunking — embedding-based topic boundary detection
+//
+// TEXT ──▶ PARAGRAPHS ──▶ BLOCKS ──▶ EMBED ──▶ SIMILARITY ──▶ VALLEYS ──▶ SECTIONS
+//
+// Replaces heading-regex chunking. Works identically on plain text, PDF
+// output, and markdown. Headings are tiebreakers, not drivers.
+// ---------------------------------------------------------------------------
+const MIN_BLOCK_SIZE = 300;
+const PREVIEW_LENGTH = 150;
+const MIN_CHUNK_SIZE = 200;
+const MAX_CHUNK_SIZE = 2000;
+const MAX_SECTIONS = 25;
+const BYTES_PER_SECTION = 4000;
+const HEADING_SNAP_WINDOW = 2;
+const HEADING_RE = /^(#{1,6})\s+(.+)$/m;
+const SENTENCE_RE = /(?<=[.!?])\s+(?=[A-Z])/;
+export function splitIntoParagraphs(text) {
+    const paragraphs = text.split(/\n{2,}/).map((p) => p.trim()).filter(Boolean);
+    if (paragraphs.length > 1)
+        return paragraphs;
+    const sentences = text.split(SENTENCE_RE).map((s) => s.trim()).filter(Boolean);
+    if (sentences.length > 1)
+        return sentences;
+    return paragraphs.length > 0 ? paragraphs : [text.trim()];
+}
+export function aggregateBlocks(paragraphs, minBytes = MIN_BLOCK_SIZE) {
+    const blocks = [];
+    let currentParagraphs = [];
+    let currentText = "";
+    function flush() {
+        if (!currentText)
+            return;
+        const headingMatch = currentText.match(HEADING_RE);
+        blocks.push({
+            text: currentText,
+            paragraphs: [...currentParagraphs],
+            headingLine: headingMatch ? headingMatch[0] : null,
+        });
+        currentParagraphs = [];
+        currentText = "";
+    }
+    for (const para of paragraphs) {
+        if (currentText && currentText.length >= minBytes) {
+            flush();
+        }
+        currentParagraphs.push(para);
+        currentText = currentText ? currentText + "\n\n" + para : para;
+    }
+    flush();
+    return blocks;
+}
+export function cosine(a, b) {
+    if (a.length !== b.length) {
+        throw new Error(`Vector length mismatch: ${a.length} vs ${b.length}`);
+    }
+    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];
+    }
+    const denom = Math.sqrt(magA) * Math.sqrt(magB);
+    if (denom === 0)
+        return 0;
+    return dot / denom;
+}
+/**
+ * Compute cosine similarity between each consecutive pair of embeddings.
+ * Returns array of length (embeddings.length - 1).
+ */
+export function similarityCurve(embeddings) {
+    const curve = [];
+    for (let i = 0; i < embeddings.length - 1; i++) {
+        curve.push(cosine(embeddings[i], embeddings[i + 1]));
+    }
+    return curve;
+}
+/**
+ * Compute valley depth at each position in the similarity curve.
+ *
+ * depth(i) = (left_peak - curve[i]) + (right_peak - curve[i])
+ * where left_peak and right_peak are the nearest local maxima on each side.
+ *
+ * Deep valleys indicate strong topic transitions.
+ */
+export function valleyDepths(curve) {
+    const depths = new Array(curve.length).fill(0);
+    for (let i = 0; i < curve.length; i++) {
+        let leftPeak = curve[i];
+        for (let j = i - 1; j >= 0; j--) {
+            if (curve[j] > leftPeak)
+                leftPeak = curve[j];
+            else
+                break;
+        }
+        let rightPeak = curve[i];
+        for (let j = i + 1; j < curve.length; j++) {
+            if (curve[j] > rightPeak)
+                rightPeak = curve[j];
+            else
+                break;
+        }
+        depths[i] = (leftPeak - curve[i]) + (rightPeak - curve[i]);
+    }
+    return depths;
+}
+/**
+ * Select the top N deepest valleys, sorted by position.
+ * Skips positions with zero depth (no valley).
+ */
+export function selectBoundaries(depths, n) {
+    const indexed = depths
+        .map((d, i) => ({ depth: d, index: i }))
+        .filter((v) => v.depth > 0);
+    indexed.sort((a, b) => b.depth - a.depth);
+    const selected = indexed.slice(0, n).map((v) => v.index);
+    selected.sort((a, b) => a - b);
+    return selected;
+}
+/**
+ * Snap valley-based boundaries to nearby markdown headings.
+ * Boundary values represent the first block index of the new section.
+ */
+export function snapToHeadings(boundaries, blocks, window = HEADING_SNAP_WINDOW) {
+    return boundaries.map((pos) => {
+        const sectionStart = pos + 1;
+        let bestDist = Infinity;
+        let bestIdx = sectionStart;
+        for (let offset = -window; offset <= window; offset++) {
+            const idx = sectionStart + offset;
+            if (idx < 1 || idx >= blocks.length)
+                continue;
+            if (blocks[idx].headingLine && Math.abs(offset) < bestDist) {
+                bestDist = Math.abs(offset);
+                bestIdx = idx;
+            }
+        }
+        return bestIdx;
+    });
+}
+/**
+ * Semantic document chunking using embedding-based topic boundary detection.
+ *
+ * Replaces heading-regex chunking. Works on plain text, PDF output, and
+ * markdown. Headings are used as tiebreakers for boundary placement, not
+ * as the primary segmentation signal.
+ *
+ * @param text - Document text to chunk
+ * @param embedFn - Batch embedding function (injected for testability)
+ * @returns ChunkedSection[] — same shape as the previous heading-regex chunker
+ */
+export async function chunkText(text, embedFn) {
+    const trimmed = text.trim();
+    const t0 = Date.now();
+    const log = (stage, detail) => console.error(`[semantic-chunker] ${stage}${detail ? ` — ${detail}` : ""} (${Date.now() - t0}ms)`);
+    log("start", `${trimmed.length} chars`);
+    // Short-circuit: very short documents don't need embedding
+    if (trimmed.length < MIN_BLOCK_SIZE) {
+        log("short-circuit", "below MIN_BLOCK_SIZE");
+        return [{
+                title: deriveTitle(trimmed),
+                chunks: [{
+                        id: 0,
+                        preview: trimmed.slice(0, PREVIEW_LENGTH),
+                        content: trimmed,
+                    }],
+            }];
+    }
+    // 1. Split into paragraphs and aggregate into blocks
+    const paragraphs = splitIntoParagraphs(trimmed);
+    const blocks = aggregateBlocks(paragraphs);
+    log("blocks", `${paragraphs.length} paragraphs → ${blocks.length} blocks`);
+    // Short-circuit: too few blocks for boundary detection
+    if (blocks.length <= 2) {
+        log("short-circuit", "≤2 blocks, skipping embedding");
+        return buildSections(blocks, []);
+    }
+    // 2. Batch embed all blocks
+    log("embedding", `${blocks.length} blocks via Ollama`);
+    const embeddings = await embedFn(blocks.map((b) => b.text));
+    log("embedded", `${embeddings.length} vectors (dim=${embeddings[0]?.length ?? 0})`);
+    // 3. Compute similarity curve and valley depths
+    const curve = similarityCurve(embeddings);
+    const depths = valleyDepths(curve);
+    // 4. Select top N boundaries (adaptive with ceiling)
+    const targetN = Math.min(Math.ceil(trimmed.length / BYTES_PER_SECTION), MAX_SECTIONS, curve.length);
+    const rawBoundaries = selectBoundaries(depths, targetN);
+    // 5. Snap to nearby headings
+    const snappedBoundaries = snapToHeadings(rawBoundaries, blocks);
+    // Deduplicate (snapping can cause two boundaries to land on the same block)
+    const uniqueBoundaries = [...new Set(snappedBoundaries)].sort((a, b) => a - b);
+    log("boundaries", `${uniqueBoundaries.length} section breaks from ${rawBoundaries.length} candidates`);
+    // 6. Build sections with chunks
+    const sections = buildSections(blocks, uniqueBoundaries);
+    const totalChunks = sections.reduce((n, s) => n + s.chunks.length, 0);
+    log("done", `${sections.length} sections, ${totalChunks} chunks`);
+    return sections;
+}
+function deriveTitle(text) {
+    const headingMatch = text.match(HEADING_RE);
+    if (headingMatch)
+        return headingMatch[2].trim().slice(0, 80);
+    const sentenceEnd = text.search(/[.!?]\s/);
+    return sentenceEnd > 0 && sentenceEnd < 80
+        ? text.slice(0, sentenceEnd + 1)
+        : text.slice(0, 80);
+}
+/**
+ * Build ChunkedSection[] from blocks and section boundary positions.
+ * Each boundary is a block index where a new section starts.
+ * Within each section, paragraphs are grouped into chunks respecting
+ * MIN_CHUNK_SIZE (200) and MAX_CHUNK_SIZE (2000) byte constraints.
+ */
+export function buildSections(blocks, boundaries) {
+    const sections = [];
+    let chunkId = 0;
+    const starts = [0, ...boundaries];
+    const ends = [...boundaries, blocks.length];
+    for (let s = 0; s < starts.length; s++) {
+        const sectionBlocks = blocks.slice(starts[s], ends[s]);
+        if (sectionBlocks.length === 0)
+            continue;
+        const headingBlock = sectionBlocks.find((b) => b.headingLine);
+        const title = headingBlock
+            ? headingBlock.headingLine.replace(/^#+\s+/, "")
+            : deriveTitle(sectionBlocks[0].paragraphs[0] || sectionBlocks[0].text);
+        const allParagraphs = sectionBlocks.flatMap((b) => b.paragraphs);
+        const chunks = [];
+        let buffer = "";
+        for (const para of allParagraphs) {
+            if (buffer && buffer.length + para.length + 2 > MAX_CHUNK_SIZE) {
+                chunks.push({
+                    id: chunkId++,
+                    preview: buffer.slice(0, PREVIEW_LENGTH),
+                    content: buffer,
+                });
+                buffer = para;
+            }
+            else {
+                buffer = buffer ? buffer + "\n\n" + para : para;
+            }
+        }
+        if (buffer) {
+            if (buffer.length < MIN_CHUNK_SIZE && chunks.length > 0) {
+                const prev = chunks[chunks.length - 1];
+                prev.content = prev.content + "\n\n" + buffer;
+                prev.preview = prev.content.slice(0, PREVIEW_LENGTH);
+            }
+            else {
+                chunks.push({
+                    id: chunkId++,
+                    preview: buffer.slice(0, PREVIEW_LENGTH),
+                    content: buffer,
+                });
+            }
+        }
+        if (chunks.length > 0) {
+            sections.push({ title, chunks });
+        }
+    }
+    return sections;
+}
+//# sourceMappingURL=semantic-chunker.js.map

package/payload/platform/plugins/memory/mcp/dist/lib/semantic-chunker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-chunker.js","sourceRoot":"","sources":["../../src/lib/semantic-chunker.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,wEAAwE;AACxE,EAAE;AACF,mFAAmF;AACnF,EAAE;AACF,wEAAwE;AACxE,+DAA+D;AAC/D,8EAA8E;AAE9E,MAAM,cAAc,GAAG,GAAG,CAAC;AAC3B,MAAM,cAAc,GAAG,GAAG,CAAC;AAC3B,MAAM,cAAc,GAAG,GAAG,CAAC;AAC3B,MAAM,cAAc,GAAG,IAAI,CAAC;AAC5B,MAAM,YAAY,GAAG,EAAE,CAAC;AACxB,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAC/B,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAC9B,MAAM,UAAU,GAAG,oBAAoB,CAAC;AACxC,MAAM,WAAW,GAAG,wBAAwB,CAAC;AAmB7C,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC7E,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,UAAU,CAAC;IAE7C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC/E,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAE3C,OAAO,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;AAC5D,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,UAAoB,EAAE,QAAQ,GAAG,cAAc;IAC7E,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,IAAI,iBAAiB,GAAa,EAAE,CAAC;IACrC,IAAI,WAAW,GAAG,EAAE,CAAC;IAErB,SAAS,KAAK;QACZ,IAAI,CAAC,WAAW;YAAE,OAAO;QACzB,MAAM,YAAY,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACnD,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,WAAW;YACjB,UAAU,EAAE,CAAC,GAAG,iBAAiB,CAAC;YAClC,WAAW,EAAE,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;SACnD,CAAC,CAAC;QACH,iBAAiB,GAAG,EAAE,CAAC;QACvB,WAAW,GAAG,EAAE,CAAC;IACnB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,WAAW,IAAI,WAAW,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;YAClD,KAAK,EAAE,CAAC;QACV,CAAC;QACD,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,WAAW,GAAG,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACjE,CAAC;IACD,KAAK,EAAE,CAAC;IAER,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,MAAM,CAAC,CAAW,EAAE,CAAW;IAC7C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,OAAO,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACxE,CAAC;IACD,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,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChD,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,OAAO,GAAG,GAAG,KAAK,CAAC;AACrB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,UAAsB;IACpD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,KAAe;IAC1C,MAAM,MAAM,GAAa,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ;gBAAE,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;;gBACxC,MAAM;QACb,CAAC;QAED,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS;gBAAE,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;;gBAC1C,MAAM;QACb,CAAC;QAED,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAgB,EAAE,CAAS;IAC1D,MAAM,OAAO,GAAG,MAAM;SACnB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;SACvC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAE9B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACzD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE/B,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC5B,UAAoB,EACpB,MAAmB,EACnB,MAAM,GAAG,mBAAmB;IAE5B,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC5B,MAAM,YAAY,GAAG,GAAG,GAAG,CAAC,CAAC;QAC7B,IAAI,QAAQ,GAAG,QAAQ,CAAC;QACxB,IAAI,OAAO,GAAG,YAAY,CAAC;QAE3B,KAAK,IAAI,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;YACtD,MAAM,GAAG,GAAG,YAAY,GAAG,MAAM,CAAC;YAClC,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC,MAAM;gBAAE,SAAS;YAC9C,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,QAAQ,EAAE,CAAC;gBAC3D,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC5B,OAAO,GAAG,GAAG,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,IAAY,EAAE,OAAgB;IAC5D,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACtB,MAAM,GAAG,GAAG,CAAC,KAAa,EAAE,MAAe,EAAE,EAAE,CAC7C,OAAO,CAAC,KAAK,CAAC,sBAAsB,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IAErG,GAAG,CAAC,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,QAAQ,CAAC,CAAC;IAExC,2DAA2D;IAC3D,IAAI,OAAO,CAAC,MAAM,GAAG,cAAc,EAAE,CAAC;QACpC,GAAG,CAAC,eAAe,EAAE,sBAAsB,CAAC,CAAC;QAC7C,OAAO,CAAC;gBACN,KAAK,EAAE,WAAW,CAAC,OAAO,CAAC;gBAC3B,MAAM,EAAE,CAAC;wBACP,EAAE,EAAE,CAAC;wBACL,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC;wBACzC,OAAO,EAAE,OAAO;qBACjB,CAAC;aACH,CAAC,CAAC;IACL,CAAC;IAED,qDAAqD;IACrD,MAAM,UAAU,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IAChD,MAAM,MAAM,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;IAC3C,GAAG,CAAC,QAAQ,EAAE,GAAG,UAAU,CAAC,MAAM,iBAAiB,MAAM,CAAC,MAAM,SAAS,CAAC,CAAC;IAE3E,uDAAuD;IACvD,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACvB,GAAG,CAAC,eAAe,EAAE,+BAA+B,CAAC,CAAC;QACtD,OAAO,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,4BAA4B;IAC5B,GAAG,CAAC,WAAW,EAAE,GAAG,MAAM,CAAC,MAAM,oBAAoB,CAAC,CAAC;IACvD,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5D,GAAG,CAAC,UAAU,EAAE,GAAG,UAAU,CAAC,MAAM,iBAAiB,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC;IAEpF,gDAAgD;IAChD,MAAM,KAAK,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;IAC1C,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IAEnC,qDAAqD;IACrD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CACtB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,iBAAiB,CAAC,EAC7C,YAAY,EACZ,KAAK,CAAC,MAAM,CACb,CAAC;IACF,MAAM,aAAa,GAAG,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAExD,6BAA6B;IAC7B,MAAM,iBAAiB,GAAG,cAAc,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;IAEhE,4EAA4E;IAC5E,MAAM,gBAAgB,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE/E,GAAG,CAAC,YAAY,EAAE,GAAG,gBAAgB,CAAC,MAAM,wBAAwB,aAAa,CAAC,MAAM,aAAa,CAAC,CAAC;IAEvG,gCAAgC;IAChC,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACzD,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACtE,GAAG,CAAC,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,cAAc,WAAW,SAAS,CAAC,CAAC;IAElE,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,WAAW,CAAC,IAAY;IAC/B,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAC5C,IAAI,YAAY;QAAE,OAAO,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC7D,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC3C,OAAO,WAAW,GAAG,CAAC,IAAI,WAAW,GAAG,EAAE;QACxC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,CAAC;QAChC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACxB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,MAAmB,EAAE,UAAoB;IACrE,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,CAAC,GAAG,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IAE5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,aAAa,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEzC,MAAM,YAAY,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QAC9D,MAAM,KAAK,GAAG,YAAY;YACxB,CAAC,CAAC,YAAY,CAAC,WAAY,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC;YACjD,CAAC,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAEzE,MAAM,aAAa,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QAEjE,MAAM,MAAM,GAA6B,EAAE,CAAC;QAC5C,IAAI,MAAM,GAAG,EAAE,CAAC;QAEhB,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,cAAc,EAAE,CAAC;gBAC/D,MAAM,CAAC,IAAI,CAAC;oBACV,EAAE,EAAE,OAAO,EAAE;oBACb,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC;oBACxC,OAAO,EAAE,MAAM;iBAChB,CAAC,CAAC;gBACH,MAAM,GAAG,IAAI,CAAC;YAChB,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;YAClD,CAAC;QACH,CAAC;QACD,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,MAAM,CAAC,MAAM,GAAG,cAAc,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBACvC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC;gBAC9C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;YACvD,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC;oBACV,EAAE,EAAE,OAAO,EAAE;oBACb,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC;oBACxC,OAAO,EAAE,MAAM;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/lib/semantic-chunker.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=semantic-chunker.test.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/lib/semantic-chunker.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-chunker.test.d.ts","sourceRoot":"","sources":["../../src/lib/semantic-chunker.test.ts"],"names":[],"mappings":""}

package/payload/platform/plugins/memory/mcp/dist/lib/semantic-chunker.test.js

@@ -0,0 +1,233 @@
+import { describe, it } from "node:test";
+import assert from "node:assert/strict";
+import { splitIntoParagraphs, aggregateBlocks, cosine, similarityCurve, valleyDepths, selectBoundaries, snapToHeadings, buildSections, chunkText } from "./semantic-chunker.js";
+describe("splitIntoParagraphs", () => {
+    it("splits on double newlines", () => {
+        const text = "First paragraph.\n\nSecond paragraph.\n\nThird.";
+        const result = splitIntoParagraphs(text);
+        assert.deepStrictEqual(result, [
+            "First paragraph.",
+            "Second paragraph.",
+            "Third.",
+        ]);
+    });
+    it("falls back to sentence splitting for wall of text", () => {
+        const wall = "First sentence. Second sentence. Third sentence here.";
+        const result = splitIntoParagraphs(wall);
+        assert.ok(result.length >= 2, `Expected >=2 paragraphs, got ${result.length}`);
+    });
+    it("filters empty paragraphs", () => {
+        const text = "A.\n\n\n\nB.\n\n\n\nC.";
+        const result = splitIntoParagraphs(text);
+        assert.deepStrictEqual(result, ["A.", "B.", "C."]);
+    });
+});
+describe("aggregateBlocks", () => {
+    it("merges short paragraphs until minimum size", () => {
+        const paragraphs = ["Hi.", "Hello.", "Short.", "This is a much longer paragraph that should definitely exceed the minimum block size on its own without needing any merging at all because it has enough content."];
+        const blocks = aggregateBlocks(paragraphs, 100);
+        assert.ok(blocks.length >= 1);
+        assert.ok(blocks.length <= paragraphs.length);
+        for (const b of blocks) {
+            if (b !== blocks[blocks.length - 1]) {
+                assert.ok(b.text.length >= 100, `Block too small: ${b.text.length} bytes`);
+            }
+        }
+    });
+    it("preserves paragraph list in each block", () => {
+        const paragraphs = ["Short A.", "Short B.", "Long paragraph that exceeds minimum size on its own easily."];
+        const blocks = aggregateBlocks(paragraphs, 50);
+        const allParagraphs = blocks.flatMap((b) => b.paragraphs);
+        assert.deepStrictEqual(allParagraphs, paragraphs);
+    });
+    it("detects headings in blocks", () => {
+        const paragraphs = ["## Section Title\n\nSome content here.", "More content."];
+        const blocks = aggregateBlocks(paragraphs, 10);
+        const headingBlock = blocks.find((b) => b.headingLine !== null);
+        assert.ok(headingBlock, "Expected a block with a heading");
+        assert.strictEqual(headingBlock.headingLine, "## Section Title");
+    });
+});
+describe("cosine", () => {
+    it("returns 1.0 for identical vectors", () => {
+        const v = [1, 2, 3];
+        assert.ok(Math.abs(cosine(v, v) - 1.0) < 0.001);
+    });
+    it("returns 0.0 for orthogonal vectors", () => {
+        const a = [1, 0, 0];
+        const b = [0, 1, 0];
+        assert.ok(Math.abs(cosine(a, b)) < 0.001);
+    });
+    it("returns -1.0 for opposite vectors", () => {
+        const a = [1, 0];
+        const b = [-1, 0];
+        assert.ok(Math.abs(cosine(a, b) - (-1.0)) < 0.001);
+    });
+});
+describe("similarityCurve", () => {
+    it("computes cosine between consecutive embeddings", () => {
+        const embeddings = [[1, 0], [1, 0], [1, 0]];
+        const curve = similarityCurve(embeddings);
+        assert.strictEqual(curve.length, 2);
+        assert.ok(Math.abs(curve[0] - 1.0) < 0.001);
+        assert.ok(Math.abs(curve[1] - 1.0) < 0.001);
+    });
+    it("detects low similarity between different vectors", () => {
+        const embeddings = [[1, 0], [0, 1], [1, 0]];
+        const curve = similarityCurve(embeddings);
+        assert.strictEqual(curve.length, 2);
+        assert.ok(curve[0] < 0.1);
+        assert.ok(curve[1] < 0.1);
+    });
+});
+describe("valleyDepths", () => {
+    it("finds deep valley between peaks", () => {
+        const curve = [0.9, 0.8, 0.2, 0.85, 0.9];
+        const depths = valleyDepths(curve);
+        assert.strictEqual(depths.length, curve.length);
+        const maxIdx = depths.indexOf(Math.max(...depths));
+        assert.strictEqual(maxIdx, 2);
+    });
+    it("returns zeros for flat curve", () => {
+        const curve = [0.8, 0.8, 0.8, 0.8];
+        const depths = valleyDepths(curve);
+        for (const d of depths) {
+            assert.ok(Math.abs(d) < 0.001);
+        }
+    });
+});
+describe("selectBoundaries", () => {
+    it("selects top N deepest valleys sorted by position", () => {
+        const depths = [0, 0.5, 0.1, 0.8, 0];
+        const boundaries = selectBoundaries(depths, 2);
+        assert.deepStrictEqual(boundaries, [1, 3]);
+    });
+    it("never selects more than available positions", () => {
+        const depths = [0.5, 0.3];
+        const boundaries = selectBoundaries(depths, 10);
+        assert.ok(boundaries.length <= 2);
+    });
+    it("skips zero-depth positions", () => {
+        const depths = [0, 0, 0];
+        const boundaries = selectBoundaries(depths, 5);
+        assert.strictEqual(boundaries.length, 0);
+    });
+});
+describe("snapToHeadings", () => {
+    it("snaps boundary to nearby heading", () => {
+        const blocks = [
+            { text: "Intro text", paragraphs: ["Intro text"], headingLine: null },
+            { text: "More intro", paragraphs: ["More intro"], headingLine: null },
+            { text: "## New Topic\nContent", paragraphs: ["## New Topic\nContent"], headingLine: "## New Topic" },
+            { text: "Topic content", paragraphs: ["Topic content"], headingLine: null },
+        ];
+        const snapped = snapToHeadings([1], blocks, 2);
+        assert.deepStrictEqual(snapped, [2]);
+    });
+    it("converts curve index to block index when no heading nearby", () => {
+        const blocks = [
+            { text: "A", paragraphs: ["A"], headingLine: null },
+            { text: "B", paragraphs: ["B"], headingLine: null },
+            { text: "C", paragraphs: ["C"], headingLine: null },
+        ];
+        // Curve index 1 = gap between block 1 and 2 → new section starts at block 2
+        const snapped = snapToHeadings([1], blocks, 2);
+        assert.deepStrictEqual(snapped, [2]);
+    });
+});
+describe("buildSections", () => {
+    it("creates sections from blocks and boundaries", () => {
+        const blocks = [
+            { text: "First para. Second sentence here.", paragraphs: ["First para. Second sentence here."], headingLine: null },
+            { text: "## Topic B\nContent of B.", paragraphs: ["## Topic B\nContent of B."], headingLine: "## Topic B" },
+            { text: "More B content here.", paragraphs: ["More B content here."], headingLine: null },
+        ];
+        const sections = buildSections(blocks, [1]);
+        assert.strictEqual(sections.length, 2);
+        assert.strictEqual(sections[0].title, "First para.");
+        assert.strictEqual(sections[1].title, "Topic B");
+        assert.ok(sections[0].chunks.length >= 1);
+        assert.ok(sections[1].chunks.length >= 1);
+    });
+    it("assigns sequential chunk IDs across sections", () => {
+        const blocks = [
+            { text: "A content.", paragraphs: ["A content."], headingLine: null },
+            { text: "B content.", paragraphs: ["B content."], headingLine: null },
+        ];
+        const sections = buildSections(blocks, [1]);
+        const allIds = sections.flatMap((s) => s.chunks.map((c) => c.id));
+        const expected = allIds.map((_, i) => i);
+        assert.deepStrictEqual(allIds, expected);
+    });
+});
+// Mock embedder: deterministic vectors from text hash
+function mockEmbed(texts) {
+    return Promise.resolve(texts.map((t) => {
+        let hash = 0;
+        for (let i = 0; i < t.length; i++)
+            hash = ((hash << 5) - hash + t.charCodeAt(i)) | 0;
+        return [
+            Math.sin(hash),
+            Math.cos(hash),
+            Math.sin(hash * 2),
+            Math.cos(hash * 3),
+        ];
+    }));
+}
+describe("chunkText", () => {
+    it("returns single section for very short text", async () => {
+        const sections = await chunkText("Short text.", mockEmbed);
+        assert.strictEqual(sections.length, 1);
+        assert.strictEqual(sections[0].chunks.length, 1);
+    });
+    it("produces multiple sections for multi-topic document", async () => {
+        const topic1 = Array(10).fill("The financial quarterly earnings report shows strong revenue growth in the technology sector with cloud computing services leading the expansion.").join("\n\n");
+        const topic2 = Array(10).fill("The recipe for chocolate cake requires flour sugar eggs butter cocoa powder baking soda vanilla extract and a pinch of salt mixed together carefully.").join("\n\n");
+        const text = topic1 + "\n\n" + topic2;
+        const sections = await chunkText(text, mockEmbed);
+        assert.ok(sections.length >= 2, `Expected >=2 sections, got ${sections.length}`);
+    });
+    it("respects MAX_SECTIONS ceiling", async () => {
+        const bigText = Array(200).fill("Paragraph content that is different each time number " + Math.random() + " to ensure variety.").join("\n\n");
+        const sections = await chunkText(bigText, mockEmbed);
+        assert.ok(sections.length <= 25, `Expected <=25 sections, got ${sections.length}`);
+    });
+    it("handles markdown with headings as tiebreakers", async () => {
+        const text = [
+            "# Introduction",
+            "Welcome to the document. This covers many topics in great detail.",
+            "",
+            "Some introductory material about the background and context of this work.",
+            "",
+            "# Methods",
+            "We used a comprehensive approach to analyze the data collected from various sources.",
+            "",
+            "Statistical methods included regression analysis and hypothesis testing.",
+        ].join("\n");
+        const sections = await chunkText(text, mockEmbed);
+        assert.ok(sections.length >= 1);
+        const titles = sections.map((s) => s.title);
+        const hasIntro = titles.some((t) => t.includes("Introduction"));
+        const hasMethods = titles.some((t) => t.includes("Methods"));
+        assert.ok(hasIntro || hasMethods, `Expected heading-derived titles, got: ${titles.join(", ")}`);
+    });
+    it("all chunks have sequential IDs starting from 0", async () => {
+        const text = Array(20).fill("Some paragraph content that is moderately long to ensure multiple blocks.").join("\n\n");
+        const sections = await chunkText(text, mockEmbed);
+        const allIds = sections.flatMap((s) => s.chunks.map((c) => c.id));
+        for (let i = 0; i < allIds.length; i++) {
+            assert.strictEqual(allIds[i], i, `Expected chunk ID ${i}, got ${allIds[i]}`);
+        }
+    });
+    it("every chunk has a preview", async () => {
+        const text = Array(15).fill("Content paragraph with enough text to be meaningful and create blocks.").join("\n\n");
+        const sections = await chunkText(text, mockEmbed);
+        for (const section of sections) {
+            for (const chunk of section.chunks) {
+                assert.ok(chunk.preview.length > 0, "Chunk preview must not be empty");
+                assert.ok(chunk.preview.length <= 150, "Chunk preview must not exceed 150 chars");
+            }
+        }
+    });
+});
+//# sourceMappingURL=semantic-chunker.test.js.map

package/payload/platform/plugins/memory/mcp/dist/lib/semantic-chunker.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-chunker.test.js","sourceRoot":"","sources":["../../src/lib/semantic-chunker.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,WAAW,CAAC;AACzC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AACxC,OAAO,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,EAAE,eAAe,EAAE,YAAY,EAAE,gBAAgB,EAAE,cAAc,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAGhL,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,IAAI,GAAG,iDAAiD,CAAC;QAC/D,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE;YAC7B,kBAAkB;YAClB,mBAAmB;YACnB,QAAQ;SACT,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,IAAI,GAAG,uDAAuD,CAAC;QACrE,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,gCAAgC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IACjF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,IAAI,GAAG,wBAAwB,CAAC;QACtC,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,mKAAmK,CAAC,CAAC;QACpN,MAAM,MAAM,GAAG,eAAe,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;QAChD,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;gBACpC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,GAAG,EAAE,oBAAoB,CAAC,CAAC,IAAI,CAAC,MAAM,QAAQ,CAAC,CAAC;YAC7E,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,UAAU,GAAG,CAAC,UAAU,EAAE,UAAU,EAAE,6DAA6D,CAAC,CAAC;QAC3G,MAAM,MAAM,GAAG,eAAe,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QAC/C,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QAC1D,MAAM,CAAC,eAAe,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,UAAU,GAAG,CAAC,wCAAwC,EAAE,eAAe,CAAC,CAAC;QAC/E,MAAM,MAAM,GAAG,eAAe,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QAC/C,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,CAAC;QAChE,MAAM,CAAC,EAAE,CAAC,YAAY,EAAE,iCAAiC,CAAC,CAAC;QAC3D,MAAM,CAAC,WAAW,CAAC,YAAa,CAAC,WAAW,EAAE,kBAAkB,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;IACtB,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;QAC1C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QAC5C,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;QAC1C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC1B,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QACjC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACrC,MAAM,UAAU,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,eAAe,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC1B,MAAM,UAAU,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAChD,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,UAAU,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,MAAM,GAAgB;YAC1B,EAAE,IAAI,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,YAAY,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE;YACrE,EAAE,IAAI,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,YAAY,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE;YACrE,EAAE,IAAI,EAAE,uBAAuB,EAAE,UAAU,EAAE,CAAC,uBAAuB,CAAC,EAAE,WAAW,EAAE,cAAc,EAAE;YACrG,EAAE,IAAI,EAAE,eAAe,EAAE,UAAU,EAAE,CAAC,eAAe,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE;SAC5E,CAAC;QACF,MAAM,OAAO,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,MAAM,GAAgB;YAC1B,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE;YACnD,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE;YACnD,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE;SACpD,CAAC;QACF,4EAA4E;QAC5E,MAAM,OAAO,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,MAAM,GAAgB;YAC1B,EAAE,IAAI,EAAE,mCAAmC,EAAE,UAAU,EAAE,CAAC,mCAAmC,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE;YACnH,EAAE,IAAI,EAAE,2BAA2B,EAAE,UAAU,EAAE,CAAC,2BAA2B,CAAC,EAAE,WAAW,EAAE,YAAY,EAAE;YAC3G,EAAE,IAAI,EAAE,sBAAsB,EAAE,UAAU,EAAE,CAAC,sBAAsB,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE;SAC1F,CAAC;QACF,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QACrD,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACjD,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,MAAM,GAAgB;YAC1B,EAAE,IAAI,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,YAAY,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE;YACrE,EAAE,IAAI,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,YAAY,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE;SACtE,CAAC;QACF,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,sDAAsD;AACtD,SAAS,SAAS,CAAC,KAAe;IAChC,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACrC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACrF,OAAO;YACL,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YACd,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YACd,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;YAClB,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;SACnB,CAAC;IACJ,CAAC,CAAC,CAAC,CAAC;AACN,CAAC;AAED,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;IACzB,EAAE,CAAC,4CAA4C,EAAE,KAAK,IAAI,EAAE;QAC1D,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;QAC3D,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACnE,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,mJAAmJ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChM,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,uJAAuJ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpM,MAAM,IAAI,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;QACtC,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAClD,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,8BAA8B,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IACnF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,KAAK,IAAI,EAAE;QAC7C,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,uDAAuD,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,qBAAqB,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9I,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACrD,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,IAAI,EAAE,EAAE,+BAA+B,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IACrF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+CAA+C,EAAE,KAAK,IAAI,EAAE;QAC7D,MAAM,IAAI,GAAG;YACX,gBAAgB;YAChB,mEAAmE;YACnE,EAAE;YACF,2EAA2E;YAC3E,EAAE;YACF,WAAW;YACX,sFAAsF;YACtF,EAAE;YACF,0EAA0E;SAC3E,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACb,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAClD,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC;QAChE,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;QAC7D,MAAM,CAAC,EAAE,CAAC,QAAQ,IAAI,UAAU,EAAE,yCAAyC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,KAAK,IAAI,EAAE;QAC9D,MAAM,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,2EAA2E,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtH,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,qBAAqB,CAAC,SAAS,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,KAAK,IAAI,EAAE;QACzC,MAAM,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,wEAAwE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnH,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAClD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;gBACnC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,iCAAiC,CAAC,CAAC;gBACvE,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,IAAI,GAAG,EAAE,yCAAyC,CAAC,CAAC;YACpF,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/tools/memory-delete.d.ts

@@ -0,0 +1,19 @@
+export interface DeleteParams {
+    accountId: string;
+    attachmentId: string;
+    /** When true, bypass soft delete and permanently remove everything. */
+    force?: boolean;
+}
+export interface DeleteResult {
+    mode: "soft" | "hard";
+    attachmentId: string;
+    document: number;
+    sections: number;
+    chunks: number;
+    references: number;
+    diskRemoved: boolean;
+    deletedAt?: string;
+    purgeAfter?: string;
+}
+export declare function memoryDelete(params: DeleteParams): Promise<DeleteResult>;
+//# sourceMappingURL=memory-delete.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/tools/memory-delete.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-delete.d.ts","sourceRoot":"","sources":["../../src/tools/memory-delete.ts"],"names":[],"mappings":"AA4BA,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;IACrB,uEAAuE;IACvE,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,OAAO,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,wBAAsB,YAAY,CAChC,MAAM,EAAE,YAAY,GACnB,OAAO,CAAC,YAAY,CAAC,CA0GvB"}