composition-tree: Composition trees for arbitrary monoids.
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.
|Versions [faq]||0.1.0.0, 0.1.0.1, 0.1.1.0, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.0.3, 0.2.0.4|
|Dependencies||base (>=4.7 && <4.9) [details]|
|Copyright||Liam O'Connor, 2015|
|Source repo||head: git clone https://github.com/liamoc/composition-tree|
|Uploaded||by LiamOConnorDavis at Wed Oct 7 04:32:54 UTC 2015|
|Downloads||2160 total (141 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2015-10-07 [all 1 reports]
For package maintainers and hackage trustees