#### total matches: 5

##### fgl-5.7.0.1

3 matchesData/Graph/Inductive/Internal/Heap.hs

```
-- * Operations
empty,unit,insert,merge,mergeAll,
isEmpty,findMin,deleteMin,splitMin,
build, toList, heapsort
) where
import Text.Show (showListWith)
#if MIN_VERSION_containers (0,4,2)
```

Data/Graph/Inductive/Internal/Heap.hs
```
toList h = x:toList r
where (x,r) = (findMin h,deleteMin h)
heapsort :: (Ord a) => [a] -> [a]
heapsort = map fst . toList . build . map (\x->(x,x))
{-
l :: (Num a) => [a]
l = [6,9,2,13,6,8,14,9,10,7,5]
l' = reverse l
```

Data/Graph/Inductive/Internal/Heap.hs
```
h1 = build $ map (\x->(x,x)) l
h1' = build $ map (\x->(x,x)) l'
s1 = heapsort l
s1' = heapsort l'
-}
```