/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
rehash.pass.cpp | 16 // void rehash(size_type n); 51 c.rehash(3); 55 c.rehash(3); 58 c.rehash(31); 79 c.rehash(3); 83 c.rehash(3); 86 c.rehash(31);
|
eq.pass.cpp | 84 c2.rehash(30); 152 c2.rehash(30);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
rehash.pass.cpp | 16 // void rehash(size_type n); 50 c.rehash(3); 54 c.rehash(3); 57 c.rehash(31); 78 c.rehash(3); 82 c.rehash(3); 85 c.rehash(31);
|
eq.pass.cpp | 92 c2.rehash(30); 169 c2.rehash(30);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
rehash.pass.cpp | 16 // void rehash(size_type n); 50 c.rehash(3); 54 c.rehash(3); 57 c.rehash(31); 78 c.rehash(3); 82 c.rehash(3); 85 c.rehash(31);
|
eq.pass.cpp | 83 c2.rehash(30); 148 c2.rehash(30);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
rehash.pass.cpp | 16 // void rehash(size_type n); 79 c.rehash(3); 83 c.rehash(3); 86 c.rehash(31); 107 c.rehash(3); 111 c.rehash(3); 114 c.rehash(31);
|
eq.pass.cpp | 93 c2.rehash(30); 170 c2.rehash(30);
|
/frameworks/compile/mclinker/include/mcld/ADT/ |
HashTable.h | 95 /// rehash - if the load factor is larger than 75%, or the empty buckets is 96 // less than 12.5%, the rehash the hash table 97 void rehash(); 99 /// rehash - immediately re-new the hash table to the size pCount, and 100 // rehash all elements. 101 void rehash(size_type pCount);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
unordered_set | 143 void rehash(size_type n); 282 void rehash(size_type n); 515 void rehash(size_type __n) {__table_.rehash(__n);} 525 __table_.rehash(__n); 533 __table_.rehash(__n); 551 __table_.rehash(__n); 562 __table_.rehash(__n); 579 __table_.rehash(__u.bucket_count()); 588 __table_.rehash(__u.bucket_count()) [all...] |
unordered_map | 152 void rehash(size_type n); 294 void rehash(size_type n); [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ext/ |
hash_set | 238 hash_set() {__table_.rehash(193);} 323 void resize(size_type __n) {__table_.rehash(__n);} 331 __table_.rehash(__n); 339 __table_.rehash(__n); 347 __table_.rehash(193); 358 __table_.rehash(__n); 369 __table_.rehash(__n); 378 __table_.rehash(__u.bucket_count()); 459 hash_multiset() {__table_.rehash(193);} 543 void resize(size_type __n) {__table_.rehash(__n); [all...] |
hash_map | 522 _LIBCPP_INLINE_VISIBILITY hash_map() {__table_.rehash(193);} 614 void resize(size_type __n) {__table_.rehash(__n);} 625 __table_.rehash(__n); 634 __table_.rehash(__n); 642 __table_.rehash(193); 653 __table_.rehash(__n); 664 __table_.rehash(__n); 673 __table_.rehash(__u.bucket_count()); 800 hash_multimap() {__table_.rehash(193);} [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
prog_cache.c | 82 rehash(struct gl_program_cache *cache) function 215 rehash(cache); 243 rehash(cache);
|
/external/iproute2/tc/ |
q_sfb.c | 31 "Usage: ... sfb [ rehash SECS ] [ db SECS ]\n" 66 if (strcmp(*argv, "rehash") == 0) { 69 fprintf(stderr, "Illegal \"rehash\"\n");
|
/external/mesa3d/src/mesa/program/ |
prog_cache.c | 82 rehash(struct gl_program_cache *cache) function 215 rehash(cache); 243 rehash(cache);
|
/libcore/luni/src/main/java/java/io/ |
SerializationHandleMap.java | 34 /* Maximum number of elements that can be put in this map before having to rehash. */ 104 rehash(); method 118 private void rehash() { method in class:SerializationHandleMap
|
/system/core/include/utils/ |
LruCache.h | 94 void rehash(size_t newCapacity); 146 rehash(mTable->capacity() * 2); 223 void LruCache<TKey, TValue>::rehash(size_t newCapacity) { function in class:android::LruCache
|
BasicHashtable.h | 72 void rehash(size_t minimumCapacity, float loadFactor); 288 * its contents are rehashed. See rehash(). 328 inline void rehash(size_t minimumCapacity, float loadFactor) { function in class:android::BasicHashtable 329 BasicHashtableImpl::rehash(minimumCapacity, loadFactor); 334 * complete without performing a rehash.
|
/system/core/libutils/tests/ |
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);
|
/external/iproute2/man/man8/ |
tc-sfb.8 | 6 .B rehash 79 rehash 99 rehash.
|
/external/e2fsprogs/e2fsck/ |
Android.mk | 93 rehash.c \
|
/external/emma/core/java12/com/vladium/util/ |
SoftValueMap.java | 278 if (m_size >= m_sizeThreshold) rehash (); method 470 private void rehash () method in class:SoftValueMap 483 // rehash all entry chains in every bucket: 529 if (m_size > newSize) System.out.println ("DEBUG: rehash() cleared " + (m_size - newSize) + " values, new size = " + newSize); 540 * See comments below for why this is safe wrt to rehash(). 553 if (bucketIndex >= 0) // skip keys that were already removed by rehash() 555 // [assertion: this reference was not cleared when the last rehash() ran and so its m_bucketIndex is correct] 590 // else: it has already been removed by rehash() or other methods
|
/system/core/sh/ |
exec.c | 93 char rehash; /* if set, cd done since entry created */ member in struct:tblentry 414 if (cmdp->rehash) 490 if (cmdp->rehash == 0) 502 if (cmdp) { /* doing a rehash */ 527 /* if rehash, don't redo absolute path names */ 605 cmdp->rehash = 0; 679 cmdp->rehash = 1; 841 cmdp->rehash = 0;
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
ExpandedNameTable.java | 34 * code. We only need to implement the rehash() interface which is used to 212 rehash(); method 245 private void rehash() method in class:ExpandedNameTable
|