Function HashTableFind

src/util/dict.c:586–609

}

dictEntry *HashTableFind(dict *d, const void *key)
{
    dictEntry *he;
    uint64_t h, idx, table;

    if (dictSize(d) == 0) return NULL; /* dict is empty */
    if (dictIsRehashing(d)) _dictRehashStep(d);
    h = dictHashKey(d, key);
	//printf("HashTableFind hash: %llu\n", h);
    for (table = 0; table <= 1; table++) {
        idx = h & DICTHT_SIZE_MASK(d->ht_size_exp[table]);
        he = d->ht_table[table][idx];
        while(he) {
			//printf("key: %llu, he->key: %llu\n", key, he->key);
            if (key==he->key || dictCompareKeys(d, key, he->key)) {
				//printf("keys are the same!\n");
                return he;
			}
            he = he->next;
        }
        if (!dictIsRehashing(d)) return NULL;
    }
    return NULL;
}

void *HashTableFetchValue(dict *d, const void *key) {
    dictEntry *he;