scalax.collection.GraphTraversalImpl

MultiEdgeLazyCycle

class MultiEdgeLazyCycle extends MultiEdgeLazyPath with Cycle

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

Instance Constructors

  1. new MultiEdgeLazyCycle(nodes: ReverseStackTraversable[(NodeT, Iterable[GraphTraversalImpl.EdgeT]), NodeT], edgeFilter: (GraphTraversalImpl.EdgeT) ⇒ Boolean)

Type Members

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

    Attributes
    protected
    Definition Classes
    TraversableLike

  2. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def +(other: String): String

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

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableLike

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  13. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  17. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

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

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

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

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

  20. def clone(): AnyRef

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

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce

  23. def companion: GenericCompanion[Traversable]

    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  31. final lazy val edges: ArrayBuffer[GraphTraversalImpl.EdgeT]

    Definition Classes
    MultiEdgeLazyPath → Path

  32. def endNode: NodeT

    Definition Classes
    LazyPath → Path

  33. def ensuring(cond: (MultiEdgeLazyCycle) ⇒ Boolean, msg: ⇒ Any): MultiEdgeLazyCycle

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

  34. def ensuring(cond: (MultiEdgeLazyCycle) ⇒ Boolean): MultiEdgeLazyCycle

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

  35. def ensuring(cond: Boolean, msg: ⇒ Any): MultiEdgeLazyCycle

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

  36. def ensuring(cond: Boolean): MultiEdgeLazyCycle

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

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

    Definition Classes
    AnyRef

  38. def equals(other: Any): Boolean

    Definition Classes
    LazyPath → AnyRef → Any

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  42. def finalize(): Unit

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

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

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

  51. def formatted(fmtstr: String): String

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

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    TraversableLike → GenTraversableLike

  55. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  56. def hashCode(): Int

    Definition Classes
    LazyPath → AnyRef → Any

  57. def head: OutParam[N, E]

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

  62. def isDefined: Boolean

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

  63. def isEdge: Boolean

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

  64. def isEmpty: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  65. def isIn: Boolean

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

  66. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  67. def isNode: Boolean

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

  68. def isOut: Boolean

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

  69. def isParIterable: Boolean

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

  70. def isParSeq: Boolean

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

  71. def isParallel: Boolean

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

  72. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  73. def isValid: Boolean

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

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

    Definition Classes
    LazyPath → Path

  74. def last: OutParam[N, E]

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  76. def length: Int

    The number of edges on this path.

    The number of edges on this path.

    Definition Classes
    Path

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  82. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  83. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  85. final val multi: EqHashMap[GraphTraversalImpl.EdgeT, Boolean]

    Attributes
    protected
    Definition Classes
    MultiEdgeLazyPath

  86. val n1: MultiEdgeLazyCycle

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

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

    Definition Classes
    AnyRef

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

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  89. val nodes: ReverseStackTraversable[(NodeT, Iterable[GraphTraversalImpl.EdgeT]), NodeT]

    All nodes of this path in proper order.

    All nodes of this path in proper order.

    Definition Classes
    MultiEdgeLazyCycle → MultiEdgeLazyPath → LazyPath → Path

  90. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  91. final def notify(): Unit

    Definition Classes
    AnyRef

  92. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    Parallelizable

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

    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

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

    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  111. def size: Int

    The number of nodes and edges on this path.

    The number of nodes and edges on this path.

    Definition Classes
    Path → GenTraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  115. def startNode: NodeT

    Definition Classes
    LazyPath → Path

  116. def stringPrefix: String

    Definition Classes
    Cycle → Path → TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Attributes
    protected[this]
    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Attributes
    protected[this]
    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableOnce

  137. def toString(): String

    Definition Classes
    TraversableLike → Any

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    GenericTraversableTemplate

  143. val value: MultiEdgeLazyCycle

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

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableLike

  146. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  149. def weight: Long

    The cumulated weight of all edges on this path.

    The cumulated weight of all edges on this path.

    Definition Classes
    Path

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

    Definition Classes
    TraversableLike → FilterMonadic

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

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

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

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

  153. def →[B](y: B): (MultiEdgeLazyCycle, B)

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

Shadowed Implicit Value Members

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

    Implicit information
    This member is added by an implicit conversion from MultiEdgeLazyCycle to MonadOps[OutParam[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (multiEdgeLazyCycle: MonadOps[OutParam[N, E]]).filter(p)
    Definition Classes
    MonadOps

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

    Implicit information
    This member is added by an implicit conversion from MultiEdgeLazyCycle to MonadOps[OutParam[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (multiEdgeLazyCycle: MonadOps[OutParam[N, E]]).flatMap(f)
    Definition Classes
    MonadOps

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

    Implicit information
    This member is added by an implicit conversion from MultiEdgeLazyCycle to MonadOps[OutParam[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (multiEdgeLazyCycle: MonadOps[OutParam[N, E]]).map(f)
    Definition Classes
    MonadOps

  4. val self: Any

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

  5. val self: Any

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

  6. def stringPrefix: String

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

  7. def toString(): String

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

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

    Implicit information
    This member is added by an implicit conversion from MultiEdgeLazyCycle to MonadOps[OutParam[N, E]] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (multiEdgeLazyCycle: MonadOps[OutParam[N, E]]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

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

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

  2. def x: MultiEdgeLazyCycle

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

    (Since version 2.10.0) Use leftOfArrow instead

  3. def x: MultiEdgeLazyCycle

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

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from GraphTraversalImpl.Cycle

Inherited from MultiEdgeLazyPath

Inherited from LazyPath

Inherited from GraphTraversalImpl.Path

Inherited from Traversable[OutParam[N, E]]

Inherited from GenTraversable[OutParam[N, E]]

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

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

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

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

Inherited from TraversableOnce[OutParam[N, E]]

Inherited from GenTraversableOnce[OutParam[N, E]]

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

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

Inherited from AnyRef

Inherited from Any

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

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

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

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

Inherited by implicit conversion any2stringadd from MultiEdgeLazyCycle to StringAdd

Inherited by implicit conversion any2stringfmt from MultiEdgeLazyCycle to StringFormat

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

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

Inherited by implicit conversion alternateImplicit from MultiEdgeLazyCycle to ForceImplicitAmbiguity

Ungrouped