Contains benchmarks will now always search for 10% of the test objects count.
This commit is contained in:
1 parent
573e387a75
commit
f38ee0d498
2 files changed
+16
-16
No files matched your search
@@ -113,11 +113,11 @@ namespace Recyclable.Collections.Benchmarks
|
||||
}
|
||||
|
||||
[Benchmark(Baseline = true)]
|
||||
public void List_Contains_1_000_FirstItems()
|
||||
public void List_Contains_FirstItems()
|
||||
{
|
||||
var data = TestObjects;
|
||||
var list = TestObjectsAsList;
|
||||
var dataCount = 1_000;
|
||||
var dataCount = TestObjectCount / 10;
|
||||
for (var i = 0; i < dataCount; i++)
|
||||
{
|
||||
DoNothing(list.Contains(data[i]));
|
||||
@@ -125,11 +125,11 @@ namespace Recyclable.Collections.Benchmarks
|
||||
}
|
||||
|
||||
[Benchmark]
|
||||
public void List_Contains_1_000_LastItems()
|
||||
public void List_Contains_LastItems()
|
||||
{
|
||||
var data = TestObjects;
|
||||
var list = TestObjectsAsList;
|
||||
var dataCount = 1_000;
|
||||
var dataCount = TestObjectCount / 10;
|
||||
for (var i = 0; i < dataCount; i++)
|
||||
{
|
||||
DoNothing(list.Contains(data[^(i + 1)]));
|
||||
@@ -137,11 +137,11 @@ namespace Recyclable.Collections.Benchmarks
|
||||
}
|
||||
|
||||
//[Benchmark(Baseline = true)]
|
||||
public void List_IndexOf_1_000_FirstItems()
|
||||
public void List_IndexOf_FirstItems()
|
||||
{
|
||||
var data = TestObjects;
|
||||
var list = TestObjectsAsList;
|
||||
var dataCount = 1_000;
|
||||
var dataCount = TestObjectCount / 10;
|
||||
for (var i = 0; i < dataCount; i++)
|
||||
{
|
||||
DoNothing(list.IndexOf(data[i]));
|
||||
@@ -149,11 +149,11 @@ namespace Recyclable.Collections.Benchmarks
|
||||
}
|
||||
|
||||
//[Benchmark]
|
||||
public void List_IndexOf_1_000_LastItems()
|
||||
public void List_IndexOf_LastItems()
|
||||
{
|
||||
var data = TestObjects;
|
||||
var list = TestObjectsAsList;
|
||||
var dataCount = 1_000;
|
||||
var dataCount = TestObjectCount / 10;
|
||||
for (var i = 0; i < dataCount; i++)
|
||||
{
|
||||
DoNothing(list.IndexOf(data[^(i + 1)]));
|
||||
|
||||
@@ -79,11 +79,11 @@ namespace Recyclable.Collections.Benchmarks
|
||||
}
|
||||
|
||||
[Benchmark]
|
||||
public void RecyclableList_Contains_1_000_FirstItems()
|
||||
public void RecyclableList_Contains_FirstItems()
|
||||
{
|
||||
var data = TestObjects;
|
||||
var list = TestObjectsAsRecyclableList;
|
||||
var dataCount = 1000;
|
||||
var dataCount = TestObjectCount / 10;
|
||||
for (var i = 0; i < dataCount; i++)
|
||||
{
|
||||
DoNothing(list.Contains(data[i]));
|
||||
@@ -91,11 +91,11 @@ namespace Recyclable.Collections.Benchmarks
|
||||
}
|
||||
|
||||
[Benchmark]
|
||||
public void RecyclableList_Contains_1_000_LastItems()
|
||||
public void RecyclableList_Contains_LastItems()
|
||||
{
|
||||
var data = TestObjects;
|
||||
var list = TestObjectsAsRecyclableList;
|
||||
var dataCount = 1_000;
|
||||
var dataCount = TestObjectCount / 10;
|
||||
for (var i = 0; i < dataCount; i++)
|
||||
{
|
||||
DoNothing(list.Contains(data[^(i + 1)]));
|
||||
@@ -103,11 +103,11 @@ namespace Recyclable.Collections.Benchmarks
|
||||
}
|
||||
|
||||
//[Benchmark]
|
||||
public void RecyclableList_IndexOf_1_000_FirstItems()
|
||||
public void RecyclableList_IndexOf_FirstItems()
|
||||
{
|
||||
var data = TestObjects;
|
||||
var list = TestObjectsAsRecyclableList;
|
||||
var dataCount = 1000;
|
||||
var dataCount = TestObjectCount / 10;
|
||||
for (var i = 0; i < dataCount; i++)
|
||||
{
|
||||
DoNothing(list.IndexOf(data[i]));
|
||||
@@ -115,11 +115,11 @@ namespace Recyclable.Collections.Benchmarks
|
||||
}
|
||||
|
||||
//[Benchmark]
|
||||
public void RecyclableList_IndexOf_1_000_LastItems()
|
||||
public void RecyclableList_IndexOf_LastItems()
|
||||
{
|
||||
var data = TestObjects;
|
||||
var list = TestObjectsAsRecyclableList;
|
||||
var dataCount = 1_000;
|
||||
var dataCount = TestObjectCount / 10;
|
||||
for (var i = 0; i < dataCount; i++)
|
||||
{
|
||||
DoNothing(list.IndexOf(data[^(i + 1)]));
|
||||
|
||||
Reference in new issue
Block a user