bekindprofanityfilter 0.0.1

package/allprofanity.config.example.json

@@ -0,0 +1,35 @@
+{
+  "$schema": "./config.schema.json",
+  "algorithm": {
+    "matching": "hybrid",
+    "useAhoCorasick": true,
+    "useBloomFilter": true,
+    "useContextAnalysis": true
+  },
+  "bloomFilter": {
+    "enabled": true,
+    "expectedItems": 10000,
+    "falsePositiveRate": 0.01
+  },
+  "ahoCorasick": {
+    "enabled": true,
+    "prebuild": true
+  },
+  "contextAnalysis": {
+    "enabled": true,
+    "contextWindow": 50,
+    "languages": ["en"],
+    "scoreThreshold": 0.5
+  },
+  "profanityDetection": {
+    "enableLeetSpeak": true,
+    "caseSensitive": false,
+    "strictMode": false,
+    "detectPartialWords": false,
+    "defaultPlaceholder": "*"
+  },
+  "performance": {
+    "cacheSize": 1000,
+    "enableCaching": true
+  }
+}

package/bin/init.js

@@ -0,0 +1,49 @@
+#!/usr/bin/env node
+
+import { readFileSync, writeFileSync, existsSync } from 'fs';
+import { fileURLToPath } from 'url';
+import { dirname, join } from 'path';
+
+const __filename = fileURLToPath(import.meta.url);
+const __dirname = dirname(__filename);
+
+const configFileName = 'allprofanity.config.json';
+const schemaFileName = 'config.schema.json';
+
+// Check if config already exists
+if (existsSync(configFileName)) {
+  console.log(`❌ ${configFileName} already exists in current directory`);
+  console.log('   Delete it first or use a different name');
+  process.exit(1);
+}
+
+try {
+  // Copy example config to current directory
+  const examplePath = join(__dirname, '..', 'allprofanity.config.example.json');
+  const schemaPath = join(__dirname, '..', 'config.schema.json');
+
+  const configContent = readFileSync(examplePath, 'utf-8');
+  const schemaContent = readFileSync(schemaPath, 'utf-8');
+
+  writeFileSync(configFileName, configContent);
+  writeFileSync(schemaFileName, schemaContent);
+
+  console.log('✅ BeKind configuration files created!');
+  console.log('');
+  console.log('Created files:');
+  console.log(`  📄 ${configFileName} - Main configuration`);
+  console.log(`  📄 ${schemaFileName} - JSON schema for IDE autocomplete`);
+  console.log('');
+  console.log('Next steps:');
+  console.log('  1. Edit allprofanity.config.json to customize settings');
+  console.log('  2. Import and use:');
+  console.log('');
+  console.log('     import { BeKind } from "allprofanity";');
+  console.log('     import config from "./allprofanity.config.json";');
+  console.log('     const filter = BeKind.fromConfig(config);');
+  console.log('');
+
+} catch (error) {
+  console.error('❌ Error creating config files:', error.message);
+  process.exit(1);
+}

package/config.schema.json

