A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.scala-lang.org/api/2.13.5/scala/collection/mutable/ArrayBuffer.html below:

Scala Standard Library 2.13.5 - scala.collection.mutable.ArrayBuffer

class ArrayBuffer[A] extends AbstractBuffer[A] with IndexedBuffer[A] with IndexedSeqOps[A, ArrayBuffer, ArrayBuffer[A]] with StrictOptimizedSeqOps[A, ArrayBuffer, ArrayBuffer[A]] with IterableFactoryDefaults[A, ArrayBuffer] with DefaultSerializable



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ArrayBuffer
  2. DefaultSerializable
  3. Serializable
  4. StrictOptimizedSeqOps
  5. StrictOptimizedIterableOps
  6. IndexedBuffer
  7. IndexedSeq
  8. IndexedSeqOps
  9. IndexedSeq
  10. IndexedSeqOps
  11. AbstractBuffer
  12. Buffer
  13. Shrinkable
  14. Growable
  15. Clearable
  16. AbstractSeq
  17. Seq
  18. SeqOps
  19. Cloneable
  20. Cloneable
  21. Iterable
  22. AbstractSeq
  23. Seq
  24. Equals
  25. SeqOps
  26. PartialFunction
  27. Function1
  28. AbstractIterable
  29. Iterable
  30. IterableFactoryDefaults
  31. IterableOps
  32. IterableOnceOps
  33. IterableOnce
  34. AnyRef
  35. Any
Implicitly
  1. by UnliftOps
  2. by iterableOnceExtensionMethods
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Instance Constructors
  1.  new ArrayBuffer(initialSize: Int)
  2.  new ArrayBuffer()
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]): ArrayBuffer[B]
  5.  final def ++:[B >: A](prefix: IterableOnce[B]): ArrayBuffer[B]
  6.  final def ++=(xs: IterableOnce[A]): ArrayBuffer.this.type
  7.  final def ++=:(elems: IterableOnce[A]): ArrayBuffer.this.type
  8.  final def +:[B >: A](elem: B): ArrayBuffer[B]
  9.  final def +=(elem: A): ArrayBuffer.this.type
  10.  final def +=:(elem: A): ArrayBuffer.this.type
  11.  final def --=(xs: IterableOnce[A]): ArrayBuffer.this.type
  12.  final def -=(elem: A): ArrayBuffer.this.type
  13.  def ->[B](y: B): (ArrayBuffer[A], B)
  14.  final def :+[B >: A](elem: B): ArrayBuffer[B]
  15.  final def :++[B >: A](suffix: IterableOnce[B]): ArrayBuffer[B]
  16.  final def ==(arg0: Any): Boolean
  17.  def addAll(elems: IterableOnce[A]): ArrayBuffer.this.type
  18.  def addOne(elem: A): ArrayBuffer.this.type
  19.  final def addString(b: StringBuilder): StringBuilder
  20.  final def addString(b: StringBuilder, sep: String): StringBuilder
  21.  def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
  22.  def andThen[C](k: PartialFunction[A, C]): PartialFunction[Int, C]
  23.  def andThen[C](k: (A) => C): PartialFunction[Int, C]
  24.  final def append(elem: A): ArrayBuffer.this.type
  25.  final def appendAll(xs: IterableOnce[A]): ArrayBuffer.this.type
  26.  def appended[B >: A](elem: B): ArrayBuffer[B]
  27.  def appendedAll[B >: A](suffix: IterableOnce[B]): ArrayBuffer[B]
  28.  def apply(n: Int): A
  29.  def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) => B1): B1
  30.  var array: Array[AnyRef]
  31.  final def asInstanceOf[T0]: T0
  32.  def canEqual(that: Any): Boolean
  33.  def className: String
  34.  def clear(): Unit
  35.  def clearAndShrink(size: Int = ArrayBuffer.DefaultInitialSize): ArrayBuffer.this.type
  36.  def clone(): ArrayBuffer[A]
  37.  final def coll: ArrayBuffer.this.type
  38.  def collect[B](pf: PartialFunction[A, B]): ArrayBuffer[B]
  39.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
  40.  def combinations(n: Int): Iterator[ArrayBuffer[A]]
  41.  def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, A]
  42.  def compose[A](g: (A) => Int): (A) => A
  43.  final def concat[B >: A](suffix: IterableOnce[B]): ArrayBuffer[B]
  44.  def contains[A1 >: A](elem: A1): Boolean
  45.  def containsSlice[B >: A](that: collection.Seq[B]): Boolean
  46.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
  47.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
  48.  def copyToArray[B >: A](xs: Array[B]): Int
  49.  def corresponds[B](that: collection.Seq[B])(p: (A, B) => Boolean): Boolean
  50.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
  51.  def count(p: (A) => Boolean): Int
  52.  def diff[B >: A](that: collection.Seq[B]): ArrayBuffer[A]
  53.  def distinct: ArrayBuffer[A]
  54.  def distinctBy[B](f: (A) => B): ArrayBuffer[A]
  55.  def drop(n: Int): ArrayBuffer[A]
  56.  def dropInPlace(n: Int): ArrayBuffer.this.type
  57.  def dropRight(n: Int): ArrayBuffer[A]
  58.  def dropRightInPlace(n: Int): ArrayBuffer.this.type
  59.  def dropWhile(p: (A) => Boolean): ArrayBuffer[A]
  60.  def dropWhileInPlace(p: (A) => Boolean): ArrayBuffer.this.type
  61.  def elementWise: ElementWiseExtractor[Int, A]
  62.  def empty: ArrayBuffer[A]
  63.  def endsWith[B >: A](that: collection.Iterable[B]): Boolean
  64.  def ensureSize(n: Int): Unit
  65.  def ensuring(cond: (ArrayBuffer[A]) => Boolean, msg: => Any): ArrayBuffer[A]
  66.  def ensuring(cond: (ArrayBuffer[A]) => Boolean): ArrayBuffer[A]
  67.  def ensuring(cond: Boolean, msg: => Any): ArrayBuffer[A]
  68.  def ensuring(cond: Boolean): ArrayBuffer[A]
  69.  final def eq(arg0: AnyRef): Boolean
  70.  def equals(o: Any): Boolean
  71.  def exists(p: (A) => Boolean): Boolean
  72.  def filter(pred: (A) => Boolean): ArrayBuffer[A]
  73.  def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): ArrayBuffer[A]
  74.  def filterInPlace(p: (A) => Boolean): ArrayBuffer.this.type
  75.  def filterNot(pred: (A) => Boolean): ArrayBuffer[A]
  76.  def finalize(): Unit
  77.  def find(p: (A) => Boolean): Option[A]
  78.  def findLast(p: (A) => Boolean): Option[A]
  79.  def flatMap[B](f: (A) => IterableOnce[B]): ArrayBuffer[B]
  80.  def flatMapInPlace(f: (A) => IterableOnce[A]): ArrayBuffer.this.type
  81.  def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): ArrayBuffer[B]
  82.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  83.  def foldLeft[B](z: B)(op: (B, A) => B): B
  84.  def foldRight[B](z: B)(op: (A, B) => B): B
  85.  def forall(p: (A) => Boolean): Boolean
  86.  def foreach[U](f: (A) => U): Unit
  87.  def formatted(fmtstr: String): String
  88.  def fromSpecific(coll: IterableOnce[A]): ArrayBuffer[A]
  89.  final def getClass(): Class[_ <: AnyRef]
  90.  def groupBy[K](f: (A) => K): immutable.Map[K, ArrayBuffer[A]]
  91.  def groupMap[K, B](key: (A) => K)(f: (A) => B): immutable.Map[K, ArrayBuffer[B]]
  92.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): immutable.Map[K, B]
  93.  def grouped(size: Int): Iterator[ArrayBuffer[A]]
  94.  def hashCode(): Int
  95.  def head: A
  96.  def headOption: Option[A]
  97.  def indexOf[B >: A](elem: B): Int
  98.  def indexOf[B >: A](elem: B, from: Int): Int
  99.  def indexOfSlice[B >: A](that: collection.Seq[B]): Int
  100.  def indexOfSlice[B >: A](that: collection.Seq[B], from: Int): Int
  101.  def indexWhere(p: (A) => Boolean): Int
  102.  def indexWhere(p: (A) => Boolean, from: Int): Int
  103.  def indices: immutable.Range
  104.  def init: ArrayBuffer[A]
  105.  def inits: Iterator[ArrayBuffer[A]]
  106.  def insert(index: Int, elem: A): Unit
  107.  def insertAll(index: Int, elems: IterableOnce[A]): Unit
  108.  def intersect[B >: A](that: collection.Seq[B]): ArrayBuffer[A]
  109.  def isDefinedAt(idx: Int): Boolean
  110.  def isEmpty: Boolean
  111.  final def isInstanceOf[T0]: Boolean
  112.  def isTraversableAgain: Boolean
  113.  def iterableFactory: SeqFactory[ArrayBuffer]
  114.  def iterator: Iterator[A]
  115.  def knownSize: Int
  116.  def last: A
  117.  def lastIndexOf[B >: A](elem: B, end: Int = length - 1): Int
  118.  def lastIndexOfSlice[B >: A](that: collection.Seq[B]): Int
  119.  def lastIndexOfSlice[B >: A](that: collection.Seq[B], end: Int): Int
  120.  def lastIndexWhere(p: (A) => Boolean): Int
  121.  def lastIndexWhere(p: (A) => Boolean, end: Int): Int
  122.  def lastOption: Option[A]
  123.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, ArrayBuffer.this.type]
  124.  def length: Int
  125.  final def lengthCompare(that: collection.Iterable[_]): Int
  126.  final def lengthCompare(len: Int): Int
  127.  final def lengthIs: SizeCompareOps
  128.  def lift: (Int) => Option[A]
  129.  def map[B](f: (A) => B): ArrayBuffer[B]
  130.  def mapInPlace(f: (A) => A): ArrayBuffer.this.type
  131.  def max[B >: A](implicit ord: math.Ordering[B]): A
  132.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  133.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
  134.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  135.  def min[B >: A](implicit ord: math.Ordering[B]): A
  136.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  137.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
  138.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  139.  final def mkString: String
  140.  final def mkString(sep: String): String
  141.  final def mkString(start: String, sep: String, end: String): String
  142.  final def ne(arg0: AnyRef): Boolean
  143.  def newSpecificBuilder: Builder[A, ArrayBuffer[A]]
  144.  def nonEmpty: Boolean
  145.  final def notify(): Unit
  146.  final def notifyAll(): Unit
  147.  def occCounts[B](sq: collection.Seq[B]): Map[B, Int]
  148.  def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
  149.  def padTo[B >: A](len: Int, elem: B): ArrayBuffer[B]
  150.  def padToInPlace(len: Int, elem: A): ArrayBuffer.this.type
  151.  def partition(p: (A) => Boolean): (ArrayBuffer[A], ArrayBuffer[A])
  152.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (ArrayBuffer[A1], ArrayBuffer[A2])
  153.  def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): ArrayBuffer[B]
  154.  def patchInPlace(from: Int, patch: IterableOnce[A], replaced: Int): ArrayBuffer.this.type
  155.  def permutations: Iterator[ArrayBuffer[A]]
  156.  def prepend(elem: A): ArrayBuffer.this.type
  157.  def prependAll(elems: IterableOnce[A]): ArrayBuffer.this.type
  158.  def prepended[B >: A](elem: B): ArrayBuffer[B]
  159.  def prependedAll[B >: A](prefix: IterableOnce[B]): ArrayBuffer[B]
  160.  def product[B >: A](implicit num: math.Numeric[B]): B
  161.  def reduce[B >: A](op: (B, B) => B): B
  162.  def reduceLeft[B >: A](op: (B, A) => B): B
  163.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
  164.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
  165.  def reduceRight[B >: A](op: (A, B) => B): B
  166.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
  167.  def remove(index: Int, count: Int): Unit
  168.  def remove(index: Int): A
  169.  def reverse: ArrayBuffer[A]
  170.  def reverseIterator: Iterator[A]
  171.  def reversed: collection.Iterable[A]
  172.  def runWith[U](action: (A) => U): (Int) => Boolean
  173.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  174.  def scan[B >: A](z: B)(op: (B, B) => B): ArrayBuffer[B]
  175.  def scanLeft[B](z: B)(op: (B, A) => B): ArrayBuffer[B]
  176.  def scanRight[B](z: B)(op: (A, B) => B): ArrayBuffer[B]
  177.  def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult
  178.  def search[B >: A](elem: B)(implicit ord: math.Ordering[B]): SearchResult
  179.  def segmentLength(p: (A) => Boolean, from: Int): Int
  180.  final def segmentLength(p: (A) => Boolean): Int
  181.  final def size: Int
  182.  var size0: Int
  183.  final def sizeCompare(that: collection.Iterable[_]): Int
  184.  final def sizeCompare(otherSize: Int): Int
  185.  def sizeHint(size: Int): Unit
  186.  final def sizeIs: SizeCompareOps
  187.  def slice(from: Int, until: Int): ArrayBuffer[A]
  188.  def sliceInPlace(start: Int, end: Int): ArrayBuffer.this.type
  189.  def sliding(size: Int, step: Int): Iterator[ArrayBuffer[A]]
  190.  def sliding(size: Int): Iterator[ArrayBuffer[A]]
  191.  def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): ArrayBuffer[A]
  192.  def sortInPlace[B >: A]()(implicit ord: Ordering[B]): ArrayBuffer.this.type
  193.  def sortInPlaceBy[B](f: (A) => B)(implicit ord: Ordering[B]): ArrayBuffer.this.type
  194.  def sortInPlaceWith(lt: (A, A) => Boolean): ArrayBuffer.this.type
  195.  def sortWith(lt: (A, A) => Boolean): ArrayBuffer[A]
  196.  def sorted[B >: A](implicit ord: Ordering[B]): ArrayBuffer[A]
  197.  def span(p: (A) => Boolean): (ArrayBuffer[A], ArrayBuffer[A])
  198.  def splitAt(n: Int): (ArrayBuffer[A], ArrayBuffer[A])
  199.  def startsWith[B >: A](that: IterableOnce[B], offset: Int = 0): Boolean
  200.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit
  201.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
  202.  final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
  203.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
  204.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
  205.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
  206.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
  207.  def stringPrefix: String
  208.  def subtractAll(xs: IterableOnce[A]): ArrayBuffer.this.type
  209.  def subtractOne(x: A): ArrayBuffer.this.type
  210.  def sum[B >: A](implicit num: math.Numeric[B]): B
  211.  final def synchronized[T0](arg0: => T0): T0
  212.  def tail: ArrayBuffer[A]
  213.  def tails: Iterator[ArrayBuffer[A]]
  214.  def take(n: Int): ArrayBuffer[A]
  215.  def takeInPlace(n: Int): ArrayBuffer.this.type
  216.  def takeRight(n: Int): ArrayBuffer[A]
  217.  def takeRightInPlace(n: Int): ArrayBuffer.this.type
  218.  def takeWhile(p: (A) => Boolean): ArrayBuffer[A]
  219.  def takeWhileInPlace(p: (A) => Boolean): ArrayBuffer.this.type
  220.  def tapEach[U](f: (A) => U): ArrayBuffer[A]
  221.  def to[C1](factory: Factory[A, C1]): C1
  222.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  223.  final def toBuffer[B >: A]: Buffer[B]
  224.  def toIndexedSeq: immutable.IndexedSeq[A]
  225.  final def toIterable: ArrayBuffer.this.type
  226.  def toList: immutable.List[A]
  227.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  228.  def toSeq: immutable.Seq[A]
  229.  def toSet[B >: A]: immutable.Set[B]
  230.  def toString(): String
  231.  def toVector: immutable.Vector[A]
  232.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): ArrayBuffer[ArrayBuffer[B]]
  233.  def trimToSize(): Unit
  234.  def unapply(a: Int): Option[A]
  235.  def unlift: PartialFunction[Int, B]
  236.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (ArrayBuffer[A1], ArrayBuffer[A2])
  237.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (ArrayBuffer[A1], ArrayBuffer[A2], ArrayBuffer[A3])
  238.  def update(index: Int, elem: A): Unit
  239.  def updated[B >: A](index: Int, elem: B): ArrayBuffer[B]
  240.  def view: ArrayBufferView[A]
  241.  final def wait(): Unit
  242.  final def wait(arg0: Long, arg1: Int): Unit
  243.  final def wait(arg0: Long): Unit
  244.  def withFilter(p: (A) => Boolean): WithFilter[A, [_]ArrayBuffer[_]]
  245.  def writeReplace(): AnyRef
  246.  def zip[B](that: IterableOnce[B]): ArrayBuffer[(A, B)]
  247.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): ArrayBuffer[(A1, B)]
  248.  def zipWithIndex: ArrayBuffer[(A, Int)]
