@miller-tech/uap 1.5.4 → 1.5.6

package/dist/memory/active-context.d.ts

@@ -0,0 +1,65 @@
+/**
+ * Active Context Module for UAP
+ *
+ * Implements context-aware memory management with automatic activation/deactivation
+ * based on relevance scoring and temporal proximity.
+ */
+export interface ActiveContextConfig {
+    maxActiveEntries: number;
+    relevanceThreshold: number;
+    decayRate: number;
+    activationWindow: number;
+}
+export interface ActiveEntry {
+    id: string;
+    content: string;
+    relevance: number;
+    lastActive: Date;
+    accessCount: number;
+}
+/**
+ * Active Context Manager
+ * Manages a set of active memory entries based on relevance and recency
+ */
+export declare class ActiveContextManager {
+    private config;
+    private entries;
+    constructor(config?: Partial<ActiveContextConfig>);
+    /**
+     * Add or update an entry in active context
+     */
+    activate(id: string, content: string, relevance: number): ActiveEntry;
+    /**
+     * Deactivate an entry (remove from active context)
+     */
+    deactivate(id: string): boolean;
+    /**
+     * Get all active entries sorted by relevance
+     */
+    getActiveEntries(limit?: number): ActiveEntry[];
+    /**
+     * Check if an entry is active
+     */
+    isActive(id: string): boolean;
+    /**
+     * Get relevance score for an entry
+     */
+    getRelevance(id: string): number | null;
+    /**
+     * Decay relevance scores over time
+     */
+    decay(): void;
+    /**
+     * Rebalance entries to maintain max size
+     */
+    private rebalance;
+    /**
+     * Clear all active entries
+     */
+    clear(): void;
+    /**
+     * Get count of active entries
+     */
+    getCount(): number;
+}
+//# sourceMappingURL=active-context.d.ts.map

package/dist/memory/active-context.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"active-context.d.ts","sourceRoot":"","sources":["../../src/memory/active-context.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,mBAAmB;IAClC,gBAAgB,EAAE,MAAM,CAAC;IACzB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AASD,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,IAAI,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;;GAGG;AACH,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,MAAM,CAAsB;IACpC,OAAO,CAAC,OAAO,CAAuC;gBAE1C,MAAM,GAAE,OAAO,CAAC,mBAAmB,CAAM;IAIrD;;OAEG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,WAAW;IA0BrE;;OAEG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI/B;;OAEG;IACH,gBAAgB,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,WAAW,EAAE;IAM/C;;OAEG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI7B;;OAEG;IACH,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAKvC;;OAEG;IACH,KAAK,IAAI,IAAI;IAmBb;;OAEG;IACH,OAAO,CAAC,SAAS;IAmBjB;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,QAAQ,IAAI,MAAM;CAGnB"}

package/dist/memory/active-context.js

