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, GraphTraversalImpl.Walk, Traversable[GraphTraversalImpl.InnerElem], GenTraversable[GraphTraversalImpl.InnerElem], GenericTraversableTemplate[GraphTraversalImpl.InnerElem, Traversable], TraversableLike[GraphTraversalImpl.InnerElem, Traversable[GraphTraversalImpl.InnerElem]], GenTraversableLike[GraphTraversalImpl.InnerElem, Traversable[GraphTraversalImpl.InnerElem]], Parallelizable[GraphTraversalImpl.InnerElem, ParIterable[GraphTraversalImpl.InnerElem]], TraversableOnce[GraphTraversalImpl.InnerElem], GenTraversableOnce[GraphTraversalImpl.InnerElem], FilterMonadic[GraphTraversalImpl.InnerElem, Traversable[GraphTraversalImpl.InnerElem]], HasNewBuilder[GraphTraversalImpl.InnerElem, Traversable[GraphTraversalImpl.InnerElem]], 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. Walk
  4. Traversable
  5. GenTraversable
  6. GenericTraversableTemplate
  7. TraversableLike
  8. GenTraversableLike
  9. Parallelizable
  10. TraversableOnce
  11. GenTraversableOnce
  12. FilterMonadic
  13. HasNewBuilder
  14. AnyRef
  15. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by EdgeAssoc
  5. by any2stringadd
  6. by StringFormat
  7. by Ensuring
  8. by ArrowAssoc
  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])

Type Members

  1. trait NodeValidator extends AnyRef

    Attributes
    protected
    Definition Classes
    Walk

  2. type Self = Traversable[GraphTraversalImpl.InnerElem]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  3. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Abstract Value Members

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

    All edges of this path/walk in proper order.

    All edges of this path/walk in proper order.

    Definition Classes
    Walk

Concrete 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 information
    This member is added by an implicit conversion from LazyPath to any2stringadd[LazyPath] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd

  4. def ++[B >: GraphTraversalImpl.InnerElem, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphTraversalImpl.InnerElem], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  5. def ++:[B >: GraphTraversalImpl.InnerElem, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[GraphTraversalImpl.InnerElem], B, That]): That

    Definition Classes
    TraversableLike

  6. def ++:[B >: GraphTraversalImpl.InnerElem, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphTraversalImpl.InnerElem], B, That]): That

    Definition Classes
    TraversableLike

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

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

  8. def /:[B](z: B)(op: (B, GraphTraversalImpl.InnerElem) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  9. def :\[B](z: B)(op: (GraphTraversalImpl.InnerElem, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef → Any

  11. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

  14. def aggregate[B](z: ⇒ B)(seqop: (B, GraphTraversalImpl.InnerElem) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  15. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  16. def clone(): AnyRef

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

  17. def collect[B, That](pf: PartialFunction[GraphTraversalImpl.InnerElem, B])(implicit bf: CanBuildFrom[Traversable[GraphTraversalImpl.InnerElem], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  18. def collectFirst[B](pf: PartialFunction[GraphTraversalImpl.InnerElem, B]): Option[B]

    Definition Classes
    TraversableOnce

  19. def companion: GenericCompanion[Traversable]

    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate

  20. def copyToArray[B >: GraphTraversalImpl.InnerElem](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  21. def copyToArray[B >: GraphTraversalImpl.InnerElem](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  22. def copyToArray[B >: GraphTraversalImpl.InnerElem](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  23. def copyToBuffer[B >: GraphTraversalImpl.InnerElem](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce

  24. def count(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  25. def drop(n: Int): Traversable[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableLike

  26. def dropWhile(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): Traversable[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableLike

  27. def endNode: NodeT

    Definition Classes
    LazyPath → Walk

  28. 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 Ensuring in scala.Predef.
    Definition Classes
    Ensuring

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

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

  30. 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 Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  31. def ensuring(cond: Boolean): LazyPath

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

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

    Definition Classes
    AnyRef

  33. def equals(other: Any): Boolean

    Definition Classes
    LazyPath → AnyRef → Any

  34. def exists(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  35. def filter(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): Traversable[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableLike

  36. def filterNot(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): Traversable[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableLike

  37. def finalize(): Unit

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

  38. def find(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): Option[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  39. def flatMap[B, That](f: (GraphTraversalImpl.InnerElem) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphTraversalImpl.InnerElem], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  40. def flatten[B](implicit asTraversable: (GraphTraversalImpl.InnerElem) ⇒ GenTraversableOnce[B]): Traversable[B]

    Definition Classes
    GenericTraversableTemplate

  41. def fold[A1 >: GraphTraversalImpl.InnerElem](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  42. def foldLeft[B](z: B)(op: (B, GraphTraversalImpl.InnerElem) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  43. def foldRight[B](z: B)(op: (GraphTraversalImpl.InnerElem, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  44. def forall(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  45. def foreach[U](f: (GraphTraversalImpl.InnerElem) ⇒ U): Unit

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

  46. def formatted(fmtstr: String): String

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

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    AnyRef → Any

  49. def groupBy[K](f: (GraphTraversalImpl.InnerElem) ⇒ K): Map[K, Traversable[GraphTraversalImpl.InnerElem]]

    Definition Classes
    TraversableLike → GenTraversableLike

  50. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  51. def hashCode(): Int

    Definition Classes
    LazyPath → AnyRef → Any

  52. def head: GraphTraversalImpl.InnerElem

    Definition Classes
    TraversableLike → GenTraversableLike

  53. def headOption: Option[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableLike

  54. def init: Traversable[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableLike

  55. def inits: Iterator[Traversable[GraphTraversalImpl.InnerElem]]

    Definition Classes
    TraversableLike

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

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

  58. def isEmpty: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

  60. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

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

  63. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  64. def isValid: Boolean

    Returns whether the nodes and edges on this path are valid with respect to this graph.

    Returns whether the nodes and edges on this path are valid with respect to this graph. This optional check is sane if there is reasonable doubt about the correctness of some algorithm results.

    Definition Classes
    Path → Walk

  65. def last: GraphTraversalImpl.InnerElem

    Definition Classes
    TraversableLike → GenTraversableLike

  66. def lastOption: Option[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableLike

  67. def length: Int

    The number of edges on this path/walk.

    The number of edges on this path/walk.

    Definition Classes
    Walk

  68. def map[B, That](f: (GraphTraversalImpl.InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphTraversalImpl.InnerElem], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  69. def max[B >: GraphTraversalImpl.InnerElem](implicit cmp: Ordering[B]): GraphTraversalImpl.InnerElem

    Definition Classes
    TraversableOnce → GenTraversableOnce

  70. def maxBy[B](f: (GraphTraversalImpl.InnerElem) ⇒ B)(implicit cmp: Ordering[B]): GraphTraversalImpl.InnerElem

    Definition Classes
    TraversableOnce → GenTraversableOnce

  71. def min[B >: GraphTraversalImpl.InnerElem](implicit cmp: Ordering[B]): GraphTraversalImpl.InnerElem

    Definition Classes
    TraversableOnce → GenTraversableOnce

  72. def minBy[B](f: (GraphTraversalImpl.InnerElem) ⇒ B)(implicit cmp: Ordering[B]): GraphTraversalImpl.InnerElem

    Definition Classes
    TraversableOnce → GenTraversableOnce

  73. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  74. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

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

    Definition Classes
    AnyRef

  78. def newBuilder: Builder[GraphTraversalImpl.InnerElem, Traversable[GraphTraversalImpl.InnerElem]]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  79. def nodeValidator: NodeValidator

    Attributes
    protected
    Definition Classes
    Path → Walk

  80. val nodes: Traversable[NodeT]

    All nodes on this path/walk in proper order.

    All nodes on this path/walk in proper order.

    Definition Classes
    LazyPath → Walk

  81. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  82. final def notify(): Unit

    Definition Classes
    AnyRef

  83. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  84. def par: ParIterable[GraphTraversalImpl.InnerElem]

    Definition Classes
    Parallelizable

  85. def parCombiner: Combiner[GraphTraversalImpl.InnerElem, ParIterable[GraphTraversalImpl.InnerElem]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

  86. def partition(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): (Traversable[GraphTraversalImpl.InnerElem], Traversable[GraphTraversalImpl.InnerElem])

    Definition Classes
    TraversableLike → GenTraversableLike

  87. def product[B >: GraphTraversalImpl.InnerElem](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  88. def reduce[A1 >: GraphTraversalImpl.InnerElem](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  89. def reduceLeft[B >: GraphTraversalImpl.InnerElem](op: (B, GraphTraversalImpl.InnerElem) ⇒ B): B

    Definition Classes
    TraversableOnce

  90. def reduceLeftOption[B >: GraphTraversalImpl.InnerElem](op: (B, GraphTraversalImpl.InnerElem) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  91. def reduceOption[A1 >: GraphTraversalImpl.InnerElem](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  92. def reduceRight[B >: GraphTraversalImpl.InnerElem](op: (GraphTraversalImpl.InnerElem, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  93. def reduceRightOption[B >: GraphTraversalImpl.InnerElem](op: (GraphTraversalImpl.InnerElem, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  94. def repr: Traversable[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableLike

  95. def reversed: List[GraphTraversalImpl.InnerElem]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  96. def scan[B >: GraphTraversalImpl.InnerElem, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[GraphTraversalImpl.InnerElem], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  97. def scanLeft[B, That](z: B)(op: (B, GraphTraversalImpl.InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphTraversalImpl.InnerElem], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  98. def scanRight[B, That](z: B)(op: (GraphTraversalImpl.InnerElem, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphTraversalImpl.InnerElem], 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.

  99. def seq: Traversable[GraphTraversalImpl.InnerElem]

    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  100. def size: Int

    The number of nodes and edges on this path/walk.

    The number of nodes and edges on this path/walk.

    Definition Classes
    Walk → GenTraversableLike → TraversableOnce → GenTraversableOnce

  101. def slice(from: Int, until: Int): Traversable[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableLike

  102. def span(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): (Traversable[GraphTraversalImpl.InnerElem], Traversable[GraphTraversalImpl.InnerElem])

    Definition Classes
    TraversableLike → GenTraversableLike

  103. def splitAt(n: Int): (Traversable[GraphTraversalImpl.InnerElem], Traversable[GraphTraversalImpl.InnerElem])

    Definition Classes
    TraversableLike → GenTraversableLike

  104. def startNode: NodeT

    Definition Classes
    LazyPath → Walk

  105. def stringPrefix: String

    Definition Classes
    Path → Walk → TraversableLike → GenTraversableLike

  106. def sum[B >: GraphTraversalImpl.InnerElem](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  108. def tail: Traversable[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableLike

  109. def tails: Iterator[Traversable[GraphTraversalImpl.InnerElem]]

    Definition Classes
    TraversableLike

  110. def take(n: Int): Traversable[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableLike

  111. def takeWhile(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): Traversable[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableLike

  112. def thisCollection: Traversable[GraphTraversalImpl.InnerElem]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  113. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, GraphTraversalImpl.InnerElem, Col[GraphTraversalImpl.InnerElem]]): Col[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  114. def toArray[B >: GraphTraversalImpl.InnerElem](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  115. def toBuffer[B >: GraphTraversalImpl.InnerElem]: Buffer[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  116. def toCollection(repr: Traversable[GraphTraversalImpl.InnerElem]): Traversable[GraphTraversalImpl.InnerElem]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  117. def toIndexedSeq: IndexedSeq[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  118. def toIterable: Iterable[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  119. def toIterator: Iterator[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableOnce

  120. def toList: List[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  121. def toMap[T, U](implicit ev: <:<[GraphTraversalImpl.InnerElem, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  122. def toParArray: ParArray[T]

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

  123. def toSeq: Seq[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  124. def toSet[B >: GraphTraversalImpl.InnerElem]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  125. def toStream: Stream[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → GenTraversableOnce

  126. def toString(): String

    Definition Classes
    TraversableLike → Any

  127. def toTraversable: Traversable[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  128. def toVector: Vector[GraphTraversalImpl.InnerElem]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  129. def transpose[B](implicit asTraversable: (GraphTraversalImpl.InnerElem) ⇒ 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.

  130. def unzip[A1, A2](implicit asPair: (GraphTraversalImpl.InnerElem) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

    Definition Classes
    GenericTraversableTemplate

  131. def unzip3[A1, A2, A3](implicit asTriple: (GraphTraversalImpl.InnerElem) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

    Definition Classes
    GenericTraversableTemplate

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

  133. def view(from: Int, until: Int): TraversableView[GraphTraversalImpl.InnerElem, Traversable[GraphTraversalImpl.InnerElem]]

    Definition Classes
    TraversableLike

  134. def view: TraversableView[GraphTraversalImpl.InnerElem, Traversable[GraphTraversalImpl.InnerElem]]

    Definition Classes
    TraversableLike

  135. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  138. final def weight[T](f: (GraphTraversalImpl.EdgeT) ⇒ T)(implicit arg0: Numeric[T]): T

    The cumulated weight of all edges on this path/walk.

    The cumulated weight of all edges on this path/walk.

    f

    The weight function overriding edge weights.

    Definition Classes
    Walk

  139. final def weight: Long

    The cumulated weight of all edges on this path/walk.

    The cumulated weight of all edges on this path/walk.

    Definition Classes
    Walk

  140. def withFilter(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): FilterMonadic[GraphTraversalImpl.InnerElem, Traversable[GraphTraversalImpl.InnerElem]]

    Definition Classes
    TraversableLike → FilterMonadic

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

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

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

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

Shadowed Implicit Value Members

  1. def filter(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): TraversableOnce[GraphTraversalImpl.InnerElem]

    Implicit information
    This member is added by an implicit conversion from LazyPath to MonadOps[GraphTraversalImpl.InnerElem] 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[GraphTraversalImpl.InnerElem]).filter(p)
    Definition Classes
    MonadOps

  2. def flatMap[B](f: (GraphTraversalImpl.InnerElem) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from LazyPath to MonadOps[GraphTraversalImpl.InnerElem] 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[GraphTraversalImpl.InnerElem]).flatMap(f)
    Definition Classes
    MonadOps

  3. def map[B](f: (GraphTraversalImpl.InnerElem) ⇒ B): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from LazyPath to MonadOps[GraphTraversalImpl.InnerElem] 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[GraphTraversalImpl.InnerElem]).map(f)
    Definition Classes
    MonadOps

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

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

  6. def withFilter(p: (GraphTraversalImpl.InnerElem) ⇒ Boolean): Iterator[GraphTraversalImpl.InnerElem]

    Implicit information
    This member is added by an implicit conversion from LazyPath to MonadOps[GraphTraversalImpl.InnerElem] 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[GraphTraversalImpl.InnerElem]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from GraphTraversalImpl.Path

Inherited from GraphTraversalImpl.Walk

Inherited from Traversable[GraphTraversalImpl.InnerElem]

Inherited from GenTraversable[GraphTraversalImpl.InnerElem]

Inherited from GenericTraversableTemplate[GraphTraversalImpl.InnerElem, Traversable]

Inherited from TraversableLike[GraphTraversalImpl.InnerElem, Traversable[GraphTraversalImpl.InnerElem]]

Inherited from GenTraversableLike[GraphTraversalImpl.InnerElem, Traversable[GraphTraversalImpl.InnerElem]]

Inherited from Parallelizable[GraphTraversalImpl.InnerElem, ParIterable[GraphTraversalImpl.InnerElem]]

Inherited from TraversableOnce[GraphTraversalImpl.InnerElem]

Inherited from GenTraversableOnce[GraphTraversalImpl.InnerElem]

Inherited from FilterMonadic[GraphTraversalImpl.InnerElem, Traversable[GraphTraversalImpl.InnerElem]]

Inherited from HasNewBuilder[GraphTraversalImpl.InnerElem, Traversable[GraphTraversalImpl.InnerElem]]

Inherited from AnyRef

Inherited from Any

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

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

Inherited by implicit conversion MonadOps from LazyPath to MonadOps[GraphTraversalImpl.InnerElem]

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

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

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

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

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

Inherited by implicit conversion alternateImplicit from LazyPath to ForceImplicitAmbiguity

Ungrouped