Documentation

Methods

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

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

return :: a -> Both a #

Methods

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

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

Methods

pure :: a -> Both a #

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

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

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

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

Methods

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

foldMap :: Monoid m => (a -> m) -> Both a -> 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 #

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) #

Methods

empty :: Both a #

(<|>) :: Both a -> Both a -> Both a #

some :: Both a -> Both [a] #

many :: Both a -> Both [a] #

Methods

mzero :: Both a #

mplus :: Both a -> Both a -> Both a #

Methods

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

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

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 :: forall r r'. (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) #

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 #

Methods

readsPrec :: Int -> ReadS (Both a) #

readList :: ReadS [Both a] #

readPrec :: ReadPrec (Both a) #

readListPrec :: ReadPrec [Both a] #

Methods

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

show :: Both a -> String #

showList :: [Both a] -> ShowS #

Methods

from :: Both a -> Rep (Both a) x #

to :: Rep (Both a) x -> Both a #

Methods

(<>) :: Both a -> Both a -> Both a #

sconcat :: NonEmpty (Both a) -> Both a #

stimes :: Integral b => b -> Both a -> Both a #

Methods

mempty :: Both a #

mappend :: Both a -> Both a -> Both a #

mconcat :: [Both a] -> Both a #

Methods

zero :: Both a #

zconcat :: [Both a] -> Both a #

Methods

from1 :: forall (a :: k). Both a -> Rep1 Both a #

to1 :: forall (a :: k). Rep1 Both a -> Both a #