PQueue v2.0.2 released

PQueue 2.0.2 has been released.

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.

It’s been one of those days. I went to to get a wash cloth for the
shower, on my way through the kitchen realized the chilling cookie dough
needed to be put in the oven, but I forgot to put flower in the batter,
so they burnt up in minutes and made a mess that took a half-hour to
clean-up. Then I discover the shower still running, hot water was all
but gone, and my bedroom felt like a suana. To top it all off, it was at
this moment I realized PQueue’s binary search algrithm didn’t work.
Sigh. And fuck if my grandmother won’t stop making me food I don’t want
to eat. Yea, one of those days!

Changes:

  • Fixed #reheap search algorithm.

On Sat, Oct 29, 2011 at 4:27 PM, [email protected] wrote:

Changes:

  • Fixed #reheap search algorithm.

Aww, hope things get better soon. Thanks for the update.

  • Fixed #reheap search algorithm.

Aww, hope things get better soon. Thanks for the update.

Hope you got a laugh :slight_smile:

It must all sound rather absurd from the outside so I thought others
might get a little chuckle out it.

This forum is not affiliated to the Ruby language, Ruby on Rails framework, nor any Ruby applications discussed here.

| Privacy Policy | Terms of Service | Remote Ruby Jobs