composition-tree

Composition trees for arbitrary monoids.

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

Version on this page:	0.2.0.2
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.2.0.2@sha256:db3c8f7f7df030430b829dbd98db9fba5f0fa27b2bf855e0acc5d3bd6705a048,1566

Module documentation for 0.2.0.2

Data
- Data.Compositions
  - Data.Compositions.Internal
  - Data.Compositions.Snoc
    - Data.Compositions.Snoc.Internal

Depends on 1 package(full list with versions):

base

Used by 1 package in lts-6.11(full list with versions):

dixi

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.