metamorphic-0.1.2.3: metamorphisms: ana . cata or understanding folds and unfolds

Portabilityportable
Stabilityexperimental
MaintainerDrew Day <drewday@gmail.com>
Safe HaskellSafe-Infered

Heap

Description

Code adapted from: http://web.engr.oregonstate.edu/~erwig/meta/

Documentation (and further updates in technique) forthcoming.

Documentation

data Heap a Source

Constructors

Empty 
Node a [Heap a] 

Instances

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

empty :: Ord a => Heap aSource

unit :: a -> Heap aSource

insert :: Ord a => a -> Heap a -> Heap aSource

merge :: Ord a => Heap a -> Heap a -> Heap aSource

isEmpty :: Ord a => Heap a -> BoolSource

findMin :: Ord a => Heap a -> aSource

deleteMin :: Ord a => Heap a -> Heap aSource

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