@framers/agentos 0.1.46 → 0.1.47

package/dist/memory/decay/DecayModel.d.ts

@@ -0,0 +1,87 @@
+/**
+ * @fileoverview Ebbinghaus forgetting curve, spaced repetition, and
+ * interference management.
+ *
+ * Cognitive science foundations:
+ * - **Ebbinghaus forgetting curve**: S(t) = S₀ · e^(-t / stability)
+ * - **Spaced repetition**: Each successful retrieval increases stability
+ *   (desirable difficulty effect — harder retrievals grow stability more).
+ * - **Proactive interference**: Old similar memories impair new encoding.
+ * - **Retroactive interference**: New memories weaken old similar ones.
+ *
+ * @module agentos/memory/decay/DecayModel
+ */
+import type { MemoryTrace } from '../types.js';
+import type { DecayConfig } from '../config.js';
+/**
+ * Compute the current effective strength of a memory trace using the
+ * Ebbinghaus forgetting curve:
+ *
+ *   S(t) = S₀ · e^(-Δt / stability)
+ *
+ * where Δt = now - lastAccessedAt.
+ */
+export declare function computeCurrentStrength(trace: MemoryTrace, now: number): number;
+export interface RetrievalUpdateResult {
+    /** New encoding strength (small bump). */
+    encodingStrength: number;
+    /** New stability (grows based on difficulty). */
+    stability: number;
+    /** Incremented retrieval count. */
+    retrievalCount: number;
+    /** Updated timestamp. */
+    lastAccessedAt: number;
+    /** Incremented access count. */
+    accessCount: number;
+    /** Doubled reinforcement interval. */
+    reinforcementInterval: number;
+    /** Next reinforcement due. */
+    nextReinforcementAt: number;
+}
+/**
+ * Update a trace's decay parameters after a successful retrieval.
+ *
+ * Implements the **desirable difficulty** effect: memories that were
+ * harder to retrieve (lower current strength) receive a larger stability
+ * boost, making the next retrieval easier and longer-lasting.
+ *
+ * Stability growth also accounts for:
+ * - Diminishing returns on repeated retrievals (logarithmic saturation)
+ * - Emotional intensity bonus (emotional memories consolidate faster)
+ */
+export declare function updateOnRetrieval(trace: MemoryTrace, now: number): RetrievalUpdateResult;
+export interface InterferenceVictim {
+    traceId: string;
+    strengthReduction: number;
+}
+export interface InterferenceResult {
+    /** Existing traces whose strength should be reduced (retroactive). */
+    retroactiveVictims: InterferenceVictim[];
+    /** Amount to reduce new trace's strength by (proactive). */
+    proactiveReduction: number;
+}
+/**
+ * Compute interference effects when a new trace is encoded alongside
+ * existing similar traces.
+ *
+ * - **Proactive interference**: Old similar traces impair new encoding
+ *   (reduce new trace's initial strength).
+ * - **Retroactive interference**: New trace weakens old similar traces
+ *   (reduce their encoding strength).
+ *
+ * Similarity is provided externally (cosine similarity of embeddings).
+ *
+ * @param similarities Array of { traceId, similarity } for existing traces.
+ * @param config Decay configuration with interference threshold.
+ */
+export declare function computeInterference(similarities: Array<{
+    traceId: string;
+    similarity: number;
+    currentStrength: number;
+}>, config?: DecayConfig): InterferenceResult;
+/**
+ * Identify traces that have decayed below the pruning threshold.
+ * These should be soft-deleted (isActive = false).
+ */
+export declare function findPrunableTraces(traces: MemoryTrace[], now: number, config?: DecayConfig): string[];
+//# sourceMappingURL=DecayModel.d.ts.map

package/dist/memory/decay/DecayModel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"DecayModel.d.ts","sourceRoot":"","sources":["../../../src/memory/decay/DecayModel.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAOhD;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,WAAW,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAG9E;AAMD,MAAM,WAAW,qBAAqB;IACpC,0CAA0C;IAC1C,gBAAgB,EAAE,MAAM,CAAC;IACzB,iDAAiD;IACjD,SAAS,EAAE,MAAM,CAAC;IAClB,mCAAmC;IACnC,cAAc,EAAE,MAAM,CAAC;IACvB,yBAAyB;IACzB,cAAc,EAAE,MAAM,CAAC;IACvB,gCAAgC;IAChC,WAAW,EAAE,MAAM,CAAC;IACpB,sCAAsC;IACtC,qBAAqB,EAAE,MAAM,CAAC;IAC9B,8BAA8B;IAC9B,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,WAAW,EAAE,GAAG,EAAE,MAAM,GAAG,qBAAqB,CA4BxF;AAMD,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,MAAM,CAAC;IAChB,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,kBAAkB;IACjC,sEAAsE;IACtE,kBAAkB,EAAE,kBAAkB,EAAE,CAAC;IACzC,4DAA4D;IAC5D,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,mBAAmB,CACjC,YAAY,EAAE,KAAK,CAAC;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,eAAe,EAAE,MAAM,CAAA;CAAE,CAAC,EACrF,MAAM,GAAE,WAAkC,GACzC,kBAAkB,CAuBpB;AAMD;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,WAAW,EAAE,EACrB,GAAG,EAAE,MAAM,EACX,MAAM,GAAE,WAAkC,GACzC,MAAM,EAAE,CAWV"}

package/dist/memory/decay/DecayModel.js

@@ -0,0 +1,117 @@
+/**
+ * @fileoverview Ebbinghaus forgetting curve, spaced repetition, and
+ * interference management.
+ *
+ * Cognitive science foundations:
+ * - **Ebbinghaus forgetting curve**: S(t) = S₀ · e^(-t / stability)
+ * - **Spaced repetition**: Each successful retrieval increases stability
+ *   (desirable difficulty effect — harder retrievals grow stability more).
+ * - **Proactive interference**: Old similar memories impair new encoding.
+ * - **Retroactive interference**: New memories weaken old similar ones.
+ *
+ * @module agentos/memory/decay/DecayModel
+ */
+import { DEFAULT_DECAY_CONFIG } from '../config.js';
+// ---------------------------------------------------------------------------
+// Current strength calculation
+// ---------------------------------------------------------------------------
+/**
+ * Compute the current effective strength of a memory trace using the
+ * Ebbinghaus forgetting curve:
+ *
+ *   S(t) = S₀ · e^(-Δt / stability)
+ *
+ * where Δt = now - lastAccessedAt.
+ */
+export function computeCurrentStrength(trace, now) {
+    const elapsed = Math.max(0, now - trace.lastAccessedAt);
+    return trace.encodingStrength * Math.exp(-elapsed / trace.stability);
+}
+/**
+ * Update a trace's decay parameters after a successful retrieval.
+ *
+ * Implements the **desirable difficulty** effect: memories that were
+ * harder to retrieve (lower current strength) receive a larger stability
+ * boost, making the next retrieval easier and longer-lasting.
+ *
+ * Stability growth also accounts for:
+ * - Diminishing returns on repeated retrievals (logarithmic saturation)
+ * - Emotional intensity bonus (emotional memories consolidate faster)
+ */
+export function updateOnRetrieval(trace, now) {
+    const currentStrength = computeCurrentStrength(trace, now);
+    // Desirable difficulty: weaker current strength → more stability growth
+    const difficultyBonus = Math.max(0.1, 1 - currentStrength);
+    // Diminishing returns on repeated retrievals
+    const retrievalDiminish = 1 / (1 + 0.1 * trace.retrievalCount);
+    // Emotional consolidation bonus
+    const emotionalBonus = 1 + trace.emotionalContext.intensity * 0.3;
+    // Stability growth factor
+    const growthFactor = (1.5 + difficultyBonus * 2.0) * retrievalDiminish * emotionalBonus;
+    const newStability = trace.stability * growthFactor;
+    const newStrength = Math.min(1.0, trace.encodingStrength + 0.1);
+    const newInterval = trace.reinforcementInterval * 2;
+    return {
+        encodingStrength: newStrength,
+        stability: newStability,
+        retrievalCount: trace.retrievalCount + 1,
+        lastAccessedAt: now,
+        accessCount: trace.accessCount + 1,
+        reinforcementInterval: newInterval,
+        nextReinforcementAt: now + newInterval,
+    };
+}
+/**
+ * Compute interference effects when a new trace is encoded alongside
+ * existing similar traces.
+ *
+ * - **Proactive interference**: Old similar traces impair new encoding
+ *   (reduce new trace's initial strength).
+ * - **Retroactive interference**: New trace weakens old similar traces
+ *   (reduce their encoding strength).
+ *
+ * Similarity is provided externally (cosine similarity of embeddings).
+ *
+ * @param similarities Array of { traceId, similarity } for existing traces.
+ * @param config Decay configuration with interference threshold.
+ */
+export function computeInterference(similarities, config = DEFAULT_DECAY_CONFIG) {
+    const victims = [];
+    let proactiveReduction = 0;
+    for (const entry of similarities) {
+        if (entry.similarity <= config.interferenceThreshold)
+            continue;
+        const overlapStrength = entry.similarity - config.interferenceThreshold;
+        // Scale: 0 at threshold, ~0.15 at similarity 1.0
+        const scaledOverlap = overlapStrength / (1 - config.interferenceThreshold);
+        // Retroactive: new trace interferes with old
+        const retroReduction = scaledOverlap * 0.15;
+        victims.push({ traceId: entry.traceId, strengthReduction: retroReduction });
+        // Proactive: old trace interferes with new
+        proactiveReduction += scaledOverlap * 0.1 * entry.currentStrength;
+    }
+    return {
+        retroactiveVictims: victims,
+        proactiveReduction: Math.min(0.3, proactiveReduction), // cap proactive interference
+    };
+}
+// ---------------------------------------------------------------------------
+// Batch decay sweep (for consolidation pipeline)
+// ---------------------------------------------------------------------------
+/**
+ * Identify traces that have decayed below the pruning threshold.
+ * These should be soft-deleted (isActive = false).
+ */
+export function findPrunableTraces(traces, now, config = DEFAULT_DECAY_CONFIG) {
+    return traces
+        .filter((t) => {
+        if (!t.isActive)
+            return false;
+        const strength = computeCurrentStrength(t, now);
+        return (strength < config.pruningThreshold &&
+            t.emotionalContext.intensity < 0.3 // don't prune emotional memories easily
+        );
+    })
+        .map((t) => t.id);
+}
+//# sourceMappingURL=DecayModel.js.map

