PairingHeap

The names of the product elements

The name of the type

This is thought to be O(log N) where N is the size of the final heap

build a heap from a list of items, O(N)

this is useful for finding the k maximum values in O(N) times for N items same as as.toList.sorted.reverse.take(count), but O(N log(count)) vs O(N log N) for a full sort. When N is very large, this can be a very large savings

This is the same order as you would get by doing .toList and ordering by that