Data Structure Tools
Browse all available data structure tools.
Available tools
- Bloom Filter Calculator Build a deterministic Bloom filter, test an item, and estimate its false-positive probability.
- Counting Bloom Filter Calculator Build a deterministic counting Bloom filter, apply requested removals, and test a query. Positive membership and multiplicity remain probabilistic because hash collisions can overestimate both.
- HyperLogLog Cardinality Estimator Estimate the number of distinct strings with a fixed-size HyperLogLog sketch. The estimate is probabilistic and may differ from the exact count.
- Locality-Sensitive Hash Candidate Checker Use banded MinHash signatures to flag a pair of string sets as a similarity candidate. A matching band is not proof of semantic similarity.
- MinHash Jaccard Similarity Estimator Compare two sets of strings using seeded 32-bit MinHash signatures. Estimated Jaccard can differ from exact Jaccard, especially with few hashes.
- Two-Table Cuckoo Hashing Trace Trace insertion evictions, lookups and deletion in two fixed-size integer-key cuckoo tables using h1(k)=k mod m and h2(k)=floor(k/m) mod m; a kick limit rolls back the insertion and signals rehash-needed, without automatic resizing or hash-quality guarantees.