Data.Graph.Inductive.Internal.Heap

Pairing heap implementation of dictionary

Type

data Heap a b

Constructors

Empty

Node a b [Heap a b]

Instances

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

Methods

(==) :: Heap a b -> Heap a b -> Bool

(/=) :: Heap a b -> Heap a b -> Bool

(Read b, Read a) => Read (Heap a b)

Methods

readsPrec :: Int -> ReadS (Heap a b)

readList :: ReadS [Heap a b]

readPrec :: ReadPrec (Heap a b)

readListPrec :: ReadPrec [Heap a b]

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

Methods

showsPrec :: Int -> Heap a b -> ShowS

show :: Heap a b -> String

showList :: [Heap a b] -> ShowS

(NFData a, NFData b) => NFData (Heap a b)

Methods

rnf :: Heap a b -> ()

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

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

Operations

empty :: Heap a b

unit :: 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 :: Heap a b -> Bool

findMin :: 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]