Lib.rs

This algorithm (k=33) was first reported by dan bernstein many years ago (1991) in comp.lang.c. another version of this algorithm (now favored by bernstein) uses xor: hash(i) = hash(i - 1) * 33 ^ str[i]; the magic of number 33 (why it works better than many other constants, prime or not) has never been adequately explained.

https://www.cse.yorku.ca/~oz/hash.html