@@ -0,0 +1,126 @@
+/**
+ * Active Context Module for UAP
+ *
+ * Implements context-aware memory management with automatic activation/deactivation
+ * based on relevance scoring and temporal proximity.
+ */
+const DEFAULT_CONFIG = {
+    maxActiveEntries: 20,
+    relevanceThreshold: 0.6,
+    decayRate: 0.95,
+    activationWindow: 24,
+};
+/**
+ * Active Context Manager
+ * Manages a set of active memory entries based on relevance and recency
+ */
+export class ActiveContextManager {
+    config;
+    entries = new Map();
+    constructor(config = {}) {
+        this.config = { ...DEFAULT_CONFIG, ...config };
+    }
+    /**
+     * Add or update an entry in active context
+     */
+    activate(id, content, relevance) {
+        const now = new Date();
+        let entry;
+        if (this.entries.has(id)) {
+            entry = this.entries.get(id);
+            entry.content = content;
+            entry.relevance = relevance;
+            entry.accessCount++;
+        }
+        else {
+            entry = {
+                id,
+                content,
+                relevance,
+                lastActive: now,
+                accessCount: 1,
+            };
+            this.entries.set(id, entry);
+        }
+        // Rebalance active entries
+        this.rebalance();
+        return entry;
+    }
+    /**
+     * Deactivate an entry (remove from active context)
+     */
+    deactivate(id) {
+        return this.entries.delete(id);
+    }
+    /**
+     * Get all active entries sorted by relevance
+     */
+    getActiveEntries(limit) {
+        const entries = Array.from(this.entries.values());
+        entries.sort((a, b) => b.relevance - a.relevance);
+        return limit ? entries.slice(0, limit) : entries;
+    }
+    /**
+     * Check if an entry is active
+     */
+    isActive(id) {
+        return this.entries.has(id);
+    }
+    /**
+     * Get relevance score for an entry
+     */
+    getRelevance(id) {
+        const entry = this.entries.get(id);
+        return entry ? entry.relevance : null;
+    }
+    /**
+     * Decay relevance scores over time
+     */
+    decay() {
+        const now = Date.now();
+        const windowMs = this.config.activationWindow * 60 * 60 * 1000;
+        for (const [id, entry] of this.entries) {
+            const age = now - entry.lastActive.getTime();
+            // Decay based on age
+            if (age > windowMs) {
+                entry.relevance *= Math.pow(this.config.decayRate, age / (1000 * 60 * 60));
+                // Auto-deactivate if relevance drops below threshold
+                if (entry.relevance < this.config.relevanceThreshold) {
+                    this.entries.delete(id);
+                }
+            }
+        }
+    }
+    /**
+     * Rebalance entries to maintain max size
+     */
+    rebalance() {
+        const entries = Array.from(this.entries.values());
+        if (entries.length > this.config.maxActiveEntries) {
+            // Sort by relevance and access count
+            entries.sort((a, b) => {
+                const scoreA = a.relevance * 0.7 + (a.accessCount / Math.max(1, a.accessCount)) * 0.3;
+                const scoreB = b.relevance * 0.7 + (b.accessCount / Math.max(1, b.accessCount)) * 0.3;
+                return scoreA - scoreB;
+            });
+            // Remove lowest relevance entries
+            const toRemove = entries.slice(0, entries.length - this.config.maxActiveEntries);
+            for (const entry of toRemove) {
+                this.entries.delete(entry.id);
+            }
+        }
+    }
+    /**
+     * Clear all active entries
+     */
+    clear() {
+        this.entries.clear();
+    }
+    /**
+     * Get count of active entries
+     */
+    getCount() {
+        return this.entries.size;
+    }
+}
+//# sourceMappingURL=active-context.js.map

package/dist/memory/active-context.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"active-context.js","sourceRoot":"","sources":["../../src/memory/active-context.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AASH,MAAM,cAAc,GAAwB;IAC1C,gBAAgB,EAAE,EAAE;IACpB,kBAAkB,EAAE,GAAG;IACvB,SAAS,EAAE,IAAI;IACf,gBAAgB,EAAE,EAAE;CACrB,CAAC;AAUF;;;GAGG;AACH,MAAM,OAAO,oBAAoB;IACvB,MAAM,CAAsB;IAC5B,OAAO,GAA6B,IAAI,GAAG,EAAE,CAAC;IAEtD,YAAY,SAAuC,EAAE;QACnD,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,EAAU,EAAE,OAAe,EAAE,SAAiB;QACrD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QAEvB,IAAI,KAAkB,CAAC;QACvB,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAC9B,KAAK,CAAC,OAAO,GAAG,OAAO,CAAC;YACxB,KAAK,CAAC,SAAS,GAAG,SAAS,CAAC;YAC5B,KAAK,CAAC,WAAW,EAAE,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,KAAK,GAAG;gBACN,EAAE;gBACF,OAAO;gBACP,SAAS;gBACT,UAAU,EAAE,GAAG;gBACf,WAAW,EAAE,CAAC;aACf,CAAC;YACF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC9B,CAAC;QAED,2BAA2B;QAC3B,IAAI,CAAC,SAAS,EAAE,CAAC;QAEjB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,EAAU;QACnB,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,KAAc;QAC7B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAClD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QAClD,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;IACnD,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,EAAU;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,EAAU;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;QAE/D,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,MAAM,GAAG,GAAG,GAAG,GAAG,KAAK,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;YAE7C,qBAAqB;YACrB,IAAI,GAAG,GAAG,QAAQ,EAAE,CAAC;gBACnB,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,GAAG,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;gBAE3E,qDAAqD;gBACrD,IAAI,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE,CAAC;oBACrD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,SAAS;QACf,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAElD,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAClD,qCAAqC;YACrC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACpB,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,GAAG,CAAC;gBACtF,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,GAAG,CAAC;gBACtF,OAAO,MAAM,GAAG,MAAM,CAAC;YACzB,CAAC,CAAC,CAAC;YAEH,kCAAkC;YAClC,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;YACjF,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC7B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;CACF"}

package/dist/memory/dedup-detector.d.ts

@@ -0,0 +1,57 @@
+/**
+ * Dedup Detector Module for UAP
+ *
+ * Detects duplicate and near-duplicate content in memory entries.
+ */
+export interface MemoryEntry {
+    id: string;
+    content: string;
+    type: string;
+    timestamp: string;
+}
+export interface DuplicateResult {
+    primaryId: string;
+    duplicateIds: string[];
+    similarity: number;
+}
+export interface DedupDetectorConfig {
+    similarityThreshold: number;
+    minContentLength: number;
+    exactMatch: boolean;
+}
+/**
+ * Dedup Detector
+ * Detects duplicate content in memory entries
+ */
+export declare class DedupDetector {
+    private config;
+    constructor(config?: Partial<DedupDetectorConfig>);
+    /**
+     * Detect duplicates in a batch of entries
+     */
+    detectDuplicates(entries: MemoryEntry[]): DuplicateResult[];
+    /**
+     * Check if two pieces of content are duplicates
+     */
+    isDuplicate(content1: string, content2: string): boolean;
+    /**
+     * Compute similarity between two contents
+     */
+    computeSimilarity(content1: string, content2: string): number;
+    /**
+     * Find the most similar entry to a query
+     */
+    findMostSimilar(query: string, entries: MemoryEntry[]): {
+        id: string;
+        similarity: number;
+    } | null;
+    /**
+     * Get duplicate statistics
+     */
+    getStats(entries: MemoryEntry[]): {
+        totalEntries: number;
+        duplicatesFound: number;
+        uniqueEntries: number;
+    };
+}
+//# sourceMappingURL=dedup-detector.d.ts.map

package/dist/memory/dedup-detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dedup-detector.d.ts","sourceRoot":"","sources":["../../src/memory/dedup-detector.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,mBAAmB;IAClC,mBAAmB,EAAE,MAAM,CAAC;IAC5B,gBAAgB,EAAE,MAAM,CAAC;IACzB,UAAU,EAAE,OAAO,CAAC;CACrB;AAQD;;;GAGG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,MAAM,CAAsB;gBAExB,MAAM,GAAE,OAAO,CAAC,mBAAmB,CAAM;IAIrD;;OAEG;IACH,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,GAAG,eAAe,EAAE;IAkC3D;;OAEG;IACH,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;IAmBxD;;OAEG;IACH,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM;IAI7D;;OAEG;IACH,eAAe,CACb,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,WAAW,EAAE,GACrB;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI;IAiB5C;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,WAAW,EAAE,GAAG;QAChC,YAAY,EAAE,MAAM,CAAC;QACrB,eAAe,EAAE,MAAM,CAAC;QACxB,aAAa,EAAE,MAAM,CAAC;KACvB;CAcF"}

package/dist/memory/dedup-detector.js

@@ -0,0 +1,107 @@
+/**
+ * Dedup Detector Module for UAP
+ *
+ * Detects duplicate and near-duplicate content in memory entries.
+ */
+import { jaccardSimilarity } from '../utils/string-similarity.js';
+const DEFAULT_CONFIG = {
+    similarityThreshold: 0.85,
+    minContentLength: 20,
+    exactMatch: true,
+};
+/**
+ * Dedup Detector
+ * Detects duplicate content in memory entries
+ */
+export class DedupDetector {
+    config;
+    constructor(config = {}) {
+        this.config = { ...DEFAULT_CONFIG, ...config };
+    }
+    /**
+     * Detect duplicates in a batch of entries
+     */
+    detectDuplicates(entries) {
+        const results = [];
+        const processed = new Set();
+        for (let i = 0; i < entries.length; i++) {
+            if (processed.has(entries[i].id))
+                continue;
+            const primary = entries[i];
+            const duplicates = [];
+            for (let j = i + 1; j < entries.length; j++) {
+                const other = entries[j];
+                if (this.isDuplicate(primary.content, other.content)) {
+                    duplicates.push(other.id);
+                    processed.add(other.id);
+                }
+            }
+            if (duplicates.length > 0) {
+                const dupEntry = entries.find((e) => e.id === duplicates[0]);
+                results.push({
+                    primaryId: primary.id,
+                    duplicateIds: duplicates,
+                    similarity: this.computeSimilarity(primary.content, dupEntry.content),
+                });
+            }
+            processed.add(primary.id);
+        }
+        return results;
+    }
+    /**
+     * Check if two pieces of content are duplicates
+     */
+    isDuplicate(content1, content2) {
+        // Exact match
+        if (this.config.exactMatch && content1 === content2) {
+            return true;
+        }
+        // Length check
+        if (content1.length < this.config.minContentLength ||
+            content2.length < this.config.minContentLength) {
+            return false;
+        }
+        // Similarity check
+        const similarity = jaccardSimilarity(content1, content2);
+        return similarity >= this.config.similarityThreshold;
+    }
+    /**
+     * Compute similarity between two contents
+     */
+    computeSimilarity(content1, content2) {
+        return jaccardSimilarity(content1, content2);
+    }
+    /**
+     * Find the most similar entry to a query
+     */
+    findMostSimilar(query, entries) {
+        let bestId = null;
+        let bestSimilarity = 0;
+        for (const entry of entries) {
+            const similarity = this.computeSimilarity(query, entry.content);
+            if (similarity > bestSimilarity) {
+                bestSimilarity = similarity;
+                bestId = entry.id;
+            }
+        }
+        return bestSimilarity >= this.config.similarityThreshold
+            ? { id: bestId, similarity: bestSimilarity }
+            : null;
+    }
+    /**
+     * Get duplicate statistics
+     */
+    getStats(entries) {
+        const duplicates = this.detectDuplicates(entries);
+        let totalDuplicates = 0;
+        for (const dup of duplicates) {
+            totalDuplicates += dup.duplicateIds.length;
+        }
+        return {
+            totalEntries: entries.length,
+            duplicatesFound: totalDuplicates,
+            uniqueEntries: entries.length - totalDuplicates,
+        };
+    }
+}
+//# sourceMappingURL=dedup-detector.js.map

package/dist/memory/dedup-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dedup-detector.js","sourceRoot":"","sources":["../../src/memory/dedup-detector.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAqBlE,MAAM,cAAc,GAAwB;IAC1C,mBAAmB,EAAE,IAAI;IACzB,gBAAgB,EAAE,EAAE;IACpB,UAAU,EAAE,IAAI;CACjB,CAAC;AAEF;;;GAGG;AACH,MAAM,OAAO,aAAa;IAChB,MAAM,CAAsB;IAEpC,YAAY,SAAuC,EAAE;QACnD,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,OAAsB;QACrC,MAAM,OAAO,GAAsB,EAAE,CAAC;QACtC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YAE3C,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,UAAU,GAAa,EAAE,CAAC;YAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBAEzB,IAAI,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;oBACrD,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBAC1B,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;YAED,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC,CAAC,CAAE,CAAC;gBAC9D,OAAO,CAAC,IAAI,CAAC;oBACX,SAAS,EAAE,OAAO,CAAC,EAAE;oBACrB,YAAY,EAAE,UAAU;oBACxB,UAAU,EAAE,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC;iBACtE,CAAC,CAAC;YACL,CAAC;YAED,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC5B,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,QAAgB,EAAE,QAAgB;QAC5C,cAAc;QACd,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;YACpD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,eAAe;QACf,IACE,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB;YAC9C,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAC9C,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,mBAAmB;QACnB,MAAM,UAAU,GAAG,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACzD,OAAO,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC;IACvD,CAAC;IAED;;OAEG;IACH,iBAAiB,CAAC,QAAgB,EAAE,QAAgB;QAClD,OAAO,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,eAAe,CACb,KAAa,EACb,OAAsB;QAEtB,IAAI,MAAM,GAAkB,IAAI,CAAC;QACjC,IAAI,cAAc,GAAG,CAAC,CAAC;QAEvB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YAChE,IAAI,UAAU,GAAG,cAAc,EAAE,CAAC;gBAChC,cAAc,GAAG,UAAU,CAAC;gBAC5B,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC;YACpB,CAAC;QACH,CAAC;QAED,OAAO,cAAc,IAAI,IAAI,CAAC,MAAM,CAAC,mBAAmB;YACtD,CAAC,CAAC,EAAE,EAAE,EAAE,MAAO,EAAE,UAAU,EAAE,cAAc,EAAE;YAC7C,CAAC,CAAC,IAAI,CAAC;IACX,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,OAAsB;QAK7B,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,eAAe,GAAG,CAAC,CAAC;QAExB,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,eAAe,IAAI,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC;QAC7C,CAAC;QAED,OAAO;YACL,YAAY,EAAE,OAAO,CAAC,MAAM;YAC5B,eAAe,EAAE,eAAe;YAChC,aAAa,EAAE,OAAO,CAAC,MAAM,GAAG,eAAe;SAChD,CAAC;IACJ,CAAC;CACF"}

package/dist/memory/dedup-memory.d.ts

@@ -0,0 +1,89 @@
+/**
+ * Deduplicated Memory Module for UAP
+ *
+ * Implements memory deduplication using content hashing and similarity detection.
+ * Prevents redundant memory entries and maintains memory efficiency.
+ */
+export interface MemoryEntry {
+    id: string;
+    content: string;
+    type: string;
+    timestamp: string;
+    importance?: number;
+}
+export interface DedupConfig {
+    similarityThreshold: number;
+    minContentLength: number;
+    hashAlgorithm: 'jaccard' | 'cosine' | 'exact';
+    maxSimilarityWindow: number;
+}
+/**
+ * Deduplicated Memory Manager
+ * Prevents duplicate memory entries through content hashing and similarity detection
+ */
+export declare class DeduplicatedMemory {
+    private config;
+    private memory;
+    private contentIndex;
+    constructor(config?: Partial<DedupConfig>);
+    /**
+     * Add a memory entry, checking for duplicates
+     */
+    add(entry: MemoryEntry): {
+        id: string;
+        isNew: boolean;
+        duplicateOf?: string;
+    };
+    /**
+     * Get a memory entry by ID
+     */
+    get(id: string): MemoryEntry | null;
+    /**
+     * Update an existing entry
+     */
+    update(id: string, content: string): boolean;
+    /**
+     * Delete a memory entry
+     */
+    delete(id: string): boolean;
+    /**
+     * Get all entries
+     */
+    getAll(): MemoryEntry[];
+    /**
+     * Query entries by content (returns most similar)
+     */
+    query(query: string, limit?: number): Array<{
+        entry: MemoryEntry;
+        similarity: number;
+    }>;
+    /**
+     * Get statistics
+     */
+    getStats(): {
+        totalEntries: number;
+        uniqueContent: number;
+        duplicatesPrevented: number;
+    };
+    /**
+     * Clear all memory
+     */
+    clear(): void;
+    /**
+     * Compute content hash (simple approach)
+     */
+    private computeHash;
+    /**
+     * Compute similarity between two texts
+     */
+    private computeSimilarity;
+    /**
+     * Find similar content in memory
+     */
+    private findSimilarContent;
+    /**
+     * Update content index
+     */
+    private updateIndex;
+}
+//# sourceMappingURL=dedup-memory.d.ts.map

package/dist/memory/dedup-memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dedup-memory.d.ts","sourceRoot":"","sources":["../../src/memory/dedup-memory.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,WAAW;IAC1B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,SAAS,GAAG,QAAQ,GAAG,OAAO,CAAC;IAC9C,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AASD;;;GAGG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,MAAM,CAAc;IAC5B,OAAO,CAAC,MAAM,CAAuC;IACrD,OAAO,CAAC,YAAY,CAAoC;gBAE5C,MAAM,GAAE,OAAO,CAAC,WAAW,CAAM;IAI7C;;OAEG;IACH,GAAG,CAAC,KAAK,EAAE,WAAW,GAAG;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE;IAkC7E;;OAEG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI;IAInC;;OAEG;IACH,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO;IAgB5C;;OAEG;IACH,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAQ3B;;OAEG;IACH,MAAM,IAAI,WAAW,EAAE;IAIvB;;OAEG;IACH,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,GAAE,MAAU,GAAG,KAAK,CAAC;QAAE,KAAK,EAAE,WAAW,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC;IAc1F;;OAEG;IACH,QAAQ,IAAI;QACV,YAAY,EAAE,MAAM,CAAC;QACrB,aAAa,EAAE,MAAM,CAAC;QACtB,mBAAmB,EAAE,MAAM,CAAC;KAC7B;IAQD;;OAEG;IACH,KAAK,IAAI,IAAI;IAKb;;OAEG;IACH,OAAO,CAAC,WAAW;IAWnB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAYzB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAa1B;;OAEG;IACH,OAAO,CAAC,WAAW;CAMpB"}

package/dist/memory/dedup-memory.js

@@ -0,0 +1,173 @@
+/**
+ * Deduplicated Memory Module for UAP
+ *
+ * Implements memory deduplication using content hashing and similarity detection.
+ * Prevents redundant memory entries and maintains memory efficiency.
+ */
+import { jaccardSimilarity } from '../utils/string-similarity.js';
+const DEFAULT_CONFIG = {
+    similarityThreshold: 0.85,
+    minContentLength: 20,
+    hashAlgorithm: 'jaccard',
+    maxSimilarityWindow: 7,
+};
+/**
+ * Deduplicated Memory Manager
+ * Prevents duplicate memory entries through content hashing and similarity detection
+ */
+export class DeduplicatedMemory {
+    config;
+    memory = new Map();
+    contentIndex = new Map(); // hash -> [ids]
+    constructor(config = {}) {
+        this.config = { ...DEFAULT_CONFIG, ...config };
+    }
+    /**
+     * Add a memory entry, checking for duplicates
+     */
+    add(entry) {
+        const hash = this.computeHash(entry.content);
+        // Check if exact duplicate exists
+        if (this.memory.has(hash)) {
+            return {
+                id: hash,
+                isNew: false,
+                duplicateOf: hash,
+            };
+        }
+        // Check for similar content
+        const similarId = this.findSimilarContent(entry.content);
+        if (similarId) {
+            return {
+                id: hash,
+                isNew: false,
+                duplicateOf: similarId,
+            };
+        }
+        // Add new entry
+        const fullEntry = {
+            ...entry,
+            id: hash,
+        };
+        this.memory.set(hash, fullEntry);
+        this.updateIndex(hash, entry.content);
+        return { id: hash, isNew: true };
+    }
+    /**
+     * Get a memory entry by ID
+     */
+    get(id) {
+        return this.memory.get(id) || null;
+    }
+    /**
+     * Update an existing entry
+     */
+    update(id, content) {
+        if (!this.memory.has(id)) {
+            return false;
+        }
+        const entry = this.memory.get(id);
+        entry.content = content;
+        entry.timestamp = new Date().toISOString();
+        // Update index
+        this.contentIndex.delete(entry.id);
+        this.updateIndex(id, content);
+        return true;
+    }
+    /**
+     * Delete a memory entry
+     */
+    delete(id) {
+        const deleted = this.memory.delete(id);
+        if (deleted) {
+            this.contentIndex.delete(id);
+        }
+        return deleted;
+    }
+    /**
+     * Get all entries
+     */
+    getAll() {
+        return Array.from(this.memory.values());
+    }
+    /**
+     * Query entries by content (returns most similar)
+     */
+    query(query, limit = 5) {
+        const results = [];
+        for (const entry of this.memory.values()) {
+            const similarity = this.computeSimilarity(query, entry.content);
+            if (similarity > 0.5) {
+                results.push({ entry, similarity });
+            }
+        }
+        results.sort((a, b) => b.similarity - a.similarity);
+        return results.slice(0, limit);
+    }
+    /**
+     * Get statistics
+     */
+    getStats() {
+        return {
+            totalEntries: this.memory.size,
+            uniqueContent: this.memory.size,
+            duplicatesPrevented: 0, // Would need to track separately
+        };
+    }
+    /**
+     * Clear all memory
+     */
+    clear() {
+        this.memory.clear();
+        this.contentIndex.clear();
+    }
+    /**
+     * Compute content hash (simple approach)
+     */
+    computeHash(content) {
+        // Simple hash - in production, use a proper hashing algorithm
+        let hash = 0;
+        for (let i = 0; i < content.length; i++) {
+            const char = content.charCodeAt(i);
+            hash = (hash << 5) - hash + char;
+            hash = hash & hash; // Convert to 32bit integer
+        }
+        return `mem-${Math.abs(hash).toString(36)}-${Date.now()}`;
+    }
+    /**
+     * Compute similarity between two texts
+     */
+    computeSimilarity(a, b) {
+        if (this.config.hashAlgorithm === 'exact') {
+            return a === b ? 1 : 0;
+        }
+        if (a.length < this.config.minContentLength || b.length < this.config.minContentLength) {
+            return 0;
+        }
+        return jaccardSimilarity(a, b);
+    }
+    /**
+     * Find similar content in memory
+     */
+    findSimilarContent(content) {
+        for (const [id, entry] of this.memory) {
+            if (entry.id === id)
+                continue;
+            const similarity = this.computeSimilarity(content, entry.content);
+            if (similarity >= this.config.similarityThreshold) {
+                return id;
+            }
+        }
+        return null;
+    }
+    /**
+     * Update content index
+     */
+    updateIndex(id, content) {
+        if (!this.contentIndex.has(id)) {
+            this.contentIndex.set(id, []);
+        }
+        this.contentIndex.get(id).push(content);
+    }
+}
+//# sourceMappingURL=dedup-memory.js.map

package/dist/memory/dedup-memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dedup-memory.js","sourceRoot":"","sources":["../../src/memory/dedup-memory.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAiBlE,MAAM,cAAc,GAAgB;IAClC,mBAAmB,EAAE,IAAI;IACzB,gBAAgB,EAAE,EAAE;IACpB,aAAa,EAAE,SAAS;IACxB,mBAAmB,EAAE,CAAC;CACvB,CAAC;AAEF;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IACrB,MAAM,CAAc;IACpB,MAAM,GAA6B,IAAI,GAAG,EAAE,CAAC;IAC7C,YAAY,GAA0B,IAAI,GAAG,EAAE,CAAC,CAAC,gBAAgB;IAEzE,YAAY,SAA+B,EAAE;QAC3C,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,KAAkB;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAE7C,kCAAkC;QAClC,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,OAAO;gBACL,EAAE,EAAE,IAAI;gBACR,KAAK,EAAE,KAAK;gBACZ,WAAW,EAAE,IAAI;aAClB,CAAC;QACJ,CAAC;QAED,4BAA4B;QAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,SAAS,EAAE,CAAC;YACd,OAAO;gBACL,EAAE,EAAE,IAAI;gBACR,KAAK,EAAE,KAAK;gBACZ,WAAW,EAAE,SAAS;aACvB,CAAC;QACJ,CAAC;QAED,gBAAgB;QAChB,MAAM,SAAS,GAAgB;YAC7B,GAAG,KAAK;YACR,EAAE,EAAE,IAAI;SACT,CAAC;QAEF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QACjC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QAEtC,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,EAAU;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,EAAU,EAAE,OAAe;QAChC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QACnC,KAAK,CAAC,OAAO,GAAG,OAAO,CAAC;QACxB,KAAK,CAAC,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAE3C,eAAe;QACf,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAE9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,EAAU;QACf,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvC,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAa,EAAE,QAAgB,CAAC;QACpC,MAAM,OAAO,GAAsD,EAAE,CAAC;QAEtE,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YAChE,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;gBACrB,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QACpD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,QAAQ;QAKN,OAAO;YACL,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;YAC9B,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;YAC/B,mBAAmB,EAAE,CAAC,EAAE,iCAAiC;SAC1D,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,OAAe;QACjC,8DAA8D;QAC9D,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;YACjC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,2BAA2B;QACjD,CAAC;QACD,OAAO,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;IAC5D,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,CAAS,EAAE,CAAS;QAC5C,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,KAAK,OAAO,EAAE,CAAC;YAC1C,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;QAED,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC;YACvF,OAAO,CAAC,CAAC;QACX,CAAC;QAED,OAAO,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,OAAe;QACxC,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACtC,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE;gBAAE,SAAS;YAE9B,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YAClE,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE,CAAC;gBAClD,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,EAAU,EAAE,OAAe;QAC7C,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3C,CAAC;CACF"}