fawn-memory 0.0.3

package/dist/rag/types.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Vector embedding representation
+ */
+export type Embedding = number[];
+/**
+ * A text chunk with its associated metadata
+ */
+export interface TextChunk {
+    /**
+     * The text content of the chunk
+     */
+    text: string;
+    /**
+     * Unique identifier for the chunk
+     */
+    id: string;
+    /**
+     * Optional metadata associated with the chunk
+     */
+    metadata?: Record<string, unknown>;
+}
+/**
+ * A chunk with its vector embedding
+ */
+export interface EmbeddedChunk extends TextChunk {
+    /**
+     * The vector embedding for this chunk
+     */
+    embedding: Embedding;
+}
+/**
+ * Result of a similarity search
+ */
+export interface SimilaritySearchResult {
+    /**
+     * The matched chunk
+     */
+    chunk: EmbeddedChunk;
+    /**
+     * Similarity score (0-1, where 1 is most similar)
+     */
+    score: number;
+}
+/**
+ * Configuration for text chunking
+ */
+export interface ChunkingConfig {
+    /**
+     * Maximum size of each chunk in characters
+     */
+    maxChunkSize: number;
+    /**
+     * Number of characters to overlap between chunks
+     */
+    overlap?: number;
+    /**
+     * Whether to split on sentence boundaries
+     */
+    splitOnSentences?: boolean;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/rag/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/rag/types.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,MAAM,EAAE,CAAC;AAEjC;;GAEG;AACH,MAAM,WAAW,SAAS;IACtB;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IACb;;OAEG;IACH,EAAE,EAAE,MAAM,CAAC;IACX;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACtC;AAED;;GAEG;AACH,MAAM,WAAW,aAAc,SAAQ,SAAS;IAC5C;;OAEG;IACH,SAAS,EAAE,SAAS,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACnC;;OAEG;IACH,KAAK,EAAE,aAAa,CAAC;IACrB;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC3B;;OAEG;IACH,YAAY,EAAE,MAAM,CAAC;IACrB;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;OAEG;IACH,gBAAgB,CAAC,EAAE,OAAO,CAAC;CAC9B"}

package/dist/rag/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/rag/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/rag/types.ts"],"names":[],"mappings":""}

package/dist/rag/vectorIndex.d.ts

@@ -0,0 +1,102 @@
+import type { Embedding } from './types.js';
+/**
+ * Abstract interface for vector index backends
+ */
+export interface VectorIndex {
+    /**
+     * Add embeddings to the index
+     */
+    add(embeddings: Embedding[]): void | Promise<void>;
+    /**
+     * Search for nearest neighbors
+     */
+    search(queryEmbedding: Embedding, k: number): {
+        indices: number[];
+        distances: number[];
+    } | Promise<{
+        indices: number[];
+        distances: number[];
+    }>;
+    /**
+     * Get the number of vectors in the index
+     */
+    size(): number;
+    /**
+     * Remove vectors by indices
+     */
+    remove(indices: number[]): void;
+    /**
+     * Clear all vectors from the index
+     */
+    clear(): void;
+    /**
+     * Save index to file (if supported)
+     */
+    write?(path: string): void;
+    /**
+     * Load index from file (if supported)
+     */
+    read?(path: string): void;
+}
+/**
+ * Brute-force vector index using cosine similarity
+ */
+export declare class BruteForceIndex implements VectorIndex {
+    private embeddings;
+    add(embeddings: Embedding[]): void;
+    search(queryEmbedding: Embedding, k: number): {
+        indices: number[];
+        distances: number[];
+    };
+    size(): number;
+    remove(indices: number[]): void;
+    clear(): void;
+    private cosineSimilarity;
+}
+/**
+ * FAISS-based vector index for fast approximate nearest neighbor search
+ */
+export declare class FAISSIndex implements VectorIndex {
+    private index;
+    private dimension;
+    private indexType;
+    constructor(dimension: number, indexType?: 'L2' | 'IP');
+    private initializeIndex;
+    add(embeddings: Embedding[]): void;
+    search(queryEmbedding: Embedding, k: number): {
+        indices: number[];
+        distances: number[];
+    };
+    size(): number;
+    remove(): void;
+    clear(): void;
+    write(path: string): void;
+    read(path: string): void;
+}
+/**
+ * HNSW-based vector index using pure TypeScript (works on all platforms)
+ */
+export declare class HNSWIndex implements VectorIndex {
+    private index;
+    private vectors;
+    private dimension;
+    private m;
+    private efConstruction;
+    private initPromise?;
+    constructor(dimension: number, m?: number, efConstruction?: number);
+    private ensureInitialized;
+    private initializeIndex;
+    add(embeddings: Embedding[]): Promise<void>;
+    search(queryEmbedding: Embedding, k: number): Promise<{
+        indices: number[];
+        distances: number[];
+    }>;
+    size(): number;
+    remove(): void;
+    clear(): void;
+}
+/**
+ * Factory function to create a vector index
+ */
+export declare function createVectorIndex(dimension: number, backend?: 'bruteforce' | 'faiss' | 'hnsw', indexType?: 'L2' | 'IP'): VectorIndex;
+//# sourceMappingURL=vectorIndex.d.ts.map

package/dist/rag/vectorIndex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vectorIndex.d.ts","sourceRoot":"","sources":["../../src/rag/vectorIndex.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE5C;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B;;OAEG;IACH,GAAG,CAAC,UAAU,EAAE,SAAS,EAAE,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEnD;;OAEG;IACH,MAAM,CAAC,cAAc,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,GAAG;QAAE,OAAO,EAAE,MAAM,EAAE,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,GAAG,OAAO,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;IAE/I;;OAEG;IACH,IAAI,IAAI,MAAM,CAAC;IAEf;;OAEG;IACH,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAEhC;;OAEG;IACH,KAAK,IAAI,IAAI,CAAC;IAEd;;OAEG;IACH,KAAK,CAAC,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAE3B;;OAEG;IACH,IAAI,CAAC,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;CAC3B;AAED;;GAEG;AACH,qBAAa,eAAgB,YAAW,WAAW;IACjD,OAAO,CAAC,UAAU,CAAmB;IAErC,GAAG,CAAC,UAAU,EAAE,SAAS,EAAE,GAAG,IAAI;IAIlC,MAAM,CAAC,cAAc,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,GAAG;QAAE,OAAO,EAAE,MAAM,EAAE,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE;IAgBxF,IAAI,IAAI,MAAM;IAId,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI;IAK/B,KAAK,IAAI,IAAI;IAIb,OAAO,CAAC,gBAAgB;CAiBzB;AAED;;GAEG;AACH,qBAAa,UAAW,YAAW,WAAW;IAC5C,OAAO,CAAC,KAAK,CAKX;IACF,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,SAAS,CAAc;gBAEnB,SAAS,EAAE,MAAM,EAAE,SAAS,GAAE,IAAI,GAAG,IAAW;IAM5D,OAAO,CAAC,eAAe;IAkBvB,GAAG,CAAC,UAAU,EAAE,SAAS,EAAE,GAAG,IAAI;IAgBlC,MAAM,CAAC,cAAc,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,GAAG;QAAE,OAAO,EAAE,MAAM,EAAE,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE;IAoBxF,IAAI,IAAI,MAAM;IAId,MAAM,IAAI,IAAI;IAOd,KAAK,IAAI,IAAI;IAKb,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAIzB,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;CAczB;AAED;;GAEG;AACH,qBAAa,SAAU,YAAW,WAAW;IAC3C,OAAO,CAAC,KAAK,CAGX;IACF,OAAO,CAAC,OAAO,CAAmB;IAClC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,CAAC,CAAS;IAClB,OAAO,CAAC,cAAc,CAAS;IAE/B,OAAO,CAAC,WAAW,CAAC,CAAgB;gBAExB,SAAS,EAAE,MAAM,EAAE,CAAC,GAAE,MAAW,EAAE,cAAc,GAAE,MAAY;YAO7D,iBAAiB;YAUjB,eAAe;IAavB,GAAG,CAAC,UAAU,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAyB3C,MAAM,CAAC,cAAc,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAiCvG,IAAI,IAAI,MAAM;IAId,MAAM,IAAI,IAAI;IAId,KAAK,IAAI,IAAI;CAOd;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,SAAS,EAAE,MAAM,EACjB,OAAO,GAAE,YAAY,GAAG,OAAO,GAAG,MAAqB,EACvD,SAAS,CAAC,EAAE,IAAI,GAAG,IAAI,GACtB,WAAW,CAQb"}

package/dist/rag/vectorIndex.js

@@ -0,0 +1,236 @@
+/**
+ * Brute-force vector index using cosine similarity
+ */
+export class BruteForceIndex {
+    embeddings = [];
+    add(embeddings) {
+        this.embeddings.push(...embeddings);
+    }
+    search(queryEmbedding, k) {
+        const scores = this.embeddings.map((embedding, index) => ({
+            index,
+            distance: 1 - this.cosineSimilarity(queryEmbedding, embedding) // Convert similarity to distance
+        }));
+        // Sort by distance (ascending - lower is better)
+        scores.sort((a, b) => a.distance - b.distance);
+        const topK = scores.slice(0, Math.min(k, scores.length));
+        return {
+            indices: topK.map(s => s.index),
+            distances: topK.map(s => s.distance)
+        };
+    }
+    size() {
+        return this.embeddings.length;
+    }
+    remove(indices) {
+        const indexSet = new Set(indices);
+        this.embeddings = this.embeddings.filter((_, index) => !indexSet.has(index));
+    }
+    clear() {
+        this.embeddings = [];
+    }
+    cosineSimilarity(a, b) {
+        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];
+        }
+        if (normA === 0 || normB === 0) {
+            return 0;
+        }
+        return dotProduct / (Math.sqrt(normA) * Math.sqrt(normB));
+    }
+}
+/**
+ * FAISS-based vector index for fast approximate nearest neighbor search
+ */
+export class FAISSIndex {
+    index;
+    dimension;
+    indexType;
+    constructor(dimension, indexType = 'L2') {
+        this.dimension = dimension;
+        this.indexType = indexType;
+        this.initializeIndex();
+    }
+    initializeIndex() {
+        try {
+            // Dynamic import to make faiss-node optional
+            // eslint-disable-next-line @typescript-eslint/no-require-imports
+            const faiss = require('faiss-node');
+            if (this.indexType === 'IP') {
+                this.index = new faiss.IndexFlatIP(this.dimension);
+            }
+            else {
+                this.index = new faiss.IndexFlatL2(this.dimension);
+            }
+        }
+        catch {
+            throw new Error('faiss-node is not installed. Install it with: pnpm add faiss-node');
+        }
+    }
+    add(embeddings) {
+        if (embeddings.length === 0) {
+            return;
+        }
+        // FAISS expects a flat array of numbers
+        for (const embedding of embeddings) {
+            if (embedding.length !== this.dimension) {
+                throw new Error(`Embedding dimension mismatch: expected ${this.dimension}, got ${embedding.length}`);
+            }
+            this.index.add(embedding);
+        }
+    }
+    search(queryEmbedding, k) {
+        if (queryEmbedding.length !== this.dimension) {
+            throw new Error(`Query embedding dimension mismatch: expected ${this.dimension}, got ${queryEmbedding.length}`);
+        }
+        if (this.size() === 0) {
+            return { indices: [], distances: [] };
+        }
+        const actualK = Math.min(k, this.size());
+        const results = this.index.search(queryEmbedding, actualK);
+        return {
+            indices: results.labels,
+            distances: results.distances
+        };
+    }
+    size() {
+        return this.index.ntotal();
+    }
+    remove() {
+        // FAISS doesn't support efficient deletion
+        // We would need to rebuild the index without those vectors
+        // For now, throw an error - we'll implement this if needed
+        throw new Error('Remove operation not supported by FAISS index. Use removeChunks on RAGIndex instead.');
+    }
+    clear() {
+        // Reinitialize the index
+        this.initializeIndex();
+    }
+    write(path) {
+        this.index.write(path);
+    }
+    read(path) {
+        try {
+            // eslint-disable-next-line @typescript-eslint/no-require-imports
+            const faiss = require('faiss-node');
+            if (this.indexType === 'IP') {
+                this.index = faiss.IndexFlatIP.read(path);
+            }
+            else {
+                this.index = faiss.IndexFlatL2.read(path);
+            }
+        }
+        catch (error) {
+            throw new Error(`Failed to read FAISS index from ${path}: ${error}`);
+        }
+    }
+}
+/**
+ * HNSW-based vector index using pure TypeScript (works on all platforms)
+ */
+export class HNSWIndex {
+    index;
+    vectors = []; // Track vectors since HNSW doesn't expose them
+    dimension;
+    m; // Number of connections per node
+    efConstruction; // Size of dynamic candidate list
+    initPromise;
+    constructor(dimension, m = 16, efConstruction = 200) {
+        this.dimension = dimension;
+        this.m = m;
+        this.efConstruction = efConstruction;
+        // Lazy initialization - will be called on first use
+    }
+    async ensureInitialized() {
+        if (this.index) {
+            return;
+        }
+        if (!this.initPromise) {
+            this.initPromise = this.initializeIndex();
+        }
+        await this.initPromise;
+    }
+    async initializeIndex() {
+        try {
+            // Dynamic import works in both CJS and ESM
+            const { HNSW } = await import('hnsw');
+            // HNSW(M, efConstruction, dimensions, metric)
+            this.index = new HNSW(this.m, this.efConstruction, this.dimension, 'cosine');
+        }
+        catch (err) {
+            throw new Error(`hnsw package is not installed or cannot be loaded. Install it with: pnpm add hnsw`);
+        }
+    }
+    async add(embeddings) {
+        if (embeddings.length === 0) {
+            return;
+        }
+        for (const embedding of embeddings) {
+            if (embedding.length !== this.dimension) {
+                throw new Error(`Embedding dimension mismatch: expected ${this.dimension}, got ${embedding.length}`);
+            }
+        }
+        // Ensure index is initialized
+        await this.ensureInitialized();
+        // Add to our vector list
+        this.vectors.push(...embeddings);
+        // Rebuild index with all vectors (HNSW requires full rebuild)
+        // Convert vectors to format HNSW expects: { id, vector }
+        const data = this.vectors.map((vector, id) => ({ id, vector }));
+        await this.index.buildIndex(data);
+    }
+    async search(queryEmbedding, k) {
+        if (queryEmbedding.length !== this.dimension) {
+            throw new Error(`Query embedding dimension mismatch: expected ${this.dimension}, got ${queryEmbedding.length}`);
+        }
+        if (this.size() === 0) {
+            return { indices: [], distances: [] };
+        }
+        // Ensure index is initialized
+        await this.ensureInitialized();
+        const actualK = Math.min(k, this.size());
+        // searchKNN returns array of {id, score} objects
+        const results = this.index.searchKNN(queryEmbedding, actualK);
+        const indices = [];
+        const distances = [];
+        for (const result of results) {
+            indices.push(result.id);
+            // HNSW returns score (higher is better for similarity)
+            // For consistency with our API, we return distance (lower is better)
+            // So we convert: distance = 1 - score
+            distances.push(1 - result.score);
+        }
+        return { indices, distances };
+    }
+    size() {
+        return this.vectors.length;
+    }
+    remove() {
+        throw new Error('Remove operation not supported by HNSW index.');
+    }
+    clear() {
+        this.vectors = [];
+        // Reset the index and initialization promise
+        this.index = undefined;
+        this.initPromise = undefined;
+        // Will be lazy loaded on next use
+    }
+}
+/**
+ * Factory function to create a vector index
+ */
+export function createVectorIndex(dimension, backend = 'bruteforce', indexType) {
+    if (backend === 'faiss') {
+        return new FAISSIndex(dimension, indexType || 'L2');
+    }
+    if (backend === 'hnsw') {
+        return new HNSWIndex(dimension);
+    }
+    return new BruteForceIndex();
+}
+//# sourceMappingURL=vectorIndex.js.map

package/dist/rag/vectorIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vectorIndex.js","sourceRoot":"","sources":["../../src/rag/vectorIndex.ts"],"names":[],"mappings":"AA0CA;;GAEG;AACH,MAAM,OAAO,eAAe;IAClB,UAAU,GAAgB,EAAE,CAAC;IAErC,GAAG,CAAC,UAAuB;QACzB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,CAAC,cAAyB,EAAE,CAAS;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACxD,KAAK;YACL,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,SAAS,CAAC,CAAC,iCAAiC;SACjG,CAAC,CAAC,CAAC;QAEJ,iDAAiD;QACjD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAE/C,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QACzD,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;YAC/B,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;SACrC,CAAC;IACJ,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;IAChC,CAAC;IAED,MAAM,CAAC,OAAiB;QACtB,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IAC/E,CAAC;IAED,KAAK;QACH,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IAEO,gBAAgB,CAAC,CAAY,EAAE,CAAY;QACjD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,CAAC,CAAC;QACX,CAAC;QAED,OAAO,UAAU,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5D,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,UAAU;IACb,KAAK,CAKX;IACM,SAAS,CAAS;IAClB,SAAS,CAAc;IAE/B,YAAY,SAAiB,EAAE,YAAyB,IAAI;QAC1D,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC;IAEO,eAAe;QACrB,IAAI,CAAC;YACH,6CAA6C;YAC7C,iEAAiE;YACjE,MAAM,KAAK,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;YAEpC,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACrD,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,IAAI,KAAK,CACb,mEAAmE,CACpE,CAAC;QACJ,CAAC;IACH,CAAC;IAED,GAAG,CAAC,UAAuB;QACzB,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO;QACT,CAAC;QAED,wCAAwC;QACxC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;gBACxC,MAAM,IAAI,KAAK,CACb,0CAA0C,IAAI,CAAC,SAAS,SAAS,SAAS,CAAC,MAAM,EAAE,CACpF,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,MAAM,CAAC,cAAyB,EAAE,CAAS;QACzC,IAAI,cAAc,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;YAC7C,MAAM,IAAI,KAAK,CACb,gDAAgD,IAAI,CAAC,SAAS,SAAS,cAAc,CAAC,MAAM,EAAE,CAC/F,CAAC;QACJ,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;QACxC,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;QAE3D,OAAO;YACL,OAAO,EAAE,OAAO,CAAC,MAAM;YACvB,SAAS,EAAE,OAAO,CAAC,SAAS;SAC7B,CAAC;IACJ,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;IAC7B,CAAC;IAED,MAAM;QACJ,2CAA2C;QAC3C,2DAA2D;QAC3D,2DAA2D;QAC3D,MAAM,IAAI,KAAK,CAAC,sFAAsF,CAAC,CAAC;IAC1G,CAAC;IAED,KAAK;QACH,yBAAyB;QACzB,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,IAAY;QAChB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,IAAI,CAAC,IAAY;QACf,IAAI,CAAC;YACH,iEAAiE;YACjE,MAAM,KAAK,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;YAEpC,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5C,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,mCAAmC,IAAI,KAAK,KAAK,EAAE,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,SAAS;IACZ,KAAK,CAGX;IACM,OAAO,GAAgB,EAAE,CAAC,CAAC,+CAA+C;IAC1E,SAAS,CAAS;IAClB,CAAC,CAAS,CAAC,iCAAiC;IAC5C,cAAc,CAAS,CAAC,iCAAiC;IAEzD,WAAW,CAAiB;IAEpC,YAAY,SAAiB,EAAE,IAAY,EAAE,EAAE,iBAAyB,GAAG;QACzE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,oDAAoD;IACtD,CAAC;IAEO,KAAK,CAAC,iBAAiB;QAC7B,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,OAAO;QACT,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QAC5C,CAAC;QACD,MAAM,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAEO,KAAK,CAAC,eAAe;QAC3B,IAAI,CAAC;YACH,2CAA2C;YAC3C,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,CAAC;YACtC,8CAA8C;YAC9C,IAAI,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC/E,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CACb,mFAAmF,CACpF,CAAC;QACJ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,UAAuB;QAC/B,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO;QACT,CAAC;QAED,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;gBACxC,MAAM,IAAI,KAAK,CACb,0CAA0C,IAAI,CAAC,SAAS,SAAS,SAAS,CAAC,MAAM,EAAE,CACpF,CAAC;YACJ,CAAC;QACH,CAAC;QAED,8BAA8B;QAC9B,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE/B,yBAAyB;QACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;QAEjC,8DAA8D;QAC9D,yDAAyD;QACzD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAChE,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,cAAyB,EAAE,CAAS;QAC/C,IAAI,cAAc,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;YAC7C,MAAM,IAAI,KAAK,CACb,gDAAgD,IAAI,CAAC,SAAS,SAAS,cAAc,CAAC,MAAM,EAAE,CAC/F,CAAC;QACJ,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;QACxC,CAAC;QAED,8BAA8B;QAC9B,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE/B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAEzC,iDAAiD;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;QAE9D,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACxB,uDAAuD;YACvD,qEAAqE;YACrE,sCAAsC;YACtC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;QAED,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;IAChC,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED,MAAM;QACJ,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;IACnE,CAAC;IAED,KAAK;QACH,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,6CAA6C;QAC7C,IAAI,CAAC,KAAK,GAAG,SAAgB,CAAC;QAC9B,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;QAC7B,kCAAkC;IACpC,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC/B,SAAiB,EACjB,UAA2C,YAAY,EACvD,SAAuB;IAEvB,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;QACxB,OAAO,IAAI,UAAU,CAAC,SAAS,EAAE,SAAS,IAAI,IAAI,CAAC,CAAC;IACtD,CAAC;IACD,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;QACvB,OAAO,IAAI,SAAS,CAAC,SAAS,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,IAAI,eAAe,EAAE,CAAC;AAC/B,CAAC"}

package/dist/utils/async.d.ts

@@ -0,0 +1,25 @@
+import type { Result } from "typechat";
+/**
+ * Call an async function with automatic retry in the case of exceptions
+ * @param asyncFn Use closures to pass parameters
+ * @param retryMaxAttempts maximum retry attempts. Default is 2
+ * @param retryPauseMs Pause between attempts. Default is 1000 ms. Uses exponential backoff
+ * @param shouldAbort (Optional) Inspect the error and abort
+ * @returns Result<T>
+ */
+export declare function callWithRetry<T = unknown>(asyncFn: () => Promise<T>, retryMaxAttempts?: number, retryPauseMs?: number, shouldAbort?: (error: unknown) => boolean | undefined): Promise<T>;
+/**
+ * Get a result by calling a function with automatic retry
+ * @param asyncFn
+ * @param retryMaxAttempts
+ * @param retryPauseMs
+ * @returns
+ */
+export declare function getResultWithRetry<T = unknown>(asyncFn: () => Promise<Result<T>>, retryMaxAttempts?: number, retryPauseMs?: number): Promise<Result<T>>;
+/**
+ * Pause for given # of ms before resuming async execution
+ * @param ms
+ * @returns
+ */
+export declare function pause(ms: number): Promise<void>;
+//# sourceMappingURL=async.d.ts.map

package/dist/utils/async.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"async.d.ts","sourceRoot":"","sources":["../../src/utils/async.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAEvC;;;;;;;GAOG;AACH,wBAAsB,aAAa,CAAC,CAAC,GAAG,OAAO,EAC3C,OAAO,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,EACzB,gBAAgB,GAAE,MAAU,EAC5B,YAAY,GAAE,MAAa,EAC3B,WAAW,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,OAAO,GAAG,SAAS,GACtD,OAAO,CAAC,CAAC,CAAC,CAiBZ;AAED;;;;;;GAMG;AACH,wBAAsB,kBAAkB,CAAC,CAAC,GAAG,OAAO,EAChD,OAAO,EAAE,MAAM,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EACjC,gBAAgB,GAAE,MAAU,EAC5B,YAAY,GAAE,MAAa,GAC5B,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAWpB;AAED;;;;GAIG;AACH,wBAAgB,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAE/C"}

package/dist/utils/async.js

@@ -0,0 +1,55 @@
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+/**
+ * Call an async function with automatic retry in the case of exceptions
+ * @param asyncFn Use closures to pass parameters
+ * @param retryMaxAttempts maximum retry attempts. Default is 2
+ * @param retryPauseMs Pause between attempts. Default is 1000 ms. Uses exponential backoff
+ * @param shouldAbort (Optional) Inspect the error and abort
+ * @returns Result<T>
+ */
+export async function callWithRetry(asyncFn, retryMaxAttempts = 2, retryPauseMs = 1000, shouldAbort) {
+    let retryCount = 0;
+    while (true) {
+        try {
+            return await asyncFn();
+        }
+        catch (e) {
+            if (retryCount >= retryMaxAttempts ||
+                (shouldAbort && shouldAbort(e))) {
+                throw e;
+            }
+        }
+        await pause(retryPauseMs);
+        retryCount++;
+        retryPauseMs *= 2; // Use exponential backoff for retries
+    }
+}
+/**
+ * Get a result by calling a function with automatic retry
+ * @param asyncFn
+ * @param retryMaxAttempts
+ * @param retryPauseMs
+ * @returns
+ */
+export async function getResultWithRetry(asyncFn, retryMaxAttempts = 2, retryPauseMs = 1000) {
+    let retryCount = 0;
+    while (true) {
+        const result = await asyncFn();
+        if (result.success || retryCount >= retryMaxAttempts) {
+            return result;
+        }
+        await pause(retryPauseMs);
+        retryCount++;
+        retryPauseMs *= 2; // Use exponential backoff for retries
+    }
+}
+/**
+ * Pause for given # of ms before resuming async execution
+ * @param ms
+ * @returns
+ */
+export function pause(ms) {
+    return new Promise((resolve) => setTimeout(resolve, ms));
+}
+//# sourceMappingURL=async.js.map

