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.InnerNodeState, 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
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NodeBase
  2. InnerNodeTraversalImpl
  3. InnerNodeState
  4. InnerNodeImpl
  5. InnerNodeLike
  6. NodeBase
  7. InnerNodeLike
  8. InnerNodeLike
  9. NodeBase
  10. InnerNodeLike
  11. Node
  12. Serializable
  13. Serializable
  14. NodeOut
  15. GraphParamNode
  16. GraphParamOut
  17. GraphParam
  18. AnyRef
  19. 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 asNodeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): GraphPredef.NodeOut.asNodeT.G.NodeT

    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeOut

  16. final def asNodeTProjection[N <: N, E[X] <: EdgeLikeIn[X]]: GraphBase.NodeT

    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeOut

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

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

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

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

  19. def canEqual(that: Any): Boolean

    Definition Classes
    InnerNodeLike

  20. def clone(): AnyRef

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

  21. final def containingGraph: DefaultGraphImpl.ThisGraph

    Definition Classes
    InnerNodeLike

  22. def degree: Int

    Definition Classes
    InnerNodeLike

  23. def diPredecessors: Set[NodeT]

    Definition Classes
    InnerNodeLike

  24. def diSuccessors: Set[NodeT]

    Definition Classes
    InnerNodeLike

  25. def dumpState: Array[Long]

    Definition Classes
    InnerNodeState

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

    Definition Classes
    InnerNodeImpl → InnerNodeLike → InnerNodeLike

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

    Definition Classes
    AnyRef

  28. def equals(other: Any): Boolean

    Definition Classes
    InnerNodeLike → AnyRef → Any

  29. def finalize(): Unit

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

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

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

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike

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

    Definition Classes
    InnerNodeLike

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

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

  37. var flags: FlagWord

    Attributes
    protected[scalax.collection.State]
    Definition Classes
    InnerNodeState

  38. var flagsExt: FlagWords

    Attributes
    protected[scalax.collection.State]
    Definition Classes
    InnerNodeState

  39. final def fold[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (GraphPredef.NodeOut.fold.G.NodeT) ⇒ T, fb: (GraphBase.NodeT) ⇒ T): T

    Definition Classes
    NodeOut

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

    Definition Classes
    AnyRef → Any

  41. def hasOnlyHooks: Boolean

    Definition Classes
    InnerNodeLike

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

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

  44. def hashCode(): Int

    Definition Classes
    InnerNodeLike → AnyRef → Any

  45. def inDegree: Int

    Definition Classes
    InnerNodeLike

  46. final def inNeighbors: Set[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  47. def incoming: Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike

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

    Definition Classes
    InnerNodeLike

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

  50. final def isContaining[N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean

    Definition Classes
    NodeBase → NodeOut

  51. def isDirectPredecessorOf(that: NodeT): Boolean

    Definition Classes
    InnerNodeLike

  52. def isEdge: Boolean

    Definition Classes
    GraphParamNode

  53. def isIn: Boolean

    Definition Classes
    GraphParamOut → GraphParam

  54. def isIndependentOf(that: NodeT): Boolean

    Definition Classes
    InnerNodeLike

  55. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  56. final def isIsolated: Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  57. final def isLeaf: Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  58. def isNode: Boolean

    Definition Classes
    GraphParamNode

  59. def isOut: Boolean

    Definition Classes
    GraphParamOut → GraphParam

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

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

  62. val monitor: AnyRef

    Definition Classes
    InnerNodeState

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

    Definition Classes
    AnyRef

  64. def neighbors: Set[NodeT]

    Definition Classes
    InnerNodeLike

  65. final def notify(): Unit

    Definition Classes
    AnyRef

  66. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  67. def outDegree: Int

    Definition Classes
    InnerNodeLike

  68. final def outNeighbors: Set[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  69. def outgoing: Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike

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

    Definition Classes
    InnerNodeLike

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

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

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

  75. def stringPrefix: String

    Definition Classes
    GraphParamNode

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

    Definition Classes
    AnyRef

  77. final def toNodeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (GraphBase.NodeT) ⇒ GraphPredef.NodeOut.toNodeT.G.NodeT): GraphPredef.NodeOut.toNodeT.G.NodeT

    Definition Classes
    NodeOut

  78. def toString(): String

    Definition Classes
    GraphParamNode → AnyRef → Any

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

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

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

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

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

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

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

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

  85. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  88. final def withFlagsExt[T](block: (ExtBitSet) ⇒ T): T

    Attributes
    protected
    Definition Classes
    InnerNodeState
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  94. final def ~|: Set[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

Inherited from DefaultGraphImpl.InnerNodeTraversalImpl

Inherited from DefaultGraphImpl.InnerNodeState

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