dlistversion
A purely functional list-like data structure supporting O(1) concatenation
Dlist (Difference List) is a purely functional list-like data structure supporting O(1) concatenation. This is particularly useful for efficient list construction from many lists. Dlist is a lazy immutable data type with no side effect.
This data structure is very handy when your algorithm requires lots of concatenations from many lists.
The idea is inspired by Haskell Data.Dlist and the APIs are influenced by Core.List.
Project: https://github.com/BYVoid/Dlist
Documentation: http://byvoid.github.io/Dlist/Dlist.html
| Author | BYVoid <byvoid@byvoid.com> |
|---|---|
| License | BSD-3-Clause |
| Published | |
| Homepage | https://github.com/BYVoid/Dlist |
| Maintainer | byvoid@byvoid.com |
| Dependencies | |
| Optional dependencies | |
| Conflicts |
|
| Source [http] | https://github.com/BYVoid/Dlist/archive/v0.1.0.tar.gz sha256=2a2c413ee36b824f65e4173f1d80a15de168f11a2bfaf2dfd48e25788732f5f9 md5=c1d4231c188b6e512e5037a32ed99039 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/dlist/dlist.0.1.0/opam |
Required by
