Packages

abstract class InnerElemTraverser extends TraverserMethods[InnerElem, InnerElemTraverser] with Traverser[InnerElem, InnerElemTraverser]

Controls the properties of inner-element graph traversals. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.

Attributes
protected
Linear Supertypes
Traverser[GraphTraversal.InnerElem, InnerElemTraverser], Iterable[GraphTraversal.InnerElem], IterableFactoryDefaults[GraphTraversal.InnerElem, Iterable], IterableOps[GraphTraversal.InnerElem, Iterable, Iterable[GraphTraversal.InnerElem]], IterableOnceOps[GraphTraversal.InnerElem, Iterable, Iterable[GraphTraversal.InnerElem]], scala.collection.IterableOnce[GraphTraversal.InnerElem], Properties, SubgraphProperties, TraverserMethods[GraphTraversal.InnerElem, InnerElemTraverser], FluentProperties[InnerElemTraverser], AnyRef, Any
Known Subclasses
InnerElemTraverser
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InnerElemTraverser
  2. Traverser
  3. Iterable
  4. IterableFactoryDefaults
  5. IterableOps
  6. IterableOnceOps
  7. IterableOnce
  8. Properties
  9. SubgraphProperties
  10. TraverserMethods
  11. FluentProperties
  12. AnyRef
  13. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by ChainingOps
  3. by EdgeAssoc
  4. by anyToNode
  5. by any2stringadd
  6. by StringFormat
  7. by Ensuring
  8. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new InnerElemTraverser()

Abstract Value Members

  1. abstract def apply[U](pred: GraphTraversal.NodeFilter = noNode, visitor: (GraphTraversal.InnerElem) => U = empty): Option[NodeT]
    Attributes
    protected
    Definition Classes
    TraverserMethods
  2. abstract def edgeVisitor[U](f: (GraphTraversal.InnerElem) => U): (GraphTraversal.EdgeT) => U
    Attributes
    protected
    Definition Classes
    TraverserMethods
  3. abstract def findCycle[U](implicit visitor: (GraphTraversal.InnerElem) => U = empty): Option[Cycle]

    Finds a cycle starting the search at root taking optional properties like subgraph restriction, ordering or maximum depth into account., if any.

    Finds a cycle starting the search at root taking optional properties like subgraph restriction, ordering or maximum depth into account., if any. The resulting cycle may start at any node connected with this node.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    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
    TraverserMethods
  4. abstract def newTraverser: (NodeT, Parameters, GraphTraversal.NodeFilter, GraphTraversal.EdgeFilter, GraphTraversal.ElemOrdering, Option[Weight]) => InnerElemTraverser
    Attributes
    protected
    Definition Classes
    FluentProperties
  5. abstract def nodeVisitor[U](f: (GraphTraversal.InnerElem) => U): (NodeT) => U
    Attributes
    protected
    Definition Classes
    TraverserMethods
  6. abstract def ordering: GraphTraversal.ElemOrdering

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

    Definition Classes
    Properties
  7. abstract def parameters: Parameters

    The properties controlling subsequent traversals.

    The properties controlling subsequent traversals.

    Definition Classes
    Properties
  8. abstract def partOfCycle[U](implicit visitor: (GraphTraversal.InnerElem) => U = empty): Option[Cycle]

    Finds a cycle that contains root taking optional properties like subgraph restriction, ordering or maximum depth into account..

    Finds a cycle that contains root taking optional properties like subgraph restriction, ordering or maximum depth into account.. Irrespective of the current setting for kind, DepthFirst is used internally.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    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
    TraverserMethods
  9. abstract def pathUntil[U](pred: GraphTraversal.NodeFilter)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): Option[Path]

    Finds a path from root to a successor of root for which pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a path from root to a successor of root for which pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. 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

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    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
    TraverserMethods
  10. abstract def root: NodeT

    The node where subsequent graph traversals start.

    The node where subsequent graph traversals start.

    Definition Classes
    Properties
  11. abstract def shortestPathTo[T, U](potentialSuccessor: NodeT, weight: (GraphTraversal.EdgeT) => T, visitor: (GraphTraversal.InnerElem) => U)(implicit arg0: Numeric[T]): Option[Path]

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. 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

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    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
  12. abstract def strongComponents[U](implicit visitor: (GraphTraversal.InnerElem) => U = empty): Iterable[Component]

    Finds all strongly connected components reachable from this node.

    Finds all strongly connected components reachable from this node. See componentTraverser for more control by means of FluentProperties.

    visitor

    Function to be called for each inner node or inner edge visited during the search.

    Definition Classes
    TraverserMethods
  13. abstract def subgraphEdges: GraphTraversal.EdgeFilter

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    Restricts subsequent graph traversals to walk only along edges that hold this predicate.

    Definition Classes
    SubgraphProperties
  14. abstract def subgraphNodes: GraphTraversal.NodeFilter

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    Restricts subsequent graph traversals to visit only nodes holding this predicate.

    Definition Classes
    SubgraphProperties
  15. abstract def topologicalSort[U](ignorePredecessors: Boolean = false)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): CycleNodeOrTopologicalOrder

    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. See componentTraverser for more control by means of FluentProperties.

    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
    TraverserMethods
  16. abstract def weakComponent[U](implicit visitor: (GraphTraversal.InnerElem) => U = empty): Component

    Determines the weak component that contains this node.

    Determines the weak component that contains this node. See componentTraverser for more control by means of FluentProperties.

    visitor

    Function to be called for each inner node or inner edge visited during the search.

    Definition Classes
    TraverserMethods

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toany2stringadd[InnerElemTraverser] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. final def ++[B >: GraphTraversal.InnerElem](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  5. def ->[B](y: B): (InnerElemTraverser, B)
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toArrowAssoc[InnerElemTraverser] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  8. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  9. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  10. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  11. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  12. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  13. final def coll: InnerElemTraverser.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  14. def collect[B](pf: PartialFunction[GraphTraversal.InnerElem, B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  15. def collectFirst[B](pf: PartialFunction[GraphTraversal.InnerElem, B]): Option[B]
    Definition Classes
    IterableOnceOps
  16. def concat[B >: GraphTraversal.InnerElem](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
  17. def copyToArray[B >: GraphTraversal.InnerElem](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  18. def copyToArray[B >: GraphTraversal.InnerElem](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
  19. def copyToArray[B >: GraphTraversal.InnerElem](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
  20. def corresponds[B](that: scala.collection.IterableOnce[B])(p: (GraphTraversal.InnerElem, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  21. def count(p: (GraphTraversal.InnerElem) => Boolean): Int
    Definition Classes
    IterableOnceOps
  22. def drop(n: Int): Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  23. def dropRight(n: Int): Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps
  24. def dropWhile(p: (GraphTraversal.InnerElem) => Boolean): Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  25. def empty: Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  26. def ensuring(cond: (InnerElemTraverser) => Boolean, msg: => Any): InnerElemTraverser
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toEnsuring[InnerElemTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  27. def ensuring(cond: (InnerElemTraverser) => Boolean): InnerElemTraverser
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toEnsuring[InnerElemTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  28. def ensuring(cond: Boolean, msg: => Any): InnerElemTraverser
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toEnsuring[InnerElemTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  29. def ensuring(cond: Boolean): InnerElemTraverser
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toEnsuring[InnerElemTraverser] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  30. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  31. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  32. def exists(p: (GraphTraversal.InnerElem) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  33. def filter(pred: (GraphTraversal.InnerElem) => Boolean): Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  34. def filterNot(pred: (GraphTraversal.InnerElem) => Boolean): Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  35. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  36. def find(p: (GraphTraversal.InnerElem) => Boolean): Option[GraphTraversal.InnerElem]
    Definition Classes
    IterableOnceOps
  37. final def findConnected[U](pred: GraphTraversal.NodeFilter)(implicit visitor: (GraphTraversal.InnerElem) => 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 all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a node connected with root by any number of edges with any direction for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. 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

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    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
  38. final def findPredecessor[U](pred: GraphTraversal.NodeFilter)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): Option[NodeT]

    Finds a predecessor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a predecessor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. 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

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    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
  39. final def findSuccessor[U](pred: GraphTraversal.NodeFilter)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): Option[NodeT]

    Finds a successor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a successor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. 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

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    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
  40. def flatMap[B](f: (GraphTraversal.InnerElem) => scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  41. def flatten[B](implicit asIterable: (GraphTraversal.InnerElem) => scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  42. def fold[A1 >: GraphTraversal.InnerElem](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  43. def foldLeft[B](z: B)(op: (B, GraphTraversal.InnerElem) => B): B
    Definition Classes
    IterableOnceOps
  44. def foldRight[B](z: B)(op: (GraphTraversal.InnerElem, B) => B): B
    Definition Classes
    IterableOnceOps
  45. def forall(p: (GraphTraversal.InnerElem) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  46. def foreach[U](f: (GraphTraversal.InnerElem) => U): Unit
    Definition Classes
    Traverser → IterableOnceOps
  47. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toStringFormat[InnerElemTraverser] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  48. def fromSpecific(coll: scala.collection.IterableOnce[GraphTraversal.InnerElem]): Iterable[GraphTraversal.InnerElem]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  49. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  50. def groupBy[K](f: (GraphTraversal.InnerElem) => K): Map[K, Iterable[GraphTraversal.InnerElem]]
    Definition Classes
    IterableOps
  51. def groupMap[K, B](key: (GraphTraversal.InnerElem) => K)(f: (GraphTraversal.InnerElem) => B): Map[K, Iterable[B]]
    Definition Classes
    IterableOps
  52. def groupMapReduce[K, B](key: (GraphTraversal.InnerElem) => K)(f: (GraphTraversal.InnerElem) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  53. def grouped(size: Int): Iterator[Iterable[GraphTraversal.InnerElem]]
    Definition Classes
    IterableOps
  54. final def hasPredecessor[U](potentialPredecessor: NodeT)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): Boolean

    Checks whether potentialPredecessor is a predecessor of root considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Checks whether potentialPredecessor is a predecessor of root considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. Same as isSuccessorOf.

    potentialPredecessor

    The node which is potentially a predecessor of root.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    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()
  55. final def hasSuccessor[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): Boolean

    Checks whether potentialSuccessor is a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Checks whether potentialSuccessor is a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. Same as isPredecessorOf.

    potentialSuccessor

    The node which is potentially a successor of this node.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    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()
  56. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  57. def head: GraphTraversal.InnerElem
    Definition Classes
    IterableOps
  58. def headOption: Option[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps
  59. def init: Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps
  60. def inits: Iterator[Iterable[GraphTraversal.InnerElem]]
    Definition Classes
    IterableOps
  61. final def isConnectedWith[U](potentialConnected: NodeT)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): Boolean

    Checks whether potentialConnected is a node (not necessarily directly) connected with root by any number of edges with any direction considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Checks whether potentialConnected is a node (not necessarily directly) connected with root by any number of edges with any direction considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. 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

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    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()
  62. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toOuterNode[InnerElemTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  63. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toOuterNode[InnerElemTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  64. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  65. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toOuterNode[InnerElemTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  66. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  67. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toOuterNode[InnerElemTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  68. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toOuterNode[InnerElemTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  69. final def isPredecessorOf[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): Boolean

    Same as hasSuccessor.

    Same as hasSuccessor.

    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  70. final def isSuccessorOf[U](potentialPredecessor: NodeT)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): Boolean

    Same as hasPredecessor.

    Same as hasPredecessor.

    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  71. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  72. def iterableFactory: IterableFactory[Iterable]
    Definition Classes
    Iterable → IterableOps
  73. def iterator: Iterator[GraphTraversal.InnerElem]
    Definition Classes
    Traverser → IterableOnce
  74. def knownSize: Int
    Definition Classes
    IterableOnce
  75. def last: GraphTraversal.InnerElem
    Definition Classes
    IterableOps
  76. def lastOption: Option[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps
  77. def lazyZip[B](that: Iterable[B]): LazyZip2[GraphTraversal.InnerElem, B, InnerElemTraverser.this.type]
    Definition Classes
    Iterable
  78. def map[B](f: (GraphTraversal.InnerElem) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  79. def max[B >: GraphTraversal.InnerElem](implicit ord: Ordering[B]): GraphTraversal.InnerElem
    Definition Classes
    IterableOnceOps
  80. def maxBy[B](f: (GraphTraversal.InnerElem) => B)(implicit cmp: Ordering[B]): GraphTraversal.InnerElem
    Definition Classes
    IterableOnceOps
  81. def maxByOption[B](f: (GraphTraversal.InnerElem) => B)(implicit cmp: Ordering[B]): Option[GraphTraversal.InnerElem]
    Definition Classes
    IterableOnceOps
  82. def maxOption[B >: GraphTraversal.InnerElem](implicit ord: Ordering[B]): Option[GraphTraversal.InnerElem]
    Definition Classes
    IterableOnceOps
  83. def maxWeight: Option[Weight]

    An optional maximum weight that limits the scope of the traversal or search.

    An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.

    Definition Classes
    Properties
  84. def min[B >: GraphTraversal.InnerElem](implicit ord: Ordering[B]): GraphTraversal.InnerElem
    Definition Classes
    IterableOnceOps
  85. def minBy[B](f: (GraphTraversal.InnerElem) => B)(implicit cmp: Ordering[B]): GraphTraversal.InnerElem
    Definition Classes
    IterableOnceOps
  86. def minByOption[B](f: (GraphTraversal.InnerElem) => B)(implicit cmp: Ordering[B]): Option[GraphTraversal.InnerElem]
    Definition Classes
    IterableOnceOps
  87. def minOption[B >: GraphTraversal.InnerElem](implicit ord: Ordering[B]): Option[GraphTraversal.InnerElem]
    Definition Classes
    IterableOnceOps
  88. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  89. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  90. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  91. val n1: InnerElemTraverser
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toEdgeAssoc[InnerElemTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  92. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  93. def newSpecificBuilder: Builder[GraphTraversal.InnerElem, Iterable[GraphTraversal.InnerElem]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  94. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  95. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  96. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  97. def partition(p: (GraphTraversal.InnerElem) => Boolean): (Iterable[GraphTraversal.InnerElem], Iterable[GraphTraversal.InnerElem])
    Definition Classes
    IterableOps
  98. def partitionMap[A1, A2](f: (GraphTraversal.InnerElem) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  99. final def pathTo[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): Option[Path]

    Finds a path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    potentialSuccessor

    The node a path is to be found to.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    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
  100. def pipe[B](f: (InnerElemTraverser) => B): B
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toChainingOps[InnerElemTraverser] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  101. def product[B >: GraphTraversal.InnerElem](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  102. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toOuterNode[InnerElemTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  103. def reduce[B >: GraphTraversal.InnerElem](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  104. def reduceLeft[B >: GraphTraversal.InnerElem](op: (B, GraphTraversal.InnerElem) => B): B
    Definition Classes
    IterableOnceOps
  105. def reduceLeftOption[B >: GraphTraversal.InnerElem](op: (B, GraphTraversal.InnerElem) => B): Option[B]
    Definition Classes
    IterableOnceOps
  106. def reduceOption[B >: GraphTraversal.InnerElem](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  107. def reduceRight[B >: GraphTraversal.InnerElem](op: (GraphTraversal.InnerElem, B) => B): B
    Definition Classes
    IterableOnceOps
  108. def reduceRightOption[B >: GraphTraversal.InnerElem](op: (GraphTraversal.InnerElem, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  109. final def requireSuccessors[A](block: => A): A
    Attributes
    protected
    Definition Classes
    TraverserMethods
  110. def reversed: Iterable[GraphTraversal.InnerElem]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  111. def scan[B >: GraphTraversal.InnerElem](z: B)(op: (B, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  112. def scanLeft[B](z: B)(op: (B, GraphTraversal.InnerElem) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  113. def scanRight[B](z: B)(op: (GraphTraversal.InnerElem, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  114. val self: InnerElemTraverser
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toChainingOps[InnerElemTraverser] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  115. final def shortestPathTo[T](potentialSuccessor: NodeT, weight: (GraphTraversal.EdgeT) => T)(implicit arg0: Numeric[T]): Option[Path]

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. 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()
  116. final def shortestPathTo[U](potentialSuccessor: NodeT)(implicit visitor: (GraphTraversal.InnerElem) => U = empty): Option[Path]

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. 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

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    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()
  117. def size: Int
    Definition Classes
    IterableOnceOps
  118. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  119. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  120. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  121. def slice(from: Int, until: Int): Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  122. def sliding(size: Int, step: Int): Iterator[Iterable[GraphTraversal.InnerElem]]
    Definition Classes
    IterableOps
  123. def sliding(size: Int): Iterator[Iterable[GraphTraversal.InnerElem]]
    Definition Classes
    IterableOps
  124. def span(p: (GraphTraversal.InnerElem) => Boolean): (Iterable[GraphTraversal.InnerElem], Iterable[GraphTraversal.InnerElem])
    Definition Classes
    IterableOps → IterableOnceOps
  125. def splitAt(n: Int): (Iterable[GraphTraversal.InnerElem], Iterable[GraphTraversal.InnerElem])
    Definition Classes
    IterableOps → IterableOnceOps
  126. def stepper[S <: Stepper[_]](implicit shape: StepperShape[GraphTraversal.InnerElem, S]): S
    Definition Classes
    IterableOnce
  127. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
    Annotations
    @deprecatedOverriding("Override className instead", "2.13.0")
  128. def sum[B >: GraphTraversal.InnerElem](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  129. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  130. def tail: Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps
  131. def tails: Iterator[Iterable[GraphTraversal.InnerElem]]
    Definition Classes
    IterableOps
  132. def take(n: Int): Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  133. def takeRight(n: Int): Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps
  134. def takeWhile(p: (GraphTraversal.InnerElem) => Boolean): Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  135. def tap[U](f: (InnerElemTraverser) => U): InnerElemTraverser
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toChainingOps[InnerElemTraverser] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  136. def tapEach[U](f: (GraphTraversal.InnerElem) => U): Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps → IterableOnceOps
  137. def to[C1](factory: Factory[GraphTraversal.InnerElem, C1]): C1
    Definition Classes
    IterableOnceOps
  138. def toArray[B >: GraphTraversal.InnerElem](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  139. final def toBuffer[B >: GraphTraversal.InnerElem]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  140. final def toGraph: Graph[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
  141. def toIndexedSeq: IndexedSeq[GraphTraversal.InnerElem]
    Definition Classes
    IterableOnceOps
  142. final def toInnerElemTraverser(root: NodeT): InnerElemTraverser
    Definition Classes
    FluentProperties
  143. final def toIterable: InnerElemTraverser.this.type
    Definition Classes
    Iterable → IterableOps
  144. def toList: List[GraphTraversal.InnerElem]
    Definition Classes
    IterableOnceOps
  145. def toMap[K, V](implicit ev: <:<[GraphTraversal.InnerElem, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  146. def toSeq: Seq[GraphTraversal.InnerElem]
    Definition Classes
    IterableOnceOps
  147. def toSet[B >: GraphTraversal.InnerElem]: Set[B]
    Definition Classes
    IterableOnceOps
  148. def toString(): String
    Definition Classes
    Iterable → AnyRef → Any
  149. def toVector: Vector[GraphTraversal.InnerElem]
    Definition Classes
    IterableOnceOps
  150. def transpose[B](implicit asIterable: (GraphTraversal.InnerElem) => Iterable[B]): Iterable[Iterable[B]]
    Definition Classes
    IterableOps
  151. def unzip[A1, A2](implicit asPair: (GraphTraversal.InnerElem) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  152. def unzip3[A1, A2, A3](implicit asTriple: (GraphTraversal.InnerElem) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    IterableOps
  153. val value: InnerElemTraverser
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toOuterNode[InnerElemTraverser] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  154. def view: View[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps
  155. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  156. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  157. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  158. final def withDirection(direction: Direction): InnerElemTraverser

    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
  159. def withFilter(p: (GraphTraversal.InnerElem) => Boolean): WithFilter[GraphTraversal.InnerElem, Iterable]
    Definition Classes
    IterableOps
  160. final def withKind(kind: Kind): InnerElemTraverser

    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
  161. final def withMaxDepth(maxDepth: Int): InnerElemTraverser

    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
  162. final def withMaxWeight(max: Long): InnerElemTraverser

    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
  163. final def withMaxWeight[W](max: W, edgeWeight: (GraphTraversal.EdgeT) => W)(implicit arg0: Numeric[W]): InnerElemTraverser

    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
  164. def withMaxWeight(maxWeight: Option[Weight]): InnerElemTraverser

    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
  165. final def withOrdering(ordering: GraphTraversal.ElemOrdering): InnerElemTraverser

    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
  166. final def withParameters(parameters: Parameters): InnerElemTraverser

    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
  167. final def withRoot(root: NodeT): InnerElemTraverser

    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
  168. final def withSubgraph(nodes: GraphTraversal.NodeFilter = anyNode, edges: GraphTraversal.EdgeFilter = anyEdge): InnerElemTraverser

    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
  169. def zip[B](that: scala.collection.IterableOnce[B]): Iterable[(GraphTraversal.InnerElem, B)]
    Definition Classes
    IterableOps
  170. def zipAll[A1 >: GraphTraversal.InnerElem, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Definition Classes
    IterableOps
  171. def zipWithIndex: Iterable[(GraphTraversal.InnerElem, Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  172. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toEdgeAssoc[InnerElemTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  173. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toEdgeAssoc[InnerElemTraverser] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Shadowed Implicit Value Members

  1. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toOuterNode[InnerElemTraverser] 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:
    (innerElemTraverser: OuterNode[InnerElemTraverser]).stringPrefix
    Definition Classes
    NodeParam
  2. def toString(): String
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toOuterNode[InnerElemTraverser] 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:
    (innerElemTraverser: OuterNode[InnerElemTraverser]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

Deprecated Value Members

  1. def ++:[B >: GraphTraversal.InnerElem](that: scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  2. def /:[B](z: B)(op: (B, GraphTraversal.InnerElem) => B): B
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  3. final def /:[B](z: B)(op: (B, GraphTraversal.InnerElem) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  4. def :\[B](z: B)(op: (GraphTraversal.InnerElem, B) => B): B
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  5. final def :\[B](z: B)(op: (GraphTraversal.InnerElem, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  6. def aggregate[B](z: => B)(seqop: (B, GraphTraversal.InnerElem) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  7. def collectFirst[B](f: PartialFunction[GraphTraversal.InnerElem, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.collectFirst(...) instead

  8. def companion: IterableFactory[Iterable]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  9. def copyToBuffer(dest: Buffer[GraphTraversal.InnerElem]): Unit
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

  10. final def copyToBuffer[B >: GraphTraversal.InnerElem](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  11. def count(f: (GraphTraversal.InnerElem) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.count(...) instead

  12. def exists(f: (GraphTraversal.InnerElem) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.exists(...) instead

  13. def filter(f: (GraphTraversal.InnerElem) => Boolean): Iterator[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.filter(...) instead

  14. def find(p: (GraphTraversal.InnerElem) => Boolean): Option[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  15. def flatMap[B](f: (GraphTraversal.InnerElem) => scala.collection.IterableOnce[B]): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

  16. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  17. def foldLeft[B](z: B)(op: (B, GraphTraversal.InnerElem) => B): B
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  18. def foldRight[B](z: B)(op: (GraphTraversal.InnerElem, B) => B): B
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  19. def forall(f: (GraphTraversal.InnerElem) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.forall(...) instead

  20. def foreach[U](f: (GraphTraversal.InnerElem) => U): Unit
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foreach(...) instead

  21. 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)

  22. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  23. def map[B](f: (GraphTraversal.InnerElem) => B): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

  24. def max(implicit ord: Ordering[GraphTraversal.InnerElem]): GraphTraversal.InnerElem
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  25. def maxBy[B](f: (GraphTraversal.InnerElem) => B)(implicit cmp: Ordering[B]): GraphTraversal.InnerElem
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.maxBy(...) instead

  26. def min(implicit ord: Ordering[GraphTraversal.InnerElem]): GraphTraversal.InnerElem
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  27. def minBy[B](f: (GraphTraversal.InnerElem) => B)(implicit cmp: Ordering[B]): GraphTraversal.InnerElem
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.minBy(...) instead

  28. def mkString: String
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  29. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  30. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  31. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  32. def product(implicit num: Numeric[GraphTraversal.InnerElem]): GraphTraversal.InnerElem
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  33. def reduce(f: (GraphTraversal.InnerElem, GraphTraversal.InnerElem) => GraphTraversal.InnerElem): GraphTraversal.InnerElem
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduce(...) instead

  34. def reduceLeft(f: (GraphTraversal.InnerElem, GraphTraversal.InnerElem) => GraphTraversal.InnerElem): GraphTraversal.InnerElem
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

  35. def reduceLeftOption(f: (GraphTraversal.InnerElem, GraphTraversal.InnerElem) => GraphTraversal.InnerElem): Option[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

  36. def reduceOption(f: (GraphTraversal.InnerElem, GraphTraversal.InnerElem) => GraphTraversal.InnerElem): Option[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceOption(...) instead

  37. def reduceRight(f: (GraphTraversal.InnerElem, GraphTraversal.InnerElem) => GraphTraversal.InnerElem): GraphTraversal.InnerElem
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRight(...) instead

  38. def reduceRightOption(f: (GraphTraversal.InnerElem, GraphTraversal.InnerElem) => GraphTraversal.InnerElem): Option[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

  39. final def repr: Iterable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  40. def sameElements[B >: A](that: scala.collection.IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sameElements instead

  41. def seq: InnerElemTraverser.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  42. def size: Int
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  43. def sum(implicit num: Numeric[GraphTraversal.InnerElem]): GraphTraversal.InnerElem
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  44. def to[C1](factory: Factory[GraphTraversal.InnerElem, C1]): C1
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(factory) instead

  45. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  46. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

  47. def toIndexedSeq: IndexedSeq[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  48. final def toIterable: Iterable[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  49. def toIterator: Iterator[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

  50. final def toIterator: Iterator[GraphTraversal.InnerElem]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  51. def toList: List[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(List) instead

  52. def toMap[K, V](implicit ev: <:<[GraphTraversal.InnerElem, (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Map) instead

  53. def toSeq: Seq[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Seq) instead

  54. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Set) instead

  55. def toStream: Stream[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(LazyList) instead

  56. final def toStream: Stream[GraphTraversal.InnerElem]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  57. final def toTraversable: Traversable[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  58. final def toTraversable: Traversable[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  59. def toVector: Vector[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Vector) instead

  60. def view(from: Int, until: Int): View[GraphTraversal.InnerElem]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

  61. def withFilter(f: (GraphTraversal.InnerElem) => Boolean): Iterator[GraphTraversal.InnerElem]
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toIterableOnceExtensionMethods[GraphTraversal.InnerElem] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerElemTraverser: IterableOnceExtensionMethods[GraphTraversal.InnerElem]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.withFilter(...) instead

  62. def →[B](y: B): (InnerElemTraverser, B)
    Implicit
    This member is added by an implicit conversion from InnerElemTraverser toArrowAssoc[InnerElemTraverser] 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.

Inherited from Traverser[GraphTraversal.InnerElem, InnerElemTraverser]

Inherited from Iterable[GraphTraversal.InnerElem]

Inherited from IterableFactoryDefaults[GraphTraversal.InnerElem, Iterable]

Inherited from IterableOps[GraphTraversal.InnerElem, Iterable, Iterable[GraphTraversal.InnerElem]]

Inherited from IterableOnceOps[GraphTraversal.InnerElem, Iterable, Iterable[GraphTraversal.InnerElem]]

Inherited from scala.collection.IterableOnce[GraphTraversal.InnerElem]

Inherited from Properties

Inherited from SubgraphProperties

Inherited from TraverserMethods[GraphTraversal.InnerElem, InnerElemTraverser]

Inherited from FluentProperties[InnerElemTraverser]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods fromInnerElemTraverser to IterableOnceExtensionMethods[GraphTraversal.InnerElem]

Inherited by implicit conversion ChainingOps fromInnerElemTraverser to ChainingOps[InnerElemTraverser]

Inherited by implicit conversion EdgeAssoc fromInnerElemTraverser to EdgeAssoc[InnerElemTraverser]

Inherited by implicit conversion anyToNode fromInnerElemTraverser to OuterNode[InnerElemTraverser]

Inherited by implicit conversion any2stringadd fromInnerElemTraverser to any2stringadd[InnerElemTraverser]

Inherited by implicit conversion StringFormat fromInnerElemTraverser to StringFormat[InnerElemTraverser]

Inherited by implicit conversion Ensuring fromInnerElemTraverser to Ensuring[InnerElemTraverser]

Inherited by implicit conversion ArrowAssoc fromInnerElemTraverser to ArrowAssoc[InnerElemTraverser]

Ungrouped