stellar-memory 0.5.0

package/dist/engine/planet.js

@@ -0,0 +1,432 @@
+/**
+ * planet.ts — Memory (planet) management
+ *
+ * Memories are "planets" orbiting the sun. This module handles:
+ *   - createMemory  : place a new memory into orbit.
+ *   - recallMemories: search memories and apply access boost to results (hybrid).
+ *   - forgetMemory  : push a memory to the Oort cloud or soft-delete it.
+ *
+ * Phase 2: Hybrid search
+ *   createMemory kicks off an async background embedding job so that the
+ *   synchronous call returns immediately while the vector index is populated
+ *   without blocking the caller.
+ *
+ *   recallMemories merges FTS5 keyword results with vector KNN results using
+ *   Reciprocal Rank Fusion (RRF), then deduplicates and re-ranks.
+ */
+import { randomUUID, createHash } from 'node:crypto';
+import { IMPACT_DEFAULTS } from './types.js';
+import { insertMemory, searchMemoriesInRange, updateMemoryAccess, updateMemoryOrbit, insertOrbitLog, softDeleteMemory, getMemoryById, getSunState, getMemoryByIds, getMemoryByContentHash, updateQualityScore, getEdgesForBatch, getMemoriesByProject, } from '../storage/queries.js';
+import { getConfig } from '../utils/config.js';
+import { calculateImportance, importanceToDistance, applyAccessBoost, recencyScore, frequencyScore, } from './orbit.js';
+import { keywordRelevance } from './gravity.js';
+import { generateEmbedding } from './embedding.js';
+import { insertEmbedding, searchByVector, deleteEmbedding } from '../storage/vec.js';
+import { getDatabase, withTransaction } from '../storage/database.js';
+import { createLogger } from '../utils/logger.js';
+import { corona } from './corona.js';
+import { calculateQuality } from './quality.js';
+import { trackBgError } from '../mcp/tools/memory-tools.js';
+import { runConsolidation } from './consolidation.js';
+const log = createLogger('planet');
+// ---------------------------------------------------------------------------
+// createMemory
+// ---------------------------------------------------------------------------
+/**
+ * Create a new memory planet and place it in initial orbit.
+ *
+ * Initial placement uses static component values because the memory has just
+ * been created and has no access history or proven relevance yet:
+ *   - recency    = 1.0  (brand new)
+ *   - frequency  = 0.0  (never recalled)
+ *   - impact     = type-specific default (or caller-supplied)
+ *   - relevance  = 0.0  (no context yet; updated on next commit)
+ *
+ * The resulting distance positions the memory in the inner zone for high-impact
+ * types (decisions, milestones) and further out for lower-impact types.
+ */
+export function createMemory(data) {
+    const config = getConfig();
+    const type = data.type ?? 'observation';
+    const impact = data.impact ?? IMPACT_DEFAULTS[type];
+    const tags = data.tags ?? [];
+    // Auto-generate a summary from the first 50 characters if none provided.
+    const raw = data.content.trim();
+    const summary = data.summary
+        ? data.summary
+        : raw.slice(0, 50).trimEnd() + (raw.length > 50 ? '…' : '');
+    // Content-hash deduplication: return the existing memory if identical content
+    // has already been stored in this project.
+    const contentHash = createHash('sha256').update(data.content).digest('hex');
+    const existing = getMemoryByContentHash(data.project, contentHash);
+    if (existing) {
+        log.debug('Duplicate content detected — returning existing memory', {
+            id: existing.id,
+            project: data.project,
+            content_hash: contentHash,
+        });
+        return existing;
+    }
+    // Compute initial importance using static scores.
+    const rec = recencyScore(null, new Date().toISOString(), config.decayHalfLifeHours);
+    const freq = frequencyScore(0, config.frequencySaturationPoint);
+    // Compute relevance against current sun context so new memories start at a
+    // position that reflects their relevance to current work, rather than 0.
+    const sunState = getSunState(data.project);
+    const sunText = sunState
+        ? [sunState.current_work, ...sunState.recent_decisions, ...sunState.next_steps].join(' ')
+        : '';
+    const memoryText = data.content + ' ' + tags.join(' ');
+    const rel = keywordRelevance(memoryText, sunText);
+    const total = Math.min(1.0, config.weights.recency * rec +
+        config.weights.frequency * freq +
+        config.weights.impact * impact +
+        config.weights.relevance * rel);
+    const distance = importanceToDistance(total);
+    const now = new Date().toISOString();
+    const memory = insertMemory({
+        id: randomUUID(),
+        project: data.project,
+        content: data.content,
+        summary,
+        type,
+        tags,
+        distance,
+        importance: total,
+        velocity: 0,
+        impact,
+        access_count: 0,
+        last_accessed_at: null,
+        metadata: {},
+        content_hash: contentHash,
+        created_at: now,
+        updated_at: now,
+        deleted_at: null,
+    });
+    // Background embedding: fire-and-forget so createMemory stays synchronous.
+    // The vector index will be populated within seconds after the model loads.
+    scheduleEmbedding(memory.id, memory.content + ' ' + summary);
+    // Calculate and persist initial quality score
+    try {
+        const quality = calculateQuality(memory);
+        updateQualityScore(memory.id, quality.overall);
+    }
+    catch {
+        // Quality scoring is non-critical — don't block creation
+    }
+    // If the new memory lands in the corona zone, cache it immediately.
+    if (memory.distance < 5.0) {
+        corona.upsert(memory);
+    }
+    // Auto-consolidation: trigger background consolidation when project
+    // memory count exceeds 100 to keep the memory system lean.
+    try {
+        const projectMemories = getMemoriesByProject(data.project);
+        if (projectMemories.length > 100) {
+            runConsolidation(data.project).catch(() => {
+                try {
+                    trackBgError('consolidation');
+                }
+                catch { /* ignore */ }
+            });
+        }
+    }
+    catch {
+        // Non-critical — skip silently
+    }
+    return memory;
+}
+/**
+ * Schedule an async embedding generation for a memory.
+ * Errors are swallowed so they never affect the calling code path.
+ */
+function scheduleEmbedding(memoryId, text) {
+    generateEmbedding(text)
+        .then(embedding => {
+        try {
+            const db = getDatabase();
+            insertEmbedding(db, memoryId, embedding);
+        }
+        catch {
+            // DB may have been reset (tests) — ignore silently
+        }
+    })
+        .catch(() => {
+        // Model not loaded / network error — FTS5 fallback remains active
+        try {
+            trackBgError('embedding');
+        }
+        catch { /* ignore circular import at startup */ }
+    });
+}
+// ---------------------------------------------------------------------------
+// forgetMemory
+// ---------------------------------------------------------------------------
+/**
+ * Forget a memory.
+ *
+ * Modes:
+ *   - 'push'  : Push the memory to the Oort cloud (distance ≈ 95 AU).
+ *               The memory remains searchable but will rarely surface.
+ *   - 'delete': Soft-delete the memory (sets deleted_at; excluded from queries).
+ */
+export function forgetMemory(memoryId, mode) {
+    if (mode === 'delete') {
+        softDeleteMemory(memoryId);
+        corona.evict(memoryId);
+        return;
+    }
+    // Push mode: drift the memory to the deep Oort cloud.
+    const memory = getMemoryById(memoryId);
+    if (!memory) {
+        return;
+    }
+    const OORT_DISTANCE = 95.0; // deep Oort cloud but not at maximum
+    const newImportance = 0.02; // nearly forgotten
+    const velocity = OORT_DISTANCE - memory.distance;
+    updateMemoryOrbit(memoryId, OORT_DISTANCE, newImportance, velocity);
+    insertOrbitLog({
+        memory_id: memoryId,
+        project: memory.project,
+        old_distance: memory.distance,
+        new_distance: OORT_DISTANCE,
+        old_importance: memory.importance,
+        new_importance: newImportance,
+        trigger: 'forget',
+    });
+    // Also remove the embedding from the vector index
+    try {
+        const db = getDatabase();
+        deleteEmbedding(db, memoryId);
+    }
+    catch {
+        // vec tables may not be available — ignore
+    }
+    // Evict from corona cache regardless of mode.
+    corona.evict(memoryId);
+}
+// ---------------------------------------------------------------------------
+// Hybrid search helpers (Phase 2)
+// ---------------------------------------------------------------------------
+/**
+ * Reciprocal Rank Fusion: merge FTS5 results and vector result IDs.
+ *
+ * RRF(d) = Σ 1 / (k + rank_i)   where k = 60 (standard constant)
+ *
+ * Both lists are ranked 1-based. The merged list is sorted by descending
+ * RRF score and de-duplicated.
+ *
+ * Returns an array of Memory objects in merged order. Memories that only
+ * appear in the vecIds list will be represented as partial stubs with just
+ * the id field populated — callers should call hydrateVectorOnlyResults().
+ */
+function mergeRRF(ftsResults, vecIds, limit) {
+    const K = 60;
+    const scores = new Map();
+    ftsResults.forEach((m, i) => {
+        scores.set(m.id, (scores.get(m.id) ?? 0) + 1 / (K + i + 1));
+    });
+    vecIds.forEach((id, i) => {
+        scores.set(id, (scores.get(id) ?? 0) + 1 / (K + i + 1));
+    });
+    // Sort by descending RRF score
+    const sorted = [...scores.entries()]
+        .sort((a, b) => b[1] - a[1])
+        .slice(0, limit)
+        .map(([id]) => id);
+    // Build result list: prefer full Memory objects from ftsResults when available
+    const ftsMap = new Map(ftsResults.map(m => [m.id, m]));
+    return sorted.map(id => ftsMap.get(id) ?? { id });
+}
+/**
+ * Resolve partial Memory stubs (from vector-only results) into full objects.
+ * Performs a single batched DB lookup for all missing memories.
+ */
+function hydrateVectorOnlyResults(merged, ftsResults) {
+    const ftsIds = new Set(ftsResults.map(m => m.id));
+    const missingIds = merged
+        .filter(m => !ftsIds.has(m.id) && m.content === undefined)
+        .map(m => m.id);
+    if (missingIds.length === 0)
+        return merged;
+    const fetched = getMemoryByIds(missingIds);
+    const fetchedMap = new Map(fetched.map(m => [m.id, m]));
+    return merged.map(m => m.content === undefined ? (fetchedMap.get(m.id) ?? m) : m);
+}
+// ---------------------------------------------------------------------------
+// Tiered recall pipeline (Corona architecture)
+// ---------------------------------------------------------------------------
+/** Zone boost factors applied to search results by tier origin. */
+const ZONE_BOOST = {
+    core: 1.2,
+    near: 1.1,
+    active: 1.0,
+    archive: 0.95,
+    fading: 0.85,
+    forgotten: 0.7,
+};
+/** Tier priority multiplier (earlier tiers are preferred at equal relevance). */
+const TIER_PRIORITY = {
+    tier1: 1.0,
+    tier2: 0.95,
+    tier3: 0.90,
+};
+/**
+ * Async tiered recall: 3-tier pipeline from corona cache → FTS5 → full hybrid.
+ *
+ * Tier 1: Corona cache (0ms) — core + near zone, token matching
+ * Tier 2: Active zone FTS5 (1-5ms) — distance 5.0–15.0
+ * Tier 3: Full hybrid FTS5 + vector (5-50ms) — distance 15.0+
+ *
+ * Early exit: if Tier 1 fills the requested limit, Tier 2 and 3 are skipped.
+ */
+export async function recallMemoriesAsync(project, query, options) {
+    const limit = options?.limit ?? 10;
+    const scored = [];
+    // Pre-seed seenIds with exclusions (e.g., corona IDs already shown in Sun)
+    const seenIds = new Set(options?.excludeIds ?? []);
+    // ── Tier 1: Corona cache (in-memory, ~0ms) ─────────────────────────────
+    const coronaResults = corona.search(query, limit * 2);
+    for (let i = 0; i < coronaResults.length; i++) {
+        const m = coronaResults[i];
+        const zoneBoost = m.distance < 1.0 ? ZONE_BOOST.core : ZONE_BOOST.near;
+        const rankScore = 1 / (1 + i); // rank-based score
+        scored.push({
+            memory: m,
+            score: rankScore * zoneBoost * TIER_PRIORITY.tier1,
+            tier: m.distance < 1.0 ? 'CORE' : 'NEAR',
+        });
+        seenIds.add(m.id);
+    }
+    // Early exit: if corona filled the limit, skip DB searches
+    const remaining = limit - scored.length;
+    // ── Tier 2: Active zone FTS5 (distance 5.0–15.0, ~1-5ms) ──────────────
+    if (remaining > 0) {
+        const tier2Results = searchMemoriesInRange(project, query, 5.0, 15.0, remaining * 2);
+        for (let i = 0; i < tier2Results.length; i++) {
+            const m = tier2Results[i];
+            if (seenIds.has(m.id))
+                continue;
+            const rankScore = 1 / (1 + i);
+            scored.push({
+                memory: m,
+                score: rankScore * ZONE_BOOST.active * TIER_PRIORITY.tier2,
+                tier: 'ACTIVE',
+            });
+            seenIds.add(m.id);
+        }
+    }
+    // ── Tier 3: Full hybrid FTS5 + vector (distance 15.0+, ~5-50ms) ───────
+    const remaining3 = limit - scored.filter(s => s.score > 0).length;
+    if (remaining3 > 0) {
+        const fetchN = remaining3 * 3;
+        // FTS5 for far zone
+        const ftsResults = searchMemoriesInRange(project, query, 15.0, 100.0, fetchN);
+        // Vector KNN search (async embedding)
+        let vecIds = [];
+        try {
+            const db = getDatabase();
+            const queryEmbedding = await generateEmbedding(query);
+            const vecResults = searchByVector(db, queryEmbedding, fetchN);
+            vecIds = vecResults.map(r => r.memoryId);
+        }
+        catch {
+            // Model not ready or vec tables unavailable — FTS5 covers it
+        }
+        // Merge FTS5 + vector via RRF
+        let merged = mergeRRF(ftsResults, vecIds, fetchN);
+        merged = hydrateVectorOnlyResults(merged, ftsResults);
+        for (let i = 0; i < merged.length; i++) {
+            const m = merged[i];
+            if (seenIds.has(m.id))
+                continue;
+            if (!m.content)
+                continue; // skip unhydrated stubs
+            const zoneBoost = m.distance < 40
+                ? ZONE_BOOST.archive
+                : m.distance < 70
+                    ? ZONE_BOOST.fading
+                    : ZONE_BOOST.forgotten;
+            const rankScore = 1 / (1 + i);
+            scored.push({
+                memory: m,
+                score: rankScore * zoneBoost * TIER_PRIORITY.tier3,
+                tier: 'DEEP',
+            });
+            seenIds.add(m.id);
+        }
+    }
+    // ── Constellation edge boost ──────────────────────────────────────────
+    // Memories connected via knowledge graph edges get a score boost.
+    try {
+        const scoredIds = scored.map(s => s.memory.id);
+        const edgeMap = getEdgesForBatch(scoredIds, project);
+        const EDGE_BOOST = 0.07;
+        for (const entry of scored) {
+            const neighbors = edgeMap.get(entry.memory.id);
+            if (neighbors && neighbors.size > 0) {
+                // Boost proportional to number of connections (capped at 3)
+                const edgeCount = Math.min(neighbors.size, 3);
+                entry.score += edgeCount * EDGE_BOOST;
+            }
+        }
+    }
+    catch {
+        // Constellation tables may not exist — skip boost silently
+    }
+    // ── Sort by composite score descending ─────────────────────────────────
+    scored.sort((a, b) => b.score - a.score);
+    // ── Filter ─────────────────────────────────────────────────────────────
+    let filtered = scored;
+    if (options?.type && options.type !== 'all') {
+        const filterType = options.type;
+        filtered = filtered.filter(s => s.memory.type === filterType);
+    }
+    if (options?.minDistance !== undefined) {
+        const minDist = options.minDistance;
+        filtered = filtered.filter(s => s.memory.distance >= minDist);
+    }
+    if (options?.maxDistance !== undefined) {
+        const maxDist = options.maxDistance;
+        filtered = filtered.filter(s => s.memory.distance <= maxDist);
+    }
+    const finalScored = filtered.slice(0, limit);
+    // ── Access boost + orbit update ────────────────────────────────────────
+    const sunState = getSunState(project);
+    const sunText = sunState
+        ? [sunState.current_work, ...sunState.recent_decisions, ...sunState.next_steps].join(' ')
+        : '';
+    const config = getConfig();
+    const results = withTransaction(() => finalScored.map(({ memory, tier }) => {
+        const newDistance = applyAccessBoost(memory.distance);
+        const velocity = newDistance - memory.distance;
+        updateMemoryAccess(memory.id);
+        const updatedMemory = {
+            ...memory,
+            distance: newDistance,
+            access_count: memory.access_count + 1,
+            last_accessed_at: new Date().toISOString(),
+        };
+        const components = calculateImportance(updatedMemory, sunText, config);
+        updateMemoryOrbit(memory.id, newDistance, components.total, velocity);
+        insertOrbitLog({
+            memory_id: memory.id,
+            project,
+            old_distance: memory.distance,
+            new_distance: newDistance,
+            old_importance: memory.importance,
+            new_importance: components.total,
+            trigger: 'access',
+        });
+        const result = { ...updatedMemory, importance: components.total, velocity };
+        // If memory moved into the corona zone (< 5.0 AU), update cache
+        if (newDistance < 5.0) {
+            corona.upsert(result);
+        }
+        // Attach tier marker to metadata for display
+        result.metadata = { ...result.metadata, _tier: tier };
+        return result;
+    }));
+    return results;
+}
+//# sourceMappingURL=planet.js.map

package/dist/engine/planet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planet.js","sourceRoot":"","sources":["../../src/engine/planet.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAErD,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC7C,OAAO,EACL,YAAY,EAEZ,qBAAqB,EACrB,kBAAkB,EAClB,iBAAiB,EACjB,cAAc,EACd,gBAAgB,EAChB,aAAa,EACb,WAAW,EACX,cAAc,EACd,sBAAsB,EACtB,kBAAkB,EAClB,gBAAgB,EAChB,oBAAoB,GACrB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EACL,mBAAmB,EACnB,oBAAoB,EACpB,gBAAgB,EAChB,YAAY,EACZ,cAAc,GACf,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACrF,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEtD,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;AAEnC,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,YAAY,CAAC,IAO5B;IACC,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAE3B,MAAM,IAAI,GAAiB,IAAI,CAAC,IAAI,IAAM,aAAa,CAAC;IACxD,MAAM,MAAM,GAAe,IAAI,CAAC,MAAM,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC;IAChE,MAAM,IAAI,GAAiB,IAAI,CAAC,IAAI,IAAM,EAAE,CAAC;IAE7C,yEAAyE;IACzE,MAAM,GAAG,GAAO,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;IACpC,MAAM,OAAO,GAAW,IAAI,CAAC,OAAO;QAClC,CAAC,CAAC,IAAI,CAAC,OAAO;QACd,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAE9D,8EAA8E;IAC9E,2CAA2C;IAC3C,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5E,MAAM,QAAQ,GAAG,sBAAsB,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IACnE,IAAI,QAAQ,EAAE,CAAC;QACb,GAAG,CAAC,KAAK,CAAC,wDAAwD,EAAE;YAClE,EAAE,EAAE,QAAQ,CAAC,EAAE;YACf,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,YAAY,EAAE,WAAW;SAC1B,CAAC,CAAC;QACH,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,kDAAkD;IAClD,MAAM,GAAG,GAAI,YAAY,CAAC,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,MAAM,CAAC,kBAAkB,CAAC,CAAC;IACrF,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,EAAE,MAAM,CAAC,wBAAwB,CAAC,CAAC;IAEhE,2EAA2E;IAC3E,yEAAyE;IACzE,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,OAAO,GAAI,QAAQ;QACvB,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,EAAE,GAAG,QAAQ,CAAC,gBAAgB,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QACzF,CAAC,CAAC,EAAE,CAAC;IACP,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvD,MAAM,GAAG,GAAG,gBAAgB,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAElD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CACpB,GAAG,EACH,MAAM,CAAC,OAAO,CAAC,OAAO,GAAK,GAAG;QAC9B,MAAM,CAAC,OAAO,CAAC,SAAS,GAAG,IAAI;QAC/B,MAAM,CAAC,OAAO,CAAC,MAAM,GAAM,MAAM;QACjC,MAAM,CAAC,OAAO,CAAC,SAAS,GAAG,GAAG,CAC/B,CAAC;IAEF,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAC7C,MAAM,GAAG,GAAQ,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAE1C,MAAM,MAAM,GAAG,YAAY,CAAC;QAC1B,EAAE,EAAe,UAAU,EAAE;QAC7B,OAAO,EAAU,IAAI,CAAC,OAAO;QAC7B,OAAO,EAAU,IAAI,CAAC,OAAO;QAC7B,OAAO;QACP,IAAI;QACJ,IAAI;QACJ,QAAQ;QACR,UAAU,EAAO,KAAK;QACtB,QAAQ,EAAS,CAAC;QAClB,MAAM;QACN,YAAY,EAAK,CAAC;QAClB,gBAAgB,EAAE,IAAI;QACtB,QAAQ,EAAS,EAAE;QACnB,YAAY,EAAK,WAAW;QAC5B,UAAU,EAAO,GAAG;QACpB,UAAU,EAAO,GAAG;QACpB,UAAU,EAAO,IAAI;KACtB,CAAC,CAAC;IAEH,2EAA2E;IAC3E,2EAA2E;IAC3E,iBAAiB,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,OAAO,GAAG,GAAG,GAAG,OAAO,CAAC,CAAC;IAE7D,8CAA8C;IAC9C,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACzC,kBAAkB,CAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;IACjD,CAAC;IAAC,MAAM,CAAC;QACP,yDAAyD;IAC3D,CAAC;IAED,oEAAoE;IACpE,IAAI,MAAM,CAAC,QAAQ,GAAG,GAAG,EAAE,CAAC;QAC1B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACxB,CAAC;IAED,oEAAoE;IACpE,2DAA2D;IAC3D,IAAI,CAAC;QACH,MAAM,eAAe,GAAG,oBAAoB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3D,IAAI,eAAe,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YACjC,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE;gBACxC,IAAI,CAAC;oBAAC,YAAY,CAAC,eAAe,CAAC,CAAC;gBAAC,CAAC;gBAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;YAC/D,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,+BAA+B;IACjC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,QAAgB,EAAE,IAAY;IACvD,iBAAiB,CAAC,IAAI,CAAC;SACpB,IAAI,CAAC,SAAS,CAAC,EAAE;QAChB,IAAI,CAAC;YACH,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;YACzB,eAAe,CAAC,EAAE,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC3C,CAAC;QAAC,MAAM,CAAC;YACP,mDAAmD;QACrD,CAAC;IACH,CAAC,CAAC;SACD,KAAK,CAAC,GAAG,EAAE;QACV,kEAAkE;QAClE,IAAI,CAAC;YAAC,YAAY,CAAC,WAAW,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,uCAAuC,CAAC,CAAC;IACtF,CAAC,CAAC,CAAC;AACP,CAAC;AAED,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB,EAAE,IAAuB;IACpE,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtB,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAC3B,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvB,OAAO;IACT,CAAC;IAED,sDAAsD;IACtD,MAAM,MAAM,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IACvC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO;IACT,CAAC;IAED,MAAM,aAAa,GAAG,IAAI,CAAC,CAAC,qCAAqC;IACjE,MAAM,aAAa,GAAG,IAAI,CAAC,CAAC,mBAAmB;IAC/C,MAAM,QAAQ,GAAQ,aAAa,GAAG,MAAM,CAAC,QAAQ,CAAC;IAEtD,iBAAiB,CAAC,QAAQ,EAAE,aAAa,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC;IAEpE,cAAc,CAAC;QACb,SAAS,EAAO,QAAQ;QACxB,OAAO,EAAS,MAAM,CAAC,OAAO;QAC9B,YAAY,EAAI,MAAM,CAAC,QAAQ;QAC/B,YAAY,EAAI,aAAa;QAC7B,cAAc,EAAE,MAAM,CAAC,UAAU;QACjC,cAAc,EAAE,aAAa;QAC7B,OAAO,EAAS,QAAQ;KACzB,CAAC,CAAC;IAEH,kDAAkD;IAClD,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;QACzB,eAAe,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IAChC,CAAC;IAAC,MAAM,CAAC;QACP,2CAA2C;IAC7C,CAAC;IAED,8CAA8C;IAC9C,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;AACzB,CAAC;AAED,8EAA8E;AAC9E,kCAAkC;AAClC,8EAA8E;AAE9E;;;;;;;;;;;GAWG;AACH,SAAS,QAAQ,CACf,UAAoB,EACpB,MAAgB,EAChB,KAAa;IAEb,MAAM,CAAC,GAAG,EAAE,CAAC;IACb,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;QACvB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,+BAA+B;IAC/B,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;SACjC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;SACf,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAErB,+EAA+E;IAC/E,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,OAAO,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAK,EAAE,EAAE,EAAa,CAAC,CAAC;AAChE,CAAC;AAED;;;GAGG;AACH,SAAS,wBAAwB,CAC/B,MAAgB,EAChB,UAAoB;IAEpB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,UAAU,GAAG,MAAM;SACtB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC;SACzD,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAElB,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IAE3C,MAAM,OAAO,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAExD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CACpB,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC1D,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,+CAA+C;AAC/C,8EAA8E;AAE9E,mEAAmE;AACnE,MAAM,UAAU,GAAG;IACjB,IAAI,EAAE,GAAG;IACT,IAAI,EAAE,GAAG;IACT,MAAM,EAAE,GAAG;IACX,OAAO,EAAE,IAAI;IACb,MAAM,EAAE,IAAI;IACZ,SAAS,EAAE,GAAG;CACN,CAAC;AAEX,iFAAiF;AACjF,MAAM,aAAa,GAAG;IACpB,KAAK,EAAE,GAAG;IACV,KAAK,EAAE,IAAI;IACX,KAAK,EAAE,IAAI;CACH,CAAC;AAQX;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,OAAe,EACf,KAAa,EACb,OAMC;IAED,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;IACnC,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,2EAA2E;IAC3E,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,OAAO,EAAE,UAAU,IAAI,EAAE,CAAC,CAAC;IAE3D,0EAA0E;IAC1E,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,SAAS,GAAG,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC;QACvE,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,mBAAmB;QACnD,MAAM,CAAC,IAAI,CAAC;YACV,MAAM,EAAE,CAAC;YACT,KAAK,EAAE,SAAS,GAAG,SAAS,GAAG,aAAa,CAAC,KAAK;YAClD,IAAI,EAAE,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM;SACzC,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IAED,2DAA2D;IAC3D,MAAM,SAAS,GAAG,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;IAExC,yEAAyE;IACzE,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAClB,MAAM,YAAY,GAAG,qBAAqB,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC;QACrF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YAChC,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC;gBACV,MAAM,EAAE,CAAC;gBACT,KAAK,EAAE,SAAS,GAAG,UAAU,CAAC,MAAM,GAAG,aAAa,CAAC,KAAK;gBAC1D,IAAI,EAAE,QAAQ;aACf,CAAC,CAAC;YACH,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,MAAM,UAAU,GAAG,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;IAClE,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QACnB,MAAM,MAAM,GAAG,UAAU,GAAG,CAAC,CAAC;QAE9B,oBAAoB;QACpB,MAAM,UAAU,GAAG,qBAAqB,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAE9E,sCAAsC;QACtC,IAAI,MAAM,GAAa,EAAE,CAAC;QAC1B,IAAI,CAAC;YACH,MAAM,EAAE,GAAG,WAAW,EAAE,CAAC;YACzB,MAAM,cAAc,GAAG,MAAM,iBAAiB,CAAC,KAAK,CAAC,CAAC;YACtD,MAAM,UAAU,GAAG,cAAc,CAAC,EAAE,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;YAC9D,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC3C,CAAC;QAAC,MAAM,CAAC;YACP,6DAA6D;QAC/D,CAAC;QAED,8BAA8B;QAC9B,IAAI,MAAM,GAAG,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAClD,MAAM,GAAG,wBAAwB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAEtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YAChC,IAAI,CAAC,CAAC,CAAC,OAAO;gBAAE,SAAS,CAAC,wBAAwB;YAElD,MAAM,SAAS,GAAG,CAAC,CAAC,QAAQ,GAAG,EAAE;gBAC/B,CAAC,CAAC,UAAU,CAAC,OAAO;gBACpB,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,EAAE;oBACf,CAAC,CAAC,UAAU,CAAC,MAAM;oBACnB,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC;YAE3B,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC;gBACV,MAAM,EAAE,CAAC;gBACT,KAAK,EAAE,SAAS,GAAG,SAAS,GAAG,aAAa,CAAC,KAAK;gBAClD,IAAI,EAAE,MAAM;aACb,CAAC,CAAC;YACH,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,kEAAkE;IAClE,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACrD,MAAM,UAAU,GAAG,IAAI,CAAC;QAExB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC/C,IAAI,SAAS,IAAI,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBACpC,4DAA4D;gBAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAC9C,KAAK,CAAC,KAAK,IAAI,SAAS,GAAG,UAAU,CAAC;YACxC,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,2DAA2D;IAC7D,CAAC;IAED,0EAA0E;IAC1E,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAEzC,0EAA0E;IAC1E,IAAI,QAAQ,GAAG,MAAM,CAAC;IAEtB,IAAI,OAAO,EAAE,IAAI,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC5C,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC;QAChC,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;IAChE,CAAC;IAED,IAAI,OAAO,EAAE,WAAW,KAAK,SAAS,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,OAAO,CAAC,WAAW,CAAC;QACpC,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,IAAI,OAAO,CAAC,CAAC;IAChE,CAAC;IAED,IAAI,OAAO,EAAE,WAAW,KAAK,SAAS,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,OAAO,CAAC,WAAW,CAAC;QACpC,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,IAAI,OAAO,CAAC,CAAC;IAChE,CAAC;IAED,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAE7C,0EAA0E;IAC1E,MAAM,QAAQ,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IACtC,MAAM,OAAO,GAAI,QAAQ;QACvB,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,EAAE,GAAG,QAAQ,CAAC,gBAAgB,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QACzF,CAAC,CAAC,EAAE,CAAC;IACP,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAE3B,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,EAAE,CACnC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE;QACnC,MAAM,WAAW,GAAG,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACtD,MAAM,QAAQ,GAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC;QAElD,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAE9B,MAAM,aAAa,GAAW;YAC5B,GAAG,MAAM;YACT,QAAQ,EAAU,WAAW;YAC7B,YAAY,EAAM,MAAM,CAAC,YAAY,GAAG,CAAC;YACzC,gBAAgB,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SAC3C,CAAC;QAEF,MAAM,UAAU,GAAG,mBAAmB,CAAC,aAAa,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;QACvE,iBAAiB,CAAC,MAAM,CAAC,EAAE,EAAE,WAAW,EAAE,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAEtE,cAAc,CAAC;YACb,SAAS,EAAO,MAAM,CAAC,EAAE;YACzB,OAAO;YACP,YAAY,EAAI,MAAM,CAAC,QAAQ;YAC/B,YAAY,EAAI,WAAW;YAC3B,cAAc,EAAE,MAAM,CAAC,UAAU;YACjC,cAAc,EAAE,UAAU,CAAC,KAAK;YAChC,OAAO,EAAS,QAAQ;SACzB,CAAC,CAAC;QAEH,MAAM,MAAM,GAAG,EAAE,GAAG,aAAa,EAAE,UAAU,EAAE,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC;QAE5E,gEAAgE;QAChE,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;YACtB,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;QAED,6CAA6C;QAC7C,MAAM,CAAC,QAAQ,GAAG,EAAE,GAAG,MAAM,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QAEtD,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC,CACH,CAAC;IAEF,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/engine/procedural.d.ts

@@ -0,0 +1,71 @@
+/**
+ * procedural.ts — Procedural Memory ("Navigation Rules")
+ *
+ * Procedural memories are behavioral rules learned from patterns in other
+ * memories. They represent "how we do things here" — conventions, workflows,
+ * and recurring solutions extracted from observed repetition.
+ *
+ * Key behaviors:
+ *   - Pattern detection: group memories by tags, find groups with 3+ members
+ *   - Rule creation: procedural memories start with high impact (0.9)
+ *   - Slow decay: procedural memories decay at 30% of the normal rate
+ *   - Sun integration: top 5 rules appear in a dedicated section
+ */
+import type { Memory } from './types.js';
+/**
+ * Detect patterns in the memory corpus that are strong enough to warrant
+ * a procedural rule.
+ *
+ * Returns one candidate per tag-group that has 3+ members, describing the
+ * observed pattern and suggesting a concrete rule.
+ */
+export declare function detectProceduralPattern(memories: Memory[], project: string): Array<{
+    pattern: string;
+    frequency: number;
+    suggestedRule: string;
+}>;
+/**
+ * Create a procedural memory from a learned rule and its supporting evidence.
+ *
+ * Procedural memories:
+ *   - Use type 'procedural'
+ *   - Start with high impact (0.9) so they orbit close to the sun
+ *   - Include both the rule and the evidence that generated it
+ *   - Are tagged with 'procedural' plus terms extracted from the rule
+ */
+export declare function createProceduralMemory(rule: string, evidence: string[], project: string): Memory;
+/**
+ * Get all procedural memories for a project, sorted by importance descending.
+ * These feed into the sun content formatter and the suggest logic.
+ */
+export declare function getProceduralMemories(project: string): Memory[];
+/**
+ * Format procedural memories as a concise "Navigation Rules" section
+ * suitable for inclusion in the sun resource content.
+ *
+ * At most 5 rules are shown (most important first). Each rule is rendered
+ * as a single numbered line extracted from the content (the "Rule: ..." part).
+ */
+export declare function formatProceduralSection(memories: Memory[]): string;
+/**
+ * Procedural memories are hard-won knowledge and should be highly durable.
+ * Return 0.3 so that the effective half-life is ~3.3x longer than normal.
+ *
+ * Used by orbit.ts when calculating recency score for procedural memories:
+ *   effectiveHalfLife = baseHalfLife / getProceduralDecayMultiplier()
+ */
+export declare function getProceduralDecayMultiplier(): number;
+/**
+ * Analyse the last 50 memories and suggest concrete procedural rules.
+ *
+ * Returns candidates sorted by confidence (highest first). Confidence is
+ * the proportion of the tag-group that supports a consistent pattern.
+ *
+ * Skips rules that already exist as procedural memories (by rule text match).
+ */
+export declare function suggestRules(recentMemories: Memory[]): Array<{
+    rule: string;
+    confidence: number;
+    evidence: Memory[];
+}>;
+//# sourceMappingURL=procedural.d.ts.map