-
-
Notifications
You must be signed in to change notification settings - Fork 4.4k
/
hash_djb2.c
50 lines (46 loc) · 1017 Bytes
/
hash_djb2.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
/**
* @addtogroup hash Hash algorithms
* @{
* @file hash_djb2.c
* @author [Christian Bender](https://github.com/christianbender)
* @brief [DJB2 hash algorithm](http://www.cse.yorku.ca/~oz/hash.html)
*/
#include <assert.h>
#include <inttypes.h>
#include <stdio.h>
/**
* @brief DJB2 algorithm implementation
*
* @param s NULL terminated string to hash
* @return 64-bit hash result
*/
uint64_t djb2(const char* s)
{
uint64_t hash = 5381; /* init value */
size_t i = 0;
while (s[i] != '\0')
{
hash = ((hash << 5) + hash) + s[i];
i++;
}
return hash;
}
/**
* Test function for ::djb2
* \returns none
*/
void test_djb2(void)
{
assert(djb2("Hello World") == 13827776004929097857);
assert(djb2("Hello World!") == 13594750393630990530);
assert(djb2("Hello world") == 13827776004967047329);
assert(djb2("Hello world!") == 13594750394883323106);
printf("Tests passed\n");
}
/** @} */
/** Main function */
int main()
{
test_djb2();
return 0;
}