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 [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.*) [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 Sep 28 11:31:04 UTC 2015
Distributions NixOS:0.2.0.4
Downloads 3147 total (225 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs not available [build log]
All reported builds failed as of 2016-12-01 [all 6 reports]

Modules

  • Data
    • Data.Compositions
      • Data.Compositions.Internal

Downloads

Maintainer's Corner

For package maintainers and hackage trustees