@rubytech/create-realagent 1.0.829 → 1.0.831

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

@@ -0,0 +1,45 @@
+/**
+ * Deterministic prose chunker for oversize document classification (Task 896).
+ *
+ * Splits a document into overlapping fixed-size chunks so each chunk fits
+ * inside Haiku's input context window. The chunker is purely mechanical —
+ * it makes no semantic claim about where chunk boundaries should fall.
+ * Ontological boundaries remain Haiku's job per Task 737 (the document
+ * chunker that *did* try to be semantic was deleted because it leaked
+ * sections at the boundaries it picked).
+ *
+ * Overlap exists so a section straddling a chunk boundary appears in BOTH
+ * surrounding chunks; the merge step then unions the same-kind ranges so
+ * the boundary section isn't double-counted in the writer.
+ *
+ * Char counts are estimated from token counts via a fixed 3.5 chars/token
+ * ratio (English prose average). The estimate is conservative — Haiku
+ * tokenises slightly differently per script, but 3.5 leaves ~10% headroom
+ * for non-English content before bumping into the model's hard ceiling.
+ */
+export interface RangedSection {
+    /** Section kind from the classifier's closed enumeration. */
+    kind: string;
+    /** Inclusive whole-document start offset. */
+    sourceStart: number;
+    /** Exclusive whole-document end offset. */
+    sourceEnd: number;
+    /** Per-section summary; longer wins on merge tie-break. */
+    summary: string;
+}
+export interface DocumentChunk {
+    /** Substring of the source document covered by this chunk. */
+    chunkText: string;
+    /** Whole-document offset where this chunk's text begins. */
+    baseOffset: number;
+}
+export interface ChunkOptions {
+    /** Maximum chunk length in characters (already token→char converted). */
+    chunkSize: number;
+    /** Overlap in characters between consecutive chunks. */
+    overlap: number;
+}
+export declare function chunkDocument(text: string, opts: ChunkOptions): DocumentChunk[];
+export declare const MERGE_OVERLAP_THRESHOLD = 0.5;
+export declare function mergeOverlappingSections<T extends RangedSection>(input: T[]): T[];
+//# sourceMappingURL=document-chunker.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"document-chunker.d.ts","sourceRoot":"","sources":["../../src/lib/document-chunker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAQH,MAAM,WAAW,aAAa;IAC5B,6DAA6D;IAC7D,IAAI,EAAE,MAAM,CAAC;IACb,6CAA6C;IAC7C,WAAW,EAAE,MAAM,CAAC;IACpB,2CAA2C;IAC3C,SAAS,EAAE,MAAM,CAAC;IAClB,2DAA2D;IAC3D,OAAO,EAAE,MAAM,CAAC;CACjB;AAMD,MAAM,WAAW,aAAa;IAC5B,8DAA8D;IAC9D,SAAS,EAAE,MAAM,CAAC;IAClB,4DAA4D;IAC5D,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,YAAY;IAC3B,yEAAyE;IACzE,SAAS,EAAE,MAAM,CAAC;IAClB,wDAAwD;IACxD,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,GAAG,aAAa,EAAE,CA4B/E;AAqBD,eAAO,MAAM,uBAAuB,MAAM,CAAC;AAE3C,wBAAgB,wBAAwB,CAAC,CAAC,SAAS,aAAa,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAqDjF"}

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

@@ -0,0 +1,125 @@
+/**
+ * Deterministic prose chunker for oversize document classification (Task 896).
+ *
+ * Splits a document into overlapping fixed-size chunks so each chunk fits
+ * inside Haiku's input context window. The chunker is purely mechanical —
+ * it makes no semantic claim about where chunk boundaries should fall.
+ * Ontological boundaries remain Haiku's job per Task 737 (the document
+ * chunker that *did* try to be semantic was deleted because it leaked
+ * sections at the boundaries it picked).
+ *
+ * Overlap exists so a section straddling a chunk boundary appears in BOTH
+ * surrounding chunks; the merge step then unions the same-kind ranges so
+ * the boundary section isn't double-counted in the writer.
+ *
+ * Char counts are estimated from token counts via a fixed 3.5 chars/token
+ * ratio (English prose average). The estimate is conservative — Haiku
+ * tokenises slightly differently per script, but 3.5 leaves ~10% headroom
+ * for non-English content before bumping into the model's hard ceiling.
+ */
+export function chunkDocument(text, opts) {
+    const { chunkSize, overlap } = opts;
+    if (chunkSize <= 0) {
+        throw new Error(`chunkDocument: chunkSize must be positive, got ${chunkSize}`);
+    }
+    if (overlap < 0) {
+        throw new Error(`chunkDocument: overlap must be non-negative, got ${overlap}`);
+    }
+    if (overlap >= chunkSize) {
+        throw new Error(`chunkDocument: overlap (${overlap}) must be less than chunkSize (${chunkSize})`);
+    }
+    if (text.length === 0)
+        return [];
+    if (text.length <= chunkSize) {
+        // One-chunk fast path so callers that always-chunk don't pay the
+        // window-stepping arithmetic for inputs that already fit.
+        return [{ chunkText: text, baseOffset: 0 }];
+    }
+    const chunks = [];
+    const stride = chunkSize - overlap;
+    let start = 0;
+    while (start < text.length) {
+        const end = Math.min(start + chunkSize, text.length);
+        chunks.push({ chunkText: text.slice(start, end), baseOffset: start });
+        if (end >= text.length)
+            break;
+        start += stride;
+    }
+    return chunks;
+}
+// ---------------------------------------------------------------------------
+// mergeOverlappingSections — collates per-chunk classifier results.
+//
+// Algorithm: group sections by `kind`, sort by `sourceStart`, then walk and
+// union consecutive same-kind ranges whose intersection covers more than
+// MERGE_OVERLAP_THRESHOLD of the smaller range. The longer summary wins on
+// merge — empirically Haiku's longer summary on a chunk that saw more
+// surrounding context tends to be the better one.
+//
+// Cross-kind overlap is preserved: chunk A's `Position` and chunk B's
+// `Other` covering the same range are kept as two distinct sections (per
+// eng review). The classifier disagreed about kind; the writer's downstream
+// :Section:Other surfacing will let the operator decide which one wins
+// during ontology growth review.
+//
+// Disjoint same-kind sections are also preserved — only adjacent ranges
+// with material overlap are merged.
+// ---------------------------------------------------------------------------
+export const MERGE_OVERLAP_THRESHOLD = 0.5;
+export function mergeOverlappingSections(input) {
+    if (input.length <= 1)
+        return input.slice();
+    // Group by kind so we never accidentally merge across kinds.
+    const byKind = new Map();
+    for (const s of input) {
+        const arr = byKind.get(s.kind);
+        if (arr)
+            arr.push(s);
+        else
+            byKind.set(s.kind, [s]);
+    }
+    const merged = [];
+    for (const group of byKind.values()) {
+        group.sort((a, b) => a.sourceStart - b.sourceStart || a.sourceEnd - b.sourceEnd);
+        let current = null;
+        for (const s of group) {
+            if (current === null) {
+                current = { ...s };
+                continue;
+            }
+            const intersection = Math.max(0, Math.min(current.sourceEnd, s.sourceEnd) - Math.max(current.sourceStart, s.sourceStart));
+            if (intersection === 0) {
+                merged.push(current);
+                current = { ...s };
+                continue;
+            }
+            const currentLen = current.sourceEnd - current.sourceStart;
+            const sLen = s.sourceEnd - s.sourceStart;
+            const overlapFraction = intersection / Math.min(currentLen, sLen);
+            if (overlapFraction > MERGE_OVERLAP_THRESHOLD) {
+                // Union the range; the section with the longer body contributes its
+                // non-range fields (title, properties, anchorEdge, related, etc.) on
+                // the assumption that a wider classification window grounded its
+                // properties more reliably. Summary always picks the longer of the two.
+                const fieldsWinner = sLen > currentLen ? s : current;
+                current = {
+                    ...fieldsWinner,
+                    sourceStart: Math.min(current.sourceStart, s.sourceStart),
+                    sourceEnd: Math.max(current.sourceEnd, s.sourceEnd),
+                    summary: s.summary.length > current.summary.length ? s.summary : current.summary,
+                };
+            }
+            else {
+                merged.push(current);
+                current = { ...s };
+            }
+        }
+        if (current !== null)
+            merged.push(current);
+    }
+    // Return in whole-document reading order so the writer's :NEXT chain
+    // maps to source order.
+    merged.sort((a, b) => a.sourceStart - b.sourceStart);
+    return merged;
+}
+//# sourceMappingURL=document-chunker.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"document-chunker.js","sourceRoot":"","sources":["../../src/lib/document-chunker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAqCH,MAAM,UAAU,aAAa,CAAC,IAAY,EAAE,IAAkB;IAC5D,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IACpC,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,kDAAkD,SAAS,EAAE,CAAC,CAAC;IACjF,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,oDAAoD,OAAO,EAAE,CAAC,CAAC;IACjF,CAAC;IACD,IAAI,OAAO,IAAI,SAAS,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,2BAA2B,OAAO,kCAAkC,SAAS,GAAG,CAAC,CAAC;IACpG,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACjC,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS,EAAE,CAAC;QAC7B,iEAAiE;QACjE,0DAA0D;QAC1D,OAAO,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,MAAM,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC;IACnC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;QACtE,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM;YAAE,MAAM;QAC9B,KAAK,IAAI,MAAM,CAAC;IAClB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,oEAAoE;AACpE,EAAE;AACF,4EAA4E;AAC5E,yEAAyE;AACzE,2EAA2E;AAC3E,sEAAsE;AACtE,kDAAkD;AAClD,EAAE;AACF,sEAAsE;AACtE,yEAAyE;AACzE,4EAA4E;AAC5E,uEAAuE;AACvE,iCAAiC;AACjC,EAAE;AACF,wEAAwE;AACxE,oCAAoC;AACpC,8EAA8E;AAE9E,MAAM,CAAC,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAE3C,MAAM,UAAU,wBAAwB,CAA0B,KAAU;IAC1E,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IAE5C,6DAA6D;IAC7D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAe,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,GAAG;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YAChB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QACjF,IAAI,OAAO,GAAa,IAAI,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACrB,OAAO,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACnB,SAAS;YACX,CAAC;YACD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YAC1H,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrB,OAAO,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACnB,SAAS;YACX,CAAC;YACD,MAAM,UAAU,GAAW,OAAO,CAAC,SAAS,GAAG,OAAO,CAAC,WAAW,CAAC;YACnE,MAAM,IAAI,GAAW,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,WAAW,CAAC;YACjD,MAAM,eAAe,GAAG,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YAClE,IAAI,eAAe,GAAG,uBAAuB,EAAE,CAAC;gBAC9C,oEAAoE;gBACpE,qEAAqE;gBACrE,iEAAiE;gBACjE,wEAAwE;gBACxE,MAAM,YAAY,GAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;gBACxD,OAAO,GAAG;oBACR,GAAG,YAAY;oBACf,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC;oBACzD,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC;oBACnD,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO;iBACjF,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrB,OAAO,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YACrB,CAAC;QACH,CAAC;QACD,IAAI,OAAO,KAAK,IAAI;YAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7C,CAAC;IAED,qEAAqE;IACrE,wBAAwB;IACxB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;IACrD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/lib/llm-classifier.d.ts

