Files
Recyclable.Collections/Recyclable.CollectionsTests/RecyclableStackTests.cs
T
mlemanczyk aba28028b1 Performance & standardization improvements.
Business logic fixes.
RecyclableQueue & RecyclableStack added - pending improvements.
2023-01-06 13:54:32 +01:00

121 lines
2.5 KiB
C#

using FluentAssertions;
using Recyclable.Collections;
namespace Recyclable.CollectionsTests
{
[TestClass]
public class RecyclableStackTests
{
private static readonly string[] _testData = new[] { "a", "d", "c", "b", "a" };
[TestMethod]
public void GetEnumeratorShouldYieldAllItemsInReversedOrder()
{
// Prepare
using var list = new RecyclableStack<string>(_testData);
// Act
var actual = new RecyclableList<string>();
var enumerator = list.GetEnumerator();
while (enumerator.MoveNext())
{
actual.Add(enumerator.Current);
}
// Validate
_ = actual.Should().ContainInConsecutiveOrder(_testData.Reverse());
}
[TestMethod]
public void ShouldNotBeSortedWhenCreated()
{
// Act
using var sortedList = new RecyclableStack<string>(_testData, 2);
// Validate
_ = sortedList.Should().HaveCount(_testData.Length)
.And.ContainInConsecutiveOrder(_testData);
}
[TestMethod]
public void ShouldBeEmptyWhenNotInitialized()
{
// Act
using var sortedList = new RecyclableStack<string>(2);
// Validate
_ = sortedList.Should().BeEmpty();
}
[TestMethod]
public void ShouldNotBeSortedWhenInitialized()
{
// Act
using var sortedList = new RecyclableStack<string>(2)
{
_testData[0],
_testData[1],
_testData[2],
_testData[3],
_testData[4]
};
// Validate
_ = sortedList.Should().NotBeEmpty()
.And.ContainInConsecutiveOrder(_testData)
.And.BeEquivalentTo(_testData);
}
[TestMethod]
public void ShouldBeEmptyAfterClear()
{
// Prepare
using var sortedList = new RecyclableStack<string>(_testData);
// Act
sortedList.Clear();
// Validate
_ = sortedList.Should().BeEmpty();
}
[TestMethod]
public void PopShouldReturnItemsInReversedOrder()
{
// Prepare
using var list = new RecyclableStack<string>();
// Act
for (var itemIdx = 0; itemIdx < _testData.Length; itemIdx++)
{
list.Push(_testData[itemIdx]);
}
var dequeuedItems = new RecyclableList<string>();
while (list.LongCount > 0)
{
dequeuedItems.Add(list.Pop());
}
// Validate
_ = dequeuedItems.Should().ContainInConsecutiveOrder(_testData.Reverse());
}
[TestMethod]
[ExpectedException(typeof(ArgumentOutOfRangeException))]
public void PopShoudRaiseArgumentOutOfRangeWhenNoMoreElementsFound()
{
// Prepare
using var list = new RecyclableQueue<string>(_testData);
// Act
while (list.LongCount > 0)
{
_ = list.Dequeue();
}
_ = list.Dequeue();
}
}
}