Heap -is:module
A min-heap of values of type a.
This type alias is an abbreviation for a
HeapT which uses the
HeapItem instance of
pol item to organise its
elements.
Heaps in Haskell
A flexible Haskell implementation of minimum, maximum,
minimum-priority, maximum-priority and custom-ordered heaps.
The program's heap is reaching its limit, and the program should take
action to reduce the amount of live data it has. Notes:
- It is undefined which thread receives this exception. GHC
currently throws this to the same thread that receives
UserInterrupt, but this may change in the future.
- The GHC RTS currently can only recover from heap overflow if it
detects that an explicit memory limit (set via RTS flags). has been
exceeded. Currently, failure to allocate memory from the operating
system results in immediate termination of the program.