innocuous-symmetry/procedural-drones-01
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

function in helper.js returns correct values after recursive call

Browse Source
This commit is contained in:
Mikayla Dobson
2022-05-12 20:03:56 -05:00
parent 5f4649a85a
commit 77d13ee46c
1 changed files with 19 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
src/vector_logic/helper.js
View File

@@ -31,24 +31,35 @@ const iteratePitchsets = () => {
console.log(pitchNames); console.log(pitchNames);
console.log(pitchNums); console.log(pitchNums);
let isDissonant = false;
for (let i = 0; i < pitchNums.length; i++) { for (let i = 0; i < pitchNums.length; i++) {
console.log("___FIRST NEST___")
for (let j = i; j < pitchNums.length; j++) { for (let j = i; j < pitchNums.length; j++) {
let interval = Math.abs(pitchNums[i] - pitchNums[j]); let interval = Math.abs(pitchNums[i] - pitchNums[j]);
if (interval > 6) { if (interval > 6) {
console.log('wrap');
interval = 12 - interval; interval = 12 - interval;
} }
let isDissonant = ((interval === 1) || (interval === 6)); let intervalIsDissonant = ((interval === 1) || (interval === 6));
console.log(`pitches: ${[pitches[i], pitches[j]]} interval: ${interval}, dissonant: ${isDissonant}, positions: [${i}, ${j}]: ${[pitchNums[i], pitchNums[j]]}`); // console.log(`pitches: ${[pitches[i], pitches[j]]} interval: ${interval}, dissonant: ${isDissonant}, positions: [${i}, ${j}]: ${[pitchNums[i], pitchNums[j]]}`);
if (isDissonant) iteratePitchsets(); if (!intervalIsDissonant) {
continue;
} else {
isDissonant = true;
}
} }
} }
console.log('');
if (isDissonant) {
return pitches; console.log('bad');
let newValues = iteratePitchsets();
return newValues;
} else {
console.log('good');
console.log(pitches);
return pitches;
}
} }
let final = iteratePitchsets(); let final = iteratePitchsets();