Safe Haskell | None |
---|
- find_node :: Graph -> NodeId -> Maybe Node
- is_implicit_control :: Node -> Bool
- node_label :: Node -> String
- port_idx_or_zero :: FromPort -> PortIndex
- is_node_c :: Node -> Bool
- is_node_k :: Node -> Bool
- is_node_u :: Node -> Bool
- edges :: [Node] -> [Edge]
- as_from_port :: Node -> FromPort
- from_port_node :: Graph -> FromPort -> Maybe Node
- empty_graph :: Graph
- graph_maximum_id :: Graph -> NodeId
- node_k_cmp :: Node -> Node -> Ordering
- ktype :: Rate -> Bool -> KType
- remove_implicit :: Graph -> Graph
- add_implicit :: Graph -> Graph
- find_c_p :: Double -> Node -> Bool
- push_c :: Double -> Graph -> (Node, Graph)
- mk_node_c :: Constant -> Graph -> (Node, Graph)
- find_k_p :: String -> Node -> Bool
- push_k :: (Rate, String, Double, Bool) -> Graph -> (Node, Graph)
- mk_node_k :: Control -> Graph -> (Node, Graph)
- type UGenParts = (Rate, String, [FromPort], [Output], Special, UGenId)
- find_u_p :: UGenParts -> Node -> Bool
- push_u :: UGenParts -> Graph -> (Node, Graph)
- mk_node_u_acc :: [UGen] -> [Node] -> Graph -> ([Node], Graph)
- mk_node_u :: Primitive -> Graph -> (Node, Graph)
- mk_node_p :: Node -> PortIndex -> Graph -> (Node, Graph)
- mk_node :: UGen -> Graph -> (Node, Graph)
- type Map = IntMap Int
- type Maps = (Map, [Node], Map, Map, [(KType, Int)])
- data Input = Input Int Int
- node_ktype :: Node -> Maybe KType
- mk_ktype_map :: [Node] -> [(KType, Int)]
- ktype_map_lookup :: KType -> [(KType, Int)] -> Int
- mk_maps :: Graph -> Maps
- fetch :: NodeId -> Map -> Int
- fetch_k :: NodeId -> KType -> [Node] -> Int
- make_input :: Maps -> FromPort -> Input
- encode_input :: Input -> ByteString
- encode_node_k :: Maps -> Node -> ByteString
- encode_node_u :: Maps -> Node -> ByteString
- encode_graphdef :: Graph -> ByteString
- type KS_COUNT = (Int, Int, Int, Int)
- ks_count :: [Node] -> KS_COUNT
- mk_implicit :: [Node] -> [Node]
- prepare_root :: UGen -> UGen
Documentation
is_implicit_control :: Node -> BoolSource
Is Node
an implicit control UGen?
port_idx_or_zero :: FromPort -> PortIndexSource
Get port_idx
for FromPort_U
, else 0
.
The empty Graph
.
node_k_cmp :: Node -> Node -> OrderingSource
Compare NodeK
values on
node_k_type
.
remove_implicit :: Graph -> GraphSource
Remove implicit control UGens from Graph
add_implicit :: Graph -> GraphSource
Add implicit control UGens to Graph
.
find_c_p :: Double -> Node -> BoolSource
Predicate to determine if Node
is a constant with indicated value.
find_k_p :: String -> Node -> BoolSource
Predicate to determine if Node
is a control with indicated
name. Names must be unique.
push_k :: (Rate, String, Double, Bool) -> Graph -> (Node, Graph)Source
Insert a control node into the Graph
.
mk_node_p :: Node -> PortIndex -> Graph -> (Node, Graph)Source
Proxies do not get stored in the graph.
fetch_k :: NodeId -> KType -> [Node] -> IntSource
Controls are a special case. We need to know not the overall index but the index in relation to controls of the same type.
encode_input :: Input -> ByteStringSource
Byte-encode Input
value.
encode_node_k :: Maps -> Node -> ByteStringSource
Byte-encode NodeK
control node.
encode_node_u :: Maps -> Node -> ByteStringSource
Byte-encode NodeU
primitive node.
encode_graphdef :: Graph -> ByteStringSource
Construct instrument definition bytecode.
mk_implicit :: [Node] -> [Node]Source
Construct implicit control unit generator Nodes
. Unit
generators are only constructed for instances of control types that
are present.
prepare_root :: UGen -> UGenSource
Transform mce nodes to mrg nodes