void ntt_insert(struct ntt *ntt, const char *key, time_t timestamp) {
long hash_code;
struct ntt_node *parent;
struct ntt_node *node;
struct ntt_node *new_node = NULL;
if( !ntt ) {
return;
}
hash_code = ntt_hashcode(ntt, key);
parent = NULL;
node = ntt->tbl[hash_code];
while (node != NULL) {
if (strcmp(key, node->key) == 0) {
new_node = node;
node = NULL;
}
if (new_node == NULL) {
parent = node;
node = node->next;
}
}
if (new_node != NULL) {
new_node->timestamp = timestamp;
new_node->count = 0;
return;
}
/* Create a new node */
new_node = ntt_node_create(key);
new_node->timestamp = timestamp;
new_node->timestamp = 0;
ntt->items++;
/* Insert */
if (parent) { /* Existing parent */
parent->next = new_node;
return;
}
/* No existing parent; add directly to hash table */
ntt->tbl[hash_code] = new_node;
}
struct ntt_node *ntt_find(struct ntt *ntt, const char *key) {
long hash_code;
struct ntt_node *node;
if (ntt == NULL) return NULL;
hash_code = ntt_hashcode(ntt, key);
node = ntt->tbl[hash_code];
while (node) {
if (!strcmp(key, node->key)) {
return(node);
}
node = node->next;
}
return((struct ntt_node *)NULL);
}
int ntt_delete(struct ntt *ntt, const char *key) {
long hash_code;
struct ntt_node *parent = NULL;
struct ntt_node *node;
struct ntt_node *del_node = NULL;
if (ntt == NULL) return -1;
hash_code = ntt_hashcode(ntt, key);
node = ntt->tbl[hash_code];
while (node != NULL) {
if (strcmp(key, node->key) == 0) {
del_node = node;
node = NULL;
}
if (del_node == NULL) {
parent = node;
node = node->next;
}
}
if (del_node != NULL) {
if (parent) {
parent->next = del_node->next;
} else {
ntt->tbl[hash_code] = del_node->next;
}
free(del_node->key);
free(del_node);
ntt->items--;
return 0;
}
return -5;
}
