Heap is:package

Heaps in Haskell A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.

package heaps

Uses

Asymptotically optimal Brodal/Okasaki heaps. Asymptotically optimal Brodal/Okasaki bootstrapped skew-binomial heaps from the paper "Optimal Purely Functional Priority Queues", extended with a Foldable interface.

package heap-console

Uses

Not on Stackage, so not searched. interactively inspect Haskell values at runtime

package heapsize

Uses

Not on Stackage, so not searched. Determine the size of runtime data structures

package heapsort

Uses

Not on Stackage, so not searched. Heapsort of MArrays as a demo of imperative programming

package cheapskate

Uses

Not on Stackage, so not searched. Experimental markdown processor.

package ghc-heap

Uses

Functions for walking GHC's heap This package provides functions for walking the GHC heap data structures and retrieving information about those data structures.

package ghc-heap-view

Uses

Not on Stackage, so not searched. Extract the heap representation of Haskell values and thunks

package stable-heap

Uses

Not on Stackage, so not searched. Purely functional stable heaps (fair priority queues)

package cheapskate-highlight

Uses

Not on Stackage, so not searched. Code highlighting for cheapskate

package cheapskate-lucid

Uses

Not on Stackage, so not searched. Use cheapskate with Lucid