Methods

fold :: Monoid m => MaybeVoid m -> m #

foldMap :: Monoid m => (a -> m) -> MaybeVoid a -> m #

foldMap' :: Monoid m => (a -> m) -> MaybeVoid a -> m #

foldr :: (a -> b -> b) -> b -> MaybeVoid a -> b #

foldr' :: (a -> b -> b) -> b -> MaybeVoid a -> b #

foldl :: (b -> a -> b) -> b -> MaybeVoid a -> b #

foldl' :: (b -> a -> b) -> b -> MaybeVoid a -> b #

foldr1 :: (a -> a -> a) -> MaybeVoid a -> a #

foldl1 :: (a -> a -> a) -> MaybeVoid a -> a #

toList :: MaybeVoid a -> [a] #

null :: MaybeVoid a -> Bool #

length :: MaybeVoid a -> Int #

elem :: Eq a => a -> MaybeVoid a -> Bool #

maximum :: Ord a => MaybeVoid a -> a #

minimum :: Ord a => MaybeVoid a -> a #

sum :: Num a => MaybeVoid a -> a #

product :: Num a => MaybeVoid a -> a #

Methods

traverse :: Applicative f => (a -> f b) -> MaybeVoid a -> f (MaybeVoid b) #

sequenceA :: Applicative f => MaybeVoid (f a) -> f (MaybeVoid a) #

mapM :: Monad m => (a -> m b) -> MaybeVoid a -> m (MaybeVoid b) #

sequence :: Monad m => MaybeVoid (m a) -> m (MaybeVoid a) #

Methods

pure :: a -> MaybeVoid a #

(<*>) :: MaybeVoid (a -> b) -> MaybeVoid a -> MaybeVoid b #

liftA2 :: (a -> b -> c) -> MaybeVoid a -> MaybeVoid b -> MaybeVoid c #

(*>) :: MaybeVoid a -> MaybeVoid b -> MaybeVoid b #

(<*) :: MaybeVoid a -> MaybeVoid b -> MaybeVoid a #

Methods

fmap :: (a -> b) -> MaybeVoid a -> MaybeVoid b #

(<$) :: a -> MaybeVoid b -> MaybeVoid a #

Methods

(>>=) :: MaybeVoid a -> (a -> MaybeVoid b) -> MaybeVoid b #

(>>) :: MaybeVoid a -> MaybeVoid b -> MaybeVoid b #

return :: a -> MaybeVoid a #

Methods

showsPrec :: Int -> MaybeVoid a -> ShowS #

show :: MaybeVoid a -> String #

showList :: [MaybeVoid a] -> ShowS #

Methods

(==) :: MaybeVoid a -> MaybeVoid a -> Bool #

(/=) :: MaybeVoid a -> MaybeVoid a -> Bool #