HomeSort by relevance Sort by last modified time
    Searched full:rehash (Results 26 - 50 of 247) sorted by null

12 3 4 5 6 7 8 910

  /external/emma/core/java12/com/vladium/util/
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:
  /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.
  /external/stlport/stlport/stl/
_unordered_map.h 188 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_map
348 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_multimap
_unordered_set.h 174 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_set
324 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_multiset
  /frameworks/compile/mclinker/include/mcld/ADT/
HashBase.h 119 /// doRehash - re-new the hash table, and rehash all elements into the new buckets
  /libcore/luni/src/main/java/java/lang/
ThreadLocal.java 254 if (rehash()) {
296 * Gets rid of tombstones. Returns true if a rehash occurred.
297 * We must rehash every time we fill a null slot; we depend on the
301 private boolean rehash() { method in class:ThreadLocal.Values
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/
reserve.pass.cpp 16 // void rehash(size_type n);
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_unordered_map.h 188 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_map
348 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_multimap
_unordered_set.h 174 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_set
324 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_multiset
  /ndk/sources/host-tools/nawk-20071023/
tran.c 34 #define FULLTAB 2 /* rehash when table gets this x full */
229 rehash(tp);
247 void rehash(Array *tp) /* rehash items in small table into big one */ function
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/profile/
unordered_map 259 void rehash(size_type __n)
262 _Base::rehash(__n);
507 void rehash(size_type __n)
510 _Base::rehash(__n);
unordered_set 227 void rehash(size_type __n)
230 _Base::rehash(__n);
469 void rehash(size_type __n)
472 _Base::rehash(__n);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/profile/
unordered_map 259 void rehash(size_type __n)
262 _Base::rehash(__n);
507 void rehash(size_type __n)
510 _Base::rehash(__n);
unordered_set 227 void rehash(size_type __n)
230 _Base::rehash(__n);
469 void rehash(size_type __n)
472 _Base::rehash(__n);
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_unordered_map.h 188 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_map
348 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_multimap
_unordered_set.h 174 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_set
324 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_multiset
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_unordered_map.h 188 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_map
348 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_multimap
_unordered_set.h 174 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_set
324 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_multiset
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_unordered_map.h 188 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_map
348 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_multimap
_unordered_set.h 174 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_set
324 void rehash(size_type __hint) { _M_ht.rehash(__hint); } function in class:unordered_multiset
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/profile/
unordered_map 259 void rehash(size_type __n)
262 _Base::rehash(__n);
507 void rehash(size_type __n)
510 _Base::rehash(__n);
unordered_set 227 void rehash(size_type __n)
230 _Base::rehash(__n);
469 void rehash(size_type __n)
472 _Base::rehash(__n);

Completed in 430 milliseconds

12 3 4 5 6 7 8 910