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

RecyclableBlockList renamed to RecyclableArrayList for clarity. First set of optimizations and implementation.

Browse Source
This commit is contained in:
mlemanczyk committed 2023-01-11 21:21:42 +01:00
1 parent 8147c4ecbf
commit 880abd605e
16 files changed
+1040 -800
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

Recyclable.Collections.Benchmarks/DelegateVsComparerBenchmark.cs
+13 -13
View File
@@ -84,7 +84,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark(Baseline = true)]
//[Benchmark(Baseline = true)]
public void Comparer()
{
TestWithComparer(_comparer);
@@ -99,7 +99,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
//[Benchmark]
public void Func()
{
TestWithFunc((x, y) => (x - y) switch
@@ -110,7 +110,7 @@ namespace Recyclable.Collections.Benchmarks
});
}
[Benchmark]
//[Benchmark]
public void StaticFunc()
{
TestWithFunc(static (x, y) => (x - y) switch
@@ -130,7 +130,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
//[Benchmark]
public void Delegate()
{
TestWithDelegate<long>((x, y) => (x - y) switch
@@ -141,7 +141,7 @@ namespace Recyclable.Collections.Benchmarks
});
}
[Benchmark]
//[Benchmark]
public void ListOfFuncs()
{
const long x = 2, y = 5;
@@ -153,7 +153,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
//[Benchmark]
public void ListOfLocalFuncs()
{
const long x = 2, y = 5;
@@ -165,7 +165,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
//[Benchmark]
public void ListOfComparers()
{
const long x = 2, y = 5;
@@ -177,7 +177,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
//[Benchmark]
public void ListOfClasses()
{
const long x = 2, y = 5;
@@ -189,7 +189,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
//[Benchmark]
public void ListOfStructs()
{
const long x = 2, y = 5;
@@ -201,7 +201,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
//[Benchmark]
public void ListOfBoxedStructs()
{
const long x = 2, y = 5;
@@ -213,7 +213,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
//[Benchmark]
public void ListOfUnboxedStructs()
{
const long x = 2, y = 5;
@@ -225,7 +225,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
//[Benchmark]
public void ListOfUnboxedReadOnlyStructs()
{
const long x = 2, y = 5;
@@ -237,7 +237,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
//[Benchmark]
public void ListOfDelegates()
{
const long x = 2, y = 5;
Recyclable.Collections.Benchmarks/ListVsLinkedListBenchmark.cs
-279
View File
@@ -1,279 +0,0 @@
using BenchmarkDotNet.Attributes;
namespace Recyclable.Collections.Benchmarks
{
[MemoryDiagnoser]
public class ListVsLinkedListBenchmark
{
//[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)
{
_ = obj;
}
[Benchmark]
public void Array()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new object[dataCount];
for (var i = 0; i < dataCount; i++)
{
list[i] = data[i];
}
for (var i = 0; i < list.LongLength; i++)
{
DoNothing(list[i]);
}
}
[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()
{
var data = TestObjects;
var dataCount = TestObjectCount;
using var list = new RecyclableList<object>(BlockSize, 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]
public void List()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new List<object>(capacity: dataCount);
for (var i = 0; i < dataCount; i++)
{
list.Add(data[i]);
}
for (var i = 0; i < list.Count; i++)
{
DoNothing(list[i]);
}
list.Clear();
}
//[Benchmark]
public void LinkedList()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new LinkedList<object>();
for (var i = 0; i < dataCount; i++)
{
_ = list.AddLast(data[i]);
}
foreach (var node in list)
{
DoNothing(node);
}
list.Clear();
}
//[Benchmark]
public void RecyclableQueue()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new RecyclableQueue<object>(BlockSize);
for (var i = 0; i < dataCount; i++)
{
list.Enqueue(data[i]);
}
while (list.LongCount > 0)
{
DoNothing(list.Dequeue());
}
list.Clear();
}
//[Benchmark]
public void Queue()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new Queue<object>(capacity: dataCount);
for (var i = 0; i < dataCount; i++)
{
list.Enqueue(data[i]);
}
while (list.Count > 0)
{
DoNothing(list.Dequeue());
}
list.Clear();
}
//[Benchmark]
public void PriorityQueue()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new PriorityQueue<object, long>(initialCapacity: dataCount);
for (var i = 0; i < dataCount; i++)
{
list.Enqueue(data[i], i);
}
while (list.Count > 0)
{
DoNothing(list.Dequeue());
}
list.Clear();
}
//[Benchmark]
public void RecyclableSortedList_InUpdateMode()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new RecyclableSortedList<long, object>(BlockSize);
list.BeginUpdate();
for (var i = 0; i < dataCount; i++)
{
list.Add(i, data[i]);
}
list.EndUpdate();
for (var i = 0; i < list.LongCount; i++)
{
DoNothing(list[i]);
}
list.Clear();
}
//[Benchmark]
public void RecyclableSortedList()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new RecyclableSortedList<long, object>(BlockSize);
for (var i = 0; i < dataCount; i++)
{
list.Add(i, data[i]);
}
for (var i = 0; i < list.LongCount; i++)
{
DoNothing(list[i]);
}
list.Clear();
}
//[Benchmark]
public void SortedList()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new SortedList<long, object>();
for (var i = 0; i < dataCount; i++)
{
list.Add(i, data[i]);
}
for (var i = 0; i < list.Count; i++)
{
DoNothing(list[i]);
}
list.Clear();
}
//[Benchmark]
public void RecyclableStack()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new RecyclableStack<object>(BlockSize);
for (var i = 0; i < dataCount; i++)
{
list.Push(data[i]);
}
while (list.LongCount > 0)
{
DoNothing(list.Pop());
}
list.Clear();
}
//[Benchmark]
public void Stack()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new Stack<object>();
for (var i = 0; i < dataCount; i++)
{
list.Push(data[i]);
}
while (list.Count > 0)
{
DoNothing(list.Pop());
}
list.Clear();
}
}
}
Recyclable.Collections.Benchmarks/ListVsLinkedListBenchmarks.cs
+262
View File
@@ -0,0 +1,262 @@
namespace Recyclable.Collections.Benchmarks
{
public class BenchmarkBase
{
//[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 const int TestObjectCount = 1_000_000;
public static int BlockSize = TestObjectCount switch
{
0 => 1,
> 0 and <= 10 => TestObjectCount,
_ => TestObjectCount / 10
};
protected object[]? _testObjects;
protected object[] TestObjects => _testObjects ??= Enumerable.Range(1, TestObjectCount).Select(x => new object()).ToArray();
protected static void DoNothing<T>(T obj)
{
_ = obj;
}
public BenchmarkBase()
{
_ = TestObjects;
}
}
//[MemoryDiagnoser]
//public class ListVsLinkedListBenchmarks
//{
// [Benchmark]
// public void RecyclableBlockList()
// {
// var data = TestObjects;
// var dataCount = TestObjectCount;
// using var list = new RecyclableBlockList<object>(initialCapacity: dataCount);
// for (long i = 0; i < dataCount; i++)
// {
// list.Add(data[i]);
// }
// for (long i = 0; i < list.LongCount; i++)
// {
// DoNothing(list[i]);
// }
// list.Clear();
// }
// [Benchmark(Baseline = true)]
// public void RecyclableList()
// {
// var data = TestObjects;
// long dataCount = TestObjectCount;
// using var list = new RecyclableList<object>(BlockSize, totalItemsCount: dataCount);
// for (long i = 0; i < dataCount; i++)
// {
// list.Add(data[i]);
// }
// for (long i = 0; i < list.LongCount; i++)
// {
// DoNothing(list[i]);
// }
// list.Clear();
// }
// //[Benchmark]
// public void List()
// {
// var data = TestObjects;
// var dataCount = TestObjectCount;
// var list = new List<object>(capacity: dataCount);
// for (var i = 0; i < dataCount; i++)
// {
// list.Add(data[i]);
// }
// for (var i = 0; i < list.Count; i++)
// {
// DoNothing(list[i]);
// }
// list.Clear();
// }
// //[Benchmark]
// public void LinkedList()
// {
// var data = TestObjects;
// var dataCount = TestObjectCount;
// var list = new LinkedList<object>();
// for (var i = 0; i < dataCount; i++)
// {
// _ = list.AddLast(data[i]);
// }
// foreach (var node in list)
// {
// DoNothing(node);
// }
// list.Clear();
// }
// //[Benchmark]
// public void RecyclableQueue()
// {
// var data = TestObjects;
// var dataCount = TestObjectCount;
// var list = new RecyclableQueue<object>(BlockSize);
// for (var i = 0; i < dataCount; i++)
// {
// list.Enqueue(data[i]);
// }
// while (list.LongCount > 0)
// {
// DoNothing(list.Dequeue());
// }
// list.Clear();
// }
// //[Benchmark]
// public void Queue()
// {
// var data = TestObjects;
// var dataCount = TestObjectCount;
// var list = new Queue<object>(capacity: dataCount);
// for (var i = 0; i < dataCount; i++)
// {
// list.Enqueue(data[i]);
// }
// while (list.Count > 0)
// {
// DoNothing(list.Dequeue());
// }
// list.Clear();
// }
// //[Benchmark]
// public void PriorityQueue()
// {
// var data = TestObjects;
// var dataCount = TestObjectCount;
// var list = new PriorityQueue<object, long>(initialCapacity: dataCount);
// for (var i = 0; i < dataCount; i++)
// {
// list.Enqueue(data[i], i);
// }
// while (list.Count > 0)
// {
// DoNothing(list.Dequeue());
// }
// list.Clear();
// }
// //[Benchmark]
// public void RecyclableSortedList_InUpdateMode()
// {
// var data = TestObjects;
// var dataCount = TestObjectCount;
// var list = new RecyclableSortedList<long, object>(BlockSize);
// list.BeginUpdate();
// for (var i = 0; i < dataCount; i++)
// {
// list.Add(i, data[i]);
// }
// list.EndUpdate();
// for (var i = 0; i < list.LongCount; i++)
// {
// DoNothing(list[i]);
// }
// list.Clear();
// }
// //[Benchmark]
// public void RecyclableSortedList()
// {
// var data = TestObjects;
// var dataCount = TestObjectCount;
// var list = new RecyclableSortedList<long, object>(BlockSize);
// for (var i = 0; i < dataCount; i++)
// {
// list.Add(i, data[i]);
// }
// for (var i = 0; i < list.LongCount; i++)
// {
// DoNothing(list[i]);
// }
// list.Clear();
// }
// //[Benchmark]
// public void SortedList()
// {
// var data = TestObjects;
// var dataCount = TestObjectCount;
// var list = new SortedList<long, object>();
// for (var i = 0; i < dataCount; i++)
// {
// list.Add(i, data[i]);
// }
// for (var i = 0; i < list.Count; i++)
// {
// DoNothing(list[i]);
// }
// list.Clear();
// }
// //[Benchmark]
// public void RecyclableStack()
// {
// var data = TestObjects;
// var dataCount = TestObjectCount;
// var list = new RecyclableStack<object>(BlockSize);
// for (var i = 0; i < dataCount; i++)
// {
// list.Push(data[i]);
// }
// while (list.LongCount > 0)
// {
// DoNothing(list.Pop());
// }
// list.Clear();
// }
// //[Benchmark]
// public void Stack()
// {
// var data = TestObjects;
// var dataCount = TestObjectCount;
// var list = new Stack<object>();
// for (var i = 0; i < dataCount; i++)
// {
// list.Push(data[i]);
// }
// while (list.Count > 0)
// {
// DoNothing(list.Pop());
// }
// list.Clear();
// }
//}
}
Recyclable.Collections.Benchmarks/Program.cs
+8 -2
View File
@@ -1,8 +1,14 @@
using BenchmarkDotNet.Running;
using Recyclable.Collections.Benchmarks;
BenchmarkRunner.Run<ListVsLinkedListBenchmark>();
//BenchmarkSwitcher.FromAssembly(typeof(Program).Assembly).Run(new[] { "-f*" });
BenchmarkRunner.Run<RecyclableCollectionsBenchmarks>();
//var test = new RecyclableCollectionsBenchmarks();
//BenchmarkRunner.Run<DelegateVsComparerBenchmark>();
//var tests = new ListVsLinkedListBenchmark();
//tests.RecyclableBlockList();
//tests.RecyclableList();
Recyclable.Collections.Benchmarks/RecyclableCollectionsBenchmarks.Array.cs
+52
View File
@@ -0,0 +1,52 @@
using BenchmarkDotNet.Attributes;
namespace Recyclable.Collections.Benchmarks
{
[MemoryDiagnoser]
public partial class RecyclableCollectionsBenchmarks : BenchmarkBase
{
private readonly object[] _testArray;
//[Benchmark(Baseline = true)]
public void Array_Create_WithCapacity()
{
DoNothing(new object[TestObjectCount]);
}
//[Benchmark]
public void Array_GetItem()
{
var data = _testArray;
var dataCount = TestObjectCount;
for (var i = 0; i < dataCount; i++)
{
DoNothing(data[i]);
}
}
//[Benchmark]
public void Array_SetItem()
{
var data = _testArray;
var dataCount = TestObjectCount;
for (var i = 0; i < dataCount; i++)
{
data[i] = TestObjects[i];
}
}
//[Benchmark]
public void Array_Count()
{
var data = _testArray;
DoNothing(data.Length);
}
//[Benchmark]
public void Array_LongCount()
{
var data = _testArray;
DoNothing(data.LongLength);
}
}
}
Recyclable.Collections.Benchmarks/RecyclableCollectionsBenchmarks.List.cs
+83
View File
@@ -0,0 +1,83 @@
using BenchmarkDotNet.Attributes;
namespace Recyclable.Collections.Benchmarks
{
public partial class RecyclableCollectionsBenchmarks : BenchmarkBase
{
private readonly List<object> _testList;
[Benchmark(Baseline = true)]
public void List_Create()
{
var list = new List<object>();
DoNothing(list);
}
[Benchmark]
public void List_Create_0Capacity()
{
var list = new List<object>(0);
DoNothing(list);
}
[Benchmark]
public void List_Create_WithCapacity()
{
var list = new List<object>(TestObjectCount);
DoNothing(list);
}
//[Benchmark]
public void List_Add()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new List<object>();
for (var i = 0; i < dataCount; i++)
{
list.Add(data[i]);
}
}
//[Benchmark]
public void List_Add_WithCapacity()
{
var data = TestObjects;
var dataCount = TestObjectCount;
var list = new List<object>(dataCount);
for (var i = 0; i < dataCount; i++)
{
list.Add(data[i]);
}
}
//[Benchmark]
public void List_GetItem()
{
var data = _testList;
var dataCount = TestObjectCount;
for (var i = 0; i < dataCount; i++)
{
DoNothing(data[i]);
}
}
//[Benchmark]
public void List_SetItem()
{
var data = _testList;
var dataCount = TestObjectCount;
for (var i = 0; i < dataCount; i++)
{
data[i] = TestObjects[i];
}
}
//[Benchmark]
public void List_Count()
{
var data = _testList;
DoNothing(data.Count);
}
}
}
Recyclable.Collections.Benchmarks/RecyclableCollectionsBenchmarks.RecyclableArrayList.cs
+97
View File
@@ -0,0 +1,97 @@
using BenchmarkDotNet.Attributes;
namespace Recyclable.Collections.Benchmarks
{
public partial class RecyclableCollectionsBenchmarks : BenchmarkBase
{
private readonly RecyclableArrayList<object> _testRecyclableArrayList;
public RecyclableCollectionsBenchmarks()
{
_testRecyclableArrayList = new(TestObjects, TestObjectCount);
_testRecyclableList = new(TestObjects, TestObjectCount);
_testArray = TestObjects.ToArray();
_testList = new(TestObjects);
}
~RecyclableCollectionsBenchmarks()
{
_testRecyclableArrayList?.Dispose();
_testRecyclableList?.Dispose();
}
[Benchmark]
public void RecyclableArrayList_Create()
{
using var list = new RecyclableArrayList<object>();
DoNothing(list);
}
[Benchmark]
public void RecyclableArrayList_Create_0Capacity()
{
using var list = new RecyclableArrayList<object>(0);
DoNothing(list);
}
[Benchmark]
public void RecyclableArrayList_Create_WithCapacity()
{
using var list = new RecyclableArrayList<object>(TestObjectCount);
DoNothing(list);
}
//[Benchmark]
public void RecyclableArrayList_Add()
{
var data = TestObjects;
var dataCount = TestObjectCount;
using var list = new RecyclableArrayList<object>();
for (var i = 0; i < dataCount; i++)
{
list.Add(data[i]);
}
}
//[Benchmark]
public void RecyclableArrayList_Add_WithCapacity()
{
var data = TestObjects;
var dataCount = TestObjectCount;
using var list = new RecyclableArrayList<object>(dataCount);
for (var i = 0; i < dataCount; i++)
{
list.Add(data[i]);
}
}
//[Benchmark]
public void RecyclableArrayList_GetItem()
{
var data = _testRecyclableArrayList;
var dataCount = TestObjectCount;
for (var i = 0; i < dataCount; i++)
{
DoNothing(data[i]);
}
}
//[Benchmark]
public void RecyclableArrayList_SetItem()
{
var data = _testRecyclableArrayList;
var dataCount = TestObjectCount;
for (var i = 0; i < dataCount; i++)
{
data[i] = TestObjects[i];
}
}
//[Benchmark]
public void RecyclableArrayList_Count()
{
var data = _testRecyclableArrayList;
DoNothing(data.Count);
}
}
}
Recyclable.Collections.Benchmarks/RecyclableCollectionsBenchmarks.RecyclableList.cs
+90
View File
@@ -0,0 +1,90 @@
using BenchmarkDotNet.Attributes;
namespace Recyclable.Collections.Benchmarks
{
public partial class RecyclableCollectionsBenchmarks : BenchmarkBase
{
private readonly RecyclableList<object> _testRecyclableList;
[Benchmark]
public void RecyclableList_Create()
{
using var list = new RecyclableList<object>();
DoNothing(list);
}
[Benchmark]
public void RecyclableList_Create_0Capacity()
{
using var list = new RecyclableList<object>(totalItemsCount: 0);
DoNothing(list);
}
[Benchmark]
public void RecyclableList_Create_WithCapacity()
{
using var list = new RecyclableList<object>(totalItemsCount: TestObjectCount);
DoNothing(list);
}
//[Benchmark]
public void RecyclableList_Add()
{
var data = TestObjects;
var dataCount = TestObjectCount;
using var list = new RecyclableList<object>();
for (var i = 0; i < dataCount; i++)
{
list.Add(data[i]);
}
}
//[Benchmark]
public void RecyclableList_Add_WithCapacity()
{
var data = TestObjects;
var dataCount = TestObjectCount;
using var list = new RecyclableList<object>(dataCount);
for (var i = 0; i < dataCount; i++)
{
list.Add(data[i]);
}
}
//[Benchmark]
public void RecyclableList_GetItem()
{
var data = _testRecyclableList;
var dataCount = TestObjectCount;
for (var i = 0; i < dataCount; i++)
{
DoNothing(data[i]);
}
}
//[Benchmark]
public void RecyclableList_SetItem()
{
var data = _testRecyclableList;
var dataCount = TestObjectCount;
for (var i = 0; i < dataCount; i++)
{
data[i] = TestObjects[i];
}
}
//[Benchmark]
public void RecyclableList_Count()
{
var data = _testRecyclableList;
DoNothing(data.Count);
}
//[Benchmark]
public void RecyclableList_LongCount()
{
var data = _testRecyclableList;
DoNothing(data.LongCount);
}
}
}