| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Sound.Sc3.Server.Graphdef.Graph
Synopsis
- type Int_Map = IntMap Int
- type Encoding_Maps = (Int_Map, [U_Node], Int_Map, Int_Map, [(K_Type, Int)])
- mk_encoding_maps :: U_Graph -> Encoding_Maps
- uid_lookup :: Id -> Int_Map -> Int
- ktype_map_lookup :: K_Type -> [(K_Type, Int)] -> Int
- make_input :: Encoding_Maps -> From_Port -> Input
- make_control :: Encoding_Maps -> U_Node -> Control
- make_ugen :: Encoding_Maps -> U_Node -> Ugen
- graph_to_graphdef :: String -> U_Graph -> Graphdef
Maps
type Encoding_Maps = (Int_Map, [U_Node], Int_Map, Int_Map, [(K_Type, Int)]) Source #
(constants-map,controls,controls-map,ugen-map,ktype-map)
mk_encoding_maps :: U_Graph -> Encoding_Maps Source #
Generate Encoding_Maps translating node identifiers to synthdef indexes.
ktype_map_lookup :: K_Type -> [(K_Type, Int)] -> Int Source #
Lookup K_Type index from map (erroring variant of lookup).
Encoding
make_input :: Encoding_Maps -> From_Port -> Input Source #
Byte-encode From_Port primitive node.
make_control :: Encoding_Maps -> U_Node -> Control Source #
Byte-encode U_Node_K primitive node.