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, Serializable, ChunkLike[A], IndexedSeq[A], IndexedSeq[A], IndexedSeqLike[A, Chunk[A]], Seq[A], Seq[A], SeqLike[A, Chunk[A]], GenSeq[A], GenSeqLike[A, Chunk[A]], PartialFunction[Int, A], (Int) ⇒ A, Iterable[A], Iterable[A], IterableLike[A, Chunk[A]], Equals, GenIterable[A], GenIterableLike[A, Chunk[A]], Traversable[A], Immutable, Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, Chunk], TraversableLike[A, Chunk[A]], GenTraversableLike[A, Chunk[A]], Parallelizable[A, ParSeq[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, Chunk[A]], HasNewBuilder[A, Chunk[A]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Chunk
  2. Serializable
  3. Serializable
  4. ChunkLike
  5. IndexedSeq
  6. IndexedSeq
  7. IndexedSeqLike
  8. Seq
  9. Seq
  10. SeqLike
  11. GenSeq
  12. GenSeqLike
  13. PartialFunction
  14. Function1
  15. Iterable
  16. Iterable
  17. IterableLike
  18. Equals
  19. GenIterable
  20. GenIterableLike
  21. Traversable
  22. Immutable
  23. Traversable
  24. GenTraversable
  25. GenericTraversableTemplate
  26. TraversableLike
  27. GenTraversableLike
  28. Parallelizable
  29. TraversableOnce
  30. GenTraversableOnce
  31. FilterMonadic
  32. HasNewBuilder
  33. AnyRef
  34. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. type Self = Chunk[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def apply(idx: Int): A
    Definition Classes
    SeqLike → GenSeqLike
  2. abstract def chunkIterator: ChunkIterator[A]
  3. abstract def length: Int
    Definition Classes
    SeqLike → GenSeqLike

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. def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Chunk[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  7. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[Chunk[A], B, That]): That
    Definition Classes
    TraversableLike
  8. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Chunk[A], B, That]): That
    Definition Classes
    TraversableLike
  9. final def +:[A1 >: A, That](a1: A1)(implicit bf: CanBuildFrom[Chunk[A], A1, That]): That
    Definition Classes
    ChunkLike → SeqLike → GenSeqLike
  10. final def :+[A1 >: A, That](a1: A1)(implicit bf: CanBuildFrom[Chunk[A], A1, That]): That
    Definition Classes
    ChunkLike → SeqLike → GenSeqLike
  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. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  14. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  15. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  16. def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  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. def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  20. final def asBitsByte(implicit ev: <:<[A, Byte]): Chunk[Boolean]

    Converts a chunk of bytes to a chunk of bits.

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

    Converts a chunk of ints to a chunk of bits.

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

    Converts a chunk of longs to a chunk of bits.

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

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

    Crates a new String based on this chunks data.

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

    Get the element at the specified index.

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

    Get the element at the specified index.

  28. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  29. def char(index: Int)(implicit ev: <:<[A, Char]): Char

    Get the element at the specified index.

  30. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  31. final def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Chunk[A], B, That]): That

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

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

    Definition Classes
    ChunkLike → TraversableLike → GenTraversableLike
  32. 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
  33. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    TraversableOnce
  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 collectWhileZIO[R, E, B](pf: PartialFunction[A, ZIO[R, E, B]])(implicit trace: Trace): ZIO[R, E, Chunk[B]]
  36. 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 .

  37. def combinations(n: Int): Iterator[Chunk[A]]
    Definition Classes
    SeqLike
  38. def companion: GenericCompanion[Chunk]
    Definition Classes
    ChunkLike → IndexedSeq → IndexedSeq → Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  39. def compose[A](g: (A) ⇒ Int): (A) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  40. def concatDepth: Int
    Attributes
    protected
  41. def contains[A1 >: A](elem: A1): Boolean
    Definition Classes
    SeqLike
  42. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  43. def copyToArray[A1 >: A](dest: Array[A1], destPos: Int, length: Int): Unit
    Definition Classes
    ChunkLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  44. def copyToArray[B >: A](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def copyToArray[B >: A](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  46. def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  47. 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.

  48. def corresponds[B](that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  49. def count(p: (A) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. def dedupe: Chunk[A]

    Deduplicates adjacent elements that are identical.

  51. def depth: Int
    Attributes
    protected
  52. def diff[B >: A](that: GenSeq[B]): Chunk[A]
    Definition Classes
    SeqLike → GenSeqLike
  53. def distinct: Chunk[A]
    Definition Classes
    SeqLike → GenSeqLike
  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 → IterableLike → TraversableLike → GenTraversableLike
  56. 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 → IterableLike
  57. def dropUntil(f: (A) ⇒ Boolean): Chunk[A]

    Drops all elements until the predicate returns true.

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

  59. 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 → TraversableLike → GenTraversableLike
  60. 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.

  61. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  62. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  63. def equals(that: Any): Boolean
    Definition Classes
    Chunk → GenSeqLike → 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 → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  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 → TraversableLike → GenTraversableLike
  66. def filterNot(p: (A) ⇒ Boolean): Chunk[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  67. 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.

  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 → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  70. 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.

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

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

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

    Definition Classes
    ChunkLike → TraversableLike → GenTraversableLike → FilterMonadic
  72. final def flatMapChunk[B, That](f: (A) ⇒ GenTraversableOnce[B]): Chunk[B]

    The implementation of flatMap for Chunk.

    The implementation of flatMap for Chunk.

    Attributes
    protected
    Definition Classes
    ChunkLike
  73. def flatten[B](implicit ev: (A) ⇒ GenTraversableOnce[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 → GenericTraversableTemplate
  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
    TraversableOnce → GenTraversableOnce
  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 → TraversableOnce → GenTraversableOnce
  77. 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 → IterableLike → TraversableOnce → GenTraversableOnce
  78. 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.

  79. 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]
  80. 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.

  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 → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  82. def foreach[U](f: (A) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  83. def genericBuilder[B]: Builder[B, Chunk[B]]
    Definition Classes
    GenericTraversableTemplate
  84. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  85. def groupBy[K](f: (A) ⇒ K): Map[K, Chunk[A]]
    Definition Classes
    TraversableLike → GenTraversableLike
  86. def grouped(size: Int): Iterator[Chunk[A]]
    Definition Classes
    IterableLike
  87. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  88. final def hashCode(): Int
    Definition Classes
    Chunk → IndexedSeqLike → GenSeqLike → AnyRef → Any
  89. 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 → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike
  90. 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 → TraversableLike → GenTraversableLike
  91. def indexOf[B >: A](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  92. def indexOf[B >: A](elem: B): Int
    Definition Classes
    GenSeqLike
  93. def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  94. def indexOfSlice[B >: A](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  95. 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 → SeqLike → GenSeqLike
  96. final def indexWhere(f: (A) ⇒ Boolean): Int

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

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

    Definition Classes
    ChunkLike → GenSeqLike
  97. def indices: Range
    Definition Classes
    SeqLike
  98. def init: Chunk[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  99. def inits: Iterator[Chunk[A]]
    Definition Classes
    TraversableLike
  100. def int(index: Int)(implicit ev: <:<[A, Int]): Int

    Get the element at the specified index.

  101. def intersect[B >: A](that: GenSeq[B]): Chunk[A]
    Definition Classes
    SeqLike → GenSeqLike
  102. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  103. final def isEmpty: Boolean

    Determines if the chunk is empty.

    Determines if the chunk is empty.

    Definition Classes
    Chunk → SeqLike → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce
  104. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  105. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  106. def iterator: Iterator[A]
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  107. def last: A
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def lastIndexOf[B >: A](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  109. def lastIndexOf[B >: A](elem: B): Int
    Definition Classes
    GenSeqLike
  110. def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  111. def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  112. def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  113. def lastIndexWhere(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  114. 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 → TraversableLike → GenTraversableLike
  115. def left: Chunk[A]
    Attributes
    protected
  116. def lengthCompare(len: Int): Int
    Definition Classes
    SeqLike
  117. def lift: (Int) ⇒ Option[A]
    Definition Classes
    PartialFunction
  118. def long(index: Int)(implicit ev: <:<[A, Long]): Long

    Get the element at the specified index.

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

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

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

    Definition Classes
    ChunkLike → TraversableLike → GenTraversableLike → FilterMonadic
  120. 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.

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

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

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

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

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

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

  128. def max[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def min[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. final def mkString: String

    Generates a readable string representation of this chunk.

    Generates a readable string representation of this chunk.

    Definition Classes
    ChunkLike → TraversableOnce → GenTraversableOnce
  133. final def mkString(sep: String): String

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

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

    Definition Classes
    ChunkLike → TraversableOnce → GenTraversableOnce
  134. final def mkString(start: String, sep: String, end: String): String

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

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

    Definition Classes
    ChunkLike → TraversableOnce → GenTraversableOnce
  135. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  136. def negate(implicit ev: <:<[A, Boolean]): BitChunkByte

    Returns the bitwise NOT of this chunk.

  137. def newBuilder: ChunkBuilder[A]

    Constructs a new ChunkBuilder.

    Constructs a new ChunkBuilder. This operation allocates mutable state and is not referentially transparent. It is provided for compatibility with Scala's collection library and should not be used for other purposes.

    Attributes
    protected[this]
    Definition Classes
    ChunkLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  138. final def nonEmpty: Boolean

    Determines if the chunk is not empty.

    Determines if the chunk is not empty.

    Definition Classes
    ChunkLike → TraversableOnce → GenTraversableOnce
  139. def nonEmptyOrElse[B](ifEmpty: ⇒ B)(fn: (NonEmptyChunk[A]) ⇒ B): B

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

  140. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  141. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  142. def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  143. def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  144. def par: ParSeq[A]
    Definition Classes
    Parallelizable
  145. def parCombiner: Combiner[A, ParSeq[A]]
    Attributes
    protected[this]
    Definition Classes
    Seq → SeqLike → Iterable → TraversableLike → Parallelizable
  146. def partition(p: (A) ⇒ Boolean): (Chunk[A], Chunk[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  147. 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 → ChunkLike
  148. def patch[B >: A, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  149. def permutations: Iterator[Chunk[A]]
    Definition Classes
    SeqLike
  150. def prefixLength(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  151. def prepend[A1 >: A](a1: A1): Chunk[A1]

    Prepends an element to the chunk.

    Prepends an element to the chunk.

    Attributes
    protected
  152. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  153. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  154. def reduceLeft[B >: A](op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce
  155. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  157. def reduceRight[B >: A](op: (A, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  158. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  159. def repr: Chunk[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  160. def reverse: Chunk[A]
    Definition Classes
    SeqLike → GenSeqLike
  161. def reverseIterator: Iterator[A]
    Definition Classes
    SeqLike
  162. def reverseMap[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  163. def reversed: List[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  164. def right: Chunk[A]
    Attributes
    protected
  165. def runWith[U](action: (A) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  166. def sameElements[B >: A](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  167. def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Chunk[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  168. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  169. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  170. def segmentLength(p: (A) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  171. def seq: IndexedSeq[A]
    Definition Classes
    IndexedSeq → IndexedSeq → IndexedSeqLike → Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  172. def short(index: Int)(implicit ev: <:<[A, Short]): Short

    Get the element at the specified index.

  173. final def size: Int

    The number of elements in the chunk.

    The number of elements in the chunk.

    Definition Classes
    ChunkLike → SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  174. def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    IndexedSeqLike → GenTraversableOnce
  175. def slice(from: Int, until: Int): Chunk[A]
    Definition Classes
    Chunk → IterableLike → TraversableLike → GenTraversableLike
  176. def sliding(size: Int, step: Int): Iterator[Chunk[A]]
    Definition Classes
    IterableLike
  177. def sliding(size: Int): Iterator[Chunk[A]]
    Definition Classes
    IterableLike
  178. def sortBy[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): Chunk[A]
    Definition Classes
    SeqLike
  179. def sortWith(lt: (A, A) ⇒ Boolean): Chunk[A]
    Definition Classes
    SeqLike
  180. def sorted[A1 >: A](implicit ord: Ordering[A1]): Chunk[A]
    Definition Classes
    ChunkLike → SeqLike
  181. def span(f: (A) ⇒ Boolean): (Chunk[A], Chunk[A])
    Definition Classes
    Chunk → TraversableLike → GenTraversableLike
  182. final def split(n: Int): Chunk[Chunk[A]]

    Splits this chunk into n equally sized chunks.

  183. 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 → TraversableLike → GenTraversableLike
  184. final def splitWhere(f: (A) ⇒ Boolean): (Chunk[A], Chunk[A])

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

  185. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  186. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  187. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  188. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  189. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  190. def tail: Chunk[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  191. def tails: Iterator[Chunk[A]]
    Definition Classes
    TraversableLike
  192. 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 → IterableLike → TraversableLike → GenTraversableLike
  193. 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 → IterableLike
  194. 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 → IterableLike → TraversableLike → GenTraversableLike
  195. 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.

  196. def thisCollection: IndexedSeq[A]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  197. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  198. def toArray[A1 >: A](srcPos: Int, dest: Array[A1], destPos: Int, length: Int): Unit
    Attributes
    protected[zio]
  199. final def toArray[A1 >: A](n: Int, dest: Array[A1]): Unit
    Attributes
    protected[zio]
  200. 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 → TraversableOnce → GenTraversableOnce
  201. final def toBinaryString(implicit ev: <:<[A, Boolean]): String

    Renders this chunk of bits as a binary string.

  202. def toBuffer[A1 >: A]: Buffer[A1]
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  203. def toCollection(repr: Chunk[A]): IndexedSeq[A]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  204. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    IndexedSeq → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  205. def toIterable: Iterable[A]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  206. def toIterator: Iterator[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  207. final def toList: List[A]
    Definition Classes
    Chunk → TraversableOnce → GenTraversableOnce
  208. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  209. def toPackedByte(implicit ev: <:<[A, Boolean]): Chunk[Byte]
  210. def toPackedInt(endianness: Endianness)(implicit ev: <:<[A, Boolean]): Chunk[Int]
  211. def toPackedLong(endianness: Endianness)(implicit ev: <:<[A, Boolean]): Chunk[Long]
  212. def toSeq: Seq[A]
    Definition Classes
    Seq → SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  213. def toSet[B >: A]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  214. def toStream: Stream[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  215. final def toString(): String
    Definition Classes
    Chunk → SeqLike → Function1 → TraversableLike → AnyRef → Any
  216. def toTraversable: Traversable[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  217. final def toVector: Vector[A]
    Definition Classes
    Chunk → TraversableOnce → GenTraversableOnce
  218. def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Chunk[Chunk[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  219. def union[B >: A, That](that: GenSeq[B])(implicit bf: CanBuildFrom[Chunk[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  220. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Chunk[A1], Chunk[A2])
    Definition Classes
    GenericTraversableTemplate
  221. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Chunk[A1], Chunk[A2], Chunk[A3])
    Definition Classes
    GenericTraversableTemplate
  222. 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
  223. final def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Chunk[A], B, That]): That
    Definition Classes
    ChunkLike → SeqLike → GenSeqLike
  224. def view(from: Int, until: Int): SeqView[A, Chunk[A]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  225. def view: SeqView[A, Chunk[A]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  226. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  227. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  228. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  229. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, Chunk[A]]
    Definition Classes
    TraversableLike → FilterMonadic
  230. 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.

  231. def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Chunk[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  232. 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.

  233. def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Chunk[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  234. 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.

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

  236. 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
  237. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Chunk[A], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  238. final def zipWithIndexFrom(indexOffset: Int): Chunk[(A, Int)]

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

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

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

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

Inherited from Serializable

Inherited from Serializable

Inherited from ChunkLike[A]

Inherited from IndexedSeq[A]

Inherited from IndexedSeq[A]

Inherited from IndexedSeqLike[A, Chunk[A]]

Inherited from Seq[A]

Inherited from Seq[A]

Inherited from SeqLike[A, Chunk[A]]

Inherited from GenSeq[A]

Inherited from GenSeqLike[A, Chunk[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) ⇒ A

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, Chunk[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, Chunk[A]]

Inherited from Traversable[A]

Inherited from Immutable

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from GenericTraversableTemplate[A, Chunk]

Inherited from TraversableLike[A, Chunk[A]]

Inherited from GenTraversableLike[A, Chunk[A]]

Inherited from Parallelizable[A, ParSeq[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, Chunk[A]]

Inherited from HasNewBuilder[A, Chunk[A]]

Inherited from AnyRef

Inherited from Any

Ungrouped