Packages

c

com.twitter.algebird

BloomFilterMonoid

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

Linear Supertypes
Product, Equals, BoundedSemilattice[BF[A]], CommutativeMonoid[BF[A]], Semilattice[BF[A]], CommutativeSemigroup[BF[A]], Band[BF[A]], Monoid[BF[A]], AdditiveMonoid[BF[A]], cats.kernel.Monoid[BF[A]], Semigroup[BF[A]], AdditiveSemigroup[BF[A]], cats.kernel.Semigroup[BF[A]], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BloomFilterMonoid
  2. Product
  3. Equals
  4. BoundedSemilattice
  5. CommutativeMonoid
  6. Semilattice
  7. CommutativeSemigroup
  8. Band
  9. Monoid
  10. AdditiveMonoid
  11. Monoid
  12. Semigroup
  13. AdditiveSemigroup
  14. Semigroup
  15. Serializable
  16. AnyRef
  17. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new BloomFilterMonoid(numHashes: Int, width: Int)(implicit hash: Hash128[A])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def additive: algebra.Monoid[BF[A]]

    These are from algebra.Monoid

    These are from algebra.Monoid

    Definition Classes
    Monoid → AdditiveMonoid → Semigroup → AdditiveSemigroup
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def asJoinPartialOrder(implicit ev: Eq[BF[A]]): PartialOrder[BF[A]]
    Definition Classes
    Semilattice
  7. def asMeetPartialOrder(implicit ev: Eq[BF[A]]): PartialOrder[BF[A]]
    Definition Classes
    Semilattice
  8. def assertNotZero(v: BF[A]): Unit
    Definition Classes
    Monoid
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  10. def combine(l: BF[A], r: BF[A]): BF[A]
    Definition Classes
    Semigroup → Semigroup
  11. def combineAll(t: TraversableOnce[BF[A]]): BF[A]
    Definition Classes
    Monoid → Monoid
  12. def combineAllOption(as: IterableOnce[BF[A]]): Option[BF[A]]
    Definition Classes
    Monoid → Semigroup
  13. def combineN(a: BF[A], n: Int): BF[A]
    Definition Classes
    Monoid → Semigroup
  14. def create(data: Iterator[A]): BF[A]

    Create a bloom filter with multiple items from an iterator

  15. def create(data: A*): BF[A]

    Create a bloom filter with multiple items.

  16. def create(item: A): BF[A]

    Create a bloom filter with one item.

  17. def empty: BF[A]
    Definition Classes
    Monoid → Monoid
  18. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  20. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  21. val hashes: BFHash[A]
  22. def isEmpty(a: BF[A])(implicit ev: Eq[BF[A]]): Boolean
    Definition Classes
    Monoid
  23. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  24. def isNonZero(v: BF[A]): Boolean
    Definition Classes
    Monoid
  25. def isZero(a: BF[A])(implicit ev: Eq[BF[A]]): Boolean
    Definition Classes
    AdditiveMonoid
  26. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  27. def nonZeroOption(v: BF[A]): Option[BF[A]]
    Definition Classes
    Monoid
  28. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  29. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  30. val numHashes: Int
  31. 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
  32. def positiveSumN(a: BF[A], n: Int): BF[A]
    Attributes
    protected[this]
    Definition Classes
    AdditiveSemigroup
  33. def productElementNames: Iterator[String]
    Definition Classes
    Product
  34. def repeatedCombineN(a: BF[A], n: Int): BF[A]
    Attributes
    protected[this]
    Definition Classes
    Semigroup
  35. def sum(vs: TraversableOnce[BF[A]]): BF[A]
    Definition Classes
    Monoid → AdditiveMonoid
  36. def sumN(a: BF[A], n: Int): BF[A]
    Definition Classes
    AdditiveMonoid → AdditiveSemigroup
  37. def sumOption(as: TraversableOnce[BF[A]]): Option[BF[A]]

    Returns an instance of T calculated by summing all instances in iter in one pass.

    Returns an instance of T calculated by summing all instances in iter in one pass. Returns None if iter is empty, else Some[T].

    returns

    None if iter is empty, else an option value containing the summed T

    Definition Classes
    BloomFilterMonoidSemigroup
    Note

    Override if there is a faster way to compute this sum than iter.reduceLeftOption using plus.

  38. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  39. def trySum(as: TraversableOnce[BF[A]]): Option[BF[A]]
    Definition Classes
    AdditiveMonoid → AdditiveSemigroup
  40. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  41. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  42. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  43. val width: Int
  44. val zero: BF[A]
    Definition Classes
    BloomFilterMonoid → AdditiveMonoid

Inherited from Product

Inherited from Equals

Inherited from BoundedSemilattice[BF[A]]

Inherited from CommutativeMonoid[BF[A]]

Inherited from Semilattice[BF[A]]

Inherited from CommutativeSemigroup[BF[A]]

Inherited from Band[BF[A]]

Inherited from Monoid[BF[A]]

Inherited from AdditiveMonoid[BF[A]]

Inherited from cats.kernel.Monoid[BF[A]]

Inherited from Semigroup[BF[A]]

Inherited from AdditiveSemigroup[BF[A]]

Inherited from cats.kernel.Semigroup[BF[A]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped