@framers/agentos 0.1.46 → 0.1.47

package/dist/memory/encoding/EncodingModel.d.ts

@@ -0,0 +1,67 @@
+/**
+ * @fileoverview Personality-modulated memory encoding.
+ *
+ * Cognitive science foundations:
+ * - **Yerkes-Dodson law**: Encoding quality peaks at moderate arousal
+ *   (inverted U). Very low or very high arousal impairs encoding.
+ * - **Flashbulb memories**: Highly emotional events create vivid,
+ *   persistent memory traces (Brown & Kulik, 1977).
+ * - **Mood-congruent encoding**: Content whose emotional valence matches
+ *   the current mood is encoded more strongly.
+ * - **HEXACO → attention weights**: Personality traits modulate *what*
+ *   features of the input are noticed and how strongly they are encoded.
+ *
+ * @module agentos/memory/encoding/EncodingModel
+ */
+import type { EncodingWeights, EncodingResult, ContentFeatures, EmotionalContext } from '../types.js';
+import type { HexacoTraits, PADState, EncodingConfig } from '../config.js';
+/**
+ * Derive per-feature attention weights from HEXACO personality traits.
+ * Each weight is in [0, 1] and modulates how much a given content feature
+ * contributes to encoding strength.
+ */
+export declare function computeEncodingWeights(traits: HexacoTraits): EncodingWeights;
+/**
+ * Encoding quality modifier based on arousal level.
+ * Returns a multiplier in [0.3, 1.0], peaking at arousal = 0.5 (moderate).
+ *
+ *   f(a) = 1 - 4 * (a - 0.5)^2
+ *
+ * @param arousal01 Arousal normalised to 0..1 range.
+ */
+export declare function yerksDodson(arousal01: number): number;
+/**
+ * Compute a composite attention multiplier from content features weighted
+ * by personality-derived encoding weights.
+ */
+export declare function computeAttentionMultiplier(weights: EncodingWeights, features: ContentFeatures): number;
+/**
+ * Boost factor when content emotional valence matches current mood.
+ *
+ * Positive product means mood and content are congruent
+ * (both positive or both negative).
+ */
+export declare function moodCongruenceBoost(currentValence: number, contentValence: number, emotionalSensitivity: number): number;
+/**
+ * Determine whether this memory qualifies as a flashbulb memory.
+ * Flashbulb criteria: emotional intensity > threshold.
+ */
+export declare function isFlashbulbMemory(emotionalIntensity: number, threshold?: number): boolean;
+/**
+ * Create the EmotionalContext snapshot for a memory trace.
+ * Blends content sentiment with current mood (70/30 split).
+ *
+ * @param currentMood  Current PAD state from MoodEngine.
+ * @param contentSentiment  Estimated sentiment of the content (-1..1). Defaults to 0.
+ * @param gmiMood  Current GMI mood enum string.
+ */
+export declare function buildEmotionalContext(currentMood: PADState, gmiMood: string, contentSentiment?: number): EmotionalContext;
+/**
+ * Compute encoding parameters for a new memory trace.
+ *
+ * Combines personality-modulated attention, Yerkes-Dodson arousal curve,
+ * mood-congruent encoding bias, and flashbulb detection into a single
+ * encoding result.
+ */
+export declare function computeEncodingStrength(currentMood: PADState, traits: HexacoTraits, contentFeatures: ContentFeatures, contentSentiment?: number, config?: EncodingConfig): EncodingResult;
+//# sourceMappingURL=EncodingModel.d.ts.map

package/dist/memory/encoding/EncodingModel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"EncodingModel.d.ts","sourceRoot":"","sources":["../../../src/memory/encoding/EncodingModel.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EACV,eAAe,EACf,cAAc,EACd,eAAe,EACf,gBAAgB,EACjB,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAU3E;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,YAAY,GAAG,eAAe,CAgB5E;AAMD;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAGrD;AAMD;;;GAGG;AACH,wBAAgB,0BAA0B,CACxC,OAAO,EAAE,eAAe,EACxB,QAAQ,EAAE,eAAe,GACxB,MAAM,CAaR;AAMD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,cAAc,EAAE,MAAM,EACtB,cAAc,EAAE,MAAM,EACtB,oBAAoB,EAAE,MAAM,GAC3B,MAAM,CAGR;AAMD;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,kBAAkB,EAAE,MAAM,EAC1B,SAAS,GAAE,MAAmD,GAC7D,OAAO,CAET;AAMD;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACnC,WAAW,EAAE,QAAQ,EACrB,OAAO,EAAE,MAAM,EACf,gBAAgB,GAAE,MAAU,GAC3B,gBAAgB,CAalB;AAMD;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,WAAW,EAAE,QAAQ,EACrB,MAAM,EAAE,YAAY,EACpB,eAAe,EAAE,eAAe,EAChC,gBAAgB,GAAE,MAAU,EAC5B,MAAM,GAAE,cAAwC,GAC/C,cAAc,CA8ChB"}

package/dist/memory/encoding/EncodingModel.js

@@ -0,0 +1,171 @@
+/**
+ * @fileoverview Personality-modulated memory encoding.
+ *
+ * Cognitive science foundations:
+ * - **Yerkes-Dodson law**: Encoding quality peaks at moderate arousal
+ *   (inverted U). Very low or very high arousal impairs encoding.
+ * - **Flashbulb memories**: Highly emotional events create vivid,
+ *   persistent memory traces (Brown & Kulik, 1977).
+ * - **Mood-congruent encoding**: Content whose emotional valence matches
+ *   the current mood is encoded more strongly.
+ * - **HEXACO → attention weights**: Personality traits modulate *what*
+ *   features of the input are noticed and how strongly they are encoded.
+ *
+ * @module agentos/memory/encoding/EncodingModel
+ */
+import { DEFAULT_ENCODING_CONFIG } from '../config.js';
+// ---------------------------------------------------------------------------
+// HEXACO → Encoding attention weights
+// ---------------------------------------------------------------------------
+const clamp01 = (v) => v == null ? 0.5 : Math.max(0, Math.min(1, v));
+/**
+ * Derive per-feature attention weights from HEXACO personality traits.
+ * Each weight is in [0, 1] and modulates how much a given content feature
+ * contributes to encoding strength.
+ */
+export function computeEncodingWeights(traits) {
+    const o = clamp01(traits.openness);
+    const c = clamp01(traits.conscientiousness);
+    const e = clamp01(traits.emotionality);
+    const x = clamp01(traits.extraversion);
+    const a = clamp01(traits.agreeableness);
+    const h = clamp01(traits.honesty);
+    return {
+        noveltyAttention: 0.3 + o * 0.7,
+        proceduralAttention: 0.3 + c * 0.7,
+        emotionalSensitivity: 0.2 + e * 0.8,
+        socialAttention: 0.2 + x * 0.8,
+        cooperativeAttention: 0.2 + a * 0.8,
+        ethicalAttention: 0.2 + h * 0.8,
+    };
+}
+// ---------------------------------------------------------------------------
+// Yerkes-Dodson inverted U
+// ---------------------------------------------------------------------------
+/**
+ * Encoding quality modifier based on arousal level.
+ * Returns a multiplier in [0.3, 1.0], peaking at arousal = 0.5 (moderate).
+ *
+ *   f(a) = 1 - 4 * (a - 0.5)^2
+ *
+ * @param arousal01 Arousal normalised to 0..1 range.
+ */
+export function yerksDodson(arousal01) {
+    const centered = arousal01 - 0.5;
+    return Math.max(0.3, 1.0 - 4 * centered * centered);
+}
+// ---------------------------------------------------------------------------
+// Content-type attention multiplier
+// ---------------------------------------------------------------------------
+/**
+ * Compute a composite attention multiplier from content features weighted
+ * by personality-derived encoding weights.
+ */
+export function computeAttentionMultiplier(weights, features) {
+    let m = 0.5; // base attention
+    if (features.hasNovelty)
+        m += weights.noveltyAttention * 0.15;
+    if (features.hasProcedure)
+        m += weights.proceduralAttention * 0.15;
+    if (features.hasEmotion)
+        m += weights.emotionalSensitivity * 0.10;
+    if (features.hasSocialContent)
+        m += weights.socialAttention * 0.10;
+    if (features.hasCooperation)
+        m += weights.cooperativeAttention * 0.10;
+    if (features.hasEthicalContent)
+        m += weights.ethicalAttention * 0.10;
+    if (features.hasContradiction)
+        m += 0.15; // contradictions always draw attention
+    m += features.topicRelevance * 0.15;
+    return Math.min(1.0, m);
+}
+// ---------------------------------------------------------------------------
+// Mood-congruent encoding bias
+// ---------------------------------------------------------------------------
+/**
+ * Boost factor when content emotional valence matches current mood.
+ *
+ * Positive product means mood and content are congruent
+ * (both positive or both negative).
+ */
+export function moodCongruenceBoost(currentValence, contentValence, emotionalSensitivity) {
+    const congruence = Math.max(0, currentValence * contentValence);
+    return 1 + congruence * emotionalSensitivity * 0.3;
+}
+// ---------------------------------------------------------------------------
+// Flashbulb detection
+// ---------------------------------------------------------------------------
+/**
+ * Determine whether this memory qualifies as a flashbulb memory.
+ * Flashbulb criteria: emotional intensity > threshold.
+ */
+export function isFlashbulbMemory(emotionalIntensity, threshold = DEFAULT_ENCODING_CONFIG.flashbulbThreshold) {
+    return emotionalIntensity > threshold;
+}
+// ---------------------------------------------------------------------------
+// Build emotional context from PAD state + content sentiment
+// ---------------------------------------------------------------------------
+/**
+ * Create the EmotionalContext snapshot for a memory trace.
+ * Blends content sentiment with current mood (70/30 split).
+ *
+ * @param currentMood  Current PAD state from MoodEngine.
+ * @param contentSentiment  Estimated sentiment of the content (-1..1). Defaults to 0.
+ * @param gmiMood  Current GMI mood enum string.
+ */
+export function buildEmotionalContext(currentMood, gmiMood, contentSentiment = 0) {
+    const valence = contentSentiment * 0.7 + currentMood.valence * 0.3;
+    // Normalise arousal from PAD range (-1..1) to (0..1)
+    const arousal = (currentMood.arousal + 1) / 2;
+    const intensity = Math.abs(valence) * arousal;
+    return {
+        valence,
+        arousal,
+        dominance: currentMood.dominance,
+        intensity,
+        gmiMood,
+    };
+}
+// ---------------------------------------------------------------------------
+// Main encoding function
+// ---------------------------------------------------------------------------
+/**
+ * Compute encoding parameters for a new memory trace.
+ *
+ * Combines personality-modulated attention, Yerkes-Dodson arousal curve,
+ * mood-congruent encoding bias, and flashbulb detection into a single
+ * encoding result.
+ */
+export function computeEncodingStrength(currentMood, traits, contentFeatures, contentSentiment = 0, config = DEFAULT_ENCODING_CONFIG) {
+    const weights = computeEncodingWeights(traits);
+    const base = config.baseStrength;
+    // Arousal boost via Yerkes-Dodson (normalise -1..1 → 0..1)
+    const arousal01 = (currentMood.arousal + 1) / 2;
+    const arousalBoost = yerksDodson(arousal01);
+    // Emotional intensity
+    const valence = contentSentiment * 0.7 + currentMood.valence * 0.3;
+    const emotionalIntensity = Math.abs(valence) * arousal01;
+    const emotionalBoost = 1 + emotionalIntensity * weights.emotionalSensitivity * 0.5;
+    // Content-type attention multiplier
+    const attentionMultiplier = computeAttentionMultiplier(weights, contentFeatures);
+    // Mood-congruent encoding
+    const congruenceBoost = moodCongruenceBoost(currentMood.valence, contentSentiment, weights.emotionalSensitivity);
+    // Flashbulb detection
+    const flashbulb = isFlashbulbMemory(emotionalIntensity, config.flashbulbThreshold);
+    const flashbulbBoost = flashbulb ? config.flashbulbStrengthMultiplier : 1.0;
+    // Composite initial strength
+    const strength = Math.min(1.0, base * arousalBoost * emotionalBoost * attentionMultiplier * congruenceBoost * flashbulbBoost);
+    // Stability: higher strength → more stable; flashbulb → much more stable
+    const stabilityMultiplier = flashbulb ? config.flashbulbStabilityMultiplier : 1.0;
+    const stability = config.baseStabilityMs * (1 + strength * 6) * stabilityMultiplier;
+    // Importance: blend of strength and content relevance
+    const importance = Math.min(1.0, strength * 0.6 + attentionMultiplier * 0.4);
+    return {
+        initialStrength: strength,
+        stability,
+        importance,
+        isFlashbulb: flashbulb,
+    };
+}
+//# sourceMappingURL=EncodingModel.js.map

