Alternative f => [f a] -> f a -fgl -quickcheck -containers

asum :: (Foldable t, Alternative f) => t (f a) -> f a
base Data.Foldable
The sum of a collection of actions, generalizing concat.
msum :: MonadPlus m => [m a] -> m a
base Control.Monad
This generalizes the list-based concat function.
(<|>) :: Alternative f => f a -> f a -> f a
base Control.Applicative
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.
msum :: (Foldable t, MonadPlus m) => t (m a) -> m a
base Data.Foldable
The sum of a collection of actions, generalizing concat.
intercalate :: [a] -> [[a]] -> [a]
base Data.List
intercalate xs xss is equivalent to (concat (intersperse xs xss)). It inserts the list xs in between the lists in xss and concatenates the result.
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.
nmergeIO :: [[a]] -> IO [a]
base Control.Concurrent
transpose :: [[a]] -> [[a]]
base Data.List
The transpose function transposes the rows and columns of its argument. For example, > transpose [[1,2,3],[4,5,6]] == [[1,4],[2,5],[3,6]]
concat :: Foldable t => t [a] -> [a]
base Data.Foldable
The concatenation of all the elements of a container of lists.
Q :: (forall m. Quasi m => m a) -> Q a
template-haskell Language.Haskell.TH.Syntax
optional :: Alternative f => f a -> f (Maybe a)
base Control.Applicative
One or none.
many :: Alternative f => f a -> f [a]
base Control.Applicative
some :: Alternative f => f a -> f [a]
base Control.Applicative
block :: IO a -> IO a
base Control.Exception.Base, base Control.Exception, base Control.OldException
Note: this function is deprecated, please use mask instead. Applying block to a computation will execute that computation with asynchronous exceptions blocked. That is, any thread which attempts to raise an exception in the current thread with Control.Exception.throwTo will be blocked until asynchronous exceptions are unblocked again. There's no need to worry about re-enabling asynchronous exceptions; that is done automatically on exiting the scope of block. Threads created by Control.Concurrent.forkIO inherit the blocked state from the parent; that is, to start a thread in blocked mode, use block $ forkIO .... This is particularly useful if you need to establish an exception handler in the forked thread before any asynchronous exceptions are received.
mask_ :: IO a -> IO a
base Control.Exception.Base, base Control.Exception
Like mask, but does not pass a restore action to the argument.
runInBoundThread :: IO a -> IO a
base Control.Concurrent
Run the IO computation passed as the first argument. If the calling thread is not bound, a bound thread is created temporarily. runInBoundThread doesn't finish until the IO computation finishes. You can wrap a series of foreign function calls that rely on thread-local state with runInBoundThread so that you can use them without knowing whether the current thread is bound.
runInUnboundThread :: IO a -> IO a
base Control.Concurrent
Run the IO computation passed as the first argument. If the calling thread is bound, an unbound thread is created temporarily using forkIO. runInBoundThread doesn't finish until the IO computation finishes. Use this function only in the rare case that you have actually observed a performance loss due to the use of bound threads. A program that doesn't need it's main thread to be bound and makes heavy use of concurrency (e.g. a web server), might want to wrap it's main action in runInUnboundThread. Note that exceptions which are thrown to the current thread are thrown in turn to the thread that is executing the given computation. This ensures there's always a way of killing the forked thread.

Show more results