cats.collections.Heap$
See theHeap companion class
object Heap
Attributes
- Companion:
- class
- Source:
- Heap.scala
- Graph
- Supertypes
- Self type
- Heap.type
Members list
Concise view
Type members
Inherited types
The names of the product elements
The name of the type
Value members
Concrete methods
Attributes
- Source:
- Heap.scala
Attributes
- Source:
- Heap.scala
alias for heapify
Build a heap using an Iterable Order 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 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
Attributes
- 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
Attributes
- Source:
- Heap.scala
Attributes
- Source:
- Heap.scala
Attributes
- Source:
- Heap.scala