@miller-tech/uap 1.5.4 → 1.5.6

package/dist/memory/merge-claude-md.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Merge Claude MD Module for UAP
+ *
+ * Provides utilities for merging multiple Claude.md knowledge files
+ * into a single consolidated document.
+ */
+export interface ClaudeMD {
+    title: string;
+    content: string;
+    sections: Section[];
+    metadata: Record<string, any>;
+}
+export interface Section {
+    heading: string;
+    level: number;
+    content: string;
+    children: Section[];
+}
+export interface MergeConfig {
+    deduplicate: boolean;
+    dedupThreshold: number;
+    prioritySections: string[];
+    maxSectionLength: number;
+}
+/**
+ * Merge multiple Claude.md files into one
+ */
+export declare function mergeClaudeMDs(files: Array<{
+    name: string;
+    content: string;
+}>, config?: Partial<MergeConfig>): {
+    merged: string;
+    sections: Section[];
+    stats: MergeStats;
+};
+/**
+ * Merge stats interface
+ */
+export interface MergeStats {
+    filesProcessed: number;
+    totalSections: number;
+    duplicatesRemoved: number;
+    finalLength: number;
+}
+//# sourceMappingURL=merge-claude-md.d.ts.map

package/dist/memory/merge-claude-md.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge-claude-md.d.ts","sourceRoot":"","sources":["../../src/memory/merge-claude-md.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,QAAQ;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAC/B;AAED,MAAM,WAAW,OAAO;IACtB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,OAAO,EAAE,CAAC;CACrB;AAED,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,OAAO,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;IACvB,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AASD;;GAEG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC,EAC/C,MAAM,GAAE,OAAO,CAAC,WAAW,CAAM,GAChC;IACD,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,KAAK,EAAE,UAAU,CAAC;CACnB,CAwDA;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,cAAc,EAAE,MAAM,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,WAAW,EAAE,MAAM,CAAC;CACrB"}

package/dist/memory/merge-claude-md.js

