composition-tree

Composition trees for arbitrary monoids. https://github.com/liamoc/composition-tree

Version on this page:0.2.0.3
LTS Haskell 6.35:0.2.0.3
Stackage Nightly 2016-05-25:0.2.0.2
Latest on Hackage:0.2.0.4

See all snapshots composition-tree appears in

BSD-3-Clause licensed by Liam O'Connor
Maintained by [email protected]

Module documentation for 0.2.0.3

This version can be pinned in stack with:[email protected]:dd5cbcd7805cadb44762683955095da856a6cb397e5d3e13bde6bda3dbd8951c,1568

A compositions list or composition tree is a list data type where the elements are monoids, and the mconcat of any contiguous sublist can be computed in logarithmic time. A common use case of this type is in a wiki, version control system, or collaborative editor, where each change or delta would be stored in a list, and it is sometimes necessary to compute the composed delta between any two versions.

Depends on 1 package(full list with versions):
Used by 1 package in lts-6.35(full list with versions):