火龙果-负载均衡研究初步推荐.pptVIP

Hash散列算法 int hash(char *key_str, unsigned long MAX_SS_NUM) { register unsigned int h; register unsigned char *p; for(h=0, p = (unsigned char *)key_str; *p ; p++) { h = 31 * h + *p; } return (h % MAX_SS_NUM); } 一个较经典的Hash算法。 Hash散列算法 unsigned htable_hash(const char *s, unsigned size) { unsigned long h = 0; unsigned long g; char *md5s = MDString(s); while (*md5s) { h = (h 4) + *md5s++; if ((g = (h 0xf0000000)) != 0) { h ^= (g 24); h ^= g;