/external/libcxx/test/std/containers/unord/unord.map/ |
H A D | rehash.pass.cpp | 16 // void rehash(size_type n); 58 c.rehash(3); 63 c.rehash(3); 67 c.rehash(31); 89 c.rehash(3); 94 c.rehash(3); 98 c.rehash(31);
|
H A D | eq.pass.cpp | 84 c2.rehash(30); 152 c2.rehash(30);
|
/external/libcxx/test/std/containers/unord/unord.multiset/ |
H A D | rehash.pass.cpp | 16 // void rehash(size_type n); 57 c.rehash(3); 62 c.rehash(3); 66 c.rehash(31); 88 c.rehash(3); 93 c.rehash(3); 97 c.rehash(31);
|
H A D | eq.pass.cpp | 92 c2.rehash(30); 169 c2.rehash(30);
|
/external/libcxx/test/std/containers/unord/unord.set/ |
H A D | rehash.pass.cpp | 16 // void rehash(size_type n); 57 c.rehash(3); 62 c.rehash(3); 66 c.rehash(31); 88 c.rehash(3); 93 c.rehash(3); 97 c.rehash(31);
|
H A D | eq.pass.cpp | 83 c2.rehash(30); 148 c2.rehash(30);
|
/external/libcxx/test/std/containers/unord/unord.multimap/ |
H A D | rehash.pass.cpp | 16 // void rehash(size_type n); 88 c.rehash(3); 93 c.rehash(3); 97 c.rehash(31); 119 c.rehash(3); 124 c.rehash(3); 128 c.rehash(31);
|
H A D | eq.pass.cpp | 93 c2.rehash(30); 170 c2.rehash(30);
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
H A D | CalendarCache.java | 50 rehash(); 73 private void rehash() method in class:CalendarCache
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | CalendarCache.java | 48 rehash(); 71 private void rehash() method in class:CalendarCache
|
/external/mesa3d/src/util/ |
H A D | set.c | 43 * From Knuth -- a good choice for hash/rehash values is p, p-2 where 52 uint32_t max_entries, size, rehash; member in struct:__anon17324 119 ht->rehash = hash_sizes[ht->size_index].rehash; 182 double_hash = 1 + hash % ht->rehash; 228 ht->rehash = hash_sizes[ht->size_index].rehash; 247 * Note that insertion may rearrange the table on a resize or rehash, 292 double_hash = 1 + hash % ht->rehash;
|
H A D | hash_table.c | 54 * From Knuth -- a good choice for hash/rehash values is p, p-2 where 59 uint32_t max_entries, size, rehash; member in struct:__anon17320 126 ht->rehash = hash_sizes[ht->size_index].rehash; 227 double_hash = 1 + hash % ht->rehash; 279 ht->rehash = hash_sizes[ht->size_index].rehash; 340 double_hash = 1 + hash % ht->rehash; 364 * Note that insertion may rearrange the table on a resize or rehash,
|
H A D | set.h | 49 uint32_t rehash; member in struct:set 88 * insertion (which may rehash the set, making entry a dangling
|
H A D | hash_table.h | 53 uint32_t rehash; member in struct:hash_table 135 * (which may rehash the table, making entry a dangling pointer).
|
/external/emma/core/java12/com/vladium/util/ |
H A D | IntObjectMap.java | 187 if (m_size >= m_sizeThreshold) rehash (); 242 private void rehash () method in class:IntObjectMap 253 // rehash all entry chains in every bucket:
|
H A D | IntSet.java | 159 if (m_size >= m_sizeThreshold) rehash (); 214 private void rehash () method in class:IntSet 225 // rehash all entry chains in every bucket:
|
H A D | IntIntMap.java | 198 if (m_size >= m_sizeThreshold) rehash (); 284 private void rehash () method in class:IntIntMap 295 // rehash all entry chains in every bucket:
|
H A D | ObjectIntMap.java | 191 if (m_size >= m_sizeThreshold) rehash (); 280 private void rehash () method in class:ObjectIntMap 291 // rehash all entry chains in every bucket:
|
H A D | SoftValueMap.java | 278 if (m_size >= m_sizeThreshold) rehash (); 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
|
/external/libcxx/benchmarks/ |
H A D | ContainerBenchmarks.hpp | 42 c.rehash(16); 98 c.rehash(8);
|
/external/mesa3d/src/mesa/program/ |
H A D | prog_cache.c | 83 rehash(struct gl_program_cache *cache) function 221 rehash(cache); 250 rehash(cache);
|
/external/apache-http/src/org/apache/commons/logging/impl/ |
H A D | WeakHashtable.java | 315 protected void rehash() { method in class:WeakHashtable 318 super.rehash();
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
H A D | ExpandedNameTable.java | 34 * code. We only need to implement the rehash() interface which is used to 212 rehash(); 245 private void rehash() method in class:ExpandedNameTable
|
/external/parameter-framework/asio/include/asio/detail/ |
H A D | hash_map.hpp | 144 rehash(hash_size(size_ + 1)); 230 void rehash(std::size_t num_buckets) function in class:asio::detail::hash_map
|
/external/parameter-framework/asio-1.10.6/include/asio/detail/ |
H A D | hash_map.hpp | 144 rehash(hash_size(size_ + 1)); 230 void rehash(std::size_t num_buckets) function in class:asio::detail::hash_map
|