- Companion:
- class
- Source:
- Heap.scala
Type members
Inherited types
The names of the product elements
The names of the product elements
- Inherited from:
- Mirror
- Source:
- Mirror.scala
Value members
Concrete methods
Build a heap using an Iterable Order O(n)
Build a heap using an Iterable Order O(n)
- Source:
- Heap.scala
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 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
- Source:
- Heap.scala
Implicits
Implicits
This is the same order as you would get by doing .toList and ordering by that
This is the same order as you would get by doing .toList and ordering by that
- Source:
- Heap.scala