*
* An odd number is sufficient to make sure each entry of the hash table gets
* probed for probe_num between 0 and s-1 because s is a power of two, hence
- * the second hash value never hash a common divisor with the hash table size.
+ * the second hash value has never a common divisor with the hash table size.
* IOW: h is invertible in the ring [0..s].
*/
static uint32_t double_hash(uint32_t uid, uint32_t probe_num)