Lines Matching full:hash
27 * \brief HashBucket is an entry in the hash table.
48 * HashTableImpl uses open-addressing, linear probing hash table.
49 * linear probing hash table obviously has high performance when the
52 * than the size of the hash table.
62 * example, on-device linkers needs a more light-weight hash function
64 * change the hash functions.
96 hasher& hash()
99 const hasher& hash() const
103 /// initialize the hash table.
119 /// doRehash - re-new the hash table, and rehash all elements into the new buckets
