zio/zio/Chunk/IntArray

IntArray

final case class IntArray(array: Array[Int])
trait Product
class Chunk[Int]
trait ChunkLike[Int]
trait Seq[Int]
trait Seq[Int]
trait Equals
trait Int => Int
trait Iterable[Int]
trait Iterable[Int]
class Object
trait Matchable
class Any

Value members

Concrete methods

override def int(index: Int)(implicit ev: Int <:< Int): Int
Definition Classes

Inherited methods

final def ++[A1 >: Int](that: NonEmptyChunk[A1]): NonEmptyChunk[A1]
Inherited from:
Chunk
final def ++[A1 >: Int](that: Chunk[A1]): Chunk[A1]

Returns the concatenation of this chunk with the specified chunk.

Returns the concatenation of this chunk with the specified chunk.

Inherited from:
Chunk
final def ++[B >: Int](suffix: IterableOnce[B]): Chunk[B]
Inherited from:
IterableOps
final override def ++:[B >: Int](prefix: IterableOnce[B]): Chunk[B]
Definition Classes
Inherited from:
SeqOps
final def +:[B >: Int](elem: B): Chunk[B]
Inherited from:
SeqOps
final def :+[B >: Int](elem: B): Chunk[B]
Inherited from:
SeqOps
final def :++[B >: Int](suffix: IterableOnce[B]): Chunk[B]
Inherited from:
SeqOps
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Inherited from:
IterableOnceOps
override def andThen[C](k: Int => C): PartialFunction[Int, C]
Definition Classes
Inherited from:
PartialFunction
final override def appended[A1 >: Int](a1: A1): Chunk[A1]
Definition Classes
Inherited from:
ChunkLike
override def appendedAll[B >: Int](suffix: IterableOnce[B]): Chunk[B]
Definition Classes
Inherited from:
StrictOptimizedSeqOps
override def apply(n: Int): Int
Definition Classes
Arr -> SeqOps -> Function1
Inherited from:
Arr
def applyOrElse[A1 <: Int, B1 >: Int](x: A1, default: A1 => B1): B1
Inherited from:
PartialFunction
final def asBits(implicit ev: Int <:< Byte): Chunk[Boolean]

Converts a chunk of bytes to a chunk of bits.

Converts a chunk of bytes to a chunk of bits.

Inherited from:
Chunk
def boolean(index: Int)(implicit ev: Int <:< Boolean): Boolean

Get the element at the specified index.

Get the element at the specified index.

Inherited from:
Chunk
def byte(index: Int)(implicit ev: Int <:< Byte): Byte

Get the element at the specified index.

Get the element at the specified index.

Inherited from:
Chunk
override def canEqual(that: Any): Boolean
Definition Classes
Inherited from:
IndexedSeq
def char(index: Int)(implicit ev: Int <:< Char): Char

Get the element at the specified index.

Get the element at the specified index.

Inherited from:
Chunk
override def collect[B](pf: PartialFunction[Int, B]): Chunk[B]

Returns a filtered, mapped subset of the elements of this Chunk.

Returns a filtered, mapped subset of the elements of this Chunk.

Definition Classes
Inherited from:
ChunkLike
override protected def collectChunk[B](pf: PartialFunction[Int, B]): Chunk[B]
Definition Classes
Arr -> Chunk
Inherited from:
Arr
def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]
Inherited from:
IterableOnceOps
override def collectM[R, E, B](pf: PartialFunction[Int, ZIO[R, E, B]]): ZIO[R, E, Chunk[B]]
Definition Classes
Arr -> Chunk
Inherited from:
Arr
override def collectWhile[B](pf: PartialFunction[Int, B]): Chunk[B]
Definition Classes
Arr -> Chunk
Inherited from:
Arr
override def collectWhileM[R, E, B](pf: PartialFunction[Int, ZIO[R, E, B]]): ZIO[R, E, Chunk[B]]
Definition Classes
Arr -> Chunk
Inherited from:
Arr
def combinations(n: Int): Iterator[Chunk[Int]]
Inherited from:
SeqOps
def compose[A](g: A => Int): A => Int
Inherited from:
Function1
final override def concat[B >: Int](suffix: IterableOnce[B]): Chunk[B]
Definition Classes
Inherited from:
SeqOps
def contains[A1 >: Int](elem: A1): Boolean
Inherited from:
SeqOps
def containsSlice[B >: Int](that: Seq[B]): Boolean
Inherited from:
SeqOps
def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Int
Inherited from:
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: Int](xs: Array[B], start: Int): Int
Inherited from:
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: Int](xs: Array[B]): Int
Inherited from:
IterableOnceOps
final def corresponds[B](that: Chunk[B])(f: (Int, B) => Boolean): Boolean

Determines whether this chunk and the specified chunk have the same length and every pair of corresponding elements of this chunk and the specified chunk satisfy the specified predicate.

Determines whether this chunk and the specified chunk have the same length and every pair of corresponding elements of this chunk and the specified chunk satisfy the specified predicate.

Inherited from:
Chunk
def corresponds[B](that: IterableOnce[B])(p: (Int, B) => Boolean): Boolean
Inherited from:
IterableOnceOps
def corresponds[B](that: Seq[B])(p: (Int, B) => Boolean): Boolean
Inherited from:
SeqOps
def count(p: Int => Boolean): Int
Inherited from:
IterableOnceOps
override def diff[B >: Int](that: Seq[B]): Chunk[Int]
Definition Classes
Inherited from:
StrictOptimizedSeqOps
def distinct: Chunk[Int]
Inherited from:
SeqOps
override def distinctBy[B](f: Int => B): Chunk[Int]
def double(index: Int)(implicit ev: Int <:< Double): Double

Get the element at the specified index.

Get the element at the specified index.

Inherited from:
Chunk
override def drop(n: Int): Chunk[Int]

Drops the first n elements of the chunk.

Drops the first n elements of the chunk.

Definition Classes
Inherited from:
Chunk
override def dropRight(n: Int): Chunk[Int]

Drops the last n elements of the chunk.

Drops the last n elements of the chunk.

Definition Classes
Inherited from:
Chunk
override def dropWhile(f: Int => Boolean): Chunk[Int]
Definition Classes
Inherited from:
Arr
def dropWhileM[R, E](p: Int => ZIO[R, E, Boolean]): ZIO[R, E, Chunk[Int]]
Inherited from:
Chunk
override def empty: Chunk[Int]
def endsWith[B >: Int](that: Iterable[B]): Boolean
Inherited from:
SeqOps
final override def equals(that: Any): Boolean
Definition Classes
Chunk -> Seq -> Equals -> Any
Inherited from:
Chunk
final override def exists(f: Int => Boolean): Boolean

Determines whether a predicate is satisfied for at least one element of this chunk.

Determines whether a predicate is satisfied for at least one element of this chunk.

Definition Classes
Inherited from:
Chunk
override def filter(f: Int => Boolean): Chunk[Int]
Definition Classes
Inherited from:
Arr
final def filterM[R, E](f: Int => ZIO[R, E, Boolean]): ZIO[R, E, Chunk[Int]]

Filters this chunk by the specified effectful predicate, retaining all elements for which the predicate evaluates to true.

Filters this chunk by the specified effectful predicate, retaining all elements for which the predicate evaluates to true.

Inherited from:
Chunk
override def filterNot(pred: Int => Boolean): Chunk[Int]
final override def find(f: Int => Boolean): Option[Int]

Returns the first element that satisfies the predicate.

Returns the first element that satisfies the predicate.

Definition Classes
Inherited from:
Chunk
def findLast(p: Int => Boolean): Option[Int]
Inherited from:
SeqOps
final override def flatMap[B](f: Int => IterableOnce[B]): Chunk[B]

Returns the concatenation of mapping every element into a new chunk using the specified function.

Returns the concatenation of mapping every element into a new chunk using the specified function.

Definition Classes
Inherited from:
ChunkLike
final def flatten[B](implicit ev: Int <:< Chunk[B]): Chunk[B]

Flattens a chunk of chunks into a single chunk by concatenating all chunks.

Flattens a chunk of chunks into a single chunk by concatenating all chunks.

