Control-Monad-MultiPass-0.1.0.0: A Library for Writing Multi-Pass Algorithms.
Control.Monad.MultiPass.Example.Localmin
Description
A variation on the repmin example. This example shows how the Knot3 can be used in a recursive algorithm.
repmin
Knot3
Synopsis
data Tree a Source
Constructors
Instances
localmin :: Ord a => Tree a -> Tree [a]Source
Version using lazy evaluation.
localminMP :: Ord a => Tree a -> ST2 r w (Tree [a])Source
Version using the Control.Monad.MultiPass library.