SwitchControlNode

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

   Definition Classes

   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

   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)

   M

   meta

   returns

   Definition Classes

   Node

9. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

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

    Return nodes triggered by current node

    Return nodes triggered by current node

    returns

11. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @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. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

14. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

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

    returns

16. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    Node

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

    Definition Classes

    AnyRef → Any

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

    Definition Classes

    Node

20. def hashCode(): Int

    Definition Classes

    AnyRef → Any

21. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AnyRef

23. def nextEdges: Seq[Edge]

    The edges start from this node

    The edges start from this node

    returns

    Definition Classes

    Node

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

    The nodes pointed by current node

    The nodes pointed by current node

    returns

    Definition Classes

    Node

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

    Definition Classes

    Node

26. final def notify(): Unit

    Definition Classes

    AnyRef

27. final def notifyAll(): Unit

    Definition Classes

    AnyRef

28. def prevEdges: Seq[Edge]

    The edges connect to this node

    The edges connect to this node

    returns

    Definition Classes

    Node

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

    The nodes point to current node

    The nodes point to current node

    returns

    Definition Classes

    Node

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

    Definition Classes

    Node

31. def removeNextEdges(): Node[T]

    remove edges that connect next nodes

    remove edges that connect next nodes

    returns

    current node

    Definition Classes

    Node

32. def removePrevEdges(): Node[T]

    remove edges that connect previous nodes

    remove edges that connect previous nodes

    returns

    current node

    Definition Classes

    Node

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

    Definition Classes

    Node

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

    Definition Classes

    AnyRef

35. def toString(): String

    Definition Classes

    Node → AnyRef → Any

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

    returns

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( ... )