case class BloomFilterMonoid[A](numHashes: Int, width: Int)(implicit hash: Hash128[A]) extends Monoid[BF[A]] with BoundedSemilattice[BF[A]] with Product with Serializable
Bloom Filter - a probabilistic data structure to test presence of an element.
Operations 1) insert: hash the value k times, updating the bitfield at the index equal to each hashed value 2) query: hash the value k times. If there are k collisions, then return true; otherwise false.
http://en.wikipedia.org/wiki/Bloom_filter
- Alphabetic
- By Inheritance
- BloomFilterMonoid
- Product
- Equals
- BoundedSemilattice
- CommutativeMonoid
- Semilattice
- CommutativeSemigroup
- Band
- Monoid
- AdditiveMonoid
- Monoid
- Semigroup
- AdditiveSemigroup
- Semigroup
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def additive: algebra.Monoid[BF[A]]
These are from algebra.Monoid
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def asJoinPartialOrder(implicit ev: Eq[BF[A]]): PartialOrder[BF[A]]
- Definition Classes
- Semilattice
- def asMeetPartialOrder(implicit ev: Eq[BF[A]]): PartialOrder[BF[A]]
- Definition Classes
- Semilattice
- def assertNotZero(v: BF[A]): Unit
- Definition Classes
- Monoid
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def combine(l: BF[A], r: BF[A]): BF[A]
- Definition Classes
- Semigroup → Semigroup
- def combineAll(t: TraversableOnce[BF[A]]): BF[A]
- Definition Classes
- Monoid → Monoid
- def combineAllOption(as: IterableOnce[BF[A]]): Option[BF[A]]
- Definition Classes
- Monoid → Semigroup
- def combineN(a: BF[A], n: Int): BF[A]
- Definition Classes
- Monoid → Semigroup
- def create(data: Iterator[A]): BF[A]
Create a bloom filter with multiple items from an iterator
- def create(data: A*): BF[A]
Create a bloom filter with multiple items.
- def create(item: A): BF[A]
Create a bloom filter with one item.
- def empty: BF[A]
- Definition Classes
- Monoid → Monoid
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- val hashes: BFHash[A]
- def isEmpty(a: BF[A])(implicit ev: Eq[BF[A]]): Boolean
- Definition Classes
- Monoid
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isNonZero(v: BF[A]): Boolean
- Definition Classes
- Monoid
- def isZero(a: BF[A])(implicit ev: Eq[BF[A]]): Boolean
- Definition Classes
- AdditiveMonoid
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nonZeroOption(v: BF[A]): Option[BF[A]]
- Definition Classes
- Monoid
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- val numHashes: Int
- def plus(left: BF[A], right: BF[A]): BF[A]
Assume the bloom filters are compatible (same width and same hashing functions).
Assume the bloom filters are compatible (same width and same hashing functions). This is the union of the 2 bloom filters.
- Definition Classes
- BloomFilterMonoid → AdditiveSemigroup
- def positiveSumN(a: BF[A], n: Int): BF[A]
- Attributes
- protected[this]
- Definition Classes
- AdditiveSemigroup
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def repeatedCombineN(a: BF[A], n: Int): BF[A]
- Attributes
- protected[this]
- Definition Classes
- Semigroup
- def sum(vs: TraversableOnce[BF[A]]): BF[A]
- Definition Classes
- Monoid → AdditiveMonoid
- def sumN(a: BF[A], n: Int): BF[A]
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
- def sumOption(as: TraversableOnce[BF[A]]): Option[BF[A]]
Returns an instance of
T
calculated by summing all instances initer
in one pass.Returns an instance of
T
calculated by summing all instances initer
in one pass. ReturnsNone
ifiter
is empty, elseSome[T]
.- returns
None
ifiter
is empty, else an option value containing the summedT
- Definition Classes
- BloomFilterMonoid → Semigroup
- Note
Override if there is a faster way to compute this sum than
iter.reduceLeftOption
using plus.
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def trySum(as: TraversableOnce[BF[A]]): Option[BF[A]]
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- val width: Int
- val zero: BF[A]
- Definition Classes
- BloomFilterMonoid → AdditiveMonoid