@vinaes/succ 1.3.19

package/dist/lib/db/graph.js

@@ -0,0 +1,488 @@
+import { getDb, cachedPrepare } from './connection.js';
+import { cosineSimilarity } from '../embeddings.js';
+import { bufferToFloatArray } from './helpers.js';
+import { triggerAutoExport } from '../graph-scheduler.js';
+import { getMemoryById } from './memories.js';
+import { logWarn } from '../fault-logger.js';
+// ============================================================================
+// Knowledge Graph Types
+// ============================================================================
+export const LINK_RELATIONS = [
+    'related', // Generic relation
+    'caused_by', // A was caused by B
+    'leads_to', // A leads to B
+    'similar_to', // A is similar to B
+    'contradicts', // A contradicts B
+    'implements', // A implements B (decision → code)
+    'supersedes', // A supersedes/replaces B
+    'references', // A references B
+];
+// ============================================================================
+// Memory Link Functions
+// ============================================================================
+/**
+ * Create a link between two memories with optional temporal validity
+ */
+export function createMemoryLink(sourceId, targetId, relation = 'related', weight = 1.0, options) {
+    // Convert Date objects to ISO strings
+    const validFromStr = options?.validFrom
+        ? options.validFrom instanceof Date
+            ? options.validFrom.toISOString()
+            : options.validFrom
+        : null;
+    const validUntilStr = options?.validUntil
+        ? options.validUntil instanceof Date
+            ? options.validUntil.toISOString()
+            : options.validUntil
+        : null;
+    try {
+        const result = cachedPrepare(`
+        INSERT INTO memory_links (source_id, target_id, relation, weight, valid_from, valid_until)
+        VALUES (?, ?, ?, ?, ?, ?)
+      `).run(sourceId, targetId, relation, weight, validFromStr, validUntilStr);
+        // Auto-tag superseded memories for archive
+        if (relation === 'supersedes') {
+            const target = getMemoryById(targetId);
+            if (target && !target.tags.includes('superseded')) {
+                updateMemoryTags(targetId, [...target.tags, 'superseded']);
+            }
+        }
+        // Schedule auto-export if enabled (async, non-blocking)
+        triggerAutoExport().catch((err) => {
+            logWarn('graph', err instanceof Error ? err.message : 'Auto-export failed');
+        });
+        return { id: result.lastInsertRowid, created: true };
+    }
+    catch (error) {
+        // Link already exists (UNIQUE constraint)
+        if (error.code === 'SQLITE_CONSTRAINT_UNIQUE') {
+            const existing = cachedPrepare('SELECT id FROM memory_links WHERE source_id = ? AND target_id = ? AND relation = ?').get(sourceId, targetId, relation);
+            return { id: existing.id, created: false };
+        }
+        throw error;
+    }
+}
+/**
+ * Delete a link between memories
+ */
+export function deleteMemoryLink(sourceId, targetId, relation) {
+    if (relation) {
+        const result = cachedPrepare('DELETE FROM memory_links WHERE source_id = ? AND target_id = ? AND relation = ?').run(sourceId, targetId, relation);
+        return result.changes > 0;
+    }
+    else {
+        const result = cachedPrepare('DELETE FROM memory_links WHERE source_id = ? AND target_id = ?').run(sourceId, targetId);
+        return result.changes > 0;
+    }
+}
+/**
+ * Get all links for a memory (both directions)
+ */
+export function getMemoryLinks(memoryId) {
+    const outgoing = cachedPrepare('SELECT * FROM memory_links WHERE source_id = ?').all(memoryId);
+    const incoming = cachedPrepare('SELECT * FROM memory_links WHERE target_id = ?').all(memoryId);
+    return { outgoing, incoming };
+}
+/**
+ * Get memory with its links (optionally filtered by validity at a point in time)
+ */
+export function getMemoryWithLinks(memoryId, options) {
+    const memory = getMemoryById(memoryId);
+    if (!memory)
+        return null;
+    const links = getMemoryLinks(memoryId);
+    const now = options?.asOfDate?.getTime() ?? Date.now();
+    const includeExpired = options?.includeExpired ?? false;
+    // Filter links by validity period
+    const filterLink = (link) => {
+        if (includeExpired)
+            return true;
+        if (link.valid_from) {
+            const validFrom = new Date(link.valid_from).getTime();
+            if (now < validFrom)
+                return false;
+        }
+        if (link.valid_until) {
+            const validUntil = new Date(link.valid_until).getTime();
+            if (now > validUntil)
+                return false;
+        }
+        return true;
+    };
+    return {
+        ...memory,
+        outgoing_links: links.outgoing.filter(filterLink).map((l) => ({
+            target_id: l.target_id,
+            relation: l.relation,
+            weight: l.weight,
+            valid_from: l.valid_from,
+            valid_until: l.valid_until,
+        })),
+        incoming_links: links.incoming.filter(filterLink).map((l) => ({
+            source_id: l.source_id,
+            relation: l.relation,
+            weight: l.weight,
+            valid_from: l.valid_from,
+            valid_until: l.valid_until,
+        })),
+    };
+}
+/**
+ * Find related memories through links (graph traversal)
+ * Returns memories connected within N hops
+ */
+export function findConnectedMemories(memoryId, maxDepth = 2) {
+    const visited = new Set([memoryId]);
+    const results = [];
+    // BFS traversal
+    let currentLevel = [{ id: memoryId, path: [memoryId] }];
+    for (let depth = 1; depth <= maxDepth; depth++) {
+        const nextLevel = [];
+        for (const { id, path } of currentLevel) {
+            // Get outgoing links
+            const outgoing = cachedPrepare('SELECT target_id FROM memory_links WHERE source_id = ?').all(id);
+            // Get incoming links
+            const incoming = cachedPrepare('SELECT source_id FROM memory_links WHERE target_id = ?').all(id);
+            const neighbors = [...outgoing.map((r) => r.target_id), ...incoming.map((r) => r.source_id)];
+            for (const neighborId of neighbors) {
+                if (!visited.has(neighborId)) {
+                    visited.add(neighborId);
+                    const memory = getMemoryById(neighborId);
+                    if (memory) {
+                        const newPath = [...path, neighborId];
+                        results.push({ memory, depth, path: newPath });
+                        nextLevel.push({ id: neighborId, path: newPath });
+                    }
+                }
+            }
+        }
+        currentLevel = nextLevel;
+    }
+    return results;
+}
+// ============================================================================
+// Auto-Linking Functions
+// ============================================================================
+/**
+ * Find related memories for auto-linking based on embedding similarity
+ */
+export function findRelatedMemoriesForLinking(memoryId, threshold = 0.75, maxLinks = 3) {
+    const source = cachedPrepare('SELECT id, embedding FROM memories WHERE id = ?').get(memoryId);
+    if (!source)
+        return [];
+    const sourceEmbedding = bufferToFloatArray(source.embedding);
+    const memories = cachedPrepare('SELECT id, embedding FROM memories WHERE id != ?').all(memoryId);
+    const similarities = [];
+    for (const target of memories) {
+        const targetEmbedding = bufferToFloatArray(target.embedding);
+        const similarity = cosineSimilarity(sourceEmbedding, targetEmbedding);
+        if (similarity >= threshold) {
+            similarities.push({ id: target.id, similarity });
+        }
+    }
+    // Sort by similarity and take top N
+    similarities.sort((a, b) => b.similarity - a.similarity);
+    return similarities.slice(0, maxLinks);
+}
+/**
+ * Create auto-links for a specific memory
+ */
+export function createAutoLinks(memoryId, threshold = 0.75, maxLinks = 3) {
+    const candidates = findRelatedMemoriesForLinking(memoryId, threshold, maxLinks);
+    let linksCreated = 0;
+    for (const { id: targetId, similarity } of candidates) {
+        const result = createMemoryLink(memoryId, targetId, 'similar_to', similarity);
+        if (result.created) {
+            linksCreated++;
+        }
+    }
+    return linksCreated;
+}
+/**
+ * Auto-link similar memories based on embedding similarity
+ * Useful for building initial graph structure
+ */
+export function autoLinkSimilarMemories(threshold = 0.75, maxLinks = 3) {
+    const memories = cachedPrepare('SELECT id, embedding FROM memories').all();
+    let linksCreated = 0;
+    for (let i = 0; i < memories.length; i++) {
+        const source = memories[i];
+        const sourceEmbedding = bufferToFloatArray(source.embedding);
+        const similarities = [];
+        for (let j = 0; j < memories.length; j++) {
+            if (i === j)
+                continue;
+            const target = memories[j];
+            const targetEmbedding = bufferToFloatArray(target.embedding);
+            const similarity = cosineSimilarity(sourceEmbedding, targetEmbedding);
+            if (similarity >= threshold) {
+                similarities.push({ id: target.id, similarity });
+            }
+        }
+        // Sort by similarity and take top N
+        similarities.sort((a, b) => b.similarity - a.similarity);
+        const topSimilar = similarities.slice(0, maxLinks);
+        for (const { id: targetId, similarity } of topSimilar) {
+            const result = createMemoryLink(source.id, targetId, 'similar_to', similarity);
+            if (result.created) {
+                linksCreated++;
+            }
+        }
+    }
+    return linksCreated;
+}
+// ============================================================================
+// Graph Statistics
+// ============================================================================
+/**
+ * Get graph statistics
+ */
+export function getGraphStats() {
+    const totalMemories = cachedPrepare('SELECT COUNT(*) as count FROM memories').get().count;
+    const totalLinks = cachedPrepare('SELECT COUNT(*) as count FROM memory_links').get().count;
+    // Count memories with no links
+    const isolatedCount = cachedPrepare(`
+      SELECT COUNT(*) as count FROM memories m
+      WHERE NOT EXISTS (SELECT 1 FROM memory_links WHERE source_id = m.id OR target_id = m.id)
+    `).get().count;
+    // Count by relation type
+    const relationCounts = cachedPrepare('SELECT relation, COUNT(*) as count FROM memory_links GROUP BY relation').all();
+    const relations = {};
+    for (const row of relationCounts) {
+        relations[row.relation] = row.count;
+    }
+    return {
+        total_memories: totalMemories,
+        total_links: totalLinks,
+        avg_links_per_memory: totalMemories > 0 ? totalLinks / totalMemories : 0,
+        isolated_memories: isolatedCount,
+        relations,
+    };
+}
+// ============================================================================
+// Temporal Graph Functions
+// ============================================================================
+/**
+ * Invalidate a memory link by setting valid_until to now.
+ * This is the "soft delete" approach for temporal graphs - we keep the link
+ * for historical queries but it won't appear in current-time queries.
+ */
+export function invalidateMemoryLink(sourceId, targetId, relation) {
+    const now = new Date().toISOString();
+    if (relation) {
+        const result = cachedPrepare('UPDATE memory_links SET valid_until = ? WHERE source_id = ? AND target_id = ? AND relation = ? AND valid_until IS NULL').run(now, sourceId, targetId, relation);
+        return result.changes > 0;
+    }
+    else {
+        const result = cachedPrepare('UPDATE memory_links SET valid_until = ? WHERE source_id = ? AND target_id = ? AND valid_until IS NULL').run(now, sourceId, targetId);
+        return result.changes > 0;
+    }
+}
+/**
+ * Get memory links as of a specific point in time
+ */
+export function getMemoryLinksAsOf(memoryId, asOfDate) {
+    const asOfStr = asOfDate.toISOString();
+    const outgoing = cachedPrepare(`
+      SELECT * FROM memory_links
+      WHERE source_id = ?
+        AND created_at <= ?
+        AND (valid_from IS NULL OR valid_from <= ?)
+        AND (valid_until IS NULL OR valid_until > ?)
+    `).all(memoryId, asOfStr, asOfStr, asOfStr);
+    const incoming = cachedPrepare(`
+      SELECT * FROM memory_links
+      WHERE target_id = ?
+        AND created_at <= ?
+        AND (valid_from IS NULL OR valid_from <= ?)
+        AND (valid_until IS NULL OR valid_until > ?)
+    `).all(memoryId, asOfStr, asOfStr, asOfStr);
+    return { outgoing, incoming };
+}
+/**
+ * Find connected memories as of a specific point in time
+ */
+export function findConnectedMemoriesAsOf(memoryId, asOfDate, maxDepth = 2) {
+    const asOfStr = asOfDate.toISOString();
+    const visited = new Set([memoryId]);
+    const results = [];
+    // BFS traversal
+    let currentLevel = [{ id: memoryId, path: [memoryId] }];
+    for (let depth = 1; depth <= maxDepth; depth++) {
+        const nextLevel = [];
+        for (const { id, path } of currentLevel) {
+            // Get outgoing links that were valid at that time
+            const outgoing = cachedPrepare(`
+          SELECT target_id FROM memory_links
+          WHERE source_id = ?
+            AND created_at <= ?
+            AND (valid_from IS NULL OR valid_from <= ?)
+            AND (valid_until IS NULL OR valid_until > ?)
+        `).all(id, asOfStr, asOfStr, asOfStr);
+            // Get incoming links that were valid at that time
+            const incoming = cachedPrepare(`
+          SELECT source_id FROM memory_links
+          WHERE target_id = ?
+            AND created_at <= ?
+            AND (valid_from IS NULL OR valid_from <= ?)
+            AND (valid_until IS NULL OR valid_until > ?)
+        `).all(id, asOfStr, asOfStr, asOfStr);
+            const neighbors = [...outgoing.map((r) => r.target_id), ...incoming.map((r) => r.source_id)];
+            for (const neighborId of neighbors) {
+                if (!visited.has(neighborId)) {
+                    visited.add(neighborId);
+                    const memory = getMemoryById(neighborId);
+                    if (memory) {
+                        const newPath = [...path, neighborId];
+                        results.push({ memory, depth, path: newPath });
+                        nextLevel.push({ id: neighborId, path: newPath });
+                    }
+                }
+            }
+        }
+        currentLevel = nextLevel;
+    }
+    return results;
+}
+/**
+ * Get graph snapshot at a specific point in time.
+ * This is the core of temporal knowledge graphs - ability to query historical state.
+ *
+ * @param asOfDate - The point in time to query
+ * @returns Graph stats at that point in time
+ */
+export function getGraphStatsAsOf(asOfDate) {
+    const asOfStr = asOfDate.toISOString();
+    // Count memories that existed at that time
+    const totalMemories = cachedPrepare('SELECT COUNT(*) as count FROM memories WHERE created_at <= ?').get(asOfStr).count;
+    // Count links that were valid at that time
+    const totalLinks = cachedPrepare(`
+      SELECT COUNT(*) as count FROM memory_links
+      WHERE created_at <= ?
+        AND (valid_from IS NULL OR valid_from <= ?)
+        AND (valid_until IS NULL OR valid_until > ?)
+    `).get(asOfStr, asOfStr, asOfStr).count;
+    // Count by relation type at that time
+    const relationCounts = cachedPrepare(`
+      SELECT relation, COUNT(*) as count FROM memory_links
+      WHERE created_at <= ?
+        AND (valid_from IS NULL OR valid_from <= ?)
+        AND (valid_until IS NULL OR valid_until > ?)
+      GROUP BY relation
+    `).all(asOfStr, asOfStr, asOfStr);
+    const relations = {};
+    for (const row of relationCounts) {
+        relations[row.relation] = row.count;
+    }
+    return {
+        total_memories: totalMemories,
+        total_links: totalLinks,
+        avg_links_per_memory: totalMemories > 0 ? totalLinks / totalMemories : 0,
+        relations,
+    };
+}
+// ============================================================================
+// Graph Enrichment
+// ============================================================================
+/**
+ * Update tags for a memory.
+ */
+export function updateMemoryEmbedding(memoryId, embedding) {
+    const embeddingBlob = Buffer.from(new Float32Array(embedding).buffer);
+    cachedPrepare('UPDATE memories SET embedding = ? WHERE id = ?').run(embeddingBlob, memoryId);
+}
+export function getMemoriesNeedingReembedding(limit = 100, afterId = 0) {
+    return cachedPrepare('SELECT id, content FROM memories WHERE id > ? ORDER BY id LIMIT ?').all(afterId, limit);
+}
+export function getMemoryCount() {
+    const row = cachedPrepare('SELECT count(*) as count FROM memories').get();
+    return row.count;
+}
+export function getMemoryEmbeddingCount() {
+    const row = cachedPrepare('SELECT count(*) as count FROM memories WHERE embedding IS NOT NULL').get();
+    return row.count;
+}
+export function updateMemoryTags(memoryId, tags) {
+    cachedPrepare('UPDATE memories SET tags = ? WHERE id = ?').run(JSON.stringify(tags), memoryId);
+}
+/**
+ * Update a memory link's relation, weight, and/or enrichment flag.
+ */
+export function updateMemoryLink(linkId, updates) {
+    const database = getDb();
+    const sets = [];
+    const params = [];
+    if (updates.relation !== undefined) {
+        sets.push('relation = ?');
+        params.push(updates.relation);
+    }
+    if (updates.weight !== undefined) {
+        sets.push('weight = ?');
+        params.push(updates.weight);
+    }
+    if (updates.llmEnriched !== undefined) {
+        sets.push('llm_enriched = ?');
+        params.push(updates.llmEnriched ? 1 : 0);
+    }
+    if (sets.length > 0) {
+        params.push(linkId);
+        database.prepare(`UPDATE memory_links SET ${sets.join(', ')} WHERE id = ?`).run(...params);
+    }
+}
+/**
+ * Upsert centrality score for a memory.
+ */
+export function upsertCentralityScore(memoryId, degree, normalizedDegree) {
+    cachedPrepare(`INSERT INTO memory_centrality (memory_id, degree, normalized_degree, updated_at)
+     VALUES (?, ?, ?, datetime('now'))
+     ON CONFLICT(memory_id) DO UPDATE SET degree = excluded.degree, normalized_degree = excluded.normalized_degree, updated_at = excluded.updated_at`).run(memoryId, degree, normalizedDegree);
+}
+/**
+ * Get centrality scores for a batch of memory IDs.
+ */
+export function getCentralityScores(memoryIds) {
+    if (memoryIds.length === 0)
+        return new Map();
+    const database = getDb();
+    const placeholders = memoryIds.map(() => '?').join(',');
+    const rows = database
+        .prepare(`SELECT memory_id, normalized_degree FROM memory_centrality WHERE memory_id IN (${placeholders})`)
+        .all(...memoryIds);
+    const map = new Map();
+    for (const row of rows)
+        map.set(row.memory_id, row.normalized_degree);
+    return map;
+}
+/**
+ * Bulk delete memory links by their IDs.
+ * Batches in groups of 999 to respect SQLite parameter limit.
+ */
+export function deleteMemoryLinksByIds(ids) {
+    if (ids.length === 0)
+        return 0;
+    const database = getDb();
+    const BATCH_SIZE = 999;
+    let totalDeleted = 0;
+    for (let i = 0; i < ids.length; i += BATCH_SIZE) {
+        const batch = ids.slice(i, i + BATCH_SIZE);
+        const placeholders = batch.map(() => '?').join(',');
+        const result = database
+            .prepare(`DELETE FROM memory_links WHERE id IN (${placeholders})`)
+            .run(...batch);
+        totalDeleted += result.changes;
+    }
+    return totalDeleted;
+}
+/**
+ * Find memory IDs that have zero links (neither source nor target).
+ */
+export function findIsolatedMemoryIds() {
+    const rows = cachedPrepare(`
+    SELECT m.id FROM memories m
+    WHERE NOT EXISTS (
+      SELECT 1 FROM memory_links WHERE source_id = m.id OR target_id = m.id
+    )
+  `).all();
+    return rows.map((r) => r.id);
+}
+//# sourceMappingURL=graph.js.map

