Packages

class MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle

Attributes
protected
Linear Supertypes
(GraphTraversalImpl.this)#Cycle, (GraphTraversalImpl.this)#MultiEdgeLazyPath, (GraphTraversalImpl.this)#LazyPath, (GraphTraversalImpl.this)#Path, (GraphTraversalImpl.this)#Walk, Iterable[(GraphTraversalImpl.this)#InnerElem], IterableFactoryDefaults[(GraphTraversalImpl.this)#InnerElem, Iterable], IterableOps[(GraphTraversalImpl.this)#InnerElem, Iterable, Iterable[(GraphTraversalImpl.this)#InnerElem]], IterableOnceOps[(GraphTraversalImpl.this)#InnerElem, Iterable, Iterable[(GraphTraversalImpl.this)#InnerElem]], scala.collection.IterableOnce[(GraphTraversalImpl.this)#InnerElem], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MultiEdgeLazyCycle
  2. Cycle
  3. MultiEdgeLazyPath
  4. LazyPath
  5. Path
  6. Walk
  7. Iterable
  8. IterableFactoryDefaults
  9. IterableOps
  10. IterableOnceOps
  11. IterableOnce
  12. AnyRef
  13. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by ChainingOps
  3. by EdgeAssoc
  4. by TraversableEnrichments
  5. by anyToNode
  6. by any2stringadd
  7. by StringFormat
  8. by Ensuring
  9. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

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

