Packages

class MultiEdgeLazyPath extends (GraphTraversalImpl.this)#LazyPath

LazyPath with edge selection such that there exists no duplicate edge in the path.

Attributes
protected
Linear Supertypes
(GraphTraversalImpl.this)#LazyPath, (GraphTraversalImpl.this)#Path, (GraphTraversalImpl.this)#Walk, Iterable[(GraphTraversalImpl.this)#InnerElem], IterableLike[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]], Equals, GenIterable[(GraphTraversalImpl.this)#InnerElem], GenIterableLike[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]], Traversable[(GraphTraversalImpl.this)#InnerElem], GenTraversable[(GraphTraversalImpl.this)#InnerElem], GenericTraversableTemplate[(GraphTraversalImpl.this)#InnerElem, Iterable], TraversableLike[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]], GenTraversableLike[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]], Parallelizable[(GraphTraversalImpl.this)#InnerElem, ParIterable[(GraphTraversalImpl.this)#InnerElem]], TraversableOnce[(GraphTraversalImpl.this)#InnerElem], GenTraversableOnce[(GraphTraversalImpl.this)#InnerElem], FilterMonadic[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]], HasNewBuilder[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]], AnyRef, Any
Known Subclasses
MultiEdgeLazyCycle
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MultiEdgeLazyPath
  2. LazyPath
  3. Path
  4. Walk
  5. Iterable
  6. IterableLike
  7. Equals
  8. GenIterable
  9. GenIterableLike
  10. Traversable
  11. GenTraversable
  12. GenericTraversableTemplate
  13. TraversableLike
  14. GenTraversableLike
  15. Parallelizable
  16. TraversableOnce
  17. GenTraversableOnce
  18. FilterMonadic
  19. HasNewBuilder
  20. AnyRef
  21. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by ChainingOps
  5. by EdgeAssoc
  6. by TraversableEnrichments
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  11. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MultiEdgeLazyPath(nodes: (GraphTraversalImpl.this)#ReverseStackTraversable[CycleStackElem], edgeFilter: (GraphTraversalImpl.this)#EdgeFilter)

Type Members

  1. trait NodeValidator extends (NodeT) ⇒ Boolean
    Attributes
    protected
    Definition Classes
    Walk
  2. type Self = Iterable[(GraphTraversalImpl.this)#InnerElem]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

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 (GraphTraversalImpl.this)#MultiEdgeLazyPath to any2stringadd[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B >: (GraphTraversalImpl.this)#InnerElem, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: (GraphTraversalImpl.this)#InnerElem, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: (GraphTraversalImpl.this)#InnerElem, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): ((GraphTraversalImpl.this)#MultiEdgeLazyPath, B)
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to ArrowAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  10. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  11. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  12. def aggregate[B](z: ⇒ B)(seqop: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  13. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  14. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  15. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  16. def collect[B, That](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B])(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  17. def collectFirst[B](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B]): Option[B]
    Definition Classes
    TraversableOnce
  18. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  19. final def containingGraph: GraphTraversalImpl.this

    The Graph instance that contains this walk.

    The Graph instance that contains this walk.

    Definition Classes
    Walk
  20. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  21. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. def copyToBuffer[B >: (GraphTraversalImpl.this)#InnerElem](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  24. def count(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def drop(n: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  26. def dropRight(n: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableLike
  27. def dropWhile(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  28. final lazy val edges: ArrayBuffer[(GraphTraversalImpl.this)#EdgeT]

    All edges of this path/walk in proper order.

    All edges of this path/walk in proper order.

    Definition Classes
    MultiEdgeLazyPath → Walk
  29. def endNode: (GraphTraversalImpl.this)#NodeT
    Definition Classes
    LazyPath → Walk
  30. def ensuring(cond: ((GraphTraversalImpl.this)#MultiEdgeLazyPath) ⇒ Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#MultiEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to Ensuring[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  31. def ensuring(cond: ((GraphTraversalImpl.this)#MultiEdgeLazyPath) ⇒ Boolean): (GraphTraversalImpl.this)#MultiEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to Ensuring[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  32. def ensuring(cond: Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#MultiEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to Ensuring[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  33. def ensuring(cond: Boolean): (GraphTraversalImpl.this)#MultiEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to Ensuring[(GraphTraversalImpl.this)#MultiEdgeLazyPath] 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
    LazyPath → Equals → AnyRef → Any
  36. def exists(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  37. def filter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  38. def filterNot(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  39. def find(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  40. def flatMap[B, That](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  41. def flatten[B](implicit asTraversable: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  42. def fold[A1 >: (GraphTraversalImpl.this)#InnerElem](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def foldLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def foldRight[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  45. def forall(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  46. def foreach[U](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  47. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to StringFormat[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  48. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  49. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  50. def groupBy[K](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ K): Map[K, Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike → GenTraversableLike
  51. def grouped(size: Int): Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    IterableLike
  52. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  53. def hashCode(): Int
    Definition Classes
    LazyPath → AnyRef → Any
  54. def head: (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  55. def headOption: Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  56. def init: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  57. def inits: Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  58. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  59. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  60. def isEmpty: Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  62. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  63. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  64. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  65. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  66. 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
  67. def iterator: Iterator[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    Walk → IterableLike → GenIterableLike
  68. def last: (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def lastOption: Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  70. def length: Int

    The number of edges on this path/walk.

    The number of edges on this path/walk.

    Definition Classes
    Walk
  71. def map[B, That](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  72. def max[B >: (GraphTraversalImpl.this)#InnerElem](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def maxBy[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def min[B >: (GraphTraversalImpl.this)#InnerElem](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. def minBy[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  76. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. final val multi: EqHashSet[(GraphTraversalImpl.this)#EdgeT]
    Attributes
    protected
  80. val n1: (GraphTraversalImpl.this)#MultiEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to EdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  81. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  82. def newBuilder: Builder[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  83. def nodeValidator: NodeValidator
    Attributes
    protected
    Definition Classes
    Path → Walk
  84. val nodes: (GraphTraversalImpl.this)#ReverseStackTraversable[CycleStackElem]

    All nodes on this path/walk in proper order.

    All nodes on this path/walk in proper order.

    Definition Classes
    MultiEdgeLazyPath → LazyPath → Walk
  85. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  87. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  88. def par: ParIterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    Parallelizable
  89. def parCombiner: Combiner[(GraphTraversalImpl.this)#InnerElem, ParIterable[(GraphTraversalImpl.this)#InnerElem]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  90. def partition(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): (Iterable[(GraphTraversalImpl.this)#InnerElem], Iterable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    TraversableLike → GenTraversableLike
  91. def pipe[B](f: ((GraphTraversalImpl.this)#MultiEdgeLazyPath) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to ChainingOps[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  92. def product[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def reduce[A1 >: (GraphTraversalImpl.this)#InnerElem](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def reduceLeft[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
    Definition Classes
    TraversableOnce
  95. def reduceLeftOption[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def reduceOption[A1 >: (GraphTraversalImpl.this)#InnerElem](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def reduceRight[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  98. def reduceRightOption[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def repr: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def reversed: List[(GraphTraversalImpl.this)#InnerElem]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  101. def sameElements[B >: (GraphTraversalImpl.this)#InnerElem](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  102. def scan[B >: (GraphTraversalImpl.this)#InnerElem, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  103. def scanLeft[B, That](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  104. def scanRight[B, That](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#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.

  105. val self: (GraphTraversalImpl.this)#MultiEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to ChainingOps[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  106. def seq: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  107. 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
  108. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  109. def slice(from: Int, until: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  110. def sliding(size: Int, step: Int): Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    IterableLike
  111. def sliding(size: Int): Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    IterableLike
  112. def span(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): (Iterable[(GraphTraversalImpl.this)#InnerElem], Iterable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    TraversableLike → GenTraversableLike
  113. def splitAt(n: Int): (Iterable[(GraphTraversalImpl.this)#InnerElem], Iterable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    TraversableLike → GenTraversableLike
  114. def startNode: (GraphTraversalImpl.this)#NodeT
    Definition Classes
    LazyPath → Walk
  115. def stringPrefix: String
    Definition Classes
    Path → Walk → TraversableLike → GenTraversableLike
  116. def sum[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  118. val t: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to TraversableEnrichments[(GraphTraversalImpl.this)#InnerElem, Iterable] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  119. def tail: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  120. def tails: Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  121. def take(n: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  122. def takeRight(n: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableLike
  123. def takeWhile(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  124. def tap[U](f: ((GraphTraversalImpl.this)#MultiEdgeLazyPath) ⇒ U): (GraphTraversalImpl.this)#MultiEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to ChainingOps[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  125. def thisCollection: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  126. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (GraphTraversalImpl.this)#InnerElem, Col[(GraphTraversalImpl.this)#InnerElem]]): Col[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  127. def toArray[B >: (GraphTraversalImpl.this)#InnerElem](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def toBuffer[B >: (GraphTraversalImpl.this)#InnerElem]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. def toCollection(repr: Iterable[(GraphTraversalImpl.this)#InnerElem]): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  130. def toIndexedSeq: IndexedSeq[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def toIterable: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  132. def toIterator: Iterator[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  133. def toList: List[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def toMap[T, U](implicit ev: <:<[(GraphTraversalImpl.this)#InnerElem, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[(GraphTraversalImpl.this)#InnerElem, E]]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to TraversableEnrichments[(GraphTraversalImpl.this)#InnerElem, Iterable] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  136. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to CollectionsHaveToParArray[(GraphTraversalImpl.this)#MultiEdgeLazyPath, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type ((GraphTraversalImpl.this)#MultiEdgeLazyPath) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  137. def toSeq: Seq[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def toSet[B >: (GraphTraversalImpl.this)#InnerElem]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def toStream: Stream[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  140. def toString(): String
    Definition Classes
    TraversableLike → Any
  141. def toTraversable: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  142. def toVector: Vector[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def transpose[B](implicit asTraversable: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  144. def unzip[A1, A2](implicit asPair: ((GraphTraversalImpl.this)#InnerElem) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  145. def unzip3[A1, A2, A3](implicit asTriple: ((GraphTraversalImpl.this)#InnerElem) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  146. val value: (GraphTraversalImpl.this)#MultiEdgeLazyPath
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  147. def view(from: Int, until: Int): IterableView[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    IterableLike → TraversableLike
  148. def view: IterableView[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    IterableLike → TraversableLike
  149. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  150. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  151. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  152. final def weight[T](f: ((GraphTraversalImpl.this)#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
  153. final def weight: Double

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

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

    Definition Classes
    Walk
  154. def withFilter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): FilterMonadic[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike → FilterMonadic
  155. def zip[A1 >: (GraphTraversalImpl.this)#InnerElem, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#InnerElem], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  156. def zipAll[B, A1 >: (GraphTraversalImpl.this)#InnerElem, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#InnerElem], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  157. def zipWithIndex[A1 >: (GraphTraversalImpl.this)#InnerElem, That](implicit bf: CanBuildFrom[Iterable[(GraphTraversalImpl.this)#InnerElem], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  158. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to EdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  159. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to EdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  160. def →[B](y: B): ((GraphTraversalImpl.this)#MultiEdgeLazyPath, B)
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to ArrowAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyPath] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def filter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): TraversableOnce[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to MonadOps[(GraphTraversalImpl.this)#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:
    (multiEdgeLazyPath: MonadOps[(GraphTraversalImpl.this)#InnerElem]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to MonadOps[(GraphTraversalImpl.this)#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:
    (multiEdgeLazyPath: MonadOps[(GraphTraversalImpl.this)#InnerElem]).flatMap(f)
    Definition Classes
    MonadOps
  3. def map[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to MonadOps[(GraphTraversalImpl.this)#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:
    (multiEdgeLazyPath: MonadOps[(GraphTraversalImpl.this)#InnerElem]).map(f)
    Definition Classes
    MonadOps
  4. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyPath] 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:
    (multiEdgeLazyPath: OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyPath]).stringPrefix
    Definition Classes
    NodeParam
  5. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyPath] 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:
    (multiEdgeLazyPath: OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyPath]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  6. def withFilter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Iterator[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyPath to MonadOps[(GraphTraversalImpl.this)#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:
    (multiEdgeLazyPath: MonadOps[(GraphTraversalImpl.this)#InnerElem]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

  3. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from (GraphTraversalImpl.this)#LazyPath

Inherited from (GraphTraversalImpl.this)#Path

Inherited from (GraphTraversalImpl.this)#Walk

Inherited from Iterable[(GraphTraversalImpl.this)#InnerElem]

Inherited from IterableLike[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]]

Inherited from Equals

Inherited from GenIterable[(GraphTraversalImpl.this)#InnerElem]

Inherited from GenIterableLike[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]]

Inherited from Traversable[(GraphTraversalImpl.this)#InnerElem]

Inherited from GenTraversable[(GraphTraversalImpl.this)#InnerElem]

Inherited from GenericTraversableTemplate[(GraphTraversalImpl.this)#InnerElem, Iterable]

Inherited from TraversableLike[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]]

Inherited from GenTraversableLike[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]]

Inherited from Parallelizable[(GraphTraversalImpl.this)#InnerElem, ParIterable[(GraphTraversalImpl.this)#InnerElem]]

Inherited from TraversableOnce[(GraphTraversalImpl.this)#InnerElem]

Inherited from GenTraversableOnce[(GraphTraversalImpl.this)#InnerElem]

Inherited from FilterMonadic[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]]

Inherited from HasNewBuilder[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from (GraphTraversalImpl.this)#MultiEdgeLazyPath to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyPath]

Inherited by implicit conversion CollectionsHaveToParArray from (GraphTraversalImpl.this)#MultiEdgeLazyPath to CollectionsHaveToParArray[(GraphTraversalImpl.this)#MultiEdgeLazyPath, T]

Inherited by implicit conversion MonadOps from (GraphTraversalImpl.this)#MultiEdgeLazyPath to MonadOps[(GraphTraversalImpl.this)#InnerElem]

Inherited by implicit conversion ChainingOps from (GraphTraversalImpl.this)#MultiEdgeLazyPath to ChainingOps[(GraphTraversalImpl.this)#MultiEdgeLazyPath]

Inherited by implicit conversion EdgeAssoc from (GraphTraversalImpl.this)#MultiEdgeLazyPath to EdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyPath]

Inherited by implicit conversion TraversableEnrichments from (GraphTraversalImpl.this)#MultiEdgeLazyPath to TraversableEnrichments[(GraphTraversalImpl.this)#InnerElem, Iterable]

Inherited by implicit conversion any2stringadd from (GraphTraversalImpl.this)#MultiEdgeLazyPath to any2stringadd[(GraphTraversalImpl.this)#MultiEdgeLazyPath]

Inherited by implicit conversion StringFormat from (GraphTraversalImpl.this)#MultiEdgeLazyPath to StringFormat[(GraphTraversalImpl.this)#MultiEdgeLazyPath]

Inherited by implicit conversion Ensuring from (GraphTraversalImpl.this)#MultiEdgeLazyPath to Ensuring[(GraphTraversalImpl.this)#MultiEdgeLazyPath]

Inherited by implicit conversion ArrowAssoc from (GraphTraversalImpl.this)#MultiEdgeLazyPath to ArrowAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyPath]

Inherited by implicit conversion alternateImplicit from (GraphTraversalImpl.this)#MultiEdgeLazyPath to ForceImplicitAmbiguity

Ungrouped