Expand description
Provides functionality to get the n
largest items from a &mut [T]
.
This library can provide significant performance increase compared to sorting or
converting to a heap when n
is relatively small.
The unstable methods can be used without the standard library.
n = 100, len = 1_000_000:
test binary_heap ... bench: 6,599,355 ns/iter (+/- 84,674)
test max ... bench: 669,726 ns/iter (+/- 13,595)
test max_unstable ... bench: 635,435 ns/iter (+/- 9,683)
test sort ... bench: 62,585,547 ns/iter (+/- 1,361,258)
test sort_unstable ... bench: 34,595,265 ns/iter (+/- 739,255)
Functions
Get the
n
largest items.Get the
n
largest items with a comparator function.Get the
n
largest items with a key extraction function.Get the
n
largest items.Get the
n
largest items with a comparator function.Get the
n
largest items with a key extraction function.