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, 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. Serializable
  17. AnyRef
  18. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. def additive: algebra.Monoid[BF[A]]

    These are from algebra.

    These are from algebra.Monoid

    Definition Classes
    Monoid → AdditiveMonoid → Semigroup → AdditiveSemigroup

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. def asJoinPartialOrder(implicit ev: Eq[BF[A]]): PartialOrder[BF[A]]

    Definition Classes
    Semilattice

  9. def asMeetPartialOrder(implicit ev: Eq[BF[A]]): PartialOrder[BF[A]]

    Definition Classes
    Semilattice

  10. def assertNotZero(v: BF[A]): Unit

    Definition Classes
    Monoid

  11. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  12. def combine(l: BF[A], r: BF[A]): BF[A]

    Definition Classes
    Semigroup → Semigroup

  13. def combineAll(t: TraversableOnce[BF[A]]): BF[A]

    Definition Classes
    Monoid → Monoid

  14. def combineAllOption(as: TraversableOnce[BF[A]]): Option[BF[A]]

    Definition Classes
    Monoid → Semigroup

  15. def combineN(a: BF[A], n: Int): BF[A]

    Definition Classes
    Monoid → Semigroup

  16. def create(data: Iterator[A]): BF[A]

    Create a bloom filter with multiple items from an iterator

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

    Create a bloom filter with multiple items.

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

    Create a bloom filter with one item.

  19. def empty: BF[A]

    Definition Classes
    Monoid → Monoid

  20. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  21. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  22. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  23. val hashes: BFHash[A]

  24. def isEmpty(a: BF[A])(implicit ev: Eq[BF[A]]): Boolean

    Definition Classes
    Monoid

  25. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  26. def isNonZero(v: BF[A]): Boolean

    Definition Classes
    Monoid

  27. def isZero(a: BF[A])(implicit ev: Eq[BF[A]]): Boolean

    Definition Classes
    AdditiveMonoid

  28. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  29. def nonZeroOption(v: BF[A]): Option[BF[A]]

    Definition Classes
    Monoid

  30. final def notify(): Unit

    Definition Classes
    AnyRef

  31. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  32. val numHashes: Int

  33. 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

  34. def positiveSumN(a: BF[A], n: Int): BF[A]

    Attributes
    protected[this]
    Definition Classes
    AdditiveSemigroup

  35. def repeatedCombineN(a: BF[A], n: Int): BF[A]

    Attributes
    protected[this]
    Definition Classes
    Semigroup

  36. def sum(vs: TraversableOnce[BF[A]]): BF[A]

    Definition Classes
    Monoid → AdditiveMonoid

  37. def sumN(a: BF[A], n: Int): BF[A]

    Definition Classes
    AdditiveMonoid → AdditiveSemigroup

  38. 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
    BloomFilterMonoid → Semigroup
    Note

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

  39. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  40. def trySum(as: TraversableOnce[BF[A]]): Option[BF[A]]

    Definition Classes
    AdditiveMonoid → AdditiveSemigroup

  41. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  42. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  43. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  44. val width: Int

  45. 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 Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped