cognitive-core 0.0.2 → 0.1.2

package/dist/memory/experience.d.ts

@@ -0,0 +1,122 @@
+import type { Experience } from '../types/index.js';
+/**
+ * Result of pruning operation
+ */
+export interface PruneResult {
+    /** IDs of pruned experiences */
+    prunedIds: string[];
+    /** IDs organized by pruning reason */
+    prunedByReason: {
+        age: string[];
+        usage: string[];
+        capacity: string[];
+        redundancy: string[];
+        failedOld: string[];
+    };
+    /** Total number pruned */
+    totalPruned: number;
+    /** Count remaining after pruning */
+    remainingCount: number;
+}
+/**
+ * Experience Memory - ReMem-style task-level retrieval
+ * Stores complete (task, solution, feedback) tuples
+ */
+export declare class ExperienceMemory {
+    private _store;
+    private initialized;
+    constructor(baseDir: string);
+    init(): Promise<void>;
+    /**
+     * Store a new experience
+     */
+    add(experience: Experience): Promise<void>;
+    /**
+     * Retrieve an experience by ID
+     */
+    get(id: string): Promise<Experience | undefined>;
+    /**
+     * Find similar experiences
+     * Uses embedding similarity if available, falls back to text similarity
+     */
+    findSimilar(query: string | number[], options?: {
+        k?: number;
+        domain?: string;
+        minScore?: number;
+        successOnly?: boolean;
+    }): Promise<Array<{
+        experience: Experience;
+        score: number;
+    }>>;
+    /**
+     * Update an experience (e.g., after refinement)
+     */
+    update(id: string, updates: Partial<Experience>): Promise<Experience | undefined>;
+    /**
+     * Increment usage count
+     */
+    recordUsage(id: string): Promise<void>;
+    /**
+     * Get all experiences
+     */
+    getAll(): Promise<Experience[]>;
+    /**
+     * Get experiences by trajectory
+     */
+    getByTrajectory(trajectoryId: string): Promise<Experience[]>;
+    /**
+     * Prune low-value experiences
+     */
+    prune(options?: {
+        maxCount?: number;
+        minUsageCount?: number;
+        maxAgeDays?: number;
+        removeFailedOlderThanDays?: number;
+        similarityThreshold?: number;
+        preserveDomainCoverage?: boolean;
+    }): Promise<PruneResult>;
+    /**
+     * Find redundant experiences (similar to others, lower value)
+     */
+    private findRedundant;
+    /**
+     * Compute similarity between two experiences
+     */
+    private computeSimilarity;
+    /**
+     * Select experiences while preserving domain coverage
+     */
+    private selectWithDomainCoverage;
+    /**
+     * Compute value score for an experience
+     */
+    private computeValue;
+    /**
+     * Get pruning statistics
+     */
+    getPruningStats(): Promise<{
+        total: number;
+        byDomain: Record<string, number>;
+        bySuccess: {
+            success: number;
+            failure: number;
+        };
+        oldestDate: Date | null;
+        newestDate: Date | null;
+        averageUsage: number;
+        suggestedPrunes: {
+            lowUsage: number;
+            old: number;
+            failedOld: number;
+        };
+    }>;
+    /**
+     * Get count
+     */
+    count(): Promise<number>;
+    /**
+     * Close the store
+     */
+    close(): Promise<void>;
+}
+//# sourceMappingURL=experience.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"experience.d.ts","sourceRoot":"","sources":["../../src/memory/experience.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAIpD;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,gCAAgC;IAChC,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,sCAAsC;IACtC,cAAc,EAAE;QACd,GAAG,EAAE,MAAM,EAAE,CAAC;QACd,KAAK,EAAE,MAAM,EAAE,CAAC;QAChB,QAAQ,EAAE,MAAM,EAAE,CAAC;QACnB,UAAU,EAAE,MAAM,EAAE,CAAC;QACrB,SAAS,EAAE,MAAM,EAAE,CAAC;KACrB,CAAC;IACF,0BAA0B;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,oCAAoC;IACpC,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;;GAGG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,MAAM,CAAwB;IACtC,OAAO,CAAC,WAAW,CAAS;gBAEhB,OAAO,EAAE,MAAM;IAOrB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAM3B;;OAEG;IACG,GAAG,CAAC,UAAU,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC;IAMhD;;OAEG;IACG,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,SAAS,CAAC;IAKtD;;;OAGG;IACG,WAAW,CACf,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,EACxB,OAAO,CAAC,EAAE;QACR,CAAC,CAAC,EAAE,MAAM,CAAC;QACX,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,WAAW,CAAC,EAAE,OAAO,CAAC;KACvB,GACA,OAAO,CAAC,KAAK,CAAC;QAAE,UAAU,EAAE,UAAU,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAmC5D;;OAEG;IACG,MAAM,CACV,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,GAC3B,OAAO,CAAC,UAAU,GAAG,SAAS,CAAC;IAelC;;OAEG;IACG,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAU5C;;OAEG;IACG,MAAM,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;IAKrC;;OAEG;IACG,eAAe,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IAKlE;;OAEG;IACG,KAAK,CAAC,OAAO,CAAC,EAAE;QACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,aAAa,CAAC,EAAE,MAAM,CAAC;QACvB,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,yBAAyB,CAAC,EAAE,MAAM,CAAC;QACnC,mBAAmB,CAAC,EAAE,MAAM,CAAC;QAC7B,sBAAsB,CAAC,EAAE,OAAO,CAAC;KAClC,GAAG,OAAO,CAAC,WAAW,CAAC;IAyHxB;;OAEG;YACW,aAAa;IA8C3B;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAsBzB;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAqChC;;OAEG;IACH,OAAO,CAAC,YAAY;IAmBpB;;OAEG;IACG,eAAe,IAAI,OAAO,CAAC;QAC/B,KAAK,EAAE,MAAM,CAAC;QACd,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACjC,SAAS,EAAE;YAAE,OAAO,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAE,CAAC;QAChD,UAAU,EAAE,IAAI,GAAG,IAAI,CAAC;QACxB,UAAU,EAAE,IAAI,GAAG,IAAI,CAAC;QACxB,YAAY,EAAE,MAAM,CAAC;QACrB,eAAe,EAAE;YACf,QAAQ,EAAE,MAAM,CAAC;YACjB,GAAG,EAAE,MAAM,CAAC;YACZ,SAAS,EAAE,MAAM,CAAC;SACnB,CAAC;KACH,CAAC;IA2DF;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;IAK9B;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAG7B"}

package/dist/memory/experience.js

@@ -0,0 +1,392 @@
+import { JsonStore } from '../utils/storage.js';
+import { findTopK } from '../utils/similarity.js';
+/**
+ * Experience Memory - ReMem-style task-level retrieval
+ * Stores complete (task, solution, feedback) tuples
+ */
+export class ExperienceMemory {
+    _store;
+    initialized = false;
+    constructor(baseDir) {
+        this._store = new JsonStore(baseDir, 'experiences', {
+            autoSaveInterval: 60000,
+            pretty: true,
+        });
+    }
+    async init() {
+        if (this.initialized)
+            return;
+        await this._store.init();
+        this.initialized = true;
+    }
+    /**
+     * Store a new experience
+     */
+    async add(experience) {
+        await this.init();
+        this._store.set(experience.id, experience);
+        await this._store.save(experience.id);
+    }
+    /**
+     * Retrieve an experience by ID
+     */
+    async get(id) {
+        await this.init();
+        return this._store.get(id);
+    }
+    /**
+     * Find similar experiences
+     * Uses embedding similarity if available, falls back to text similarity
+     */
+    async findSimilar(query, options) {
+        await this.init();
+        const k = options?.k ?? 4; // ReMem default
+        let experiences = this._store.values();
+        // Filter by domain if specified
+        if (options?.domain) {
+            experiences = experiences.filter((e) => e.domain === options.domain);
+        }
+        // Filter by success if specified
+        if (options?.successOnly) {
+            experiences = experiences.filter((e) => e.success);
+        }
+        // Find similar experiences
+        const results = findTopK(query, experiences, (e) => (Array.isArray(query) ? e.embedding : e.taskInput), k).map(({ item, score }) => ({
+            experience: item,
+            score,
+        }));
+        // Filter by minimum score
+        if (options?.minScore !== undefined) {
+            return results.filter((r) => r.score >= options.minScore);
+        }
+        return results;
+    }
+    /**
+     * Update an experience (e.g., after refinement)
+     */
+    async update(id, updates) {
+        await this.init();
+        const existing = this._store.get(id);
+        if (!existing)
+            return undefined;
+        const updated = {
+            ...existing,
+            ...updates,
+            id: existing.id, // Preserve ID
+        };
+        this._store.set(id, updated);
+        await this._store.save(id);
+        return updated;
+    }
+    /**
+     * Increment usage count
+     */
+    async recordUsage(id) {
+        await this.init();
+        const existing = this._store.get(id);
+        if (existing) {
+            existing.usageCount++;
+            existing.lastAccessedAt = new Date();
+            this._store.set(id, existing);
+        }
+    }
+    /**
+     * Get all experiences
+     */
+    async getAll() {
+        await this.init();
+        return this._store.values();
+    }
+    /**
+     * Get experiences by trajectory
+     */
+    async getByTrajectory(trajectoryId) {
+        await this.init();
+        return this._store.values().filter((e) => e.trajectoryId === trajectoryId);
+    }
+    /**
+     * Prune low-value experiences
+     */
+    async prune(options) {
+        await this.init();
+        const pruned = [];
+        const prunedByReason = {
+            age: [],
+            usage: [],
+            capacity: [],
+            redundancy: [],
+            failedOld: [],
+        };
+        let experiences = this._store.values();
+        // 1. Prune by age
+        if (options?.maxAgeDays) {
+            const cutoff = Date.now() - options.maxAgeDays * 24 * 60 * 60 * 1000;
+            const oldExperiences = experiences.filter((e) => e.createdAt.getTime() < cutoff);
+            for (const exp of oldExperiences) {
+                this._store.delete(exp.id);
+                pruned.push(exp.id);
+                prunedByReason.age.push(exp.id);
+            }
+            experiences = experiences.filter((e) => e.createdAt.getTime() >= cutoff);
+        }
+        // 2. Prune failed experiences older than threshold
+        if (options?.removeFailedOlderThanDays) {
+            const cutoff = Date.now() - options.removeFailedOlderThanDays * 24 * 60 * 60 * 1000;
+            const failedOld = experiences.filter((e) => !e.success && e.createdAt.getTime() < cutoff);
+            for (const exp of failedOld) {
+                this._store.delete(exp.id);
+                pruned.push(exp.id);
+                prunedByReason.failedOld.push(exp.id);
+            }
+            experiences = experiences.filter((e) => e.success || e.createdAt.getTime() >= cutoff);
+        }
+        // 3. Prune by minimum usage count
+        if (options?.minUsageCount !== undefined) {
+            const lowUsage = experiences.filter((e) => e.usageCount < options.minUsageCount);
+            // Only prune low-usage if they're also old (>7 days)
+            const sevenDaysAgo = Date.now() - 7 * 24 * 60 * 60 * 1000;
+            for (const exp of lowUsage) {
+                if (exp.createdAt.getTime() < sevenDaysAgo) {
+                    this._store.delete(exp.id);
+                    pruned.push(exp.id);
+                    prunedByReason.usage.push(exp.id);
+                }
+            }
+            experiences = this._store.values(); // Refresh
+        }
+        // 4. Prune redundant/similar experiences
+        if (options?.similarityThreshold) {
+            const redundant = await this.findRedundant(experiences, options.similarityThreshold, options.preserveDomainCoverage);
+            for (const exp of redundant) {
+                this._store.delete(exp.id);
+                pruned.push(exp.id);
+                prunedByReason.redundancy.push(exp.id);
+            }
+            experiences = this._store.values(); // Refresh
+        }
+        // 5. Prune by count (keep most valuable)
+        if (options?.maxCount && experiences.length > options.maxCount) {
+            // Sort by value
+            experiences.sort((a, b) => {
+                const scoreA = this.computeValue(a);
+                const scoreB = this.computeValue(b);
+                return scoreB - scoreA;
+            });
+            // If preserving domain coverage, ensure each domain keeps some
+            if (options.preserveDomainCoverage) {
+                const kept = this.selectWithDomainCoverage(experiences, options.maxCount);
+                const keptIds = new Set(kept.map((e) => e.id));
+                for (const exp of experiences) {
+                    if (!keptIds.has(exp.id)) {
+                        this._store.delete(exp.id);
+                        pruned.push(exp.id);
+                        prunedByReason.capacity.push(exp.id);
+                    }
+                }
+            }
+            else {
+                const toRemove = experiences.slice(options.maxCount);
+                for (const exp of toRemove) {
+                    this._store.delete(exp.id);
+                    pruned.push(exp.id);
+                    prunedByReason.capacity.push(exp.id);
+                }
+            }
+        }
+        // Save changes
+        if (pruned.length > 0) {
+            await this._store.flush();
+        }
+        return {
+            prunedIds: pruned,
+            prunedByReason,
+            totalPruned: pruned.length,
+            remainingCount: this._store.size(),
+        };
+    }
+    /**
+     * Find redundant experiences (similar to others, lower value)
+     */
+    async findRedundant(experiences, threshold, preserveDomainCoverage = true) {
+        const redundant = [];
+        const kept = new Set();
+        const domainCounts = {};
+        // Sort by value (highest first)
+        const sorted = [...experiences].sort((a, b) => {
+            return this.computeValue(b) - this.computeValue(a);
+        });
+        for (const exp of sorted) {
+            // Check if similar to any kept experience
+            let isDuplicate = false;
+            for (const keptId of kept) {
+                const keptExp = experiences.find((e) => e.id === keptId);
+                if (keptExp && this.computeSimilarity(exp, keptExp) > threshold) {
+                    isDuplicate = true;
+                    break;
+                }
+            }
+            if (isDuplicate) {
+                // Check domain coverage
+                if (preserveDomainCoverage) {
+                    const domainCount = domainCounts[exp.domain] ?? 0;
+                    if (domainCount < 3) {
+                        // Keep at least 3 per domain
+                        kept.add(exp.id);
+                        domainCounts[exp.domain] = domainCount + 1;
+                        continue;
+                    }
+                }
+                redundant.push(exp);
+            }
+            else {
+                kept.add(exp.id);
+                domainCounts[exp.domain] = (domainCounts[exp.domain] ?? 0) + 1;
+            }
+        }
+        return redundant;
+    }
+    /**
+     * Compute similarity between two experiences
+     */
+    computeSimilarity(a, b) {
+        // If both have embeddings, use cosine similarity
+        if (a.embedding && b.embedding) {
+            let dot = 0;
+            let normA = 0;
+            let normB = 0;
+            for (let i = 0; i < a.embedding.length; i++) {
+                dot += a.embedding[i] * b.embedding[i];
+                normA += a.embedding[i] * a.embedding[i];
+                normB += b.embedding[i] * b.embedding[i];
+            }
+            return dot / (Math.sqrt(normA) * Math.sqrt(normB) || 1);
+        }
+        // Fall back to Jaccard similarity on task input words
+        const wordsA = new Set(a.taskInput.toLowerCase().split(/\s+/));
+        const wordsB = new Set(b.taskInput.toLowerCase().split(/\s+/));
+        const intersection = new Set([...wordsA].filter((x) => wordsB.has(x)));
+        const union = new Set([...wordsA, ...wordsB]);
+        return intersection.size / union.size;
+    }
+    /**
+     * Select experiences while preserving domain coverage
+     */
+    selectWithDomainCoverage(experiences, maxCount) {
+        const selected = [];
+        const domainCounts = {};
+        const domains = [...new Set(experiences.map((e) => e.domain))];
+        const minPerDomain = Math.max(1, Math.floor(maxCount / (domains.length * 2)));
+        // First pass: ensure minimum per domain
+        for (const domain of domains) {
+            const domainExps = experiences
+                .filter((e) => e.domain === domain)
+                .sort((a, b) => this.computeValue(b) - this.computeValue(a));
+            for (let i = 0; i < Math.min(minPerDomain, domainExps.length); i++) {
+                if (selected.length < maxCount) {
+                    selected.push(domainExps[i]);
+                    domainCounts[domain] = (domainCounts[domain] ?? 0) + 1;
+                }
+            }
+        }
+        // Second pass: fill remaining slots with highest value
+        const selectedIds = new Set(selected.map((e) => e.id));
+        const remaining = experiences
+            .filter((e) => !selectedIds.has(e.id))
+            .sort((a, b) => this.computeValue(b) - this.computeValue(a));
+        for (const exp of remaining) {
+            if (selected.length >= maxCount)
+                break;
+            selected.push(exp);
+        }
+        return selected;
+    }
+    /**
+     * Compute value score for an experience
+     */
+    computeValue(exp) {
+        const ageMs = Date.now() - exp.createdAt.getTime();
+        const ageDays = ageMs / (1000 * 60 * 60 * 24);
+        const recencyScore = Math.exp(-ageDays / 30); // Decay over ~30 days
+        // Access recency bonus
+        const accessAgeMs = exp.lastAccessedAt
+            ? Date.now() - exp.lastAccessedAt.getTime()
+            : ageMs;
+        const accessAgeDays = accessAgeMs / (1000 * 60 * 60 * 24);
+        const accessRecencyScore = Math.exp(-accessAgeDays / 14); // Decay over ~14 days
+        return ((exp.success ? 1 : 0.3) * // Success bonus
+            (1 + Math.log(exp.usageCount + 1)) * // Usage bonus (log scale)
+            (recencyScore * 0.5 + accessRecencyScore * 0.5) // Combined recency
+        );
+    }
+    /**
+     * Get pruning statistics
+     */
+    async getPruningStats() {
+        await this.init();
+        const experiences = this._store.values();
+        const byDomain = {};
+        let successCount = 0;
+        let totalUsage = 0;
+        let oldestDate = null;
+        let newestDate = null;
+        const sevenDaysAgo = Date.now() - 7 * 24 * 60 * 60 * 1000;
+        const thirtyDaysAgo = Date.now() - 30 * 24 * 60 * 60 * 1000;
+        let lowUsageCount = 0;
+        let oldCount = 0;
+        let failedOldCount = 0;
+        for (const exp of experiences) {
+            // Domain counts
+            byDomain[exp.domain] = (byDomain[exp.domain] ?? 0) + 1;
+            // Success counts
+            if (exp.success)
+                successCount++;
+            // Usage sum
+            totalUsage += exp.usageCount;
+            // Date tracking
+            const createdAt = exp.createdAt;
+            if (!oldestDate || createdAt < oldestDate)
+                oldestDate = createdAt;
+            if (!newestDate || createdAt > newestDate)
+                newestDate = createdAt;
+            // Suggested prunes
+            if (exp.usageCount === 0 && createdAt.getTime() < sevenDaysAgo) {
+                lowUsageCount++;
+            }
+            if (createdAt.getTime() < thirtyDaysAgo) {
+                oldCount++;
+                if (!exp.success)
+                    failedOldCount++;
+            }
+        }
+        return {
+            total: experiences.length,
+            byDomain,
+            bySuccess: {
+                success: successCount,
+                failure: experiences.length - successCount,
+            },
+            oldestDate,
+            newestDate,
+            averageUsage: experiences.length > 0 ? totalUsage / experiences.length : 0,
+            suggestedPrunes: {
+                lowUsage: lowUsageCount,
+                old: oldCount,
+                failedOld: failedOldCount,
+            },
+        };
+    }
+    /**
+     * Get count
+     */
+    async count() {
+        await this.init();
+        return this._store.size();
+    }
+    /**
+     * Close the store
+     */
+    async close() {
+        await this._store.close();
+    }
+}
+//# sourceMappingURL=experience.js.map

package/dist/memory/experience.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"experience.js","sourceRoot":"","sources":["../../src/memory/experience.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAsBlD;;;GAGG;AACH,MAAM,OAAO,gBAAgB;IACnB,MAAM,CAAwB;IAC9B,WAAW,GAAG,KAAK,CAAC;IAE5B,YAAY,OAAe;QACzB,IAAI,CAAC,MAAM,GAAG,IAAI,SAAS,CAAa,OAAO,EAAE,aAAa,EAAE;YAC9D,gBAAgB,EAAE,KAAK;YACvB,MAAM,EAAE,IAAI;SACb,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAC7B,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,UAAsB;QAC9B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAC3C,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,EAAU;QAClB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,WAAW,CACf,KAAwB,EACxB,OAKC;QAED,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAElB,MAAM,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB;QAC3C,IAAI,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QAEvC,gCAAgC;QAChC,IAAI,OAAO,EAAE,MAAM,EAAE,CAAC;YACpB,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;QACvE,CAAC;QAED,iCAAiC;QACjC,IAAI,OAAO,EAAE,WAAW,EAAE,CAAC;YACzB,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACrD,CAAC;QAED,2BAA2B;QAC3B,MAAM,OAAO,GAAG,QAAQ,CACtB,KAAK,EACL,WAAW,EACX,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,EACzD,CAAC,CACF,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;YAC1B,UAAU,EAAE,IAAI;YAChB,KAAK;SACN,CAAC,CAAC,CAAC;QAEJ,0BAA0B;QAC1B,IAAI,OAAO,EAAE,QAAQ,KAAK,SAAS,EAAE,CAAC;YACpC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,OAAO,CAAC,QAAS,CAAC,CAAC;QAC7D,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,EAAU,EACV,OAA4B;QAE5B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ;YAAE,OAAO,SAAS,CAAC;QAEhC,MAAM,OAAO,GAAG;YACd,GAAG,QAAQ;YACX,GAAG,OAAO;YACV,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,cAAc;SAChC,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAC7B,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,EAAU;QAC1B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,UAAU,EAAE,CAAC;YACtB,QAAQ,CAAC,cAAc,GAAG,IAAI,IAAI,EAAE,CAAC;YACrC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM;QACV,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CAAC,YAAoB;QACxC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,YAAY,CAAC,CAAC;IAC7E,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK,CAAC,OAOX;QACC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,cAAc,GAAkC;YACpD,GAAG,EAAE,EAAE;YACP,KAAK,EAAE,EAAE;YACT,QAAQ,EAAE,EAAE;YACZ,UAAU,EAAE,EAAE;YACd,SAAS,EAAE,EAAE;SACd,CAAC;QACF,IAAI,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QAEvC,kBAAkB;QAClB,IAAI,OAAO,EAAE,UAAU,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,UAAU,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;YACrE,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,CACvC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,MAAM,CACtC,CAAC;YACF,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;gBACjC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACpB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAClC,CAAC;YACD,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,MAAM,CAAC,CAAC;QAC3E,CAAC;QAED,mDAAmD;QACnD,IAAI,OAAO,EAAE,yBAAyB,EAAE,CAAC;YACvC,MAAM,MAAM,GACV,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,yBAAyB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;YACvE,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,MAAM,CACpD,CAAC;YACF,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;gBAC5B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACpB,cAAc,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACxC,CAAC;YACD,WAAW,GAAG,WAAW,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,MAAM,CACpD,CAAC;QACJ,CAAC;QAED,kCAAkC;QAClC,IAAI,OAAO,EAAE,aAAa,KAAK,SAAS,EAAE,CAAC;YACzC,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CACjC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,OAAO,CAAC,aAAc,CAC7C,CAAC;YACF,qDAAqD;YACrD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;YAC1D,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;gBAC3B,IAAI,GAAG,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,YAAY,EAAE,CAAC;oBAC3C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACpB,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC;YACD,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,UAAU;QAChD,CAAC;QAED,yCAAyC;QACzC,IAAI,OAAO,EAAE,mBAAmB,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,aAAa,CACxC,WAAW,EACX,OAAO,CAAC,mBAAmB,EAC3B,OAAO,CAAC,sBAAsB,CAC/B,CAAC;YACF,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;gBAC5B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACpB,cAAc,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACzC,CAAC;YACD,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,UAAU;QAChD,CAAC;QAED,yCAAyC;QACzC,IAAI,OAAO,EAAE,QAAQ,IAAI,WAAW,CAAC,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YAC/D,gBAAgB;YAChB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACxB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBACpC,OAAO,MAAM,GAAG,MAAM,CAAC;YACzB,CAAC,CAAC,CAAC;YAEH,+DAA+D;YAC/D,IAAI,OAAO,CAAC,sBAAsB,EAAE,CAAC;gBACnC,MAAM,IAAI,GAAG,IAAI,CAAC,wBAAwB,CACxC,WAAW,EACX,OAAO,CAAC,QAAQ,CACjB,CAAC;gBACF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC/C,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;oBAC9B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;wBACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBACpB,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACvC,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBACrD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;oBAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACpB,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QAED,eAAe;QACf,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAC5B,CAAC;QAED,OAAO;YACL,SAAS,EAAE,MAAM;YACjB,cAAc;YACd,WAAW,EAAE,MAAM,CAAC,MAAM;YAC1B,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE;SACnC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,aAAa,CACzB,WAAyB,EACzB,SAAiB,EACjB,sBAAsB,GAAG,IAAI;QAE7B,MAAM,SAAS,GAAiB,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,YAAY,GAA2B,EAAE,CAAC;QAEhD,gCAAgC;QAChC,MAAM,MAAM,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC5C,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;QAEH,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,0CAA0C;YAC1C,IAAI,WAAW,GAAG,KAAK,CAAC;YACxB,KAAK,MAAM,MAAM,IAAI,IAAI,EAAE,CAAC;gBAC1B,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;gBACzD,IAAI,OAAO,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,SAAS,EAAE,CAAC;oBAChE,WAAW,GAAG,IAAI,CAAC;oBACnB,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,WAAW,EAAE,CAAC;gBAChB,wBAAwB;gBACxB,IAAI,sBAAsB,EAAE,CAAC;oBAC3B,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAClD,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;wBACpB,6BAA6B;wBAC7B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBACjB,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC;wBAC3C,SAAS;oBACX,CAAC;gBACH,CAAC;gBACD,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACjB,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,CAAa,EAAE,CAAa;QACpD,iDAAiD;QACjD,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAC/B,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,GAAG,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBACvC,KAAK,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBACzC,KAAK,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC3C,CAAC;YACD,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1D,CAAC;QAED,sDAAsD;QACtD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/D,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/D,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;QAC9C,OAAO,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;IACxC,CAAC;IAED;;OAEG;IACK,wBAAwB,CAC9B,WAAyB,EACzB,QAAgB;QAEhB,MAAM,QAAQ,GAAiB,EAAE,CAAC;QAClC,MAAM,YAAY,GAA2B,EAAE,CAAC;QAChD,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/D,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9E,wCAAwC;QACxC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,UAAU,GAAG,WAAW;iBAC3B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC;iBAClC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YAE/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnE,IAAI,QAAQ,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;oBAC/B,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC7B,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;QACH,CAAC;QAED,uDAAuD;QACvD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,WAAW;aAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aACrC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/D,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,IAAI,QAAQ,CAAC,MAAM,IAAI,QAAQ;gBAAE,MAAM;YACvC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,GAAe;QAClC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QACnD,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9C,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,sBAAsB;QAEpE,uBAAuB;QACvB,MAAM,WAAW,GAAG,GAAG,CAAC,cAAc;YACpC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,cAAc,CAAC,OAAO,EAAE;YAC3C,CAAC,CAAC,KAAK,CAAC;QACV,MAAM,aAAa,GAAG,WAAW,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1D,MAAM,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,aAAa,GAAG,EAAE,CAAC,CAAC,CAAC,sBAAsB;QAEhF,OAAO,CACL,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,gBAAgB;YAC1C,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,GAAG,0BAA0B;YAC/D,CAAC,YAAY,GAAG,GAAG,GAAG,kBAAkB,GAAG,GAAG,CAAC,CAAC,mBAAmB;SACpE,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe;QAanB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QAEzC,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAC5C,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,UAAU,GAAgB,IAAI,CAAC;QACnC,IAAI,UAAU,GAAgB,IAAI,CAAC;QAEnC,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;QAC1D,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;QAC5D,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,cAAc,GAAG,CAAC,CAAC;QAEvB,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;YAC9B,gBAAgB;YAChB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAEvD,iBAAiB;YACjB,IAAI,GAAG,CAAC,OAAO;gBAAE,YAAY,EAAE,CAAC;YAEhC,YAAY;YACZ,UAAU,IAAI,GAAG,CAAC,UAAU,CAAC;YAE7B,gBAAgB;YAChB,MAAM,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC;YAChC,IAAI,CAAC,UAAU,IAAI,SAAS,GAAG,UAAU;gBAAE,UAAU,GAAG,SAAS,CAAC;YAClE,IAAI,CAAC,UAAU,IAAI,SAAS,GAAG,UAAU;gBAAE,UAAU,GAAG,SAAS,CAAC;YAElE,mBAAmB;YACnB,IAAI,GAAG,CAAC,UAAU,KAAK,CAAC,IAAI,SAAS,CAAC,OAAO,EAAE,GAAG,YAAY,EAAE,CAAC;gBAC/D,aAAa,EAAE,CAAC;YAClB,CAAC;YACD,IAAI,SAAS,CAAC,OAAO,EAAE,GAAG,aAAa,EAAE,CAAC;gBACxC,QAAQ,EAAE,CAAC;gBACX,IAAI,CAAC,GAAG,CAAC,OAAO;oBAAE,cAAc,EAAE,CAAC;YACrC,CAAC;QACH,CAAC;QAED,OAAO;YACL,KAAK,EAAE,WAAW,CAAC,MAAM;YACzB,QAAQ;YACR,SAAS,EAAE;gBACT,OAAO,EAAE,YAAY;gBACrB,OAAO,EAAE,WAAW,CAAC,MAAM,GAAG,YAAY;aAC3C;YACD,UAAU;YACV,UAAU;YACV,YAAY,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1E,eAAe,EAAE;gBACf,QAAQ,EAAE,aAAa;gBACvB,GAAG,EAAE,QAAQ;gBACb,SAAS,EAAE,cAAc;aAC1B;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;CACF"}

