zio/zio/Chunk

Chunk

sealed abstract class Chunk[+A] extends ChunkLike[A] with Serializable

A Chunk[A] represents a chunk of values of type A. Chunks are designed are usually backed by arrays, but expose a purely functional, safe interface to the underlying elements, and they become lazy on operations that would be costly with arrays, such as repeated concatenation.

The implementation of balanced concatenation is based on the one for Conc-Trees in "Conc-Trees for Functional and Parallel Programming" by Aleksandar Prokopec and Martin Odersky. http://aleksandar-prokopec.com/resources/docs/lcpc-conc-trees.pdf

NOTE: For performance reasons Chunk does not box primitive types. As a result, it is not safe to construct chunks from heterogeneous primitive types.

Companion:
object
trait ChunkLike[A]
trait StrictOptimizedSeqOps[A, Chunk, Chunk[A]]
trait StrictOptimizedSeqOps[A, Chunk, Chunk[A]]
trait StrictOptimizedIterableOps[A, Chunk, Chunk[A]]
trait IndexedSeq[A]
trait IndexedSeqOps[A, Chunk, Chunk[A]]
trait IndexedSeq[A]
trait IndexedSeqOps[A, Chunk, Chunk[A]]
trait Seq[A]
trait SeqOps[A, Chunk, Chunk[A]]
trait Seq[A]
trait Equals
trait SeqOps[A, Chunk, Chunk[A]]
trait PartialFunction[Int, A]
trait Int => A
trait Iterable[A]
trait Iterable[A]
trait IterableFactoryDefaults[A, Chunk]
trait IterableOps[A, Chunk, Chunk[A]]
trait IterableOnceOps[A, Chunk, Chunk[A]]
trait IterableOnce[A]
class Object
trait Matchable
class Any

Value members

Abstract methods

Concrete methods

def &(that: Chunk[Boolean])(implicit ev: A <:< Boolean): BitChunkByte

Returns the bitwise AND of this chunk and the specified chunk.

Returns the bitwise AND of this chunk and the specified chunk.

final def ++[A1 >: A](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.

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

Returns the concatenation of this chunk with the specified chunk.

Returns the concatenation of this chunk with the specified chunk.

def ^(that: Chunk[Boolean])(implicit ev: A <:< Boolean): BitChunkByte

Returns the bitwise XOR of this chunk and the specified chunk.

Returns the bitwise XOR of this chunk and the specified chunk.

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

Converts a chunk of bytes to a chunk of bits.

Converts a chunk of bytes to a chunk of bits.

final def asBitsInt(endianness: Endianness)(implicit ev: A <:< Int): Chunk[Boolean]

Converts a chunk of ints to a chunk of bits.

Converts a chunk of ints to a chunk of bits.

final def asBitsLong(endianness: Endianness)(implicit ev: A <:< Long): Chunk[Boolean]

Converts a chunk of longs to a chunk of bits.

Converts a chunk of longs to a chunk of bits.

final def asString(implicit ev: IsText[A]): String

Crates a new String based on this chunks data.

Crates a new String based on this chunks data.

final def asString(charset: Charset)(implicit ev: A <:< Byte): String

Crates a new String based on this chunk of bytes and using the given charset.

Crates a new String based on this chunk of bytes and using the given charset.

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

Get the element at the specified index.

Get the element at the specified index.

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

Get the element at the specified index.

Get the element at the specified index.

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

Get the element at the specified index.

Get the element at the specified index.

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.

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

def collectWhileZIO[R, E, B](pf: PartialFunction[A, ZIO[R, E, B]])(implicit trace: Trace): ZIO[R, E, Chunk[B]]
def collectZIO[R, E, B](pf: PartialFunction[A, ZIO[R, E, B]])(implicit trace: Trace): ZIO[R, E, Chunk[B]]

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

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

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.

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 dedupe: Chunk[A]

Deduplicates adjacent elements that are identical.

Deduplicates adjacent elements that are identical.

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

Get the element at the specified index.

Get the element at the specified index.

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

Drops the first n elements of the chunk.

Drops the first n elements of the chunk.

Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
override def dropRight(n: Int): Chunk[A]

Drops the last n elements of the chunk.

Drops the last n elements of the chunk.

Definition Classes
StrictOptimizedIterableOps -> IndexedSeqOps -> IterableOps
def dropUntil(f: A => Boolean): Chunk[A]

Drops all elements until the predicate returns true.

Drops all elements until the predicate returns true.

def dropUntilZIO[R, E](p: A => ZIO[R, E, Boolean])(implicit trace: Trace): ZIO[R, E, Chunk[A]]

Drops all elements until the effectful predicate returns true.

Drops all elements until the effectful predicate returns true.

override def dropWhile(f: A => Boolean): Chunk[A]

Drops all elements so long as the predicate returns true.

Drops all elements so long as the predicate returns true.

Definition Classes
IterableOps -> IterableOnceOps
def dropWhileZIO[R, E](p: A => ZIO[R, E, Boolean])(implicit trace: Trace): ZIO[R, E, Chunk[A]]

Drops all elements so long as the effectful predicate returns true.

Drops all elements so long as the effectful predicate returns true.

override def equals(that: Any): Boolean

Compares the receiver object (this) with the argument object (that) for equivalence.

Compares the receiver object (this) with the argument object (that) for equivalence.

Any implementation of this method should be an equivalence relation:

  • It is reflexive: for any instance x of type Any, x.equals(x) should return true.
  • It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
  • It is transitive: for any instances x, y, and z of type Any if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

Value parameters:
that

the object to compare against this object for equality.

Returns:

true if the receiver object is equivalent to the argument; false otherwise.

Definition Classes
Seq -> Equals -> Any
final override def exists(f: A => 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
IterableOnceOps
override def filter(f: A => Boolean): Chunk[A]

Returns a filtered subset of this chunk.

Returns a filtered subset of this chunk.

Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
final def filterZIO[R, E](f: A => ZIO[R, E, Boolean])(implicit trace: Trace): ZIO[R, E, Chunk[A]]

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.

final override def find(f: A => Boolean): Option[A]

Returns the first element that satisfies the predicate.

Returns the first element that satisfies the predicate.

Definition Classes
IterableOnceOps
final def findZIO[R, E](f: A => ZIO[R, E, Boolean])(implicit trace: Trace): ZIO[R, E, Option[A]]

Returns the first element that satisfies the effectful predicate.

Returns the first element that satisfies the effectful predicate.

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

Get the element at the specified index.

Get the element at the specified index.

override def foldLeft[S](s0: S)(f: (S, A) => S): S

Folds over the elements in this chunk from the left.

Folds over the elements in this chunk from the left.

Definition Classes
IterableOnceOps
override def foldRight[S](s0: S)(f: (A, S) => S): S

Folds over the elements in this chunk from the right.

Folds over the elements in this chunk from the right.

Definition Classes
IndexedSeqOps -> IterableOnceOps
final def foldWhile[S](s0: S)(pred: S => Boolean)(f: (S, A) => 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.

final def foldWhileZIO[R, E, S](z: S)(pred: S => Boolean)(f: (S, A) => ZIO[R, E, S])(implicit trace: Trace): ZIO[R, E, S]
final def foldZIO[R, E, S](s: S)(f: (S, A) => ZIO[R, E, S])(implicit trace: Trace): 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.

final override def forall(f: A => 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
IterableOnceOps
final override def hashCode: Int

Calculate a hash code value for the object.

Calculate a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

Returns:

the hash code value for this object.

Definition Classes
Seq -> Any
override def head: A

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
IndexedSeqOps -> IterableOps
final override def headOption: Option[A]

Returns the first element of this chunk if it exists.

Returns the first element of this chunk if it exists.

Definition Classes
IndexedSeqOps -> IterableOps
final override 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.

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

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

Get the element at the specified index.

Get the element at the specified index.

final override def isEmpty: Boolean

Determines if the chunk is empty.

Determines if the chunk is empty.

Definition Classes
SeqOps -> IterableOnceOps
final override def lastOption: Option[A]

Returns the last element of this chunk if it exists.

Returns the last element of this chunk if it exists.

Definition Classes
IterableOps
def long(index: Int)(implicit ev: A <:< Long): Long

Get the element at the specified index.

Get the element at the specified index.

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.

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

final def mapAccumZIO[R, E, S1, B](s1: S1)(f1: (S1, A) => ZIO[R, E, (S1, B)])(implicit trace: Trace): 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.

final def mapZIO[R, E, B](f: A => ZIO[R, E, B])(implicit trace: Trace): ZIO[R, E, Chunk[B]]

Effectfully maps the elements of this chunk.

Effectfully maps the elements of this chunk.

final def mapZIODiscard[R, E](f: A => ZIO[R, E, Any])(implicit trace: Trace): 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.

final def mapZIOPar[R, E, B](f: A => ZIO[R, E, B])(implicit trace: Trace): ZIO[R, E, Chunk[B]]

Effectfully maps the elements of this chunk in parallel.

Effectfully maps the elements of this chunk in parallel.

final def mapZIOParDiscard[R, E](f: A => ZIO[R, E, Any])(implicit trace: Trace): 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.

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

Materializes a chunk into a chunk backed by an array. This method can improve the performance of bulk operations.

Materializes a chunk into a chunk backed by an array. This method can improve the performance of bulk operations.

def negate(implicit ev: A <:< Boolean): BitChunkByte

Returns the bitwise NOT of this chunk.

Returns the bitwise NOT of this chunk.

def nonEmptyOrElse[B](ifEmpty: => B)(fn: NonEmptyChunk[A] => 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

final override 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.

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

Definition Classes
StrictOptimizedIterableOps -> IterableOps
def short(index: Int)(implicit ev: A <:< Short): Short

Get the element at the specified index.

Get the element at the specified index.

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

Splits this chunk into n equally sized chunks.

Splits this chunk into n equally sized chunks.

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

Returns two splits of this chunk at the specified index.

Returns two splits of this chunk at the specified index.

Definition Classes
IterableOps -> IterableOnceOps
final def splitWhere(f: A => Boolean): (Chunk[A], Chunk[A])

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

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

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

Takes the first n elements of the chunk.

Takes the first n elements of the chunk.

Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
override def takeRight(n: Int): Chunk[A]

Takes the last n elements of the chunk.

Takes the last n elements of the chunk.

Definition Classes
StrictOptimizedIterableOps -> IndexedSeqOps -> IterableOps
override def takeWhile(f: A => Boolean): Chunk[A]

Takes all elements so long as the predicate returns true.

Takes all elements so long as the predicate returns true.

Definition Classes
IterableOps -> IterableOnceOps
def takeWhileZIO[R, E](p: A => ZIO[R, E, Boolean])(implicit trace: Trace): ZIO[R, E, Chunk[A]]

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

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

override def toArray[A1 >: A : ClassTag]: Array[A1]

Converts the chunk into an array.

Converts the chunk into an array.

Definition Classes
IterableOnceOps
final def toBinaryString(implicit ev: A <:< Boolean): String

Renders this chunk of bits as a binary string.

Renders this chunk of bits as a binary string.

final override def toList: List[A]
Definition Classes
IterableOnceOps
def toPackedByte(implicit ev: A <:< Boolean): Chunk[Byte]
def toPackedInt(endianness: Endianness)(implicit ev: A <:< Boolean): Chunk[Int]
def toPackedLong(endianness: Endianness)(implicit ev: A <:< Boolean): Chunk[Long]
final override def toString: String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Returns:

a string representation of the object.

Definition Classes
Seq -> Function1 -> Iterable -> Any
final override def toVector: Vector[A]
Definition Classes
IterableOnceOps
final def zip[B](that: Chunk[B])(implicit zippable: Zippable[A, B]): Chunk[Out]

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.

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. 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.

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. 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.

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.

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

final def zipWithIndexFrom(indexOffset: Int): Chunk[(A, 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.

def |(that: Chunk[Boolean])(implicit ev: A <:< Boolean): BitChunkByte

Returns the bitwise OR of this chunk and the specified chunk.

Returns the bitwise OR of this chunk and the specified chunk.

Inherited methods

final def ++[B >: A](suffix: IterableOnce[B]): CC[B]
Inherited from:
IterableOps
final override def ++:[B >: A](prefix: IterableOnce[B]): CC[B]
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final def +:[B >: A](elem: B): CC[B]
Inherited from:
SeqOps
final def :+[B >: A](elem: B): CC[B]
Inherited from:
SeqOps
final def :++[B >: A](suffix: IterableOnce[B]): CC[B]
Inherited from:
SeqOps
final def addString(b: StringBuilder): StringBuilder
Inherited from:
IterableOnceOps
final def addString(b: StringBuilder, sep: String): StringBuilder
Inherited from:
IterableOnceOps
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Inherited from:
IterableOnceOps
def andThen[C](k: PartialFunction[A, C]): PartialFunction[A, C]
Inherited from:
PartialFunction
override def andThen[C](k: A => C): PartialFunction[A, C]
Definition Classes
PartialFunction -> Function1
Inherited from:
PartialFunction
final override def appended[A1 >: A](a1: A1): Chunk[A1]
Definition Classes
ChunkLike -> StrictOptimizedSeqOps -> SeqOps
Inherited from:
ChunkLike
override def appendedAll[B >: A](suffix: IterableOnce[B]): CC[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from:
StrictOptimizedSeqOps
def apply(i: Int): A
Inherited from:
SeqOps
def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: A1 => B1): B1
Inherited from:
PartialFunction
override def canEqual(that: Any): Boolean
Definition Classes
IndexedSeq -> Seq -> Equals
Inherited from:
IndexedSeq
override def collect[B](pf: PartialFunction[A, 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
ChunkLike -> StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from:
ChunkLike
def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
Inherited from:
IterableOnceOps
def combinations(n: Int): Iterator[C]
Inherited from:
SeqOps
def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, B]
Inherited from:
PartialFunction
def compose[A](g: A => Int): A => R
Inherited from:
Function1
final override def concat[B >: A](suffix: IterableOnce[B]): CC[B]
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
def contains[A1 >: A](elem: A1): Boolean
Inherited from:
SeqOps
def containsSlice[B >: A](that: Seq[B]): Boolean
Inherited from:
SeqOps
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
Inherited from:
IterableOnceOps
def copyToArray[B >: A](xs: Array[B], start: Int): Int
Inherited from:
IterableOnceOps
def copyToArray[B >: A](xs: Array[B]): Int
Inherited from:
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
Inherited from:
IterableOnceOps
def corresponds[B](that: Seq[B])(p: (A, B) => Boolean): Boolean
Inherited from:
SeqOps
def count(p: A => Boolean): Int
Inherited from:
IterableOnceOps
override def diff[B >: A](that: Seq[B]): C
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from:
StrictOptimizedSeqOps
def distinct: C
Inherited from:
SeqOps
override def distinctBy[B](f: A => B): C
Definition Classes
StrictOptimizedSeqOps -> StrictOptimizedSeqOps -> SeqOps
Inherited from:
StrictOptimizedSeqOps
def elementWise: ElementWiseExtractor[A, B]
Inherited from:
PartialFunction
override def empty: CC[A]
Definition Classes
IterableFactoryDefaults -> IterableOps
Inherited from:
IterableFactoryDefaults
def endsWith[B >: A](that: Iterable[B]): Boolean
Inherited from:
SeqOps
override def filterNot(pred: A => Boolean): C
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from:
StrictOptimizedIterableOps
def findLast(p: A => Boolean): Option[A]
Inherited from:
SeqOps
final override def flatMap[B](f: A => 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
ChunkLike -> StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from:
ChunkLike
override def flatten[B](implicit ev: A => IterableOnce[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.

Definition Classes
ChunkLike -> StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from:
ChunkLike
def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
Inherited from:
IterableOnceOps
def foreach[U](f: A => U): Unit
Inherited from:
IterableOnceOps
protected def fromSpecific(coll: IterableOnce[A]): CC[A]
Inherited from:
IterableFactoryDefaults
def groupBy[K](f: A => K): Map[K, C]
Inherited from:
IterableOps
def groupMap[K, B](key: A => K)(f: A => B): Map[K, CC[B]]
Inherited from:
IterableOps
def groupMapReduce[K, B](key: A => K)(f: A => B)(reduce: (B, B) => B): Map[K, B]
Inherited from:
IterableOps
def grouped(size: Int): Iterator[C]
Inherited from:
IterableOps
def indexOf[B >: A](elem: B): Int
Inherited from:
SeqOps
def indexOf[B >: A](elem: B, from: Int): Int
Inherited from:
SeqOps
def indexOfSlice[B >: A](that: Seq[B]): Int
Inherited from:
SeqOps
def indexOfSlice[B >: A](that: Seq[B], from: Int): Int
Inherited from:
SeqOps
def indexWhere(p: A => Boolean): Int
Inherited from:
SeqOps
def indices: Range
Inherited from:
SeqOps
def init: C
Inherited from:
IterableOps
def inits: Iterator[C]
Inherited from:
IterableOps
override def intersect[B >: A](that: Seq[B]): C
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from:
StrictOptimizedSeqOps
def isDefinedAt(idx: Int): Boolean
Inherited from:
SeqOps
override def isTraversableAgain: Boolean
Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def iterator: Iterator[A]
Inherited from:
IndexedSeqOps
override def knownSize: Int
Definition Classes
IndexedSeqOps -> IterableOnce
Inherited from:
IndexedSeqOps
override def last: A
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def lastIndexOf[B >: A](elem: B, end: Int): Int
Inherited from:
SeqOps
def lastIndexOfSlice[B >: A](that: Seq[B]): Int
Inherited from:
SeqOps
def lastIndexOfSlice[B >: A](that: Seq[B], end: Int): Int
Inherited from:
SeqOps
def lastIndexWhere(p: A => Boolean): Int
Inherited from:
SeqOps
def lastIndexWhere(p: A => Boolean, end: Int): Int
Inherited from:
SeqOps
def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, Iterable]
Inherited from:
Iterable
def length: Int
Inherited from:
SeqOps
final override def lengthCompare(that: Iterable[_]): Int
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
final override def lengthCompare(len: Int): Int
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
final def lengthIs: SizeCompareOps
Inherited from:
SeqOps
def lift: A => Option[B]
Inherited from:
PartialFunction
final override def map[B](f: A => 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
ChunkLike -> StrictOptimizedIterableOps -> IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
ChunkLike
def max[B >: A](implicit ord: Ordering[B]): A
Inherited from:
IterableOnceOps
def maxBy[B](f: A => B)(implicit cmp: Ordering[B]): A
Inherited from:
IterableOnceOps
def maxByOption[B](f: A => B)(implicit cmp: Ordering[B]): Option[A]
Inherited from:
IterableOnceOps
def maxOption[B >: A](implicit ord: Ordering[B]): Option[A]
Inherited from:
IterableOnceOps
def min[B >: A](implicit ord: Ordering[B]): A
Inherited from:
IterableOnceOps
def minBy[B](f: A => B)(implicit cmp: Ordering[B]): A
Inherited from:
IterableOnceOps
def minByOption[B](f: A => B)(implicit cmp: Ordering[B]): Option[A]
Inherited from:
IterableOnceOps
def minOption[B >: A](implicit ord: Ordering[B]): Option[A]
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
protected def newSpecificBuilder: Builder[A, CC[A]]
Inherited from:
IterableFactoryDefaults
def nonEmpty: Boolean
Inherited from:
IterableOnceOps
def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Inherited from:
PartialFunction
override def padTo[B >: A](len: Int, elem: B): CC[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from:
StrictOptimizedSeqOps
override def partition(p: A => Boolean): (C, C)
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from:
StrictOptimizedIterableOps
override def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): CC[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from:
StrictOptimizedSeqOps
def permutations: Iterator[C]
Inherited from:
SeqOps
final override def prepended[A1 >: A](a1: A1): Chunk[A1]
Definition Classes
ChunkLike -> StrictOptimizedSeqOps -> IndexedSeqOps -> SeqOps
Inherited from:
ChunkLike
override def prependedAll[B >: A](prefix: IterableOnce[B]): CC[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from:
StrictOptimizedSeqOps
def product[B >: A](implicit num: Numeric[B]): B
Inherited from:
IterableOnceOps
def reduce[B >: A](op: (B, B) => B): B
Inherited from:
IterableOnceOps
def reduceLeft[B >: A](op: (B, A) => B): B
Inherited from:
IterableOnceOps
def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
Inherited from:
IterableOnceOps
def reduceOption[B >: A](op: (B, B) => B): Option[B]
Inherited from:
IterableOnceOps
def reduceRight[B >: A](op: (A, B) => B): B
Inherited from:
IterableOnceOps
def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
Inherited from:
IterableOnceOps
override def reverse: C
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
override def reverseIterator: Iterator[A]
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
override protected def reversed: Iterable[A]
Definition Classes
IndexedSeqOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def runWith[U](action: A => U): A => Boolean
Inherited from:
PartialFunction
override def sameElements[B >: A](o: IterableOnce[B]): Boolean
Definition Classes
IndexedSeq -> SeqOps
Inherited from:
IndexedSeq
def scala$collection$SeqOps$$super$concat[B >: A](suffix: IterableOnce[B]): CC[B]
Inherited from:
SeqOps
def scala$collection$SeqOps$$super$sizeCompare(that: Iterable[_]): Int
Inherited from:
SeqOps
def scala$collection$SeqOps$$super$sizeCompare(otherSize: Int): Int
Inherited from:
SeqOps
def scala$collection$immutable$IndexedSeq$$super$canEqual(that: Any): Boolean
Inherited from:
IndexedSeq
def scala$collection$immutable$IndexedSeq$$super$sameElements[B >: A](that: IterableOnce[B]): Boolean
Inherited from:
IndexedSeq
def scala$collection$immutable$IndexedSeqOps$$super$slice(from: Int, until: Int): C
Inherited from:
IndexedSeqOps
def scala$collection$immutable$StrictOptimizedSeqOps$$super$sorted[B >: A](implicit ord: Ordering[B]): C
Inherited from:
StrictOptimizedSeqOps
def scan[B >: A](z: B)(op: (B, B) => B): CC[B]
Inherited from:
IterableOps
override def scanLeft[B](z: B)(op: (B, A) => B): CC[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from:
StrictOptimizedIterableOps
def scanRight[B](z: B)(op: (A, B) => B): CC[B]
Inherited from:
IterableOps
override def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
override def search[B >: A](elem: B)(implicit ord: Ordering[B]): SearchResult
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from:
IndexedSeqOps
def segmentLength(p: A => Boolean, from: Int): Int
Inherited from:
SeqOps
final def segmentLength(p: A => Boolean): Int
Inherited from:
SeqOps
final override def size: Int
Definition Classes
SeqOps -> IterableOnceOps
Inherited from:
SeqOps
final override def sizeCompare(that: Iterable[_]): Int
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final override def sizeCompare(otherSize: Int): Int
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final def sizeIs: SizeCompareOps
Inherited from:
IterableOps
override def slice(from: Int, until: Int): C
Definition Classes
IndexedSeqOps -> IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from:
IndexedSeqOps
def sliding(size: Int, step: Int): Iterator[C]
Inherited from:
IterableOps
def sliding(size: Int): Iterator[C]
Inherited from:
IterableOps
def sortBy[B](f: A => B)(implicit ord: Ordering[B]): C
Inherited from:
SeqOps
def sortWith(lt: (A, A) => Boolean): C
Inherited from:
SeqOps
override def sorted[B >: A](implicit ord: Ordering[B]): C
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from:
StrictOptimizedSeqOps
override def span(p: A => Boolean): (C, C)
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from:
StrictOptimizedIterableOps
def startsWith[B >: A](that: IterableOnce[B], offset: Int): Boolean
Inherited from:
SeqOps
override def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S & EfficientSplit
Definition Classes
IndexedSeqOps -> IterableOnce
Inherited from:
IndexedSeqOps
def sum[B >: A](implicit num: Numeric[B]): B
Inherited from:
IterableOnceOps
def tail: C
Inherited from:
IterableOps
def tails: Iterator[C]
Inherited from:
IterableOps
override def tapEach[U](f: A => U): C
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from:
StrictOptimizedIterableOps
def to[C1](factory: Factory[A, C1]): C1
Inherited from:
IterableOnceOps
final def toBuffer[B >: A]: Buffer[B]
Inherited from:
IterableOnceOps
final override def toIndexedSeq: IndexedSeq[A]
Definition Classes
IndexedSeq -> IterableOnceOps
Inherited from:
IndexedSeq
def toMap[K, V](implicit ev: A <:< (K, V)): Map[K, V]
Inherited from:
IterableOnceOps
final override def toSeq: Seq.this.type
Definition Classes
Seq -> IterableOnceOps
Inherited from:
Seq
def toSet[B >: A]: Set[B]
Inherited from:
IterableOnceOps
def transpose[B](implicit asIterable: A => Iterable[B]): CC[CC[B]]
Inherited from:
IterableOps
def unapply(a: Int): Option[B]
Inherited from:
PartialFunction
override def unzip[A1, A2](implicit asPair: A => (A1, A2)): (CC[A1], CC[A2])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from:
StrictOptimizedIterableOps
override def unzip3[A1, A2, A3](implicit asTriple: A => (A1, A2, A3)): (CC[A1], CC[A2], CC[A3])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from:
StrictOptimizedIterableOps
final override def updated[A1 >: A](index: Int, elem: A1): Chunk[A1]
Definition Classes
ChunkLike -> StrictOptimizedSeqOps -> SeqOps
Inherited from:
ChunkLike
override def view: IndexedSeqView[A]
Definition Classes
IndexedSeqOps -> SeqOps -> IterableOps
Inherited from:
IndexedSeqOps
def withFilter(p: A => Boolean): WithFilter[A, CC]
Inherited from:
IterableOps
override def zip[B](that: IterableOnce[B]): CC[(A, B)]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from:
StrictOptimizedIterableOps
def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): CC[(A1, B)]
Inherited from:
IterableOps
final override def zipWithIndex: Chunk[(A, Int)]

Zips this chunk with the index of every element.

Zips this chunk with the index of every element.

Definition Classes
ChunkLike -> StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from:
ChunkLike

Deprecated and Inherited methods

final def /:[B](z: B)(op: (B, A) => B): B
Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
final def :\[B](z: B)(op: (A, B) => B): B
Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from:
IterableOnceOps
def aggregate[B](z: => B)(seqop: (B, A) => 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
def companion: IterableFactory[CC]
Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from:
IterableOnceOps
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
final def prefixLength(p: A => Boolean): Int
Deprecated
[Since version 2.13.0] Use segmentLength instead of prefixLength
Inherited from:
SeqOps
final def repr: C
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
def reverseMap[B](f: A => B): CC[B]
Deprecated
[Since version 2.13.0] Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
Inherited from:
SeqOps
def seq: Iterable.this.type
Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from:
Iterable
final def toIterable: Iterable.this.type
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
final def toIterator: Iterator[A]
Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from:
IterableOnceOps
final def toStream: Stream[A]
Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from:
IterableOnceOps
final def toTraversable: Iterable[A]
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
final def union[B >: A](that: Seq[B]): CC[B]
Deprecated
[Since version 2.13.0] Use `concat` instead
Inherited from:
SeqOps
override def view(from: Int, until: Int): IndexedSeqView[A]
Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Definition Classes
IndexedSeqOps -> IterableOps
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