Modulefgl-5.8.3.1Haskell98

Data.Graph.Inductive.Internal.Heap

Pairing heap implementation of dictionary

Contents

Synopsis

Type

datadata Heap a b

Instances4Eq, Read, Show, NFData

(Eq a, Eq b) => Eq (Heap a b)Defined in fgl-5.8.3.1 · Data.Graph.Inductive.Internal.Heap
(Read a, Read b) => Read (Heap a b)Defined in fgl-5.8.3.1 · Data.Graph.Inductive.Internal.Heap
(Show a, Show b) => Show (Heap a b)Defined in fgl-5.8.3.1 · Data.Graph.Inductive.Internal.Heap
(NFData a, NFData b) => NFData (Heap a b)Defined in fgl-5.8.3.1 · Data.Graph.Inductive.Internal.Heap

valueprettyHeap :: (Show a, Show b) => Heap a b -> String

valueprintPrettyHeap :: (Show a, Show b) => Heap a b -> IO ()

valueempty :: Heap a b

valueunit :: a -> b -> Heap a b

valueinsert :: Ord a => (a, b) -> Heap a b -> Heap a b

valuemerge :: Ord a => Heap a b -> Heap a b -> Heap a b

valuemergeAll :: Ord a => [Heap a b] -> Heap a b

valueisEmpty :: Heap a b -> Bool

valuefindMin :: Heap a b -> (a, b)

valuedeleteMin :: Ord a => Heap a b -> Heap a b

valuesplitMin :: Ord a => Heap a b -> (a, b, Heap a b)

valuebuild :: Ord a => [(a, b)] -> Heap a b

valuetoList :: Ord a => Heap a b -> [(a, b)]

valueheapsort :: Ord a => [a] -> [a]