Function HashTableReplace

src/util/dict.c:436–457

Add or Overwrite: * Add an element, discarding the old value if the key already exists. * Return 1 if the key was added from scratch, 0 if there was already an * element with such key and HashTableReplace() just performed a value update * operation. */

 * element with such key and HashTableReplace() just performed a value update
 * operation. */
int HashTableReplace(dict *d, void *key, void *val)
{
    dictEntry *entry, *existing, auxentry;

    /* Try to add the element. If the key
     * does not exists HashTableAdd will succeed. */
    entry = HashTableAddRaw(d,key,&existing);
    if (entry) {
        HashTableSetVal(d, entry, val);
        return 1;
    }

    /* Set the new value and free the old one. Note that it is important
     * to do that in this order, as the value may just be exactly the same
     * as the previous one. In this context, think to reference counting,
     * you want to increment (set), and then decrement (free), and not the
     * reverse. */
    auxentry = *existing;
    HashTableSetVal(d, existing, val);
    dictFreeVal(d, &auxentry);
    return 0;
}

/* Add or Find:
 * HashTableAddOrFind() is simply a version of HashTableAddRaw() that always