Heap can't handle infinite values?

```haskell
ghci> import Prelude as Pre
ghci> import Data.Heap as Heap
ghci> Heap.map (Pre.take 4) $ Heap.insert [3..] $ Heap.adjustMin tail $ Heap.insert [1..] Heap.empty
fromList [[2,3,4,5],[3,4,5,6]]
ghci> Heap.map (Pre.take 4) $ Heap.adjustMin tail $ Heap.insert [3..] $ Heap.insert [1..] Heap.empty
( hangs )
Interrupted.
ghci>
```

I do not immediately see a reason for this behaviour.

When wrapping the infinite lists in an `Entry { priority = head xs, payload = xs }`, the hang disappears.

This behaviour might somehow be expected or intended, but I could not find any mention of strictness in the docs. Ideally, `Heap` would accept infinite values.

Start by reproducing the GHCi examples from the issue with infinite lists in Data.Heap, comparing the hanging raw-list case with the Entry wrapper that completes. Inspect how heap ordering and strictness handle these values; done should clarify whether infinite values are supported and, if so, provide the corresponding fix or documentation.

Written by the indexing model from the issue text.