Skip to content

[common] Unify hash function num calculation in BloomFilterFileIndex using bitwise operations #6850

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
xiaochen-zhou wants to merge 2 commits into
base: master
Choose a base branch
from
Open

[common] Unify hash function num calculation in BloomFilterFileIndex using bitwise operations #6850

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
d053d9f
[common] Unify hash function num calculation in BloomFilterFileIndex …
xiaochen-zhou Dec 20, 2025
30d92ad
trigger CI build
xiaochen-zhou Dec 21, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions ...on-common/src/main/java/org/apache/paimon/fileindex/bloomfilter/BloomFilterFileIndex.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -120,9 +120,9 @@ public Reader(DataType type, byte[] serializedBytes) {
// big endian
int numHashFunctions =
((serializedBytes[0] << 24)
+ (serializedBytes[1] << 16)
+ (serializedBytes[2] << 8)
+ serializedBytes[3]);
| (serializedBytes[1] << 16)
| (serializedBytes[2] << 8)
| serializedBytes[3]);
BitSet bitSet = new BitSet(serializedBytes, 4);
this.filter = new BloomFilter64(numHashFunctions, bitSet);
this.hashFunction = FastHash.getHashFunction(type);
Expand Down