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
- Alphabetic
- By Inheritance
Inherited
- ArraySeq
- Serializable
- StrictOptimizedSeqOps
- StrictOptimizedIterableOps
- IndexedSeq
- IndexedSeqOps
- IndexedSeq
- IndexedSeqOps
- AbstractSeq
- Seq
- SeqOps
- Cloneable
- Cloneable
- Iterable
- AbstractSeq
- Seq
- Equals
- SeqOps
- PartialFunction
- Function1
- AbstractIterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
Implicitly
by SeqCharSequence
by UnliftOps
by iterableOnceExtensionMethods
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc
Hide All
Show All
Visibility
- Public
- Protected
Abstract Value Members
- abstract def apply(i: Int): T
- abstract def array: Array[_]
- abstract def elemTag: ClassTag[_]
- abstract def length: Int
- abstract def update(index: Int, elem: T): Unit
Concrete Value Members
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- def +(other: String): String
- final def ++[B >: T](suffix: IterableOnce[B]): ArraySeq[B]
- final def ++:[B >: T](prefix: IterableOnce[B]): ArraySeq[B]
- final def +:[B >: T](elem: B): ArraySeq[B]
- def ->[B](y: B): (ArraySeq[T], B)
- final def :+[B >: T](elem: B): ArraySeq[B]
- final def :++[B >: T](suffix: IterableOnce[B]): ArraySeq[B]
- final def ==(arg0: Any): Boolean
- final def addString(b: StringBuilder): StringBuilder
- final def addString(b: StringBuilder, sep: String): StringBuilder
- def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- def andThen[C](k: PartialFunction[T, C]): PartialFunction[Int, C]
- def andThen[C](k: (T) => C): PartialFunction[Int, C]
- def appended[B >: T](elem: B): ArraySeq[B]
- def appendedAll[B >: T](suffix: IterableOnce[B]): ArraySeq[B]
- def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) => B1): B1
- final def asInstanceOf[T0]: T0
- def canEqual(that: Any): Boolean
- def charAt(index: Int): Char
- def chars(): IntStream
- def className: String
- def clone(): ArraySeq[T]
- def codePoints(): IntStream
- final def coll: ArraySeq.this.type
- def collect[B](pf: PartialFunction[T, B]): ArraySeq[B]
- def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
- def combinations(n: Int): Iterator[ArraySeq[T]]
- def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, T]
- def compose[A](g: (A) => Int): (A) => T
- final def concat[B >: T](suffix: IterableOnce[B]): ArraySeq[B]
- def contains[A1 >: T](elem: A1): Boolean
- def containsSlice[B](that: collection.Seq[B]): Boolean
- def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int
- def copyToArray[B >: T](xs: Array[B], start: Int): Int
- def copyToArray[B >: T](xs: Array[B]): Int
- def corresponds[B](that: collection.Seq[B])(p: (T, B) => Boolean): Boolean
- def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
- def count(p: (T) => Boolean): Int
- def diff[B >: T](that: collection.Seq[B]): ArraySeq[T]
- def distinct: ArraySeq[T]
- def distinctBy[B](f: (T) => B): ArraySeq[T]
- def drop(n: Int): ArraySeq[T]
- def dropRight(n: Int): ArraySeq[T]
- def dropWhile(p: (T) => Boolean): ArraySeq[T]
- def elementWise: ElementWiseExtractor[Int, T]
- def empty: ArraySeq[T]
- def endsWith[B >: T](that: collection.Iterable[B]): Boolean
- def ensuring(cond: (ArraySeq[T]) => Boolean, msg: => Any): ArraySeq[T]
- def ensuring(cond: (ArraySeq[T]) => Boolean): ArraySeq[T]
- def ensuring(cond: Boolean, msg: => Any): ArraySeq[T]
- def ensuring(cond: Boolean): ArraySeq[T]
- final def eq(arg0: AnyRef): Boolean
- def equals(other: Any): Boolean
- def exists(p: (T) => Boolean): Boolean
- def filter(pred: (T) => Boolean): ArraySeq[T]
- def filterImpl(pred: (T) => Boolean, isFlipped: Boolean): ArraySeq[T]
- def filterNot(pred: (T) => Boolean): ArraySeq[T]
- def finalize(): Unit
- def find(p: (T) => Boolean): Option[T]
- def findLast(p: (T) => Boolean): Option[T]
- def flatMap[B](f: (T) => IterableOnce[B]): ArraySeq[B]
- def flatten[B](implicit toIterableOnce: (T) => IterableOnce[B]): ArraySeq[B]
- def fold[A1 >: T](z: A1)(op: (A1, A1) => A1): A1
- def foldLeft[B](z: B)(op: (B, T) => B): B
- def foldRight[B](z: B)(op: (T, B) => B): B
- def forall(p: (T) => Boolean): Boolean
- def foreach[U](f: (T) => U): Unit
- def formatted(fmtstr: String): String
- def fromSpecific(coll: IterableOnce[T]): ArraySeq[T]
- final def getClass(): Class[_ <: AnyRef]
- def groupBy[K](f: (T) => K): immutable.Map[K, ArraySeq[T]]
- def groupMap[K, B](key: (T) => K)(f: (T) => B): immutable.Map[K, ArraySeq[B]]
- def groupMapReduce[K, B](key: (T) => K)(f: (T) => B)(reduce: (B, B) => B): immutable.Map[K, B]
- def grouped(size: Int): Iterator[ArraySeq[T]]
- def hashCode(): Int
- def head: T
- def headOption: Option[T]
- def indexOf[B >: T](elem: B): Int
- def indexOf[B >: T](elem: B, from: Int): Int
- def indexOfSlice[B >: T](that: collection.Seq[B]): Int
- def indexOfSlice[B >: T](that: collection.Seq[B], from: Int): Int
- def indexWhere(p: (T) => Boolean): Int
- def indexWhere(p: (T) => Boolean, from: Int): Int
- def indices: immutable.Range
- def init: ArraySeq[T]
- def inits: Iterator[ArraySeq[T]]
- def intersect[B >: T](that: collection.Seq[B]): ArraySeq[T]
- def isDefinedAt(idx: Int): Boolean
- def isEmpty: Boolean
- final def isInstanceOf[T0]: Boolean
- def isTraversableAgain: Boolean
- def iterableFactory: SeqFactory[ArraySeq]
- def iterator: Iterator[T]
- def knownSize: Int
- def last: T
- def lastIndexOf[B >: T](elem: B, end: Int = length - 1): Int
- def lastIndexOfSlice[B >: T](that: collection.Seq[B]): Int
- def lastIndexOfSlice[B >: T](that: collection.Seq[B], end: Int): Int
- def lastIndexWhere(p: (T) => Boolean): Int
- def lastIndexWhere(p: (T) => Boolean, end: Int): Int
- def lastOption: Option[T]
- def lazyZip[B](that: collection.Iterable[B]): LazyZip2[T, B, ArraySeq.this.type]
- final def lengthCompare(that: collection.Iterable[_]): Int
- final def lengthCompare(len: Int): Int
- final def lengthIs: SizeCompareOps
- def lift: (Int) => Option[T]
- def map[B](f: (T) => B): ArraySeq[B]
- def mapInPlace(f: (T) => T): ArraySeq.this.type
- def max[B >: T](implicit ord: math.Ordering[B]): T
- def maxBy[B](f: (T) => B)(implicit cmp: math.Ordering[B]): T
- def maxByOption[B](f: (T) => B)(implicit cmp: math.Ordering[B]): Option[T]
- def maxOption[B >: T](implicit ord: math.Ordering[B]): Option[T]
- def min[B >: T](implicit ord: math.Ordering[B]): T
- def minBy[B](f: (T) => B)(implicit cmp: math.Ordering[B]): T
- def minByOption[B](f: (T) => B)(implicit cmp: math.Ordering[B]): Option[T]
- def minOption[B >: T](implicit ord: math.Ordering[B]): Option[T]
- final def mkString: String
- final def mkString(sep: String): String
- final def mkString(start: String, sep: String, end: String): String
- final def ne(arg0: AnyRef): Boolean
- def newSpecificBuilder: Builder[T, ArraySeq[T]]
- def nonEmpty: Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def occCounts[B](sq: collection.Seq[B]): Map[B, Int]
- def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- def padTo[B >: T](len: Int, elem: B): ArraySeq[B]
- def partition(p: (T) => Boolean): (ArraySeq[T], ArraySeq[T])
- def partitionMap[A1, A2](f: (T) => Either[A1, A2]): (ArraySeq[A1], ArraySeq[A2])
- def patch[B >: T](from: Int, other: IterableOnce[B], replaced: Int): ArraySeq[B]
- def permutations: Iterator[ArraySeq[T]]
- def prepended[B >: T](elem: B): ArraySeq[B]
- def prependedAll[B >: T](prefix: IterableOnce[B]): ArraySeq[B]
- def product[B >: T](implicit num: math.Numeric[B]): B
- def reduce[B >: T](op: (B, B) => B): B
- def reduceLeft[B >: T](op: (B, T) => B): B
- def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
- def reduceOption[B >: T](op: (B, B) => B): Option[B]
- def reduceRight[B >: T](op: (T, B) => B): B
- def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
- def reverse: ArraySeq[T]
- def reverseIterator: Iterator[T]
- def reversed: collection.Iterable[T]
- def runWith[U](action: (T) => U): (Int) => Boolean
- def sameElements[B >: T](that: IterableOnce[B]): Boolean
- def scan[B >: T](z: B)(op: (B, B) => B): ArraySeq[B]
- def scanLeft[B](z: B)(op: (B, T) => B): ArraySeq[B]
- def scanRight[B](z: B)(op: (T, B) => B): ArraySeq[B]
- def search[B >: T](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult
- def search[B >: T](elem: B)(implicit ord: math.Ordering[B]): SearchResult
- def segmentLength(p: (T) => Boolean, from: Int): Int
- final def segmentLength(p: (T) => Boolean): Int
- final def size: Int
- final def sizeCompare(that: collection.Iterable[_]): Int
- final def sizeCompare(otherSize: Int): Int
- final def sizeIs: SizeCompareOps
- def slice(from: Int, until: Int): ArraySeq[T]
- def sliding(size: Int, step: Int): Iterator[ArraySeq[T]]
- def sliding(size: Int): Iterator[ArraySeq[T]]
- def sortBy[B](f: (T) => B)(implicit ord: Ordering[B]): ArraySeq[T]
- def sortInPlace[B >: T]()(implicit ord: Ordering[B]): ArraySeq.this.type
- def sortInPlaceBy[B](f: (T) => B)(implicit ord: Ordering[B]): ArraySeq.this.type
- def sortInPlaceWith(lt: (T, T) => Boolean): ArraySeq.this.type
- def sortWith(lt: (T, T) => Boolean): ArraySeq[T]
- def sorted[B >: T](implicit ord: Ordering[B]): ArraySeq[T]
- def span(p: (T) => Boolean): (ArraySeq[T], ArraySeq[T])
- def splitAt(n: Int): (ArraySeq[T], ArraySeq[T])
- def startsWith[B >: T](that: IterableOnce[B], offset: Int = 0): Boolean
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S with EfficientSplit
- final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[T, B]): C2
- final def strictOptimizedConcat[B >: T, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
- final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (T) => IterableOnce[B]): C2
- final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (T) => IterableOnce[B]): C2
- final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (T) => B): C2
- final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(T, B), C2]): C2
- def stringPrefix: String
- def subSequence(start: Int, end: Int): CharSequence
- def sum[B >: T](implicit num: math.Numeric[B]): B
- final def synchronized[T0](arg0: => T0): T0
- def tail: ArraySeq[T]
- def tails: Iterator[ArraySeq[T]]
- def take(n: Int): ArraySeq[T]
- def takeRight(n: Int): ArraySeq[T]
- def takeWhile(p: (T) => Boolean): ArraySeq[T]
- def tapEach[U](f: (T) => U): ArraySeq[T]
- def to[C1](factory: Factory[T, C1]): C1
- def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
- final def toBuffer[B >: T]: Buffer[B]
- def toIndexedSeq: immutable.IndexedSeq[T]
- final def toIterable: ArraySeq.this.type
- def toList: immutable.List[T]
- def toMap[K, V](implicit ev: <:<[T, (K, V)]): immutable.Map[K, V]
- def toSeq: immutable.Seq[T]
- def toSet[B >: T]: immutable.Set[B]
- def toString(): String
- def toVector: immutable.Vector[T]
- def transpose[B](implicit asIterable: (T) => collection.Iterable[B]): ArraySeq[ArraySeq[B]]
- def unapply(a: Int): Option[T]
- def unlift: PartialFunction[Int, B]
- def unzip[A1, A2](implicit asPair: (T) => (A1, A2)): (ArraySeq[A1], ArraySeq[A2])
- def unzip3[A1, A2, A3](implicit asTriple: (T) => (A1, A2, A3)): (ArraySeq[A1], ArraySeq[A2], ArraySeq[A3])
- def updated[B >: T](index: Int, elem: B): ArraySeq[B]
- def view: IndexedSeqView[T]
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- def withFilter(p: (T) => Boolean): WithFilter[T, [_]ArraySeq[_]]
- def zip[B](that: IterableOnce[B]): ArraySeq[(T, B)]
- def zipAll[A1 >: T, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): ArraySeq[(A1, B)]
- def zipWithIndex: ArraySeq[(T, Int)]
Shadowed Implicit Value Members
Deprecated Value Members
- def /:[B](z: B)(op: (B, T) => B): B
- final def /:[B](z: B)(op: (B, T) => B): B
- def :\[B](z: B)(op: (T, B) => B): B
- final def :\[B](z: B)(op: (T, B) => B): B
- def aggregate[B](z: => B)(seqop: (B, T) => B, combop: (B, B) => B): B
- def collectFirst[B](f: PartialFunction[T, B]): Option[B]
- def companion: IterableFactory[[_]ArraySeq[_]]
- def copyToBuffer(dest: Buffer[T]): Unit
- final def copyToBuffer[B >: T](dest: Buffer[B]): Unit
- def count(f: (T) => Boolean): Int
- def exists(f: (T) => Boolean): Boolean
- def filter(f: (T) => Boolean): Iterator[T]
- def find(p: (T) => Boolean): Option[T]
- def flatMap[B](f: (T) => IterableOnce[B]): IterableOnce[B]
- def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
- def foldLeft[B](z: B)(op: (B, T) => B): B
- def foldRight[B](z: B)(op: (T, B) => B): B
- def forall(f: (T) => Boolean): Boolean
- def foreach[U](f: (T) => U): Unit
- def hasDefiniteSize: Boolean
- def isEmpty: Boolean
- def map[B](f: (T) => B): IterableOnce[B]
- def max(implicit ord: math.Ordering[T]): T
- def maxBy[B](f: (T) => B)(implicit cmp: math.Ordering[B]): T
- def min(implicit ord: math.Ordering[T]): T
- def minBy[B](f: (T) => B)(implicit cmp: math.Ordering[B]): T
- def mkString: String
- def mkString(sep: String): String
- def mkString(start: String, sep: String, end: String): String
- def nonEmpty: Boolean
- final def prefixLength(p: (T) => Boolean): Int
- def product(implicit num: math.Numeric[T]): T
- def reduce(f: (T, T) => T): T
- def reduceLeft(f: (T, T) => T): T
- def reduceLeftOption(f: (T, T) => T): Option[T]
- def reduceOption(f: (T, T) => T): Option[T]
- def reduceRight(f: (T, T) => T): T
- def reduceRightOption(f: (T, T) => T): Option[T]
- final def repr: ArraySeq[T]
- def reverseMap[B](f: (T) => B): ArraySeq[B]
- def sameElements[B >: A](that: IterableOnce[B]): Boolean
- def seq: ArraySeq.this.type
- def size: Int
- def sum(implicit num: math.Numeric[T]): T
- def to[C1](factory: Factory[T, C1]): C1
- def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- def toBuffer[B >: A]: Buffer[B]
- def toIndexedSeq: collection.IndexedSeq[T]
- final def toIterable: collection.Iterable[T]
- def toIterator: Iterator[T]
- final def toIterator: Iterator[T]
- def toList: immutable.List[T]
- def toMap[K, V](implicit ev: <:<[T, (K, V)]): immutable.Map[K, V]
- def toSeq: immutable.Seq[T]
- def toSet[B >: A]: immutable.Set[B]
- def toStream: immutable.Stream[T]
- final def toStream: immutable.Stream[T]
- final def toTraversable: collection.Traversable[T]
- final def toTraversable: collection.Traversable[T]
- def toVector: immutable.Vector[T]
- final def transform(f: (T) => T): ArraySeq.this.type
- final def union[B >: T](that: collection.Seq[B]): ArraySeq[B]
- def view(from: Int, until: Int): IndexedSeqView[T]
- def withFilter(f: (T) => Boolean): Iterator[T]
- def →[B](y: B): (ArraySeq[T], B)