Class

scalax.collection.TraverserImpl.Impl

Runner

Related Docs: object Runner | package Impl

Permalink

class Runner[U] extends AnyRef

Contains algorithms and local values to be used by the algorithms. Last target reusability and best possible run-time performance.

Attributes
protected
Linear Supertypes
AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Runner
  2. AnyRef
  3. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by EdgeAssoc
  4. by any2stringadd
  5. by StringFormat
  6. by Ensuring
  7. by ArrowAssoc
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Runner(stopAt: GraphTraversalImpl.NodeFilter, visitor: (A) ⇒ U)

    Permalink

    stopAt

    node predicate marking an end condition for the search

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to any2stringadd[This.Runner[U]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd

  4. def ->[B](y: B): (This.Runner[U], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to ArrowAssoc[This.Runner[U]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    AnyRef → Any

  6. final def apply(): Option[NodeT]

    Permalink
    Attributes
    protected[scalax.collection.TraverserImpl.Impl]
    Annotations
    @inline()

  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  8. final def bfs(maybeHandle: Option[Handle] = None): Option[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]

  9. def clone(): AnyRef

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

  10. final def dfs[U](maybeHandle: Option[Handle] = None): Option[NodeT]

    Permalink
    Attributes
    protected[scalax.collection]
    Annotations
    @inline()

  11. final def dfsStack[U](nodeUpVisitor: (NodeT) ⇒ U = empty, maybeHandle: Option[Handle] = None): (Option[NodeT], ArrayStack[(NodeT, Int)])

    Permalink

    returns

    (node stopped at, stack of ...)

    Attributes
    protected[scalax.collection]

  12. final def dfsWGB(globalState: Array[Handle] = Array.empty[Handle]): (Option[NodeT], ArrayStack[CycleStackElem])

    Permalink

    Tail-recursive white-gray-black DFS implementation for cycle detection.

    Tail-recursive white-gray-black DFS implementation for cycle detection.

    Attributes
    protected[scalax.collection]

  13. final val doNodeVisitor: Boolean

    Permalink
    Attributes
    protected[this]

  14. final val edgeVisitor: (GraphTraversalImpl.EdgeT) ⇒ U

    Permalink
    Attributes
    protected[this]

  15. def ensuring(cond: (This.Runner[U]) ⇒ Boolean, msg: ⇒ Any): This.Runner[U]

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to Ensuring[This.Runner[U]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  16. def ensuring(cond: (This.Runner[U]) ⇒ Boolean): This.Runner[U]

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to Ensuring[This.Runner[U]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  17. def ensuring(cond: Boolean, msg: ⇒ Any): This.Runner[U]

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to Ensuring[This.Runner[U]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  18. def ensuring(cond: Boolean): This.Runner[U]

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to Ensuring[This.Runner[U]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

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

    Permalink
    Definition Classes
    AnyRef

  20. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  21. final val extNodeVisitor: GraphTraversalImpl.ExtendedNodeVisitor[U]

    Permalink
    Attributes
    protected[this]

  22. final val filteredNodes: (NodeT, GraphTraversalImpl.NodeFilter, (GraphTraversalImpl.EdgeT) ⇒ Any, Boolean) ⇒ Traversable[NodeT]

    Permalink
    Attributes
    protected[this]

  23. def finalize(): Unit

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

  24. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to StringFormat[This.Runner[U]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    AnyRef → Any

  26. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  27. def isDefined: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param

  28. def isEdge: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  29. def isIn: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param

  30. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  31. def isNode: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  32. def isOut: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param

  33. def maxDepth: Int

    Permalink

  34. val n1: This.Runner[U]

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to EdgeAssoc[This.Runner[U]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc

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

    Permalink
    Definition Classes
    AnyRef

  36. final val nodeVisitor: (NodeT) ⇒ U

    Permalink
    Attributes
    protected[this]

  37. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  38. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  39. final def shortestPathTo[T](potentialSuccessor: NodeT, weight: (GraphTraversalImpl.EdgeT) ⇒ T)(implicit arg0: Numeric[T]): Option[GraphTraversalImpl.Path]

    Permalink
    Attributes
    protected[scalax.collection]

  40. def stringPrefix: String

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

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

    Permalink
    Definition Classes
    AnyRef

  42. def toParArray: ParArray[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to CollectionsHaveToParArray[This.Runner[U], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (This.Runner[U]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray

  43. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  44. final def topologicalSort(layer_0: Traversable[NodeT], inDegrees: Map[NodeT, Int], maybeHandle: Option[Handle] = None): GraphTraversalImpl.CycleNodeOrTopologicalOrder

    Permalink
    Attributes
    protected[scalax.collection]

  45. val value: This.Runner[U]

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam

  46. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  49. def ~[N >: N1](n2: N): UnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to EdgeAssoc[This.Runner[U]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  50. def ~>[N >: N1](n2: N): DiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to EdgeAssoc[This.Runner[U]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  51. def →[B](y: B): (This.Runner[U], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to ArrowAssoc[This.Runner[U]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def toString(): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from This.Runner[U] to OuterNode[This.Runner[U]] 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:
    (runner: OuterNode[This.Runner[U]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from This.Runner[U] to OuterNode[This.Runner[U]]

Inherited by implicit conversion CollectionsHaveToParArray from This.Runner[U] to CollectionsHaveToParArray[This.Runner[U], T]

Inherited by implicit conversion EdgeAssoc from This.Runner[U] to EdgeAssoc[This.Runner[U]]

Inherited by implicit conversion any2stringadd from This.Runner[U] to any2stringadd[This.Runner[U]]

Inherited by implicit conversion StringFormat from This.Runner[U] to StringFormat[This.Runner[U]]

Inherited by implicit conversion Ensuring from This.Runner[U] to Ensuring[This.Runner[U]]

Inherited by implicit conversion ArrowAssoc from This.Runner[U] to ArrowAssoc[This.Runner[U]]

Ungrouped