Class

scorex.crypto.authds.merkle

InternalNode

Related Doc: package merkle

Permalink

case class InternalNode[D <: Digest](left: Node[D], right: Node[D])(implicit hf: CryptographicHash[D]) extends Node[D] with Product with Serializable

Internal node in Merkle tree

D

- hash function application type

left

- left child. always non-empty

right

- right child. can be emptyNode

hf

- hash function

Linear Supertypes
Serializable, Serializable, Product, Equals, Node[D], ScorexEncoding, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InternalNode
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Node
  7. ScorexEncoding
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new InternalNode(left: Node[D], right: Node[D])(implicit hf: CryptographicHash[D])

    Permalink

    left

    - left child. always non-empty

    right

    - right child. can be emptyNode

    hf

    - hash function

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. implicit val encoder: BytesEncoder

    Permalink
    Definition Classes
    ScorexEncoding
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  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. lazy val hash: D

    Permalink
    Definition Classes
    InternalNodeNode
  11. implicit val hf: CryptographicHash[D]

    Permalink

    - hash function

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  13. val left: Node[D]

    Permalink

    - left child.

    - left child. always non-empty

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

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

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

    Permalink
    Definition Classes
    AnyRef
  17. val right: Node[D]

    Permalink

    - right child.

    - right child. can be emptyNode

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

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

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

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Node[D]

Inherited from ScorexEncoding

Inherited from AnyRef

Inherited from Any

Ungrouped