package/dist/memory/encoding/EncodingModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EncodingModel.js","sourceRoot":"","sources":["../../../src/memory/encoding/EncodingModel.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AASH,OAAO,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AAEvD,8EAA8E;AAC9E,sCAAsC;AACtC,8EAA8E;AAE9E,MAAM,OAAO,GAAG,CAAC,CAAqB,EAAU,EAAE,CAChD,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAEhD;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAC,MAAoB;IACzD,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACnC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAC5C,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IACvC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IACvC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IACxC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAElC,OAAO;QACL,gBAAgB,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG;QAC/B,mBAAmB,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG;QAClC,oBAAoB,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG;QACnC,eAAe,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG;QAC9B,oBAAoB,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG;QACnC,gBAAgB,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG;KAChC,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,2BAA2B;AAC3B,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB;IAC3C,MAAM,QAAQ,GAAG,SAAS,GAAG,GAAG,CAAC;IACjC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,QAAQ,GAAG,QAAQ,CAAC,CAAC;AACtD,CAAC;AAED,8EAA8E;AAC9E,oCAAoC;AACpC,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,0BAA0B,CACxC,OAAwB,EACxB,QAAyB;IAEzB,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,iBAAiB;IAE9B,IAAI,QAAQ,CAAC,UAAU;QAAE,CAAC,IAAI,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC;IAC9D,IAAI,QAAQ,CAAC,YAAY;QAAE,CAAC,IAAI,OAAO,CAAC,mBAAmB,GAAG,IAAI,CAAC;IACnE,IAAI,QAAQ,CAAC,UAAU;QAAE,CAAC,IAAI,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC;IAClE,IAAI,QAAQ,CAAC,gBAAgB;QAAE,CAAC,IAAI,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC;IACnE,IAAI,QAAQ,CAAC,cAAc;QAAE,CAAC,IAAI,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC;IACtE,IAAI,QAAQ,CAAC,iBAAiB;QAAE,CAAC,IAAI,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC;IACrE,IAAI,QAAQ,CAAC,gBAAgB;QAAE,CAAC,IAAI,IAAI,CAAC,CAAC,uCAAuC;IACjF,CAAC,IAAI,QAAQ,CAAC,cAAc,GAAG,IAAI,CAAC;IAEpC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAC1B,CAAC;AAED,8EAA8E;AAC9E,+BAA+B;AAC/B,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,cAAsB,EACtB,cAAsB,EACtB,oBAA4B;IAE5B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,GAAG,cAAc,CAAC,CAAC;IAChE,OAAO,CAAC,GAAG,UAAU,GAAG,oBAAoB,GAAG,GAAG,CAAC;AACrD,CAAC;AAED,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAC/B,kBAA0B,EAC1B,YAAoB,uBAAuB,CAAC,kBAAkB;IAE9D,OAAO,kBAAkB,GAAG,SAAS,CAAC;AACxC,CAAC;AAED,8EAA8E;AAC9E,6DAA6D;AAC7D,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CACnC,WAAqB,EACrB,OAAe,EACf,mBAA2B,CAAC;IAE5B,MAAM,OAAO,GAAG,gBAAgB,GAAG,GAAG,GAAG,WAAW,CAAC,OAAO,GAAG,GAAG,CAAC;IACnE,qDAAqD;IACrD,MAAM,OAAO,GAAG,CAAC,WAAW,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC;IAE9C,OAAO;QACL,OAAO;QACP,OAAO;QACP,SAAS,EAAE,WAAW,CAAC,SAAS;QAChC,SAAS;QACT,OAAO;KACR,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,yBAAyB;AACzB,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CACrC,WAAqB,EACrB,MAAoB,EACpB,eAAgC,EAChC,mBAA2B,CAAC,EAC5B,SAAyB,uBAAuB;IAEhD,MAAM,OAAO,GAAG,sBAAsB,CAAC,MAAM,CAAC,CAAC;IAC/C,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC;IAEjC,2DAA2D;IAC3D,MAAM,SAAS,GAAG,CAAC,WAAW,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAChD,MAAM,YAAY,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAE5C,sBAAsB;IACtB,MAAM,OAAO,GAAG,gBAAgB,GAAG,GAAG,GAAG,WAAW,CAAC,OAAO,GAAG,GAAG,CAAC;IACnE,MAAM,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC;IACzD,MAAM,cAAc,GAAG,CAAC,GAAG,kBAAkB,GAAG,OAAO,CAAC,oBAAoB,GAAG,GAAG,CAAC;IAEnF,oCAAoC;IACpC,MAAM,mBAAmB,GAAG,0BAA0B,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;IAEjF,0BAA0B;IAC1B,MAAM,eAAe,GAAG,mBAAmB,CACzC,WAAW,CAAC,OAAO,EACnB,gBAAgB,EAChB,OAAO,CAAC,oBAAoB,CAC7B,CAAC;IAEF,sBAAsB;IACtB,MAAM,SAAS,GAAG,iBAAiB,CAAC,kBAAkB,EAAE,MAAM,CAAC,kBAAkB,CAAC,CAAC;IACnF,MAAM,cAAc,GAAG,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,2BAA2B,CAAC,CAAC,CAAC,GAAG,CAAC;IAE5E,6BAA6B;IAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CACvB,GAAG,EACH,IAAI,GAAG,YAAY,GAAG,cAAc,GAAG,mBAAmB,GAAG,eAAe,GAAG,cAAc,CAC9F,CAAC;IAEF,yEAAyE;IACzE,MAAM,mBAAmB,GAAG,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,4BAA4B,CAAC,CAAC,CAAC,GAAG,CAAC;IAClF,MAAM,SAAS,GAAG,MAAM,CAAC,eAAe,GAAG,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,GAAG,mBAAmB,CAAC;IAEpF,sDAAsD;IACtD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,GAAG,GAAG,GAAG,mBAAmB,GAAG,GAAG,CAAC,CAAC;IAE7E,OAAO;QACL,eAAe,EAAE,QAAQ;QACzB,SAAS;QACT,UAAU;QACV,WAAW,EAAE,SAAS;KACvB,CAAC;AACJ,CAAC"}

