字符串__哈希算法

 // 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 );
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值