Inherited from:
Chunk
override def flatten[B](implicit toIterableOnce: Int => IterableOnce[B]): Chunk[B]
def float(index: Int)(implicit ev: Int <:< Float): Float

Get the element at the specified index.

Get the element at the specified index.

Inherited from:
Chunk
def fold[A1 >: Int](z: A1)(op: (A1, A1) => A1): A1
Inherited from:
IterableOnceOps
override def foldLeft[S](s0: S)(f: (S, Int) => S): S
Definition Classes
Inherited from:
Arr
final def foldM[R, E, S](s: S)(f: (S, Int) => ZIO[R, E, S]): ZIO[R, E, S]

Effectfully folds over the elements in this chunk from the left.

Effectfully folds over the elements in this chunk from the left.

Inherited from:
Chunk
override def foldRight[S](s0: S)(f: (Int, S) => S): S
Definition Classes
Inherited from:
Arr
final def foldWhile[S](s0: S)(pred: S => Boolean)(f: (S, Int) => S): S

Folds over the elements in this chunk from the left. Stops the fold early when the condition is not fulfilled.

Folds over the elements in this chunk from the left. Stops the fold early when the condition is not fulfilled.

Inherited from:
Chunk
final def foldWhileM[R, E, S](z: S)(pred: S => Boolean)(f: (S, Int) => ZIO[R, E, S]): ZIO[R, E, S]
Inherited from:
Chunk
final override def forall(f: Int => Boolean): Boolean

Determines whether a predicate is satisfied for all elements of this chunk.

Determines whether a predicate is satisfied for all elements of this chunk.

Definition Classes
Inherited from:
Chunk
override def foreach[B](f: Int => B): Unit
Definition Classes
Inherited from:
Arr
protected def fromSpecific(coll: IterableOnce[Int]): Chunk[Int]
def groupBy[K](f: Int => K): Map[K, Chunk[Int]]
Inherited from:
IterableOps
def groupMap[K, B](key: Int => K)(f: Int => B): Map[K, Chunk[B]]
Inherited from:
IterableOps
def groupMapReduce[K, B](key: Int => K)(f: Int => B)(reduce: (B, B) => B): Map[K, B]
Inherited from:
IterableOps
def grouped(size: Int): Iterator[Chunk[Int]]
Inherited from:
IterableOps
final override def hashCode: Int
Definition Classes
Chunk -> Seq -> Any
Inherited from:
Chunk
override def head: Int

Returns the first element of this chunk. Note that this method is partial in that it will throw an exception if the chunk is empty. Consider using headOption to explicitly handle the possibility that the chunk is empty or iterating over the elements of the chunk in lower level, performance sensitive code unless you really only need the first element of the chunk.

Returns the first element of this chunk. Note that this method is partial in that it will throw an exception if the chunk is empty. Consider using headOption to explicitly handle the possibility that the chunk is empty or iterating over the elements of the chunk in lower level, performance sensitive code unless you really only need the first element of the chunk.

Definition Classes
Inherited from:
Chunk
final override def headOption: Option[Int]

Returns the first element of this chunk if it exists.

Returns the first element of this chunk if it exists.

Definition Classes
Inherited from:
Chunk
@deprecatedOverriding(message = "Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", since = "2.13.0")
def indexOf[B >: Int](elem: B): Int
Inherited from:
SeqOps
def indexOf[B >: Int](elem: B, from: Int): Int
Inherited from:
SeqOps
@deprecatedOverriding(message = "Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", since = "2.13.0")
def indexOfSlice[B >: Int](that: Seq[B]): Int
Inherited from:
SeqOps
def indexOfSlice[B >: Int](that: Seq[B], from: Int): Int
Inherited from:
SeqOps
final override def indexWhere(f: Int => Boolean, from: Int): Int

Returns the first index for which the given predicate is satisfied after or at some given index.

Returns the first index for which the given predicate is satisfied after or at some given index.

Definition Classes
Inherited from:
Chunk
@deprecatedOverriding(message = "Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", since = "2.13.0")
def indexWhere(p: Int => Boolean): Int
Inherited from:
SeqOps
def indices: Range
Inherited from:
SeqOps
def init: Chunk[Int]
Inherited from:
IterableOps
def inits: Iterator[Chunk[Int]]
Inherited from:
IterableOps
override def intersect[B >: Int](that: Seq[B]): Chunk[Int]
Definition Classes
Inherited from:
StrictOptimizedSeqOps
def isDefinedAt(idx: Int): Boolean
Inherited from:
SeqOps
final override def isEmpty: Boolean

Determines if the chunk is empty.

Determines if the chunk is empty.

Definition Classes
Inherited from:
Chunk
override def isTraversableAgain: Boolean
Definition Classes
Inherited from:
IterableOps
def iterator: Iterator[Int]
Inherited from:
IndexedSeqOps
override def knownSize: Int
Definition Classes
Inherited from:
IndexedSeqOps
override def last: Int
Definition Classes
Inherited from:
IndexedSeqOps
def lastIndexOf[B >: Int](elem: B, end: Int): Int
Inherited from:
SeqOps
@deprecatedOverriding(message = "Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", since = "2.13.0")
def lastIndexOfSlice[B >: Int](that: Seq[B]): Int
Inherited from:
SeqOps
def lastIndexOfSlice[B >: Int](that: Seq[B], end: Int): Int
Inherited from:
SeqOps
@deprecatedOverriding(message = "Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", since = "2.13.0")
def lastIndexWhere(p: Int => Boolean): Int
Inherited from:
SeqOps
def lastIndexWhere(p: Int => Boolean, end: Int): Int
Inherited from:
SeqOps
final override def lastOption: Option[Int]

Returns the last element of this chunk if it exists.

Returns the last element of this chunk if it exists.

Definition Classes
Inherited from:
Chunk
def lazyZip[B](that: Iterable[B]): LazyZip2[Int, B, IntArray]
Inherited from:
Iterable
final override def lengthCompare(that: Iterable[_]): Int
Definition Classes
Inherited from:
IndexedSeqOps
final override def lengthCompare(len: Int): Int
Definition Classes
Inherited from:
IndexedSeqOps
final def lengthIs: SizeCompareOps
Inherited from:
SeqOps
def lift: Int => Option[Int]
Inherited from:
PartialFunction
def long(index: Int)(implicit ev: Int <:< Long): Long

Get the element at the specified index.

Get the element at the specified index.

Inherited from:
Chunk
final override def map[B](f: Int => B): Chunk[B]

Returns a chunk with the elements mapped by the specified function.

Returns a chunk with the elements mapped by the specified function.

Definition Classes
Inherited from:
ChunkLike
final def mapAccum[S1, B](s1: S1)(f1: (S1, Int) => (S1, B)): (S1, Chunk[B])

Statefully maps over the chunk, producing new elements of type B.

Statefully maps over the chunk, producing new elements of type B.

Inherited from:
Chunk
final def mapAccumM[R, E, S1, B](s1: S1)(f1: (S1, Int) => ZIO[R, E, (S1, B)]): ZIO[R, E, (S1, Chunk[B])]

Statefully and effectfully maps over the elements of this chunk to produce new elements.

Statefully and effectfully maps over the elements of this chunk to produce new elements.

Inherited from:
Chunk
override protected def mapChunk[B](f: Int => B): Chunk[B]
Definition Classes
Arr -> Chunk
Inherited from:
Arr
final def mapM[R, E, B](f: Int => ZIO[R, E, B]): ZIO[R, E, Chunk[B]]

Effectfully maps the elements of this chunk.

Effectfully maps the elements of this chunk.

Inherited from:
Chunk
final def mapMPar[R, E, B](f: Int => ZIO[R, E, B]): ZIO[R, E, Chunk[B]]

Effectfully maps the elements of this chunk in parallel.

Effectfully maps the elements of this chunk in parallel.

Inherited from:
Chunk
final def mapMPar_[R, E](f: Int => ZIO[R, E, Any]): ZIO[R, E, Unit]

Effectfully maps the elements of this chunk in parallel purely for the effects.

Effectfully maps the elements of this chunk in parallel purely for the effects.

Inherited from:
Chunk
final def mapM_[R, E](f: Int => ZIO[R, E, Any]): ZIO[R, E, Unit]

Effectfully maps the elements of this chunk purely for the effects.

Effectfully maps the elements of this chunk purely for the effects.

Inherited from:
Chunk
override def materialize[A1 >: Int]: Chunk[A1]
Definition Classes
Arr -> Chunk
Inherited from:
Arr
def max[B >: Int](implicit ord: Ordering[B]): Int
Inherited from:
IterableOnceOps
def maxBy[B](f: Int => B)(implicit cmp: Ordering[B]): Int
Inherited from:
IterableOnceOps
def maxByOption[B](f: Int => B)(implicit cmp: Ordering[B]): Option[Int]
Inherited from:
IterableOnceOps
def maxOption[B >: Int](implicit ord: Ordering[B]): Option[Int]
Inherited from:
IterableOnceOps
def min[B >: Int](implicit ord: Ordering[B]): Int
Inherited from:
IterableOnceOps
def minBy[B](f: Int => B)(implicit cmp: Ordering[B]): Int
Inherited from:
IterableOnceOps
def minByOption[B](f: Int => B)(implicit cmp: Ordering[B]): Option[Int]
Inherited from:
IterableOnceOps
def minOption[B >: Int](implicit ord: Ordering[B]): Option[Int]
Inherited from:
IterableOnceOps
final def mkString: String
Inherited from:
IterableOnceOps
final def mkString(sep: String): String
Inherited from:
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String
Inherited from:
IterableOnceOps
@deprecatedOverriding(message = "nonEmpty is defined as !isEmpty; override isEmpty instead", since = "2.13.0")
def nonEmpty: Boolean
Inherited from:
IterableOnceOps
def nonEmptyOrElse[B](ifEmpty: => B)(fn: NonEmptyChunk[Int] => B): B

Runs fn if a chunk is not empty or returns default value

Runs fn if a chunk is not empty or returns default value

