Look into ways of writing an efficient `divvy`.
Open
Seq
- Dominant language
- Haskell
- Stars
- 355
- Forks
- 194
- Avg merge
- 3d 4h
- Merged PRs (30d)
- 4
Description
[There is a function `divvy` in `split`.][1] David @treeowl thinks that we can replicate it in `Data.Sequence` in an efficient way. I am going to look into it.
[1]: https://hackage.haskell.org/package/split-0.2.3.4/docs/Data-List-Split.html#v:divvy
Contributor guide
Assessment
This issue has not been assessed yet.