- support
?Sized
where possible - implement
Send
where possible
- proper union support
- fix potential out-of-bounds access (#74)
- improve performance
- more scale functions
- replace
Void
withInfallible
- update dependencies
- make all dependencies optional
- new and shiny
- improve documentation of BloomFilter
- rename former Top-K to CMS Heap
- add Lossy Counter implementation
add
andadd_n
now return count after addition operation
- update bytecount to 0.5
- benchmarking system
- improved hash performance
- various tiny documentation improvements
- misc performance improvements
- use stdlib
BuildHasherDefault
instead of own version - make all containers typed and implement
AnyHash
for dynamically typed containers - enforce formatting in CI
- Rust 2018
- update bytecount to 0.4
- update rand to 0.6
- implement
relative_error
- enhanced bias correction
- extend value range for
b
- unified trait-based filter interface
- add QuotientFilter
- CountMinSketch: use
num-traits
as counters,add_n
takes element by reference - CuckooFilter: new!
- HyperLogLog: faster byte-count
- TopK:
.values()
->.iter()
- all: tests for asserts, way nicer docs
- license: change to MIT+Apache2
- ReservoirSampling: first implementation
- TopK: first implementation
- all: implement Extend trait
- Counter: a safe counter trait
- CountMinSketch: first implementation
- BloomFilter, HyperLogLog: remove
get_
prefix from getters
This is the very first release with the following data structures:
- BloomFilter
- HyperLogLog