squish-memory 0.7.0

package/dist/core/local-embeddings.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Local Vector Embeddings Service
+ * Provides local embedding generation without external APIs
+ */
+export type Embedding = number[];
+export declare const EMBEDDING_DIMENSIONS = 1536;
+export interface EmbeddingProvider {
+    embed(text: string): Promise<Embedding>;
+    isAvailable(): Promise<boolean>;
+    getDimensions(): number;
+}
+export declare function initializeEmbeddingProvider(): Promise<void>;
+export declare function cosineSimilarity(a: Embedding, b: Embedding): number;
+//# sourceMappingURL=local-embeddings.d.ts.map

package/dist/core/local-embeddings.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-embeddings.d.ts","sourceRoot":"","sources":["../../core/local-embeddings.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,MAAM,MAAM,SAAS,GAAG,MAAM,EAAE,CAAC;AAEjC,eAAO,MAAM,oBAAoB,OAAO,CAAC;AAEzC,MAAM,WAAW,iBAAiB;IAChC,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IACxC,WAAW,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;IAChC,aAAa,IAAI,MAAM,CAAC;CACzB;AAoED,wBAAsB,2BAA2B,IAAI,OAAO,CAAC,IAAI,CAAC,CAejE;AAYD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,GAAG,MAAM,CAiBnE"}

package/dist/core/local-embeddings.js

@@ -0,0 +1,94 @@
+/**
+ * Local Vector Embeddings Service
+ * Provides local embedding generation without external APIs
+ */
+import { config } from '../config.js';
+import { logger } from './logger.js';
+export const EMBEDDING_DIMENSIONS = 1536;
+class StubEmbeddingProvider {
+    async embed(_text) {
+        return Array(EMBEDDING_DIMENSIONS).fill(0);
+    }
+    async isAvailable() {
+        return true;
+    }
+    getDimensions() {
+        return EMBEDDING_DIMENSIONS;
+    }
+}
+class LocalTfidfEmbeddingProvider {
+    idf = new Map();
+    async embed(text) {
+        const words = this.tokenize(text);
+        const embedding = Array(EMBEDDING_DIMENSIONS).fill(0);
+        const wordFreq = new Map();
+        for (const word of words) {
+            wordFreq.set(word, (wordFreq.get(word) || 0) + 1);
+        }
+        for (const [word, freq] of wordFreq.entries()) {
+            const hash = this.hash(word) % EMBEDDING_DIMENSIONS;
+            const idf = this.idf.get(word) || 1;
+            embedding[hash] += freq * idf;
+        }
+        const norm = Math.sqrt(embedding.reduce((sum, val) => sum + val * val, 0));
+        if (norm > 0) {
+            for (let i = 0; i < embedding.length; i++) {
+                embedding[i] /= norm;
+            }
+        }
+        return embedding;
+    }
+    async isAvailable() {
+        return true;
+    }
+    getDimensions() {
+        return EMBEDDING_DIMENSIONS;
+    }
+    tokenize(text) {
+        return text.toLowerCase().split(/\s+/).filter(w => w.length > 2).slice(0, 100);
+    }
+    hash(str) {
+        let hash = 0;
+        for (let i = 0; i < str.length; i++) {
+            hash = ((hash << 5) - hash) + str.charCodeAt(i);
+            hash = hash & hash;
+        }
+        return Math.abs(hash);
+    }
+}
+let currentProvider = null;
+export async function initializeEmbeddingProvider() {
+    if (config.embeddingsProvider === 'openai' && config.openAiApiKey) {
+        logger.info('Using OpenAI embeddings (team mode - requires API key)');
+        currentProvider = new StubEmbeddingProvider();
+    }
+    else if (config.embeddingsProvider === 'ollama') {
+        logger.info('Using Ollama embeddings (team mode - local LLM)');
+        currentProvider = new StubEmbeddingProvider();
+    }
+    else if (config.embeddingsProvider === 'local') {
+        logger.info('Using local TF-IDF embeddings (SQLite mode - offline, no API key)');
+        currentProvider = new LocalTfidfEmbeddingProvider();
+    }
+    else {
+        // 'none' mode
+        logger.info('Embeddings disabled (stub provider)');
+        currentProvider = new StubEmbeddingProvider();
+    }
+}
+export function cosineSimilarity(a, b) {
+    if (a.length !== b.length) {
+        throw new Error('Embeddings must have same dimensions');
+    }
+    let dotProduct = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denominator = Math.sqrt(normA) * Math.sqrt(normB);
+    return denominator === 0 ? 0 : dotProduct / denominator;
+}
+//# sourceMappingURL=local-embeddings.js.map

package/dist/core/local-embeddings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-embeddings.js","sourceRoot":"","sources":["../../core/local-embeddings.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAIrC,MAAM,CAAC,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAQzC,MAAM,qBAAqB;IACzB,KAAK,CAAC,KAAK,CAAC,KAAa;QACvB,OAAO,KAAK,CAAC,oBAAoB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,KAAK,CAAC,WAAW;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IAED,aAAa;QACX,OAAO,oBAAoB,CAAC;IAC9B,CAAC;CACF;AAED,MAAM,2BAA2B;IACvB,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IAExC,KAAK,CAAC,KAAK,CAAC,IAAY;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,SAAS,GAAG,KAAK,CAAC,oBAAoB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;QAED,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,oBAAoB,CAAC;YACpD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,GAAG,CAAC;QAChC,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3E,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,KAAK,CAAC,WAAW;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IAED,aAAa;QACX,OAAO,oBAAoB,CAAC;IAC9B,CAAC;IAEO,QAAQ,CAAC,IAAY;QAC3B,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACjF,CAAC;IAEO,IAAI,CAAC,GAAW;QACtB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;CACF;AAED,IAAI,eAAe,GAA6B,IAAI,CAAC;AAErD,MAAM,CAAC,KAAK,UAAU,2BAA2B;IAC/C,IAAI,MAAM,CAAC,kBAAkB,KAAK,QAAQ,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QAClE,MAAM,CAAC,IAAI,CAAC,wDAAwD,CAAC,CAAC;QACtE,eAAe,GAAG,IAAI,qBAAqB,EAAE,CAAC;IAChD,CAAC;SAAM,IAAI,MAAM,CAAC,kBAAkB,KAAK,QAAQ,EAAE,CAAC;QAClD,MAAM,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;QAC/D,eAAe,GAAG,IAAI,qBAAqB,EAAE,CAAC;IAChD,CAAC;SAAM,IAAI,MAAM,CAAC,kBAAkB,KAAK,OAAO,EAAE,CAAC;QACjD,MAAM,CAAC,IAAI,CAAC,mEAAmE,CAAC,CAAC;QACjF,eAAe,GAAG,IAAI,2BAA2B,EAAE,CAAC;IACtD,CAAC;SAAM,CAAC;QACN,cAAc;QACd,MAAM,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;QACnD,eAAe,GAAG,IAAI,qBAAqB,EAAE,CAAC;IAChD,CAAC;AACH,CAAC;AAYD,MAAM,UAAU,gBAAgB,CAAC,CAAY,EAAE,CAAY;IACzD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC1D,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxD,OAAO,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,WAAW,CAAC;AAC1D,CAAC"}

package/dist/core/logger.d.ts

@@ -0,0 +1,16 @@
+interface LogContext {
+    [key: string]: any;
+}
+declare class Logger {
+    private prefix;
+    private debugEnabled;
+    constructor(prefix?: string);
+    private format;
+    info(message: string, context?: LogContext): void;
+    warn(message: string, context?: LogContext): void;
+    error(message: string, error?: Error | any, context?: LogContext): void;
+    debug(message: string, context?: LogContext): void;
+}
+export declare const logger: Logger;
+export {};
+//# sourceMappingURL=logger.d.ts.map

package/dist/core/logger.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logger.d.ts","sourceRoot":"","sources":["../../core/logger.ts"],"names":[],"mappings":"AAEA,UAAU,UAAU;IAClB,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC;CACpB;AAED,cAAM,MAAM;IACV,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,YAAY,CAAU;gBAElB,MAAM,GAAE,MAAiB;IAKrC,OAAO,CAAC,MAAM;IAMd,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,UAAU,GAAG,IAAI;IAIjD,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,UAAU,GAAG,IAAI;IAIjD,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,KAAK,GAAG,GAAG,EAAE,OAAO,CAAC,EAAE,UAAU,GAAG,IAAI;IASvE,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,UAAU,GAAG,IAAI;CAKnD;AAED,eAAO,MAAM,MAAM,QAAe,CAAC"}

package/dist/core/logger.js

@@ -0,0 +1,34 @@
+class Logger {
+    prefix;
+    debugEnabled;
+    constructor(prefix = 'squish') {
+        this.prefix = prefix;
+        this.debugEnabled = process.env.DEBUG === 'true' || process.env.DEBUG === '1';
+    }
+    format(level, message, context) {
+        const timestamp = new Date().toISOString();
+        const ctx = context ? ` ${JSON.stringify(context)}` : '';
+        return `[${this.prefix}:${level}] ${message}${ctx}`;
+    }
+    info(message, context) {
+        console.error(this.format('info', message, context));
+    }
+    warn(message, context) {
+        console.error(this.format('warn', message, context));
+    }
+    error(message, error, context) {
+        const errorMsg = error instanceof Error ? error.message : error;
+        const ctx = { ...context, error: errorMsg };
+        console.error(this.format('error', message, ctx));
+        if (error instanceof Error && error.stack) {
+            console.error(error.stack);
+        }
+    }
+    debug(message, context) {
+        if (this.debugEnabled) {
+            console.error(this.format('debug', message, context));
+        }
+    }
+}
+export const logger = new Logger();
+//# sourceMappingURL=logger.js.map

package/dist/core/logger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"logger.js","sourceRoot":"","sources":["../../core/logger.ts"],"names":[],"mappings":"AAMA,MAAM,MAAM;IACF,MAAM,CAAS;IACf,YAAY,CAAU;IAE9B,YAAY,SAAiB,QAAQ;QACnC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,KAAK,MAAM,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC;IAChF,CAAC;IAEO,MAAM,CAAC,KAAe,EAAE,OAAe,EAAE,OAAoB;QACnE,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAC3C,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACzD,OAAO,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,KAAK,OAAO,GAAG,GAAG,EAAE,CAAC;IACtD,CAAC;IAED,IAAI,CAAC,OAAe,EAAE,OAAoB;QACxC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,IAAI,CAAC,OAAe,EAAE,OAAoB;QACxC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,KAAK,CAAC,OAAe,EAAE,KAAmB,EAAE,OAAoB;QAC9D,MAAM,QAAQ,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC;QAChE,MAAM,GAAG,GAAG,EAAE,GAAG,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;QAC5C,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QAClD,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC1C,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,KAAK,CAAC,OAAe,EAAE,OAAoB;QACzC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;CACF;AAED,MAAM,CAAC,MAAM,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC"}

package/dist/core/memory/bridge-discovery.d.ts

@@ -0,0 +1,50 @@
+/**
+ * Bridge Discovery
+ * Discovers indirect connections between memories through shared associations
+ * Uses bidirectional BFS with Dijkstra-style weight prioritization
+ * Finds "waypoint" memories that connect otherwise distant memory clusters
+ */
+export interface BridgePath {
+    route: string[];
+    distance: number;
+    weight: number;
+    associationTypes: string[];
+}
+export interface BridgeMemory {
+    memoryId: string;
+    memory: any;
+    bridgeScore: number;
+    pathsThrough: number;
+    examplePaths: BridgePath[];
+    connectionDensity: number;
+    importance: 'critical' | 'major' | 'minor';
+}
+export interface BridgeOptions {
+    maxPathLength?: number;
+    topBridges?: number;
+    minPathWeight?: number;
+    includeExamplePaths?: boolean;
+}
+/**
+ * Discover bridge memories connecting seed memory clusters
+ */
+export declare function discoverBridges(seedMemoryIds: string[], projectId: string, options?: BridgeOptions): Promise<BridgeMemory[]>;
+/**
+ * Get bridge memories for a single memory (find what it connects to)
+ */
+export declare function getMemoryBridges(memoryId: string, projectId: string, topK?: number): Promise<BridgeMemory[]>;
+/**
+ * Analyze overall network connectivity using bridge metrics
+ */
+export declare function analyzeNetworkConnectivity(projectId: string, topBridges?: number): Promise<{
+    totalMemories: number;
+    totalConnections: number;
+    averageDegree: number;
+    bridgeMemories: BridgeMemory[];
+    networkDensity: number;
+    clustering: {
+        tightClusters: number;
+        looseClusters: number;
+    };
+}>;
+//# sourceMappingURL=bridge-discovery.d.ts.map

package/dist/core/memory/bridge-discovery.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bridge-discovery.d.ts","sourceRoot":"","sources":["../../../core/memory/bridge-discovery.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,gBAAgB,EAAE,MAAM,EAAE,CAAC;CAC5B;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,GAAG,CAAC;IACZ,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,UAAU,EAAE,CAAC;IAC3B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,UAAU,EAAE,UAAU,GAAG,OAAO,GAAG,OAAO,CAAC;CAC5C;AAED,MAAM,WAAW,aAAa;IAC5B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,mBAAmB,CAAC,EAAE,OAAO,CAAC;CAC/B;AAED;;GAEG;AACH,wBAAsB,eAAe,CACnC,aAAa,EAAE,MAAM,EAAE,EACvB,SAAS,EAAE,MAAM,EACjB,OAAO,GAAE,aAAkB,GAC1B,OAAO,CAAC,YAAY,EAAE,CAAC,CAqJzB;AAqED;;GAEG;AACH,wBAAsB,gBAAgB,CACpC,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EACjB,IAAI,GAAE,MAAU,GACf,OAAO,CAAC,YAAY,EAAE,CAAC,CAkCzB;AAED;;GAEG;AACH,wBAAsB,0BAA0B,CAC9C,SAAS,EAAE,MAAM,EACjB,UAAU,GAAE,MAAW,GACtB,OAAO,CAAC;IACT,aAAa,EAAE,MAAM,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,MAAM,CAAC;IACtB,cAAc,EAAE,YAAY,EAAE,CAAC;IAC/B,cAAc,EAAE,MAAM,CAAC;IACvB,UAAU,EAAE;QACV,aAAa,EAAE,MAAM,CAAC;QACtB,aAAa,EAAE,MAAM,CAAC;KACvB,CAAC;CACH,CAAC,CA0ED"}

package/dist/core/memory/bridge-discovery.js

