Thanks to visit codestin.com
Credit goes to github.com

Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion core/shared/src/main/scala-2.12/zio/ChunkLike.scala
Original file line number Diff line number Diff line change
Expand Up @@ -33,7 +33,7 @@ import scala.reflect.ClassTag
*
* Note that `IndexedSeq` is not a referentially transparent interface in that
* it exposes methods that are partial (e.g. `apply`), allocate mutable state
* (e.g. `iterator`), or are purely side effecting (e.g. `foreach`). `Chunk`
* (e.g. `iterator`), or are purely side effecting (e.g. `foreach`). `ChunkLike`
* extends `IndexedSeq` to provide interoperability with Scala's collection
* library but users should avoid these methods whenever possible.
*/
Expand Down
2 changes: 1 addition & 1 deletion core/shared/src/main/scala-2.13+/zio/ChunkLike.scala
Original file line number Diff line number Diff line change
Expand Up @@ -32,7 +32,7 @@ import scala.reflect.ClassTag
*
* Note that `IndexedSeq` is not a referentially transparent interface in that
* it exposes methods that are partial (e.g. `apply`), allocate mutable state
* (e.g. `iterator`), or are purely side effecting (e.g. `foreach`). `Chunk`
* (e.g. `iterator`), or are purely side effecting (e.g. `foreach`). `ChunkLike`
* extends `IndexedSeq` to provide interoperability with Scala's collection
* library but users should avoid these methods whenever possible.
*/
Expand Down
8 changes: 4 additions & 4 deletions core/shared/src/main/scala/zio/Chunk.scala
Original file line number Diff line number Diff line change
Expand Up @@ -26,10 +26,10 @@ import scala.math.log
import scala.reflect.{ClassTag, classTag}

/**
* 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.
* A `Chunk[A]` represents a chunk of values of type `A`. Chunks 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
Expand Down
Loading