package/dist/lib/db/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../../src/lib/db/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAU,aAAa,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAE7C,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B,SAAS,EAAE,mBAAmB;IAC9B,WAAW,EAAE,oBAAoB;IACjC,UAAU,EAAE,eAAe;IAC3B,YAAY,EAAE,oBAAoB;IAClC,aAAa,EAAE,kBAAkB;IACjC,YAAY,EAAE,mCAAmC;IACjD,YAAY,EAAE,0BAA0B;IACxC,YAAY,EAAE,iBAAiB;CACvB,CAAC;AAiCX,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAgB,EAChB,QAAgB,EAChB,WAAyB,SAAS,EAClC,SAAiB,GAAG,EACpB,OAGC;IAED,sCAAsC;IACtC,MAAM,YAAY,GAAG,OAAO,EAAE,SAAS;QACrC,CAAC,CAAC,OAAO,CAAC,SAAS,YAAY,IAAI;YACjC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,WAAW,EAAE;YACjC,CAAC,CAAC,OAAO,CAAC,SAAS;QACrB,CAAC,CAAC,IAAI,CAAC;IACT,MAAM,aAAa,GAAG,OAAO,EAAE,UAAU;QACvC,CAAC,CAAC,OAAO,CAAC,UAAU,YAAY,IAAI;YAClC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,WAAW,EAAE;YAClC,CAAC,CAAC,OAAO,CAAC,UAAU;QACtB,CAAC,CAAC,IAAI,CAAC;IAET,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,aAAa,CAAC;;;OAG1B,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC;QAE5E,2CAA2C;QAC3C,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;YACvC,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;gBAClD,gBAAgB,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,wDAAwD;QACxD,iBAAiB,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;YAChC,OAAO,CAAC,OAAO,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC;QAC9E,CAAC,CAAC,CAAC;QAEH,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,eAAyB,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IACjE,CAAC;IAAC,OAAO,KAAU,EAAE,CAAC;QACpB,0CAA0C;QAC1C,IAAI,KAAK,CAAC,IAAI,KAAK,0BAA0B,EAAE,CAAC;YAC9C,MAAM,QAAQ,GAAG,aAAa,CAC5B,oFAAoF,CACrF,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAmB,CAAC;YACtD,OAAO,EAAE,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QAC7C,CAAC;QACD,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAgB,EAChB,QAAgB,EAChB,QAAuB;IAEvB,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,MAAM,GAAG,aAAa,CAC1B,iFAAiF,CAClF,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACpC,OAAO,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;IAC5B,CAAC;SAAM,CAAC;QACN,MAAM,MAAM,GAAG,aAAa,CAC1B,gEAAgE,CACjE,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC1B,OAAO,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;IAC5B,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,QAAgB;IAI7C,MAAM,QAAQ,GAAG,aAAa,CAAC,gDAAgD,CAAC,CAAC,GAAG,CAClF,QAAQ,CACO,CAAC;IAElB,MAAM,QAAQ,GAAG,aAAa,CAAC,gDAAgD,CAAC,CAAC,GAAG,CAClF,QAAQ,CACO,CAAC;IAElB,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAChC,QAAgB,EAChB,OAAuD;IAEvD,MAAM,MAAM,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IACvC,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEzB,MAAM,KAAK,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IACvC,MAAM,GAAG,GAAG,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IACvD,MAAM,cAAc,GAAG,OAAO,EAAE,cAAc,IAAI,KAAK,CAAC;IAExD,kCAAkC;IAClC,MAAM,UAAU,GAAG,CAAC,IAAgB,EAAE,EAAE;QACtC,IAAI,cAAc;YAAE,OAAO,IAAI,CAAC;QAChC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC;YACtD,IAAI,GAAG,GAAG,SAAS;gBAAE,OAAO,KAAK,CAAC;QACpC,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,OAAO,EAAE,CAAC;YACxD,IAAI,GAAG,GAAG,UAAU;gBAAE,OAAO,KAAK,CAAC;QACrC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,OAAO;QACL,GAAG,MAAM;QACT,cAAc,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5D,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,QAAQ,EAAE,CAAC,CAAC,QAAwB;YACpC,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,WAAW,EAAE,CAAC,CAAC,WAAW;SAC3B,CAAC,CAAC;QACH,cAAc,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5D,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,QAAQ,EAAE,CAAC,CAAC,QAAwB;YACpC,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,WAAW,EAAE,CAAC,CAAC,WAAW;SAC3B,CAAC,CAAC;KACJ,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACnC,QAAgB,EAChB,WAAmB,CAAC;IAEpB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC5C,MAAM,OAAO,GAA6D,EAAE,CAAC;IAE7E,gBAAgB;IAChB,IAAI,YAAY,GAAG,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAExD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC;QAC/C,MAAM,SAAS,GAA0C,EAAE,CAAC;QAE5D,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,YAAY,EAAE,CAAC;YACxC,qBAAqB;YACrB,MAAM,QAAQ,GAAG,aAAa,CAAC,wDAAwD,CAAC,CAAC,GAAG,CAC1F,EAAE,CAC6B,CAAC;YAElC,qBAAqB;YACrB,MAAM,QAAQ,GAAG,aAAa,CAAC,wDAAwD,CAAC,CAAC,GAAG,CAC1F,EAAE,CAC6B,CAAC;YAElC,MAAM,SAAS,GAAG,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YAE7F,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;gBACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,MAAM,MAAM,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;oBACzC,IAAI,MAAM,EAAE,CAAC;wBACX,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC;wBACtC,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;wBAC/C,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;oBACpD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,YAAY,GAAG,SAAS,CAAC;IAC3B,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+EAA+E;AAC/E,yBAAyB;AACzB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,6BAA6B,CAC3C,QAAgB,EAChB,YAAoB,IAAI,EACxB,WAAmB,CAAC;IAEpB,MAAM,MAAM,GAAG,aAAa,CAAC,iDAAiD,CAAC,CAAC,GAAG,CAAC,QAAQ,CAE/E,CAAC;IAEd,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAEvB,MAAM,eAAe,GAAG,kBAAkB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAE7D,MAAM,QAAQ,GAAG,aAAa,CAAC,kDAAkD,CAAC,CAAC,GAAG,CACpF,QAAQ,CACmC,CAAC;IAE9C,MAAM,YAAY,GAA8C,EAAE,CAAC;IAEnE,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,kBAAkB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC7D,MAAM,UAAU,GAAG,gBAAgB,CAAC,eAAe,EAAE,eAAe,CAAC,CAAC;QAEtE,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;YAC5B,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IAED,oCAAoC;IACpC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IACzD,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAgB,EAChB,YAAoB,IAAI,EACxB,WAAmB,CAAC;IAEpB,MAAM,UAAU,GAAG,6BAA6B,CAAC,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IAEhF,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,IAAI,UAAU,EAAE,CAAC;QACtD,MAAM,MAAM,GAAG,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QAC9E,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnB,YAAY,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAC,YAAoB,IAAI,EAAE,WAAmB,CAAC;IACpF,MAAM,QAAQ,GAAG,aAAa,CAAC,oCAAoC,CAAC,CAAC,GAAG,EAGtE,CAAC;IAEH,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,eAAe,GAAG,kBAAkB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAE7D,MAAM,YAAY,GAA8C,EAAE,CAAC;QAEnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YAEtB,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,eAAe,GAAG,kBAAkB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAC7D,MAAM,UAAU,GAAG,gBAAgB,CAAC,eAAe,EAAE,eAAe,CAAC,CAAC;YAEtE,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;gBAC5B,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QACzD,MAAM,UAAU,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAEnD,KAAK,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,IAAI,UAAU,EAAE,CAAC;YACtD,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;YAC/E,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACnB,YAAY,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,aAAa;IAO3B,MAAM,aAAa,GACjB,aAAa,CAAC,wCAAwC,CAAC,CAAC,GAAG,EAC5D,CAAC,KAAK,CAAC;IAER,MAAM,UAAU,GACd,aAAa,CAAC,4CAA4C,CAAC,CAAC,GAAG,EAChE,CAAC,KAAK,CAAC;IAER,+BAA+B;IAC/B,MAAM,aAAa,GACjB,aAAa,CAAC;;;KAGb,CAAC,CAAC,GAAG,EACP,CAAC,KAAK,CAAC;IAER,yBAAyB;IACzB,MAAM,cAAc,GAAG,aAAa,CAClC,wEAAwE,CACzE,CAAC,GAAG,EAAgD,CAAC;IAEtD,MAAM,SAAS,GAA2B,EAAE,CAAC;IAC7C,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;QACjC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;IACtC,CAAC;IAED,OAAO;QACL,cAAc,EAAE,aAAa;QAC7B,WAAW,EAAE,UAAU;QACvB,oBAAoB,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACxE,iBAAiB,EAAE,aAAa;QAChC,SAAS;KACV,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,2BAA2B;AAC3B,+EAA+E;AAE/E;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAAgB,EAChB,QAAgB,EAChB,QAAuB;IAEvB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAErC,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,MAAM,GAAG,aAAa,CAC1B,wHAAwH,CACzH,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACzC,OAAO,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;IAC5B,CAAC;SAAM,CAAC;QACN,MAAM,MAAM,GAAG,aAAa,CAC1B,uGAAuG,CACxG,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC/B,OAAO,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;IAC5B,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAChC,QAAgB,EAChB,QAAc;IAKd,MAAM,OAAO,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IAEvC,MAAM,QAAQ,GAAG,aAAa,CAAC;;;;;;KAM5B,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAiB,CAAC;IAE9D,MAAM,QAAQ,GAAG,aAAa,CAAC;;;;;;KAM5B,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAiB,CAAC;IAE9D,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CACvC,QAAgB,EAChB,QAAc,EACd,WAAmB,CAAC;IAEpB,MAAM,OAAO,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IACvC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC5C,MAAM,OAAO,GAA6D,EAAE,CAAC;IAE7E,gBAAgB;IAChB,IAAI,YAAY,GAAG,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAExD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC;QAC/C,MAAM,SAAS,GAA0C,EAAE,CAAC;QAE5D,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,YAAY,EAAE,CAAC;YACxC,kDAAkD;YAClD,MAAM,QAAQ,GAAG,aAAa,CAAC;;;;;;SAM5B,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAiC,CAAC;YAExE,kDAAkD;YAClD,MAAM,QAAQ,GAAG,aAAa,CAAC;;;;;;SAM5B,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAiC,CAAC;YAExE,MAAM,SAAS,GAAG,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YAE7F,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;gBACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,MAAM,MAAM,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;oBACzC,IAAI,MAAM,EAAE,CAAC;wBACX,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC;wBACtC,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;wBAC/C,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;oBACpD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,YAAY,GAAG,SAAS,CAAC;IAC3B,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,QAAc;IAM9C,MAAM,OAAO,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IAEvC,2CAA2C;IAC3C,MAAM,aAAa,GACjB,aAAa,CAAC,8DAA8D,CAAC,CAAC,GAAG,CAAC,OAAO,CAG1F,CAAC,KAAK,CAAC;IAER,2CAA2C;IAC3C,MAAM,UAAU,GACd,aAAa,CAAC;;;;;KAKb,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CACjC,CAAC,KAAK,CAAC;IAER,sCAAsC;IACtC,MAAM,cAAc,GAAG,aAAa,CAAC;;;;;;KAMlC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAA+C,CAAC;IAElF,MAAM,SAAS,GAA2B,EAAE,CAAC;IAC7C,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;QACjC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;IACtC,CAAC;IAED,OAAO;QACL,cAAc,EAAE,aAAa;QAC7B,WAAW,EAAE,UAAU;QACvB,oBAAoB,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACxE,SAAS;KACV,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,QAAgB,EAAE,SAAmB;IACzE,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC;IACtE,aAAa,CAAC,gDAAgD,CAAC,CAAC,GAAG,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;AAC/F,CAAC;AAED,MAAM,UAAU,6BAA6B,CAC3C,QAAgB,GAAG,EACnB,UAAkB,CAAC;IAEnB,OAAO,aAAa,CAAC,mEAAmE,CAAC,CAAC,GAAG,CAC3F,OAAO,EACP,KAAK,CACoC,CAAC;AAC9C,CAAC;AAED,MAAM,UAAU,cAAc;IAC5B,MAAM,GAAG,GAAG,aAAa,CAAC,wCAAwC,CAAC,CAAC,GAAG,EAAuB,CAAC;IAC/F,OAAO,GAAG,CAAC,KAAK,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,uBAAuB;IACrC,MAAM,GAAG,GAAG,aAAa,CACvB,oEAAoE,CACrE,CAAC,GAAG,EAAuB,CAAC;IAC7B,OAAO,GAAG,CAAC,KAAK,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,QAAgB,EAAE,IAAc;IAC/D,aAAa,CAAC,2CAA2C,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,CAAC;AACjG,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAc,EACd,OAAsE;IAEtE,MAAM,QAAQ,GAAG,KAAK,EAAE,CAAC;IACzB,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,MAAM,GAAwB,EAAE,CAAC;IACvC,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QACnC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACxB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IACD,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACtC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpB,QAAQ,CAAC,OAAO,CAAC,2BAA2B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAC7F,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACnC,QAAgB,EAChB,MAAc,EACd,gBAAwB;IAExB,aAAa,CACX;;qJAEiJ,CAClJ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC;AAC5C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,SAAmB;IACrD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IAC7C,MAAM,QAAQ,GAAG,KAAK,EAAE,CAAC;IACzB,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxD,MAAM,IAAI,GAAG,QAAQ;SAClB,OAAO,CACN,kFAAkF,YAAY,GAAG,CAClG;SACA,GAAG,CAAC,GAAG,SAAS,CAA4D,CAAC;IAChF,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,GAAG,IAAI,IAAI;QAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,iBAAiB,CAAC,CAAC;IACtE,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,GAAa;IAClD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,KAAK,EAAE,CAAC;IACzB,MAAM,UAAU,GAAG,GAAG,CAAC;IACvB,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC;QAC3C,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,QAAQ;aACpB,OAAO,CAAC,yCAAyC,YAAY,GAAG,CAAC;aACjE,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QACjB,YAAY,IAAI,MAAM,CAAC,OAAO,CAAC;IACjC,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB;IACnC,MAAM,IAAI,GAAG,aAAa,CAAC;;;;;GAK1B,CAAC,CAAC,GAAG,EAA2B,CAAC;IAClC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAC/B,CAAC"}

