Impl

trait Impl[A, +CC <: GraphTraversalImpl.Traverser[A, CC] with GraphTraversalImpl.Impl[A, CC]] extends GraphTraversalImpl.TraverserMethods[A, CC] with GraphTraversalImpl.Traverser[A, CC]

Attributes: protected[collection]
Self Type: CC

Linear Supertypes

GraphTraversalImpl.Traverser[A, CC], ForeachBasedDetachingIterable[A], Iterable[A], IterableFactoryDefaults[A, Iterable], IterableOps[A, Iterable, Iterable[A]], IterableOnceOps[A, Iterable, Iterable[A]], IterableOnce[A], GraphTraversalImpl.Properties, GraphTraversalImpl.SubgraphProperties, GraphTraversalImpl.TraverserMethods[A, CC], GraphTraversalImpl.FluentProperties[CC], AnyRef, Any

Known Subclasses

DownUpTraverser, InnerEdgeTraverserImpl, InnerElemTraverserImpl, InnerNodeDownUpTraverserImpl, InnerNodeTraverserImpl, OuterEdgeTraverserImpl, OuterElemTraverserImpl, OuterNodeDownUpTraverserImpl, OuterNodeTraverserImpl

Type Hierarchy

Ordering

Alphabetic
By Inheritance

Inherited

Impl
Traverser
ForeachBasedDetachingIterable
Iterable
IterableFactoryDefaults
IterableOps
IterableOnceOps
IterableOnce
Properties
SubgraphProperties
TraverserMethods
FluentProperties
AnyRef
Any

Implicitly

by iterableOnceExtensionMethods
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc

Hide All
Show All

Visibility

Public
Protected

Type Members

final class Runner[U] extends AnyRef
Contains algorithms and local values to be used by the algorithms.
Contains algorithms and local values to be used by the algorithms. Last target reusability and best possible run-time performance.
Attributes
protected
abstract class StopCondition extends (NodeT, Int, Int) => Boolean
Attributes
protected

Abstract Value Members

abstract def edgeVisitor[U](f: (A) => U): (GraphTraversalImpl.EdgeT) => U
Attributes
protected
Definition Classes
TraverserMethods
abstract def newTraverser: (NodeT, Parameters, GraphTraversalImpl.NodePredicate, GraphTraversalImpl.EdgePredicate, GraphTraversalImpl.ElemOrdering, Option[GraphTraversalImpl.Weight]) => CC
Attributes
protected
Definition Classes
FluentProperties
abstract def nodeVisitor[U](f: (A) => U): (NodeT) => U
Attributes
protected
Definition Classes
TraverserMethods
abstract def ordering: GraphTraversalImpl.ElemOrdering
$ORD
$ORD
Definition Classes
Properties
abstract def parameters: Parameters
$PARAMETERS
$PARAMETERS
Definition Classes
Properties
abstract def root: NodeT
$ROOT
$ROOT
Definition Classes
Properties
abstract def subgraphEdges: GraphTraversalImpl.EdgePredicate
$SUBGRAPHEDGES
$SUBGRAPHEDGES
Definition Classes
SubgraphProperties
abstract def subgraphNodes: GraphTraversalImpl.NodePredicate
$SUBGRAPHNODES
$SUBGRAPHNODES
Definition Classes
SubgraphProperties

Concrete 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.Impl[A, CC] toany2stringadd[GraphTraversalImpl.Impl[A, CC]] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
final def ++[B >: A](suffix: IterableOnce[B]): Iterable[B]
Definition Classes
IterableOps
Annotations
@inline()
def ->[B](y: B): (GraphTraversalImpl.Impl[A, CC], B)
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toArrowAssoc[GraphTraversalImpl.Impl[A, CC]] 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, start: String, sep: String, end: String): b.type
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
final def addString(b: StringBuilder): b.type
Definition Classes
IterableOnceOps
Annotations
@inline()
final def addString(b: StringBuilder, sep: String): b.type
Definition Classes
IterableOnceOps
Annotations
@inline()
final def apply[U](pred: GraphTraversalImpl.NodePredicate = noNode, visitor: (A) => U = Visitor.empty): Option[NodeT]
Attributes
protected
Definition Classes
Impl → TraverserMethods
final def asInstanceOf[T0]: T0
Definition Classes
Any
def autarkicForeach[U](f: (A) => U): Unit
Attributes
protected
Definition Classes
Traverser → ForeachBasedDetachingIterable
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: Impl.this.type
Attributes
protected
Definition Classes
Iterable → IterableOps
final def collect[B](pf: PartialFunction[A, B]): Iterable[B]
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
final def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
def concat[B >: A](suffix: IterableOnce[B]): Iterable[B]
Definition Classes
IterableOps
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
Definition Classes
IterableOnceOps
def copyToArray[B >: A](xs: Array[B], start: Int): Int
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def copyToArray[B >: A](xs: Array[B]): Int
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
Definition Classes
IterableOnceOps
final def count(p: (A) => Boolean): Int
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
final def drop(n: Int): CC.CC[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
Annotations
@inline()
def dropRight(n: Int): Iterable[A]
Definition Classes
IterableOps
final def dropWhile(p: (A) => Boolean): CC.CC[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
def empty: Iterable[A]
Definition Classes
IterableFactoryDefaults → IterableOps
def ensuring(cond: (GraphTraversalImpl.Impl[A, CC]) => Boolean, msg: => Any): GraphTraversalImpl.Impl[A, CC]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toEnsuring[GraphTraversalImpl.Impl[A, CC]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (GraphTraversalImpl.Impl[A, CC]) => Boolean): GraphTraversalImpl.Impl[A, CC]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toEnsuring[GraphTraversalImpl.Impl[A, CC]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: => Any): GraphTraversalImpl.Impl[A, CC]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toEnsuring[GraphTraversalImpl.Impl[A, CC]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): GraphTraversalImpl.Impl[A, CC]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toEnsuring[GraphTraversalImpl.Impl[A, CC]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(arg0: AnyRef): Boolean
Definition Classes
AnyRef → Any
final def exists(p: (A) => Boolean): Boolean
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
final def filter(p: (A) => Boolean): CC.CC[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
Annotations
@inline()
final def filterNot(p: (A) => Boolean): CC.CC[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
Annotations
@inline()
final def find(p: (A) => Boolean): Option[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
final def findConnected[U](pred: GraphTraversalImpl.NodePredicate)(implicit visitor: (A) => U = empty): Option[NodeT]
Finds a node connected with root by any number of edges with any direction for which the predicate pred holds $CONSIDERING For directed or mixed graphs the node to be found is weakly connected with this node.
Finds a node connected with root by any number of edges with any direction for which the predicate pred holds $CONSIDERING For directed or mixed graphs the node to be found is weakly connected with this node. root itself does not count as a match. This is also true if it has a hook. If several connected nodes exist with pred the algorithm selects any one of these.
pred
The predicate which must hold true for the resulting node.
visitor
$OPTVISITOR
returns
A node with the predicate pred or None if either
1. there is no node with pred or
2. there exists no connection to such a node or
3. there exists a connection to such a node but due to withSubgraph settings this path was out of scope.
Definition Classes
TraverserMethods
final def findCycle[U](implicit visitor: (A) => U = Visitor.empty): Option[GraphTraversalImpl.Cycle]
Finds a cycle starting the search at root $INTOACC, if any.
Finds a cycle starting the search at root $INTOACC, if any. The resulting cycle may start at any node connected with this node.
visitor
$OPTVISITOR
returns
A cycle or None if either
1. there exists no cycle in the component depicting by root or
2. there exists a cycle in the component but due to withSubgraph settings this path was out of scope.
Definition Classes
Impl → TraverserMethods
final def findPredecessor[U](pred: GraphTraversalImpl.NodePredicate)(implicit visitor: (A) => U = empty): Option[NodeT]
Finds a predecessor of root for which the predicate pred holds $CONSIDERING root itself does not count as a match.
Finds a predecessor of root for which the predicate pred holds $CONSIDERING root itself does not count as a match. This is also true if it has a hook. If several predecessors exist the algorithm selects the first of them found.
pred
The predicate which must hold true for the resulting node.
visitor
$OPTVISITOR
returns
A node with the predicate pred or None if either
1. there is no node with pred or
2. there exists no path from such a node to this node or
3. there exists a path from such a node to root but due to withSubgraph settings this path was out of scope.
Definition Classes
TraverserMethods
final def findSuccessor[U](pred: GraphTraversalImpl.NodePredicate)(implicit visitor: (A) => U = empty): Option[NodeT]
Finds a successor of root for which the predicate pred holds $CONSIDERING root itself does not count as a match.
Finds a successor of root for which the predicate pred holds $CONSIDERING root itself does not count as a match. This is also true if it has a hook. If several successors holding pred exist any one of them may be returned.
pred
The predicate which must hold for the resulting node.
visitor
$OPTVISITOR
returns
A node with the predicate pred or None if either
1. there is no node with pred or
2. there exists no path to such a node or
3. there exists a path to such a node but due to withSubgraph settings this path was out of scope.
Definition Classes
TraverserMethods
final def flatMap[B](f: (A) => IterableOnce[B]): Iterable[B]
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
def flatten[B](implicit asIterable: (A) => IterableOnce[B]): Iterable[B]
Definition Classes
IterableOps → IterableOnceOps
def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
Definition Classes
IterableOnceOps
final def foldLeft[B](z: B)(op: (B, A) => B): B
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
def foldRight[B](z: B)(op: (A, B) => B): B
Definition Classes
IterableOnceOps
final def forall(p: (A) => Boolean): Boolean
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
final def foreach[U](f: (A) => U): Unit
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
def fromSpecific(coll: IterableOnce[A]): Iterable[A]
Attributes
protected
Definition Classes
IterableFactoryDefaults → IterableOps
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
def groupBy[K](f: (A) => K): Map[K, Iterable[A]]
Definition Classes
IterableOps
def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, Iterable[B]]
Definition Classes
IterableOps
def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
Definition Classes
IterableOps
def grouped(size: Int): Iterator[Iterable[A]]
Definition Classes
IterableOps
final def hasPredecessor[U](potentialPredecessor: NodeT)(implicit visitor: (A) => U = empty): Boolean
Checks whether potentialPredecessor is a predecessor of root $CONSIDERING Same as isSuccessorOf.
Checks whether potentialPredecessor is a predecessor of root $CONSIDERING Same as isSuccessorOf.
potentialPredecessor
The node which is potentially a predecessor of root.
visitor
$OPTVISITOR
returns
true if a path exists from potentialPredecessor to root and it had not to be excluded due to subgraph properties.
Definition Classes
TraverserMethods
Annotations
@inline()
final def hasSuccessor[U](potentialSuccessor: NodeT)(implicit visitor: (A) => U = empty): Boolean
Checks whether potentialSuccessor is a successor of this node $CONSIDERING Same as isPredecessorOf.
Checks whether potentialSuccessor is a successor of this node $CONSIDERING Same as isPredecessorOf.
potentialSuccessor
The node which is potentially a successor of this node.
visitor
$OPTVISITOR
returns
true if a path exists from this node to potentialSuccessor and it had not to be excluded due to a subgraph* restriction.
Definition Classes
TraverserMethods
Annotations
@inline()
def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
final def head: A
Definition Classes
ForeachBasedDetachingIterable → IterableOps
final def headOption: Option[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOps
def init: Iterable[A]
Definition Classes
IterableOps
def inits: Iterator[Iterable[A]]
Definition Classes
IterableOps
final def isConnectedWith[U](potentialConnected: NodeT)(implicit visitor: (A) => U = empty): Boolean
Checks whether potentialConnected is a node (not necessarily directly) connected with root by any number of edges with any direction $CONSIDERING For directed or mixed graphs it is satisfactory that potentialConnected is weakly connected with root.
Checks whether potentialConnected is a node (not necessarily directly) connected with root by any number of edges with any direction $CONSIDERING For directed or mixed graphs it is satisfactory that potentialConnected is weakly connected with root.
potentialConnected
The node which is potentially connected with root.
visitor
$OPTVISITOR
returns
true if a path exists from this node to potentialConnected and it had not to be excluded due to subgraph properties.
Definition Classes
TraverserMethods
Annotations
@inline()
final def isEmpty: Boolean
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
final def isPredecessorOf[U](potentialSuccessor: NodeT)(implicit visitor: (A) => U = empty): Boolean
Same as hasSuccessor.
Same as hasSuccessor.
Definition Classes
TraverserMethods
Annotations
@inline()
final def isSuccessorOf[U](potentialPredecessor: NodeT)(implicit visitor: (A) => U = empty): Boolean
Same as hasPredecessor.
Same as hasPredecessor.
Definition Classes
TraverserMethods
Annotations
@inline()
def isTraversableAgain: Boolean
Definition Classes
IterableOps → IterableOnceOps
def iterableFactory: IterableFactory[Vector]
Definition Classes
ForeachBasedDetachingIterable → Iterable → IterableOps
def iterator: Iterator[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOnce
def knownSize: Int
Definition Classes
IterableOnce
def last: A
Definition Classes
IterableOps
def lastOption: Option[A]
Definition Classes
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, Impl.this.type]
Definition Classes
Iterable
final def map[B](f: (A) => B): Iterable[B]
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
final def max[B >: A](implicit ord: Ordering[B]): A
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
final def maxBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
final def maxByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
Annotations
@inline()
final def maxOption[B >: A](implicit ord: Ordering[B]): Option[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
Annotations
@inline()
def maxWeight: Option[GraphTraversalImpl.Weight]
$MAXWEIGHT
$MAXWEIGHT
Definition Classes
Properties
final def min[B >: A](implicit ord: Ordering[B]): A
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
Annotations
@inline()
final def minBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
final def minByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
Annotations
@inline()
final def minOption[B >: A](implicit ord: Ordering[B]): Option[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
Annotations
@inline()
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 def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def newSpecificBuilder: Builder[A, Iterable[A]]
Attributes
protected
Definition Classes
IterableFactoryDefaults → IterableOps
def nonEmpty: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
final def nonOverflowingOrderMultipliedBy_2: Int
Attributes
protected
Definition Classes
Traverser
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def partOfCycle[U](implicit visitor: (A) => U = Visitor.empty): Option[GraphTraversalImpl.Cycle]
Finds a cycle that contains root $INTOACC.
Finds a cycle that contains root $INTOACC. Irrespective of the current setting for kind, DepthFirst is used internally.
visitor
$OPTVISITOR
returns
A cycle containing root or None if either
1. there exists no cycle containing root or
2. there exists such a cycle but due to withSubgraph settings this path was out of scope.
Definition Classes
Impl → TraverserMethods
def partition(p: (A) => Boolean): (Iterable[A], Iterable[A])
Definition Classes
IterableOps
def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
Definition Classes
IterableOps
final def pathTo[U](potentialSuccessor: NodeT)(implicit visitor: (A) => U = empty): Option[GraphTraversalImpl.Path]
Finds a path from root to potentialSuccessor $CONSIDERING
Finds a path from root to potentialSuccessor $CONSIDERING
potentialSuccessor
The node a path is to be found to.
visitor
$OPTVISITOR
returns
A path to potentialSuccessor or None if either
1. there is no node with pred or
2. there exists no path to such a node
Definition Classes
TraverserMethods
final def pathUntil[U](pred: GraphTraversalImpl.NodePredicate)(implicit visitor: (A) => U = Visitor.empty): Option[GraphTraversalImpl.Path]
Finds a path from root to a successor of root for which pred holds $CONSIDERING root itself does not count as a match.
Finds a path from root to a successor of root for which pred holds $CONSIDERING root itself does not count as a match. This is also true if it has a hook. If several successors exist the algorithm selects any one of these.
pred
The predicate which must hold true for the successor.
visitor
$OPTVISITOR
returns
A path to a node with the predicate pred or None if either
1. there is no node with pred or
2. there exists no path to such a node or
3. there exists a path to such a node but due to withSubgraph settings this path was out of scope.
Definition Classes
Impl → TraverserMethods
final def pathUntil_[U](pred: GraphTraversalImpl.NodePredicate, visitor: (A) => U = Visitor.empty, maybeHandle: Option[Handle] = None): Option[GraphTraversalImpl.Path]
Attributes
protected[TraverserImpl[N, E]]
final def product[B >: A](implicit num: Numeric[B]): B
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
Annotations
@inline()
final def reduce[B >: A](op: (B, B) => B): B
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
Annotations
@inline()
final def reduceLeft[B >: A](op: (B, A) => B): B
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
final def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
Annotations
@inline()
final def reduceOption[B >: A](op: (B, B) => B): Option[B]
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
Annotations
@inline()
def reduceRight[B >: A](op: (A, B) => B): B
Definition Classes
IterableOnceOps
def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
Definition Classes
IterableOnceOps
final def requireSuccessors[A](block: => A): A
Attributes
protected
Definition Classes
TraverserMethods
def reversed: Iterable[A]
Attributes
protected
Definition Classes
IterableOnceOps
def scan[B >: A](z: B)(op: (B, B) => B): Iterable[B]
Definition Classes
IterableOps
final def scanLeft[B](z: B)(op: (B, A) => B): CC.CC[B]
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
def scanRight[B](z: B)(op: (A, B) => B): Iterable[B]
Definition Classes
IterableOps
final def shortestPathTo[T, U](potentialSuccessor: NodeT, weight: (GraphTraversalImpl.EdgeT) => T, visitor: (A) => U)(implicit arg0: Numeric[T]): Option[GraphTraversalImpl.Path]
Finds the shortest path from root to potentialSuccessor $CONSIDERING The calculation is based on the weight of the edges on the path.
Finds the shortest path from root to potentialSuccessor $CONSIDERING The calculation is based on the weight of the edges on the path. Edges have a default weight of 1L that can be overridden by custom edges. A weight function yielding any numeric type may also be passed to shortestPathTo.
potentialSuccessor
The node the shortest path is to be found to.
weight
Function to determine the weight of edges. If supplied, this function takes precedence over edge weights.
visitor
$OPTVISITOR
returns
The shortest path to potentialSuccessor or None if either
1. there exists no path to potentialSuccessor or
2. there exists a path to potentialSuccessor but due to withSubgraph settings this path was out of scope.
Definition Classes
Impl → TraverserMethods
final def shortestPathTo[T](potentialSuccessor: NodeT, weight: (GraphTraversalImpl.EdgeT) => T)(implicit arg0: Numeric[T]): Option[GraphTraversalImpl.Path]
Finds the shortest path from root to potentialSuccessor $CONSIDERING The calculation is based on the weight of the edges on the path.
Finds the shortest path from root to potentialSuccessor $CONSIDERING The calculation is based on the weight of the edges on the path. Edges have a default weight of 1L that can be overridden by custom edges. A weight function yielding any numeric type may also be passed to shortestPathTo.
potentialSuccessor
The node the shortest path is to be found to.
weight
Function to determine the weight of edges. If supplied, this function takes precedence over edge weights.
returns
The shortest path to potentialSuccessor or None if either
1. there exists no path to potentialSuccessor or
2. there exists a path to potentialSuccessor but due to withSubgraph settings this path was out of scope.
Definition Classes
TraverserMethods
Annotations
@inline()
final def shortestPathTo[U](potentialSuccessor: NodeT)(implicit visitor: (A) => U = empty): Option[GraphTraversalImpl.Path]
Finds the shortest path from root to potentialSuccessor $CONSIDERING The calculation is based on the weight of the edges on the path.
Finds the shortest path from root to potentialSuccessor $CONSIDERING The calculation is based on the weight of the edges on the path. Edges have a default weight of 1L that can be overridden by custom edges. A weight function yielding any numeric type may also be passed to shortestPathTo.
potentialSuccessor
The node the shortest path is to be found to.
visitor
$OPTVISITOR
returns
The shortest path to potentialSuccessor or None if either
1. there exists no path to potentialSuccessor or
2. there exists a path to potentialSuccessor but due to withSubgraph settings this path was out of scope.
Definition Classes
TraverserMethods
Annotations
@inline()
final def size: Int
Definition Classes
ForeachBasedDetachingIterable → 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()
final def slice(from: Int, until: Int): CC.CC[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
def sliding(size: Int, step: Int): Iterator[Iterable[A]]
Definition Classes
IterableOps
def sliding(size: Int): Iterator[Iterable[A]]
Definition Classes
IterableOps
final def span(p: (A) => Boolean): (CC.CC[A], CC.CC[A])
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
final def splitAt(n: Int): (CC.CC[A], CC.CC[A])
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
Definition Classes
IterableOnce
def stringPrefix: String
Attributes
protected[this]
Definition Classes
Iterable
Annotations
@deprecatedOverriding()
final def strongComponents[U](implicit visitor: (A) => U = Visitor.empty): Iterable[GraphTraversalImpl.Component]
Finds all strongly connected components reachable from this node.
Finds all strongly connected components reachable from this node. $SEEFLUENT
visitor
Function to be called for each inner node or inner edge visited during the search.
Definition Classes
Impl → TraverserMethods
final def sum[B >: A](implicit num: Numeric[B]): B
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
Annotations
@inline()
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
def tail: Iterable[A]
Definition Classes
IterableOps
def tails: Iterator[Iterable[A]]
Definition Classes
IterableOps
final def take(n: Int): Iterable[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
def takeRight(n: Int): Iterable[A]
Definition Classes
IterableOps
final def takeWhile(p: (A) => Boolean): CC.CC[A]
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
def tapEach[U](f: (A) => U): Iterable[A]
Definition Classes
IterableOps → IterableOnceOps
final def to[CC[N, E <: Edge[N]] <: AnyGraph[N, E] with GraphLike[N, E, CC]](factory: GenericGraphCoreFactory[CC]): CC[N, E]
Completes a traversal and creates a new connected graph populated with the elements visited.
Completes a traversal and creates a new connected graph populated with the elements visited.
Definition Classes
Traverser
final def to[C1](factory: Factory[A, C1]): C1
Definition Classes
ForeachBasedDetachingIterable → IterableOnceOps
def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
Definition Classes
IterableOnceOps
final def toBuffer[B >: A]: Buffer[B]
Definition Classes
IterableOnceOps
Annotations
@inline()
def toIndexedSeq: IndexedSeq[A]
Definition Classes
IterableOnceOps
final def toInnerElemTraverser(root: NodeT): GraphTraversalImpl.InnerElemTraverser
Definition Classes
FluentProperties
def toList: List[A]
Definition Classes
IterableOnceOps
def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
Definition Classes
IterableOnceOps
def toSeq: Seq[A]
Definition Classes
IterableOnceOps
def toSet[B >: A]: Set[B]
Definition Classes
IterableOnceOps
def toString(): String
Definition Classes
Iterable → AnyRef → Any
def toVector: Vector[A]
Definition Classes
IterableOnceOps
final def topologicalSort[U](ignorePredecessors: Boolean = false)(implicit visitor: (GraphTraversalImpl.InnerElem) => U = Visitor.empty): GraphTraversalImpl.TopologicalSort
Sorts the component designated by this node topologically.
Sorts the component designated by this node topologically. Only nodes connected with this node will be included in the resulting topological order. If the graph is known to be connected choose GraphTraversal#topologicalSort instead. $SEEFLUENT
ignorePredecessors
If true, the topological sort will be partial in that it will only include successors of root. withSubgraph restricts the successor nodes to be included but not predecessors that will be excluded in total.
visitor
Function to be called for each inner node or inner edge visited during the sort.
Definition Classes
Impl → TraverserMethods
def transpose[B](implicit asIterable: (A) => Iterable[B]): Iterable[Iterable[B]]
Definition Classes
IterableOps
def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Iterable[A1], Iterable[A2])
Definition Classes
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
Definition Classes
IterableOps
def view: View[A]
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 weakComponent[U](implicit visitor: (A) => U = Visitor.empty): GraphTraversalImpl.Component
Determines the weak component that contains this node.
Determines the weak component that contains this node. $SEEFLUENT
visitor
Function to be called for each inner node or inner edge visited during the search.
Definition Classes
Impl → TraverserMethods
final def withDirection(direction: Direction): CC
Creates a new FluentProperties based on this except for an updated direction.
Creates a new FluentProperties based on this except for an updated direction. Note that methods returning a Cycle or Path accept only Successors.
Definition Classes
FluentProperties
def withFilter(p: (A) => Boolean): WithFilter[A, Iterable]
Definition Classes
IterableOps
final def withKind(kind: Kind): CC
Creates a new FluentProperties based on this except for an updated kind.
Creates a new FluentProperties based on this except for an updated kind.
Definition Classes
FluentProperties
final def withMaxDepth(maxDepth: Int): CC
Creates a new FluentProperties based on this except for an updated maxDepth.
Creates a new FluentProperties based on this except for an updated maxDepth.
Definition Classes
FluentProperties
final def withMaxWeight(max: Long): CC
Creates a new FluentProperties based on this except for an updated maxWeight having the given max and the default weight function returning edge.weight.
Creates a new FluentProperties based on this except for an updated maxWeight having the given max and the default weight function returning edge.weight.
Definition Classes
FluentProperties
final def withMaxWeight[W](max: W, edgeWeight: (GraphTraversalImpl.EdgeT) => W)(implicit arg0: Numeric[W]): CC
Creates a new FluentProperties based on this except for an updated maxWeight having the given max value and the given weight function.
Creates a new FluentProperties based on this except for an updated maxWeight having the given max value and the given weight function.
Definition Classes
FluentProperties
def withMaxWeight(maxWeight: Option[GraphTraversalImpl.Weight]): CC
Creates a new FluentProperties based on this except for an updated maxWeight.
Creates a new FluentProperties based on this except for an updated maxWeight.
Definition Classes
FluentProperties
final def withOrdering(ordering: GraphTraversalImpl.ElemOrdering): CC
Creates a new FluentProperties based on this except for an updated ordering.
Creates a new FluentProperties based on this except for an updated ordering.
Definition Classes
FluentProperties
final def withParameters(parameters: Parameters): CC
Creates a new FluentProperties based on this except for an updated parameters.
Creates a new FluentProperties based on this except for an updated parameters.
Definition Classes
FluentProperties
final def withRoot(root: NodeT): CC
Creates a new FluentProperties based on this except for an updated root.
Creates a new FluentProperties based on this except for an updated root.
Definition Classes
TraverserMethods
final def withSubgraph(nodes: GraphTraversalImpl.NodePredicate = anyNode, edges: GraphTraversalImpl.EdgePredicate = anyEdge): CC
Creates a new FluentProperties based on this except for an updated subgraphNodes and/or subgraphEdges.
Creates a new FluentProperties based on this except for an updated subgraphNodes and/or subgraphEdges.
Definition Classes
FluentProperties
def zip[B](that: IterableOnce[B]): Iterable[(A, B)]
Definition Classes
IterableOps
def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
Definition Classes
IterableOps
final def zipWithIndex: CC.CC[(A, Int)]
Definition Classes
ForeachBasedDetachingIterable → IterableOps → IterableOnceOps
object Runner
Attributes
protected[collection]
object StopCondition
Attributes
protected

Deprecated Value Members

def ++:[B >: A](that: 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, A) => B): B
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A])./:(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, A) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
def :\[B](z: B)(op: (A, B) => B): B
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).:\(z)(op)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
final def :\[B](z: B)(op: (A, 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, A) => B, combop: (B, B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.
def collectFirst[B](f: PartialFunction[A, B]): Option[B]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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[A]): Unit
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).copyToBuffer(dest)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.copyToBuffer(...) instead
final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use dest ++= coll instead
def count(f: (A) => Boolean): Int
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).count(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.count(...) instead
def exists(f: (A) => Boolean): Boolean
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).exists(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.exists(...) instead
def filter(f: (A) => Boolean): Iterator[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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: (A) => Boolean): Option[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).find(p)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.find instead
def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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, A) => B): B
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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: (A, B) => B): B
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).foldRight(z)(op)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.foldRight instead
def forall(f: (A) => Boolean): Boolean
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).forall(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.forall(...) instead
def foreach[U](f: (A) => U): Unit
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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.Impl[A, CC] toStringFormat[GraphTraversalImpl.Impl[A, CC]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@deprecated @inline()
Deprecated
(Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.
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.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).isEmpty
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.isEmpty instead
def map[B](f: (A) => B): IterableOnce[B]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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[A]): A
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).max(ord)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.max instead
def maxBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).maxBy(f)(cmp)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.maxBy(...) instead
def min(implicit ord: Ordering[A]): A
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).min(ord)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.min instead
def minBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).nonEmpty
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.nonEmpty instead
def product(implicit num: Numeric[A]): A
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).product(num)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.product instead
def reduce(f: (A, A) => A): A
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).reduce(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduce(...) instead
def reduceLeft(f: (A, A) => A): A
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).reduceLeft(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceLeft(...) instead
def reduceLeftOption(f: (A, A) => A): Option[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).reduceLeftOption(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead
def reduceOption(f: (A, A) => A): Option[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).reduceOption(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceOption(...) instead
def reduceRight(f: (A, A) => A): A
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).reduceRight(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceRight(...) instead
def reduceRightOption(f: (A, A) => A): Option[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).reduceRightOption(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.reduceRightOption(...) instead
final def repr: Iterable[A]
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: IterableOnce[B]): Boolean
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.sameElements instead
def seq: Impl.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.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).size
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.size instead
def sum(implicit num: Numeric[A]): A
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).sum(num)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.sum instead
def to[C1](factory: Factory[A, C1]): C1
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).toBuffer
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead
def toIndexedSeq: IndexedSeq[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).toIndexedSeq
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.toIndexedSeq instead
final def toIterable: Iterable[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).toIterable
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
final def toIterable: Impl.this.type
Definition Classes
Iterable → IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections
def toIterator: Iterator[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).toIterator
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator instead
final def toIterator: Iterator[A]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
def toList: List[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).toList
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.to(List) instead
def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).toMap(ev)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.to(Map) instead
def toSeq: Seq[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).toSet
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(Set) instead
def toStream: Stream[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).toStream
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(LazyList) instead
final def toStream: Stream[A]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
final def toTraversable: Traversable[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).toTraversable
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator.to(Iterable) instead
final def toTraversable: Traversable[A]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections
def toVector: Vector[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).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[A]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)
def withFilter(f: (A) => Boolean): Iterator[A]
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toIterableOnceExtensionMethods[A] 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:
(impl: IterableOnceExtensionMethods[A]).withFilter(f)
Definition Classes
IterableOnceExtensionMethods
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .iterator.withFilter(...) instead
def →[B](y: B): (GraphTraversalImpl.Impl[A, CC], B)
Implicit
This member is added by an implicit conversion from GraphTraversalImpl.Impl[A, CC] toArrowAssoc[GraphTraversalImpl.Impl[A, CC]] 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.

Packages

Impl

trait Impl[A, +CC <: GraphTraversalImpl.Traverser[A, CC] with GraphTraversalImpl.Impl[A, CC]] extends GraphTraversalImpl.TraverserMethods[A, CC] with GraphTraversalImpl.Traverser[A, CC]

Type Members

Abstract Value Members

Concrete Value Members

Deprecated Value Members

Inherited from GraphTraversalImpl.Traverser[A, CC]

Inherited from ForeachBasedDetachingIterable[A]

Inherited from Iterable[A]

Inherited from IterableFactoryDefaults[A, Iterable]

Inherited from IterableOps[A, Iterable, Iterable[A]]

Inherited from IterableOnceOps[A, Iterable, Iterable[A]]

Inherited from IterableOnce[A]

Inherited from GraphTraversalImpl.Properties

Inherited from GraphTraversalImpl.SubgraphProperties

Inherited from GraphTraversalImpl.TraverserMethods[A, CC]

Inherited from GraphTraversalImpl.FluentProperties[CC]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromGraphTraversalImpl.Impl[A, CC] to IterableOnceExtensionMethods[A]

Inherited by implicit conversion any2stringadd fromGraphTraversalImpl.Impl[A, CC] to any2stringadd[GraphTraversalImpl.Impl[A, CC]]

Inherited by implicit conversion StringFormat fromGraphTraversalImpl.Impl[A, CC] to StringFormat[GraphTraversalImpl.Impl[A, CC]]

Inherited by implicit conversion Ensuring fromGraphTraversalImpl.Impl[A, CC] to Ensuring[GraphTraversalImpl.Impl[A, CC]]

Inherited by implicit conversion ArrowAssoc fromGraphTraversalImpl.Impl[A, CC] to ArrowAssoc[GraphTraversalImpl.Impl[A, CC]]

Ungrouped

Packages

Impl

trait Impl[A, +CC <: GraphTraversalImpl.Traverser[A, CC] with GraphTraversalImpl.Impl[A, CC]] extends GraphTraversalImpl.TraverserMethods[A, CC] with GraphTraversalImpl.Traverser[A, CC]

Type Members

Abstract Value Members

Concrete Value Members

Deprecated Value Members

Inherited from GraphTraversalImpl.Traverser[A, CC]

Inherited from ForeachBasedDetachingIterable[A]

Inherited from Iterable[A]

Inherited from IterableFactoryDefaults[A, Iterable]

Inherited from IterableOps[A, Iterable, Iterable[A]]

Inherited from IterableOnceOps[A, Iterable, Iterable[A]]

Inherited from IterableOnce[A]

Inherited from GraphTraversalImpl.Properties

Inherited from GraphTraversalImpl.SubgraphProperties

Inherited from GraphTraversalImpl.TraverserMethods[A, CC]

Inherited from GraphTraversalImpl.FluentProperties[CC]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromGraphTraversalImpl.Impl[A, CC] to IterableOnceExtensionMethods[A]

Inherited by implicit conversion any2stringadd fromGraphTraversalImpl.Impl[A, CC] to any2stringadd[GraphTraversalImpl.Impl[A, CC]]

Inherited by implicit conversion StringFormat fromGraphTraversalImpl.Impl[A, CC] to StringFormat[GraphTraversalImpl.Impl[A, CC]]

Inherited by implicit conversion Ensuring fromGraphTraversalImpl.Impl[A, CC] to Ensuring[GraphTraversalImpl.Impl[A, CC]]

Inherited by implicit conversion ArrowAssoc fromGraphTraversalImpl.Impl[A, CC] to ArrowAssoc[GraphTraversalImpl.Impl[A, CC]]

Ungrouped

Impl