常用Hash算法(C語(yǔ)言的簡(jiǎn)單實(shí)現(xiàn))
如下所示:
#include "GeneralHashFunctions.h" 
 
unsigned int RSHash(char* str, unsigned int len) 
{ 
  unsigned int b  = 378551; 
  unsigned int a  = 63689; 
  unsigned int hash = 0; 
  unsigned int i  = 0; 
 
  for(i = 0; i < len; str++, i++) 
  { 
   hash = hash * a + (*str); 
   a  = a * b; 
  } 
 
  return hash; 
} 
/* End Of RS Hash Function */ 
 
 
unsigned int JSHash(char* str, unsigned int len) 
{ 
  unsigned int hash = 1315423911; 
  unsigned int i  = 0; 
 
  for(i = 0; i < len; str++, i++) 
  { 
   hash ^= ((hash << 5) + (*str) + (hash >> 2)); 
  } 
 
  return hash; 
} 
/* End Of JS Hash Function */ 
 
 
unsigned int PJWHash(char* str, unsigned int len) 
{ 
  const unsigned int BitsInUnsignedInt = (unsigned int)(sizeof(unsigned int) * 8); 
  const unsigned int ThreeQuarters   = (unsigned int)((BitsInUnsignedInt * 3) / 4); 
  const unsigned int OneEighth     = (unsigned int)(BitsInUnsignedInt / 8); 
  const unsigned int HighBits     = (unsigned int)(0xFFFFFFFF) << (BitsInUnsignedInt - OneEighth); 
  unsigned int hash       = 0; 
  unsigned int test       = 0; 
  unsigned int i         = 0; 
 
  for(i = 0; i < len; str++, i++) 
  { 
   hash = (hash << OneEighth) + (*str); 
 
   if((test = hash & HighBits) != 0) 
   { 
     hash = (( hash ^ (test >> ThreeQuarters)) & (~HighBits)); 
   } 
  } 
 
  return hash; 
} 
/* End Of P. J. Weinberger Hash Function */ 
 
 
unsigned int ELFHash(char* str, unsigned int len) 
{ 
  unsigned int hash = 0; 
  unsigned int x  = 0; 
  unsigned int i  = 0; 
 
  for(i = 0; i < len; str++, i++) 
  { 
   hash = (hash << 4) + (*str); 
   if((x = hash & 0xF0000000L) != 0) 
   { 
     hash ^= (x >> 24); 
   } 
   hash &= ~x; 
  } 
 
  return hash; 
} 
/* End Of ELF Hash Function */ 
 
 
unsigned int BKDRHash(char* str, unsigned int len) 
{ 
  unsigned int seed = 131; /* 31 131 1313 13131 131313 etc.. */ 
  unsigned int hash = 0; 
  unsigned int i  = 0; 
 
  for(i = 0; i < len; str++, i++) 
  { 
   hash = (hash * seed) + (*str); 
  } 
 
  return hash; 
} 
/* End Of BKDR Hash Function */ 
 
 
unsigned int SDBMHash(char* str, unsigned int len) 
{ 
  unsigned int hash = 0; 
  unsigned int i  = 0; 
 
  for(i = 0; i < len; str++, i++) 
  { 
   hash = (*str) + (hash << 6) + (hash << 16) - hash; 
  } 
 
  return hash; 
} 
/* End Of SDBM Hash Function */ 
 
 
unsigned int DJBHash(char* str, unsigned int len) 
{ 
  unsigned int hash = 5381; 
  unsigned int i  = 0; 
 
  for(i = 0; i < len; str++, i++) 
  { 
   hash = ((hash << 5) + hash) + (*str); 
  } 
 
  return hash; 
} 
/* End Of DJB Hash Function */ 
 
 
unsigned int DEKHash(char* str, unsigned int len) 
{ 
  unsigned int hash = len; 
  unsigned int i  = 0; 
 
  for(i = 0; i < len; str++, i++) 
  { 
   hash = ((hash << 5) ^ (hash >> 27)) ^ (*str); 
  } 
  return hash; 
} 
/* End Of DEK Hash Function */ 
 
 
unsigned int BPHash(char* str, unsigned int len) 
{ 
  unsigned int hash = 0; 
  unsigned int i  = 0; 
  for(i = 0; i < len; str++, i++) 
  { 
   hash = hash << 7 ^ (*str); 
  } 
 
  return hash; 
} 
/* End Of BP Hash Function */ 
 
 
unsigned int FNVHash(char* str, unsigned int len) 
{ 
  const unsigned int fnv_prime = 0x811C9DC5; 
  unsigned int hash   = 0; 
  unsigned int i     = 0; 
 
  for(i = 0; i < len; str++, i++) 
  { 
   hash *= fnv_prime; 
   hash ^= (*str); 
  } 
 
  return hash; 
} 
/* End Of FNV Hash Function */ 
 
 
unsigned int APHash(char* str, unsigned int len) 
{ 
  unsigned int hash = 0xAAAAAAAA; 
  unsigned int i  = 0; 
 
  for(i = 0; i < len; str++, i++) 
  { 
   hash ^= ((i & 1) == 0) ? ( (hash << 7) ^ (*str) * (hash >> 3)) : 
                (~((hash << 11) + ((*str) ^ (hash >> 5)))); 
  } 
 
  return hash; 
} 
/* End Of AP Hash Function */ 
以上就是小編為大家?guī)?lái)的常用Hash算法(C語(yǔ)言的簡(jiǎn)單實(shí)現(xiàn))的全部?jī)?nèi)容了,希望對(duì)大家有所幫助,多多支持我們~
上一篇:詳解C語(yǔ)言gets()函數(shù)與它的替代者fgets()函數(shù)
欄 目:C語(yǔ)言
本文標(biāo)題:常用Hash算法(C語(yǔ)言的簡(jiǎn)單實(shí)現(xiàn))
本文地址:http://www.jygsgssxh.com/a1/Cyuyan/2030.html
您可能感興趣的文章
- 01-10使用C++實(shí)現(xiàn)全排列算法的方法詳解
 - 01-10深入第K大數(shù)問(wèn)題以及算法概要的詳解
 - 01-10深入N皇后問(wèn)題的兩個(gè)最高效算法的詳解
 - 01-10用C++實(shí)現(xiàn)DBSCAN聚類算法
 - 01-10深入全排列算法及其實(shí)現(xiàn)方法
 - 01-10全排列算法的非遞歸實(shí)現(xiàn)與遞歸實(shí)現(xiàn)的方法(C++)
 - 01-10貪心算法 WOODEN STICKS 實(shí)例代碼
 - 01-10輸出1000以內(nèi)的素?cái)?shù)的算法(實(shí)例代碼)
 - 01-10快速模式匹配算法(KMP)的深入理解
 - 01-10海量數(shù)據(jù)處理系列之:用C++實(shí)現(xiàn)Bitmap算法
 


閱讀排行
- 1C語(yǔ)言 while語(yǔ)句的用法詳解
 - 2java 實(shí)現(xiàn)簡(jiǎn)單圣誕樹的示例代碼(圣誕
 - 3利用C語(yǔ)言實(shí)現(xiàn)“百馬百擔(dān)”問(wèn)題方法
 - 4C語(yǔ)言中計(jì)算正弦的相關(guān)函數(shù)總結(jié)
 - 5c語(yǔ)言計(jì)算三角形面積代碼
 - 6什么是 WSH(腳本宿主)的詳細(xì)解釋
 - 7C++ 中隨機(jī)函數(shù)random函數(shù)的使用方法
 - 8正則表達(dá)式匹配各種特殊字符
 - 9C語(yǔ)言十進(jìn)制轉(zhuǎn)二進(jìn)制代碼實(shí)例
 - 10C語(yǔ)言查找數(shù)組里數(shù)字重復(fù)次數(shù)的方法
 
本欄相關(guān)
- 04-02c語(yǔ)言函數(shù)調(diào)用后清空內(nèi)存 c語(yǔ)言調(diào)用
 - 04-02func函數(shù)+在C語(yǔ)言 func函數(shù)在c語(yǔ)言中
 - 04-02c語(yǔ)言的正則匹配函數(shù) c語(yǔ)言正則表達(dá)
 - 04-02c語(yǔ)言用函數(shù)寫分段 用c語(yǔ)言表示分段
 - 04-02c語(yǔ)言中對(duì)數(shù)函數(shù)的表達(dá)式 c語(yǔ)言中對(duì)
 - 04-02c語(yǔ)言編寫函數(shù)冒泡排序 c語(yǔ)言冒泡排
 - 04-02c語(yǔ)言沒(méi)有round函數(shù) round c語(yǔ)言
 - 04-02c語(yǔ)言分段函數(shù)怎么求 用c語(yǔ)言求分段
 - 04-02C語(yǔ)言中怎么打出三角函數(shù) c語(yǔ)言中怎
 - 04-02c語(yǔ)言調(diào)用函數(shù)求fibo C語(yǔ)言調(diào)用函數(shù)求
 
隨機(jī)閱讀
- 01-11Mac OSX 打開(kāi)原生自帶讀寫NTFS功能(圖文
 - 01-10使用C語(yǔ)言求解撲克牌的順子及n個(gè)骰子
 - 01-10SublimeText編譯C開(kāi)發(fā)環(huán)境設(shè)置
 - 01-10delphi制作wav文件的方法
 - 01-10C#中split用法實(shí)例總結(jié)
 - 01-11ajax實(shí)現(xiàn)頁(yè)面的局部加載
 - 08-05dedecms(織夢(mèng))副欄目數(shù)量限制代碼修改
 - 08-05DEDE織夢(mèng)data目錄下的sessions文件夾有什
 - 08-05織夢(mèng)dedecms什么時(shí)候用欄目交叉功能?
 - 04-02jquery與jsp,用jquery
 


