Remove an element from the table, but without actually releasing * the key, value and dictionary entry. The dictionary entry is returned * if the element was found (and unlinked from the table), and the user * should later call `HashTableFreeUnlinkedEntry()` with it in order to release it. * Otherwise if the key is not found, NULL is returned. * * This function is useful when we want to remo
| 536 | * HashTableFreeUnlinkedEntry(entry); // <- This does not need to lookup again. |
| 537 | */ |
| 538 | dictEntry *HashTableUnlink(dict *d, const void *key) { |
| 539 | return dictGenericDelete(d,key,1); |
| 540 | } |
| 541 | |
| 542 | /* You need to call this function to really free the entry after a call |
| 543 | * to HashTableUnlink(). It's safe to call this function with 'he' = NULL. */ |
nothing calls this directly
no test coverage detected