Node

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

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

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

   

   A sugar allows user to generate the pair (n, something) via n(something)

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

10. var element: T

    

    element

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

    

    Definition Classes

    AnyRef

12. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

13. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

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

    

    Definition Classes

    AnyRef → Any

16. def graph(reverse: Boolean = false): DirectedGraph[T]

    

    Use current node as source to build a direct graph

17. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

18. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

20. def nextEdges: Seq[Edge]

    

    The edges start from this node

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

    

    The nodes pointed by current node

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

    

    The nodes pointed by current node with the connect edges

23. final def notify(): Unit

    

    Definition Classes

    AnyRef

24. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

25. def prevEdges: Seq[Edge]

    

    The edges connect to this node

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

    

    The nodes point to current node

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

    

    The nodes pointed to current node with the connect edges

28. def removeNextEdges(): Node[T]

    

    remove edges that connect next nodes

    remove edges that connect next nodes

    returns

    current node

29. def removePrevEdges(): Node[T]

    

    remove edges that connect previous nodes

    remove edges that connect previous nodes

    returns

    current node

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

    

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

    

    Definition Classes

    AnyRef

32. def toString(): String

    

    Definition Classes

    Node → AnyRef → Any

33. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )