@rubytech/create-maxy 1.0.772 → 1.0.773

package/payload/server/public/index.html

@@ -5,7 +5,7 @@
   <meta name="viewport" content="width=device-width, initial-scale=1.0">
   <title>Maxy</title>
   <link rel="icon" href="/favicon.ico">
-  <script type="module" crossorigin src="/assets/admin-CFttroHB.js"></script>
+  <script type="module" crossorigin src="/assets/admin-C4CTVtBu.js"></script>
   <link rel="modulepreload" crossorigin href="/assets/chunk-DD-I1_y5.js">
   <link rel="modulepreload" crossorigin href="/assets/jsx-runtime-DeNudFNA.js">
   <link rel="modulepreload" crossorigin href="/assets/preload-helper-qlgyTAkD.js">

package/payload/server/server.js

@@ -47,7 +47,7 @@ import {
   vncLog,
   waitForExit,
   writeChromiumWrapper
-} from "./chunk-57S5JC7G.js";
+} from "./chunk-PIMJJCOQ.js";
 import {
   ACCOUNTS_DIR,
   GREETING_DIRECTIVE,
@@ -107,8 +107,9 @@ import {
   validateAgentSlug,
   validateSession,
   verifyAndGetConversationUpdatedAt,
-  verifyConversationOwnership
-} from "./chunk-XHFMXKXI.js";
+  verifyConversationOwnership,
+  writeAdminUserAndPerson
+} from "./chunk-2HBD6IRL.js";
 
 // ../lib/graph-trash/dist/index.js
 var require_dist = __commonJS({
@@ -7444,6 +7445,10 @@ app8.post("/set-pin", async (c) => {
   if (!body.pin || body.pin.length < 4) {
     return c.json({ error: "PIN must be at least 4 characters." }, 400);
   }
+  const fullName = (body.name ?? "").trim();
+  if (!fullName) {
+    return c.json({ error: "Your name is required." }, 400);
+  }
   const hash = hashPin(body.pin);
   const account = resolveAccount();
   const existingOwnerUserId = account?.config.admins?.find((a) => a.role === "owner")?.userId;
@@ -7468,6 +7473,21 @@ app8.post("/set-pin", async (c) => {
     } catch (err) {
       console.error(`[set-pin] failed to update account.json admins: ${err instanceof Error ? err.message : String(err)}`);
     }
+    try {
+      const result = await writeAdminUserAndPerson({
+        userId,
+        fullName,
+        accountId: account.accountId
+      });
+      console.log(
+        `[admin-identity] adminuser-bound userId=${userId.slice(0, 8)} givenName=${result.givenName} familyName=${result.familyName ?? "null"} personReused=${result.personReused}`
+      );
+    } catch (err) {
+      console.error(
+        `[admin-identity] adminuser-bind-failed userId=${userId.slice(0, 8)} accountId=${account.accountId.slice(0, 8)} error=${err instanceof Error ? err.message : String(err)}`
+      );
+      return c.json({ error: "Failed to write admin identity to graph. Check Neo4j connectivity and retry." }, 500);
+    }
   }
   return c.json({ ok: true });
 });
@@ -8181,7 +8201,7 @@ var app11 = new Hono();
 app11.post("/cancel", requireAdminSession, async (c) => {
   const session_key = c.var.sessionKey;
   try {
-    const { interruptClient: interruptClient2 } = await import("./client-pool-J4ZHJ6Z3.js");
+    const { interruptClient: interruptClient2 } = await import("./client-pool-U3A5YUO7.js");
     await interruptClient2(session_key);
     return c.json({ ok: true });
   } catch (err) {

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

@@ -1,61 +0,0 @@
-export interface TextBlock {
-    text: string;
-    paragraphs: string[];
-    headingLine: string | null;
-}
-export interface ChunkedSection {
-    title: string;
-    chunks: Array<{
-        id: number;
-        preview: string;
-        content: string;
-    }>;
-}
-export type EmbedFn = (texts: string[]) => Promise<number[][]>;
-export declare function splitIntoParagraphs(text: string): string[];
-export declare function aggregateBlocks(paragraphs: string[], minBytes?: number): TextBlock[];
-export declare function cosine(a: number[], b: number[]): number;
-/**
- * Compute cosine similarity between each consecutive pair of embeddings.
- * Returns array of length (embeddings.length - 1).
- */
-export declare function similarityCurve(embeddings: number[][]): number[];
-/**
- * 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 declare function valleyDepths(curve: number[]): number[];
-/**
- * Select the top N deepest valleys, sorted by position.
- * Skips positions with zero depth (no valley).
- */
-export declare function selectBoundaries(depths: number[], n: number): number[];
-/**
- * Snap valley-based boundaries to nearby markdown headings.
- * Boundary values represent the first block index of the new section.
- */
-export declare function snapToHeadings(boundaries: number[], blocks: TextBlock[], window?: number): number[];
-/**
- * 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 declare function chunkText(text: string, embedFn: EmbedFn): Promise<ChunkedSection[]>;
-/**
- * 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 declare function buildSections(blocks: TextBlock[], boundaries: number[]): ChunkedSection[];
-//# sourceMappingURL=semantic-chunker.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"semantic-chunker.d.ts","sourceRoot":"","sources":["../../src/lib/semantic-chunker.ts"],"names":[],"mappings":"AAmBA,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;CAC5B;AAED,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,KAAK,CAAC;QACZ,EAAE,EAAE,MAAM,CAAC;QACX,OAAO,EAAE,MAAM,CAAC;QAChB,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC,CAAC;CACJ;AAED,MAAM,MAAM,OAAO,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AAE/D,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAQ1D;AAED,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,EAAE,EAAE,QAAQ,SAAiB,GAAG,SAAS,EAAE,CA2B5F;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAevD;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,CAMhE;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAoBtD;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAUtE;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAC5B,UAAU,EAAE,MAAM,EAAE,EACpB,MAAM,EAAE,SAAS,EAAE,EACnB,MAAM,SAAsB,GAC3B,MAAM,EAAE,CAgBV;AAED;;;;;;;;;;GAUG;AACH,wBAAsB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CA+DzF;AAWD;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,cAAc,EAAE,CAqDzF"}

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

@@ -1,266 +0,0 @@
-// ---------------------------------------------------------------------------
-// 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

@@ -1 +0,0 @@
-{"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/premium-plugins/real-agency/plugins/real-agency-loop/mcp/dist/index.d.ts

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

package/payload/premium-plugins/real-agency/plugins/real-agency-loop/mcp/dist/index.d.ts.map

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