LLVM.Extra.Multi.Class

Documentation

class C value where

Associated Types

type Size value :: *

Methods

switch :: f T -> f (T (Size value)) -> f value

Instances

C T

Positive n => C (T n)

newtype Const a value

Constructors

Const

Fields

getConst :: value a

undef :: (C value, Size value ~ n, Positive n, C a) => value a

zero :: (C value, Size value ~ n, Positive n, C a) => value a

newtype Op0 r a value

Constructors

Op0

Fields

runOp0 :: CodeGenFunction r (value a)

newtype Op1 r a b value

Constructors

Op1

Fields

runOp1 :: value a -> CodeGenFunction r (value b)

newtype Op2 r a b c value

Constructors

Op2

Fields

runOp2 :: value a -> value b -> CodeGenFunction r (value c)

add :: (Positive n, Additive a, n ~ Size value, C value) => value a -> value a -> CodeGenFunction r (value a)

sub :: (Positive n, Additive a, n ~ Size value, C value) => value a -> value a -> CodeGenFunction r (value a)

neg :: (Positive n, Additive a, n ~ Size value, C value) => value a -> CodeGenFunction r (value a)

mul :: (Positive n, PseudoRing a, n ~ Size value, C value) => value a -> value a -> CodeGenFunction r (value a)

fdiv :: (Positive n, Field a, n ~ Size value, C value) => value a -> value a -> CodeGenFunction r (value a)

scale :: (Positive n, PseudoModule v, n ~ Size value, C value) => value (Scalar v) -> value v -> CodeGenFunction r (value v)

min :: (Positive n, Real a, n ~ Size value, C value) => value a -> value a -> CodeGenFunction r (value a)

max :: (Positive n, Real a, n ~ Size value, C value) => value a -> value a -> CodeGenFunction r (value a)

abs :: (Positive n, Real a, n ~ Size value, C value) => value a -> CodeGenFunction r (value a)

signum :: (Positive n, Real a, n ~ Size value, C value) => value a -> CodeGenFunction r (value a)

truncate :: (Positive n, Fraction a, n ~ Size value, C value) => value a -> CodeGenFunction r (value a)

fraction :: (Positive n, Fraction a, n ~ Size value, C value) => value a -> CodeGenFunction r (value a)

sqrt :: (Positive n, Algebraic a, n ~ Size value, C value) => value a -> CodeGenFunction r (value a)

pi :: (Positive n, Transcendental a, n ~ Size value, C value) => CodeGenFunction r (value a)

sin :: (Positive n, Transcendental a, n ~ Size value, C value) => value a -> CodeGenFunction r (value a)

log :: (Positive n, Transcendental a, n ~ Size value, C value) => value a -> CodeGenFunction r (value a)

exp :: (Positive n, Transcendental a, n ~ Size value, C value) => value a -> CodeGenFunction r (value a)

cos :: (Positive n, Transcendental a, n ~ Size value, C value) => value a -> CodeGenFunction r (value a)

pow :: (Positive n, Transcendental a, n ~ Size value, C value) => value a -> value a -> CodeGenFunction r (value a)

cmp :: (Positive n, Comparison a, n ~ Size value, C value) => CmpPredicate -> value a -> value a -> CodeGenFunction r (value Bool)

fcmp :: (Positive n, FloatingComparison a, n ~ Size value, C value) => FPPredicate -> value a -> value a -> CodeGenFunction r (value Bool)

and :: (Positive n, Logic a, n ~ Size value, C value) => value a -> value a -> CodeGenFunction r (value a)

xor :: (Positive n, Logic a, n ~ Size value, C value) => value a -> value a -> CodeGenFunction r (value a)

or :: (Positive n, Logic a, n ~ Size value, C value) => value a -> value a -> CodeGenFunction r (value a)

inv :: (Positive n, Logic a, n ~ Size value, C value) => value a -> CodeGenFunction r (value a)