Initial version extracted from Recyclable.Collections
This commit is contained in:
mlemanczyk committed
1 parent
01bbd5d04f
commit
4684330d7e
22 files changed
+2403
-1
No files matched your search
@@ -0,0 +1 @@
|
||||
global using Xunit;
|
||||
+28
@@ -0,0 +1,28 @@
|
||||
<Project Sdk="Microsoft.NET.Sdk">
|
||||
|
||||
<PropertyGroup>
|
||||
<TargetFrameworks>net6.0;net7.0</TargetFrameworks>
|
||||
<ImplicitUsings>enable</ImplicitUsings>
|
||||
<Nullable>enable</Nullable>
|
||||
|
||||
<IsPackable>false</IsPackable>
|
||||
<IsTestProject>true</IsTestProject>
|
||||
</PropertyGroup>
|
||||
|
||||
<ItemGroup>
|
||||
<PackageReference Include="FluentAssertions" Version="6.12.0" />
|
||||
<PackageReference Include="Microsoft.NET.Test.Sdk" Version="17.7.2" />
|
||||
<PackageReference Include="Recyclable.Collections" Version="0.0.6" />
|
||||
<PackageReference Include="Recyclable.Collections.TestData" Version="0.0.2" />
|
||||
<PackageReference Include="xunit" Version="2.5.3" />
|
||||
<PackageReference Include="xunit.runner.visualstudio" Version="2.5.3">
|
||||
<IncludeAssets>runtime; build; native; contentfiles; analyzers; buildtransitive</IncludeAssets>
|
||||
<PrivateAssets>all</PrivateAssets>
|
||||
</PackageReference>
|
||||
<PackageReference Include="coverlet.collector" Version="6.0.0">
|
||||
<IncludeAssets>runtime; build; native; contentfiles; analyzers; buildtransitive</IncludeAssets>
|
||||
<PrivateAssets>all</PrivateAssets>
|
||||
</PackageReference>
|
||||
</ItemGroup>
|
||||
|
||||
</Project>
|
||||
+953
@@ -0,0 +1,953 @@
|
||||
using FluentAssertions;
|
||||
using Recyclable.Collections;
|
||||
using Recyclable.Collections.TestData;
|
||||
using Recyclable.Collections.Pools;
|
||||
using System.Numerics;
|
||||
|
||||
#pragma warning disable xUnit1026, RCS1163, IDE0039, IDE0060, RCS1235
|
||||
|
||||
namespace Recyclable.CollectionsTests
|
||||
{
|
||||
public class RecyclableListCompatibilityListTests
|
||||
{
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void ConvertAllShouldConvertAllItems(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList().ConvertAll(item => item + 0.1);
|
||||
|
||||
// Act
|
||||
using var actual = list.ConvertAll(item => item + 0.1);
|
||||
|
||||
// Validate
|
||||
_ = actual.Count.Should().Be(itemsCount);
|
||||
_ = actual.Should().Equal(expectedData);
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void CopyToShouldCopyAllItemsInTheCorrectOrderWhenFromStart(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
long[] copiedItems = new long[itemsCount];
|
||||
|
||||
// Act
|
||||
list.CopyTo(copiedItems);
|
||||
|
||||
// Validate
|
||||
long[] expectedData = new long[itemsCount];
|
||||
testData.ToList().CopyTo(expectedData);
|
||||
|
||||
_ = copiedItems.Should().Equal(testData);
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void ExistsShouldFindAllItems(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
_ = testData.Any().Should().BeTrue("we need items on the list that we can look for");
|
||||
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expectedItem = expectedData[(int)itemIndex];
|
||||
var expected = expectedData.Exists(item => item == expectedItem);
|
||||
|
||||
// Act
|
||||
var actual = list.Exists(item => item == expectedItem);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void ExistsShouldNotFindNonExistingItems(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
_ = testData.Any().Should().BeTrue("we need items on the list that we can look for");
|
||||
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expectedItem = expectedData[(int)itemIndex];
|
||||
var expected = expectedData.Exists(item => item == -expectedItem);
|
||||
|
||||
// Act
|
||||
var actual = list.Exists(item => item == -expectedItem);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindAllIndexesShouldReturnCorrectIndexes(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
//* There is no equivalent of .FindAllIndexes in List<T>, so no comparison here.
|
||||
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
// Act
|
||||
using var actual = list.FindAllIndexes(item => item == itemIndex + 1);
|
||||
|
||||
// Validate
|
||||
_ = actual.Count.Should().Be(1);
|
||||
if (itemsCount > 0)
|
||||
{
|
||||
_ = actual.Count.Should().Be(1);
|
||||
_ = actual.Should().AllSatisfy(x => x.Should().Be((int)itemIndex));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindAllShouldReturnCorrectIndexes(int itemsCount)
|
||||
{
|
||||
const int ExpectedItem = 1;
|
||||
|
||||
// Prepare
|
||||
var testData = Enumerable.Range(0, itemsCount).Select(value => value % 2 == 0 ? ExpectedItem : -ExpectedItem);
|
||||
using var list = new RecyclableList<int>(testData, itemsCount);
|
||||
|
||||
// Act
|
||||
using var actual = list.FindAll(x => x == ExpectedItem);
|
||||
|
||||
// Validate
|
||||
var expectedData = testData.ToList().FindAll(x => x == ExpectedItem);
|
||||
|
||||
_ = actual.Count.Should().Be(expectedData.Count);
|
||||
_ = actual.Should().Equal(expectedData);
|
||||
if (expectedData.Count > 0)
|
||||
{
|
||||
_ = actual.Should().AllSatisfy(x => x.Should().Be(ExpectedItem)).And.Equal(expectedData);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindAllShouldNotFindNonExistingItems(int itemsCount)
|
||||
{
|
||||
const int ExpectedItem = 1;
|
||||
|
||||
// Prepare
|
||||
var testData = Enumerable.Range(0, itemsCount).Select(_ => ExpectedItem);
|
||||
using var list = new RecyclableList<int>(testData, itemsCount);
|
||||
|
||||
// Act
|
||||
using var foundItems = list.FindAll(x => x == -ExpectedItem);
|
||||
|
||||
// Validate
|
||||
var expectedData = testData.ToList().FindAll(x => x == -ExpectedItem);
|
||||
|
||||
_ = foundItems.Count.Should().Be(expectedData.Count);
|
||||
_ = foundItems.Should().Equal(expectedData);
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindIndexShouldReturnCorrectIndexes(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expectedItem = expectedData[(int)itemIndex];
|
||||
|
||||
// Act
|
||||
var actual = list.FindIndex(item => item == expectedItem);
|
||||
|
||||
// Validate
|
||||
var expected = expectedData.FindIndex(item => item == expectedItem);
|
||||
|
||||
_ = actual.Should().Be((int)itemIndex).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindIndexShouldReturnCorrectIndexesWhenConstrainedCount(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expectedItem = expectedData[(int)itemIndex];
|
||||
var expected = expectedData.FindIndex((int)itemIndex, (int)(itemsCount - itemIndex), item => item == expectedItem);
|
||||
|
||||
// Act
|
||||
var actual = list.FindIndex((int)itemIndex, (int)(itemsCount - itemIndex), item => item == expectedItem);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be((int)itemIndex).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindIndexShouldReturnCorrectIndexesWhenConstrainedIndex(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expectedItem = expectedData[(int)itemIndex];
|
||||
var expected = expectedData.FindIndex(Math.Min(1, (int)itemIndex), item => item == expectedItem);
|
||||
|
||||
// Act
|
||||
var actual = list.FindIndex(Math.Min(1, (int)itemIndex), item => item == expectedItem);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be((int)itemIndex).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindLastIndexShouldReturnCorrectIndexes(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expectedItem = expectedData[(int)itemIndex];
|
||||
var expected = expectedData.FindLastIndex(x => x == expectedItem);
|
||||
|
||||
// Act
|
||||
var actual = list.FindLastIndex(x => x == expectedItem);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be((int)itemIndex).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindLastIndexShouldReturnCorrectIndexesWhenConstrainedCount(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expectedItem = expectedData[(int)itemIndex];
|
||||
|
||||
// Act & Validate
|
||||
var expected = expectedData.FindLastIndex(itemsCount - 1, itemsCount, x => x == expectedItem);
|
||||
_ = list.FindLastIndex(itemsCount - 1, itemsCount, x => x == expectedItem).Should().Be((int)itemIndex).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindLastIndexShouldReturnCorrectIndexesWhenConstrainedIndex(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expectedItem = expectedData[(int)itemIndex];
|
||||
var expected = expectedData.FindLastIndex(itemsCount - 1, x => x == expectedItem);
|
||||
|
||||
// Act
|
||||
var actual = list.FindLastIndex(itemsCount - 1, x => x == expectedItem);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be((int)itemIndex).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindLastIndexShouldThrowArgumentOutOfRange(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expectedItem = expectedData[(int)itemIndex];
|
||||
int expected = int.MinValue;
|
||||
|
||||
// Act & Validate
|
||||
if (itemsCount - 1 != -1)
|
||||
{
|
||||
Assert.Throws<ArgumentOutOfRangeException>(() => expected = expectedData.FindLastIndex(itemsCount - 1, itemsCount + 3, x => x == expectedItem));
|
||||
Assert.Throws<ArgumentOutOfRangeException>(() => _ = list.FindLastIndex(itemsCount - 1, itemsCount + 3, x => x == expectedItem).Should().Be((int)itemIndex).And.Be(expected));
|
||||
}
|
||||
else
|
||||
{
|
||||
expected = expectedData.FindLastIndex(itemsCount - 1, itemsCount + 3, x => x == expectedItem);
|
||||
_ = list.FindLastIndex(itemsCount - 1, itemsCount + 3, x => x == expectedItem).Should().Be((int)itemIndex).And.Be(expected);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindLastShouldReturnCorrectItem(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expectedItem = expectedData[(int)itemIndex];
|
||||
var expected = expectedData.FindLast(item => item == expectedItem);
|
||||
|
||||
// Act
|
||||
var actual = list.FindLast(item => item == expectedItem);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be(expectedData[(int)itemIndex]).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindShouldFindAllItems(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
_ = testData.Any().Should().BeTrue("we need items on the list that we can look for");
|
||||
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
long expectedItem = expectedData[(int)itemIndex];
|
||||
var expected = expectedData.Find(item => item == expectedItem);
|
||||
|
||||
// Act
|
||||
var actual = list.Find(item => item == expectedData[(int)itemIndex]);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be(expectedData[(int)itemIndex]);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void FindShouldNotFindNonExistingItems(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
_ = testData.Any().Should().BeTrue("we need items on the list that we can look for");
|
||||
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expected = expectedData.Find(item => item == -expectedData[(int)itemIndex]);
|
||||
|
||||
// Act
|
||||
var actual = list.Find(item => item == -expectedData[(int)itemIndex]);
|
||||
|
||||
// Validate
|
||||
actual.Should().Be(0).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void ForEachShouldGiveItemsInCorrectOrder(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
var expected = new List<long>(itemsCount);
|
||||
expectedData.ForEach(expected.Add);
|
||||
|
||||
// Act
|
||||
var yieldedItems = new List<long>(itemsCount);
|
||||
list.ForEach(yieldedItems.Add);
|
||||
|
||||
// Validate
|
||||
_ = yieldedItems.Should().Equal(testData).And.Equal(expected);
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.EmptySourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void ForEachShouldDoNothingWhenEmptyList(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
var expected = new List<long>(itemsCount);
|
||||
expectedData.ForEach(expected.Add);
|
||||
|
||||
// Act
|
||||
var yieldedItems = new List<long>(itemsCount);
|
||||
list.ForEach(item => yieldedItems.Add(item));
|
||||
|
||||
// Validate
|
||||
_ = yieldedItems.Should().BeEmpty().And.Equal(expected);
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void GetRangeShouldReturnCorrectItems(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
_ = testData.Any().Should().BeTrue("we need items on the list that we can look for");
|
||||
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
int startingIndex = (int)Math.Min(1, itemIndex);
|
||||
var expectedRangeItems = expectedData.GetRange(startingIndex, (int)itemIndex);
|
||||
|
||||
// Act
|
||||
using var rangeItems = list.GetRange(startingIndex, (int)itemIndex);
|
||||
|
||||
// Validate
|
||||
_ = rangeItems.Count.Should().Be(expectedRangeItems.Count);
|
||||
_ = rangeItems.Should().Equal(expectedRangeItems);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void IndexOfShouldReturnCorrectIndexesWhenConstrainedCount(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expected = expectedData.IndexOf(expectedData[(int)itemIndex], (int)itemIndex, (int)(itemsCount - itemIndex));
|
||||
|
||||
// Act
|
||||
var actual = list.IndexOf(expectedData[(int)itemIndex], (int)itemIndex, (int)(itemsCount - itemIndex));
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be((int)itemIndex).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void IndexOfShouldReturnCorrectIndexesWhenConstrainedIndex(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expected = expectedData.IndexOf(expectedData[(int)itemIndex], (int)itemIndex);
|
||||
|
||||
// Act
|
||||
var actual = list.IndexOf(expectedData[(int)itemIndex], (int)itemIndex);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be((int)itemIndex).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void LastIndexOfShouldReturnCorrectIndexes(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expected = expectedData.LastIndexOf(expectedData[(int)itemIndex]);
|
||||
|
||||
// Act
|
||||
var actual = list.LastIndexOf(expectedData[(int)itemIndex]);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be((int)itemIndex).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void LastIndexOfShouldReturnCorrectIndexesWhenConstrainedCount(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expected = expectedData.LastIndexOf(expectedData[(int)itemIndex], itemsCount - 1, itemsCount);
|
||||
|
||||
// Act
|
||||
var actual = list.LastIndexOf(expectedData[(int)itemIndex], itemsCount - 1, itemsCount);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be((int)itemIndex).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void LastIndexOfShouldReturnCorrectIndexesWhenConstrainedIndex(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
var expected = expectedData.LastIndexOf(expectedData[(int)itemIndex], itemsCount - 1);
|
||||
|
||||
// Act
|
||||
var actual = list.LastIndexOf(expectedData[(int)itemIndex], itemsCount - 1);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be((int)itemIndex).And.Be(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void LastIndexOfShouldThrowArgumentOutOfRangeWhenCountTooBig(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
// Act & Validate
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
_ = Assert.Throws<ArgumentOutOfRangeException>(() => _ = expectedData.LastIndexOf(expectedData[(int)itemIndex], itemsCount - 1, itemsCount + 3).Should().Be((int)itemIndex));
|
||||
_ = Assert.Throws<ArgumentOutOfRangeException>(() => _ = list.LastIndexOf(expectedData[(int)itemIndex], itemsCount - 1, itemsCount + 3).Should().Be((int)itemIndex));
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void InsertRangeShouldMoveItems(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData.Reverse(), itemsCount);
|
||||
var expectedItems = testData.Reverse().ToList();
|
||||
var item = expectedItems[^1];
|
||||
expectedItems.InsertRange((int)itemIndex, testData);
|
||||
|
||||
// Act
|
||||
list.InsertRange((int)itemIndex, testData);
|
||||
|
||||
// Validate
|
||||
_ = list[(int)itemIndex].Should().Be(item);
|
||||
_ = list.Count.Should().Be(itemsCount << 1);
|
||||
_ = list.Capacity.Should().BeGreaterThanOrEqualTo(itemsCount << 1);
|
||||
_ = list.Should().Equal(expectedItems);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void RemoveAllShouldRemoveTheCorrectItems(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var itemsToRemove = itemIndexes.Select(x => list[(int)x]).ToArray();
|
||||
var expectedItems = testData.ToList();
|
||||
var expectedResult = expectedItems.RemoveAll(itemsToRemove.Contains);
|
||||
|
||||
// Act
|
||||
var actualResult = list.RemoveAll(itemsToRemove.Contains);
|
||||
|
||||
// Validate
|
||||
_ = actualResult.Should().Be(expectedResult);
|
||||
_ = list.Capacity.Should().BeGreaterThanOrEqualTo(itemsCount);
|
||||
_ = list.Count.Should().Be(itemsCount - itemsToRemove.Length);
|
||||
_ = list.Should().Equal(expectedItems);
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void RemoveRangeShouldRemoveCorrectItems(string testCase, IEnumerable<long> testData, int itemsCount, in long[] itemIndexes)
|
||||
{
|
||||
_ = testData.Any().Should().BeTrue("we need items on the list that we can look for");
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
int startingIndex = (int)Math.Min(1, itemIndex);
|
||||
var expectedData = testData.ToList();
|
||||
expectedData.RemoveRange(startingIndex, (int)itemIndex);
|
||||
|
||||
// Act
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
list.RemoveRange(startingIndex, (int)itemIndex);
|
||||
|
||||
// Validate
|
||||
_ = list.Count.Should().Be(expectedData.Count);
|
||||
_ = list.Should().Equal(expectedData);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void ReverseShouldSwapItemsInCorrectOrder(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedData = testData.ToList();
|
||||
expectedData.Reverse();
|
||||
|
||||
// Act
|
||||
list.Reverse();
|
||||
|
||||
// Validate
|
||||
_ = list.Should().Equal(expectedData);
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void ReverseShouldSwapItemsInCorrectOrderWhenConstrained(string testCase, IEnumerable<long> testData, int itemsCount, long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
var expectedData = testData.ToArray();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var startingItemIndex = (int)Math.Min(1, itemIndex);
|
||||
var expectedRangeItems = expectedData.ToList();
|
||||
expectedRangeItems.Reverse(startingItemIndex, (int)itemIndex);
|
||||
|
||||
// Act
|
||||
list.Reverse(startingItemIndex, (int)itemIndex);
|
||||
|
||||
// Validate
|
||||
_ = list.Should().Equal(expectedRangeItems);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void SortShouldSortItemsInCorrectOrder(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData.Reverse(), itemsCount);
|
||||
var expectedData = testData.Reverse().ToList();
|
||||
expectedData.Sort();
|
||||
|
||||
// Act
|
||||
list.Sort();
|
||||
|
||||
// Validate
|
||||
_ = list.Should().Equal(expectedData);
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void SortShouldSortItemsInCorrectOrderWhenWithComparer(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData.Reverse(), itemsCount);
|
||||
IComparer<long> comparer = Comparer<long>.Default;
|
||||
var expectedData = testData.Reverse().ToList();
|
||||
expectedData.Sort(comparer);
|
||||
|
||||
// Act
|
||||
list.Sort(comparer);
|
||||
|
||||
// Validate
|
||||
_ = list.Should().Equal(expectedData);
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void SortShouldSortItemsInCorrectOrderWhenWithComparison(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData.Reverse(), itemsCount);
|
||||
|
||||
static int comparison(long x, long y)
|
||||
{
|
||||
return (x - y) switch
|
||||
{
|
||||
> 0 => 1,
|
||||
< 0 => -1,
|
||||
_ => 0,
|
||||
};
|
||||
}
|
||||
|
||||
var expectedData = testData.Reverse().ToList();
|
||||
expectedData.Sort(comparison);
|
||||
|
||||
// Act
|
||||
list.Sort(comparison);
|
||||
|
||||
// Validate
|
||||
_ = list.Should().Equal(expectedData);
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void SortShouldSortItemsInCorrectOrderWhenConstrained(string testCase, IEnumerable<long> testData, int itemsCount, long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
IComparer<long> comparer = Comparer<long>.Default;
|
||||
var expectedData = testData.Reverse().ToArray();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData.Reverse(), itemsCount);
|
||||
var startingIndex = (int)Math.Min(1, itemIndex);
|
||||
|
||||
var expectedSortedData = expectedData.ToList();
|
||||
expectedSortedData.Sort(startingIndex, (int)itemIndex, comparer);
|
||||
|
||||
// Act
|
||||
list.Sort(startingIndex, (int)itemIndex, comparer);
|
||||
|
||||
// Validate
|
||||
_ = list.Should().Equal(expectedSortedData);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void TrimExcessShouldDecreaseCapacity(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedCapacity = itemsCount >= RecyclableDefaults.InitialCapacity ? itemsCount : RecyclableDefaults.InitialCapacity;
|
||||
|
||||
// Act
|
||||
list.TrimExcess();
|
||||
|
||||
// Validate
|
||||
_ = list.Capacity.Should().Be(expectedCapacity);
|
||||
_ = list.Count.Should().Be(itemsCount);
|
||||
_ = list.Should().Equal(testData);
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void TrimExcessShouldNotBreakAdd(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedCapacity = (int)BitOperations.RoundUpToPowerOf2((uint)itemsCount + 1);
|
||||
expectedCapacity = expectedCapacity >= RecyclableDefaults.InitialCapacity ? expectedCapacity : RecyclableDefaults.InitialCapacity;
|
||||
|
||||
// Act
|
||||
list.TrimExcess();
|
||||
list.Add(-1);
|
||||
|
||||
// Validate
|
||||
_ = list.Capacity.Should().Be(expectedCapacity);
|
||||
_ = list.Count.Should().Be(itemsCount + 1);
|
||||
_ = list.Should().Equal(testData.Append(-1));
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void TrimExcessShouldNotBreakAddRange(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedCapacity = (int)BitOperations.RoundUpToPowerOf2(checked((uint)itemsCount << 1));
|
||||
expectedCapacity = expectedCapacity >= RecyclableDefaults.InitialCapacity ? expectedCapacity : RecyclableDefaults.InitialCapacity;
|
||||
|
||||
// Act
|
||||
list.TrimExcess();
|
||||
list.AddRange(testData);
|
||||
|
||||
// Validate
|
||||
_ = list.Capacity.Should().BeGreaterThanOrEqualTo(expectedCapacity);
|
||||
_ = list.Count.Should().Be(itemsCount << 1);
|
||||
_ = list.Should().Equal(testData.Concat(testData));
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void TrimExcessShouldNotBreakClear(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
|
||||
// Act
|
||||
list.TrimExcess();
|
||||
list.Clear();
|
||||
|
||||
// Validate
|
||||
_ = list.Capacity.Should().Be(Math.Max(RecyclableDefaults.InitialCapacity, itemsCount));
|
||||
_ = list.Count.Should().Be(0);
|
||||
_ = list.Should().BeEmpty();
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void TrimExcessShouldNotBreakInsert(string testCase, IEnumerable<long> testData, int itemsCount, long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
var expectedCapacity = (int)BitOperations.RoundUpToPowerOf2((uint)itemsCount + 1);
|
||||
expectedCapacity = expectedCapacity >= RecyclableDefaults.InitialCapacity ? expectedCapacity : RecyclableDefaults.InitialCapacity;
|
||||
var expectedData = testData.ToArray();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedItemsAfterInsert = expectedData.ToList();
|
||||
expectedItemsAfterInsert.Insert((int)itemIndex, -3);
|
||||
|
||||
// Act
|
||||
list.TrimExcess();
|
||||
list.Insert((int)itemIndex, -3);
|
||||
|
||||
// Validate
|
||||
_ = list.Capacity.Should().BeGreaterThanOrEqualTo(expectedCapacity);
|
||||
_ = list.Count.Should().Be(expectedItemsAfterInsert.Count);
|
||||
_ = list.Should().Equal(expectedItemsAfterInsert);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void TrimExcessShouldNotBreakRemove(string testCase, IEnumerable<long> testData, int itemsCount, long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
var expectedData = testData.ToArray();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
var expectedItemsAfterInsert = expectedData.ToList();
|
||||
expectedItemsAfterInsert.RemoveAt((int)itemIndex);
|
||||
|
||||
// Act
|
||||
list.TrimExcess();
|
||||
list.RemoveAt((int)itemIndex);
|
||||
|
||||
// Validate
|
||||
_ = list.Capacity.Should().BeGreaterThanOrEqualTo(itemsCount);
|
||||
_ = list.Count.Should().Be(expectedItemsAfterInsert.Count);
|
||||
_ = list.Should().Equal(expectedItemsAfterInsert);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void TrimExcessShouldNotBreakIndexOf(string testCase, IEnumerable<long> testData, int itemsCount, long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
var expectedData = testData.ToArray();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
|
||||
// Act
|
||||
list.TrimExcess();
|
||||
var actual = list.IndexOf(expectedData[(int)itemIndex]);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be((int)itemIndex);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void TrimmedArraysShouldNotBePooled(string testCase, IEnumerable<long> testData, int itemsCount)
|
||||
{
|
||||
// Prepare
|
||||
using var list = new RecyclableList<long>(testData, itemsCount);
|
||||
|
||||
// Act
|
||||
list.TrimExcess();
|
||||
var trimmedMemoryBlock = list.AsArray;
|
||||
|
||||
list.Dispose();
|
||||
|
||||
// Validate
|
||||
_ = list.Capacity.Should().Be(0);
|
||||
_ = list.Count.Should().Be(0);
|
||||
_ = list.Should().BeEmpty();
|
||||
|
||||
if (itemsCount >= RecyclableDefaults.MinPooledArrayLength)
|
||||
{
|
||||
var newMemoryBlock = RecyclableArrayPool<long>.RentShared(itemsCount);
|
||||
_ = BitOperations.IsPow2(itemsCount)
|
||||
? newMemoryBlock.Should().BeSameAs(trimmedMemoryBlock)
|
||||
: newMemoryBlock.Should().NotBeSameAs(trimmedMemoryBlock);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void TrueForAllShouldBeFalseWhenNoMatch(string testCase, IEnumerable<long> testData, int itemsCount, long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
var expectedData = testData.ToList();
|
||||
|
||||
foreach (var itemIndex in itemIndexes)
|
||||
{
|
||||
using RecyclableList<long> list = new(testData, itemsCount);
|
||||
Predicate<long> condition = item => item == itemIndex;
|
||||
var expected = expectedData.TrueForAll(condition);
|
||||
|
||||
// Act
|
||||
var actual = list.TrueForAll(condition);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be(expected).And.BeFalse();
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[MemberData(nameof(RecyclableLongListTestData.SourceDataWithItemIndexVariants), MemberType = typeof(RecyclableLongListTestData))]
|
||||
public void TrueForAllShouldBeTrueWhenMatched(string testCase, IEnumerable<long> testData, int itemsCount, long[] itemIndexes)
|
||||
{
|
||||
// Prepare
|
||||
using RecyclableList<long> list = new(testData, itemsCount);
|
||||
int index = 0;
|
||||
Predicate<long> condition = item => item == ++index;
|
||||
var expected = testData.ToList().TrueForAll(condition);
|
||||
|
||||
index = 0;
|
||||
|
||||
// Act
|
||||
var actual = list.TrueForAll(condition);
|
||||
|
||||
// Validate
|
||||
_ = actual.Should().Be(expected).And.BeTrue();
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in new issue
Block a user