| /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 | 239 void rehash(size_type __n)
242 _Base::rehash(__n);
456 rehash(size_type __n)
459 _Base::rehash(__n);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/ |
| unordered_map | 255 void rehash(size_type __n)
258 _Base::rehash(__n);
488 rehash(size_type __n)
491 _Base::rehash(__n);
|
| unordered_set | 229 rehash(size_type __n)
232 _Base::rehash(__n);
452 rehash(size_type __n)
455 _Base::rehash(__n);
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| HashTable.tcc | 166 void HashTable<HashEntryTy, HashFunctionTy, EntryFactoryTy>::rehash() {
173 void 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/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/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...] |
| /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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| unordered_map.h | 755 * @brief May rehash the %unordered_map.
758 * Rehash will occur only if the new number of buckets respect the
762 rehash(size_type __n) function in class:unordered_map
763 { _M_h.rehash(__n); }
770 * Same as rehash(ceil(n / max_load_factor())).
1413 rehash(size_type __n) function in class:unordered_multimap
[all...] |
| unordered_set.h | 677 * @brief May rehash the %unordered_set.
680 * Rehash will occur only if the new number of buckets respect the
684 rehash(size_type __n) function in class:unordered_set
685 { _M_h.rehash(__n); }
692 * Same as rehash(ceil(n / max_load_factor())).
1296 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...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| hash_test.cpp | 153 //We fill the map to implicitely start a rehash.
177 // According to _hashtable.c we will have a rehash from size 193 to size 389 in that situation.
178 // After that rehash, equal_range only returns 2 elements with key = 3 whereas there are 65 in it.
|
| /ndk/tests/device/test-stlport/unit/ |
| hash_test.cpp | 153 //We fill the map to implicitely start a rehash.
177 // According to _hashtable.c we will have a rehash from size 193 to size 389 in that situation.
178 // After that rehash, equal_range only returns 2 elements with key = 3 whereas there are 65 in it.
|
| /ndk/sources/host-tools/make-3.81/ |
| dir.c | 591 int rehash = 0;
643 * filesystems force a rehash always as mtime does not change
651 rehash = 1;
657 rehash = 1;
661 if (!rehash)
706 if (! rehash || HASH_VACANT (*dirfile_slot))
587 int rehash = 0; local
|