Inherited from:
Chunk
def orElse[A1 <: Int, B1 >: Int](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Inherited from:
PartialFunction
override def padTo[B >: Int](len: Int, elem: B): Chunk[B]
Definition Classes
Inherited from:
StrictOptimizedSeqOps
override def partition(p: Int => Boolean): (Chunk[Int], Chunk[Int])
final override def partitionMap[B, C](f: Int => Either[B, C]): (Chunk[B], Chunk[C])

Partitions the elements of this chunk into two chunks using the specified function.

Partitions the elements of this chunk into two chunks using the specified function.

Definition Classes
Inherited from:
Chunk
override def patch[B >: Int](from: Int, other: IterableOnce[B], replaced: Int): Chunk[B]
Definition Classes
Inherited from:
StrictOptimizedSeqOps
def permutations: Iterator[Chunk[Int]]
Inherited from:
SeqOps
final override def prepended[A1 >: Int](a1: A1): Chunk[A1]
Definition Classes
Inherited from:
ChunkLike
override def prependedAll[B >: Int](prefix: IterableOnce[B]): Chunk[B]
Definition Classes
Inherited from:
StrictOptimizedSeqOps
def product[B >: Int](implicit num: Numeric[B]): B
Inherited from:
IterableOnceOps
def productIterator: Iterator[Any]
Inherited from:
Product
def reduce[B >: Int](op: (B, B) => B): B
Inherited from:
IterableOnceOps
def reduceLeft[B >: Int](op: (B, Int) => B): B
Inherited from:
IterableOnceOps
def reduceLeftOption[B >: Int](op: (B, Int) => B): Option[B]
Inherited from:
IterableOnceOps
def reduceOption[B >: Int](op: (B, B) => B): Option[B]
Inherited from:
IterableOnceOps
def reduceRight[B >: Int](op: (Int, B) => B): B
Inherited from:
IterableOnceOps
def reduceRightOption[B >: Int](op: (Int, B) => B): Option[B]
Inherited from:
IterableOnceOps
override def reverse: Chunk[Int]
Definition Classes
Inherited from:
IndexedSeqOps
override def reverseIterator: Iterator[Int]
Definition Classes
Inherited from:
IndexedSeqOps
override protected def reversed: Iterable[Int]
Definition Classes
Inherited from:
IndexedSeqOps
def runWith[U](action: Int => U): Int => Boolean
Inherited from:
PartialFunction
override def sameElements[B >: Int](o: IterableOnce[B]): Boolean
Definition Classes
Inherited from:
IndexedSeq
def scala$collection$SeqOps$$super$concat[B >: Int](suffix: IterableOnce[B]): Chunk[B]
Inherited from:
SeqOps
def scan[B >: Int](z: B)(op: (B, B) => B): Chunk[B]
Inherited from:
IterableOps
override def scanLeft[B](z: B)(op: (B, Int) => B): Chunk[B]
def scanRight[B](z: B)(op: (Int, B) => B): Chunk[B]
Inherited from:
IterableOps
override def search[B >: Int](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
Definition Classes
Inherited from:
IndexedSeqOps
override def search[B >: Int](elem: B)(implicit ord: Ordering[B]): SearchResult
Definition Classes
Inherited from:
IndexedSeqOps
def segmentLength(p: Int => Boolean, from: Int): Int
Inherited from:
SeqOps
final def segmentLength(p: Int => Boolean): Int
Inherited from:
SeqOps
def short(index: Int)(implicit ev: Int <:< Short): Short

Get the element at the specified index.

Get the element at the specified index.

Inherited from:
Chunk
final override def size: Int
Definition Classes
Inherited from:
SeqOps
final override def sizeCompare(that: Iterable[_]): Int
Definition Classes
Inherited from:
SeqOps
final override def sizeCompare(otherSize: Int): Int
Definition Classes
Inherited from:
SeqOps
final def sizeIs: SizeCompareOps
Inherited from:
IterableOps
override def slice(from: Int, until: Int): Chunk[Int]
Definition Classes
Inherited from:
IndexedSeqOps
def sliding(size: Int, step: Int): Iterator[Chunk[Int]]
Inherited from:
IterableOps
def sliding(size: Int): Iterator[Chunk[Int]]
Inherited from:
IterableOps
def sortBy[B](f: Int => B)(implicit ord: Ordering[B]): Chunk[Int]
Inherited from:
SeqOps
def sortWith(lt: (Int, Int) => Boolean): Chunk[Int]
Inherited from:
SeqOps
override def sorted[B >: Int](implicit ord: Ordering[B]): Chunk[Int]
Definition Classes
Inherited from:
StrictOptimizedSeqOps
override def span(p: Int => Boolean): (Chunk[Int], Chunk[Int])
final def split(n: Int): Chunk[Chunk[Int]]

Splits this chunk into n equally sized chunks.

Splits this chunk into n equally sized chunks.

Inherited from:
Chunk
final override def splitAt(n: Int): (Chunk[Int], Chunk[Int])

Returns two splits of this chunk at the specified index.

Returns two splits of this chunk at the specified index.

Definition Classes
Inherited from:
Chunk
final def splitWhere(f: Int => Boolean): (Chunk[Int], Chunk[Int])

Splits this chunk on the first element that matches this predicate.

Splits this chunk on the first element that matches this predicate.

Inherited from:
Chunk
def startsWith[B >: Int](that: IterableOnce[B], offset: Int): Boolean
Inherited from:
SeqOps
override def stepper[S <: Stepper[_]](implicit shape: StepperShape[Int, S]): S & EfficientSplit
Definition Classes
Inherited from:
IndexedSeqOps
def sum[B >: Int](implicit num: Numeric[B]): B
Inherited from:
IterableOnceOps
def tail: Chunk[Int]
Inherited from:
IterableOps
def tails: Iterator[Chunk[Int]]
Inherited from:
IterableOps
override def take(n: Int): Chunk[Int]

Takes the first n elements of the chunk.

Takes the first n elements of the chunk.

Definition Classes
Inherited from:
Chunk
override def takeRight(n: Int): Chunk[Int]

Takes the last n elements of the chunk.

Takes the last n elements of the chunk.

Definition Classes
Inherited from:
Chunk
override def takeWhile(f: Int => Boolean): Chunk[Int]

Takes all elements so long as the predicate returns true.

Takes all elements so long as the predicate returns true.

Definition Classes
Inherited from:
Arr
def takeWhileM[R, E](p: Int => ZIO[R, E, Boolean]): ZIO[R, E, Chunk[Int]]

Takes all elements so long as the effectual predicate returns true.

Takes all elements so long as the effectual predicate returns true.

Inherited from:
Chunk
override def tapEach[U](f: Int => U): Chunk[Int]
def to[C1](factory: Factory[Int, C1]): C1
Inherited from:
IterableOnceOps
override def toArray[A1 >: Int : ClassTag]: Array[A1]

Converts the chunk into an array.

Converts the chunk into an array.

Definition Classes
Inherited from:
Chunk
final def toBinaryString(implicit ev: Int <:< Boolean): String

Renders this chunk of bits as a binary string.

Renders this chunk of bits as a binary string.

Inherited from:
Chunk
final def toBuffer[B >: Int]: Buffer[B]
Inherited from:
IterableOnceOps
final override def toIndexedSeq: IndexedSeq[Int]
Definition Classes
Inherited from:
IndexedSeq
final override def toList: List[Int]
Definition Classes
Inherited from:
Chunk
def toMap[K, V](implicit ev: Int <:< (K, V)): Map[K, V]
Inherited from:
IterableOnceOps
final override def toSeq: IntArray
Definition Classes
Inherited from:
Seq
def toSet[B >: Int]: Set[B]
Inherited from:
IterableOnceOps
final override def toString: String
Definition Classes
Chunk -> Seq -> Function1 -> Iterable -> Any
Inherited from:
Chunk
final override def toVector: Vector[Int]
Definition Classes
Inherited from:
Chunk
def transpose[B](implicit asIterable: Int => Iterable[B]): Chunk[Chunk[B]]
Inherited from:
IterableOps
def unapply(a: Int): Option[Int]
Inherited from:
PartialFunction
override def unzip[A1, A2](implicit asPair: Int => (A1, A2)): (Chunk[A1], Chunk[A2])
override def unzip3[A1, A2, A3](implicit asTriple: Int => (A1, A2, A3)): (Chunk[A1], Chunk[A2], Chunk[A3])
override def updated[B >: Int](index: Int, elem: B): Chunk[B]
Definition Classes
Inherited from:
StrictOptimizedSeqOps
override def view: IndexedSeqView[Int]
Definition Classes
Inherited from:
IndexedSeqOps
def withFilter(p: Int => Boolean): WithFilter[Int, Chunk]
Inherited from:
IterableOps
final def zip[B](that: Chunk[B]): Chunk[(Int, B)]

Zips this chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk. The returned chunk will have the length of the shorter chunk.

Zips this chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk. The returned chunk will have the length of the shorter chunk.

Inherited from:
Chunk
override def zip[B](that: IterableOnce[B]): Chunk[(Int, B)]
final def zipAll[B](that: Chunk[B]): Chunk[(Option[Int], Option[B])]

Zips this chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk, filling in missing values from the shorter chunk with None. The returned chunk will have the length of the longer chunk.

Zips this chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk, filling in missing values from the shorter chunk with None. The returned chunk will have the length of the longer chunk.

Inherited from:
Chunk
def zipAll[A1 >: Int, B](that: Iterable[B], thisElem: A1, thatElem: B): Chunk[(A1, B)]
Inherited from:
IterableOps
final def zipAllWith[B, C](that: Chunk[B])(left: Int => C, right: B => C)(both: (Int, B) => C): Chunk[C]

Zips with chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk combined using the specified function both. If one chunk is shorter than the other uses the specified function left or right to map the element that does exist to the result type.

Zips with chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk combined using the specified function both. If one chunk is shorter than the other uses the specified function left or right to map the element that does exist to the result type.

Inherited from:
Chunk
final def zipWith[B, C](that: Chunk[B])(f: (Int, B) => C): Chunk[C]

Zips this chunk with the specified chunk using the specified combiner.

Zips this chunk with the specified chunk using the specified combiner.

Inherited from:
Chunk
final override def zipWithIndex: Chunk[(Int, Int)]

Zips this chunk with the index of every element.

Zips this chunk with the index of every element.

Definition Classes
Inherited from:
ChunkLike
final def zipWithIndexFrom(indexOffset: Int): Chunk[(Int, Int)]

Zips this chunk with the index of every element, starting from the initial index value.

Zips this chunk with the index of every element, starting from the initial index value.

Inherited from:
Chunk

Deprecated and Inherited methods

@deprecated("use :+", "1.0.0")
final def +[A1 >: Int](a: A1): Chunk[A1]

Appends an element to the chunk

Appends an element to the chunk

Deprecated
Inherited from:
Chunk
@inline @deprecated(message = "Use foldLeft instead of /:", since = "2.13.0")
final def /:[B](z: B)(op: (B, Int) => B): B
Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
@inline @deprecated(message = "Use foldRight instead of :\\", since = "2.13.0")
final def :\[B](z: B)(op: (Int, B) => B): B
Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from:
IterableOnceOps
@deprecated(message = "`aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.", since = "2.13.0")
def aggregate[B](z: => B)(seqop: (B, Int) => B, combop: (B, B) => B): B
Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from:
IterableOnceOps
@inline @deprecatedOverriding(message = "Use iterableFactory instead", since = "2.13.0") @deprecated(message = "Use iterableFactory instead", since = "2.13.0")
def companion: IterableFactory[Chunk]
Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
@inline @deprecated(message = "Use `dest ++= coll` instead", since = "2.13.0")
final def copyToBuffer[B >: Int](dest: Buffer[B]): Unit
Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from:
IterableOnceOps
@deprecated(message = "Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)", since = "2.13.0")
def hasDefiniteSize: Boolean
Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from:
IterableOnceOps
@inline @deprecated(message = "Use segmentLength instead of prefixLength", since = "2.13.0")
final def prefixLength(p: Int => Boolean): Int
Deprecated
[Since version 2.13.0] Use segmentLength instead of prefixLength
Inherited from:
SeqOps
@deprecated(message = "Use coll instead of repr in a collection implementation, use the collection value itself from the outside", since = "2.13.0")
final def repr: Chunk[Int]
Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from:
IterableOps
@deprecated(message = "Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)", since = "2.13.0")
def reverseMap[B](f: Int => B): Chunk[B]
Deprecated
[Since version 2.13.0] Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
Inherited from:
SeqOps
@deprecated(message = "Iterable.seq always returns the iterable itself", since = "2.13.0")
def seq: IntArray
Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from:
Iterable
@deprecated(message = "toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections", since = "2.13.7")
final def toIterable: IntArray
Deprecated
[Since version 2.13.7] toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
Iterable
@inline @deprecated(message = "Use .iterator instead of .toIterator", since = "2.13.0")
final def toIterator: Iterator[Int]
Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from:
IterableOnceOps
@inline @deprecated(message = "Use .to(LazyList) instead of .toStream", since = "2.13.0")
final def toStream: Stream[Int]
Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from:
IterableOnceOps
@deprecated(message = "toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections", since = "2.13.0")
final def toTraversable: Iterable[Int]
Deprecated
[Since version 2.13.0] toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
IterableOps
@inline @deprecated(message = "Use `concat` instead", since = "2.13.0")
final def union[B >: Int](that: Seq[B]): Chunk[B]
Deprecated
[Since version 2.13.0] Use `concat` instead
Inherited from:
SeqOps
@deprecated(message = "Use .view.slice(from, until) instead of .view(from, until)", since = "2.13.0")
override def view(from: Int, until: Int): IndexedSeqView[Int]
Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Definition Classes
Inherited from:
IndexedSeqOps

Inherited fields

override val iterableFactory: SeqFactory[Chunk]

Returns a SeqFactory that can construct Chunk values. The SeqFactory exposes a newBuilder method that is not referentially transparent because it allocates mutable state.

Returns a SeqFactory that can construct Chunk values. The SeqFactory exposes a newBuilder method that is not referentially transparent because it allocates mutable state.

Inherited from:
ChunkLike
override val length: Int
Inherited from:
Arr

Implicits

Inherited implicits

implicit val classTag: ClassTag[Int]
Inherited from:
Arr