| /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,
445 // If p > __n_bkt, return make_pair(true, p); otherwise return
455 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
462 if (__min_bkts > __n_bkt)
464 __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
475 (__builtin_ceil(__n_bkt * _M_max_load_factor));
|
| hashtable.h | 680 size_type __n_bkt = __pol._M_bkt_for_elements(_M_element_count); local
681 if (__n_bkt > _M_bucket_count)
682 _M_rehash(__n_bkt);
[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,
445 // If p > __n_bkt, return make_pair(true, p); otherwise return
455 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
462 if (__min_bkts > __n_bkt)
464 __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
475 (__builtin_ceil(__n_bkt * _M_max_load_factor));
|
| hashtable.h | 680 size_type __n_bkt = __pol._M_bkt_for_elements(_M_element_count); local
681 if (__n_bkt > _M_bucket_count)
682 _M_rehash(__n_bkt);
[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,
445 // If p > __n_bkt, return make_pair(true, p); otherwise return
455 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
462 if (__min_bkts > __n_bkt)
464 __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
475 (__builtin_ceil(__n_bkt * _M_max_load_factor));
|
| hashtable.h | 680 size_type __n_bkt = __pol._M_bkt_for_elements(_M_element_count); local
681 if (__n_bkt > _M_bucket_count)
682 _M_rehash(__n_bkt);
[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,
445 // If p > __n_bkt, return make_pair(true, p); otherwise return
455 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
462 if (__min_bkts > __n_bkt)
464 __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
475 (__builtin_ceil(__n_bkt * _M_max_load_factor));
|
| hashtable.h | 680 size_type __n_bkt = __pol._M_bkt_for_elements(_M_element_count); local
681 if (__n_bkt > _M_bucket_count)
682 _M_rehash(__n_bkt);
[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,
479 // If p > __n_bkt, return make_pair(true, p); otherwise return
489 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
496 if (__min_bkts > __n_bkt)
498 __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
509 (__builtin_ceil(__n_bkt * _M_max_load_factor));
|
| /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,
452 // If p > __n_bkt, return make_pair(true, p); otherwise return
462 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
469 if (__min_bkts > __n_bkt)
471 __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
482 (__builtin_ceil(__n_bkt * _M_max_load_factor));
|
| hashtable.h | 747 size_type __n_bkt = __pol._M_bkt_for_elements(_M_element_count); local
748 if (__n_bkt > _M_bucket_count)
749 _M_rehash(__n_bkt);
[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,
452 // If p > __n_bkt, return make_pair(true, p); otherwise return
462 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
469 if (__min_bkts > __n_bkt)
471 __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
482 (__builtin_ceil(__n_bkt * _M_max_load_factor));
|
| hashtable.h | 747 size_type __n_bkt = __pol._M_bkt_for_elements(_M_element_count); local
748 if (__n_bkt > _M_bucket_count)
749 _M_rehash(__n_bkt);
[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,
479 // If p > __n_bkt, return make_pair(true, p); otherwise return
489 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
496 if (__min_bkts > __n_bkt)
498 __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
509 (__builtin_ceil(__n_bkt * _M_max_load_factor));
|
| /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,
479 // If p > __n_bkt, return make_pair(true, p); otherwise return
489 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
496 if (__min_bkts > __n_bkt)
498 __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
509 (__builtin_ceil(__n_bkt * _M_max_load_factor));
|
| /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,
479 // If p > __n_bkt, return make_pair(true, p); otherwise return
489 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
496 if (__min_bkts > __n_bkt)
498 __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
509 (__builtin_ceil(__n_bkt * _M_max_load_factor));
|
| /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,
479 // If p > __n_bkt, return make_pair(true, p); otherwise return
489 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
496 if (__min_bkts > __n_bkt)
498 __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
509 (__builtin_ceil(__n_bkt * _M_max_load_factor));
|
| /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,
452 // If p > __n_bkt, return make_pair(true, p); otherwise return
462 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
469 if (__min_bkts > __n_bkt)
471 __min_bkts = std::max(__min_bkts, _M_growth_factor * __n_bkt);
482 (__builtin_ceil(__n_bkt * _M_max_load_factor));
|
| hashtable.h | 747 size_type __n_bkt = __pol._M_bkt_for_elements(_M_element_count); local
748 if (__n_bkt > _M_bucket_count)
749 _M_rehash(__n_bkt);
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| hashtable.h | 920 size_type __n_bkt = __pol._M_bkt_for_elements(_M_element_count); local
1533 std::size_t __n_bkt = __bkt; local
[all...] |
| 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,
350 // If p > __n_bkt, return make_pair(true, p); otherwise return
360 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
367 if (__min_bkts >= __n_bkt)
373 = __builtin_floor(__n_bkt * (long double)_M_max_load_factor);
[all...] |
