class MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
- Attributes
- protected
- Alphabetic
- By Inheritance
- MultiEdgeLazyCycle
- Cycle
- MultiEdgeLazyPath
- LazyPath
- Path
- Walk
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- by iterableOnceExtensionMethods
- by ChainingOps
- by EdgeAssoc
- by TraversableEnrichments
- by anyToNode
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new MultiEdgeLazyCycle(nodes: (GraphTraversalImpl.this)#ReverseStackTraversable[CycleStackElem], edgeFilter: (GraphTraversalImpl.this)#EdgeFilter)
Type Members
- trait NodeValidator extends (NodeT) => Boolean
- Attributes
- protected
- Definition Classes
- Walk
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- 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
- final def ++[B >: (GraphTraversalImpl.this)#InnerElem](suffix: scala.collection.IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- 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()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def addString(b: StringBuilder): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- IterableOnceOps
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def coll: MultiEdgeLazyCycle.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def concat[B >: (GraphTraversalImpl.this)#InnerElem](suffix: scala.collection.IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- final def containingGraph: GraphTraversalImpl.this
The
Graph
instance that containsthis
walk.The
Graph
instance that containsthis
walk.- Definition Classes
- Walk
- def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: scala.collection.IterableOnce[B])(p: ((GraphTraversalImpl.this)#InnerElem, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def drop(n: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps
- def dropWhile(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps → IterableOnceOps
- 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
- def empty: Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def endNode: (GraphTraversalImpl.this)#NodeT
- 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
- 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
- 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
- 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
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(other: Any): Boolean
- Definition Classes
- LazyPath → AnyRef → Any
- def exists(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterNot(pred: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps → IterableOnceOps
- def find(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Option[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOnceOps
- def flatMap[B](f: ((GraphTraversalImpl.this)#InnerElem) => scala.collection.IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: ((GraphTraversalImpl.this)#InnerElem) => scala.collection.IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: (GraphTraversalImpl.this)#InnerElem](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: ((GraphTraversalImpl.this)#InnerElem) => U): Unit
- Definition Classes
- IterableOnceOps
- def fromSpecific(coll: scala.collection.IterableOnce[(GraphTraversalImpl.this)#InnerElem]): Iterable[(GraphTraversalImpl.this)#InnerElem]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def groupBy[K](f: ((GraphTraversalImpl.this)#InnerElem) => K): Map[K, Iterable[(GraphTraversalImpl.this)#InnerElem]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: ((GraphTraversalImpl.this)#InnerElem) => K)(f: ((GraphTraversalImpl.this)#InnerElem) => B): Map[K, Iterable[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: ((GraphTraversalImpl.this)#InnerElem) => K)(f: ((GraphTraversalImpl.this)#InnerElem) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
- Definition Classes
- IterableOps
- def hashCode(): Int
- Definition Classes
- LazyPath → AnyRef → Any
- def head: (GraphTraversalImpl.this)#InnerElem
- Definition Classes
- IterableOps
- def headOption: Option[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps
- def init: Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps
- def inits: Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
- Definition Classes
- IterableOps
- 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
- 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
- def isEmpty: Boolean
- Definition Classes
- IterableOnceOps
- 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
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- 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
- 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
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def isValid: Boolean
Returns whether the nodes and edges on this path are valid with respect to this graph.
- def iterableFactory: IterableFactory[Iterable]
- Definition Classes
- Iterable → IterableOps
- def iterator: Iterator[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- Walk → IterableOnce
- def knownSize: Int
- Definition Classes
- IterableOnce
- def last: (GraphTraversalImpl.this)#InnerElem
- Definition Classes
- IterableOps
- def lastOption: Option[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[(GraphTraversalImpl.this)#InnerElem, B, MultiEdgeLazyCycle.this.type]
- Definition Classes
- Iterable
- def length: Int
The number of edges on this path/walk.
The number of edges on this path/walk.
- Definition Classes
- Walk
- def map[B](f: ((GraphTraversalImpl.this)#InnerElem) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def max[B >: (GraphTraversalImpl.this)#InnerElem](implicit ord: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: ((GraphTraversalImpl.this)#InnerElem) => B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: ((GraphTraversalImpl.this)#InnerElem) => B)(implicit cmp: Ordering[B]): Option[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: (GraphTraversalImpl.this)#InnerElem](implicit ord: Ordering[B]): Option[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOnceOps
- def min[B >: (GraphTraversalImpl.this)#InnerElem](implicit ord: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
- Definition Classes
- IterableOnceOps
- def minBy[B](f: ((GraphTraversalImpl.this)#InnerElem) => B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: ((GraphTraversalImpl.this)#InnerElem) => B)(implicit cmp: Ordering[B]): Option[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOnceOps
- def minOption[B >: (GraphTraversalImpl.this)#InnerElem](implicit ord: Ordering[B]): Option[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- final val multi: EqHashSet[(GraphTraversalImpl.this)#EdgeT]
- Attributes
- protected
- Definition Classes
- MultiEdgeLazyPath
- 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
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[(GraphTraversalImpl.this)#InnerElem, Iterable[(GraphTraversalImpl.this)#InnerElem]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def nodeValidator: NodeValidator
- 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
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def partition(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): (Iterable[(GraphTraversalImpl.this)#InnerElem], Iterable[(GraphTraversalImpl.this)#InnerElem])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: ((GraphTraversalImpl.this)#InnerElem) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- 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
- def product[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- 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
- def reduce[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reversed: Iterable[(GraphTraversalImpl.this)#InnerElem]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- final def sameAs(that: Cycle): Boolean
Semantically compares
this
cycle withthat
cycle.Semantically compares
this
cycle withthat
cycle. While==
returnstrue
only if the cycles contain the same elements in the same order, this comparison returns alsotrue
if the elements ofthat
cycle can be shifted and optionally reversed such that their elements have the same order. For instance, givenc1 = Cycle(1-2-3-1)
,c2 = Cycle(2-3-1-2)
andc3 = Cycle(2-1-3-2)
the following expressions hold:
c1 != c2
,c1 != c3
butc1 sameAs c2
andc1 sameAs c3
.- Definition Classes
- Cycle
- final def sameElements(that: Iterable[_]): Boolean
Same as
sameAs
but also comparing this cycle with anyIterable
.Same as
sameAs
but also comparing this cycle with anyIterable
.- Definition Classes
- Cycle
- def scan[B >: (GraphTraversalImpl.this)#InnerElem](z: B)(op: (B, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- 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
- 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
- def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
- Definition Classes
- IterableOps
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
- Definition Classes
- IterableOps
- def span(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): (Iterable[(GraphTraversalImpl.this)#InnerElem], Iterable[(GraphTraversalImpl.this)#InnerElem])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (Iterable[(GraphTraversalImpl.this)#InnerElem], Iterable[(GraphTraversalImpl.this)#InnerElem])
- Definition Classes
- IterableOps → IterableOnceOps
- def startNode: (GraphTraversalImpl.this)#NodeT
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[(GraphTraversalImpl.this)#InnerElem, S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- def sum[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- 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
- def tail: Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps
- def tails: Iterator[Iterable[(GraphTraversalImpl.this)#InnerElem]]
- Definition Classes
- IterableOps
- def take(n: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps
- def takeWhile(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps → IterableOnceOps
- 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
- def tapEach[U](f: ((GraphTraversalImpl.this)#InnerElem) => U): Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[(GraphTraversalImpl.this)#InnerElem, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: (GraphTraversalImpl.this)#InnerElem](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: (GraphTraversalImpl.this)#InnerElem]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOnceOps
- def toList: List[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[(GraphTraversalImpl.this)#InnerElem, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- 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
- def toSeq: Seq[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOnceOps
- def toSet[B >: (GraphTraversalImpl.this)#InnerElem]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- Definition Classes
- Iterable → AnyRef → Any
- def toVector: Vector[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: ((GraphTraversalImpl.this)#InnerElem) => Iterable[B]): Iterable[Iterable[B]]
- Definition Classes
- IterableOps
- def unzip[A1, A2](implicit asPair: ((GraphTraversalImpl.this)#InnerElem) => (A1, A2)): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: ((GraphTraversalImpl.this)#InnerElem) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- Definition Classes
- IterableOps
- 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
- def view: View[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOps
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- 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
- 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
- def withFilter(p: ((GraphTraversalImpl.this)#InnerElem) => Boolean): WithFilter[(GraphTraversalImpl.this)#InnerElem, Iterable]
- Definition Classes
- IterableOps
- def zip[B](that: scala.collection.IterableOnce[B]): Iterable[((GraphTraversalImpl.this)#InnerElem, B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: (GraphTraversalImpl.this)#InnerElem, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Iterable[((GraphTraversalImpl.this)#InnerElem, Int)]
- Definition Classes
- IterableOps → IterableOnceOps
- 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()
- 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
- 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
- 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
- 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
- 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
- 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 /:
- 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
- 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 :\
- 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. UsefoldLeft(z)(seqop)
instead.
- 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
- def companion: IterableFactory[Iterable]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- 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
- 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
- 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
- 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
- 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
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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 ofvalue.formatted(formatString)
, or use thef""
string interpolator. In Java 15 and later,formatted
resolves to the new method in String which has reversed parameters.
- 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)
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- def seq: MultiEdgeLazyCycle.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
ortoSeq
, but it doesn't copy non-immutable collections
- 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
- final def toIterator: Iterator[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
ortoSeq
, but it doesn't copy non-immutable collections
- 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
- 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)
- 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
- 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.
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.