fgl-5.5.2.3: Martin Erwig's Functional Graph Library

Safe HaskellSafe-Inferred
LanguageHaskell98

Data.Graph.Inductive.Internal.Heap

Contents

Description

Pairing heap implementation of dictionary

Synopsis

Type

data Heap a b Source

Constructors

Empty 
Node a b [Heap a b] 

Instances

(Eq a, Eq b) => Eq (Heap a b) 
(Read a, Read b) => Read (Heap a b) 
(Show a, Show b) => Show (Heap a b) 
(NFData a, NFData b) => NFData (Heap a b) 

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

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

Operations

unit :: a -> b -> Heap a b Source

insert :: Ord a => (a, b) -> Heap a b -> Heap a b Source

merge :: Ord a => Heap a b -> Heap a b -> Heap a b Source

mergeAll :: Ord a => [Heap a b] -> Heap a b Source

findMin :: Heap a b -> (a, b) Source

deleteMin :: Ord a => Heap a b -> Heap a b Source

splitMin :: Ord a => Heap a b -> (a, b, Heap a b) Source

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

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

heapsort :: Ord a => [a] -> [a] Source