https://github.com/grasielagomes/bloom-filter-ts
High-performance Bloom Filter implemented in TypeScript for fast membership checks.
https://github.com/grasielagomes/bloom-filter-ts
bitwise bloom-filter data-structures performance typescript
Last synced: over 1 year ago
JSON representation
High-performance Bloom Filter implemented in TypeScript for fast membership checks.
- Host: GitHub
- URL: https://github.com/grasielagomes/bloom-filter-ts
- Owner: grasielaGomes
- Created: 2025-03-21T13:17:19.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-03-21T13:35:57.000Z (over 1 year ago)
- Last Synced: 2025-03-21T14:48:04.711Z (over 1 year ago)
- Topics: bitwise, bloom-filter, data-structures, performance, typescript
- Language: TypeScript
- Homepage:
- Size: 5.86 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 🌱 Bloom Filter in TypeScript
This project implements a simple and efficient **Bloom Filter** using TypeScript. A Bloom Filter is a space-efficient probabilistic data structure used to test whether an element is a member of a set.
> ✅ It *definitely* tells you if an element is not in the set.
> ⚠️ It *might* tell you that it is — false positives are possible, but false negatives are not.
---
## ✨ Why is this project important?
- **High performance**: Ideal for handling large-scale datasets, avoiding duplication, or pre-filtering data.
- **Real-world applications**: Used in spam detection, recommendation engines, database optimizations and security systems by companies like Google, LinkedIn and Cloudflare.
- **Showcases technical depth**: Demonstrates understanding of hashing, bitwise operations, and memory-efficient data structures in TypeScript.
---
## 🧪 Example
```ts
const bloom = new BloomFilter(100, 3);
bloom.add("alice@example.com");
bloom.contains("alice@example.com"); // true
bloom.contains("bob@example.com"); // false or maybe true (false positive)
```