Class

com.twitter.algebird

BloomFilterMonoid

Related Doc: package algebird

Permalink

case class BloomFilterMonoid(numHashes: Int, width: Int, seed: Int) extends Monoid[BF] 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

Source
BloomFilter.scala
Linear Supertypes
Serializable, Product, Equals, Monoid[BF], Semigroup[BF], Serializable, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BloomFilterMonoid
  2. Serializable
  3. Product
  4. Equals
  5. Monoid
  6. Semigroup
  7. Serializable
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BloomFilterMonoid(numHashes: Int, width: Int, seed: Int)

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def assertNotZero(v: BF): Unit

    Permalink
    Definition Classes
    Monoid

  6. def clone(): AnyRef

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

  7. def create(data: String*): BF

    Permalink

    Create a bloom filter with multiple items.

  8. def create(item: String): BF

    Permalink

    Create a bloom filter with one item.

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

    Permalink
    Definition Classes
    AnyRef

  10. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  12. val hashes: BFHash

    Permalink

  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  14. def isNonZero(v: BF): Boolean

    Permalink
    Definition Classes
    Monoid

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

    Permalink
    Definition Classes
    AnyRef

  16. def nonZeroOption(v: BF): Option[BF]

    Permalink
    Definition Classes
    Monoid

  17. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. val numHashes: Int

    Permalink

  20. def plus(left: BF, right: BF): BF

    Permalink

    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.

    returns

    result of combining l and r

    Definition Classes
    BloomFilterMonoid → Semigroup

  21. val seed: Int

    Permalink

  22. def sum(vs: TraversableOnce[BF]): BF

    Permalink
    Definition Classes
    Monoid

  23. def sumOption(iter: TraversableOnce[BF]): Option[BF]

    Permalink

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

    iter

    instances of T to be combined

    returns

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

    Definition Classes
    Semigroup
    Note

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

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

    Permalink
    Definition Classes
    AnyRef

  25. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  28. val width: Int

    Permalink

  29. val zero: BF

    Permalink

    Returns the identity element of T for plus.

    Returns the identity element of T for plus.

    Definition Classes
    BloomFilterMonoid → Monoid

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Monoid[BF]

Inherited from Semigroup[BF]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped