mozilla/rust — pull request #4146 by thestinger (2012-12-10 01:52:51+00:00)
Title: add priority queue implementation (binary heap)

This adds a priority queue implemented as a binary heap to std. The API is heavily inspired by python's heapq module except that it's encapsulated in a container and uses a max-heap to get the default of high values being the max priority and sorting with `to_sorted_vec` in ascending order.