SwitchControlNode

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 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

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. def availableNodes(): Seq[Node[T]]

   

   Return nodes triggered by current node

9. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. 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

11. var element: T

    

    element

    element

    Definition Classes

    Node

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

    

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

14. 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.

15. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

16. def from(node: Node[T], e: Edge = Edge()): Node[T]

    

    Definition Classes

    Node

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

    

    Definition Classes

    AnyRef → Any

18. 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

19. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

20. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

22. def nextEdges: Seq[Edge]

    

    The edges start from this node

    The edges start from this node

    Definition Classes

    Node

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

    

    The nodes pointed by current node

    The nodes pointed by current node

    Definition Classes

    Node

24. 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

25. final def notify(): Unit

    

    Definition Classes

    AnyRef

26. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

27. def prevEdges: Seq[Edge]

    

    The edges connect to this node

    The edges connect to this node

    Definition Classes

    Node

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

    

    The nodes point to current node

    The nodes point to current node

    Definition Classes

    Node

29. 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

30. def removeNextEdges(): Node[T]

    

    remove edges that connect next nodes

    remove edges that connect next nodes

    returns

    current node

    Definition Classes

    Node

31. def removePrevEdges(): Node[T]

    

    remove edges that connect previous nodes

    remove edges that connect previous nodes

    returns

    current node

    Definition Classes

    Node

32. def setElement(e: T): SwitchControlNode.this.type

    

    Definition Classes

    Node

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

    

    Definition Classes

    AnyRef

34. def toString(): String

    

    Definition Classes

    Node → AnyRef → Any

35. 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.

36. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

38. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )