Showing content from http://www.scala-lang.org/api/2.12.19/scala/collection/mutable/ArrayOps$$ofUnit.html below:
Scala Standard Library 2.12.19 - scala.collection.mutable.ArrayOps.ofUnit
final class ofUnit extends AnyVal with ArrayOps[Unit] with ArrayLike[Unit, Array[Unit]]
î· î
Ordering
- Alphabetic
- By Inheritance
Inherited
- ofUnit
- ArrayOps
- CustomParallelizable
- ArrayLike
- IndexedSeqOptimized
- IndexedSeqOptimized
- IndexedSeqLike
- IndexedSeqLike
- SeqLike
- GenSeqLike
- IterableLike
- GenIterableLike
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- Equals
- AnyVal
- Any
Implicitly
- by CollectionsHaveToParArray
- by MonadOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
Value Members
- î
final def !=(arg0: Any): Boolean
- î
final def ##(): Int
- î
def +(other: String): String
- î
def ++[B >: Unit, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Array[Unit], B, That]): That
- î
def ++:[B >: Unit, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Array[Unit], B, That]): That
- î
def ++:[B](that: TraversableOnce[B]): Array[B]
- î
def +:[B >: Unit](elem: B)(implicit arg0: ClassTag[B]): Array[B]
- î
def +:(elem: A): Array[A]
- î
def ->[B](y: B): (ofUnit, B)
- î
def :+[B >: Unit](elem: B)(implicit arg0: ClassTag[B]): Array[B]
- î
def :+(elem: A): Array[A]
- î
final def ==(arg0: Any): Boolean
- î
def addString(b: scala.StringBuilder): scala.StringBuilder
- î
def addString(b: scala.StringBuilder, sep: String): scala.StringBuilder
- î
def addString(b: scala.StringBuilder, start: String, sep: String, end: String): scala.StringBuilder
- î
def aggregate[B](z: â B)(seqop: (B, Unit) â B, combop: (B, B) â B): B
- î
def apply(index: Int): Unit
- î
final def asInstanceOf[T0]: T0
- î
def canEqual(that: Any): Boolean
- î
def collect[B](pf: PartialFunction[A, B]): Array[B]
- î
def collectFirst[B](pf: PartialFunction[Unit, B]): Option[B]
- î
def combinations(n: Int): Iterator[Array[Unit]]
- î
def contains[A1 >: Unit](elem: A1): Boolean
- î
def containsSlice[B](that: GenSeq[B]): Boolean
- î
def copyToArray(xs: Array[A], start: Int, len: Int): Unit
- î
def copyToArray(xs: Array[A]): Unit
- î
def copyToArray(xs: Array[A], start: Int): Unit
- î
def copyToBuffer[B >: Unit](dest: Buffer[B]): Unit
- î
def corresponds[B](that: GenSeq[B])(p: (Unit, B) â Boolean): Boolean
- î
def count(p: (Unit) â Boolean): Int
- î
def deep: collection.IndexedSeq[Any]
- î
def diff(that: collection.Seq[Unit]): Array[Unit]
- î
def distinct: Array[Unit]
- î
def drop(n: Int): Array[Unit]
- î
def dropRight(n: Int): Array[Unit]
- î
def dropWhile(p: (Unit) â Boolean): Array[Unit]
- î
def endsWith[B](that: GenSeq[B]): Boolean
- î
def ensuring(cond: (ofUnit) â Boolean, msg: â Any): ofUnit
- î
def ensuring(cond: (ofUnit) â Boolean): ofUnit
- î
def ensuring(cond: Boolean, msg: â Any): ofUnit
- î
def ensuring(cond: Boolean): ofUnit
- î
def exists(p: (Unit) â Boolean): Boolean
- î
def filter(p: (Unit) â Boolean): Array[Unit]
- î
def filterNot(p: (Unit) â Boolean): Array[Unit]
- î
def find(p: (Unit) â Boolean): Option[Unit]
- î
def flatMap[B](f: (A) â GenTraversableOnce[B]): Array[B]
- î
def flatten[U](implicit asTrav: (Unit) â collection.Traversable[U], m: ClassTag[U]): Array[U]
- î
def fold[A1 >: Unit](z: A1)(op: (A1, A1) â A1): A1
- î
def foldLeft[B](z: B)(op: (B, Unit) â B): B
- î
def foldRight[B](z: B)(op: (Unit, B) â B): B
- î
def forall(p: (Unit) â Boolean): Boolean
- î
def foreach(f: (A) â Unit): Unit
- î
def getClass(): Class[_ <: AnyVal]
- î
def groupBy[K](f: (Unit) â K): immutable.Map[K, Array[Unit]]
- î
def grouped(size: Int): Iterator[Array[Unit]]
- î
def hasDefiniteSize: Boolean
- î
def head: Unit
- î
def headOption: Option[Unit]
- î
def indexOf(elem: Unit, from: Int): Int
- î
def indexOf(elem: Unit): Int
- î
def indexOfSlice[B >: Unit](that: GenSeq[B], from: Int): Int
- î
def indexOfSlice[B >: Unit](that: GenSeq[B]): Int
- î
def indexWhere(p: (Unit) â Boolean, from: Int): Int
- î
def indexWhere(p: (Unit) â Boolean): Int
- î
def indices: immutable.Range
- î
def init: Array[Unit]
- î
def inits: Iterator[Array[Unit]]
- î
def intersect(that: collection.Seq[Unit]): Array[Unit]
- î
def isDefinedAt(idx: Int): Boolean
- î
def isEmpty: Boolean
- î
final def isInstanceOf[T0]: Boolean
- î
final def isTraversableAgain: Boolean
- î
def iterator: Iterator[Unit]
- î
def last: Unit
- î
def lastIndexOf(elem: Unit, end: Int): Int
- î
def lastIndexOf(elem: Unit): Int
- î
def lastIndexOfSlice[B >: Unit](that: GenSeq[B], end: Int): Int
- î
def lastIndexOfSlice[B >: Unit](that: GenSeq[B]): Int
- î
def lastIndexWhere(p: (Unit) â Boolean, end: Int): Int
- î
def lastIndexWhere(p: (Unit) â Boolean): Int
- î
def lastOption: Option[Unit]
- î
def length: Int
- î
def lengthCompare(len: Int): Int
- î
def map[B](f: (A) â B): Array[B]
- î
def max: A
- î
def maxBy[B](f: (A) â B): A
- î
def min: A
- î
def minBy[B](f: (A) â B): A
- î
def mkString: String
- î
def mkString(sep: String): String
- î
def mkString(start: String, sep: String, end: String): String
- î
def newBuilder: ArrayBuilder.ofUnit
- î
def nonEmpty: Boolean
- î
def padTo(len: Int, elem: A): Array[A]
- î
def par: ParArray[Unit]
- î
def parCombiner: Combiner[Unit, ParArray[Unit]]
- î
def partition(p: (Unit) â Boolean): (Array[Unit], Array[Unit])
- î
def patch(from: Int, that: GenSeq[A], replaced: Int): Array[A]
- î
def permutations: Iterator[Array[Unit]]
- î
def prefixLength(p: (Unit) â Boolean): Int
- î
def product: A
- î
def reduce[A1 >: Unit](op: (A1, A1) â A1): A1
- î
def reduceLeft[B >: Unit](op: (B, Unit) â B): B
- î
def reduceLeftOption[B >: Unit](op: (B, Unit) â B): Option[B]
- î
def reduceOption[A1 >: Unit](op: (A1, A1) â A1): Option[A1]
- î
def reduceRight[B >: Unit](op: (Unit, B) â B): B
- î
def reduceRightOption[B >: Unit](op: (Unit, B) â B): Option[B]
- î
val repr: Array[Unit]
- î
def reverse: Array[Unit]
- î
def reverseIterator: Iterator[Unit]
- î
def reverseMap[B](f: (A) â B): Array[B]
- î
def reversed: List[Unit]
- î
def sameElements(that: GenIterable[A]): Boolean
- î
def scan[B >: Unit, That](z: B)(op: (B, B) â B)(implicit cbf: CanBuildFrom[Array[Unit], B, That]): That
- î
def scanLeft[B, That](z: B)(op: (B, Unit) â B)(implicit bf: CanBuildFrom[Array[Unit], B, That]): That
- î
def scanRight[B, That](z: B)(op: (Unit, B) â B)(implicit bf: CanBuildFrom[Array[Unit], B, That]): That
- î
def segmentLength(p: (Unit) â Boolean, from: Int): Int
- î
def seq: IndexedSeq[Unit]
- î
def size: Int
- î
def sizeHintIfCheap: Int
- î
def slice(from: Int, until: Int): Array[Unit]
- î
def sliding(size: Int, step: Int): Iterator[Array[Unit]]
- î
def sliding(size: Int): Iterator[Array[Unit]]
- î
def sortBy[B](f: (Unit) â B)(implicit ord: math.Ordering[B]): Array[Unit]
- î
def sortWith(lt: (Unit, Unit) â Boolean): Array[Unit]
- î
def sorted[B >: Unit](implicit ord: math.Ordering[B]): Array[Unit]
- î
def span(p: (Unit) â Boolean): (Array[Unit], Array[Unit])
- î
def splitAt(n: Int): (Array[Unit], Array[Unit])
- î
def startsWith[B](that: GenSeq[B], offset: Int): Boolean
- î
def startsWith[B](that: GenSeq[B]): Boolean
- î
def stringPrefix: String
- î
def sum: A
- î
def tail: Array[Unit]
- î
def tails: Iterator[Array[Unit]]
- î
def take(n: Int): Array[Unit]
- î
def takeRight(n: Int): Array[Unit]
- î
def takeWhile(p: (Unit) â Boolean): Array[Unit]
- î
def thisCollection: WrappedArray[Unit]
- î
def to[Col[_]]: Col[A]
- î
def toArray: Array[A]
- î
def toBuffer[A1 >: Unit]: Buffer[A1]
- î
def toCollection(repr: Array[Unit]): WrappedArray[Unit]
- î
def toIndexedSeq: immutable.IndexedSeq[Unit]
- î
def toIterable: collection.Iterable[Unit]
- î
def toIterator: Iterator[Unit]
- î
def toList: List[Unit]
- î
def toMap[T, U]: collection.Map[T, U]
- î
def toParArray: ParArray[T]
- î
def toSeq: collection.Seq[Unit]
- î
def toSet[B >: Unit]: immutable.Set[B]
- î
def toStream: immutable.Stream[Unit]
- î
def toString(): String
- î
def toTraversable: collection.Traversable[Unit]
- î
def toVector: Vector[Unit]
- î
def transpose[U](implicit asArray: (Unit) â Array[U]): Array[Array[U]]
- î
def union(that: collection.Seq[Unit]): Array[Unit]
- î
def unzip[T1, T2](implicit asPair: (Unit) â (T1, T2), ct1: ClassTag[T1], ct2: ClassTag[T2]): (Array[T1], Array[T2])
- î
def unzip3[T1, T2, T3](implicit asTriple: (Unit) â (T1, T2, T3), ct1: ClassTag[T1], ct2: ClassTag[T2], ct3: ClassTag[T3]): (Array[T1], Array[T2], Array[T3])
- î
def update(index: Int, elem: Unit): Unit
- î
def updated(index: Int, elem: A): Array[A]
- î
def view(from: Int, until: Int): IndexedSeqView[Unit, Array[Unit]]
- î
def view: IndexedSeqView[Unit, Array[Unit]]
- î
def withFilter(p: (Unit) â Boolean): FilterMonadic[Unit, Array[Unit]]
- î
def zip[B](that: GenIterable[B]): Array[(A, B)]
- î
def zipAll[B](that: collection.Iterable[B], thisElem: A, thatElem: B): Array[(A, B)]
- î
def zipWithIndex: Array[(A, Int)]
- î
def â[B](y: B): (ofUnit, B)
Deprecated Value Members
- î
def /:[B](z: B)(op: (B, Unit) â B): B
- î
def :\[B](z: B)(op: (Unit, B) â B): B
- î
def formatted(fmtstr: String): String
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