From 6da27616340f00cb0fa767c953cc8cca0b86f879 Mon Sep 17 00:00:00 2001 From: ross Date: Thu, 13 Jan 2005 10:46:36 +0000 Subject: [PATCH 1/1] [project @ 2005-01-13 10:46:36 by ross] make comments ASCII --- Data/Tree.hs | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Data/Tree.hs b/Data/Tree.hs index 5d91af8..5c95f2a 100644 --- a/Data/Tree.hs +++ b/Data/Tree.hs @@ -104,7 +104,7 @@ unfoldForestM f = mapM (unfoldTreeM f) -- | Monadic tree builder, in breadth-first order, -- using an algorithm adapted from --- /Breadth­First Numbering: Lessons from a Small Exercise in Algorithm Design/, +-- /Breadth-First Numbering: Lessons from a Small Exercise in Algorithm Design/, -- by Chris Okasaki, /ICFP'00/. unfoldTreeM_BF :: Monad m => (b -> m (a, [b])) -> b -> m (Tree a) unfoldTreeM_BF f b = liftM (fst . fromJust . deQueue) $ @@ -112,7 +112,7 @@ unfoldTreeM_BF f b = liftM (fst . fromJust . deQueue) $ -- | Monadic forest builder, in breadth-first order, -- using an algorithm adapted from --- /Breadth­First Numbering: Lessons from a Small Exercise in Algorithm Design/, +-- /Breadth-First Numbering: Lessons from a Small Exercise in Algorithm Design/, -- by Chris Okasaki, /ICFP'00/. unfoldForestM_BF :: Monad m => (b -> m (a, [b])) -> [b] -> m (Forest a) unfoldForestM_BF f = liftM (reverseOnto []) . unfoldForestQ f . listToQueue -- 1.7.10.4