CODEWITHSUNDEEP
haskellfunctorapplicative
Causality
Causality

Reputation: 1123

Function in haskell that like catMaybes, but having type [Maybe a] -> Maybe [a]

I would like to have a function with the type:

f :: [Maybe a] -> Maybe [a]

e.g. 

f [Just 3, Just 5] == Just [3, 5]
f [Just 3, Nothing] == Nothing
f [] == Just []

It is similar to catMaybes :: [Maybe a] -> [a] in Data.Maybe, except that catMaybes ignores Nothing, while my f is very serious about Nothing. I could implement f in a naive way (as shown below), but wondering if there is more idiomatic way (like "applicative functor"): 

f :: [Maybe a] -> Maybe [a]
f xs = let ys = catMaybes xs
        in if length ys == length xs 
           then Just ys
           else Nothing

or 

f :: [Maybe a] -> Maybe [a]
f xs = if all isJust xs
        then catMaybes xs
        else Nothing

Upvotes: 5

Views: 1549

Answers (2)

bennofs
bennofs

Reputation: 11963

The function you're searching for is called sequence:

sequence :: (Monad m) => [m a] -> m [a]

You can find this function using hoogle: link.

Example:

>>> sequence [Just 3, Just 5]
Just [3,5]

>>> sequence [] :: Maybe [Int]
Just []

Note: There is also sequenceA in Data.Traversable which is a bit generalized, but for your use case sequence from Control.Monad is enough.

Upvotes: 20

shachaf
shachaf

Reputation: 8930

You want sequence from Control.Monad.

(This is also generalized in a useful way in Data.Traversable.)

Upvotes: 7

Related Questions