@@ -0,0 +1,163 @@
+{
+  "$schema": "http://json-schema.org/draft-07/schema#",
+  "title": "BeKind Configuration",
+  "description": "Configuration schema for BeKind advanced algorithms and detection settings",
+  "type": "object",
+  "properties": {
+    "algorithm": {
+      "type": "object",
+      "description": "Algorithm selection and configuration",
+      "properties": {
+        "matching": {
+          "type": "string",
+          "enum": ["trie", "aho-corasick", "hybrid"],
+          "default": "trie",
+          "description": "Primary matching algorithm: trie (default), aho-corasick (faster for many patterns), or hybrid"
+        },
+        "useAhoCorasick": {
+          "type": "boolean",
+          "default": false,
+          "description": "Enable Aho-Corasick algorithm for multi-pattern matching"
+        },
+        "useBloomFilter": {
+          "type": "boolean",
+          "default": false,
+          "description": "Enable Bloom Filter for fast pre-filtering (reduces false positives)"
+        },
+        "useContextAnalysis": {
+          "type": "boolean",
+          "default": false,
+          "description": "Enable context-aware analysis to reduce false positives"
+        }
+      },
+      "required": ["matching"]
+    },
+    "bloomFilter": {
+      "type": "object",
+      "description": "Bloom filter configuration",
+      "properties": {
+        "enabled": {
+          "type": "boolean",
+          "default": false,
+          "description": "Enable/disable Bloom filter"
+        },
+        "expectedItems": {
+          "type": "number",
+          "minimum": 100,
+          "maximum": 1000000,
+          "default": 10000,
+          "description": "Expected number of items in the filter"
+        },
+        "falsePositiveRate": {
+          "type": "number",
+          "minimum": 0.001,
+          "maximum": 0.1,
+          "default": 0.01,
+          "description": "Acceptable false positive rate (0.01 = 1%)"
+        }
+      }
+    },
+    "ahoCorasick": {
+      "type": "object",
+      "description": "Aho-Corasick algorithm configuration",
+      "properties": {
+        "enabled": {
+          "type": "boolean",
+          "default": false,
+          "description": "Enable/disable Aho-Corasick algorithm"
+        },
+        "prebuild": {
+          "type": "boolean",
+          "default": true,
+          "description": "Prebuild the automaton at initialization (recommended for production)"
+        }
+      }
+    },
+    "contextAnalysis": {
+      "type": "object",
+      "description": "Context-aware analysis configuration",
+      "properties": {
+        "enabled": {
+          "type": "boolean",
+          "default": false,
+          "description": "Enable/disable context analysis"
+        },
+        "contextWindow": {
+          "type": "number",
+          "minimum": 10,
+          "maximum": 200,
+          "default": 50,
+          "description": "Number of characters to analyze before/after match"
+        },
+        "languages": {
+          "type": "array",
+          "items": {
+            "type": "string",
+            "enum": ["en", "hi", "fr", "de", "es", "bn", "ta", "te", "*"]
+          },
+          "default": ["en"],
+          "description": "Languages for context pattern matching"
+        },
+        "scoreThreshold": {
+          "type": "number",
+          "minimum": 0,
+          "maximum": 1,
+          "default": 0.5,
+          "description": "Minimum confidence score to flag as profanity (0-1)"
+        }
+      }
+    },
+    "profanityDetection": {
+      "type": "object",
+      "description": "Core profanity detection settings",
+      "properties": {
+        "enableLeetSpeak": {
+          "type": "boolean",
+          "default": true,
+          "description": "Enable leet-speak normalization (f#ck, 4ss, etc.)"
+        },
+        "caseSensitive": {
+          "type": "boolean",
+          "default": false,
+          "description": "Enable case-sensitive matching"
+        },
+        "strictMode": {
+          "type": "boolean",
+          "default": false,
+          "description": "Require word boundaries for matches"
+        },
+        "detectPartialWords": {
+          "type": "boolean",
+          "default": false,
+          "description": "Detect profanity within larger words"
+        },
+        "defaultPlaceholder": {
+          "type": "string",
+          "minLength": 1,
+          "maxLength": 1,
+          "default": "*",
+          "description": "Default character for censoring"
+        }
+      }
+    },
+    "performance": {
+      "type": "object",
+      "description": "Performance optimization settings",
+      "properties": {
+        "cacheSize": {
+          "type": "number",
+          "minimum": 0,
+          "maximum": 100000,
+          "default": 1000,
+          "description": "Size of result cache (0 = disabled)"
+        },
+        "enableCaching": {
+          "type": "boolean",
+          "default": false,
+          "description": "Enable result caching for repeated checks"
+        }
+      }
+    }
+  },
+  "required": ["algorithm", "profanityDetection"]
+}

package/dist/algos/aho-corasick.d.ts

@@ -0,0 +1,75 @@
+/**
+ * Aho-Corasick algorithm implementation for efficient multi-pattern string matching
+ */
+export interface Match {
+    pattern: string;
+    start: number;
+    end: number;
+    patternIndex: number;
+}
+export declare class AhoCorasick {
+    private root;
+    private patterns;
+    private compiled;
+    constructor(patterns?: string[]);
+    /**
+     * Create a new trie node
+     */
+    private createNode;
+    /**
+     * Add patterns to the automaton
+     */
+    addPatterns(patterns: string[]): void;
+    /**
+     * Add a single pattern to the automaton
+     */
+    addPattern(pattern: string): void;
+    /**
+     * Build the Aho-Corasick automaton
+     */
+    private buildAutomaton;
+    /**
+     * Build the trie structure
+     */
+    private buildTrie;
+    /**
+     * Build failure links using BFS
+     */
+    private buildFailureLinks;
+    /**
+     * Build output links for failure transitions
+     */
+    private buildOutputLinks;
+    /**
+     * Find all pattern matches in the given text
+     */
+    findAll(text: string): Match[];
+    /**
+     * Check if text contains any patterns
+     */
+    hasMatch(text: string): boolean;
+    /**
+     * Find first match in text
+     */
+    findFirst(text: string): Match | null;
+    /**
+     * Get the patterns stored in this automaton
+     */
+    getPatterns(): string[];
+    /**
+     * Clear all patterns and reset the automaton
+     */
+    clear(): void;
+    /**
+     * Get statistics about the automaton
+     */
+    getStats(): {
+        patternCount: number;
+        nodeCount: number;
+        averagePatternLength: number;
+    };
+    /**
+     * Count total nodes in the trie
+     */
+    private countNodes;
+}

