static public string DetermineTriadType(Triad triad)
{
var f = new int[3];
var neuTriad = new Triad(triad.ChordNotes[0], triad.ChordNotes[1], triad.ChordNotes[2], triad.Mode, triad.Inversion);
int size = neuTriad.GetChordSize();
var notes = neuTriad.ChordNotes.OrderBy(n => n.getNoteNumber()).ToArray();
while (size > 12)
{
notes = notes.OrderBy(n => n.getNoteNumber()).ToArray();
notes[0] = JustNote.moveNoteBySemitones(notes[0], 12);
notes = notes.OrderBy(n => n.getNoteNumber()).ToArray();
size = notes.Last().getNoteNumber() - notes.First().getNoteNumber();
if (size > 12)
{
notes[2] = JustNote.moveNoteBySemitones(notes[2], -12);
notes = notes.OrderBy(n => n.getNoteNumber()).ToArray();
size = notes.Last().getNoteNumber() - notes.First().getNoteNumber();
}
}
f[0] = notes[1].getNoteNumber() - notes[0].getNoteNumber();
f[1] = notes[2].getNoteNumber() - notes[1].getNoteNumber();
f[2] = 12 - f[0] - f[1];
var fTemp = new int[3];
for (int i = 0; i < 3; i++)
{
fTemp[0] = f[(i + 0) % 3];
fTemp[1] = f[(i + 1) % 3];
fTemp[2] = f[(i + 2) % 3];
if (TriadTypes.TriadsTypes.Select(fff => fff.Value).Any(fo => fo[0] == fTemp[0] && fo[1] == fTemp[1] && fo[2] == fTemp[2]))
{
neuTriad.TriadType = TriadTypes.TriadsTypes.First(fo => fo.Value[0] == fTemp[0] && fo.Value[1] == fTemp[1] && fo.Value[2] == fTemp[2]).Key.ToString();
break;
}
if (i == 3)
{
neuTriad.TriadType = "undefined";
}
}
return(neuTriad.TriadType);
}
public static List <TriadTransformationWithData> CalculateTransDataForTriads(List <int[]> triadsTransformations)
{
var TransData = new List <TriadTransformationWithData>();
int counttt = 0;
foreach (var item in triadsTransformations)
{
var a = new TriadTransformationWithData();
a.Formula = item;
a.ApplicationsOnVariosTriads = new List <TriadTransformationWithDetailedInfo>();
foreach (var triadtype in TriadTypes.TriadsTypes.Keys)
{
foreach (TriadMode mode in (TriadMode[])Enum.GetValues(typeof(TriadMode)))
{
foreach (TriadInversion inv in (TriadInversion[])Enum.GetValues(typeof(TriadInversion)))
{
var b = new TriadTransformationWithDetailedInfo();
b.InitialTriadType = triadtype;
b.InitialTriadMode = mode;
b.InitialTriadInversion = inv;
var testTriad = new Triad(JustNote.getNoteFromNumber(48), TriadTypes.GetChordFormula(triadtype), mode, inv);
b.TheApplications = new List <TriadSignature>();
b.TheStepsTransitions = new List <TriadStepsTransition>();
var bb = new TriadSignature();
bb.ChordType = testTriad.TriadType;
bb.Mode = testTriad.Mode;
bb.Inversion = testTriad.Inversion;
b.TheApplications.Add(bb);
var prevNotes = new JustNote[3];
for (int i = 0; i < 3; i++)
{
prevNotes[i] = testTriad.ChordNotes[i];
}
var prevSize = testTriad.GetChordSize();
var origSize = testTriad.GetChordSize();
int simpleLoopFound = 0;
int fullLoopFound = 0;
int stepsTaken = 0;
while (TriadTransformation.ApplyATransformation(testTriad, a.Formula) && !b.Cyclic)
{
var bbb = new TriadSignature();
bbb.ChordType = testTriad.TriadType;
bbb.Mode = testTriad.Mode;
bbb.Inversion = testTriad.Inversion;
b.TheApplications.Add(bbb);
var bbc = new TriadStepsTransition();
bbc.TonicMoved = testTriad.ChordNotes[0].getNoteNumber() - prevNotes[0].getNoteNumber();
bbc.ThirdMoved = testTriad.ChordNotes[1].getNoteNumber() - prevNotes[1].getNoteNumber();
bbc.FifthMoved = testTriad.ChordNotes[2].getNoteNumber() - prevNotes[2].getNoteNumber();
for (int i = 0; i < 3; i++)
{
prevNotes[i] = JustNote.moveNoteBySemitones(prevNotes[i], a.Formula[i]);
}
if (prevNotes[0].getNoteNumber() == testTriad.ChordNotes[0].getNoteNumber())
{
bbc.TonicInto = TriadStep.T;
}
else if (prevNotes[0].getNoteNumber() == testTriad.ChordNotes[1].getNoteNumber())
{
bbc.TonicInto = TriadStep.III;
}
else if (prevNotes[0].getNoteNumber() == testTriad.ChordNotes[2].getNoteNumber())
{
bbc.TonicInto = TriadStep.V;
}
if (prevNotes[1].getNoteNumber() == testTriad.ChordNotes[0].getNoteNumber())
{
bbc.ThirdInto = TriadStep.T;
}
else if (prevNotes[1].getNoteNumber() == testTriad.ChordNotes[1].getNoteNumber())
{
bbc.ThirdInto = TriadStep.III;
}
else if (prevNotes[1].getNoteNumber() == testTriad.ChordNotes[2].getNoteNumber())
{
bbc.ThirdInto = TriadStep.V;
}
if (prevNotes[2].getNoteNumber() == testTriad.ChordNotes[0].getNoteNumber())
{
bbc.FifthInto = TriadStep.T;
}
else if (prevNotes[2].getNoteNumber() == testTriad.ChordNotes[1].getNoteNumber())
{
bbc.FifthInto = TriadStep.III;
}
else if (prevNotes[2].getNoteNumber() == testTriad.ChordNotes[2].getNoteNumber())
{
bbc.FifthInto = TriadStep.V;
}
bbc.SizeDifference = testTriad.GetChordSize() - prevSize;
prevSize = testTriad.GetChordSize();
b.TheStepsTransitions.Add(bbc);
for (int i = 0; i < 3; i++)
{
prevNotes[i] = testTriad.ChordNotes[i];
}
stepsTaken++;
// TODO : More complicated and trusted way to determine exact cycle
if (testTriad.TriadType == triadtype)
{
simpleLoopFound++;
}
if (testTriad.TriadType == triadtype && testTriad.Mode == mode && testTriad.Inversion == inv)
{
fullLoopFound++;
}
if (fullLoopFound == 2)
{
b.Cyclic = true;
}
if (stepsTaken > 27 && simpleLoopFound < 1)
{
break;
}
if (stepsTaken > 55)
{
break;
}
}
if (b.Cyclic)
{
b.LoopByTypeDistance = (stepsTaken / 2 + 1) / (simpleLoopFound / 2) - 1;
b.FullLoopDistance = stepsTaken / 2;
var sum = b.TheStepsTransitions.Sum(st => st.TonicMoved);
if (sum == 0)
{
b.StayInPlace = true;
}
else if (sum > 0)
{
b.MovingUp = true;
}
else
{
b.MovingDown = true;
}
b.TheApplications.RemoveRange(b.FullLoopDistance, b.TheApplications.Count - b.FullLoopDistance - 1);
b.TheStepsTransitions.RemoveRange((b.FullLoopDistance - 1), b.TheStepsTransitions.Count - b.FullLoopDistance);
if (origSize - prevSize == 0)
{
b.SizeKept = true;
}
a.ApplicationsOnVariosTriads.Add(b);
}
}
}
}
if (a.ApplicationsOnVariosTriads.Count > 0)
{
TransData.Add(a);
}
counttt++;
Console.WriteLine(TransData.Count + " :: " + counttt + " :: " + " [" + a.Formula[0] + " " + a.Formula[1] + " " + a.Formula[2] + "] " + a.ApplicationsOnVariosTriads.Count);
}
return(TransData);
}