scalax.collection.constrained.immutable.DefaultGraphImpl

NodeBase

final class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl

Attributes
protected
Definition Classes
DefaultGraphImpl → GraphLike → GraphBase
Annotations
@SerialVersionUID( 8081L )
Linear Supertypes
DefaultGraphImpl.InnerNodeTraversalImpl, DefaultGraphImpl.InnerNodeImpl, DefaultGraphImpl.InnerNodeLike, DefaultGraphImpl.NodeBase, DefaultGraphImpl.InnerNodeLike, DefaultGraphImpl.InnerNodeLike, DefaultGraphImpl.NodeBase, DefaultGraphImpl.InnerNodeLike, DefaultGraphImpl.Node, Serializable, Serializable, NodeOut[N], GraphParamNode[N], GraphParamOut[N, Nothing], GraphParam[N, Nothing], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NodeBase
  2. InnerNodeTraversalImpl
  3. InnerNodeImpl
  4. InnerNodeLike
  5. NodeBase
  6. InnerNodeLike
  7. InnerNodeLike
  8. NodeBase
  9. InnerNodeLike
  10. Node
  11. Serializable
  12. Serializable
  13. NodeOut
  14. GraphParamNode
  15. GraphParamOut
  16. GraphParam
  17. AnyRef
  18. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NodeBase(value: N, hints: Hints)

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. final def +=(edge: DefaultGraphImpl.EdgeT): NodeBase.this.type

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  5. final def <~(from: NodeT): Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  6. final def <~: Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  7. final def <~?(from: NodeT): Option[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  8. final def <~|: Set[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  9. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  10. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  11. def addDiPredecessors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) ⇒ Unit): Unit

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeLike

  12. def addDiSuccessors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) ⇒ Unit): Unit

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeLike

  13. def addNeighbors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) ⇒ Unit): Unit

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeLike

  14. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  15. final def bit[T](implicit handle: Handle): Boolean

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeTraversalImpl
    Annotations
    @inline()

  16. final def bit_=[T](visited: Boolean)(implicit handle: Handle): Unit

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeTraversalImpl
    Annotations
    @inline()

  17. def canEqual(that: Any): Boolean

    Definition Classes
    InnerNodeLike

  18. final def clear(dirtyFlags: DefaultGraphImpl.StateFlags): Unit

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeTraversalImpl
    Annotations
    @inline()

  19. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  20. def containingGraph: DefaultGraphImpl.ThisGraph

    Definition Classes
    InnerNodeLike

  21. def degree: Int

    Definition Classes
    InnerNodeLike

  22. def diPredecessors: Set[NodeT]

    Definition Classes
    InnerNodeLike

  23. def diSuccessors: Set[NodeT]

    Definition Classes
    InnerNodeLike

  24. final val edges: ArraySet[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeImpl → InnerNodeLike → InnerNodeLike

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

    Definition Classes
    AnyRef

  26. def equals(other: Any): Boolean

    Definition Classes
    InnerNodeLike → AnyRef → Any

  27. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  28. def findConnected(pred: (NodeT) ⇒ Boolean, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[NodeT]

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  29. def findCycle(nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, maxDepth: Int, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[DefaultGraphImpl.Cycle]

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  30. final def findCycle: Option[DefaultGraphImpl.Cycle]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  31. def findIncomingFrom(from: NodeT): Option[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike

  32. def findOutgoingTo(to: NodeT): Option[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike

  33. def findPredecessor(pred: (NodeT) ⇒ Boolean, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[NodeT]

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  34. def findSuccessor(pred: (NodeT) ⇒ Boolean, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[NodeT]

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  35. var flags: DefaultGraphImpl.StateFlags

    Definition Classes
    InnerNodeTraversalImpl

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

    Definition Classes
    AnyRef → Any

  37. def hasOnlyHooks: Boolean

    Definition Classes
    InnerNodeLike

  38. final def hasPredecessor(potentialPredecessor: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  39. final def hasSuccessor(potentialSuccessor: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  40. def hashCode(): Int

    Definition Classes
    InnerNodeLike → AnyRef → Any

  41. def inDegree: Int

    Definition Classes
    InnerNodeLike

  42. final def inNeighbors: Set[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  43. def incoming: Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike

  44. def incomingFrom(from: NodeT): Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike

  45. final def isConnectedWith(potentialConnected: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  46. def isDirectPredecessorOf(that: NodeT): Boolean

    Definition Classes
    InnerNodeLike

  47. def isEdge: Boolean

    Definition Classes
    GraphParamNode

  48. def isIn: Boolean

    Definition Classes
    GraphParamOut → GraphParam

  49. def isIndependentOf(that: NodeT): Boolean

    Definition Classes
    InnerNodeLike

  50. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  51. final def isIsolated: Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  52. final def isLeaf: Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  53. def isNode: Boolean

    Definition Classes
    GraphParamNode

  54. def isOut: Boolean

    Definition Classes
    GraphParamOut → GraphParam

  55. final def isPredecessorOf(potentialSuccessor: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  56. final def isSuccessorOf(potentialPredecessor: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    AnyRef

  58. def neighbors: Set[NodeT]

    Definition Classes
    InnerNodeLike

  59. final def notify(): Unit

    Definition Classes
    AnyRef

  60. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  61. def outDegree: Int

    Definition Classes
    InnerNodeLike

  62. final def outNeighbors: Set[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  63. def outgoing: Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike

  64. def outgoingTo(to: NodeT): Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike

  65. final def pathTo(potentialSuccessor: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[DefaultGraphImpl.Path]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  66. final def pathTo(potentialSuccessor: NodeT): Option[DefaultGraphImpl.Path]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  67. def pathUntil(pred: (NodeT) ⇒ Boolean, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[DefaultGraphImpl.Path]

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  68. def shortestPathTo(to: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[DefaultGraphImpl.Path]

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  69. def stringPrefix: String

    Definition Classes
    GraphParamNode

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

    Definition Classes
    AnyRef

  71. def toString(): String

    Definition Classes
    GraphParamNode → AnyRef → Any

  72. final def traverse(direction: Direction, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, breadthFirst: Boolean, maxDepth: Int, ordering: DefaultGraphImpl.ElemOrdering)(nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit): Unit

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  73. final def traverseDownUp(direction: Direction, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, maxDepth: Int, ordering: DefaultGraphImpl.ElemOrdering)(nodeDown: (NodeT) ⇒ VisitorReturn, nodeUp: (NodeT) ⇒ Unit): Option[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  74. final def traverseEdges(direction: Direction, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, breadthFirst: Boolean, maxDepth: Int, ordering: DefaultGraphImpl.ElemOrdering)(edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit): Unit

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  75. final def traverseNodes(direction: Direction, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, breadthFirst: Boolean, maxDepth: Int, ordering: DefaultGraphImpl.ElemOrdering)(nodeVisitor: (NodeT) ⇒ VisitorReturn): Unit

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  76. final def visited(implicit handle: Handle): Boolean

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeTraversalImpl
    Annotations
    @inline()

  77. final def visited_=(visited: Boolean)(implicit handle: Handle): Unit

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeTraversalImpl
    Annotations
    @inline()

  78. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  81. final def ~: ExtSet[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  82. final def ~>(to: NodeT): Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  83. final def ~>: Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  84. final def ~>?(to: NodeT): Option[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  85. final def ~>|: Set[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  86. final def ~|: Set[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

Inherited from DefaultGraphImpl.InnerNodeTraversalImpl

Inherited from DefaultGraphImpl.InnerNodeImpl

Inherited from DefaultGraphImpl.InnerNodeLike

Inherited from DefaultGraphImpl.NodeBase

Inherited from DefaultGraphImpl.InnerNodeLike

Inherited from DefaultGraphImpl.InnerNodeLike

Inherited from DefaultGraphImpl.NodeBase

Inherited from DefaultGraphImpl.InnerNodeLike

Inherited from DefaultGraphImpl.Node

Inherited from Serializable

Inherited from Serializable

Inherited from NodeOut[N]

Inherited from GraphParamNode[N]

Inherited from GraphParamOut[N, Nothing]

Inherited from GraphParam[N, Nothing]

Inherited from AnyRef

Inherited from Any

Ungrouped