com.twitter.algebird

BFItem

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
Serializable, Product, Equals, BF[A], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. BFItem
  2. Serializable
  3. Product
  4. Equals
  5. BF
  6. Serializable
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

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. def +(other: A): BF[A]

    Definition Classes
    BFItem → BF

  5. def ++(other: BF[A]): BF[A]

    Definition Classes
    BFItem → BF

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  9. def checkAndAdd(other: A): (BF[A], ApproximateBoolean)

    Definition Classes
    BFItem → BF

  10. def clone(): AnyRef

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

  11. def contains(x: A): ApproximateBoolean

    Definition Classes
    BFItem → BF

  12. def density: Double

    Proportion of bits that are set to true.

    Proportion of bits that are set to true.

    Definition Classes
    BF

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

    Definition Classes
    AnyRef

  14. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

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

  17. val hashes: BFHash[A]

  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  19. val item: A

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

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

    Definition Classes
    AnyRef

  22. final def notify(): Unit

    Definition Classes
    AnyRef

  23. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

  25. def numHashes: Int

    Definition Classes
    BFItem → BF

  26. def size: Approximate[Long]

    Definition Classes
    BFItem → BF

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

    Definition Classes
    AnyRef

  28. def toBitSet: BitSet

    Definition Classes
    BFItem → BF

  29. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  32. val width: Int

    Definition Classes
    BFItem → BF

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from BF[A]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped