Author BYVoid <byvoid@byvoid.com>
License BSD3
Homepage https://github.com/BYVoid/Dlist
Maintainer byvoid@byvoid.com
ocp-build >= 1.99.6-beta
Optional dependencies
| core_bench
Available ocaml-version >= "4.00.1"
Published Nov 8, 2013
Source [http] http://github.com/BYVoid/Dlist/archive/v0.1.0.tar.gz
Statistics Installed 26 times in last month.
Edit https://github.com/ocaml/opam-repository/tree/master/packages/dlist/dlist.0.1.0/opam

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

Necessary for