BF

abstract def +(other: A): BF[A]

abstract def ++(other: BF[A]): BF[A]

abstract def checkAndAdd(item: A): (BF[A], ApproximateBoolean)

abstract def maybeContains(item: A): Boolean

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

abstract def numBits: Int

The number of bits set to true in the bloom filter

abstract def numHashes: Int

abstract def size: Approximate[Long]

abstract def toBitSet: BitSet

abstract def width: Int

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def contains(item: A): ApproximateBoolean

def density: Double

Proportion of bits that are set to true.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hammingDistance(that: BF[A]): Int

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

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit