Copyright	(c) Conal Elliott and Andy J Gill 2008
License	BSD3
Maintainer	conal@conal.net, andygill@ku.edu
Stability	experimental
Safe Haskell	Safe
Language	Haskell98

Data.AdditiveGroup

Description

Groups: zero, addition, and negation (additive inverse)

Synopsis

Documentation

class AdditiveGroup v where Source #

Additive group v.

Minimal complete definition

zeroV, (^+^), negateV

Methods

zeroV :: v Source #

The zero element: identity for '(^+^)'

(^+^) :: v -> v -> v infixl 6 Source #

Add vectors

negateV :: v -> v Source #

Additive inverse

(^-^) :: v -> v -> v infixl 6 Source #

Group subtraction

Instances

AdditiveGroup Double Source #
Methods zeroV :: Double Source # (^+^) :: Double -> Double -> Double Source # negateV :: Double -> Double Source # (^-^) :: Double -> Double -> Double Source #
AdditiveGroup Float Source #
Methods zeroV :: Float Source # (^+^) :: Float -> Float -> Float Source # negateV :: Float -> Float Source # (^-^) :: Float -> Float -> Float Source #
AdditiveGroup Int Source #
Methods zeroV :: Int Source # (^+^) :: Int -> Int -> Int Source # negateV :: Int -> Int Source # (^-^) :: Int -> Int -> Int Source #
AdditiveGroup Integer Source #
Methods zeroV :: Integer Source # (^+^) :: Integer -> Integer -> Integer Source # negateV :: Integer -> Integer Source # (^-^) :: Integer -> Integer -> Integer Source #
AdditiveGroup () Source #
Methods zeroV :: () Source # (^+^) :: () -> () -> () Source # negateV :: () -> () Source # (^-^) :: () -> () -> () Source #
AdditiveGroup CSChar Source #
Methods zeroV :: CSChar Source # (^+^) :: CSChar -> CSChar -> CSChar Source # negateV :: CSChar -> CSChar Source # (^-^) :: CSChar -> CSChar -> CSChar Source #
AdditiveGroup CShort Source #
Methods zeroV :: CShort Source # (^+^) :: CShort -> CShort -> CShort Source # negateV :: CShort -> CShort Source # (^-^) :: CShort -> CShort -> CShort Source #
AdditiveGroup CInt Source #
Methods zeroV :: CInt Source # (^+^) :: CInt -> CInt -> CInt Source # negateV :: CInt -> CInt Source # (^-^) :: CInt -> CInt -> CInt Source #
AdditiveGroup CLong Source #
Methods zeroV :: CLong Source # (^+^) :: CLong -> CLong -> CLong Source # negateV :: CLong -> CLong Source # (^-^) :: CLong -> CLong -> CLong Source #
AdditiveGroup CLLong Source #
Methods zeroV :: CLLong Source # (^+^) :: CLLong -> CLLong -> CLLong Source # negateV :: CLLong -> CLLong Source # (^-^) :: CLLong -> CLLong -> CLLong Source #
AdditiveGroup CFloat Source #
Methods zeroV :: CFloat Source # (^+^) :: CFloat -> CFloat -> CFloat Source # negateV :: CFloat -> CFloat Source # (^-^) :: CFloat -> CFloat -> CFloat Source #
AdditiveGroup CDouble Source #
Methods zeroV :: CDouble Source # (^+^) :: CDouble -> CDouble -> CDouble Source # negateV :: CDouble -> CDouble Source # (^-^) :: CDouble -> CDouble -> CDouble Source #
AdditiveGroup CIntMax Source #
Methods zeroV :: CIntMax Source # (^+^) :: CIntMax -> CIntMax -> CIntMax Source # negateV :: CIntMax -> CIntMax Source # (^-^) :: CIntMax -> CIntMax -> CIntMax Source #
AdditiveGroup a => AdditiveGroup (Maybe a) Source #
Methods zeroV :: Maybe a Source # (^+^) :: Maybe a -> Maybe a -> Maybe a Source # negateV :: Maybe a -> Maybe a Source # (^-^) :: Maybe a -> Maybe a -> Maybe a Source #
Integral a => AdditiveGroup (Ratio a) Source #
Methods zeroV :: Ratio a Source # (^+^) :: Ratio a -> Ratio a -> Ratio a Source # negateV :: Ratio a -> Ratio a Source # (^-^) :: Ratio a -> Ratio a -> Ratio a Source #
(RealFloat v, AdditiveGroup v) => AdditiveGroup (Complex v) Source #
Methods zeroV :: Complex v Source # (^+^) :: Complex v -> Complex v -> Complex v Source # negateV :: Complex v -> Complex v Source # (^-^) :: Complex v -> Complex v -> Complex v Source #
AdditiveGroup a => AdditiveGroup (Sum a) Source #
Methods zeroV :: Sum a Source # (^+^) :: Sum a -> Sum a -> Sum a Source # negateV :: Sum a -> Sum a Source # (^-^) :: Sum a -> Sum a -> Sum a Source #
AdditiveGroup v => AdditiveGroup (a -> v) Source #
Methods zeroV :: a -> v Source # (^+^) :: (a -> v) -> (a -> v) -> a -> v Source # negateV :: (a -> v) -> a -> v Source # (^-^) :: (a -> v) -> (a -> v) -> a -> v Source #
(AdditiveGroup u, AdditiveGroup v) => AdditiveGroup (u, v) Source #
Methods zeroV :: (u, v) Source # (^+^) :: (u, v) -> (u, v) -> (u, v) Source # negateV :: (u, v) -> (u, v) Source # (^-^) :: (u, v) -> (u, v) -> (u, v) Source #
(HasTrie u, AdditiveGroup v) => AdditiveGroup ((:->:) u v) Source #
Methods zeroV :: u :->: v Source # (^+^) :: (u :->: v) -> (u :->: v) -> u :->: v Source # negateV :: (u :->: v) -> u :->: v Source # (^-^) :: (u :->: v) -> (u :->: v) -> u :->: v Source #
(HasTrie (Basis u), AdditiveGroup v) => AdditiveGroup ((:-*) u v) Source #
Methods zeroV :: u :-* v Source # (^+^) :: (u :-* v) -> (u :-* v) -> u :-* v Source # negateV :: (u :-* v) -> u :-* v Source # (^-^) :: (u :-* v) -> (u :-* v) -> u :-* v Source #
(HasBasis a, HasTrie (Basis a), AdditiveGroup u) => AdditiveGroup ((:>) a u) Source #
Methods zeroV :: a :> u Source # (^+^) :: (a :> u) -> (a :> u) -> a :> u Source # negateV :: (a :> u) -> a :> u Source # (^-^) :: (a :> u) -> (a :> u) -> a :> u Source #
(AdditiveGroup u, AdditiveGroup v, AdditiveGroup w) => AdditiveGroup (u, v, w) Source #
Methods zeroV :: (u, v, w) Source # (^+^) :: (u, v, w) -> (u, v, w) -> (u, v, w) Source # negateV :: (u, v, w) -> (u, v, w) Source # (^-^) :: (u, v, w) -> (u, v, w) -> (u, v, w) Source #
(AdditiveGroup u, AdditiveGroup v, AdditiveGroup w, AdditiveGroup x) => AdditiveGroup (u, v, w, x) Source #
Methods zeroV :: (u, v, w, x) Source # (^+^) :: (u, v, w, x) -> (u, v, w, x) -> (u, v, w, x) Source # negateV :: (u, v, w, x) -> (u, v, w, x) Source # (^-^) :: (u, v, w, x) -> (u, v, w, x) -> (u, v, w, x) Source #

sumV :: (Foldable f, AdditiveGroup v) => f v -> v Source #

Sum over several vectors

newtype Sum a Source #

Monoid under group addition. Alternative to the Sum in Data.Monoid, which uses Num instead of AdditiveGroup.

Constructors

Sum
Fields getSum :: a

Instances

Functor Sum Source #
Methods fmap :: (a -> b) -> Sum a -> Sum b # (<$) :: a -> Sum b -> Sum a #
Applicative Sum Source #
Methods pure :: a -> Sum a # (<>) :: Sum (a -> b) -> Sum a -> Sum b # (>) :: Sum a -> Sum b -> Sum b # (<*) :: Sum a -> Sum b -> Sum a #
Bounded a => Bounded (Sum a) Source #
Methods minBound :: Sum a # maxBound :: Sum a #
Eq a => Eq (Sum a) Source #
Methods (==) :: Sum a -> Sum a -> Bool # (/=) :: Sum a -> Sum a -> Bool #
Ord a => Ord (Sum a) Source #
Methods compare :: Sum a -> Sum a -> Ordering # (<) :: Sum a -> Sum a -> Bool # (<=) :: Sum a -> Sum a -> Bool # (>) :: Sum a -> Sum a -> Bool # (>=) :: Sum a -> Sum a -> Bool # max :: Sum a -> Sum a -> Sum a # min :: Sum a -> Sum a -> Sum a #
Read a => Read (Sum a) Source #
Methods readsPrec :: Int -> ReadS (Sum a) # readList :: ReadS [Sum a] # readPrec :: ReadPrec (Sum a) # readListPrec :: ReadPrec [Sum a] #
Show a => Show (Sum a) Source #
Methods showsPrec :: Int -> Sum a -> ShowS # show :: Sum a -> String # showList :: [Sum a] -> ShowS #
AdditiveGroup a => Monoid (Sum a) Source #
Methods mempty :: Sum a # mappend :: Sum a -> Sum a -> Sum a # mconcat :: [Sum a] -> Sum a #
AdditiveGroup a => AdditiveGroup (Sum a) Source #
Methods zeroV :: Sum a Source # (^+^) :: Sum a -> Sum a -> Sum a Source # negateV :: Sum a -> Sum a Source # (^-^) :: Sum a -> Sum a -> Sum a Source #

inSum :: (a -> b) -> Sum a -> Sum b Source #

Application a unary function inside a Sum

inSum2 :: (a -> b -> c) -> Sum a -> Sum b -> Sum c Source #

Application a binary function inside a Sum