A fast and accurate Count-Min Sketch data structure.
Project description
#CountMinSketch
==============
This is a pure-Python count-min sketch. It's pretty fast and accurate. Try it out!
##Usage
```python
>>> cms = CountMinSketch(200, 500)
>>> cms['foo']
0
>>> cms['foo'] += 5
>>> cms['foo']
5
```
==============
This is a pure-Python count-min sketch. It's pretty fast and accurate. Try it out!
##Usage
```python
>>> cms = CountMinSketch(200, 500)
>>> cms['foo']
0
>>> cms['foo'] += 5
>>> cms['foo']
5
```
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
File details
Details for the file count_min_sketch-3.0.1.tar.gz
.
File metadata
- Download URL: count_min_sketch-3.0.1.tar.gz
- Upload date:
- Size: 2.7 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | c85be756a32da38c69926569bde7f1854080bf151ce86ad4a59d534bdf946daa |
|
MD5 | f5579fde386b74f3a8c4a00e85684ee3 |
|
BLAKE2b-256 | 1587f00eaa83593b1a56ac1f480db67c8627850f8e50e50fedd660322b24c8d5 |