case class LeafDoubleSha256Digest(v: DoubleSha256Digest) extends BinaryTreeDoubleSha256Digest with Product with Serializable
- Alphabetic
- By Inheritance
- LeafDoubleSha256Digest
- Serializable
- Product
- Equals
- BinaryTreeDoubleSha256Digest
- BinaryTree
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new LeafDoubleSha256Digest(v: DoubleSha256Digest)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- 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
- 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
- def count[T](t: T): Int
- Definition Classes
- BinaryTree
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- 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
- 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
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- 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
- 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
- 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
- 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
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def left: Option[BinaryTreeDoubleSha256Digest]
- Definition Classes
- BinaryTreeDoubleSha256Digest → BinaryTree
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def remove(subTree: BinaryTreeDoubleSha256Digest)(parentTree: BinaryTreeDoubleSha256Digest): BinaryTreeDoubleSha256Digest
Removes the subTree from the parentTree.
Removes the subTree from the parentTree.
- Definition Classes
- BinaryTreeDoubleSha256Digest
- 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
- 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
- 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
- def right: Option[BinaryTreeDoubleSha256Digest]
- Definition Classes
- BinaryTreeDoubleSha256Digest → BinaryTree
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toList: List[DoubleSha256Digest]
- Definition Classes
- BinaryTree
- def toSeq: Seq[DoubleSha256Digest]
- Definition Classes
- BinaryTree
- 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
- val v: DoubleSha256Digest
- def value: Option[DoubleSha256Digest]
- Definition Classes
- BinaryTreeDoubleSha256Digest → BinaryTree
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()