diff options
| author | Eric Lindblad <lindblad@gmx.us> | 2022-05-13 15:40:55 -0500 |
|---|---|---|
| committer | Marge Bot <ben+marge-bot@smart-cactus.org> | 2022-06-01 07:44:51 -0400 |
| commit | 514a6a28db16793d6d2ca8fe7863e82943f56374 (patch) | |
| tree | 5e35392d37250050e192d11790bdefa7011f8862 /rts/xxhash.h | |
| parent | ef7ddd7348070a9149d162217280c0a50f2b213d (diff) | |
| download | haskell-514a6a28db16793d6d2ca8fe7863e82943f56374.tar.gz | |
typos
Diffstat (limited to 'rts/xxhash.h')
| -rw-r--r-- | rts/xxhash.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/rts/xxhash.h b/rts/xxhash.h index 2d56d23c5d..68fe10f6d4 100644 --- a/rts/xxhash.h +++ b/rts/xxhash.h @@ -299,7 +299,7 @@ XXH_PUBLIC_API XXH32_hash_t XXH32 (const void* input, size_t length, XXH32_hash_ /******* Streaming *******/ /* - * Streaming functions generate the xxHash value from an incrememtal input. + * Streaming functions generate the xxHash value from an incremental input. * This method is slower than single-call functions, due to state management. * For small inputs, prefer `XXH32()` and `XXH64()`, which are better optimized. * @@ -835,7 +835,7 @@ XXH_PUBLIC_API XXH128_hash_t XXH128(const void* data, size_t len, XXH64_hash_t s * * The check costs one initial branch per hash, which is generally negligible, but not zero. * Moreover, it's not useful to generate binary for an additional code path - * if memory access uses same instruction for both aligned and unaligned adresses. + * if memory access uses same instruction for both aligned and unaligned addresses. * * In these cases, the alignment check can be removed by setting this macro to 0. * Then the code will always use unaligned memory access. |