t

org.bitcoins.core.util

BinaryTreeDoubleSha256Digest

sealed trait BinaryTreeDoubleSha256Digest extends AnyRef

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BinaryTreeDoubleSha256Digest
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  6. def contains(t: DoubleSha256Digest): Boolean

    Checks if the BinaryTree contains a certain element.

  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  10. def findFirstDFS(t: DoubleSha256Digest): Option[BinaryTreeDoubleSha256Digest]

    A function to find the first occurrence of a predicate inside a BinaryTree.

  11. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. def insert(subTree: BinaryTreeDoubleSha256Digest): BinaryTreeDoubleSha256Digest

    Inserts a tree into one of the two branches in a BinaryTree If it cannot insert it because the branches are not empty, it throws a RuntimeException.

  14. def insert(t: DoubleSha256Digest): BinaryTreeDoubleSha256Digest

    Inserts an element into one of the two branches in a BinaryTree.

    Inserts an element into one of the two branches in a BinaryTree. If it cannot insert it because the branches are not empty, it throws a RuntimeException.

  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. def left: Option[BinaryTreeDoubleSha256Digest]
  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  20. def remove(subTree: BinaryTreeDoubleSha256Digest): BinaryTreeDoubleSha256Digest

    Removes the subTree from the parentTree.

  21. def replace(originalTree: BinaryTreeDoubleSha256Digest, replacementTree: BinaryTreeDoubleSha256Digest): BinaryTreeDoubleSha256Digest

    Replaces all instances of the original tree with the replacement tree.

  22. def right: Option[BinaryTreeDoubleSha256Digest]
  23. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  24. def toString(): String
    Definition Classes
    AnyRef → Any
  25. def value: Option[DoubleSha256Digest]
  26. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped