MurmurHash3_x86_128

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

11. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

12. final def getInt(data: Array[Byte], index: Int, rem: Int): Int

    Utility function to convert a byte array into an int, filling in zeros if the byte array is not big enough.

    Utility function to convert a byte array into an int, filling in zeros if the byte array is not big enough.

    data

    is the byte array to be converted to an int.

    index

    is the starting index in the byte array.

    rem

    is the remainder of the byte array to examine.

    Annotations

    @inline()

13. final def hash(data: Array[Byte], seed: Int, length: Int): Array[Int]

    An optimization for reusing memory under large number of hash calls.

    An optimization for reusing memory under large number of hash calls.

    data

    is the bytes to be hashed.

    seed

    is the seed for the murmurhash algorithm.

    length

    is the length of the buffer to use for hashing.

    returns

    is an array of size 4 that holds the four ints that comprise the 128 bit hash.

    Annotations

    @inline()

14. final def hash(data: Array[Byte], seed: Int, length: Int, results: Array[Int]): Unit

    An optimization for reusing memory under large number of hash calls.

    An optimization for reusing memory under large number of hash calls.

    data

    is the bytes to be hashed.

    seed

    is the seed for the murmurhash algorithm.

    length

    is the length of the buffer to use for hashing.

    results

    is the output buffer to store the four ints that are returned, should have size at least 4.

    Annotations

    @inline()

15. final def hash(data: Array[Byte], seed: Int): Array[Int]

    data

    is the bytes to be hashed.

    seed

    is the seed for the murmurhash algorithm.

    Annotations

    @inline()

16. def hashCode(): Int

    Definition Classes

    AnyRef → Any

17. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

18. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

19. final def notify(): Unit

    Definition Classes

    AnyRef

20. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef

22. def toString(): String

    Definition Classes

    AnyRef → Any

23. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

25. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )