c

org.bitcoins.core.util

LeafDoubleSha256Digest

case class LeafDoubleSha256Digest(v: DoubleSha256Digest) extends BinaryTreeDoubleSha256Digest with Product with Serializable

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LeafDoubleSha256Digest
  2. Serializable
  3. Product
  4. Equals
  5. BinaryTreeDoubleSha256Digest
  6. BinaryTree
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new LeafDoubleSha256Digest(v: DoubleSha256Digest)

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)(implicit tree: BinaryTreeDoubleSha256Digest): Boolean

    Checks if the BinaryTree contains a certain element.

    Checks if the BinaryTree contains a certain element.

    Definition Classes
    BinaryTreeDoubleSha256Digest
  7. def contains[T](t: T)(f: (T) => Boolean = (x: T) => x == t)(implicit tree: BinaryTree[T] = this): Boolean

    Checks if the BinaryTree contains a certain element.

    Checks if the BinaryTree contains a certain element.

    Definition Classes
    BinaryTree
  8. def count[T](t: T): Int
    Definition Classes
    BinaryTree
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  11. def findFirstDFS(t: DoubleSha256Digest)(implicit tree: BinaryTreeDoubleSha256Digest): Option[BinaryTreeDoubleSha256Digest]

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

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

    Definition Classes
    BinaryTreeDoubleSha256Digest
  12. def findFirstDFS[T](t: T)(f: (T) => Boolean = (x: T) => x == t)(implicit tree: BinaryTree[T] = this): Option[BinaryTree[T]]

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

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

    Definition Classes
    BinaryTree
  13. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  14. def insert(subTree: BinaryTreeDoubleSha256Digest)(implicit parentTree: 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.

    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.

    Definition Classes
    BinaryTreeDoubleSha256Digest
  15. def insert(t: DoubleSha256Digest)(implicit tree: BinaryTreeDoubleSha256Digest): 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.

    Definition Classes
    BinaryTreeDoubleSha256Digest
  16. def insert[T](subTree: BinaryTree[T])(implicit parentTree: BinaryTree[T]): BinaryTree[T]

    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.

    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.

    Definition Classes
    BinaryTree
  17. def insert[T](t: T)(implicit tree: BinaryTree[T] = this): BinaryTree[T]

    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.

    Definition Classes
    BinaryTree
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  19. def left: Option[BinaryTreeDoubleSha256Digest]
  20. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  22. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  23. def productElementNames: Iterator[String]
    Definition Classes
    Product
  24. def remove(subTree: BinaryTreeDoubleSha256Digest)(parentTree: BinaryTreeDoubleSha256Digest): BinaryTreeDoubleSha256Digest

    Removes the subTree from the parentTree.

    Removes the subTree from the parentTree.

    Definition Classes
    BinaryTreeDoubleSha256Digest
  25. def remove[T](subTree: BinaryTree[T])(parentTree: BinaryTree[T] = this): BinaryTree[T]

    Removes the subTree from the parentTree.

    Removes the subTree from the parentTree.

    Definition Classes
    BinaryTree
  26. def replace(originalTree: BinaryTreeDoubleSha256Digest, replacementTree: BinaryTreeDoubleSha256Digest)(implicit parentTree: BinaryTreeDoubleSha256Digest): BinaryTreeDoubleSha256Digest

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

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

    Definition Classes
    BinaryTreeDoubleSha256Digest
  27. def replace[T](originalTree: BinaryTree[T], replacementTree: BinaryTree[T])(implicit parentTree: BinaryTree[T] = this): BinaryTree[T]

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

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

    Definition Classes
    BinaryTree
  28. def right: Option[BinaryTreeDoubleSha256Digest]
  29. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  30. def toList: List[DoubleSha256Digest]
    Definition Classes
    BinaryTree
  31. def toSeq: Seq[DoubleSha256Digest]
    Definition Classes
    BinaryTree
  32. def toSeqLeafValues: Seq[DoubleSha256Digest]

    Creates a sequence with only the leaf values evaluates as depth first from left to right.

    Creates a sequence with only the leaf values evaluates as depth first from left to right.

    Definition Classes
    BinaryTree
  33. val v: DoubleSha256Digest
  34. def value: Option[DoubleSha256Digest]
  35. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  36. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  37. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped