Initial RecyclableLongList.InsertRange() implementation. Before optimization.
This commit is contained in:
1 parent
5d27fb599a
commit
a00b147304
7 files changed
+2410
-148
No files matched your search
@@ -16,8 +16,8 @@
|
||||
<PrivateAssets>all</PrivateAssets>
|
||||
<IncludeAssets>runtime; build; native; contentfiles; analyzers; buildtransitive</IncludeAssets>
|
||||
</PackageReference>
|
||||
<PackageReference Include="Recyclable.Collections.TestData" Version="0.0.3.4" />
|
||||
<PackageReference Include="Recyclable.Collections.TestData.xUnit" Version="0.0.0.1" />
|
||||
<PackageReference Include="Recyclable.Collections.TestData" Version="0.0.3.5" />
|
||||
<PackageReference Include="Recyclable.Collections.TestData.xUnit" Version="0.0.0.2" />
|
||||
<PackageReference Include="xunit" Version="2.6.4" />
|
||||
<PackageReference Include="xunit.runner.console" Version="2.6.4">
|
||||
<PrivateAssets>all</PrivateAssets>
|
||||
|
||||
@@ -1,100 +0,0 @@
|
||||
using FluentAssertions;
|
||||
using Recyclable.Collections;
|
||||
using Recyclable.Collections.TestData.xUnit;
|
||||
using System.Collections;
|
||||
|
||||
namespace Recyclable.CollectionsTests
|
||||
{
|
||||
|
||||
public class RecyclableLongListHelperTests
|
||||
{
|
||||
[Theory]
|
||||
[ClassData(typeof(SourceDataWithBlockSizeWithItemIndexWithRangeTheoryData))]
|
||||
public void MakeRoomAndSetShouldMoveItems(string testCase, IEnumerable<long> testData, int itemsCount, int minBlockSize, in (long ItemIndex, long RangedItemsCount)[] itemRanges)
|
||||
{
|
||||
// Prepare
|
||||
var expectedData = testData.Reverse().ToArray();
|
||||
|
||||
foreach ((var itemIndex, var rangedItemsCount) in itemRanges)
|
||||
{
|
||||
using var list = new RecyclableLongList<long>(testData.Reverse(), minBlockSize, itemsCount);
|
||||
var expected = expectedData.ToList();
|
||||
var rangedTestData = expected.GetRange((int)itemIndex, (int)rangedItemsCount).ToArray();
|
||||
expected.InsertRange((int)itemIndex, rangedTestData);
|
||||
|
||||
if (testCase.Contains("Array[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
list.InsertRange((int)itemIndex, rangedTestData);
|
||||
}
|
||||
else if (testCase.Contains("ICollection[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
return;
|
||||
//list.InsertRange((int)itemIndex, (ICollection)testData);
|
||||
}
|
||||
else if (testCase.Contains("ICollection<T>[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
return;
|
||||
//list.InsertRange((int)itemIndex, (ICollection<long>)testData);
|
||||
}
|
||||
else if (testCase.Contains("IEnumerable[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
return;
|
||||
//list.InsertRange((int)itemIndex, (IEnumerable)testData);
|
||||
}
|
||||
else if (testCase.Contains("IReadOnlyList<T>[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
return;
|
||||
//list.InsertRange((int)itemIndex, (IReadOnlyList<long>)testData);
|
||||
}
|
||||
else if (testCase.Contains("ReadOnlySpan<T>[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
return;
|
||||
//list.InsertRange((int)itemIndex, new ReadOnlySpan<long>((long[])testData));
|
||||
}
|
||||
else if (testCase.Contains("Span<T>[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
return;
|
||||
//list.InsertRange((int)itemIndex, new Span<long>((long[])testData));
|
||||
}
|
||||
else if (testData is long[] testDataArray)
|
||||
{
|
||||
return;
|
||||
//list.InsertRange((int)itemIndex, testDataArray);
|
||||
}
|
||||
else if (testData is List<long> testDataList)
|
||||
{
|
||||
return;
|
||||
//list.InsertRange((int)itemIndex, testDataList);
|
||||
}
|
||||
else if (testData is RecyclableList<long> testDataRecyclableList)
|
||||
{
|
||||
return;
|
||||
//list.InsertRange((int)itemIndex, testDataRecyclableList);
|
||||
}
|
||||
else if (testData is RecyclableLongList<long> testDataRecyclableLongList)
|
||||
{
|
||||
return;
|
||||
//list.InsertRange((int)itemIndex, testDataRecyclableLongList);
|
||||
}
|
||||
else if (testData is IList<long> testDataIList)
|
||||
{
|
||||
return;
|
||||
//list.InsertRange((int)itemIndex, testDataIList);
|
||||
}
|
||||
else if (testData is IEnumerable<long> testDataIEnumerable)
|
||||
{
|
||||
return;
|
||||
//list.InsertRange((int)itemIndex, testDataIEnumerable);
|
||||
}
|
||||
else
|
||||
{
|
||||
throw new InvalidCastException("Unknown type of test data");
|
||||
}
|
||||
|
||||
// Validate
|
||||
list.Count.Should().Be(expected.Count);
|
||||
_ = list.Should().Equal(expected);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -998,6 +998,85 @@ namespace Recyclable.CollectionsTests
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[ClassData(typeof(SourceDataWithBlockSizeWithItemIndexWithRangeTheoryData))]
|
||||
public void InsertRangeShouldMoveItems(string testCase, IEnumerable<long> testData, int itemsCount, int minBlockSize, in (long ItemIndex, long RangedItemsCount)[] itemRanges)
|
||||
{
|
||||
// Prepare
|
||||
var expectedData = testData.Reverse().ToArray();
|
||||
|
||||
foreach ((var itemIndex, var rangedItemsCount) in itemRanges)
|
||||
{
|
||||
using var list = new RecyclableLongList<long>(testData.Reverse(), minBlockSize, itemsCount);
|
||||
var expected = expectedData.ToList();
|
||||
var rangedTestData = expected.GetRange((int)itemIndex, (int)rangedItemsCount).ToArray();
|
||||
expected.InsertRange((int)itemIndex, rangedTestData);
|
||||
|
||||
if (testCase.Contains("Array[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
list.InsertRange((int)itemIndex, (Array)rangedTestData);
|
||||
}
|
||||
else if (testCase.Contains("ICollection[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
list.InsertRange((int)itemIndex, (ICollection)rangedTestData);
|
||||
}
|
||||
else if (testCase.Contains("ICollection<T>[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
list.InsertRange((int)itemIndex, (ICollection<long>)rangedTestData);
|
||||
}
|
||||
else if (testCase.Contains("IEnumerable[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
list.InsertRange((int)itemIndex, (IEnumerable)rangedTestData);
|
||||
}
|
||||
else if (testCase.Contains("IReadOnlyList<T>[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
list.InsertRange((int)itemIndex, (IReadOnlyList<long>)rangedTestData);
|
||||
}
|
||||
else if (testCase.Contains("ReadOnlySpan<T>[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
list.InsertRange((int)itemIndex, new ReadOnlySpan<long>(rangedTestData));
|
||||
}
|
||||
else if (testCase.Contains("Span<T>[", StringComparison.OrdinalIgnoreCase))
|
||||
{
|
||||
list.InsertRange((int)itemIndex, new Span<long>(rangedTestData));
|
||||
}
|
||||
else if (testData is long[] testDataArray)
|
||||
{
|
||||
list.InsertRange((int)itemIndex, rangedTestData);
|
||||
}
|
||||
else if (testData is List<long> testDataList)
|
||||
{
|
||||
list.InsertRange((int)itemIndex, rangedTestData.ToList());
|
||||
}
|
||||
else if (testData is RecyclableList<long> testDataRecyclableList)
|
||||
{
|
||||
using RecyclableList<long> rangedTestDataRecyclableList = rangedTestData.ToRecyclableList();
|
||||
list.InsertRange((int)itemIndex, rangedTestDataRecyclableList);
|
||||
}
|
||||
else if (testData is RecyclableLongList<long> testDataRecyclableLongList)
|
||||
{
|
||||
using RecyclableLongList<long> rangedTestDataRecyclableList = rangedTestData.ToRecyclableLongList();
|
||||
list.InsertRange((int)itemIndex, rangedTestDataRecyclableList);
|
||||
}
|
||||
else if (testData is IList<long> testDataIList)
|
||||
{
|
||||
list.InsertRange((int)itemIndex, (IList<long>)rangedTestData);
|
||||
}
|
||||
else if (testData is IEnumerable<long> testDataIEnumerable)
|
||||
{
|
||||
list.InsertRangeEnumerated((int)itemIndex, (IEnumerable<long>)rangedTestData);
|
||||
}
|
||||
else
|
||||
{
|
||||
throw new InvalidCastException("Unknown type of test data");
|
||||
}
|
||||
|
||||
// Validate
|
||||
list.Count.Should().Be(expected.Count);
|
||||
_ = list.Should().Equal(expected);
|
||||
}
|
||||
}
|
||||
|
||||
[Theory]
|
||||
[ClassData(typeof(SourceDataWithBlockSizeWithItemIndexTheoryData))]
|
||||
public void InsertShouldMoveItemsWhenLong(string testCase, IEnumerable<long> testData, long itemsCount, int targetBlockSize, in long[] itemIndexes)
|
||||
|
||||
Reference in new issue
Block a user