Function HashTableAddOrFind

src/util/dict.c:466–470

Add or Find: * HashTableAddOrFind() is simply a version of HashTableAddRaw() 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 HashTableAddRaw() for more information. */

 *
 * See HashTableAddRaw() for more information. */
dictEntry *HashTableAddOrFind(dict *d, void *key) {
    dictEntry *entry, *existing;
    entry = HashTableAddRaw(d,key,&existing);
    return entry ? entry : existing;
}

/* Search and remove an element. This is a helper function for
 * HashTableDelete() and HashTableUnlink(), please check the top comment