com.intel.analytics.bigdl.utils

Node

class Node[T] extends Serializable

Represent a node in a graph. The connections between nodes are directed.

T

element type

Annotations
@SerialVersionUID( 6021651923538325999L )
Linear Supertypes
Serializable, Serializable, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Node
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Node(element: T)

    element

    element

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

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

    Point to another node

    Point to another node

    node

    another node

    returns

    another node

  5. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  6. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  7. def add(node: Node[T], e: Edge = Edge()): Node[T]

    Point to another node

    Point to another node

    node

    another node

    returns

    another node

  8. def addNexts(node: Node[T], e: Edge = Edge()): Unit

  9. def addPrevious(node: Node[T], e: Edge = Edge()): Unit

  10. def apply[M](meta: M): (Node.this.type, M)

    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)

    M
    meta
    returns

  11. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  12. def clone(): AnyRef

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

    Remove linkage with another node

    Remove linkage with another node

    node

    another node

    returns

    current node

  14. var element: T

    element

  15. final def eq(arg0: AnyRef): Boolean

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

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

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

  19. final def getClass(): Class[_]

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

    Use current node as source to build a direct graph

    Use current node as source to build a direct graph

    reverse
    returns

  21. def hashCode(): Int

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

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

    Definition Classes
    AnyRef
  24. def nextEdges: Seq[Edge]

    The edges start from this node

    The edges start from this node

    returns

  25. def nextNodes: Seq[Node[T]]

    The nodes pointed by current node

    The nodes pointed by current node

    returns

  26. def nextNodesAndEdges: Seq[(Node[T], Edge)]

    The nodes pointed by current node with the connect edges

    The nodes pointed by current node with the connect edges

    returns

  27. final def notify(): Unit

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

    Definition Classes
    AnyRef
  29. def prevEdges: Seq[Edge]

    The edges connect to this node

    The edges connect to this node

    returns

  30. def prevNodes: Seq[Node[T]]

    The nodes point to current node

    The nodes point to current node

    returns

  31. def prevNodesAndEdges: Seq[(Node[T], Edge)]

    The nodes pointed to current node with the connect edges

    The nodes pointed to current node with the connect edges

    returns

  32. def removeNextEdges(): Node[T]

    remove edges that connect next nodes

    remove edges that connect next nodes

    returns

    current node

  33. def removePrevEdges(): Node[T]

    remove edges that connect previous nodes

    remove edges that connect previous nodes

    returns

    current node

  34. def setElement(e: T): Node.this.type

  35. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  36. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped