A RetroSearch Logo

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

Search Query:

Showing content from http://www.scala-lang.org/api/2.12.15/scala/collection/mutable/ArrayLike.html below:

Scala Standard Library 2.12.15 - scala.collection.mutable.ArrayLike

trait ArrayLike[A, +Repr] extends IndexedSeqOptimized[A, Repr]

 

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ArrayLike
  2. IndexedSeqOptimized
  3. IndexedSeqOptimized
  4. IndexedSeqLike
  5. IndexedSeqLike
  6. SeqLike
  7. GenSeqLike
  8. IterableLike
  9. GenIterableLike
  10. TraversableLike
  11. GenTraversableLike
  12. Parallelizable
  13. TraversableOnce
  14. GenTraversableOnce
  15. FilterMonadic
  16. HasNewBuilder
  17. Equals
  18. Any
Implicitly
  1. by CollectionsHaveToParArray
  2. by MonadOps
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  7. by alternateImplicit
Concrete Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##(): Int
  3.  def +(other: String): String
  4.  def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That
  5.  def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Repr, B, That]): That
  6.  def ++:[B](that: TraversableOnce[B]): ArrayLike[B]
  7.  def +:(elem: A): ArrayLike[A]
  8.  def ->[B](y: B): (ArrayLike[A, Repr], B)
  9.  def :+(elem: A): ArrayLike[A]
  10.  final def ==(arg0: Any): Boolean
  11.  def addString(b: scala.StringBuilder): scala.StringBuilder
  12.  def addString(b: scala.StringBuilder, sep: String): scala.StringBuilder
  13.  def addString(b: scala.StringBuilder, start: String, sep: String, end: String): scala.StringBuilder
  14.  def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
  15.  final def asInstanceOf[T0]: T0
  16.  def canEqual(that: Any): Boolean
  17.  def collect[B](pf: PartialFunction[A, B]): ArrayLike[B]
  18.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
  19.  def combinations(n: Int): Iterator[Repr]
  20.  def contains[A1 >: A](elem: A1): Boolean
  21.  def containsSlice[B](that: GenSeq[B]): Boolean
  22.  def copyToArray(xs: Array[A], start: Int, len: Int): Unit
  23.  def copyToArray(xs: Array[A]): Unit
  24.  def copyToArray(xs: Array[A], start: Int): Unit
  25.  def copyToBuffer[B >: A](dest: Buffer[B]): Unit
  26.  def corresponds[B](that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean
  27.  def count(p: (A) ⇒ Boolean): Int
  28.  def deep: collection.IndexedSeq[Any]
  29.  def diff(that: collection.Seq[A]): ArrayLike[A]
  30.  def distinct: Repr
  31.  def drop(n: Int): Repr
  32.  def dropRight(n: Int): Repr
  33.  def dropWhile(p: (A) ⇒ Boolean): Repr
  34.  def endsWith[B](that: GenSeq[B]): Boolean
  35.  def ensuring(cond: (ArrayLike[A, Repr]) ⇒ Boolean, msg: ⇒ Any): ArrayLike[A, Repr]
  36.  def ensuring(cond: (ArrayLike[A, Repr]) ⇒ Boolean): ArrayLike[A, Repr]
  37.  def ensuring(cond: Boolean, msg: ⇒ Any): ArrayLike[A, Repr]
  38.  def ensuring(cond: Boolean): ArrayLike[A, Repr]
  39.  def equals(that: Any): Boolean
  40.  def exists(p: (A) ⇒ Boolean): Boolean
  41.  def filter(p: (A) ⇒ Boolean): Repr
  42.  def filterNot(p: (A) ⇒ Boolean): Repr
  43.  def find(p: (A) ⇒ Boolean): Option[A]
  44.  def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): ArrayLike[B]
  45.  def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
  46.  def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
  47.  def foldRight[B](z: B)(op: (A, B) ⇒ B): B
  48.  def forall(p: (A) ⇒ Boolean): Boolean
  49.  def foreach(f: (A) ⇒ Unit): Unit
  50.  def formatted(fmtstr: String): String
  51.  def groupBy[K](f: (A) ⇒ K): immutable.Map[K, Repr]
  52.  def grouped(size: Int): Iterator[Repr]
  53.  def hasDefiniteSize: Boolean
  54.  def hashCode(): Int
  55.  def head: A
  56.  def headOption: Option[A]
  57.  def indexOf(elem: A, from: Int): Int
  58.  def indexOf(elem: A): Int
  59.  def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int
  60.  def indexOfSlice[B >: A](that: GenSeq[B]): Int
  61.  def indexWhere(p: (A) ⇒ Boolean, from: Int): Int
  62.  def indexWhere(p: (A) ⇒ Boolean): Int
  63.  def indices: immutable.Range
  64.  def init: Repr
  65.  def inits: Iterator[Repr]
  66.  def intersect(that: collection.Seq[A]): ArrayLike[A]
  67.  def isDefinedAt(idx: Int): Boolean
  68.  def isEmpty: Boolean
  69.  final def isInstanceOf[T0]: Boolean
  70.  final def isTraversableAgain: Boolean
  71.  def iterator: Iterator[A]
  72.  def last: A
  73.  def lastIndexOf(elem: A, end: Int): Int
  74.  def lastIndexOf(elem: A): Int
  75.  def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int
  76.  def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int
  77.  def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int
  78.  def lastIndexWhere(p: (A) ⇒ Boolean): Int
  79.  def lastOption: Option[A]
  80.  def lengthCompare(len: Int): Int
  81.  def map[B](f: (A) ⇒ B): ArrayLike[B]
  82.  def max: A
  83.  def maxBy[B](f: (A) ⇒ B): A
  84.  def min: A
  85.  def minBy[B](f: (A) ⇒ B): A
  86.  def mkString: String
  87.  def mkString(sep: String): String
  88.  def mkString(start: String, sep: String, end: String): String
  89.  def nonEmpty: Boolean
  90.  def padTo(len: Int, elem: A): ArrayLike[A]
  91.  def par: ParSeq[A]
  92.  def parCombiner: Combiner[A, ParSeq[A]]
  93.  def partition(p: (A) ⇒ Boolean): (Repr, Repr)
  94.  def patch(from: Int, that: GenSeq[A], replaced: Int): ArrayLike[A]
  95.  def permutations: Iterator[Repr]
  96.  def prefixLength(p: (A) ⇒ Boolean): Int
  97.  def product: A
  98.  def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
  99.  def reduceLeft[B >: A](op: (B, A) ⇒ B): B
  100.  def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
  101.  def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
  102.  def reduceRight[B >: A](op: (A, B) ⇒ B): B
  103.  def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
  104.  def repr: Repr
  105.  def reverse: Repr
  106.  def reverseIterator: Iterator[A]
  107.  def reverseMap[B](f: (A) ⇒ B): ArrayLike[B]
  108.  def reversed: List[A]
  109.  def sameElements(that: GenIterable[A]): Boolean
  110.  def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Repr, B, That]): That
  111.  def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That
  112.  def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That
  113.  def segmentLength(p: (A) ⇒ Boolean, from: Int): Int
  114.  def size: Int
  115.  def sizeHintIfCheap: Int
  116.  def slice(from: Int, until: Int): Repr
  117.  def sliding(size: Int, step: Int): Iterator[Repr]
  118.  def sliding(size: Int): Iterator[Repr]
  119.  def sortBy[B](f: (A) ⇒ B)(implicit ord: math.Ordering[B]): Repr
  120.  def sortWith(lt: (A, A) ⇒ Boolean): Repr
  121.  def sorted[B >: A](implicit ord: math.Ordering[B]): Repr
  122.  def span(p: (A) ⇒ Boolean): (Repr, Repr)
  123.  def splitAt(n: Int): (Repr, Repr)
  124.  def startsWith[B](that: GenSeq[B], offset: Int): Boolean
  125.  def startsWith[B](that: GenSeq[B]): Boolean
  126.  def stringPrefix: String
  127.  def sum: A
  128.  def tail: Repr
  129.  def tails: Iterator[Repr]
  130.  def take(n: Int): Repr
  131.  def takeRight(n: Int): Repr
  132.  def takeWhile(p: (A) ⇒ Boolean): Repr
  133.  def thisCollection: IndexedSeq[A]
  134.  def to[Col[_]]: Col[A]
  135.  def toArray: Array[A]
  136.  def toBuffer[A1 >: A]: Buffer[A1]
  137.  def toCollection(repr: Repr): IndexedSeq[A]
  138.  def toIndexedSeq: immutable.IndexedSeq[A]
  139.  def toIterable: collection.Iterable[A]
  140.  def toIterator: Iterator[A]
  141.  def toList: List[A]
  142.  def toMap[T, U]: collection.Map[T, U]
  143.  def toParArray: ParArray[T]
  144.  def toSeq: collection.Seq[A]
  145.  def toSet[B >: A]: immutable.Set[B]
  146.  def toStream: immutable.Stream[A]
  147.  def toString(): String
  148.  def toTraversable: collection.Traversable[A]
  149.  def toVector: Vector[A]
  150.  def union(that: collection.Seq[A]): ArrayLike[A]
  151.  def updated(index: Int, elem: A): ArrayLike[A]
  152.  def view(from: Int, until: Int): IndexedSeqView[A, Repr]
  153.  def view: IndexedSeqView[A, Repr]
  154.  def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, Repr]
  155.  def zip[B](that: GenIterable[B]): ArrayLike[(A, B)]
  156.  def zipAll[B](that: collection.Iterable[B], thisElem: A, thatElem: B): ArrayLike[(A, B)]
  157.  def zipWithIndex: ArrayLike[(A, Int)]
  158.  def →[B](y: B): (ArrayLike[A, Repr], B)
Deprecated Value Members
  1.  def /:[B](z: B)(op: (B, A) ⇒ B): B
  2.  def :\[B](z: B)(op: (A, B) ⇒ B): B

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