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

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

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

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

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

Inherited from collection.LinearSeq[A]

Inherited from collection.LinearSeqOps[A, [X]LinearSeq[X], LinearSeq[A]]

Inherited from Seq[A]

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

Inherited from collection.Seq[A]

Inherited from Equals

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

Inherited from PartialFunction[Int, A]

Inherited from (Int) => A

Inherited from Iterable[A]

Inherited from collection.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