Hi, I was wondering about creating an instance of MonadIO for a heap data. Any hints?
data Heap a = E | T Int a (Heap a) (Heap a)
deriving (Eq, Ord, Read, Show)
The reason is that I want to use liftIO during a heapsort to print out
intermediate results.
Thanks.
Qi Qi
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
