68 lines
1.8 KiB
C#
68 lines
1.8 KiB
C#
using BenchmarkDotNet.Attributes;
|
|
|
|
namespace Recyclable.Collections.Benchmarks
|
|
{
|
|
public partial class RecyclableCollectionsBenchmarks
|
|
{
|
|
//[Benchmark(Baseline = false)]
|
|
public void Array_Contains_LastItems()
|
|
{
|
|
var data = TestObjects;
|
|
var list = TestObjects;
|
|
var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
|
|
for (var i = 0; i < dataCount; i++)
|
|
{
|
|
DoNothing(list.Contains(data[^(i + 1)]));
|
|
}
|
|
}
|
|
|
|
//[Benchmark(Baseline = false)]
|
|
public void List_Contains_LastItems()
|
|
{
|
|
var data = TestObjects;
|
|
var list = TestObjectsAsList;
|
|
var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
|
|
for (var i = 0; i < dataCount; i++)
|
|
{
|
|
DoNothing(list.Contains(data[^(i + 1)]));
|
|
}
|
|
}
|
|
|
|
//[Benchmark(Baseline = true)]
|
|
public void PooledList_Contains_LastItems()
|
|
{
|
|
var data = TestObjects;
|
|
var list = TestObjectsAsPooledList;
|
|
var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
|
|
for (var i = 0; i < dataCount; i++)
|
|
{
|
|
DoNothing(list.Contains(data[^(i + 1)]));
|
|
}
|
|
}
|
|
|
|
//[Benchmark(Baseline = false)]
|
|
public void RecyclableArrayList_Contains_LastItems()
|
|
{
|
|
var data = TestObjects;
|
|
var list = TestObjectsAsRecyclableArrayList;
|
|
var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
|
|
for (var i = 0; i < dataCount; i++)
|
|
{
|
|
DoNothing(list.Contains(data[^(i + 1)]));
|
|
}
|
|
}
|
|
|
|
//[Benchmark(Baseline = false)]
|
|
public void RecyclableList_Contains_LastItems()
|
|
{
|
|
var data = TestObjects;
|
|
var list = TestObjectsAsRecyclableList;
|
|
var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
|
|
for (var i = 0; i < dataCount; i++)
|
|
{
|
|
DoNothing(list.Contains(data[^(i + 1)]));
|
|
}
|
|
}
|
|
}
|
|
}
|