Github user ScrapCodes commented on the pull request:
https://github.com/apache/spark/pull/97#issuecomment-37505304
PriorityQueue in a way is just a wrapper over heapq and allows for blocking
for put and get(AFAIU). We would need maxheapq to retain the top N smallest
elements. One other thing we can do instead of copying heapq is that we write
one of our own in a nice extensible way, which allows one to plugin a
comparator.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at infrastruct...@apache.org or file a JIRA ticket
with INFRA.
---
