Lines Matching full:hash
4 * Hash table. The dominant calls are add and lookup, with removals
13 #include "Hash.h"
49 * Create and initialize a hash table.
113 * Count up the number of tombstone entries in the hash table.
128 * Resize a hash table. We do this when adding an entry increased the
133 * If multiple threads can access the hash table, the table's lock should
227 LOGE("Dalvik hash resize failure\n");
288 * Execute a function on every entry in the hash table.
354 * Evaluate the amount of probing required for the specified hash table.
356 * We do this by running through all entries in the hash table, computing
357 * the hash value and then doing a lookup.
