MCPcopy Create free account
hub / github.com/apache/arrow / FindHash

Method FindHash

cpp/src/parquet/bloom_filter.cc:462–471  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

460}
461
462bool BlockSplitBloomFilter::FindHash(uint64_t hash) const {
463 const uint32_t bucket_index = static_cast<uint32_t>(((hash >> 32) * NumBlocks()) >> 32);
464 const uint32_t key = static_cast<uint32_t>(hash);
465 const uint32_t* bitset32 = reinterpret_cast<const uint32_t*>(data_->data());
466 const uint32_t* block = bitset32 + kBitsSetPerBlock * bucket_index;
467 static ::arrow::internal::DynamicDispatch<internal::FindHashBlockDynamicFunction>
468 dispatch;
469 return dispatch(std::span<const uint32_t, kBitsSetPerBlock>(block, kBitsSetPerBlock),
470 std::span<const uint32_t, kBitsSetPerBlock>(SALT), key);
471}
472
473void BlockSplitBloomFilter::InsertHashImpl(uint64_t hash) {
474 const uint32_t bucket_index = static_cast<uint32_t>(((hash >> 32) * NumBlocks()) >> 32);

Callers 10

TYPED_TESTFunction · 0.80
BM_FindExistingHashFunction · 0.80
BM_FindNonExistingHashFunction · 0.80
TESTFunction · 0.80
TEST_PFunction · 0.80
TESTFunction · 0.80
FuzzReadBloomFilterFunction · 0.80
TESTFunction · 0.80

Calls 2

NumBlocksFunction · 0.85
dataMethod · 0.45

Tested by 7

TYPED_TESTFunction · 0.64
TESTFunction · 0.64
TEST_PFunction · 0.64
TESTFunction · 0.64
TESTFunction · 0.64