Lines Matching refs:entry
65 struct Entry *entry,*next;
67 for(entry = table[index];entry;entry = next)
69 next = entry->next;
70 delete entry;
103 Entry *entry = GetHashEntry(key);
105 return entry ? entry->value : NULL;
111 Entry *entry = GetHashEntry(key);
115 if (entry)
133 Entry **table,*entry,*prev;
141 for(entry = table[index],prev = NULL;entry;entry = entry->next)
143 if ((func(entry->key) == hash) && fCompareFunc(entry->key,key))
149 prev->next = entry->next;
151 table[index] = entry->next;
154 value = entry->value;
155 delete entry;
159 prev = entry;
201 Entry *entry, *next;
203 for (entry = fTable[index]; entry; entry = next) {
207 delete (void*)entry->key;
210 free((void*)entry->key);
216 delete entry->value;
219 free(entry->value);
222 next = entry->next;
223 delete entry;
260 Entry *oldEntry,*entry = NULL;
264 entry = oldEntry; oldEntry = oldEntry->next;
266 index = hashCode(entry->key) % newCapacity;
267 entry->next = newtable[index];
268 newtable[index] = entry;
279 Entry **table,*entry;
285 for(entry = table[hash % fCapacity];entry;entry = entry->next)
287 if ((func(entry->key) == hash) && fCompareFunc(entry->key,key))
288 return entry;