scalax.collection.GraphTraversalImpl

LazyPath

abstract class LazyPath extends Path

Path based on the passed collection of nodes with lazy evaluation of edges.

Attributes
protected
Linear Supertypes
GraphTraversalImpl.Path, Traversable[OutParam[N, E]], GenTraversable[OutParam[N, E]], GenericTraversableTemplate[OutParam[N, E], Traversable], TraversableLike[OutParam[N, E], Traversable[OutParam[N, E]]], GenTraversableLike[OutParam[N, E], Traversable[OutParam[N, E]]], Parallelizable[OutParam[N, E], ParIterable[OutParam[N, E]]], TraversableOnce[OutParam[N, E]], GenTraversableOnce[OutParam[N, E]], FilterMonadic[OutParam[N, E], Traversable[OutParam[N, E]]], HasNewBuilder[OutParam[N, E], Traversable[OutParam[N, E]]], AnyRef, Any
Known Subclasses
AnyEdgeLazyCycle, AnyEdgeLazyPath, MinWeightEdgeLazyPath, MultiEdgeLazyCycle, MultiEdgeLazyPath, SimpleLazyPath
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. LazyPath
  2. Path
  3. Traversable
  4. GenTraversable
  5. GenericTraversableTemplate
  6. TraversableLike
  7. GenTraversableLike
  8. Parallelizable
  9. TraversableOnce
  10. GenTraversableOnce
  11. FilterMonadic
  12. HasNewBuilder
  13. AnyRef
  14. Any
Implicitly
  1. by anyToNode
  2. by traversable2ops
  3. by MonadOps
  4. by EdgeAssoc
  5. by any2stringadd
  6. by any2stringfmt
  7. by any2ArrowAssoc
  8. by any2Ensuring
  9. by alternateImplicit
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LazyPath(nodes: Traversable[NodeT], edgeFilter: (GraphTraversalImpl.EdgeT) ⇒ Boolean)

Type Members

  1. type Self = Traversable[OutParam[N, E]]

    Attributes
    protected
    Definition Classes
    TraversableLike

  2. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def edges: Traversable[GraphTraversalImpl.EdgeT]

    All edges of this path in proper order.

    All edges of this path in proper order.

    Definition Classes
    Path

Concrete 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 +(other: String): String

    Implicit information
    This member is added by an implicit conversion from LazyPath to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd

  5. def ++[B >: OutParam[N, E], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[OutParam[N, E]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  6. def ++:[B >: OutParam[N, E], That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[OutParam[N, E]], B, That]): That

    Definition Classes
    TraversableLike

  7. def ++:[B >: OutParam[N, E], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[OutParam[N, E]], B, That]): That

    Definition Classes
    TraversableLike

  8. def ->[B](y: B): (LazyPath, B)

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

  9. def /:[B](z: B)(op: (B, OutParam[N, E]) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  10. def :\[B](z: B)(op: (OutParam[N, E], B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  13. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

  14. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce

  15. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    TraversableOnce

  16. def aggregate[B](z: B)(seqop: (B, OutParam[N, E]) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  17. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  18. def asParIterable: ParIterable[OutParam[N, E]]

    Implicit information
    This member is added by an implicit conversion from LazyPath to TraversableOps[OutParam[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  19. def asParSeq: ParSeq[OutParam[N, E]]

    Implicit information
    This member is added by an implicit conversion from LazyPath to TraversableOps[OutParam[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  20. def clone(): AnyRef

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

  21. def collect[B, That](pf: PartialFunction[OutParam[N, E], B])(implicit bf: CanBuildFrom[Traversable[OutParam[N, E]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  22. def collectFirst[B](pf: PartialFunction[OutParam[N, E], B]): Option[B]

    Definition Classes
    TraversableOnce

  23. def companion: GenericCompanion[Traversable]

    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate

  24. def copyToArray[B >: OutParam[N, E]](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  25. def copyToArray[B >: OutParam[N, E]](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  26. def copyToArray[B >: OutParam[N, E]](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  27. def copyToBuffer[B >: OutParam[N, E]](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce

  28. def count(p: (OutParam[N, E]) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  29. def drop(n: Int): Traversable[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike

  30. def dropWhile(p: (OutParam[N, E]) ⇒ Boolean): Traversable[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike

  31. def endNode: NodeT

    Definition Classes
    LazyPath → Path

  32. def ensuring(cond: (LazyPath) ⇒ Boolean, msg: ⇒ Any): LazyPath

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

  33. def ensuring(cond: (LazyPath) ⇒ Boolean): LazyPath

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

  34. def ensuring(cond: Boolean, msg: ⇒ Any): LazyPath

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

  35. def ensuring(cond: Boolean): LazyPath

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

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

    Definition Classes
    AnyRef

  37. def equals(other: Any): Boolean

    Definition Classes
    LazyPath → AnyRef → Any

  38. def exists(p: (OutParam[N, E]) ⇒ Boolean): Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  39. def filter(p: (OutParam[N, E]) ⇒ Boolean): Traversable[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike

  40. def filterNot(p: (OutParam[N, E]) ⇒ Boolean): Traversable[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike

  41. def finalize(): Unit

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

  42. def find(p: (OutParam[N, E]) ⇒ Boolean): Option[OutParam[N, E]]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  43. def flatMap[B, That](f: (OutParam[N, E]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[OutParam[N, E]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  44. def flatten[B](implicit asTraversable: (OutParam[N, E]) ⇒ GenTraversableOnce[B]): Traversable[B]

    Definition Classes
    GenericTraversableTemplate

  45. def fold[A1 >: OutParam[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  46. def foldLeft[B](z: B)(op: (B, OutParam[N, E]) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  47. def foldRight[B](z: B)(op: (OutParam[N, E], B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  48. def forall(p: (OutParam[N, E]) ⇒ Boolean): Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  49. def foreach[U](f: (OutParam[N, E]) ⇒ U): Unit

    Definition Classes
    LazyPath → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

  50. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from LazyPath to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

  51. def genericBuilder[B]: Builder[B, Traversable[B]]

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    AnyRef → Any

  53. def groupBy[K](f: (OutParam[N, E]) ⇒ K): Map[K, Traversable[OutParam[N, E]]]

    Definition Classes
    TraversableLike → GenTraversableLike

  54. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  55. def hashCode(): Int

    Definition Classes
    LazyPath → AnyRef → Any

  56. def head: OutParam[N, E]

    Definition Classes
    TraversableLike → GenTraversableLike

  57. def headOption: Option[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike

  58. def ifParSeq[R](isbody: (ParSeq[OutParam[N, E]]) ⇒ R): (TraversableOps[OutParam[N, E]])#Otherwise[R]

    Implicit information
    This member is added by an implicit conversion from LazyPath to TraversableOps[OutParam[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  59. def init: Traversable[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike

  60. def inits: Iterator[Traversable[OutParam[N, E]]]

    Definition Classes
    TraversableLike

  61. def isDefined: Boolean

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

  62. def isEdge: Boolean

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

  63. def isEmpty: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  64. def isIn: Boolean

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

  65. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  66. def isNode: Boolean

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

  67. def isOut: Boolean

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

  68. def isParIterable: Boolean

    Implicit information
    This member is added by an implicit conversion from LazyPath to TraversableOps[OutParam[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  69. def isParSeq: Boolean

    Implicit information
    This member is added by an implicit conversion from LazyPath to TraversableOps[OutParam[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  70. def isParallel: Boolean

    Implicit information
    This member is added by an implicit conversion from LazyPath to TraversableOps[OutParam[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  71. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  72. def isValid: Boolean

    Returns whether the contents of this path are valid with respect to path semantics.

    Returns whether the contents of this path are valid with respect to path semantics. This check is appropriate whenever there may be any doubt about the correctness of the result of an algorithm.

    Definition Classes
    LazyPath → Path

  73. def last: OutParam[N, E]

    Definition Classes
    TraversableLike → GenTraversableLike

  74. def lastOption: Option[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike

  75. def length: Int

    The number of edges on this path.

    The number of edges on this path.

    Definition Classes
    Path

  76. def map[B, That](f: (OutParam[N, E]) ⇒ B)(implicit bf: CanBuildFrom[Traversable[OutParam[N, E]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  77. def max[B >: OutParam[N, E]](implicit cmp: Ordering[B]): OutParam[N, E]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  78. def maxBy[B](f: (OutParam[N, E]) ⇒ B)(implicit cmp: Ordering[B]): OutParam[N, E]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  79. def min[B >: OutParam[N, E]](implicit cmp: Ordering[B]): OutParam[N, E]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  80. def minBy[B](f: (OutParam[N, E]) ⇒ B)(implicit cmp: Ordering[B]): OutParam[N, E]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  81. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  82. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  83. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  84. val n1: LazyPath

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

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

    Definition Classes
    AnyRef

  86. def newBuilder: Builder[OutParam[N, E], Traversable[OutParam[N, E]]]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  87. val nodes: Traversable[NodeT]

    All nodes of this path in proper order.

    All nodes of this path in proper order.

    Definition Classes
    LazyPath → Path

  88. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  89. final def notify(): Unit

    Definition Classes
    AnyRef

  90. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  91. def par: ParIterable[OutParam[N, E]]

    Definition Classes
    Parallelizable

  92. def parCombiner: Combiner[OutParam[N, E], ParIterable[OutParam[N, E]]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

  93. def partition(p: (OutParam[N, E]) ⇒ Boolean): (Traversable[OutParam[N, E]], Traversable[OutParam[N, E]])

    Definition Classes
    TraversableLike → GenTraversableLike

  94. def product[B >: OutParam[N, E]](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  95. def reduce[A1 >: OutParam[N, E]](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  96. def reduceLeft[B >: OutParam[N, E]](op: (B, OutParam[N, E]) ⇒ B): B

    Definition Classes
    TraversableOnce

  97. def reduceLeftOption[B >: OutParam[N, E]](op: (B, OutParam[N, E]) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  98. def reduceOption[A1 >: OutParam[N, E]](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  99. def reduceRight[B >: OutParam[N, E]](op: (OutParam[N, E], B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  100. def reduceRightOption[B >: OutParam[N, E]](op: (OutParam[N, E], B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  101. def repr: Traversable[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike

  102. def reversed: List[OutParam[N, E]]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  103. def scan[B >: OutParam[N, E], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[OutParam[N, E]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  104. def scanLeft[B, That](z: B)(op: (B, OutParam[N, E]) ⇒ B)(implicit bf: CanBuildFrom[Traversable[OutParam[N, E]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  105. def scanRight[B, That](z: B)(op: (OutParam[N, E], B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[OutParam[N, E]], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  106. def seq: Traversable[OutParam[N, E]]

    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  107. def size: Int

    The number of nodes and edges on this path.

    The number of nodes and edges on this path.

    Definition Classes
    Path → GenTraversableLike → TraversableOnce → GenTraversableOnce

  108. def slice(from: Int, until: Int): Traversable[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike

  109. def span(p: (OutParam[N, E]) ⇒ Boolean): (Traversable[OutParam[N, E]], Traversable[OutParam[N, E]])

    Definition Classes
    TraversableLike → GenTraversableLike

  110. def splitAt(n: Int): (Traversable[OutParam[N, E]], Traversable[OutParam[N, E]])

    Definition Classes
    TraversableLike → GenTraversableLike

  111. def startNode: NodeT

    Definition Classes
    LazyPath → Path

  112. def stringPrefix: String

    Definition Classes
    Path → TraversableLike → GenTraversableLike

  113. def sum[B >: OutParam[N, E]](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  115. def tail: Traversable[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike

  116. def tails: Iterator[Traversable[OutParam[N, E]]]

    Definition Classes
    TraversableLike

  117. def take(n: Int): Traversable[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike

  118. def takeWhile(p: (OutParam[N, E]) ⇒ Boolean): Traversable[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableLike

  119. def thisCollection: Traversable[OutParam[N, E]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  120. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, OutParam[N, E], Col[OutParam[N, E]]]): Col[OutParam[N, E]]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  121. def toArray[B >: OutParam[N, E]](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  122. def toBuffer[B >: OutParam[N, E]]: Buffer[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  123. def toCollection(repr: Traversable[OutParam[N, E]]): Traversable[OutParam[N, E]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  124. def toIndexedSeq: IndexedSeq[OutParam[N, E]]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  125. def toIterable: Iterable[OutParam[N, E]]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  126. def toIterator: Iterator[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableOnce

  127. def toList: List[OutParam[N, E]]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  128. def toMap[T, U](implicit ev: <:<[OutParam[N, E], (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  129. def toParArray: ParArray[OutParam[N, E]]

    Implicit information
    This member is added by an implicit conversion from LazyPath to TraversableOps[OutParam[N, E]] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  130. def toSeq: Seq[OutParam[N, E]]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  131. def toSet[B >: OutParam[N, E]]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  132. def toStream: Stream[OutParam[N, E]]

    Definition Classes
    TraversableLike → GenTraversableOnce

  133. def toString(): String

    Definition Classes
    TraversableLike → Any

  134. def toTraversable: Traversable[OutParam[N, E]]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  135. def toVector: Vector[OutParam[N, E]]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  136. def transpose[B](implicit asTraversable: (OutParam[N, E]) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  137. def unzip[A1, A2](implicit asPair: (OutParam[N, E]) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

    Definition Classes
    GenericTraversableTemplate

  138. def unzip3[A1, A2, A3](implicit asTriple: (OutParam[N, E]) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

    Definition Classes
    GenericTraversableTemplate

  139. val value: LazyPath

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

  140. def view(from: Int, until: Int): TraversableView[OutParam[N, E], Traversable[OutParam[N, E]]]

    Definition Classes
    TraversableLike

  141. def view: TraversableView[OutParam[N, E], Traversable[OutParam[N, E]]]

    Definition Classes
    TraversableLike

  142. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  145. def weight: Long

    The cumulated weight of all edges on this path.

    The cumulated weight of all edges on this path.

    Definition Classes
    Path

  146. def withFilter(p: (OutParam[N, E]) ⇒ Boolean): FilterMonadic[OutParam[N, E], Traversable[OutParam[N, E]]]

    Definition Classes
    TraversableLike → FilterMonadic

  147. def ~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]

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

  148. def ~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]

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

  149. def →[B](y: B): (LazyPath, B)

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

Shadowed Implicit Value Members

  1. def filter(p: (OutParam[N, E]) ⇒ Boolean): TraversableOnce[OutParam[N, E]]

    Implicit information
    This member is added by an implicit conversion from LazyPath to MonadOps[OutParam[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    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:
    (lazyPath: MonadOps[OutParam[N, E]]).filter(p)
    Definition Classes
    MonadOps

  2. def flatMap[B](f: (OutParam[N, E]) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from LazyPath to MonadOps[OutParam[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    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:
    (lazyPath: MonadOps[OutParam[N, E]]).flatMap(f)
    Definition Classes
    MonadOps

  3. def map[B](f: (OutParam[N, E]) ⇒ B): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from LazyPath to MonadOps[OutParam[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    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:
    (lazyPath: MonadOps[OutParam[N, E]]).map(f)
    Definition Classes
    MonadOps

  4. val self: Any

    Implicit information
    This member is added by an implicit conversion from LazyPath to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (lazyPath: StringAdd).self
    Definition Classes
    StringAdd

  5. val self: Any

    Implicit information
    This member is added by an implicit conversion from LazyPath to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (lazyPath: StringFormat).self
    Definition Classes
    StringFormat

  6. def stringPrefix: String

    Implicit information
    This member is added by an implicit conversion from LazyPath to OuterNode[LazyPath] 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:
    (lazyPath: OuterNode[LazyPath]).stringPrefix
    Definition Classes
    NodeParam

  7. def toString(): String

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

  8. def withFilter(p: (OutParam[N, E]) ⇒ Boolean): Iterator[OutParam[N, E]]

    Implicit information
    This member is added by an implicit conversion from LazyPath to MonadOps[OutParam[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    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:
    (lazyPath: MonadOps[OutParam[N, E]]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def /:\[A1 >: OutParam[N, E]](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

  2. def x: LazyPath

    Implicit information
    This member is added by an implicit conversion from LazyPath to ArrowAssoc[LazyPath] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (lazyPath: ArrowAssoc[LazyPath]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  3. def x: LazyPath

    Implicit information
    This member is added by an implicit conversion from LazyPath to Ensuring[LazyPath] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (lazyPath: Ensuring[LazyPath]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from GraphTraversalImpl.Path

Inherited from Traversable[OutParam[N, E]]

Inherited from GenTraversable[OutParam[N, E]]

Inherited from GenericTraversableTemplate[OutParam[N, E], Traversable]

Inherited from TraversableLike[OutParam[N, E], Traversable[OutParam[N, E]]]

Inherited from GenTraversableLike[OutParam[N, E], Traversable[OutParam[N, E]]]

Inherited from Parallelizable[OutParam[N, E], ParIterable[OutParam[N, E]]]

Inherited from TraversableOnce[OutParam[N, E]]

Inherited from GenTraversableOnce[OutParam[N, E]]

Inherited from FilterMonadic[OutParam[N, E], Traversable[OutParam[N, E]]]

Inherited from HasNewBuilder[OutParam[N, E], Traversable[OutParam[N, E]]]

Inherited from AnyRef

Inherited from Any

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

Inherited by implicit conversion traversable2ops from LazyPath to TraversableOps[OutParam[N, E]]

Inherited by implicit conversion MonadOps from LazyPath to MonadOps[OutParam[N, E]]

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

Inherited by implicit conversion any2stringadd from LazyPath to StringAdd

Inherited by implicit conversion any2stringfmt from LazyPath to StringFormat

Inherited by implicit conversion any2ArrowAssoc from LazyPath to ArrowAssoc[LazyPath]

Inherited by implicit conversion any2Ensuring from LazyPath to Ensuring[LazyPath]

Inherited by implicit conversion alternateImplicit from LazyPath to ForceImplicitAmbiguity

Ungrouped