字符串hash算法

最新推荐文章于 2024-08-03 12:30:52 发布

Lzg_na

最新推荐文章于 2024-08-03 12:30:52 发布

阅读量396

点赞数 4

分类专栏： 1. C/C++ 12. 基础数据结构和算法文章标签：哈希算法算法散列表

本文链接：https://blog.csdn.net/qq_34799070/article/details/140863725

版权

1. C/C++ 同时被 2 个专栏收录

40 篇文章 3 订阅

订阅专栏

12. 基础数据结构和算法

9 篇文章 0 订阅

订阅专栏

#include "stdio.h"


//ELF Hash算法
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);
}

//Jenkins Hash算法
unsigned int JenkinsHash(char *str, unsigned int len)
{
    unsigned int hash = 0;
    unsigned int i = 0;
    for (i = 0; i < len; str++, i++)
    {
        hash += (*str) + (hash << 10);
        hash ^= (hash >> 6);
    }
    hash += (hash << 3);
    hash ^= (hash >> 11);
    hash += (hash << 15);
    return (hash & 0x7FFFFFFF);
}

unsigned int DJBHash(char *str)
{
    unsigned int hash = 5381;
    while (*str)
    {
        hash += (hash << 5) + (*str++);
    }
    return (hash & 0x7FFFFFFF);
}

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);
}

int main()
{

}