composition-tree

Composition trees for arbitrary monoids.

https://github.com/liamoc/composition-tree

Version on this page:	0.1.1.0
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]

This version can be pinned in stack with:composition-tree-0.1.1.0@sha256:64b3a00631b338325288956a54daae77140fc1237c748fc4fd1e82e0b9783762,1466

Module documentation for 0.1.1.0

Data
- Data.Compositions
  - Data.Compositions.Internal

Depends on 1 package(full list with versions):

base

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.