@@ -0,0 +1,118 @@
+/**
+ * Merge Claude MD Module for UAP
+ *
+ * Provides utilities for merging multiple Claude.md knowledge files
+ * into a single consolidated document.
+ */
+const DEFAULT_CONFIG = {
+    deduplicate: true,
+    dedupThreshold: 0.85,
+    prioritySections: ['Architecture', 'Setup', 'Configuration', 'Known Issues'],
+    maxSectionLength: 10000,
+};
+/**
+ * Merge multiple Claude.md files into one
+ */
+export function mergeClaudeMDs(files, config = {}) {
+    const cfg = { ...DEFAULT_CONFIG, ...config };
+    const stats = {
+        filesProcessed: files.length,
+        totalSections: 0,
+        duplicatesRemoved: 0,
+        finalLength: 0,
+    };
+    if (files.length === 0) {
+        return {
+            merged: '',
+            sections: [],
+            stats,
+        };
+    }
+    // Parse all files
+    const parsedFiles = files.map((file) => ({
+        name: file.name,
+        sections: parseMarkdown(file.content),
+    }));
+    stats.totalSections = parsedFiles.reduce((sum, f) => sum + f.sections.length, 0);
+    // Merge sections with deduplication
+    const mergedSections = [];
+    const seenContents = new Set();
+    // Sort by priority
+    const sortedFiles = [...parsedFiles].sort((a, b) => {
+        const aPriority = countPrioritySections(a.sections, cfg.prioritySections);
+        const bPriority = countPrioritySections(b.sections, cfg.prioritySections);
+        return bPriority - aPriority;
+    });
+    for (const file of sortedFiles) {
+        for (const section of file.sections) {
+            if (!cfg.deduplicate || !seenContents.has(section.content)) {
+                mergedSections.push(section);
+                seenContents.add(section.content);
+            }
+            else {
+                stats.duplicatesRemoved++;
+            }
+        }
+    }
+    // Build final document
+    const merged = buildDocument(mergedSections, files[0].name.replace('.md', ''));
+    stats.finalLength = merged.length;
+    return {
+        merged,
+        sections: mergedSections,
+        stats,
+    };
+}
+/**
+ * Parse markdown content into sections
+ */
+function parseMarkdown(content) {
+    const sections = [];
+    const lines = content.split('\n');
+    let currentSection = null;
+    for (const line of lines) {
+        const headingMatch = line.match(/^(#{1,6})\s+(.+)$/);
+        if (headingMatch) {
+            // Save previous section
+            if (currentSection) {
+                sections.push(currentSection);
+            }
+            // Start new section
+            currentSection = {
+                heading: headingMatch[2].trim(),
+                level: headingMatch[1].length,
+                content: '',
+                children: [],
+            };
+        }
+        else if (currentSection) {
+            // Accumulate section content
+            currentSection.content += line + '\n';
+        }
+    }
+    // Don't forget the last section
+    if (currentSection) {
+        sections.push(currentSection);
+    }
+    return sections;
+}
+/**
+ * Count priority sections in a file
+ */
+function countPrioritySections(sections, prioritySections) {
+    return sections.filter((s) => prioritySections.some((p) => s.heading.includes(p))).length;
+}
+/**
+ * Build markdown document from sections
+ */
+function buildDocument(sections, title) {
+    const lines = [`# ${title}\n`];
+    for (const section of sections) {
+        lines.push(`#${' '.repeat(section.level - 1)} ${section.heading}`);
+        lines.push('');
+        lines.push(section.content.trim());
+        lines.push('');
+    }
+    return lines.join('\n').trim();
+}
+//# sourceMappingURL=merge-claude-md.js.map

package/dist/memory/merge-claude-md.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge-claude-md.js","sourceRoot":"","sources":["../../src/memory/merge-claude-md.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAuBH,MAAM,cAAc,GAAgB;IAClC,WAAW,EAAE,IAAI;IACjB,cAAc,EAAE,IAAI;IACpB,gBAAgB,EAAE,CAAC,cAAc,EAAE,OAAO,EAAE,eAAe,EAAE,cAAc,CAAC;IAC5E,gBAAgB,EAAE,KAAK;CACxB,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,cAAc,CAC5B,KAA+C,EAC/C,SAA+B,EAAE;IAMjC,MAAM,GAAG,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IAC7C,MAAM,KAAK,GAAe;QACxB,cAAc,EAAE,KAAK,CAAC,MAAM;QAC5B,aAAa,EAAE,CAAC;QAChB,iBAAiB,EAAE,CAAC;QACpB,WAAW,EAAE,CAAC;KACf,CAAC;IAEF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO;YACL,MAAM,EAAE,EAAE;YACV,QAAQ,EAAE,EAAE;YACZ,KAAK;SACN,CAAC;IACJ,CAAC;IAED,kBAAkB;IAClB,MAAM,WAAW,GAAiD,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACrF,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,QAAQ,EAAE,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC;KACtC,CAAC,CAAC,CAAC;IAEJ,KAAK,CAAC,aAAa,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAEjF,oCAAoC;IACpC,MAAM,cAAc,GAAc,EAAE,CAAC;IACrC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IAEvC,mBAAmB;IACnB,MAAM,WAAW,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACjD,MAAM,SAAS,GAAG,qBAAqB,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC;QAC1E,MAAM,SAAS,GAAG,qBAAqB,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC;QAC1E,OAAO,SAAS,GAAG,SAAS,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpC,IAAI,CAAC,GAAG,CAAC,WAAW,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC3D,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC7B,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACpC,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,iBAAiB,EAAE,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED,uBAAuB;IACvB,MAAM,MAAM,GAAG,aAAa,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;IAC/E,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC;IAElC,OAAO;QACL,MAAM;QACN,QAAQ,EAAE,cAAc;QACxB,KAAK;KACN,CAAC;AACJ,CAAC;AAYD;;GAEG;AACH,SAAS,aAAa,CAAC,OAAe;IACpC,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,cAAc,GAAmB,IAAI,CAAC;IAE1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;QAErD,IAAI,YAAY,EAAE,CAAC;YACjB,wBAAwB;YACxB,IAAI,cAAc,EAAE,CAAC;gBACnB,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAChC,CAAC;YAED,oBAAoB;YACpB,cAAc,GAAG;gBACf,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;gBAC/B,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM;gBAC7B,OAAO,EAAE,EAAE;gBACX,QAAQ,EAAE,EAAE;aACb,CAAC;QACJ,CAAC;aAAM,IAAI,cAAc,EAAE,CAAC;YAC1B,6BAA6B;YAC7B,cAAc,CAAC,OAAO,IAAI,IAAI,GAAG,IAAI,CAAC;QACxC,CAAC;IACH,CAAC;IAED,gCAAgC;IAChC,IAAI,cAAc,EAAE,CAAC;QACnB,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,SAAS,qBAAqB,CAAC,QAAmB,EAAE,gBAA0B;IAC5E,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;AACpG,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,QAAmB,EAAE,KAAa;IACvD,MAAM,KAAK,GAAG,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;IAE/B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;QACnE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;AACjC,CAAC"}

package/dist/memory/patterns.d.ts

@@ -0,0 +1,37 @@
+/**
+ * Memory Patterns Module for UAP
+ *
+ * Provides common memory patterns and utilities for agent memory management.
+ */
+export interface MemoryPattern {
+    id: string;
+    name: string;
+    description: string;
+    template: string;
+    variables: string[];
+}
+/**
+ * Common memory patterns for agents
+ */
+export declare const MEMORY_PATTERNS: MemoryPattern[];
+/**
+ * Fill in a pattern template with values
+ */
+export declare function fillPattern(pattern: MemoryPattern, values: Record<string, string>): string;
+/**
+ * Get a pattern by ID
+ */
+export declare function getPattern(id: string): MemoryPattern | undefined;
+/**
+ * Search patterns by keywords
+ */
+export declare function searchPatterns(query: string): MemoryPattern[];
+/**
+ * Get all pattern IDs
+ */
+export declare function getPatternIds(): string[];
+/**
+ * Create a new pattern
+ */
+export declare function createPattern(id: string, name: string, description: string, template: string, variables: string[]): MemoryPattern;
+//# sourceMappingURL=patterns.d.ts.map

package/dist/memory/patterns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"patterns.d.ts","sourceRoot":"","sources":["../../src/memory/patterns.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB;AAED;;GAEG;AACH,eAAO,MAAM,eAAe,EAAE,aAAa,EAyC1C,CAAC;AAEF;;GAEG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAQ1F;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS,CAEhE;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,aAAa,EAAE,CAO7D;AAED;;GAEG;AACH,wBAAgB,aAAa,IAAI,MAAM,EAAE,CAExC;AAED;;GAEG;AACH,wBAAgB,aAAa,CAC3B,EAAE,EAAE,MAAM,EACV,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,MAAM,EACnB,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EAAE,GAClB,aAAa,CAEf"}

package/dist/memory/patterns.js

@@ -0,0 +1,81 @@
+/**
+ * Memory Patterns Module for UAP
+ *
+ * Provides common memory patterns and utilities for agent memory management.
+ */
+/**
+ * Common memory patterns for agents
+ */
+export const MEMORY_PATTERNS = [
+    {
+        id: 'decision',
+        name: 'Decision Log',
+        description: 'Record a decision made by the agent',
+        template: '# Decision: {{title}}\n\n**Context:** {{context}}\n\n**Decision:** {{decision}}\n\n**Reasoning:** {{reasoning}}\n\n**Expected Outcome:** {{outcome}}',
+        variables: ['title', 'context', 'decision', 'reasoning', 'outcome'],
+    },
+    {
+        id: 'lesson',
+        name: 'Lesson Learned',
+        description: 'Capture a lesson learned during development',
+        template: '# Lesson: {{title}}\n\n**Problem:** {{problem}}\n\n**Solution:** {{solution}}\n\n**Key Insight:** {{insight}}\n\n**When to Apply:** {{whenToApply}}',
+        variables: ['title', 'problem', 'solution', 'insight', 'whenToApply'],
+    },
+    {
+        id: 'gotcha',
+        name: 'Gotcha / Warning',
+        description: 'Document a common pitfall or gotcha',
+        template: '# ⚠️ Gotcha: {{title}}\n\n**What to Avoid:** {{avoid}}\n\n**Why:** {{why}}\n\n**Correct Approach:** {{correctApproach}}',
+        variables: ['title', 'avoid', 'why', 'correctApproach'],
+    },
+    {
+        id: 'pattern',
+        name: 'Design Pattern',
+        description: 'Document a recurring design pattern',
+        template: '# Pattern: {{title}}\n\n**Purpose:** {{purpose}}\n\n**Structure:** {{structure}}\n\n**Usage Example:**\n\n```{{language}}\n{{example}}\n```',
+        variables: ['title', 'purpose', 'structure', 'language', 'example'],
+    },
+    {
+        id: 'architecture',
+        name: 'Architecture Decision',
+        description: 'Record an architectural decision',
+        template: '# ADR: {{title}}\n\n**Status:** {{status}}\n\n**Context:** {{context}}\n\n**Decision:** {{decision}}\n\n**Consequences:** {{consequences}}',
+        variables: ['title', 'status', 'context', 'decision', 'consequences'],
+    },
+];
+/**
+ * Fill in a pattern template with values
+ */
+export function fillPattern(pattern, values) {
+    let result = pattern.template;
+    for (const [key, value] of Object.entries(values)) {
+        result = result.replace(new RegExp(`{{${key}}}`, 'g'), value);
+    }
+    return result;
+}
+/**
+ * Get a pattern by ID
+ */
+export function getPattern(id) {
+    return MEMORY_PATTERNS.find((p) => p.id === id);
+}
+/**
+ * Search patterns by keywords
+ */
+export function searchPatterns(query) {
+    const lowerQuery = query.toLowerCase();
+    return MEMORY_PATTERNS.filter((p) => p.name.toLowerCase().includes(lowerQuery) || p.description.toLowerCase().includes(lowerQuery));
+}
+/**
+ * Get all pattern IDs
+ */
+export function getPatternIds() {
+    return MEMORY_PATTERNS.map((p) => p.id);
+}
+/**
+ * Create a new pattern
+ */
+export function createPattern(id, name, description, template, variables) {
+    return { id, name, description, template, variables };
+}
+//# sourceMappingURL=patterns.js.map

package/dist/memory/patterns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"patterns.js","sourceRoot":"","sources":["../../src/memory/patterns.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAUH;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAoB;IAC9C;QACE,EAAE,EAAE,UAAU;QACd,IAAI,EAAE,cAAc;QACpB,WAAW,EAAE,qCAAqC;QAClD,QAAQ,EACN,sJAAsJ;QACxJ,SAAS,EAAE,CAAC,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS,CAAC;KACpE;IACD;QACE,EAAE,EAAE,QAAQ;QACZ,IAAI,EAAE,gBAAgB;QACtB,WAAW,EAAE,6CAA6C;QAC1D,QAAQ,EACN,qJAAqJ;QACvJ,SAAS,EAAE,CAAC,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,aAAa,CAAC;KACtE;IACD;QACE,EAAE,EAAE,QAAQ;QACZ,IAAI,EAAE,kBAAkB;QACxB,WAAW,EAAE,qCAAqC;QAClD,QAAQ,EACN,yHAAyH;QAC3H,SAAS,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,iBAAiB,CAAC;KACxD;IACD;QACE,EAAE,EAAE,SAAS;QACb,IAAI,EAAE,gBAAgB;QACtB,WAAW,EAAE,qCAAqC;QAClD,QAAQ,EACN,6IAA6I;QAC/I,SAAS,EAAE,CAAC,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,CAAC;KACpE;IACD;QACE,EAAE,EAAE,cAAc;QAClB,IAAI,EAAE,uBAAuB;QAC7B,WAAW,EAAE,kCAAkC;QAC/C,QAAQ,EACN,4IAA4I;QAC9I,SAAS,EAAE,CAAC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,cAAc,CAAC;KACtE;CACF,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,OAAsB,EAAE,MAA8B;IAChF,IAAI,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC;IAE9B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAClD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,KAAK,GAAG,IAAI,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;IAChE,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,EAAU;IACnC,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa;IAC1C,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAEvC,OAAO,eAAe,CAAC,MAAM,CAC3B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CAChG,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa;IAC3B,OAAO,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAC1C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAC3B,EAAU,EACV,IAAY,EACZ,WAAmB,EACnB,QAAgB,EAChB,SAAmB;IAEnB,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;AACxD,CAAC"}

package/dist/memory/semantic-edge-graph.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Semantic Edge Graph Module for UAP
+ *
+ * Implements a knowledge graph with semantic edges for efficient memory retrieval.
+ */
+export interface GraphNode {
+    id: string;
+    content: string;
+    type: 'concept' | 'fact' | 'entity' | 'relationship';
+    metadata: Record<string, any>;
+    embedding?: number[];
+}
+export interface GraphEdge {
+    source: string;
+    target: string;
+    type: string;
+    weight: number;
+    metadata: Record<string, any>;
+}
+export interface SemanticEdgeGraphConfig {
+    maxEdgesPerNode: number;
+    similarityThreshold: number;
+    decayRate: number;
+}
+/**
+ * Semantic Edge Graph
+ * A knowledge graph with semantic connections between nodes
+ */
+export declare class SemanticEdgeGraph {
+    private config;
+    private nodes;
+    private edges;
+    constructor(config?: Partial<SemanticEdgeGraphConfig>);
+    /**
+     * Add a node to the graph
+     */
+    addNode(node: GraphNode): void;
+    /**
+     * Add an edge between nodes
+     */
+    addEdge(source: string, target: string, type: string, weight?: number): void;
+    private addEdgeToAdjacency;
+    /**
+     * Get neighbors of a node
+     */
+    getNeighbors(nodeId: string, limit?: number): Array<{
+        nodeId: string;
+        edge: GraphEdge;
+    }>;
+    /**
+     * Get all nodes
+     */
+    getAllNodes(): GraphNode[];
+    /**
+     * Get a node by ID
+     */
+    getNode(nodeId: string): GraphNode | null;
+    /**
+     * Find similar nodes by content
+     */
+    findSimilar(nodeId: string, threshold?: number): Array<{
+        node: GraphNode;
+        similarity: number;
+    }>;
+    /**
+     * Find shortest path between nodes
+     */
+    findPath(start: string, end: string): string[] | null;
+    /**
+     * Calculate cosine similarity between vectors
+     */
+    private cosineSimilarity;
+    /**
+     * Get graph statistics
+     */
+    getStats(): {
+        nodeCount: number;
+        edgeCount: number;
+        avgEdgesPerNode: number;
+    };
+    /**
+     * Clear the graph
+     */
+    clear(): void;
+}
+//# sourceMappingURL=semantic-edge-graph.d.ts.map

package/dist/memory/semantic-edge-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-edge-graph.d.ts","sourceRoot":"","sources":["../../src/memory/semantic-edge-graph.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,SAAS,GAAG,MAAM,GAAG,QAAQ,GAAG,cAAc,CAAC;IACrD,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC9B,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,SAAS;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAC/B;AAED,MAAM,WAAW,uBAAuB;IACtC,eAAe,EAAE,MAAM,CAAC;IACxB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,SAAS,EAAE,MAAM,CAAC;CACnB;AAQD;;;GAGG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,MAAM,CAA0B;IACxC,OAAO,CAAC,KAAK,CAAqC;IAClD,OAAO,CAAC,KAAK,CAAuC;gBAExC,MAAM,GAAE,OAAO,CAAC,uBAAuB,CAAM;IAIzD;;OAEG;IACH,OAAO,CAAC,IAAI,EAAE,SAAS,GAAG,IAAI;IAO9B;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,GAAE,MAAY,GAAG,IAAI;IAkBjF,OAAO,CAAC,kBAAkB;IAmB1B;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,SAAS,CAAA;KAAE,CAAC;IAUxF;;OAEG;IACH,WAAW,IAAI,SAAS,EAAE;IAI1B;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI;IAIzC;;OAEG;IACH,WAAW,CACT,MAAM,EAAE,MAAM,EACd,SAAS,GAAE,MAAY,GACtB,KAAK,CAAC;QAAE,IAAI,EAAE,SAAS,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC;IAoBjD;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI;IA6BrD;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAgBxB;;OAEG;IACH,QAAQ,IAAI;QACV,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,eAAe,EAAE,MAAM,CAAC;KACzB;IAeD;;OAEG;IACH,KAAK,IAAI,IAAI;CAId"}

package/dist/memory/semantic-edge-graph.js

@@ -0,0 +1,168 @@
+/**
+ * Semantic Edge Graph Module for UAP
+ *
+ * Implements a knowledge graph with semantic edges for efficient memory retrieval.
+ */
+const DEFAULT_CONFIG = {
+    maxEdgesPerNode: 50,
+    similarityThreshold: 0.7,
+    decayRate: 0.95,
+};
+/**
+ * Semantic Edge Graph
+ * A knowledge graph with semantic connections between nodes
+ */
+export class SemanticEdgeGraph {
+    config;
+    nodes = new Map();
+    edges = new Map();
+    constructor(config = {}) {
+        this.config = { ...DEFAULT_CONFIG, ...config };
+    }
+    /**
+     * Add a node to the graph
+     */
+    addNode(node) {
+        this.nodes.set(node.id, node);
+        if (!this.edges.has(node.id)) {
+            this.edges.set(node.id, []);
+        }
+    }
+    /**
+     * Add an edge between nodes
+     */
+    addEdge(source, target, type, weight = 1.0) {
+        if (!this.nodes.has(source) || !this.nodes.has(target)) {
+            throw new Error(`Nodes ${source} and ${target} must exist`);
+        }
+        const edge = {
+            source,
+            target,
+            type,
+            weight,
+            metadata: {},
+        };
+        // Add edge to both nodes' adjacency lists (undirected)
+        this.addEdgeToAdjacency(source, target, edge);
+        this.addEdgeToAdjacency(target, source, { ...edge, source: target, target });
+    }
+    addEdgeToAdjacency(nodeId, targetId, edge) {
+        const adj = this.edges.get(nodeId) || [];
+        // Remove existing edge if it exists
+        const filtered = adj.filter((e) => e.target !== targetId);
+        // Add new edge
+        filtered.push(edge);
+        // Sort by weight and limit
+        filtered.sort((a, b) => b.weight - a.weight);
+        if (filtered.length > this.config.maxEdgesPerNode) {
+            filtered.length = this.config.maxEdgesPerNode;
+        }
+        this.edges.set(nodeId, filtered);
+    }
+    /**
+     * Get neighbors of a node
+     */
+    getNeighbors(nodeId, limit) {
+        const adj = this.edges.get(nodeId) || [];
+        if (limit) {
+            return adj.slice(0, limit).map((e) => ({ nodeId: e.target, edge: e }));
+        }
+        return adj.map((e) => ({ nodeId: e.target, edge: e }));
+    }
+    /**
+     * Get all nodes
+     */
+    getAllNodes() {
+        return Array.from(this.nodes.values());
+    }
+    /**
+     * Get a node by ID
+     */
+    getNode(nodeId) {
+        return this.nodes.get(nodeId) || null;
+    }
+    /**
+     * Find similar nodes by content
+     */
+    findSimilar(nodeId, threshold = 0.7) {
+        const node = this.nodes.get(nodeId);
+        if (!node || !node.embedding) {
+            return [];
+        }
+        const results = [];
+        for (const [id, otherNode] of this.nodes) {
+            if (id === nodeId || !otherNode.embedding)
+                continue;
+            const similarity = this.cosineSimilarity(node.embedding, otherNode.embedding);
+            if (similarity >= threshold) {
+                results.push({ node: otherNode, similarity });
+            }
+        }
+        return results.sort((a, b) => b.similarity - a.similarity);
+    }
+    /**
+     * Find shortest path between nodes
+     */
+    findPath(start, end) {
+        if (!this.nodes.has(start) || !this.nodes.has(end)) {
+            return null;
+        }
+        const visited = new Set();
+        const queue = [{ node: start, path: [start] }];
+        while (queue.length > 0) {
+            const { node, path } = queue.shift();
+            if (node === end) {
+                return path;
+            }
+            if (visited.has(node))
+                continue;
+            visited.add(node);
+            const neighbors = this.getNeighbors(node);
+            for (const { nodeId: neighborId } of neighbors) {
+                if (!visited.has(neighborId)) {
+                    queue.push({ node: neighborId, path: [...path, neighborId] });
+                }
+            }
+        }
+        return null;
+    }
+    /**
+     * Calculate cosine similarity between vectors
+     */
+    cosineSimilarity(a, b) {
+        if (a.length !== b.length || a.length === 0)
+            return 0;
+        let dotProduct = 0;
+        let normA = 0;
+        let normB = 0;
+        for (let i = 0; i < a.length; i++) {
+            dotProduct += a[i] * b[i];
+            normA += a[i] * a[i];
+            normB += b[i] * b[i];
+        }
+        return dotProduct / (Math.sqrt(normA) * Math.sqrt(normB));
+    }
+    /**
+     * Get graph statistics
+     */
+    getStats() {
+        const nodeCount = this.nodes.size;
+        let edgeCount = 0;
+        for (const adj of this.edges.values()) {
+            edgeCount += adj.length;
+        }
+        return {
+            nodeCount,
+            edgeCount,
+            avgEdgesPerNode: nodeCount > 0 ? edgeCount / nodeCount : 0,
+        };
+    }
+    /**
+     * Clear the graph
+     */
+    clear() {
+        this.nodes.clear();
+        this.edges.clear();
+    }
+}
+//# sourceMappingURL=semantic-edge-graph.js.map

package/dist/memory/semantic-edge-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-edge-graph.js","sourceRoot":"","sources":["../../src/memory/semantic-edge-graph.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAwBH,MAAM,cAAc,GAA4B;IAC9C,eAAe,EAAE,EAAE;IACnB,mBAAmB,EAAE,GAAG;IACxB,SAAS,EAAE,IAAI;CAChB,CAAC;AAEF;;;GAGG;AACH,MAAM,OAAO,iBAAiB;IACpB,MAAM,CAA0B;IAChC,KAAK,GAA2B,IAAI,GAAG,EAAE,CAAC;IAC1C,KAAK,GAA6B,IAAI,GAAG,EAAE,CAAC;IAEpD,YAAY,SAA2C,EAAE;QACvD,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAe;QACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,MAAc,EAAE,MAAc,EAAE,IAAY,EAAE,SAAiB,GAAG;QACxE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACvD,MAAM,IAAI,KAAK,CAAC,SAAS,MAAM,QAAQ,MAAM,aAAa,CAAC,CAAC;QAC9D,CAAC;QAED,MAAM,IAAI,GAAc;YACtB,MAAM;YACN,MAAM;YACN,IAAI;YACJ,MAAM;YACN,QAAQ,EAAE,EAAE;SACb,CAAC;QAEF,uDAAuD;QACvD,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAC9C,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC/E,CAAC;IAEO,kBAAkB,CAAC,MAAc,EAAE,QAAgB,EAAE,IAAe;QAC1E,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAEzC,oCAAoC;QACpC,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;QAE1D,eAAe;QACf,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEpB,2BAA2B;QAC3B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAE7C,IAAI,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;YAClD,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC;QAChD,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,MAAc,EAAE,KAAc;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAEzC,IAAI,KAAK,EAAE,CAAC;YACV,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzE,CAAC;QAED,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,WAAW,CACT,MAAc,EACd,YAAoB,GAAG;QAEvB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YAC7B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,OAAO,GAAmD,EAAE,CAAC;QAEnE,KAAK,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACzC,IAAI,EAAE,KAAK,MAAM,IAAI,CAAC,SAAS,CAAC,SAAS;gBAAE,SAAS;YAEpD,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;YAC9E,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,KAAa,EAAE,GAAW;QACjC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAA4C,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAExF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEtC,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;gBACjB,OAAO,IAAI,CAAC;YACd,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAElB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YAC1C,KAAK,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;gBAChE,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,CAAW,EAAE,CAAW;QAC/C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEtD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,OAAO,UAAU,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACH,QAAQ;QAKN,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAClC,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,SAAS,IAAI,GAAG,CAAC,MAAM,CAAC;QAC1B,CAAC;QAED,OAAO;YACL,SAAS;YACT,SAAS;YACT,eAAe,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;SAC3D,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;CACF"}

package/dist/memory/semantic-retrieval.d.ts

@@ -0,0 +1,70 @@
+/**
+ * Semantic Retrieval Module for UAP
+ *
+ * Implements semantic search over memory entries using embeddings.
+ */
+export interface MemoryEntry {
+    id: string;
+    content: string;
+    type: string;
+    timestamp: string;
+    importance?: number;
+    embedding?: number[];
+}
+export interface SemanticRetrievalConfig {
+    minScore: number;
+    topK: number;
+    embeddingModel: string;
+}
+/**
+ * Semantic Retrieval Manager
+ * Provides semantic search capabilities for memory entries
+ */
+export declare class SemanticRetrieval {
+    private config;
+    private memoryIndex;
+    private embeddingService;
+    constructor(config?: Partial<SemanticRetrievalConfig>);
+    /**
+     * Index a memory entry
+     */
+    addEntry(entry: MemoryEntry): Promise<void>;
+    /**
+     * Index multiple entries
+     */
+    addEntries(entries: MemoryEntry[]): Promise<void>;
+    /**
+     * Remove an entry from the index
+     */
+    removeEntry(id: string): boolean;
+    /**
+     * Search for similar entries
+     */
+    search(query: string, options?: {
+        limit?: number;
+        minScore?: number;
+    }): Promise<Array<{
+        entry: MemoryEntry;
+        score: number;
+    }>>;
+    /**
+     * Get an entry by ID
+     */
+    getEntry(id: string): MemoryEntry | null;
+    /**
+     * Get all indexed entries
+     */
+    getAllEntries(): MemoryEntry[];
+    /**
+     * Get index statistics
+     */
+    getStats(): {
+        indexedCount: number;
+        hasEmbeddings: number;
+    };
+    /**
+     * Clear the index
+     */
+    clear(): void;
+}
+//# sourceMappingURL=semantic-retrieval.d.ts.map

package/dist/memory/semantic-retrieval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-retrieval.d.ts","sourceRoot":"","sources":["../../src/memory/semantic-retrieval.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;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,uBAAuB;IACtC,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,cAAc,EAAE,MAAM,CAAC;CACxB;AAQD;;;GAGG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,MAAM,CAA0B;IACxC,OAAO,CAAC,WAAW,CAAuC;IAC1D,OAAO,CAAC,gBAAgB,CAAyB;gBAErC,MAAM,GAAE,OAAO,CAAC,uBAAuB,CAAM;IAIzD;;OAEG;IACG,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;IAajD;;OAEG;IACG,UAAU,CAAC,OAAO,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAIvD;;OAEG;IACH,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAIhC;;OAEG;IACG,MAAM,CACV,KAAK,EAAE,MAAM,EACb,OAAO,GAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAO,GAClD,OAAO,CAAC,KAAK,CAAC;QAAE,KAAK,EAAE,WAAW,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IA+BxD;;OAEG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI;IAIxC;;OAEG;IACH,aAAa,IAAI,WAAW,EAAE;IAI9B;;OAEG;IACH,QAAQ,IAAI;QACV,YAAY,EAAE,MAAM,CAAC;QACrB,aAAa,EAAE,MAAM,CAAC;KACvB;IAaD;;OAEG;IACH,KAAK,IAAI,IAAI;CAGd"}