Documentation

Methods

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

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

return :: a -> Op a #

fail :: String -> Op a #

Methods

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

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

Methods

pure :: a -> Op a #

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

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

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

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

Methods

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

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

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

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

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

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

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

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

toList :: Op a -> [a] #

null :: Op a -> Bool #

length :: Op a -> Int #

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

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

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

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

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

Methods

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

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

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

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

Methods

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

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

Methods

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

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

toConstr :: Op a -> Constr #

dataTypeOf :: Op a -> DataType #

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

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

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

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

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

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

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

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

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

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

Methods

compare :: Op a -> Op a -> Ordering #

(<) :: Op a -> Op a -> Bool #

(<=) :: Op a -> Op a -> Bool #

(>) :: Op a -> Op a -> Bool #

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

max :: Op a -> Op a -> Op a #

min :: Op a -> Op a -> Op a #

Methods

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

readList :: ReadS [Op a] #

readPrec :: ReadPrec (Op a) #

readListPrec :: ReadPrec [Op a] #

Methods

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

show :: Op a -> String #

showList :: [Op a] -> ShowS #

Methods

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

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

Methods

function :: (Op a -> b) -> Op a :-> b #

Methods

arbitrary :: Gen (Op a) #

shrink :: Op a -> [Op a] #

Methods

coarbitrary :: Op a -> Gen b -> Gen b #

Methods

rnf :: Op a -> () #

Methods

hashWithSalt :: Int -> Op a -> Int #

hash :: Op a -> Int #

Methods

universe :: [Op a] #

Methods

universeF :: [Op a] #

cardinality :: Tagged (Op a) Natural #

Methods

leq :: Op a -> Op a -> Bool Source #

comparable :: Op a -> Op a -> Bool Source #

Methods

top :: Op a Source #

Methods

bottom :: Op a Source #

Methods

(\/) :: Op a -> Op a -> Op a Source #

(/\) :: Op a -> Op a -> Op a Source #

Methods

from1 :: Op a -> Rep1 Op a #

to1 :: Rep1 Op a -> Op a #