dlist 0.0.3
| Author | BYVoid <byvoid@byvoid.com> | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| License | BSD3 | |||||||||||||
| Homepage | https://github.com/BYVoid/Dlist | |||||||||||||
| Maintainer | byvoid@byvoid.com | |||||||||||||
| Dependencies |
|
|||||||||||||
| Optional dependencies |
|
|||||||||||||
| OCaml | >= 4.00.1 | |||||||||||||
| Published | Nov 5, 2013 | |||||||||||||
| Source [http] |
https://github.com/BYVoid/Dlist/archive/v0.0.3.tar.gz fd8094867a381c856e943d2bb9b3b9b3 |
|||||||||||||
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/dlist/dlist.0.0.3/opam | |||||||||||||
A purely functional list-like data structure supporting O(1) concatenation.
This is particularly useful for efficient list construction from many lists. It is an immutable data type containing no side effect.
This data structure is very useful when your algorithm requires lots of concatenations of many lists.
Project: https://github.com/BYVoid/Dlist
Documentation: http://byvoid.github.io/Dlist/Dlist.html
| Necessary for | ||
|---|---|---|
| batsh |