h1or4dme8/osu-lazer
1
0
Fork 0
mirror of https://github.com/ppy/osu.git synced 2025-01-12 17:43:05 +08:00
Code Issues Releases Wiki Activity

Slightly optimise and de-branch repetition pattern recognition

Browse Source
This commit is contained in:
Bartłomiej Dach 2020-08-18 19:44:41 +02:00
parent 00ae456f08
commit d7ff3d77eb
1 changed files with 17 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
osu.Game.Rulesets.Taiko/Difficulty/Skills/Colour.cs
View File

@ -87,28 +87,29 @@ namespace osu.Game.Rulesets.Taiko.Difficulty.Skills
for (int start = monoHistory.Count - l - 1; start >= 0; start--) for (int start = monoHistory.Count - l - 1; start >= 0; start--)
{ {
bool samePattern = true; if (!isSamePattern(start, l))
continue;
for (int i = 0; i < l; i++) int notesSince = 0;
{ for (int i = start; i < monoHistory.Count; i++) notesSince += monoHistory[i];
if (monoHistory[start + i] != monoHistory[monoHistory.Count - l + i]) penalty *= repetitionPenalty(notesSince);
{ break;
samePattern = false;
}
}
if (samePattern) // Repetition found!
{
int notesSince = 0;
for (int i = start; i < monoHistory.Count; i++) notesSince += monoHistory[i];
penalty *= repetitionPenalty(notesSince);
break;
}
} }
return penalty; return penalty;
} }
private bool isSamePattern(int start, int l)
{
for (int i = 0; i < l; i++)
{
if (monoHistory[start + i] != monoHistory[monoHistory.Count - l + i])
return false;
}
return true;
}
private double repetitionPenalty(int notesSince) => Math.Min(1.0, 0.032 * notesSince); private double repetitionPenalty(int notesSince) => Math.Min(1.0, 0.032 * notesSince);
} }
} }