package/dist/memory/extension/CognitiveMemoryExtension.d.ts

@@ -0,0 +1,18 @@
+/**
+ * @fileoverview Extension registration for the Cognitive Memory System.
+ *
+ * Registers the CognitiveMemoryManager as a MemoryProviderDescriptor
+ * in the AgentOS extension system, making it discoverable and configurable.
+ *
+ * @module agentos/memory/extension/CognitiveMemoryExtension
+ */
+import { type MemoryProviderPayload, type MemoryProviderDescriptor } from '../../extensions/types.js';
+/**
+ * Create a MemoryProviderDescriptor for the cognitive memory system.
+ *
+ * This is a factory function rather than a static constant because
+ * the provider needs runtime dependencies (vector store, embedding
+ * manager, etc.) injected at activation time.
+ */
+export declare function createCognitiveMemoryDescriptor(overrides?: Partial<MemoryProviderPayload>): MemoryProviderDescriptor;
+//# sourceMappingURL=CognitiveMemoryExtension.d.ts.map

package/dist/memory/extension/CognitiveMemoryExtension.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CognitiveMemoryExtension.d.ts","sourceRoot":"","sources":["../../../src/memory/extension/CognitiveMemoryExtension.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAEL,KAAK,qBAAqB,EAC1B,KAAK,wBAAwB,EAC9B,MAAM,2BAA2B,CAAC;AAiFnC;;;;;;GAMG;AACH,wBAAgB,+BAA+B,CAC7C,SAAS,CAAC,EAAE,OAAO,CAAC,qBAAqB,CAAC,GACzC,wBAAwB,CAgF1B"}

