Switches converted back to IFs. They are IF's in IL anyway.

Recyclable.Collections/RecyclableList.cs

@@ -45,16 +45,14 @@ namespace Recyclable.Collections
 			}
 
 			list._longCount--;
-			switch (list._lastItemIndex)
+			if (list._lastItemIndex <= 0)
 			{
-				case 0:
 				list._lastBlockIndex--;
 				list._lastItemIndex = list._blockSize;
-					break;
+			}
-
+			else
-				default:
+			{
 				list._lastItemIndex--;
-					break;
 			}
 
 			int blockSize = list._blockSize;
@@ -103,39 +101,33 @@ namespace Recyclable.Collections
 			int uninitializedBlocksCount = newMemoryBlocksSpan.Length;
 			if (uninitializedBlocksCount == requiredBlockCount)
 			{
-				switch (blockSize >= RecyclableDefaults.MinPooledArrayLength)
+				if (blockSize >= RecyclableDefaults.MinPooledArrayLength)
 				{
-					case true:
 					newMemoryBlocksSpan[0] = blockArrayPool.Rent(blockSize);
 					blockSize = newMemoryBlocksSpan[0].Length;
-						break;
+				}
-
+				else
-					case false:
+				{
 					newMemoryBlocksSpan[0] = new T[blockSize];
-						break;
 				}
 
 				newMemoryBlocksSpan = newMemoryBlocksSpan[1..];
 				uninitializedBlocksCount--;
 			}
 
-			switch (blockSize >= RecyclableDefaults.MinPooledArrayLength)
+			if (blockSize >= RecyclableDefaults.MinPooledArrayLength)
 			{
-				case true:
 				for (int i = 0; i < uninitializedBlocksCount; i++)
 				{
 					newMemoryBlocksSpan[i] = blockArrayPool.Rent(blockSize);
 				}
-
+			}
-					break;
+			else
-
+			{
-				case false:
 				for (int i = 0; i < uninitializedBlocksCount; i++)
 				{
 					newMemoryBlocksSpan[i] = new T[blockSize];
 				}
-
-					break;
 			}
 
 			return newMemoryBlocks;
@@ -146,20 +138,17 @@ namespace Recyclable.Collections
 			T[][] memory = _memoryBlocks;
 			long newCapacity;
 
-			switch (_capacity > 0)
+			if (_capacity > 0)
 			{
-				case true:
 				newCapacity = _capacity;
 				while (newCapacity < requestedCapacity)
 				{
 					newCapacity *= 2;
 				}
-
+			}
-					break;
+			else
-
+			{
-				case false:
 				newCapacity = requestedCapacity;
-					break;
 			}
 
 			memory = SetNewLength(memory, _blockSize, newCapacity);
@@ -176,9 +165,8 @@ namespace Recyclable.Collections
 
 		public RecyclableList(int blockSize = RecyclableDefaults.BlockSize, long? expectedItemsCount = default)
 		{
-			switch (expectedItemsCount > 0)
+			if (expectedItemsCount > 0)
 			{
-				case true:
 				_memoryBlocks = SetNewLength(_memoryBlocks, blockSize, expectedItemsCount.Value);
 				if (_memoryBlocks.Length > 0)
 				{
@@ -187,20 +175,18 @@ namespace Recyclable.Collections
 
 				_blockSize = blockSize;
 				_capacity = _memoryBlocks.Length * blockSize;
-					break;
+			}
-
+			else
-				case false:
+			{
 				_blockSize = blockSize;
 				_memoryBlocks = _emptyMemoryBlocksArray;
-					break;
 			}
 		}
 
 		public RecyclableList(IEnumerable<T> source, int blockSize = RecyclableDefaults.BlockSize, long? expectedItemsCount = default)
 		{
-			switch (expectedItemsCount > 0)
+			if (expectedItemsCount > 0)
 			{
-				case true:
 				_memoryBlocks = SetNewLength(_memoryBlocks, blockSize, expectedItemsCount.Value);
 				if (_memoryBlocks.Length > 0)
 				{
@@ -209,12 +195,11 @@ namespace Recyclable.Collections
 
 				_blockSize = blockSize;
 				_capacity = _memoryBlocks.Length * blockSize;
-					break;
+			}
-
+			else
-				case false:
+			{
 				_blockSize = blockSize;
 				_memoryBlocks = _emptyMemoryBlocksArray;
-					break;
 			}
 
 			AddRange(source);
@@ -515,15 +500,13 @@ namespace Recyclable.Collections
 		public bool Remove(T item) => throw new NotSupportedException();
 		public void RemoveBlock(int index)
 		{
-			switch (_blockSize >= RecyclableDefaults.MinPooledArrayLength)
+			if (_blockSize >= RecyclableDefaults.MinPooledArrayLength)
 			{
-				case true:
 				_blockArrayPool.Return(_memoryBlocks[index]);
-					break;
+			}
-
+			else
-				case false:
+			{
 				_memoryBlocks[index] = _emptyBlockArray;
-					break;
 			}
 
 			_capacity -= _blockSize;