int ELFhash(char * key) { unsigned int h = 0; while (*key){ h = (h << 4) + *key++; unsigned int g = h & 0xf0000000L; if (g) h ^= g >> 24; h &= ~g; } return h % prime; }
字符串哈希函数
最新推荐文章于 2025-09-19 19:28:23 发布
int ELFhash(char * key) { unsigned int h = 0; while (*key){ h = (h << 4) + *key++; unsigned int g = h & 0xf0000000L; if (g) h ^= g >> 24; h &= ~g; } return h % prime; }
2294
1129

被折叠的 条评论
为什么被折叠?