GHC.ParMake.Common

Documentation

andM :: Monad m => [m Bool] -> m Bool

appendMap :: (t -> a) -> [t] -> [a] -> [a]

Map f over l and then append rest to l. More efficient than doing `map f l ++ rest`.

firstM :: Monad m => [a] -> (a -> m Bool) -> m (Maybe a)

maybeRead :: Read a => String -> Maybe a

pathToMaybe :: FilePath -> Maybe FilePath

uniq :: Eq a => [a] -> [a]

Remove consecutive duplicate elements from a list. Example: uniq [3,3,3] = [3].