Skip to content

Commit

Permalink
Apply review feedback
Browse files Browse the repository at this point in the history
  • Loading branch information
peppy committed Jul 17, 2018
1 parent 825941a commit 9f93318
Show file tree
Hide file tree
Showing 3 changed files with 7 additions and 7 deletions.
Expand Up @@ -49,8 +49,8 @@ protected override DifficultyAttributes Calculate(IBeatmap beatmap, Mod[] mods,
switch (hitObject)
{
// We want to only consider fruits that contribute to the combo. Droplets are addressed as accuracy and spinners are not relevant for "skill" calculations.
case Fruit _:
difficultyHitObjects.Add(new CatchDifficultyHitObject((CatchHitObject)hitObject, halfCatchWidth));
case Fruit fruit:
difficultyHitObjects.Add(new CatchDifficultyHitObject(fruit, halfCatchWidth));
break;
case JuiceStream _:
difficultyHitObjects.AddRange(hitObject.NestedHitObjects.OfType<CatchHitObject>().Where(o => !(o is TinyDroplet)).Select(o => new CatchDifficultyHitObject(o, halfCatchWidth)));
Expand Down
4 changes: 2 additions & 2 deletions osu.Game.Rulesets.Taiko/Scoring/TaikoScoreProcessor.cs
Expand Up @@ -87,8 +87,8 @@ protected override void SimulateAutoplay(Beatmap<TaikoHitObject> beatmap)
if (obj.IsStrong)
AddJudgement(new TaikoStrongHitJudgement());
break;
case DrumRoll _:
for (int i = 0; i < ((DrumRoll)obj).NestedHitObjects.OfType<DrumRollTick>().Count(); i++)
case DrumRoll drumRoll:
for (int i = 0; i < drumRoll.NestedHitObjects.OfType<DrumRollTick>().Count(); i++)
{
AddJudgement(new TaikoDrumRollTickJudgement { Result = HitResult.Great });

Expand Down
6 changes: 3 additions & 3 deletions osu.Game/Rulesets/Difficulty/DifficultyCalculator.cs
Expand Up @@ -71,11 +71,11 @@ IEnumerable<Mod> createDifficultyAdjustmentModCombinations(IEnumerable<Mod> curr
case 1:
yield return currentSet.Single();
break;
default:
yield return new MultiMod(currentSet.ToArray());
break;
}

if (currentSetCount > 1)
yield return new MultiMod(currentSet.ToArray());

// Apply mods in the adjustment set recursively. Using the entire adjustment set would result in duplicate multi-mod mod
// combinations in further recursions, so a moving subset is used to eliminate this effect
for (int i = adjustmentSetStart; i < adjustmentSet.Length; i++)
Expand Down

0 comments on commit 9f93318

Please sign in to comment.