Packages

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. final def ++[A1 >: A](that: NonEmptyChunk[A1]): NonEmptyChunk[A1]
  4. final def ++[A1 >: A](that: Chunk[A1]): Chunk[A1]

    Returns the concatenation of this chunk with the specified chunk.

  5. final def ++[B >: A](suffix: IterableOnce[B]): Chunk[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  6. final def ++:[B >: A](prefix: IterableOnce[B]): Chunk[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  7. final def +:[B >: A](elem: B): Chunk[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  8. final def :+[B >: A](elem: B): Chunk[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  9. final def :++[B >: A](suffix: IterableOnce[B]): Chunk[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  12. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  14. def andThen[C](k: PartialFunction[A, C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  15. def andThen[C](k: (A) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  16. def append[A1 >: A](a1: A1): Chunk[A1]

    Appends an element to the chunk.

    Appends an element to the chunk.

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

    Converts a chunk of bytes to a chunk of bits.

  22. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  23. def boolean(index: Int)(implicit ev: <:<[A, Boolean]): Boolean

    Get the element at the specified index.

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

    Get the element at the specified index.

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

    Get the element at the specified index.

  27. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  28. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  29. final def coll: Chunk.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  30. 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
  31. 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
  32. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    IterableOnceOps
  33. 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.

  34. def collectWhileZIO[R, E, B](pf: PartialFunction[A, ZIO[R, E, B]])(implicit trace: ZTraceElement): ZIO[R, E, Chunk[B]]
  35. def collectZIO[R, E, B](pf: PartialFunction[A, ZIO[R, E, B]])(implicit trace: ZTraceElement): ZIO[R, E, Chunk[B]]

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

  36. def combinations(n: Int): Iterator[Chunk[A]]
    Definition Classes
    SeqOps
  37. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, A]
    Definition Classes
    PartialFunction
  38. def compose[A](g: (A) => Int): (A) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  39. final def concat[B >: A](suffix: IterableOnce[B]): Chunk[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  40. def contains[A1 >: A](elem: A1): Boolean
    Definition Classes
    SeqOps
  41. def containsSlice[B >: A](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  42. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  43. def copyToArray[B >: A](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  44. def copyToArray[B >: A](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  45. 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.

  46. def corresponds[B](that: Seq[B])(p: (A, B) => Boolean): Boolean
    Definition Classes
    SeqOps
  47. def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  48. def count(p: (A) => Boolean): Int
    Definition Classes
    IterableOnceOps
  49. def dedupe: Chunk[A]

    Deduplicates adjacent elements that are identical.

  50. def depth: Int
    Attributes
    protected
  51. def diff[B >: A](that: Seq[B]): Chunk[A]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  52. def distinct: Chunk[A]
    Definition Classes
    SeqOps
  53. def distinctBy[B](f: (A) => B): Chunk[A]
    Definition Classes
    StrictOptimizedSeqOps → StrictOptimizedSeqOps → SeqOps
  54. def double(index: Int)(implicit ev: <:<[A, Double]): Double

    Get the element at the specified index.

  55. 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
  56. def dropRight(n: Int): Chunk[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  57. 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
  58. def dropWhileZIO[R, E](p: (A) => ZIO[R, E, Boolean])(implicit trace: ZTraceElement): ZIO[R, E, Chunk[A]]
  59. def elementWise: ElementWiseExtractor[Int, A]
    Definition Classes
    PartialFunction
  60. def empty: Chunk[A]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  61. def endsWith[B >: A](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  62. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  63. final def equals(that: Any): Boolean
    Definition Classes
    Chunk → Seq → Equals → AnyRef → Any
  64. 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
  65. 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
  66. def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): Chunk[A]
    Attributes
    protected[collection]
    Definition Classes
    StrictOptimizedIterableOps
  67. def filterNot(pred: (A) => Boolean): Chunk[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  68. final def filterZIO[R, E](f: (A) => ZIO[R, E, Boolean])(implicit trace: ZTraceElement): ZIO[R, E, Chunk[A]]

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

  69. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  70. 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
  71. def findLast(p: (A) => Boolean): Option[A]
    Definition Classes
    SeqOps
  72. final def findZIO[R, E](f: (A) => ZIO[R, E, Boolean])(implicit trace: ZTraceElement): ZIO[R, E, Option[A]]

    Returns the first element that satisfies the effectful predicate.

  73. 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
  74. 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
  75. def float(index: Int)(implicit ev: <:<[A, Float]): Float

    Get the element at the specified index.

  76. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  77. 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
  78. 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
  79. 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.

  80. final def foldWhileZIO[R, E, S](z: S)(pred: (S) => Boolean)(f: (S, A) => ZIO[R, E, S])(implicit trace: ZTraceElement): ZIO[R, E, S]
  81. final def foldZIO[R, E, S](s: S)(f: (S, A) => ZIO[R, E, S])(implicit trace: ZTraceElement): ZIO[R, E, S]

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

  82. 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
  83. def foreach[U](f: (A) => U): Unit
    Definition Classes
    IterableOnceOps
  84. def fromSpecific(coll: IterableOnce[A]): Chunk[A]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  85. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  86. def groupBy[K](f: (A) => K): Map[K, Chunk[A]]
    Definition Classes
    IterableOps
  87. def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, Chunk[B]]
    Definition Classes
    IterableOps
  88. def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  89. def grouped(size: Int): Iterator[Chunk[A]]
    Definition Classes
    IterableOps
  90. final def hashCode(): Int
    Definition Classes
    Chunk → Seq → AnyRef → Any
  91. 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
  92. 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
  93. def indexOf[B >: A](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  94. def indexOf[B >: A](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  95. def indexOfSlice[B >: A](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  96. def indexOfSlice[B >: A](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  97. 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
  98. def indexWhere(p: (A) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  99. def indices: Range
    Definition Classes
    SeqOps
  100. def init: Chunk[A]
    Definition Classes
    IterableOps
  101. def inits: Iterator[Chunk[A]]
    Definition Classes
    IterableOps
  102. def int(index: Int)(implicit ev: <:<[A, Int]): Int

    Get the element at the specified index.

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

    Determines if the chunk is empty.

    Determines if the chunk is empty.

    Definition Classes
    Chunk → SeqOps → IterableOnceOps
  106. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  107. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  108. 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
  109. def iterator: Iterator[A]
    Definition Classes
    IndexedSeqOps → IterableOnce
  110. def knownSize: Int
    Definition Classes
    IndexedSeqOps → IterableOnce
  111. def last: A
    Definition Classes
    IndexedSeqOps → IterableOps
  112. def lastIndexOf[B >: A](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  113. def lastIndexOfSlice[B >: A](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  114. def lastIndexOfSlice[B >: A](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  115. def lastIndexWhere(p: (A) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  116. def lastIndexWhere(p: (A) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  117. 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
  118. def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, Chunk.this.type]
    Definition Classes
    Iterable
  119. def left: Chunk[A]
    Attributes
    protected
  120. final def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  121. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  122. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  123. def lift: (Int) => Option[A]
    Definition Classes
    PartialFunction
  124. def long(index: Int)(implicit ev: <:<[A, Long]): Long

    Get the element at the specified index.

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

  127. final def mapAccumM[R, E, S1, B](s1: S1)(f1: (S1, A) => ZIO[R, E, (S1, B)])(implicit trace: ZTraceElement): ZIO[R, E, (S1, Chunk[B])]

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

  128. final def mapAccumZIO[R, E, S1, B](s1: S1)(f1: (S1, A) => ZIO[R, E, (S1, B)])(implicit trace: ZTraceElement): ZIO[R, E, (S1, Chunk[B])]

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

  129. 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
  130. final def mapZIO[R, E, B](f: (A) => ZIO[R, E, B])(implicit trace: ZTraceElement): ZIO[R, E, Chunk[B]]

    Effectfully maps the elements of this chunk.

  131. final def mapZIODiscard[R, E](f: (A) => ZIO[R, E, Any])(implicit trace: ZTraceElement): ZIO[R, E, Unit]

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

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

    Effectfully maps the elements of this chunk in parallel.

  133. final def mapZIOParDiscard[R, E](f: (A) => ZIO[R, E, Any])(implicit trace: ZTraceElement): ZIO[R, E, Unit]

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

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

  135. def max[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  136. def maxBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  137. def maxByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  138. def maxOption[B >: A](implicit ord: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  139. def min[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  140. def minBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  141. def minByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  142. def minOption[B >: A](implicit ord: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  143. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  144. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  145. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  146. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  147. def newSpecificBuilder: Builder[A, Chunk[A]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  148. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  149. def nonEmptyOrElse[B](ifEmpty: => B)(fn: (NonEmptyChunk[A]) => B): B

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

  150. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  151. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  152. def occCounts[B](sq: Seq[B]): Map[B, Int]
    Attributes
    protected[collection]
    Definition Classes
    SeqOps
  153. def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  154. def padTo[B >: A](len: Int, elem: B): Chunk[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  155. def partition(p: (A) => Boolean): (Chunk[A], Chunk[A])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  156. 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
  157. def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): Chunk[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  158. def permutations: Iterator[Chunk[A]]
    Definition Classes
    SeqOps
  159. def prepend[A1 >: A](a1: A1): Chunk[A1]

    Prepends an element to the chunk.

    Prepends an element to the chunk.

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

    Get the element at the specified index.

  183. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  184. final def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  185. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  186. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  187. def slice(from: Int, until: Int): Chunk[A]
    Definition Classes
    IndexedSeqOps → IndexedSeqOps → IterableOps → IterableOnceOps
  188. def sliding(size: Int, step: Int): Iterator[Chunk[A]]
    Definition Classes
    IterableOps
  189. def sliding(size: Int): Iterator[Chunk[A]]
    Definition Classes
    IterableOps
  190. def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): Chunk[A]
    Definition Classes
    SeqOps
  191. def sortWith(lt: (A, A) => Boolean): Chunk[A]
    Definition Classes
    SeqOps
  192. def sorted[B >: A](implicit ord: Ordering[B]): Chunk[A]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  193. def span(p: (A) => Boolean): (Chunk[A], Chunk[A])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  194. final def split(n: Int): Chunk[Chunk[A]]

    Splits this chunk into n equally sized chunks.

  195. 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
  196. final def splitWhere(f: (A) => Boolean): (Chunk[A], Chunk[A])

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

  197. def startsWith[B >: A](that: IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  198. def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit
    Definition Classes
    IndexedSeqOps → IterableOnce
  199. final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  200. final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  201. final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  202. final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  203. final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  204. final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  205. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    IndexedSeq → Seq → Iterable
  206. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  207. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  208. def tail: Chunk[A]
    Definition Classes
    IterableOps
  209. def tails: Iterator[Chunk[A]]
    Definition Classes
    IterableOps
  210. 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
  211. def takeRight(n: Int): Chunk[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  212. 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
  213. def takeWhileZIO[R, E](p: (A) => ZIO[R, E, Boolean])(implicit trace: ZTraceElement): ZIO[R, E, Chunk[A]]

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

  214. def tapEach[U](f: (A) => U): Chunk[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  215. def to[C1](factory: Factory[A, C1]): C1
    Definition Classes
    IterableOnceOps
  216. def toArray[A1 >: A](n: Int, dest: Array[A1]): Unit
    Attributes
    protected[zio]
  217. 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
  218. final def toBinaryString(implicit ev: <:<[A, Boolean]): String

    Renders this chunk of bits as a binary string.

  219. final def toBuffer[B >: A]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  220. final def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    IndexedSeq → IterableOnceOps
  221. final def toList: List[A]
    Definition Classes
    Chunk → IterableOnceOps
  222. def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  223. final def toSeq: Chunk.this.type
    Definition Classes
    Seq → IterableOnceOps
  224. def toSet[B >: A]: Set[B]
    Definition Classes
    IterableOnceOps
  225. final def toString(): String
    Definition Classes
    Chunk → Seq → Function1 → Iterable → AnyRef → Any
  226. final def toVector: Vector[A]
    Definition Classes
    Chunk → IterableOnceOps
  227. def transpose[B](implicit asIterable: (A) => Iterable[B]): Chunk[Chunk[B]]
    Definition Classes
    IterableOps
  228. def unapply(a: Int): Option[A]
    Definition Classes
    PartialFunction
  229. def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Chunk[A1], Chunk[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  230. def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Chunk[A1], Chunk[A2], Chunk[A3])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  231. 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
  232. final def updated[A1 >: A](index: Int, elem: A1): Chunk[A1]
    Definition Classes
    ChunkLike → StrictOptimizedSeqOps → SeqOps
  233. def view: IndexedSeqView[A]
    Definition Classes
    IndexedSeqOps → SeqOps → IterableOps
  234. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  235. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  236. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  237. def withFilter(p: (A) => Boolean): WithFilter[A, [_]Chunk[_]]
    Definition Classes
    IterableOps
  238. 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.

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

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

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

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

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

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 collectM[R, E, B](pf: PartialFunction[A, ZIO[R, E, B]])(implicit trace: ZTraceElement): 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 .

    Annotations
    @deprecated
    Deprecated

    (Since version 2.0.0) use collectZIO

  5. def collectWhileM[R, E, B](pf: PartialFunction[A, ZIO[R, E, B]])(implicit trace: ZTraceElement): ZIO[R, E, Chunk[B]]
    Annotations
    @deprecated
    Deprecated

    (Since version 2.0.0) use collectWhileZIO

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

    (Since version 2.13.0) Use iterableFactory instead

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

  8. def dropWhileM[R, E](p: (A) => ZIO[R, E, Boolean])(implicit trace: ZTraceElement): ZIO[R, E, Chunk[A]]
    Annotations
    @deprecated
    Deprecated

    (Since version 2.0.0) use dropWhileZIO

  9. final def filterM[R, E](f: (A) => ZIO[R, E, Boolean])(implicit trace: ZTraceElement): 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.

    Annotations
    @deprecated
    Deprecated

    (Since version 2.0.0) use filterZIO

  10. final def findM[R, E](f: (A) => ZIO[R, E, Boolean])(implicit trace: ZTraceElement): ZIO[R, E, Option[A]]

    Returns the first element that satisfies the effectful predicate.

    Returns the first element that satisfies the effectful predicate.

    Annotations
    @deprecated
    Deprecated

    (Since version 2.0.0) use findZIO

  11. final def foldM[R, E, S](s: S)(f: (S, A) => ZIO[R, E, S])(implicit trace: ZTraceElement): 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.

    Annotations
    @deprecated
    Deprecated

    (Since version 2.0.0) use foldZIO

  12. final def foldWhileM[R, E, S](z: S)(pred: (S) => Boolean)(f: (S, A) => ZIO[R, E, S])(implicit trace: ZTraceElement): ZIO[R, E, S]
    Annotations
    @deprecated
    Deprecated

    (Since version 2.0.0) use foldWhileZIO

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

  14. final def mapM[R, E, B](f: (A) => ZIO[R, E, B])(implicit trace: ZTraceElement): ZIO[R, E, Chunk[B]]

    Effectfully maps the elements of this chunk.

    Effectfully maps the elements of this chunk.

    Annotations
    @deprecated
    Deprecated

    (Since version 2.0.0) use mapZIO

  15. final def mapMPar[R, E, B](f: (A) => ZIO[R, E, B])(implicit trace: ZTraceElement): ZIO[R, E, Chunk[B]]

    Effectfully maps the elements of this chunk in parallel.

    Effectfully maps the elements of this chunk in parallel.

    Annotations
    @deprecated
    Deprecated

    (Since version 2.0.0) use mapZIOPar

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

    Annotations
    @deprecated
    Deprecated

    (Since version 2.0.0) use mapZIOParDiscard

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

    Annotations
    @deprecated
    Deprecated

    (Since version 2.0.0) use mapZIODiscard

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

    (Since version 2.13.0) Use segmentLength instead of prefixLength

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

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

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

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

  22. def takeWhileM[R, E](p: (A) => ZIO[R, E, Boolean])(implicit trace: ZTraceElement): 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.

    Annotations
    @deprecated
    Deprecated

    (Since version 2.0.0) use takeWhileZIO

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

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

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

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

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

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

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

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