Search results
12 packages found
Space efficient bloom filter based on the bloom-filters npm package.
Bloom filter is a space efficient probablistic data-structure. This implementation relies on following non-cryptographic hash functions. - Fowler–Noll–Vo hash function. - Jenkins hash function.
Space efficient bloom filter based on the bloom-filters npm package.
This is a fork of bloomfilter.js to address a couple issues.
Asino, a stubborn, simple and fast Bloom filter for the rest of us.
Stream-based bloom filter implementation
Basic Data Structures in TypeScript
- data-structures
- linked-list
- queue
- stack
- graph
- bloom-filter
- binary-tree
- b-tree
- trie
- red-black-tree
- disjoint-set
- heaps
- algorithms
- data-storage
Blumea is a streamlined Bloom filter npm package for your node apps.
bloom filters backed by xxhash
ES6 JS lightweight data structures (Priority Queue, Binary Search Tree (BST), Graph, Bloom Filters, Trie, Queue, Stack, Linked-List)
- priority queue
- heap
- queue
- stack
- trie
- graph
- bst
- binary search tree
- bianry tree
- js
- bloom filters
- bloom-filter
- bloom_filters
- filter
- View more
a simple redis-backed bloom-filter
bloom filters backed by xxhash