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

Nov 8, 2013

Published version 0.1.0

Nov 5, 2013

Published version 0.0.3

Oct 7, 2013

Published version 0.0.2

Oct 2, 2013

Published version 0.0.1