composition-tree: Composition trees for arbitrary monoids.

[ bsd3, data, library ] [ Propose Tags ]

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 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 Mon May 7 23:23:28 UTC 2018
Distributions NixOS:0.2.0.4
Downloads 1853 total (92 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-05-07 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees