若干经典的字符串哈希函数
来源:互联网 发布:醉先武 神武进阶数据 编辑:程序博客网 时间:2024/06/06 13:04
// RS Hash Function
unsigned 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 );
}
// JS Hash Function
unsigned int JSHash( char * str)
{
unsigned int hash = 1315423911;
while ( * str)
{
hash ^= ((hash << 5 ) + ( * str ++ ) + (hash >> 2));
}
return (hash & 0x7FFFFFFF );
}
// P. J. Weinberger Hash Function
unsigned 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 ) << (BitsInU
nignedInt - 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 );
}
// ELF Hash Function
unsigned 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 );
}
// BKDR Hash Function
unsigned 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 );
}
// SDBM Hash Function
unsigned int SDBMHash( char * str)
{
unsigned int hash = 0;
while ( * str)
{
hash = ( * str ++) + (hash << 6 ) + (hash << 16) - hash;
}
return (hash & 0x7FFFFFFF );
}
// DJB Hash Function
unsigned int DJBHash( char * str)
{
unsigned int hash = 5381;
while ( * str)
{
hash += (hash << 5) + ( * str++ );
}
return (hash & 0x7FFFFFFF );
}
// AP Hash Function
unsigned 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 );
}
比较经典的字符串hash就这些了吧,"ELF Hash Function" <-这个比较常用..
unsigned 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 );
}
// JS Hash Function
unsigned int JSHash( char * str)
{
unsigned int hash = 1315423911;
while ( * str)
{
hash ^= ((hash << 5 ) + ( * str ++ ) + (hash >> 2));
}
return (hash & 0x7FFFFFFF );
}
// P. J. Weinberger Hash Function
unsigned 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 ) << (BitsInU
nignedInt - 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 );
}
// ELF Hash Function
unsigned 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 );
}
// BKDR Hash Function
unsigned 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 );
}
// SDBM Hash Function
unsigned int SDBMHash( char * str)
{
unsigned int hash = 0;
while ( * str)
{
hash = ( * str ++) + (hash << 6 ) + (hash << 16) - hash;
}
return (hash & 0x7FFFFFFF );
}
// DJB Hash Function
unsigned int DJBHash( char * str)
{
unsigned int hash = 5381;
while ( * str)
{
hash += (hash << 5) + ( * str++ );
}
return (hash & 0x7FFFFFFF );
}
// AP Hash Function
unsigned 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 );
}
比较经典的字符串hash就这些了吧,"ELF Hash Function" <-这个比较常用..
- 若干经典的字符串哈希函数
- 若干经典的字符串哈希函数
- 若干经典的字符串哈希函数
- 若干经典的字符串哈希函数
- 若干经典的字符串哈希函数
- 若干经典的字符串哈希函数
- 若干经典的字符串哈希函数
- 若干经典的字符串哈希函数
- 若干经典的字符串哈希函数
- 若干经典的字符串哈希函数
- 若干经典的字符串哈希函数
- 若干经典的字符串哈希函数(转)
- 若干经典哈希算法
- 字符串输入函数的若干不同
- 若干字符串后缀函数
- 经典的字符串hash函数。
- 关于字符串的若干小结
- 世上最经典的若干句话
- Android-将RGB彩色图转换为灰度图
- 分析Android 根文件系统启动过程之init守护进程分析
- web-inf下jsp之间的跳转
- Linux环境进程间通信(二): 信号(上)
- iOS: autosizing
- 若干经典的字符串哈希函数
- 抽象类与接口的个人看法
- java 文件尾添加数据,和 文件的快速读取
- 用python爬虫抓站的一些技巧总结
- usb应用开发学习笔记
- hash算法的作用是什么?
- 选择本地图片
- 关于Extjs gridpanel设置autoHeight:true时,横向滚动条的问题 .
- Verilog Tutorial (Verilog 教程)