fingertree-tf: Generic finger-tree structure using type families.

[ bsd3, data, data-structures, library ] [ Propose Tags ]

A general sequence representation with arbitrary annotations, for use as a base for implementations of various collection types. This is an implementation modified to use associated types instead of functional dependencies.

See the original paper

For a tuned sequence type, see Data.Sequence in the containers package, which is a specialization of this structure.

Examples are not available in this package. However I am working on an fingertree-extensible package which will use an idea based on types a la carte to provide composable annotations and that package will include examples :D




Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS]
Dependencies base (<5) [details]
License BSD-3-Clause
Copyright (c) 2014 Ross Paterson, Ralf Hinze, Paweł Nowak
Author Ross Paterson, Ralf Hinze, Paweł Nowak
Category Data, Data Structures
Source repo head: git clone
this: git clone
Uploaded by pawel834 at 2014-10-05T10:06:34Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 1628 total (3 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]