{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveFoldable #-}
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE DeriveTraversable #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE Safe #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeOperators #-}
module Algebra.Lattice.Divisibility (
Divisibility(..)
) where
import Prelude ()
import Prelude.Compat
import Algebra.Lattice
import Algebra.PartialOrd
import Control.DeepSeq (NFData (..))
import Control.Monad (ap)
import Data.Data (Data, Typeable)
import Data.Hashable (Hashable (..))
import Data.Universe.Class (Finite (..), Universe (..))
import Data.Universe.Helpers (Natural, Tagged, retag)
import GHC.Generics (Generic, Generic1)
import qualified Test.QuickCheck as QC
newtype Divisibility a = Divisibility { forall a. Divisibility a -> a
getDivisibility :: a }
deriving ( Divisibility a -> Divisibility a -> Bool
forall a. Eq a => Divisibility a -> Divisibility a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Divisibility a -> Divisibility a -> Bool
$c/= :: forall a. Eq a => Divisibility a -> Divisibility a -> Bool
== :: Divisibility a -> Divisibility a -> Bool
$c== :: forall a. Eq a => Divisibility a -> Divisibility a -> Bool
Eq, Divisibility a -> Divisibility a -> Bool
Divisibility a -> Divisibility a -> Ordering
Divisibility a -> Divisibility a -> Divisibility a
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall {a}. Ord a => Eq (Divisibility a)
forall a. Ord a => Divisibility a -> Divisibility a -> Bool
forall a. Ord a => Divisibility a -> Divisibility a -> Ordering
forall a.
Ord a =>
Divisibility a -> Divisibility a -> Divisibility a
min :: Divisibility a -> Divisibility a -> Divisibility a
$cmin :: forall a.
Ord a =>
Divisibility a -> Divisibility a -> Divisibility a
max :: Divisibility a -> Divisibility a -> Divisibility a
$cmax :: forall a.
Ord a =>
Divisibility a -> Divisibility a -> Divisibility a
>= :: Divisibility a -> Divisibility a -> Bool
$c>= :: forall a. Ord a => Divisibility a -> Divisibility a -> Bool
> :: Divisibility a -> Divisibility a -> Bool
$c> :: forall a. Ord a => Divisibility a -> Divisibility a -> Bool
<= :: Divisibility a -> Divisibility a -> Bool
$c<= :: forall a. Ord a => Divisibility a -> Divisibility a -> Bool
< :: Divisibility a -> Divisibility a -> Bool
$c< :: forall a. Ord a => Divisibility a -> Divisibility a -> Bool
compare :: Divisibility a -> Divisibility a -> Ordering
$ccompare :: forall a. Ord a => Divisibility a -> Divisibility a -> Ordering
Ord, Int -> Divisibility a -> ShowS
forall a. Show a => Int -> Divisibility a -> ShowS
forall a. Show a => [Divisibility a] -> ShowS
forall a. Show a => Divisibility a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Divisibility a] -> ShowS
$cshowList :: forall a. Show a => [Divisibility a] -> ShowS
show :: Divisibility a -> String
$cshow :: forall a. Show a => Divisibility a -> String
showsPrec :: Int -> Divisibility a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> Divisibility a -> ShowS
Show, ReadPrec [Divisibility a]
ReadPrec (Divisibility a)
ReadS [Divisibility a]
forall a. Read a => ReadPrec [Divisibility a]
forall a. Read a => ReadPrec (Divisibility a)
forall a. Read a => Int -> ReadS (Divisibility a)
forall a. Read a => ReadS [Divisibility a]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [Divisibility a]
$creadListPrec :: forall a. Read a => ReadPrec [Divisibility a]
readPrec :: ReadPrec (Divisibility a)
$creadPrec :: forall a. Read a => ReadPrec (Divisibility a)
readList :: ReadS [Divisibility a]
$creadList :: forall a. Read a => ReadS [Divisibility a]
readsPrec :: Int -> ReadS (Divisibility a)
$creadsPrec :: forall a. Read a => Int -> ReadS (Divisibility a)
Read, Divisibility a -> DataType
Divisibility a -> Constr
forall {a}. Data a => Typeable (Divisibility a)
forall a. Data a => Divisibility a -> DataType
forall a. Data a => Divisibility a -> Constr
forall a.
Data a =>
(forall b. Data b => b -> b) -> Divisibility a -> Divisibility a
forall a u.
Data a =>
Int -> (forall d. Data d => d -> u) -> Divisibility a -> u
forall a u.
Data a =>
(forall d. Data d => d -> u) -> Divisibility a -> [u]
forall a r r'.
Data a =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Divisibility a -> r
forall a r r'.
Data a =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Divisibility a -> r
forall a (m :: * -> *).
(Data a, Monad m) =>
(forall d. Data d => d -> m d)
-> Divisibility a -> m (Divisibility a)
forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> Divisibility a -> m (Divisibility a)
forall a (c :: * -> *).
Data a =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Divisibility a)
forall a (c :: * -> *).
Data a =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Divisibility a -> c (Divisibility a)
forall a (t :: * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Divisibility a))
forall a (t :: * -> * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Divisibility a))
forall a.
Typeable a
-> (forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Divisibility a)
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Divisibility a -> c (Divisibility a)
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (Divisibility a))
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> Divisibility a -> m (Divisibility a)
$cgmapMo :: forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> Divisibility a -> m (Divisibility a)
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> Divisibility a -> m (Divisibility a)
$cgmapMp :: forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> Divisibility a -> m (Divisibility a)
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> Divisibility a -> m (Divisibility a)
$cgmapM :: forall a (m :: * -> *).
(Data a, Monad m) =>
(forall d. Data d => d -> m d)
-> Divisibility a -> m (Divisibility a)
gmapQi :: forall u.
Int -> (forall d. Data d => d -> u) -> Divisibility a -> u
$cgmapQi :: forall a u.
Data a =>
Int -> (forall d. Data d => d -> u) -> Divisibility a -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> Divisibility a -> [u]
$cgmapQ :: forall a u.
Data a =>
(forall d. Data d => d -> u) -> Divisibility a -> [u]
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Divisibility a -> r
$cgmapQr :: forall a r r'.
Data a =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Divisibility a -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Divisibility a -> r
$cgmapQl :: forall a r r'.
Data a =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Divisibility a -> r
gmapT :: (forall b. Data b => b -> b) -> Divisibility a -> Divisibility a
$cgmapT :: forall a.
Data a =>
(forall b. Data b => b -> b) -> Divisibility a -> Divisibility a
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Divisibility a))
$cdataCast2 :: forall a (t :: * -> * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Divisibility a))
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (Divisibility a))
$cdataCast1 :: forall a (t :: * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Divisibility a))
dataTypeOf :: Divisibility a -> DataType
$cdataTypeOf :: forall a. Data a => Divisibility a -> DataType
toConstr :: Divisibility a -> Constr
$ctoConstr :: forall a. Data a => Divisibility a -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Divisibility a)
$cgunfold :: forall a (c :: * -> *).
Data a =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Divisibility a)
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Divisibility a -> c (Divisibility a)
$cgfoldl :: forall a (c :: * -> *).
Data a =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Divisibility a -> c (Divisibility a)
Data, Typeable, forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall a x. Rep (Divisibility a) x -> Divisibility a
forall a x. Divisibility a -> Rep (Divisibility a) x
$cto :: forall a x. Rep (Divisibility a) x -> Divisibility a
$cfrom :: forall a x. Divisibility a -> Rep (Divisibility a) x
Generic, forall a b. a -> Divisibility b -> Divisibility a
forall a b. (a -> b) -> Divisibility a -> Divisibility b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: forall a b. a -> Divisibility b -> Divisibility a
$c<$ :: forall a b. a -> Divisibility b -> Divisibility a
fmap :: forall a b. (a -> b) -> Divisibility a -> Divisibility b
$cfmap :: forall a b. (a -> b) -> Divisibility a -> Divisibility b
Functor, forall a. Eq a => a -> Divisibility a -> Bool
forall a. Num a => Divisibility a -> a
forall a. Ord a => Divisibility a -> a
forall m. Monoid m => Divisibility m -> m
forall a. Divisibility a -> Bool
forall a. Divisibility a -> Int
forall a. Divisibility a -> [a]
forall a. (a -> a -> a) -> Divisibility a -> a
forall m a. Monoid m => (a -> m) -> Divisibility a -> m
forall b a. (b -> a -> b) -> b -> Divisibility a -> b
forall a b. (a -> b -> b) -> b -> Divisibility a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
product :: forall a. Num a => Divisibility a -> a
$cproduct :: forall a. Num a => Divisibility a -> a
sum :: forall a. Num a => Divisibility a -> a
$csum :: forall a. Num a => Divisibility a -> a
minimum :: forall a. Ord a => Divisibility a -> a
$cminimum :: forall a. Ord a => Divisibility a -> a
maximum :: forall a. Ord a => Divisibility a -> a
$cmaximum :: forall a. Ord a => Divisibility a -> a
elem :: forall a. Eq a => a -> Divisibility a -> Bool
$celem :: forall a. Eq a => a -> Divisibility a -> Bool
length :: forall a. Divisibility a -> Int
$clength :: forall a. Divisibility a -> Int
null :: forall a. Divisibility a -> Bool
$cnull :: forall a. Divisibility a -> Bool
toList :: forall a. Divisibility a -> [a]
$ctoList :: forall a. Divisibility a -> [a]
foldl1 :: forall a. (a -> a -> a) -> Divisibility a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> Divisibility a -> a
foldr1 :: forall a. (a -> a -> a) -> Divisibility a -> a
$cfoldr1 :: forall a. (a -> a -> a) -> Divisibility a -> a
foldl' :: forall b a. (b -> a -> b) -> b -> Divisibility a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> Divisibility a -> b
foldl :: forall b a. (b -> a -> b) -> b -> Divisibility a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> Divisibility a -> b
foldr' :: forall a b. (a -> b -> b) -> b -> Divisibility a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> Divisibility a -> b
foldr :: forall a b. (a -> b -> b) -> b -> Divisibility a -> b
$cfoldr :: forall a b. (a -> b -> b) -> b -> Divisibility a -> b
foldMap' :: forall m a. Monoid m => (a -> m) -> Divisibility a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> Divisibility a -> m
foldMap :: forall m a. Monoid m => (a -> m) -> Divisibility a -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> Divisibility a -> m
fold :: forall m. Monoid m => Divisibility m -> m
$cfold :: forall m. Monoid m => Divisibility m -> m
Foldable, Functor Divisibility
Foldable Divisibility
forall (t :: * -> *).
Functor t
-> Foldable t
-> (forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> t a -> f (t b))
-> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
-> (forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> t a -> m (t b))
-> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
-> Traversable t
forall (m :: * -> *) a.
Monad m =>
Divisibility (m a) -> m (Divisibility a)
forall (f :: * -> *) a.
Applicative f =>
Divisibility (f a) -> f (Divisibility a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Divisibility a -> m (Divisibility b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Divisibility a -> f (Divisibility b)
sequence :: forall (m :: * -> *) a.
Monad m =>
Divisibility (m a) -> m (Divisibility a)
$csequence :: forall (m :: * -> *) a.
Monad m =>
Divisibility (m a) -> m (Divisibility a)
mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Divisibility a -> m (Divisibility b)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Divisibility a -> m (Divisibility b)
sequenceA :: forall (f :: * -> *) a.
Applicative f =>
Divisibility (f a) -> f (Divisibility a)
$csequenceA :: forall (f :: * -> *) a.
Applicative f =>
Divisibility (f a) -> f (Divisibility a)
traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Divisibility a -> f (Divisibility b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Divisibility a -> f (Divisibility b)
Traversable
, forall a. Rep1 Divisibility a -> Divisibility a
forall a. Divisibility a -> Rep1 Divisibility a
forall k (f :: k -> *).
(forall (a :: k). f a -> Rep1 f a)
-> (forall (a :: k). Rep1 f a -> f a) -> Generic1 f
$cto1 :: forall a. Rep1 Divisibility a -> Divisibility a
$cfrom1 :: forall a. Divisibility a -> Rep1 Divisibility a
Generic1
)
instance Applicative Divisibility where
pure :: forall a. a -> Divisibility a
pure = forall (m :: * -> *) a. Monad m => a -> m a
return
<*> :: forall a b.
Divisibility (a -> b) -> Divisibility a -> Divisibility b
(<*>) = forall (m :: * -> *) a b. Monad m => m (a -> b) -> m a -> m b
ap
instance Monad Divisibility where
return :: forall a. a -> Divisibility a
return = forall a. a -> Divisibility a
Divisibility
Divisibility a
x >>= :: forall a b.
Divisibility a -> (a -> Divisibility b) -> Divisibility b
>>= a -> Divisibility b
f = a -> Divisibility b
f a
x
instance NFData a => NFData (Divisibility a) where
rnf :: Divisibility a -> ()
rnf (Divisibility a
a) = forall a. NFData a => a -> ()
rnf a
a
instance Hashable a => Hashable (Divisibility a)
instance Integral a => Lattice (Divisibility a) where
Divisibility a
x \/ :: Divisibility a -> Divisibility a -> Divisibility a
\/ Divisibility a
y = forall a. a -> Divisibility a
Divisibility (forall a. Integral a => a -> a -> a
lcm a
x a
y)
Divisibility a
x /\ :: Divisibility a -> Divisibility a -> Divisibility a
/\ Divisibility a
y = forall a. a -> Divisibility a
Divisibility (forall a. Integral a => a -> a -> a
gcd a
x a
y)
instance Integral a => BoundedJoinSemiLattice (Divisibility a) where
bottom :: Divisibility a
bottom = forall a. a -> Divisibility a
Divisibility a
1
instance (Eq a, Integral a) => PartialOrd (Divisibility a) where
leq :: Divisibility a -> Divisibility a -> Bool
leq (Divisibility a
a) (Divisibility a
b) = a
b forall a. Integral a => a -> a -> a
`mod` a
a forall a. Eq a => a -> a -> Bool
== a
0
instance Universe a => Universe (Divisibility a) where
universe :: [Divisibility a]
universe = forall a b. (a -> b) -> [a] -> [b]
map forall a. a -> Divisibility a
Divisibility forall a. Universe a => [a]
universe
instance Finite a => Finite (Divisibility a) where
universeF :: [Divisibility a]
universeF = forall a b. (a -> b) -> [a] -> [b]
map forall a. a -> Divisibility a
Divisibility forall a. Finite a => [a]
universeF
cardinality :: Tagged (Divisibility a) Natural
cardinality = forall {k1} {k2} (s :: k1) b (t :: k2). Tagged s b -> Tagged t b
retag (forall a. Finite a => Tagged a Natural
cardinality :: Tagged a Natural)
instance (QC.Arbitrary a, Num a, Ord a) => QC.Arbitrary (Divisibility a) where
arbitrary :: Gen (Divisibility a)
arbitrary = forall a. (Ord a, Num a) => a -> Divisibility a
divisibility forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall a. Arbitrary a => Gen a
QC.arbitrary
shrink :: Divisibility a -> [Divisibility a]
shrink Divisibility a
d = forall a. (a -> Bool) -> [a] -> [a]
filter (forall a. Ord a => a -> a -> Bool
<Divisibility a
d) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (a -> b) -> [a] -> [b]
map forall a. (Ord a, Num a) => a -> Divisibility a
divisibility forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Arbitrary a => a -> [a]
QC.shrink forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Divisibility a -> a
getDivisibility forall a b. (a -> b) -> a -> b
$ Divisibility a
d
instance QC.CoArbitrary a => QC.CoArbitrary (Divisibility a) where
coarbitrary :: forall b. Divisibility a -> Gen b -> Gen b
coarbitrary = forall a b. CoArbitrary a => a -> Gen b -> Gen b
QC.coarbitrary forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Divisibility a -> a
getDivisibility
instance QC.Function a => QC.Function (Divisibility a) where
function :: forall b. (Divisibility a -> b) -> Divisibility a :-> b
function = forall b a c.
Function b =>
(a -> b) -> (b -> a) -> (a -> c) -> a :-> c
QC.functionMap forall a. Divisibility a -> a
getDivisibility forall a. a -> Divisibility a
Divisibility
divisibility :: (Ord a, Num a) => a -> Divisibility a
divisibility :: forall a. (Ord a, Num a) => a -> Divisibility a
divisibility a
x | a
x forall a. Ord a => a -> a -> Bool
< (-a
1) = forall a. a -> Divisibility a
Divisibility (forall a. Num a => a -> a
abs a
x)
| a
x forall a. Ord a => a -> a -> Bool
< a
1 = forall a. a -> Divisibility a
Divisibility a
1
| Bool
otherwise = forall a. a -> Divisibility a
Divisibility a
x