Feldspar.Core.Functions

Primitive and helper functions supported by Feldspar

Misc.

noSizeProp :: a -> ()

noSizeProp2 :: a -> b -> ()

class (Eq a, Storable a) => Eq a where

Methods

(==) :: Data a -> Data a -> Data Bool

(/=) :: Data a -> Data a -> Data Bool

Instances

Eq Bool

Eq Float

Eq Int

Eq ()

Eq Signed8

Eq Unsigned8

Eq Signed16

Eq Unsigned16

Eq Signed32

Eq Unsigned32

optEq :: (Storable a, Size a ~ Range b, Ord b, Num b) => Data a -> Data a -> Data Bool

optNeq :: (Storable a, Size a ~ Range b, Ord b, Num b) => Data a -> Data a -> Data Bool

class (Ord a, Eq a, Storable a) => Ord a where

Methods

(<) :: Data a -> Data a -> Data Bool

(>) :: Data a -> Data a -> Data Bool

(<=) :: Data a -> Data a -> Data Bool

(>=) :: Data a -> Data a -> Data Bool

min :: Data a -> Data a -> Data a

max :: Data a -> Data a -> Data a

Instances

Ord Float

Ord Int

Ord Signed8

Ord Unsigned8

Ord Signed16

Ord Unsigned16

Ord Signed32

Ord Unsigned32

optLT :: (Storable a, Ord a, Size a ~ Range b, Ord b, Num b) => Data a -> Data a -> Data Bool

optGT :: (Storable a, Ord a, Size a ~ Range b, Ord b, Num b) => Data a -> Data a -> Data Bool

optLTE :: (Storable a, Ord a, Size a ~ Range b, Ord b, Num b) => Data a -> Data a -> Data Bool

optGTE :: (Storable a, Ord a, Size a ~ Range b, Ord b, Num b) => Data a -> Data a -> Data Bool

optMin :: (Ord a, Size a ~ Range b, Ord b, Num b) => Data a -> Data a -> Data a

optMax :: (Ord a, Size a ~ Range b, Ord b, Num b) => Data a -> Data a -> Data a

not :: Data Bool -> Data Bool

(?) :: Computable a => Data Bool -> (a, a) -> a

Selects the elements of the pair depending on the condition

(&&) :: Data Bool -> Data Bool -> Data Bool

(||) :: Data Bool -> Data Bool -> Data Bool

(&&*) :: Computable a => (a -> Data Bool) -> (a -> Data Bool) -> a -> Data Bool

Lazy conjunction, second argument only run if necessary

(||*) :: Computable a => (a -> Data Bool) -> (a -> Data Bool) -> a -> Data Bool

Lazy disjunction, second argument only run if necessary

class (Numeric a, Integral a, Ord a, Storable a) => Integral a where

Methods

quot :: Data a -> Data a -> Data a

rem :: Data a -> Data a -> Data a

div :: Data a -> Data a -> Data a

mod :: Data a -> Data a -> Data a

(^) :: Data a -> Data a -> Data a

Instances

Integral Int

Integral Signed8

Integral Unsigned8

Integral Signed16

Integral Unsigned16

Integral Signed32

Integral Unsigned32

optRem :: (Integral a, Size a ~ Range b, Ord b, Num b, Enum b) => Data a -> Data a -> Data a

optMod :: (Integral a, Size a ~ Range b, Ord b, Num b, Enum b) => Data a -> Data a -> Data a

optSignedExp :: (Integral a, Bits a, Storable a, Size a ~ Range b, Ord b, Num b) => Data a -> Data a -> Data a

optExp :: (Integral a, Storable a) => Data a -> Data a -> Data a

Loops

for :: Computable a => Data Int -> Data Int -> a -> (Data Int -> a -> a) -> a

For-loop

for start end init body:

• start/end are the start/end indexes.
• init is the starting state.
• body computes the next state given the current loop index (ranging over [start .. end]) and the current state.

unfoldCore :: (Computable state, Storable a) => Data Length -> state -> (Data Int -> state -> (Data a, state)) -> (Data [a], state)

A sequential "unfolding" of an vector

unfoldCore l init step:

• l is the length of the resulting vector.
• init is the initial state.
• step is a function computing a new element and the next state from the current index and current state. The index is the position of the new element in the output vector.

class (Num a, Storable a) => Numeric a where

Methods

fromIntegerNum :: Integer -> Data a

absNum :: Data a -> Data a

signumNum :: Data a -> Data a

addNum :: Data a -> Data a -> Data a

subNum :: Data a -> Data a -> Data a

mulNum :: Data a -> Data a -> Data a

Instances

Numeric Float

Numeric Int

Numeric Signed8

Numeric Unsigned8

Numeric Signed16

Numeric Unsigned16

Numeric Signed32

Numeric Unsigned32

absNum' :: (Numeric a, Num (Size a)) => Data a -> Data a

optAbs :: (Numeric a, Size a ~ Range b, Num b, Ord b) => Data a -> Data a

signumNum' :: (Numeric a, Num (Size a)) => Data a -> Data a

optSignum :: (Numeric a, Size a ~ Range b, Num b, Ord b) => Data a -> Data a

optAdd :: (Numeric a, Num (Size a)) => Data a -> Data a -> Data a

optSub :: (Numeric a, Num (Size a)) => Data a -> Data a -> Data a

optMul :: (Numeric a, Num (Size a)) => Data a -> Data a -> Data a

class (Fractional a, Storable a) => Fractional' a where

Methods

fromRationalFrac :: Rational -> Data a

divFrac :: Data a -> Data a -> Data a

Instances

Fractional' Float

Bit manipulation

class (Bits a, Storable a) => Bits a where

The following class provides functions for bit level manipulation

Methods

(.&.) :: Data a -> Data a -> Data a

(.|.) :: Data a -> Data a -> Data a

xor :: Data a -> Data a -> Data a

(⊕) :: Data a -> Data a -> Data a

complement :: Data a -> Data a

bit :: Data Int -> Data a

setBit :: Data a -> Data Int -> Data a

clearBit :: Data a -> Data Int -> Data a

complementBit :: Data a -> Data Int -> Data a

testBit :: Data a -> Data Int -> Data Bool

shiftL :: Data a -> Data Int -> Data a

(<<) :: Data a -> Data Int -> Data a

shiftR :: Data a -> Data Int -> Data a

(>>) :: Data a -> Data Int -> Data a

rotateL :: Data a -> Data Int -> Data a

rotateR :: Data a -> Data Int -> Data a

reverseBits :: Data a -> Data a

bitScan :: Data a -> Data Int

Returns the number of leading zeroes for unsigned types. For signed types it returns the number of unnecessary sign bits

bitCount :: Data a -> Data Int

bitSize :: Data a -> Data Int

isSigned :: Data a -> Data Bool

Instances

Bits Int

Bits Signed8

Bits Unsigned8

Bits Signed16

Bits Unsigned16

Bits Signed32

Bits Unsigned32

optAnd :: (Bits a, Storable a) => Data a -> Data a -> Data a

optOr :: (Bits a, Storable a) => Data a -> Data a -> Data a

optXor :: (Bits a, Bits a, Storable a) => Data a -> Data a -> Data a

allOnes :: (Eq a, Bits a) => a -> Bool

optZero :: (a -> Data Int -> a) -> a -> Data Int -> a

scanLeft :: Bits b => b -> Int

countBits :: Bits b => b -> Int

revBits :: Bits b => b -> b