package/dist/utils/async.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"async.js","sourceRoot":"","sources":["../../src/utils/async.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAIlC;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAC/B,OAAyB,EACzB,mBAA2B,CAAC,EAC5B,eAAuB,IAAI,EAC3B,WAAqD;IAErD,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,OAAO,IAAI,EAAE,CAAC;QACV,IAAI,CAAC;YACD,OAAO,MAAM,OAAO,EAAE,CAAC;QAC3B,CAAC;QAAC,OAAO,CAAU,EAAE,CAAC;YAClB,IACI,UAAU,IAAI,gBAAgB;gBAC9B,CAAC,WAAW,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,EACjC,CAAC;gBACC,MAAM,CAAC,CAAC;YACZ,CAAC;QACL,CAAC;QACD,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC;QAC1B,UAAU,EAAE,CAAC;QACb,YAAY,IAAI,CAAC,CAAC,CAAC,sCAAsC;IAC7D,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACpC,OAAiC,EACjC,mBAA2B,CAAC,EAC5B,eAAuB,IAAI;IAE3B,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,OAAO,IAAI,EAAE,CAAC;QACV,MAAM,MAAM,GAAG,MAAM,OAAO,EAAE,CAAC;QAC/B,IAAI,MAAM,CAAC,OAAO,IAAI,UAAU,IAAI,gBAAgB,EAAE,CAAC;YACnD,OAAO,MAAM,CAAC;QAClB,CAAC;QACD,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC;QAC1B,UAAU,EAAE,CAAC;QACb,YAAY,IAAI,CAAC,CAAC,CAAC,sCAAsC;IAC7D,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAC,EAAU;IAC5B,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;AAC7D,CAAC"}