package/dist/memory/extension/CognitiveMemoryExtension.js

@@ -0,0 +1,131 @@
+/**
+ * @fileoverview Extension registration for the Cognitive Memory System.
+ *
+ * Registers the CognitiveMemoryManager as a MemoryProviderDescriptor
+ * in the AgentOS extension system, making it discoverable and configurable.
+ *
+ * @module agentos/memory/extension/CognitiveMemoryExtension
+ */
+import { EXTENSION_KIND_MEMORY_PROVIDER, } from '../../extensions/types.js';
+const NEUTRAL_PAD = {
+    valence: 0,
+    arousal: 0,
+    dominance: 0,
+};
+function isRuntimeManager(value) {
+    return (typeof value === 'object' &&
+        value !== null &&
+        typeof value.encode === 'function' &&
+        typeof value.retrieve === 'function');
+}
+function parseStoreInput(data) {
+    if (typeof data === 'string') {
+        return { input: data };
+    }
+    if (typeof data !== 'object' || data === null) {
+        throw new Error('Cognitive memory store() expects a string or { input, mood?, gmiMood?, options? }.');
+    }
+    const parsed = data;
+    if (typeof parsed.input !== 'string' || !parsed.input.trim()) {
+        throw new Error('Cognitive memory store() requires a non-empty input string.');
+    }
+    return {
+        input: parsed.input,
+        mood: parsed.mood,
+        gmiMood: parsed.gmiMood,
+        options: parsed.options,
+    };
+}
+function parseQueryInput(query) {
+    if (typeof query === 'string') {
+        return { text: query, mood: NEUTRAL_PAD };
+    }
+    if (typeof query !== 'object' || query === null) {
+        throw new Error('Cognitive memory query() expects a string or { text|query, mood? }.');
+    }
+    const parsed = query;
+    const text = parsed.text ?? parsed.query;
+    if (typeof text !== 'string' || !text.trim()) {
+        throw new Error('Cognitive memory query() requires a non-empty query string.');
+    }
+    return {
+        text,
+        mood: parsed.mood ?? NEUTRAL_PAD,
+    };
+}
+/**
+ * Create a MemoryProviderDescriptor for the cognitive memory system.
+ *
+ * This is a factory function rather than a static constant because
+ * the provider needs runtime dependencies (vector store, embedding
+ * manager, etc.) injected at activation time.
+ */
+export function createCognitiveMemoryDescriptor(overrides) {
+    let manager = null;
+    const payload = {
+        name: 'cognitive-memory',
+        description: 'Cognitive science-grounded memory system with personality-affected ' +
+            'encoding/retrieval, Ebbinghaus decay, mood-congruent recall, and ' +
+            'Baddeley working memory slots.',
+        supportedTypes: ['episodic', 'semantic', 'procedural', 'prospective'],
+        initialize: async (config) => {
+            const candidate = config.manager;
+            if (!isRuntimeManager(candidate)) {
+                throw new Error('Cognitive memory provider requires initialize({ manager }) with encode()/retrieve() methods.');
+            }
+            manager = candidate;
+        },
+        store: async (_collectionId, data) => {
+            if (!manager) {
+                throw new Error('Cognitive memory provider not initialized.');
+            }
+            const input = parseStoreInput(data);
+            const trace = await manager.encode(input.input, input.mood ?? NEUTRAL_PAD, input.gmiMood ?? '', input.options);
+            return trace.id;
+        },
+        query: async (_collectionId, query, options) => {
+            if (!manager) {
+                throw new Error('Cognitive memory provider not initialized.');
+            }
+            const input = parseQueryInput(query);
+            const result = await manager.retrieve(input.text, input.mood, options ?? {});
+            return result.retrieved;
+        },
+        delete: async (_collectionId, ids) => {
+            if (!manager) {
+                throw new Error('Cognitive memory provider not initialized.');
+            }
+            const store = manager.getStore?.();
+            if (!store?.softDelete) {
+                throw new Error('Cognitive memory provider does not expose delete support.');
+            }
+            await Promise.all(ids.map((id) => Promise.resolve(store.softDelete?.(id))));
+        },
+        shutdown: async () => {
+            if (!manager)
+                return;
+            await manager.shutdown();
+            manager = null;
+        },
+        ...overrides,
+    };
+    return {
+        id: 'agentos-cognitive-memory',
+        kind: EXTENSION_KIND_MEMORY_PROVIDER,
+        priority: 100,
+        enableByDefault: true,
+        payload,
+        metadata: {
+            version: '1.0.0',
+            cognitiveModels: [
+                'atkinson-shiffrin',
+                'baddeley-working-memory',
+                'ebbinghaus-forgetting',
+                'yerkes-dodson',
+                'tulving-episodic-semantic',
+                'anderson-spreading-activation',
+            ],
+        },
+    };
+}
+//# sourceMappingURL=CognitiveMemoryExtension.js.map

package/dist/memory/extension/CognitiveMemoryExtension.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CognitiveMemoryExtension.js","sourceRoot":"","sources":["../../../src/memory/extension/CognitiveMemoryExtension.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EACL,8BAA8B,GAG/B,MAAM,2BAA2B,CAAC;AA2BnC,MAAM,WAAW,GAAa;IAC5B,OAAO,EAAE,CAAC;IACV,OAAO,EAAE,CAAC;IACV,SAAS,EAAE,CAAC;CACb,CAAC;AAEF,SAAS,gBAAgB,CAAC,KAAc;IACtC,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,OAAQ,KAAuC,CAAC,MAAM,KAAK,UAAU;QACrE,OAAQ,KAAuC,CAAC,QAAQ,KAAK,UAAU,CACxE,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,IAAa;IACpC,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC7B,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACzB,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAC9C,MAAM,IAAI,KAAK,CACb,oFAAoF,CACrF,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,IAA0C,CAAC;IAC1D,IAAI,OAAO,MAAM,CAAC,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC7D,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;IACjF,CAAC;IACD,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,OAAO,EAAE,MAAM,CAAC,OAAO;KACxB,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,KAAc;IACrC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;IAC5C,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAChD,MAAM,IAAI,KAAK,CAAC,qEAAqE,CAAC,CAAC;IACzF,CAAC;IACD,MAAM,MAAM,GAAG,KAAkC,CAAC;IAClD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC;IACzC,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QAC7C,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;IACjF,CAAC;IACD,OAAO;QACL,IAAI;QACJ,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,WAAW;KACjC,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,+BAA+B,CAC7C,SAA0C;IAE1C,IAAI,OAAO,GAAyC,IAAI,CAAC;IAEzD,MAAM,OAAO,GAA0B;QACrC,IAAI,EAAE,kBAAkB;QACxB,WAAW,EACT,qEAAqE;YACrE,mEAAmE;YACnE,gCAAgC;QAClC,cAAc,EAAE,CAAC,UAAU,EAAE,UAAU,EAAE,YAAY,EAAE,aAAa,CAAC;QACrE,UAAU,EAAE,KAAK,EAAE,MAA+B,EAAE,EAAE;YACpD,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC;YACjC,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,EAAE,CAAC;gBACjC,MAAM,IAAI,KAAK,CACb,8FAA8F,CAC/F,CAAC;YACJ,CAAC;YACD,OAAO,GAAG,SAAS,CAAC;QACtB,CAAC;QACD,KAAK,EAAE,KAAK,EAAE,aAAqB,EAAE,IAAa,EAAE,EAAE;YACpD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;YAChE,CAAC;YACD,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,MAAM,CAChC,KAAK,CAAC,KAAK,EACX,KAAK,CAAC,IAAI,IAAI,WAAW,EACzB,KAAK,CAAC,OAAO,IAAI,EAAE,EACnB,KAAK,CAAC,OAAO,CACd,CAAC;YACF,OAAO,KAAK,CAAC,EAAE,CAAC;QAClB,CAAC;QACD,KAAK,EAAE,KAAK,EAAE,aAAqB,EAAE,KAAc,EAAE,OAAiC,EAAE,EAAE;YACxF,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;YAChE,CAAC;YACD,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;YACrC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,CACnC,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,IAAI,EACT,OAAiD,IAAI,EAAE,CACzD,CAAC;YACF,OAAO,MAAM,CAAC,SAAsB,CAAC;QACvC,CAAC;QACD,MAAM,EAAE,KAAK,EAAE,aAAqB,EAAE,GAAa,EAAE,EAAE;YACrD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;YAChE,CAAC;YACD,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAC;YAC/E,CAAC;YACD,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,CAAC;QACD,QAAQ,EAAE,KAAK,IAAI,EAAE;YACnB,IAAI,CAAC,OAAO;gBAAE,OAAO;YACrB,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;YACzB,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;QACD,GAAG,SAAS;KACb,CAAC;IAEF,OAAO;QACL,EAAE,EAAE,0BAA0B;QAC9B,IAAI,EAAE,8BAA8B;QACpC,QAAQ,EAAE,GAAG;QACb,eAAe,EAAE,IAAI;QACrB,OAAO;QACP,QAAQ,EAAE;YACR,OAAO,EAAE,OAAO;YAChB,eAAe,EAAE;gBACf,mBAAmB;gBACnB,yBAAyB;gBACzB,uBAAuB;gBACvB,eAAe;gBACf,2BAA2B;gBAC3B,+BAA+B;aAChC;SACF;KACF,CAAC;AACJ,CAAC"}

package/dist/memory/graph/GraphologyMemoryGraph.d.ts

@@ -0,0 +1,29 @@
+/**
+ * @fileoverview In-memory graphology-based memory graph (dev/testing).
+ *
+ * Follows the CapabilityGraph pattern: lazy-loaded graphology,
+ * O(1) neighbor lookups, sub-ms traversal for typical memory counts.
+ *
+ * @module agentos/memory/graph/GraphologyMemoryGraph
+ */
+import type { IMemoryGraph, MemoryGraphNodeMeta, MemoryEdge, MemoryEdgeType, SpreadingActivationConfig, ActivatedNode, MemoryCluster } from './IMemoryGraph.js';
+export declare class GraphologyMemoryGraph implements IMemoryGraph {
+    private graph;
+    initialize(): Promise<void>;
+    private ensureGraph;
+    addNode(memoryId: string, metadata: MemoryGraphNodeMeta): Promise<void>;
+    removeNode(memoryId: string): Promise<void>;
+    hasNode(memoryId: string): boolean;
+    addEdge(edge: MemoryEdge): Promise<void>;
+    getEdges(memoryId: string, type?: MemoryEdgeType): MemoryEdge[];
+    removeEdge(sourceId: string, targetId: string): Promise<void>;
+    spreadingActivation(seedIds: string[], config?: SpreadingActivationConfig): Promise<ActivatedNode[]>;
+    recordCoActivation(memoryIds: string[], learningRate?: number): Promise<void>;
+    getConflicts(memoryId: string): MemoryEdge[];
+    detectClusters(minSize?: number): Promise<MemoryCluster[]>;
+    nodeCount(): number;
+    edgeCount(): number;
+    clear(): void;
+    shutdown(): Promise<void>;
+}
+//# sourceMappingURL=GraphologyMemoryGraph.d.ts.map

package/dist/memory/graph/GraphologyMemoryGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphologyMemoryGraph.d.ts","sourceRoot":"","sources":["../../../src/memory/graph/GraphologyMemoryGraph.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EACV,YAAY,EACZ,mBAAmB,EACnB,UAAU,EACV,cAAc,EACd,yBAAyB,EACzB,aAAa,EACb,aAAa,EACd,MAAM,mBAAmB,CAAC;AA4B3B,qBAAa,qBAAsB,YAAW,YAAY;IACxD,OAAO,CAAC,KAAK,CAA2B;IAElC,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAKjC,OAAO,CAAC,WAAW;IAOb,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,mBAAmB,GAAG,OAAO,CAAC,IAAI,CAAC;IASvE,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAOjD,OAAO,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAM5B,OAAO,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC;IAyB9C,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,cAAc,GAAG,UAAU,EAAE;IAoBzD,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAU7D,mBAAmB,CACvB,OAAO,EAAE,MAAM,EAAE,EACjB,MAAM,CAAC,EAAE,yBAAyB,GACjC,OAAO,CAAC,aAAa,EAAE,CAAC;IAqBrB,kBAAkB,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,YAAY,GAAE,MAAY,GAAG,OAAO,CAAC,IAAI,CAAC;IA2BxF,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,UAAU,EAAE;IAMtC,cAAc,CAAC,OAAO,GAAE,MAAU,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAuDnE,SAAS,IAAI,MAAM;IAInB,SAAS,IAAI,MAAM;IAInB,KAAK,IAAI,IAAI;IAIP,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;CAIhC"}

package/dist/memory/graph/GraphologyMemoryGraph.js

