sealed class MergeControlNode[T] extends Node[T]
A wrapper of node for merge operation.
- T
element type
- Alphabetic
- By Inheritance
- MergeControlNode
- Node
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
->(node: Node[T]): Node[T]
Point to another node
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
add(node: Node[T], e: Edge = Edge()): Node[T]
Point to another node
-
def
addNexts(node: Node[T], e: Edge = Edge()): Unit
- Definition Classes
- Node
-
def
addPrevious(node: Node[T], e: Edge = Edge()): Unit
- Definition Classes
- Node
-
def
append(dependencyIndex: (Node[T], Int)): MergeControlNode.this.type
Add another dependency node with edge
-
def
append(dependency: Node[T]): MergeControlNode.this.type
Add another dependency node
-
def
apply[M](meta: M): (MergeControlNode.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
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
delete(node: Node[T], e: Edge = null): Node[T]
Remove linkage with another node
-
var
element: T
- Definition Classes
- Node
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
from(node: Node[T], e: Edge = Edge()): Node[T]
- Definition Classes
- Node
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
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
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nextEdges: Seq[Edge]
The edges start from this node
The edges start from this node
- Definition Classes
- Node
-
def
nextNodes: Seq[Node[T]]
The nodes pointed by current node
The nodes pointed by current node
- Definition Classes
- Node
-
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
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
prevEdges: Seq[Edge]
The edges connect to this node
The edges connect to this node
- Definition Classes
- Node
-
def
prevNodes: Seq[Node[T]]
The nodes point to current node
The nodes point to current node
- Definition Classes
- Node
-
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
-
def
removeNextEdges(): Node[T]
remove edges that connect next nodes
-
def
removePrevEdges(): Node[T]
remove edges that connect previous nodes
-
def
setElement(e: T): MergeControlNode.this.type
- Definition Classes
- Node
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- Node → AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )