voctar 0.1.0

package/dist/src/chunking/strategies/recursive.js

@@ -0,0 +1,192 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RecursiveChunkingStrategy = void 0;
+// Recursive text splitting strategy - tries to split on natural boundaries
+const uuid_1 = require("uuid");
+const tokenizer_1 = require("../utils/tokenizer");
+class RecursiveChunkingStrategy {
+    getName() {
+        return 'recursive';
+    }
+    chunk(text, documentId, options) {
+        // Get token limit and ensure maxSize doesn't exceed it
+        const tokenLimit = options.tokenLimit ?? 8192;
+        const maxSize = Math.min(options.maxChunkSize ?? 1000, tokenLimit);
+        const overlap = Math.min(options.overlap ?? 200, Math.floor(maxSize * 0.2)); // Overlap shouldn't exceed 20% of maxSize
+        // Default separators in order of preference (paragraph > sentence > word > char)
+        const defaultSeparators = [
+            '\n\n', // Paragraph
+            '\n', // Line break
+            '. ', // Sentence
+            '! ', // Sentence
+            '? ', // Sentence
+            '; ', // Clause
+            ', ', // Phrase
+            ' ', // Word
+            '', // Character
+        ];
+        const separators = options.separator
+            ? (Array.isArray(options.separator) ? options.separator : [options.separator])
+            : defaultSeparators;
+        const chunks = this.recursiveSplit(text, maxSize, overlap, separators);
+        // Convert to Chunk objects with metadata
+        let startChar = 0;
+        const result = [];
+        chunks.forEach((chunkText, index) => {
+            const endChar = startChar + chunkText.length;
+            result.push({
+                id: (0, uuid_1.v4)(),
+                text: chunkText,
+                metadata: {
+                    documentId,
+                    chunkIndex: index,
+                    totalChunks: chunks.length,
+                    startChar,
+                    endChar,
+                    ...options.metadata,
+                },
+            });
+            // Account for overlap in start position
+            startChar = endChar - overlap;
+        });
+        return result;
+    }
+    recursiveSplit(text, maxSize, // maxSize is now in tokens
+    overlap, // overlap is now in tokens
+    separators) {
+        const finalChunks = [];
+        // Base case: if text token count is small enough, return it
+        const textTokens = (0, tokenizer_1.countTokens)(text);
+        if (textTokens <= maxSize) {
+            return text.trim() ? [text.trim()] : [];
+        }
+        // Try each separator in order
+        for (const separator of separators) {
+            if (separator === '') {
+                // Character-level split as last resort
+                return this.splitByCharacters(text, maxSize, overlap);
+            }
+            if (text.includes(separator)) {
+                const splits = text.split(separator);
+                const chunks = this.mergeSplits(splits, separator, maxSize, overlap);
+                // If any chunk is still too large (by token count), recursively split it
+                for (const chunk of chunks) {
+                    const chunkTokens = (0, tokenizer_1.countTokens)(chunk);
+                    if (chunkTokens > maxSize) {
+                        // Find next separator in the list
+                        const nextSeparatorIndex = separators.indexOf(separator) + 1;
+                        const remainingSeparators = separators.slice(nextSeparatorIndex);
+                        finalChunks.push(...this.recursiveSplit(chunk, maxSize, overlap, remainingSeparators));
+                    }
+                    else if (chunk.trim()) {
+                        finalChunks.push(chunk.trim());
+                    }
+                }
+                return finalChunks;
+            }
+        }
+        // Fallback to character split
+        return this.splitByCharacters(text, maxSize, overlap);
+    }
+    mergeSplits(splits, separator, maxSize, // maxSize is now in tokens
+    overlap // overlap is now in tokens
+    ) {
+        const chunks = [];
+        let currentChunk = '';
+        for (let i = 0; i < splits.length; i++) {
+            const split = splits[i];
+            const piece = i < splits.length - 1 ? split + separator : split;
+            const combined = currentChunk + piece;
+            const combinedTokens = (0, tokenizer_1.countTokens)(combined);
+            if (combinedTokens <= maxSize) {
+                currentChunk = combined;
+            }
+            else {
+                if (currentChunk) {
+                    chunks.push(currentChunk);
+                    // Start new chunk with overlap (in tokens)
+                    // Find overlap by binary search or by character approximation
+                    const overlapText = this.getOverlapText(currentChunk, overlap);
+                    currentChunk = overlapText + piece;
+                }
+                else {
+                    // Single piece is larger than maxSize, add it anyway (will be split recursively)
+                    currentChunk = piece;
+                }
+            }
+        }
+        if (currentChunk) {
+            chunks.push(currentChunk);
+        }
+        return chunks;
+    }
+    /**
+     * Get overlap text that is approximately 'overlapTokens' tokens
+     */
+    getOverlapText(text, overlapTokens) {
+        // Binary search for the right amount of text
+        let start = 0;
+        let end = text.length;
+        let bestMatch = '';
+        while (start < end) {
+            const mid = Math.floor((start + end) / 2);
+            const candidate = text.slice(mid);
+            const tokens = (0, tokenizer_1.countTokens)(candidate);
+            if (tokens <= overlapTokens) {
+                bestMatch = candidate;
+                end = mid;
+            }
+            else {
+                start = mid + 1;
+            }
+        }
+        return bestMatch || text.slice(-Math.floor(text.length * 0.1)); // Fallback to last 10%
+    }
+    splitByCharacters(text, maxSize, overlap) {
+        // maxSize and overlap are in tokens, but we need to split by characters
+        // Use binary search to find character positions that match token limits
+        const chunks = [];
+        let start = 0;
+        while (start < text.length) {
+            const chunkText = this.getTextUpToTokenLimit(text.slice(start), maxSize);
+            if (!chunkText)
+                break;
+            chunks.push(chunkText);
+            const chunkLength = chunkText.length;
+            // Calculate overlap start position
+            const overlapText = this.getOverlapText(chunkText, overlap);
+            start += chunkLength - overlapText.length;
+            if (text.length - start < overlapText.length) {
+                break;
+            }
+        }
+        return chunks;
+    }
+    /**
+     * Get text up to a token limit
+     */
+    getTextUpToTokenLimit(text, maxTokens) {
+        if ((0, tokenizer_1.countTokens)(text) <= maxTokens) {
+            return text;
+        }
+        // Binary search for the right character position
+        let start = 0;
+        let end = text.length;
+        let bestMatch = '';
+        while (start < end) {
+            const mid = Math.floor((start + end) / 2);
+            const candidate = text.slice(0, mid);
+            const tokens = (0, tokenizer_1.countTokens)(candidate);
+            if (tokens <= maxTokens) {
+                bestMatch = candidate;
+                start = mid + 1;
+            }
+            else {
+                end = mid;
+            }
+        }
+        return bestMatch || text.slice(0, Math.floor(text.length * 0.8)); // Fallback to 80%
+    }
+}
+exports.RecursiveChunkingStrategy = RecursiveChunkingStrategy;
+//# sourceMappingURL=recursive.js.map

package/dist/src/chunking/strategies/recursive.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"recursive.js","sourceRoot":"","sources":["../../../../src/chunking/strategies/recursive.ts"],"names":[],"mappings":";;;AAAA,2EAA2E;AAC3E,+BAAoC;AAEpC,kDAAiD;AAEjD,MAAa,yBAAyB;IACpC,OAAO;QACL,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,KAAK,CAAC,IAAY,EAAE,UAAkB,EAAE,OAAwB;QAC9D,uDAAuD;QACvD,MAAM,UAAU,GAAI,OAAe,CAAC,UAAU,IAAI,IAAI,CAAC;QACvD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,IAAI,IAAI,EAAE,UAAU,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,0CAA0C;QAEvH,iFAAiF;QACjF,MAAM,iBAAiB,GAAG;YACxB,MAAM,EAAG,YAAY;YACrB,IAAI,EAAK,aAAa;YACtB,IAAI,EAAK,WAAW;YACpB,IAAI,EAAK,WAAW;YACpB,IAAI,EAAK,WAAW;YACpB,IAAI,EAAK,SAAS;YAClB,IAAI,EAAK,SAAS;YAClB,GAAG,EAAM,OAAO;YAChB,EAAE,EAAO,YAAY;SACtB,CAAC;QAEF,MAAM,UAAU,GAAG,OAAO,CAAC,SAAS;YAClC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC9E,CAAC,CAAC,iBAAiB,CAAC;QAEtB,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QAEvE,yCAAyC;QACzC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,MAAM,MAAM,GAAY,EAAE,CAAC;QAE3B,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE;YAClC,MAAM,OAAO,GAAG,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC;YAE7C,MAAM,CAAC,IAAI,CAAC;gBACV,EAAE,EAAE,IAAA,SAAM,GAAE;gBACZ,IAAI,EAAE,SAAS;gBACf,QAAQ,EAAE;oBACR,UAAU;oBACV,UAAU,EAAE,KAAK;oBACjB,WAAW,EAAE,MAAM,CAAC,MAAM;oBAC1B,SAAS;oBACT,OAAO;oBACP,GAAG,OAAO,CAAC,QAAQ;iBACpB;aACF,CAAC,CAAC;YAEH,wCAAwC;YACxC,SAAS,GAAG,OAAO,GAAG,OAAO,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,cAAc,CACpB,IAAY,EACZ,OAAe,EAAE,2BAA2B;IAC5C,OAAe,EAAE,2BAA2B;IAC5C,UAAoB;QAEpB,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,4DAA4D;QAC5D,MAAM,UAAU,GAAG,IAAA,uBAAW,EAAC,IAAI,CAAC,CAAC;QACrC,IAAI,UAAU,IAAI,OAAO,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1C,CAAC;QAED,8BAA8B;QAC9B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,SAAS,KAAK,EAAE,EAAE,CAAC;gBACrB,uCAAuC;gBACvC,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;YACxD,CAAC;YAED,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;gBACrC,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAErE,yEAAyE;gBACzE,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC3B,MAAM,WAAW,GAAG,IAAA,uBAAW,EAAC,KAAK,CAAC,CAAC;oBACvC,IAAI,WAAW,GAAG,OAAO,EAAE,CAAC;wBAC1B,kCAAkC;wBAClC,MAAM,kBAAkB,GAAG,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;wBAC7D,MAAM,mBAAmB,GAAG,UAAU,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;wBACjE,WAAW,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,mBAAmB,CAAC,CAAC,CAAC;oBACzF,CAAC;yBAAM,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;wBACxB,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;oBACjC,CAAC;gBACH,CAAC;gBAED,OAAO,WAAW,CAAC;YACrB,CAAC;QACH,CAAC;QAED,8BAA8B;QAC9B,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IACxD,CAAC;IAEO,WAAW,CACjB,MAAgB,EAChB,SAAiB,EACjB,OAAe,EAAE,2BAA2B;IAC5C,OAAe,CAAC,2BAA2B;;QAE3C,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,YAAY,GAAG,EAAE,CAAC;QAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;YAChE,MAAM,QAAQ,GAAG,YAAY,GAAG,KAAK,CAAC;YACtC,MAAM,cAAc,GAAG,IAAA,uBAAW,EAAC,QAAQ,CAAC,CAAC;YAE7C,IAAI,cAAc,IAAI,OAAO,EAAE,CAAC;gBAC9B,YAAY,GAAG,QAAQ,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,IAAI,YAAY,EAAE,CAAC;oBACjB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;oBAC1B,2CAA2C;oBAC3C,8DAA8D;oBAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;oBAC/D,YAAY,GAAG,WAAW,GAAG,KAAK,CAAC;gBACrC,CAAC;qBAAM,CAAC;oBACN,iFAAiF;oBACjF,YAAY,GAAG,KAAK,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC5B,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,IAAY,EAAE,aAAqB;QACxD,6CAA6C;QAC7C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,SAAS,GAAG,EAAE,CAAC;QAEnB,OAAO,KAAK,GAAG,GAAG,EAAE,CAAC;YACnB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAClC,MAAM,MAAM,GAAG,IAAA,uBAAW,EAAC,SAAS,CAAC,CAAC;YAEtC,IAAI,MAAM,IAAI,aAAa,EAAE,CAAC;gBAC5B,SAAS,GAAG,SAAS,CAAC;gBACtB,GAAG,GAAG,GAAG,CAAC;YACZ,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QAED,OAAO,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,uBAAuB;IACzF,CAAC;IAEO,iBAAiB,CAAC,IAAY,EAAE,OAAe,EAAE,OAAe;QACtE,wEAAwE;QACxE,wEAAwE;QACxE,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;YACzE,IAAI,CAAC,SAAS;gBAAE,MAAM;YAEtB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvB,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC;YAErC,mCAAmC;YACnC,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YAC5D,KAAK,IAAI,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC;YAE1C,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;gBAC7C,MAAM;YACR,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,IAAY,EAAE,SAAiB;QAC3D,IAAI,IAAA,uBAAW,EAAC,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;YACnC,OAAO,IAAI,CAAC;QACd,CAAC;QAED,iDAAiD;QACjD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,SAAS,GAAG,EAAE,CAAC;QAEnB,OAAO,KAAK,GAAG,GAAG,EAAE,CAAC;YACnB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACrC,MAAM,MAAM,GAAG,IAAA,uBAAW,EAAC,SAAS,CAAC,CAAC;YAEtC,IAAI,MAAM,IAAI,SAAS,EAAE,CAAC;gBACxB,SAAS,GAAG,SAAS,CAAC;gBACtB,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,GAAG,GAAG,GAAG,CAAC;YACZ,CAAC;QACH,CAAC;QAED,OAAO,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,kBAAkB;IACtF,CAAC;CACF;AA3ND,8DA2NC"}