@@ -0,0 +1,291 @@
+/**
+ * Bridge Discovery
+ * Discovers indirect connections between memories through shared associations
+ * Uses bidirectional BFS with Dijkstra-style weight prioritization
+ * Finds "waypoint" memories that connect otherwise distant memory clusters
+ */
+import { getDb } from '../../db/index.js';
+import { getSchema } from '../../db/schema.js';
+import { eq } from 'drizzle-orm';
+import { logger } from '../../core/logger.js';
+/**
+ * Discover bridge memories connecting seed memory clusters
+ */
+export async function discoverBridges(seedMemoryIds, projectId, options = {}) {
+    if (seedMemoryIds.length < 2) {
+        return [];
+    }
+    const maxPathLength = options.maxPathLength ?? 4;
+    const topBridges = options.topBridges ?? 10;
+    const minPathWeight = options.minPathWeight ?? 1;
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        // Fetch all associations for this project
+        const allMemories = await db
+            .select()
+            .from(schema.memories)
+            .where(eq(schema.memories.projectId, projectId));
+        const memoriesById = new Map(allMemories.map((m) => [m.id, m]));
+        // Get all associations
+        const associations = await db.select().from(schema.memoryAssociations);
+        // Build adjacency list graph
+        const graph = new Map();
+        for (const assoc of associations) {
+            if (!graph.has(assoc.fromMemoryId)) {
+                graph.set(assoc.fromMemoryId, []);
+            }
+            const edges = graph.get(assoc.fromMemoryId);
+            if (edges) {
+                edges.push({
+                    toId: assoc.toMemoryId,
+                    weight: assoc.weight || 1,
+                    type: assoc.associationType,
+                });
+            }
+        }
+        // Find all paths between seed memories
+        const pathMetrics = new Map();
+        const allPaths = [];
+        for (let i = 0; i < seedMemoryIds.length; i++) {
+            for (let j = i + 1; j < seedMemoryIds.length; j++) {
+                const start = seedMemoryIds[i];
+                const end = seedMemoryIds[j];
+                const paths = findPaths(graph, start, end, maxPathLength, minPathWeight);
+                for (const path of paths) {
+                    // Record intermediate nodes (not start or end)
+                    for (let k = 1; k < path.route.length - 1; k++) {
+                        const nodeId = path.route[k];
+                        if (!pathMetrics.has(nodeId)) {
+                            pathMetrics.set(nodeId, { pathsThrough: 0, weight: 0 });
+                        }
+                        const metrics = pathMetrics.get(nodeId);
+                        metrics.pathsThrough++;
+                        metrics.weight += path.weight;
+                    }
+                    if (options.includeExamplePaths !== false) {
+                        allPaths.push(path);
+                    }
+                }
+            }
+        }
+        // Calculate bridge scores and convert to BridgeMemory objects
+        const bridges = [];
+        for (const [memoryId, metrics] of pathMetrics.entries()) {
+            const memory = memoriesById.get(memoryId);
+            if (!memory)
+                continue;
+            // Calculate betweenness centrality normalized to 0-100
+            const bridgeScore = Math.min(100, (metrics.pathsThrough / (seedMemoryIds.length * (seedMemoryIds.length - 1))) * 1000);
+            // Calculate connection density: how many unique memories it connects
+            const connectedMemories = new Set();
+            const neighbors = graph.get(memoryId) || [];
+            for (const neighbor of neighbors) {
+                connectedMemories.add(neighbor.toId);
+            }
+            // Include reverse connections
+            for (const [fromId, edges] of graph.entries()) {
+                for (const edge of edges) {
+                    if (edge.toId === memoryId && fromId !== memoryId) {
+                        connectedMemories.add(fromId);
+                    }
+                }
+            }
+            const connectionDensity = connectedMemories.size / Math.max(1, allMemories.length);
+            // Determine importance level
+            let importance;
+            if (bridgeScore >= 50) {
+                importance = 'critical';
+            }
+            else if (bridgeScore >= 20) {
+                importance = 'major';
+            }
+            else {
+                importance = 'minor';
+            }
+            // Get example paths through this bridge
+            const examplePaths = allPaths
+                .filter((p) => p.route.includes(memoryId) &&
+                p.route.length > 1)
+                .slice(0, 3);
+            bridges.push({
+                memoryId,
+                memory,
+                bridgeScore,
+                pathsThrough: metrics.pathsThrough,
+                examplePaths,
+                connectionDensity: Math.round(connectionDensity * 1000) / 1000,
+                importance,
+            });
+        }
+        // Sort by bridge score descending
+        bridges.sort((a, b) => b.bridgeScore - a.bridgeScore);
+        logger.debug('Bridges discovered', {
+            seedMemoryCount: seedMemoryIds.length,
+            bridgeCount: bridges.length,
+            topBridges: bridges.slice(0, topBridges).map((b) => ({
+                id: b.memoryId,
+                score: b.bridgeScore,
+                importance: b.importance,
+            })),
+        });
+        return bridges.slice(0, topBridges);
+    }
+    catch (error) {
+        logger.error('Error discovering bridges', error);
+        return [];
+    }
+}
+/**
+ * Find all shortest paths between two memories up to maxLength
+ * Uses BFS with weight-based distance metric
+ */
+function findPaths(graph, start, end, maxLength, minWeight) {
+    const paths = [];
+    const queue = [{ current: start, route: [start], weight: 0, types: [] }];
+    const visited = new Set();
+    while (queue.length > 0) {
+        const { current, route, weight, types } = queue.shift();
+        // Stop if we've exceeded max path length
+        if (route.length > maxLength)
+            continue;
+        // Skip if already visited in shorter path
+        const routeKey = route.join('->');
+        if (visited.has(routeKey))
+            continue;
+        visited.add(routeKey);
+        // Check if we reached the destination
+        if (current === end && route.length > 1) {
+            paths.push({
+                route,
+                distance: route.length - 1,
+                weight,
+                associationTypes: types,
+            });
+            continue;
+        }
+        // Explore neighbors
+        const neighbors = graph.get(current) || [];
+        for (const neighbor of neighbors) {
+            // Skip if creating a cycle (except for final destination)
+            if (neighbor.toId !== end && route.includes(neighbor.toId))
+                continue;
+            // Skip if weight below threshold
+            if (neighbor.weight < minWeight)
+                continue;
+            queue.push({
+                current: neighbor.toId,
+                route: [...route, neighbor.toId],
+                weight: weight + neighbor.weight,
+                types: [...types, neighbor.type],
+            });
+        }
+    }
+    // Sort by weight (distance metric) and keep top paths
+    paths.sort((a, b) => b.weight - a.weight);
+    return paths.slice(0, 5); // Return top 5 paths
+}
+/**
+ * Get bridge memories for a single memory (find what it connects to)
+ */
+export async function getMemoryBridges(memoryId, projectId, topK = 5) {
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        // Find memories connected to this one
+        const associations = await db
+            .select()
+            .from(schema.memoryAssociations)
+            .where(eq(schema.memoryAssociations.fromMemoryId, memoryId));
+        if (associations.length === 0) {
+            return [];
+        }
+        // Get connected memory IDs
+        const connectedIds = new Set();
+        for (const assoc of associations) {
+            connectedIds.add(assoc.toMemoryId);
+        }
+        if (connectedIds.size < 2) {
+            return [];
+        }
+        // Discover bridges between connected memories
+        const seedIds = Array.from(connectedIds);
+        const bridges = await discoverBridges(seedIds, projectId, { topBridges: topK });
+        return bridges;
+    }
+    catch (error) {
+        logger.error('Error getting memory bridges', error);
+        return [];
+    }
+}
+/**
+ * Analyze overall network connectivity using bridge metrics
+ */
+export async function analyzeNetworkConnectivity(projectId, topBridges = 20) {
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        // Get all memories
+        const allMemories = await db
+            .select()
+            .from(schema.memories)
+            .where(eq(schema.memories.projectId, projectId));
+        if (allMemories.length < 2) {
+            return {
+                totalMemories: allMemories.length,
+                totalConnections: 0,
+                averageDegree: 0,
+                bridgeMemories: [],
+                networkDensity: 0,
+                clustering: { tightClusters: 0, looseClusters: 0 },
+            };
+        }
+        // Get all associations
+        const associations = await db.select().from(schema.memoryAssociations);
+        // Calculate graph metrics
+        const degree = new Map();
+        for (const memory of allMemories) {
+            degree.set(memory.id, 0);
+        }
+        for (const assoc of associations) {
+            degree.set(assoc.fromMemoryId, (degree.get(assoc.fromMemoryId) || 0) + 1);
+        }
+        const avgDegree = Array.from(degree.values()).reduce((a, b) => a + b, 0) / allMemories.length;
+        const networkDensity = (associations.length * 2) / (allMemories.length * (allMemories.length - 1));
+        // Discover bridges for all memories
+        const seedIds = allMemories.slice(0, Math.min(10, allMemories.length)).map((m) => m.id);
+        const bridges = await discoverBridges(seedIds, projectId, { topBridges });
+        // Cluster analysis based on connectivity
+        let tightClusters = 0;
+        let looseClusters = 0;
+        for (const memory of allMemories) {
+            const connectionCount = degree.get(memory.id) || 0;
+            if (connectionCount > avgDegree * 1.5) {
+                tightClusters++;
+            }
+            else if (connectionCount < avgDegree * 0.5) {
+                looseClusters++;
+            }
+        }
+        return {
+            totalMemories: allMemories.length,
+            totalConnections: associations.length,
+            averageDegree: Math.round(avgDegree * 100) / 100,
+            bridgeMemories: bridges,
+            networkDensity: Math.round(networkDensity * 10000) / 10000,
+            clustering: { tightClusters, looseClusters },
+        };
+    }
+    catch (error) {
+        logger.error('Error analyzing network connectivity', error);
+        return {
+            totalMemories: 0,
+            totalConnections: 0,
+            averageDegree: 0,
+            bridgeMemories: [],
+            networkDensity: 0,
+            clustering: { tightClusters: 0, looseClusters: 0 },
+        };
+    }
+}
+//# sourceMappingURL=bridge-discovery.js.map

package/dist/core/memory/bridge-discovery.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bridge-discovery.js","sourceRoot":"","sources":["../../../core/memory/bridge-discovery.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,EAAE,EAAE,MAAM,aAAa,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AA0B9C;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,aAAuB,EACvB,SAAiB,EACjB,UAAyB,EAAE;IAE3B,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,CAAC,CAAC;IACjD,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC;IAC5C,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,CAAC,CAAC;IAEjD,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,0CAA0C;QAC1C,MAAM,WAAW,GAAG,MAAO,EAAU;aAClC,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;QAEnD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAErE,uBAAuB;QACvB,MAAM,YAAY,GAAG,MAAO,EAAU,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;QAEhF,6BAA6B;QAC7B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAiE,CAAC;QAEvF,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC;gBACnC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;YACpC,CAAC;YACD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;YAC5C,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,CAAC,IAAI,CAAC;oBACT,IAAI,EAAE,KAAK,CAAC,UAAU;oBACtB,MAAM,EAAE,KAAK,CAAC,MAAM,IAAI,CAAC;oBACzB,IAAI,EAAE,KAAK,CAAC,eAAe;iBAC5B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoD,CAAC;QAChF,MAAM,QAAQ,GAAiB,EAAE,CAAC;QAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClD,MAAM,KAAK,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;gBAC/B,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;gBAE7B,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;gBAEzE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,+CAA+C;oBAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBAC7B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;4BAC7B,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;wBAC1D,CAAC;wBACD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;wBACzC,OAAO,CAAC,YAAY,EAAE,CAAC;wBACvB,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;oBAChC,CAAC;oBAED,IAAI,OAAO,CAAC,mBAAmB,KAAK,KAAK,EAAE,CAAC;wBAC1C,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACtB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,MAAM,OAAO,GAAmB,EAAE,CAAC;QAEnC,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YACxD,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,MAAM;gBAAE,SAAS;YAEtB,uDAAuD;YACvD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAC1B,GAAG,EACH,CAAC,OAAO,CAAC,YAAY,GAAG,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CACpF,CAAC;YAEF,qEAAqE;YACrE,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAC;YAC5C,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YAC5C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACvC,CAAC;YACD,8BAA8B;YAC9B,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;wBAClD,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAChC,CAAC;gBACH,CAAC;YACH,CAAC;YAED,MAAM,iBAAiB,GAAG,iBAAiB,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;YAEnF,6BAA6B;YAC7B,IAAI,UAA0C,CAAC;YAC/C,IAAI,WAAW,IAAI,EAAE,EAAE,CAAC;gBACtB,UAAU,GAAG,UAAU,CAAC;YAC1B,CAAC;iBAAM,IAAI,WAAW,IAAI,EAAE,EAAE,CAAC;gBAC7B,UAAU,GAAG,OAAO,CAAC;YACvB,CAAC;iBAAM,CAAC;gBACN,UAAU,GAAG,OAAO,CAAC;YACvB,CAAC;YAED,wCAAwC;YACxC,MAAM,YAAY,GAAG,QAAQ;iBAC1B,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;gBAC1B,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CACrB;iBACA,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAEf,OAAO,CAAC,IAAI,CAAC;gBACX,QAAQ;gBACR,MAAM;gBACN,WAAW;gBACX,YAAY,EAAE,OAAO,CAAC,YAAY;gBAClC,YAAY;gBACZ,iBAAiB,EAAE,IAAI,CAAC,KAAK,CAAC,iBAAiB,GAAG,IAAI,CAAC,GAAG,IAAI;gBAC9D,UAAU;aACX,CAAC,CAAC;QACL,CAAC;QAED,kCAAkC;QAClC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QAEtD,MAAM,CAAC,KAAK,CAAC,oBAAoB,EAAE;YACjC,eAAe,EAAE,aAAa,CAAC,MAAM;YACrC,WAAW,EAAE,OAAO,CAAC,MAAM;YAC3B,UAAU,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACnD,EAAE,EAAE,CAAC,CAAC,QAAQ;gBACd,KAAK,EAAE,CAAC,CAAC,WAAW;gBACpB,UAAU,EAAE,CAAC,CAAC,UAAU;aACzB,CAAC,CAAC;SACJ,CAAC,CAAC;QAEH,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IACtC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,2BAA2B,EAAE,KAAK,CAAC,CAAC;QACjD,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAChB,KAAyE,EACzE,KAAa,EACb,GAAW,EACX,SAAiB,EACjB,SAAiB;IAEjB,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,MAAM,KAAK,GAKL,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;IAEjE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAEzD,yCAAyC;QACzC,IAAI,KAAK,CAAC,MAAM,GAAG,SAAS;YAAE,SAAS;QAEvC,0CAA0C;QAC1C,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,SAAS;QACpC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEtB,sCAAsC;QACtC,IAAI,OAAO,KAAK,GAAG,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC;gBACT,KAAK;gBACL,QAAQ,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC;gBAC1B,MAAM;gBACN,gBAAgB,EAAE,KAAK;aACxB,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,oBAAoB;QACpB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAE3C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,0DAA0D;YAC1D,IAAI,QAAQ,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,SAAS;YAErE,iCAAiC;YACjC,IAAI,QAAQ,CAAC,MAAM,GAAG,SAAS;gBAAE,SAAS;YAE1C,KAAK,CAAC,IAAI,CAAC;gBACT,OAAO,EAAE,QAAQ,CAAC,IAAI;gBACtB,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC;gBAChC,MAAM,EAAE,MAAM,GAAG,QAAQ,CAAC,MAAM;gBAChC,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC;aACjC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,sDAAsD;IACtD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAC1C,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,qBAAqB;AACjD,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,QAAgB,EAChB,SAAiB,EACjB,OAAe,CAAC;IAEhB,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,sCAAsC;QACtC,MAAM,YAAY,GAAG,MAAO,EAAU;aACnC,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC;aAC/B,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,kBAAkB,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC;QAE/D,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,2BAA2B;QAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACrC,CAAC;QAED,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,8CAA8C;QAC9C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,MAAM,eAAe,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;QAEhF,OAAO,OAAO,CAAC;IACjB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,8BAA8B,EAAE,KAAK,CAAC,CAAC;QACpD,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,0BAA0B,CAC9C,SAAiB,EACjB,aAAqB,EAAE;IAYvB,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,mBAAmB;QACnB,MAAM,WAAW,GAAG,MAAO,EAAU;aAClC,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;QAEnD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO;gBACL,aAAa,EAAE,WAAW,CAAC,MAAM;gBACjC,gBAAgB,EAAE,CAAC;gBACnB,aAAa,EAAE,CAAC;gBAChB,cAAc,EAAE,EAAE;gBAClB,cAAc,EAAE,CAAC;gBACjB,UAAU,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE;aACnD,CAAC;QACJ,CAAC;QAED,uBAAuB;QACvB,MAAM,YAAY,GAAG,MAAO,EAAU,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;QAEhF,0BAA0B;QAC1B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3B,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5E,CAAC;QAED,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC;QAC9F,MAAM,cAAc,GAAG,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAEnG,oCAAoC;QACpC,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7F,MAAM,OAAO,GAAG,MAAM,eAAe,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;QAE1E,yCAAyC;QACzC,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;YACjC,MAAM,eAAe,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACnD,IAAI,eAAe,GAAG,SAAS,GAAG,GAAG,EAAE,CAAC;gBACtC,aAAa,EAAE,CAAC;YAClB,CAAC;iBAAM,IAAI,eAAe,GAAG,SAAS,GAAG,GAAG,EAAE,CAAC;gBAC7C,aAAa,EAAE,CAAC;YAClB,CAAC;QACH,CAAC;QAED,OAAO;YACL,aAAa,EAAE,WAAW,CAAC,MAAM;YACjC,gBAAgB,EAAE,YAAY,CAAC,MAAM;YACrC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,GAAG,GAAG;YAChD,cAAc,EAAE,OAAO;YACvB,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,GAAG,KAAK;YAC1D,UAAU,EAAE,EAAE,aAAa,EAAE,aAAa,EAAE;SAC7C,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,sCAAsC,EAAE,KAAK,CAAC,CAAC;QAC5D,OAAO;YACL,aAAa,EAAE,CAAC;YAChB,gBAAgB,EAAE,CAAC;YACnB,aAAa,EAAE,CAAC;YAChB,cAAc,EAAE,EAAE;YAClB,cAAc,EAAE,CAAC;YACjB,UAAU,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE;SACnD,CAAC;IACJ,CAAC;AACH,CAAC"}

