Home
last modified time | relevance | path

Searched refs:bucket_count (Results 1 – 5 of 5) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_unordered_base.h233 static constexpr size_type round_up_to_power_of_two( size_type bucket_count ) { in round_up_to_power_of_two() argument
234 …urn size_type(1) << size_type(tbb::detail::log2(uintptr_t(bucket_count == 0 ? 1 : bucket_count) * … in round_up_to_power_of_two()
245 my_bucket_count(round_up_to_power_of_two(bucket_count)),
254 : concurrent_unordered_base(bucket_count, hasher(), key_equal(), alloc) {} in concurrent_unordered_base()
257 : concurrent_unordered_base(bucket_count, hash, key_equal(), alloc) {} in concurrent_unordered_base()
266 : concurrent_unordered_base(bucket_count, hash, equal, alloc) in concurrent_unordered_base() argument
335 size_type bucket_count = initial_bucket_count,
626 size_type bucket_count = my_bucket_count.load(std::memory_order_relaxed); in unsafe_end() local
668 void rehash( size_type bucket_count ) { in rehash() argument
670 if (current_bucket_count < bucket_count) { in rehash()
[all …]
/oneTBB/test/common/
H A Dconcurrent_unordered_common.h157 const size_type bucket_count = c.unsafe_bucket_count(); in CustomExamine() local
158 REQUIRE(c.unsafe_max_bucket_count() >= bucket_count); in CustomExamine()
161 for (size_type i = 0; i < bucket_count; ++i) { in CustomExamine()
180 c.rehash(2*bucket_count); in CustomExamine()
181 REQUIRE(c.unsafe_bucket_count() > bucket_count); in CustomExamine()
/oneTBB/test/tbb/
H A Dtest_concurrent_hash_map.cpp224 const size_type new_bucket_count = 2*c.bucket_count(); in Examine()
226 CHECK(c.bucket_count() >= new_bucket_count); in Examine()
/oneTBB/test/conformance/
H A Dconformance_concurrent_hash_map.cpp299 CHECK(int(v.bucket_count()) <= j); in TestRehash()
301 CHECK(int(v.bucket_count()) >= j); in TestRehash()
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_hash_map.h1079 size_type bucket_count() const { return this->my_mask.load(std::memory_order_relaxed) + 1; } in __TBB_requires()