diff options
| author | Dimitris Apostolou <dimitris.apostolou@icloud.com> | 2018-03-18 16:26:45 +0200 |
|---|---|---|
| committer | Dimitris Apostolou <rex@MacBook-Pro-2011.local> | 2018-03-21 08:34:44 +0200 |
| commit | 4d9b4256d89d1f7c6b3e4938ab2e89cde296e8e8 (patch) | |
| tree | 1fc1e7662fcaeb8a9503eb80fc4038eee2da5b55 /src/cuckoocache.h | |
| parent | 00d1680498c5550e7db1f359202d3433a092fafd (diff) | |
Fix typos
Diffstat (limited to 'src/cuckoocache.h')
| -rw-r--r-- | src/cuckoocache.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/cuckoocache.h b/src/cuckoocache.h index 947e1a7185..d1de712024 100644 --- a/src/cuckoocache.h +++ b/src/cuckoocache.h @@ -224,7 +224,7 @@ private: * * Instead we treat the 32-bit random number as a Q32 fixed-point number in the range * [0,1) and simply multiply it by the size. Then we just shift the result down by - * 32-bits to get our bucket number. The results has non-uniformity the same as a + * 32-bits to get our bucket number. The result has non-uniformity the same as a * mod, but it is much faster to compute. More about this technique can be found at * http://lemire.me/blog/2016/06/27/a-fast-alternative-to-the-modulo-reduction/ * |