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

sealed abstract class ArraySeq[T] extends AbstractSeq[T] with IndexedSeq[T] with IndexedSeqOps[T, ArraySeq, ArraySeq[T]] with StrictOptimizedSeqOps[T, ArraySeq, ArraySeq[T]] with Serializable

Ordering

  1. Alphabetic
  2. By Inheritance

Inherited

  1. ArraySeq
  2. Serializable
  3. StrictOptimizedSeqOps
  4. StrictOptimizedIterableOps
  5. IndexedSeq
  6. IndexedSeqOps
  7. IndexedSeq
  8. IndexedSeqOps
  9. AbstractSeq
  10. Seq
  11. SeqOps
  12. Cloneable
  13. Cloneable
  14. Iterable
  15. AbstractSeq
  16. Seq
  17. Equals
  18. SeqOps
  19. PartialFunction
  20. Function1
  21. AbstractIterable
  22. Iterable
  23. IterableFactoryDefaults
  24. IterableOps
  25. IterableOnceOps
  26. IterableOnce
  27. AnyRef
  28. Any

Implicitly

  1. by SeqCharSequence

  2. by UnliftOps

  3. by iterableOnceExtensionMethods

  4. by any2stringadd

  5. by StringFormat

  6. by Ensuring

  7. by ArrowAssoc

  8. Hide All

  9. Show All

Visibility

  1. Public
  2. Protected

Abstract Value Members

  1. abstract def apply(i: Int): T
  2. abstract def array: Array[_]
  3. abstract def elemTag: ClassTag[_]
  4. abstract def length: Int
  5. abstract def update(index: Int, elem: T): Unit

Concrete Value Members

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

Shadowed Implicit Value Members

  1. def length(): Int
  2. def toString(): String

Deprecated Value Members

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

Inherited from java.io.Serializable

Inherited from StrictOptimizedSeqOps[T, ArraySeq, ArraySeq[T]]

Inherited from StrictOptimizedIterableOps[T, ArraySeq, ArraySeq[T]]

Inherited from IndexedSeq[T]

Inherited from IndexedSeqOps[T, [_]ArraySeq[_], ArraySeq[T]]

Inherited from collection.IndexedSeq[T]

Inherited from collection.IndexedSeqOps[T, [_]ArraySeq[_], ArraySeq[T]]

Inherited from AbstractSeq[T]

Inherited from Seq[T]

Inherited from SeqOps[T, [_]ArraySeq[_], ArraySeq[T]]

Inherited from Cloneable[ArraySeq[T]]

Inherited from java.lang.Cloneable

Inherited from Iterable[T]

Inherited from collection.AbstractSeq[T]

Inherited from collection.Seq[T]

Inherited from Equals

Inherited from collection.SeqOps[T, [_]ArraySeq[_], ArraySeq[T]]

Inherited from PartialFunction[Int, T]

Inherited from (Int) => T

Inherited from collection.AbstractIterable[T]

Inherited from collection.Iterable[T]

Inherited from IterableFactoryDefaults[T, [x]IndexedSeq[x]]

Inherited from IterableOps[T, [_]ArraySeq[_], ArraySeq[T]]

Inherited from IterableOnceOps[T, [_]ArraySeq[_], ArraySeq[T]]

Inherited from IterableOnce[T]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion SeqCharSequence fromArraySeq[T] to SeqCharSequence

Inherited by implicit conversion UnliftOps fromArraySeq[T] to UnliftOps[Int, B]

Inherited by implicit conversion iterableOnceExtensionMethods fromArraySeq[T] to IterableOnceExtensionMethods[T]

Inherited by implicit conversion any2stringadd fromArraySeq[T] to any2stringadd[ArraySeq[T]]

Inherited by implicit conversion StringFormat fromArraySeq[T] to StringFormat[ArraySeq[T]]

Inherited by implicit conversion Ensuring fromArraySeq[T] to Ensuring[ArraySeq[T]]

Inherited by implicit conversion ArrowAssoc fromArraySeq[T] to ArrowAssoc[ArraySeq[T]]

Ungrouped