Lines Matching refs:entry
20 struct HashTable::entry {
21 entry* next;
56 struct entry *entry, *next;
58 for (entry = fTable[index]; entry != NULL; entry = next) {
59 next = entry->next;
62 delete entry->value;
63 delete entry;
75 struct entry* entry = _GetHashEntry(key);
77 return entry != NULL ? entry->value : NULL;
84 struct entry *entry = _GetHashEntry(*value);
89 if (entry != NULL)
97 entry = new (nothrow) HashTable::entry;
98 if (entry == NULL)
101 entry->value = value;
102 entry->next = fTable[index];
103 fTable[index] = entry;
112 struct entry* previous = NULL;
113 struct entry* entry;
123 for (entry = fTable[index]; entry != NULL; entry = entry->next) {
124 if (entry->value->Hash() == hash && entry->value->CompareTo(key)) {
129 previous->next = entry->next;
131 fTable[index] = entry->next;
134 value = entry->value;
135 delete entry;
139 previous = entry;
148 struct entry** newTable;
157 newTable = (struct entry **)malloc(newCapacity * sizeof(struct entry *));
161 memset(newTable, 0, newCapacity * sizeof(struct entry *));
166 struct entry* entry;
167 struct entry* next;
169 for (entry = fTable[i]; entry != NULL; entry = next) {
170 next = entry->next;
172 int32 index = entry->value->Hash() % newCapacity;
173 entry->next = newTable[index];
174 newTable[index] = entry;
189 struct HashTable::entry *
192 struct entry* entry;
198 for (entry = fTable[hash % fCapacity]; entry != NULL; entry = entry->next) {
199 if (entry->value->Hash() == hash && entry->value->CompareTo(key))
200 return entry;