|
| Data.Graph.Inductive.Internal.Heap |
|
|
|
|
| Description |
| Pairing heap implementation of dictionary
|
|
| Synopsis |
|
|
|
|
| Type
|
|
| data Heap a b |
| Constructors | | Instances | |
|
|
| Operations
|
|
| empty :: Ord a => Heap a b |
|
| unit :: Ord a => a -> b -> Heap a b |
|
| insert :: Ord a => (a, b) -> Heap a b -> Heap a b |
|
| merge :: Ord a => Heap a b -> Heap a b -> Heap a b |
|
| mergeAll :: Ord a => [Heap a b] -> Heap a b |
|
| isEmpty :: Ord a => Heap a b -> Bool |
|
| findMin :: Ord a => Heap a b -> (a, b) |
|
| deleteMin :: Ord a => Heap a b -> Heap a b |
|
| splitMin :: Ord a => Heap a b -> (a, b, Heap a b) |
|
| build :: Ord a => [(a, b)] -> Heap a b |
|
| toList :: Ord a => Heap a b -> [(a, b)] |
|
| heapsort :: Ord a => [a] -> [a] |
|
| Produced by Haddock version 0.8 |