diff options
| author | Binbin <binloveplay1314@qq.com> | 2023-03-16 14:50:32 +0800 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-03-16 08:50:32 +0200 |
| commit | 0b159b34ea0832f6589b8ee71b44dce7010e7504 (patch) | |
| tree | 0b61a7a130b63dc6612348c37d3a1ac308276b1c /src/hyperloglog.c | |
| parent | f8a5a4f70ccada85943af90f6f2db3250ee50b27 (diff) | |
| download | redis-0b159b34ea0832f6589b8ee71b44dce7010e7504.tar.gz | |
Bump codespell to 2.2.4, fix typos and outupdated comments (#11911)
Fix some seen typos and wrong comments.
Diffstat (limited to 'src/hyperloglog.c')
| -rw-r--r-- | src/hyperloglog.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/hyperloglog.c b/src/hyperloglog.c index ffe740fab..1a74f4793 100644 --- a/src/hyperloglog.c +++ b/src/hyperloglog.c @@ -144,7 +144,7 @@ * In the example the sparse representation used just 7 bytes instead * of 12k in order to represent the HLL registers. In general for low * cardinality there is a big win in terms of space efficiency, traded - * with CPU time since the sparse representation is slower to access: + * with CPU time since the sparse representation is slower to access. * * The following table shows average cardinality vs bytes used, 100 * samples per cardinality (when the set was not representable because |