DDC.Core.Flow.Transform.Rates.Combinators

Converting DDC expressions to and from Combinator Normal Form.

Documentation

data Fun s a

Worker function. May only reference scalars in the environment, not arrays. Takes the expression of the function, and a list of the free scalars that are referenced inside it. The expression must be a function from scalar to scalar.

Constructors

Fun ExpF [s]

Instances

Show s => Show (Fun s a)

Methods

showsPrec :: Int -> Fun s a -> ShowS

show :: Fun s a -> String

showList :: [Fun s a] -> ShowS

Pretty s => Pretty (Fun s a)

Associated Types

data PrettyMode (Fun s a) :: *

Methods

pprDefaultMode :: PrettyMode (Fun s a)

ppr :: Fun s a -> Doc

pprPrec :: Int -> Fun s a -> Doc

pprModePrec :: PrettyMode (Fun s a) -> Int -> Fun s a -> Doc

data Bind s a

Array, scalar and external bindings. Array bindings are those whose value is an array, such as map, filter. Scalar bindings have scalar values, currently only fold. External expressions are those that cannot be converted to primitive combinators. The they take a single expression that computes all outputs, with the list of free scalar and array inputs.

Constructors

ABind a (ABind s a)

SBind s (SBind s a)

Ext

Fields

• _beOut :: CName s a
• _beExp :: ExpF
• _beIns :: ([s], [a])

Instances

(Show s, Show a) => Show (Bind s a)

Methods

showsPrec :: Int -> Bind s a -> ShowS

show :: Bind s a -> String

showList :: [Bind s a] -> ShowS

(Pretty s, Pretty a) => Pretty (Bind s a)

Associated Types

data PrettyMode (Bind s a) :: *

Methods

pprDefaultMode :: PrettyMode (Bind s a)

ppr :: Bind s a -> Doc

pprPrec :: Int -> Bind s a -> Doc

pprModePrec :: PrettyMode (Bind s a) -> Int -> Bind s a -> Doc

data ABind s a

An array-valued binding.

Constructors

MapN (Fun s a) [a]

map_n :: (a_1 ... a_n -> b) -> Array a_1 ... Array a_n -> Array b

Filter (Fun s a) a

filter :: (a -> Bool) -> Array a -> Array a

Generate (Scalar s a) (Fun s a)

generate :: Nat -> (Nat -> a) -> Array a

Gather a a

gather :: Array a -> Array Nat -> Array a

Cross a a

cross :: Array a -> Array b -> Array (a, b)

Instances

(Show s, Show a) => Show (ABind s a)

Methods

showsPrec :: Int -> ABind s a -> ShowS

show :: ABind s a -> String

showList :: [ABind s a] -> ShowS

data SBind s a

A scalar-valued binding

Constructors

Fold (Fun s a) (Scalar s a) a

fold :: (a -> a -> a) -> a -> Array a -> a

Instances

(Show s, Show a) => Show (SBind s a)

Methods

showsPrec :: Int -> SBind s a -> ShowS

show :: SBind s a -> String

showList :: [SBind s a] -> ShowS

data Scalar s a

Scalars can either be a literal such as "0", or a named scalar reference. If it's not a named scalar reference, we need to keep the expression so we can reconstruct it later. (We do not have array literals, so this is only necessary for scalars)

Constructors

Scalar ExpF (Maybe s)

Instances

Show s => Show (Scalar s a)

Methods

showsPrec :: Int -> Scalar s a -> ShowS

show :: Scalar s a -> String

showList :: [Scalar s a] -> ShowS

Pretty s => Pretty (Scalar s a)

Associated Types

data PrettyMode (Scalar s a) :: *

Methods

pprDefaultMode :: PrettyMode (Scalar s a)

ppr :: Scalar s a -> Doc

pprPrec :: Int -> Scalar s a -> Doc

pprModePrec :: PrettyMode (Scalar s a) -> Int -> Scalar s a -> Doc

data Program s a

An entire program/function to find a fusion clustering for

Constructors

Program

Fields

• _ins :: ([s], [a])
• _binds :: [Bind s a]
• _outs :: ([s], [a])

Instances

(Show s, Show a) => Show (Program s a)

Methods

showsPrec :: Int -> Program s a -> ShowS

show :: Program s a -> String

showList :: [Program s a] -> ShowS

(Pretty s, Pretty a) => Pretty (Program s a)

Associated Types

data PrettyMode (Program s a) :: *

Methods

pprDefaultMode :: PrettyMode (Program s a)

ppr :: Program s a -> Doc

pprPrec :: Int -> Program s a -> Doc

pprModePrec :: PrettyMode (Program s a) -> Int -> Program s a -> Doc

data CName s a

Name of a combinator. This will also be the name of the corresponding node of the graph.

Constructors

NameScalar s

NameArray a

Instances

(Eq s, Eq a) => Eq (CName s a)

Methods

(==) :: CName s a -> CName s a -> Bool

(/=) :: CName s a -> CName s a -> Bool

(Ord s, Ord a) => Ord (CName s a)

Methods

compare :: CName s a -> CName s a -> Ordering

(<) :: CName s a -> CName s a -> Bool

(<=) :: CName s a -> CName s a -> Bool

(>) :: CName s a -> CName s a -> Bool

(>=) :: CName s a -> CName s a -> Bool

max :: CName s a -> CName s a -> CName s a

min :: CName s a -> CName s a -> CName s a

(Show s, Show a) => Show (CName s a)

Methods

showsPrec :: Int -> CName s a -> ShowS

show :: CName s a -> String

showList :: [CName s a] -> ShowS

(Pretty s, Pretty a) => Pretty (CName s a)

Associated Types

data PrettyMode (CName s a) :: *

Methods

pprDefaultMode :: PrettyMode (CName s a)

ppr :: CName s a -> Doc

pprPrec :: Int -> CName s a -> Doc

pprModePrec :: PrettyMode (CName s a) -> Int -> CName s a -> Doc

lookupA :: Eq a => Program s a -> a -> Maybe (ABind s a)

lookupS :: Eq s => Program s a -> s -> Maybe (SBind s a)

lookupB :: (Eq s, Eq a) => Program s a -> CName s a -> Maybe (Bind s a)

envOfBind :: Bind s a -> ([s], [a])

freeOfBind :: Bind s a -> [CName s a]

cnameOfBind :: Bind s a -> CName s a

outputsOfCluster :: (Eq s, Eq a) => Program s a -> [CName s a] -> [CName s a]

For a given program and list of nodes that will be clustered together, find a list of the nodes that are used afterwards. Only these nodes must be made manifest. The output nodes is a subset of the input cluster nodes.

inputsOfCluster :: (Eq s, Eq a) => Program s a -> [CName s a] -> [CName s a]

For a given program and list of nodes that will be clustered together, find a list of the nodes that are used as inputs. The input nodes will not mention any of the cluster nodes.

seriesInputsOfCluster :: (Eq s, Eq a) => Program s a -> [CName s a] -> [a]

For a given program and list of nodes that will be clustered together, find a list of the inputs that need to be converted to series. If the cluster is correct, these should all be the same size.