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.10/scala/collection/mutable/ListBuffer.html below:

Scala Standard Library 2.13.10 - scala.collection.mutable.ListBuffer

class ListBuffer[A] extends AbstractBuffer[A] with SeqOps[A, ListBuffer, ListBuffer[A]] with StrictOptimizedSeqOps[A, ListBuffer, ListBuffer[A]] with ReusableBuilder[A, immutable.List[A]] with IterableFactoryDefaults[A, ListBuffer] with DefaultSerializable



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