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.

Self Type
Chunk[A]
Linear Supertypes
Serializable, ChunkLike[A], StrictOptimizedSeqOps[A, Chunk, Chunk[A]], StrictOptimizedSeqOps[A, Chunk, Chunk[A]], StrictOptimizedIterableOps[A, Chunk, Chunk[A]], IndexedSeq[A], IndexedSeqOps[A, [_]Chunk[_], Chunk[A]], IndexedSeq[A], IndexedSeqOps[A, [_]Chunk[_], Chunk[A]], Seq[A], SeqOps[A, [_]Chunk[_], Chunk[A]], Seq[A], Equals, SeqOps[A, [_]Chunk[_], Chunk[A]], PartialFunction[Int, A], (Int) => A, Iterable[A], Iterable[A], IterableFactoryDefaults[A, [x]Chunk[x]], IterableOps[A, [_]Chunk[_], Chunk[A]], IterableOnceOps[A, [_]Chunk[_], Chunk[A]], IterableOnce[A], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Chunk
  2. Serializable
  3. ChunkLike
  4. StrictOptimizedSeqOps
  5. StrictOptimizedSeqOps
  6. StrictOptimizedIterableOps
  7. IndexedSeq
  8. IndexedSeqOps
  9. IndexedSeq
  10. IndexedSeqOps
  11. Seq
  12. SeqOps
  13. Seq
  14. Equals
  15. SeqOps
  16. PartialFunction
  17. Function1
  18. Iterable
  19. Iterable
  20. IterableFactoryDefaults
  21. IterableOps
  22. IterableOnceOps
  23. IterableOnce
  24. AnyRef
  25. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def apply(i: Int): A
    Definition Classes
    SeqOps
    Annotations
    @throws(scala.this.throws.<init>$default$1[IndexOutOfBoundsException])
  2. abstract def chunkIterator: ChunkIterator[A]
  3. abstract def length: Int
    Definition Classes
    SeqOps

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def &(that: Chunk[Boolean])(implicit ev: <:<[A, Boolean]): BitChunkByte

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

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

    Returns the concatenation of this chunk with the specified chunk.

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

    Returns the concatenation of this chunk with the specified chunk.

  6. final def ++[B >: A](suffix: IterableOnce[B]): Chunk[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  7. final def ++:[B >: A](prefix: IterableOnce[B]): Chunk[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  8. final def +:[B >: A](elem: B): Chunk[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  9. final def :+[B >: A](elem: B): Chunk[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  10. final def :++[B >: A](suffix: IterableOnce[B]): Chunk[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  11. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  12. def ^(that: Chunk[Boolean])(implicit ev: <:<[A, Boolean]): BitChunkByte

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

  13. final def addString(b: StringBuilder): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  14. final def addString(b: StringBuilder, sep: String): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  15. def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
    Definition Classes
    IterableOnceOps
  16. def andThen[C](k: PartialFunction[A, C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  17. def andThen[C](k: (A) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  18. def append[A1 >: A](a1: A1): Chunk[A1]

    Appends an element to the chunk.

    Appends an element to the chunk.

    Attributes
    protected
  19. final def appended[A1 >: A](a1: A1): Chunk[A1]
    Definition Classes
    ChunkLike → StrictOptimizedSeqOps → SeqOps
  20. def appendedAll[B >: A](suffix: IterableOnce[B]): Chunk[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  21. def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  22. def applyPreferredMaxLength: Int
    Attributes
    protected
    Definition Classes
    IndexedSeq
  23. final def asBitsByte(implicit ev: <:<[A, Byte]): Chunk[Boolean]

    Converts a chunk of bytes to a chunk of bits.

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

    Converts a chunk of ints to a chunk of bits.

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

    Converts a chunk of longs to a chunk of bits.

  26. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  27. 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.

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

    Crates a new String based on this chunks data.

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

    Get the element at the specified index.

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

    Get the element at the specified index.

  31. def canEqual(that: Any): Boolean
    Definition Classes
    IndexedSeq → Seq → Equals
  32. def char(index: Int)(implicit ev: <:<[A, Char]): Char

    Get the element at the specified index.

  33. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  34. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  35. final def coll: Chunk.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  36. 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
  37. def collectChunk[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.

    Attributes
    protected
  38. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    IterableOnceOps
  39. 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.

  40. def collectWhileZIO[R, E, B](pf: PartialFunction[A, ZIO[R, E, B]])(implicit trace: Trace): ZIO[R, E, Chunk[B]]
  41. 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 .

  42. def combinations(n: Int): Iterator[Chunk[A]]
    Definition Classes
    SeqOps
  43. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, A]
    Definition Classes
    PartialFunction
  44. def compose[A](g: (A) => Int): (A) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  45. final def concat[B >: A](suffix: IterableOnce[B]): Chunk[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  46. def contains[A1 >: A](elem: A1): Boolean
    Definition Classes
    SeqOps
  47. def containsSlice[B >: A](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  48. def copyToArray[B >: A](dest: Array[B], destPos: Int, length: Int): Int
    Definition Classes
    ChunkLike → IterableOnceOps
  49. def copyToArray[B >: A](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  50. def copyToArray[B >: A](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  51. 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.

  52. def corresponds[B](that: Seq[B])(p: (A, B) => Boolean): Boolean
    Definition Classes
    SeqOps
  53. def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  54. def count(p: (A) => Boolean): Int
    Definition Classes
    IterableOnceOps
  55. def dedupe: Chunk[A]

    Deduplicates adjacent elements that are identical.

  56. def depth: Int
    Attributes
    protected
  57. def diff[B >: A](that: Seq[B]): Chunk[A]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  58. def distinct: Chunk[A]
    Definition Classes
    SeqOps
  59. def distinctBy[B](f: (A) => B): Chunk[A]
    Definition Classes
    StrictOptimizedSeqOps → StrictOptimizedSeqOps → SeqOps
  60. def double(index: Int)(implicit ev: <:<[A, Double]): Double

    Get the element at the specified index.

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

    Drops the first n elements of the chunk.

    Drops the first n elements of the chunk.

    Definition Classes
    Chunk → IndexedSeqOps → IterableOps → IterableOnceOps
  62. def dropRight(n: Int): Chunk[A]

    Drops the last n elements of the chunk.

    Drops the last n elements of the chunk.

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

    Drops all elements until the predicate returns true.

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

  65. 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
    Chunk → IterableOps → IterableOnceOps
  66. 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.

  67. def elementWise: ElementWiseExtractor[Int, A]
    Definition Classes
    PartialFunction
  68. def empty: Chunk[A]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  69. def endsWith[B >: A](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  70. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  71. def equals(that: Any): Boolean
    Definition Classes
    Chunk → Seq → Equals → AnyRef → Any
  72. final 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
    Chunk → IterableOnceOps
  73. def filter(f: (A) => Boolean): Chunk[A]

    Returns a filtered subset of this chunk.

    Returns a filtered subset of this chunk.

    Definition Classes
    Chunk → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  74. def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): Chunk[A]
    Attributes
    protected[collection]
    Definition Classes
    StrictOptimizedIterableOps
  75. def filterNot(pred: (A) => Boolean): Chunk[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  76. 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.

  77. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  78. final 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
    Chunk → IterableOnceOps
  79. def findLast(p: (A) => Boolean): Option[A]
    Definition Classes
    SeqOps
  80. 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.

  81. final 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
  82. 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
  83. def float(index: Int)(implicit ev: <:<[A, Float]): Float

    Get the element at the specified index.

  84. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  85. 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
    Chunk → IterableOnceOps
  86. 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
    Chunk → IndexedSeqOps → IterableOnceOps
  87. final def foldWhile[S](s0: S)(pred: (S) => Boolean)(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. Stops the fold early when the condition is not fulfilled.

  88. 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]
  89. 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.

  90. final 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
    Chunk → IterableOnceOps
  91. def foreach[U](f: (A) => U): Unit
    Definition Classes
    IterableOnceOps
  92. def fromSpecific(coll: IterableOnce[A]): Chunk[A]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  93. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  94. def groupBy[K](f: (A) => K): Map[K, Chunk[A]]
    Definition Classes
    IterableOps
  95. def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, Chunk[B]]
    Definition Classes
    IterableOps
  96. def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  97. def grouped(size: Int): Iterator[Chunk[A]]
    Definition Classes
    IterableOps
  98. final def hashCode(): Int
    Definition Classes
    Chunk → Seq → AnyRef → Any
  99. def head: A

    Returns the first element of this 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
    Chunk → IndexedSeqOps → IterableOps
  100. final 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
    Chunk → IndexedSeqOps → IterableOps
  101. def indexOf[B >: A](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  102. def indexOf[B >: A](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  103. def indexOfSlice[B >: A](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  104. def indexOfSlice[B >: A](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  105. 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.

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

    Definition Classes
    Chunk → SeqOps
  106. def indexWhere(p: (A) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  107. def indices: Range
    Definition Classes
    SeqOps
  108. def init: Chunk[A]
    Definition Classes
    IterableOps
  109. def inits: Iterator[Chunk[A]]
    Definition Classes
    IterableOps
  110. def int(index: Int)(implicit ev: <:<[A, Int]): Int

    Get the element at the specified index.

  111. def intersect[B >: A](that: Seq[B]): Chunk[A]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  112. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  113. final def isEmpty: Boolean

    Determines if the chunk is empty.

    Determines if the chunk is empty.

    Definition Classes
    Chunk → SeqOps → IterableOnceOps
  114. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  115. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  116. val iterableFactory: SeqFactory[Chunk]

    Returns a SeqFactory that can construct Chunk values.

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

    Definition Classes
    ChunkLike → IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
  117. def iterator: Iterator[A]
    Definition Classes
    IndexedSeqOps → IterableOnce
  118. def knownSize: Int
    Definition Classes
    IndexedSeqOps → IterableOnce
  119. def last: A
    Definition Classes
    IndexedSeqOps → IterableOps
  120. def lastIndexOf[B >: A](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  121. def lastIndexOfSlice[B >: A](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  122. def lastIndexOfSlice[B >: A](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  123. def lastIndexWhere(p: (A) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  124. def lastIndexWhere(p: (A) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  125. final 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
    Chunk → IterableOps
  126. def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, Chunk.this.type]
    Definition Classes
    Iterable
  127. def left: Chunk[A]
    Attributes
    protected
  128. final def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  129. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  130. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  131. def lift: (Int) => Option[A]
    Definition Classes
    PartialFunction
  132. def long(index: Int)(implicit ev: <:<[A, Long]): Long

    Get the element at the specified index.

  133. final 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
  134. 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.

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

  136. def mapChunk[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.

    Attributes
    protected
  137. 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.

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

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

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

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

    Materializes a chunk into a chunk backed by an array.

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

  142. def max[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  143. def maxBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  144. def maxByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  145. def maxOption[B >: A](implicit ord: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  146. def min[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  147. def minBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  148. def minByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  149. def minOption[B >: A](implicit ord: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  150. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  151. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  152. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  153. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  154. def negate(implicit ev: <:<[A, Boolean]): BitChunkByte

    Returns the bitwise NOT of this chunk.

  155. def newSpecificBuilder: Builder[A, Chunk[A]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  156. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  157. def nonEmptyOrElse[B](ifEmpty: => B)(fn: (NonEmptyChunk[A]) => B): B

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

  158. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  159. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  160. def occCounts[B](sq: Seq[B]): Map[B, Int]
    Attributes
    protected[collection]
    Definition Classes
    SeqOps
  161. def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  162. def padTo[B >: A](len: Int, elem: B): Chunk[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  163. def partition(p: (A) => Boolean): (Chunk[A], Chunk[A])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  164. 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.

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

    Definition Classes
    Chunk → StrictOptimizedIterableOps → IterableOps
  165. def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): Chunk[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  166. def permutations: Iterator[Chunk[A]]
    Definition Classes
    SeqOps
  167. def prepend[A1 >: A](a1: A1): Chunk[A1]

    Prepends an element to the chunk.

    Prepends an element to the chunk.

    Attributes
    protected
  168. final def prepended[A1 >: A](a1: A1): Chunk[A1]
    Definition Classes
    ChunkLike → StrictOptimizedSeqOps → IndexedSeqOps → SeqOps
  169. def prependedAll[B >: A](prefix: IterableOnce[B]): Chunk[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  170. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  171. def reduce[B >: A](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  172. def reduceLeft[B >: A](op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
  173. def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
    Definition Classes
    IterableOnceOps
  174. def reduceOption[B >: A](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  175. def reduceRight[B >: A](op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
  176. def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  177. def reverse: Chunk[A]
    Definition Classes
    IndexedSeqOps → SeqOps
  178. def reverseIterator: Iterator[A]
    Definition Classes
    IndexedSeqOps → SeqOps
  179. def reversed: Iterable[A]
    Attributes
    protected
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  180. def right: Chunk[A]
    Attributes
    protected
  181. def runWith[U](action: (A) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  182. def sameElements[B >: A](o: IterableOnce[B]): Boolean
    Definition Classes
    IndexedSeq → SeqOps
  183. def scan[B >: A](z: B)(op: (B, B) => B): Chunk[B]
    Definition Classes
    IterableOps
  184. def scanLeft[B](z: B)(op: (B, A) => B): Chunk[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  185. def scanRight[B](z: B)(op: (A, B) => B): Chunk[B]
    Definition Classes
    IterableOps
  186. def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  187. def search[B >: A](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  188. def segmentLength(p: (A) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  189. final def segmentLength(p: (A) => Boolean): Int
    Definition Classes
    SeqOps
  190. def short(index: Int)(implicit ev: <:<[A, Short]): Short

    Get the element at the specified index.

  191. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  192. final def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  193. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  194. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  195. def slice(from: Int, until: Int): Chunk[A]
    Definition Classes
    Chunk → IndexedSeqOps → IndexedSeqOps → IterableOps → IterableOnceOps
  196. def sliding(size: Int, step: Int): Iterator[Chunk[A]]
    Definition Classes
    IterableOps
  197. def sliding(size: Int): Iterator[Chunk[A]]
    Definition Classes
    IterableOps
  198. def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): Chunk[A]
    Definition Classes
    SeqOps
  199. def sortWith(lt: (A, A) => Boolean): Chunk[A]
    Definition Classes
    SeqOps
  200. def sorted[A1 >: A](implicit ord: Ordering[A1]): Chunk[A]
    Definition Classes
    ChunkLike → StrictOptimizedSeqOps → SeqOps
  201. def span(f: (A) => Boolean): (Chunk[A], Chunk[A])
    Definition Classes
    Chunk → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  202. final def split(n: Int): Chunk[Chunk[A]]

    Splits this chunk into n equally sized chunks.

  203. final 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
    Chunk → IterableOps → IterableOnceOps
  204. final def splitWhere(f: (A) => Boolean): (Chunk[A], Chunk[A])

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

  205. def startsWith[B >: A](that: IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  206. def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit
    Definition Classes
    IndexedSeqOps → IterableOnce
  207. final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  208. final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  209. final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  210. final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  211. final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  212. final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  213. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    IndexedSeq → Seq → Iterable
  214. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  215. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  216. def tail: Chunk[A]
    Definition Classes
    IterableOps
  217. def tails: Iterator[Chunk[A]]
    Definition Classes
    IterableOps
  218. def take(n: Int): Chunk[A]

    Takes the first n elements of the chunk.

    Takes the first n elements of the chunk.

    Definition Classes
    Chunk → IndexedSeqOps → IterableOps → IterableOnceOps
  219. def takeRight(n: Int): Chunk[A]

    Takes the last n elements of the chunk.

    Takes the last n elements of the chunk.

    Definition Classes
    Chunk → StrictOptimizedIterableOps → IndexedSeqOps → IterableOps
  220. 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
    Chunk → IterableOps → IterableOnceOps
  221. 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.

  222. def tapEach[U](f: (A) => U): Chunk[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  223. def to[C1](factory: Factory[A, C1]): C1
    Definition Classes
    IterableOnceOps
  224. def toArray[A1 >: A](srcPos: Int, dest: Array[A1], destPos: Int, length: Int): Unit
    Attributes
    protected[zio]
  225. final def toArray[A1 >: A](n: Int, dest: Array[A1]): Unit
    Attributes
    protected[zio]
  226. def toArray[A1 >: A](implicit arg0: ClassTag[A1]): Array[A1]

    Converts the chunk into an array.

    Converts the chunk into an array.

    Definition Classes
    Chunk → IterableOnceOps
  227. final def toBinaryString(implicit ev: <:<[A, Boolean]): String

    Renders this chunk of bits as a binary string.

  228. final def toBuffer[B >: A]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  229. final def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    IndexedSeq → IterableOnceOps
  230. final def toList: List[A]
    Definition Classes
    Chunk → IterableOnceOps
  231. def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  232. def toPackedByte(implicit ev: <:<[A, Boolean]): Chunk[Byte]
  233. def toPackedInt(endianness: Endianness)(implicit ev: <:<[A, Boolean]): Chunk[Int]
  234. def toPackedLong(endianness: Endianness)(implicit ev: <:<[A, Boolean]): Chunk[Long]
  235. final def toSeq: Chunk.this.type
    Definition Classes
    Seq → IterableOnceOps
  236. def toSet[B >: A]: Set[B]
    Definition Classes
    IterableOnceOps
  237. final def toString(): String
    Definition Classes
    Chunk → Seq → Function1 → Iterable → AnyRef → Any
  238. final def toVector: Vector[A]
    Definition Classes
    Chunk → IterableOnceOps
  239. def transpose[B](implicit asIterable: (A) => Iterable[B]): Chunk[Chunk[B]]
    Definition Classes
    IterableOps
  240. def unapply(a: Int): Option[A]
    Definition Classes
    PartialFunction
  241. def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Chunk[A1], Chunk[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  242. def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Chunk[A1], Chunk[A2], Chunk[A3])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  243. def update[A1 >: A](index: Int, a1: A1): Chunk[A1]

    Updates an element at the specified index of the chunk.

    Updates an element at the specified index of the chunk.

    Attributes
    protected
  244. final def updated[A1 >: A](index: Int, elem: A1): Chunk[A1]
    Definition Classes
    ChunkLike → StrictOptimizedSeqOps → SeqOps
  245. def view: IndexedSeqView[A]
    Definition Classes
    IndexedSeqOps → SeqOps → IterableOps
  246. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  247. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  248. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  249. def withFilter(p: (A) => Boolean): WithFilter[A, [_]Chunk[_]]
    Definition Classes
    IterableOps
  250. 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.

    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.

  251. def zip[B](that: IterableOnce[B]): Chunk[(A, B)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  252. 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.

    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.

  253. def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): Chunk[(A1, B)]
    Definition Classes
    IterableOps
  254. 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.

    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.

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

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

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

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

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

Deprecated Value Members

  1. final def /:[B](z: B)(op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  2. final def :\[B](z: B)(op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  3. def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  4. def companion: IterableFactory[[_]Chunk[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  5. final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  6. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  7. final def prefixLength(p: (A) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  8. final def repr: Chunk[A]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  9. def reverseMap[B](f: (A) => B): Chunk[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)

  10. def seq: Chunk.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  11. final def toIterable: Chunk.this.type
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    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

  12. final def toIterator: Iterator[A]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  13. final def toStream: Stream[A]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  14. final def toTraversable: Traversable[A]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    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

  15. final def union[B >: A](that: Seq[B]): Chunk[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use concat instead

  16. def view(from: Int, until: Int): IndexedSeqView[A]
    Definition Classes
    IndexedSeqOps → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from Serializable

Inherited from ChunkLike[A]

Inherited from StrictOptimizedSeqOps[A, Chunk, Chunk[A]]

Inherited from StrictOptimizedSeqOps[A, Chunk, Chunk[A]]

Inherited from StrictOptimizedIterableOps[A, Chunk, Chunk[A]]

Inherited from IndexedSeq[A]

Inherited from IndexedSeqOps[A, [_]Chunk[_], Chunk[A]]

Inherited from IndexedSeq[A]

Inherited from IndexedSeqOps[A, [_]Chunk[_], Chunk[A]]

Inherited from Seq[A]

Inherited from SeqOps[A, [_]Chunk[_], Chunk[A]]

Inherited from Seq[A]

Inherited from Equals

Inherited from SeqOps[A, [_]Chunk[_], Chunk[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) => A

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableFactoryDefaults[A, [x]Chunk[x]]

Inherited from IterableOps[A, [_]Chunk[_], Chunk[A]]

Inherited from IterableOnceOps[A, [_]Chunk[_], Chunk[A]]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Ungrouped