| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Traversable.IO
Description
Traversing IO lists.
Code from this module is derived from Twan van Laarhoven.
These operations are tail recursive, while building lists by appending to its tail mutably.
Synopsis
- sequenceIO :: [IO a] -> IO [a]
- traverseIO :: (a -> IO b) -> [a] -> IO [b]
- unfoldIO :: IO (Maybe a) -> IO [a]
Documentation
sequenceIO :: [IO a] -> IO [a] Source #
Sequence implemented in terms of unsafeSetField
This operation is tail recursive.
traverseIO :: (a -> IO b) -> [a] -> IO [b] Source #
Traverse implemented in terms of unsafeSetField.
This operation is tail recursive.