Packages

final class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl

Attributes
protected
Annotations
@SerialVersionUID()
Linear Supertypes
DefaultGraphImpl.InnerNodeTraversalImpl, DefaultGraphImpl.InnerNodeState, DefaultGraphImpl.InnerNodeImpl, DefaultGraphImpl.InnerNode, DefaultGraphImpl.NodeBase, DefaultGraphImpl.InnerNode, DefaultGraphImpl.TraverserInnerNode, DefaultGraphImpl.NodeBase, DefaultGraphImpl.InnerNode, DefaultGraphImpl.InnerElem, DefaultGraphImpl.Node, Serializable, Serializable, InnerNodeParam[N], NodeParam[N], OutParam[N, Nothing], Param[N, Nothing], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeBase
  2. InnerNodeTraversalImpl
  3. InnerNodeState
  4. InnerNodeImpl
  5. InnerNode
  6. NodeBase
  7. InnerNode
  8. TraverserInnerNode
  9. NodeBase
  10. InnerNode
  11. InnerElem
  12. Node
  13. Serializable
  14. Serializable
  15. InnerNodeParam
  16. NodeParam
  17. OutParam
  18. Param
  19. AnyRef
  20. Any
Implicitly
  1. by anyToNode
  2. by toDefaultTraverser
  3. by EdgeAssoc
  4. by CollectionsHaveToParArray
  5. by toValue
  6. by any2stringadd
  7. by StringFormat
  8. by Ensuring
  9. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

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

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from NodeBase to any2stringadd[NodeBase] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. final def +=(edge: DefaultGraphImpl.EdgeT): NodeBase.this.type
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  5. def ->[B](y: B): (NodeBase, B)
    Implicit
    This member is added by an implicit conversion from NodeBase to ArrowAssoc[NodeBase] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def <~(from: NodeT): Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  7. final def <~: Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  8. final def <~?(from: NodeT): Option[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  9. final def <~|: Set[NodeT]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. var _diSuccessors: EqSet[NodeT]
    Attributes
    protected
    Definition Classes
    InnerNodeImpl
  12. def add(edge: DefaultGraphImpl.EdgeT): Boolean
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  13. final def addDiPredecessors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) ⇒ Unit): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode → InnerNode
  14. final def addDiSuccessors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) ⇒ Unit): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode → InnerNode
  15. final def addNeighbors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) ⇒ Unit): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode → InnerNode
  16. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  17. final def asNodeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): GraphPredef.InnerNodeParam.asNodeT.G.NodeT
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeParam
  18. final def asNodeTProjection[N <: N, E[X] <: EdgeLikeIn[X]]: GraphBase.NodeT
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeParam
  19. final def bit[T](implicit handle: Handle): Boolean
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeState
    Annotations
    @inline()
  20. final def bit_=[T](isSet: Boolean)(implicit handle: Handle): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeState
    Annotations
    @inline()
  21. def canEqual(that: Any): Boolean
    Definition Classes
    InnerNode
  22. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  23. final def connectionsWith(other: NodeT): FilteredSet[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode → InnerNode
  24. final def containingGraph: DefaultGraphImpl.ThisGraph
    Definition Classes
    InnerNode
  25. final def degree: Int
    Definition Classes
    InnerNode → InnerNode
  26. final def diPredecessors: Set[NodeT]
    Definition Classes
    InnerNode → InnerNode
  27. final def diSuccessors: Set[NodeT]
    Definition Classes
    InnerNodeImpl → InnerNode
  28. def dumpState: Array[Long]
    Definition Classes
    InnerNodeState
  29. final val edges: ArraySet[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNodeImpl → InnerNode → InnerNode
  30. def ensuring(cond: (NodeBase) ⇒ Boolean, msg: ⇒ Any): NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to Ensuring[NodeBase] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  31. def ensuring(cond: (NodeBase) ⇒ Boolean): NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to Ensuring[NodeBase] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  32. def ensuring(cond: Boolean, msg: ⇒ Any): NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to Ensuring[NodeBase] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  33. def ensuring(cond: Boolean): NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to Ensuring[NodeBase] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  34. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  35. def equals(other: Any): Boolean
    Definition Classes
    InnerNode → AnyRef → Any
  36. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  37. final def findConnected[U](pred: DefaultGraphImpl.NodeFilter)(implicit visitor: (NodeT) ⇒ U): Option[NodeT]
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  38. def findCycle[U](implicit visitor: (NodeT) ⇒ U): Option[DefaultGraphImpl.Cycle]
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  39. final def findIncomingFrom(from: NodeT): Option[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode → InnerNode
  40. final def findOutgoingTo(to: NodeT): Option[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode → InnerNode
  41. final def findPredecessor[U](pred: DefaultGraphImpl.NodeFilter)(implicit visitor: (NodeT) ⇒ U): Option[NodeT]
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  42. final def findSuccessor[U](pred: DefaultGraphImpl.NodeFilter)(implicit visitor: (NodeT) ⇒ U): Option[NodeT]
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  43. val flags: FlagWord
    Attributes
    protected[scalax.collection.State]
    Definition Classes
    InnerNodeState
  44. val flagsExt: FlagWords
    Attributes
    protected[scalax.collection.State]
    Definition Classes
    InnerNodeState
  45. final def fold[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (GraphPredef.InnerNodeParam.fold.G.NodeT) ⇒ T, fb: (GraphBase.NodeT) ⇒ T): T
    Definition Classes
    InnerNodeParam
  46. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from NodeBase to StringFormat[NodeBase] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  47. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  48. final def hasOnlyHooks: Boolean
    Definition Classes
    InnerNode → InnerNode
  49. final def hasPredecessor[U](potentialPredecessor: NodeT)(implicit visitor: (NodeT) ⇒ U): Boolean
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  50. final def hasPredecessors: Boolean
    Definition Classes
    InnerNode → InnerNode
  51. final def hasSuccessor[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) ⇒ U): Boolean
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  52. final def hasSuccessors: Boolean
    Definition Classes
    InnerNode → InnerNode
  53. def hashCode(): Int
    Definition Classes
    InnerNode → AnyRef → Any
  54. final def hook: Option[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode → InnerNode
  55. final def inDegree(nodeFilter: DefaultGraphImpl.NodeFilter, edgeFilter: DefaultGraphImpl.EdgeFilter, includeHooks: Boolean, ignoreMultiEdges: Boolean): Int
    Definition Classes
    InnerNode → InnerNode
  56. final def inDegree: Int
    Definition Classes
    InnerNode → InnerNode
  57. final def inNeighbors: Set[NodeT]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  58. final def incoming: FilteredSet[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode → InnerNode
  59. final def incomingFrom(from: NodeT): FilteredSet[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode → InnerNode
  60. final def innerEdgeTraverser(implicit parameters: Parameters): DefaultGraphImpl.InnerEdgeTraverser
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  61. final def innerElemTraverser(implicit parameters: Parameters): DefaultGraphImpl.InnerElemTraverser
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  62. final def innerNodeDownUpTraverser(implicit parameters: Parameters): DefaultGraphImpl.InnerNodeDownUpTraverser
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  63. final def innerNodeTraverser(implicit parameters: Parameters): DefaultGraphImpl.InnerNodeTraverser
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  64. final def isConnectedWith[U](potentialConnected: NodeT)(implicit visitor: (NodeT) ⇒ U): Boolean
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  65. final def isContaining[N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean
    Definition Classes
    NodeBase → InnerNodeParam
  66. def isDefined: Boolean
    Definition Classes
    Param
  67. final def isDirectPredecessorOf(that: NodeT): Boolean
    Definition Classes
    InnerNode → InnerNode
  68. final def isEdge: Boolean
    Definition Classes
    Param
  69. def isIn: Boolean
    Definition Classes
    OutParam → Param
  70. final def isIndependentOf(that: NodeT): Boolean
    Definition Classes
    InnerNode → InnerNode
  71. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  72. final def isIsolated: Boolean
    Definition Classes
    InnerNode
    Annotations
    @inline()
  73. final def isLeaf: Boolean
    Definition Classes
    InnerNode
    Annotations
    @inline()
  74. def isNode: Boolean
    Definition Classes
    NodeParam
  75. final def isOut: Boolean
    Definition Classes
    Param
  76. final def isPredecessorOf[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) ⇒ U): Boolean
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  77. final def isSuccessorOf[U](potentialPredecessor: NodeT)(implicit visitor: (NodeT) ⇒ U): Boolean
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  78. val n1: NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to EdgeAssoc[NodeBase] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  79. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  80. final def neighbors: Set[NodeT]
    Definition Classes
    InnerNode → InnerNode
  81. final def nodeEqThis: (NodeT) ⇒ Boolean
    Attributes
    protected
    Definition Classes
    InnerNode
    Annotations
    @inline()
  82. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  83. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  84. final def outDegree(nodeFilter: DefaultGraphImpl.NodeFilter, edgeFilter: DefaultGraphImpl.EdgeFilter, includeHooks: Boolean, ignoreMultiEdges: Boolean): Int
    Definition Classes
    InnerNode → InnerNode
  85. final def outDegree: Int
    Definition Classes
    InnerNode → InnerNode
  86. final def outNeighbors: Set[NodeT]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  87. final def outerEdgeTraverser(implicit parameters: Parameters): DefaultGraphImpl.OuterEdgeTraverser
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  88. final def outerElemTraverser(implicit parameters: Parameters): DefaultGraphImpl.OuterElemTraverser
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  89. final def outerNodeDownUpTraverser(implicit parameters: Parameters): DefaultGraphImpl.OuterNodeDownUpTraverser
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  90. final def outerNodeTraverser(implicit parameters: Parameters): DefaultGraphImpl.OuterNodeTraverser
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  91. final def outgoing: FilteredSet[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode → InnerNode
  92. final def outgoingTo(to: NodeT): FilteredSet[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode → InnerNode
  93. def partOfCycle[U](implicit visitor: (NodeT) ⇒ U): Option[DefaultGraphImpl.Cycle]
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  94. final def pathTo[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) ⇒ U): Option[DefaultGraphImpl.Path]
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  95. def pathUntil[U](pred: DefaultGraphImpl.NodeFilter)(implicit visitor: (NodeT) ⇒ U): Option[DefaultGraphImpl.Path]
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  96. def root: NodeT
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  97. final def shortestPathTo[T](potentialSuccessor: NodeT, weight: (DefaultGraphImpl.EdgeT) ⇒ T)(implicit arg0: Numeric[T]): Option[DefaultGraphImpl.Path]
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  98. final def shortestPathTo[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) ⇒ U): Option[DefaultGraphImpl.Path]
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  99. def shortestPathTo[T, U](potentialSuccessor: NodeT, weight: (DefaultGraphImpl.EdgeT) ⇒ T, visitor: (NodeT) ⇒ U)(implicit arg0: Numeric[T]): Option[DefaultGraphImpl.Path]
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  100. def stringPrefix: String
    Definition Classes
    NodeParam
  101. def strongComponents[U](implicit visitor: (NodeT) ⇒ U): Iterable[DefaultGraphImpl.Component]
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  102. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  103. final def toInnerElemTraverser(root: NodeT): DefaultGraphImpl.InnerElemTraverser
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  104. final def toNodeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (GraphBase.NodeT) ⇒ GraphPredef.InnerNodeParam.toNodeT.G.NodeT): GraphPredef.InnerNodeParam.toNodeT.G.NodeT
    Definition Classes
    InnerNodeParam
  105. final def toOuter: N
    Definition Classes
    InnerNode
    Annotations
    @inline()
  106. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from NodeBase to CollectionsHaveToParArray[NodeBase, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (NodeBase) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  107. def toString(): String
    Definition Classes
    NodeParam → AnyRef → Any
  108. def topologicalSort[U](ignorePredecessors: Boolean)(implicit visitor: (DefaultGraphImpl.InnerElem) ⇒ U): DefaultGraphImpl.CycleNodeOrTopologicalOrder
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  109. val value: N
    Definition Classes
    NodeBase → InnerNode → NodeParam
  110. final def visited(implicit handle: Handle): Boolean
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeState
    Annotations
    @inline()
  111. final def visited_=(visited: Boolean)(implicit handle: Handle): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeState
    Annotations
    @inline()
  112. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  113. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  114. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  115. def weakComponent[U](implicit visitor: (NodeT) ⇒ U): DefaultGraphImpl.Component
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  116. final def withDirection(direction: Direction): DefaultGraphImpl.InnerNodeTraverser
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  117. final def withFlagsExt[T](block: (ExtBitSet) ⇒ T): T
    Attributes
    protected
    Definition Classes
    InnerNodeState
    Annotations
    @inline()
  118. final def withKind(kind: Kind): DefaultGraphImpl.InnerNodeTraverser
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  119. final def withMaxDepth(maxDepth: Int): DefaultGraphImpl.InnerNodeTraverser
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  120. final def withMaxWeight(max: Long): DefaultGraphImpl.InnerNodeTraverser
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  121. final def withMaxWeight[W](max: W, edgeWeight: (DefaultGraphImpl.EdgeT) ⇒ W)(implicit arg0: Numeric[W]): DefaultGraphImpl.InnerNodeTraverser
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  122. def withMaxWeight(maxWeight: Option[DefaultGraphImpl.Weight]): DefaultGraphImpl.InnerNodeTraverser
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  123. final def withOrdering(ordering: DefaultGraphImpl.ElemOrdering): DefaultGraphImpl.InnerNodeTraverser
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  124. final def withParameters(parameters: Parameters): DefaultGraphImpl.InnerNodeTraverser
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  125. final def withRoot(root: NodeT): DefaultGraphImpl.InnerNodeTraverser
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  126. final def withSubgraph(nodes: DefaultGraphImpl.NodeFilter, edges: DefaultGraphImpl.EdgeFilter): DefaultGraphImpl.InnerNodeTraverser
    Implicit
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  127. final def ~: ExtSet[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  128. final def ~>(to: NodeT): Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  129. final def ~>: Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  130. final def ~>?(to: NodeT): Option[DefaultGraphImpl.EdgeT]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  131. final def ~>|: Set[NodeT]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  132. final def ~|: Set[NodeT]
    Definition Classes
    InnerNode
    Annotations
    @inline()
  133. def →[B](y: B): (NodeBase, B)
    Implicit
    This member is added by an implicit conversion from NodeBase to ArrowAssoc[NodeBase] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from NodeBase to OuterNode[NodeBase] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBase: OuterNode[NodeBase]).isDefined
    Definition Classes
    Param
  2. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from NodeBase to OuterNode[NodeBase] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBase: OuterNode[NodeBase]).isEdge
    Definition Classes
    Param
  3. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from NodeBase to OuterNode[NodeBase] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBase: OuterNode[NodeBase]).isIn
    Definition Classes
    InParam → Param
  4. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from NodeBase to OuterNode[NodeBase] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBase: OuterNode[NodeBase]).isNode
    Definition Classes
    NodeParam
  5. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from NodeBase to OuterNode[NodeBase] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBase: OuterNode[NodeBase]).isOut
    Definition Classes
    Param
  6. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from NodeBase to OuterNode[NodeBase] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBase: OuterNode[NodeBase]).stringPrefix
    Definition Classes
    NodeParam
  7. def toString(): String
    Implicit
    This member is added by an implicit conversion from NodeBase to OuterNode[NodeBase] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBase: OuterNode[NodeBase]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  8. val value: NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to OuterNode[NodeBase] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBase: OuterNode[NodeBase]).value
    Definition Classes
    OuterNode → NodeParam
  9. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from NodeBase to EdgeAssoc[NodeBase] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBase: EdgeAssoc[NodeBase]).~(n2)
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  10. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from NodeBase to EdgeAssoc[NodeBase] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBase: EdgeAssoc[NodeBase]).~>(n2)
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Inherited from DefaultGraphImpl.InnerNodeTraversalImpl

Inherited from DefaultGraphImpl.InnerNodeState

Inherited from DefaultGraphImpl.InnerNodeImpl

Inherited from DefaultGraphImpl.InnerNode

Inherited from DefaultGraphImpl.NodeBase

Inherited from DefaultGraphImpl.InnerNode

Inherited from DefaultGraphImpl.TraverserInnerNode

Inherited from DefaultGraphImpl.NodeBase

Inherited from DefaultGraphImpl.InnerNode

Inherited from DefaultGraphImpl.InnerElem

Inherited from DefaultGraphImpl.Node

Inherited from Serializable

Inherited from Serializable

Inherited from InnerNodeParam[N]

Inherited from NodeParam[N]

Inherited from OutParam[N, Nothing]

Inherited from Param[N, Nothing]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from NodeBase to OuterNode[NodeBase]

Inherited by implicit conversion toDefaultTraverser from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser]

Inherited by implicit conversion EdgeAssoc from NodeBase to EdgeAssoc[NodeBase]

Inherited by implicit conversion CollectionsHaveToParArray from NodeBase to CollectionsHaveToParArray[NodeBase, T]

Inherited by implicit conversion toValue from NodeBase to N

Inherited by implicit conversion any2stringadd from NodeBase to any2stringadd[NodeBase]

Inherited by implicit conversion StringFormat from NodeBase to StringFormat[NodeBase]

Inherited by implicit conversion Ensuring from NodeBase to Ensuring[NodeBase]

Inherited by implicit conversion ArrowAssoc from NodeBase to ArrowAssoc[NodeBase]

Ungrouped