piskvorky / bounter

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

CMS: improve increment by N #13

Open isamaru opened 6 years ago

isamaru commented 6 years ago

The increment function of CMS should be optimized for increments by larger numbers. Internally, increment by N does N successive increments by 1 at the moment.

Note that doing it in one pass is quite complex because of the conservative increment issues and particularly log8 and log1024.