[erlang-questions] Priority queue

[Yerl]

Thanks Ulf.

How I forgot this.

cheers
Y.

Ulf Wiger (TN/EAB) a écrit :
> You can use a gb_trees structure:
>
> in(Item, Prio, Q) ->
>    gb_trees:insert({Prio,now()}, Item, Q).
>
> out(Q) ->
>    gb_trees:take_smallest(Q).
>
> peek(Q) ->
>    gb_trees:smallest(Q).
>
> The order will be FIFO. If you want LIFO, you 
> could negate the Prio value and take_largest
> instead.
>
> BR,
> Ulf W
>
>   
>> -----Original Message-----
>> From: erlang-questions-bounces@REDACTED 
>> [mailto:erlang-questions-bounces@REDACTED] On Behalf Of Yerl
>> Sent: den 27 juni 2007 20:56
>> To: erlang-questions@REDACTED
>> Subject: [erlang-questions] Priority queue
>>
>> Hi Folks!
>>
>> I'm looking for a robust implementation of "Priority queue"
>> (http://en.wikipedia.org/wiki/Priority_queue) in Erlang.
>>
>> Any pointer?
>>
>> cheers
>> Y.
>> _______________________________________________
>> erlang-questions mailing list
>> erlang-questions@REDACTED
>> http://www.erlang.org/mailman/listinfo/erlang-questions
>>
>>     
>  
>
>