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.
Modules
[Index]
Downloads
- composition-tree-0.2.0.4.tar.gz [browse] (Cabal source package)
 - Package description (as included in the package)
 
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
 
| Versions [RSS] | 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.12) [details] | 
| License | BSD-3-Clause | 
| Copyright | Liam O'Connor, 2015 | 
| Author | Liam O'Connor | 
| Maintainer | liamoc@cse.unsw.edu.au | 
| Category | Data | 
| Home page | https://github.com/liamoc/composition-tree | 
| Source repo | head: git clone https://github.com/liamoc/composition-tree | 
| Uploaded | by LiamOConnorDavis at 2018-05-07T23:23:28Z | 
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] | 
| Downloads | 6011 total (17 in the last 30 days) | 
| Rating | (no votes yet) [estimated by Bayesian average] | 
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2018-05-07 [all 1 reports]  |