mlemanczyk/Recyclable.Collections
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Merge pull request #13 from mlemanczyk/codex/analyze-tests-for-new-generic-classes

Browse Source 
Add dataset coverage and fix stack pop test
This commit is contained in:
Marek Lemańczyk authored and GitHub committed 2025-07-14 13:55:13 +02:00
2 parents 80b4b0e890 53c34d0fa7
commit 9aa96ccb19
6 files changed
+388 -303
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

Recyclable.CollectionsTests/RecyclableDictionaryTests.cs
+39 -25
View File
@@ -9,20 +9,22 @@ namespace Recyclable.CollectionsTests
{ {
private static readonly (int, string)[] _testData = new[] { (1, "a"), (2, "b"), (3, "c"), (4, "d"), (5, "e") }; private static readonly (int, string)[] _testData = new[] { (1, "a"), (2, "b"), (3, "c"), (4, "d"), (5, "e") };
[Fact] [Theory]
public void AddShouldStoreItems() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
public void AddShouldStoreItems(int itemsCount)
{ {
using var dict = new RecyclableDictionary<int, string>(); using var dict = new RecyclableDictionary<long, long>();
foreach (var (key, value) in _testData) foreach (var key in RecyclableLongListTestData.CreateTestData(itemsCount))
{ {
dict.Add(key, value); dict.Add(key, -key);
} }
_ = dict.Should().HaveCount(_testData.Length); _ = dict.Should().HaveCount(itemsCount);
for (var i = 0; i < _testData.Length; i++) for (var i = 0; i < itemsCount; i++)
{ {
dict.GetKey(i).Should().Be(_testData[i].Item1); long expectedKey = i + 1;
dict.GetValue(i).Should().Be(_testData[i].Item2); dict.GetKey(i).Should().Be(expectedKey);
dict.GetValue(i).Should().Be(-expectedKey);
} }
} }
@@ -37,18 +39,28 @@ namespace Recyclable.CollectionsTests
_ = dict[1].Should().Be("b"); _ = dict[1].Should().Be("b");
} }
[Fact] [Theory]
public void RemoveShouldSwapWithLast() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
public void RemoveShouldSwapWithLast(int itemsCount)
{ {
using var dict = new RecyclableDictionary<int, string>(); using var dict = new RecyclableDictionary<long, long>();
foreach (var (key, value) in _testData) foreach (var key in RecyclableLongListTestData.CreateTestData(itemsCount))
{ {
dict.Add(key, value); dict.Add(key, key);
} }
dict.Remove(3).Should().BeTrue(); if (itemsCount > 0)
_ = dict.ContainsKey(3).Should().BeFalse(); {
_ = dict.Should().HaveCount(_testData.Length - 1); long keyToRemove = (itemsCount + 1) / 2;
dict.Remove(keyToRemove).Should().BeTrue();
_ = dict.ContainsKey(keyToRemove).Should().BeFalse();
_ = dict.Should().HaveCount(itemsCount - 1);
}
else
{
dict.Remove(0).Should().BeFalse();
_ = dict.Should().BeEmpty();
}
} }
[Fact] [Fact]
@@ -63,23 +75,25 @@ namespace Recyclable.CollectionsTests
_ = value.Should().Be("a"); _ = value.Should().Be("a");
} }
[Fact] [Theory]
public void EnumeratorShouldYieldItems() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
public void EnumeratorShouldYieldItems(int itemsCount)
{ {
using var dict = new RecyclableDictionary<int, string>(); using var dict = new RecyclableDictionary<long, long>();
foreach (var (key, value) in _testData) foreach (var key in RecyclableLongListTestData.CreateTestData(itemsCount))
{ {
dict.Add(key, value); dict.Add(key, key);
} }
var actual = new List<KeyValuePair<int, string>>(); var actual = new List<long>();
var enumerator = dict.GetEnumerator(); var enumerator = dict.GetEnumerator();
while (enumerator.MoveNext()) while (enumerator.MoveNext())
{ {
actual.Add(enumerator.Current); actual.Add(enumerator.Current.Key);
} }
_ = actual.Should().ContainInConsecutiveOrder(_testData.Select(x => new KeyValuePair<int, string>(x.Item1, x.Item2))); var expected = RecyclableLongListTestData.CreateTestData(itemsCount).ToList();
_ = actual.Should().ContainInConsecutiveOrder(expected);
} }
} }
} }
Recyclable.CollectionsTests/RecyclableHashSetTests.cs
+58 -33
View File
@@ -7,49 +7,74 @@ namespace Recyclable.CollectionsTests
{ {
public class RecyclableHashSetTests public class RecyclableHashSetTests
{ {
[Fact] [Theory]
public void AddShouldStoreUniqueItems() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
public void AddShouldStoreUniqueItems(int itemsCount)
{ {
using var set = new RecyclableHashSet<string>(); using var set = new RecyclableHashSet<long>();
set.Add("a").Should().BeTrue(); foreach (var item in RecyclableLongListTestData.CreateTestData(itemsCount))
set.Add("b").Should().BeTrue();
set.Add("a").Should().BeFalse();
_ = set.Should().HaveCount(2);
_ = set.Contains("a").Should().BeTrue();
_ = set.Contains("b").Should().BeTrue();
}
[Fact]
public void RemoveShouldDeleteItem()
{
using var set = new RecyclableHashSet<int>();
set.Add(1);
set.Add(2);
set.Remove(1).Should().BeTrue();
_ = set.Contains(1).Should().BeFalse();
_ = set.Should().HaveCount(1);
}
[Fact]
public void EnumeratorShouldYieldItems()
{
using var set = new RecyclableHashSet<int>();
for (int i = 0; i < 5; i++)
{ {
set.Add(i); set.Add(item).Should().BeTrue();
} }
var actual = new List<int>(); foreach (var item in RecyclableLongListTestData.CreateTestData(itemsCount))
{
set.Add(item).Should().BeFalse();
}
_ = set.Should().HaveCount(itemsCount);
}
[Theory]
[MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
public void RemoveShouldDeleteItem(int itemsCount)
{
using var set = new RecyclableHashSet<long>();
foreach (var item in RecyclableLongListTestData.CreateTestData(itemsCount))
{
set.Add(item);
}
if (itemsCount > 0)
{
long value = (itemsCount + 1) / 2;
set.Remove(value).Should().BeTrue();
_ = set.Contains(value).Should().BeFalse();
_ = set.Should().HaveCount(itemsCount - 1);
}
else
{
set.Remove(0).Should().BeFalse();
_ = set.Should().BeEmpty();
}
}
[Theory]
[MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
public void EnumeratorShouldYieldItems(int itemsCount)
{
using var set = new RecyclableHashSet<long>();
foreach (var item in RecyclableLongListTestData.CreateTestData(itemsCount))
{
set.Add(item);
}
var actual = new List<long>();
var enumerator = set.GetEnumerator(); var enumerator = set.GetEnumerator();
while (enumerator.MoveNext()) while (enumerator.MoveNext())
{ {
actual.Add(enumerator.Current); actual.Add(enumerator.Current);
} }
_ = actual.Should().Contain(Enumerable.Range(0, 5)).And.HaveCount(5); var expected = RecyclableLongListTestData.CreateTestData(itemsCount).ToList();
if (itemsCount == 0)
{
_ = actual.Should().BeEmpty();
}
else
{
_ = actual.Should().Contain(expected).And.HaveCount(itemsCount);
}
} }
} }
} }
Recyclable.CollectionsTests/RecyclableLinkedListTests.cs
+31 -23
View File
@@ -8,36 +8,40 @@ namespace Recyclable.CollectionsTests
{ {
private static readonly string[] _testData = new[] { "a", "d", "c", "b", "a" }; private static readonly string[] _testData = new[] { "a", "d", "c", "b", "a" };
[Fact] [Theory]
public void AddLastShouldPreserveOrder() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
public void AddLastShouldPreserveOrder(int itemsCount)
{ {
using var list = new RecyclableLinkedList<string>(); using var list = new RecyclableLinkedList<long>();
foreach (var item in _testData) var expected = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
foreach (var item in expected)
{ {
list.AddLast(item); list.AddLast(item);
} }
var actual = new RecyclableLongList<string>(); var actual = new RecyclableLongList<long>();
foreach (var item in list) foreach (var item in list)
{ {
actual.Add(item); actual.Add(item);
} }
_ = actual.Should().ContainInConsecutiveOrder(_testData) _ = actual.Should().ContainInConsecutiveOrder(expected)
.And.BeEquivalentTo(_testData); .And.BeEquivalentTo(expected);
} }
[Fact] [Theory]
public void AddFirstShouldReverseOrder() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
public void AddFirstShouldReverseOrder(int itemsCount)
{ {
using var list = new RecyclableLinkedList<string>(); using var list = new RecyclableLinkedList<long>();
foreach (var item in _testData) var source = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
foreach (var item in source)
{ {
list.AddFirst(item); list.AddFirst(item);
} }
var expected = _testData.Reverse().ToArray(); var expected = source.Reverse().ToArray();
var actual = new RecyclableLongList<string>(); var actual = new RecyclableLongList<long>();
foreach (var item in list) foreach (var item in list)
{ {
actual.Add(item); actual.Add(item);
@@ -46,30 +50,34 @@ namespace Recyclable.CollectionsTests
_ = actual.Should().ContainInConsecutiveOrder(expected); _ = actual.Should().ContainInConsecutiveOrder(expected);
} }
[Fact] [Theory]
public void RemoveFirstShouldReturnItemsInOrder() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
public void RemoveFirstShouldReturnItemsInOrder(int itemsCount)
{ {
using var list = new RecyclableLinkedList<string>(_testData); var source = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
var actual = new RecyclableLongList<string>(); using var list = new RecyclableLinkedList<long>(source);
var actual = new RecyclableLongList<long>();
while (list.LongCount > 0) while (list.LongCount > 0)
{ {
actual.Add(list.RemoveFirst()); actual.Add(list.RemoveFirst());
} }
_ = actual.Should().ContainInConsecutiveOrder(_testData); _ = actual.Should().ContainInConsecutiveOrder(source);
} }
[Fact] [Theory]
public void RemoveLastShouldReturnItemsInReverseOrder() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
public void RemoveLastShouldReturnItemsInReverseOrder(int itemsCount)
{ {
using var list = new RecyclableLinkedList<string>(_testData); var source = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
var actual = new RecyclableLongList<string>(); using var list = new RecyclableLinkedList<long>(source);
var actual = new RecyclableLongList<long>();
while (list.LongCount > 0) while (list.LongCount > 0)
{ {
actual.Add(list.RemoveLast()); actual.Add(list.RemoveLast());
} }
_ = actual.Should().ContainInConsecutiveOrder(_testData.Reverse()); _ = actual.Should().ContainInConsecutiveOrder(source.Reverse());
} }
} }
} }
Recyclable.CollectionsTests/RecyclableQueueTests.cs
+111 -94
View File
@@ -7,117 +7,134 @@ namespace Recyclable.CollectionsTests
{ {
private static readonly string[] _testData = new[] { "a", "d", "c", "b", "a" }; private static readonly string[] _testData = new[] { "a", "d", "c", "b", "a" };
[Fact] [Theory]
public void ShouldNotBeSortedWhenCreated() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void ShouldNotBeSortedWhenCreated(int itemsCount)
// Act {
using var list = new RecyclableQueue<string>(_testData, 2); // Act
var data = RecyclableLongListTestData.CreateTestData(itemsCount).Select(i => i.ToString()).ToArray();
using var list = new RecyclableQueue<string>(data, 2);
// Validate // Validate
_ = list.Should().HaveCount(_testData.Length) _ = list.Should().HaveCount(itemsCount)
.And.ContainInConsecutiveOrder(_testData); .And.ContainInConsecutiveOrder(data);
_ = list.LongCount.Should().Be(_testData.Length); _ = list.LongCount.Should().Be(itemsCount);
} }
[Fact] [Fact]
public void ShouldBeEmptyWhenNotInitialized() public void ShouldBeEmptyWhenNotInitialized()
{ {
// Act // Act
using var list = new RecyclableQueue<string>(2); using var list = new RecyclableQueue<string>(2);
// Validate // Validate
_ = list.Should().BeEmpty(); _ = list.Should().BeEmpty();
_ = list.LongCount.Should().Be(0); _ = list.LongCount.Should().Be(0);
} }
[Fact] [Theory]
public void ShouldNotBeSortedWhenInitialized() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void ShouldNotBeSortedWhenInitialized(int itemsCount)
// Act {
using var list = new RecyclableQueue<string>(2) // Act
{ var data = RecyclableLongListTestData.CreateTestData(itemsCount).Select(i => i.ToString()).ToArray();
_testData[0], using var list = new RecyclableQueue<string>(2)
_testData[1], {
_testData[2], // populate via collection initializer
_testData[3], };
_testData[4] foreach (var item in data)
}; {
list.Enqueue(item);
}
// Validate // Validate
_ = list.Should().NotBeEmpty() if (itemsCount == 0)
.And.ContainInConsecutiveOrder(_testData) {
.And.BeEquivalentTo(_testData); _ = list.Should().BeEmpty();
} }
else
{
_ = list.Should().NotBeEmpty()
.And.ContainInConsecutiveOrder(data)
.And.BeEquivalentTo(data);
}
}
[Fact] [Theory]
public void ShouldBeEmptyAfterClear() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void ShouldBeEmptyAfterClear(int itemsCount)
// Prepare {
using var list = new RecyclableQueue<string>(_testData); // Prepare
var data = RecyclableLongListTestData.CreateTestData(itemsCount).Select(i => i.ToString());
using var list = new RecyclableQueue<string>(data);
// Act // Act
list.Clear(); list.Clear();
// Validate // Validate
_ = list.Should().BeEmpty(); _ = list.Should().BeEmpty();
} }
[Fact] [Theory]
public void DequeueShouldReturnItemsInTheSameOrder() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void DequeueShouldReturnItemsInTheSameOrder(int itemsCount)
// Prepare {
using var list = new RecyclableQueue<string>(); // Prepare
var data = RecyclableLongListTestData.CreateTestData(itemsCount).Select(i => i.ToString()).ToArray();
using var list = new RecyclableQueue<string>();
// Act // Act
for (var itemIdx = 0; itemIdx < _testData.Length; itemIdx++) for (var itemIdx = 0; itemIdx < data.Length; itemIdx++)
{ {
list.Enqueue(_testData[itemIdx]); list.Enqueue(data[itemIdx]);
} }
var dequeuedItems = new RecyclableLongList<string>(); var dequeuedItems = new RecyclableLongList<string>();
while (list.LongCount > 0) while (list.LongCount > 0)
{ {
dequeuedItems.Add(list.Dequeue()); dequeuedItems.Add(list.Dequeue());
} }
// Validate // Validate
_ = dequeuedItems.Should().ContainInConsecutiveOrder(_testData) _ = dequeuedItems.Should().ContainInConsecutiveOrder(data)
.And.BeEquivalentTo(_testData); .And.BeEquivalentTo(data);
} }
[Fact] [Fact]
public void DequeueShoudRaiseArgumentOutOfRangeWhenNoMoreElementsFound() public void DequeueShoudRaiseArgumentOutOfRangeWhenNoMoreElementsFound()
{ {
// Prepare // Prepare
using var list = new RecyclableQueue<string>(_testData); using var list = new RecyclableQueue<string>(_testData);
// Act // Act
while (list.LongCount > 0) while (list.LongCount > 0)
{ {
_ = list.Dequeue(); _ = list.Dequeue();
} }
_ = Assert.Throws<ArgumentOutOfRangeException>(() => list.Dequeue()); _ = Assert.Throws<ArgumentOutOfRangeException>(() => list.Dequeue());
_ = list.LongCount.Should().Be(0); _ = list.LongCount.Should().Be(0);
} }
[Fact] [Theory]
public void GetEnumeratorShouldYieldAllItemsInTheSameOrder() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void GetEnumeratorShouldYieldAllItemsInTheSameOrder(int itemsCount)
// Prepare {
using var list = new RecyclableQueue<string>(_testData); // Prepare
var data = RecyclableLongListTestData.CreateTestData(itemsCount).Select(i => i.ToString()).ToArray();
using var list = new RecyclableQueue<string>(data);
// Act // Act
var actual = new RecyclableLongList<string>(); var actual = new RecyclableLongList<string>();
using var enumerator = list.GetEnumerator(); using var enumerator = list.GetEnumerator();
while (enumerator.MoveNext()) while (enumerator.MoveNext())
{ {
actual.Add(enumerator.Current); actual.Add(enumerator.Current);
} }
// Validate // Validate
_ = actual.Should().ContainInConsecutiveOrder(_testData) _ = actual.Should().ContainInConsecutiveOrder(data)
.And.BeEquivalentTo(_testData); .And.BeEquivalentTo(data);
} }
} }
} }
Recyclable.CollectionsTests/RecyclableSortedListTests.cs
+46 -39
View File
@@ -7,17 +7,20 @@ namespace Recyclable.CollectionsTests
{ {
private static readonly (int, string)[] _testData = new[] { (5, "a"), (4, "d"), (3, "c"), (2, "b"), (1, "a") }; private static readonly (int, string)[] _testData = new[] { (5, "a"), (4, "d"), (3, "c"), (2, "b"), (1, "a") };
[Fact] [Theory]
public void ShouldBeSortedWhenCreated() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void ShouldBeSortedWhenCreated(int itemsCount)
// Act {
using var sortedList = new RecyclableSortedList<int, string>(_testData, 2); // Act
var data = RecyclableLongListTestData.CreateTestData(itemsCount)
.Select(x => (itemsCount - x + 1, x))
.ToArray();
using var sortedList = new RecyclableSortedList<long, long>(data, 2);
// Validate // Validate
_ = sortedList.Should().HaveCount(_testData.Length) _ = sortedList.Should().HaveCount(itemsCount)
.And.BeEquivalentTo(_testData) .And.BeInAscendingOrder(item => item.Key);
.And.BeInAscendingOrder((item) => item.Key); }
}
[Fact] [Fact]
public void ShouldBeEmptyWhenNotInitialized() public void ShouldBeEmptyWhenNotInitialized()
@@ -47,40 +50,44 @@ namespace Recyclable.CollectionsTests
.And.ContainInConsecutiveOrder(_testData); .And.ContainInConsecutiveOrder(_testData);
} }
[Fact] [Theory]
public void ShouldBeSortedWhenUpdateEnds() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void ShouldBeSortedWhenUpdateEnds(int itemsCount)
// Prepare {
using var sortedList = new RecyclableSortedList<int, string>(2); // Prepare
using var sortedList = new RecyclableSortedList<long, long>(2);
// Act // Act
sortedList.BeginUpdate(); sortedList.BeginUpdate();
foreach (var testItem in _testData) foreach (var value in RecyclableLongListTestData.CreateTestData(itemsCount))
{ {
sortedList.Add(testItem); sortedList.Add((itemsCount - value + 1, value));
} }
// Validate // Validate
_ = sortedList.Should().BeInDescendingOrder(x => x.Key); _ = sortedList.Should().BeInDescendingOrder(x => x.Key);
// Act // Act
sortedList.EndUpdate(); sortedList.EndUpdate();
// Validate // Validate
_ = sortedList.Should().BeInAscendingOrder(x => x.Key); _ = sortedList.Should().BeInAscendingOrder(x => x.Key);
} }
[Fact] [Theory]
public void ShouldBeEmptyAfterClear() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void ShouldBeEmptyAfterClear(int itemsCount)
// Prepare {
using var sortedList = new RecyclableSortedList<int, string>(_testData); // Prepare
var data = RecyclableLongListTestData.CreateTestData(itemsCount)
.Select(x => (x, x));
using var sortedList = new RecyclableSortedList<long, long>(data);
// Act // Act
sortedList.Clear(); sortedList.Clear();
// Validate // Validate
_ = sortedList.Should().BeEmpty(); _ = sortedList.Should().BeEmpty();
} }
} }
} }
Recyclable.CollectionsTests/RecyclableStackTests.cs
+103 -89
View File
@@ -7,112 +7,126 @@ namespace Recyclable.CollectionsTests
{ {
private static readonly string[] _testData = new[] { "a", "d", "c", "b", "a" }; private static readonly string[] _testData = new[] { "a", "d", "c", "b", "a" };
[Fact] [Theory]
public void GetEnumeratorShouldYieldAllItemsInReversedOrder() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void GetEnumeratorShouldYieldAllItemsInReversedOrder(int itemsCount)
// Prepare {
using var list = new RecyclableStack<string>(_testData); // Prepare
var data = RecyclableLongListTestData.CreateTestData(itemsCount).Select(i => i.ToString()).ToArray();
using var list = new RecyclableStack<string>(data);
// Act // Act
var actual = new RecyclableLongList<string>(); var actual = new RecyclableLongList<string>();
using var enumerator = list.GetEnumerator(); using var enumerator = list.GetEnumerator();
while (enumerator.MoveNext()) while (enumerator.MoveNext())
{ {
actual.Add(enumerator.Current); actual.Add(enumerator.Current);
} }
// Validate // Validate
_ = actual.Should().ContainInConsecutiveOrder(_testData.Reverse()); _ = actual.Should().ContainInConsecutiveOrder(data.Reverse());
} }
[Fact] [Theory]
public void ShouldNotBeSortedWhenCreated() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void ShouldNotBeSortedWhenCreated(int itemsCount)
// Act {
using var sortedList = new RecyclableStack<string>(_testData, 2); // Act
var data = RecyclableLongListTestData.CreateTestData(itemsCount).Select(i => i.ToString()).ToArray();
using var sortedList = new RecyclableStack<string>(data, 2);
// Validate // Validate
_ = sortedList.Should().HaveCount(_testData.Length) _ = sortedList.Should().HaveCount(itemsCount)
.And.ContainInConsecutiveOrder(_testData.Reverse()); .And.ContainInConsecutiveOrder(data.Reverse());
} }
[Fact] [Fact]
public void ShouldBeEmptyWhenNotInitialized() public void ShouldBeEmptyWhenNotInitialized()
{ {
// Act // Act
using var sortedList = new RecyclableStack<string>(2); using var sortedList = new RecyclableStack<string>(2);
// Validate // Validate
_ = sortedList.Should().BeEmpty(); _ = sortedList.Should().BeEmpty();
} }
[Fact] [Theory]
public void ShouldNotBeSortedWhenInitialized() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void ShouldNotBeSortedWhenInitialized(int itemsCount)
// Act {
using var sortedList = new RecyclableStack<string>(2) // Act
{ var data = RecyclableLongListTestData.CreateTestData(itemsCount).Select(i => i.ToString()).ToArray();
_testData[0], using var sortedList = new RecyclableStack<string>(2);
_testData[1], foreach (var item in data)
_testData[2], {
_testData[3], sortedList.Push(item);
_testData[4] }
};
// Validate // Validate
_ = sortedList.Should().NotBeEmpty() if (itemsCount == 0)
.And.ContainInConsecutiveOrder(_testData.Reverse()) {
.And.BeEquivalentTo(_testData); _ = sortedList.Should().BeEmpty();
} }
else
{
_ = sortedList.Should().NotBeEmpty()
.And.ContainInConsecutiveOrder(data.Reverse())
.And.BeEquivalentTo(data);
}
}
[Fact] [Theory]
public void ShouldBeEmptyAfterClear() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void ShouldBeEmptyAfterClear(int itemsCount)
// Prepare {
using var sortedList = new RecyclableStack<string>(_testData); // Prepare
var data = RecyclableLongListTestData.CreateTestData(itemsCount).Select(i => i.ToString()).ToArray();
using var sortedList = new RecyclableStack<string>(data);
// Act // Act
sortedList.Clear(); sortedList.Clear();
// Validate // Validate
_ = sortedList.Should().BeEmpty(); _ = sortedList.Should().BeEmpty();
} }
[Fact] [Theory]
public void PopShouldReturnItemsInReversedOrder() [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
{ public void PopShouldReturnItemsInReversedOrder(int itemsCount)
// Prepare {
using var list = new RecyclableStack<string>(); // Prepare
using var list = new RecyclableStack<string>();
// Act // Act
for (var itemIdx = 0; itemIdx < _testData.Length; itemIdx++) var data = RecyclableLongListTestData.CreateTestData(itemsCount).Select(i => i.ToString()).ToArray();
{ for (var itemIdx = 0; itemIdx < data.Length; itemIdx++)
list.Push(_testData[itemIdx]); {
} list.Push(data[itemIdx]);
}
var dequeuedItems = new RecyclableLongList<string>(); var dequeuedItems = new RecyclableLongList<string>();
while (list.LongCount > 0) while (list.LongCount > 0)
{ {
dequeuedItems.Add(list.Pop()); dequeuedItems.Add(list.Pop());
} }
// Validate // Validate
_ = dequeuedItems.Should().ContainInConsecutiveOrder(_testData.Reverse()); _ = dequeuedItems.Should().ContainInConsecutiveOrder(data.Reverse());
} }
[Fact] [Fact]
public void PopShoudRaiseArgumentOutOfRangeWhenNoMoreElementsFound() public void PopShouldRaiseArgumentOutOfRangeWhenNoMoreElementsFound()
{ {
// Prepare // Prepare
using var list = new RecyclableQueue<string>(_testData); using var list = new RecyclableStack<string>(_testData);
// Act // Act
while (list.LongCount > 0) while (list.LongCount > 0)
{ {
_ = list.Dequeue(); _ = list.Pop();
} }
_ = Assert.Throws<ArgumentOutOfRangeException>(() => list.Dequeue()); _ = Assert.Throws<ArgumentOutOfRangeException>(() => list.Pop());
} }
} }
} }