ApproximateWhitelist

An ApproximateWhitelist is a basic Bloom filter intended for holding natural-language vocabularies. It deals with String values natively and can be trained from a sequence or from an RDD of any element type T, as long as there is an implicit conversion in scope from T to String.

Known limitation: while this filter uses several hashes, some of these will exhibit unusually high collision rates when hashing strings that are permutations of one another. If you experience poor filter performance on a given vocabulary, this might be worth investigating. The choice of hash functions is subject to change in a future release.

Linear Supertypes

Serializable, Serializable, Product, Equals, AnyRef, Any

Instance Constructors

new ApproximateWhitelist(filter: BitSet)

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def add[A](s: A)(implicit f: (A) ⇒ String): ApproximateWhitelist

Adds an element to the whitelist.
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def combine(other: ⇒ ApproximateWhitelist): ApproximateWhitelist

Creates a whitelist that accepts a superset of anything accepted by this and anything accepted by other.
Creates a whitelist that accepts a superset of anything accepted by this and anything accepted by other.
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
val filter: BitSet
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def maybeContains[A](s: A)(implicit f: (A) ⇒ String): Boolean

Returns true if s is possibly contained in the whitelist and false if it definitely is not.
Returns true if s is possibly contained in the whitelist and false if it definitely is not.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: object ApproximateWhitelist | package text

case class ApproximateWhitelist(filter: BitSet) extends Product with Serializable

Instance Constructors

new ApproximateWhitelist(filter: BitSet)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def add[A](s: A)(implicit f: (A) ⇒ String): ApproximateWhitelist

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def combine(other: ⇒ ApproximateWhitelist): ApproximateWhitelist

final def eq(arg0: AnyRef): Boolean

val filter: BitSet

def finalize(): Unit

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

def maybeContains[A](s: A)(implicit f: (A) ⇒ String): Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped