ú΄¬    None0Base function, which allows you to choose which  to use >has the lowest throughput, but also the lowest latency. If you' re making a Rhash table that usually has small keys, this is probably the one you want to use -on 32-bit machines. It has a 32-bit output. ;Generate a 128 bit hash from the given value, this function's implementation = is optimized for 32 bit architectures but works on any. * Has about 30% higher throughput than . Be warned, though, D that its latency for a single 16-byte key is about 86% longer! ;Generate a 128 bit hash from the given value, this function's implementation : is optimized for x64 architectures but works on any. ( Its throughput is 250% higher than , but it has roughly  the same latency. Yall murmur functions use this and manipulate its response to return a different format  The string to be hashed #A seed value for the hash function !Which Murmur Hash version to use ,  or  returns 4, 32 bit ints, if : is used only the first has a value and the other 3 are 0 The string to be hashed #A seed value for the hash function (32 bit number generated from the string The string to be hashed #A seed value for the hash function )128 bit number generated from the string The string to be hashed #A seed value for the hash function )128 bit number generated from the string              Dish-0.0.0.3Data.Dish.Murmur3MHVX64_128X86_128X86_32murmur3 murmur3Intmurmur3IntegerX86murmur3IntegerX64 murmur3RawunsafeMurmur3IntunsafeMurmur3IntegerX86unsafeMurmur3IntegerX64 c_x64_128 c_x86_128c_x86_32x128