Class

com.intel.analytics.bigdl.nn.tf

MergeControlNode

Related Doc: package tf

Permalink

sealed class MergeControlNode[T] extends Node[T]

A wrapper of node for merge operation.

T

element type

Linear Supertypes
Node[T], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MergeControlNode
  2. Node
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def ->(node: Node[T]): Node[T]

    Permalink

    Point to another node

    Point to another node

    node

    another node

    returns

    another node

    Definition Classes
    Node
  4. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  5. def add(node: Node[T], e: Edge = Edge()): Node[T]

    Permalink

    Point to another node

    Point to another node

    node

    another node

    returns

    another node

    Definition Classes
    Node
  6. def append(dependencyIndex: (Node[T], Int)): MergeControlNode.this.type

    Permalink

    Add another dependency node with edge

  7. def append(dependency: Node[T]): MergeControlNode.this.type

    Permalink

    Add another dependency node

  8. def apply[M](meta: M): (MergeControlNode.this.type, M)

    Permalink

    A sugar allows user to generate the pair (n, something) via n(something)

    A sugar allows user to generate the pair (n, something) via n(something)

    Definition Classes
    Node
  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  10. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def delete(node: Node[T], e: Edge = null): Node[T]

    Permalink

    Remove linkage with another node

    Remove linkage with another node

    node

    another node

    returns

    current node

    Definition Classes
    Node
  12. var element: T

    Permalink

    element

    element

    Definition Classes
    Node
  13. final def eq(arg0: AnyRef): Boolean

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. def from(node: Node[T], e: Edge = Edge()): Node[T]

    Permalink
    Definition Classes
    Node
  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  18. def graph(reverse: Boolean = false): DirectedGraph[T]

    Permalink

    Use current node as source to build a direct graph

    Use current node as source to build a direct graph

    Definition Classes
    Node
  19. def hashCode(): Int

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

    Permalink
    Definition Classes
    Any
  21. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  22. def nextEdges: Seq[Edge]

    Permalink

    The edges start from this node

    The edges start from this node

    Definition Classes
    Node
  23. def nextNodes: Seq[Node[T]]

    Permalink

    The nodes pointed by current node

    The nodes pointed by current node

    Definition Classes
    Node
  24. def nextNodesAndEdges: Seq[(Node[T], Edge)]

    Permalink

    The nodes pointed by current node with the connect edges

    The nodes pointed by current node with the connect edges

    Definition Classes
    Node
  25. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  27. def prevEdges: Seq[Edge]

    Permalink

    The edges connect to this node

    The edges connect to this node

    Definition Classes
    Node
  28. def prevNodes: Seq[Node[T]]

    Permalink

    The nodes point to current node

    The nodes point to current node

    Definition Classes
    Node
  29. def prevNodesAndEdges: Seq[(Node[T], Edge)]

    Permalink

    The nodes pointed to current node with the connect edges

    The nodes pointed to current node with the connect edges

    Definition Classes
    Node
  30. def removeNextEdges(): Node[T]

    Permalink

    remove edges that connect next nodes

    remove edges that connect next nodes

    returns

    current node

    Definition Classes
    Node
  31. def removePrevEdges(): Node[T]

    Permalink

    remove edges that connect previous nodes

    remove edges that connect previous nodes

    returns

    current node

    Definition Classes
    Node
  32. def setElement(e: T): MergeControlNode.this.type

    Permalink
    Definition Classes
    Node
  33. final def synchronized[T0](arg0: ⇒ T0): T0

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

    Permalink
    Definition Classes
    Node → AnyRef → Any
  35. final def wait(): Unit

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

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

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

Inherited from Node[T]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped