| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/profile/ |
| unordered_map | 281 void rehash(size_type __n)
284 _Base::rehash(__n);
550 void rehash(size_type __n)
553 _Base::rehash(__n);
|
| unordered_set | 250 void rehash(size_type __n)
253 _Base::rehash(__n);
512 void rehash(size_type __n)
515 _Base::rehash(__n);
|
| /prebuilts/ndk/8/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/9/sources/cxx-stl/EH/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/9/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);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/profile/ |
| unordered_map | 281 void rehash(size_type __n)
284 _Base::rehash(__n);
550 void rehash(size_type __n)
553 _Base::rehash(__n);
|
| unordered_set | 250 void rehash(size_type __n)
253 _Base::rehash(__n);
512 void rehash(size_type __n)
515 _Base::rehash(__n);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/profile/ |
| unordered_map | 281 void rehash(size_type __n)
284 _Base::rehash(__n);
550 void rehash(size_type __n)
553 _Base::rehash(__n);
|
| unordered_set | 250 void rehash(size_type __n)
253 _Base::rehash(__n);
512 void rehash(size_type __n)
515 _Base::rehash(__n);
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| HashBase.tcc | 212 // grow/rehash the table.
229 // Rehash all the items into their new buckets. Luckily :) we already have
|
| HashTable.tcc | 164 HashTable<HashEntryTy, HashFunctionTy, EntryFactoryTy>::rehash()
173 HashTable<HashEntryTy, HashFunctionTy, EntryFactoryTy>::rehash(
|
| /system/core/libutils/ |
| BasicHashtable.cpp | 175 rehash(mCapacity * 2, mLoadFactor);
202 void BasicHashtableImpl::rehash(size_t minimumCapacity, float loadFactor) { function in class:android::BasicHashtableImpl
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| unordered_map.h | 724 * @brief May rehash the %unordered_map.
727 * Rehash will occur only if the new number of buckets respect the
731 rehash(size_type __n) function in class:unordered_map
732 { _M_h.rehash(__n); }
739 * Same as rehash(ceil(n / max_load_factor())).
1351 rehash(size_type __n) function in class:unordered_multimap
[all...] |
| unordered_set.h | 647 * @brief May rehash the %unordered_set.
650 * Rehash will occur only if the new number of buckets respect the
654 rehash(size_type __n) function in class:unordered_set
655 { _M_h.rehash(__n); }
662 * Same as rehash(ceil(n / max_load_factor())).
1236 rehash(size_type __n) function in class:unordered_multiset
[all...] |
| /external/dnsmasq/src/ |
| cache.c | 70 static void rehash(int size);
96 rehash(daemon->cachesize);
101 will be much too small, so the hosts reading code calls rehash every 1000 addresses, to
103 static void rehash(int size) function
814 /* rehash every 1000 names. */
817 rehash(name_count);
861 rehash(name_count);
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| hashtable.h | 594 void rehash(size_type __n);
600 // Helper rehash method used when keys are unique.
603 // Helper rehash method used when keys can be non-unique.
735 // We don't want the rehash policy to ask for the hashtable to shrink
769 // We don't want the rehash policy to ask for the hashtable to shrink
1583 rehash(size_type __n) function in class:_Hashtable
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| hashtable.h | 594 void rehash(size_type __n);
600 // Helper rehash method used when keys are unique.
603 // Helper rehash method used when keys can be non-unique.
735 // We don't want the rehash policy to ask for the hashtable to shrink
769 // We don't want the rehash policy to ask for the hashtable to shrink
1583 rehash(size_type __n) function in class:_Hashtable
[all...] |
| /external/e2fsprogs/e2fsck/ |
| Makefile.in | 67 revoke.o ea_refcount.o rehash.o profile.o prof_err.o $(MTRACE_OBJ)
76 profiled/ea_refcount.o profiled/rehash.o profiled/profile.o \
102 $(srcdir)/rehash.c \
424 rehash.o: $(srcdir)/rehash.c $(srcdir)/e2fsck.h \
|
| /external/chromium_org/third_party/sqlite/src/ext/fts1/ |
| ft_hash.c | 231 static void rehash(Hash *pH, int new_size){ function
388 rehash(pH,8);
396 rehash(pH,pH->htsize*2);
|
| fts1_hash.c | 189 static void rehash(fts1Hash *pH, int new_size){ function
351 rehash(pH,8);
359 rehash(pH,pH->htsize*2);
|
| /external/chromium_org/third_party/sqlite/src/ext/fts2/ |
| fts2_hash.c | 194 static void rehash(fts2Hash *pH, int new_size){ function
356 rehash(pH,8);
364 rehash(pH,pH->htsize*2);
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
| hamt.c | 269 /* Exceeded 32 bits: rehash */
324 /* Exceeded 32 bits of current key: rehash */
404 /* Exceeded 32 bits of current key: rehash */
|