package/dist/src/chunking/strategies/semantic.d.ts

@@ -0,0 +1,96 @@
+import type { Chunk, ChunkingOptions, ChunkingStrategy } from '../types';
+import type { EmbeddingProvider } from '../../types';
+interface ChunkHeader {
+    summary?: string;
+    facts?: string[];
+    refs?: string[];
+}
+export interface SemanticChunkingOptions extends ChunkingOptions {
+    embeddingProvider?: EmbeddingProvider;
+    softLimit?: number;
+    hardLimit?: number;
+    similarityThreshold?: number;
+    contentType?: 'conversation' | 'text';
+    contextOverlapPercent?: number;
+    smartOverlap?: boolean;
+    volatilityWindow?: number;
+    generateHeaders?: boolean;
+    headerGenerator?: (text: string) => Promise<ChunkHeader>;
+    stripNoise?: boolean;
+    noisePatterns?: RegExp[];
+    addRoleMarkers?: boolean;
+}
+export declare class SemanticChunkingStrategy implements ChunkingStrategy {
+    getName(): string;
+    chunk(text: string, documentId: string, options: ChunkingOptions): Chunk[];
+    /**
+     * Auto-detect if text is conversational based on role markers
+     */
+    private detectContentType;
+    /**
+     * Pre-segment text into atomic units (turns, paragraphs, sentences)
+     */
+    private preSegment;
+    /**
+     * Segment conversation into turns (user/agent/tool)
+     */
+    private segmentConversation;
+    /**
+     * Segment plain text into paragraphs and sentences
+     */
+    private segmentText;
+    /**
+     * Semantic merging with soft/hard limits
+     */
+    private semanticMerge;
+    /**
+     * Finalize chunk from atoms
+     */
+    private finalizeChunk;
+    /**
+     * Calculate topic volatility (simplified - uses lexical changes)
+     */
+    private calculateVolatility;
+    /**
+     * Apply smart overlap between chunks
+     */
+    private applySmartOverlap;
+    /**
+     * Add role markers to text
+     */
+    private addRoleMarkers;
+    /**
+     * Generate simple header (synchronous version)
+     */
+    private generateSimpleHeader;
+    /**
+     * Extract facts from text (dates, numbers, key entities)
+     */
+    private extractFacts;
+    /**
+     * Strip noise from text
+     */
+    private stripNoise;
+    /**
+     * Compute lexical similarity (Jaccard similarity on words)
+     */
+    private computeLexicalSimilarity;
+    /**
+     * Split text into sentences
+     */
+    private splitIntoSentences;
+    /**
+     * Estimate token count using accurate tokenizer
+     */
+    private estimateTokens;
+    /**
+     * Split an oversized atom (turn, paragraph, or sentence)
+     */
+    private splitOversizedAtom;
+    /**
+     * Split an oversized chunk using simple recursive splitting
+     */
+    private splitOversizedChunk;
+}
+export {};
+//# sourceMappingURL=semantic.d.ts.map