package/dist/lib/db/helpers.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Helper utilities for database operations
+ */
+/**
+ * Safely convert Buffer to Float32Array, handling byte offset and alignment correctly.
+ * Float32Array requires 4-byte alignment, so we copy the buffer to ensure alignment.
+ */
+export declare function bufferToFloatArray(buffer: Buffer): number[];
+/**
+ * Convert number[] to Buffer for sqlite-vec
+ */
+export declare function floatArrayToBuffer(arr: number[]): Buffer;
+//# sourceMappingURL=helpers.d.ts.map

package/dist/lib/db/helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../../src/lib/db/helpers.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAS3D;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,MAAM,CAGxD"}

package/dist/lib/db/helpers.js

@@ -0,0 +1,21 @@
+/**
+ * Helper utilities for database operations
+ */
+/**
+ * Safely convert Buffer to Float32Array, handling byte offset and alignment correctly.
+ * Float32Array requires 4-byte alignment, so we copy the buffer to ensure alignment.
+ */
+export function bufferToFloatArray(buffer) {
+    // Copy buffer to ensure 4-byte alignment for Float32Array
+    const aligned = Buffer.from(buffer);
+    const floatArray = new Float32Array(aligned.buffer, aligned.byteOffset, aligned.byteLength / Float32Array.BYTES_PER_ELEMENT);
+    return Array.from(floatArray);
+}
+/**
+ * Convert number[] to Buffer for sqlite-vec
+ */
+export function floatArrayToBuffer(arr) {
+    const float32 = new Float32Array(arr);
+    return Buffer.from(float32.buffer, float32.byteOffset, float32.byteLength);
+}
+//# sourceMappingURL=helpers.js.map

package/dist/lib/db/helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.js","sourceRoot":"","sources":["../../../src/lib/db/helpers.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAc;IAC/C,0DAA0D;IAC1D,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpC,MAAM,UAAU,GAAG,IAAI,YAAY,CACjC,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,UAAU,EAClB,OAAO,CAAC,UAAU,GAAG,YAAY,CAAC,iBAAiB,CACpD,CAAC;IACF,OAAO,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;AAChC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,GAAa;IAC9C,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;IACtC,OAAO,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;AAC7E,CAAC"}

package/dist/lib/db/hybrid-search.d.ts

@@ -0,0 +1,64 @@
+import { SearchResult } from './types.js';
+export interface HybridSearchResult extends SearchResult {
+    bm25Score?: number;
+    vectorScore?: number;
+}
+export interface HybridMemoryResult {
+    id: number;
+    content: string;
+    tags: string | null;
+    source: string | null;
+    type: string | null;
+    created_at: string;
+    similarity: number;
+    bm25Score?: number;
+    vectorScore?: number;
+    last_accessed?: string | null;
+    access_count?: number;
+    valid_from?: string | null;
+    valid_until?: string | null;
+    quality_score?: number | null;
+}
+export interface HybridGlobalMemoryResult {
+    id: number;
+    content: string;
+    tags: string[];
+    source: string | null;
+    project: string | null;
+    created_at: string;
+    similarity: number;
+    bm25Score?: number;
+    vectorScore?: number;
+    isGlobal: true;
+}
+export interface CodeSearchFilters {
+    /** Filter results to only those matching this regex against content */
+    regex?: string;
+    /** Filter results to only chunks with this symbol_type (function, method, class, interface, type_alias) */
+    symbolType?: string;
+}
+/**
+ * Hybrid search combining BM25 and vector similarity.
+ * Uses sqlite-vec for fast KNN vector search when available.
+ *
+ * @param query - Search query string
+ * @param queryEmbedding - Query embedding vector
+ * @param limit - Max results
+ * @param threshold - Min similarity threshold
+ * @param alpha - Weight: 0=pure BM25, 1=pure vector, 0.5=equal (default: 0.5)
+ * @param filters - Optional regex/symbol_type filters
+ */
+export declare function hybridSearchCode(query: string, queryEmbedding: number[], limit?: number, threshold?: number, alpha?: number, filters?: CodeSearchFilters): HybridSearchResult[];
+/**
+ * Hybrid search for docs (brain/ markdown files)
+ */
+export declare function hybridSearchDocs(query: string, queryEmbedding: number[], limit?: number, threshold?: number, alpha?: number): HybridSearchResult[];
+/**
+ * Hybrid search for memories
+ */
+export declare function hybridSearchMemories(query: string, queryEmbedding: number[], limit?: number, threshold?: number, alpha?: number): HybridMemoryResult[];
+/**
+ * Hybrid search for global memories (BM25 + vector with RRF fusion)
+ */
+export declare function hybridSearchGlobalMemories(query: string, queryEmbedding: number[], limit?: number, threshold?: number, alpha?: number, tags?: string[], since?: Date): HybridGlobalMemoryResult[];
+//# sourceMappingURL=hybrid-search.d.ts.map

package/dist/lib/db/hybrid-search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hybrid-search.d.ts","sourceRoot":"","sources":["../../../src/lib/db/hybrid-search.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAgB1C,MAAM,WAAW,kBAAmB,SAAQ,YAAY;IACtD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IAErB,aAAa,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAE5B,aAAa,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC/B;AAED,MAAM,WAAW,wBAAwB;IACvC,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,EAAE,IAAI,CAAC;CAChB;AAMD,MAAM,WAAW,iBAAiB;IAChC,uEAAuE;IACvE,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,2GAA2G;IAC3G,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,MAAM,EACb,cAAc,EAAE,MAAM,EAAE,EACxB,KAAK,GAAE,MAAU,EACjB,SAAS,GAAE,MAAa,EACxB,KAAK,GAAE,MAAY,EACnB,OAAO,CAAC,EAAE,iBAAiB,GAC1B,kBAAkB,EAAE,CAgQtB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,MAAM,EACb,cAAc,EAAE,MAAM,EAAE,EACxB,KAAK,GAAE,MAAU,EACjB,SAAS,GAAE,MAAY,EACvB,KAAK,GAAE,MAAY,GAClB,kBAAkB,EAAE,CAuItB;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,MAAM,EACb,cAAc,EAAE,MAAM,EAAE,EACxB,KAAK,GAAE,MAAU,EACjB,SAAS,GAAE,MAAY,EACvB,KAAK,GAAE,MAAY,GAClB,kBAAkB,EAAE,CAwItB;AAED;;GAEG;AACH,wBAAgB,0BAA0B,CACxC,KAAK,EAAE,MAAM,EACb,cAAc,EAAE,MAAM,EAAE,EACxB,KAAK,GAAE,MAAU,EACjB,SAAS,GAAE,MAAY,EACvB,KAAK,GAAE,MAAY,EACnB,IAAI,CAAC,EAAE,MAAM,EAAE,EACf,KAAK,CAAC,EAAE,IAAI,GACX,wBAAwB,EAAE,CAuJ5B"}