Futhark.Util.IntegralExp

It is occasionally useful to define generic functions that can not only compute their result as an integer, but also as a symbolic expression in the form of an AST.

There are some Haskell hacks for this - it is for example not hard to define an instance of Num that constructs an AST. However, this falls down for some other interesting classes, like Integral, which requires both the problematic method fromInteger, and also that the type is an instance of Enum.

We can always just define hobbled instances that call error for those methods that are impractical, but this is ugly.

Hence, this module defines similes to standard Haskell numeric typeclasses that have been modified to make generic functions slightly easier to write.

Documentation

class Num e => IntegralExp e where

Methods

quot :: e -> e -> e

rem :: e -> e -> e

div :: e -> e -> e

mod :: e -> e -> e

sgn :: e -> Maybe Int

fromInt8 :: Int8 -> e

fromInt16 :: Int16 -> e

fromInt32 :: Int32 -> e

fromInt64 :: Int64 -> e

Instances

Integral a => IntegralExp (Wrapped a)

Defined in Futhark.Util.IntegralExp

Methods

quot :: Wrapped a -> Wrapped a -> Wrapped a

rem :: Wrapped a -> Wrapped a -> Wrapped a

div :: Wrapped a -> Wrapped a -> Wrapped a

mod :: Wrapped a -> Wrapped a -> Wrapped a

sgn :: Wrapped a -> Maybe Int

fromInt8 :: Int8 -> Wrapped a

fromInt16 :: Int16 -> Wrapped a

fromInt32 :: Int32 -> Wrapped a

fromInt64 :: Int64 -> Wrapped a

Pretty v => IntegralExp (PrimExp v)

Defined in Futhark.Analysis.PrimExp

Methods

quot :: PrimExp v -> PrimExp v -> PrimExp v

rem :: PrimExp v -> PrimExp v -> PrimExp v

div :: PrimExp v -> PrimExp v -> PrimExp v

mod :: PrimExp v -> PrimExp v -> PrimExp v

sgn :: PrimExp v -> Maybe Int

fromInt8 :: Int8 -> PrimExp v

fromInt16 :: Int16 -> PrimExp v

fromInt32 :: Int32 -> PrimExp v

fromInt64 :: Int64 -> PrimExp v

IntegralExp (Count u)

Defined in Futhark.CodeGen.ImpCode

Methods

quot :: Count u -> Count u -> Count u

rem :: Count u -> Count u -> Count u

div :: Count u -> Count u -> Count u

mod :: Count u -> Count u -> Count u

sgn :: Count u -> Maybe Int

fromInt8 :: Int8 -> Count u

fromInt16 :: Int16 -> Count u

fromInt32 :: Int32 -> Count u

fromInt64 :: Int64 -> Count u

newtype Wrapped a

This wrapper allows you to use a type that is an instance of the true class whenever the simile class is required.

Constructors

Wrapped

Fields

• wrappedValue :: a

Instances

Eq a => Eq (Wrapped a)

Defined in Futhark.Util.IntegralExp

Methods

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

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

Num a => Num (Wrapped a)

Defined in Futhark.Util.IntegralExp

Methods

(+) :: Wrapped a -> Wrapped a -> Wrapped a

(-) :: Wrapped a -> Wrapped a -> Wrapped a

(*) :: Wrapped a -> Wrapped a -> Wrapped a

negate :: Wrapped a -> Wrapped a

abs :: Wrapped a -> Wrapped a

signum :: Wrapped a -> Wrapped a

fromInteger :: Integer -> Wrapped a

Ord a => Ord (Wrapped a)

Defined in Futhark.Util.IntegralExp

Methods

compare :: Wrapped a -> Wrapped a -> Ordering

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

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

(>) :: Wrapped a -> Wrapped a -> Bool

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

max :: Wrapped a -> Wrapped a -> Wrapped a

min :: Wrapped a -> Wrapped a -> Wrapped a

Show a => Show (Wrapped a)

Defined in Futhark.Util.IntegralExp

Methods

showsPrec :: Int -> Wrapped a -> ShowS

show :: Wrapped a -> String

showList :: [Wrapped a] -> ShowS

Integral a => IntegralExp (Wrapped a)

Defined in Futhark.Util.IntegralExp

Methods

quot :: Wrapped a -> Wrapped a -> Wrapped a

rem :: Wrapped a -> Wrapped a -> Wrapped a

div :: Wrapped a -> Wrapped a -> Wrapped a

mod :: Wrapped a -> Wrapped a -> Wrapped a

sgn :: Wrapped a -> Maybe Int

fromInt8 :: Int8 -> Wrapped a

fromInt16 :: Int16 -> Wrapped a

fromInt32 :: Int32 -> Wrapped a

fromInt64 :: Int64 -> Wrapped a

quotRoundingUp :: IntegralExp num => num -> num -> num

Like IntegralExp, but rounds up.