bloom-filters

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash

v3.0.4 URL: https://unpkg.com/bloom-filters@3.0.4/dist/api.js

Open Browse Files

bloom filter bloom filter probabilistic datastructure partitionned bloom filter scalable bloom filter counting bloom filter invertible bloom filter count min sketch cuckoo xor minhash top-k hyperloglog

@thi.ng/lsys

Functional, extensible L-System architecture w/ support for probabilistic rules

v2.3.30 URL: https://unpkg.com/@thi.ng/lsys@2.3.30/index.js

Open Browse Files

1d 2d 3d datastructure generative geometry l-system probabilistic random rulebased turtle typescript

skipstruct

Set of efficient data structures based on skip lists.

v0.3.0 URL: https://unpkg.com/skipstruct@0.3.0/skipstruct.js

Open Browse Files

skiplist skip-list data-structure probabilistic

hyperlolo

Efficiently estimate the cardinality of a set in Typescript and Javascript

v0.4.0 URL: https://unpkg.com/hyperlolo@0.4.0/dist/hyperlolo.cjs

Open Browse Files

hyperloglog hll cardinality count distinct probabilistic

shuffrand

Cryptographically secure randomness and shuffling — with soul.

v1.8.1 URL: https://unpkg.com/shuffrand@1.8.1

Open Browse Files