Class

com.twitter.algebird

MinHasher16

Related Doc: package algebird

Permalink

class MinHasher16 extends MinHasher[Char]

Source
MinHasher.scala
Linear Supertypes
MinHasher[Char], Monoid[MinHashSignature], Semigroup[MinHashSignature], Serializable, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MinHasher16
  2. MinHasher
  3. Monoid
  4. Semigroup
  5. Serializable
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MinHasher16(targetThreshold: Double, maxBytes: Int)

    Permalink
  2. new MinHasher16(numHashes: Int, numBands: Int)

    Permalink

Value Members

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def assertNotZero(v: MinHashSignature): Unit

    Permalink
    Definition Classes
    Monoid
  6. def buckets(sig: MinHashSignature): List[Long]

    Permalink

    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
  7. def buildArray(left: Array[Byte], right: Array[Byte])(fn: (Char, Char) ⇒ Char): Array[Byte]

    Permalink

    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
    MinHasher16MinHasher
  8. def buildArray(fn: ⇒ Char): Array[Byte]

    Permalink

    Initialize a byte array by generating hash values

    Initialize a byte array by generating hash values

    Attributes
    protected
    Definition Classes
    MinHasher16MinHasher
  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  12. val estimatedThreshold: Double

    Permalink

    Useful for understanding the effects of numBands and numRows

    Useful for understanding the effects of numBands and numRows

    Definition Classes
    MinHasher
  13. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  15. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  16. def hashSize: Int

    Permalink

    The number of bytes used for each hash in the signature

    The number of bytes used for each hash in the signature

    Definition Classes
    MinHasher16MinHasher
  17. def init(fn: (MurmurHash128) ⇒ (Long, Long)): MinHashSignature

    Permalink

    Create a signature for an arbitrary value

    Create a signature for an arbitrary value

    Definition Classes
    MinHasher
  18. def init(value: String): MinHashSignature

    Permalink

    Create a signature for a single String value

    Create a signature for a single String value

    Definition Classes
    MinHasher
  19. def init(value: Long): MinHashSignature

    Permalink

    Create a signature for a single Long value

    Create a signature for a single Long value

    Definition Classes
    MinHasher
  20. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  21. def isNonZero(v: MinHashSignature): Boolean

    Permalink
    Definition Classes
    Monoid
  22. def maxHash: Char

    Permalink

    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
    MinHasher16MinHasher
  23. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  24. def nonZeroOption(v: MinHashSignature): Option[MinHashSignature]

    Permalink
    Definition Classes
    Monoid
  25. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  26. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  27. val numBands: Int

    Permalink
    Definition Classes
    MinHasher
  28. val numBytes: Int

    Permalink

    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
  29. val numHashes: Int

    Permalink
    Definition Classes
    MinHasher
  30. val numRows: Int

    Permalink
    Definition Classes
    MinHasher
  31. def plus(left: MinHashSignature, right: MinHashSignature): MinHashSignature

    Permalink

    Set union

    Set union

    returns

    result of combining l and r

    Definition Classes
    MinHasherSemigroup
  32. def probabilityOfInclusion(sim: Double): Double

    Permalink

    Useful for understanding the effects of numBands and numRows

    Useful for understanding the effects of numBands and numRows

    Definition Classes
    MinHasher
  33. def similarity(left: MinHashSignature, right: MinHashSignature): Double

    Permalink

    Esimate Jaccard similarity (size of union / size of intersection)

    Esimate Jaccard similarity (size of union / size of intersection)

    Definition Classes
    MinHasher
  34. def sum(vs: TraversableOnce[MinHashSignature]): MinHashSignature

    Permalink
    Definition Classes
    Monoid
  35. def sumOption(iter: TraversableOnce[MinHashSignature]): Option[MinHashSignature]

    Permalink

    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.

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

    Permalink
    Definition Classes
    AnyRef
  37. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  38. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  41. val zero: MinHashSignature

    Permalink

    Signature for empty set, needed to be a proper Monoid

    Signature for empty set, needed to be a proper Monoid

    Definition Classes
    MinHasherMonoid

Inherited from MinHasher[Char]

Inherited from Monoid[MinHashSignature]

Inherited from Semigroup[MinHashSignature]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped