Documentation

Create a vector of supplied elements

Append elements to the supplied vector

Create let-bindings with case-statements that select elements out of a vector. Returns both the variables to which element-selections are bound and the let-bindings

Create let-bindings with case-statements that select elements out of a tree. Returns both the variables to which element-selections are bound and the let-bindings

Create a vector of supplied elements

Determine whether a type is isomorphic to Clash.Signal.Internal.Signal

It is i.e.:

• Signal clk a
• (Signal clk a, Signal clk b)
• Vec n (Signal clk a)
• data Wrap = W (Signal clk' Int)
• etc.

This also includes BiSignals, i.e.:

• BiSignalIn High System Int
• etc.

Determines whether given type is an (alias of en) Enable line.

Determines whether given type is an (alias of en) Clock or Reset line

Same as dataConInstArgTys, but it tries to compute existentials too, hence the extra argument TyConMap. WARNING: It will return the types of non-existentials only

Given a DataCon and a list of types, the type variables of the DataCon type are substituted for the list of types. The argument types are returned.

The list of types should be equal to the number of type variables, otherwise Nothing is returned.

Make a coercion

Make an undefined term

Try to reduce an arbitrary type to a literal type (Symbol or Nat), and subsequently extract its String representation

Determine whether we should split away types from a product type, i.e. clocks should always be separate arguments, and not part of a product.

Worker of shouldSplit, works on TypeView instead of Type

Potentially split apart a list of function argument types. e.g. given:

[Int,(Clock,(Reset,Bool)),Char]

we return

[Int,Clock,Reset,Bool,Char]

But we would leave

[Int, (Bool,Int), Char]

unchanged.

Strip implicit parameter wrappers (IP)

Do an inverse topological sorting of the let-bindings in a let-expression

Group let-bindings into cyclic groups and acyclic individual bindings