package/dist/core/memory/entity-extractor.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Entity Extractor
+ * Extracts named entities from memory content
+ * Supports people, files, functions, dates, locations, concepts, tools, and patterns
+ */
+export type EntityType = 'person' | 'file' | 'function' | 'class' | 'concept' | 'tool' | 'date' | 'location' | 'pattern' | 'technique' | 'other';
+export interface ExtractedEntity {
+    name: string;
+    type: EntityType;
+    confidence: number;
+    startIndex: number;
+    endIndex: number;
+    context: string;
+    normalized?: string;
+}
+/**
+ * Extract entities from content
+ */
+export declare function extractEntities(content: string): Promise<ExtractedEntity[]>;
+/**
+ * Link extracted entities to memory records
+ * Creates entity records in the knowledge graph
+ */
+export declare function linkEntitiesToMemories(memoryId: string, entities: ExtractedEntity[]): Promise<void>;
+/**
+ * Get entities extracted from a memory based on properties
+ */
+export declare function getMemoryEntities(memoryId: string): Promise<ExtractedEntity[]>;
+/**
+ * Get all entities for a project
+ */
+export declare function getProjectEntities(projectId: string, type?: EntityType): Promise<any[]>;
+//# sourceMappingURL=entity-extractor.d.ts.map

package/dist/core/memory/entity-extractor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-extractor.d.ts","sourceRoot":"","sources":["../../../core/memory/entity-extractor.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAOH,MAAM,MAAM,UAAU,GAClB,QAAQ,GACR,MAAM,GACN,UAAU,GACV,OAAO,GACP,SAAS,GACT,MAAM,GACN,MAAM,GACN,UAAU,GACV,SAAS,GACT,WAAW,GACX,OAAO,CAAC;AAEZ,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,UAAU,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAsCD;;GAEG;AACH,wBAAsB,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC,CAgLjF;AAED;;;GAGG;AACH,wBAAsB,sBAAsB,CAC1C,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,eAAe,EAAE,GAC1B,OAAO,CAAC,IAAI,CAAC,CA2Df;AAED;;GAEG;AACH,wBAAsB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC,CA8BpF;AAED;;GAEG;AACH,wBAAsB,kBAAkB,CACtC,SAAS,EAAE,MAAM,EACjB,IAAI,CAAC,EAAE,UAAU,GAChB,OAAO,CAAC,GAAG,EAAE,CAAC,CAgBhB"}