Value Members

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

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  def ->(node: Node[T]): Node[T]

   Point to another node

   Point to another node

   node

   another node

   returns

   another node

   Definition Classes

   Node

4.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

5.  def add(node: Node[T], e: Edge = Edge()): Node[T]

   Point to another node

   Point to another node

   node

   another node

   returns

   another node

   Definition Classes

   Node

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

   Definition Classes

   Node

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

   Definition Classes

   Node

8.  def apply[M](meta: M): (SwitchControlNode.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)

   Definition Classes

   Node

9.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

10.  def availableNodes(): Seq[Node[T]]

    Return nodes triggered by current node

11.  def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @native() @throws( ... )

12.  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

    Definition Classes

    Node

13.  var element: T

    Definition Classes

    Node

14.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

15.  def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

16.  def falseEdge(): (Node[T], Int)

    The output edge which will be run when condition scalar is false.

    The output edge which will be run when condition scalar is false. You should not connect one node with both type edges.

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]

    Definition Classes

    Node

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

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

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

    Definition Classes

    Node

21.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

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

    Definition Classes

    Node

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

    The nodes pointed by current node

    The nodes pointed by current node

    Definition Classes

    Node

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

    Definition Classes

    Node

27.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

28.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

29.  def prevEdges: Seq[Edge]

    The edges connect to this node

    The edges connect to this node

    Definition Classes

    Node

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

    The nodes point to current node

    The nodes point to current node

    Definition Classes

    Node

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

    Definition Classes

    Node

32.  def removeNextEdges(): Node[T]

    remove edges that connect next nodes

    remove edges that connect next nodes

    returns

    current node

    Definition Classes

    Node

33.  def removePrevEdges(): Node[T]

    remove edges that connect previous nodes

    remove edges that connect previous nodes

    returns

    current node

    Definition Classes

    Node

34.  def setElement(e: T): SwitchControlNode.this.type

    Definition Classes

    Node

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

    Definition Classes

    AnyRef

36.  def toString(): String

    Definition Classes

    Node → AnyRef → Any

37.  def trueEdge(): (Node[T], Int)

    The output edge which will be run when condition scalar is true.

    The output edge which will be run when condition scalar is true. You should not connect one node with both type edges.

38.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

39.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

40.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @native() @throws( ... )