Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Warnings #151

Merged
merged 14 commits into from
Jun 8, 2024
578 changes: 272 additions & 306 deletions C5.Tests/Arrays/ArrayListTest.cs

Large diffs are not rendered by default.

12 changes: 6 additions & 6 deletions C5.Tests/Arrays/CircularQueueTest.cs
Original file line number Diff line number Diff line change
Expand Up @@ -12,8 +12,8 @@ public class GenericTesters
public void TestEvents()
{
CircularQueue<int> factory() { return new CircularQueue<int>(); }
new C5.Tests.Templates.Events.QueueTester<CircularQueue<int>>().Test(factory);
new C5.Tests.Templates.Events.StackTester<CircularQueue<int>>().Test(factory);
new Templates.Events.QueueTester<CircularQueue<int>>().Test(factory);
new Templates.Events.StackTester<CircularQueue<int>>().Test(factory);
}

//[Test]
Expand Down Expand Up @@ -123,7 +123,7 @@ public void Expand()
{
Assert.That(queue.Check(), Is.True);
loadup3();
Assert.That(IC.Eq(queue, 14, 15, 16, 17), Is.True);
Assert.That(queue, Is.EqualTo(new[] { 14, 15, 16, 17 }));
}

[Test]
Expand All @@ -134,7 +134,7 @@ public void Simple()
{
Assert.That(queue.Check(), Is.True);
Assert.That(queue, Has.Count.EqualTo(5));
Assert.That(IC.Eq(queue, 12, 13, 103, 14, 15), Is.True);
Assert.That(queue, Is.EqualTo(new[] { 12, 13, 103, 14, 15 }));
});
Assert.That(queue.Choose(), Is.EqualTo(12));
}
Expand Down Expand Up @@ -179,7 +179,7 @@ public void Simple2()
{
Assert.That(queue.Check(), Is.True);
Assert.That(queue, Has.Count.EqualTo(5));
Assert.That(IC.Eq(queue, 15, 1000, 1001, 1002, 1003), Is.True);
Assert.That(queue, Is.EqualTo(new[] { 15, 1000, 1001, 1002, 1003 }));
});
Assert.That(queue.Choose(), Is.EqualTo(15));
}
Expand All @@ -203,7 +203,7 @@ public void Counting()
[Test]
public void SW200602()
{
C5.CircularQueue<int> list = new(8);
CircularQueue<int> list = new(8);
for (int count = 0; count <= 7; count++)
{
list.Enqueue(count);
Expand Down
Loading