Data.Cross

Description

Cross products and normals

Synopsis

Documentation

class HasNormal v where #

Thing with a normal vector (not necessarily normalized).

Minimal complete definition

Methods

normalVec :: v -> v #

Instances

(VectorSpace s, HasBasis s, HasTrie (Basis s), HasNormal ((:>) (Two s) (Three s))) => HasNormal (Three ((:>) (Two s) s)) #
Methods normalVec :: Three (Two s :> s) -> Three (Two s :> s) #
(VectorSpace s, HasBasis s, HasTrie (Basis s), (~) * (Basis s) ()) => HasNormal (Two ((:>) (One s) s)) #
Methods normalVec :: Two (One s :> s) -> Two (One s :> s) #
(Num s, HasTrie (Basis (s, s)), HasBasis s, (~) * (Basis s) ()) => HasNormal ((:>) (Two s) (Three s)) #
Methods normalVec :: (Two s :> Three s) -> Two s :> Three s #
(HasBasis s, HasTrie (Basis s), (~) * (Basis s) ()) => HasNormal ((:>) (One s) (Two s)) #
Methods normalVec :: (One s :> Two s) -> One s :> Two s #

Normalized normal vector. See also cross.

type One s = s #

Singleton

type Two s = (s, s) #

Homogeneous pair

type Three s = (s, s, s) #

Homogeneous triple

class HasCross2 v where #

Cross product of various forms of 2D vectors

Minimal complete definition

Methods

cross2 :: v -> v #

Instances

AdditiveGroup u => HasCross2 (u, u) #
Methods cross2 :: (u, u) -> (u, u) #
(HasTrie (Basis a), HasCross2 v) => HasCross2 ((:>) a v) #
Methods cross2 :: (a :> v) -> a :> v #

class HasCross3 v where #

Cross product of various forms of 3D vectors

Minimal complete definition

Methods

cross3 :: v -> v -> v #

Instances

(HasBasis a, HasTrie (Basis a), VectorSpace v, HasCross3 v) => HasCross3 ((:>) a v) #
Methods cross3 :: (a :> v) -> (a :> v) -> a :> v #
Num s => HasCross3 (s, s, s) #
Methods cross3 :: (s, s, s) -> (s, s, s) -> (s, s, s) #