27     Node** heads;   member
58     // Allocate space for the array of list heads  in HashCreate()
60     if (((*hash)->heads = malloc(table_size*sizeof(*((*hash)->heads)))) == NULL)  in HashCreate()
68         (*hash)->heads[i] = NULL;  in HashCreate()
80     Node* temp = hash->heads[index];  in HashInsert()
84     if ((hash->heads[index] = malloc(sizeof(Node))) == NULL)  in HashInsert()
87     hash->heads[index]->entry = malloc(sizeof(Entry));  in HashInsert()
88     hash->heads[index]->entry->key = malloc(strlen(entry->key)+1);  in HashInsert()
89     hash->heads[index]->entry->value = malloc(strlen(entry->value)+1);  in HashInsert()
90     strcpy(hash->heads[index]->entry->key, entry->key);  in HashInsert()
91     strcpy(hash->heads[index]->entry->value, entry->value);  in HashInsert()
93     hash->heads[index]->next = temp;  in HashInsert()
103     Node* temp = hash->heads[index];  in HashFind()
120     Node* temp1 = hash->heads[index];  in HashRemove()
127             if (temp1 == hash->heads[index])  in HashRemove()
128                 hash->heads[index] = hash->heads[index]->next;  in HashRemove()
153     if (hash == NULL || hash->heads == NULL)  in HashPrint()
158         Node* temp = hash->heads[i];  in HashPrint()
179         Node* temp = hash->heads[i];  in HashDestroy()
195     free(hash->heads);  in HashDestroy()
196     hash->heads = NULL;  in HashDestroy()