Data.Graph.Inductive.Internal.Heap

Pairing heap implementation of dictionary

Type

data Ord a => Heap a b

Constructors

Empty

Node a b [Heap a b]

Instances

(Eq b, Ord a) => Eq (Heap a b)

(Show a, Ord a, Show b) => Show (Heap a b)

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]