TypeScript definitions for bloomfilter
MCP server for Bloomfilter domain registration API — Service that lets AI Agents search, register, and configure domains
Fast bloom filter in JavaScript.
murmur-bloomfilter ===============================
A native bloomfilter lib using 64bit murmur hash.
bloomfilter filter wrap
Fast bloom filter in JavaScript.
A wrapper for bloomfilter.
The RAW BloomFilter library, a fast, memory-efficient bloom filter implementation for membership checks.
PixiJS filter to apply a simple bloom effect
wrapped 'bloomfilter' \ 'bloomfilter.js' with 'basex-encoder'
bloomfilter-as-a-service
A tiny implementation of a bloomfilter using tc39, XXH64, enhanced double hashing, and parallel popcnt.
MCP server for Bloomfilter domain registration API — Service that lets AI Agents search, register, and configure domains
A package implementing bloom filter using redis as backend.
Fastest Bloom Filter on NPM. Powered by WASM, written in TypeScript & C.
NestJS - Redis Bloom Filters Extension
A bloom filter suitable for use in Bitcoin Connection Bloom Filtering as part of [BIP37](https://github.com/bitcoin/bips/blob/master/bip-0037.mediawiki).
[](https://travis-ci.org/bbondy/bloom-filter-cpp)
Space efficient bloom filter based on the bloom-filters npm package.
Space efficient bloom filter based on the bloom-filters npm package.
Minimalistic RedisBloom client for Node.js.
A TypeScript RedisBloom toolkit for scalable Bloom filters in Node.js.
> 版本：1.1.92 > 基于 WebGL2 的 BIM 三维渲染 SDK
Bloom filter implementation
A bloomfilter implementation in Rust
A fast, flexible Bloom filter library for Rust with parallel operations support
Some fast bloom filter implemented by Rust for Python and Rust!
An industry-grade, highly scalable Bloom filter with lock-free concurrency, blocked layout, and automatic persistence.
Bloom filter implementation using xx hash
Probabilistic data structure library: Bloom filters, Cuckoo filters, Count-Min Sketch, HyperLogLog, MinHash, and Top-K. Tunable false-positive rates, serializable state, merge support, and streaming-safe updates.
The fastest Bloom filter in Rust. No accuracy compromises. Full concurrency support and compatible with any hasher.
A conveniently simple implemenation of a bloomfilter.
Simple bloom filter implementation in Rust.
Probabilistic set membership filters with a simple interface
A simple bloom filter implementation in Rust
Counting Bloom Filter implemented in Ruby
Two Bloom filter implementations.
Adds Redis::Bloomfilter class which can be used as ditributed bloom filter implementation on Redis. A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.
A bloomfilter implementation in both Ruby and Javascript that can be serialised to and loaded from JSON. Very useful when needing to train a bloom filter in one language and using it in the other.
JRuby wrapper (+ some extra functionality) to http://code.google.com/p/java-bloomfilter
Counting Bloom Filter in Ruby
Time Decaying Bloom Filter - Much like a bloom-filter except keys inserted decay over-time.
Bloom filters are fast, compact, probabalistic data structures that allow set filtering with a configurable rate of false positives. This plugin adds .bloom_filter.uniq, .bloom_filter.only([collection]), and .bloom_filter.except([collection]) to the available routes methods in Pacer.
Counting Bloom Filter in Ruby 1.9.1 version
Project started mainly for Extract Transform Load (ETL) operations
Counting Bloom Filter implemented in Ruby (fork without native code)
A simple BloomFilter implementation, usable in-process or as an EventMachine daemon.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.