Fixed some haddock parsing problems in the documentation
This commit is contained in:
parent
7b9789da59
commit
1d83167c01
|
@ -378,7 +378,7 @@ oneofLS fs n = oneofL $ applyAll n (filterFuncs n fs)
|
|||
filterFuncs sz = map snd . filter ((>=) sz . fst)
|
||||
|
||||
-- | A function that takes a "find" parameter, a "replace" parameter, and returns a monadic function
|
||||
-- (for convenience) that performs the check/replacement.
|
||||
-- (for convenience) that performs the check\/replacement.
|
||||
replaceM :: (Eq a, Monad m) => a -> a -> (a -> m a)
|
||||
replaceM find replace x | find == x = return replace
|
||||
| otherwise = return x
|
||||
|
|
|
@ -28,7 +28,7 @@ with this program. If not, see <http://www.gnu.org/licenses/>.
|
|||
|
||||
-- So I'm committing this for the time being, but it really does need some work (and some tests, of course*) later on.
|
||||
|
||||
-- * My plan for testing was to take each of the cgtests, and parse it in to AST_A. Then print AST_A using this
|
||||
-- My plan for testing was to take each of the cgtests, and parse it in to AST_A. Then print AST_A using this
|
||||
-- module, and feed it back in to the parser to get AST_B. Then check if AST_A and AST_B are equal.
|
||||
|
||||
module ShowCode (showCode, showOccam, showRain, formatCode, extCode) where
|
||||
|
|
|
@ -208,7 +208,7 @@ dyadicIsBoolean A.MoreEq = True
|
|||
dyadicIsBoolean A.After = True
|
||||
dyadicIsBoolean _ = False
|
||||
|
||||
-- | In occam, things that are arrays/lists (literals, constructors, etc) are arrays. However, in Rain they are lists.
|
||||
-- | In occam, things that are arrays\/lists (literals, constructors, etc) are arrays. However, in Rain they are lists.
|
||||
-- This function chooses between the two types accordingly. The dimensions are only relevant in occam.
|
||||
typeOfArrayList :: CSM m => [A.Dimension] -> A.Type -> m A.Type
|
||||
typeOfArrayList dims innerType
|
||||
|
|
|
@ -136,7 +136,7 @@ seqPair (x,y) = do x' <- x
|
|||
|
||||
-- | Forms the powerset of a given list.
|
||||
-- It uses the list monad cleverly, and it scares me. But it works.
|
||||
-- Taken from: http://www.haskell.org/haskellwiki/Blow_your_mind
|
||||
-- Taken from: http:\/\/www.haskell.org\/haskellwiki\/Blow_your_mind
|
||||
powerset :: [a] -> [[a]]
|
||||
powerset = filterM (const [True, False])
|
||||
|
||||
|
|
Loading…
Reference in New Issue
Block a user