class MinHasher32 extends MinHasher[Int]
- Alphabetic
- By Inheritance
- MinHasher32
- MinHasher
- Monoid
- AdditiveMonoid
- Monoid
- Semigroup
- AdditiveSemigroup
- Semigroup
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
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 additive: algebra.Monoid[MinHashSignature]
These are from algebra.Monoid
- def approxCount(sig: Array[Byte]): Long
Seems to work, but experimental and not generic yet
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def assertNotZero(v: MinHashSignature): Unit
- Definition Classes
- Monoid
- def buckets(sig: MinHashSignature): List[Long]
Bucket keys to use for quickly finding other similar items via locality sensitive hashing
Bucket keys to use for quickly finding other similar items via locality sensitive hashing
- Definition Classes
- MinHasher
- def buildArray(left: Array[Byte], right: Array[Byte])(fn: (Int, Int) => Int): Array[Byte]
Decode two signatures into hash values, combine them somehow, and produce a new array
Decode two signatures into hash values, combine them somehow, and produce a new array
- Attributes
- protected
- Definition Classes
- MinHasher32 → MinHasher
- def buildArray(fn: => Int): Array[Byte]
Initialize a byte array by generating hash values
Initialize a byte array by generating hash values
- Attributes
- protected
- Definition Classes
- MinHasher32 → MinHasher
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def combine(l: MinHashSignature, r: MinHashSignature): MinHashSignature
- Definition Classes
- Semigroup → Semigroup
- def combineAll(t: TraversableOnce[MinHashSignature]): MinHashSignature
- Definition Classes
- Monoid → Monoid
- def combineAllOption(as: IterableOnce[MinHashSignature]): Option[MinHashSignature]
- Definition Classes
- Monoid → Semigroup
- def combineN(a: MinHashSignature, n: Int): MinHashSignature
- Definition Classes
- Monoid → Semigroup
- def empty: MinHashSignature
- Definition Classes
- Monoid → Monoid
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- val estimatedThreshold: Double
Useful for understanding the effects of numBands and numRows
Useful for understanding the effects of numBands and numRows
- Definition Classes
- MinHasher
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashSize: Int
The number of bytes used for each hash in the signature
The number of bytes used for each hash in the signature
- Definition Classes
- MinHasher32 → MinHasher
- def init(fn: (MurmurHash128) => (Long, Long)): MinHashSignature
Create a signature for an arbitrary value
Create a signature for an arbitrary value
- Definition Classes
- MinHasher
- def init(value: String): MinHashSignature
Create a signature for a single String value
Create a signature for a single String value
- Definition Classes
- MinHasher
- def init(value: Long): MinHashSignature
Create a signature for a single Long value
Create a signature for a single Long value
- Definition Classes
- MinHasher
- def isEmpty(a: MinHashSignature)(implicit ev: Eq[MinHashSignature]): Boolean
- Definition Classes
- Monoid
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isNonZero(v: MinHashSignature): Boolean
- Definition Classes
- Monoid
- def isZero(a: MinHashSignature)(implicit ev: Eq[MinHashSignature]): Boolean
- Definition Classes
- AdditiveMonoid
- def maxHash: Int
Maximum value the hash can take on (not 2*hashSize because of signed types)
Maximum value the hash can take on (not 2*hashSize because of signed types)
- Definition Classes
- MinHasher32 → MinHasher
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nonZeroOption(v: MinHashSignature): Option[MinHashSignature]
- Definition Classes
- Monoid
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- val numBands: Int
- Definition Classes
- MinHasher
- val numBytes: Int
For explanation of the "bands" and "rows" see Ullman and Rajaraman
For explanation of the "bands" and "rows" see Ullman and Rajaraman
- Definition Classes
- MinHasher
- val numHashes: Int
- Definition Classes
- MinHasher
- val numRows: Int
- Definition Classes
- MinHasher
- def plus(left: MinHashSignature, right: MinHashSignature): MinHashSignature
Set union
Set union
- Definition Classes
- MinHasher → AdditiveSemigroup
- def positiveSumN(a: MinHashSignature, n: Int): MinHashSignature
- Attributes
- protected[this]
- Definition Classes
- AdditiveSemigroup
- def probabilityOfInclusion(sim: Double): Double
Useful for understanding the effects of numBands and numRows
Useful for understanding the effects of numBands and numRows
- Definition Classes
- MinHasher
- def repeatedCombineN(a: MinHashSignature, n: Int): MinHashSignature
- Attributes
- protected[this]
- Definition Classes
- Semigroup
- def similarity(left: MinHashSignature, right: MinHashSignature): Double
Esimate Jaccard similarity (size of union / size of intersection)
Esimate Jaccard similarity (size of union / size of intersection)
- Definition Classes
- MinHasher
- def sum(vs: TraversableOnce[MinHashSignature]): MinHashSignature
- Definition Classes
- Monoid → AdditiveMonoid
- def sumN(a: MinHashSignature, n: Int): MinHashSignature
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
- def sumOption(iter: TraversableOnce[MinHashSignature]): Option[MinHashSignature]
Returns an instance of
T
calculated by summing all instances initer
in one pass.Returns an instance of
T
calculated by summing all instances initer
in one pass. ReturnsNone
ifiter
is empty, elseSome[ T]
.- iter
instances of
T
to be combined- returns
None
ifiter
is empty, else an option value containing the summedT
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def trySum(as: TraversableOnce[MinHashSignature]): Option[MinHashSignature]
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
- 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 zero: MinHashSignature
Signature for empty set, needed to be a proper Monoid
Signature for empty set, needed to be a proper Monoid
- Definition Classes
- MinHasher → AdditiveMonoid