mirror of
https://github.com/TheAlgorithms/C
synced 2024-11-22 05:21:49 +03:00
93 lines
2.1 KiB
C
93 lines
2.1 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
#include "hash_set.h"
|
|
|
|
extern hash_set_t *init_hash_set()
|
|
{
|
|
hash_set_t *set = (hash_set_t *)malloc(sizeof(hash_set_t));
|
|
set->keys = calloc(DEFAULT_HASH_SET_CAPACITY, sizeof(void **));
|
|
set->values = calloc(DEFAULT_HASH_SET_CAPACITY, sizeof(void **));
|
|
set->length = 0;
|
|
set->capacity = DEFAULT_HASH_SET_CAPACITY;
|
|
|
|
return set;
|
|
}
|
|
|
|
unsigned add(hash_set_t *set, void *value)
|
|
{
|
|
return put(set, hash(value), value);
|
|
}
|
|
|
|
unsigned put(hash_set_t *set, long long hash, void *value)
|
|
{
|
|
if (contains_hash(set, hash)) {
|
|
if (set->keys[retrieve_index_from_hash(hash, set->capacity)] == value) {
|
|
return 0;
|
|
}
|
|
|
|
// collision
|
|
resize(set);
|
|
|
|
return put(set, hash, value);
|
|
}
|
|
|
|
set->keys[retrieve_index_from_hash(hash, set->capacity)] = value;
|
|
set->values[set->length++] = value;
|
|
|
|
return 1;
|
|
}
|
|
|
|
int contains(hash_set_t *set, void *value)
|
|
{
|
|
return set->keys[retrieve_index_from_hash(hash(value), set->capacity)] == value ? 1 : 0;
|
|
}
|
|
|
|
int contains_hash(hash_set_t *set, long long hash)
|
|
{
|
|
return set->keys[retrieve_index_from_hash(hash, set->capacity)] ? 1 : 0;
|
|
}
|
|
|
|
void delete(hash_set_t *set, void *value) {
|
|
set->keys[retrieve_index_from_hash(hash(value), set->capacity)] = NULL;
|
|
}
|
|
|
|
|
|
// adler_32 hash
|
|
long long hash(void *value)
|
|
{
|
|
char *str = value;
|
|
|
|
int a = 1;
|
|
int b = 0;
|
|
const int MODADLER = 65521;
|
|
|
|
for (int i = 0; str[i] != '\0'; i++) {
|
|
a = (a + str[i]) % MODADLER;
|
|
b = (b + a) % MODADLER;
|
|
}
|
|
|
|
return (b << 16) | a;
|
|
}
|
|
|
|
unsigned retrieve_index_from_hash(const long long hash, const unsigned capacity)
|
|
{
|
|
return (capacity - 1) & (hash ^ (hash >> 12));
|
|
}
|
|
|
|
void resize(hash_set_t *set)
|
|
{
|
|
void **keys_resized = calloc((set->capacity <<= 1), sizeof(void **));
|
|
|
|
for (int i = 0; i < set->length; i++) {
|
|
keys_resized[retrieve_index_from_hash(hash(set->values[i]), set->capacity)] = set->values[i];
|
|
}
|
|
|
|
free(set->keys);
|
|
|
|
set->keys = keys_resized;
|
|
|
|
void **new_values = (void **)realloc(set->values, set->capacity * sizeof(void **));
|
|
set->values = new_values;
|
|
}
|