| Crates.io | approximate |
| lib.rs | approximate |
| version | 0.1.0 |
| created_at | 2025-03-03 23:58:16.219798+00 |
| updated_at | 2025-03-03 23:58:16.219798+00 |
| description | Scalable Approximate Counters |
| homepage | |
| repository | |
| max_upload_size | |
| id | 1576540 |
| size | 23,367 |
This crate is an implementation of Scalable statistics counters, which allows, with some inaccuracy, to count atomically, but MUCH faster than standard atomic operations.
On my local machine, the 2 examples give the following average results, compared to atomic counters, using thread RNG (rand crate):
std, using CPU atomics, on u32
time spent: 14.39%, error: 0.19%
no_std, using software atomics (atomic crate), on u128
time spent: 23.70%, error: 0.24%