Deprecated Value Members
  1.  final def +=(elem1: A, elem2: A, elems: A*): ArrayBuffer.this.type
  2.  def -=(elem1: A, elem2: A, elems: A*): ArrayBuffer.this.type
  3.  def /:[B](z: B)(op: (B, A) => B): B
  4.  final def /:[B](z: B)(op: (B, A) => B): B
  5.  def :\[B](z: B)(op: (A, B) => B): B
  6.  final def :\[B](z: B)(op: (A, B) => B): B
  7.  def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
  8.  final def append(elems: A*): ArrayBuffer.this.type
  9.  def collectFirst[B](f: PartialFunction[A, B]): Option[B]
  10.  def companion: IterableFactory[[_]ArrayBuffer[_]]
  11.  def copyToBuffer(dest: Buffer[A]): Unit
  12.  final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
  13.  def count(f: (A) => Boolean): Int
  14.  def exists(f: (A) => Boolean): Boolean
  15.  def filter(f: (A) => Boolean): Iterator[A]
  16.  def find(p: (A) => Boolean): Option[A]
  17.  def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
  18.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  19.  def foldLeft[B](z: B)(op: (B, A) => B): B
  20.  def foldRight[B](z: B)(op: (A, B) => B): B
  21.  def forall(f: (A) => Boolean): Boolean
  22.  def foreach[U](f: (A) => U): Unit
  23.  def hasDefiniteSize: Boolean
  24.  def isEmpty: Boolean
  25.  def map[B](f: (A) => B): IterableOnce[B]
  26.  def mapResult[NewTo](f: (ArrayBuffer[A]) => NewTo): Builder[A, NewTo]
  27.  def max(implicit ord: math.Ordering[A]): A
  28.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  29.  def min(implicit ord: math.Ordering[A]): A
  30.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  31.  def mkString: String
  32.  def mkString(sep: String): String
  33.  def mkString(start: String, sep: String, end: String): String
  34.  def nonEmpty: Boolean
  35.  final def prefixLength(p: (A) => Boolean): Int
  36.  final def prepend(elems: A*): ArrayBuffer.this.type
  37.  def product(implicit num: math.Numeric[A]): A
  38.  def reduce(f: (A, A) => A): A
  39.  def reduceLeft(f: (A, A) => A): A
  40.  def reduceLeftOption(f: (A, A) => A): Option[A]
  41.  def reduceOption(f: (A, A) => A): Option[A]
  42.  def reduceRight(f: (A, A) => A): A
  43.  def reduceRightOption(f: (A, A) => A): Option[A]
  44.  final def repr: ArrayBuffer[A]
  45.  def result(): ArrayBuffer.this.type
  46.  def reverseMap[B](f: (A) => B): ArrayBuffer[B]
  47.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  48.  def seq: ArrayBuffer.this.type
  49.  def size: Int
  50.  def sum(implicit num: math.Numeric[A]): A
  51.  def to[C1](factory: Factory[A, C1]): C1
  52.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  53.  def toBuffer[B >: A]: Buffer[B]
  54.  def toIndexedSeq: collection.IndexedSeq[A]
  55.  final def toIterable: collection.Iterable[A]
  56.  def toIterator: Iterator[A]
  57.  final def toIterator: Iterator[A]
  58.  def toList: immutable.List[A]
  59.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  60.  def toSeq: immutable.Seq[A]
  61.  def toSet[B >: A]: immutable.Set[B]
  62.  def toStream: immutable.Stream[A]
  63.  final def toStream: immutable.Stream[A]
  64.  final def toTraversable: collection.Traversable[A]
  65.  final def toTraversable: collection.Traversable[A]
  66.  def toVector: immutable.Vector[A]
  67.  final def transform(f: (A) => A): ArrayBuffer.this.type
  68.  def trimEnd(n: Int): Unit
  69.  def trimStart(n: Int): Unit
  70.  final def union[B >: A](that: collection.Seq[B]): ArrayBuffer[B]
  71.  def view(from: Int, until: Int): IndexedSeqView[A]
  72.  def withFilter(f: (A) => Boolean): Iterator[A]
  73.  def →[B](y: B): (ArrayBuffer[A], B)
Inherited from (Int) => A

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4