agent-nuvira 1.14.0

package/dist/memory/trajectory-store.js

@@ -0,0 +1,476 @@
+/**
+ * TrajectoryStore — Stores and retrieves successful agent execution trajectories.
+ *
+ * A trajectory captures a full agent session: the goal, the plan,
+ * what files were touched, what changes were made, and the outcome.
+ * This data is stored in a JSON file and indexed via the VectorStore
+ * for semantic similarity search.
+ *
+ * When a new goal arrives, the Orchestrator queries past trajectories
+ * and injects similar ones as few-shot examples into agent prompts.
+ *
+ * File location: ~/.buff/memory/trajectories.json
+ */
+import { readFileSync, writeFileSync, existsSync, mkdirSync } from 'node:fs';
+import { join } from 'node:path';
+import { homedir } from 'node:os';
+import { getVectorStore } from './vector-store.js';
+import { embed, EMBEDDING_DIM } from './embedder.js';
+import { logger } from '../utils/logger.js';
+import { scoreTrajectory } from '../learning/scorer.js';
+// ─── Constants ──────────────────────────────────────────────────────────────
+const MEMORY_DIR = join(homedir(), '.buff', 'memory');
+const TRAJECTORIES_PATH = join(MEMORY_DIR, 'trajectories.json');
+const CURRENT_VERSION = 1;
+const MAX_TRAJECTORIES = 500;
+// ─── Helpers ────────────────────────────────────────────────────────────────
+function ensureDir() {
+    if (!existsSync(MEMORY_DIR)) {
+        mkdirSync(MEMORY_DIR, { recursive: true });
+    }
+}
+function readTrajectories() {
+    try {
+        ensureDir();
+        if (!existsSync(TRAJECTORIES_PATH)) {
+            return { trajectories: {}, version: CURRENT_VERSION };
+        }
+        const raw = readFileSync(TRAJECTORIES_PATH, 'utf-8');
+        return JSON.parse(raw);
+    }
+    catch {
+        return { trajectories: {}, version: CURRENT_VERSION };
+    }
+}
+function writeTrajectories(data) {
+    ensureDir();
+    writeFileSync(TRAJECTORIES_PATH, JSON.stringify(data, null, 2), 'utf-8');
+}
+/** Generate a unique trajectory ID */
+function generateId() {
+    return `traj-${Date.now()}-${Math.random().toString(36).slice(2, 8)}`;
+}
+/** Simple heuristic to guess a project fingerprint from file changes */
+function guessProjectFingerprint(fileChanges) {
+    const paths = fileChanges.map((c) => c.path);
+    const allExtensions = paths
+        .map((p) => p.slice(p.lastIndexOf('.')))
+        .filter(Boolean);
+    const extSet = new Set(allExtensions);
+    const tags = [];
+    if (extSet.has('.ts') || extSet.has('.tsx'))
+        tags.push('typescript');
+    if (extSet.has('.js') || extSet.has('.jsx'))
+        tags.push('javascript');
+    if (extSet.has('.py'))
+        tags.push('python');
+    if (extSet.has('.go'))
+        tags.push('go');
+    if (extSet.has('.rs'))
+        tags.push('rust');
+    if (extSet.has('.json'))
+        tags.push('json');
+    if (paths.some((p) => p.includes('package.json')))
+        tags.push('node');
+    if (paths.some((p) => p.includes('Dockerfile')))
+        tags.push('docker');
+    return tags.length > 0 ? tags.join(', ') : 'unknown';
+}
+// ─── TrajectoryStore ────────────────────────────────────────────────────────
+/**
+ * Manages the storage and retrieval of agent execution trajectories.
+ */
+export class TrajectoryStore {
+    /**
+     * Save a successful orchestration result as a trajectory.
+     * Also indexes it in the VectorStore for semantic search.
+     *
+     * @param result       The orchestration result to save
+     * @param callLLM      LLM function for generating the embedding vector
+     * @param taskPlan     The original task plan steps
+     * @returns            The trajectory ID
+     */
+    async save(result, callLLM, taskPlan, contextFiles) {
+        // Only save successful trajectories
+        if (!result.success)
+            return '';
+        const data = readTrajectories();
+        // Prune old trajectories if we're at the limit
+        this.pruneIfNeeded(data);
+        const id = generateId();
+        const trajectory = {
+            id,
+            goal: result.goal,
+            projectFingerprint: '', // Will be set below after parsing file changes
+            taskPlan: taskPlan.map((s) => ({
+                id: s.id,
+                description: s.description,
+                agentType: s.agentType,
+            })),
+            contextFiles,
+            fileChanges: result.fileChanges
+                .split('\n')
+                .filter((l) => l.includes('📄') || l.includes('✏️') || l.includes('🗑️'))
+                .map((l) => {
+                const match = l.match(/[✏️📄🗑️]\s+(.+?)\s+\((.*?)\)/);
+                return match
+                    ? { path: match[1], status: match[2] }
+                    : { path: l.trim(), status: 'modified' };
+            }),
+            tasksCompleted: result.tasksCompleted,
+            tasksTotal: result.tasksTotal,
+            // Use the heuristic scorer for a more nuanced quality score
+            score: scoreTrajectory({
+                tasksCompleted: result.tasksCompleted,
+                tasksTotal: result.tasksTotal,
+                reviewPassed: result.success && !result.error,
+                totalSteps: taskPlan.length,
+            }).total,
+            timestamp: Date.now(),
+        };
+        // Compute the project fingerprint from real file changes
+        trajectory.projectFingerprint = guessProjectFingerprint(trajectory.fileChanges.map((fc) => ({
+            path: fc.path,
+            status: fc.status,
+        })));
+        // Store the trajectory
+        data.trajectories[id] = trajectory;
+        writeTrajectories(data);
+        // Generate embedding and index in VectorStore
+        // Uses native embeddings (Tier 1/Xenova) if available, falls back to LLM
+        try {
+            const embeddingText = this.buildEmbeddingText(trajectory);
+            const vector = await embed(embeddingText, callLLM);
+            // Check if embedding succeeded (non-zero vector)
+            if (vector.some((v) => v !== 0)) {
+                const vs = getVectorStore();
+                await vs.insert(id, vector, {
+                    goal: trajectory.goal,
+                    projectFingerprint: trajectory.projectFingerprint,
+                    score: trajectory.score,
+                    timestamp: trajectory.timestamp,
+                });
+                logger.debug(`Indexed trajectory ${id} in vector store (${EMBEDDING_DIM} dim)`);
+            }
+            else {
+                logger.debug(`Skipping vector index for ${id}: zero vector (embedding failed)`);
+            }
+        }
+        catch (err) {
+            // Non-fatal: trajectory is stored but not indexed for search
+            logger.debug(`Failed to index trajectory ${id}: ${err}`);
+        }
+        return id;
+    }
+    /**
+     * Retrieve a single trajectory by ID.
+     */
+    async get(id) {
+        const data = readTrajectories();
+        return data.trajectories[id] || null;
+    }
+    /**
+     * Search for trajectories similar to a goal.
+     *
+     * @param goal      The goal text to search by
+     * @param callLLM   LLM function for generating the query embedding
+     * @param k         Maximum number of results
+     * @returns         Array of trajectories sorted by relevance
+     */
+    async searchByGoal(goal, callLLM, k = 3) {
+        try {
+            // Generate embedding for the query
+            const queryPrompt = `Search query for past agent trajectories: ${goal}`;
+            const queryVector = await embed(queryPrompt, callLLM);
+            // Skip search if we got a zero vector (embedding failed)
+            if (queryVector.every((v) => v === 0))
+                return [];
+            // Search the vector index
+            const vs = getVectorStore();
+            const results = await vs.search(queryVector, k, (entry) => {
+                const score = entry.metadata.score || 0;
+                return score >= 0.5; // Only retrieve quality trajectories
+            });
+            // Load full trajectories from the store
+            const trajectories = [];
+            const data = readTrajectories();
+            for (const { entry, similarity } of results) {
+                const traj = data.trajectories[entry.id];
+                if (traj && similarity > 0.3) {
+                    trajectories.push(traj);
+                }
+            }
+            return trajectories;
+        }
+        catch (err) {
+            logger.debug(`Trajectory search failed: ${err}`);
+            return [];
+        }
+    }
+    /**
+     * Format trajectories as few-shot examples for agent prompts.
+     * Truncates plans to the first 5 steps to save token budget.
+     * Returns a string that can be injected into the PlannerAgent's prompt.
+     */
+    formatAsFewShot(trajectories) {
+        if (trajectories.length === 0)
+            return '';
+        const MAX_STEPS_PER_TRAJECTORY = 5;
+        const parts = trajectories.map((t, i) => {
+            // Truncate long plans to save tokens in the prompt
+            const truncatedPlan = t.taskPlan.slice(0, MAX_STEPS_PER_TRAJECTORY);
+            const stepsJson = JSON.stringify(truncatedPlan, null, 2);
+            const truncatedNote = t.taskPlan.length > MAX_STEPS_PER_TRAJECTORY
+                ? `\n  (... and ${t.taskPlan.length - MAX_STEPS_PER_TRAJECTORY} more steps)`
+                : '';
+            return `## Similar Past Task ${i + 1}\nGoal: ${t.goal}\nProject: ${t.projectFingerprint}\nPlan:\n${stepsJson}${truncatedNote}\nFiles changed: ${t.fileChanges.map((fc) => fc.path).join(', ')}\n`;
+        });
+        return `\n---\nHere are examples of how similar goals were decomposed into execution plans in the past. Use them as reference for creating the plan for the current goal.\n\n${parts.join('\n')}\n---\n`;
+    }
+    /**
+     * Get statistics about stored trajectories.
+     */
+    async stats() {
+        const data = readTrajectories();
+        const trajectories = Object.values(data.trajectories);
+        const avgScore = trajectories.length > 0
+            ? trajectories.reduce((sum, t) => sum + t.score, 0) / trajectories.length
+            : 0;
+        const byProjectFingerprint = {};
+        for (const t of trajectories) {
+            const fp = t.projectFingerprint || 'unknown';
+            byProjectFingerprint[fp] = (byProjectFingerprint[fp] || 0) + 1;
+        }
+        return {
+            total: trajectories.length,
+            avgScore: Math.round(avgScore * 100) / 100,
+            byProjectFingerprint,
+        };
+    }
+    /**
+     * Get all stored trajectories.
+     */
+    getAll() {
+        const data = readTrajectories();
+        return Object.values(data.trajectories);
+    }
+    /**
+     * Clear all trajectories.
+     */
+    async clear() {
+        writeTrajectories({ trajectories: {}, version: CURRENT_VERSION });
+        const vs = getVectorStore();
+        await vs.clear();
+    }
+    // ─── Private Helpers ────────────────────────────────────────────────────
+    /**
+     * Build text to generate an embedding for a trajectory.
+     */
+    buildEmbeddingText(trajectory) {
+        return [
+            `Goal: ${trajectory.goal}`,
+            `Project: ${trajectory.projectFingerprint}`,
+            `Steps: ${trajectory.taskPlan.map((s) => `${s.agentType}: ${s.description}`).join('; ')}`,
+            `Files: ${trajectory.fileChanges.map((fc) => fc.path).join(', ')}`,
+        ].join('\n');
+    }
+    /**
+     * Remove oldest trajectories when the store exceeds MAX_TRAJECTORIES.
+     */
+    pruneIfNeeded(data) {
+        const entries = Object.entries(data.trajectories);
+        if (entries.length < MAX_TRAJECTORIES)
+            return;
+        // Sort by timestamp (oldest first), remove excess
+        const sorted = entries.sort(([, a], [, b]) => a.timestamp - b.timestamp);
+        const toRemove = sorted.slice(0, entries.length - MAX_TRAJECTORIES + 10);
+        // Remove from trajectory store AND vector index to avoid orphaned entries
+        for (const [id] of toRemove) {
+            delete data.trajectories[id];
+            // Async cleanup — fire and forget (non-critical)
+            getVectorStore().delete(id).catch(() => { });
+        }
+    }
+    // ────────────────────────────────────────────────────────────────────
+    // Phase 2.6: Memory Compression & Pruning
+    // ────────────────────────────────────────────────────────────────────
+    /**
+     * Summarize old trajectories by merging multiple low-scoring or old
+     * trajectories into a single compact representation.
+     *
+     * Summarization replaces a group of similar old trajectories with a
+     * single aggregated entry that retains the most important information
+     * (goal, file patterns, common steps) while discarding individual details.
+     *
+     * @param retentionDays  Keep original trajectories newer than this (default: 7)
+     * @param verbose        Log summarization details
+     * @returns              Number of trajectories summarized/removed
+     */
+    async summarize(retentionDays = 7, verbose = false) {
+        const data = readTrajectories();
+        const cutoff = Date.now() - retentionDays * 24 * 60 * 60 * 1000;
+        // Get trajectories older than retention period, grouped by project fingerprint
+        const oldTrajectories = Object.entries(data.trajectories)
+            .filter(([, t]) => t.timestamp < cutoff)
+            .sort(([, a], [, b]) => b.score - a.score); // Higher scores first
+        if (oldTrajectories.length < 3) {
+            if (verbose)
+                logger.info(`Only ${oldTrajectories.length} old trajectories — skipping summarization (need 3+)`);
+            return { summarized: 0, merged: 0 };
+        }
+        // Group by project fingerprint for merging
+        const groups = new Map();
+        for (const [id, traj] of oldTrajectories) {
+            const key = traj.projectFingerprint || 'unknown';
+            if (!groups.has(key))
+                groups.set(key, []);
+            groups.get(key).push([id, traj]);
+        }
+        let summarized = 0;
+        let merged = 0;
+        // For each group, keep the highest-scoring trajectory and summarize the rest
+        for (const [fingerprint, group] of groups) {
+            if (group.length < 2)
+                continue;
+            // Keep the highest-scoring trajectory as the representative
+            const [bestId, bestTraj] = group[0];
+            const rest = group.slice(1);
+            // Update the best trajectory to encompass the group
+            bestTraj.goal = `[Summarized] ${bestTraj.goal} (+${rest.length} similar tasks)`;
+            bestTraj.taskPlan = bestTraj.taskPlan.slice(0, 3); // Keep only first 3 steps
+            bestTraj.fileChanges = this.mergeFileChanges(bestTraj.fileChanges, rest.map(([, t]) => t.fileChanges).flat());
+            bestTraj.contextFiles = [
+                ...new Set([...bestTraj.contextFiles, ...rest.map(([, t]) => t.contextFiles).flat()]),
+            ];
+            bestTraj.score = Math.min(1.0, bestTraj.score + 0.05); // Small bonus for being representative
+            bestTraj.tasksCompleted = bestTraj.tasksCompleted + rest.reduce((s, [, t]) => s + t.tasksCompleted, 0);
+            bestTraj.tasksTotal = bestTraj.tasksTotal + rest.reduce((s, [, t]) => s + t.tasksTotal, 0);
+            // Remove the rest
+            for (const [id] of rest) {
+                delete data.trajectories[id];
+                getVectorStore().delete(id).catch(() => { });
+                merged++;
+            }
+            summarized++;
+            if (verbose) {
+                logger.info(`Summarized ${rest.length + 1} '${fingerprint}' trajectories into 1 (kept: ${bestId.slice(0, 16)}...)`);
+            }
+        }
+        writeTrajectories(data);
+        return { summarized, merged };
+    }
+    /**
+     * Merge file changes from multiple trajectories into a unique set,
+     * preferring 'modified' status over 'read' etc.
+     */
+    mergeFileChanges(primary, secondary) {
+        const seen = new Map();
+        // Status priority: modified > created > deleted > read
+        const statusPriority = {
+            modified: 3,
+            created: 2,
+            deleted: 1,
+            read: 0,
+        };
+        for (const fc of [...primary, ...secondary]) {
+            const existing = seen.get(fc.path);
+            const existingPrio = existing ? (statusPriority[existing] ?? 0) : -1;
+            const newPrio = statusPriority[fc.status] ?? 0;
+            if (newPrio > existingPrio) {
+                seen.set(fc.path, fc.status);
+            }
+        }
+        return Array.from(seen.entries()).map(([path, status]) => ({ path, status }));
+    }
+    /**
+     * Prune trajectories based on configurable retention policy.
+     *
+     * @param maxAgeDays       Remove trajectories older than this (default: 90)
+     * @param minScore         Remove trajectories with score below this (default: 0.1)
+     * @param maxTrajectories  Maximum number to keep (default: 500)
+     * @param verbose          Log pruning details
+     * @returns                Number of trajectories removed
+     */
+    pruneByPolicy(maxAgeDays = 90, minScore = 0.1, maxTrajectories = 500, verbose = false) {
+        const data = readTrajectories();
+        const before = Object.keys(data.trajectories).length;
+        const now = Date.now();
+        const ageCutoff = now - maxAgeDays * 24 * 60 * 60 * 1000;
+        let removed = 0;
+        // Remove by age
+        for (const [id, traj] of Object.entries(data.trajectories)) {
+            if (traj.timestamp < ageCutoff) {
+                delete data.trajectories[id];
+                getVectorStore().delete(id).catch(() => { });
+                removed++;
+                if (verbose) {
+                    logger.debug(`Removed old trajectory ${id.slice(0, 16)}... (age exceeds ${maxAgeDays}d)`);
+                }
+            }
+        }
+        // Remove by score
+        for (const [id, traj] of Object.entries(data.trajectories)) {
+            if (traj.score < minScore) {
+                delete data.trajectories[id];
+                getVectorStore().delete(id).catch(() => { });
+                removed++;
+                if (verbose) {
+                    logger.debug(`Removed low-quality trajectory ${id.slice(0, 16)}... (score: ${traj.score.toFixed(2)})`);
+                }
+            }
+        }
+        // Enforce max count
+        const entries = Object.entries(data.trajectories);
+        if (entries.length > maxTrajectories) {
+            const sorted = entries.sort(([, a], [, b]) => a.score - b.score);
+            const toRemove = sorted.slice(0, entries.length - maxTrajectories);
+            for (const [id] of toRemove) {
+                delete data.trajectories[id];
+                getVectorStore().delete(id).catch(() => { });
+                removed++;
+            }
+        }
+        if (removed > 0) {
+            writeTrajectories(data);
+        }
+        return removed;
+    }
+    /**
+     * Get compression statistics showing memory usage and optimization potential.
+     */
+    getCompressionStats() {
+        const data = readTrajectories();
+        const trajs = Object.values(data.trajectories);
+        const now = Date.now();
+        const thirtyDaysAgo = now - 30 * 24 * 60 * 60 * 1000;
+        const oldTrajectories = trajs.filter((t) => t.timestamp < thirtyDaysAgo).length;
+        const lowScoreTrajectories = trajs.filter((t) => t.score < 0.3).length;
+        // Count mergeable groups (2+ trajectories with same fingerprint)
+        const fingerprintCounts = new Map();
+        for (const t of trajs) {
+            const key = t.projectFingerprint || 'unknown';
+            fingerprintCounts.set(key, (fingerprintCounts.get(key) || 0) + 1);
+        }
+        const mergeableGroups = Array.from(fingerprintCounts.values()).filter((c) => c >= 2).length;
+        // Estimate size (rough: ~2KB per trajectory)
+        const totalSizeBytes = trajs.length * 2048;
+        const reductionEstimate = Math.min(100, Math.round(((oldTrajectories + lowScoreTrajectories * 0.5) / Math.max(1, trajs.length)) * 100));
+        return {
+            totalTrajectories: trajs.length,
+            totalSizeBytes,
+            oldTrajectories,
+            lowScoreTrajectories,
+            mergeableGroups,
+            estimatedOptimization: `~${reductionEstimate}% reduction possible`,
+        };
+    }
+}
+// Singleton instance
+let storeInstance = null;
+export function getTrajectoryStore() {
+    if (!storeInstance) {
+        storeInstance = new TrajectoryStore();
+    }
+    return storeInstance;
+}
+//# sourceMappingURL=trajectory-store.js.map

package/dist/memory/trajectory-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"trajectory-store.js","sourceRoot":"","sources":["../../src/memory/trajectory-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAIlC,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAEnD,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AACrD,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAC5C,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAwCxD,+EAA+E;AAE/E,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,EAAE,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;AACtD,MAAM,iBAAiB,GAAG,IAAI,CAAC,UAAU,EAAE,mBAAmB,CAAC,CAAC;AAChE,MAAM,eAAe,GAAG,CAAC,CAAC;AAC1B,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAE7B,+EAA+E;AAE/E,SAAS,SAAS;IAChB,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QAC5B,SAAS,CAAC,UAAU,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC7C,CAAC;AACH,CAAC;AAED,SAAS,gBAAgB;IACvB,IAAI,CAAC;QACH,SAAS,EAAE,CAAC;QACZ,IAAI,CAAC,UAAU,CAAC,iBAAiB,CAAC,EAAE,CAAC;YACnC,OAAO,EAAE,YAAY,EAAE,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;QACxD,CAAC;QACD,MAAM,GAAG,GAAG,YAAY,CAAC,iBAAiB,EAAE,OAAO,CAAC,CAAC;QACrD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAmB,CAAC;IAC3C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,YAAY,EAAE,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;IACxD,CAAC;AACH,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAoB;IAC7C,SAAS,EAAE,CAAC;IACZ,aAAa,CAAC,iBAAiB,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;AAC3E,CAAC;AAED,sCAAsC;AACtC,SAAS,UAAU;IACjB,OAAO,QAAQ,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AACxE,CAAC;AAED,wEAAwE;AACxE,SAAS,uBAAuB,CAAC,WAAyB;IACxD,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC7C,MAAM,aAAa,GAAG,KAAK;SACxB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;SACvC,MAAM,CAAC,OAAO,CAAC,CAAC;IAEnB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC;IACtC,MAAM,IAAI,GAAa,EAAE,CAAC;IAE1B,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACrE,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACrE,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC3C,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACzC,IAAI,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3C,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACrE,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAErE,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACvD,CAAC;AAED,+EAA+E;AAE/E;;GAEG;AACH,MAAM,OAAO,eAAe;IAC1B;;;;;;;;OAQG;IACH,KAAK,CAAC,IAAI,CACR,MAA2B,EAC3B,OAAkB,EAClB,QAAoB,EACpB,YAAsB;QAEtB,oCAAoC;QACpC,IAAI,CAAC,MAAM,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QAE/B,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAEhC,+CAA+C;QAC/C,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAEzB,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QAExB,MAAM,UAAU,GAAe;YAC7B,EAAE;YACF,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,kBAAkB,EAAE,EAAE,EAAE,+CAA+C;YACvE,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC7B,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,SAAS,EAAE,CAAC,CAAC,SAAS;aACvB,CAAC,CAAC;YACH,YAAY;YACZ,WAAW,EAAE,MAAM,CAAC,WAAW;iBAC5B,KAAK,CAAC,IAAI,CAAC;iBACX,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;iBACxE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACT,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC;gBACvD,OAAO,KAAK;oBACV,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE;oBACtC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;YAC7C,CAAC,CAAC;YACJ,cAAc,EAAE,MAAM,CAAC,cAAc;YACrC,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,4DAA4D;YAC5D,KAAK,EAAE,eAAe,CAAC;gBACrB,cAAc,EAAE,MAAM,CAAC,cAAc;gBACrC,UAAU,EAAE,MAAM,CAAC,UAAU;gBAC7B,YAAY,EAAE,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK;gBAC7C,UAAU,EAAE,QAAQ,CAAC,MAAM;aAC5B,CAAC,CAAC,KAAK;YACR,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACtB,CAAC;QAEF,yDAAyD;QACzD,UAAU,CAAC,kBAAkB,GAAG,uBAAuB,CACrD,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,IAAI,EAAE,EAAE,CAAC,IAAI;YACb,MAAM,EAAE,EAAE,CAAC,MAA8B;SAC1C,CAAC,CAAC,CACJ,CAAC;QAEF,uBAAuB;QACvB,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC;QACnC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAExB,8CAA8C;QAC9C,yEAAyE;QACzE,IAAI,CAAC;YACH,MAAM,aAAa,GAAG,IAAI,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;YAC1D,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;YAEnD,iDAAiD;YACjD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBAChC,MAAM,EAAE,GAAG,cAAc,EAAE,CAAC;gBAC5B,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE;oBAC1B,IAAI,EAAE,UAAU,CAAC,IAAI;oBACrB,kBAAkB,EAAE,UAAU,CAAC,kBAAkB;oBACjD,KAAK,EAAE,UAAU,CAAC,KAAK;oBACvB,SAAS,EAAE,UAAU,CAAC,SAAS;iBAChC,CAAC,CAAC;gBACH,MAAM,CAAC,KAAK,CAAC,sBAAsB,EAAE,qBAAqB,aAAa,OAAO,CAAC,CAAC;YAClF,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,KAAK,CAAC,6BAA6B,EAAE,kCAAkC,CAAC,CAAC;YAClF,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,6DAA6D;YAC7D,MAAM,CAAC,KAAK,CAAC,8BAA8B,EAAE,KAAK,GAAG,EAAE,CAAC,CAAC;QAC3D,CAAC;QAED,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,EAAU;QAClB,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,OAAO,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;IACvC,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,YAAY,CAChB,IAAY,EACZ,OAAkB,EAClB,IAAY,CAAC;QAEb,IAAI,CAAC;YACH,mCAAmC;YACnC,MAAM,WAAW,GAAG,6CAA6C,IAAI,EAAE,CAAC;YACxE,MAAM,WAAW,GAAG,MAAM,KAAK,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YAEtD,yDAAyD;YACzD,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAE,OAAO,EAAE,CAAC;YAEjD,0BAA0B;YAC1B,MAAM,EAAE,GAAG,cAAc,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE;gBACxD,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAe,IAAI,CAAC,CAAC;gBAClD,OAAO,KAAK,IAAI,GAAG,CAAC,CAAC,qCAAqC;YAC5D,CAAC,CAAC,CAAC;YAEH,wCAAwC;YACxC,MAAM,YAAY,GAAiB,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;YAEhC,KAAK,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,OAAO,EAAE,CAAC;gBAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACzC,IAAI,IAAI,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;oBAC7B,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;YAED,OAAO,YAAY,CAAC;QACtB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,CAAC,KAAK,CAAC,6BAA6B,GAAG,EAAE,CAAC,CAAC;YACjD,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,eAAe,CAAC,YAA0B;QACxC,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEzC,MAAM,wBAAwB,GAAG,CAAC,CAAC;QAEnC,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACtC,mDAAmD;YACnD,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,wBAAwB,CAAC,CAAC;YACpE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;YACzD,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,wBAAwB;gBAChE,CAAC,CAAC,gBAAgB,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,wBAAwB,cAAc;gBAC5E,CAAC,CAAC,EAAE,CAAC;YAEP,OAAO,wBAAwB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC,kBAAkB,YAAY,SAAS,GAAG,aAAa,oBAAoB,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QACpM,CAAC,CAAC,CAAC;QAEH,OAAO,wKAAwK,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC;IAC3M,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QAKT,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAEtD,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC;YACtC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM;YACzE,CAAC,CAAC,CAAC,CAAC;QAEN,MAAM,oBAAoB,GAA2B,EAAE,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,kBAAkB,IAAI,SAAS,CAAC;YAC7C,oBAAoB,CAAC,EAAE,CAAC,GAAG,CAAC,oBAAoB,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACjE,CAAC;QAED,OAAO;YACL,KAAK,EAAE,YAAY,CAAC,MAAM;YAC1B,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC,GAAG,GAAG;YAC1C,oBAAoB;SACrB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,iBAAiB,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC,CAAC;QAClE,MAAM,EAAE,GAAG,cAAc,EAAE,CAAC;QAC5B,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC;IACnB,CAAC;IAED,2EAA2E;IAE3E;;OAEG;IACK,kBAAkB,CAAC,UAAsB;QAC/C,OAAO;YACL,SAAS,UAAU,CAAC,IAAI,EAAE;YAC1B,YAAY,UAAU,CAAC,kBAAkB,EAAE;YAC3C,UAAU,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YACzF,UAAU,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;SACnE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,IAAoB;QACxC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAClD,IAAI,OAAO,CAAC,MAAM,GAAG,gBAAgB;YAAE,OAAO;QAE9C,kDAAkD;QAClD,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QACzE,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,gBAAgB,GAAG,EAAE,CAAC,CAAC;QAEzE,0EAA0E;QAC1E,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;YAC7B,iDAAiD;YACjD,cAAc,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,0CAA0C;IAC1C,uEAAuE;IAEvE;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,SAAS,CACb,gBAAwB,CAAC,EACzB,UAAmB,KAAK;QAExB,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,aAAa,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;QAEhE,+EAA+E;QAC/E,MAAM,eAAe,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC;aACtD,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,MAAM,CAAC;aACvC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,sBAAsB;QAEpE,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,IAAI,OAAO;gBAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,eAAe,CAAC,MAAM,sDAAsD,CAAC,CAAC;YAC/G,OAAO,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QACtC,CAAC;QAED,2CAA2C;QAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkC,CAAC;QACzD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,eAAe,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,IAAI,CAAC,kBAAkB,IAAI,SAAS,CAAC;YACjD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAC1C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;QACpC,CAAC;QAED,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,6EAA6E;QAC7E,KAAK,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YAC1C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAE/B,4DAA4D;YAC5D,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAE5B,oDAAoD;YACpD,QAAQ,CAAC,IAAI,GAAG,gBAAgB,QAAQ,CAAC,IAAI,MAAM,IAAI,CAAC,MAAM,iBAAiB,CAAC;YAChF,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,0BAA0B;YAC7E,QAAQ,CAAC,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAC1C,QAAQ,CAAC,WAAW,EACpB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,CAC1C,CAAC;YACF,QAAQ,CAAC,YAAY,GAAG;gBACtB,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,YAAY,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;aACtF,CAAC;YACF,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,uCAAuC;YAC9F,QAAQ,CAAC,cAAc,GAAG,QAAQ,CAAC,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;YACvG,QAAQ,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YAE3F,kBAAkB;YAClB,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;gBACxB,OAAO,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;gBAC7B,cAAc,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;gBAC5C,MAAM,EAAE,CAAC;YACX,CAAC;YAED,UAAU,EAAE,CAAC;YAEb,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,CAAC,IAAI,CAAC,cAAc,IAAI,CAAC,MAAM,GAAG,CAAC,KAAK,WAAW,gCAAgC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;YACtH,CAAC;QACH,CAAC;QAED,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAExB,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;IAChC,CAAC;IAED;;;OAGG;IACK,gBAAgB,CACtB,OAAkC,EAClC,SAAoC;QAEpC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEvC,uDAAuD;QACvD,MAAM,cAAc,GAA2B;YAC7C,QAAQ,EAAE,CAAC;YACX,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,CAAC;YACV,IAAI,EAAE,CAAC;SACR,CAAC;QAEF,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,OAAO,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC;YAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACnC,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrE,MAAM,OAAO,GAAG,cAAc,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC/C,IAAI,OAAO,GAAG,YAAY,EAAE,CAAC;gBAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IAChF,CAAC;IAED;;;;;;;;OAQG;IACH,aAAa,CACX,aAAqB,EAAE,EACvB,WAAmB,GAAG,EACtB,kBAA0B,GAAG,EAC7B,UAAmB,KAAK;QAExB,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC;QAErD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,GAAG,GAAG,UAAU,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;QAEzD,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,gBAAgB;QAChB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;YAC3D,IAAI,IAAI,CAAC,SAAS,GAAG,SAAS,EAAE,CAAC;gBAC/B,OAAO,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;gBAC7B,cAAc,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;gBAC5C,OAAO,EAAE,CAAC;gBACV,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,CAAC,KAAK,CAAC,0BAA0B,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,UAAU,IAAI,CAAC,CAAC;gBAC5F,CAAC;YACH,CAAC;QACH,CAAC;QAED,kBAAkB;QAClB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;YAC3D,IAAI,IAAI,CAAC,KAAK,GAAG,QAAQ,EAAE,CAAC;gBAC1B,OAAO,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;gBAC7B,cAAc,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;gBAC5C,OAAO,EAAE,CAAC;gBACV,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,CAAC,KAAK,CAAC,kCAAkC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACzG,CAAC;YACH,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAClD,IAAI,OAAO,CAAC,MAAM,GAAG,eAAe,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YACjE,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,eAAe,CAAC,CAAC;YACnE,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC;gBAC5B,OAAO,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;gBAC7B,cAAc,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;gBAC5C,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YAChB,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,mBAAmB;QAQjB,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAE/C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,aAAa,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;QAErD,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,aAAa,CAAC,CAAC,MAAM,CAAC;QAChF,MAAM,oBAAoB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC;QAEvE,iEAAiE;QACjE,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAC;QACpD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,CAAC,CAAC,kBAAkB,IAAI,SAAS,CAAC;YAC9C,iBAAiB,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpE,CAAC;QACD,MAAM,eAAe,GAAG,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;QAE5F,6CAA6C;QAC7C,MAAM,cAAc,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;QAC3C,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAChC,GAAG,EACH,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,GAAG,oBAAoB,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAC/F,CAAC;QAEF,OAAO;YACL,iBAAiB,EAAE,KAAK,CAAC,MAAM;YAC/B,cAAc;YACd,eAAe;YACf,oBAAoB;YACpB,eAAe;YACf,qBAAqB,EAAE,IAAI,iBAAiB,sBAAsB;SACnE,CAAC;IACJ,CAAC;CACF;AAED,qBAAqB;AACrB,IAAI,aAAa,GAA2B,IAAI,CAAC;AAEjD,MAAM,UAAU,kBAAkB;IAChC,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,aAAa,GAAG,IAAI,eAAe,EAAE,CAAC;IACxC,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC"}

package/dist/memory/vector-store.d.ts

@@ -0,0 +1,78 @@
+/**
+ * VectorStore — A lightweight, JSON-based vector index with cosine similarity search.
+ *
+ * Stores embeddings as `{ id, vector, metadata }` entries in a single JSON file.
+ * No external dependencies — uses only Node.js built-in fs and crypto.
+ *
+ * File location: ~/.buff/memory/vectors.json
+ */
+/** A single entry in the vector index */
+export interface VectorEntry {
+    /** Unique identifier for this entry */
+    id: string;
+    /** The embedding vector (array of numbers) */
+    vector: number[];
+    /** Arbitrary metadata for filtering/display */
+    metadata: Record<string, unknown>;
+    /** Timestamp when this entry was created */
+    createdAt: number;
+}
+/**
+ * Compute cosine similarity between two vectors.
+ * Returns a value between -1 and 1 (higher = more similar).
+ */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+/**
+ * Lightweight vector store for semantic search.
+ *
+ * Usage:
+ * ```ts
+ * const store = new VectorStore();
+ * await store.insert("traj-001", [0.1, 0.2, ...], { goal: "add auth" });
+ * const results = await store.search([0.15, 0.25, ...], 3);
+ * ```
+ */
+export declare class VectorStore {
+    /**
+     * Insert a vector entry into the index.
+     * If an entry with the same `id` already exists, it is overwritten.
+     */
+    insert(id: string, vector: number[], metadata?: Record<string, unknown>): Promise<void>;
+    /**
+     * Retrieve a single entry by ID.
+     */
+    get(id: string): Promise<VectorEntry | null>;
+    /**
+     * Remove an entry from the index.
+     */
+    delete(id: string): Promise<boolean>;
+    /**
+     * Search for the top-k most similar entries to the query vector.
+     * Returns results sorted by similarity (highest first).
+     */
+    search(queryVector: number[], k?: number, filterFn?: (entry: VectorEntry) => boolean): Promise<Array<{
+        entry: VectorEntry;
+        similarity: number;
+    }>>;
+    /**
+     * Get the total number of stored entries.
+     */
+    count(): Promise<number>;
+    /**
+     * Clear all entries from the index.
+     */
+    clear(): Promise<void>;
+    /**
+     * Get all entries (for iteration/export).
+     */
+    getAll(): Promise<VectorEntry[]>;
+    /**
+     * Get vector store statistics.
+     */
+    stats(): {
+        totalEntries: number;
+        dimensions: number;
+    };
+}
+export declare function getVectorStore(): VectorStore;
+//# sourceMappingURL=vector-store.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"vector-store.d.ts","sourceRoot":"","sources":["../../src/memory/vector-store.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAQH,yCAAyC;AACzC,MAAM,WAAW,WAAW;IAC1B,uCAAuC;IACvC,EAAE,EAAE,MAAM,CAAC;IACX,8CAA8C;IAC9C,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,+CAA+C;IAC/C,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAClC,4CAA4C;IAC5C,SAAS,EAAE,MAAM,CAAC;CACnB;AA2ED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAOjE;AAID;;;;;;;;;GASG;AACH,qBAAa,WAAW;IACtB;;;OAGG;IACG,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,QAAQ,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAWjG;;OAEG;IACG,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAKlD;;OAEG;IACG,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAQ1C;;;OAGG;IACG,MAAM,CACV,WAAW,EAAE,MAAM,EAAE,EACrB,CAAC,GAAE,MAAU,EACb,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,WAAW,KAAK,OAAO,GACzC,OAAO,CAAC,KAAK,CAAC;QAAE,KAAK,EAAE,WAAW,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAiB7D;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;IAK9B;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAI5B;;OAEG;IACG,MAAM,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;IAKtC;;OAEG;IACH,KAAK,IAAI;QAAE,YAAY,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE;CAStD;AAKD,wBAAgB,cAAc,IAAI,WAAW,CAK5C"}