class BloomFilter[T] extends (T) ⇒ Boolean with Serializable
A BloomFilter is an approximate set that sometimes gives false positives. That is, if bf(x) returns true, then it might have been added to the set. If it returns false, then it definitely has not. This is useful for caching and approximation.
- Annotations
- @SerialVersionUID()
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- BloomFilter
- Serializable
- Serializable
- Function1
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def &(that: BloomFilter[T]): BloomFilter[T]
- def &=(that: BloomFilter[T]): BloomFilter.this.type
- def &~(that: BloomFilter[T]): BloomFilter[T]
- def &~=(that: BloomFilter[T]): BloomFilter.this.type
- def +=(o: T): BloomFilter.this.type
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
andThen[A](g: (Boolean) ⇒ A): (T) ⇒ A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
apply(o: T): Boolean
- Definition Classes
- BloomFilter → Function1
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- val bits: BitSet
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
-
def
compose[A](g: (A) ⇒ T): (A) ⇒ Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def contains(o: T): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(other: Any): Boolean
- Definition Classes
- BloomFilter → AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- BloomFilter → AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
load: Double
Calculates the load of the bloom filter.
Calculates the load of the bloom filter. If this is near 1, there will be lots of false positives.
- returns
the fraction of bits that are set
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val numBuckets: Int
- val numHashFunctions: Int
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- Function1 → AnyRef → Any
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def |(that: BloomFilter[T]): BloomFilter[T]
- def |=(that: BloomFilter[T]): BloomFilter.this.type