BFSparse

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

   Definition Classes

   BFSparse → BF

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

   Definition Classes

   BFSparse → 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. val bits: EWAHCompressedBitmap

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

    Definition Classes

    BFSparse → BF

11. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

12. def contains(item: A): ApproximateBoolean

    Definition Classes

    BF

13. def dense: BFInstance[A]

    Convert to a dense representation

14. def density: Double

    Proportion of bits that are set to true.

    Proportion of bits that are set to true.

    Definition Classes

    BF

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

    Definition Classes

    AnyRef

16. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    Definition Classes

    AnyRef → Any

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

19. val hashes: BFHash[A]

20. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    BFSparse → BF

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

    Definition Classes

    AnyRef

23. final def notify(): Unit

    Definition Classes

    AnyRef

24. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    BFSparse → BF

26. def numHashes: Int

    Definition Classes

    BFSparse → BF

27. def size: Approximate[Long]

    Definition Classes

    BFSparse → BF

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

    Definition Classes

    AnyRef

29. def toBitSet: BitSet

    Definition Classes

    BFSparse → BF

30. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

33. val width: Int

    Definition Classes

    BFSparse → BF