modular-studio 0.2.0

package/dist-server/server/services/memoryScorer.js

@@ -0,0 +1,147 @@
+export function scoreFact(fact, query, now) {
+    const currentTime = now ?? Date.now();
+    // Calculate relevance based on keyword overlap
+    const factWords = fact.value.toLowerCase().split(/\W+/).filter(word => word.length > 2);
+    const queryWords = query.toLowerCase().split(/\W+/).filter(word => word.length > 2);
+    if (queryWords.length === 0)
+        return 0;
+    const intersection = factWords.filter(word => queryWords.includes(word));
+    const union = new Set([...factWords, ...queryWords]);
+    const relevance = intersection.length / union.size;
+    // Calculate recency score (0.99^hours)
+    const hoursAgo = (currentTime - (fact.created_at ?? currentTime)) / (1000 * 60 * 60);
+    const recency = Math.pow(0.99, hoursAgo);
+    // Use importance or default to confidence * 0.8
+    const importance = fact.importance ?? fact.confidence * 0.8;
+    return relevance + 0.5 * recency + 0.5 * importance;
+}
+export function rankFacts(facts, query, limit, now) {
+    const currentTime = now ?? Date.now();
+    // Score all facts
+    const scoredFacts = facts.map(fact => ({
+        ...fact,
+        score: scoreFact(fact, query, currentTime)
+    }));
+    // Sort by score descending
+    scoredFacts.sort((a, b) => b.score - a.score);
+    // Apply limit if specified
+    const topFacts = limit ? scoredFacts.slice(0, limit) : scoredFacts;
+    // Update accessed_at and access_count for returned facts
+    topFacts.forEach(fact => {
+        fact.accessed_at = currentTime;
+        fact.access_count = (fact.access_count ?? 0) + 1;
+    });
+    return topFacts;
+}
+export function computeStrength(fact, now) {
+    const currentTime = now ?? Date.now();
+    // Use importance or default to confidence * 0.8
+    const importance = fact.importance ?? fact.confidence * 0.8;
+    // Calculate half-life based on access count
+    const accessCount = fact.access_count ?? 0;
+    const halfLife = 30 * (1 + Math.log2(1 + accessCount)); // days
+    // Calculate days since creation
+    const daysSince = (currentTime - (fact.created_at ?? currentTime)) / (1000 * 60 * 60 * 24);
+    // Exponential decay: importance * exp(-days / halfLife)
+    return importance * Math.exp(-daysSince / halfLife);
+}
+export function textSimilarity(a, b) {
+    // Get word tokens, filter length > 2
+    const wordsA = a.toLowerCase().split(/\W+/).filter(word => word.length > 2);
+    const wordsB = b.toLowerCase().split(/\W+/).filter(word => word.length > 2);
+    if (wordsA.length === 0 && wordsB.length === 0)
+        return 1;
+    if (wordsA.length === 0 || wordsB.length === 0)
+        return 0;
+    // Calculate Jaccard similarity
+    const setA = new Set(wordsA);
+    const setB = new Set(wordsB);
+    const intersection = new Set([...setA].filter(x => setB.has(x)));
+    const union = new Set([...setA, ...setB]);
+    return intersection.size / union.size;
+}
+export function consolidateMemory(facts, now) {
+    const currentTime = now ?? Date.now();
+    const result = {
+        kept: [],
+        pruned: [],
+        merged: [],
+        promoted: []
+    };
+    // Step 1: Prune facts with strength < 0.05
+    const strongFacts = facts.filter(fact => {
+        const strength = computeStrength(fact, currentTime);
+        if (strength < 0.05) {
+            result.pruned.push(fact);
+            return false;
+        }
+        return true;
+    });
+    // Step 2: Group similar facts for merging
+    const processed = new Set();
+    const mergeGroups = [];
+    for (const fact of strongFacts) {
+        if (processed.has(fact.key))
+            continue;
+        const group = [fact];
+        processed.add(fact.key);
+        for (const other of strongFacts) {
+            if (processed.has(other.key))
+                continue;
+            const similarity = textSimilarity(fact.value, other.value);
+            if (similarity > 0.7) {
+                group.push(other);
+                processed.add(other.key);
+            }
+        }
+        mergeGroups.push(group);
+    }
+    // Step 3: Process merge groups
+    for (const group of mergeGroups) {
+        if (group.length === 1) {
+            // Single fact - check for promotion
+            const fact = group[0];
+            if (fact.epistemicType === 'hypothesis' &&
+                (fact.access_count ?? 0) > 3 &&
+                fact.confidence > 0.7) {
+                // Promote hypothesis to observation
+                const promoted = {
+                    ...fact,
+                    epistemicType: 'observation',
+                    confidence: Math.min(0.95, fact.confidence + 0.1)
+                };
+                result.promoted.push(promoted);
+                result.kept.push(promoted);
+            }
+            else {
+                result.kept.push(fact);
+            }
+        }
+        else {
+            // Multiple facts - merge them
+            // Keep the strongest fact as the merged result
+            const strongest = group.reduce((best, current) => {
+                const bestStrength = computeStrength(best, currentTime);
+                const currentStrength = computeStrength(current, currentTime);
+                return currentStrength > bestStrength ? current : best;
+            });
+            // Update the strongest fact with combined data
+            const totalAccessCount = group.reduce((sum, fact) => sum + (fact.access_count ?? 0), 0);
+            const avgConfidence = group.reduce((sum, fact) => sum + fact.confidence, 0) / group.length;
+            const mostRecentAccess = Math.max(...group.map(fact => fact.accessed_at ?? 0));
+            const merged = {
+                ...strongest,
+                confidence: Math.min(0.95, avgConfidence + 0.05 * (group.length - 1)),
+                access_count: Math.max(strongest.access_count ?? 0, totalAccessCount),
+                accessed_at: mostRecentAccess
+            };
+            result.merged.push({
+                merged,
+                from: group
+            });
+            result.kept.push(merged);
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=memoryScorer.js.map

package/dist-server/server/services/memoryScorer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoryScorer.js","sourceRoot":"","sources":["../../../server/services/memoryScorer.ts"],"names":[],"mappings":"AAMA,MAAM,UAAU,SAAS,CAAC,IAAmB,EAAE,KAAa,EAAE,GAAY;IACxE,MAAM,WAAW,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IAEtC,+CAA+C;IAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACxF,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEpF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtC,MAAM,YAAY,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IACzE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC;IACrD,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC;IAEnD,uCAAuC;IACvC,MAAM,QAAQ,GAAG,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,UAAU,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IACrF,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAEzC,gDAAgD;IAChD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;IAE5D,OAAO,SAAS,GAAG,GAAG,GAAG,OAAO,GAAG,GAAG,GAAG,UAAU,CAAC;AACtD,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,KAAsB,EAAE,KAAa,EAAE,KAAc,EAAE,GAAY;IAC3F,MAAM,WAAW,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IAEtC,kBAAkB;IAClB,MAAM,WAAW,GAAiB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnD,GAAG,IAAI;QACP,KAAK,EAAE,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,WAAW,CAAC;KAC3C,CAAC,CAAC,CAAC;IAEJ,2BAA2B;IAC3B,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAE9C,2BAA2B;IAC3B,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;IAEnE,yDAAyD;IACzD,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACtB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,YAAY,GAAG,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,IAAmB,EAAE,GAAY;IAC/D,MAAM,WAAW,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IAEtC,gDAAgD;IAChD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;IAE5D,4CAA4C;IAC5C,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC;IAC3C,MAAM,QAAQ,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,OAAO;IAE/D,gCAAgC;IAChC,MAAM,SAAS,GAAG,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,UAAU,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAE3F,wDAAwD;IACxD,OAAO,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,QAAQ,CAAC,CAAC;AACtD,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,CAAS,EAAE,CAAS;IACjD,qCAAqC;IACrC,MAAM,MAAM,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5E,MAAM,MAAM,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE5E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEzD,+BAA+B;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAE7B,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;IAE1C,OAAO,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;AACxC,CAAC;AASD,MAAM,UAAU,iBAAiB,CAAC,KAAsB,EAAE,GAAY;IACpE,MAAM,WAAW,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IACtC,MAAM,MAAM,GAAwB;QAClC,IAAI,EAAE,EAAE;QACR,MAAM,EAAE,EAAE;QACV,MAAM,EAAE,EAAE;QACV,QAAQ,EAAE,EAAE;KACb,CAAC;IAEF,2CAA2C;IAC3C,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;QACtC,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QACpD,IAAI,QAAQ,GAAG,IAAI,EAAE,CAAC;YACpB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,0CAA0C;IAC1C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,WAAW,GAAsB,EAAE,CAAC;IAE1C,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,SAAS;QAEtC,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;QACrB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAExB,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;YAChC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;gBAAE,SAAS;YAEvC,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YAC3D,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAClB,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,+BAA+B;IAC/B,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,oCAAoC;YACpC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,IAAI,CAAC,aAAa,KAAK,YAAY;gBACnC,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC,GAAG,CAAC;gBAC5B,IAAI,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;gBAC1B,oCAAoC;gBACpC,MAAM,QAAQ,GAAG;oBACf,GAAG,IAAI;oBACP,aAAa,EAAE,aAAsB;oBACrC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;iBAClD,CAAC;gBACF,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC/B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,8BAA8B;YAC9B,+CAA+C;YAC/C,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE;gBAC/C,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;gBACxD,MAAM,eAAe,GAAG,eAAe,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;gBAC9D,OAAO,eAAe,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;YACzD,CAAC,CAAC,CAAC;YAEH,+CAA+C;YAC/C,MAAM,gBAAgB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxF,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;YAC3F,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC;YAE/E,MAAM,MAAM,GAAG;gBACb,GAAG,SAAS;gBACZ,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,aAAa,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBACrE,YAAY,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,YAAY,IAAI,CAAC,EAAE,gBAAgB,CAAC;gBACrE,WAAW,EAAE,gBAAgB;aAC9B,CAAC;YAEF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;gBACjB,MAAM;gBACN,IAAI,EAAE,KAAK;aACZ,CAAC,CAAC;YACH,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist-server/server/services/repoIndexer.d.ts

@@ -0,0 +1,91 @@
+/**
+ * Repository Indexer
+ *
+ * Analyzes a codebase and generates a structured markdown knowledge base
+ * optimized for tree indexing and depth filtering.
+ *
+ * Unlike Aider's repo map (AST → symbol list) or Autodoc (per-file LLM docs),
+ * this generates FEATURE-LEVEL and FLOW-LEVEL documentation that answers:
+ * - What does this feature do?
+ * - Where does it live (key files)?
+ * - How does data flow through it?
+ * - What patterns/conventions does it follow?
+ * - What are the edge cases and gotchas?
+ *
+ * Output: markdown files with heading structure that maps to depth levels:
+ *   # Feature name         → Mention (depth 4)
+ *   ## Architecture         → Headlines (depth 3)
+ *   ### Data flow details   → Summary (depth 2)
+ *   Paragraphs              → Detail (depth 1) / Full (depth 0)
+ *
+ * Pipeline: scan → analyze → cluster → generate → index
+ */
+export interface RepoFile {
+    path: string;
+    ext: string;
+    size: number;
+    tokens: number;
+    category: FileCategory;
+    imports: string[];
+    exports: string[];
+    functions: string[];
+    classes: string[];
+    types: string[];
+}
+export type FileCategory = 'component' | 'store' | 'service' | 'util' | 'route' | 'config' | 'test' | 'type' | 'style' | 'doc' | 'script' | 'other';
+export interface RepoModule {
+    name: string;
+    path: string;
+    files: RepoFile[];
+    entryPoint?: string;
+    description?: string;
+}
+export interface RepoFeature {
+    name: string;
+    description: string;
+    modules: string[];
+    keyFiles: string[];
+    stores: string[];
+    routes: string[];
+    components: string[];
+    imports: Map<string, string[]>;
+}
+export interface RepoScan {
+    root: string;
+    name: string;
+    files: RepoFile[];
+    modules: RepoModule[];
+    features: RepoFeature[];
+    conventions: RepoConvention[];
+    stack: StackInfo;
+    totalFiles: number;
+    totalTokens: number;
+}
+export interface RepoConvention {
+    pattern: string;
+    description: string;
+    examples: string[];
+}
+export interface StackInfo {
+    language: string;
+    framework: string;
+    stateManagement: string;
+    styling: string;
+    testing: string;
+    buildTool: string;
+    packageManager: string;
+}
+export declare function scanRepository(root: string): RepoScan;
+/**
+ * Generate the overview document for the repository.
+ */
+export declare function generateOverviewDoc(scan: RepoScan): string;
+/**
+ * Generate a detailed feature document.
+ */
+export declare function generateFeatureDoc(scan: RepoScan, feature: RepoFeature): string;
+/**
+ * Generate the full knowledge base as a map of filename → markdown content.
+ */
+export declare function generateKnowledgeBase(scan: RepoScan): Map<string, string>;
+//# sourceMappingURL=repoIndexer.d.ts.map

package/dist-server/server/services/repoIndexer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"repoIndexer.d.ts","sourceRoot":"","sources":["../../../server/services/repoIndexer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAOH,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,YAAY,CAAC;IACvB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED,MAAM,MAAM,YAAY,GACpB,WAAW,GACX,OAAO,GACP,SAAS,GACT,MAAM,GACN,OAAO,GACP,QAAQ,GACR,MAAM,GACN,MAAM,GACN,OAAO,GACP,KAAK,GACL,QAAQ,GACR,OAAO,CAAC;AAEZ,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;CAChC;AAED,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,WAAW,EAAE,cAAc,EAAE,CAAC;IAC9B,KAAK,EAAE,SAAS,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,EAAE,MAAM,CAAC;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,MAAM,CAAC;CACxB;AA6RD,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,CAoErD;AAID;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAsD1D;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,WAAW,GAAG,MAAM,CA+D/E;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,QAAQ,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAezE"}