Data.Array.Accelerate.Linear.Vector

Operations on free vector spaces

Documentation

>>> :set -XPatternSynonyms
>>> import Linear.V2
>>> import Data.Array.Accelerate.Linear.V2 ( pattern V2_ )
>>> import Data.Array.Accelerate.Interpreter
>>> :{
  let test :: Elt e => Exp e -> e
      test e = indexArray (run (unit e)) Z
:}

class Additive f => Additive f where

A vector is an additive group with additional structure.

TODO: Support both Exp and Acc

Minimal complete definition

Nothing

Methods

zero :: (Elt (f a), Num a) => Exp (f a)

The zero vector

(^+^) :: forall a. (Num a, Box f a) => Exp (f a) -> Exp (f a) -> Exp (f a) infixl 6

Compute the sum of two vectors

>>> test $ (V2_ 1 2 :: Exp (V2 Int)) ^+^ (V2_ 3 4 :: Exp (V2 Int))
V2 4 6

(^-^) :: forall a. (Num a, Box f a) => Exp (f a) -> Exp (f a) -> Exp (f a) infixl 6

Compute the difference between two vectors

>>> test $ (V2_ 4 5 :: Exp (V2 Int)) ^-^ (V2_ 3 1 :: Exp (V2 Int))
V2 1 4

lerp :: forall a. (Num a, Box f a) => Exp a -> Exp (f a) -> Exp (f a) -> Exp (f a)

Linearly interpolate between two vectors

Instances

Additive Plucker

Defined in Data.Array.Accelerate.Linear.Plucker

Methods

zero :: (Elt (Plucker a), Num a) => Exp (Plucker a)

(^+^) :: (Num a, Box Plucker a) => Exp (Plucker a) -> Exp (Plucker a) -> Exp (Plucker a)

(^-^) :: (Num a, Box Plucker a) => Exp (Plucker a) -> Exp (Plucker a) -> Exp (Plucker a)

lerp :: (Num a, Box Plucker a) => Exp a -> Exp (Plucker a) -> Exp (Plucker a) -> Exp (Plucker a)

Additive Quaternion

Defined in Data.Array.Accelerate.Linear.Quaternion

Methods

zero :: (Elt (Quaternion a), Num a) => Exp (Quaternion a)

(^+^) :: (Num a, Box Quaternion a) => Exp (Quaternion a) -> Exp (Quaternion a) -> Exp (Quaternion a)

(^-^) :: (Num a, Box Quaternion a) => Exp (Quaternion a) -> Exp (Quaternion a) -> Exp (Quaternion a)

lerp :: (Num a, Box Quaternion a) => Exp a -> Exp (Quaternion a) -> Exp (Quaternion a) -> Exp (Quaternion a)

Additive V0

Defined in Data.Array.Accelerate.Linear.V0

Methods

zero :: (Elt (V0 a), Num a) => Exp (V0 a)

(^+^) :: (Num a, Box V0 a) => Exp (V0 a) -> Exp (V0 a) -> Exp (V0 a)

(^-^) :: (Num a, Box V0 a) => Exp (V0 a) -> Exp (V0 a) -> Exp (V0 a)

lerp :: (Num a, Box V0 a) => Exp a -> Exp (V0 a) -> Exp (V0 a) -> Exp (V0 a)

Additive V4

Defined in Data.Array.Accelerate.Linear.V4

Methods

zero :: (Elt (V4 a), Num a) => Exp (V4 a)

(^+^) :: (Num a, Box V4 a) => Exp (V4 a) -> Exp (V4 a) -> Exp (V4 a)

(^-^) :: (Num a, Box V4 a) => Exp (V4 a) -> Exp (V4 a) -> Exp (V4 a)

lerp :: (Num a, Box V4 a) => Exp a -> Exp (V4 a) -> Exp (V4 a) -> Exp (V4 a)

Additive V3

Defined in Data.Array.Accelerate.Linear.V3

Methods

zero :: (Elt (V3 a), Num a) => Exp (V3 a)

(^+^) :: (Num a, Box V3 a) => Exp (V3 a) -> Exp (V3 a) -> Exp (V3 a)

(^-^) :: (Num a, Box V3 a) => Exp (V3 a) -> Exp (V3 a) -> Exp (V3 a)

lerp :: (Num a, Box V3 a) => Exp a -> Exp (V3 a) -> Exp (V3 a) -> Exp (V3 a)

Additive V2

Defined in Data.Array.Accelerate.Linear.V2

Methods

zero :: (Elt (V2 a), Num a) => Exp (V2 a)

(^+^) :: (Num a, Box V2 a) => Exp (V2 a) -> Exp (V2 a) -> Exp (V2 a)

(^-^) :: (Num a, Box V2 a) => Exp (V2 a) -> Exp (V2 a) -> Exp (V2 a)

lerp :: (Num a, Box V2 a) => Exp a -> Exp (V2 a) -> Exp (V2 a) -> Exp (V2 a)

Additive V1

Defined in Data.Array.Accelerate.Linear.V1

Methods

zero :: (Elt (V1 a), Num a) => Exp (V1 a)

(^+^) :: (Num a, Box V1 a) => Exp (V1 a) -> Exp (V1 a) -> Exp (V1 a)

(^-^) :: (Num a, Box V1 a) => Exp (V1 a) -> Exp (V1 a) -> Exp (V1 a)

lerp :: (Num a, Box V1 a) => Exp a -> Exp (V1 a) -> Exp (V1 a) -> Exp (V1 a)

newtype E t

Basis element

Constructors

E

Fields

• el :: forall a. (Elt a, Box t a) => Lens' (Exp (t a)) (Exp a)

negated :: forall f a. (Functor f, Num a, Box f a) => Exp (f a) -> Exp (f a)

Compute the negation of a vector

>>> test $ negated (V2_ 2 4 :: Exp (V2 Int))
V2 (-2) (-4)

(*^) :: forall f a. (Functor f, Num a, Box f a) => Exp a -> Exp (f a) -> Exp (f a) infixl 7

Compute the left scalar product

>>> test $ 2 *^ (V2_ 3 4 :: Exp (V2 Int))
V2 6 8

(^*) :: forall f a. (Functor f, Num a, Box f a) => Exp (f a) -> Exp a -> Exp (f a) infixl 7

Compute the right scalar product

>>> test $ (V2_ 3 4 :: Exp (V2 Int)) ^* 2
V2 6 8

(^/) :: forall f a. (Functor f, Fractional a, Box f a) => Exp (f a) -> Exp a -> Exp (f a) infixl 7

Compute division by a scalar on the right

>>> test $ (V2_ 4 6 :: Exp (V2 Double)) ^/ 2
V2 2.0 3.0

(/^) :: forall f a. (Functor f, Fractional a, Box f a) => Exp a -> Exp (f a) -> Exp (f a) infixl 7

Compute division of a scalar on the left

>>> test $ 4 /^ (V2_ 2 4 :: Exp (V2 Double))
V2 2.0 1.0

(+^) :: forall f a. (Functor f, Num a, Box f a) => Exp a -> Exp (f a) -> Exp (f a) infixl 6

Addition with a scalar on the left

>>> test $ 2 +^ (V2_ 3 4 :: Exp (V2 Int))
V2 5 6

(^+) :: forall f a. (Functor f, Num a, Box f a) => Exp (f a) -> Exp a -> Exp (f a) infixl 6

Addition with a scalar on the right

>>> test $ (V2_ 1 2 :: Exp (V2 Int)) ^+ 3
V2 4 5

(-^) :: forall f a. (Functor f, Num a, Box f a) => Exp a -> Exp (f a) -> Exp (f a) infixl 6

Subtraction with a scalar on the left

>>> test $ 2 -^ (V2_ 3 4 :: Exp (V2 Int))
V2 (-1) (-2)

(^-) :: forall f a. (Functor f, Num a, Box f a) => Exp (f a) -> Exp a -> Exp (f a) infixl 6

Subtraction with a scalar on the right

>>> test $ (V2_ 1 2 :: Exp (V2 Int)) ^- 3
V2 (-2) (-1)