RecyclableList_IndexOf_FirstItems, RecyclableList_IndexOf_LastItems, List_IndexOf_FirstItems & List_IndexOf_LastItems benchmarks fixed to always search for some items, if the no. of test cases is low.

This commit is contained in:
Marek Lemańczyk committed 2023-03-05 18:54:33 +01:00
1 parent 2558f57934
commit ba17f6972f
2 files changed
+12 -12

No files matched your search

@@ -112,7 +112,7 @@ namespace Recyclable.Collections.Benchmarks
DoNothing(data.Count);
}
[Benchmark(Baseline = true)]
//[Benchmark(Baseline = true)]
public void List_Contains_FirstItems()
{
var data = TestObjects;
@@ -124,7 +124,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
//[Benchmark]
public void List_Contains_LastItems()
{
var data = TestObjects;
@@ -136,24 +136,24 @@ namespace Recyclable.Collections.Benchmarks
}
}
//[Benchmark(Baseline = true)]
[Benchmark(Baseline = true)]
public void List_IndexOf_FirstItems()
{
var data = TestObjects;
var list = TestObjectsAsList;
var dataCount = TestObjectCount / 10;
var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
for (var i = 0; i < dataCount; i++)
{
DoNothing(list.IndexOf(data[i]));
}
}
//[Benchmark]
[Benchmark]
public void List_IndexOf_LastItems()
{
var data = TestObjects;
var list = TestObjectsAsList;
var dataCount = TestObjectCount / 10;
var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
for (var i = 0; i < dataCount; i++)
{
DoNothing(list.IndexOf(data[^(i + 1)]));
@@ -78,7 +78,7 @@ namespace Recyclable.Collections.Benchmarks
DoNothing(data.LongCount);
}
[Benchmark]
//[Benchmark]
public void RecyclableList_Contains_FirstItems()
{
var data = TestObjects;
@@ -90,7 +90,7 @@ namespace Recyclable.Collections.Benchmarks
}
}
[Benchmark]
//[Benchmark]
public void RecyclableList_Contains_LastItems()
{
var data = TestObjects;
@@ -102,24 +102,24 @@ namespace Recyclable.Collections.Benchmarks
}
}
//[Benchmark]
[Benchmark]
public void RecyclableList_IndexOf_FirstItems()
{
var data = TestObjects;
var list = TestObjectsAsRecyclableList;
var dataCount = TestObjectCount / 10;
var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
for (var i = 0; i < dataCount; i++)
{
DoNothing(list.IndexOf(data[i]));
}
}
//[Benchmark]
[Benchmark]
public void RecyclableList_IndexOf_LastItems()
{
var data = TestObjects;
var list = TestObjectsAsRecyclableList;
var dataCount = TestObjectCount / 10;
var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
for (var i = 0; i < dataCount; i++)
{
DoNothing(list.IndexOf(data[^(i + 1)]));