@@ -81,7 +81,7 @@ if SELF_TEST is defined. You can use this free for any purpose. It's in
81
81
the public domain. It has no warranty.
82
82
83
83
You probably want to use hashlittle(). hashlittle() and hashbig()
84
- hash byte arrays. hashlittle() is is faster than hashbig() on
84
+ hash byte arrays. hashlittle() is faster than hashbig() on
85
85
little-endian machines. Intel and AMD are little-endian machines.
86
86
On second thought, you probably want hashlittle2(), which is identical to
87
87
hashlittle() except it returns two 32-bit hashes for the price of one.
@@ -440,7 +440,7 @@ static uint32_t hashlittle(const void *key, size_t length, uint32_t initval)
440
440
/* clang-format on */
441
441
442
442
/* a simple hash function similar to what perl does for strings.
443
- * for good results, the string should not be excessivly large.
443
+ * for good results, the string should not be excessively large.
444
444
*/
445
445
static unsigned long lh_perllike_str_hash (const void * k )
446
446
{
@@ -481,7 +481,7 @@ static unsigned long lh_char_hash(const void *k)
481
481
#elif defined _MSC_VER || defined __MINGW32__
482
482
InterlockedCompareExchange (& random_seed , seed , -1 );
483
483
#else
484
- //#warning "racy random seed initializtion if used by multiple threads"
484
+ //#warning "racy random seed initialization if used by multiple threads"
485
485
random_seed = seed ; /* potentially racy */
486
486
#endif
487
487
}
0 commit comments