Releases: barrust/count-min-sketch
Releases · barrust/count-min-sketch
Version 0.2.0
Version 0.1.8
- Added in-depth testing
- Fixed potential overflow issues
Version 0.1.7
- Merge functionality
- Into a new CMS
- Into a previously built CMS
Version 0.1.6
- Remove the python version with the recommendation of using
pyprobables
instead - Ensure appropriate
const
usage forchar*
- Improve the hashing to be more efficient
Version 0.1.5
- Fix for non-gcc overflow checks
Version 0.1.4
- Standard int widths
- Overflow checks
- Python implementation
- Binary compatibility on import / export
Version 0.1.3
- Updated tests
- Added import / export functionality
- Added mean-min lookup strategy
- NOTE: This means this can also be used as a Count-Mean-Min Sketch
Version 0.1.2
- add, remove, lookup elements based solely on the hashes
- changed int array layout for future import / export
- fix min->max misnomer
Version 0.1.1
- Ability to remove elements
- Mean based lookup
- Optimal width / depth initialization based on error rate and certainty
- Track elements inserted
- Calculate hashes for key and return to caller
Version 0.1.0
- Initial version of a basic count-min sketch data-structure
- Ability to:
- Add element to the count-min sketch
- Check count of element in the count-min sketch
- Clear count-min sketch
- Set user defined hashing function