package/dist/src/chunking/strategies/semantic.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic.d.ts","sourceRoot":"","sources":["../../../../src/chunking/strategies/semantic.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,KAAK,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC;AACzE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAYrD,UAAU,WAAW;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;CACjB;AASD,MAAM,WAAW,uBAAwB,SAAQ,eAAe;IAE9D,iBAAiB,CAAC,EAAE,iBAAiB,CAAC;IAGtC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IAGnB,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAG7B,WAAW,CAAC,EAAE,cAAc,GAAG,MAAM,CAAC;IAGtC,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,YAAY,CAAC,EAAE,OAAO,CAAC;IAGvB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAG1B,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,WAAW,CAAC,CAAC;IAGzD,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IAGzB,cAAc,CAAC,EAAE,OAAO,CAAC;CAC1B;AAED,qBAAa,wBAAyB,YAAW,gBAAgB;IAC/D,OAAO,IAAI,MAAM;IAIjB,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,GAAG,KAAK,EAAE;IAmI1E;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAsBzB;;OAEG;IACH,OAAO,CAAC,UAAU;IAalB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAwE3B;;OAEG;IACH,OAAO,CAAC,WAAW;IAuCnB;;OAEG;IACH,OAAO,CAAC,aAAa;IA6GrB;;OAEG;IACH,OAAO,CAAC,aAAa;IAqBrB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAY3B;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAuCzB;;OAEG;IACH,OAAO,CAAC,cAAc;IAWtB;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAW5B;;OAEG;IACH,OAAO,CAAC,YAAY;IAqBpB;;OAEG;IACH,OAAO,CAAC,UAAU;IAoBlB;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAwBhC;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAS1B;;OAEG;IACH,OAAO,CAAC,cAAc;IAItB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IA0C1B;;OAEG;IACH,OAAO,CAAC,mBAAmB;CAoD5B"}