class Traversal[+A] extends IterableOnce[A] with IterableOps[A, Traversal, Traversal[A]] with IterableFactoryDefaults[A, Traversal]

TODO more docs

Just like Tinkerpop3 and most other Iterators, a Traversal can only be executed once.

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

Instance Constructors

  1. new Traversal(elements: IterableOnce[A])

Value Members

  1. final def ++[B >: A](suffix: IterableOnce[B]): Traversal[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  2. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  3. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  4. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  5. def aggregate(into: Growable[A]): Traversal[A]

    aggregate all objects at this point into the given collection (side effect)

    aggregate all objects at this point into the given collection (side effect)

    Annotations
    @Doc()
    Example:

    1. val xs = mutable.ArrayBuffer.empty[A]
myTraversal.aggregate(xs).foo.bar
// xs will be filled once `myTraversal` is executed
  6. def and(traversals: (Traversal[A]) => Traversal[_]*): Traversal[A]

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

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

    Annotations
    @Doc()
    Example:

    1. .and(_.label("someLabel"),
     _.has("someProperty"))
  7. def cast[B]: Traversal[B]

    casts all elements to given type note: this can lead to casting errors

    casts all elements to given type note: this can lead to casting errors

    Annotations
    @Doc()
    See also

    collectAll
  8. 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

    Annotations
    @Doc()
    Example:

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

    LogicalStepsTests

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

    Annotations
    @Doc()
    Example:

    1. .coalesce(
  _.out("label1"),
  _.in("label2"),
  _.in("label3")
)
    See also

    LogicalStepsTests

  10. def collect[B](pf: PartialFunction[A, B]): Traversal[B]
    Definition Classes
    IterableOps → IterableOnceOps
  11. def collectAll[B](implicit arg0: ClassTag[B]): Traversal[B]

    collects and all elements of the given type

    collects and all elements of the given type

    Annotations
    @Doc()
  12. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    IterableOnceOps
  13. def concat[B >: A](suffix: IterableOnce[B]): Traversal[B]
    Definition Classes
    IterableOps
  14. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  15. def copyToArray[B >: A](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  16. def copyToArray[B >: A](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  17. def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  18. def count: Traversal[Int]
  19. def count(p: (A) => Boolean): Int
    Definition Classes
    IterableOnceOps
  20. def dedup: Traversal[A]

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

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

    Annotations
    @Doc()
  21. def dedupBy(fun: (A) => Any): Traversal[A]

    deduplicate elements of this traversal by a given function

    deduplicate elements of this traversal by a given function

    Annotations
    @Doc()
  22. def drop(n: Int): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  23. def dropRight(n: Int): Traversal[A]
    Definition Classes
    IterableOps
  24. def dropWhile(p: (A) => Boolean): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  25. def empty: Traversal[A]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  26. def enablePathTracking: PathAwareTraversal[A]
    Annotations
    @Doc()
  27. def exists(p: (A) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  28. def filter(pred: (A) => Boolean): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  29. def filterNot(pred: (A) => Boolean): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  30. def find(p: (A) => Boolean): Option[A]
    Definition Classes
    IterableOnceOps
  31. def flatMap[B](f: (A) => IterableOnce[B]): Traversal[B]
    Definition Classes
    IterableOps → IterableOnceOps
  32. def flatten[B](implicit asIterable: (A) => IterableOnce[B]): Traversal[B]
    Definition Classes
    IterableOps → IterableOnceOps
  33. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  34. def foldLeft[B](z: B)(op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
  35. def foldRight[B](z: B)(op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
  36. def forall(p: (A) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  37. def foreach[U](f: (A) => U): Unit
    Definition Classes
    IterableOnceOps
  38. def groupBy[K](f: (A) => K): Map[K, Traversal[A]]
    Definition Classes
    IterableOps
  39. def groupCount[B](by: (A) => B): Map[B, Int]

    group elements by a given transformation function and count how often the results appear

    group elements by a given transformation function and count how often the results appear

    Annotations
    @Doc()
  40. def groupCount[B >: A]: Map[B, Int]

    group elements and count how often they appear

    group elements and count how often they appear

    Annotations
    @Doc()
  41. def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, Traversal[B]]
    Definition Classes
    IterableOps
  42. def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  43. def grouped(size: Int): Iterator[Traversal[A]]
    Definition Classes
    IterableOps
  44. def hasNext: Boolean
  45. def head: A
    Definition Classes
    IterableOps
  46. def headOption: Option[A]
    Definition Classes
    IterableOps
  47. def help[B >: A](implicit elementType: ClassTag[B], searchPackages: DocSearchPackages): 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 @Traversal / @Doc Note that this works independently of tab completion and implicit conversions in scope - it will simply list all documented steps in the classpath

    Annotations
    @Doc()
  48. def helpVerbose[B >: A](implicit elementType: ClassTag[B], searchPackages: DocSearchPackages): String
    Annotations
    @Doc()
  49. def init: Traversal[A]
    Definition Classes
    IterableOps
  50. def inits: Iterator[Traversal[A]]
    Definition Classes
    IterableOps
  51. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  52. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  53. def iterableFactory: IterableFactory[Traversal]
    Definition Classes
    Traversal → IterableOps
  54. def iterate(): Unit

    Execute the traversal without returning anything

    Execute the traversal without returning anything

    Annotations
    @Doc()
  55. val iterator: Iterator[A]
    Definition Classes
    Traversal → IterableOnce
  56. def knownSize: Int
    Definition Classes
    IterableOnce
  57. 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

    Annotations
    @Doc()
  58. def last: A
    Definition Classes
    IterableOps
  59. def lastOption: Option[A]
    Definition Classes
    IterableOps
  60. def map[B](f: (A) => B): Traversal[B]
    Definition Classes
    IterableOps → IterableOnceOps
  61. def max[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  62. def maxBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  63. def maxByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  64. def maxOption[B >: A](implicit ord: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  65. def min[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  66. def minBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  67. def minByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  68. def minOption[B >: A](implicit ord: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  69. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  70. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  71. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  72. def next(): A
  73. def nextOption(): Option[A]
  74. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  75. def not(trav: (Traversal[A]) => Traversal[_]): Traversal[A]

    only preserves elements if the provided traversal does _not_ have any results - alias for whereNot

    only preserves elements if the provided traversal does _not_ have any results - alias for whereNot

    Annotations
    @Doc()
  76. def or(traversals: (Traversal[A]) => Traversal[_]*): Traversal[A]

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

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

    Annotations
    @Doc()
    Example:

    1. .or(_.label("someLabel"),
    _.has("someProperty"))
  77. def partition(p: (A) => Boolean): (Traversal[A], Traversal[A])
    Definition Classes
    IterableOps
  78. def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Traversal[A1], Traversal[A2])
    Definition Classes
    IterableOps
  79. def path: Traversal[Vector[Any]]

    retrieve entire path that has been traversed thus far prerequisite: enablePathTracking has been called previously

    retrieve entire path that has been traversed thus far prerequisite: enablePathTracking has been called previously

    Annotations
    @Doc()
    Example:

    1. myTraversal.enablePathTracking.out.out.path.toList
  80. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  81. def reduce[B >: A](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  82. def reduceLeft[B >: A](op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
  83. def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
    Definition Classes
    IterableOnceOps
  84. def reduceOption[B >: A](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  85. def reduceRight[B >: A](op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
  86. def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  87. 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
    Annotations
    @Doc()
    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.

  88. def scan[B >: A](z: B)(op: (B, B) => B): Traversal[B]
    Definition Classes
    IterableOps
  89. def scanLeft[B](z: B)(op: (B, A) => B): Traversal[B]
    Definition Classes
    IterableOps → IterableOnceOps
  90. def scanRight[B](z: B)(op: (A, B) => B): Traversal[B]
    Definition Classes
    IterableOps
  91. 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

    Annotations
    @Doc()
  92. 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

    Annotations
    @Doc()
  93. def simplePath: Traversal[A]

    Removes all results whose traversal path has repeated objects.

    Removes all results whose traversal path has repeated objects. prerequisite: 

    enablePathTracking
  94. def size: Int
    Definition Classes
    IterableOnceOps
  95. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  96. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  97. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  98. def slice(from: Int, until: Int): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  99. def sliding(size: Int, step: Int): Iterator[Traversal[A]]
    Definition Classes
    IterableOps
  100. def sliding(size: Int): Iterator[Traversal[A]]
    Definition Classes
    IterableOps
  101. def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): Seq[A]

    sort elements by the value of the given transformation function

    sort elements by the value of the given transformation function

    Annotations
    @Doc()
  102. def sorted[B >: A](implicit ord: Ordering[B]): Seq[B]

    sort elements by their natural order

    sort elements by their natural order

    Annotations
    @Doc()
  103. def span(p: (A) => Boolean): (Traversal[A], Traversal[A])
    Definition Classes
    IterableOps → IterableOnceOps
  104. def splitAt(n: Int): (Traversal[A], Traversal[A])
    Definition Classes
    IterableOps → IterableOnceOps
  105. def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
    Definition Classes
    IterableOnce
  106. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  107. def tail: Traversal[A]
    Definition Classes
    IterableOps
  108. def tails: Iterator[Traversal[A]]
    Definition Classes
    IterableOps
  109. def take(n: Int): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  110. def takeRight(n: Int): Traversal[A]
    Definition Classes
    IterableOps
  111. def takeWhile(p: (A) => Boolean): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  112. def tapEach[U](f: (A) => U): Traversal[A]
    Definition Classes
    IterableOps → IterableOnceOps
  113. def to[C1](factory: Factory[A, C1]): C1
    Definition Classes
    IterableOnceOps
  114. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  115. final def toBuffer[B >: A]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  116. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    IterableOnceOps
  117. def toIterable: Iterable[A]
    Definition Classes
    Traversal → IterableOps
  118. def toList: List[A]
    Definition Classes
    IterableOnceOps
  119. def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  120. def toSeq: Seq[A]
    Definition Classes
    IterableOnceOps
  121. def toSet[B >: A]: Set[B]
    Definition Classes
    IterableOnceOps
  122. def toSetImmutable[B >: A]: Set[B]

    Execute the traversal and convert the result to an immutable Set

  123. def toSetMutable[B >: A]: Set[B]

    Execute the traversal and return a mutable.Set (better performance than immutableSet)

  124. def toString(): String
    Definition Classes
    Traversal → AnyRef → Any
  125. def toVector: Vector[A]
    Definition Classes
    IterableOnceOps
  126. def transpose[B](implicit asIterable: (A) => Iterable[B]): Traversal[Traversal[B]]
    Definition Classes
    IterableOps
  127. def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Traversal[A1], Traversal[A2])
    Definition Classes
    IterableOps
  128. def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Traversal[A1], Traversal[A2], Traversal[A3])
    Definition Classes
    IterableOps
  129. def view: View[A]
    Definition Classes
    IterableOps
  130. def where(trav: (Traversal[A]) => Traversal[_]): Traversal[A]

    only preserves elements if the provided traversal has at least one result

    only preserves elements if the provided traversal has at least one result

    Annotations
    @Doc()
  131. def whereNot(trav: (Traversal[A]) => Traversal[_]): Traversal[A]

    only preserves elements if the provided traversal does _not_ have any results

    only preserves elements if the provided traversal does _not_ have any results

    Annotations
    @Doc()
  132. def withFilter(p: (A) => Boolean): WithFilter[A, Traversal]
    Definition Classes
    IterableOps
  133. def within[B >: A](values: Set[B]): Traversal[A]

    filters out all elements that are _not_ in the provided set

    filters out all elements that are _not_ in the provided set

    Annotations
    @Doc()
  134. def without[B >: A](values: Set[B]): Traversal[A]

    filters out all elements that _are_ in the provided set

    filters out all elements that _are_ in the provided set

    Annotations
    @Doc()
  135. def zip[B](that: IterableOnce[B]): Traversal[(A, B)]
    Definition Classes
    IterableOps
  136. def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): Traversal[(A1, B)]
    Definition Classes
    IterableOps
  137. 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() @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) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  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)