Compute the 32bit murmurhash3 of key at seed.
The underlying implementation is MurmurHash3_x86_32 generating low latency 32bits hash suitable for implementing lookup tables, Bloom filters, count min sketch or feature hashing.
The physical object to hash.
Integer seed for the hashing algorithm.
from 0 to 2 ** 32 - 1
from -(2 ** 31) to 2 ** 31 - 1
Examples
>>> from sklearn.utils import murmurhash3_32 >>> murmurhash3_32(b"Hello World!", seed=42) 3565178
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4