@@ -0,0 +1,224 @@
+/**
+ * @fileoverview In-memory graphology-based memory graph (dev/testing).
+ *
+ * Follows the CapabilityGraph pattern: lazy-loaded graphology,
+ * O(1) neighbor lookups, sub-ms traversal for typical memory counts.
+ *
+ * @module agentos/memory/graph/GraphologyMemoryGraph
+ */
+import { spreadActivation } from './SpreadingActivation.js';
+let _GraphCtor;
+async function resolveGraphology() {
+    if (_GraphCtor)
+        return _GraphCtor;
+    try {
+        const mod = await import('graphology');
+        _GraphCtor = (mod.default ?? mod);
+        return _GraphCtor;
+    }
+    catch {
+        throw new Error('graphology is required for GraphologyMemoryGraph but was not found. ' +
+            'Install it: npm install graphology graphology-types');
+    }
+}
+// ---------------------------------------------------------------------------
+// Implementation
+// ---------------------------------------------------------------------------
+export class GraphologyMemoryGraph {
+    constructor() {
+        this.graph = null;
+    }
+    async initialize() {
+        const GraphCtor = await resolveGraphology();
+        this.graph = new GraphCtor({ multi: false, type: 'undirected' });
+    }
+    ensureGraph() {
+        if (!this.graph)
+            throw new Error('GraphologyMemoryGraph not initialized.');
+        return this.graph;
+    }
+    // --- Node operations ---
+    async addNode(memoryId, metadata) {
+        const g = this.ensureGraph();
+        if (g.hasNode(memoryId)) {
+            g.replaceNodeAttributes(memoryId, metadata);
+        }
+        else {
+            g.addNode(memoryId, metadata);
+        }
+    }
+    async removeNode(memoryId) {
+        const g = this.ensureGraph();
+        if (g.hasNode(memoryId)) {
+            g.dropNode(memoryId);
+        }
+    }
+    hasNode(memoryId) {
+        return this.graph?.hasNode(memoryId) ?? false;
+    }
+    // --- Edge operations ---
+    async addEdge(edge) {
+        const g = this.ensureGraph();
+        if (!g.hasNode(edge.sourceId) || !g.hasNode(edge.targetId))
+            return;
+        if (edge.sourceId === edge.targetId)
+            return;
+        try {
+            const existing = g.edge(edge.sourceId, edge.targetId);
+            if (existing) {
+                const attrs = g.getEdgeAttributes(existing);
+                if (edge.weight > attrs.weight) {
+                    g.setEdgeAttribute(existing, 'weight', edge.weight);
+                    g.setEdgeAttribute(existing, 'type', edge.type);
+                }
+            }
+            else {
+                g.addEdge(edge.sourceId, edge.targetId, {
+                    type: edge.type,
+                    weight: edge.weight,
+                    createdAt: edge.createdAt,
+                });
+            }
+        }
+        catch {
+            // Edge already exists in other direction (undirected)
+        }
+    }
+    getEdges(memoryId, type) {
+        const g = this.ensureGraph();
+        if (!g.hasNode(memoryId))
+            return [];
+        const edges = [];
+        g.forEachEdge(memoryId, (_edge, attrs, source, target) => {
+            const edgeType = attrs.type;
+            if (!type || edgeType === type) {
+                edges.push({
+                    sourceId: source,
+                    targetId: target,
+                    type: edgeType,
+                    weight: attrs.weight,
+                    createdAt: attrs.createdAt,
+                });
+            }
+        });
+        return edges;
+    }
+    async removeEdge(sourceId, targetId) {
+        const g = this.ensureGraph();
+        try {
+            const edge = g.edge(sourceId, targetId);
+            if (edge)
+                g.dropEdge(edge);
+        }
+        catch { /* no-op */ }
+    }
+    // --- Spreading activation ---
+    async spreadingActivation(seedIds, config) {
+        const g = this.ensureGraph();
+        // Delegate to pure-function implementation
+        return spreadActivation({
+            seedIds,
+            getNeighbors: (nodeId) => {
+                if (!g.hasNode(nodeId))
+                    return [];
+                const neighbors = [];
+                g.forEachEdge(nodeId, (_edge, attrs, source, target) => {
+                    const neighborId = source === nodeId ? target : source;
+                    neighbors.push({ id: neighborId, weight: attrs.weight });
+                });
+                return neighbors;
+            },
+            config,
+        });
+    }
+    // --- Co-activation (Hebbian learning) ---
+    async recordCoActivation(memoryIds, learningRate = 0.1) {
+        const g = this.ensureGraph();
+        const validIds = memoryIds.filter((id) => g.hasNode(id));
+        const now = Date.now();
+        for (let i = 0; i < validIds.length; i++) {
+            for (let j = i + 1; j < validIds.length; j++) {
+                try {
+                    const existing = g.edge(validIds[i], validIds[j]);
+                    if (existing) {
+                        const attrs = g.getEdgeAttributes(existing);
+                        // Hebbian: strengthen existing connection
+                        g.setEdgeAttribute(existing, 'weight', Math.min(1.0, attrs.weight + learningRate));
+                    }
+                    else {
+                        g.addEdge(validIds[i], validIds[j], {
+                            type: 'CO_ACTIVATED',
+                            weight: learningRate,
+                            createdAt: now,
+                        });
+                    }
+                }
+                catch { /* edge already exists */ }
+            }
+        }
+    }
+    // --- Conflict detection ---
+    getConflicts(memoryId) {
+        return this.getEdges(memoryId, 'CONTRADICTS');
+    }
+    // --- Clustering ---
+    async detectClusters(minSize = 3) {
+        const g = this.ensureGraph();
+        if (g.order < minSize)
+            return [];
+        // Simple connected-component clustering (upgrade to Louvain when graphology-communities is available)
+        const visited = new Set();
+        const clusters = [];
+        let clusterIdx = 0;
+        g.forEachNode((nodeId) => {
+            if (visited.has(nodeId))
+                return;
+            // BFS from this node
+            const component = [];
+            const queue = [nodeId];
+            visited.add(nodeId);
+            while (queue.length > 0) {
+                const current = queue.shift();
+                component.push(current);
+                g.forEachEdge(current, (_edge, _attrs, source, target) => {
+                    const neighbor = source === current ? target : source;
+                    if (!visited.has(neighbor)) {
+                        visited.add(neighbor);
+                        queue.push(neighbor);
+                    }
+                });
+            }
+            if (component.length >= minSize) {
+                // Density = actual edges / possible edges
+                let edgeCount = 0;
+                for (const id of component) {
+                    const nodeEdges = this.getEdges(id);
+                    edgeCount += nodeEdges.filter((e) => component.includes(e.sourceId === id ? e.targetId : e.sourceId)).length;
+                }
+                edgeCount /= 2; // undirected
+                const possibleEdges = (component.length * (component.length - 1)) / 2;
+                clusters.push({
+                    clusterId: `cluster_${clusterIdx++}`,
+                    memberIds: component,
+                    density: possibleEdges > 0 ? edgeCount / possibleEdges : 0,
+                });
+            }
+        });
+        return clusters;
+    }
+    // --- Lifecycle ---
+    nodeCount() {
+        return this.graph?.order ?? 0;
+    }
+    edgeCount() {
+        return this.graph?.size ?? 0;
+    }
+    clear() {
+        this.graph?.clear();
+    }
+    async shutdown() {
+        this.graph?.clear();
+        this.graph = null;
+    }
+}
+//# sourceMappingURL=GraphologyMemoryGraph.js.map