Add or Find: * dictAddOrFind() is simply a version of dictAddRaw() that always * returns the hash entry of the specified key, even if the key already * exists and can't be added (in that case the entry of the already * existing key is returned.) * * See dictAddRaw() for more information. */
| 380 | * |
| 381 | * See dictAddRaw() for more information. */ |
| 382 | dictEntry *dictAddOrFind(dict *d, void *key) { |
| 383 | dictEntry *entry, *existing; |
| 384 | entry = dictAddRaw(d,key,&existing); |
| 385 | return entry ? entry : existing; |
| 386 | } |
| 387 | |
| 388 | /* Search and remove an element. This is an helper function for |
| 389 | * dictDelete() and dictUnlink(), please check the top comment |
no test coverage detected