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

Initial version of RecyclableBlockList implemented.

Browse Source 
Tests switched to xUnit in hope to avoid stability issues.
This commit is contained in:
mlemanczyk committed 2023-01-07 20:52:01 +01:00
1 parent aba28028b1
commit 93b8dc5317
17 files changed
+969 -228
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

Recyclable.Collections.Benchmarks/DelegateVsComparerBenchmark.cs
-1
View File
@@ -1,6 +1,5 @@
using BenchmarkDotNet.Attributes;
using MiscUtil;
using MiscUtil.Extensions;
namespace Recyclable.Collections.Benchmarks
{
Recyclable.Collections.Benchmarks/ListVsLinkedListBenchmark.cs
+108 -52
View File
@@ -5,9 +5,23 @@ namespace Recyclable.Collections.Benchmarks
[MemoryDiagnoser]
public class ListVsLinkedListBenchmark
{
private const int _objectCount = 1_000_000;
private const int _blockSize = 100_000;
private static readonly object[] _testObjects = Enumerable.Range(1, _objectCount).Select(x => new object()).ToArray();
//[Params(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 128, 256, 512, 1024, 2048, 4096, 8192, 1_000_000)]
public int TestObjectCount = 1_000_000;
public int BlockSize => TestObjectCount switch
{
0 => 1,
> 0 and <= 10 => TestObjectCount,
_ => TestObjectCount / 10
};
private object[]? _testObjects;
public ListVsLinkedListBenchmark()
{
_ = TestObjects;
}
private object[] TestObjects => _testObjects ??= Enumerable.Range(1, TestObjectCount).Select(x => new object()).ToArray();
private static void DoNothing<T>(T obj)
{
@@ -17,10 +31,12 @@ namespace Recyclable.Collections.Benchmarks
[Benchmark]
public void Array()
{
var list = new object[_testObjects.LongLength];
for (var i = 0; i < _testObjects.Length; i++)
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new object[dataCount];
for (var i = 0; i < dataCount; i++)
{
list[i] = _testObjects[i];
list[i] = data[i];
}
for (var i = 0; i < list.LongLength; i++)
@@ -29,18 +45,39 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
public void RecyclableBlockList()
{
var data = TestObjects;
var dataCount = TestObjectCount;
using var list = new RecyclableBlockList<object>(initialCapacity: dataCount);
for (var i = 0; i < dataCount; i++)
{
list.Add(data[i]);
}
for (var i = 0; i < list.LongCount; i++)
{
DoNothing(list[i]);
}
list.Clear();
}
[Benchmark(Baseline = true)]
public void RecyclableList()
{
using var list = new RecyclableList<object>(_blockSize);
for (var i = 0; i < _testObjects.LongLength; i++)
var data = TestObjects;
var dataCount = TestObjectCount;
using var list = new RecyclableList<object>(BlockSize, initialCapacity: dataCount);
for (var i = 0; i < dataCount; i++)
{
list.Add(_testObjects[i]);
list.Add(data[i]);
}
for (var i = 0; i < list.Count; i++)
for (var i = 0; i < list.LongCount; i++)
{
DoNothing(_testObjects[i]);
DoNothing(list[i]);
}
list.Clear();
@@ -49,10 +86,12 @@ namespace Recyclable.Collections.Benchmarks
[Benchmark]
public void List()
{
var list = new List<object>();
for (var i = 0; i < _testObjects.LongLength; i++)
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new List<object>(capacity: dataCount);
for (var i = 0; i < dataCount; i++)
{
list.Add(_testObjects[i]);
list.Add(data[i]);
}
for (var i = 0; i < list.Count; i++)
@@ -66,10 +105,12 @@ namespace Recyclable.Collections.Benchmarks
//[Benchmark]
public void LinkedList()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new LinkedList<object>();
for (var i = 0; i < _testObjects.LongLength; i++)
for (var i = 0; i < dataCount; i++)
{
_ = list.AddLast(_testObjects[i]);
_ = list.AddLast(data[i]);
}
foreach (var node in list)
@@ -80,18 +121,20 @@ namespace Recyclable.Collections.Benchmarks
list.Clear();
}
[Benchmark]
//[Benchmark]
public void RecyclableQueue()
{
var list = new RecyclableQueue<object>(_blockSize);
for (var i = 0; i < _testObjects.LongLength; i++)
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new RecyclableQueue<object>(BlockSize);
for (var i = 0; i < dataCount; i++)
{
list.Enqueue(_testObjects[i]);
list.Enqueue(data[i]);
}
foreach (var node in list)
while (list.LongCount > 0)
{
DoNothing(node);
DoNothing(list.Dequeue());
}
list.Clear();
@@ -100,15 +143,17 @@ namespace Recyclable.Collections.Benchmarks
//[Benchmark]
public void Queue()
{
var list = new Queue<object>();
for (var i = 0; i < _testObjects.LongLength; i++)
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new Queue<object>(capacity: dataCount);
for (var i = 0; i < dataCount; i++)
{
list.Enqueue(_testObjects[i]);
list.Enqueue(data[i]);
}
foreach (var node in list)
while (list.Count > 0)
{
DoNothing(node);
DoNothing(list.Dequeue());
}
list.Clear();
@@ -117,16 +162,17 @@ namespace Recyclable.Collections.Benchmarks
//[Benchmark]
public void PriorityQueue()
{
var list = new PriorityQueue<object, long>();
for (var i = 0; i < _testObjects.LongLength; i++)
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new PriorityQueue<object, long>(initialCapacity: dataCount);
for (var i = 0; i < dataCount; i++)
{
list.Enqueue(_testObjects[i], i);
list.Enqueue(data[i], i);
}
while (list.Count > 0)
{
var node = list.Dequeue();
DoNothing(node);
DoNothing(list.Dequeue());
}
list.Clear();
@@ -135,18 +181,20 @@ namespace Recyclable.Collections.Benchmarks
//[Benchmark]
public void RecyclableSortedList_InUpdateMode()
{
var list = new RecyclableSortedList<long, object>(_blockSize);
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new RecyclableSortedList<long, object>(BlockSize);
list.BeginUpdate();
for (var i = 0; i < _testObjects.LongLength; i++)
for (var i = 0; i < dataCount; i++)
{
list.Add(i, _testObjects[i]);
list.Add(i, data[i]);
}
list.EndUpdate();
for (var i = 0; i < list.LongCount; i++)
{
DoNothing(_testObjects[i]);
DoNothing(list[i]);
}
list.Clear();
@@ -155,15 +203,17 @@ namespace Recyclable.Collections.Benchmarks
//[Benchmark]
public void RecyclableSortedList()
{
var list = new RecyclableSortedList<long, object>(_blockSize);
for (var i = 0; i < _testObjects.LongLength; i++)
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new RecyclableSortedList<long, object>(BlockSize);
for (var i = 0; i < dataCount; i++)
{
list.Add(i, _testObjects[i]);
list.Add(i, data[i]);
}
for (var i = 0; i < list.LongCount; i++)
{
DoNothing(_testObjects[i]);
DoNothing(list[i]);
}
list.Clear();
@@ -172,15 +222,17 @@ namespace Recyclable.Collections.Benchmarks
//[Benchmark]
public void SortedList()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new SortedList<long, object>();
for (var i = 0; i < _testObjects.LongLength; i++)
for (var i = 0; i < dataCount; i++)
{
list.Add(i, _testObjects[i]);
list.Add(i, data[i]);
}
for (var i = 0; i < list.Count; i++)
{
DoNothing(_testObjects[i]);
DoNothing(list[i]);
}
list.Clear();
@@ -189,15 +241,17 @@ namespace Recyclable.Collections.Benchmarks
//[Benchmark]
public void RecyclableStack()
{
var list = new RecyclableStack<object>(_blockSize);
for (var i = 0; i < _testObjects.LongLength; i++)
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new RecyclableStack<object>(BlockSize);
for (var i = 0; i < dataCount; i++)
{
list.Push(_testObjects[i]);
list.Push(data[i]);
}
foreach (var node in list)
while (list.LongCount > 0)
{
DoNothing(node);
DoNothing(list.Pop());
}
list.Clear();
@@ -206,15 +260,17 @@ namespace Recyclable.Collections.Benchmarks
//[Benchmark]
public void Stack()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new Stack<object>();
for (var i = 0; i < _testObjects.LongLength; i++)
for (var i = 0; i < dataCount; i++)
{
list.Push(_testObjects[i]);
list.Push(data[i]);
}
foreach (var node in list)
while (list.Count > 0)
{
DoNothing(node);
DoNothing(list.Pop());
}
list.Clear();
Recyclable.Collections.Benchmarks/Program.cs
+1 -1
View File
@@ -5,4 +5,4 @@ BenchmarkRunner.Run<ListVsLinkedListBenchmark>();
//BenchmarkRunner.Run<DelegateVsComparerBenchmark>();
//var tests = new ListVsLinkedListBenchmark();
//tests.RecyclableList();
//tests.RecyclableBlockList();