[Haskell-beginners] Looking for a datastructure

[Kees Bleijenberg]

Jedaï,


On Fri, Jul 15, 2011 at 11:42 AM, Kees Bleijenberg
<k.bleijenberg at inter.nl.net> wrote:
> My program uses a very long list of (index,count) items. Index and 
> count are Int's.
> The program updates the count values a lot. Therefor it uses the index 
> as a key to update the belonging count value.
> After updating, the program needs the (index,count) pair with the 
> least count value in the list.
> What is an approriate (fast) datastructure? My first idea was to use a
heap.
> Problem with the heap is that I can't update the count value by its 
> index fast.
> Any ideas?

Do you need to be able to "remove" the pair that has the least count cheaply
?

Yes, that would be nice. But as an alternative I can give give it a very,
very high count.
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