package/dist/memory/decay/DecayModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DecayModel.js","sourceRoot":"","sources":["../../../src/memory/decay/DecayModel.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,OAAO,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AAEpD,8EAA8E;AAC9E,+BAA+B;AAC/B,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAkB,EAAE,GAAW;IACpE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC;IACxD,OAAO,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;AACvE,CAAC;AAuBD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAkB,EAAE,GAAW;IAC/D,MAAM,eAAe,GAAG,sBAAsB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAE3D,wEAAwE;IACxE,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,eAAe,CAAC,CAAC;IAE3D,6CAA6C;IAC7C,MAAM,iBAAiB,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC;IAE/D,gCAAgC;IAChC,MAAM,cAAc,GAAG,CAAC,GAAG,KAAK,CAAC,gBAAgB,CAAC,SAAS,GAAG,GAAG,CAAC;IAElE,0BAA0B;IAC1B,MAAM,YAAY,GAAG,CAAC,GAAG,GAAG,eAAe,GAAG,GAAG,CAAC,GAAG,iBAAiB,GAAG,cAAc,CAAC;IAExF,MAAM,YAAY,GAAG,KAAK,CAAC,SAAS,GAAG,YAAY,CAAC;IACpD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC;IAChE,MAAM,WAAW,GAAG,KAAK,CAAC,qBAAqB,GAAG,CAAC,CAAC;IAEpD,OAAO;QACL,gBAAgB,EAAE,WAAW;QAC7B,SAAS,EAAE,YAAY;QACvB,cAAc,EAAE,KAAK,CAAC,cAAc,GAAG,CAAC;QACxC,cAAc,EAAE,GAAG;QACnB,WAAW,EAAE,KAAK,CAAC,WAAW,GAAG,CAAC;QAClC,qBAAqB,EAAE,WAAW;QAClC,mBAAmB,EAAE,GAAG,GAAG,WAAW;KACvC,CAAC;AACJ,CAAC;AAkBD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,mBAAmB,CACjC,YAAqF,EACrF,SAAsB,oBAAoB;IAE1C,MAAM,OAAO,GAAyB,EAAE,CAAC;IACzC,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAE3B,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,IAAI,KAAK,CAAC,UAAU,IAAI,MAAM,CAAC,qBAAqB;YAAE,SAAS;QAE/D,MAAM,eAAe,GAAG,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC,qBAAqB,CAAC;QACxE,iDAAiD;QACjD,MAAM,aAAa,GAAG,eAAe,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,qBAAqB,CAAC,CAAC;QAE3E,6CAA6C;QAC7C,MAAM,cAAc,GAAG,aAAa,GAAG,IAAI,CAAC;QAC5C,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,CAAC,CAAC;QAE5E,2CAA2C;QAC3C,kBAAkB,IAAI,aAAa,GAAG,GAAG,GAAG,KAAK,CAAC,eAAe,CAAC;IACpE,CAAC;IAED,OAAO;QACL,kBAAkB,EAAE,OAAO;QAC3B,kBAAkB,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,kBAAkB,CAAC,EAAE,6BAA6B;KACrF,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,iDAAiD;AACjD,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAqB,EACrB,GAAW,EACX,SAAsB,oBAAoB;IAE1C,OAAO,MAAM;SACV,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACZ,IAAI,CAAC,CAAC,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QAC9B,MAAM,QAAQ,GAAG,sBAAsB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAChD,OAAO,CACL,QAAQ,GAAG,MAAM,CAAC,gBAAgB;YAClC,CAAC,CAAC,gBAAgB,CAAC,SAAS,GAAG,GAAG,CAAC,wCAAwC;SAC5E,CAAC;IACJ,CAAC,CAAC;SACD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACtB,CAAC"}

package/dist/memory/decay/RetrievalPriorityScorer.d.ts

@@ -0,0 +1,63 @@
+/**
+ * @fileoverview Composite retrieval priority scoring.
+ *
+ * Combines multiple signals into a single score for ranking memory traces:
+ * - Current strength (Ebbinghaus decay)
+ * - Vector similarity (semantic relevance)
+ * - Recency boost (temporal proximity)
+ * - Emotional congruence (mood-congruent recall)
+ * - Graph activation (spreading activation — 0 in Batch 1)
+ * - Importance (inherent importance of the memory)
+ *
+ * @module agentos/memory/decay/RetrievalPriorityScorer
+ */
+import type { MemoryTrace, ScoredMemoryTrace, PartiallyRetrievedTrace } from '../types.js';
+import type { PADState, DecayConfig } from '../config.js';
+export interface ScoringWeights {
+    strength: number;
+    similarity: number;
+    recency: number;
+    emotionalCongruence: number;
+    graphActivation: number;
+    importance: number;
+}
+export declare const DEFAULT_SCORING_WEIGHTS: ScoringWeights;
+/**
+ * Recency boost: exponential decay from recent events.
+ * Recent memories (within the half-life window) get a small bonus.
+ *
+ * boost = 1 + 0.2 · e^(-elapsed / halfLife)
+ */
+export declare function computeRecencyBoost(lastAccessedAt: number, now: number, halfLifeMs?: number): number;
+/**
+ * Mood-congruent recall: current mood biases retrieval toward memories
+ * with matching emotional valence.
+ *
+ * congruence = 1 + max(0, currentValence · traceValence) · 0.25
+ */
+export declare function computeEmotionalCongruence(currentMood: PADState, traceValence: number): number;
+export interface ScoringContext {
+    currentMood: PADState;
+    now: number;
+    /** Set to true to disable emotional congruence bias. */
+    neutralMood?: boolean;
+    decayConfig?: DecayConfig;
+    weights?: ScoringWeights;
+}
+export interface CandidateTrace {
+    trace: MemoryTrace;
+    /** Cosine similarity from vector search (0-1). */
+    vectorSimilarity: number;
+    /** Activation level from spreading activation (0-1). 0 if graph not available. */
+    graphActivation?: number;
+}
+/**
+ * Score a batch of candidate traces and return them sorted by priority.
+ */
+export declare function scoreAndRankTraces(candidates: CandidateTrace[], context: ScoringContext): ScoredMemoryTrace[];
+/**
+ * Detect partially-accessible memories (high relevance but low strength).
+ * These are memories the agent "almost" remembers — like tip-of-the-tongue states.
+ */
+export declare function detectPartiallyRetrieved(candidates: CandidateTrace[], now: number): PartiallyRetrievedTrace[];
+//# sourceMappingURL=RetrievalPriorityScorer.d.ts.map

package/dist/memory/decay/RetrievalPriorityScorer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RetrievalPriorityScorer.d.ts","sourceRoot":"","sources":["../../../src/memory/decay/RetrievalPriorityScorer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,iBAAiB,EAAE,uBAAuB,EAAE,MAAM,aAAa,CAAC;AAC3F,OAAO,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAQ1D,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,eAAe,EAAE,MAAM,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,eAAO,MAAM,uBAAuB,EAAE,cAOrC,CAAC;AAMF;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,cAAc,EAAE,MAAM,EACtB,GAAG,EAAE,MAAM,EACX,UAAU,GAAE,MAA+C,GAC1D,MAAM,CAGR;AAED;;;;;GAKG;AACH,wBAAgB,0BAA0B,CACxC,WAAW,EAAE,QAAQ,EACrB,YAAY,EAAE,MAAM,GACnB,MAAM,CAGR;AAMD,MAAM,WAAW,cAAc;IAC7B,WAAW,EAAE,QAAQ,CAAC;IACtB,GAAG,EAAE,MAAM,CAAC;IACZ,wDAAwD;IACxD,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,OAAO,CAAC,EAAE,cAAc,CAAC;CAC1B;AAED,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,WAAW,CAAC;IACnB,kDAAkD;IAClD,gBAAgB,EAAE,MAAM,CAAC;IACzB,kFAAkF;IAClF,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,cAAc,EAAE,EAC5B,OAAO,EAAE,cAAc,GACtB,iBAAiB,EAAE,CA2CrB;AAMD;;;GAGG;AACH,wBAAgB,wBAAwB,CACtC,UAAU,EAAE,cAAc,EAAE,EAC5B,GAAG,EAAE,MAAM,GACV,uBAAuB,EAAE,CAc3B"}

package/dist/memory/decay/RetrievalPriorityScorer.js

@@ -0,0 +1,110 @@
+/**
+ * @fileoverview Composite retrieval priority scoring.
+ *
+ * Combines multiple signals into a single score for ranking memory traces:
+ * - Current strength (Ebbinghaus decay)
+ * - Vector similarity (semantic relevance)
+ * - Recency boost (temporal proximity)
+ * - Emotional congruence (mood-congruent recall)
+ * - Graph activation (spreading activation — 0 in Batch 1)
+ * - Importance (inherent importance of the memory)
+ *
+ * @module agentos/memory/decay/RetrievalPriorityScorer
+ */
+import { DEFAULT_DECAY_CONFIG } from '../config.js';
+import { computeCurrentStrength } from './DecayModel.js';
+export const DEFAULT_SCORING_WEIGHTS = {
+    strength: 0.25,
+    similarity: 0.35,
+    recency: 0.10,
+    emotionalCongruence: 0.15,
+    graphActivation: 0.10,
+    importance: 0.05,
+};
+// ---------------------------------------------------------------------------
+// Individual score components
+// ---------------------------------------------------------------------------
+/**
+ * Recency boost: exponential decay from recent events.
+ * Recent memories (within the half-life window) get a small bonus.
+ *
+ * boost = 1 + 0.2 · e^(-elapsed / halfLife)
+ */
+export function computeRecencyBoost(lastAccessedAt, now, halfLifeMs = DEFAULT_DECAY_CONFIG.recencyHalfLifeMs) {
+    const elapsed = Math.max(0, now - lastAccessedAt);
+    return 1 + 0.2 * Math.exp(-elapsed / halfLifeMs);
+}
+/**
+ * Mood-congruent recall: current mood biases retrieval toward memories
+ * with matching emotional valence.
+ *
+ * congruence = 1 + max(0, currentValence · traceValence) · 0.25
+ */
+export function computeEmotionalCongruence(currentMood, traceValence) {
+    const match = Math.max(0, currentMood.valence * traceValence);
+    return 1 + match * 0.25;
+}
+/**
+ * Score a batch of candidate traces and return them sorted by priority.
+ */
+export function scoreAndRankTraces(candidates, context) {
+    const w = context.weights ?? DEFAULT_SCORING_WEIGHTS;
+    const config = context.decayConfig ?? DEFAULT_DECAY_CONFIG;
+    const scored = candidates.map(({ trace, vectorSimilarity, graphActivation }) => {
+        const strengthScore = computeCurrentStrength(trace, context.now);
+        const similarityScore = vectorSimilarity;
+        const recencyScore = computeRecencyBoost(trace.lastAccessedAt, context.now, config.recencyHalfLifeMs);
+        const emotionalCongruenceScore = context.neutralMood
+            ? 1.0
+            : computeEmotionalCongruence(context.currentMood, trace.emotionalContext.valence);
+        const graphActivationScore = graphActivation ?? 0;
+        const importanceScore = trace.provenance.confidence * 0.5 + 0.5; // blend confidence with base
+        // Normalise recency and emotional congruence to ~0-1 range for weighted sum
+        const normRecency = (recencyScore - 1.0) / 0.2; // 0 when no boost, 1 when max boost
+        const normEmotional = (emotionalCongruenceScore - 1.0) / 0.25;
+        const compositeScore = w.strength * strengthScore +
+            w.similarity * similarityScore +
+            w.recency * normRecency +
+            w.emotionalCongruence * normEmotional +
+            w.graphActivation * graphActivationScore +
+            w.importance * importanceScore;
+        return {
+            ...trace,
+            retrievalScore: Math.max(0, Math.min(1, compositeScore)),
+            scoreBreakdown: {
+                strengthScore,
+                similarityScore,
+                recencyScore: normRecency,
+                emotionalCongruenceScore: normEmotional,
+                graphActivationScore,
+                importanceScore,
+            },
+        };
+    });
+    // Sort descending by composite score
+    scored.sort((a, b) => b.retrievalScore - a.retrievalScore);
+    return scored;
+}
+// ---------------------------------------------------------------------------
+// Tip-of-the-tongue detection
+// ---------------------------------------------------------------------------
+/**
+ * Detect partially-accessible memories (high relevance but low strength).
+ * These are memories the agent "almost" remembers — like tip-of-the-tongue states.
+ */
+export function detectPartiallyRetrieved(candidates, now) {
+    return candidates
+        .filter(({ trace, vectorSimilarity }) => {
+        const strength = computeCurrentStrength(trace, now);
+        return vectorSimilarity > 0.6 && (strength < 0.3 || trace.provenance.confidence < 0.4);
+    })
+        .map(({ trace, vectorSimilarity }) => ({
+        traceId: trace.id,
+        confidence: Math.min(trace.provenance.confidence, vectorSimilarity * 0.5),
+        partialContent: trace.content.length > 100
+            ? trace.content.substring(0, 100) + '...'
+            : trace.content,
+        suggestedCues: trace.tags.slice(0, 3),
+    }));
+}
+//# sourceMappingURL=RetrievalPriorityScorer.js.map

package/dist/memory/decay/RetrievalPriorityScorer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RetrievalPriorityScorer.js","sourceRoot":"","sources":["../../../src/memory/decay/RetrievalPriorityScorer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,OAAO,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AACpD,OAAO,EAAE,sBAAsB,EAAE,MAAM,iBAAiB,CAAC;AAezD,MAAM,CAAC,MAAM,uBAAuB,GAAmB;IACrD,QAAQ,EAAE,IAAI;IACd,UAAU,EAAE,IAAI;IAChB,OAAO,EAAE,IAAI;IACb,mBAAmB,EAAE,IAAI;IACzB,eAAe,EAAE,IAAI;IACrB,UAAU,EAAE,IAAI;CACjB,CAAC;AAEF,8EAA8E;AAC9E,8BAA8B;AAC9B,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,cAAsB,EACtB,GAAW,EACX,aAAqB,oBAAoB,CAAC,iBAAiB;IAE3D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,cAAc,CAAC,CAAC;IAClD,OAAO,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,GAAG,UAAU,CAAC,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,0BAA0B,CACxC,WAAqB,EACrB,YAAoB;IAEpB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,OAAO,GAAG,YAAY,CAAC,CAAC;IAC9D,OAAO,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC;AAC1B,CAAC;AAuBD;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAChC,UAA4B,EAC5B,OAAuB;IAEvB,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,IAAI,uBAAuB,CAAC;IACrD,MAAM,MAAM,GAAG,OAAO,CAAC,WAAW,IAAI,oBAAoB,CAAC;IAE3D,MAAM,MAAM,GAAwB,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,gBAAgB,EAAE,eAAe,EAAE,EAAE,EAAE;QAClG,MAAM,aAAa,GAAG,sBAAsB,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QACjE,MAAM,eAAe,GAAG,gBAAgB,CAAC;QACzC,MAAM,YAAY,GAAG,mBAAmB,CAAC,KAAK,CAAC,cAAc,EAAE,OAAO,CAAC,GAAG,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACtG,MAAM,wBAAwB,GAAG,OAAO,CAAC,WAAW;YAClD,CAAC,CAAC,GAAG;YACL,CAAC,CAAC,0BAA0B,CAAC,OAAO,CAAC,WAAW,EAAE,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QACpF,MAAM,oBAAoB,GAAG,eAAe,IAAI,CAAC,CAAC;QAClD,MAAM,eAAe,GAAG,KAAK,CAAC,UAAU,CAAC,UAAU,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,6BAA6B;QAE9F,4EAA4E;QAC5E,MAAM,WAAW,GAAG,CAAC,YAAY,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,oCAAoC;QACpF,MAAM,aAAa,GAAG,CAAC,wBAAwB,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC;QAE9D,MAAM,cAAc,GAClB,CAAC,CAAC,QAAQ,GAAG,aAAa;YAC1B,CAAC,CAAC,UAAU,GAAG,eAAe;YAC9B,CAAC,CAAC,OAAO,GAAG,WAAW;YACvB,CAAC,CAAC,mBAAmB,GAAG,aAAa;YACrC,CAAC,CAAC,eAAe,GAAG,oBAAoB;YACxC,CAAC,CAAC,UAAU,GAAG,eAAe,CAAC;QAEjC,OAAO;YACL,GAAG,KAAK;YACR,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;YACxD,cAAc,EAAE;gBACd,aAAa;gBACb,eAAe;gBACf,YAAY,EAAE,WAAW;gBACzB,wBAAwB,EAAE,aAAa;gBACvC,oBAAoB;gBACpB,eAAe;aAChB;SACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,qCAAqC;IACrC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC;IAC3D,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,8BAA8B;AAC9B,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,wBAAwB,CACtC,UAA4B,EAC5B,GAAW;IAEX,OAAO,UAAU;SACd,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,gBAAgB,EAAE,EAAE,EAAE;QACtC,MAAM,QAAQ,GAAG,sBAAsB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACpD,OAAO,gBAAgB,GAAG,GAAG,IAAI,CAAC,QAAQ,GAAG,GAAG,IAAI,KAAK,CAAC,UAAU,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;IACzF,CAAC,CAAC;SACD,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,gBAAgB,EAAE,EAAE,EAAE,CAAC,CAAC;QACrC,OAAO,EAAE,KAAK,CAAC,EAAE;QACjB,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,EAAE,gBAAgB,GAAG,GAAG,CAAC;QACzE,cAAc,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG;YACxC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,KAAK;YACzC,CAAC,CAAC,KAAK,CAAC,OAAO;QACjB,aAAa,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;KACtC,CAAC,CAAC,CAAC;AACR,CAAC"}

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

