[project @ 2004-10-06 23:45:37 by dons]

[ghc-base.git] / GHC / Conc.lhs

diff --git a/GHC/Conc.lhs b/GHC/Conc.lhs
index d30513d..2abc28e 100644 (file)
--- a/GHC/Conc.lhs
+++ b/GHC/Conc.lhs
@@ -14,7 +14,7 @@
 -- 
 -----------------------------------------------------------------------------
 
-#include "config.h"
+#include "ghcconfig.h"
 module GHC.Conc
        ( ThreadId(..)
 
@@ -216,7 +216,7 @@ takeMVar (MVar mvar#) = IO $ \ s# -> takeMVar# mvar# s#
 -- 'putMVar' will wait until it becomes empty.
 --
 -- If several threads are competing to fill the same 'MVar', one is
--- chosen to continue at random with the 'MVar' becomes empty.
+-- chosen to continue at random when the 'MVar' becomes empty.
 putMVar  :: MVar a -> a -> IO ()
 putMVar (MVar mvar#) x = IO $ \ s# ->
     case putMVar# mvar# x s# of
@@ -275,10 +275,8 @@ specified file descriptor is available for reading (just like select).
 -- (GHC only).
 --
 -- Note that the resolution used by the Haskell runtime system's
--- internal timer is 1\/50 second, and 'threadDelay' will round down
--- its argument to the nearest multiple of this resolution.  In
--- particular, to get the smallest non-zero delay, pass 20000 as the
--- parameter to 'threadDelay'.
+-- internal timer is 1\/50 second, and 'threadDelay' will round its
+-- argument up to the nearest multiple of this resolution.
 --
 -- There is no guarantee that the thread will be rescheduled promptly
 -- when the delay has expired, but the thread will never continue to