TreeTable-scala/de.sciss.treetable/TreeTable/selection/paths

paths

object paths extends SelectionSet[IndexedSeq[A]]
class SelectionSet[IndexedSeq[A]]
class SetWrapper[IndexedSeq[A]]
trait Set[IndexedSeq[A]]
trait SetOps[IndexedSeq[A], Set, Set[IndexedSeq[A]]]
trait Shrinkable[IndexedSeq[A]]
trait Builder[IndexedSeq[A], Set[IndexedSeq[A]]]
trait Growable[IndexedSeq[A]]
trait Clearable
trait Cloneable[Set[IndexedSeq[A]]]
trait Cloneable
trait Set[IndexedSeq[A]]
trait Equals
trait SetOps[IndexedSeq[A], Set, Set[IndexedSeq[A]]]
trait IndexedSeq[A] => Boolean
trait Iterable[IndexedSeq[A]]
trait Iterable[IndexedSeq[A]]
trait IterableFactoryDefaults[IndexedSeq[A], Set]
trait IterableOps[IndexedSeq[A], Set, Set[IndexedSeq[A]]]
trait IterableOnceOps[IndexedSeq[A], Set, Set[IndexedSeq[A]]]
trait IterableOnce[IndexedSeq[A]]
class Object
trait Matchable
class Any

Type members

Inherited types

type MoreElem[+B] = IterableOnce[B]

The collection passed to addAll and subtractAll

The collection passed to addAll and subtractAll

Inherited from
SetWrapper

Value members

Concrete methods

override
def addAll(ps: IterableOnce[IndexedSeq[A]]): paths
Definition Classes
Growable
def addOne(p: IndexedSeq[A]): paths
def leadSelection: Option[IndexedSeq[A]]
override
def size: Int
Definition Classes
SelectionSet -> IterableOnceOps
override
def subtractAll(ps: IterableOnce[IndexedSeq[A]]): paths
Definition Classes
Shrinkable
def subtractOne(p: IndexedSeq[A]): paths

Inherited methods

@inline
final
def &(that: Set[IndexedSeq[A]]): Set[IndexedSeq[A]]
Inherited from
SetOps
@inline
final
def &~(that: Set[IndexedSeq[A]]): Set[IndexedSeq[A]]
Inherited from
SetOps
@inline
final
def ++[B >: IndexedSeq[A]](suffix: IterableOnce[B]): Set[B]
Inherited from
IterableOps
@inline
final
def ++(that: IterableOnce[IndexedSeq[A]]): Set[IndexedSeq[A]]
Inherited from
SetOps
@inline
final
def ++=(xs: IterableOnce[IndexedSeq[A]]): paths
Inherited from
Growable
@inline
final
def +=(elem: IndexedSeq[A]): paths
Inherited from
Growable
@inline
final
def --=(xs: IterableOnce[IndexedSeq[A]]): paths
Inherited from
Shrinkable
@inline
final
def -=(elem: IndexedSeq[A]): paths
Inherited from
Shrinkable
def add(elem: IndexedSeq[A]): Boolean
Inherited from
SetOps
@inline
final
def addString(b: StringBuilder): StringBuilder
Inherited from
IterableOnceOps
@inline
final
def addString(b: StringBuilder, sep: String): StringBuilder
Inherited from
IterableOnceOps
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Inherited from
IterableOnceOps
@unspecialized
def andThen[A](g: Boolean => A): IndexedSeq[A] => A
Inherited from
Function1
@inline
final
def apply(elem: IndexedSeq[A]): Boolean
Inherited from
SetOps
def canEqual(that: Any): Boolean
Inherited from
Set
override
def clear(): Unit
Definition Classes
SetWrapper -> Builder -> Clearable
Inherited from
SetWrapper
override
def clone(): Set[IndexedSeq[A]]
Definition Classes
SetOps -> Cloneable -> Object
Inherited from
SetOps
def collect[B](pf: PartialFunction[IndexedSeq[A], B]): Set[B]
Inherited from
IterableOps
def collectFirst[B](pf: PartialFunction[IndexedSeq[A], B]): Option[B]
Inherited from
IterableOnceOps
@unspecialized
def compose[A](g: A => IndexedSeq[A]): A => Boolean
Inherited from
Function1
def concat[B >: IndexedSeq[A]](suffix: IterableOnce[B]): Set[B]
Inherited from
IterableOps
def concat(that: IterableOnce[IndexedSeq[A]]): Set[IndexedSeq[A]]
Inherited from
SetOps
def contains(n: IndexedSeq[A]): Boolean
Inherited from
SelectionSet
def copyToArray[B >: IndexedSeq[A]](xs: Array[B], start: Int, len: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: IndexedSeq[A]](xs: Array[B], start: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: IndexedSeq[A]](xs: Array[B]): Int
Inherited from
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: (IndexedSeq[A], B) => Boolean): Boolean
Inherited from
IterableOnceOps
def count(p: IndexedSeq[A] => Boolean): Int
Inherited from
IterableOnceOps
def diff(that: Set[IndexedSeq[A]]): Set[IndexedSeq[A]]
Inherited from
SetOps
def drop(n: Int): Set[IndexedSeq[A]]
Inherited from
IterableOps
def dropRight(n: Int): Set[IndexedSeq[A]]
Inherited from
IterableOps
def dropWhile(p: IndexedSeq[A] => Boolean): Set[IndexedSeq[A]]
Inherited from
IterableOps
override
def empty: Set[IndexedSeq[A]]
Definition Classes
IterableFactoryDefaults -> IterableOps
Inherited from
IterableFactoryDefaults
override
def equals(that: Any): Boolean
Definition Classes
Set -> Equals -> Any
Inherited from
Set
def exists(p: IndexedSeq[A] => Boolean): Boolean
Inherited from
IterableOnceOps
def filter(pred: IndexedSeq[A] => Boolean): Set[IndexedSeq[A]]
Inherited from
IterableOps
def filterInPlace(p: IndexedSeq[A] => Boolean): paths
Inherited from
SetOps
def filterNot(pred: IndexedSeq[A] => Boolean): Set[IndexedSeq[A]]
Inherited from
IterableOps
def find(p: IndexedSeq[A] => Boolean): Option[IndexedSeq[A]]
Inherited from
IterableOnceOps
def flatMap[B](f: IndexedSeq[A] => IterableOnce[B]): Set[B]
Inherited from
IterableOps
def flatten[B](implicit asIterable: IndexedSeq[A] => IterableOnce[B]): Set[B]
Inherited from
IterableOps
def fold[A1 >: IndexedSeq[A]](z: A1)(op: (A1, A1) => A1): A1
Inherited from
IterableOnceOps
def foldLeft[B](z: B)(op: (B, IndexedSeq[A]) => B): B
Inherited from
IterableOnceOps
def foldRight[B](z: B)(op: (IndexedSeq[A], B) => B): B
Inherited from
IterableOnceOps
def forall(p: IndexedSeq[A] => Boolean): Boolean
Inherited from
IterableOnceOps
def foreach[U](f: IndexedSeq[A] => U): Unit
Inherited from
IterableOnceOps
protected
def fromSpecific(coll: IterableOnce[IndexedSeq[A]]): Set[IndexedSeq[A]]
Inherited from
IterableFactoryDefaults
def groupBy[K](f: IndexedSeq[A] => K): Map[K, Set[IndexedSeq[A]]]
Inherited from
IterableOps
def groupMap[K, B](key: IndexedSeq[A] => K)(f: IndexedSeq[A] => B): Map[K, Set[B]]
Inherited from
IterableOps
def groupMapReduce[K, B](key: IndexedSeq[A] => K)(f: IndexedSeq[A] => B)(reduce: (B, B) => B): Map[K, B]
Inherited from
IterableOps
def grouped(size: Int): Iterator[Set[IndexedSeq[A]]]
Inherited from
IterableOps
override
def hashCode(): Int
Definition Classes
Set -> Any
Inherited from
Set
def head: IndexedSeq[A]
Inherited from
IterableOps
def headOption: Option[IndexedSeq[A]]
Inherited from
IterableOps
def init: Set[IndexedSeq[A]]
Inherited from
IterableOps
def inits: Iterator[Set[IndexedSeq[A]]]
Inherited from
IterableOps
def intersect(that: Set[IndexedSeq[A]]): Set[IndexedSeq[A]]
Inherited from
SetOps
def isEmpty: Boolean
Inherited from
IterableOnceOps
override
def isTraversableAgain: Boolean
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
override
def iterableFactory: IterableFactory[Set]
Definition Classes
Set -> Set -> Iterable -> Iterable -> IterableOps
Inherited from
Set
def iterator: Iterator[IndexedSeq[A]]
Inherited from
SelectionSet
override
def knownSize: Int
Definition Classes
SetOps -> Growable -> IterableOnce
Inherited from
SetOps
def last: IndexedSeq[A]
Inherited from
IterableOps
def lastOption: Option[IndexedSeq[A]]
Inherited from
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[IndexedSeq[A], B, paths]
Inherited from
Iterable
def map[B](f: IndexedSeq[A] => B): Set[B]
Inherited from
IterableOps
def mapResult[NewTo](f: Set[IndexedSeq[A]] => NewTo): Builder[IndexedSeq[A], NewTo]
Inherited from
Builder
def max[B >: IndexedSeq[A]](implicit ord: Ordering[B]): IndexedSeq[A]
Inherited from
IterableOnceOps
def maxBy[B](f: IndexedSeq[A] => B)(implicit cmp: Ordering[B]): IndexedSeq[A]
Inherited from
IterableOnceOps
def maxByOption[B](f: IndexedSeq[A] => B)(implicit cmp: Ordering[B]): Option[IndexedSeq[A]]
Inherited from
IterableOnceOps
def maxOption[B >: IndexedSeq[A]](implicit ord: Ordering[B]): Option[IndexedSeq[A]]
Inherited from
IterableOnceOps
def min[B >: IndexedSeq[A]](implicit ord: Ordering[B]): IndexedSeq[A]
Inherited from
IterableOnceOps
def minBy[B](f: IndexedSeq[A] => B)(implicit cmp: Ordering[B]): IndexedSeq[A]
Inherited from
IterableOnceOps
def minByOption[B](f: IndexedSeq[A] => B)(implicit cmp: Ordering[B]): Option[IndexedSeq[A]]
Inherited from
IterableOnceOps
def minOption[B >: IndexedSeq[A]](implicit ord: Ordering[B]): Option[IndexedSeq[A]]
Inherited from
IterableOnceOps
final protected
def mkIterator[B](xs: IterableOnce[B]): Iterator[B]

