Value Members

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

   Definition Classes

   AnyRef → Any

2.  final def ##: Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  def additive: algebra.Monoid[MinHashSignature]

   These are from algebra.Monoid

   These are from algebra.Monoid

   Definition Classes

   Monoid → AdditiveMonoid → Semigroup → AdditiveSemigroup

5.  def approxCount(sig: Array[Byte]): Long

   Seems to work, but experimental and not generic yet

6.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7.  def assertNotZero(v: MinHashSignature): Unit

   Definition Classes

   Monoid

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

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

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

11.  def clone(): AnyRef

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.CloneNotSupportedException]) @native()

12.  def combine(l: MinHashSignature, r: MinHashSignature): MinHashSignature

    Definition Classes

    Semigroup → Semigroup

13.  def combineAll(t: TraversableOnce[MinHashSignature]): MinHashSignature

    Definition Classes

    Monoid → Monoid

14.  def combineAllOption(as: IterableOnce[MinHashSignature]): Option[MinHashSignature]

    Definition Classes

    Monoid → Semigroup

15.  def combineN(a: MinHashSignature, n: Int): MinHashSignature

    Definition Classes

    Monoid → Semigroup

16.  def empty: MinHashSignature

    Definition Classes

    Monoid → Monoid

17.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

18.  def equals(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef → Any

19.  val estimatedThreshold: Double

    Useful for understanding the effects of numBands and numRows

    Useful for understanding the effects of numBands and numRows

    Definition Classes

    MinHasher

20.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.Throwable])

21.  final def getClass(): Class[_ <: AnyRef]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

22.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

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

24.  def init(fn: (MurmurHash128) => (Long, Long)): MinHashSignature

    Create a signature for an arbitrary value

    Create a signature for an arbitrary value

    Definition Classes

    MinHasher

25.  def init(value: String): MinHashSignature

    Create a signature for a single String value

    Create a signature for a single String value

    Definition Classes

    MinHasher

26.  def init(value: Long): MinHashSignature

    Create a signature for a single Long value

    Create a signature for a single Long value

    Definition Classes

    MinHasher

27.  def isEmpty(a: MinHashSignature)(implicit ev: Eq[MinHashSignature]): Boolean

    Definition Classes

    Monoid

28.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

29.  def isNonZero(v: MinHashSignature): Boolean

    Definition Classes

    Monoid

30.  def isZero(a: MinHashSignature)(implicit ev: Eq[MinHashSignature]): Boolean

    Definition Classes

    AdditiveMonoid

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

32.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

33.  def nonZeroOption(v: MinHashSignature): Option[MinHashSignature]

    Definition Classes

    Monoid

34.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

35.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

36.  val numBands: Int

    Definition Classes

    MinHasher

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

38.  val numHashes: Int

    Definition Classes

    MinHasher

39.  val numRows: Int

    Definition Classes

    MinHasher

40.  def plus(left: MinHashSignature, right: MinHashSignature): MinHashSignature

    Set union

    Set union

    Definition Classes

    MinHasher → AdditiveSemigroup

41.  def positiveSumN(a: MinHashSignature, n: Int): MinHashSignature

    Attributes

    protected[this]

    Definition Classes

    AdditiveSemigroup

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

43.  def repeatedCombineN(a: MinHashSignature, n: Int): MinHashSignature

    Attributes

    protected[this]

    Definition Classes

    Semigroup

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

45.  def sum(vs: TraversableOnce[MinHashSignature]): MinHashSignature

    Definition Classes

    Monoid → AdditiveMonoid

46.  def sumN(a: MinHashSignature, n: Int): MinHashSignature

    Definition Classes

    AdditiveMonoid → AdditiveSemigroup

47.  def sumOption(iter: TraversableOnce[MinHashSignature]): Option[MinHashSignature]

    Returns an instance of T calculated by summing all instances in iter in one pass.

    Returns an instance of T calculated by summing all instances in iter in one pass. Returns None if iter is empty, else Some[T].

    iter

    instances of T to be combined

    returns

    None if iter is empty, else an option value containing the summed T

    Definition Classes

    Semigroup

    Note

    Override if there is a faster way to compute this sum than iter.reduceLeftOption using plus.

48.  final def synchronized[T0](arg0: => T0): T0

    Definition Classes

    AnyRef

49.  def toString(): String

    Definition Classes

    AnyRef → Any

50.  def trySum(as: TraversableOnce[MinHashSignature]): Option[MinHashSignature]

    Definition Classes

    AdditiveMonoid → AdditiveSemigroup

51.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

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

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

53.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException]) @native()

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