class MultiEdgeLazyCycle extends (GraphTraversalImpl.this)#MultiEdgeLazyPath with (GraphTraversalImpl.this)#Cycle
- Attributes
- protected
- Alphabetic
- By Inheritance
- MultiEdgeLazyCycle
- Cycle
- MultiEdgeLazyPath
- LazyPath
- Path
- Walk
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- by anyToNode
- by CollectionsHaveToParArray
- by MonadOps
- by EdgeAssoc
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
- Hide All
- Show All
- Public
- All
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
-
type
Self = Traversable[(GraphTraversalImpl.this)#InnerElem]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
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 to any2stringadd[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
-
def
++[B >: (GraphTraversalImpl.this)#InnerElem, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: (GraphTraversalImpl.this)#InnerElem, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: (GraphTraversalImpl.this)#InnerElem, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
- Definition Classes
- TraversableLike
-
def
->[B](y: B): ((GraphTraversalImpl.this)#MultiEdgeLazyCycle, B)
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to ArrowAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
def
/:[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B, That](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[(GraphTraversalImpl.this)#InnerElem, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Traversable]
- Definition Classes
- Traversable → GenTraversable → GenericTraversableTemplate
-
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): Unit
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (GraphTraversalImpl.this)#InnerElem](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: (GraphTraversalImpl.this)#InnerElem](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
drop(n: Int): Traversable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
dropWhile(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
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 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 to Ensuring[(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 to Ensuring[(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 to Ensuring[(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 to Ensuring[(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
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Option[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
flatMap[B, That](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): Traversable[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: (GraphTraversalImpl.this)#InnerElem](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
forall(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ U): Unit
- Definition Classes
- Walk → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to StringFormat[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
def
genericBuilder[B]: Builder[B, Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
groupBy[K](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ K): Map[K, Traversable[(GraphTraversalImpl.this)#InnerElem]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- LazyPath → AnyRef → Any
-
def
head: (GraphTraversalImpl.this)#InnerElem
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
headOption: Option[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: Traversable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[Traversable[(GraphTraversalImpl.this)#InnerElem]]
- Definition Classes
- TraversableLike
-
def
isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
-
def
isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isEmpty: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
isIn: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- 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 to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isOut: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
isValid: Boolean
Returns whether the nodes and edges on this path are valid with respect to this graph.
-
def
last: (GraphTraversalImpl.this)#InnerElem
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
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, That](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max[B >: (GraphTraversalImpl.this)#InnerElem](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: (GraphTraversalImpl.this)#InnerElem](implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit cmp: Ordering[B]): (GraphTraversalImpl.this)#InnerElem
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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 to EdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
- Attributes
- protected[this]
- Definition Classes
- GenericTraversableTemplate → HasNewBuilder
- 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
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
par: ParIterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[(GraphTraversalImpl.this)#InnerElem, ParIterable[(GraphTraversalImpl.this)#InnerElem]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike → Parallelizable
-
def
partition(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: (GraphTraversalImpl.this)#InnerElem](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: (GraphTraversalImpl.this)#InnerElem](op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: (GraphTraversalImpl.this)#InnerElem](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: (GraphTraversalImpl.this)#InnerElem](op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: Traversable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reversed: List[(GraphTraversalImpl.this)#InnerElem]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
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: Traversable[_]): Boolean
Same as
sameAs
but also comparing this cycle with anyTraversable
.Same as
sameAs
but also comparing this cycle with anyTraversable
.- Definition Classes
- Cycle
-
def
scan[B >: (GraphTraversalImpl.this)#InnerElem, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, (GraphTraversalImpl.this)#InnerElem) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: ((GraphTraversalImpl.this)#InnerElem, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[(GraphTraversalImpl.this)#InnerElem], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
seq: Traversable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
The number of nodes and edges on this path/walk.
The number of nodes and edges on this path/walk.
- Definition Classes
- Walk → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): Traversable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
span(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (Traversable[(GraphTraversalImpl.this)#InnerElem], Traversable[(GraphTraversalImpl.this)#InnerElem])
- Definition Classes
- TraversableLike → GenTraversableLike
- def startNode: (GraphTraversalImpl.this)#NodeT
- def stringPrefix: String
-
def
sum[B >: (GraphTraversalImpl.this)#InnerElem](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: Traversable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Traversable[(GraphTraversalImpl.this)#InnerElem]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Traversable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
takeWhile(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Traversable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
thisCollection: Traversable[(GraphTraversalImpl.this)#InnerElem]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (GraphTraversalImpl.this)#InnerElem, Col[(GraphTraversalImpl.this)#InnerElem]]): Col[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: (GraphTraversalImpl.this)#InnerElem](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: (GraphTraversalImpl.this)#InnerElem]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: Traversable[(GraphTraversalImpl.this)#InnerElem]): Traversable[(GraphTraversalImpl.this)#InnerElem]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
toIndexedSeq: IndexedSeq[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toList: List[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[(GraphTraversalImpl.this)#InnerElem, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to CollectionsHaveToParArray[(GraphTraversalImpl.this)#MultiEdgeLazyCycle, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type ((GraphTraversalImpl.this)#MultiEdgeLazyCycle) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toSeq: Seq[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: (GraphTraversalImpl.this)#InnerElem]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- TraversableLike → Any
-
def
toTraversable: Traversable[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[(GraphTraversalImpl.this)#InnerElem]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transpose[B](implicit asTraversable: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transpose
throws anIllegalArgumentException
if collections are not uniformly sized.
-
def
unzip[A1, A2](implicit asPair: ((GraphTraversalImpl.this)#InnerElem) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: ((GraphTraversalImpl.this)#InnerElem) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
- Definition Classes
- GenericTraversableTemplate
-
val
value: (GraphTraversalImpl.this)#MultiEdgeLazyCycle
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- OuterNode → NodeParam
-
def
view(from: Int, until: Int): TraversableView[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
- Definition Classes
- TraversableLike
-
def
view: TraversableView[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
- Definition Classes
- TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
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): FilterMonadic[(GraphTraversalImpl.this)#InnerElem, Traversable[(GraphTraversalImpl.this)#InnerElem]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to EdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
-
def
~>[N >: N1](n2: N): DiEdge[N]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to EdgeAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
-
def
→[B](y: B): ((GraphTraversalImpl.this)#MultiEdgeLazyCycle, B)
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to ArrowAssoc[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
Shadowed Implicit Value Members
-
def
filter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): TraversableOnce[(GraphTraversalImpl.this)#InnerElem]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to MonadOps[(GraphTraversalImpl.this)#InnerElem] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(multiEdgeLazyCycle: MonadOps[(GraphTraversalImpl.this)#InnerElem]).filter(p)
- Definition Classes
- MonadOps
-
def
flatMap[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to MonadOps[(GraphTraversalImpl.this)#InnerElem] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(multiEdgeLazyCycle: MonadOps[(GraphTraversalImpl.this)#InnerElem]).flatMap(f)
- Definition Classes
- MonadOps
-
def
map[B](f: ((GraphTraversalImpl.this)#InnerElem) ⇒ B): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to MonadOps[(GraphTraversalImpl.this)#InnerElem] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(multiEdgeLazyCycle: MonadOps[(GraphTraversalImpl.this)#InnerElem]).map(f)
- Definition Classes
- MonadOps
-
def
stringPrefix: String
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(multiEdgeLazyCycle: OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle]).stringPrefix
- Definition Classes
- NodeParam
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle] performed by method anyToNode in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(multiEdgeLazyCycle: OuterNode[(GraphTraversalImpl.this)#MultiEdgeLazyCycle]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
-
def
withFilter(p: ((GraphTraversalImpl.this)#InnerElem) ⇒ Boolean): Iterator[(GraphTraversalImpl.this)#InnerElem]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#MultiEdgeLazyCycle to MonadOps[(GraphTraversalImpl.this)#InnerElem] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(multiEdgeLazyCycle: MonadOps[(GraphTraversalImpl.this)#InnerElem]).withFilter(p)
- Definition Classes
- MonadOps
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
.