| hoogle | Source code | Contents | Index

Data.Heap

Documentation

data Heap k v | Source

empty :: Heap k v | Source

fromList :: Ord k => [(k, v)] -> Heap k v | Source

toList :: Heap k v -> [(k, v)] | Source

elems :: Heap k v -> [v] | Source

singleton :: Ord k => k -> v -> Heap k v | Source

insert :: Ord k => k -> v -> Heap k v -> Heap k v | Source

insertList :: Ord k => [(k, v)] -> Heap k v -> Heap k v | Source

pop :: Ord k => Heap k v -> Maybe ((k, v), Heap k v) | Source

popUntil :: Ord k => k -> Heap k v -> ([v], Heap k v) | Source

popWhile :: Ord k => k -> Heap k v -> ([v], Heap k v) | Source

Produced by Haddock version 2.4.2