Documentation

Methods

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

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

return :: a -> Divisibility a Source #

Methods

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

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

Methods

pure :: a -> Divisibility a Source #

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

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

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

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

Methods

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

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

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

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

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

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

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

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

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

toList :: Divisibility a -> [a] Source #

null :: Divisibility a -> Bool Source #

length :: Divisibility a -> Int Source #

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

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

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

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

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

Methods

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

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

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

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

Methods

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

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

Methods

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

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

toConstr :: Divisibility a -> Constr Source #

dataTypeOf :: Divisibility a -> DataType Source #

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

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

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

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

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

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

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

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

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

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

Methods

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

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

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

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

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

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

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

Methods

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

readList :: ReadS [ Divisibility a] Source #

readPrec :: ReadPrec ( Divisibility a) Source #

readListPrec :: ReadPrec [ Divisibility a] Source #

Methods

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

show :: Divisibility a -> String Source #

showList :: [ Divisibility a] -> ShowS Source #

Methods

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

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

Methods

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

Methods

arbitrary :: Gen ( Divisibility a) Source #

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

Methods

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

Methods

rnf :: Divisibility a -> () Source #

Methods

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

hash :: Divisibility a -> Int Source #

Methods

universe :: [ Divisibility a] Source #

Methods

universeF :: [ Divisibility a] Source #

cardinality :: Tagged ( Divisibility a) Natural Source #

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 :: forall (a :: k). Divisibility a -> Rep1 Divisibility a Source #

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