Packages

object BloomFilter extends ApproxFilterCompanion with Serializable

Companion object for BloomFilter.

Source
ApproxFilter.scala
Linear Supertypes
Serializable, ApproxFilterCompanion, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BloomFilter
  2. Serializable
  3. ApproxFilterCompanion
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. type Filter[T] = BloomFilter[T]

    Type of the ApproxFilter implementation.

    Type of the ApproxFilter implementation.

    Definition Classes
    BloomFilter → ApproxFilterCompanion
  2. type Hash[T] = Funnel[T]

    Type of the hashing function for ApproxFilter elements, e.g.

    Type of the hashing function for ApproxFilter elements, e.g. Guava Funnel or Algebird Hash128.

    Definition Classes
    BloomFilter → ApproxFilterCompanion

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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  6. final def create[T](elems: SCollection[T], expectedInsertions: Long, fpp: Double)(implicit arg0: Hash[T]): SCollection[Filter[T]]

    Creates an ApproxFilter from an SCollection with the expected number of insertions and expected false positive probability.

    Creates an ApproxFilter from an SCollection with the expected number of insertions and expected false positive probability.

    Note that overflowing an ApproxFilter with significantly more elements than specified, will result in its saturation, and a sharp deterioration of its false positive probability.

    Definition Classes
    ApproxFilterCompanion
  7. final def create[T](elems: SCollection[T], expectedInsertions: Long)(implicit arg0: Hash[T]): SCollection[Filter[T]]

    Creates an ApproxFilter from an SCollection with the expected number of insertions and default fpp of 0.03.

    Creates an ApproxFilter from an SCollection with the expected number of insertions and default fpp of 0.03.

    Note that overflowing an ApproxFilter with significantly more elements than specified, will result in its saturation, and a sharp deterioration of its false positive probability.

    Definition Classes
    ApproxFilterCompanion
  8. final def create[T](elems: SCollection[T])(implicit arg0: Hash[T]): SCollection[Filter[T]]

    Creates an ApproxFilter from an SCollection with the collection size as expectedInsertions and default fpp of 0.03.

    Creates an ApproxFilter from an SCollection with the collection size as expectedInsertions and default fpp of 0.03.

    Note that overflowing an ApproxFilter with significantly more elements than specified, will result in its saturation, and a sharp deterioration of its false positive probability.

    Definition Classes
    ApproxFilterCompanion
  9. final def create[T](elems: Iterable[T], expectedInsertions: Long, fpp: Double)(implicit arg0: Hash[T]): Filter[T]

    Creates an ApproxFilter from an Iterable with the expected number of insertions and expected false positive probability.

    Creates an ApproxFilter from an Iterable with the expected number of insertions and expected false positive probability.

    Note that overflowing an ApproxFilter with significantly more elements than specified, will result in its saturation, and a sharp deterioration of its false positive probability.

    Definition Classes
    ApproxFilterCompanion
  10. final def create[T](elems: Iterable[T], expectedInsertions: Long)(implicit arg0: Hash[T]): Filter[T]

    Creates an ApproxFilter from an Iterable with the expected number of insertions and default fpp of 0.03.

    Creates an ApproxFilter from an Iterable with the expected number of insertions and default fpp of 0.03.

    Note that overflowing an ApproxFilter with significantly more elements than specified, will result in its saturation, and a sharp deterioration of its false positive probability.

    Definition Classes
    ApproxFilterCompanion
  11. final def create[T](elems: Iterable[T])(implicit arg0: Hash[T]): Filter[T]

    Creates an ApproxFilter from an Iterable with the collection size as expectedInsertions and default fpp of 0.03.

    Creates an ApproxFilter from an Iterable with the collection size as expectedInsertions and default fpp of 0.03.

    Note that overflowing an ApproxFilter with significantly more elements than specified, will result in its saturation, and a sharp deterioration of its false positive probability.

    Definition Classes
    ApproxFilterCompanion
  12. def createImpl[T](elems: Iterable[T], expectedInsertions: Long, fpp: Double)(implicit arg0: Hash[T]): Filter[T]
    Attributes
    protected
    Definition Classes
    BloomFilter → ApproxFilterCompanion
  13. final def createSideInput[T](elems: SCollection[T], expectedInsertions: Long, fpp: Double)(implicit arg0: Hash[T]): SideInput[Filter[T]]

    Creates a SideInput[ApproxFilter] from an SCollection with the expected number of insertions and expected false positive probability.

    Creates a SideInput[ApproxFilter] from an SCollection with the expected number of insertions and expected false positive probability.

    The expectedInsertions should be approximately the number of unique elements in the SCollection.

    Note that overflowing an ApproxFilter with significantly more elements than specified, will result in its saturation, and a sharp deterioration of its false positive probability.

    Since this results in one filter as a SideInput care should be taken that the size of the filter does not exceed the runner recommended max size of Side Inputs (100 MB for Dataflow) This implies that expectedInsertions should not exceed 112 Million with a fp of 0.03 on Dataflow.

    Definition Classes
    ApproxFilterCompanion
  14. final def createSideInput[T](elems: SCollection[T], expectedInsertions: Long)(implicit arg0: Hash[T]): SideInput[Filter[T]]

    Creates a SideInput[ApproxFilter] from an SCollection with the expected number of insertions and expected false positive probability.

    Creates a SideInput[ApproxFilter] from an SCollection with the expected number of insertions and expected false positive probability.

    The expectedInsertions should be approximately the number of unique elements in the SCollection.

    The default false positive probability is 0.03

    Note that overflowing an ApproxFilter with significantly more elements than specified, will result in its saturation, and a sharp deterioration of its false positive probability.

    Since this results in one filter as a SideInput care should be taken that the size of the filter does not exceed the runner recommended max size of Side Inputs (100 MB for Dataflow) This implies that expectedInsertions should not exceed 112 Million with a fp of 0.03 on Dataflow.

    Definition Classes
    ApproxFilterCompanion
  15. final def createSideInput[T](elems: SCollection[T])(implicit arg0: Hash[T]): SideInput[Filter[T]]

    Creates a SideInput[ApproxFilter] from an SCollection with the collection size as expectedInsertions and false positive probability of 0.03.

    Creates a SideInput[ApproxFilter] from an SCollection with the collection size as expectedInsertions and false positive probability of 0.03.

    Note that overflowing an ApproxFilter with significantly more elements than specified, will result in its saturation, and a sharp deterioration of its false positive probability.

    Since this results in one filter as a SideInput care should be taken that the size of the filter does not exceed the runner recommended max size of Side Inputs (100 MB for Dataflow) This implies that expectedInsertions should not exceed 112 Million with a fp of 0.03 on Dataflow.

    Definition Classes
    ApproxFilterCompanion
  16. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  18. implicit def filterCoder[T](implicit arg0: Hash[T]): Coder[Filter[T]]

    Coder for the ApproxFilter implementation.

    Coder for the ApproxFilter implementation.

    Note that Hash should be supplied at compile time and not serialized since it might not have deterministic serialization.

    Definition Classes
    BloomFilter → ApproxFilterCompanion
  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. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  22. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  23. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  24. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  25. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  26. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  27. def toString(): String
    Definition Classes
    AnyRef → Any
  28. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  29. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  30. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from Serializable

Inherited from ApproxFilterCompanion

Inherited from AnyRef

Inherited from Any

Ungrouped