| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Clash.Primitives.Sized.Vector
Synopsis
- data FCall = FCall Identifier Identifier Identifier
- foldFunctionPlurality :: HasCallStack => Int -> Int
- foldBBF :: HasCallStack => BlackBoxFunction
- foldTF :: TemplateFunction
- foldTF' :: forall s. (HasCallStack, Backend s) => BlackBoxContext -> State s Doc
- indexIntVerilog :: BlackBoxFunction
- indexIntVerilogTF :: TemplateFunction
- indexIntVerilogTemplate :: Backend s => BlackBoxContext -> State s Doc
Documentation
Constructors
| FCall Identifier Identifier Identifier |
foldFunctionPlurality :: HasCallStack => Int -> Int Source #
Calculates the number of function calls needed for an evaluation of
fold, given the length of the vector given to fold.
foldTF :: TemplateFunction Source #
Type signature of function we're generating netlist for:
fold :: (a -> a -> a) -> Vec (n + 1) a -> a
The implementation promises to create a (balanced) tree structure.
foldTF' :: forall s. (HasCallStack, Backend s) => BlackBoxContext -> State s Doc Source #
indexIntVerilogTemplate :: Backend s => BlackBoxContext -> State s Doc Source #