Searched refs:rehash (Results 1 - 6 of 6) sorted by relevance
/frameworks/compile/mclinker/include/mcld/ADT/ |
H A D | HashTable.h | 96 /// rehash - if the load factor is larger than 75%, or the empty buckets is 97 // less than 12.5%, the rehash the hash table 98 void rehash(); 100 /// rehash - immediately re-new the hash table to the size pCount, and 101 // rehash all elements. 102 void rehash(size_type pCount);
|
/frameworks/compile/mclinker/include/mcld/LD/ |
H A D | StringUnorderedMap.h | 91 void rehash(size_t pCapacity); 129 this->rehash(nextSize); 138 StringUnorderedMapImpl::rehash(size_t pCapacity) function in class:mcld::StringUnorderedMap::StringUnorderedMapImpl
|
/frameworks/native/include/utils/ |
H A D | BasicHashtable.h | 71 void rehash(size_t minimumCapacity, float loadFactor); 287 * its contents are rehashed. See rehash(). 327 inline void rehash(size_t minimumCapacity, float loadFactor) { function in class:android::BasicHashtable 328 BasicHashtableImpl::rehash(minimumCapacity, loadFactor);
|
/frameworks/native/libs/utils/tests/ |
H A D | BasicHashtable_test.cpp | 437 h.rehash(h.capacity(), h.loadFactor()); 448 h.rehash(9, 1.0f); 465 h.rehash(0, 0.75f); 482 h.rehash(0, 0.75f); 565 // rehash copies shared contents 569 h1.rehash(10, 1.0f);
|
/frameworks/compile/mclinker/lib/LD/ |
H A D | NamePool.cpp | 117 m_Table.rehash(pSize);
|
/frameworks/native/libs/utils/ |
H A D | BasicHashtable.cpp | 171 rehash(mCapacity * 2, mLoadFactor); 198 void BasicHashtableImpl::rehash(size_t minimumCapacity, float loadFactor) { function in class:android::BasicHashtableImpl
|
Completed in 367 milliseconds