Safe Haskell | Trustworthy |
---|---|
Language | Haskell2010 |
Documentation
This Maybe wrapper treats Just as success and Nothing as failure. There is no unexpected success <-> failure change.
Differences:
instance Semigroup/Monoid Maybe where Nothing <> (Just x) = Just x mempty = Nothing stimes 0 (Just x) = Nothing instance Semigroup/Monoid Result where Nothing <> (Just x) = Nothing mempty = Just mempty stimes 0 (Just x) = Just (stimes 0 x)
Instances
Monad Result Source # | |
Functor Result Source # | |
MonadFix Result Source # | |
Defined in Codec.QRCode.Data.Result | |
MonadFail Result Source # | |
Defined in Codec.QRCode.Data.Result | |
Applicative Result Source # | |
Foldable Result Source # | |
Defined in Codec.QRCode.Data.Result fold :: Monoid m => Result m -> m # foldMap :: Monoid m => (a -> m) -> Result a -> m # foldr :: (a -> b -> b) -> b -> Result a -> b # foldr' :: (a -> b -> b) -> b -> Result a -> b # foldl :: (b -> a -> b) -> b -> Result a -> b # foldl' :: (b -> a -> b) -> b -> Result a -> b # foldr1 :: (a -> a -> a) -> Result a -> a # foldl1 :: (a -> a -> a) -> Result a -> a # elem :: Eq a => a -> Result a -> Bool # maximum :: Ord a => Result a -> a # minimum :: Ord a => Result a -> a # | |
Traversable Result Source # | |
Eq1 Result Source # | |
Ord1 Result Source # | |
Defined in Codec.QRCode.Data.Result | |
Read1 Result Source # | |
Defined in Codec.QRCode.Data.Result | |
Show1 Result Source # | |
MonadZip Result Source # | |
Alternative Result Source # | |
MonadPlus Result Source # | |
Eq a => Eq (Result a) Source # | |
Data a => Data (Result a) Source # | |
Defined in Codec.QRCode.Data.Result gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Result a -> c (Result a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Result a) # toConstr :: Result a -> Constr # dataTypeOf :: Result a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Result a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Result a)) # gmapT :: (forall b. Data b => b -> b) -> Result a -> Result a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Result a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Result a -> r # gmapQ :: (forall d. Data d => d -> u) -> Result a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Result a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Result a -> m (Result a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Result a -> m (Result a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Result a -> m (Result a) # | |
Ord a => Ord (Result a) Source # | |
Defined in Codec.QRCode.Data.Result | |
Read a => Read (Result a) Source # | |
Show a => Show (Result a) Source # | |
Generic (Result a) Source # | |
Semigroup a => Semigroup (Result a) Source # | |
Monoid a => Monoid (Result a) Source # | |
Generic1 Result Source # | |
type Rep (Result a) Source # | |
Defined in Codec.QRCode.Data.Result | |
type Rep1 Result Source # | |
Defined in Codec.QRCode.Data.Result |