Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Transformations over Graph
structure.
Synopsis
- constant_to_control :: Id -> U_Node -> (Id, U_Node)
- c_lift_from_port :: U_Graph -> Id -> From_Port -> (Id, Either From_Port U_Node)
- c_lift_inputs :: U_Graph -> Id -> [From_Port] -> (Id, [From_Port], [U_Node])
- c_lift_ugen :: U_Graph -> Id -> U_Node -> (Id, U_Node, [U_Node])
- c_lift_ugens :: U_Graph -> Id -> [U_Node] -> (Id, [U_Node], [U_Node])
- lift_constants :: U_Graph -> U_Graph
Lift constants
c_lift_ugen :: U_Graph -> Id -> U_Node -> (Id, U_Node, [U_Node]) Source #
Lift inputs at U_Node_U
as required.
c_lift_ugens :: U_Graph -> Id -> [U_Node] -> (Id, [U_Node], [U_Node]) Source #
c_lift_ugen
at list of U_Node_U
.
lift_constants :: U_Graph -> U_Graph Source #
Lift constants to controls.
import Sound.Sc3 {\- hsc3 -\} import Sound.Sc3.Ugen.Dot {\- hsc3-dot -\}
let u = out 0 (sinOsc AR 440 0 * 0.1) let g = ugen_to_graph u draw g draw (lift_constants g)