Data.Array.Knead.Symbolic

Documentation

data Array sh a

Instances

C Array

Defined in Data.Array.Knead.Symbolic.Private

Methods

lift0 :: Array sh a -> Array sh a

lift1 :: (Array sha a -> Array shb b) -> Array sha a -> Array shb b

lift2 :: (Array sha a -> Array shb b -> Array shc c) -> Array sha a -> Array shb b -> Array shc c

class C array where

This class allows to implement functions without parameters for both simple and parameterized arrays.

Methods

lift0 :: Array sh a -> array sh a

lift1 :: (Array sha a -> Array shb b) -> array sha a -> array shb b

lift2 :: (Array sha a -> Array shb b -> Array shc c) -> array sha a -> array shb b -> array shc c

Instances

C Array

Defined in Data.Array.Knead.Symbolic.Private

Methods

lift0 :: Array sh a -> Array sh a

lift1 :: (Array sha a -> Array shb b) -> Array sha a -> Array shb b

lift2 :: (Array sha a -> Array shb b -> Array shc c) -> Array sha a -> Array shb b -> Array shc c

data Exp a

Instances

Value Exp

Defined in LLVM.DSL.Expression

Methods

lift0 :: T a -> Exp a

lift1 :: (T a -> T b) -> Exp a -> Exp b

lift2 :: (T a -> T b -> T c) -> Exp a -> Exp b -> Exp c

(Transcendental a, Real a, RationalConstant a) => Floating (Exp a)

Defined in LLVM.DSL.Expression

Methods

pi :: Exp a

exp :: Exp a -> Exp a

log :: Exp a -> Exp a

sqrt :: Exp a -> Exp a

(**) :: Exp a -> Exp a -> Exp a

logBase :: Exp a -> Exp a -> Exp a

sin :: Exp a -> Exp a

cos :: Exp a -> Exp a

tan :: Exp a -> Exp a

asin :: Exp a -> Exp a

acos :: Exp a -> Exp a

atan :: Exp a -> Exp a

sinh :: Exp a -> Exp a

cosh :: Exp a -> Exp a

tanh :: Exp a -> Exp a

asinh :: Exp a -> Exp a

acosh :: Exp a -> Exp a

atanh :: Exp a -> Exp a

log1p :: Exp a -> Exp a

expm1 :: Exp a -> Exp a

log1pexp :: Exp a -> Exp a

log1mexp :: Exp a -> Exp a

(PseudoRing a, Real a, IntegerConstant a) => Num (Exp a)

Defined in LLVM.DSL.Expression

Methods

(+) :: Exp a -> Exp a -> Exp a

(-) :: Exp a -> Exp a -> Exp a

(*) :: Exp a -> Exp a -> Exp a

negate :: Exp a -> Exp a

abs :: Exp a -> Exp a

signum :: Exp a -> Exp a

fromInteger :: Integer -> Exp a

(Field a, Real a, RationalConstant a) => Fractional (Exp a)

Defined in LLVM.DSL.Expression

Methods

(/) :: Exp a -> Exp a -> Exp a

recip :: Exp a -> Exp a

fromRational :: Rational -> Exp a

Compose (Exp a)

Defined in LLVM.DSL.Expression

Associated Types

type Composed (Exp a)

Methods

compose :: Exp a -> Exp (Composed (Exp a))

(Real a, PseudoRing a, IntegerConstant a) => C (Exp a)

Defined in LLVM.DSL.Expression

Methods

abs :: Exp a -> Exp a

signum :: Exp a -> Exp a

Additive a => C (Exp a)

We do not require a numeric prelude superclass, thus also LLVM only types like vectors are instances.

Defined in LLVM.DSL.Expression

Methods

zero :: Exp a

(+) :: Exp a -> Exp a -> Exp a

(-) :: Exp a -> Exp a -> Exp a

negate :: Exp a -> Exp a

(Transcendental a, RationalConstant a) => C (Exp a)

Defined in LLVM.DSL.Expression

Methods

sqrt :: Exp a -> Exp a

root :: Integer -> Exp a -> Exp a

(^/) :: Exp a -> Rational -> Exp a

(Field a, RationalConstant a) => C (Exp a)

Defined in LLVM.DSL.Expression

Methods

(/) :: Exp a -> Exp a -> Exp a

recip :: Exp a -> Exp a

fromRational' :: Rational -> Exp a

(^-) :: Exp a -> Integer -> Exp a

(PseudoRing a, IntegerConstant a) => C (Exp a)

Defined in LLVM.DSL.Expression

Methods

(*) :: Exp a -> Exp a -> Exp a

one :: Exp a

fromInteger :: Integer -> Exp a

(^) :: Exp a -> Integer -> Exp a

(Transcendental a, RationalConstant a) => C (Exp a)

Defined in LLVM.DSL.Expression

Methods

pi :: Exp a

exp :: Exp a -> Exp a

log :: Exp a -> Exp a

logBase :: Exp a -> Exp a -> Exp a

(**) :: Exp a -> Exp a -> Exp a

sin :: Exp a -> Exp a

cos :: Exp a -> Exp a

tan :: Exp a -> Exp a

asin :: Exp a -> Exp a

acos :: Exp a -> Exp a

atan :: Exp a -> Exp a

sinh :: Exp a -> Exp a

cosh :: Exp a -> Exp a

tanh :: Exp a -> Exp a

asinh :: Exp a -> Exp a

acosh :: Exp a -> Exp a

atanh :: Exp a -> Exp a

Aggregate (Exp a) (T a)

Defined in LLVM.DSL.Expression

Associated Types

type MultiValuesOf (Exp a)

type ExpressionsOf (T a)

Methods

bundle :: Exp a -> CodeGenFunction r (T a)

dissect :: T a -> Exp a

(a ~ Scalar v, PseudoModule v, IntegerConstant a) => C (Exp a) (Exp v)

Defined in LLVM.DSL.Expression

Methods

(*>) :: Exp a -> Exp v -> Exp v

type Composed (Exp a)

Defined in LLVM.DSL.Expression

type Composed (Exp a) = a

type MultiValuesOf (Exp a)

Defined in LLVM.DSL.Expression

type MultiValuesOf (Exp a) = T a

fix :: Id (Array sh a)

shape :: Array sh a -> Exp sh

(!) :: (C sh, Index sh ~ ix) => Array sh a -> Exp ix -> Exp a

the :: Scalar sh => Array sh a -> Exp a

fromScalar :: Scalar sh => Exp a -> Array sh a

fill :: Exp sh -> Exp a -> Array sh a

gather :: (C array, C sh0, Index sh0 ~ ix0, C sh1, Index sh1 ~ ix1, C a) => array sh1 ix0 -> array sh0 a -> array sh1 a

backpermute :: (C sh0, Index sh0 ~ ix0, C sh1, Index sh1 ~ ix1, C a) => Exp sh1 -> (Exp ix1 -> Exp ix0) -> Array sh0 a -> Array sh1 a

backpermute2 :: (C array, C sh0, Index sh0 ~ ix0, C sh1, Index sh1 ~ ix1, C sh, Index sh ~ ix) => Exp sh -> (Exp ix -> Exp ix0) -> (Exp ix -> Exp ix1) -> (Exp a -> Exp b -> Exp c) -> array sh0 a -> array sh1 b -> array sh c

id :: (C array, C sh, Index sh ~ ix) => Exp sh -> array sh ix

map :: (C array, C sh) => (Exp a -> Exp b) -> array sh a -> array sh b

mapWithIndex :: (C array, C sh, Index sh ~ ix) => (Exp ix -> Exp a -> Exp b) -> array sh a -> array sh b

zipWith :: (C array, C sh) => (Exp a -> Exp b -> Exp c) -> array sh a -> array sh b -> array sh c

zipWith3 :: (C array, C sh) => (Exp a -> Exp b -> Exp c -> Exp d) -> array sh a -> array sh b -> array sh c -> array sh d

zipWith4 :: (C array, C sh) => (Exp a -> Exp b -> Exp c -> Exp d -> Exp e) -> array sh a -> array sh b -> array sh c -> array sh d -> array sh e

zip :: (C array, C sh) => array sh a -> array sh b -> array sh (a, b)

zip3 :: (C array, C sh) => array sh a -> array sh b -> array sh c -> array sh (a, b, c)

zip4 :: (C array, C sh) => array sh a -> array sh b -> array sh c -> array sh d -> array sh (a, b, c, d)

fold1 :: (C array, C sh0, C sh1, C a) => (Exp a -> Exp a -> Exp a) -> array (sh0, sh1) a -> array sh0 a

fold1All :: (C sh, C a) => (Exp a -> Exp a -> Exp a) -> Array sh a -> Exp a

findAll :: (C sh, C a) => (Exp a -> Exp Bool) -> Array sh a -> Exp (Maybe a)

In principle this can be implemented using fold1All but it has a short-cut semantics. All means that it scans all dimensions but it does not mean that it finds all occurrences. If you want to get the index of the found element, please decorate the array elements with their indices before calling findAll.