142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
|
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
|
+
-
+
-
+
-
-
-
-
-
+
+
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
-
-
+
+
-
-
-
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
-
-
-
+
+
+
+
+
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
-
-
-
+
-
-
+
+
|
for subsection in ["intro", "body", "outro"]:
try:
print "; Subsection " + subsection
subsection = section[subsection]
unordered_instrs = []
for instr in subsection:
subsection[instr]["name"] = instr
if not "sync" in subsection[instr].keys():
subsection[instr]["sync"] = None
unordered_instrs.append([subsection[instr]["sync"], instr])
ordered_instrs = topsort.topsort(unordered_instrs)
ordered_instrs.remove(None) # None used as a placeholder for sort order for instruments with no sync setting
instrs = []
syncs = {}
for instr in ordered_instrs:
print ";Instrument " + instr
instr = subsection[instr]
# ipdb.set_trace()
max_time = instr["duration"]
instr_score, syncs = render_instr(instr, syncs, max_time)
instrs.append(instr_score)
for line in generate_csound_score(instr_score, instr["score_line"], subsection_start):
print line
longest_score = max(instrs, key=lambda i: score_len(i))
subsection_start += score_len(longest_score)
section_start += score_len(longest_score)
except KeyError:
pass
def render_instr(instr, syncs, max_time):
for g in instr["grammars"]:
for i in range(len(instr["grammars"][g])):
instr["grammars"][g][i] = parse.parse(instr["grammars"][g][i])
score = []
score= []
while True:
# ipdb.set_trace()
time_remaining = max_time - score_len(score)
try:
score, syncs = choose_node(score, instr, time_remaining, syncs)
try:
score, syncs = choose_phrase(instr, syncs, 0, max_time)
except ValueError:
break
return (score, syncs)
def choose_node(score, instr, time_remaining, syncs):
# ipdb.set_trace()
grammars = instr["grammars"]
if time_remaining <= 0:
raise ValueError("No time remaining in the score")
while True:
score_index_to_replace = None
for item in range(len(score)): # Optimize this by caching the index of the last node I replaced and startng there
if isinstance(score[item], tree.Tree):
score_index_to_replace = item
if score_index_to_replace is None:
raise ValueError("No more nodes to fill in")
if len(score) == 0:
options = get_node_choices(instr, syncs, score_len(score))
time_remaining = max_time - score_len(score)
new_phrase, syncs = choose_phrase(instr, syncs, score_len(score), time_remaining)
node = random.choice(options)
phrase = random.choice(instr["grammars"][node])
score = score[:node_index-1] + new_phrase + score[node_index+1:]
# Find the next node in the score that needs choosing
node = None
node_index = None
for item in range(len(score)):
if isinstance(score[item], tree.Tree):
node = score[item].name
node_index = item
if node is None:
raise ValueError("No more nodes to fill in")
options = get_node_choices(instr, syncs, score_len(score))
node = random.choice(options)
phrase = random.choice(instr["grammars"][node])
score = score[:node_index-1] + phrase + score[node_index+1:]
return score
except ValueError:
return (score, syncs)
def get_node_choices(instr, syncs, current_time):
# If this instrument should follow another, choose a grammar node from the correct instrument
# ipdb.set_trace()
def choose_phrase(instr, syncs, current_time, time_remaining):
'''Filters grammars for ones that match the sync option, and phrases that fit the time remaining in the score'''
time_filtered_grammars = {}
for grammar in instr["grammars"]:
time_filtered_grammars[grammar] = get_phrases_that_fit(instr["grammars"][grammar], time_remaining)
if len(time_filtered_grammars.keys()) == 0:
raise ValueError("No available grammars that will fit in the score")
grammar = None
# if instr["name"] == "follow_instr":
# ipdb.set_trace()
grammars = instr["grammars"]
options = []
if instr["sync"] is not None:
guiding_instr = instr["sync"]
sync_node = get_sync_node_at_time(syncs[guiding_instr], current_time)
if sync_node in instr["grammars"].keys():
options.append(sync_node)
else:
for g in range(len(grammars[node])):
if score_len(grammars[node][g]) <= time_remaining:
options.append(grammars[node][g])
else:
for g in range(len(grammars[node])):
if score_len(grammars[node][g]) <= time_remaining:
options.append(grammars[node][g])
if sync_node in time_filtered_grammars.keys():
grammar = sync_node
if grammar is None:
grammar = random.choice(time_filtered_grammars.keys())
phrases = time_filtered_grammars[grammar]
if instr["name"] not in syncs.keys():
syncs[instr["name"]] = []
syncs[instr["name"]].append({"node": grammar, "time": current_time})
return random.choice(phrases), syncs
def get_phrases_that_fit(grammar, time_remaining):
valid_phrases = []
for phrase in grammar:
if score_len(phrase) <= time_remaining:
valid_phrases.append(phrase)
if len(options) == 0:
raise ValueError("No available grammars that will fit in the score")
return options
return valid_phrases
def get_sync_node_at_time(syncs, t):
for s in len(syncs):
if syncs[s]["time"] > t:
for s in range(len(syncs)):
if syncs[s]["time"] >= t:
return syncs[s]["node"]
def score_len(score):
total = 0
for n in score:
if not isinstance(n, tree.Tree):
|