Control.Monad.MultiPass.Example.Repmin

An implementation of the classic repmin algorithm, using the Control.Monad.MultiPass library.

Documentation

data Tree a

Binary tree datatype.

Constructors

Leaf !a

Node !(Tree a) !(Tree a)

Instances

Eq a => Eq (Tree a)

Show a => Show (Tree a)

repmin :: Ord a => Tree a -> Tree a

Original algorithm, which uses lazy evaluation.

repminMP :: Ord a => Tree a -> ST2 r w (Tree a)

New algorithm, using the Control.Monad.MultiPass library.

repminMP2 :: Ord a => Tree a -> ST2 r w (Tree a)

Second version of the new algorithm (repminMP), using the Knot3 instrument, rather than TopKnot.

repminMP3 :: Ord a => Tree a -> ST2 r w (Tree a)

Third version of the new algorithm (repminMP), using the Monoid2 instrument.