package/dist/memory/graph-layers/base.d.ts

@@ -0,0 +1,29 @@
+import type { GraphEdge, GraphLayerOperations } from '../../types/knowledge-graph.js';
+import type { GraphLayerName, KnowledgeNote, LinkRelation } from '../../types/knowledge.js';
+/**
+ * Base implementation for a graph layer.
+ *
+ * Uses an in-memory adjacency list for O(1) edge lookups.
+ * Subclasses only override the set of valid relation types for their layer.
+ */
+export declare abstract class BaseGraphLayer implements GraphLayerOperations {
+    abstract readonly name: GraphLayerName;
+    readonly enabled: boolean;
+    /** Outgoing edges: nodeId → edges[] */
+    protected outgoing: Map<string, GraphEdge[]>;
+    /** Incoming edges: nodeId → edges[] */
+    protected incoming: Map<string, GraphEdge[]>;
+    /** Which relation types belong to this layer */
+    protected abstract readonly validRelations: readonly LinkRelation[];
+    constructor(enabled?: boolean);
+    getEdges(nodeId: string, direction?: 'outgoing' | 'incoming' | 'both'): GraphEdge[];
+    neighbors(nodeId: string, depth?: number): string[];
+    pathBetween(fromId: string, toId: string): string[] | null;
+    addEdge(edge: GraphEdge): void;
+    removeEdge(fromId: string, toId: string, relation: string): void;
+    getAllEdges(): GraphEdge[];
+    edgeCount(): number;
+    rebuild(notes: KnowledgeNote[]): void;
+    clear(): void;
+}
+//# sourceMappingURL=base.d.ts.map

package/dist/memory/graph-layers/base.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"base.d.ts","sourceRoot":"","sources":["../../../src/memory/graph-layers/base.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,SAAS,EACT,oBAAoB,EACrB,MAAM,gCAAgC,CAAC;AACxC,OAAO,KAAK,EACV,cAAc,EACd,aAAa,EACb,YAAY,EACb,MAAM,0BAA0B,CAAC;AAGlC;;;;;GAKG;AACH,8BAAsB,cAAe,YAAW,oBAAoB;IAClE,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;IACvC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAE1B,uCAAuC;IACvC,SAAS,CAAC,QAAQ,2BAAkC;IACpD,uCAAuC;IACvC,SAAS,CAAC,QAAQ,2BAAkC;IAEpD,gDAAgD;IAChD,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,cAAc,EAAE,SAAS,YAAY,EAAE,CAAC;gBAExD,OAAO,GAAE,OAAc;IAInC,QAAQ,CACN,MAAM,EAAE,MAAM,EACd,SAAS,GAAE,UAAU,GAAG,UAAU,GAAG,MAAe,GACnD,SAAS,EAAE;IAWd,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,GAAE,MAAU,GAAG,MAAM,EAAE;IAuBtD,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI;IAqC1D,OAAO,CAAC,IAAI,EAAE,SAAS,GAAG,IAAI;IAc9B,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAkBhE,WAAW,IAAI,SAAS,EAAE;IAQ1B,SAAS,IAAI,MAAM;IAQnB,OAAO,CAAC,KAAK,EAAE,aAAa,EAAE,GAAG,IAAI;IAwBrC,KAAK,IAAI,IAAI;CAId"}