[
https://issues.apache.org/jira/browse/COLLECTIONS-728?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16961283#comment-16961283
]
Claude Warren commented on COLLECTIONS-728:
-------------------------------------------
Based on the feedback and questions I have created a different implementation
(https://github.com/Claudenw/BloomFilter/tree/Hasher) -- note this is the
Hasher branch.
I posted a description of the implementation on the "[collections] BloomFilter
package architecture discussion" topic on the dev mailing list.
[~aherbert] your second match is incorrect. Match is (this & that = this) So
a bloom filter with fewer bits can match a filter with more but not visa versa.
To address this I added a contains() method. Which is what you would want to
call with a "decomposed" bloom filter. Perhaps "decomposed" is not a good
phrase because in the case at hand it has never been "composed".
Claude
> BloomFilter contribution
> ------------------------
>
> Key: COLLECTIONS-728
> URL: https://issues.apache.org/jira/browse/COLLECTIONS-728
> Project: Commons Collections
> Issue Type: Task
> Reporter: Claude Warren
> Priority: Minor
> Attachments: BF_Func.md, BloomFilter.java, BloomFilterI2.java,
> Usage.md
>
>
> Contribution of BloomFilter library comprising base implementation and gated
> collections.
--
This message was sent by Atlassian Jira
(v8.3.4#803005)
