Packages

class PathAwareTraversal[A] extends Traversal[A]

Linear Supertypes
Traversal[A], IterableFactoryDefaults[A, Traversal], IterableOps[A, Traversal, Traversal[A]], IterableOnceOps[A, Traversal, Traversal[A]], IterableOnce[A], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PathAwareTraversal
  2. Traversal
  3. IterableFactoryDefaults
  4. IterableOps
  5. IterableOnceOps
  6. IterableOnce
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new PathAwareTraversal(elementsWithPath: IterableOnce[(A, Vector[Any])])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ++[B >: A](suffix: IterableOnce[B]): Traversal[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  6. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  7. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  8. def and(traversals: (Traversal[A]) => Traversal[_]*): Traversal[A]

    Filter step: only preserves elements for which _all of_ the given traversals has at least one result.

    Filter step: only preserves elements for which _all of_ the given traversals has at least one result. Works for arbitrary amount of 'AND' traversals.

    Definition Classes
    Traversal
    Example:
    1. .and(_.label("someLabel"),
           _.has("someProperty"))
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. def cast[B]: Traversal[B]
    Definition Classes
    Traversal
  11. def choose[BranchOn >: Null, NewEnd](on: (Traversal[A]) => Traversal[BranchOn])(options: PartialFunction[BranchOn, (Traversal[A]) => Traversal[NewEnd]]): Traversal[NewEnd]

    Branch step: based on the current element, match on something given a traversal, and provide resulting traversals based on the matched element.

    Branch step: based on the current element, match on something given a traversal, and provide resulting traversals based on the matched element. Allows to implement conditional semantics: if, if/else, if/elseif, if/elseif/else, ...

    BranchOn

    required to be >: Null because the implementation is using null as the default value. I didn't find a better way to implement all semantics with the niceties of PartialFunction, and also yolo...

    NewEnd

    The element type of the resulting traversal

    on

    Traversal to get to what you want to match on

    options

    PartialFunction from the matched element to the resulting traversal

    Definition Classes
    Traversal
    Example:
    1. .choose(_.property(Name)) {
        case "L1" => _.out
        case "R1" => _.repeat(_.out)(_.times(3))
        case _ => _.in
      }
    See also

    LogicalStepsTests

  12. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  13. def coalesce[NewEnd](options: (Traversal[A]) => Traversal[NewEnd]*): Traversal[NewEnd]

    Branch step: evaluates the provided traversals in order and returns the first traversal that emits at least one element.

    Branch step: evaluates the provided traversals in order and returns the first traversal that emits at least one element.

    Definition Classes
    Traversal
    Example:
    1. .coalesce(
        _.out("label1"),
        _.in("label2"),
        _.in("label3")
      )
    See also

    LogicalStepsTests

  14. def coll: Traversal[A]
    Attributes
    protected
    Definition Classes
    Traversal → IterableOps
  15. def collect[B](pf: PartialFunction[A, B]): Traversal[B]
    Definition Classes
    PathAwareTraversal → IterableOps → IterableOnceOps
  16. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    IterableOnceOps
  17. def concat[B >: A](suffix: IterableOnce[B]): Traversal[B]
    Definition Classes
    IterableOps
  18. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  19. def copyToArray[B >: A](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
  20. def copyToArray[B >: A](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
  21. def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  22. def count: Traversal[Int]
    Definition Classes
    Traversal
  23. def count(p: (A) => Boolean): Int
    Definition Classes
    IterableOnceOps
  24. def dedup: Traversal[A]

    Deduplicate elements of this traversal - a.k.a.

    Deduplicate elements of this traversal - a.k.a. distinct, unique, ...

    Definition Classes
    PathAwareTraversalTraversal
  25. def dedupBy(fun: (A) => Any): Traversal[A]
    Definition Classes
    PathAwareTraversalTraversal
  26. def drop(n: Int): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  27. def dropRight(n: Int): Traversal[A]
    Definition Classes
    IterableOps
  28. def dropWhile(p: (A) => Boolean): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  29. val elementsWithPath: IterableOnce[(A, Vector[Any])]
  30. def empty: Traversal[A]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  31. def enablePathTracking: PathAwareTraversal[A]
    Definition Classes
    Traversal
  32. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  33. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  34. def exists(p: (A) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  35. def filter(pred: (A) => Boolean): Traversal[A]
    Definition Classes
    PathAwareTraversal → IterableOps → IterableOnceOps
  36. def filterNot(pred: (A) => Boolean): Traversal[A]
    Definition Classes
    PathAwareTraversal → IterableOps → IterableOnceOps
  37. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  38. def find(p: (A) => Boolean): Option[A]
    Definition Classes
    IterableOnceOps
  39. def flatMap[B](f: (A) => IterableOnce[B]): Traversal[B]
    Definition Classes
    PathAwareTraversal → IterableOps → IterableOnceOps
  40. def flatten[B](implicit asIterable: (A) => IterableOnce[B]): Traversal[B]
    Definition Classes
    IterableOps → IterableOnceOps
  41. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  42. def foldLeft[B](z: B)(op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
  43. def foldRight[B](z: B)(op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
  44. def forall(p: (A) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  45. def foreach[U](f: (A) => U): Unit
    Definition Classes
    IterableOnceOps
  46. def fromSpecific(coll: IterableOnce[A]): Traversal[A]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  47. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  48. def groupBy[K](f: (A) => K): Map[K, Traversal[A]]
    Definition Classes
    IterableOps
  49. def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, Traversal[B]]
    Definition Classes
    IterableOps
  50. def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  51. def grouped(size: Int): Iterator[Traversal[A]]
    Definition Classes
    IterableOps
  52. def hasNext: Boolean
    Definition Classes
    Traversal
  53. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  54. def head: A
    Definition Classes
    IterableOps
  55. def headOption: Option[A]
    Definition Classes
    IterableOps
  56. def help()(implicit elementType: ClassTag[A]): String

    Print help/documentation based on the current elementType A.

    Print help/documentation based on the current elementType A. Relies on all step extensions being annotated with @TraversalExt / @Doc Note that this works independently of tab completion and implicit conversions in scope - it will simply list all documented steps in the classpath

    Definition Classes
    Traversal
  57. def helpVerbose()(implicit elementType: ClassTag[A]): String
    Definition Classes
    Traversal
  58. def init: Traversal[A]
    Definition Classes
    IterableOps
  59. def inits: Iterator[Traversal[A]]
    Definition Classes
    IterableOps
  60. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  61. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  62. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  63. def iterableFactory: IterableFactory[Traversal]
    Definition Classes
    Traversal → IterableOps
  64. def iterate: Unit
    Definition Classes
    Traversal
  65. val iterator: Iterator[A]
    Definition Classes
    Traversal → IterableOnce
  66. def knownSize: Int
    Definition Classes
    IterableOnce
  67. def l: List[A]

    Execute the traversal and convert the result to a list - shorthand for toList

    Execute the traversal and convert the result to a list - shorthand for toList

    Definition Classes
    Traversal
    Annotations
    @Doc(short = "Execute the traversal and convert the result to a list - shorthand for `toList`", long = help.this.Doc.<init>$default$2, example = help.this.Doc.<init>$default$3)
  68. def last: A
    Definition Classes
    IterableOps
  69. def lastOption: Option[A]
    Definition Classes
    IterableOps
  70. def map[B](f: (A) => B): Traversal[B]
    Definition Classes
    PathAwareTraversal → IterableOps → IterableOnceOps
  71. def mapElements[B](f: (A) => B): Traversal[B]

    overriding to ensure that path tracking remains enabled after steps that instantiate new Traversals

    overriding to ensure that path tracking remains enabled after steps that instantiate new Traversals

    Attributes
    protected
    Definition Classes
    PathAwareTraversalTraversal
  72. def max[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  73. def maxBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  74. def maxByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  75. def maxOption[B >: A](implicit ord: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  76. def min[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  77. def minBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  78. def minByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  79. def minOption[B >: A](implicit ord: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  80. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  81. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  82. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  83. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  84. def newSpecificBuilder: Builder[A, Traversal[A]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  85. def next: A
    Definition Classes
    Traversal
  86. def nextOption: Option[A]
    Definition Classes
    Traversal
  87. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  88. def not(trav: (Traversal[A]) => Traversal[_]): Traversal[A]

    Filter step: only preserves elements if the provided traversal does _not_ have any results.

    Filter step: only preserves elements if the provided traversal does _not_ have any results. alias for

    whereNot
    Definition Classes
    Traversal
  89. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  90. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  91. def or(traversals: (Traversal[A]) => Traversal[_]*): Traversal[A]

    Filter step: only preserves elements for which _at least one of_ the given traversals has at least one result.

    Filter step: only preserves elements for which _at least one of_ the given traversals has at least one result. Works for arbitrary amount of 'OR' traversals.

    Definition Classes
    Traversal
    Example:
    1. .or(_.label("someLabel"),
          _.has("someProperty"))
  92. def partition(p: (A) => Boolean): (Traversal[A], Traversal[A])
    Definition Classes
    IterableOps
  93. def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Traversal[A1], Traversal[A2])
    Definition Classes
    IterableOps
  94. def path: Traversal[Vector[Any]]
    Definition Classes
    PathAwareTraversalTraversal
  95. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  96. def reduce[B >: A](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  97. def reduceLeft[B >: A](op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
  98. def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
    Definition Classes
    IterableOnceOps
  99. def reduceOption[B >: A](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  100. def reduceRight[B >: A](op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
  101. def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  102. def repeat[B >: A](repeatTraversal: (Traversal[A]) => Traversal[B])(implicit behaviourBuilder: (Builder[B]) => Builder[B] = RepeatBehaviour.noop[B]): Traversal[B]

    Repeat the given traversal

    Repeat the given traversal

    By default it will continue repeating until there's no more results, not emit anything along the way, and use depth first search.

    The @param behaviourBuilder allows you to configure end conditions (times/until), whether it should emit elements it passes by, and which search algorithm to use (depth-first or breadth-first).

    Search algorithm: Depth First Search (DFS) vs Breadth First Search (BFS): DFS means the repeat step will go deep before wide. BFS does the opposite: wide before deep. For example, given the graph

    L3 <- L2 <- L1 <- Center -> R1 -> R2 -> R3 -> R4

    DFS will iterate the nodes in the order:

    Center, L1, L2, L3, R1, R2, R3, R4

    BFS will iterate the nodes in the order:

    Center, L1, R1, R1, R2, L3, R3, R4
    Definition Classes
    PathAwareTraversalTraversal
    Example:
    1. .repeat(_.out)                            // repeat until there's no more elements, emit nothing, use DFS
      .repeat(_.out)(_.times(3))                               // perform exactly three repeat iterations
      .repeat(_.out)(_.until(_.property(Name).endsWith("2")))  // repeat until the 'Name' property ends with '2'
      .repeat(_.out)(_.emit)                                   // emit everything along the way
      .repeat(_.out)(_.emit.breadthFirstSearch)                // emit everything, use BFS
      .repeat(_.out)(_.emit(_.property(Name).startsWith("L"))) // emit if the 'Name' property starts with 'L'
    Note

    this works for domain-specific steps as well as generic graph steps - for details please take a look at the examples in RepeatTraversalTests: both .followedBy and .out work.

    See also

    RepeatTraversalTests for more detail and examples for all of the above.

  103. def reversed: Iterable[A]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  104. def scan[B >: A](z: B)(op: (B, B) => B): Traversal[B]
    Definition Classes
    IterableOps
  105. def scanLeft[B](z: B)(op: (B, A) => B): Traversal[B]
    Definition Classes
    IterableOps → IterableOnceOps
  106. def scanRight[B](z: B)(op: (A, B) => B): Traversal[B]
    Definition Classes
    IterableOps
  107. def sideEffect(fun: (A) => Unit): Traversal[A]

    perform side effect without changing the contents of the traversal

    perform side effect without changing the contents of the traversal

    Definition Classes
    Traversal
    Annotations
    @Doc(short = "perform side effect without changing the contents of the traversal", long = help.this.Doc.<init>$default$2, example = help.this.Doc.<init>$default$3)
  108. def sideEffectPF(pf: PartialFunction[A, Unit]): Traversal[A]

    perform side effect without changing the contents of the traversal will only apply the partialFunction if it is defined for the given input - analogous to collect

    perform side effect without changing the contents of the traversal will only apply the partialFunction if it is defined for the given input - analogous to collect

    Definition Classes
    Traversal
  109. def simplePath: Traversal[A]

    Removes all results whose traversal path has repeated objects.

    Removes all results whose traversal path has repeated objects.

    Definition Classes
    PathAwareTraversalTraversal
  110. def size: Int
    Definition Classes
    IterableOnceOps
  111. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  112. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  113. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  114. def slice(from: Int, until: Int): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  115. def sliding(size: Int, step: Int): Iterator[Traversal[A]]
    Definition Classes
    IterableOps
  116. def sliding(size: Int): Iterator[Traversal[A]]
    Definition Classes
    IterableOps
  117. def span(p: (A) => Boolean): (Traversal[A], Traversal[A])
    Definition Classes
    IterableOps → IterableOnceOps
  118. def splitAt(n: Int): (Traversal[A], Traversal[A])
    Definition Classes
    IterableOps → IterableOnceOps
  119. def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
    Definition Classes
    IterableOnce
  120. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  121. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  122. def tail: Traversal[A]
    Definition Classes
    IterableOps
  123. def tails: Iterator[Traversal[A]]
    Definition Classes
    IterableOps
  124. def take(n: Int): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  125. def takeRight(n: Int): Traversal[A]
    Definition Classes
    IterableOps
  126. def takeWhile(p: (A) => Boolean): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  127. def tapEach[U](f: (A) => U): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  128. def to[C1](factory: Factory[A, C1]): C1
    Definition Classes
    IterableOnceOps
  129. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  130. final def toBuffer[B >: A]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  131. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    IterableOnceOps
  132. def toIterable: Iterable[A]
    Definition Classes
    Traversal → IterableOps
  133. def toList: List[A]
    Definition Classes
    IterableOnceOps
  134. def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  135. def toSeq: Seq[A]
    Definition Classes
    IterableOnceOps
  136. def toSet[B >: A]: Set[B]
    Definition Classes
    IterableOnceOps
  137. def toString(): String
    Definition Classes
    Traversal → AnyRef → Any
  138. def toVector: Vector[A]
    Definition Classes
    IterableOnceOps
  139. def transpose[B](implicit asIterable: (A) => Iterable[B]): Traversal[Traversal[B]]
    Definition Classes
    IterableOps
  140. def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Traversal[A1], Traversal[A2])
    Definition Classes
    IterableOps
  141. def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Traversal[A1], Traversal[A2], Traversal[A3])
    Definition Classes
    IterableOps
  142. def view: View[A]
    Definition Classes
    IterableOps
  143. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  144. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  145. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  146. def where(trav: (Traversal[A]) => Traversal[_]): Traversal[A]

    Filter step: only preserves elements if the provided traversal has at least one result.

    Filter step: only preserves elements if the provided traversal has at least one result. inverse:

    not/whereNot
    Definition Classes
    Traversal
  147. def whereNot(trav: (Traversal[A]) => Traversal[_]): Traversal[A]

    Filter step: only preserves elements if the provided traversal does _not_ have any results.

    Filter step: only preserves elements if the provided traversal does _not_ have any results. inverse:

    where
    Definition Classes
    Traversal
  148. def withFilter(p: (A) => Boolean): WithFilter[A, Traversal]
    Definition Classes
    IterableOps
  149. def zip[B](that: IterableOnce[B]): Traversal[(A, B)]
    Definition Classes
    IterableOps
  150. def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): Traversal[(A1, B)]
    Definition Classes
    IterableOps
  151. def zipWithIndex: Traversal[(A, Int)]
    Definition Classes
    IterableOps → IterableOnceOps

Deprecated Value Members

  1. def ++:[B >: A](that: IterableOnce[B]): Traversal[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

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

  2. 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 /:

  3. 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 :\

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

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

    (Since version 2.13.0) Use iterableFactory instead

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

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

  8. final def repr: Traversal[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

  9. final def toIterator: Iterator[A]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  10. final def toStream: Stream[A]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

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

  11. final def toTraversable: Traversable[A]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

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

Inherited from Traversal[A]

Inherited from IterableFactoryDefaults[A, Traversal]

Inherited from IterableOps[A, Traversal, Traversal[A]]

Inherited from IterableOnceOps[A, Traversal, Traversal[A]]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Ungrouped