fingertree

Generic finger-tree structure, with example instances

Version on this page:0.1.1.0
LTS Haskell 9.14:0.1.2.1
Stackage Nightly 2017-11-21:0.1.2.1
Latest on Hackage:0.1.2.1
BSD3 licensed
Maintained by Ross Paterson

Module documentation for 0.1.1.0

A general sequence representation with arbitrary annotations, for use as a base for implementations of various collection types, with examples, as described in section 4 of

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

Changes

-*-change-log-*-

0.1.2.1 Ross Paterson <R.Paterson@city.ac.uk> Oct 2017
* Fix for GHC <= 7.8

0.1.2.0 Ross Paterson <R.Paterson@city.ac.uk> Oct 2017
* Removed constraint on the type of null
* Added versions of fmap and traverse passing the measures of both sides
* Added new search function, a symmetrical generalization of split
* Added Eq, Ord and Show instances for IntervalMap and PriorityQueue
* Made low and high into separate functions
* Updated for Monoid, Foldable, Traversable in Prelude
* Made compatible with Semigroup/Monoid proposal

0.1.1.0 Ross Paterson <R.Paterson@city.ac.uk> Jun 2015
* Added Safe for GHC >= 7.2
* Added AutoDeriveTypeable for GHC >= 7.10

0.1.0.2 Ross Paterson <ross@soi.city.ac.uk> Mar 2015
* Cabal file updates

0.1.0.1 Ross Paterson <ross@soi.city.ac.uk> Feb 2015
* fix warnings

0.1.0.0 Ross Paterson <ross@soi.city.ac.uk> Jun 2013
* Added Monoid instance for IntervalMap
* Removed unnecessary Measured v a constraints on Eq, Ord, and Show instances

0.0.1.1 Ross Paterson <ross@soi.city.ac.uk> Sep 2012
* Cabal file updates

0.0.1.0 Ross Paterson <ross@soi.city.ac.uk> Jul 2009
* Added Data.IntervalMap.FingerTree and Data.PriorityQueue.FingerTree

0.0 Ross Paterson <ross@soi.city.ac.uk> May 2007
* Initial revision
comments powered byDisqus