/
Row.ck
132 lines (100 loc) · 2.1 KB
/
Row.ck
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
class Row
{
int m_pitches[12];
0 => int m_current;
generate();
fun int randomPitch()
{
return Std.rand() % 12 + 1;
}
fun int contains(int value)
{
for(0 => int i; i < 12; i++)
{
if(m_pitches[i] == value)
{
return true;
}
}
return false;
}
fun void generate()
{
// This is a crappy way of generating the set, but ChucK doesn't have a
// nice list class to make this easier.
for(0 => int i; i < 12; i++)
{
randomPitch() => int pitch;
while(contains(pitch))
{
randomPitch() => pitch;
}
pitch => m_pitches[i];
}
}
fun void print()
{
<<< "Row:", "" >>>;
for(0 => int i; i < 12; i++)
{
<<< m_pitches[i], "" >>>;
}
<<< "", "" >>>;
}
fun void invert()
{
for(0 => int i; i < 12; i++)
{
13 - m_pitches[i] => m_pitches[i];
}
}
fun void retrograde()
{
int reversed[12];
for(0 => int i; i < 12; i++)
{
m_pitches[11 - i] => reversed[i];
}
reversed @=> m_pitches;
}
fun int nextPitch()
{
m_pitches[m_current] => int pitch;
(m_current + 1) % 12 => m_current;
return pitch;
}
}
class RowPlayer
{
int m_used[128];
fun void noteOnHandler()
{
}
fun void noteOffHandler()
{
}
}
class RowAutoPlayer
{
Row m_row;
[ 1/4, 1/8, 1/16, 1/2, 1, 2, 3/4, 6/4, 5/4, 7/4 ] @=> float m_denominations[];
false => int m_ignoreNoteEnd;
false => int m_ignoreMidiInput;
0.8 => float m_chanceOfNote;
4 => int m_maxConcurrentNotes;
0.05 => float m_inversionChance;
0.05 => float m_chanceOfRetrograde;
0 => int m_currentNotes;
fun void note(dur length)
{
<<< "note" >>>;
}
fun void pulse()
{
//
}
fun dur length()
{
//
}
}