Safe Haskell	None
Language	Haskell2010

Data.Both

Description

The Both type and operations. Like Maybe, but not.

Synopsis

Documentation

newtype Both a #

Constructors

Both
Fields getBoth :: Maybe a

Instances

Monad Both #
Methods (>>=) :: Both a -> (a -> Both b) -> Both b # (>>) :: Both a -> Both b -> Both b # return :: a -> Both a # fail :: String -> Both a #
Functor Both #
Methods fmap :: (a -> b) -> Both a -> Both b # (<$) :: a -> Both b -> Both a #
Applicative Both #
Methods pure :: a -> Both a # (<>) :: Both (a -> b) -> Both a -> Both b # (>) :: Both a -> Both b -> Both b # (<*) :: Both a -> Both b -> Both a #
Foldable Both #
Methods fold :: Monoid m => Both m -> m # foldMap :: Monoid m => (a -> m) -> Both a -> m # foldr :: (a -> b -> b) -> b -> Both a -> b # foldr' :: (a -> b -> b) -> b -> Both a -> b # foldl :: (b -> a -> b) -> b -> Both a -> b # foldl' :: (b -> a -> b) -> b -> Both a -> b # foldr1 :: (a -> a -> a) -> Both a -> a # foldl1 :: (a -> a -> a) -> Both a -> a # toList :: Both a -> [a] # null :: Both a -> Bool # length :: Both a -> Int # elem :: Eq a => a -> Both a -> Bool # maximum :: Ord a => Both a -> a # minimum :: Ord a => Both a -> a # sum :: Num a => Both a -> a # product :: Num a => Both a -> a #
Traversable Both #
Methods traverse :: Applicative f => (a -> f b) -> Both a -> f (Both b) # sequenceA :: Applicative f => Both (f a) -> f (Both a) # mapM :: Monad m => (a -> m b) -> Both a -> m (Both b) # sequence :: Monad m => Both (m a) -> m (Both a) #
Generic1 Both #
Associated Types type Rep1 (Both :: * -> ) :: -> * # Methods from1 :: Both a -> Rep1 Both a # to1 :: Rep1 Both a -> Both a #
Alternative Both #
Methods empty :: Both a # (<\|>) :: Both a -> Both a -> Both a # some :: Both a -> Both [a] # many :: Both a -> Both [a] #
MonadPlus Both #
Methods mzero :: Both a # mplus :: Both a -> Both a -> Both a #
Eq a => Eq (Both a) #
Methods (==) :: Both a -> Both a -> Bool # (/=) :: Both a -> Both a -> Bool #
Data a => Data (Both a) #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Both a -> c (Both a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Both a) # toConstr :: Both a -> Constr # dataTypeOf :: Both a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (Both a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Both a)) # gmapT :: (forall b. Data b => b -> b) -> Both a -> Both a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Both a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Both a -> r # gmapQ :: (forall d. Data d => d -> u) -> Both a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Both a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Both a -> m (Both a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Both a -> m (Both a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Both a -> m (Both a) #
Ord a => Ord (Both a) #
Methods compare :: Both a -> Both a -> Ordering # (<) :: Both a -> Both a -> Bool # (<=) :: Both a -> Both a -> Bool # (>) :: Both a -> Both a -> Bool # (>=) :: Both a -> Both a -> Bool # max :: Both a -> Both a -> Both a # min :: Both a -> Both a -> Both a #
Read a => Read (Both a) #
Methods readsPrec :: Int -> ReadS (Both a) # readList :: ReadS [Both a] # readPrec :: ReadPrec (Both a) # readListPrec :: ReadPrec [Both a] #
Show a => Show (Both a) #
Methods showsPrec :: Int -> Both a -> ShowS # show :: Both a -> String # showList :: [Both a] -> ShowS #
Generic (Both a) #
Associated Types type Rep (Both a) :: * -> * # Methods from :: Both a -> Rep (Both a) x # to :: Rep (Both a) x -> Both a #
Semigroup a => Semigroup (Both a) #	The '(<>)' for `Maybe` is `Just` if either of the operands are, whereas here both must be.
Methods (<>) :: Both a -> Both a -> Both a # sconcat :: NonEmpty (Both a) -> Both a # stimes :: Integral b => b -> Both a -> Both a #
(Monoid a, Semigroup a) => Monoid (Both a) #
Methods mempty :: Both a # mappend :: Both a -> Both a -> Both a # mconcat :: [Both a] -> Both a #
Semigroup a => Zero (Both a) #
Methods zero :: Both a # zconcat :: [Both a] -> Both a #
type Rep1 Both #
type Rep1 Both = D1 (MetaData "Both" "Data.Both" "both-0.1.1.0-GpFbizhwlWyfNT2uPXuOB" True) (C1 (MetaCons "Both" PrefixI True) (S1 (MetaSel (Just Symbol "getBoth") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 Maybe)))
type Rep (Both a) #
type Rep (Both a) = D1 (MetaData "Both" "Data.Both" "both-0.1.1.0-GpFbizhwlWyfNT2uPXuOB" True) (C1 (MetaCons "Both" PrefixI True) (S1 (MetaSel (Just Symbol "getBoth") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe a))))

both :: b -> (a -> b) -> Both a -> b #

The both function takes a default value, a function, and a Both value. If the inner Maybe value is Nothing, the function returns the default value. Otherwise, it applies the function to the value inside the Just and returns the result.

fromBoth :: a -> Both a -> a #

The fromBoth function takes a default value and a Both value. If the inner Maybe is Nothing, it returns the default value; otherwise, it returns the value contained within.