Sound.SC3.UGen.Operator

Enumerations of the unary and binary math unit generators. Names that conflict with existing names have a _ suffix.

Unary

data Unary

Enumeration of SC3 unary operator UGens.

Constructors

Neg

Not

IsNil

NotNil

BitNot

Abs

AsFloat

AsInt

Ceil

Floor

Frac

Sign

Squared

Cubed

Sqrt

Exp

Recip

MIDICPS

CPSMIDI

MIDIRatio

RatioMIDI

DbAmp

AmpDb

OctCPS

CPSOct

Log

Log2

Log10

Sin

Cos

Tan

ArcSin

ArcCos

ArcTan

SinH

CosH

TanH

Rand_

Rand2

LinRand_

BiLinRand

Sum3Rand

Distort

SoftClip

Coin

DigitValue

Silence

Thru

RectWindow

HanWindow

WelchWindow

TriWindow

Ramp_

SCurve

Instances

Bounded Unary

Methods

minBound :: Unary

maxBound :: Unary

Enum Unary

Methods

succ :: Unary -> Unary

pred :: Unary -> Unary

toEnum :: Int -> Unary

fromEnum :: Unary -> Int

enumFrom :: Unary -> [Unary]

enumFromThen :: Unary -> Unary -> [Unary]

enumFromTo :: Unary -> Unary -> [Unary]

enumFromThenTo :: Unary -> Unary -> Unary -> [Unary]

Eq Unary

Methods

(==) :: Unary -> Unary -> Bool

(/=) :: Unary -> Unary -> Bool

Read Unary

Methods

readsPrec :: Int -> ReadS Unary

readList :: ReadS [Unary]

readPrec :: ReadPrec Unary

readListPrec :: ReadPrec [Unary]

Show Unary

Methods

showsPrec :: Int -> Unary -> ShowS

show :: Unary -> String

showList :: [Unary] -> ShowS

parse_unary :: Case_Rule -> String -> Maybe Unary

Type-specialised parse_enum.

unaryTable :: [(Unary, String)]

Table of symbolic names for standard unary operators.

unaryName :: Int -> String

Lookup possibly symbolic name for standard unary operators.

unaryIndex :: Case_Rule -> String -> Maybe Int

Given name of unary operator derive index.

mapMaybe (unaryIndex CI) (words "NEG CUBED") == [0,13]
unaryIndex CS "SinOsc" == Nothing

is_unary :: Case_Rule -> String -> Bool

isJust of unaryIndex.

map (is_unary CI) (words "ABS MIDICPS NEG")
map (is_unary CI) (words "- RAND")

Binary

data Binary

Enumeration of SC3 unary operator UGens.

map show [minBound :: Binary .. maxBound]

Constructors

Add

Sub

Mul

IDiv

FDiv

Mod

EQ_

NE

LT_

GT_

LE

GE

Min

Max

BitAnd

BitOr

BitXor

LCM

GCD

Round

RoundUp

Trunc

Atan2

Hypot

Hypotx

Pow

ShiftLeft

ShiftRight

UnsignedShift

Fill

Ring1

Ring2

Ring3

Ring4

DifSqr

SumSqr

SqrSum

SqrDif

AbsDif

Thresh

AMClip

ScaleNeg

Clip2

Excess

Fold2

Wrap2

FirstArg

RandRange

ExpRandRange

Instances

Bounded Binary

Methods

minBound :: Binary

maxBound :: Binary

Enum Binary

Methods

succ :: Binary -> Binary

pred :: Binary -> Binary

toEnum :: Int -> Binary

fromEnum :: Binary -> Int

enumFrom :: Binary -> [Binary]

enumFromThen :: Binary -> Binary -> [Binary]

enumFromTo :: Binary -> Binary -> [Binary]

enumFromThenTo :: Binary -> Binary -> Binary -> [Binary]

Eq Binary

Methods

(==) :: Binary -> Binary -> Bool

(/=) :: Binary -> Binary -> Bool

Read Binary

Methods

readsPrec :: Int -> ReadS Binary

readList :: ReadS [Binary]

readPrec :: ReadPrec Binary

readListPrec :: ReadPrec [Binary]

Show Binary

Methods

showsPrec :: Int -> Binary -> ShowS

show :: Binary -> String

showList :: [Binary] -> ShowS

parse_binary :: Case_Rule -> String -> Maybe Binary

Type-specialised parse_enum.

binaryTable :: [(Binary, String)]

Table of symbolic names for standard binary operators.

binaryName :: Int -> String

Lookup possibly symbolic name for standard binary operators.

map binaryName [1,2,8,12] == ["-","*","<","Min"]

binaryIndex :: Case_Rule -> String -> Maybe Int

Given name of binary operator derive index.

mapMaybe (binaryIndex CI) (words "* MUL RING1") == [2,2,30]
binaryIndex CI "SINOSC" == Nothing

is_binary :: Case_Rule -> String -> Bool

isJust of binaryIndex.

map (is_binary CI) (words "== > % TRUNC MAX")

Operator

resolve_operator :: Case_Rule -> String -> (String, Maybe Int)

Order of lookup: binary then unary.

map (resolve_operator CI) (words "+ - ADD SUB NEG")