@@ -0,0 +1,37 @@
+/**
+ * @fileoverview Content feature detection for memory encoding.
+ *
+ * Three strategies (configurable per-agent):
+ * - `keyword`  — fast regex/lexicon-based heuristics (zero latency, no LLM cost)
+ * - `llm`      — cheap LLM call for accurate classification
+ * - `hybrid`   — keywords in real-time, LLM retroactively during consolidation
+ *
+ * @module agentos/memory/encoding/ContentFeatureDetector
+ */
+import type { ContentFeatures } from '../types.js';
+export interface IContentFeatureDetector {
+    detect(text: string): Promise<ContentFeatures>;
+}
+export declare class KeywordFeatureDetector implements IContentFeatureDetector {
+    detect(text: string): Promise<ContentFeatures>;
+}
+export declare class LlmFeatureDetector implements IContentFeatureDetector {
+    private llmInvoker;
+    constructor(llmInvoker: (system: string, user: string) => Promise<string>);
+    detect(text: string): Promise<ContentFeatures>;
+}
+/**
+ * Uses keyword detection for real-time encoding. Exposes `detectWithLlm()`
+ * for retroactive re-classification during consolidation.
+ */
+export declare class HybridFeatureDetector implements IContentFeatureDetector {
+    private keyword;
+    private llm;
+    constructor(llmInvoker?: (system: string, user: string) => Promise<string>);
+    /** Real-time detection: keyword only (zero latency). */
+    detect(text: string): Promise<ContentFeatures>;
+    /** Deferred detection: LLM-based (called during consolidation). */
+    detectWithLlm(text: string): Promise<ContentFeatures>;
+}
+export declare function createFeatureDetector(strategy: 'keyword' | 'llm' | 'hybrid', llmInvoker?: (system: string, user: string) => Promise<string>): IContentFeatureDetector;
+//# sourceMappingURL=ContentFeatureDetector.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"ContentFeatureDetector.d.ts","sourceRoot":"","sources":["../../../src/memory/encoding/ContentFeatureDetector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAMnD,MAAM,WAAW,uBAAuB;IACtC,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;CAChD;AAgFD,qBAAa,sBAAuB,YAAW,uBAAuB;IAC9D,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC;CAYrD;AAmBD,qBAAa,kBAAmB,YAAW,uBAAuB;IAE9D,OAAO,CAAC,UAAU;gBAAV,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC;IAGjE,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC;CAqBrD;AAMD;;;GAGG;AACH,qBAAa,qBAAsB,YAAW,uBAAuB;IACnE,OAAO,CAAC,OAAO,CAAgC;IAC/C,OAAO,CAAC,GAAG,CAA4B;gBAE3B,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC;IAI1E,wDAAwD;IAClD,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC;IAIpD,mEAAmE;IAC7D,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC;CAM5D;AAMD,wBAAgB,qBAAqB,CACnC,QAAQ,EAAE,SAAS,GAAG,KAAK,GAAG,QAAQ,EACtC,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,GAC7D,uBAAuB,CAazB"}

package/dist/memory/encoding/ContentFeatureDetector.js

@@ -0,0 +1,176 @@
+/**
+ * @fileoverview Content feature detection for memory encoding.
+ *
+ * Three strategies (configurable per-agent):
+ * - `keyword`  — fast regex/lexicon-based heuristics (zero latency, no LLM cost)
+ * - `llm`      — cheap LLM call for accurate classification
+ * - `hybrid`   — keywords in real-time, LLM retroactively during consolidation
+ *
+ * @module agentos/memory/encoding/ContentFeatureDetector
+ */
+// ---------------------------------------------------------------------------
+// Keyword patterns
+// ---------------------------------------------------------------------------
+const PROCEDURE_PATTERNS = [
+    /\bstep[\s-]?\d/i,
+    /\bfirst[\s,]/i,
+    /\bthen[\s,]/i,
+    /\bfinally[\s,]/i,
+    /\binstructions?\b/i,
+    /\bhow[\s-]to\b/i,
+    /\bprocedure\b/i,
+    /\brecipe\b/i,
+    /\bworkflow\b/i,
+    /\b\d+\.\s+\w/, // numbered lists
+];
+const EMOTION_PATTERNS = [
+    /\bhappy\b|\bsad\b|\bangry\b|\bfrustrat/i,
+    /\bexcit/i, /\bworri/i, /\banxious\b/i,
+    /\blove\b|\bhate\b|\bfear\b/i,
+    /\bthank/i, /\bsorry\b/i, /\bgrateful\b/i,
+    /\bdisappoint/i, /\bdeligh/i, /\bupset\b/i,
+    /[!]{2,}/, /(?:\u{1F600}|\u{1F64F}|\u{1F923}|\u{1F602}|\u{2764}\u{FE0F}|\u{1F60D}|\u{1F60A}|\u{1F97A}|\u{1F62D}|\u{1F618}|\u{1F914}|\u{1F605}|\u{1F629}|\u{1F970}|\u{1F621}|\u{1F480})/u,
+];
+const SOCIAL_PATTERNS = [
+    /\bteam\b|\bcolleague\b|\bmanager\b/i,
+    /\bmeeting\b|\bcall\b|\bdiscuss/i,
+    /\bfriend\b|\bfamily\b|\bpartner\b/i,
+    /\bhe\s+(said|told|asked)\b/i,
+    /\bshe\s+(said|told|asked)\b/i,
+    /\bthey\s+(said|told|asked)\b/i,
+];
+const COOPERATION_PATTERNS = [
+    /\btogether\b|\bcollaborat/i,
+    /\bagree\b|\bconsensus\b/i,
+    /\bhelp\b|\bassist\b|\bsupport\b/i,
+    /\bshare\b|\bcontribut/i,
+    /\bcompromis/i,
+];
+const ETHICAL_PATTERNS = [
+    /\bfair\b|\bunfair\b|\bjust\b|\bunjust\b/i,
+    /\bright\b.*\bwrong\b|\bwrong\b.*\bright\b/i,
+    /\bethic/i, /\bmoral/i, /\bhonest/i,
+    /\bprivacy\b|\bconsent\b|\btranspar/i,
+    /\bresponsib/i, /\baccountab/i,
+];
+const CONTRADICTION_PATTERNS = [
+    /\bactually\b.*\bnot\b/i,
+    /\bthat'?s\s+(wrong|incorrect|false)\b/i,
+    /\bcorrect(ion|ed)\b/i,
+    /\bcontrad/i,
+    /\bhowever\b.*\b(not|isn'?t|wasn'?t|doesn'?t)\b/i,
+    /\bin\s+fact\b/i,
+    /\bmistak/i,
+    /\bno,\s/i,
+];
+const NOVELTY_PATTERNS = [
+    /\bnew\b|\bnovel\b|\bunexpect/i,
+    /\bsurpris/i, /\bfirst\s+time\b/i,
+    /\bnever\s+(seen|heard|done)\b/i,
+    /\bdiscover/i, /\bbreakthrough\b/i,
+    /\binnovati/i, /\bunique\b/i,
+];
+function matchesAny(text, patterns) {
+    return patterns.some((p) => p.test(text));
+}
+// ---------------------------------------------------------------------------
+// Keyword-based detector
+// ---------------------------------------------------------------------------
+export class KeywordFeatureDetector {
+    async detect(text) {
+        return {
+            hasNovelty: matchesAny(text, NOVELTY_PATTERNS),
+            hasProcedure: matchesAny(text, PROCEDURE_PATTERNS),
+            hasEmotion: matchesAny(text, EMOTION_PATTERNS),
+            hasSocialContent: matchesAny(text, SOCIAL_PATTERNS),
+            hasCooperation: matchesAny(text, COOPERATION_PATTERNS),
+            hasEthicalContent: matchesAny(text, ETHICAL_PATTERNS),
+            hasContradiction: matchesAny(text, CONTRADICTION_PATTERNS),
+            topicRelevance: 0.5, // keywords can't assess task relevance
+        };
+    }
+}
+// ---------------------------------------------------------------------------
+// LLM-based detector
+// ---------------------------------------------------------------------------
+const LLM_SYSTEM_PROMPT = `You are a content feature classifier. Given text, output a JSON object with exactly these boolean fields and one number field:
+{
+  "hasNovelty": bool,
+  "hasProcedure": bool,
+  "hasEmotion": bool,
+  "hasSocialContent": bool,
+  "hasCooperation": bool,
+  "hasEthicalContent": bool,
+  "hasContradiction": bool,
+  "topicRelevance": number (0-1)
+}
+Respond ONLY with the JSON object, no explanation.`;
+export class LlmFeatureDetector {
+    constructor(llmInvoker) {
+        this.llmInvoker = llmInvoker;
+    }
+    async detect(text) {
+        try {
+            const response = await this.llmInvoker(LLM_SYSTEM_PROMPT, text);
+            const parsed = JSON.parse(response.trim());
+            return {
+                hasNovelty: !!parsed.hasNovelty,
+                hasProcedure: !!parsed.hasProcedure,
+                hasEmotion: !!parsed.hasEmotion,
+                hasSocialContent: !!parsed.hasSocialContent,
+                hasCooperation: !!parsed.hasCooperation,
+                hasEthicalContent: !!parsed.hasEthicalContent,
+                hasContradiction: !!parsed.hasContradiction,
+                topicRelevance: typeof parsed.topicRelevance === 'number'
+                    ? Math.max(0, Math.min(1, parsed.topicRelevance))
+                    : 0.5,
+            };
+        }
+        catch {
+            // Fallback to keyword detection on LLM failure
+            return new KeywordFeatureDetector().detect(text);
+        }
+    }
+}
+// ---------------------------------------------------------------------------
+// Hybrid detector (keyword real-time, LLM deferred)
+// ---------------------------------------------------------------------------
+/**
+ * Uses keyword detection for real-time encoding. Exposes `detectWithLlm()`
+ * for retroactive re-classification during consolidation.
+ */
+export class HybridFeatureDetector {
+    constructor(llmInvoker) {
+        this.keyword = new KeywordFeatureDetector();
+        this.llm = llmInvoker ? new LlmFeatureDetector(llmInvoker) : null;
+    }
+    /** Real-time detection: keyword only (zero latency). */
+    async detect(text) {
+        return this.keyword.detect(text);
+    }
+    /** Deferred detection: LLM-based (called during consolidation). */
+    async detectWithLlm(text) {
+        if (this.llm) {
+            return this.llm.detect(text);
+        }
+        return this.keyword.detect(text);
+    }
+}
+// ---------------------------------------------------------------------------
+// Factory
+// ---------------------------------------------------------------------------
+export function createFeatureDetector(strategy, llmInvoker) {
+    switch (strategy) {
+        case 'llm':
+            if (!llmInvoker) {
+                throw new Error('LLM feature detection requires an llmInvoker function');
+            }
+            return new LlmFeatureDetector(llmInvoker);
+        case 'hybrid':
+            return new HybridFeatureDetector(llmInvoker);
+        case 'keyword':
+        default:
+            return new KeywordFeatureDetector();
+    }
+}
+//# sourceMappingURL=ContentFeatureDetector.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"ContentFeatureDetector.js","sourceRoot":"","sources":["../../../src/memory/encoding/ContentFeatureDetector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAYH,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E,MAAM,kBAAkB,GAAG;IACzB,iBAAiB;IACjB,eAAe;IACf,cAAc;IACd,iBAAiB;IACjB,oBAAoB;IACpB,iBAAiB;IACjB,gBAAgB;IAChB,aAAa;IACb,eAAe;IACf,cAAc,EAAG,iBAAiB;CACnC,CAAC;AAEF,MAAM,gBAAgB,GAAG;IACvB,yCAAyC;IACzC,UAAU,EAAE,UAAU,EAAE,cAAc;IACtC,6BAA6B;IAC7B,UAAU,EAAE,YAAY,EAAE,eAAe;IACzC,eAAe,EAAE,WAAW,EAAE,YAAY;IAC1C,SAAS,EAAE,6KAA6K;CACzL,CAAC;AAEF,MAAM,eAAe,GAAG;IACtB,qCAAqC;IACrC,iCAAiC;IACjC,oCAAoC;IACpC,6BAA6B;IAC7B,8BAA8B;IAC9B,+BAA+B;CAChC,CAAC;AAEF,MAAM,oBAAoB,GAAG;IAC3B,4BAA4B;IAC5B,0BAA0B;IAC1B,kCAAkC;IAClC,wBAAwB;IACxB,cAAc;CACf,CAAC;AAEF,MAAM,gBAAgB,GAAG;IACvB,0CAA0C;IAC1C,4CAA4C;IAC5C,UAAU,EAAE,UAAU,EAAE,WAAW;IACnC,qCAAqC;IACrC,cAAc,EAAE,cAAc;CAC/B,CAAC;AAEF,MAAM,sBAAsB,GAAG;IAC7B,wBAAwB;IACxB,wCAAwC;IACxC,sBAAsB;IACtB,YAAY;IACZ,iDAAiD;IACjD,gBAAgB;IAChB,WAAW;IACX,UAAU;CACX,CAAC;AAEF,MAAM,gBAAgB,GAAG;IACvB,+BAA+B;IAC/B,YAAY,EAAE,mBAAmB;IACjC,gCAAgC;IAChC,aAAa,EAAE,mBAAmB;IAClC,aAAa,EAAE,aAAa;CAC7B,CAAC;AAEF,SAAS,UAAU,CAAC,IAAY,EAAE,QAAkB;IAClD,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAC5C,CAAC;AAED,8EAA8E;AAC9E,yBAAyB;AACzB,8EAA8E;AAE9E,MAAM,OAAO,sBAAsB;IACjC,KAAK,CAAC,MAAM,CAAC,IAAY;QACvB,OAAO;YACL,UAAU,EAAE,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;YAC9C,YAAY,EAAE,UAAU,CAAC,IAAI,EAAE,kBAAkB,CAAC;YAClD,UAAU,EAAE,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;YAC9C,gBAAgB,EAAE,UAAU,CAAC,IAAI,EAAE,eAAe,CAAC;YACnD,cAAc,EAAE,UAAU,CAAC,IAAI,EAAE,oBAAoB,CAAC;YACtD,iBAAiB,EAAE,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;YACrD,gBAAgB,EAAE,UAAU,CAAC,IAAI,EAAE,sBAAsB,CAAC;YAC1D,cAAc,EAAE,GAAG,EAAE,uCAAuC;SAC7D,CAAC;IACJ,CAAC;CACF;AAED,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E,MAAM,iBAAiB,GAAG;;;;;;;;;;;mDAWyB,CAAC;AAEpD,MAAM,OAAO,kBAAkB;IAC7B,YACU,UAA6D;QAA7D,eAAU,GAAV,UAAU,CAAmD;IACpE,CAAC;IAEJ,KAAK,CAAC,MAAM,CAAC,IAAY;QACvB,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;YAChE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3C,OAAO;gBACL,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,UAAU;gBAC/B,YAAY,EAAE,CAAC,CAAC,MAAM,CAAC,YAAY;gBACnC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,UAAU;gBAC/B,gBAAgB,EAAE,CAAC,CAAC,MAAM,CAAC,gBAAgB;gBAC3C,cAAc,EAAE,CAAC,CAAC,MAAM,CAAC,cAAc;gBACvC,iBAAiB,EAAE,CAAC,CAAC,MAAM,CAAC,iBAAiB;gBAC7C,gBAAgB,EAAE,CAAC,CAAC,MAAM,CAAC,gBAAgB;gBAC3C,cAAc,EAAE,OAAO,MAAM,CAAC,cAAc,KAAK,QAAQ;oBACvD,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,cAAc,CAAC,CAAC;oBACjD,CAAC,CAAC,GAAG;aACR,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,+CAA+C;YAC/C,OAAO,IAAI,sBAAsB,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;CACF;AAED,8EAA8E;AAC9E,oDAAoD;AACpD,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,OAAO,qBAAqB;IAIhC,YAAY,UAA8D;QAHlE,YAAO,GAAG,IAAI,sBAAsB,EAAE,CAAC;QAI7C,IAAI,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,kBAAkB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACpE,CAAC;IAED,wDAAwD;IACxD,KAAK,CAAC,MAAM,CAAC,IAAY;QACvB,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,mEAAmE;IACnE,KAAK,CAAC,aAAa,CAAC,IAAY;QAC9B,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YACb,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;CACF;AAED,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,MAAM,UAAU,qBAAqB,CACnC,QAAsC,EACtC,UAA8D;IAE9D,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,KAAK;YACR,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;YAC3E,CAAC;YACD,OAAO,IAAI,kBAAkB,CAAC,UAAU,CAAC,CAAC;QAC5C,KAAK,QAAQ;YACX,OAAO,IAAI,qBAAqB,CAAC,UAAU,CAAC,CAAC;QAC/C,KAAK,SAAS,CAAC;QACf;YACE,OAAO,IAAI,sBAAsB,EAAE,CAAC;IACxC,CAAC;AACH,CAAC"}