kr.ac.kaist.ir.deep.rec

BinaryTree

class BinaryTree extends Node

Node for internal structure (non-terminal)

Linear Supertypes
Node, Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. BinaryTree
  2. Node
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BinaryTree(left: Node, right: Node)

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. def ?(resolve: (Int) ⇒ Node): Node

    Replace wildcard node

    Replace wildcard node

    resolve

    Wildcard Resolver function

    returns

    new Node without wildcard

    Definition Classes
    BinaryTreeNode
  5. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  6. def backward(err: ScalarMatrix, fn: (ScalarMatrix) ⇒ ScalarMatrix): Seq[Leaf]

    Backward computation of Binary Tree

    Backward computation of Binary Tree

    err

    Matrix to be propagated

    fn

    function to be applied

    returns

    Sequence of terminal nodes

    Definition Classes
    BinaryTreeNode
  7. def clone(): AnyRef

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

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

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

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def forward(fn: (ScalarMatrix) ⇒ ScalarMatrix): ScalarMatrix

    Forward computation of Binary Tree

    Forward computation of Binary Tree

    fn

    function to be applied

    returns

    the result

    Definition Classes
    BinaryTreeNode
  12. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

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

    Definition Classes
    Any
  15. val left: Node

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

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

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

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

    Definition Classes
    AnyRef
  20. def through(corrupt: Corruption): Node

    Corrupt this node *

    Corrupt this node *

    corrupt

    Corruption function to be applied

    returns

    Corrupted Binary Tree

    Definition Classes
    BinaryTreeNode
  21. def toString(): String

    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Node

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped