Cleanup.

Recyclable.Collections.Benchmarks/Benchmarks/Add.cs

@@ -8,7 +8,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			var list = new long[dataCount];
+			var list = new int[dataCount];
 			for (var i = 0; i < dataCount; i++)
 			{
 				list[i] = data[i];
@@ -19,7 +19,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			var list = new List<long>();
+			var list = new List<int>();
 			for (var i = 0; i < dataCount; i++)
 			{
 				list.Add(data[i]);
@@ -30,7 +30,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			using var list = new PooledList<long>(ClearMode.Auto);
+			using var list = new PooledList<int>(ClearMode.Auto);
 			for (var i = 0; i < dataCount; i++)
 			{
 				list.Add(data[i]);
@@ -41,7 +41,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			using var list = new RecyclableList<long>();
+			using var list = new RecyclableList<int>();
 			for (var i = 0; i < dataCount; i++)
 			{
 				list.Add(data[i]);
@@ -52,7 +52,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			using var list = new RecyclableLongList<long>();
+			using var list = new RecyclableLongList<int>();
 			for (var i = 0; i < dataCount; i++)
 			{
 				list.Add(data[i]);

Recyclable.Collections.Benchmarks/Benchmarks/AddRangeWhenSourceIsArray.cs

@@ -7,35 +7,35 @@ namespace Recyclable.Collections.Benchmarks
 		public void Array_AddRangeWhenSourceIsArray()
 		{
 			var data = TestObjects;
-			var list = new long[TestObjectCount];
+			var list = new int[TestObjectCount];
 			data.CopyTo(list, 0);
 		}
 
 		public void List_AddRangeWhenSourceIsArray()
 		{
 			var data = TestObjects;
-			var list = new List<long>();
+			var list = new List<int>();
 			list.AddRange(data);
 		}
 
 		public void PooledList_AddRangeWhenSourceIsArray()
 		{
 			var data = TestObjects;
-			using var list = new PooledList<long>(ClearMode.Auto);
+			using var list = new PooledList<int>(ClearMode.Auto);
 			list.AddRange(data);
 		}
 
 		public void RecyclableList_AddRangeWhenSourceIsArray()
 		{
 			var data = TestObjects;
-			using var list = new RecyclableList<long>();
+			using var list = new RecyclableList<int>();
 			list.AddRange(data);
 		}
 
 		public void RecyclableLongList_AddRangeWhenSourceIsArray()
 		{
 			var data = TestObjects;
-			using var list = new RecyclableLongList<long>(minBlockSize: BlockSize);
+			using var list = new RecyclableLongList<int>(minBlockSize: BlockSize);
 			list.AddRange(data);
 		}
 	}

Recyclable.Collections.Benchmarks/Benchmarks/AddRangeWhenSourceIsIEnumerable.cs

@@ -7,7 +7,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void Array_AddRangeWhenSourceIsIEnumerable()
 		{
 			var data = TestObjectsAsIEnumerable;
-			var list = new long[TestObjectCount];
+			var list = new int[TestObjectCount];
 			int itemIndex = 0;
 
 			foreach (var item in data)
@@ -19,28 +19,28 @@ namespace Recyclable.Collections.Benchmarks
 		public void List_AddRangeWhenSourceIsIEnumerable()
 		{
 			var data = TestObjectsAsIEnumerable;
-			var list = new List<long>();
+			var list = new List<int>();
 			list.AddRange(data);
 		}
 
 		public void PooledList_AddRangeWhenSourceIsIEnumerable()
 		{
 			var data = TestObjectsAsIEnumerable;
-			using var list = new PooledList<long>(ClearMode.Auto);
+			using var list = new PooledList<int>(ClearMode.Auto);
 			list.AddRange(data);
 		}
 
 		public void RecyclableList_AddRangeWhenSourceIsIEnumerable()
 		{
 			var data = TestObjectsAsIEnumerable;
-			using var list = new RecyclableList<long>();
+			using var list = new RecyclableList<int>();
 			list.AddRange(data);
 		}
 
 		public void RecyclableLongList_AddRangeWhenSourceIsIEnumerable()
 		{
 			var data = TestObjectsAsIEnumerable;
-			using var list = new RecyclableLongList<long>(minBlockSize: BlockSize);
+			using var list = new RecyclableLongList<int>(minBlockSize: BlockSize);
 			list.AddRange(data);
 		}
 	}

Recyclable.Collections.Benchmarks/Benchmarks/AddRangeWhenSourceIsIList.cs

@@ -6,36 +6,36 @@ namespace Recyclable.Collections.Benchmarks
 	{
 		public void Array_AddRangeWhenSourceIsIList()
 		{
-			var data = (IList<long>)TestObjectsAsRecyclableLongList;
-			var list = new long[TestObjectCount];
+			var data = (IList<int>)TestObjectsAsRecyclableLongList;
+			var list = new int[TestObjectCount];
 			data.CopyTo(list, 0);
 		}
 
 		public void List_AddRangeWhenSourceIsIList()
 		{
-			var data = (IList<long>)TestObjectsAsRecyclableLongList;
-			var list = new List<long>();
+			var data = (IList<int>)TestObjectsAsRecyclableLongList;
+			var list = new List<int>();
 			list.AddRange(data);
 		}
 
 		public void PooledList_AddRangeWhenSourceIsIList()
 		{
-			var data = (IList<long>)TestObjectsAsRecyclableLongList;
-			using var list = new PooledList<long>(ClearMode.Auto);
+			var data = (IList<int>)TestObjectsAsRecyclableLongList;
+			using var list = new PooledList<int>(ClearMode.Auto);
 			list.AddRange(data);
 		}
 
 		public void RecyclableList_AddRangeWhenSourceIsIList()
 		{
-			var data = (IList<long>)TestObjectsAsRecyclableLongList;
-			using var list = new RecyclableList<long>();
+			var data = (IList<int>)TestObjectsAsRecyclableLongList;
+			using var list = new RecyclableList<int>();
 			list.AddRange(data);
 		}
 
 		public void RecyclableLongList_AddRangeWhenSourceIsIList()
 		{
-			var data = (IList<long>)TestObjectsAsRecyclableLongList;
-			using var list = new RecyclableLongList<long>(minBlockSize: BlockSize);
+			var data = (IList<int>)TestObjectsAsRecyclableLongList;
+			using var list = new RecyclableLongList<int>(minBlockSize: BlockSize);
 			list.AddRange(data);
 		}
 	}

Recyclable.Collections.Benchmarks/Benchmarks/AddRangeWhenSourceIsList.cs

@@ -7,35 +7,35 @@ namespace Recyclable.Collections.Benchmarks
 		public void Array_AddRangeWhenSourceIsList()
 		{
 			var data = TestObjectsAsList;
-			var list = new long[TestObjectCount];
+			var list = new int[TestObjectCount];
 			data.CopyTo(list, 0);
 		}
 
 		public void List_AddRangeWhenSourceIsList()
 		{
 			var data = TestObjectsAsList;
-			var list = new List<long>();
+			var list = new List<int>();
 			list.AddRange(data);
 		}
 
 		public void PooledList_AddRangeWhenSourceIsList()
 		{
 			var data = TestObjectsAsList;
-			using var list = new PooledList<long>(ClearMode.Auto);
+			using var list = new PooledList<int>(ClearMode.Auto);
 			list.AddRange(data);
 		}
 
 		public void RecyclableList_AddRangeWhenSourceIsList()
 		{
 			var data = TestObjectsAsList;
-			using var list = new RecyclableList<long>();
+			using var list = new RecyclableList<int>();
 			list.AddRange(data);
 		}
 
 		public void RecyclableLongList_AddRangeWhenSourceIsList()
 		{
 			var data = TestObjectsAsList;
-			using var list = new RecyclableLongList<long>(minBlockSize: BlockSize);
+			using var list = new RecyclableLongList<int>(minBlockSize: BlockSize);
 			list.AddRange(data);
 		}
 	}

Recyclable.Collections.Benchmarks/Benchmarks/AddRangeWhenSourceIsSameType.cs

@@ -7,21 +7,21 @@ namespace Recyclable.Collections.Benchmarks
 		public void PooledList_AddRangeWhenSourceIsPooledList()
 		{
 			var data = TestObjectsAsPooledList;
-			using var list = new PooledList<long>(capacity: TestObjectCount, ClearMode.Auto);
+			using var list = new PooledList<int>(capacity: TestObjectCount, ClearMode.Auto);
 			list.AddRange(data);
 		}
 
 		public void RecyclableList_AddRangeWhenSourceIsRecyclableList()
 		{
 			var data = TestObjectsAsRecyclableList;
-			using var list = new RecyclableList<long>(TestObjectCount);
+			using var list = new RecyclableList<int>(TestObjectCount);
 			list.AddRange(data);
 		}
 
 		public void RecyclableLongList_AddRangeWhenSourceIsRecyclableLongList()
 		{
 			var data = TestObjectsAsRecyclableList;
-			using var list = new RecyclableLongList<long>(minBlockSize: BlockSize, initialCapacity: TestObjectCount);
+			using var list = new RecyclableLongList<int>(minBlockSize: BlockSize, initialCapacity: TestObjectCount);
 			list.AddRange(data);
 		}
 	}

Recyclable.Collections.Benchmarks/Benchmarks/AddRange_WithCapacity.cs

@@ -8,7 +8,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			var list = new long[dataCount];
+			var list = new int[dataCount];
 			data.CopyTo(list, 0);
 		}
 
@@ -16,7 +16,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			var list = new List<long>(dataCount);
+			var list = new List<int>(dataCount);
 			list.AddRange(data);
 		}
 
@@ -24,7 +24,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			using var list = new PooledList<long>(capacity: dataCount, ClearMode.Auto);
+			using var list = new PooledList<int>(capacity: dataCount, ClearMode.Auto);
 			list.AddRange(data);
 		}
 
@@ -32,7 +32,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			using var list = new RecyclableList<long>(dataCount);
+			using var list = new RecyclableList<int>(dataCount);
 			list.AddRange(data);
 		}
 
@@ -40,7 +40,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			using var list = new RecyclableLongList<long>(minBlockSize: BlockSize, initialCapacity: dataCount);
+			using var list = new RecyclableLongList<int>(minBlockSize: BlockSize, initialCapacity: dataCount);
 			list.AddRange(data);
 		}
 	}

Recyclable.Collections.Benchmarks/Benchmarks/Add_WithCapacity.cs

@@ -8,7 +8,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			var list = new List<long>(dataCount);
+			var list = new List<int>(dataCount);
 			for (var i = 0; i < dataCount; i++)
 			{
 				list.Add(data[i]);
@@ -19,7 +19,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			using var list = new PooledList<long>(capacity: dataCount, ClearMode.Auto);
+			using var list = new PooledList<int>(capacity: dataCount, ClearMode.Auto);
 			for (var i = 0; i < dataCount; i++)
 			{
 				list.Add(data[i]);
@@ -30,7 +30,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			using var list = new RecyclableList<long>(dataCount);
+			using var list = new RecyclableList<int>(dataCount);
 			for (var i = 0; i < dataCount; i++)
 			{
 				list.Add(data[i]);
@@ -41,7 +41,7 @@ namespace Recyclable.Collections.Benchmarks
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			using var list = new RecyclableLongList<long>(minBlockSize: BlockSize, initialCapacity: dataCount);
+			using var list = new RecyclableLongList<int>(minBlockSize: BlockSize, initialCapacity: dataCount);
 			for (var i = 0; i < dataCount; i++)
 			{
 				list.Add(data[i]);

Recyclable.Collections.Benchmarks/Benchmarks/Create.cs

@@ -8,31 +8,31 @@ namespace Recyclable.Collections.Benchmarks
 	{
 		public void Array_Create()
 		{
-			var list = new long[0];
+			var list = new int[0];
 			DoNothing(list);
 		}
 
 		public void List_Create()
 		{
-			var list = new List<long>();
+			var list = new List<int>();
 			DoNothing(list);
 		}
 
 		public void PooledList_Create()
 		{
-			using var list = new PooledList<long>(ClearMode.Auto);
+			using var list = new PooledList<int>(ClearMode.Auto);
 			DoNothing(list);
 		}
 
 		public void RecyclableList_Create()
 		{
-			using var list = new RecyclableList<long>();
+			using var list = new RecyclableList<int>();
 			DoNothing(list);
 		}
 
 		public void RecyclableLongList_Create()
 		{
-			using var list = new RecyclableLongList<long>();
+			using var list = new RecyclableLongList<int>();
 			DoNothing(list);
 		}
 	}

Recyclable.Collections.Benchmarks/Benchmarks/Create_WithCapacity.cs

@@ -6,31 +6,31 @@ namespace Recyclable.Collections.Benchmarks
 	{
 		public void Array_Create_WithCapacity()
 		{
-			var data = new long[TestObjectCount];
+			var data = new int[TestObjectCount];
 			DoNothing(data);
 		}
 
 		public void List_Create_WithCapacity()
 		{
-			var list = new List<long>(TestObjectCount);
+			var list = new List<int>(TestObjectCount);
 			DoNothing(list);
 		}
 
 		public void PooledList_Create_WithCapacity()
 		{
-			using var list = new PooledList<long>(capacity: TestObjectCount, ClearMode.Auto);
+			using var list = new PooledList<int>(capacity: TestObjectCount, ClearMode.Auto);
 			DoNothing(list);
 		}
 
 		public void RecyclableList_Create_WithCapacity()
 		{
-			using var list = new RecyclableList<long>(TestObjectCount);
+			using var list = new RecyclableList<int>(TestObjectCount);
 			DoNothing(list);
 		}
 
 		public void RecyclableLongList_Create_WithCapacity()
 		{
-			using var list = new RecyclableLongList<long>(minBlockSize: BlockSize, initialCapacity: TestObjectCount);
+			using var list = new RecyclableLongList<int>(minBlockSize: BlockSize, initialCapacity: TestObjectCount);
 			DoNothing(list);
 		}
 	}

Recyclable.Collections.Benchmarks/Benchmarks/GetItem..cs

@@ -58,10 +58,10 @@
 			int blockSize = data.BlockSize;
 			int nextItemBlockIndex = data.NextItemBlockIndex;
 
-			var memoryBlocks = new Span<long[]>(data.AsArray, 0, data.LastBlockWithData + 1);
+			var memoryBlocks = new Span<int[]>(data.AsArray, 0, data.LastBlockWithData + 1);
 			for (var blockIndex = 0; blockIndex < nextItemBlockIndex; blockIndex++)
 			{
-				var memoryBlock = new Span<long>(memoryBlocks[blockIndex], 0, blockSize);
+				var memoryBlock = new Span<int>(memoryBlocks[blockIndex], 0, blockSize);
 				for (var itemIndex = 0; itemIndex < blockSize; itemIndex++)
 				{
 					DoNothing(memoryBlock[itemIndex]);
@@ -70,7 +70,7 @@
 
 			if (nextItemBlockIndex == data.LastBlockWithData)
 			{
-				var memoryBlock = new Span<long>(memoryBlocks[nextItemBlockIndex], 0, data.NextItemIndex);
+				var memoryBlock = new Span<int>(memoryBlocks[nextItemBlockIndex], 0, data.NextItemIndex);
 				for (var itemIndex = 0; itemIndex < memoryBlock.Length; itemIndex++)
 				{
 					DoNothing(memoryBlock[itemIndex]);
@@ -117,7 +117,7 @@
 		public void RecyclableLongList_GetItem_AsWhile()
 		{
 			var data = TestObjectsAsRecyclableLongList;
-			long dataCount = TestObjectCount;
+			int dataCount = TestObjectCount;
 			if (dataCount == 0)
 			{
 				return;

Recyclable.Collections.Benchmarks/Benchmarks/RemoveAt_FirstItems.cs

@@ -7,7 +7,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void List_RemoveAt_FirstItems()
 		{
 			var data = TestObjects;
-			var list = new List<long>(data);
+			var list = new List<int>(data);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = 0; i < dataCount; i++)
 			{
@@ -18,7 +18,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void PooledList_RemoveAt_FirstItems()
 		{
 			var data = TestObjects;
-			using var list = new PooledList<long>(data, ClearMode.Auto);
+			using var list = new PooledList<int>(data, ClearMode.Auto);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = 0; i < dataCount; i++)
 			{
@@ -29,7 +29,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void RecyclableList_RemoveAt_FirstItems()
 		{
 			var data = TestObjects;
-			using var list = new RecyclableList<long>(data);
+			using var list = new RecyclableList<int>(data);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = 0; i < dataCount; i++)
 			{
@@ -40,7 +40,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void RecyclableLongList_RemoveAt_FirstItems()
 		{
 			var data = TestObjects;
-			using var list = new RecyclableLongList<long>(data, minBlockSize: BlockSize, initialCapacity: base.TestObjectCount);
+			using var list = new RecyclableLongList<int>(data, minBlockSize: BlockSize, initialCapacity: base.TestObjectCount);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = 0; i < dataCount; i++)
 			{

Recyclable.Collections.Benchmarks/Benchmarks/RemoveAt_LastItems.cs

@@ -7,7 +7,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void List_RemoveAt_LastItems()
 		{
 			var data = TestObjects;
-			var list = new List<long>(data);
+			var list = new List<int>(data);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = data.Length - 1; i > data.Length - dataCount - 1; i--)
 			{
@@ -18,7 +18,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void PooledList_RemoveAt_LastItems()
 		{
 			var data = TestObjects;
-			using var list = new PooledList<long>(data, ClearMode.Auto);
+			using var list = new PooledList<int>(data, ClearMode.Auto);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = data.Length - 1; i > data.Length - dataCount - 1; i--)
 			{
@@ -29,7 +29,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void RecyclableList_RemoveAt_LastItems()
 		{
 			var data = TestObjects;
-			using var list = new RecyclableList<long>(data);
+			using var list = new RecyclableList<int>(data);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = data.Length - 1; i > data.Length - dataCount - 1; i--)
 			{
@@ -40,7 +40,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void RecyclableLongList_RemoveAt_LastItems()
 		{
 			var data = TestObjects;
-			using var list = new RecyclableLongList<long>(data, minBlockSize: BlockSize, initialCapacity: base.TestObjectCount);
+			using var list = new RecyclableLongList<int>(data, minBlockSize: BlockSize, initialCapacity: base.TestObjectCount);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = data.Length - 1; i > data.Length - dataCount - 1; i--)
 			{

Recyclable.Collections.Benchmarks/Benchmarks/Remove_FirstItems.cs

@@ -7,7 +7,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void List_Remove_FirstItems()
 		{
 			var data = TestObjects;
-			var list = new List<long>(data);
+			var list = new List<int>(data);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = 0; i < dataCount; i++)
 			{
@@ -18,7 +18,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void PooledList_Remove_FirstItems()
 		{
 			var data = TestObjects;
-			using var list = new PooledList<long>(data, ClearMode.Auto);
+			using var list = new PooledList<int>(data, ClearMode.Auto);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = 0; i < dataCount; i++)
 			{
@@ -29,7 +29,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void RecyclableList_Remove_FirstItems()
 		{
 			var data = TestObjects;
-			using var list = new RecyclableList<long>(data);
+			using var list = new RecyclableList<int>(data);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = 0; i < dataCount; i++)
 			{
@@ -40,7 +40,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void RecyclableLongList_Remove_FirstItems()
 		{
 			var data = TestObjects;
-			using var list = new RecyclableLongList<long>(data, minBlockSize: BlockSize, initialCapacity: base.TestObjectCount);
+			using var list = new RecyclableLongList<int>(data, minBlockSize: BlockSize, initialCapacity: base.TestObjectCount);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = 0; i < dataCount; i++)
 			{

Recyclable.Collections.Benchmarks/Benchmarks/Remove_LastItems.cs

@@ -7,7 +7,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void List_Remove_LastItems()
 		{
 			var data = TestObjects;
-			var list = new List<long>(data);
+			var list = new List<int>(data);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = data.Length - 1; i > data.Length - dataCount - 1; i--)
 			{
@@ -18,7 +18,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void PooledList_Remove_LastItems()
 		{
 			var data = TestObjects;
-			using var list = new PooledList<long>(data, ClearMode.Auto);
+			using var list = new PooledList<int>(data, ClearMode.Auto);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = data.Length - 1; i > data.Length - dataCount - 1; i--)
 			{
@@ -29,7 +29,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void RecyclableList_Remove_LastItems()
 		{
 			var data = TestObjects;
-			using var list = new RecyclableList<long>(data);
+			using var list = new RecyclableList<int>(data);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = data.Length - 1; i > data.Length - dataCount - 1; i--)
 			{
@@ -40,7 +40,7 @@ namespace Recyclable.Collections.Benchmarks
 		public void RecyclableLongList_Remove_LastItems()
 		{
 			var data = TestObjects;
-			using var list = new RecyclableLongList<long>(data, minBlockSize: BlockSize, initialCapacity:base.TestObjectCount);
+			using var list = new RecyclableLongList<int>(data, minBlockSize: BlockSize, initialCapacity:base.TestObjectCount);
 			var dataCount = TestObjectCount / 10 > 0 ? TestObjectCount / 10 : TestObjectCount;
 			for (var i = data.Length - 1; i > data.Length - dataCount - 1; i--)
 			{

Recyclable.Collections.Benchmarks/POC/EqualVsContainsInConsecutiveOrderBenchmarks.cs

@@ -1,4 +1,6 @@
-using BenchmarkDotNet.Attributes;
+// Ignore Spelling: Poc
+
+using BenchmarkDotNet.Attributes;
 using FluentAssertions;
 using Recyclable.CollectionsTests;
 
@@ -24,7 +26,7 @@ namespace Recyclable.Collections.Benchmarks.POC
 			_ = _list1.Should().ContainInConsecutiveOrder(_list2);
 		}
 
-		public void Dispose()
+		void IDisposable.Dispose()
 		{
 			if (_list1 is IDisposable disposable1)
 			{
@@ -35,6 +37,8 @@ namespace Recyclable.Collections.Benchmarks.POC
 			{
 				disposable2.Dispose();
 			}
+
+			GC.SuppressFinalize(this);
 		}
 	}
 }

Recyclable.Collections.Benchmarks/POC/LessOperatorvsAndOperatorBenchmarks.cs

@@ -1,4 +1,6 @@
-using BenchmarkDotNet.Attributes;
+// Ignore Spelling: Poc
+
+using BenchmarkDotNet.Attributes;
 using System.Runtime.CompilerServices;
 
 #pragma warning disable CA1822
@@ -7,14 +9,14 @@ namespace Recyclable.Collections.Benchmarks.POC
 {
 	public class LessOperatorVsAndOperatorBenchmarks
 	{
-		private const int bitShift = 1 << 31;
+		private const int BitShift = 1 << 31;
 		private static readonly Random _rnd = new(1);
-		private static int num = -Math.Abs(_rnd.Next());
+		private static int _num = -Math.Abs(_rnd.Next());
 
 		public void Setup()
 		{
-			num = -1;
-			Console.WriteLine($"*** We're comparing if {num} is < 0 ***");
+			_num = -1;
+			Console.WriteLine($"*** We're comparing if {_num} is < 0 ***");
 		}
 
 		public void Cleanup() { }
@@ -30,25 +32,25 @@ namespace Recyclable.Collections.Benchmarks.POC
 		[Benchmark(Baseline = true)]
 		public void CompareWithLess()
 		{
-			DoNothing(num < 0);
+			DoNothing(_num < 0);
 		}
 
 		[Benchmark]
 		public void CompareWithAnd()
 		{
-			DoNothing((num & bitShift) != 0);
+			DoNothing((_num & BitShift) != 0);
 		}
 
 		[Benchmark]
 		public void CompareWithEqual()
 		{
-			DoNothing(num == -1);
+			DoNothing(_num == -1);
 		}
 
 		[Benchmark]
 		public void CompareToZero()
 		{
-			DoNothing(num == 0);
+			DoNothing(_num == 0);
 		}
 	}
 }

Recyclable.Collections.Benchmarks/POC/RoundBenchmarks.cs

@@ -1,4 +1,6 @@
-using BenchmarkDotNet.Attributes;
+// Ignore Spelling: Poc
+
+using BenchmarkDotNet.Attributes;
 
 namespace Recyclable.Collections.Benchmarks.POC
 {
@@ -35,11 +37,11 @@ namespace Recyclable.Collections.Benchmarks.POC
 		}
 
 		protected override Action GetTestMethod(RoundBenchmarkType benchmarkType) => benchmarkType switch
-        {
-            RoundBenchmarkType.MathFloor => RoundWithMathFloor,
-            RoundBenchmarkType.MathRound => RoundWithMathRound,
-            RoundBenchmarkType.WithTypecasting => RoundWithTypeCasting,
-            _ => throw CreateUnknownBenchmarkTypeException(benchmarkType),
-        };
+		{
+			RoundBenchmarkType.MathFloor => RoundWithMathFloor,
+			RoundBenchmarkType.MathRound => RoundWithMathRound,
+			RoundBenchmarkType.WithTypecasting => RoundWithTypeCasting,
+			_ => throw CreateUnknownBenchmarkTypeException(benchmarkType),
+		};
 	}
 }

Recyclable.Collections.Benchmarks/POC/SpanVsArrayBenchmarks.cs

@@ -1,4 +1,6 @@
-using BenchmarkDotNet.Attributes;
+// Ignore Spelling: Poc
+
+using BenchmarkDotNet.Attributes;
 
 namespace Recyclable.Collections.Benchmarks.POC
 {
@@ -28,21 +30,21 @@ namespace Recyclable.Collections.Benchmarks.POC
 		public override SpanVsArrayBenchmarkType BaseDataType { get => base.BaseDataType; set => base.BaseDataType = value; }
 
 		protected override Action GetTestMethod(SpanVsArrayBenchmarkType benchmarkType) => benchmarkType switch
-        {
-            SpanVsArrayBenchmarkType.ArrayGetWithVar => ArrayGetWithVar,
-            SpanVsArrayBenchmarkType.ArrayGetWithField => ArrayGetWithField,
-            SpanVsArrayBenchmarkType.SpanGet => SpanGet,
-            SpanVsArrayBenchmarkType.ArraySetWithVar => ArraySetWithVar,
-            SpanVsArrayBenchmarkType.ArraySetWithField => ArraySetWithField,
-            SpanVsArrayBenchmarkType.SpanSet => SpanSet,
-            _ => throw CreateUnknownBenchmarkTypeException(benchmarkType),
-        };
+		{
+			SpanVsArrayBenchmarkType.ArrayGetWithVar => ArrayGetWithVar,
+			SpanVsArrayBenchmarkType.ArrayGetWithField => ArrayGetWithField,
+			SpanVsArrayBenchmarkType.SpanGet => SpanGet,
+			SpanVsArrayBenchmarkType.ArraySetWithVar => ArraySetWithVar,
+			SpanVsArrayBenchmarkType.ArraySetWithField => ArraySetWithField,
+			SpanVsArrayBenchmarkType.SpanSet => SpanSet,
+			_ => throw CreateUnknownBenchmarkTypeException(benchmarkType),
+		};
 
-        public void ArrayGetWithVar()
+		public void ArrayGetWithVar()
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			for (long i = 0; i < dataCount; i++)
+			for (int i = 0; i < dataCount; i++)
 			{
 				DoNothing(data[i]);
 			}
@@ -51,7 +53,7 @@ namespace Recyclable.Collections.Benchmarks.POC
 		public void ArrayGetWithField()
 		{
 			var dataCount = TestObjectCount;
-			for (long i = 0; i < dataCount; i++)
+			for (int i = 0; i < dataCount; i++)
 			{
 				DoNothing(_testObjects![i]);
 			}
@@ -60,7 +62,7 @@ namespace Recyclable.Collections.Benchmarks.POC
 		public void SpanGet()
 		{
 			var dataCount = TestObjectCount;
-			Span<long> data = new(_testObjects, 0, dataCount);
+			Span<int> data = new(_testObjects, 0, dataCount);
 			for (int i = 0; i < dataCount; i++)
 			{
 				DoNothing(data[i]);
@@ -71,7 +73,7 @@ namespace Recyclable.Collections.Benchmarks.POC
 		{
 			var data = TestObjects;
 			var dataCount = TestObjectCount;
-			for (long i = 0; i < dataCount; i++)
+			for (int i = 0; i < dataCount; i++)
 			{
 				data[i] = i;
 			}
@@ -80,7 +82,7 @@ namespace Recyclable.Collections.Benchmarks.POC
 		public void ArraySetWithField()
 		{
 			var dataCount = TestObjectCount;
-			for (long i = 0; i < dataCount; i++)
+			for (int i = 0; i < dataCount; i++)
 			{
 				_testObjects![i] = i;
 			}
@@ -89,7 +91,7 @@ namespace Recyclable.Collections.Benchmarks.POC
 		public void SpanSet()
 		{
 			var dataCount = TestObjectCount;
-			Span<long> data = new(_testObjects, 0, dataCount);
+			Span<int> data = new(_testObjects, 0, dataCount);
 			for (int i = 0; i < dataCount; i++)
 			{
 				data[i] = i;

Recyclable.Collections.Benchmarks/POC/TaskRunVsTaskFactoryStartNew.Benchmarks.cs

@@ -1,29 +1,25 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Threading.Tasks;
-using System.Threading.Tasks.Sources;
+// Ignore Spelling: Poc
+
 using BenchmarkDotNet.Attributes;
-using Microsoft.Extensions.ObjectPool;
 
 namespace Recyclable.Collections.Benchmarks.POC
 {
 	[MemoryDiagnoser]
-    public class TaskRunVsTaskFactoryStartNewBenchmarks
-    {
+	public class TaskRunVsTaskFactoryStartNewBenchmarks
+	{
 		public int NumberOfTasks = 100;
-		private static readonly TaskFactory TaskPool = new();
+		private static readonly TaskFactory _taskPool = new();
 
 		[Benchmark]
 		public void OwnTaskFactory()
 		{
 			for (var i = 0; i < NumberOfTasks; i++)
 			{
-				_ = TaskPool.StartNew(() => {});
+				_ = _taskPool.StartNew(() => {});
 			}
 		}
 
-        [Benchmark]
+		[Benchmark]
 		public void TaskRun()
 		{
 			for (var i = 0; i < NumberOfTasks; i++)
@@ -32,7 +28,7 @@ namespace Recyclable.Collections.Benchmarks.POC
 			}
 		}
 
-        [Benchmark(Baseline = true)]
+		[Benchmark(Baseline = true)]
 		public void TaskFactoryStartNew()
 		{
 			for (var i = 0; i < NumberOfTasks; i++)
@@ -59,5 +55,5 @@ namespace Recyclable.Collections.Benchmarks.POC
 				new Task(() => { }).Start(scheduler);
 			}
 		}
-    }
+	}
 }

Recyclable.Collections.Benchmarks/Program.cs

@@ -51,7 +51,8 @@ namespace Recyclable.Collections.Benchmarks
 			_ = BenchmarkRunner.Run<RoundUpToPowerOf2vsOtherBenchmarks>(BenchmarkConfig);
 			_ = BenchmarkRunner.Run<GreaterOperatorVsDoesntEqualOperatorBenchmarks>(BenchmarkConfig);
 			_ = BenchmarkRunner.Run<SpanConstructorVsTypecastingPocBenchmarks>(BenchmarkConfig);
-			// ArraySizeLimitPocBenchmarks>(BenchmarkConfig);
+
+			//ArraySizeLimitBenchmarks.Run();
 		}
 
 		static void Main()

Recyclable.Collections/ComparisonToComparerAdapter.cs

@@ -15,6 +15,7 @@ namespace Recyclable.Collections
 			{
 				return CompareResult.XEqualY;
 			}
+#pragma warning disable IDE0046 // This is intentional due to better performance - IL contained unnecessary local variable.
 			else if (x != null && y == null)
 			{
 				return CompareResult.XGreaterThenY;
@@ -27,6 +28,7 @@ namespace Recyclable.Collections
 			{
 				return _comparison(x!, y!);
 			}
+#pragma warning restore IDE0046
 		}
 	}
 }

Recyclable.Collections/ExceptionExtensions.cs

@@ -4,7 +4,7 @@ namespace Recyclable.Collections
 {
 	internal static class ExceptionExtensions
 	{
-		public static void CaptureAndRethrow(this Exception ex)
+		public static void CaptureAndReThrow(this Exception ex)
 		{
 			ExceptionDispatchInfo.Capture(ex).Throw();
 		}

Recyclable.Collections/Linq/QuickSortExtensions.cs

@@ -1,10 +1,5 @@
 // Ignore Spelling: Linq
-using System;
-using System.Collections.Generic;
-using System.Linq;
 using System.Runtime.CompilerServices;
-using System.Text;
-using System.Threading.Tasks;
 
 // The source code was taken from
 // https://codereview.stackexchange.com/questions/205407/quicksort-without-recursion.

Recyclable.Collections/MemoryBucket.cs

@@ -13,12 +13,12 @@ namespace Recyclable.Collections
 			_memory = memory;
 		}
 
-#pragma warning disable RCS1085
+#pragma warning disable IDE0032 // This is intentional due to better performance
 		private T[] _memory;
 		public T[] Memory { get => _memory; set => _memory = value; }
 
 		private MemoryBucket<T>? _nextBucket;
+#pragma warning restore IDE0032 // Use auto property
 		public MemoryBucket<T>? NextBucket { get => _nextBucket; set => _nextBucket = value; }
-#pragma warning restore RCS1085
 	}
 }

Recyclable.Collections/Pools/MemoryUtils.cs

@@ -7,26 +7,20 @@ namespace Recyclable.Collections.Pools
 		Low
 	}
 
-    internal static class MemoryUtils
-    {
-        public static MemoryPressure GetMemoryPressure()
-        {
-            const double HighPressureThreshold = .90;       // Percent of GC memory pressure threshold we consider "high"
-            const double MediumPressureThreshold = .70;     // Percent of GC memory pressure threshold we consider "medium"
+	internal static class MemoryUtils
+	{
+		private const double HighPressureThreshold = .90;       // Percent of GC memory pressure threshold we consider "high"
+		private const double MediumPressureThreshold = .70;     // Percent of GC memory pressure threshold we consider "medium"
 
-            GCMemoryInfo memoryInfo = GC.GetGCMemoryInfo();
+		public static MemoryPressure GetMemoryPressure()
+		{
+			GCMemoryInfo memoryInfo = GC.GetGCMemoryInfo();
 
-            if (memoryInfo.MemoryLoadBytes >= memoryInfo.HighMemoryLoadThresholdBytes * HighPressureThreshold)
-            {
-                return MemoryPressure.High;
-            }
-
-            if (memoryInfo.MemoryLoadBytes >= memoryInfo.HighMemoryLoadThresholdBytes * MediumPressureThreshold)
-            {
-                return MemoryPressure.Medium;
-            }
-
-            return MemoryPressure.Low;
-        }
-    }
+			return memoryInfo.MemoryLoadBytes >= memoryInfo.HighMemoryLoadThresholdBytes * HighPressureThreshold
+				? MemoryPressure.High
+				: memoryInfo.MemoryLoadBytes >= memoryInfo.HighMemoryLoadThresholdBytes * MediumPressureThreshold
+				? MemoryPressure.Medium
+				: MemoryPressure.Low;
+		}
+	}
 }

Recyclable.Collections/RecyclableList.AddRange.cs

@@ -4,7 +4,9 @@ using System.Runtime.CompilerServices;
 
 namespace Recyclable.Collections
 {
+#pragma warning disable IDE1006 // This is intentional naming for the class to show up at the end of IntelliSense list.
 	public static class zRecyclableListAddRange
+#pragma warning restore IDE1006 // This is intentional naming for the class to show up at the end of IntelliSense list.
 	{
 		private static void AddRangeEnumerated<T>(this RecyclableList<T> list, IEnumerable<T> items, int growByCount)
 		{

Recyclable.Collections/RecyclableList.Helpers.cs

@@ -5,7 +5,7 @@ namespace Recyclable.Collections
 {
 	internal static class RecyclableListHelpers<T>
 	{
-		private static readonly bool NeedsClearing = !typeof(T).IsValueType;
+		private static readonly bool _needsClearing = !typeof(T).IsValueType;
 
 		public static int CalculateIndex(int index, int lowerBound) => index >= 0 ? index + lowerBound : RecyclableDefaults.ItemNotFoundIndex;
 
@@ -30,7 +30,7 @@ namespace Recyclable.Collections
 				//	Array.Clear(source);
 				//}
 
-				RecyclableArrayPool<T>.ReturnShared(oldMemoryBlock, NeedsClearing);
+				RecyclableArrayPool<T>.ReturnShared(oldMemoryBlock, _needsClearing);
 			}
 		}
 
@@ -54,7 +54,7 @@ namespace Recyclable.Collections
 				//}
 
 				// If anything, it has been already cleared above, so we don't need to repeat it.
-				RecyclableArrayPool<T>.ReturnShared(oldMemoryBlock, NeedsClearing);
+				RecyclableArrayPool<T>.ReturnShared(oldMemoryBlock, _needsClearing);
 			}
 
 			return newSize;
@@ -80,7 +80,7 @@ namespace Recyclable.Collections
 				//}
 
 				// If anything, it has been already cleared above, so we don't need to repeat it.
-				RecyclableArrayPool<T>.ReturnShared(oldMemoryBlock, NeedsClearing);
+				RecyclableArrayPool<T>.ReturnShared(oldMemoryBlock, _needsClearing);
 			}
 
 			return newSize;

Recyclable.Collections/RecyclableList.cs

@@ -41,22 +41,6 @@ namespace Recyclable.Collections
 			}
 		}
 
-		public RecyclableList(int initialCapacity, int lowerBound)
-		{
-			if (initialCapacity >= RecyclableDefaults.InitialCapacity)
-			{
-				_memoryBlock = initialCapacity >= RecyclableDefaults.MinPooledArrayLength
-					? RecyclableArrayPool<T>.RentShared(checked((int)BitOperations.RoundUpToPowerOf2((uint)initialCapacity)))
-					: new T[initialCapacity];
-				_capacity = _memoryBlock.Length;
-			}
-			else
-			{
-				_memoryBlock = new T[RecyclableDefaults.InitialCapacity];
-				_capacity = RecyclableDefaults.InitialCapacity;
-			}
-		}
-
 		public RecyclableList(in Array source)
 		{
 			_capacity = RecyclableDefaults.InitialCapacity;

Recyclable.Collections/RecyclableLongList.AddRange.cs

@@ -4,7 +4,9 @@ using Recyclable.Collections.Pools;
 
 namespace Recyclable.Collections
 {
+#pragma warning disable IDE1006 // This is intentional naming for the class to show up at the end of IntelliSense list.
 	public static class zRecyclableLongListAddRange
+#pragma warning restore IDE1006
 	{
 		private static void AddRangeEnumerated<T>(this RecyclableLongList<T> targetList, IEnumerable<T> items)
 		{

Recyclable.Collections/RecyclableLongList.Enumerator.cs

@@ -16,7 +16,9 @@ namespace Recyclable.Collections
 			private readonly RecyclableLongList<T> _list;
 
 #nullable disable
+#pragma warning disable IDE0032 // This is intentional due to better performance
 			private T _current;
+#pragma warning restore IDE0032
 #nullable restore
 
 			[Pure]

Recyclable.Collections/RecyclableLongList.IndexOfHelpers.cs

@@ -284,7 +284,7 @@ namespace Recyclable.Collections
 
 				try
 				{
-					context.Exception.CaptureAndRethrow();
+					context.Exception.CaptureAndReThrow();
 				}
 				finally
 				{

Recyclable.Collections/RecyclableQueue.cs

@@ -150,9 +150,7 @@ namespace Recyclable.Collections
 					{
 						RemoveBlock(Memory._count - 1);
 					}
-#pragma warning disable RCS1075 // We want to try returning as many arrays, as possible, before the list is cleared.
 					catch (Exception)
-#pragma warning restore RCS1075
 					{
 					}
 				}

Recyclable.Collections/ThrowHelper.cs

@@ -1,6 +1,4 @@
-using System.Diagnostics.Contracts;
-
-namespace Recyclable.Collections
+namespace Recyclable.Collections
 {
 	internal static class ThrowHelper
 	{

Recyclable.CollectionsTests/MathUtilsTests.cs

@@ -1,4 +1,6 @@
-using FluentAssertions;
+// Ignore Spelling: Utils
+
+using FluentAssertions;
 using Recyclable.Collections;
 
 namespace Recyclable.CollectionsTests

Recyclable.CollectionsTests/RecyclableListTests.cs

@@ -1329,13 +1329,13 @@ namespace Recyclable.CollectionsTests
 		public void RemoveAtShouldClearItemWhenReferenceType(string testCase, IEnumerable<object> testData, int itemsCount, in long[] indexesToRemove)
 		{
 			// Prepare
-			foreach (int indexToRemove in indexesToRemove)
+			foreach (long indexToRemove in indexesToRemove)
 			{
 				using var list = new RecyclableList<object>(testData, itemsCount);
 				_ = list[^1].Should().NotBeNull();
 
 				// Act
-				list.RemoveAt(indexToRemove);
+				list.RemoveAt((int)indexToRemove);
 
 				// Validate
 				_ = list[list.Count].Should().BeNull();
@@ -1391,7 +1391,7 @@ namespace Recyclable.CollectionsTests
 		public void RemoveShouldClearItemWhenReferenceType(string testCase, IEnumerable<object> testData, int itemsCount, in long[] indexesToRemove)
 		{
 
-			foreach (int indexToRemove in indexesToRemove)
+			foreach (long indexToRemove in indexesToRemove)
 			{
 				// Prepare
 				using var list = new RecyclableList<object>(testData, itemsCount);

Recyclable.CollectionsTests/RecyclableQueueTests.cs

@@ -86,7 +86,7 @@ namespace Recyclable.CollectionsTests
 		}
 
 		[Fact]
-		public void DequeueShoudRaiseArgumentOutOfRangeWhenNoMoreElementsFound()
+		public void DequeueShouldRaiseArgumentOutOfRangeWhenNoMoreElementsFound()
 		{
 			// Prepare
 			using var list = new RecyclableQueue<string>(_testData);

Recyclable.CollectionsTests/RecyclableStackTests.cs

@@ -101,7 +101,7 @@ namespace Recyclable.CollectionsTests
 		}
 
 		[Fact]
-		public void PopShoudRaiseArgumentOutOfRangeWhenNoMoreElementsFound()
+		public void PopShouldRaiseArgumentOutOfRangeWhenNoMoreElementsFound()
 		{
 			// Prepare
 			using var list = new RecyclableQueue<string>(_testData);