Search results
48 packages found
a generic bloom filter with parameterizable hash functions
Bloom filters for javascript
Javascript FNV-1a Hashing Algorithm up to 1024 bits, with highly optimized 32bit and 52bit implementations.
A bloom rdf-membership-filter actor
SHA256 + Bloom filter proof of work
bloom filters backed by xxhash
Implementation of commonly used data structures and utilities in JavaScript.
- ds
- sort map
- data structures
- JavaScript
- AVL
- AVLTree
- Trie
- TernarySearchTrie
- MultiWayTrie
- SkipList
- BTree
- BinarySearch
- BinarySearchTree
- SortedMap
- View more
Most-Likely Classification Through Bloom-Filtering
Count-Min Sketch Data Structure
Node.js module which creates a hash of a word list using a bloom filter, and compares hashes to give you a value for the similarity between the word lists.
A native implementation of a cuckoofilter
a simple redis-backed bloom-filter
Minimalistic RedisBloom client for Node.js.
A native implementation of a bloom filter
Bloom filter implemenation for Node.js applications.
Golomb-coded sets (GCS) is a probabilistic data structure conceptually similar to the famous Bloom filters, but with a more compact in-memory representation, and a slower query time.
Bitcoin connection Bloom filtering (BIP37)