1
0
mirror of https://github.com/ppy/osu.git synced 2024-12-15 06:52:56 +08:00
osu-lazer/osu.Game.Tests/Visual/Online/TestSceneRankGraph.cs

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

181 lines
5.5 KiB
C#
Raw Normal View History

// Copyright (c) ppy Pty Ltd <contact@ppy.sh>. Licensed under the MIT Licence.
// See the LICENCE file in the repository root for full licence text.
2018-04-13 17:19:50 +08:00
2022-11-22 03:58:52 +08:00
using System.Linq;
2019-03-25 00:02:36 +08:00
using NUnit.Framework;
2020-02-03 00:03:41 +08:00
using osu.Framework.Allocation;
2017-11-22 12:04:54 +08:00
using osu.Framework.Graphics;
using osu.Framework.Graphics.Containers;
using osu.Framework.Graphics.Shapes;
using osu.Framework.Testing;
2017-11-22 12:04:54 +08:00
using osu.Game.Graphics;
2022-11-22 03:58:52 +08:00
using osu.Game.Graphics.UserInterface;
using osu.Game.Online.API.Requests.Responses;
2020-02-03 00:03:41 +08:00
using osu.Game.Overlays;
2019-04-26 12:49:44 +08:00
using osu.Game.Overlays.Profile.Header.Components;
2017-11-22 12:04:54 +08:00
using osu.Game.Users;
2019-03-25 00:02:36 +08:00
using osuTK;
2018-04-13 17:19:50 +08:00
2019-03-25 00:02:36 +08:00
namespace osu.Game.Tests.Visual.Online
2017-11-22 12:04:54 +08:00
{
2018-03-02 14:34:31 +08:00
[TestFixture]
public partial class TestSceneRankGraph : OsuTestScene
2017-11-22 12:04:54 +08:00
{
2020-02-03 00:03:41 +08:00
[Cached]
private readonly OverlayColourProvider colourProvider = new OverlayColourProvider(OverlayColourScheme.Pink);
private RankGraph graph = null!;
2018-04-13 17:19:50 +08:00
private const int history_length = 89;
[SetUpSteps]
public void SetUpSteps()
{
AddStep("create graph", () => Child = new Container
2017-11-22 12:04:54 +08:00
{
Anchor = Anchor.Centre,
Origin = Anchor.Centre,
Size = new Vector2(300, 150),
Children = new Drawable[]
{
new Box
{
RelativeSizeAxes = Axes.Both,
Colour = OsuColour.Gray(0.2f)
},
graph = new RankGraph
2017-11-22 12:04:54 +08:00
{
RelativeSizeAxes = Axes.Both,
}
}
});
}
2018-04-13 17:19:50 +08:00
[Test]
2022-11-22 03:58:52 +08:00
public void TestNullUser()
{
AddStep("null user", () => graph.Statistics.Value = null);
2022-11-22 03:58:52 +08:00
AddAssert("line graph hidden", () => this.ChildrenOfType<LineGraph>().All(graph => graph.Alpha == 0));
}
[Test]
2022-11-22 03:58:52 +08:00
public void TestRankOnly()
{
2017-11-22 12:04:54 +08:00
AddStep("rank only", () =>
{
graph.Statistics.Value = new UserStatistics
2017-11-22 12:04:54 +08:00
{
IsRanked = true,
GlobalRank = 123456,
PP = 12345,
2017-11-22 12:04:54 +08:00
};
});
2022-11-22 03:58:52 +08:00
AddAssert("line graph hidden", () => this.ChildrenOfType<LineGraph>().All(graph => graph.Alpha == 0));
}
2018-04-13 17:19:50 +08:00
[Test]
public void TestWithRankHistory()
{
int[] data = new int[history_length];
for (int i = 0; i < history_length; i++)
data[i] = (i + 1) * 1000;
2017-11-22 12:04:54 +08:00
AddStep("with rank history", () =>
{
graph.Statistics.Value = new UserStatistics
2017-11-22 12:04:54 +08:00
{
IsRanked = true,
GlobalRank = 89000,
PP = 12345,
2021-11-05 12:38:37 +08:00
RankHistory = new APIRankHistory
2017-11-22 12:04:54 +08:00
{
Data = data
2017-11-22 12:04:54 +08:00
}
};
});
2022-11-22 03:58:52 +08:00
AddAssert("line graph shown", () => this.ChildrenOfType<LineGraph>().All(graph => graph.Alpha == 1));
}
[Test]
public void TestRanksWithZeroValues()
{
int[] dataWithZeros = new int[history_length];
for (int i = 0; i < history_length; i++)
{
if (i < 20 || i >= 60)
dataWithZeros[i] = (i + 1) * 1000;
}
2018-04-13 17:19:50 +08:00
2017-11-22 12:04:54 +08:00
AddStep("with zero values", () =>
{
graph.Statistics.Value = new UserStatistics
2017-11-22 12:04:54 +08:00
{
IsRanked = true,
GlobalRank = 89000,
PP = 12345,
2021-11-05 12:38:37 +08:00
RankHistory = new APIRankHistory
2017-11-22 12:04:54 +08:00
{
Data = dataWithZeros,
}
};
});
2022-11-22 03:58:52 +08:00
AddAssert("line graph shown", () => this.ChildrenOfType<LineGraph>().All(graph => graph.Alpha == 1));
}
[Test]
public void TestSmallAmountOfData()
{
int[] smallData = new int[history_length];
for (int i = history_length - 10; i < history_length; i++)
smallData[i] = 100000 - i * 1000;
2018-04-13 17:19:50 +08:00
2017-11-22 12:04:54 +08:00
AddStep("small amount of data", () =>
{
graph.Statistics.Value = new UserStatistics
2017-11-22 12:04:54 +08:00
{
IsRanked = true,
GlobalRank = 12000,
PP = 12345,
2021-11-05 12:38:37 +08:00
RankHistory = new APIRankHistory
2017-11-22 12:04:54 +08:00
{
Data = smallData,
}
};
});
2022-11-22 03:58:52 +08:00
AddAssert("line graph shown", () => this.ChildrenOfType<LineGraph>().All(graph => graph.Alpha == 1));
}
[Test]
public void TestHistoryWithEdges()
{
int[] edgyData = new int[89];
bool edge = true;
for (int i = 0; i < 20; i++)
{
edgyData[i] = 100000 + (edge ? 1000 : -1000) * (i + 1);
edge = !edge;
}
AddStep("graph with edges", () =>
{
graph.Statistics.Value = new UserStatistics
{
IsRanked = true,
GlobalRank = 12000,
PP = 12345,
2021-11-05 12:38:37 +08:00
RankHistory = new APIRankHistory
{
Data = edgyData,
}
};
});
2022-11-22 03:58:52 +08:00
AddAssert("line graph shown", () => this.ChildrenOfType<LineGraph>().All(graph => graph.Alpha == 1));
2017-11-22 12:04:54 +08:00
}
}
}