Chunk

abstract def apply(idx: Int): A

abstract def length: Int

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ++[A1 >: A](that: NonEmptyChunk[A1]): NonEmptyChunk[A1]

final def ++[A1 >: A](that: Chunk[A1]): Chunk[A1]

Returns the concatenation of this chunk with the specified chunk.

def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

final def +:[A1 >: A, That](a1: A1)(implicit bf: CanBuildFrom[Chunk[A], A1, That]): That

def /:[B](z: B)(op: (B, A) ⇒ B): B

final def :+[A1 >: A, That](a1: A1)(implicit bf: CanBuildFrom[Chunk[A], A1, That]): That

def :\[B](z: B)(op: (A, B) ⇒ B): B

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[C](k: (A) ⇒ C): PartialFunction[Int, C]

def append[A1 >: A](a1: A1): Chunk[A1]

Appends an element to the chunk.

def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) ⇒ B1): B1

final def asBits(implicit ev: <:<[A, Byte]): Chunk[Boolean]

Converts a chunk of bytes to a chunk of bits.

final def asInstanceOf[T0]: T0

def boolean(index: Int)(implicit ev: <:<[A, Boolean]): Boolean

Get the element at the specified index.

def byte(index: Int)(implicit ev: <:<[A, Byte]): Byte

Get the element at the specified index.

def canEqual(that: Any): Boolean

def char(index: Int)(implicit ev: <:<[A, Char]): Char

Get the element at the specified index.

def clone(): AnyRef

final def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

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

def collectChunk[B](pf: PartialFunction[A, B]): Chunk[B]

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

def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

def collectM[R, E, B](pf: PartialFunction[A, ZIO[R, E, B]]): ZIO[R, E, Chunk[B]]

Returns a filtered, mapped subset of the elements of this chunk based on a .

def collectWhile[B](pf: PartialFunction[A, B]): Chunk[B]

Transforms all elements of the chunk for as long as the specified partial function is defined.

def collectWhileM[R, E, B](pf: PartialFunction[A, ZIO[R, E, B]]): ZIO[R, E, Chunk[B]]

def combinations(n: Int): Iterator[Chunk[A]]

def companion: GenericCompanion[Chunk]

def compose[A](g: (A) ⇒ Int): (A) ⇒ A

def contains[A1 >: A](elem: A1): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: A](xs: Array[B]): Unit

def copyToArray[B >: A](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: A](dest: Buffer[B]): Unit

