murmurhash算法_MurmurHash与随机数

unsigned int murMurHash(const void *key, int len)

{

const unsigned int m = 0x5bd1e995;

const int r = 24;

const int seed = 97;

unsigned int h = seed ^ len;

// Mix 4 bytes at a time into the hash

const unsigned char *data = (const unsigned char *)key;

while(len >= 4)

{

unsigned int k = *(unsigned int *)data;

k *= m;

k ^= k >> r;

k *= m;

h *= m;

h ^= k;

data += 4;

len -= 4;

}

// Handle the last few bytes of the input array

switch(len)

{

case 3: h ^= data[2] << 16;

case 2: h ^= data[1] << 8;

case 1: h ^= data[0];

h *= m;

};

// Do a few final mixes of the hash to ensure the last few

// bytes are well-incorporated.

h ^= h >> 13;

h *= m;

h ^= h >> 15;

return h;

}

版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 举报，一经查实，本站将立刻删除。

发布者：全栈程序员栈长，转载请注明出处：https://javaforall.cn/180554.html原文链接：https://javaforall.cn