Cross-version way for creating an iterator from MoreElem.

Cross-version way for creating an iterator from MoreElem.

Inherited from
SetWrapper
@inline
final
def mkString: String
Inherited from
IterableOnceOps
@inline
final
def mkString(sep: String): String
Inherited from
IterableOnceOps
final
def mkString(start: String, sep: String, end: String): String
Inherited from
IterableOnceOps
protected
def newSpecificBuilder: Builder[IndexedSeq[A], Set[IndexedSeq[A]]]
Inherited from
IterableFactoryDefaults
@deprecatedOverriding(message = "nonEmpty is defined as !isEmpty; override isEmpty instead", since = "2.13.0")
def nonEmpty: Boolean
Inherited from
IterableOnceOps
def partition(p: IndexedSeq[A] => Boolean): (Set[IndexedSeq[A]], Set[IndexedSeq[A]])
Inherited from
IterableOps
def partitionMap[A1, A2](f: IndexedSeq[A] => Either[A1, A2]): (Set[A1], Set[A2])
Inherited from
IterableOps
def product[B >: IndexedSeq[A]](implicit num: Numeric[B]): B
Inherited from
IterableOnceOps
def reduce[B >: IndexedSeq[A]](op: (B, B) => B): B
Inherited from
IterableOnceOps
def reduceLeft[B >: IndexedSeq[A]](op: (B, IndexedSeq[A]) => B): B
Inherited from
IterableOnceOps
def reduceLeftOption[B >: IndexedSeq[A]](op: (B, IndexedSeq[A]) => B): Option[B]
Inherited from
IterableOnceOps
def reduceOption[B >: IndexedSeq[A]](op: (B, B) => B): Option[B]
Inherited from
IterableOnceOps
def reduceRight[B >: IndexedSeq[A]](op: (IndexedSeq[A], B) => B): B
Inherited from
IterableOnceOps
def reduceRightOption[B >: IndexedSeq[A]](op: (IndexedSeq[A], B) => B): Option[B]
Inherited from
IterableOnceOps
def remove(elem: IndexedSeq[A]): Boolean
Inherited from
SetOps
def result(): Set[IndexedSeq[A]]
Inherited from
SetOps
protected
def reversed: Iterable[IndexedSeq[A]]
Inherited from
IterableOnceOps
def scala$collection$mutable$Cloneable$$super$clone(): Object
Inherited from
Cloneable
def scan[B >: IndexedSeq[A]](z: B)(op: (B, B) => B): Set[B]
Inherited from
IterableOps
def scanLeft[B](z: B)(op: (B, IndexedSeq[A]) => B): Set[B]
Inherited from
IterableOps
def scanRight[B](z: B)(op: (IndexedSeq[A], B) => B): Set[B]
Inherited from
IterableOps
def sizeCompare(that: Iterable[_]): Int
Inherited from
IterableOps
def sizeCompare(otherSize: Int): Int
Inherited from
IterableOps
final
def sizeHint(coll: IterableOnce[_], delta: Int): Unit
Inherited from
Builder
def sizeHint(size: Int): Unit
Inherited from
Builder
final
def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit
Inherited from
Builder
@inline
final
def sizeIs: SizeCompareOps
Inherited from
IterableOps
def slice(from: Int, until: Int): Set[IndexedSeq[A]]
Inherited from
IterableOps
def sliding(size: Int, step: Int): Iterator[Set[IndexedSeq[A]]]
Inherited from
IterableOps
def sliding(size: Int): Iterator[Set[IndexedSeq[A]]]
Inherited from
IterableOps
def span(p: IndexedSeq[A] => Boolean): (Set[IndexedSeq[A]], Set[IndexedSeq[A]])
Inherited from
IterableOps
override
def splitAt(n: Int): (Set[IndexedSeq[A]], Set[IndexedSeq[A]])
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[IndexedSeq[A], S]): S
Inherited from
IterableOnce
def subsetOf(that: Set[IndexedSeq[A]]): Boolean
Inherited from
SetOps
def subsets(): Iterator[Set[IndexedSeq[A]]]
Inherited from
SetOps
def subsets(len: Int): Iterator[Set[IndexedSeq[A]]]
Inherited from
SetOps
def sum[B >: IndexedSeq[A]](implicit num: Numeric[B]): B
Inherited from
IterableOnceOps
def tail: Set[IndexedSeq[A]]
Inherited from
IterableOps
def tails: Iterator[Set[IndexedSeq[A]]]
Inherited from
IterableOps
def take(n: Int): Set[IndexedSeq[A]]
Inherited from
IterableOps
def takeRight(n: Int): Set[IndexedSeq[A]]
Inherited from
IterableOps
def takeWhile(p: IndexedSeq[A] => Boolean): Set[IndexedSeq[A]]
Inherited from
IterableOps
override
def tapEach[U](f: IndexedSeq[A] => U): Set[IndexedSeq[A]]
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
def to[C1](factory: Factory[IndexedSeq[A], C1]): C1
Inherited from
IterableOnceOps
def toArray[B >: IndexedSeq[A] : ClassTag]: Array[B]
Inherited from
IterableOnceOps
@inline
final
def toBuffer[B >: IndexedSeq[A]]: Buffer[B]
Inherited from
IterableOnceOps
def toIndexedSeq: IndexedSeq[IndexedSeq[A]]
Inherited from
IterableOnceOps
final
def toIterable: paths
Inherited from
Iterable
def toList: List[IndexedSeq[A]]
Inherited from
IterableOnceOps
def toMap[K, V](implicit ev: IndexedSeq[A] <:< (K, V)): Map[K, V]
Inherited from
IterableOnceOps
def toSeq: Seq[IndexedSeq[A]]
Inherited from
IterableOnceOps
def toSet[B >: IndexedSeq[A]]: Set[B]
Inherited from
IterableOnceOps
override
def toString(): String
Definition Classes
Set -> Function1 -> Iterable -> Any
Inherited from
Set
def toVector: Vector[IndexedSeq[A]]
Inherited from
IterableOnceOps
def transpose[B](implicit asIterable: IndexedSeq[A] => Iterable[B]): Set[Set[B]]
Inherited from
IterableOps
@inline
final
def union(that: Set[IndexedSeq[A]]): Set[IndexedSeq[A]]
Inherited from
SetOps
def unzip[A1, A2](implicit asPair: IndexedSeq[A] => (A1, A2)): (Set[A1], Set[A2])
Inherited from
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: IndexedSeq[A] => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
Inherited from
IterableOps
def update(elem: IndexedSeq[A], included: Boolean): Unit
Inherited from
SetOps
def view: View[IndexedSeq[A]]
Inherited from
IterableOps
def withFilter(p: IndexedSeq[A] => Boolean): WithFilter[IndexedSeq[A], Set]
Inherited from
IterableOps
def zip[B](that: IterableOnce[B]): Set[(IndexedSeq[A], B)]
Inherited from
IterableOps
def zipAll[A1 >: IndexedSeq[A], B](that: Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
Inherited from
IterableOps
def zipWithIndex: Set[(IndexedSeq[A], Int)]
Inherited from
IterableOps
@inline
final
def |(that: Set[IndexedSeq[A]]): Set[IndexedSeq[A]]
Inherited from
SetOps

Deprecated and Inherited methods

@deprecated(message = "Use ++ with an explicit collection argument instead of + with varargs", since = "2.13.0")
def +(elem1: IndexedSeq[A], elem2: IndexedSeq[A], elems: IndexedSeq[A]*): Set[IndexedSeq[A]]
Deprecated
[Since version 2.13.0] Use ++ with an explicit collection argument instead of + with varargs
Inherited from
SetOps
@deprecated(message = "Consider requiring an immutable Set or fall back to Set.union", since = "2.13.0")
def +(elem: IndexedSeq[A]): Set[IndexedSeq[A]]
Deprecated
[Since version 2.13.0] Consider requiring an immutable Set or fall back to Set.union
Inherited from
SetOps
@deprecated(message = "Use ++ instead of ++: for collections of type Iterable", since = "2.13.0")
def ++:[B >: IndexedSeq[A]](that: IterableOnce[B]): Set[B]
Deprecated
[Since version 2.13.0] Use ++ instead of ++: for collections of type Iterable
Inherited from
IterableOps
@inline @deprecated(message = "Use `++=` aka `addAll` instead of varargs `+=`; infix operations with an operand of multiple args will be deprecated", since = "2.13.0")
final
def +=(elem1: IndexedSeq[A], elem2: IndexedSeq[A], elems: IndexedSeq[A]*): paths
Deprecated
[Since version 2.13.0] Use `++=` aka `addAll` instead of varargs `+=`; infix operations with an operand of multiple args will be deprecated
Inherited from
Growable
@deprecated(message = "Use &- with an explicit collection argument instead of - with varargs", since = "2.13.0")
def -(elem1: IndexedSeq[A], elem2: IndexedSeq[A], elems: IndexedSeq[A]*): Set[IndexedSeq[A]]
Deprecated
[Since version 2.13.0] Use &- with an explicit collection argument instead of - with varargs
Inherited from
SetOps
@deprecated(message = "Consider requiring an immutable Set or fall back to Set.diff", since = "2.13.0")
def -(elem: IndexedSeq[A]): Set[IndexedSeq[A]]
Deprecated
[Since version 2.13.0] Consider requiring an immutable Set or fall back to Set.diff
Inherited from
SetOps
@deprecated(message = "Consider requiring an immutable Set", since = "2.13.0")
def --(that: IterableOnce[IndexedSeq[A]]): Set[IndexedSeq[A]]
Deprecated
[Since version 2.13.0] Consider requiring an immutable Set
Inherited from
SetOps
@deprecated(message = "Use `--=` aka `subtractAll` instead of varargs `-=`; infix operations with an operand of multiple args will be deprecated", since = "2.13.3")
def -=(elem1: IndexedSeq[A], elem2: IndexedSeq[A], elems: IndexedSeq[A]*): paths
Deprecated
[Since version 2.13.3] Use `--=` aka `subtractAll` instead of varargs `-=`; infix operations with an operand of multiple args will be deprecated
Inherited from
Shrinkable
@inline @deprecated(message = "Use foldLeft instead of /:", since = "2.13.0")
final
def /:[B](z: B)(op: (B, IndexedSeq[A]) => B): B
Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from
IterableOnceOps
@inline @deprecated(message = "Use foldRight instead of :\\", since = "2.13.0")
final
def :\[B](z: B)(op: (IndexedSeq[A], B) => B): B
Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from
IterableOnceOps
@deprecated(message = "`aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.", since = "2.13.0")
def aggregate[B](z: => B)(seqop: (B, IndexedSeq[A]) => B, combop: (B, B) => B): B
Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from
IterableOnceOps
@inline @deprecatedOverriding(message = "Use iterableFactory instead", since = "2.13.0") @deprecated(message = "Use iterableFactory instead", since = "2.13.0")
def companion: IterableFactory[Set]
Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from
IterableOps
@inline @deprecated(message = "Use `dest ++= coll` instead", since = "2.13.0")
final
def copyToBuffer[B >: IndexedSeq[A]](dest: Buffer[B]): Unit
Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from
IterableOnceOps
@deprecated(message = "Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)", since = "2.13.0")
def hasDefiniteSize: Boolean
Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from
IterableOnceOps
@deprecated(message = "Use coll instead of repr in a collection implementation, use the collection value itself from the outside", since = "2.13.0")
final
def repr: Set[IndexedSeq[A]]
Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from
IterableOps
@inline @deprecated(message = "Use filterInPlace instead", since = "2.13.0")
final
def retain(p: IndexedSeq[A] => Boolean): Unit
Deprecated
[Since version 2.13.0] Use filterInPlace instead
Inherited from
SetOps
@deprecated(message = "Iterable.seq always returns the iterable itself", since = "2.13.0")
def seq: paths
Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from
Iterable
@inline @deprecated(message = "Use .iterator instead of .toIterator", since = "2.13.0")
final
def toIterator: Iterator[IndexedSeq[A]]
Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from
IterableOnceOps
@inline @deprecated(message = "Use .to(LazyList) instead of .toStream", since = "2.13.0")
final
def toStream: Stream[IndexedSeq[A]]
Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from
IterableOnceOps
@deprecated(message = "Use toIterable instead", since = "2.13.0")
final
def toTraversable: Iterable[IndexedSeq[A]]
Deprecated
[Since version 2.13.0] Use toIterable instead
Inherited from
IterableOps
@deprecated(message = "Use .view.slice(from, until) instead of .view(from, until)", since = "2.13.0")
def view(from: Int, until: Int): View[IndexedSeq[A]]
Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Inherited from
IterableOps