shieldcortex 2.0.0

package/dist/memory/salience.js

@@ -0,0 +1,216 @@
+/**
+ * Salience Detection System
+ *
+ * Determines what information is worth remembering, like how the human brain
+ * filters important from unimportant information.
+ */
+// Keywords that indicate high-importance content
+const ARCHITECTURE_KEYWORDS = [
+    'architecture', 'design', 'pattern', 'structure', 'system',
+    'database', 'api', 'schema', 'model', 'framework', 'stack',
+    'microservice', 'monolith', 'serverless', 'infrastructure'
+];
+const ERROR_KEYWORDS = [
+    'error', 'bug', 'fix', 'issue', 'problem', 'crash', 'fail',
+    'exception', 'debug', 'resolve', 'solution', 'workaround'
+];
+const PREFERENCE_KEYWORDS = [
+    'prefer', 'always', 'never', 'style', 'convention', 'standard',
+    'like', 'want', 'should', 'must', 'require'
+];
+const PATTERN_KEYWORDS = [
+    'pattern', 'practice', 'approach', 'method', 'technique',
+    'implementation', 'strategy', 'algorithm', 'workflow'
+];
+const EMOTIONAL_MARKERS = [
+    'important', 'critical', 'crucial', 'essential', 'key',
+    'finally', 'breakthrough', 'eureka', 'aha', 'got it',
+    'frustrating', 'annoying', 'tricky', 'remember'
+];
+// Code reference patterns
+const CODE_REFERENCE_PATTERNS = [
+    /\b[A-Z][a-zA-Z]*\.[a-zA-Z]+\b/, // Class.method
+    /\b[a-z_][a-zA-Z0-9_]*\.(ts|js|py|go|rs)\b/, // filename.ext
+    /`[^`]+`/, // backtick code
+    /\b(function|class|interface|type|const|let|var)\s+\w+/i, // declarations
+    /\bline\s*\d+\b/i, // line references
+    /\b(src|lib|app|components?)\/\S+/, // path references
+];
+/**
+ * Calculate salience score based on content analysis
+ */
+export function calculateSalience(input) {
+    const factors = analyzeSalienceFactors(input);
+    return computeSalienceScore(factors);
+}
+/**
+ * Analyze content to extract salience factors
+ */
+export function analyzeSalienceFactors(input) {
+    const text = `${input.title} ${input.content}`.toLowerCase();
+    return {
+        explicitRequest: detectExplicitRequest(text),
+        isArchitectureDecision: detectKeywords(text, ARCHITECTURE_KEYWORDS),
+        isErrorResolution: detectKeywords(text, ERROR_KEYWORDS),
+        isCodePattern: detectKeywords(text, PATTERN_KEYWORDS),
+        isUserPreference: detectKeywords(text, PREFERENCE_KEYWORDS),
+        mentionCount: countMentions(text),
+        hasCodeReference: detectCodeReferences(input.content),
+        emotionalMarkers: detectKeywords(text, EMOTIONAL_MARKERS),
+    };
+}
+/**
+ * Compute final salience score from factors
+ */
+export function computeSalienceScore(factors) {
+    let score = 0.25; // Base score (lowered from 0.4 so trivial notes don't appear important)
+    // Weight each factor
+    if (factors.explicitRequest)
+        score += 0.5; // Highest weight
+    if (factors.isArchitectureDecision)
+        score += 0.4;
+    if (factors.isErrorResolution)
+        score += 0.35;
+    if (factors.isCodePattern)
+        score += 0.25;
+    if (factors.isUserPreference)
+        score += 0.25;
+    if (factors.hasCodeReference)
+        score += 0.15;
+    if (factors.emotionalMarkers)
+        score += 0.2;
+    // Mention count bonus (diminishing returns)
+    if (factors.mentionCount > 1) {
+        score += Math.min(0.3, Math.log2(factors.mentionCount) * 0.1);
+    }
+    // Cap at 1.0
+    return Math.min(1.0, score);
+}
+/**
+ * Count how many keyword mentions appear in the text
+ */
+function countMentions(text) {
+    const allKeywords = [
+        ...ARCHITECTURE_KEYWORDS, ...ERROR_KEYWORDS,
+        ...PREFERENCE_KEYWORDS, ...PATTERN_KEYWORDS
+    ];
+    let count = 0;
+    const lower = text.toLowerCase();
+    for (const kw of allKeywords) {
+        if (lower.includes(kw))
+            count++;
+    }
+    return Math.max(1, count);
+}
+/**
+ * Detect if user explicitly requested to remember
+ */
+function detectExplicitRequest(text) {
+    const patterns = [
+        /\bremember\s+(this|that)\b/i,
+        /\bdon'?t\s+forget\b/i,
+        /\bkeep\s+(in\s+)?mind\b/i,
+        /\bnote\s+(this|that)\b/i,
+        /\bsave\s+(this|that)\b/i,
+        /\bstore\s+(this|that)\b/i,
+        /\bimportant[:\s]/i,
+        /\bfor\s+future\s+reference\b/i,
+    ];
+    return patterns.some(pattern => pattern.test(text));
+}
+/**
+ * Detect presence of keywords in text
+ */
+function detectKeywords(text, keywords) {
+    return keywords.some(keyword => text.includes(keyword.toLowerCase()));
+}
+/**
+ * Detect code references in content
+ */
+function detectCodeReferences(content) {
+    return CODE_REFERENCE_PATTERNS.some(pattern => pattern.test(content));
+}
+/**
+ * Suggest a category based on content analysis
+ */
+export function suggestCategory(input) {
+    const text = `${input.title} ${input.content}`.toLowerCase();
+    if (detectKeywords(text, ARCHITECTURE_KEYWORDS))
+        return 'architecture';
+    if (detectKeywords(text, ERROR_KEYWORDS))
+        return 'error';
+    if (detectKeywords(text, PREFERENCE_KEYWORDS))
+        return 'preference';
+    if (detectKeywords(text, PATTERN_KEYWORDS))
+        return 'pattern';
+    // Check for TODO patterns
+    if (/\b(todo|fixme|hack|xxx)\b/i.test(text))
+        return 'todo';
+    // Check for learning patterns
+    if (/\b(learned?|discovered?|realized?|found\s+out)\b/i.test(text))
+        return 'learning';
+    // Check for relationship patterns
+    if (/\b(depends?\s+on|requires?|uses?|imports?|extends?)\b/i.test(text))
+        return 'relationship';
+    // Default to note
+    return 'note';
+}
+/**
+ * Extract tags from content
+ */
+export function extractTags(input) {
+    const tags = new Set(input.tags || []);
+    const text = `${input.title} ${input.content}`;
+    // Extract hashtags
+    const hashtagMatches = text.match(/#[a-zA-Z][a-zA-Z0-9_-]*/g);
+    if (hashtagMatches) {
+        hashtagMatches.forEach(tag => tags.add(tag.slice(1).toLowerCase()));
+    }
+    // Extract common tech terms
+    const techTerms = [
+        'react', 'vue', 'angular', 'node', 'python', 'typescript', 'javascript',
+        'api', 'database', 'sql', 'nosql', 'mongodb', 'postgresql', 'mysql',
+        'docker', 'kubernetes', 'aws', 'gcp', 'azure', 'git', 'ci/cd',
+        'testing', 'auth', 'security', 'performance', 'caching'
+    ];
+    const lowerText = text.toLowerCase();
+    techTerms.forEach(term => {
+        if (lowerText.includes(term)) {
+            tags.add(term);
+        }
+    });
+    return Array.from(tags).slice(0, 10); // Limit to 10 tags
+}
+/**
+ * Analyze if content is worth remembering at all
+ */
+export function isWorthRemembering(input, minSalience = 0.3) {
+    const salience = calculateSalience(input);
+    return salience >= minSalience;
+}
+/**
+ * Get a human-readable explanation of why something was considered important
+ */
+export function explainSalience(factors) {
+    const reasons = [];
+    if (factors.explicitRequest)
+        reasons.push('explicitly requested to remember');
+    if (factors.isArchitectureDecision)
+        reasons.push('architecture decision');
+    if (factors.isErrorResolution)
+        reasons.push('error resolution');
+    if (factors.isCodePattern)
+        reasons.push('code pattern');
+    if (factors.isUserPreference)
+        reasons.push('user preference');
+    if (factors.hasCodeReference)
+        reasons.push('references specific code');
+    if (factors.emotionalMarkers)
+        reasons.push('marked as important');
+    if (factors.mentionCount > 1)
+        reasons.push(`mentioned ${factors.mentionCount} times`);
+    if (reasons.length === 0)
+        return 'general note';
+    return reasons.join(', ');
+}
+//# sourceMappingURL=salience.js.map

package/dist/memory/salience.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"salience.js","sourceRoot":"","sources":["../../src/memory/salience.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,iDAAiD;AACjD,MAAM,qBAAqB,GAAG;IAC5B,cAAc,EAAE,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,QAAQ;IAC1D,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO;IAC1D,cAAc,EAAE,UAAU,EAAE,YAAY,EAAE,gBAAgB;CAC3D,CAAC;AAEF,MAAM,cAAc,GAAG;IACrB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM;IAC1D,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,YAAY;CAC1D,CAAC;AAEF,MAAM,mBAAmB,GAAG;IAC1B,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,UAAU;IAC9D,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS;CAC5C,CAAC;AAEF,MAAM,gBAAgB,GAAG;IACvB,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW;IACxD,gBAAgB,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU;CACtD,CAAC;AAEF,MAAM,iBAAiB,GAAG;IACxB,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK;IACtD,SAAS,EAAE,cAAc,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ;IACpD,aAAa,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU;CAChD,CAAC;AAEF,0BAA0B;AAC1B,MAAM,uBAAuB,GAAG;IAC9B,+BAA+B,EAAY,eAAe;IAC1D,2CAA2C,EAAE,eAAe;IAC5D,SAAS,EAAoC,gBAAgB;IAC7D,wDAAwD,EAAE,eAAe;IACzE,iBAAiB,EAA2B,kBAAkB;IAC9D,kCAAkC,EAAW,kBAAkB;CAChE,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAkB;IAClD,MAAM,OAAO,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;IAC9C,OAAO,oBAAoB,CAAC,OAAO,CAAC,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAkB;IACvD,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC,WAAW,EAAE,CAAC;IAE7D,OAAO;QACL,eAAe,EAAE,qBAAqB,CAAC,IAAI,CAAC;QAC5C,sBAAsB,EAAE,cAAc,CAAC,IAAI,EAAE,qBAAqB,CAAC;QACnE,iBAAiB,EAAE,cAAc,CAAC,IAAI,EAAE,cAAc,CAAC;QACvD,aAAa,EAAE,cAAc,CAAC,IAAI,EAAE,gBAAgB,CAAC;QACrD,gBAAgB,EAAE,cAAc,CAAC,IAAI,EAAE,mBAAmB,CAAC;QAC3D,YAAY,EAAE,aAAa,CAAC,IAAI,CAAC;QACjC,gBAAgB,EAAE,oBAAoB,CAAC,KAAK,CAAC,OAAO,CAAC;QACrD,gBAAgB,EAAE,cAAc,CAAC,IAAI,EAAE,iBAAiB,CAAC;KAC1D,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,OAAwB;IAC3D,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,wEAAwE;IAE1F,qBAAqB;IACrB,IAAI,OAAO,CAAC,eAAe;QAAE,KAAK,IAAI,GAAG,CAAC,CAAQ,iBAAiB;IACnE,IAAI,OAAO,CAAC,sBAAsB;QAAE,KAAK,IAAI,GAAG,CAAC;IACjD,IAAI,OAAO,CAAC,iBAAiB;QAAE,KAAK,IAAI,IAAI,CAAC;IAC7C,IAAI,OAAO,CAAC,aAAa;QAAE,KAAK,IAAI,IAAI,CAAC;IACzC,IAAI,OAAO,CAAC,gBAAgB;QAAE,KAAK,IAAI,IAAI,CAAC;IAC5C,IAAI,OAAO,CAAC,gBAAgB;QAAE,KAAK,IAAI,IAAI,CAAC;IAC5C,IAAI,OAAO,CAAC,gBAAgB;QAAE,KAAK,IAAI,GAAG,CAAC;IAE3C,4CAA4C;IAC5C,IAAI,OAAO,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,GAAG,GAAG,CAAC,CAAC;IAChE,CAAC;IAED,aAAa;IACb,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AAC9B,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,IAAY;IACjC,MAAM,WAAW,GAAG;QAClB,GAAG,qBAAqB,EAAE,GAAG,cAAc;QAC3C,GAAG,mBAAmB,EAAE,GAAG,gBAAgB;KAC5C,CAAC;IACF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC7B,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAE,KAAK,EAAE,CAAC;IAClC,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAC5B,CAAC;AAED;;GAEG;AACH,SAAS,qBAAqB,CAAC,IAAY;IACzC,MAAM,QAAQ,GAAG;QACf,6BAA6B;QAC7B,sBAAsB;QACtB,0BAA0B;QAC1B,yBAAyB;QACzB,yBAAyB;QACzB,0BAA0B;QAC1B,mBAAmB;QACnB,+BAA+B;KAChC,CAAC;IAEF,OAAO,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AACtD,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,IAAY,EAAE,QAAkB;IACtD,OAAO,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;AACxE,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,OAAe;IAC3C,OAAO,uBAAuB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AACxE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,KAAkB;IAChD,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC,WAAW,EAAE,CAAC;IAE7D,IAAI,cAAc,CAAC,IAAI,EAAE,qBAAqB,CAAC;QAAE,OAAO,cAAc,CAAC;IACvE,IAAI,cAAc,CAAC,IAAI,EAAE,cAAc,CAAC;QAAE,OAAO,OAAO,CAAC;IACzD,IAAI,cAAc,CAAC,IAAI,EAAE,mBAAmB,CAAC;QAAE,OAAO,YAAY,CAAC;IACnE,IAAI,cAAc,CAAC,IAAI,EAAE,gBAAgB,CAAC;QAAE,OAAO,SAAS,CAAC;IAE7D,0BAA0B;IAC1B,IAAI,4BAA4B,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC;IAE3D,8BAA8B;IAC9B,IAAI,mDAAmD,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,UAAU,CAAC;IAEtF,kCAAkC;IAClC,IAAI,wDAAwD,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,cAAc,CAAC;IAE/F,kBAAkB;IAClB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,KAAkB;IAC5C,MAAM,IAAI,GAAgB,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;IACpD,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;IAE/C,mBAAmB;IACnB,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;IAC9D,IAAI,cAAc,EAAE,CAAC;QACnB,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IAED,4BAA4B;IAC5B,MAAM,SAAS,GAAG;QAChB,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,YAAY,EAAE,YAAY;QACvE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,OAAO;QACnE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO;QAC7D,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS;KACxD,CAAC;IAEF,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACrC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACvB,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB;AAC3D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAkB,EAAE,cAAsB,GAAG;IAC9E,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC1C,OAAO,QAAQ,IAAI,WAAW,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,OAAwB;IACtD,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,IAAI,OAAO,CAAC,eAAe;QAAE,OAAO,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;IAC9E,IAAI,OAAO,CAAC,sBAAsB;QAAE,OAAO,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IAC1E,IAAI,OAAO,CAAC,iBAAiB;QAAE,OAAO,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;IAChE,IAAI,OAAO,CAAC,aAAa;QAAE,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IACxD,IAAI,OAAO,CAAC,gBAAgB;QAAE,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IAC9D,IAAI,OAAO,CAAC,gBAAgB;QAAE,OAAO,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;IACvE,IAAI,OAAO,CAAC,gBAAgB;QAAE,OAAO,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IAClE,IAAI,OAAO,CAAC,YAAY,GAAG,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,aAAa,OAAO,CAAC,YAAY,QAAQ,CAAC,CAAC;IAEtF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,cAAc,CAAC;IAChD,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC"}

package/dist/memory/similarity.d.ts

@@ -0,0 +1,57 @@
+/**
+ * Text Similarity Utilities
+ *
+ * Provides Jaccard similarity and related text comparison functions
+ * for memory enrichment and contradiction detection.
+ *
+ * Phase 3 Organic Brain Feature
+ */
+/**
+ * Tokenize text into a set of normalized words
+ * Removes punctuation, lowercases, and filters short words
+ */
+export declare function tokenize(text: string): Set<string>;
+/**
+ * Calculate Jaccard similarity between two texts
+ * Returns a value between 0 (completely different) and 1 (identical)
+ *
+ * Jaccard Index = |A ∩ B| / |A ∪ B|
+ *
+ * @param textA - First text to compare
+ * @param textB - Second text to compare
+ * @returns Similarity score between 0 and 1
+ */
+export declare function jaccardSimilarity(textA: string, textB: string): number;
+/**
+ * Extract key phrases/concepts from text
+ * Used for topic comparison in contradiction detection
+ *
+ * Extracts:
+ * - Quoted phrases ("like this")
+ * - Backticked code/terms (`like_this`)
+ * - Capitalized terms (LikeThis)
+ *
+ * @param text - Text to extract key phrases from
+ * @returns Array of unique key phrases (lowercased)
+ */
+export declare function extractKeyPhrases(text: string): string[];
+/**
+ * Calculate word overlap between two texts
+ * Returns the count of shared words
+ *
+ * @param textA - First text
+ * @param textB - Second text
+ * @returns Number of shared words
+ */
+export declare function wordOverlap(textA: string, textB: string): number;
+/**
+ * Check if two texts share significant content
+ * Quick check before running full similarity calculation
+ *
+ * @param textA - First text
+ * @param textB - Second text
+ * @param minOverlap - Minimum word overlap required
+ * @returns True if texts share at least minOverlap words
+ */
+export declare function hasSignificantOverlap(textA: string, textB: string, minOverlap?: number): boolean;
+//# sourceMappingURL=similarity.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"similarity.d.ts","sourceRoot":"","sources":["../../src/memory/similarity.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAQlD;AAED;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAiBtE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CA4BxD;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAUhE;AAED;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,UAAU,GAAE,MAAU,GACrB,OAAO,CAET"}

package/dist/memory/similarity.js

@@ -0,0 +1,114 @@
+/**
+ * Text Similarity Utilities
+ *
+ * Provides Jaccard similarity and related text comparison functions
+ * for memory enrichment and contradiction detection.
+ *
+ * Phase 3 Organic Brain Feature
+ */
+/**
+ * Tokenize text into a set of normalized words
+ * Removes punctuation, lowercases, and filters short words
+ */
+export function tokenize(text) {
+    return new Set(text
+        .toLowerCase()
+        .replace(/[^\w\s]/g, ' ') // Remove punctuation
+        .split(/\s+/)
+        .filter(word => word.length > 2) // Filter very short words
+    );
+}
+/**
+ * Calculate Jaccard similarity between two texts
+ * Returns a value between 0 (completely different) and 1 (identical)
+ *
+ * Jaccard Index = |A ∩ B| / |A ∪ B|
+ *
+ * @param textA - First text to compare
+ * @param textB - Second text to compare
+ * @returns Similarity score between 0 and 1
+ */
+export function jaccardSimilarity(textA, textB) {
+    const setA = tokenize(textA);
+    const setB = tokenize(textB);
+    if (setA.size === 0 && setB.size === 0)
+        return 1.0;
+    if (setA.size === 0 || setB.size === 0)
+        return 0.0;
+    // Calculate intersection
+    let intersection = 0;
+    for (const word of setA) {
+        if (setB.has(word))
+            intersection++;
+    }
+    // Calculate union: |A| + |B| - |A ∩ B|
+    const union = setA.size + setB.size - intersection;
+    return intersection / union;
+}
+/**
+ * Extract key phrases/concepts from text
+ * Used for topic comparison in contradiction detection
+ *
+ * Extracts:
+ * - Quoted phrases ("like this")
+ * - Backticked code/terms (`like_this`)
+ * - Capitalized terms (LikeThis)
+ *
+ * @param text - Text to extract key phrases from
+ * @returns Array of unique key phrases (lowercased)
+ */
+export function extractKeyPhrases(text) {
+    const phrases = [];
+    // Extract quoted phrases
+    const quotedMatches = text.match(/"[^"]+"/g);
+    if (quotedMatches) {
+        phrases.push(...quotedMatches.map(m => m.replace(/"/g, '').toLowerCase()));
+    }
+    // Extract backticked code/terms
+    const backtickMatches = text.match(/`[^`]+`/g);
+    if (backtickMatches) {
+        phrases.push(...backtickMatches.map(m => m.replace(/`/g, '').toLowerCase()));
+    }
+    // Extract capitalized terms (likely proper nouns/tech terms)
+    const capitalMatches = text.match(/\b[A-Z][a-zA-Z0-9]+\b/g);
+    if (capitalMatches) {
+        phrases.push(...capitalMatches.map(m => m.toLowerCase()));
+    }
+    // Extract common tech terms that might not be capitalized
+    const techTerms = text.match(/\b(?:api|sql|css|html|json|xml|http|rest|graphql|docker|kubernetes|redis|postgres|sqlite|mongodb|react|vue|angular|node|npm|yarn|git|github|aws|gcp|azure)\b/gi);
+    if (techTerms) {
+        phrases.push(...techTerms.map(m => m.toLowerCase()));
+    }
+    return [...new Set(phrases)];
+}
+/**
+ * Calculate word overlap between two texts
+ * Returns the count of shared words
+ *
+ * @param textA - First text
+ * @param textB - Second text
+ * @returns Number of shared words
+ */
+export function wordOverlap(textA, textB) {
+    const setA = tokenize(textA);
+    const setB = tokenize(textB);
+    let overlap = 0;
+    for (const word of setA) {
+        if (setB.has(word))
+            overlap++;
+    }
+    return overlap;
+}
+/**
+ * Check if two texts share significant content
+ * Quick check before running full similarity calculation
+ *
+ * @param textA - First text
+ * @param textB - Second text
+ * @param minOverlap - Minimum word overlap required
+ * @returns True if texts share at least minOverlap words
+ */
+export function hasSignificantOverlap(textA, textB, minOverlap = 3) {
+    return wordOverlap(textA, textB) >= minOverlap;
+}
+//# sourceMappingURL=similarity.js.map

package/dist/memory/similarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"similarity.js","sourceRoot":"","sources":["../../src/memory/similarity.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI,GAAG,CACZ,IAAI;SACD,WAAW,EAAE;SACb,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,qBAAqB;SAC9C,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,0BAA0B;KAC9D,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa,EAAE,KAAa;IAC5D,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAE7B,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACnD,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAEnD,yBAAyB;IACzB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,YAAY,EAAE,CAAC;IACrC,CAAC;IAED,uCAAuC;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC;IAEnD,OAAO,YAAY,GAAG,KAAK,CAAC;AAC9B,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC5C,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,yBAAyB;IACzB,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAC7C,IAAI,aAAa,EAAE,CAAC;QAClB,OAAO,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC7E,CAAC;IAED,gCAAgC;IAChC,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAC/C,IAAI,eAAe,EAAE,CAAC;QACpB,OAAO,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC/E,CAAC;IAED,6DAA6D;IAC7D,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC;IAC5D,IAAI,cAAc,EAAE,CAAC;QACnB,OAAO,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,0DAA0D;IAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,gKAAgK,CAAC,CAAC;IAC/L,IAAI,SAAS,EAAE,CAAC;QACd,OAAO,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,KAAa,EAAE,KAAa;IACtD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAE7B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;IAChC,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAa,EACb,KAAa,EACb,aAAqB,CAAC;IAEtB,OAAO,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,UAAU,CAAC;AACjD,CAAC"}

package/dist/memory/store.d.ts

@@ -0,0 +1,179 @@
+/**
+ * Memory Store
+ *
+ * Core CRUD operations for the memory database.
+ * Handles storage, retrieval, and management of memories.
+ */
+import { Memory, MemoryInput, MemoryType, SearchOptions, SearchResult, MemoryConfig } from './types.js';
+import type { DefenceSource } from '../defence/types.js';
+/**
+ * Get truncation info from the last addMemory call
+ */
+export declare function getLastTruncationInfo(): {
+    wasTruncated: boolean;
+    originalLength: number;
+    truncatedLength: number;
+} | null;
+/**
+ * Convert database row to Memory object
+ */
+export declare function rowToMemory(row: Record<string, unknown>): Memory;
+/**
+ * Error thrown when memory creation is paused
+ */
+export declare class MemoryPausedError extends Error {
+    constructor();
+}
+/**
+ * Error thrown when memory is blocked by the defence firewall
+ */
+export declare class MemoryBlockedError extends Error {
+    constructor(reason: string);
+}
+/**
+ * Add a new memory
+ */
+export declare function addMemory(input: MemoryInput, config?: MemoryConfig, source?: DefenceSource): Memory;
+/**
+ * Get a memory by ID
+ */
+export declare function getMemoryById(id: number): Memory | null;
+/**
+ * Update a memory
+ */
+export declare function updateMemory(id: number, updates: Partial<MemoryInput>): Memory | null;
+/**
+ * Delete a memory
+ */
+export declare function deleteMemory(id: number): boolean;
+/**
+ * Access a memory (updates access count and timestamp, returns reinforced memory)
+ */
+export declare function accessMemory(id: number, config?: MemoryConfig): Memory | null;
+/**
+ * Reinforce a memory that appeared in search results
+ * Gives a small salience boost with diminishing returns based on access count.
+ * ORGANIC FEATURE: Searched memories get reinforced, closing the feedback loop
+ * so frequently-found memories grow stronger over time.
+ */
+export declare function reinforceFromSearch(memoryId: number): void;
+/**
+ * Enrichment result indicating what happened
+ */
+export interface EnrichmentResult {
+    enriched: boolean;
+    reason: string;
+}
+/**
+ * Enrich a memory with additional context
+ *
+ * This adds timestamped context to a memory when:
+ * 1. The new context is sufficiently related but different (new information)
+ * 2. The memory hasn't been enriched recently (cooldown)
+ * 3. The content won't exceed the size limit
+ *
+ * ORGANIC FEATURE: Memories grow with new context over time,
+ * mimicking how human memories are reconsolidated with new information
+ *
+ * @param memoryId - ID of the memory to enrich
+ * @param newContext - New context to add
+ * @param contextType - Type of context ('search' | 'access' | 'related')
+ * @returns EnrichmentResult indicating success or failure with reason
+ */
+export declare function enrichMemory(memoryId: number, newContext: string, contextType?: 'search' | 'access' | 'related'): EnrichmentResult;
+/**
+ * Clear enrichment cooldown for a memory (for testing)
+ */
+export declare function clearEnrichmentCooldown(memoryId: number): void;
+/**
+ * Get enrichment cooldown status for a memory
+ */
+export declare function getEnrichmentCooldownStatus(memoryId: number): {
+    onCooldown: boolean;
+    remainingMs: number;
+};
+/**
+ * Update persisted decay scores for all memories
+ * Called during consolidation and periodically by the API server
+ * Returns the number of memories updated
+ */
+export declare function updateDecayScores(): number;
+export declare function searchMemories(options: SearchOptions, config?: MemoryConfig): Promise<SearchResult[]>;
+/**
+ * Get all memories for a project
+ */
+export declare function getProjectMemories(project: string, config?: MemoryConfig): Memory[];
+/**
+ * Get recent memories
+ */
+export declare function getRecentMemories(limit?: number, project?: string): Memory[];
+/**
+ * Get memories by type
+ */
+export declare function getMemoriesByType(type: MemoryType, limit?: number): Memory[];
+/**
+ * Get high-priority memories (for context injection)
+ */
+export declare function getHighPriorityMemories(limit?: number, project?: string): Memory[];
+/**
+ * Promote a memory from short-term to long-term
+ */
+export declare function promoteMemory(id: number): Memory | null;
+/**
+ * Bulk delete decayed memories
+ */
+export declare function cleanupDecayedMemories(config?: MemoryConfig): number;
+/**
+ * Get memory statistics
+ */
+export declare function getMemoryStats(project?: string): {
+    total: number;
+    shortTerm: number;
+    longTerm: number;
+    episodic: number;
+    byCategory: Record<string, number>;
+    averageSalience: number;
+};
+export type RelationshipType = 'references' | 'extends' | 'contradicts' | 'related';
+export interface MemoryLink {
+    id: number;
+    sourceId: number;
+    targetId: number;
+    relationship: RelationshipType;
+    strength: number;
+    createdAt: Date;
+}
+/**
+ * Create a link between two memories
+ */
+export declare function createMemoryLink(sourceId: number, targetId: number, relationship: RelationshipType, strength?: number): MemoryLink | null;
+/**
+ * Get all memories related to a given memory
+ */
+export declare function getRelatedMemories(memoryId: number): {
+    memory: Memory;
+    relationship: RelationshipType;
+    strength: number;
+    direction: 'outgoing' | 'incoming';
+}[];
+/**
+ * Delete a memory link
+ */
+export declare function deleteMemoryLink(sourceId: number, targetId: number): boolean;
+/**
+ * Get all memory links
+ */
+export declare function getAllMemoryLinks(): MemoryLink[];
+/**
+ * Detect potential relationships for a new memory
+ * Uses three strategies in priority order:
+ * 1. Tag-based linking (shared tags)
+ * 2. Embedding-based semantic linking (cosine similarity >= 0.6)
+ * 3. FTS content similarity fallback (Jaccard similarity >= 0.3)
+ */
+export declare function detectRelationships(memory: Memory, maxResults?: number): {
+    targetId: number;
+    relationship: RelationshipType;
+    strength: number;
+}[];
+//# sourceMappingURL=store.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/memory/store.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EACL,MAAM,EACN,WAAW,EACX,UAAU,EAEV,aAAa,EACb,YAAY,EACZ,YAAY,EAEb,MAAM,YAAY,CAAC;AA8BpB,OAAO,KAAK,EAAE,aAAa,EAAyB,MAAM,qBAAqB,CAAC;AAwBhF;;GAEG;AACH,wBAAgB,qBAAqB;kBArBG,OAAO;oBAAkB,MAAM;qBAAmB,MAAM;SAuB/F;AAgCD;;GAEG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAmBhE;AAkBD;;GAEG;AACH,qBAAa,iBAAkB,SAAQ,KAAK;;CAK3C;AAED;;GAEG;AACH,qBAAa,kBAAmB,SAAQ,KAAK;gBAC/B,MAAM,EAAE,MAAM;CAI3B;AAeD;;GAEG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,WAAW,EAClB,MAAM,GAAE,YAA6B,EACrC,MAAM,CAAC,EAAE,aAAa,GACrB,MAAM,CA4IR;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAKvD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAC1B,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,OAAO,CAAC,WAAW,CAAC,GAC5B,MAAM,GAAG,IAAI,CAsDf;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAgBhD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAC1B,EAAE,EAAE,MAAM,EACV,MAAM,GAAE,YAA6B,GACpC,MAAM,GAAG,IAAI,CA8Df;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAgB1D;AAcD;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,EAAE,OAAO,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,YAAY,CAC1B,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,MAAM,EAClB,WAAW,GAAE,QAAQ,GAAG,QAAQ,GAAG,SAAoB,GACtD,gBAAgB,CAqDlB;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAE9D;AAED;;GAEG;AACH,wBAAgB,2BAA2B,CAAC,QAAQ,EAAE,MAAM,GAAG;IAC7D,UAAU,EAAE,OAAO,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;CACrB,CAcA;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,IAAI,MAAM,CAsB1C;AAkJD,wBAAsB,cAAc,CAClC,OAAO,EAAE,aAAa,EACtB,MAAM,GAAE,YAA6B,GACpC,OAAO,CAAC,YAAY,EAAE,CAAC,CA+MzB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,MAAM,EACf,MAAM,GAAE,YAA6B,GACpC,MAAM,EAAE,CAaV;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,GAAE,MAAW,EAClB,OAAO,CAAC,EAAE,MAAM,GACf,MAAM,EAAE,CAeV;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,UAAU,EAChB,KAAK,GAAE,MAAW,GACjB,MAAM,EAAE,CAUV;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,GAAE,MAAW,EAClB,OAAO,CAAC,EAAE,MAAM,GACf,MAAM,EAAE,CAkBV;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CASvD;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,GAAE,YAA6B,GACpC,MAAM,CAoBR;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG;IAChD,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,eAAe,EAAE,MAAM,CAAC;CACzB,CAyCA;AAMD,MAAM,MAAM,gBAAgB,GAAG,YAAY,GAAG,SAAS,GAAG,aAAa,GAAG,SAAS,CAAC;AAEpF,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,gBAAgB,CAAC;IAC/B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,IAAI,CAAC;CACjB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,YAAY,EAAE,gBAAgB,EAC9B,QAAQ,GAAE,MAAY,GACrB,UAAU,GAAG,IAAI,CA6BnB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG;IACpD,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,gBAAgB,CAAC;IAC/B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,UAAU,GAAG,UAAU,CAAC;CACpC,EAAE,CA6CF;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAM5E;AAED;;GAEG;AACH,wBAAgB,iBAAiB,IAAI,UAAU,EAAE,CAYhD;AAiHD;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,MAAM,EACd,UAAU,GAAE,MAAU,GACrB;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,gBAAgB,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,EAAE,CA6B1E"}