Add AtomicCountingBloomFilter - #15
Merged
Merged
Conversation
Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
A lock-free counting bloom filter that supports concurrent insertion and deletion — combining the semantics of
CountingBloomFilterwith the thread-safety ofAtomicBloomFilter.insert(&self)viaConcurrentFilterusing a CAS loop for saturatingu8counter increments (no fetch_add to avoid wrapping)remove(&self) -> boolwith a two-pass check+CAS-decrement approach that prevents underflow under concurrent removesclear(&mut self)for exclusive resetDebugandClone(Acquire loading per element)Datastruct (same pattern asAtomicBloomFilter)🤖 Generated with Claude Code