Scala Standard Library 2.13.15 - scala.collection.mutable.ArrayBufferView (original) (raw)

final class ArrayBufferView[A] extends AbstractIndexedSeqView[A]

 

Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. ArrayBufferView
2. AbstractIndexedSeqView
3. IndexedSeqView
4. IndexedSeqOps
5. AbstractSeqView
6. SeqView
7. SeqOps
8. AbstractView
9. View
10. Serializable
11. AbstractIterable
12. Iterable
13. IterableFactoryDefaults
14. IterableOps
15. IterableOnceOps
16. IterableOnce
17. AnyRef
18. Any

Implicitly

1. by iterableOnceExtensionMethods

2. by any2stringadd

3. by StringFormat

4. by Ensuring

5. by ArrowAssoc

6. Hide All

7. Show All

Visibility

1. Public
2. Protected

Instance Constructors

1.  new ArrayBufferView(array: Array[AnyRef], length: Int)

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

Ungrouped