[project @ 2003-05-12 08:48:09 by ross]

[haskell-directory.git] / Control / Monad / ST.hs

diff --git a/Control/Monad/ST.hs b/Control/Monad/ST.hs
index 5f47360..008dafc 100644 (file)
--- a/Control/Monad/ST.hs
+++ b/Control/Monad/ST.hs
@@ -1,30 +1,33 @@
 -----------------------------------------------------------------------------
--- 
+-- |
 -- Module      :  Control.Monad.ST
 -- Copyright   :  (c) The University of Glasgow 2001
--- License     :  BSD-style (see the file libraries/core/LICENSE)
+-- License     :  BSD-style (see the file libraries/base/LICENSE)
 -- 
 -- Maintainer  :  libraries@haskell.org
 -- Stability   :  experimental
 -- Portability :  non-portable (requires universal quantification for runST)
 --
--- $Id: ST.hs,v 1.4 2001/07/31 13:31:44 simonmar Exp $
---
--- The State Transformer Monad, ST
+-- This library provides support for /strict/ state threads, as
+-- described in the PLDI \'94 paper by John Launchbury and Simon Peyton
+-- Jones /Lazy State Threads/.
 --
 -----------------------------------------------------------------------------
 
 module Control.Monad.ST
-      (
-       ST                  -- abstract, instance of Functor, Monad, Typeable.
-      , runST              -- :: (forall s. ST s a) -> a
-      , fixST              -- :: (a -> ST s a) -> ST s a
-      , unsafeInterleaveST  -- :: ST s a -> ST s a
+  (
+       -- * The 'ST' Monad
+       ST,             -- abstract, instance of Functor, Monad, Typeable.
+       runST,          -- :: (forall s. ST s a) -> a
+       fixST,          -- :: (a -> ST s a) -> ST s a
 
-      , unsafeIOToST       -- :: IO a -> ST s a
+       -- * Unsafe operations
+       unsafeInterleaveST,     -- :: ST s a -> ST s a
+       unsafeIOToST,           -- :: IO a -> ST s a
 
-      , RealWorld          -- abstract
-      , stToIO             -- :: ST RealWorld a -> IO a
+       -- * Converting 'ST' to 'IO'
+       RealWorld,              -- abstract
+       stToIO                  -- :: ST RealWorld a -> IO a
       ) where
 
 import Prelude
@@ -32,9 +35,21 @@ import Prelude
 import Control.Monad.Fix
 import Data.Dynamic
 
+#ifdef __HUGS__
+import Hugs.ST
+import qualified Hugs.LazyST as LazyST
+
+fixST :: (a -> ST s a) -> ST s a
+fixST f = LazyST.lazyToStrictST (LazyST.fixST (LazyST.strictToLazyST . f))
+
+unsafeInterleaveST :: ST s a -> ST s a
+unsafeInterleaveST =
+    LazyST.lazyToStrictST . LazyST.unsafeInterleaveST . LazyST.strictToLazyST
+#endif
+
 #ifdef __GLASGOW_HASKELL__
 import GHC.ST
-import GHC.Prim                ( unsafeCoerce#, RealWorld )
+import GHC.Base                ( unsafeCoerce#, RealWorld )
 import GHC.IOBase      ( IO(..), stToIO )
 
 -- This relies on IO and ST having the same representation modulo the