On 12 July 2012 06:19, Qi Qi <qiqi...@gmail.com> wrote: > 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.
If you just want this for debugging, you're probably better off using Debug.Trace to print the intermediate results. Conrad. _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