package/dist/utils/string.d.ts

@@ -0,0 +1,3 @@
+export declare function stringCompare(x: string | undefined, y: string | undefined, caseSensitive: boolean): number;
+export declare function stringEquals(x: string | undefined, y: string | undefined, caseSensitive: boolean): boolean;
+//# sourceMappingURL=string.d.ts.map

package/dist/utils/string.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"string.d.ts","sourceRoot":"","sources":["../../src/utils/string.ts"],"names":[],"mappings":"AAIA,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS,EAAE,aAAa,EAAE,OAAO,GAAG,MAAM,CAQ1G;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS,EAAE,aAAa,EAAE,OAAO,GAAG,OAAO,CAE1G"}

package/dist/utils/string.js

@@ -0,0 +1,15 @@
+// TODO: Ask why Umesh did all this
+const caseInsensitiveOptions = { sensitivity: 'base' };
+export function stringCompare(x, y, caseSensitive) {
+    if (x === undefined) {
+        return y === undefined ? 0 : -1;
+    }
+    if (y === undefined) {
+        return 1;
+    }
+    return caseSensitive ? x.localeCompare(y) : x.localeCompare(y, undefined, caseInsensitiveOptions);
+}
+export function stringEquals(x, y, caseSensitive) {
+    return caseSensitive ? x === y : stringCompare(x, y, caseSensitive) === 0;
+}
+//# sourceMappingURL=string.js.map

package/dist/utils/string.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"string.js","sourceRoot":"","sources":["../../src/utils/string.ts"],"names":[],"mappings":"AAAA,mCAAmC;AAEnC,MAAM,sBAAsB,GAAyB,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;AAE7E,MAAM,UAAU,aAAa,CAAC,CAAqB,EAAE,CAAqB,EAAE,aAAsB;IAC9F,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACjB,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IACD,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QAClB,OAAO,CAAC,CAAC;IACb,CAAC;IACD,OAAO,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,EAAE,SAAS,EAAE,sBAAsB,CAAC,CAAC;AACtG,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,CAAqB,EAAE,CAAqB,EAAE,aAAsB;IAC7F,OAAO,aAAa,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC"}

package/package.json

@@ -0,0 +1,48 @@
+{
+  "name": "fawn-memory",
+  "version": "0.0.3",
+  "description": "",
+  "license": "MIT",
+  "type": "module",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "files": [
+    "dist"
+  ],
+  "scripts": {
+    "build": "tsc -p tsconfig.build.json",
+    "dev": "tsx src/index.ts",
+    "lint": "eslint .",
+    "clean": "rimraf dist",
+    "prepublishOnly": "pnpm run clean && pnpm run build"
+  },
+  "keywords": [],
+  "author": "hlucco",
+  "engines": {
+    "node": ">=18"
+  },
+  "packageManager": "pnpm@10.24.0+sha512.01ff8ae71b4419903b65c60fb2dc9d34cf8bb6e06d03bde112ef38f7a34d6904c424ba66bea5cdcf12890230bf39f9580473140ed9c946fef328b6e5238a345a",
+  "devDependencies": {
+    "@eslint/js": "^9.39.2",
+    "@types/node": "^25.0.2",
+    "@typescript-eslint/eslint-plugin": "^8.50.0",
+    "@typescript-eslint/parser": "^8.50.0",
+    "eslint": "^9.39.2",
+    "rimraf": "^6.1.2",
+    "tsx": "^4.21.0",
+    "typescript": "^5.9.3",
+    "typescript-eslint": "^8.50.0"
+  },
+  "dependencies": {
+    "@anthropic-ai/sdk": "^0.39.0",
+    "dotenv": "^17.2.3",
+    "natural": "^8.1.0",
+    "typechat": "^0.1.1",
+    "wink-lemmatizer": "^3.0.4",
+    "wordnet-db": "^3.1.14"
+  },
+  "optionalDependencies": {
+    "faiss-node": "^0.5.1",
+    "hnsw": "^1.0.3"
+  }
+}