final case class BloomFilter[A](numHashes: Int, width: Int)(implicit hash: Hash128[A]) extends Product with Serializable
Bloom Filter - a probabilistic data structure to test presence of an element.
Operations 1) insert: hash the value k times, updating the bitfield at the index equal to each hashed value 2) query: hash the value k times. If there are k collisions, then return true; otherwise false.
http://en.wikipedia.org/wiki/Bloom_filter
- Self Type
- BloomFilter[A]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- BloomFilter
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
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
- val aggregator: MonoidAggregator[A, Hash, Hash]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def create(data: Iterator[A]): Hash
Create a bloom filter with multiple items from an iterator
- def create(data: A*): Hash
Create a bloom filter with multiple items.
- def create(item: A): Hash
Create a bloom filter with one item.
- val empty: Hash
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- implicit val equiv: Equiv[Hash]
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def fromBitSet(bitSet: BitSet): Try[Hash]
Attempts to create a new BloomFilter instance from a BitSet.
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- implicit val hash: Hash128[A]
- def hashToArray(s: A): Array[Int]
Hash the value
numHashes
times and return an array of indices of true bits in the BitSet. - final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- implicit val monoid: Monoid[Hash] with BoundedSemilattice[Hash]
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- val numHashes: Int
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- val width: Int
- case object Empty extends Hash with Product with Serializable