|
1 | | -#include "hash_table.h" |
| 1 | +#include "../includes/hash_table.h" |
2 | 2 | #include <stdio.h> |
3 | 3 | #include <stdlib.h> |
4 | 4 | #include <string.h> |
@@ -63,19 +63,19 @@ void *tokenize(char *input, hash_table *hash_table) { |
63 | 63 | } |
64 | 64 |
|
65 | 65 | for (size_t i = 0; i < hash_table->capacity; i++) { |
66 | | - token_t *old_entry = &((token_t*)hash_table->table)[i]; |
| 66 | + token_t *old_entry = &((token_t *)hash_table->table)[i]; |
67 | 67 | if (old_entry->key != NULL) { |
68 | | - size_t new_key = hash(old_entry->key, new_capacity); |
69 | | - size_t original_new_key = new_key; |
70 | | - while (new_table[new_key].key != NULL) { |
71 | | - new_key = (new_key + 1) % new_capacity; |
72 | | - if (new_key == original_new_key) { |
73 | | - break; |
74 | | - } |
| 68 | + size_t new_key = hash(old_entry->key, new_capacity); |
| 69 | + size_t original_new_key = new_key; |
| 70 | + while (new_table[new_key].key != NULL) { |
| 71 | + new_key = (new_key + 1) % new_capacity; |
| 72 | + if (new_key == original_new_key) { |
| 73 | + break; |
75 | 74 | } |
76 | | - new_table[new_key].key = old_entry->key; |
77 | | - new_table[new_key].value = old_entry->value; |
78 | | - new_table[new_key].hash_key = new_key; |
| 75 | + } |
| 76 | + new_table[new_key].key = old_entry->key; |
| 77 | + new_table[new_key].value = old_entry->value; |
| 78 | + new_table[new_key].hash_key = new_key; |
79 | 79 | } |
80 | 80 | } |
81 | 81 | free(hash_table->table); |
@@ -140,7 +140,7 @@ void naive(char *input, hash_table *hash_table) { |
140 | 140 | if (naive_table[i].key == NULL) { |
141 | 141 | naive_table[i].key = strdup(token); |
142 | 142 | if (naive_table[i].key == NULL) { |
143 | | - continue; |
| 143 | + continue; |
144 | 144 | } |
145 | 145 | naive_table[i].value = 1; |
146 | 146 | hash_table->size++; |
|
0 commit comments