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

AuthorBYVoid <byvoid@byvoid.com>
LicenseBSD3
Published
Homepagehttps://github.com/BYVoid/Dlist
Maintainerbyvoid@byvoid.com
Dependencies
Optional dependencies
Conflicts
Source [http] https://github.com/BYVoid/Dlist/archive/v0.1.0.tar.gz
md5=c1d4231c188b6e512e5037a32ed99039
StatisticsInstalled 11 times last month.
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/dlist/dlist.0.1.0/opam
Required by