package/dist/algos/aho-corasick.js

@@ -0,0 +1,238 @@
+/**
+ * Aho-Corasick algorithm implementation for efficient multi-pattern string matching
+ */
+export class AhoCorasick {
+    constructor(patterns = []) {
+        this.compiled = false;
+        this.patterns = [...patterns];
+        this.root = this.createNode();
+        if (patterns.length > 0) {
+            this.buildAutomaton();
+        }
+    }
+    /**
+     * Create a new trie node
+     */
+    createNode() {
+        return {
+            children: new Map(),
+            output: [],
+            outputIndices: [],
+            failure: null,
+            isEndOfPattern: false,
+        };
+    }
+    /**
+     * Add patterns to the automaton
+     */
+    addPatterns(patterns) {
+        this.patterns.push(...patterns);
+        this.compiled = false;
+    }
+    /**
+     * Add a single pattern to the automaton
+     */
+    addPattern(pattern) {
+        if (pattern && pattern.length > 0) {
+            this.patterns.push(pattern);
+            this.compiled = false;
+        }
+    }
+    /**
+     * Build the Aho-Corasick automaton
+     */
+    buildAutomaton() {
+        this.buildTrie();
+        this.buildFailureLinks();
+        this.buildOutputLinks();
+        this.compiled = true;
+    }
+    /**
+     * Build the trie structure
+     */
+    buildTrie() {
+        this.root = this.createNode();
+        for (let i = 0; i < this.patterns.length; i++) {
+            const pattern = this.patterns[i];
+            let current = this.root;
+            for (const char of pattern) {
+                if (!current.children.has(char)) {
+                    current.children.set(char, this.createNode());
+                }
+                current = current.children.get(char);
+            }
+            current.isEndOfPattern = true;
+            current.output.push(pattern);
+            current.outputIndices.push(i);
+        }
+    }
+    /**
+     * Build failure links using BFS
+     */
+    buildFailureLinks() {
+        const queue = [];
+        // Initialize failure links for depth 1 nodes
+        for (const child of this.root.children.values()) {
+            child.failure = this.root;
+            queue.push(child);
+        }
+        // Build failure links for deeper nodes
+        while (queue.length > 0) {
+            const current = queue.shift();
+            for (const [char, child] of current.children) {
+                queue.push(child);
+                let failure = current.failure;
+                while (failure !== null && !failure.children.has(char)) {
+                    failure = failure.failure;
+                }
+                child.failure = failure ? failure.children.get(char) : this.root;
+            }
+        }
+    }
+    /**
+     * Build output links for failure transitions
+     */
+    buildOutputLinks() {
+        const queue = [];
+        for (const child of this.root.children.values()) {
+            queue.push(child);
+        }
+        while (queue.length > 0) {
+            const current = queue.shift();
+            // Add failure node outputs to current node
+            if (current.failure && current.failure.output.length > 0) {
+                current.output.push(...current.failure.output);
+                current.outputIndices.push(...current.failure.outputIndices);
+            }
+            for (const child of current.children.values()) {
+                queue.push(child);
+            }
+        }
+    }
+    /**
+     * Find all pattern matches in the given text
+     */
+    findAll(text) {
+        if (!this.compiled) {
+            this.buildAutomaton();
+        }
+        const matches = [];
+        let current = this.root;
+        for (let i = 0; i < text.length; i++) {
+            const char = text[i];
+            // Follow failure links until we find a transition or reach root
+            while (current !== this.root && !current.children.has(char)) {
+                current = current.failure;
+            }
+            // Transition to next state if possible
+            if (current.children.has(char)) {
+                current = current.children.get(char);
+            }
+            // Report all patterns that end at this position
+            for (let j = 0; j < current.output.length; j++) {
+                const pattern = current.output[j];
+                const patternIndex = current.outputIndices[j];
+                const start = i - pattern.length + 1;
+                matches.push({
+                    pattern,
+                    start,
+                    end: i + 1,
+                    patternIndex,
+                });
+            }
+        }
+        return matches;
+    }
+    /**
+     * Check if text contains any patterns
+     */
+    hasMatch(text) {
+        if (!this.compiled) {
+            this.buildAutomaton();
+        }
+        let current = this.root;
+        for (let i = 0; i < text.length; i++) {
+            const char = text[i];
+            while (current !== this.root && !current.children.has(char)) {
+                current = current.failure;
+            }
+            if (current.children.has(char)) {
+                current = current.children.get(char);
+            }
+            if (current.output.length > 0) {
+                return true;
+            }
+        }
+        return false;
+    }
+    /**
+     * Find first match in text
+     */
+    findFirst(text) {
+        if (!this.compiled) {
+            this.buildAutomaton();
+        }
+        let current = this.root;
+        for (let i = 0; i < text.length; i++) {
+            const char = text[i];
+            while (current !== this.root && !current.children.has(char)) {
+                current = current.failure;
+            }
+            if (current.children.has(char)) {
+                current = current.children.get(char);
+            }
+            if (current.output.length > 0) {
+                const pattern = current.output[0];
+                const patternIndex = current.outputIndices[0];
+                const start = i - pattern.length + 1;
+                return {
+                    pattern,
+                    start,
+                    end: i + 1,
+                    patternIndex,
+                };
+            }
+        }
+        return null;
+    }
+    /**
+     * Get the patterns stored in this automaton
+     */
+    getPatterns() {
+        return [...this.patterns];
+    }
+    /**
+     * Clear all patterns and reset the automaton
+     */
+    clear() {
+        this.patterns = [];
+        this.root = this.createNode();
+        this.compiled = false;
+    }
+    /**
+     * Get statistics about the automaton
+     */
+    getStats() {
+        const nodeCount = this.countNodes(this.root);
+        const averagePatternLength = this.patterns.length > 0
+            ? this.patterns.reduce((sum, p) => sum + p.length, 0) /
+                this.patterns.length
+            : 0;
+        return {
+            patternCount: this.patterns.length,
+            nodeCount,
+            averagePatternLength,
+        };
+    }
+    /**
+     * Count total nodes in the trie
+     */
+    countNodes(node) {
+        let count = 1;
+        for (const child of node.children.values()) {
+            count += this.countNodes(child);
+        }
+        return count;
+    }
+}
+//# sourceMappingURL=aho-corasick.js.map

package/dist/algos/aho-corasick.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aho-corasick.js","sourceRoot":"","sources":["../../src/algos/aho-corasick.ts"],"names":[],"mappings":"AAAA;;GAEG;AAiBH,MAAM,OAAO,WAAW;IAKtB,YAAY,WAAqB,EAAE;QAF3B,aAAQ,GAAY,KAAK,CAAC;QAGhC,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;QAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC9B,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,IAAI,CAAC,cAAc,EAAE,CAAC;SACvB;IACH,CAAC;IAED;;OAEG;IACK,UAAU;QAChB,OAAO;YACL,QAAQ,EAAE,IAAI,GAAG,EAAoB;YACrC,MAAM,EAAE,EAAE;YACV,aAAa,EAAE,EAAE;YACjB,OAAO,EAAE,IAAI;YACb,cAAc,EAAE,KAAK;SACtB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,QAAkB;QAC5B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;QAChC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,OAAe;QACxB,IAAI,OAAO,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;YACjC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC5B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;SACvB;IACH,CAAC;IAED;;OAEG;IACK,cAAc;QACpB,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;IACvB,CAAC;IAED;;OAEG;IACK,SAAS;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;YAExB,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE;gBAC1B,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;oBAC/B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;iBAC/C;gBACD,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;aACvC;YAED,OAAO,CAAC,cAAc,GAAG,IAAI,CAAC;YAC9B,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC7B,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SAC/B;IACH,CAAC;IAED;;OAEG;IACK,iBAAiB;QACvB,MAAM,KAAK,GAAe,EAAE,CAAC;QAE7B,6CAA6C;QAC7C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE;YAC/C,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACnB;QAED,uCAAuC;QACvC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,OAAO,CAAC,QAAQ,EAAE;gBAC5C,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAElB,IAAI,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;gBAC9B,OAAO,OAAO,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;oBACtD,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;iBAC3B;gBAED,KAAK,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;aACnE;SACF;IACH,CAAC;IAED;;OAEG;IACK,gBAAgB;QACtB,MAAM,KAAK,GAAe,EAAE,CAAC;QAE7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE;YAC/C,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACnB;QAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,2CAA2C;YAC3C,IAAI,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;gBACxD,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC/C,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;aAC9D;YAED,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE;gBAC7C,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACnB;SACF;IACH,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAY;QAClB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YAClB,IAAI,CAAC,cAAc,EAAE,CAAC;SACvB;QAED,MAAM,OAAO,GAAY,EAAE,CAAC;QAC5B,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QAExB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAErB,gEAAgE;YAChE,OAAO,OAAO,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;gBAC3D,OAAO,GAAG,OAAO,CAAC,OAAQ,CAAC;aAC5B;YAED,uCAAuC;YACvC,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;gBAC9B,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;aACvC;YAED,gDAAgD;YAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC9C,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,YAAY,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;gBAC9C,MAAM,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;gBAErC,OAAO,CAAC,IAAI,CAAC;oBACX,OAAO;oBACP,KAAK;oBACL,GAAG,EAAE,CAAC,GAAG,CAAC;oBACV,YAAY;iBACb,CAAC,CAAC;aACJ;SACF;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,IAAY;QACnB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YAClB,IAAI,CAAC,cAAc,EAAE,CAAC;SACvB;QAED,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QAExB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAErB,OAAO,OAAO,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;gBAC3D,OAAO,GAAG,OAAO,CAAC,OAAQ,CAAC;aAC5B;YAED,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;gBAC9B,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;aACvC;YAED,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;gBAC7B,OAAO,IAAI,CAAC;aACb;SACF;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,IAAY;QACpB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YAClB,IAAI,CAAC,cAAc,EAAE,CAAC;SACvB;QAED,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QAExB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAErB,OAAO,OAAO,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;gBAC3D,OAAO,GAAG,OAAO,CAAC,OAAQ,CAAC;aAC5B;YAED,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;gBAC9B,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;aACvC;YAED,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;gBAC7B,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,YAAY,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;gBAC9C,MAAM,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;gBAErC,OAAO;oBACL,OAAO;oBACP,KAAK;oBACL,GAAG,EAAE,CAAC,GAAG,CAAC;oBACV,YAAY;iBACb,CAAC;aACH;SACF;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC9B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,QAAQ;QAKN,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,MAAM,oBAAoB,GACxB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;YACtB,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;gBACnD,IAAI,CAAC,QAAQ,CAAC,MAAM;YACtB,CAAC,CAAC,CAAC,CAAC;QAER,OAAO;YACL,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM;YAClC,SAAS;YACT,oBAAoB;SACrB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,IAAc;QAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE;YAC1C,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;SACjC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

package/dist/algos/bloom-filter.d.ts

@@ -0,0 +1,103 @@
+/**
+ * Bloom Filter implementation for efficient set membership testing
+ */
+export declare class BloomFilter {
+    private bitArray;
+    private size;
+    private hashCount;
+    private itemCount;
+    constructor(expectedItems: number, falsePositiveRate?: number);
+    /**
+     * Calculate optimal bit array size
+     */
+    private calculateOptimalSize;
+    /**
+     * Calculate optimal number of hash functions
+     */
+    private calculateOptimalHashCount;
+    /**
+     * Hash function 1 (FNV-1a variant)
+     */
+    private hash1;
+    /**
+     * Hash function 2 (djb2 variant)
+     */
+    private hash2;
+    /**
+     * Generate k hash values for an item using double hashing
+     */
+    private getHashes;
+    /**
+     * Set a bit in the bit array
+     */
+    private setBit;
+    /**
+     * Get a bit from the bit array
+     */
+    private getBit;
+    /**
+     * Add an item to the bloom filter
+     */
+    add(item: string): void;
+    /**
+     * Add multiple items to the bloom filter
+     */
+    addAll(items: string[]): void;
+    /**
+     * Test if an item might be in the set
+     */
+    mightContain(item: string): boolean;
+    /**
+     * Test multiple items at once
+     */
+    mightContainAny(items: string[]): boolean;
+    /**
+     * Filter items that might be in the set
+     */
+    filter(items: string[]): string[];
+    /**
+     * Clear the bloom filter
+     */
+    clear(): void;
+    /**
+     * Get current false positive probability
+     */
+    getCurrentFalsePositiveRate(): number;
+    /**
+     * Get bloom filter statistics
+     */
+    getStats(): {
+        size: number;
+        hashCount: number;
+        itemCount: number;
+        bitsSet: number;
+        loadFactor: number;
+        estimatedFalsePositiveRate: number;
+    };
+    /**
+     * Serialize bloom filter to JSON
+     */
+    toJSON(): {
+        size: number;
+        hashCount: number;
+        itemCount: number;
+        bitArray: number[];
+    };
+    /**
+     * Deserialize bloom filter from JSON
+     */
+    static fromJSON(data: {
+        size: number;
+        hashCount: number;
+        itemCount: number;
+        bitArray: number[];
+    }): BloomFilter;
+    /**
+     * Union operation with another bloom filter
+     */
+    union(other: BloomFilter): BloomFilter;
+    /**
+     * Intersection operation with another bloom filter
+     */
+    intersect(other: BloomFilter): BloomFilter;
+}