转一下大神的字符hash,
来源:互联网 发布:梁朝伟无间道知乎 编辑:程序博客网 时间:2024/06/05 20:12
看到了一种hash到long long 在sort 的unique 的方法,恨nice 沾上大神代码
const int MAXN = 1000003;//常用 11 SDBMHashunsigned int SDBMHash(char *str){ unsigned int hash = 0; while (*str) { // equivalent to: hash = 65599*hash + (*str++); hash = (*str++) + (hash << 6) + (hash << 16) - hash; } return (hash & 0x7FFFFFFF)%MAXN;} //常用2 6 BKDR Hash Functionunsigned int BKDRHash(char *str){ unsigned int seed = 131; // 31 131 1313 13131 131313 etc.. unsigned int hash = 0; while (*str) { hash = hash * seed + (*str++); } return (hash & 0x7FFFFFFF)%MAXN;}// a idea is large ll to cover sort ans unqiue 2 RS Hash Functionunsigned int RSHash(char *str){ unsigned int b = 378551; unsigned int a = 63689; unsigned int hash = 0; while (*str) { hash = hash * a + (*str++); a *= b; } return (hash & 0x7FFFFFFF)%MAXN;} 3 JS Hash Functionunsigned int JSHash(char *str){ unsigned int hash = 1315423911; while (*str) { hash ^= ((hash << 5) + (*str++) + (hash >> 2)); } return (hash & 0x7FFFFFFF)%MAXN;} 4 P. J. Weinberger Hash Functionunsigned int PJWHash(char *str){ unsigned int BitsInUnignedInt = (unsigned int)(sizeof(unsigned int) * 8); unsigned int ThreeQuarters = (unsigned int)((BitsInUnignedInt * 3) / 4); unsigned int OneEighth = (unsigned int)(BitsInUnignedInt / 8); unsigned int HighBits = (unsigned int)(0xFFFFFFFF) << (BitsInUnignedInt - OneEighth); unsigned int hash = 0; unsigned int test = 0; while (*str) { hash = (hash << OneEighth) + (*str++); if ((test = hash & HighBits) != 0) { hash = ((hash ^ (test >> ThreeQuarters)) & (~HighBits)); } } return (hash & 0x7FFFFFFF)%MAXN;} 5 ELF Hash Functionunsigned int ELFHash(char *str){ unsigned int hash = 0; unsigned int x = 0; while (*str) { hash = (hash << 4) + (*str++); if ((x = hash & 0xF0000000L) != 0) { hash ^= (x >> 24); hash &= ~x; } } return (hash & 0x7FFFFFFF)%MAXN;} 7 DJB Hash Functionunsigned int DJBHash(char *str){ unsigned int hash = 5381; while (*str) { hash += (hash << 5) + (*str++); } return (hash & 0x7FFFFFFF)%MAXN;} 8 AP Hash Functionunsigned int APHash(char *str){ unsigned int hash = 0; int i; for (i=0; *str; i++) { if ((i & 1) == 0) { hash ^= ((hash << 7) ^ (*str++) ^ (hash >> 3)); } else { hash ^= (~((hash << 11) ^ (*str++) ^ (hash >> 5))); } } return (hash & 0x7FFFFFFF)%MAXN;}
- 转一下大神的字符hash,
- 改进的字符hash
- 存一下大神给的代码
- 大神帮忙优化一下
- Java的反编译代码~哪位大神可以赐教一下?
- Spring整合出现的错误,那位大神帮一下!!!!!!!!!
- 哪位大神有好的javaee视频教程!分享一下!
- 记录一下某位大神关于HTV的详细内容
- 记一下大神分享给我的chrom插件
- 寻找Hash后丢失的字符
- 记录一下博客大神们
- [转]计算机视觉的大神
- 修改了一下某个大神的AnimatePacker,以适应plist格式的动画格式
- 整理了一下浅墨大神的Visual C++/DirectX 9.0c的游戏开发手记
- 复述一下陶大神的文章总结tcp的连接关闭
- 求助,有没有大神能给小的讲一下这个怎么实现的
- 求大神帮我解决一下我的DEV编译器的问题!!
- 关于数据结构的一道题???大神教我这个菜鸟一下把
- Linux初学所遇问题
- strlen和sizeof的区别
- java开发应善于使用注释
- 使用spring jdbc template简化jdbc数据库操作实例代码
- Oracle数据库学习之数据类型和表的操作
- 转一下大神的字符hash,
- .net技术类面试、笔试题汇总4
- Android中循环线程的安全关闭方法
- centos 6.4安装wine1.6少Xlib/Xfree86解决办法
- mongodb基本命令2
- 从全局看数据库系统设计
- Cygwin-1.7.17环境下编译FLTK-1.3.2
- KMP字符串模式匹配详解
- 其实可以不用那么c++