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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
#include "./include/hash_table.h"
#include "./include/ast.h"
#include "./include/macros.h"
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
pair_t *init_pair(char *key, ast_t *value) {
pair_t *p = (pair_t *)malloc(sizeof(pair_t));
if (p == NULL)
die("malloc on pair");
p->key = key;
p->value = value;
return p;
}
sl_node_t *init_sl_node(char *key, ast_t *value) {
sl_node_t *n = (sl_node_t *)malloc(sizeof(sl_node_t));
if (n == NULL)
die("malloc on node");
n->value = init_pair(key, value);
n->next = NULL;
return n;
}
/*** SINGLY LINKED LIST FUNCTIONS ***/
sl_list_t *init_sl_list() {
sl_list_t *l = (sl_list_t *)malloc(sizeof(sl_list_t));
if (l == NULL)
die("malloc on list");
l->size = 0;
l->head = NULL;
return l;
}
void sl_list_add(sl_list_t *l, char *key, ast_t *value) {
sl_node_t *cur = l->head;
bool modified = false;
if (l->head == NULL) {
l->head = init_sl_node(key, value);
l->size++;
}
for (int i = 0; i < l->size - 1; i++) {
if (strcmp(cur->value->key, key) == 0) {
cur->value->value = value;
modified = true;
break;
}
cur = cur->next;
}
if (strcmp(cur->value->key, key) == 0) {
cur->value->value = value;
modified = true;
}
if (!modified) {
cur->next = init_sl_node(key, value);
l->size++;
}
}
ast_t *sl_list_get(sl_list_t *l, char *key) {
sl_node_t *cur = l->head;
for (int i = 0; i < l->size; i++) {
if (strcmp(cur->value->key, key) == 0)
return cur->value->value;
cur = cur->next;
}
return NULL;
}
bool sl_list_exists(sl_list_l, char *key) {
if (sl_list_get(l, key) != NULL)
return true;
return false;
}
void sl_list_free(sl_list_t *l) {
sl_node_t *cur = l->head;
sl_node_t *tmp;
for (int i = 0; i < l->size; i++) {
tmp = cur;
cur = cur->next;
free(tmp);
}
free(l);
}
/*** HASH TABLE FUNCTIONS ***/
hash_table_t *init_hash_table(int size) {
hash_table_t *h = (hash_table_t *)malloc(sizeof(hash_table_t));
if (h == NULL)
die("malloc on hash table");
h->size = size;
h->buckets = malloc(sizeof(sl_list_t *));
if (h->buckets == NULL)
die("malloc on buckets");
for (int i = 0; i < h->size; i++)
h->buckets[i] = init_sl_list();
return h;
}
void hash_table_add(hash_table_t *h, char *key, ast_t *value) {
sl_list_t *l = h->buckets[hash(key, h->size)];
sl_list_add(l, key, value);
}
ast_t *hash_table_get(hash_table_t *h, char *key) {
sl_list_t *l = h->buckets[hash(key, h->size)];
return sl_list_get(l, key);
}
void hash_table_free(hash_table_t *h) {
for (int i = 0; i < h->size; i++)
sl_list_free(h->buckets[i]);
free(h);
}
bool hash_table_exists(hash_table_t *h, char *key) {
sl_list_t *l = h->buckets[hash(key, h->size)];
return sl_list_exists(l, key);
}
/* DJB2 HASH FUNCTION */
unsigned long hash(char *key, int size) {
unsigned long hash = 5381;
int c;
while ((c = *key++))
hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
return hash % size;
}
|
