66 lines
1.4 KiB
C
66 lines
1.4 KiB
C
|
#define _CRT_SECURE_NO_WARNINGS
|
|||
|
|
#include <string.h>
|
|||
|
|
#include <stdlib.h>
|
|||
|
|
#include "Dict.h"
|
|||
|
|
#include "fnvhash_32a.h"
|
|||
|
|
#include "jhash.h"
|
|||
|
|
|
|||
|
|
#ifdef DICT_HASH_OPEN_ADDRESS_C
|
|||
|
|
|
|||
|
|
#define MAX_HASH 16384
|
|||
|
|
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
char* hashtable[MAX_HASH];
|
|||
|
|
|
|||
|
|
int hash(char* word) {
|
|||
|
|
int hash_value = (int)fnv_32a_str(word, FNV1_32A_INIT);
|
|||
|
|
hash_value = TINY_FNV(14, hash_value);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
void Insert(char* word) {
|
|||
|
|
int hash_value = hash(word);
|
|||
|
|
|
|||
|
|
while (hashtable[hash_value] != NULL && strcmp(hashtable[hash_value], word) != 0) {
|
|||
|
|
hash_value++;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
hashtable[hash_value] = (char*)calloc(strlen(word) + 1, sizeof(char));
|
|||
|
|
if (hashtable[hash_value] == NULL) {
|
|||
|
|
puts("Out of memory");
|
|||
|
|
exit(1);
|
|||
|
|
}
|
|||
|
|
strcpy(hashtable[hash_value], word);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
/* MEMBER <20> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD>. */
|
|||
|
|
int Member(char* word) {
|
|||
|
|
int hash_value = hash(word);
|
|||
|
|
|
|||
|
|
int i = 0;
|
|||
|
|
while (hashtable[hash_value] != NULL) {
|
|||
|
|
if (strcmp(hashtable[hash_value], word) == 0) {
|
|||
|
|
return 1;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
return 0;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
/* CREATE - <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>.
|
|||
|
|
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>. */
|
|||
|
|
void Create() {
|
|||
|
|
for (int i = 0; i < MAX_HASH; i++)
|
|||
|
|
hashtable[i] = NULL;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
/* DESTROY - <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>.
|
|||
|
|
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>. */
|
|||
|
|
void Destroy() {
|
|||
|
|
for (int i = 0; i < MAX_HASH; i++) {
|
|||
|
|
free(hashtable[i]);
|
|||
|
|
hashtable[i] = NULL;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
#endif
|