[Haskell-beginners] Looking for a datastructure

[David Place]

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

> I 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'). 
> 
> Kees


Hi, Kees.

Have you looked into fingertrees?  They give an enormously powerful way to express incremental computations over trees with big O logarithmic complexity.  

> http://www.soi.city.ac.uk/~ross/papers/FingerTree.html

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