Skip to content
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.

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

A fairly easy optimization to BloomFilter::add ... #47

Merged
merged 1 commit into from
Jul 27, 2023

Conversation

delocalizer
Copy link
Owner

@delocalizer delocalizer commented Jul 27, 2023

... for applications with low fp rate (sparse array) and mostly unique items being added is to quit testing the bit array on the first failure. This is good for about a 15% speedup of add(...) in a sequencing template duplicate marking context.

…low fp rate (sparse array) and mostly unique items being added is to quit testing the bit array on the first failure. This is good for about a 15% speedup in practice.
@delocalizer delocalizer self-assigned this Jul 27, 2023
@delocalizer delocalizer merged commit 5b4364d into master Jul 27, 2023
delocalizer added a commit that referenced this pull request Jul 27, 2023
@delocalizer delocalizer deleted the 20230727_optimization branch August 7, 2023 05:28
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant