[m a] -> m ()

sequence_ :: Monad m => [m a] -> m ()
base Prelude, base Control.Monad
Evaluate each action in the sequence from left to right, and ignore the results.
msum :: MonadPlus m => [m a] -> m a
base Control.Monad
This generalizes the list-based concat function.
sequenceA_ :: (Foldable t, Applicative f) => t (f a) -> f ()
base Data.Foldable
Evaluate each action in the structure from left to right, and ignore the results.
sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()
base Data.Foldable
Evaluate each monadic action in the structure from left to right, and ignore the results.
void :: Functor f => f a -> f ()
base Control.Monad
void value discards or ignores the result of evaluation, such as the return value of an IO action.
oneof :: [Gen a] -> Gen a
QuickCheck Test.QuickCheck.Gen, QuickCheck Test.QuickCheck
Randomly uses one of the given generators. The input list must be non-empty.
unions :: [IntMap a] -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
The union of a list of maps. > unions [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])] > == fromList [(3, "b"), (5, "a"), (7, "C")] > unions [(fromList [(5, "A3"), (3, "B3")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "a"), (3, "b")])] > == fromList [(3, "B3"), (5, "A3"), (7, "C")]
choice :: [ReadP a] -> ReadP a
base Text.ParserCombinators.ReadP
Combines all parsers in the specified list.
choice :: [ReadPrec a] -> ReadPrec a
base Text.ParserCombinators.ReadPrec
Combines all parsers in the specified list.
concat :: [[a]] -> [a]
base Prelude, base Data.List
Concatenate a list of lists.
void :: IO a -> IO ()
base Foreign.Marshal.Error
Discard the return value of an IO action
optional :: ReadP a -> ReadP ()
base Text.ParserCombinators.ReadP
optional p optionally parses p and always returns ().
skipMany :: ReadP a -> ReadP ()
base Text.ParserCombinators.ReadP
Like many, but discards the result.
skipMany1 :: ReadP a -> ReadP ()
base Text.ParserCombinators.ReadP
Like many1, but discards the result.
alwaysSucceeds :: STM a -> STM ()
base GHC.Conc.Sync, base GHC.Conc, stm Control.Monad.STM
alwaysSucceeds adds a new invariant that must be true when passed to alwaysSucceeds, at the end of the current transaction, and at the end of every subsequent transaction. If it fails at any of those points then the transaction violating it is aborted and the exception raised by the invariant is propagated.
asum :: (Foldable t, Alternative f) => t (f a) -> f a
base Data.Foldable
The sum of a collection of actions, generalizing concat.
msum :: (Foldable t, MonadPlus m) => t (m a) -> m a
base Data.Foldable
The sum of a collection of actions, generalizing concat.
replicateM_ :: Monad m => Int -> m a -> m ()
base Control.Monad
Like replicateM, but discards the result.
unionsWith :: (a -> a -> a) -> [IntMap a] -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
The union of a list of maps, with a combining operation. > unionsWith (++) [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])] > == fromList [(3, "bB3"), (5, "aAA3"), (7, "C")]
MkRose :: a -> [Rose a] -> Rose a
QuickCheck Test.QuickCheck.Property

Show more results