@@ -168,7 +168,7 @@ cpdef uint32_t jenkins_lookup3(const uint8_t[::1] _data, uint32_t initval=0):
168168 if length == 12 :
169169 c += (< uint32_t> k[11 ]) << 24
170170 length -= 1
171-
171+
172172 if length == 11 :
173173 c += (< uint32_t> k[10 ]) << 16
174174 length -= 1
@@ -231,7 +231,7 @@ cdef inline uint32_t _jenkins_lookup3_final(uint32_t a, uint32_t b, uint32_t c):
231231 the output delta to a Gray code (a^(a>>1)) so a string of 1's (as
232232 is commonly produced by subtraction) look like a single 1-bit
233233 difference.
234- * the base values were pseudorandom, all zero but one bit set, or
234+ * the base values were pseudorandom, all zero but one bit set, or
235235 all zero plus a counter that starts at zero.
236236
237237 These constants passed:
@@ -279,7 +279,7 @@ cdef inline (uint32_t, uint32_t, uint32_t) _jenkins_lookup3_mix(uint32_t a, uint
279279 the output delta to a Gray code (a^(a>>1)) so a string of 1's (as
280280 is commonly produced by subtraction) look like a single 1-bit
281281 difference.
282- * the base values were pseudorandom, all zero but one bit set, or
282+ * the base values were pseudorandom, all zero but one bit set, or
283283 all zero plus a counter that starts at zero.
284284
285285 Some k values for my "a-=c; a^=rot(c,k); c+=b;" arrangement that
@@ -289,7 +289,7 @@ cdef inline (uint32_t, uint32_t, uint32_t) _jenkins_lookup3_mix(uint32_t a, uint
289289 14 9 3 7 17 3
290290 Well, "9 15 3 18 27 15" didn't quite get 32 bits diffing
291291 for "differ" defined as + with a one-bit base and a two-bit delta. I
292- used http://burtleburtle.net/bob/hash/avalanche.html to choose
292+ used http://burtleburtle.net/bob/hash/avalanche.html to choose
293293 the operations, constants, and arrangements of the variables.
294294
295295 This does not achieve avalanche. There are input bits of (a,b,c)
0 commit comments