Lines Matching full:hash
17 * Hash table. The dominant calls are add and lookup, with removals
42 * Create and initialize a hash table.
109 * Count up the number of tombstone entries in the hash table.
124 * Resize a hash table. We do this when adding an entry increased the
129 * If multiple threads can access the hash table, the table's lock should
223 LOGE("Dalvik hash resize failure\n");
284 * Scan every entry in the hash table and evaluate it with the specified
316 * Execute a function on every entry in the hash table.
382 * Evaluate the amount of probing required for the specified hash table.
384 * We do this by running through all entries in the hash table, computing
385 * the hash value and then doing a lookup.
