81 lines
1.8 KiB
C#
81 lines
1.8 KiB
C#
using BenchmarkDotNet.Attributes;
|
|
|
|
namespace Recyclable.Collections.Benchmarks
|
|
{
|
|
public partial class RecyclableCollectionsBenchmarks
|
|
{
|
|
[Benchmark(Baseline = false)]
|
|
public void Array_IndexOf_AllItems()
|
|
{
|
|
var data = TestObjects;
|
|
var list = TestObjects;
|
|
var dataCount = TestObjectCount;
|
|
for (var i = 0; i < dataCount; i++)
|
|
{
|
|
DoNothing(Array.IndexOf(list, data[i]));
|
|
}
|
|
}
|
|
|
|
[Benchmark(Baseline = false)]
|
|
public void List_IndexOf_AllItems()
|
|
{
|
|
var data = TestObjects;
|
|
var list = TestObjectsAsList;
|
|
var dataCount = TestObjectCount;
|
|
for (var i = 0; i < dataCount; i++)
|
|
{
|
|
DoNothing(list.IndexOf(data[i]));
|
|
}
|
|
}
|
|
|
|
[Benchmark(Baseline = true)]
|
|
public void PooledList_IndexOf_AllItems()
|
|
{
|
|
var data = TestObjects;
|
|
var list = TestObjectsAsPooledList;
|
|
var dataCount = TestObjectCount;
|
|
for (var i = 0; i < dataCount; i++)
|
|
{
|
|
DoNothing(list.IndexOf(data[i]));
|
|
}
|
|
}
|
|
|
|
[Benchmark(Baseline = false)]
|
|
public void RecyclableArrayList_IndexOf_AllItems()
|
|
{
|
|
var data = TestObjects;
|
|
var list = TestObjectsAsRecyclableArrayList;
|
|
var dataCount = TestObjectCount;
|
|
for (var i = 0; i < dataCount; i++)
|
|
{
|
|
DoNothing(list.IndexOf(data[i]));
|
|
}
|
|
}
|
|
|
|
[Benchmark(Baseline = false)]
|
|
public void RecyclableList_IndexOf_AllItems()
|
|
{
|
|
var data = TestObjects;
|
|
var list = TestObjectsAsRecyclableList;
|
|
var dataCount = TestObjectCount;
|
|
for (var i = 0; i < dataCount; i++)
|
|
{
|
|
DoNothing(list.IndexOf(data[i]));
|
|
}
|
|
}
|
|
|
|
[Benchmark(Baseline = false)]
|
|
public void RecyclableList_LongIndexOf_AllItems()
|
|
{
|
|
var data = TestObjects;
|
|
var list = TestObjectsAsRecyclableList;
|
|
var dataCount = TestObjectCount;
|
|
for (var i = 0; i < dataCount; i++)
|
|
{
|
|
DoNothing(list.LongIndexOf(data[i]));
|
|
}
|
|
}
|
|
|
|
}
|
|
}
|