Documentation

Methods

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Of a b -> f (Of c d) #

Methods

bifold :: Monoid m => Of m m -> m #

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Of a b -> m #

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Of a b -> c #

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Of a b -> c #

Methods

bimap :: (a -> b) -> (c -> d) -> Of a c -> Of b d #

first :: (a -> b) -> Of a c -> Of b c #

second :: (b -> c) -> Of a b -> Of a c #

Methods

liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Of a c -> Of b d -> Bool #

Methods

liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Of a c -> Of b d -> Ordering #

Methods

liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Of a b -> ShowS #

liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Of a b] -> ShowS #

Methods

(>>=) :: Of a a0 -> (a0 -> Of a b) -> Of a b #

(>>) :: Of a a0 -> Of a b -> Of a b #

return :: a0 -> Of a a0 #

Methods

fmap :: (a0 -> b) -> Of a a0 -> Of a b #

(<$) :: a0 -> Of a b -> Of a a0 #

Methods

pure :: a0 -> Of a a0 #

(<*>) :: Of a (a0 -> b) -> Of a a0 -> Of a b #

liftA2 :: (a0 -> b -> c) -> Of a a0 -> Of a b -> Of a c #

(*>) :: Of a a0 -> Of a b -> Of a b #

(<*) :: Of a a0 -> Of a b -> Of a a0 #

Methods

fold :: Monoid m => Of a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Of a a0 -> m #

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

foldr :: (a0 -> b -> b) -> b -> Of a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Of a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Of a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Of a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Of a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Of a a0 -> a0 #

toList :: Of a a0 -> [a0] #

null :: Of a a0 -> Bool #

length :: Of a a0 -> Int #

elem :: Eq a0 => a0 -> Of a a0 -> Bool #

maximum :: Ord a0 => Of a a0 -> a0 #

minimum :: Ord a0 => Of a a0 -> a0 #

sum :: Num a0 => Of a a0 -> a0 #

product :: Num a0 => Of a a0 -> a0 #

Methods

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

sequenceA :: Applicative f => Of a (f a0) -> f (Of a a0) #

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

sequence :: Monad m => Of a (m a0) -> m (Of a a0) #

Methods

liftEq :: (a0 -> b -> Bool) -> Of a a0 -> Of a b -> Bool #

Methods

liftCompare :: (a0 -> b -> Ordering) -> Of a a0 -> Of a b -> Ordering #

Methods

liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Of a a0 -> ShowS #

liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Of a a0] -> ShowS #

Methods

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

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

Methods

(==) :: Of a b -> Of a b -> Bool #

(/=) :: Of a b -> Of a b -> Bool #

Methods

gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Of a b -> c (Of a b) #

gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Of a b) #

toConstr :: Of a b -> Constr #

dataTypeOf :: Of a b -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Of a b)) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Of a b)) #

gmapT :: (forall b0. Data b0 => b0 -> b0) -> Of a b -> Of a b #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Of a b -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Of a b -> r #

gmapQ :: (forall d. Data d => d -> u) -> Of a b -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Of a b -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Of a b -> m (Of a b) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Of a b -> m (Of a b) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Of a b -> m (Of a b) #

Methods

compare :: Of a b -> Of a b -> Ordering #

(<) :: Of a b -> Of a b -> Bool #

(<=) :: Of a b -> Of a b -> Bool #

(>) :: Of a b -> Of a b -> Bool #

(>=) :: Of a b -> Of a b -> Bool #

max :: Of a b -> Of a b -> Of a b #

min :: Of a b -> Of a b -> Of a b #

Methods

readsPrec :: Int -> ReadS (Of a b) #

readList :: ReadS [Of a b] #

readPrec :: ReadPrec (Of a b) #

readListPrec :: ReadPrec [Of a b] #

Methods

showsPrec :: Int -> Of a b -> ShowS #

show :: Of a b -> String #

showList :: [Of a b] -> ShowS #

Methods

from :: Of a b -> Rep (Of a b) x #

to :: Rep (Of a b) x -> Of a b #

Methods

(<>) :: Of a b -> Of a b -> Of a b #

sconcat :: NonEmpty (Of a b) -> Of a b #

stimes :: Integral b0 => b0 -> Of a b -> Of a b #

Methods

mempty :: Of a b #

mappend :: Of a b -> Of a b -> Of a b #

mconcat :: [Of a b] -> Of a b #