Uses of Interface
org.apache.commons.collections4.bloomfilter.BitMapProducer
Packages that use BitMapProducer
Package
Description
Collects extensible Bloom filter classes and interfaces.
-
Uses of BitMapProducer in org.apache.commons.collections4.bloomfilter
Subinterfaces of BitMapProducer in org.apache.commons.collections4.bloomfilterModifier and TypeInterfaceDescriptioninterfaceThe interface that describes a Bloom filter.interfaceThe interface that describes a Bloom filter that associates a count with each bit index rather than a bit.Classes in org.apache.commons.collections4.bloomfilter that implement BitMapProducerModifier and TypeClassDescriptionfinal classA counting Bloom filter using an int array to track cells for each enabled bit.classLayered Bloom filters are described in Zhiwang, Cen; Jungang, Xu; Jian, Sun (2010), "A multi-layer Bloom filter for duplicated URL detection", Proc.final classA bloom filter using an array of bit maps to track enabled bits.final classA bloom filter using a TreeSet of integers to track enabled bits.classAn abstract class to assist in implementing Bloom filter decorators.Methods in org.apache.commons.collections4.bloomfilter that return BitMapProducerModifier and TypeMethodDescriptionstatic BitMapProducerBitMapProducer.fromBitMapArray(long... bitMaps) Creates a BitMapProducer from an array of Long.static BitMapProducerBitMapProducer.fromIndexProducer(IndexProducer producer, int numberOfBits) Creates a BitMapProducer from an IndexProducer.Methods in org.apache.commons.collections4.bloomfilter with parameters of type BitMapProducerModifier and TypeMethodDescriptionstatic intSetOperations.andCardinality(BitMapProducer first, BitMapProducer second) Calculates the cardinality of the logicalANDof the bit maps for the two filters.static intSetOperations.cardinality(BitMapProducer producer) Calculates the cardinality of a BitMapProducer.booleanArrayCountingBloomFilter.contains(BitMapProducer bitMapProducer) default booleanBloomFilter.contains(BitMapProducer bitMapProducer) Returnstrueif this filter contains the bits specified in the bit maps produced by the bitMapProducer.booleanLayeredBloomFilter.contains(BitMapProducer bitMapProducer) booleanSparseBloomFilter.contains(BitMapProducer bitMapProducer) booleanWrappedBloomFilter.contains(BitMapProducer bitMapProducer) static doubleSetOperations.cosineDistance(BitMapProducer first, BitMapProducer second) Calculates the Cosine distance between two BitMapProducer.static doubleSetOperations.cosineSimilarity(BitMapProducer first, BitMapProducer second) Calculates the Cosine similarity between two BitMapProducers.int[]LayeredBloomFilter.find(BitMapProducer bitMapProducer) Finds the layers in which the BitMapProducer is found.default booleanBitMapProducer.forEachBitMapPair(BitMapProducer other, LongBiPredicate func) Applies thefuncto each bit map pair in order.booleanSimpleBloomFilter.forEachBitMapPair(BitMapProducer other, LongBiPredicate func) booleanWrappedBloomFilter.forEachBitMapPair(BitMapProducer other, LongBiPredicate func) static IndexProducerIndexProducer.fromBitMapProducer(BitMapProducer producer) Creates an IndexProducer from aBitMapProducer.default intCountingBloomFilter.getMaxInsert(BitMapProducer bitMapProducer) Determines the maximum number of times the BitMapProducer could have been merged into this counting filter.static intSetOperations.hammingDistance(BitMapProducer first, BitMapProducer second) Calculates the Hamming distance between two BitMapProducers.static doubleSetOperations.jaccardDistance(BitMapProducer first, BitMapProducer second) Calculates the Jaccard distance between two BitMapProducer.static doubleSetOperations.jaccardSimilarity(BitMapProducer first, BitMapProducer second) Calculates the Jaccard similarity between two BitMapProducer.booleanBloomFilter.merge(BitMapProducer bitMapProducer) Merges the specified hasher into this Bloom filter.default booleanCountingBloomFilter.merge(BitMapProducer bitMapProducer) Merges the specified BitMap producer into this Bloom filter.booleanLayeredBloomFilter.merge(BitMapProducer bitMapProducer) booleanSimpleBloomFilter.merge(BitMapProducer bitMapProducer) booleanSparseBloomFilter.merge(BitMapProducer bitMapProducer) booleanWrappedBloomFilter.merge(BitMapProducer bitMapProducer) static intSetOperations.orCardinality(BitMapProducer first, BitMapProducer second) Calculates the cardinality of the logicalORof the bit maps for the two filters.default booleanCountingBloomFilter.remove(BitMapProducer bitMapProducer) Removes the specified BitMapProducer from this Bloom filter.static intSetOperations.xorCardinality(BitMapProducer first, BitMapProducer second) Calculates the cardinality of the logicalXORof the bit maps for the two filters.