Callidon / bloom-filters

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
https://callidon.github.io/bloom-filters/
MIT License
369 stars 42 forks source link

Version 0.7.0 #6

Closed folkvir closed 5 years ago

folkvir commented 5 years ago

Up to v0.7.0

codecov-io commented 5 years ago

Codecov Report

Merging #6 into master will decrease coverage by 2.32%. The diff coverage is 85.86%.

Impacted file tree graph

@@           Coverage Diff           @@
##           master    #6      +/-   ##
=======================================
- Coverage   93.33%   91%   -2.33%     
=======================================
  Files          10    10              
  Lines         390   478      +88     
=======================================
+ Hits          364   435      +71     
- Misses         26    43      +17
Impacted Files Coverage Δ
src/partitioned-bloom-filter.js 96.55% <100%> (+0.12%) :arrow_up:
src/bloom-filter.js 96.42% <100%> (+0.13%) :arrow_up:
src/export-import-specs.js 100% <100%> (ø) :arrow_up:
src/exportable.js 80% <100%> (+7.27%) :arrow_up:
src/cuckoo-filter.js 93.22% <100%> (+0.11%) :arrow_up:
src/count-min-sketch.js 100% <100%> (ø) :arrow_up:
src/utils.js 83.15% <77.46%> (-13.82%) :arrow_down:
src/invertible-bloom-lookup-tables.js 85.48% <86.74%> (-0.11%) :arrow_down:

Continue to review full report at Codecov.

Legend - Click here to learn more Δ = absolute <relative> (impact), ø = not affected, ? = missing data Powered by Codecov. Last update 9430215...8dd3ed8. Read the comment docs.