algebra-4.3.1: Constructive abstract algebra
Numeric.Ring.Opposite
Synopsis
newtype Opposite r Source #
http://en.wikipedia.org/wiki/Opposite_ring
Constructors
Fields
Instances
Methods
fmap :: (a -> b) -> Opposite a -> Opposite b #
(<$) :: a -> Opposite b -> Opposite a #
fold :: Monoid m => Opposite m -> m #
foldMap :: Monoid m => (a -> m) -> Opposite a -> m #
foldr :: (a -> b -> b) -> b -> Opposite a -> b #
foldr' :: (a -> b -> b) -> b -> Opposite a -> b #
foldl :: (b -> a -> b) -> b -> Opposite a -> b #
foldl' :: (b -> a -> b) -> b -> Opposite a -> b #
foldr1 :: (a -> a -> a) -> Opposite a -> a #
foldl1 :: (a -> a -> a) -> Opposite a -> a #
toList :: Opposite a -> [a] #
null :: Opposite a -> Bool #
length :: Opposite a -> Int #
elem :: Eq a => a -> Opposite a -> Bool #
maximum :: Ord a => Opposite a -> a #
minimum :: Ord a => Opposite a -> a #
sum :: Num a => Opposite a -> a #
product :: Num a => Opposite a -> a #
traverse :: Applicative f => (a -> f b) -> Opposite a -> f (Opposite b) #
sequenceA :: Applicative f => Opposite (f a) -> f (Opposite a) #
mapM :: Monad m => (a -> m b) -> Opposite a -> m (Opposite b) #
sequence :: Monad m => Opposite (m a) -> m (Opposite a) #
traverse1 :: Apply f => (a -> f b) -> Opposite a -> f (Opposite b) #
sequence1 :: Apply f => Opposite (f b) -> f (Opposite b) #
fold1 :: Semigroup m => Opposite m -> m #
foldMap1 :: Semigroup m => (a -> m) -> Opposite a -> m #
toNonEmpty :: Opposite a -> NonEmpty a #
(*.) :: Opposite s -> r -> Opposite s Source #
(.*) :: r -> Opposite s -> Opposite s Source #
(==) :: Opposite r -> Opposite r -> Bool #
(/=) :: Opposite r -> Opposite r -> Bool #
compare :: Opposite r -> Opposite r -> Ordering #
(<) :: Opposite r -> Opposite r -> Bool #
(<=) :: Opposite r -> Opposite r -> Bool #
(>) :: Opposite r -> Opposite r -> Bool #
(>=) :: Opposite r -> Opposite r -> Bool #
max :: Opposite r -> Opposite r -> Opposite r #
min :: Opposite r -> Opposite r -> Opposite r #
readsPrec :: Int -> ReadS (Opposite r) #
readList :: ReadS [Opposite r] #
readPrec :: ReadPrec (Opposite r) #
readListPrec :: ReadPrec [Opposite r] #
showsPrec :: Int -> Opposite r -> ShowS #
show :: Opposite r -> String #
showList :: [Opposite r] -> ShowS #
(+) :: Opposite r -> Opposite r -> Opposite r Source #
sinnum1p :: Natural -> Opposite r -> Opposite r Source #
sumWith1 :: Foldable1 f => (a -> Opposite r) -> f a -> Opposite r Source #
zero :: Opposite r Source #
sinnum :: Natural -> Opposite r -> Opposite r Source #
sumWith :: Foldable f => (a -> Opposite r) -> f a -> Opposite r Source #
(*) :: Opposite r -> Opposite r -> Opposite r Source #
pow1p :: Opposite r -> Natural -> Opposite r Source #
productWith1 :: Foldable1 f => (a -> Opposite r) -> f a -> Opposite r Source #
(-) :: Opposite r -> Opposite r -> Opposite r Source #
negate :: Opposite r -> Opposite r Source #
subtract :: Opposite r -> Opposite r -> Opposite r Source #
times :: Integral n => n -> Opposite r -> Opposite r Source #
one :: Opposite r Source #
pow :: Opposite r -> Natural -> Opposite r Source #
productWith :: Foldable f => (a -> Opposite r) -> f a -> Opposite r Source #
recip :: Opposite r -> Opposite r Source #
(/) :: Opposite r -> Opposite r -> Opposite r Source #
(\\) :: Opposite r -> Opposite r -> Opposite r Source #
(^) :: Integral n => Opposite r -> n -> Opposite r Source #
isAssociate :: Opposite r -> Opposite r -> Bool Source #
recipUnit :: Opposite r -> Maybe (Opposite r) Source #
isUnit :: Opposite r -> Bool Source #
(^?) :: Integral n => Opposite r -> n -> Maybe (Opposite r) Source #
isZero :: Opposite r -> Bool Source #
fromNatural :: Natural -> Opposite r Source #
fromInteger :: Integer -> Opposite r Source #
(*.) :: Opposite r -> Opposite r -> Opposite r Source #
(.*) :: Opposite r -> Opposite r -> Opposite r Source #