pqueue 2.0.1

A priority queue is like a standard queue, except that each inserted elements is given a certain priority, based on the result of the comparison block given at instantiation time. Retrieving an element from the queue will always return the one with the highest priority.

Gemfile:
= Copier Copié!

installation:
=

Versions:

2.1.0 - March 03, 2015 (11 ko)
2.0.2 - October 29, 2011 (9 ko)
2.0.1 - October 29, 2011 (8,5 ko)
2.0.0 - October 29, 2011 (9,5 ko)
1.0.0 - August 05, 2009 (9,5 ko)

Dépendances de Development (3):

ae >= 0

detroit >= 0

microtest >= 0

Show all transitive dependencies

Propriétaires:

Auteurs:

K. Kodama, Ronald Butler, Olivier Renaud, Rick Bradley, Thomas Sawyer

Total de contrôle SHA 256:

1ee2a07712ad88f55520071113e0459d7375ad15f0363c813fc7bde121d68799