BFSparse

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def +(item: A): BF[A]

   

   Definition Classes

   BFSparse → BF

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

   

   Definition Classes

   BFSparse → BF

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

   

   Definition Classes

   AnyRef → Any

6. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

7. val bits: EWAHCompressedBitmap

   

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

   

   Definition Classes

   BFSparse → BF

9. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. def contains(item: A): ApproximateBoolean

    

    Definition Classes

    BF

11. def dense: BFInstance[A]

    

    Convert to a dense representation

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

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

    

    Definition Classes

    AnyRef

21. final def notify(): Unit

    

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

24. def numHashes: Int

    

    Definition Classes

    BFSparse → BF

25. def size: Approximate[Long]

    

    Definition Classes

    BFSparse → BF

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

    

    Definition Classes

    AnyRef

27. def toBitSet: BitSet

    

    Definition Classes

    BFSparse → BF

28. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

31. val width: Int

    

    Definition Classes

    BFSparse → BF