dlist

A purely functional list-like data structure supporting O(1) concatenation
Description

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

Install
Sources
v0.1.0.tar.gz
md5=c1d4231c188b6e512e5037a32ed99039
Dependencies
ocp-build
>= "1.99.6-beta"
ocaml
>= "4.00.1"
Reverse Dependencies