Documentation

Methods

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

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

return :: a -> Divisibility a #

fail :: String -> Divisibility a #

Methods

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

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

Methods

pure :: a -> Divisibility a #

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

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

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

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

Methods

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

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

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

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

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

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

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

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

toList :: Divisibility a -> [a] #

null :: Divisibility a -> Bool #

length :: Divisibility a -> Int #

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

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

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

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

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

Methods

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

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

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

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

Methods

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

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

Methods

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

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

toConstr :: Divisibility a -> Constr #

dataTypeOf :: Divisibility a -> DataType #

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

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

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

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

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

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

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

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

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

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

Methods

compare :: Divisibility a -> Divisibility a -> Ordering #

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

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

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

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

max :: Divisibility a -> Divisibility a -> Divisibility a #

min :: Divisibility a -> Divisibility a -> Divisibility a #

Methods

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

readList :: ReadS [Divisibility a] #

readPrec :: ReadPrec (Divisibility a) #

readListPrec :: ReadPrec [Divisibility a] #

Methods

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

show :: Divisibility a -> String #

showList :: [Divisibility a] -> ShowS #

Methods

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

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

Methods

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

Methods

arbitrary :: Gen (Divisibility a) #

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

Methods

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

Methods

rnf :: Divisibility a -> () #

Methods

hashWithSalt :: Int -> Divisibility a -> Int #

hash :: Divisibility a -> Int #

Methods

universe :: [Divisibility a] #

Methods

universeF :: [Divisibility a] #

cardinality :: Tagged (Divisibility a) Natural #

Methods

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

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

Methods

bottom :: Divisibility a Source #

Methods

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

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

Methods

from1 :: Divisibility a -> Rep1 Divisibility a #

to1 :: Rep1 Divisibility a -> Divisibility a #