Packages

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

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
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. ChunkLike
  3. StrictOptimizedSeqOps
  4. StrictOptimizedSeqOps
  5. StrictOptimizedIterableOps
  6. IndexedSeq
  7. IndexedSeqOps
  8. IndexedSeq
  9. IndexedSeqOps
  10. Seq
  11. SeqOps
  12. Seq
  13. Equals
  14. SeqOps
  15. PartialFunction
  16. Function1
  17. Iterable
  18. Iterable
  19. IterableFactoryDefaults
  20. IterableOps
  21. IterableOnceOps
  22. IterableOnce
  23. AnyRef
  24. 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 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 collectM[R, E, B](pf: PartialFunction[A, ZIO[R, E, B]]): ZIO[R, E, Chunk[B]]

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

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

  35. def collectWhileM[R, E, B](pf: PartialFunction[A, ZIO[R, E, B]]): ZIO[R, E, Chunk[B]]
  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 depth: Int
    Attributes
    protected
  50. def diff[B >: A](that: Seq[B]): Chunk[A]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  51. def distinct: Chunk[A]
    Definition Classes
    SeqOps
  52. def distinctBy[B](f: (A) => B): Chunk[A]
    Definition Classes
    StrictOptimizedSeqOps → StrictOptimizedSeqOps → SeqOps
  53. def double(index: Int)(implicit ev: <:<[A, Double]): Double

    Get the element at the specified index.

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

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

  67. def filterNot(pred: (A) => Boolean): Chunk[A]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  68. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  69. 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
  70. def findLast(p: (A) => Boolean): Option[A]
    Definition Classes
    SeqOps
  71. 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
  72. final def flatten[B](implicit ev: <:<[A, Chunk[B]]): Chunk[B]

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

  73. def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): Chunk[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  74. def float(index: Int)(implicit ev: <:<[A, Float]): Float

    Get the element at the specified index.

  75. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  76. 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
  77. final def foldM[R, E, S](s: S)(f: (S, A) => ZIO[R, E, S]): ZIO[R, E, S]

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

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

    Get the element at the specified index.

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

    Determines if the chunk is empty.

    Determines if the chunk is empty.

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

    Get the element at the specified index.

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

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

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

  127. 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
  128. final def mapM[R, E, B](f: (A) => ZIO[R, E, B]): ZIO[R, E, Chunk[B]]

    Effectfully maps the elements of this chunk.

  129. final def mapMPar[R, E, B](f: (A) => ZIO[R, E, B]): ZIO[R, E, Chunk[B]]

    Effectfully maps the elements of this chunk in parallel.

  130. final def mapMPar_[R, E](f: (A) => ZIO[R, E, Any]): ZIO[R, E, Unit]

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

  131. final def mapM_[R, E](f: (A) => ZIO[R, E, Any]): ZIO[R, E, Unit]

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

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

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

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

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

    Prepends an element to the chunk.

    Prepends an element to the chunk.

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

    Get the element at the specified index.

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

    Splits this chunk into n equally sized chunks.

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

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

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

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

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

    Renders this chunk of bits as a binary string.

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

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

    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.

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

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

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

  241. 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
  242. 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 +[A1 >: A](a: A1): Chunk[A1]

    Appends an element to the chunk

    Appends an element to the chunk

    Annotations
    @deprecated
    Deprecated

    (Since version 1.0.0) use :+

  2. 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 /:

  3. 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 :\

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

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

    (Since version 2.13.0) Use iterableFactory instead

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

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

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

    (Since version 2.13.0) Use segmentLength instead of prefixLength

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

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

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

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

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

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

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

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

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

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

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

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