| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| hashtable_policy.h | 274 // __n_bkt is current bucket count, __n_elt is current element count,
279 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
349 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
360 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
363 if (__n_elt + __n_ins >= _M_next_resize)
365 long double __min_bkts = (__n_elt + __n_ins)
377 else if (__n_elt + __n_ins < _M_prev_resize)
379 long double __min_bkts = (__n_elt + __n_ins)
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| hashtable_policy.h | 432 // __n_bkt is current bucket count, __n_elt is current element count,
437 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
478 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
489 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
492 if (__n_elt + __n_ins > _M_next_resize)
494 float __min_bkts = ((float(__n_ins) + float(__n_elt))
|
| hashtable | [all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| hashtable_policy.h | 405 // __n_bkt is current bucket count, __n_elt is current element count,
410 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
451 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
462 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
465 if (__n_elt + __n_ins > _M_next_resize)
467 float __min_bkts = ((float(__n_ins) + float(__n_elt))
|
| hashtable.h | 1029 size_type __n_elt = __detail::__distance_fw(__first, __last); local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/ |
| hashtable_policy.h | 398 // __n_bkt is current bucket count, __n_elt is current element count,
403 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
444 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
455 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
458 if (__n_elt + __n_ins > _M_next_resize)
460 float __min_bkts = ((float(__n_ins) + float(__n_elt))
|
| hashtable.h | 980 size_type __n_elt = __detail::__distance_fw(__first, __last); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| hashtable_policy.h | 405 // __n_bkt is current bucket count, __n_elt is current element count,
410 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
451 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
462 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
465 if (__n_elt + __n_ins > _M_next_resize)
467 float __min_bkts = ((float(__n_ins) + float(__n_elt))
|
| hashtable.h | 1029 size_type __n_elt = __detail::__distance_fw(__first, __last); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/ |
| hashtable_policy.h | 398 // __n_bkt is current bucket count, __n_elt is current element count,
403 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
444 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
455 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
458 if (__n_elt + __n_ins > _M_next_resize)
460 float __min_bkts = ((float(__n_ins) + float(__n_elt))
|
| hashtable.h | 980 size_type __n_elt = __detail::__distance_fw(__first, __last); local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| hashtable_policy.h | 432 // __n_bkt is current bucket count, __n_elt is current element count,
437 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
478 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
489 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
492 if (__n_elt + __n_ins > _M_next_resize)
494 float __min_bkts = ((float(__n_ins) + float(__n_elt))
|
| hashtable | [all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| hashtable_policy.h | 432 // __n_bkt is current bucket count, __n_elt is current element count,
437 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
478 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
489 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
492 if (__n_elt + __n_ins > _M_next_resize)
494 float __min_bkts = ((float(__n_ins) + float(__n_elt))
|
| hashtable | [all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| hashtable_policy.h | 432 // __n_bkt is current bucket count, __n_elt is current element count,
437 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
478 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
489 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
492 if (__n_elt + __n_ins > _M_next_resize)
494 float __min_bkts = ((float(__n_ins) + float(__n_elt))
|
| hashtable | [all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/tr1_impl/ |
| hashtable_policy.h | 432 // __n_bkt is current bucket count, __n_elt is current element count,
437 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
478 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
489 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
492 if (__n_elt + __n_ins > _M_next_resize)
494 float __min_bkts = ((float(__n_ins) + float(__n_elt))
|
| hashtable | [all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| hashtable_policy.h | 405 // __n_bkt is current bucket count, __n_elt is current element count,
410 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
451 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
462 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
465 if (__n_elt + __n_ins > _M_next_resize)
467 float __min_bkts = ((float(__n_ins) + float(__n_elt))
|
| hashtable.h | 1029 size_type __n_elt = __detail::__distance_fw(__first, __last); local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
| hashtable_policy.h | 398 // __n_bkt is current bucket count, __n_elt is current element count,
403 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
444 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
455 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
458 if (__n_elt + __n_ins > _M_next_resize)
460 float __min_bkts = ((float(__n_ins) + float(__n_elt))
|
| hashtable.h | 980 size_type __n_elt = __detail::__distance_fw(__first, __last); local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| hashtable_policy.h | 398 // __n_bkt is current bucket count, __n_elt is current element count,
403 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
444 // Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
455 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
458 if (__n_elt + __n_ins > _M_next_resize)
460 float __min_bkts = ((float(__n_ins) + float(__n_elt))
|
| hashtable.h | 980 size_type __n_elt = __detail::__distance_fw(__first, __last); local
[all...] |
