add top (?) that takes max #9

Open
dblock opened this Issue Feb 12, 2011 · 0 comments

Projects

None yet

1 participant

@dblock
dblock commented Feb 12, 2011

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).

def top(max)
  results = []
  while results.size < max and size > 0 do 
    results << pop 
  end
  results
end

If you think it's a good idea, I'll make a proper pull request with a UT.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment