Node

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

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

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

9. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

10. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

12. var element: T

    element

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

    Definition Classes

    AnyRef

14. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

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]

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

    reverse

    returns

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

    returns

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

    The nodes pointed by current node

    The nodes pointed by current node

    returns

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

    returns

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

    returns

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

    The nodes point to current node

    The nodes point to current node

    returns

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

    returns

30. def removeNextEdges(): Node[T]

    remove edges that connect next nodes

    remove edges that connect next nodes

    returns

    current node

31. def removePrevEdges(): Node[T]

    remove edges that connect previous nodes

    remove edges that connect previous nodes

    returns

    current node

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

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

    Definition Classes

    AnyRef

34. def toString(): String

    Definition Classes

    Node → AnyRef → Any

35. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )