mirror of
https://github.com/TheAlgorithms/C
synced 2024-11-22 05:21:49 +03:00
ff2e7a3528
* added hash folder to CMAKE build
* split sdbm code from hash.c to independent program
* update readme file
* docs + vartype fix
* split djb2 code from hash.c to independent program
* fix function reference
* split xor8 code from hash.c to independent program
* split adler32 code from hash.c to independent program
* remove additional author
* split crc32 code from hash.c to independent program
* remove redundant files
* interpret large numbers as specific types
* disable eror clang-diagnostic-implicitly-unsigned-literal
* force use constants
* updating DIRECTORY.md
* clang-tidy fixes for 606e5d4fce
* added return in function doc to enable doc
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
52 lines
989 B
C
52 lines
989 B
C
/**
|
|
* @addtogroup hash Hash algorithms
|
|
* @{
|
|
* @file hash_xor8.c
|
|
* @author [Christian Bender](https://github.com/christianbender)
|
|
* @brief 8-bit [XOR hash](https://en.wikipedia.org/wiki/XOR_cipher) algorithm
|
|
* for ASCII characters
|
|
*/
|
|
#include <assert.h>
|
|
#include <inttypes.h>
|
|
#include <stdio.h>
|
|
|
|
/**
|
|
* @brief 8-bit XOR algorithm implementation
|
|
*
|
|
* @param s NULL terminated ASCII string to hash
|
|
* @return 8-bit hash result
|
|
*/
|
|
uint8_t xor8(const char* s)
|
|
{
|
|
uint8_t hash = 0;
|
|
size_t i = 0;
|
|
while (s[i] != '\0')
|
|
{
|
|
hash = (hash + s[i]) & 0xff;
|
|
i++;
|
|
}
|
|
return (((hash ^ 0xff) + 1) & 0xff);
|
|
}
|
|
|
|
/**
|
|
* @brief Test function for ::xor8
|
|
* \returns None
|
|
*/
|
|
void test_xor8()
|
|
{
|
|
assert(xor8("Hello World") == 228);
|
|
assert(xor8("Hello World!") == 195);
|
|
assert(xor8("Hello world") == 196);
|
|
assert(xor8("Hello world!") == 163);
|
|
printf("Tests passed\n");
|
|
}
|
|
|
|
/** @} */
|
|
|
|
/** Main function */
|
|
int main()
|
|
{
|
|
test_xor8();
|
|
return 0;
|
|
}
|