@@ -17,9 +17,10 @@
  * Hallucination defence: every returned `kind` is verified against the
  * loaded ontology label set. Sections whose `kind` is not a real label
  * are tagged `UNMAPPED`. Failure of the LLM call (missing creds, network,
- * malformed JSON) returns `{kind: "fallback", reason}` — the calling
- * skill MUST treat this as terminal and abort the ingest with a loud
- * blocker. There is no longer a writer fallback path (Task 740).
+ * malformed JSON) returns `{kind: "error", reason}` (Task 897 vocabulary
+ * — was `kind: "fallback"`). The caller decides whether to abort the
+ * ingest or degrade-on-error per session; classifier never silently
+ * substitutes a degraded write.
  */
 /** Direction of the anchor edge relative to the typed node. */
 export type AnchorEdgeDirection = "from-anchor" | "to-anchor";
@@ -70,8 +71,31 @@ export interface ClassifiedSection {
     kind: string;
     /** Short human-readable title for the section. */
     title: string;
-    /** The section's body text — embedded and stored on the section node. */
+    /**
+     * The section's body text — embedded and stored on the section node.
+     *
+     * Task 896: server-reconstructed via `documentText.slice(sourceStart, sourceEnd)`.
+     * The LLM emits offsets, never the body text — output size becomes O(sections),
+     * not O(input chars). Callers consume the same `body: string` shape as before.
+     */
     body: string;
+    /**
+     * 1-3 sentence summary of the section, ≤500 chars (server-validated).
+     * The LLM emits this; the server truncates if oversize. Stored as
+     * `properties.summary` on the section node so adjacency search can
+     * surface it without rehydrating the body.
+     */
+    summary: string;
+    /**
+     * Whole-document character offsets — inclusive start, exclusive end.
+     * The LLM emits these; the server validates bounds and reconstructs
+     * `body` via `documentText.slice(sourceStart, sourceEnd)`. In the
+     * chunked-classify path these are translated from chunk-local to
+     * whole-document coordinates so the merge step can detect boundary
+     * straddlers across chunks.
+     */
+    sourceStart: number;
+    sourceEnd: number;
     /** Properties on the section node (excluding accountId/embedding/provenance). */
     properties: Record<string, unknown>;
     /**
@@ -137,7 +161,7 @@ export type ClassifyResult = {
     kind: "ok";
     output: ClassifierOutput;
 } | {
-    kind: "fallback";
+    kind: "error";
     reason: string;
 };
 /**
@@ -206,10 +230,11 @@ export interface ClassifyParams {
  *     Sections the classifier could not natural-edge appear in
  *     `output.orphanCandidates`. The skill surfaces orphans loudly to
  *     the operator.
- *   { kind: "fallback", reason } when the LLM is unavailable or returns
- *     malformed JSON. The skill MUST treat this as terminal: abort the
- *     ingest entirely, no graph writes, surface the blocker to the
- *     operator (Task 740 doctrine — no silent fallback writes).
+ *   { kind: "error", reason } when the LLM is unavailable, returns
+ *     malformed JSON, or hits an input-too-large guard. The caller
+ *     decides whether to abort the ingest entirely (document mode) or
+ *     degrade-on-error per session (chat mode, Task 897). Classifier
+ *     never silently substitutes a degraded write.
  */
 export declare function classifyDocument(params: ClassifyParams): Promise<ClassifyResult>;
 //# sourceMappingURL=llm-classifier.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/lib/llm-classifier.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"llm-classifier.d.ts","sourceRoot":"","sources":["../../src/lib/llm-classifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AASH,+DAA+D;AAC/D,MAAM,MAAM,mBAAmB,GAAG,aAAa,GAAG,WAAW,CAAC;AAE9D,mEAAmE;AACnE,MAAM,MAAM,oBAAoB,GAAG,UAAU,GAAG,UAAU,CAAC;AAE3D,kFAAkF;AAClF,MAAM,WAAW,iBAAiB;IAChC,8DAA8D;IAC9D,IAAI,EAAE,MAAM,CAAC;IACb,sCAAsC;IACtC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACpC,oDAAoD;IACpD,IAAI,EAAE;QACJ,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,oBAAoB,CAAC;QAChC,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACtC,CAAC;IACF;;;;OAIG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAED,oGAAoG;AACpG,MAAM,WAAW,iBAAiB;IAChC;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,IAAI,EAAE,MAAM,CAAC;IACb,kDAAkD;IAClD,KAAK,EAAE,MAAM,CAAC;IACd,yEAAyE;IACzE,IAAI,EAAE,MAAM,CAAC;IACb,iFAAiF;IACjF,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACpC;;;;OAIG;IACH,UAAU,EAAE;QACV,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,mBAAmB,CAAC;QAC/B,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACtC,GAAG,IAAI,CAAC;IACT,oFAAoF;IACpF,OAAO,CAAC,EAAE,iBAAiB,EAAE,CAAC;IAC9B;;;;;;OAMG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED;;;;;GAKG;AACH,MAAM,WAAW,eAAe;IAC9B,2CAA2C;IAC3C,IAAI,EAAE,MAAM,CAAC;IACb,6EAA6E;IAC7E,KAAK,EAAE,MAAM,CAAC;IACd,sEAAsE;IACtE,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,oCAAoC;AACpC,MAAM,WAAW,gBAAgB;IAC/B,kDAAkD;IAClD,eAAe,EAAE,MAAM,CAAC;IACxB,kEAAkE;IAClE,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,6BAA6B;IAC7B,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IAC9B,iFAAiF;IACjF,gBAAgB,EAAE,eAAe,EAAE,CAAC;IACpC;;+CAE2C;IAC3C,aAAa,CAAC,EAAE,KAAK,CAAC;QACpB,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,UAAU,GAAG,UAAU,CAAC;QACnC,UAAU,EAAE,MAAM,CAAC;QACnB,gBAAgB,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC1C,wEAAwE;QACxE,KAAK,CAAC,EAAE,OAAO,CAAC;KACjB,CAAC,CAAC;IACH,mFAAmF;IACnF,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,MAAM,cAAc,GACtB;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,MAAM,EAAE,gBAAgB,CAAA;CAAE,GACxC;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAQzC;;;;;;;;GAQG;AACH,eAAO,MAAM,kBAAkB,UAAU,CAAC;AAE1C,eAAO,MAAM,sBAAsB,wEAMzB,CAAC;AAEX,eAAO,MAAM,wBAAwB,yKAgB3B,CAAC;AAEX,eAAO,MAAM,sBAAsB,4SAqBzB,CAAC;AAEX,8EAA8E;AAC9E,eAAO,MAAM,qBAAqB,sBAAuB,CAAC;AAE1D,eAAO,MAAM,iBAAiB,EAAE,WAAW,CAAC,MAAM,CAMhD,CAAC;AA+HH,MAAM,WAAW,cAAc;IAC7B,wCAAwC;IACxC,SAAS,EAAE,MAAM,CAAC;IAClB;;;;;;;OAOG;IACH,IAAI,CAAC,EAAE,UAAU,GAAG,MAAM,CAAC;IAC3B;;;;;;;;OAQG;IACH,iBAAiB,EAAE,MAAM,CAAC;IAC1B;;;;;;OAMG;IACH,cAAc,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACpC;;;;;;OAMG;IACH,cAAc,EAAE,MAAM,CAAC;IACvB,8EAA8E;IAC9E,YAAY,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAsB,gBAAgB,CACpC,MAAM,EAAE,cAAc,GACrB,OAAO,CAAC,cAAc,CAAC,CA2OzB"}
+{"version":3,"file":"llm-classifier.d.ts","sourceRoot":"","sources":["../../src/lib/llm-classifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAUH,+DAA+D;AAC/D,MAAM,MAAM,mBAAmB,GAAG,aAAa,GAAG,WAAW,CAAC;AAE9D,mEAAmE;AACnE,MAAM,MAAM,oBAAoB,GAAG,UAAU,GAAG,UAAU,CAAC;AAE3D,kFAAkF;AAClF,MAAM,WAAW,iBAAiB;IAChC,8DAA8D;IAC9D,IAAI,EAAE,MAAM,CAAC;IACb,sCAAsC;IACtC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACpC,oDAAoD;IACpD,IAAI,EAAE;QACJ,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,oBAAoB,CAAC;QAChC,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACtC,CAAC;IACF;;;;OAIG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAED,oGAAoG;AACpG,MAAM,WAAW,iBAAiB;IAChC;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,IAAI,EAAE,MAAM,CAAC;IACb,kDAAkD;IAClD,KAAK,EAAE,MAAM,CAAC;IACd;;;;;;OAMG;IACH,IAAI,EAAE,MAAM,CAAC;IACb;;;;;OAKG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB;;;;;;;OAOG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,iFAAiF;IACjF,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACpC;;;;OAIG;IACH,UAAU,EAAE;QACV,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,mBAAmB,CAAC;QAC/B,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACtC,GAAG,IAAI,CAAC;IACT,oFAAoF;IACpF,OAAO,CAAC,EAAE,iBAAiB,EAAE,CAAC;IAC9B;;;;;;OAMG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED;;;;;GAKG;AACH,MAAM,WAAW,eAAe;IAC9B,2CAA2C;IAC3C,IAAI,EAAE,MAAM,CAAC;IACb,6EAA6E;IAC7E,KAAK,EAAE,MAAM,CAAC;IACd,sEAAsE;IACtE,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,oCAAoC;AACpC,MAAM,WAAW,gBAAgB;IAC/B,kDAAkD;IAClD,eAAe,EAAE,MAAM,CAAC;IACxB,kEAAkE;IAClE,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,6BAA6B;IAC7B,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IAC9B,iFAAiF;IACjF,gBAAgB,EAAE,eAAe,EAAE,CAAC;IACpC;;+CAE2C;IAC3C,aAAa,CAAC,EAAE,KAAK,CAAC;QACpB,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,UAAU,GAAG,UAAU,CAAC;QACnC,UAAU,EAAE,MAAM,CAAC;QACnB,gBAAgB,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC1C,wEAAwE;QACxE,KAAK,CAAC,EAAE,OAAO,CAAC;KACjB,CAAC,CAAC;IACH,mFAAmF;IACnF,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,MAAM,cAAc,GACtB;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,MAAM,EAAE,gBAAgB,CAAA;CAAE,GACxC;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AA8EtC;;;;;;;;GAQG;AACH,eAAO,MAAM,kBAAkB,UAAU,CAAC;AAE1C,eAAO,MAAM,sBAAsB,wEAMzB,CAAC;AAEX,eAAO,MAAM,wBAAwB,yKAa3B,CAAC;AAEX,eAAO,MAAM,sBAAsB,4SAqBzB,CAAC;AAEX,8EAA8E;AAC9E,eAAO,MAAM,qBAAqB,sBAAuB,CAAC;AAE1D,eAAO,MAAM,iBAAiB,EAAE,WAAW,CAAC,MAAM,CAMhD,CAAC;AAsKH,MAAM,WAAW,cAAc;IAC7B,wCAAwC;IACxC,SAAS,EAAE,MAAM,CAAC;IAClB;;;;;;;OAOG;IACH,IAAI,CAAC,EAAE,UAAU,GAAG,MAAM,CAAC;IAC3B;;;;;;;;OAQG;IACH,iBAAiB,EAAE,MAAM,CAAC;IAC1B;;;;;;OAMG;IACH,cAAc,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACpC;;;;;;OAMG;IACH,cAAc,EAAE,MAAM,CAAC;IACvB,8EAA8E;IAC9E,YAAY,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAsB,gBAAgB,CACpC,MAAM,EAAE,cAAc,GACrB,OAAO,CAAC,cAAc,CAAC,CA0WzB"}