Commit 0b06e400 authored by Ian Lynagh's avatar Ian Lynagh
Browse files

Fix haddock markup

I haven't checked that it looks right, but it is now accepted by haddock.
parent 5b05e95b
......@@ -260,7 +260,7 @@ data BT a = BTN a | BTB (BT a) (BT a) -- very simple binary tree
-- In case of failure, the _smallest_ number of of missing dependencies is
-- returned. [XXX: Could also be specified with a function argument.]
--
-- [XXX: The current algorithm is rather naive. A better approach would be to:
-- XXX: The current algorithm is rather naive. A better approach would be to:
--
-- * Rule out possible paths, by taking a look at the associated dependencies.
--
......@@ -269,7 +269,7 @@ data BT a = BTN a | BTB (BT a) (BT a) -- very simple binary tree
-- conditions. Then picking a flag assignment would be linear (I guess).
--
-- This would require some sort of SAT solving, though, thus it's not
-- implemented unless we really need it.]
-- implemented unless we really need it.
--
resolveWithFlags :: Monoid a =>
[(String,[Bool])]
......
......@@ -246,9 +246,9 @@ finalizePackageDescription
-> String -- ^ OS-name
-> String -- ^ Arch-name
-> GenericPackageDescription
-> Either [Dependency] -- ^ Missing dependencies
( PackageDescription -- ^ Resolved package description
, [(String,Bool)]) -- ^ Flag assignments chosen
-> Either [Dependency] -- Missing dependencies
( PackageDescription -- Resolved package description
, [(String,Bool)]) -- Flag assignments chosen
finalizePackageDescription userflags mpkgs os arch
(GenericPackageDescription pkg flags mlib0 exes0) =
case resolveFlags of
......
......@@ -204,7 +204,7 @@ data Field
-- } else {
-- <field>*
-- }
-- $
-- @
deriving (Show
,Eq) -- for testing
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment