Not sure if this is a good name for it. We do a lot of fetching an array from the top of the heap (priority queue).
results = 
while results.size < max and size > 0 do
results << pop
If you think it's a good idea, I'll make a proper pull request with a UT.