Type Members

  1. trait NodeValidator extends (NodeT) => Boolean
    Attributes
    protected
    Definition Classes
    Walk

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)#MultiEdgeLazyCycle toany2stringadd[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. final def ++[B >: (GraphTraversalImpl.this)#InnerElem](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  5. def ->[B](y: B): ((GraphTraversalImpl.this)#MultiEdgeLazyCycle, B)
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toArrowAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  8. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  9. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  10. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  11. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  12. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  13. final def coll: MultiEdgeLazyCycle.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  14. def collect[B](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  15. def collectFirst[B](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B]): Option[B]
    Definition Classes
    IterableOnceOps
  16. def concat[B >: (GraphTraversalImpl.this)#InnerElem](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
  17. final def containingGraph: GraphTraversalImpl.this

    The Graph instance that contains this walk.

    The Graph instance that contains this walk.

    Definition Classes
    Walk
  18. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  19. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  20. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  21. def corresponds[B](that: scala.collection.IterableOnce[B])(p: ((GraphTraversalImpl.this)#InnerElem, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  22. def count(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Int
    Definition Classes
    IterableOnceOps
  23. def drop(n: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  24. def dropRight(n: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps
  25. def dropWhile(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  26. 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
  27. def empty: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  28. def endNode: (GraphTraversalImpl.this)#NodeT
    Definition Classes
    Cycle → Walk
  29. def ensuring(cond: ((GraphTraversalImpl.this)#MultiEdgeLazyCycle) => Boolean, msg: => Any): (GraphTraversalImpl.this)#MultiEdgeLazyCycle
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toEnsuring[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  30. def ensuring(cond: ((GraphTraversalImpl.this)#MultiEdgeLazyCycle) => Boolean): (GraphTraversalImpl.this)#MultiEdgeLazyCycle
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toEnsuring[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  31. def ensuring(cond: Boolean, msg: => Any): (GraphTraversalImpl.this)#MultiEdgeLazyCycle
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toEnsuring[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  32. def ensuring(cond: Boolean): (GraphTraversalImpl.this)#MultiEdgeLazyCycle
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toEnsuring[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  33. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  34. def equals(other: Any): Boolean
    Definition Classes
    LazyPath → AnyRef → Any
  35. def exists(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  36. def filter(pred: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  37. def filterNot(pred: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  38. def find(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOnceOps
  39. def flatMap[B](f: ((GraphTraversalImpl.this)#InnerElem) => scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  40. def flatten[B](implicit asIterable: ((GraphTraversalImpl.this)#InnerElem) => scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  41. def fold[A1 >: (GraphTraversalImpl.this)#InnerElem](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  42. def foldLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) => B): B
    Definition Classes
    IterableOnceOps
  43. def foldRight[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) => B): B
    Definition Classes
    IterableOnceOps
  44. def forall(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  45. def foreach[U](f: ((GraphTraversalImpl.this)#InnerElem) => U): Unit
    Definition Classes
    IterableOnceOps
  46. def fromSpecific(coll: scala.collection.IterableOnce[(GraphTraversalImpl.this)#InnerElem]): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  47. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  48. def groupBy[K](f: ((GraphTraversalImpl.this)#InnerElem) => K): Map[K, Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    IterableOps
  49. def groupMap[K, B](key: ((GraphTraversalImpl.this)#InnerElem) => K)(f: ((GraphTraversalImpl.this)#InnerElem) => B): Map[K, Iterable[B]]
    Definition Classes
    IterableOps
  50. def groupMapReduce[K, B](key: ((GraphTraversalImpl.this)#InnerElem) => K)(f: ((GraphTraversalImpl.this)#InnerElem) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  51. def grouped(size: Int): Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    IterableOps
  52. def hashCode(): Int
    Definition Classes
    LazyPath → AnyRef → Any
  53. def head: (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    IterableOps
  54. def headOption: Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps
  55. def init: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps
  56. def inits: Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    IterableOps
  57. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toOuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  58. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toOuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  59. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  60. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toOuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  61. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  62. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toOuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  63. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toOuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  64. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  65. 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
  66. def iterableFactory: IterableFactory[Iterable]
    Definition Classes
    Iterable → IterableOps
  67. def iterator: Iterator[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    Walk → IterableOnce
  68. def knownSize: Int
    Definition Classes
    IterableOnce
  69. def last: (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    IterableOps
  70. def lastOption: Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps
  71. def lazyZip[B](that: Iterable[B]): LazyZip2[(GraphTraversalImpl.this)#InnerElem, B, MultiEdgeLazyCycle.this.type]
    Definition Classes
    Iterable
  72. def length: Int

    The number of edges on this path/walk.

    The number of edges on this path/walk.

    Definition Classes
    Walk
  73. def map[B](f: ((GraphTraversalImpl.this)#InnerElem) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  74. def max[B >: (GraphTraversalImpl.this)#InnerElem](implicit ord: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    IterableOnceOps
  75. def maxBy[B](f: ((GraphTraversalImpl.this)#InnerElem) => B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    IterableOnceOps
  76. def maxByOption[B](f: ((GraphTraversalImpl.this)#InnerElem) => B)(implicit cmp: Ordering[B]): Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOnceOps
  77. def maxOption[B >: (GraphTraversalImpl.this)#InnerElem](implicit ord: Ordering[B]): Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOnceOps
  78. def min[B >: (GraphTraversalImpl.this)#InnerElem](implicit ord: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    IterableOnceOps
  79. def minBy[B](f: ((GraphTraversalImpl.this)#InnerElem) => B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    IterableOnceOps
  80. def minByOption[B](f: ((GraphTraversalImpl.this)#InnerElem) => B)(implicit cmp: Ordering[B]): Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOnceOps
  81. def minOption[B >: (GraphTraversalImpl.this)#InnerElem](implicit ord: Ordering[B]): Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOnceOps
  82. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  83. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  84. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  85. final val multi: EqHashSet[(GraphTraversalImpl.this)#EdgeT]
    Attributes
    protected
    Definition Classes
    MultiEdgeLazyPath
  86. val n1: (GraphTraversalImpl.this)#MultiEdgeLazyCycle
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toEdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  87. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  88. def newSpecificBuilder: Builder[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  89. def nodeValidator: NodeValidator
    Attributes
    protected
    Definition Classes
    Path → Walk
  90. 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
    MultiEdgeLazyCycle → MultiEdgeLazyPath → LazyPath → Walk
  91. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  92. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  93. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  94. def partition(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): (Iterable[(GraphTraversalImpl.this)#InnerElem], Iterable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    IterableOps
  95. def partitionMap[A1, A2](f: ((GraphTraversalImpl.this)#InnerElem) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  96. def pipe[B](f: ((GraphTraversalImpl.this)#MultiEdgeLazyCycle) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toChainingOps[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  97. def product[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  98. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toOuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  99. def reduce[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  100. def reduceLeft[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) => B): B
    Definition Classes
    IterableOnceOps
  101. def reduceLeftOption[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) => B): Option[B]
    Definition Classes
    IterableOnceOps
  102. def reduceOption[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  103. def reduceRight[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) => B): B
    Definition Classes
    IterableOnceOps
  104. def reduceRightOption[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  105. def reversed: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  106. final def sameAs(that: Cycle): Boolean

    Semantically compares this cycle with that cycle.

    Semantically compares this cycle with that cycle. While == returns true only if the cycles contain the same elements in the same order, this comparison returns also true if the elements of that cycle can be shifted and optionally reversed such that their elements have the same order. For instance, given

    c1 = Cycle(1-2-3-1), c2 = Cycle(2-3-1-2) and c3 = Cycle(2-1-3-2)

    the following expressions hold:

    c1 != c2, c1 != c3 but c1 sameAs c2 and c1 sameAs c3.

    Definition Classes
    Cycle
  107. final def sameElements(that: Iterable[_]): Boolean

    Same as sameAs but also comparing this cycle with any Iterable.

    Same as sameAs but also comparing this cycle with any Iterable.

    Definition Classes
    Cycle
  108. def scan[B >: (GraphTraversalImpl.this)#InnerElem](z: B)(op: (B, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  109. def scanLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  110. def scanRight[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  111. val self: (GraphTraversalImpl.this)#MultiEdgeLazyCycle
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toChainingOps[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  112. 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 → IterableOnceOps
  113. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  114. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  115. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  116. def slice(from: Int, until: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  117. def sliding(size: Int, step: Int): Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    IterableOps
  118. def sliding(size: Int): Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    IterableOps
  119. def span(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): (Iterable[(GraphTraversalImpl.this)#InnerElem], Iterable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    IterableOps → IterableOnceOps
  120. def splitAt(n: Int): (Iterable[(GraphTraversalImpl.this)#InnerElem], Iterable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    IterableOps → IterableOnceOps
  121. def startNode: (GraphTraversalImpl.this)#NodeT
    Definition Classes
    LazyPath → Walk
  122. def stepper[S <: Stepper[_]](implicit shape: StepperShape[(GraphTraversalImpl.this)#InnerElem, S]): S
    Definition Classes
    IterableOnce
  123. def stringPrefix: String
    Definition Classes
    Cycle → Path → Walk → Iterable
  124. def sum[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  125. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  126. val t: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toTraversableEnrichments[(GraphTraversalImpl.this)#InnerElem, Iterable] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  127. def tail: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps
  128. def tails: Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    IterableOps
  129. def take(n: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  130. def takeRight(n: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps
  131. def takeWhile(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  132. def tap[U](f: ((GraphTraversalImpl.this)#MultiEdgeLazyCycle) => U): (GraphTraversalImpl.this)#MultiEdgeLazyCycle
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toChainingOps[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  133. def tapEach[U](f: ((GraphTraversalImpl.this)#InnerElem) => U): Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  134. def to[C1](factory: Factory[(GraphTraversalImpl.this)#InnerElem, C1]): C1
    Definition Classes
    IterableOnceOps
  135. def toArray[B >: (GraphTraversalImpl.this)#InnerElem](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  136. final def toBuffer[B >: (GraphTraversalImpl.this)#InnerElem]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  137. def toIndexedSeq: IndexedSeq[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOnceOps
  138. def toList: List[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOnceOps
  139. def toMap[K, V](implicit ev: <:<[(GraphTraversalImpl.this)#InnerElem, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  140. def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[(GraphTraversalImpl.this)#InnerElem, E]]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toTraversableEnrichments[(GraphTraversalImpl.this)#InnerElem, Iterable] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  141. def toSeq: Seq[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOnceOps
  142. def toSet[B >: (GraphTraversalImpl.this)#InnerElem]: Set[B]
    Definition Classes
    IterableOnceOps
  143. def toString(): String
    Definition Classes
    Iterable → AnyRef → Any
  144. def toVector: Vector[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOnceOps
  145. def transpose[B](implicit asIterable: ((GraphTraversalImpl.this)#InnerElem) => Iterable[B]): Iterable[Iterable[B]]
    Definition Classes
    IterableOps
  146. def unzip[A1, A2](implicit asPair: ((GraphTraversalImpl.this)#InnerElem) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  147. def unzip3[A1, A2, A3](implicit asTriple: ((GraphTraversalImpl.this)#InnerElem) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    IterableOps
  148. val value: (GraphTraversalImpl.this)#MultiEdgeLazyCycle
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toOuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  149. def view: View[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps
  150. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  151. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  152. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  153. 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
  154. 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
  155. def withFilter(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): WithFilter[(GraphTraversalImpl.this)#InnerElem, Iterable]
    Definition Classes
    IterableOps
  156. def zip[B](that: scala.collection.IterableOnce[B]): Iterable[((GraphTraversalImpl.this)#InnerElem, B)]
    Definition Classes
    IterableOps
  157. def zipAll[A1 >: (GraphTraversalImpl.this)#InnerElem, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Definition Classes
    IterableOps
  158. def zipWithIndex: Iterable[((GraphTraversalImpl.this)#InnerElem, Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  159. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toEdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  160. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toEdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Shadowed Implicit Value Members

  1. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toOuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] 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:
    (multiEdgeLazyCycle: OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle]).stringPrefix
    Definition Classes
    NodeParam
  2. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toOuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] 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:
    (multiEdgeLazyCycle: OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Deprecated Value Members

  1. def ++:[B >: (GraphTraversalImpl.this)#InnerElem](that: scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  2. def /:[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  3. final def /:[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  4. def :\[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  5. final def :\[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  6. def aggregate[B](z: => B)(seqop: (B, (GraphTraversalImpl.this)#InnerElem) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  7. def collectFirst[B](f: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.collectFirst(...) instead

  8. def companion: IterableFactory[Iterable]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  9. def copyToBuffer(dest: Buffer[(GraphTraversalImpl.this)#InnerElem]): Unit
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

  10. final def copyToBuffer[B >: (GraphTraversalImpl.this)#InnerElem](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  11. def count(f: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.count(...) instead

  12. def exists(f: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.exists(...) instead

  13. def filter(f: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Iterator[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.filter(...) instead

  14. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  15. def find(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Option[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  16. def flatMap[B](f: ((GraphTraversalImpl.this)#InnerElem) => scala.collection.IterableOnce[B]): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

  17. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  18. def foldLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  19. def foldRight[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  20. def forall(f: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.forall(...) instead

  21. def foreach[U](f: ((GraphTraversalImpl.this)#InnerElem) => U): Unit
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foreach(...) instead

  22. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toStringFormat[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  23. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  24. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  25. def map[B](f: ((GraphTraversalImpl.this)#InnerElem) => B): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

  26. def max(implicit ord: Ordering[(GraphTraversalImpl.this)#InnerElem]): (GraphTraversalImpl.this)#InnerElem
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  27. def maxBy[B](f: ((GraphTraversalImpl.this)#InnerElem) => B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.maxBy(...) instead

  28. def min(implicit ord: Ordering[(GraphTraversalImpl.this)#InnerElem]): (GraphTraversalImpl.this)#InnerElem
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  29. def minBy[B](f: ((GraphTraversalImpl.this)#InnerElem) => B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.minBy(...) instead

  30. def mkString: String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  31. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  32. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  33. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  34. def product(implicit num: Numeric[(GraphTraversalImpl.this)#InnerElem]): (GraphTraversalImpl.this)#InnerElem
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  35. def reduce(f: ((GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElem) => (GraphTraversalImpl.this)#InnerElem): (GraphTraversalImpl.this)#InnerElem
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduce(...) instead

  36. def reduceLeft(f: ((GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElem) => (GraphTraversalImpl.this)#InnerElem): (GraphTraversalImpl.this)#InnerElem
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

  37. def reduceLeftOption(f: ((GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElem) => (GraphTraversalImpl.this)#InnerElem): Option[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

  38. def reduceOption(f: ((GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElem) => (GraphTraversalImpl.this)#InnerElem): Option[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceOption(...) instead

  39. def reduceRight(f: ((GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElem) => (GraphTraversalImpl.this)#InnerElem): (GraphTraversalImpl.this)#InnerElem
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRight(...) instead

  40. def reduceRightOption(f: ((GraphTraversalImpl.this)#InnerElem, (GraphTraversalImpl.this)#InnerElem) => (GraphTraversalImpl.this)#InnerElem): Option[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

  41. final def repr: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  42. def sameElements[B >: A](that: scala.collection.IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).sameElements(that)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sameElements instead

  43. def seq: MultiEdgeLazyCycle.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  44. def size: Int
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  45. def sum(implicit num: Numeric[(GraphTraversalImpl.this)#InnerElem]): (GraphTraversalImpl.this)#InnerElem
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  46. def to[C1](factory: Factory[(GraphTraversalImpl.this)#InnerElem, C1]): C1
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(factory) instead

  47. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  48. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

  49. def toIndexedSeq: IndexedSeq[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  50. final def toIterable: Iterable[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  51. final def toIterable: MultiEdgeLazyCycle.this.type
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  52. def toIterator: Iterator[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

  53. final def toIterator: Iterator[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  54. def toList: List[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(List) instead

  55. def toMap[K, V](implicit ev: <:<[(GraphTraversalImpl.this)#InnerElem, (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Map) instead

  56. def toSeq: Seq[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Seq) instead

  57. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Set) instead

  58. def toStream: Stream[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(LazyList) instead

  59. final def toStream: Stream[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  60. final def toTraversable: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  61. final def toTraversable: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  62. def toVector: Vector[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Vector) instead

  63. def view(from: Int, until: Int): View[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

  64. def withFilter(f: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Iterator[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toIterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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:
    (multiEdgeLazyCycle: IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.withFilter(...) instead

  65. def →[B](y: B): ((GraphTraversalImpl.this)#MultiEdgeLazyCycle, B)
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle toArrowAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from (GraphTraversalImpl.this)#Cycle

Inherited from (GraphTraversalImpl.this)#MultiEdgeLazyPath

Inherited from (GraphTraversalImpl.this)#LazyPath

Inherited from (GraphTraversalImpl.this)#Path

Inherited from (GraphTraversalImpl.this)#Walk

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

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

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

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

Inherited from scala.collection.IterableOnce[(GraphTraversalImpl.this)#InnerElem]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods from(GraphTraversalImpl.this)#MultiEdgeLazyCycle to IterableOnceExtensionMethods[(GraphTraversalImpl.this)#InnerElem]

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

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

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

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

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

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

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

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

Ungrouped