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/SeqView.html below:

Scala Standard Library 2.12.15 - scala.collection.SeqView

trait SeqView[+A, +Coll] extends SeqViewLike[A, Coll, SeqView[A, Coll]]

 

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SeqView
  2. SeqViewLike
  3. IterableView
  4. IterableViewLike
  5. TraversableView
  6. TraversableViewLike
  7. ViewMkString
  8. Seq
  9. SeqLike
  10. GenSeq
  11. GenSeqLike
  12. Iterable
  13. IterableLike
  14. Equals
  15. GenIterable
  16. GenIterableLike
  17. Traversable
  18. GenTraversable
  19. GenericTraversableTemplate
  20. TraversableLike
  21. GenTraversableLike
  22. Parallelizable
  23. TraversableOnce
  24. GenTraversableOnce
  25. FilterMonadic
  26. HasNewBuilder
  27. PartialFunction
  28. Function1
  29. AnyRef
  30. Any
Implicitly
  1. by CollectionsHaveToParArray
  2. by MonadOps
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  7. by alternateImplicit
Abstract Value Members
  1.  abstract def apply(idx: Int): A
  2.  abstract def iterator: Iterator[A]
  3.  abstract def length: Int
  4.  abstract def underlying: Coll
Concrete Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##(): Int
  3.  def +(other: String): String
  4.  def ++[B >: A, That](xs: GenTraversableOnce[B])(implicit bf: CanBuildFrom[SeqView[A, Coll], B, That]): That
  5.  def ++:[B >: A, That](xs: Traversable[B])(implicit bf: CanBuildFrom[SeqView[A, Coll], B, That]): That
  6.  def ++:[B](that: TraversableOnce[B]): Seq[B]
  7.  def +:(elem: A): Seq[A]
  8.  def ->[B](y: B): (SeqView[A, Coll], B)
  9.  def :+(elem: A): Seq[A]
  10.  final def ==(arg0: Any): Boolean
  11.  def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
  12.  def addString(b: StringBuilder): StringBuilder
  13.  def addString(b: StringBuilder, sep: String): StringBuilder
  14.  def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
  15.  def andThen[C](k: (A) ⇒ C): PartialFunction[Int, C]
  16.  def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) ⇒ B1): B1
  17.  final def asInstanceOf[T0]: T0
  18.  def canEqual(that: Any): Boolean
  19.  def clone(): AnyRef
  20.  def collect[B](pf: PartialFunction[A, B]): Seq[B]
  21.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
  22.  def combinations(n: Int): Iterator[SeqView[A, Coll]]
  23.  def companion: GenericCompanion[Seq]
  24.  def compose[A](g: (A) ⇒ Int): (A) ⇒ A
  25.  def contains[A1 >: A](elem: A1): Boolean
  26.  def containsSlice[B](that: GenSeq[B]): Boolean
  27.  def copyToArray(xs: Array[A], start: Int, len: Int): Unit
  28.  def copyToArray(xs: Array[A]): Unit
  29.  def copyToArray(xs: Array[A], start: Int): Unit
  30.  def copyToBuffer[B >: A](dest: Buffer[B]): Unit
  31.  def corresponds[B](that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean
  32.  def count(p: (A) ⇒ Boolean): Int
  33.  def diff(that: Seq[A]): Seq[A]
  34.  def distinct: SeqView[A, Coll]
  35.  def drop(n: Int): SeqView[A, Coll]
  36.  def dropRight(n: Int): SeqView[A, Coll]
  37.  def dropWhile(p: (A) ⇒ Boolean): SeqView[A, Coll]
  38.  def endsWith[B](that: GenSeq[B]): Boolean
  39.  def ensuring(cond: (SeqView[A, Coll]) ⇒ Boolean, msg: ⇒ Any): SeqView[A, Coll]
  40.  def ensuring(cond: (SeqView[A, Coll]) ⇒ Boolean): SeqView[A, Coll]
  41.  def ensuring(cond: Boolean, msg: ⇒ Any): SeqView[A, Coll]
  42.  def ensuring(cond: Boolean): SeqView[A, Coll]
  43.  final def eq(arg0: AnyRef): Boolean
  44.  def equals(that: Any): Boolean
  45.  def exists(p: (A) ⇒ Boolean): Boolean
  46.  def filter(p: (A) ⇒ Boolean): SeqView[A, Coll]
  47.  def filterNot(p: (A) ⇒ Boolean): SeqView[A, Coll]
  48.  def finalize(): Unit
  49.  def find(p: (A) ⇒ Boolean): Option[A]
  50.  def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Seq[B]
  51.  def flatten[B]: Seq[B]
  52.  def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
  53.  def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
  54.  def foldRight[B](z: B)(op: (A, B) ⇒ B): B
  55.  def forall(p: (A) ⇒ Boolean): Boolean
  56.  def force[B >: A, That](implicit bf: CanBuildFrom[Coll, B, That]): That
  57.  def foreach(f: (A) ⇒ Unit): Unit
  58.  def formatted(fmtstr: String): String
  59.  def genericBuilder[B]: Builder[B, Seq[B]]
  60.  final def getClass(): Class[_]
  61.  def groupBy[K](f: (A) ⇒ K): immutable.Map[K, SeqView[A, Coll]]
  62.  def grouped(size: Int): Iterator[SeqView[A, Coll]]
  63.  def hasDefiniteSize: Boolean
  64.  def hashCode(): Int
  65.  def head: A
  66.  def headOption: Option[A]
  67.  def indexOf(elem: A, from: Int): Int
  68.  def indexOf(elem: A): Int
  69.  def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int
  70.  def indexOfSlice[B >: A](that: GenSeq[B]): Int
  71.  def indexWhere(p: (A) ⇒ Boolean, from: Int): Int
  72.  def indexWhere(p: (A) ⇒ Boolean): Int
  73.  def indices: immutable.Range
  74.  def init: SeqView[A, Coll]
  75.  def inits: Iterator[SeqView[A, Coll]]
  76.  def intersect(that: Seq[A]): Seq[A]
  77.  def isDefinedAt(idx: Int): Boolean
  78.  def isEmpty: Boolean
  79.  final def isInstanceOf[T0]: Boolean
  80.  final def isTraversableAgain: Boolean
  81.  def last: A
  82.  def lastIndexOf(elem: A, end: Int): Int
  83.  def lastIndexOf(elem: A): Int
  84.  def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int
  85.  def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int
  86.  def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int
  87.  def lastIndexWhere(p: (A) ⇒ Boolean): Int
  88.  def lastOption: Option[A]
  89.  def lengthCompare(len: Int): Int
  90.  def lift: (Int) ⇒ Option[A]
  91.  def map[B](f: (A) ⇒ B): Seq[B]
  92.  def max: A
  93.  def maxBy[B](f: (A) ⇒ B): A
  94.  def min: A
  95.  def minBy[B](f: (A) ⇒ B): A
  96.  def mkString(start: String, sep: String, end: String): String
  97.  def mkString(sep: String): String
  98.  def mkString: String
  99.  final def ne(arg0: AnyRef): Boolean
  100.  def newAppended[B >: A](that: GenTraversable[B]): Transformed[B]
  101.  def newBuilder: Builder[A, SeqView[A, Coll]]
  102.  def newDropped(n: Int): Transformed[A]
  103.  def newDroppedWhile(p: (A) ⇒ Boolean): Transformed[A]
  104.  def newFiltered(p: (A) ⇒ Boolean): Transformed[A]
  105.  def newFlatMapped[B](f: (A) ⇒ GenTraversableOnce[B]): Transformed[B]
  106.  def newForced[B](xs: ⇒ GenSeq[B]): Transformed[B]
  107.  def newMapped[B](f: (A) ⇒ B): Transformed[B]
  108.  def newPatched[B >: A](_from: Int, _patch: GenSeq[B], _replaced: Int): Transformed[B]
  109.  def newPrepended[B >: A](that: GenTraversable[B]): Transformed[B]
  110.  def newReversed: Transformed[A]
  111.  def newSliced(_endpoints: SliceInterval): Transformed[A]
  112.  def newTaken(n: Int): Transformed[A]
  113.  def newTakenWhile(p: (A) ⇒ Boolean): Transformed[A]
  114.  def newZipped[B](that: GenIterable[B]): Transformed[(A, B)]
  115.  def newZippedAll[A1 >: A, B](that: GenIterable[B], _thisElem: A1, _thatElem: B): Transformed[(A1, B)]
  116.  def nonEmpty: Boolean
  117.  final def notify(): Unit
  118.  final def notifyAll(): Unit
  119.  def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
  120.  def padTo(len: Int, elem: A): Seq[A]
  121.  def par: ParSeq[A]
  122.  def parCombiner: Combiner[A, ParSeq[A]]
  123.  def partition(p: (A) ⇒ Boolean): (SeqView[A, Coll], SeqView[A, Coll])
  124.  def patch(from: Int, that: GenSeq[A], replaced: Int): Seq[A]
  125.  def permutations: Iterator[SeqView[A, Coll]]
  126.  def prefixLength(p: (A) ⇒ Boolean): Int
  127.  def product: A
  128.  def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
  129.  def reduceLeft[B >: A](op: (B, A) ⇒ B): B
  130.  def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
  131.  def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
  132.  def reduceRight[B >: A](op: (A, B) ⇒ B): B
  133.  def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
  134.  def repr: SeqView[A, Coll]
  135.  def reverse: SeqView[A, Coll]
  136.  def reverseIterator: Iterator[A]
  137.  def reverseMap[B](f: (A) ⇒ B): Seq[B]
  138.  def reversed: List[A]
  139.  def runWith[U](action: (A) ⇒ U): (Int) ⇒ Boolean
  140.  def sameElements(that: GenIterable[A]): Boolean
  141.  def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[SeqView[A, Coll], B, That]): That
  142.  def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[SeqView[A, Coll], B, That]): That
  143.  def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[SeqView[A, Coll], B, That]): That
  144.  def segmentLength(p: (A) ⇒ Boolean, from: Int): Int
  145.  def seq: Seq[A]
  146.  def size: Int
  147.  def sizeHintIfCheap: Int
  148.  def slice(from: Int, until: Int): SeqView[A, Coll]
  149.  def sliding(size: Int): Iterator[SeqView[A, Coll]]
  150.  def sliding(size: Int, step: Int): Iterator[SeqView[A, Coll]]
  151.  def sortBy[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): SeqView[A, Coll]
  152.  def sortWith(lt: (A, A) ⇒ Boolean): SeqView[A, Coll]
  153.  def sorted[B >: A](implicit ord: Ordering[B]): SeqView[A, Coll]
  154.  def span(p: (A) ⇒ Boolean): (SeqView[A, Coll], SeqView[A, Coll])
  155.  def splitAt(n: Int): (SeqView[A, Coll], SeqView[A, Coll])
  156.  def startsWith[B](that: GenSeq[B], offset: Int): Boolean
  157.  def startsWith[B](that: GenSeq[B]): Boolean
  158.  def stringPrefix: String
  159.  def sum: A
  160.  final def synchronized[T0](arg0: ⇒ T0): T0
  161.  def tail: SeqView[A, Coll]
  162.  def tails: Iterator[SeqView[A, Coll]]
  163.  def take(n: Int): SeqView[A, Coll]
  164.  def takeRight(n: Int): SeqView[A, Coll]
  165.  def takeWhile(p: (A) ⇒ Boolean): SeqView[A, Coll]
  166.  def thisCollection: Seq[A]
  167.  def thisSeq: Seq[A]
  168.  def to[Col[_]]: Col[A]
  169.  def toArray: Array[A]
  170.  def toBuffer[B >: A]: Buffer[B]
  171.  def toCollection(repr: SeqView[A, Coll]): Seq[A]
  172.  def toIndexedSeq: immutable.IndexedSeq[A]
  173.  def toIterable: Iterable[A]
  174.  def toIterator: Iterator[A]
  175.  def toList: List[A]
  176.  def toMap[T, U]: Map[T, U]
  177.  def toParArray: ParArray[T]
  178.  def toSeq: Seq[A]
  179.  def toSet[B >: A]: immutable.Set[B]
  180.  def toStream: immutable.Stream[A]
  181.  def toString(): String
  182.  def toTraversable: Traversable[A]
  183.  def toVector: Vector[A]
  184.  def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Seq[Seq[B]]
  185.  def union(that: Seq[A]): Seq[A]
  186.  def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (SeqView.Transformed[A1], SeqView.Transformed[A2])
  187.  def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (SeqView.Transformed[A1], SeqView.Transformed[A2], SeqView.Transformed[A3])
  188.  def updated(index: Int, elem: A): Seq[A]
  189.  def view(from: Int, until: Int): SeqView[A, SeqView[A, Coll]]
  190.  def view: SeqView[A, SeqView[A, Coll]]
  191.  def viewIdString: String
  192.  def viewIdentifier: String
  193.  def viewToString: String
  194.  final def wait(): Unit
  195.  final def wait(arg0: Long, arg1: Int): Unit
  196.  final def wait(arg0: Long): Unit
  197.  def withFilter(p: (A) ⇒ Boolean): SeqView[A, Coll]
  198.  def zip[B](that: GenIterable[B]): Seq[(A, B)]
  199.  def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): Seq[(A, B)]
  200.  def zipWithIndex: Seq[(A, Int)]
  201.  def →[B](y: B): (SeqView[A, Coll], B)
Deprecated Value Members
  1.  def /:[B](z: B)(op: (B, A) ⇒ B): B
  2.  def :\[B](z: B)(op: (A, B) ⇒ B): B
Inherited from (Int) ⇒ A Inherited by implicit conversion MonadOps from SeqView[A, Coll] to MonadOps[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