final def corresponds[B](that: Chunk[B])(f: (A, 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.

def corresponds[B](that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean

def count(p: (A) ⇒ Boolean): Int

def depth: Int

def diff[B >: A](that: GenSeq[B]): Chunk[A]

def distinct: Chunk[A]

def double(index: Int)(implicit ev: <:<[A, Double]): Double

Get the element at the specified index.

def drop(n: Int): Chunk[A]

Drops the first n elements of the chunk.

def dropRight(n: Int): Chunk[A]

def dropWhile(f: (A) ⇒ Boolean): Chunk[A]

Drops all elements so long as the predicate returns true.

def dropWhileM[R, E](p: (A) ⇒ ZIO[R, E, Boolean]): ZIO[R, E, Chunk[A]]

def endsWith[B](that: GenSeq[B]): Boolean

final def eq(arg0: AnyRef): Boolean

final def equals(that: Any): Boolean

final def exists(f: (A) ⇒ Boolean): Boolean

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

def filter(f: (A) ⇒ Boolean): Chunk[A]

Returns a filtered subset of this chunk.

final def filterM[R, E](f: (A) ⇒ ZIO[R, E, Boolean]): ZIO[R, E, Chunk[A]]

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

def filterNot(p: (A) ⇒ Boolean): Chunk[A]

def finalize(): Unit

final def find(f: (A) ⇒ Boolean): Option[A]

Returns the first element that satisfies the predicate.

final def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

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

final def flatMapChunk[B, That](f: (A) ⇒ GenTraversableOnce[B]): Chunk[B]

The implementation of flatMap for Chunk.

final def flatten[B](implicit ev: <:<[A, Chunk[B]]): Chunk[B]

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

def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Chunk[B]

def float(index: Int)(implicit ev: <:<[A, Float]): Float

Get the element at the specified index.

def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[S](s0: S)(f: (S, A) ⇒ S): S

Folds over the elements in this chunk from the left.

final def foldM[R, E, S](s: S)(f: (S, A) ⇒ ZIO[R, E, S]): ZIO[R, E, S]

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

def foldRight[S](s0: S)(f: (A, S) ⇒ S): S

Folds over the elements in this chunk from the right.

final def foldWhile[S](s0: S)(pred: (S) ⇒ Boolean)(f: (S, A) ⇒ S): S

Folds over the elements in this chunk from the left.

final def foldWhileM[R, E, S](z: S)(pred: (S) ⇒ Boolean)(f: (S, A) ⇒ ZIO[R, E, S]): ZIO[R, E, S]

final def forall(f: (A) ⇒ Boolean): Boolean

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

def foreach[U](f: (A) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Chunk[B]]

final def getClass(): Class[_]

def groupBy[K](f: (A) ⇒ K): Map[K, Chunk[A]]

def grouped(size: Int): Iterator[Chunk[A]]

def hasDefiniteSize: Boolean

final def hashCode(): Int

def head: A

Returns the first element of this chunk.

final def headOption: Option[A]

Returns the first element of this chunk if it exists.

def indexOf[B >: A](elem: B, from: Int): Int

def indexOf[B >: A](elem: B): Int

def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int

def indexOfSlice[B >: A](that: GenSeq[B]): Int

final def indexWhere(f: (A) ⇒ Boolean, from: Int): Int

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

final def indexWhere(f: (A) ⇒ Boolean): Int

Returns the first index for which the given predicate is satisfied.

def indices: Range

def init: Chunk[A]

def inits: Iterator[Chunk[A]]

def int(index: Int)(implicit ev: <:<[A, Int]): Int

Get the element at the specified index.

def intersect[B >: A](that: GenSeq[B]): Chunk[A]

def isDefinedAt(idx: Int): Boolean

final def isEmpty: Boolean

Determines if the chunk is empty.

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[A]

def last: A

def lastIndexOf[B >: A](elem: B, end: Int): Int

def lastIndexOf[B >: A](elem: B): Int

def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int

def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int

def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int

def lastIndexWhere(p: (A) ⇒ Boolean): Int

final def lastOption: Option[A]

Returns the last element of this chunk if it exists.

def left: Chunk[A]

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[A]

def long(index: Int)(implicit ev: <:<[A, Long]): Long

Get the element at the specified index.

final def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

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

final def mapAccum[S1, B](s1: S1)(f1: (S1, A) ⇒ (S1, B)): (S1, Chunk[B])

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

final def mapAccumM[R, E, S1, B](s1: S1)(f1: (S1, A) ⇒ 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.

def mapChunk[B](f: (A) ⇒ B): Chunk[B]

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

final def mapM[R, E, B](f: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, Chunk[B]]

Effectfully maps the elements of this chunk.

final def mapMPar[R, E, B](f: (A) ⇒ ZIO[R, E, B]): ZIO[R, E, Chunk[B]]

Effectfully maps the elements of this chunk in parallel.

final def mapMPar_[R, E](f: (A) ⇒ ZIO[R, E, Any]): ZIO[R, E, Unit]

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

final def mapM_[R, E](f: (A) ⇒ ZIO[R, E, Any]): ZIO[R, E, Unit]

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

def materialize[A1 >: A]: Chunk[A1]

Materializes a chunk into a chunk backed by an array.

def max[B >: A](implicit cmp: Ordering[B]): A

def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

def min[B >: A](implicit cmp: Ordering[B]): A

def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

final def mkString: String

Generates a readable string representation of this chunk.

final def mkString(sep: String): String

Generates a readable string representation of this chunk using the specified separator string.

final def mkString(start: String, sep: String, end: String): String

Generates a readable string representation of this chunk using the specified start, separator, and end strings.

final def ne(arg0: AnyRef): Boolean

def newBuilder: ChunkBuilder[A]

Constructs a new ChunkBuilder.

final def nonEmpty: Boolean

Determines if the chunk is not empty.

def nonEmptyOrElse[B](ifEmpty: ⇒ B)(fn: (NonEmptyChunk[A]) ⇒ B): B

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

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

def par: ParSeq[A]

def parCombiner: Combiner[A, ParSeq[A]]

def partition(p: (A) ⇒ Boolean): (Chunk[A], Chunk[A])

final def partitionMap[B, C](f: (A) ⇒ Either[B, C]): (Chunk[B], Chunk[C])

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

def patch[B >: A, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

def permutations: Iterator[Chunk[A]]

def prefixLength(p: (A) ⇒ Boolean): Int

def prepend[A1 >: A](a1: A1): Chunk[A1]

Prepends an element to the chunk.

def product[B >: A](implicit num: Numeric[B]): B

def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: A](op: (B, A) ⇒ B): B

def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: A](op: (A, B) ⇒ B): B

def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

def repr: Chunk[A]

def reverse: Chunk[A]

def reverseIterator: Iterator[A]

def reverseMap[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

def reversed: List[A]

def right: Chunk[A]

def runWith[U](action: (A) ⇒ U): (Int) ⇒ Boolean

def sameElements[B >: A](that: GenIterable[B]): Boolean

def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Chunk[A], B, That]): That

def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

def segmentLength(p: (A) ⇒ Boolean, from: Int): Int

def seq: IndexedSeq[A]

def short(index: Int)(implicit ev: <:<[A, Short]): Short

Get the element at the specified index.

final def size: Int

The number of elements in the chunk.

def slice(from: Int, until: Int): Chunk[A]

def sliding(size: Int, step: Int): Iterator[Chunk[A]]

def sliding(size: Int): Iterator[Chunk[A]]

def sortBy[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): Chunk[A]

def sortWith(lt: (A, A) ⇒ Boolean): Chunk[A]

def sorted[B >: A](implicit ord: Ordering[B]): Chunk[A]

def span(p: (A) ⇒ Boolean): (Chunk[A], Chunk[A])

final def split(n: Int): Chunk[Chunk[A]]

Splits this chunk into n equally sized chunks.

final def splitAt(n: Int): (Chunk[A], Chunk[A])

Returns two splits of this chunk at the specified index.

final def splitWhere(f: (A) ⇒ Boolean): (Chunk[A], Chunk[A])

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

def startsWith[B](that: GenSeq[B], offset: Int): Boolean

def startsWith[B](that: GenSeq[B]): Boolean

def stringPrefix: String

def sum[B >: A](implicit num: Numeric[B]): B

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: Chunk[A]

def tails: Iterator[Chunk[A]]

def take(n: Int): Chunk[A]

Takes the first n elements of the chunk.

def takeRight(n: Int): Chunk[A]

def takeWhile(f: (A) ⇒ Boolean): Chunk[A]

Takes all elements so long as the predicate returns true.

def takeWhileM[R, E](p: (A) ⇒ ZIO[R, E, Boolean]): ZIO[R, E, Chunk[A]]

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

def thisCollection: IndexedSeq[A]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]

def toArray[A1 >: A](n: Int, dest: Array[A1]): Unit

def toArray[A1 >: A](implicit arg0: ClassTag[A1]): Array[A1]

Converts the chunk into an array.

final def toBinaryString(implicit ev: <:<[A, Boolean]): String

Renders this chunk of bits as a binary string.

def toBuffer[A1 >: A]: Buffer[A1]

def toCollection(repr: Chunk[A]): IndexedSeq[A]

def toIndexedSeq: IndexedSeq[A]

def toIterable: Iterable[A]

def toIterator: Iterator[A]

final def toList: List[A]

def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]

def toSeq: Seq[A]

def toSet[B >: A]: Set[B]

def toStream: Stream[A]

final def toString(): String

def toTraversable: Traversable[A]

final def toVector: Vector[A]

def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Chunk[Chunk[B]]

def union[B >: A, That](that: GenSeq[B])(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Chunk[A1], Chunk[A2])

def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Chunk[A1], Chunk[A2], Chunk[A3])

def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

def view(from: Int, until: Int): SeqView[A, Chunk[A]]

def view: SeqView[A, Chunk[A]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, Chunk[A]]

final def zip[B](that: Chunk[B]): Chunk[(A, B)]

Zips this chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk.

def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Chunk[A], (A1, B), That]): That

final def zipAll[B](that: Chunk[B]): Chunk[(Option[A], 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.

def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Chunk[A], (A1, B), That]): That

final def zipAllWith[B, C](that: Chunk[B])(left: (A) ⇒ C, right: (B) ⇒ C)(both: (A, 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.

final def zipWith[B, C](that: Chunk[B])(f: (A, B) ⇒ C): Chunk[C]

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

final def zipWithIndex: Chunk[(A, Int)]

Zips this chunk with the index of every element.

def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Chunk[A], (A1, Int), That]): That

final def zipWithIndexFrom(indexOffset: Int): Chunk[(A, Int)]

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

final def +[A1 >: A](a: A1): Chunk[A1]

Appends an element to the chunk