Scala Standard Library 2.13.1 - scala.collection.LinearSeq (original) (raw)

trait LinearSeq[+A] extends Seq[A] with LinearSeqOps[A, LinearSeq, LinearSeq[A]] with IterableFactoryDefaults[A, LinearSeq]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. LinearSeq
2. LinearSeqOps
3. Seq
4. Equals
5. SeqOps
6. PartialFunction
7. Function1
8. Iterable
9. IterableFactoryDefaults
10. IterableOps
11. IterableOnceOps
12. IterableOnce
13. AnyRef
14. Any

Implicitly

1. by UnliftOps

2. by iterableOnceExtensionMethods

3. by any2stringadd

4. by StringFormat

5. by Ensuring

6. by ArrowAssoc

7. Hide All

8. Show All

Visibility

1. Public
2. Protected

Value Members

1.  final def !=(arg0: Any): Boolean
2.  final def ##(): Int
3.  def +(other: String): String
4.  final def ++[B >: A](suffix: IterableOnce[B]): LinearSeq[B]
5.  final def ++:[B >: A](prefix: IterableOnce[B]): LinearSeq[B]
6.  final def +:[B >: A](elem: B): LinearSeq[B]
7.  def ->[B](y: B): (LinearSeq[A], B)
8.  final def :+[B >: A](elem: B): LinearSeq[B]
9.  final def :++[B >: A](suffix: IterableOnce[B]): LinearSeq[B]
10.  final def ==(arg0: Any): Boolean
11.  final def addString(b: mutable.StringBuilder): mutable.StringBuilder
12.  final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
13.  def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
14.  def andThen[C](k: PartialFunction[A, C]): PartialFunction[Int, C]
15.  def andThen[C](k: (A) => C): PartialFunction[Int, C]
16.  def appended[B >: A](elem: B): LinearSeq[B]
17.  def appendedAll[B >: A](suffix: IterableOnce[B]): LinearSeq[B]
18.  def apply(n: Int): A
19.  def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) => B1): B1
20.  final def asInstanceOf[T0]: T0
21.  def canEqual(that: Any): Boolean
22.  def className: String
23.  def clone(): AnyRef
24.  final def coll: LinearSeq.this.type
25.  def collect[B](pf: PartialFunction[A, B]): LinearSeq[B]
26.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
27.  def combinations(n: Int): Iterator[LinearSeq[A]]
28.  def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, A]
29.  def compose[A](g: (A) => Int): (A) => A
30.  final def concat[B >: A](suffix: IterableOnce[B]): LinearSeq[B]
31.  def contains[A1 >: A](elem: A1): Boolean
32.  def containsSlice[B](that: Seq[B]): Boolean
33.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
34.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
35.  def copyToArray[B >: A](xs: Array[B]): Int
36.  def corresponds[B](that: Seq[B])(p: (A, B) => Boolean): Boolean
37.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
38.  def count(p: (A) => Boolean): Int
39.  def diff[B >: A](that: Seq[B]): LinearSeq[A]
40.  def distinct: LinearSeq[A]
41.  def distinctBy[B](f: (A) => B): LinearSeq[A]
42.  def drop(n: Int): LinearSeq[A]
43.  def dropRight(n: Int): LinearSeq[A]
44.  def dropWhile(p: (A) => Boolean): LinearSeq[A]
45.  def elementWise: ElementWiseExtractor[Int, A]
46.  def empty: LinearSeq[A]
47.  def endsWith[B >: A](that: Iterable[B]): Boolean
48.  def ensuring(cond: (LinearSeq[A]) => Boolean, msg: => Any): LinearSeq[A]
49.  def ensuring(cond: (LinearSeq[A]) => Boolean): LinearSeq[A]
50.  def ensuring(cond: Boolean, msg: => Any): LinearSeq[A]
51.  def ensuring(cond: Boolean): LinearSeq[A]
52.  final def eq(arg0: AnyRef): Boolean
53.  def equals(o: Any): Boolean
54.  def exists(p: (A) => Boolean): Boolean
55.  def filter(pred: (A) => Boolean): LinearSeq[A]
56.  def filterNot(pred: (A) => Boolean): LinearSeq[A]
57.  def finalize(): Unit
58.  def find(p: (A) => Boolean): Option[A]
59.  def findLast(p: (A) => Boolean): Option[A]
60.  def flatMap[B](f: (A) => IterableOnce[B]): LinearSeq[B]
61.  def flatten[B](implicit asIterable: (A) => IterableOnce[B]): LinearSeq[B]
62.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
63.  def foldLeft[B](z: B)(op: (B, A) => B): B
64.  def foldRight[B](z: B)(op: (A, B) => B): B
65.  def forall(p: (A) => Boolean): Boolean
66.  def foreach[U](f: (A) => U): Unit
67.  def formatted(fmtstr: String): String
68.  def fromSpecific(coll: IterableOnce[A]): LinearSeq[A]
69.  final def getClass(): Class[_ <: AnyRef]
70.  def groupBy[K](f: (A) => K): immutable.Map[K, LinearSeq[A]]
71.  def groupMap[K, B](key: (A) => K)(f: (A) => B): immutable.Map[K, LinearSeq[B]]
72.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): immutable.Map[K, B]
73.  def grouped(size: Int): Iterator[LinearSeq[A]]
74.  def hashCode(): Int
75.  def head: A
76.  def headOption: Option[A]
77.  def indexOf[B >: A](elem: B): Int
78.  def indexOf[B >: A](elem: B, from: Int): Int
79.  def indexOfSlice[B >: A](that: Seq[B]): Int
80.  def indexOfSlice[B >: A](that: Seq[B], from: Int): Int
81.  def indexWhere(p: (A) => Boolean, from: Int): Int
82.  def indexWhere(p: (A) => Boolean): Int
83.  def indices: immutable.Range
84.  def init: LinearSeq[A]
85.  def inits: Iterator[LinearSeq[A]]
86.  def intersect[B >: A](that: Seq[B]): LinearSeq[A]
87.  def isDefinedAt(x: Int): Boolean
88.  def isEmpty: Boolean
89.  final def isInstanceOf[T0]: Boolean
90.  def isTraversableAgain: Boolean
91.  def iterableFactory: SeqFactory[LinearSeq]
92.  def iterator: Iterator[A]
93.  def knownSize: Int
94.  def last: A
95.  def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int
96.  def lastIndexOfSlice[B >: A](that: Seq[B]): Int
97.  def lastIndexOfSlice[B >: A](that: Seq[B], end: Int): Int
98.  def lastIndexWhere(p: (A) => Boolean, end: Int): Int
99.  def lastIndexWhere(p: (A) => Boolean): Int
100.  def lastOption: Option[A]
101.  def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, LinearSeq.this.type]
102.  def length: Int
103.  def lengthCompare(that: Iterable[_]): Int
104.  def lengthCompare(len: Int): Int
105.  final def lengthIs: SizeCompareOps
106.  def lift: (Int) => Option[A]
107.  def map[B](f: (A) => B): LinearSeq[B]
108.  def max[B >: A](implicit ord: math.Ordering[B]): A
109.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
110.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
111.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
112.  def min[B >: A](implicit ord: math.Ordering[B]): A
113.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
114.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
115.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
116.  final def mkString: String
117.  final def mkString(sep: String): String
118.  final def mkString(start: String, sep: String, end: String): String
119.  final def ne(arg0: AnyRef): Boolean
120.  def newSpecificBuilder: Builder[A, LinearSeq[A]]
121.  def nonEmpty: Boolean
122.  final def notify(): Unit
123.  final def notifyAll(): Unit
124.  def occCounts[B](sq: Seq[B]): mutable.Map[B, Int]
125.  def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
126.  def padTo[B >: A](len: Int, elem: B): LinearSeq[B]
127.  def partition(p: (A) => Boolean): (LinearSeq[A], LinearSeq[A])
128.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (LinearSeq[A1], LinearSeq[A2])
129.  def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): LinearSeq[B]
130.  def permutations: Iterator[LinearSeq[A]]
131.  def prepended[B >: A](elem: B): LinearSeq[B]
132.  def prependedAll[B >: A](prefix: IterableOnce[B]): LinearSeq[B]
133.  def product[B >: A](implicit num: math.Numeric[B]): B
134.  def reduce[B >: A](op: (B, B) => B): B
135.  def reduceLeft[B >: A](op: (B, A) => B): B
136.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
137.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
138.  def reduceRight[B >: A](op: (A, B) => B): B
139.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
140.  def reverse: LinearSeq[A]
141.  def reverseIterator: Iterator[A]
142.  def reversed: Iterable[A]
143.  def runWith[U](action: (A) => U): (Int) => Boolean
144.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
145.  def scan[B >: A](z: B)(op: (B, B) => B): LinearSeq[B]
146.  def scanLeft[B](z: B)(op: (B, A) => B): LinearSeq[B]
147.  def scanRight[B](z: B)(op: (A, B) => B): LinearSeq[B]
148.  def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
149.  def search[B >: A](elem: B)(implicit ord: Ordering[B]): SearchResult
150.  def segmentLength(p: (A) => Boolean, from: Int): Int
151.  final def segmentLength(p: (A) => Boolean): Int
152.  final def size: Int
153.  final def sizeCompare(that: Iterable[_]): Int
154.  final def sizeCompare(otherSize: Int): Int
155.  final def sizeIs: SizeCompareOps
156.  def slice(from: Int, until: Int): LinearSeq[A]
157.  def sliding(size: Int, step: Int): Iterator[LinearSeq[A]]
158.  def sliding(size: Int): Iterator[LinearSeq[A]]
159.  def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): LinearSeq[A]
160.  def sortWith(lt: (A, A) => Boolean): LinearSeq[A]
161.  def sorted[B >: A](implicit ord: Ordering[B]): LinearSeq[A]
162.  def span(p: (A) => Boolean): (LinearSeq[A], LinearSeq[A])
163.  def splitAt(n: Int): (LinearSeq[A], LinearSeq[A])
164.  def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
165.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
166.  def stringPrefix: String
167.  def sum[B >: A](implicit num: math.Numeric[B]): B
168.  final def synchronized[T0](arg0: => T0): T0
169.  def tail: LinearSeq[A]
170.  def tails: Iterator[LinearSeq[A]]
171.  def take(n: Int): LinearSeq[A]
172.  def takeRight(n: Int): LinearSeq[A]
173.  def takeWhile(p: (A) => Boolean): LinearSeq[A]
174.  def tapEach[U](f: (A) => U): LinearSeq[A]
175.  def to[C1](factory: Factory[A, C1]): C1
176.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
177.  final def toBuffer[B >: A]: Buffer[B]
178.  def toIndexedSeq: immutable.IndexedSeq[A]
179.  final def toIterable: LinearSeq.this.type
180.  def toList: immutable.List[A]
181.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
182.  def toSeq: immutable.Seq[A]
183.  def toSet[B >: A]: immutable.Set[B]
184.  def toString(): String
185.  def toVector: immutable.Vector[A]
186.  def transpose[B](implicit asIterable: (A) => Iterable[B]): LinearSeq[LinearSeq[B]]
187.  def unapply(a: Int): Option[A]
188.  def unlift: PartialFunction[Int, B]
189.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (LinearSeq[A1], LinearSeq[A2])
190.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (LinearSeq[A1], LinearSeq[A2], LinearSeq[A3])
191.  def updated[B >: A](index: Int, elem: B): LinearSeq[B]
192.  def view: SeqView[A]
193.  final def wait(): Unit
194.  final def wait(arg0: Long, arg1: Int): Unit
195.  final def wait(arg0: Long): Unit
196.  def withFilter(p: (A) => Boolean): WithFilter[A, [_]LinearSeq[_]]
197.  def zip[B](that: IterableOnce[B]): LinearSeq[(A, B)]
198.  def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): LinearSeq[(A1, B)]
199.  def zipWithIndex: LinearSeq[(A, Int)]

Deprecated Value Members

1.  def /:[B](z: B)(op: (B, A) => B): B
2.  final def /:[B](z: B)(op: (B, A) => B): B
3.  def :\[B](z: B)(op: (A, B) => B): B
4.  final def :\[B](z: B)(op: (A, B) => B): B
5.  def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
6.  def collectFirst[B](f: PartialFunction[A, B]): Option[B]
7.  def companion: IterableFactory[[_]LinearSeq[_]]
8.  def copyToBuffer(dest: Buffer[A]): Unit
9.  final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
10.  def count(f: (A) => Boolean): Int
11.  def exists(f: (A) => Boolean): Boolean
12.  def filter(f: (A) => Boolean): Iterator[A]
13.  def find(p: (A) => Boolean): Option[A]
14.  def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
15.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
16.  def foldLeft[B](z: B)(op: (B, A) => B): B
17.  def foldRight[B](z: B)(op: (A, B) => B): B
18.  def forall(f: (A) => Boolean): Boolean
19.  def foreach[U](f: (A) => U): Unit
20.  def hasDefiniteSize: Boolean
21.  def isEmpty: Boolean
22.  def map[B](f: (A) => B): IterableOnce[B]
23.  def max(implicit ord: math.Ordering[A]): A
24.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
25.  def min(implicit ord: math.Ordering[A]): A
26.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
27.  def mkString: String
28.  def mkString(sep: String): String
29.  def mkString(start: String, sep: String, end: String): String
30.  def nonEmpty: Boolean
31.  final def prefixLength(p: (A) => Boolean): Int
32.  def product(implicit num: math.Numeric[A]): A
33.  def reduce(f: (A, A) => A): A
34.  def reduceLeft(f: (A, A) => A): A
35.  def reduceLeftOption(f: (A, A) => A): Option[A]
36.  def reduceOption(f: (A, A) => A): Option[A]
37.  def reduceRight(f: (A, A) => A): A
38.  def reduceRightOption(f: (A, A) => A): Option[A]
39.  final def repr: LinearSeq[A]
40.  def reverseMap[B](f: (A) => B): LinearSeq[B]
41.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
42.  def seq: LinearSeq.this.type
43.  def size: Int
44.  def sum(implicit num: math.Numeric[A]): A
45.  def to[C1](factory: Factory[A, C1]): C1
46.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
47.  def toBuffer[B >: A]: Buffer[B]
48.  def toIndexedSeq: IndexedSeq[A]
49.  final def toIterable: Iterable[A]
50.  def toIterator: Iterator[A]
51.  final def toIterator: Iterator[A]
52.  def toList: immutable.List[A]
53.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
54.  def toSeq: immutable.Seq[A]
55.  def toSet[B >: A]: immutable.Set[B]
56.  def toStream: immutable.Stream[A]
57.  final def toStream: immutable.Stream[A]
58.  final def toTraversable: Traversable[A]
59.  final def toTraversable: Traversable[A]
60.  def toVector: immutable.Vector[A]
61.  final def union[B >: A](that: Seq[B]): LinearSeq[B]
62.  def view(from: Int, until: Int): View[A]
63.  def withFilter(f: (A) => Boolean): Iterator[A]
64.  def →[B](y: B): (LinearSeq[A], B)

Inherited from LinearSeqOps[A, LinearSeq, LinearSeq[A]]

Inherited from Seq[A]

Inherited from Equals

Inherited from SeqOps[A, [_]LinearSeq[_], LinearSeq[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) => A

Inherited from Iterable[A]

Inherited from IterableFactoryDefaults[A, [x]LinearSeq[x]]

Inherited from IterableOps[A, [_]LinearSeq[_], LinearSeq[A]]

Inherited from IterableOnceOps[A, [_]LinearSeq[_], LinearSeq[A]]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion UnliftOps fromLinearSeq[A] to UnliftOps[Int, B]

Inherited by implicit conversion iterableOnceExtensionMethods fromLinearSeq[A] to IterableOnceExtensionMethods[A]

Inherited by implicit conversion any2stringadd fromLinearSeq[A] to any2stringadd[LinearSeq[A]]

Inherited by implicit conversion StringFormat fromLinearSeq[A] to StringFormat[LinearSeq[A]]

Inherited by implicit conversion Ensuring fromLinearSeq[A] to Ensuring[LinearSeq[A]]

Inherited by implicit conversion ArrowAssoc fromLinearSeq[A] to ArrowAssoc[LinearSeq[A]]

Ungrouped