RecyclableArrayList.AddRange(IEnumerable<T>) performance improvements. ...WhenSourceIsIEnumerable benchmarks reworked to use real IEnumerable, which can't be typecasted to anything.

Recyclable.CollectionsTests/RecyclableArrayListTests.cs

@@ -62,6 +62,22 @@ namespace Recyclable.CollectionsTests
 				.And.BeEquivalentTo(testData);
 		}
 
+		[Fact]
+		public void ConstructorShouldAddItemsInCorrectOrderWhenSourceIsIEnumerable()
+		{
+			// Prepare
+			var testData = _testData;
+
+			// Act
+			var list = new RecyclableArrayList<int>(testData);
+
+			// Validate
+			_ = list.Capacity.Should().Be(32, "when we succeed in taking count without enumerating, then we allocate as much memory as needed, only");
+			_ = list.Should().HaveCount(testData.Count())
+				.And.ContainInConsecutiveOrder(testData)
+				.And.BeEquivalentTo(testData);
+		}
+
 		[Fact]
 		public void InsertAtTheBeginningShouldMoveItems()
 		{