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, Traversable[(GraphTraversalImpl.this)#InnerElem], GenTraversable[(GraphTraversalImpl.this)#InnerElem], GenericTraversableTemplate[(GraphTraversalImpl.this)#InnerElem, Traversable], TraversableLike[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]], GenTraversableLike[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]], Parallelizable[(GraphTraversalImpl.this)#InnerElem, ParIterable[(GraphTraversalImpl.this)#InnerElem]], TraversableOnce[(GraphTraversalImpl.this)#InnerElem], GenTraversableOnce[(GraphTraversalImpl.this)#InnerElem], FilterMonadic[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]], HasNewBuilder[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MultiEdgeLazyCycle
  2. Cycle
  3. MultiEdgeLazyPath
  4. LazyPath
  5. Path
  6. Walk
  7. Traversable
  8. GenTraversable
  9. GenericTraversableTemplate
  10. TraversableLike
  11. GenTraversableLike
  12. Parallelizable
  13. TraversableOnce
  14. GenTraversableOnce
  15. FilterMonadic
  16. HasNewBuilder
  17. AnyRef
  18. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by EdgeAssoc
  5. by any2stringadd
  6. by StringFormat
  7. by Ensuring
  8. by ArrowAssoc
  9. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

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

Type Members

  1. trait NodeValidator extends (NodeT) ⇒ Boolean
    Attributes
    protected
    Definition Classes
    Walk
  2. type Self = Traversable[(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)#MultiEdgeLazyCycle to any2stringadd[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B >: (GraphTraversalImpl.this)#InnerElem, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: (GraphTraversalImpl.this)#InnerElem, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: (GraphTraversalImpl.this)#InnerElem, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): ((GraphTraversalImpl.this)#MultiEdgeLazyCycle, B)
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to ArrowAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. def /:[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :\[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  12. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def aggregate[B](z: ⇒ B)(seqop: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  16. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  17. def collect[B, That](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  18. def collectFirst[B](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B]): Option[B]
    Definition Classes
    TraversableOnce
  19. def companion: GenericCompanion[Traversable]
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate
  20. def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    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): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  26. def dropWhile(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  27. 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
    MultiEdgeLazyPathWalk
  28. def endNode: (GraphTraversalImpl.this)#NodeT
    Definition Classes
    LazyPathWalk
  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 to Ensuring[(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 to Ensuring[(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 to Ensuring[(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 to Ensuring[(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
    TraversableLike → TraversableOnce → GenTraversableOnce
  36. def filter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  37. def filterNot(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  38. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  39. def find(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  40. def flatMap[B, That](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  41. def flatten[B](implicit asTraversable: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): Traversable[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
    TraversableOnce → GenTraversableOnce
  45. def forall(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  46. def foreach[U](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ U): Unit
    Definition Classes
    Walk → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  47. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to StringFormat[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  48. def genericBuilder[B]: Builder[B, Traversable[B]]
    Definition Classes
    GenericTraversableTemplate
  49. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  50. def groupBy[K](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ K): Map[K, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike → GenTraversableLike
  51. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  52. def hashCode(): Int
    Definition Classes
    LazyPath → AnyRef → Any
  53. def head: (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableLike → GenTraversableLike
  54. def headOption: Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def init: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  56. def inits: Iterator[Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  57. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  58. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  59. def isEmpty: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  60. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  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 to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  63. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  64. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  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
    PathWalk
  66. def last: (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableLike → GenTraversableLike
  67. def lastOption: Option[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  68. def length: Int

    The number of edges on this path/walk.

    The number of edges on this path/walk.

    Definition Classes
    Walk
  69. def map[B, That](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  70. def max[B >: (GraphTraversalImpl.this)#InnerElem](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. def maxBy[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def min[B >: (GraphTraversalImpl.this)#InnerElem](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def minBy[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  76. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. final val multi: EqHashSet[(GraphTraversalImpl.this)#EdgeT]
    Attributes
    protected
    Definition Classes
    MultiEdgeLazyPath
  78. val n1: (GraphTraversalImpl.this)#MultiEdgeLazyCycle
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to EdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  79. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  80. def newBuilder: Builder[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  81. def nodeValidator: NodeValidator
    Attributes
    protected
    Definition Classes
    PathWalk
  82. val nodes: (GraphTraversalImpl.this)#ReverseStackTraversable[(GraphTraversalImpl.this)#CycleStackElem, (GraphTraversalImpl.this)#NodeT]
    Definition Classes
    MultiEdgeLazyCycleMultiEdgeLazyPathLazyPathWalk
  83. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. final def notify(): Unit
    Definition Classes
    AnyRef
  85. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  86. def par: ParIterable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    Parallelizable
  87. def parCombiner: Combiner[(GraphTraversalImpl.this)#InnerElem, ParIterable[(GraphTraversalImpl.this)#InnerElem]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  88. def partition(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])
    Definition Classes
    TraversableLike → GenTraversableLike
  89. def product[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def reduce[A1 >: (GraphTraversalImpl.this)#InnerElem](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def reduceLeft[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
    Definition Classes
    TraversableOnce
  92. def reduceLeftOption[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def reduceOption[A1 >: (GraphTraversalImpl.this)#InnerElem](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def reduceRight[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def reduceRightOption[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def repr: Traversable[(GraphTraversalImpl.this)#InnerElem]
    Definition Classes
    TraversableLike → GenTraversableLike
  97. def reversed: List[(GraphTraversalImpl.this)#InnerElem]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  98. 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
  99. final def sameElements(that: Traversable[_]): Boolean

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

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

    Definition Classes
    Cycle
  100. def scan[B >: (GraphTraversalImpl.this)#InnerElem, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  101. def scanLeft[B, That](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  102. def scanRight[B, That](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(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.

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

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

  135. def unzip[A1, A2](implicit asPair: ((GraphTraversalImpl.this)#InnerElem) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
    Definition Classes
    GenericTraversableTemplate
  136. def unzip3[A1, A2, A3](implicit asTriple: ((GraphTraversalImpl.this)#InnerElem) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
    Definition Classes
    GenericTraversableTemplate
  137. val value: (GraphTraversalImpl.this)#MultiEdgeLazyCycle
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  138. def view(from: Int, until: Int): TraversableView[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  139. def view: TraversableView[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike
  140. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  141. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  142. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  143. 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
  144. 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
  145. def withFilter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): FilterMonadic[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
    Definition Classes
    TraversableLike → FilterMonadic
  146. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to EdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  147. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to EdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  148. def [B](y: B): ((GraphTraversalImpl.this)#MultiEdgeLazyCycle, B)
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to ArrowAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] 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)#MultiEdgeLazyCycle 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:
    (multiEdgeLazyCycle: 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)#MultiEdgeLazyCycle 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:
    (multiEdgeLazyCycle: 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)#MultiEdgeLazyCycle 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:
    (multiEdgeLazyCycle: 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)#MultiEdgeLazyCycle to OuterNode[(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
  5. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(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
  6. def withFilter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Iterator[(GraphTraversalImpl.this)#InnerElem]
    Implicit
    This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle 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:
    (multiEdgeLazyCycle: MonadOps[(GraphTraversalImpl.this)#InnerElem]).withFilter(p)
    Definition Classes
    MonadOps

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 Traversable[(GraphTraversalImpl.this)#InnerElem]

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

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

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

Inherited from GenTraversableLike[(GraphTraversalImpl.this)#InnerElem, Traversable[(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, Traversable[(GraphTraversalImpl.this)#InnerElem]]

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

Inherited from AnyRef

Inherited from Any

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

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

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

Inherited by implicit conversion EdgeAssoc from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to EdgeAssoc[(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]

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

Ungrouped