Sound.SC3.Server.Synthdef.Internal

Documentation

find_node :: Graph -> NodeId -> Maybe Node

Find Node with indicated NodeId.

is_implicit_control :: Node -> Bool

Is Node an implicit control UGen?

node_label :: Node -> String

Generate a label for Node using the type and the node_id.

port_idx_or_zero :: FromPort -> PortIndex

Get port_idx for FromPort_U, else 0.

is_node_c :: Node -> Bool

Is Node a constant.

is_node_k :: Node -> Bool

Is Node a control.

is_node_u :: Node -> Bool

Is Node a UGen.

edges :: [Node] -> [Edge]

Calculate all edges given a set of NodeU.

as_from_port :: Node -> FromPort

Transform Node to FromPort.

from_port_node :: Graph -> FromPort -> Maybe Node

Locate Node of FromPort in Graph.

empty_graph :: Graph

The empty Graph.

graph_maximum_id :: Graph -> NodeId

Find the maximum NodeId used at Graph (this ought normally be the nextId).

node_k_cmp :: Node -> Node -> Ordering

Compare NodeK values on node_k_type.

ktype :: Rate -> Bool -> KType

Determine class of control given Rate and trigger status.

remove_implicit :: Graph -> Graph

Remove implicit control UGens from Graph

add_implicit :: Graph -> Graph

Add implicit control UGens to Graph.

find_c_p :: Float -> Node -> Bool

Predicate to determine if Node is a constant with indicated value.

push_c :: Float -> Graph -> (Node, Graph)

Insert a constant Node into the Graph.

mk_node_c :: Constant -> Graph -> (Node, Graph)

Either find existing Constant Node, or insert a new Node.

find_k_p :: String -> Node -> Bool

Predicate to determine if Node is a control with indicated name. Names must be unique.

push_k :: (Rate, String, Float, Bool) -> Graph -> (Node, Graph)

Insert a control node into the Graph.

mk_node_k :: Control -> Graph -> (Node, Graph)

Either find existing Control Node, or insert a new Node.

type UGenParts = (Rate, String, [FromPort], [Output], Special, UGenId)

find_u_p :: UGenParts -> Node -> Bool

Predicate to locate primitive, names must be unique.

push_u :: UGenParts -> Graph -> (Node, Graph)

Insert a primitive NodeU into the Graph.

mk_node_u_acc :: [UGen] -> [Node] -> Graph -> ([Node], Graph)

mk_node_u :: Primitive -> Graph -> (Node, Graph)

Either find existing Primitive node, or insert a new Node.

mk_node_p :: Node -> PortIndex -> Graph -> (Node, Graph)

Proxies do not get stored in the graph.

mk_node :: UGen -> Graph -> (Node, Graph)

type Map = IntMap Int

type Maps = (Map, [Node], Map, Map, [(KType, Int)])

data Input

Constructors

Input Int Int

Instances

Eq Input

Show Input

node_ktype :: Node -> Maybe KType

Determine KType of a control UGen at NodeU, or not.

mk_ktype_map :: [Node] -> [(KType, Int)]

Map associating KType with UGen index.

ktype_map_lookup :: KType -> [(KType, Int)] -> Int

Lookup KType index from map (erroring variant of lookup).

mk_maps :: Graph -> Maps

Generate Maps translating node identifiers to synthdef indexes.

fetch :: NodeId -> Map -> Int

Locate index in map given node identifer NodeId.

fetch_k :: NodeId -> KType -> [Node] -> Int

Controls are a special case. We need to know not the overall index but the index in relation to controls of the same type.

make_input :: Maps -> FromPort -> Input

Construct Input form required by byte-code generator.

encode_input :: Input -> ByteString

Byte-encode Input value.

encode_node_k :: Maps -> Node -> ByteString

Byte-encode NodeK control node.

encode_node_u :: Maps -> Node -> ByteString

Byte-encode NodeU primitive node.

encode_graphdef :: Graph -> ByteString

Construct instrument definition bytecode.

type KS_COUNT = (Int, Int, Int, Int)

4-tuple to count KTypes.

ks_count :: [Node] -> KS_COUNT

Count the number of controls if each KType.

mk_implicit :: [Node] -> [Node]

Construct implicit control unit generator Nodes. Unit generators are only constructed for instances of control types that are present.

prepare_root :: UGen -> UGen

Transform mce nodes to mrg nodes