|
| 1 | +// Copyright (c) ppy Pty Ltd <[email protected]>. Licensed under the MIT Licence. |
| 2 | +// See the LICENCE file in the repository root for full licence text. |
| 3 | + |
| 4 | +using System; |
| 5 | +using System.Collections.Generic; |
| 6 | +using System.Linq; |
| 7 | +using NUnit.Framework; |
| 8 | +using osu.Framework.Testing; |
| 9 | +using osu.Game.Beatmaps; |
| 10 | +using osu.Game.Configuration; |
| 11 | +using osu.Game.Screens.Select.Filter; |
| 12 | +using osu.Game.Screens.SelectV2; |
| 13 | + |
| 14 | +namespace osu.Game.Tests.Visual.SongSelectV2 |
| 15 | +{ |
| 16 | + /// <summary> |
| 17 | + /// The fallback behaviour guaranteed by SongSelect is that a random selection will happen in worst case scenario. |
| 18 | + /// Every case we're testing here is expected to have a *custom behaviour* – engaging and overriding this random selection fallback. |
| 19 | + /// |
| 20 | + /// The scenarios we care abouts are: |
| 21 | + /// - Ruleset change (select another difficulty from same set for the new ruleset, if possible). |
| 22 | + /// - Beatmap difficulty hidden (select closest valid difficulty from same set) |
| 23 | + /// - Beatmap set deleted (select closest valid beatmap post-deletion) |
| 24 | + /// |
| 25 | + /// We are working with 5 sets, each with 3 difficulties (all osu! ruleset). |
| 26 | + /// </summary> |
| 27 | + public partial class TestSceneSongSelectCurrentSelectionInvalidated : SongSelectTestScene |
| 28 | + { |
| 29 | + private BeatmapInfo? selectedBeatmap => (BeatmapInfo?)Carousel.CurrentSelection; |
| 30 | + private BeatmapSetInfo? selectedBeatmapSet => selectedBeatmap?.BeatmapSet; |
| 31 | + |
| 32 | + [SetUpSteps] |
| 33 | + public override void SetUpSteps() |
| 34 | + { |
| 35 | + base.SetUpSteps(); |
| 36 | + |
| 37 | + for (int i = 0; i < 5; i++) |
| 38 | + ImportBeatmapForRuleset(0); |
| 39 | + |
| 40 | + LoadSongSelect(); |
| 41 | + } |
| 42 | + |
| 43 | + [Test] |
| 44 | + public void TestRulesetChange() |
| 45 | + { |
| 46 | + AddStep("disable converts", () => Config.SetValue(OsuSetting.ShowConvertedBeatmaps, false)); |
| 47 | + |
| 48 | + ImportBeatmapForRuleset(0, 1); |
| 49 | + ImportBeatmapForRuleset(0, 1); |
| 50 | + ImportBeatmapForRuleset(0, 2); |
| 51 | + waitForFiltering(5); |
| 52 | + |
| 53 | + ChangeRuleset(1); |
| 54 | + waitForFiltering(6); |
| 55 | + |
| 56 | + BeatmapInfo? initiallySelected = null; |
| 57 | + AddAssert("selected is taiko", () => (initiallySelected = selectedBeatmap)?.Ruleset.OnlineID, () => Is.EqualTo(1)); |
| 58 | + |
| 59 | + ChangeRuleset(0); |
| 60 | + waitForFiltering(7); |
| 61 | + AddAssert("selected is osu", () => selectedBeatmap?.Ruleset.OnlineID, () => Is.EqualTo(0)); |
| 62 | + AddAssert("selected is same set as original", () => selectedBeatmap?.BeatmapSet, () => Is.EqualTo(initiallySelected!.BeatmapSet)); |
| 63 | + |
| 64 | + ChangeRuleset(1); |
| 65 | + waitForFiltering(8); |
| 66 | + AddAssert("selected is taiko", () => selectedBeatmap?.Ruleset.OnlineID, () => Is.EqualTo(1)); |
| 67 | + AddAssert("selected is same set as original", () => selectedBeatmap?.BeatmapSet, () => Is.EqualTo(initiallySelected!.BeatmapSet)); |
| 68 | + |
| 69 | + ChangeRuleset(2); |
| 70 | + waitForFiltering(9); |
| 71 | + AddAssert("selected is catch", () => selectedBeatmap?.Ruleset.OnlineID, () => Is.EqualTo(2)); |
| 72 | + AddAssert("selected is different set", () => selectedBeatmap?.BeatmapSet, () => Is.Not.EqualTo(initiallySelected!.BeatmapSet)); |
| 73 | + } |
| 74 | + |
| 75 | + /// <summary> |
| 76 | + /// Make sure that deleting all sets doesn't hit some weird edge case / crash. |
| 77 | + /// </summary> |
| 78 | + [TestCase(SortMode.Title)] |
| 79 | + [TestCase(SortMode.Artist)] |
| 80 | + [TestCase(SortMode.Difficulty)] |
| 81 | + public void TestDeleteAllSets(SortMode sortMode) |
| 82 | + { |
| 83 | + int filterCount = sortMode != SortMode.Title ? 2 : 1; |
| 84 | + |
| 85 | + SortBy(sortMode); |
| 86 | + waitForFiltering(filterCount); |
| 87 | + |
| 88 | + BeatmapSetInfo deletedSet = null!; |
| 89 | + |
| 90 | + for (int i = 0; i < 4; i++) |
| 91 | + { |
| 92 | + AddStep("delete selected", () => Beatmaps.Delete(deletedSet = selectedBeatmapSet!)); |
| 93 | + waitForFiltering(filterCount + 1 + i); |
| 94 | + selectionChangedFrom(() => deletedSet); |
| 95 | + } |
| 96 | + |
| 97 | + // The carousel still holds an invalid selection after the final deletion. Probably fine? |
| 98 | + AddStep("delete selected", () => Beatmaps.Delete(deletedSet = selectedBeatmapSet!)); |
| 99 | + AddUntilStep("wait for no global selection", () => Beatmap.IsDefault, () => Is.True); |
| 100 | + } |
| 101 | + |
| 102 | + [Test] |
| 103 | + public void DifficultiesGrouped_DeleteSet_SelectsAdjacent() |
| 104 | + { |
| 105 | + SortAndGroupBy(SortMode.Difficulty, GroupMode.Difficulty); |
| 106 | + waitForFiltering(2); |
| 107 | + |
| 108 | + makePanelSelected<PanelGroupStarDifficulty>(2); |
| 109 | + makePanelSelected<PanelBeatmapStandalone>(3); |
| 110 | + |
| 111 | + // Deleting second-last, should select last |
| 112 | + BeatmapSetInfo deletedSet = null!; |
| 113 | + AddStep("delete selected", () => Beatmaps.Delete(deletedSet = selectedBeatmapSet!)); |
| 114 | + waitForFiltering(3); |
| 115 | + |
| 116 | + selectionChangedFrom(() => deletedSet); |
| 117 | + assertPanelSelected<PanelBeatmapStandalone>(3); |
| 118 | + |
| 119 | + // Deleting last, should select previous |
| 120 | + AddStep("delete selected", () => Beatmaps.Delete(deletedSet = selectedBeatmapSet!)); |
| 121 | + waitForFiltering(4); |
| 122 | + |
| 123 | + selectionChangedFrom(() => deletedSet); |
| 124 | + assertPanelSelected<PanelBeatmapStandalone>(2); |
| 125 | + } |
| 126 | + |
| 127 | + [TestCase(SortMode.Title)] |
| 128 | + [TestCase(SortMode.Artist)] |
| 129 | + public void SetsGrouped_DeleteSet_SelectsAdjacent(SortMode sortMode) |
| 130 | + { |
| 131 | + int filterCount = sortMode != SortMode.Title ? 2 : 1; |
| 132 | + |
| 133 | + SortBy(sortMode); |
| 134 | + waitForFiltering(filterCount); |
| 135 | + |
| 136 | + makePanelSelected<PanelBeatmapSet>(3); |
| 137 | + |
| 138 | + // Deleting second-last, should select last |
| 139 | + BeatmapSetInfo deletedSet = null!; |
| 140 | + AddStep("delete selected", () => Beatmaps.Delete(deletedSet = selectedBeatmapSet!)); |
| 141 | + waitForFiltering(filterCount + 1); |
| 142 | + |
| 143 | + selectionChangedFrom(() => deletedSet); |
| 144 | + assertPanelSelected<PanelBeatmapSet>(3); |
| 145 | + assertPanelSelected<PanelBeatmap>(0); |
| 146 | + |
| 147 | + // Deleting last, should select previous |
| 148 | + AddStep("delete selected", () => Beatmaps.Delete(deletedSet = selectedBeatmapSet!)); |
| 149 | + waitForFiltering(filterCount + 2); |
| 150 | + |
| 151 | + selectionChangedFrom(() => deletedSet); |
| 152 | + assertPanelSelected<PanelBeatmapSet>(2); |
| 153 | + assertPanelSelected<PanelBeatmap>(0); |
| 154 | + } |
| 155 | + |
| 156 | + // Same scenario as the test case above, but where selected difficulty before deletion is not first index in the expanded set. |
| 157 | + // Basically ensures that the reselection is running `RequestRecommendedSelection` and not just relying on indices. |
| 158 | + [TestCase(SortMode.Title)] |
| 159 | + [TestCase(SortMode.Artist)] |
| 160 | + public void SetsGrouped_DeleteSet_SelectsNextSetRecommendedDifficulty(SortMode sortMode) |
| 161 | + { |
| 162 | + int filterCount = sortMode != SortMode.Title ? 2 : 1; |
| 163 | + |
| 164 | + SortBy(sortMode); |
| 165 | + waitForFiltering(filterCount); |
| 166 | + |
| 167 | + makePanelSelected<PanelBeatmapSet>(2); |
| 168 | + makePanelSelected<PanelBeatmap>(2); |
| 169 | + |
| 170 | + AddUntilStep("wait for beatmap to be selected", () => selectedBeatmapSet != null); |
| 171 | + |
| 172 | + BeatmapSetInfo deletedSet = null!; |
| 173 | + AddStep("delete selected", () => Beatmaps.Delete(deletedSet = selectedBeatmapSet!)); |
| 174 | + waitForFiltering(++filterCount); |
| 175 | + |
| 176 | + selectionChangedFrom(() => deletedSet); |
| 177 | + assertPanelSelected<PanelBeatmapSet>(2); |
| 178 | + assertPanelSelected<PanelBeatmap>(0); |
| 179 | + } |
| 180 | + |
| 181 | + [Test] |
| 182 | + public void TestHideBeatmap() |
| 183 | + { |
| 184 | + makePanelSelected<PanelBeatmapSet>(2); |
| 185 | + makePanelSelected<PanelBeatmap>(1); |
| 186 | + |
| 187 | + BeatmapInfo hiddenBeatmap = null!; |
| 188 | + |
| 189 | + AddStep("hide selected", () => Beatmaps.Hide(hiddenBeatmap = selectedBeatmap!)); |
| 190 | + waitForFiltering(2); |
| 191 | + |
| 192 | + AddAssert("selected beatmap below", () => selectedBeatmap!.BeatmapSet, () => Is.EqualTo(hiddenBeatmap.BeatmapSet)); |
| 193 | + |
| 194 | + AddStep("hide selected", () => Beatmaps.Hide(hiddenBeatmap = selectedBeatmap!)); |
| 195 | + waitForFiltering(3); |
| 196 | + |
| 197 | + AddAssert("selected beatmap below", () => selectedBeatmap!.BeatmapSet, () => Is.EqualTo(hiddenBeatmap.BeatmapSet)); |
| 198 | + assertPanelSelected<PanelBeatmap>(0); |
| 199 | + } |
| 200 | + |
| 201 | + private void waitForFiltering(int filterCount = 1) |
| 202 | + { |
| 203 | + AddUntilStep("wait for filter count", () => Carousel.FilterCount, () => Is.EqualTo(filterCount)); |
| 204 | + AddUntilStep("filtering finished", () => Carousel.IsFiltering, () => Is.False); |
| 205 | + } |
| 206 | + |
| 207 | + private void makePanelSelected<T>(int index) |
| 208 | + where T : Panel |
| 209 | + { |
| 210 | + AddStep($"click panel at index {index} if not selected", () => |
| 211 | + { |
| 212 | + var panel = allPanels<T>().ElementAt(index).ChildrenOfType<Panel>().Single(); |
| 213 | + |
| 214 | + // May have already been selected randomly. Don't click a second time or gameplay will start. |
| 215 | + if (!panel.Selected.Value) |
| 216 | + panel.TriggerClick(); |
| 217 | + }); |
| 218 | + |
| 219 | + assertPanelSelected<T>(index); |
| 220 | + } |
| 221 | + |
| 222 | + private void selectionChangedFrom(Func<BeatmapSetInfo> deletedSet) => |
| 223 | + AddUntilStep("selection changed", () => selectedBeatmapSet, () => Is.Not.EqualTo(deletedSet())); |
| 224 | + |
| 225 | + private void assertPanelSelected<T>(int index) |
| 226 | + where T : Panel |
| 227 | + => AddUntilStep($"selected panel at index {index}", getActivePanelIndex<T>, () => Is.EqualTo(index)); |
| 228 | + |
| 229 | + private int getActivePanelIndex<T>() |
| 230 | + where T : Panel |
| 231 | + => allPanels<T>().ToList().FindIndex(p => |
| 232 | + { |
| 233 | + switch (p) |
| 234 | + { |
| 235 | + case PanelBeatmapStandalone pb: |
| 236 | + return pb.Selected.Value; |
| 237 | + |
| 238 | + case PanelBeatmap pb: |
| 239 | + return pb.Selected.Value; |
| 240 | + |
| 241 | + case Panel pbs: |
| 242 | + return pbs.Expanded.Value; |
| 243 | + |
| 244 | + default: |
| 245 | + throw new InvalidOperationException(); |
| 246 | + } |
| 247 | + }); |
| 248 | + |
| 249 | + private IEnumerable<T> allPanels<T>() |
| 250 | + where T : Panel |
| 251 | + => Carousel.ChildrenOfType<T>().Where(p => p.Item != null).OrderBy(p => p.Y); |
| 252 | + } |
| 253 | +} |
0 commit comments