| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.map/ |
| rehash.pass.cpp | 16 // void rehash(size_type n);
48 c.rehash(3);
52 c.rehash(3);
55 c.rehash(31);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multiset/ |
| rehash.pass.cpp | 16 // void rehash(size_type n);
47 c.rehash(3);
51 c.rehash(3);
54 c.rehash(31);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.set/ |
| rehash.pass.cpp | 16 // void rehash(size_type n);
47 c.rehash(3);
51 c.rehash(3);
54 c.rehash(31);
|
| eq.pass.cpp | 81 c2.rehash(30);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multimap/ |
| rehash.pass.cpp | 16 // void rehash(size_type n);
77 c.rehash(3);
81 c.rehash(3);
84 c.rehash(31);
|
| reserve.pass.cpp | 16 // void rehash(size_type n);
|
| /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++/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++/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...] |
| /frameworks/native/include/utils/ |
| LruCache.h | 87 void rehash(size_t newCapacity);
139 rehash(mTable->capacity() * 2);
216 void LruCache<TKey, TValue>::rehash(size_t newCapacity) { function in class:android::LruCache
|
| 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);
333 * complete without performing a rehash.
|
| /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
|
| /frameworks/native/libs/utils/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/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
|
| IntIntMap.java | 198 if (m_size >= m_sizeThreshold) rehash (); method
284 private void rehash () method in class:IntIntMap
295 // rehash all entry chains in every bucket:
|
| IntObjectMap.java | 187 if (m_size >= m_sizeThreshold) rehash (); method
242 private void rehash () method in class:IntObjectMap
253 // rehash all entry chains in every bucket:
|
| IntSet.java | 159 if (m_size >= m_sizeThreshold) rehash (); method
214 private void rehash () method in class:IntSet
225 // rehash all entry chains in every bucket:
|
| ObjectIntMap.java | 191 if (m_size >= m_sizeThreshold) rehash (); method
280 private void rehash () method in class:ObjectIntMap
291 // rehash all entry chains in every bucket:
|
| /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/webkit/Source/JavaScriptCore/runtime/ |
| PropertyMapHashTable.h | 192 // Rehash the table. Used to grow, or to recover deleted slots.
193 void rehash(unsigned newCapacity);
367 rehash(m_keyCount + 1);
403 rehash(m_keyCount);
487 inline void PropertyTable::rehash(unsigned newCapacity) function in class:JSC::PropertyTable
|
| /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
|
| /external/llvm/lib/Support/ |
| StringMap.cpp | 190 // grow/rehash the table.
207 // Rehash all the items into their new buckets. Luckily :) we already have
208 // the hash values available, so we don't have to rehash any strings.
|
