RecyclableList.IndexOf reworked for performance improvement.

Recyclable.Collections.Benchmarks/RecyclableCollectionsBenchmarks.List.cs

@@ -112,16 +112,28 @@ namespace Recyclable.Collections.Benchmarks
 			DoNothing(data.Count);
 		}
 
-		[Benchmark(Baseline = true)]
+		//[Benchmark(Baseline = true)]
 		public void List_Contains()
 		{
 			var data = TestObjects;
 			var list = TestObjectsAsList;
-			var dataCount = 100_000;
+			var dataCount = TestObjectCount;
 			for (var i = 0; i < dataCount; i++)
 			{
 				DoNothing(list.Contains(data[i]));
 			}
 		}
+
+		[Benchmark(Baseline = true)]
+		public void List_IndexOf()
+		{
+			var data = TestObjects;
+			var list = TestObjectsAsList;
+			var dataCount = TestObjectCount;
+			for (var i = 0; i < dataCount; i++)
+			{
+				DoNothing(list.IndexOf(data[i]));
+			}
+		}
 	}
 }

Recyclable.Collections.Benchmarks/RecyclableCollectionsBenchmarks.RecyclableList.cs

@@ -78,16 +78,28 @@ namespace Recyclable.Collections.Benchmarks
 			DoNothing(data.LongCount);
 		}
 
-		[Benchmark]
+		//[Benchmark]
 		public void RecyclableList_Contains()
 		{
 			var data = TestObjects;
 			var list = TestObjectsAsRecyclableList;
-			var dataCount = 100_000;
+			var dataCount = TestObjectCount;
 			for (var i = 0; i < dataCount; i++)
 			{
 				DoNothing(list.Contains(data[i]));
 			}
 		}
+
+		[Benchmark]
+		public void RecyclableList_IndexOf()
+		{
+			var data = TestObjects;
+			var list = TestObjectsAsRecyclableList;
+			var dataCount = TestObjectCount;
+			for (var i = 0; i < dataCount; i++)
+			{
+				DoNothing(list.IndexOf(data[i]));
+			}
+		}
 	}
 }