Packages

case class BFItem[A](item: A, hashes: BFHash[A], width: Int) extends BF[A] with Product with Serializable

Bloom Filter with 1 value.

Linear Supertypes
Product, Equals, BF[A], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BFItem
  2. Product
  3. Equals
  4. BF
  5. Serializable
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new BFItem(item: A, hashes: BFHash[A], width: Int)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def +(other: A): BF[A]
    Definition Classes
    BFItem → BF
  4. def ++(other: BF[A]): BF[A]
    Definition Classes
    BFItem → BF
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def checkAndAdd(other: A): (BF[A], ApproximateBoolean)
    Definition Classes
    BFItem → BF
  8. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  9. def contains(x: A): ApproximateBoolean
    Definition Classes
    BFItem → BF
  10. def density: Double

    Proportion of bits that are set to true.

    Proportion of bits that are set to true.

    Definition Classes
    BF
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  13. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  14. def hammingDistance(that: BF[A]): Int

    Compute the Hamming distance between the two Bloom filters a and b.

    Compute the Hamming distance between the two Bloom filters a and b. The distance is defined as the number of bits that need to change to in order to transform one filter into the other.

    Definition Classes
    BF
  15. val hashes: BFHash[A]
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. val item: A
  18. def maybeContains(x: A): Boolean

    This may be faster if you don't care about evaluating the false positive probability

    This may be faster if you don't care about evaluating the false positive probability

    Definition Classes
    BFItem → BF
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  21. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  22. def numBits: Int

    The number of bits set to true in the bloom filter

    The number of bits set to true in the bloom filter

    Definition Classes
    BFItem → BF
  23. def numHashes: Int
    Definition Classes
    BFItem → BF
  24. def productElementNames: Iterator[String]
    Definition Classes
    Product
  25. def size: Approximate[Long]
    Definition Classes
    BFItem → BF
  26. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  27. def toBitSet: BitSet
    Definition Classes
    BFItem → BF
  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()
  31. val width: Int
    Definition Classes
    BFItem → BF

Inherited from Product

Inherited from Equals

Inherited from BF[A]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped