Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

SPARK-1321 Use Guava's top k implementation rather than our BoundedPriorityQueue based implementation #229

Closed
wants to merge 1 commit into from
Closed

SPARK-1321 Use Guava's top k implementation rather than our BoundedPriorityQueue based implementation #229

wants to merge 1 commit into from
+72 −16

Commits on Mar 26, 2014

  1. Use Guava's top k implementation rather than our BoundedPriorityQueue… 

    … based implementation. Also updated the documentation for top and takeOrdered.

Guava's top k implementation (in Ordering) is much faster than the BoundedPriorityQueue implementation for roughly sorted input (10 - 20X faster), and still faster for purely random input (2 - 5X).
    @rxin
    rxin committed Mar 26, 2014
    Configuration menu
    Copy the full SHA
    0d11844 View commit details
    Browse the repository at this point in the history