search

piskvorky / bounter

Efficient Counter that uses a limited (bounded) amount of memory regardless of data size.
MIT License
935 stars 47 forks source link

Implement fast hashtable with pruning in C #11

Closed isamaru closed 7 years ago

isamaru commented 7 years ago

This is incremental to changes in cbounter which is only about CMS, but provides necessary libraries and infrastructure.