New patches:

[Improved replicateM_
Einar Karttunen <ekarttun@cs.helsinki.fi>**20051214110700] {
hunk ./base/Control/Monad.hs 220
-replicateM_ n x   = sequence_ (replicate n x)
+replicateM_ k act = if k <= 0 then return () else loop k
+    where loop 0 = return ()
+          loop k = act >> loop (k-1)
+
+
}

Context:

[[project @ 2005-12-05 13:31:04 by panne]
panne**20051205133104
 For the 1000th time: Fixed DocBook XML. Please, please do a "make validate"
 before a check-in... >:-(
] 
[[project @ 2005-12-05 11:42:47 by simonmar]
simonmar**20051205114247
 Add IO versions of the STM primitives that allocate new transactional variables:
 
   newTVarIO :: a -> IO (TVar a)
   newTChanIO :: IO (TChan a)
   newTMVarIO :: a -> IO (TMVar a)
 
 These can be used inside unsafePerformIO, unlike the STM versions.
] 
[[project @ 2005-12-05 11:21:22 by malcolm]
malcolm**20051205112122
 Avoid clashes with Prelude type names in code generated from XML DTD.
] 
[[project @ 2005-12-05 02:16:19 by ijones]
ijones**20051205021619
 docs for cabal-version field
] 
[[project @ 2005-12-05 02:05:18 by ijones]
ijones**20051205020518
 * adding cabal-version flag
   * check for correct cabal version during parsing
 
   I throw a parse error if this package has the wrong cabal version.
   This is so that the user can get this error before getting an error
   for eg. an unknown field.  Also check it in the sanity checker.
 
   I just hard-code the cabal version in the source, it would be nicer if
   we got it from the .cabal file.  cabal could include the version in
   the cpp flags, but cabal's setup file needs to build without cabal, so
   that wouldn't actually work for us ahem.
] 
[[project @ 2005-12-04 00:39:56 by ijones]
ijones**20051204003956
 Moving CabalInstall to its own directory.
] 
[[project @ 2005-12-03 17:32:01 by jpbernardy]
jpbernardy**20051203173201
 Removed spurious constraint for Monoid (IntMap a) instance
] 
[[project @ 2005-12-02 14:29:28 by simonmar]
simonmar**20051202142928
 avoid recursive module trap with Haddock
] 
[[project @ 2005-12-02 12:26:22 by simonmar]
simonmar**20051202122622
 Apply rev 1.24 from FreeBSD's copy of this file.  Commit message from
 FreeBSD:
 
    The algorithm that computes the tables used in the BM search
    algorithm sometimes access an array beyond it's length. This only
    happens in the last iteration of a loop, and the value fetched is
    not used then, so the bug is a relatively innocent one. Fix this by
    not fetching any value on the last iteration of said loop.
 
    Submitted by:	MKI <mki@mozone.net>
 
 This is the cause of bug #1194393 (crash in darcs on Windows).
] 
[[project @ 2005-12-02 12:09:08 by malcolm]
malcolm**20051202120908
 Fix for parsing empty lists.
] 
[[project @ 2005-12-02 11:37:50 by malcolm]
malcolm**20051202113750
 Extra instances of Show.
] 
[[project @ 2005-12-02 11:21:32 by malcolm]
malcolm**20051202112132
 wibbles
] 
[[project @ 2005-12-01 17:55:58 by malcolm]
malcolm**20051201175558
 Improve contentspec pare error messages.
] 
[[project @ 2005-12-01 17:47:30 by malcolm]
malcolm**20051201174730
 Commit to error inside mixed content spec.
] 
[[project @ 2005-12-01 16:54:53 by malcolm]
malcolm**20051201165453
 update docs ready for another unstable release.
] 
[[project @ 2005-12-01 16:53:59 by malcolm]
malcolm**20051201165359
 formatting wibble
] 
[[project @ 2005-12-01 16:30:16 by malcolm]
malcolm**20051201163016
 Avoid confusing haddock.
] 
[[project @ 2005-12-01 16:22:11 by malcolm]
malcolm**20051201162211
 List missing file, update version num.
] 
[[project @ 2005-12-01 12:37:23 by simonmar]
simonmar**20051201123723
 oops, forgot to remove forkIO from here
] 
[[project @ 2005-12-01 12:32:24 by simonmar]
simonmar**20051201123224
 export childHandler
] 
[[project @ 2005-11-30 16:56:24 by simonmar]
simonmar**20051130165624
 - move forkIO into GHC.Conc, so that the I/O manager can use proper forkIO
   with an exception handler.  This required TopHandler.lhs-boot.  It's the
   right thing, though, since the forkIO implementation is GHC-specific.
 
 - check for out-of-range file descriptors in the I/O manager, rather than
   just exploding.  The I/O manager will exit ungracefully, but at least
   there will be an error message.
] 
[[project @ 2005-11-30 12:24:33 by simonmar]
simonmar**20051130122433
 export registerDelay
] 
[[project @ 2005-11-30 12:24:18 by simonmar]
simonmar**20051130122418
 Add
 
   registerDelay :: Int -> IO (TVar Bool)
 
 for implementing delays and timeouts in STM.  The delay is implemented
 in the same way as threadDelay.  Currently doesn't work on Windows or
 without -threaded (I do intend to make it work on Windows, though).
] 
[[project @ 2005-11-29 17:38:24 by malcolm]
malcolm**20051129173824
 Generated code requires fewer imports, and better whitespacing.
] 
[[project @ 2005-11-29 17:37:23 by malcolm]
malcolm**20051129173723
 New combinator 'optional'.
] 
[[project @ 2005-11-29 17:35:13 by malcolm]
malcolm**20051129173513
 Another fix for 'text' combinator.  When you find the end of the string,
 by discovering a tagged element, PUT THE ELEMENT BACK into the incoming
 token stream!  Otherwise it gets left out of the parsed sequence...
] 
[[project @ 2005-11-29 16:49:14 by malcolm]
malcolm**20051129164914
 Because 'text' might fail, we must wrap a definite required text item to
 permit it to return the empty string.
] 
[[project @ 2005-11-29 16:43:06 by malcolm]
malcolm**20051129164306
 The 'text' combinator should fail on empty input, rather than succeed
 with the empty string as result.  Otherwise, it cannot be used inside a
 choice combinator.
] 
[[project @ 2005-11-29 14:31:59 by ross]
ross**20051129143159
 As foreshadowed on the libraries list, introduce new classes:
 
 Applicative (formerly known as Idiom): generalizes (but does not replace)
 both Monad and Monoid.
 
 Traversable: containers that can be traversed, executing actions and
 re-assembling the results.  This class generalizes and replaces FunctorM,
 because it requires Applicative instead of Monad.
 
 Foldable: containers that can be folded over a Monoid.  Traversable
 supplies a default definition, but some structures, e.g. Set, are Foldable
 but not Traversable.
] 
[TAG Last common state before ghc-6-4-branch
John Goerzen <jgoerzen@complete.org>**20051128201854] 
[[project @ 2005-11-28 17:47:10 by malcolm]
malcolm**20051128174710
 Update DtdToHaskell to generate instances of the new XmlContent class.
 Generates compilable code, but still to be fully tested.
] 
[[project @ 2005-11-28 16:04:21 by panne]
panne**20051128160422
 Cleanly separated our representation of devices and contexts from OpenAL's.
 This makes it easier to attach some data later...
] 
[TAG Initial conversion from CVS complete
John Goerzen <jgoerzen@complete.org>**20051128200748] 
Patch bundle hash:
bd822c65844ab7e928dfb985173af55781afd8f6