[Haskell-beginners] Looking for a datastructure

[David Place]

On Jul 15, 2011, at 8:30 AM, Kees Bleijenberg wrote:

>  need an index to access the elements (just like a map) and the map should
> stay sorted on another 'field' then the key (or at least it should act as a
> heap for that 'non-key field'). 

More on fingertrees.  In fact, i think this module in the fingertree package does exactly what you need.

> http://hackage.haskell.org/packages/archive/fingertree/0.0.1.0/doc/html/Data-PriorityQueue-FingerTree.html

____________________
David Place   
Owner, Panpipes Ho! LLC
http://panpipesho.com
d at vidplace.com