case class BFInstance[A](hashes: BFHash[A], bits: BitSet, width: Int) extends BF[A] with Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- BFInstance
- Product
- Equals
- BF
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(item: A): BFInstance[A]
- Definition Classes
- BFInstance → BF
- def ++(other: BF[A]): BF[A]
- Definition Classes
- BFInstance → BF
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- val bits: BitSet
- def checkAndAdd(other: A): (BF[A], ApproximateBoolean)
- Definition Classes
- BFInstance → BF
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def contains(item: A): ApproximateBoolean
- Definition Classes
- BF
- def density: Double
Proportion of bits that are set to true.
Proportion of bits that are set to true.
- Definition Classes
- BF
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hammingDistance(that: BF[A]): Int
Compute the Hamming distance between the two Bloom filters
a
andb
.Compute the Hamming distance between the two Bloom filters
a
andb
. 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
- val hashes: BFHash[A]
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def maybeContains(item: 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
- BFInstance → BF
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def numBits: Int
The number of bits set to true
The number of bits set to true
- Definition Classes
- BFInstance → BF
- def numHashes: Int
- Definition Classes
- BFInstance → BF
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def size: Approximate[Long]
- Definition Classes
- BFInstance → BF
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toBitSet: BitSet
- Definition Classes
- BFInstance → BF
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- val width: Int
- Definition Classes
- BFInstance → BF