RecyclableCollectionsBenchmarks.List_Contains_FirstItems, . List_Contains_LastItems, .RecyclableList_Contains_FirstItems, .RecyclableList_Contains_LastItems fixed to always search for at least 1 element.

This commit is contained in:
Memek committed 2023-03-02 18:54:35 +01:00
1 parent 248dff8fda
commit cbd9850f58
2 files changed
+4 -4

No files matched your search

@@ -117,7 +117,7 @@ namespace Recyclable.Collections.Benchmarks
{
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.Contains(data[i]));
@@ -129,7 +129,7 @@ namespace Recyclable.Collections.Benchmarks
{
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.Contains(data[^(i + 1)]));
@@ -83,7 +83,7 @@ namespace Recyclable.Collections.Benchmarks
{
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.Contains(data[i]));
@@ -95,7 +95,7 @@ namespace Recyclable.Collections.Benchmarks
{
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.Contains(data[^(i + 1)]));