Overview
| Comment: | Fixed bug that prevented more than two sections from working properly |
|---|---|
| Timelines: | family | ancestors | descendants | both | feature/abc |
| Files: | files | file ages | folders |
| SHA1: |
b2ce9522e9d8cad38398a713e26d4d8f |
| User & Date: | brian on 2011-09-22 18:04:07.566 |
| Other Links: | branch diff | manifest | tags |
Context
|
2011-09-22
| ||
| 18:30 | Added back in support for subsections check-in: f653a4fa10 user: brian tags: feature/abc | |
| 18:04 | Fixed bug that prevented more than two sections from working properly check-in: b2ce9522e9 user: brian tags: feature/abc | |
| 17:58 | Fixed tempo for realz this time check-in: 4b32d1483b user: brian tags: feature/abc | |
Changes
Modified cfg.py
from [b052479df1]
to [fb69d16646].
| ︙ | ︙ | |||
46 47 48 49 50 51 52 |
}
print '''f1 0 512 10 1
f2 0 8192 10 .24 .64 .88 .76 .06 .5 .34 .08
f3 0 1025 10 1
t 0 60
'''
| | | | | | > > > | < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < | 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 |
}
print '''f1 0 512 10 1
f2 0 8192 10 .24 .64 .88 .76 .06 .5 .34 .08
f3 0 1025 10 1
t 0 60
'''
section_start = 0
for section in ["verse1", "verse2"]:
section = composition[section]
# for subsection in section
instrs = []
for instr in section.values():
sync = None
max_time = instr["duration"]
instr_score = render_instr(instr, sync, max_time)
instrs.append(instr_score)
for line in generate_csound_score(instr_score, instr["score_line"], section_start):
print line
longest_score = max(instrs, key=lambda i: score_len(i))
section_start += score_len(longest_score)
def render_instr(instr, sync, max_time):
grammars = instr["grammars"]
for g in instr["grammars"]:
for i in range(len(grammars[g])):
grammars[g][i] = parse.parse(grammars[g][i])
init_node = random.choice(instr["grammars"].keys())
init_score = random.choice(instr["grammars"][init_node])
score = init_score
while True:
time_remaining = max_time - score_len(score)
try:
score = choose_node(score, grammars, time_remaining, sync)
except ValueError:
break
return score
def choose_node(score, grammars, time_remaining, sync):
if time_remaining <= 0:
raise ValueError("No time remaining in the score")
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 = []
for g in range(len(grammars[node])):
if score_len(grammars[node][g]) <= time_remaining:
options.append(grammars[node][g])
if len(options) == 0:
raise ValueError("No available grammars that will fit in the score")
if sync:
else:
phrase = random.choice(options)
score = score[:node_index-1] + phrase + score[node_index+1:]
return score
def score_len(score):
total = 0
for n in score:
if not isinstance(n, tree.Tree):
total += n.duration
return total
def generate_csound_score(score, score_line, t):
csound_note_values = {
"C": "00",
"C#": "01",
"D": "02",
"D#": "03",
|
| ︙ | ︙ |