// Copyright (c) ppy Pty Ltd . Licensed under the MIT Licence. // See the LICENCE file in the repository root for full licence text. using NUnit.Framework; using osu.Framework.Lists; using osu.Game.Rulesets.Timing; using osu.Game.Rulesets.UI.Scrolling.Algorithms; namespace osu.Game.Tests.ScrollAlgorithms { [TestFixture] public class SequentialScrollTest { private IScrollAlgorithm algorithm; [SetUp] public void Setup() { var controlPoints = new SortedList { new MultiplierControlPoint(0) { Velocity = 1 }, new MultiplierControlPoint(10000) { Velocity = 2f }, new MultiplierControlPoint(20000) { Velocity = 0.5f } }; algorithm = new SequentialScrollAlgorithm(controlPoints); } [Test] public void TestDisplayStartTime() { // Sequential scroll algorithm approximates the start time // This should be fixed in the future } [Test] public void TestLength() { Assert.AreEqual(1f / 5, algorithm.GetLength(0, 1000, 5000, 1)); // Like constant Assert.AreEqual(1f / 5, algorithm.GetLength(10000, 10500, 5000, 1)); // (10500 - 10000) / 0.5 / 5000 Assert.AreEqual(1f / 5, algorithm.GetLength(20000, 22000, 5000, 1)); // (22000 - 20000) * 0.5 / 5000 } [Test] public void TestPosition() { // Basically same calculations as TestLength() Assert.AreEqual(1f / 5, algorithm.PositionAt(1000, 0, 5000, 1)); Assert.AreEqual(1f / 5, algorithm.PositionAt(10500, 10000, 5000, 1)); Assert.AreEqual(1f / 5, algorithm.PositionAt(22000, 20000, 5000, 1)); } [TestCase(1000)] [TestCase(10000)] [TestCase(15000)] [TestCase(20000)] [TestCase(25000)] public void TestTime(double time) { Assert.AreEqual(time, algorithm.TimeAt(algorithm.PositionAt(time, 0, 5000, 1), 0, 5000, 1), 0.001); Assert.AreEqual(time, algorithm.TimeAt(algorithm.PositionAt(time, 5000, 5000, 1), 5000, 5000, 1), 0.001); } } }