Class/Object

org.gerweck.scala.util.hashing

HashAlgorithm

Related Docs: object HashAlgorithm | package hashing

Permalink

abstract class HashAlgorithm extends AnyRef

An algorithm that can provide hash operations.

This acts as a factory that you can use to get a new instance of an in-progress hash operation. Hashing uses stateful objects that soak up data progressively until you have fed all of the required data. This allows the hashing of large data structures that may not fit entirely in memory.

Linear Supertypes
AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. HashAlgorithm
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new HashAlgorithm()

    Permalink

Abstract Value Members

  1. abstract def initialize(): HashingState

    Permalink
  2. abstract def name: String

    Permalink

Concrete 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 clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  10. def hash(string: String, encoding: Charset = StandardCharsets.UTF_8): Array[Byte]

    Permalink

    Get the hash of a string of text.

  11. def hash(bytes: Seq[Byte]): Array[Byte]

    Permalink

    Get the hash of a sequence of bytes.

    Get the hash of a sequence of bytes.

    Note

    it is not safe to utilize the hash of a collection without a defined sequence. Hashing something like a set or multiset requires algorithmic choices to produce a determinstic sequence of bytes.

  12. def hash(byteBuffer: ByteBuffer): Array[Byte]

    Permalink

    Get the hash of a java.nio.ByteBuffer.

    Get the hash of a java.nio.ByteBuffer.

    Note

    This is, in some situations, slower than finding the hash of an array. If you have both versions of the data available, the byte array should be preferred. However, it is probably not advisable to do your own conversion to a byte array.

  13. def hash(bytes: Array[Byte]): Array[Byte]

    Permalink

    Get the hash of an array of bytes.

  14. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  16. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  17. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  19. final def synchronized[T0](arg0: ⇒ T0): T0

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped