Annotate enumerators and extension helpers for versioned variants

.vscode/settings.json

@@ -1 +0,0 @@
-{}

Recyclable.Collections/RecyclableLinkedList.cs

@@ -292,7 +292,7 @@ namespace Recyclable.Collections
                     return false;
                 }
 
-                while (_index >= _chunk.Top)
+                if (_index >= _chunk.Top)
                 {
                     _chunk = _chunk.Next;
                     if (_chunk == null)

Recyclable.Collections/RecyclableList.Enumerator.cs

@@ -8,6 +8,7 @@ namespace Recyclable.Collections
 	{
                 [StructLayout(LayoutKind.Sequential, Pack = 1)]
                 [VersionedCollectionsGenerator.CloneForVersioned]
+                // TODO: confirm if enumerator should implement a versioned interface for generated types
                 public struct Enumerator : IEnumerator<T>
                 {
 			private static readonly bool _isReferenceType = !typeof(T).IsValueType;

Recyclable.Collections/RecyclableList.VersionedEnumerator.cs

@@ -11,6 +11,7 @@ namespace Recyclable.Collections
 
                 [StructLayout(LayoutKind.Sequential, Pack = 1)]
                 [VersionedCollectionsGenerator.CloneForVersioned]
+                // TODO: confirm if enumerator should implement a versioned interface for generated types
                 public struct VersionedEnumerator : IEnumerator<T>
                 {
 			private int _currentItemIndex;

Recyclable.Collections/RecyclableList.cs

@@ -365,27 +365,18 @@ namespace Recyclable.Collections
 
                 [MethodImpl(MethodImplOptions.AggressiveInlining)]
                 [VersionedCollectionsGenerator.CloneForVersioned]
-#if WITH_VERSIONING
+                // TODO: review if returned enumerator type should change for versioned list
-                public VersionedEnumerator GetEnumerator() => new(this);
-#else
                 public Enumerator GetEnumerator() => new(this);
-#endif
 
                 [MethodImpl(MethodImplOptions.AggressiveInlining)]
                 [VersionedCollectionsGenerator.CloneForVersioned]
-#if WITH_VERSIONING
+                // TODO: review if returned enumerator type should change for versioned list
-                IEnumerator IEnumerable.GetEnumerator() => new VersionedEnumerator(this);
-#else
                 IEnumerator IEnumerable.GetEnumerator() => new Enumerator(this);
-#endif
 
                 [MethodImpl(MethodImplOptions.AggressiveInlining)]
                 [VersionedCollectionsGenerator.CloneForVersioned]
-#if WITH_VERSIONING
+                // TODO: review if returned enumerator type should change for versioned list
-                IEnumerator<T> IEnumerable<T>.GetEnumerator() => new VersionedEnumerator(this);
-#else
                 IEnumerator<T> IEnumerable<T>.GetEnumerator() => new Enumerator(this);
-#endif
 
 		public void Dispose()
 		{

Recyclable.Collections/RecyclableLongList.Enumerator.cs

@@ -6,6 +6,7 @@ namespace Recyclable.Collections
 	public partial class RecyclableLongList<T>
 	{
                 [VersionedCollectionsGenerator.CloneForVersioned]
+                // TODO: confirm if enumerator should implement a versioned interface for generated types
                 public struct Enumerator : IEnumerator<T>
                 {
 #nullable disable

Recyclable.Collections/RecyclableLongList.Helpers.cs

@@ -1,5 +1,4 @@
 using Recyclable.Collections.Pools;
-using System.Numerics;
 using System.Runtime.CompilerServices;
 
 namespace Recyclable.Collections
@@ -79,9 +78,9 @@ namespace Recyclable.Collections
 
 				ReadOnlySpan<T> sourceBlockMemory;
 				Span<T> destinationArrayMemory;
-                                int blockSizePow2Shift = BitOperations.TrailingZeroCount((uint)blockSize);
+				// TODO: Replace with bit-shifting
-                                int startingBlockIndex = (int)(startingIndex >> blockSizePow2Shift);
+				int startingBlockIndex = (int)(startingIndex / blockSize);
-                                int lastBlockIndex = (int)((itemsCount >> blockSizePow2Shift) + ((itemsCount & (blockSize - 1)) != 0 ? 1 : 0)) - 1;
+				int lastBlockIndex = (int)((itemsCount / blockSize) + (itemsCount % blockSize != 0 ? 1 : 0)) - 1;
 				ReadOnlySpan<T[]> sourceMemoryBlocksSpan = new(sourceMemoryBlocks, startingBlockIndex, lastBlockIndex + 1);
 				destinationArrayMemory = new Span<T>(destinationArray, destinationArrayIndex, (int)Math.Min(destinationArray.Length - destinationArrayIndex, itemsCount));
 				int memoryBlockIndex;
@@ -106,9 +105,9 @@ namespace Recyclable.Collections
 					return;
 				}
 
-                                int blockSizePow2Shift = BitOperations.TrailingZeroCount((uint)blockSize);
+				// TODO: Replace with bit-shifting
-                                int startingBlockIndex = (int)(startingIndex >> blockSizePow2Shift);
+				int startingBlockIndex = (int)(startingIndex / blockSize);
-                                int lastBlockIndex = (int)((itemsCount >> blockSizePow2Shift) + ((itemsCount & (blockSize - 1)) != 0 ? 1 : 0)) - 1;
+				int lastBlockIndex = (int)((itemsCount / blockSize) + (itemsCount % blockSize != 0 ? 1 : 0)) - 1;
 
 				var destinationIndex = destinationArrayIndex;
 				ReadOnlySpan<T[]> sourceMemoryBlocksSpan = new(sourceMemoryBlocks, startingBlockIndex, lastBlockIndex + 1);

Recyclable.Collections/RecyclableLongList.VersionedEnumerator.cs

@@ -11,6 +11,7 @@ namespace Recyclable.Collections
                 VersionedEnumerator IRecyclableVersionedLongList<T>.GetEnumerator() => new(this);
 
                 [VersionedCollectionsGenerator.CloneForVersioned]
+                // TODO: confirm if enumerator should implement a versioned interface for generated types
                 public struct VersionedEnumerator : IEnumerator<T>
                 {
 #nullable disable

Recyclable.Collections/RecyclableLongList.cs

@@ -373,23 +373,14 @@ namespace Recyclable.Collections
 		public void CopyTo(T[] array, int arrayIndex) => Helpers.CopyTo(_memoryBlocks, 0, _blockSize, _longCount, array, arrayIndex);
 
                 [VersionedCollectionsGenerator.CloneForVersioned]
-#if WITH_VERSIONING
+                // TODO: review if returned enumerator type should change for versioned list
-                public VersionedEnumerator GetEnumerator() => new(this);
-#else
                 public Enumerator GetEnumerator() => new(this);
-#endif
                 [VersionedCollectionsGenerator.CloneForVersioned]
-#if WITH_VERSIONING
+                // TODO: review if returned enumerator type should change for versioned list
-                IEnumerator IEnumerable.GetEnumerator() => new VersionedEnumerator(this);
-#else
                 IEnumerator IEnumerable.GetEnumerator() => new Enumerator(this);
-#endif
                 [VersionedCollectionsGenerator.CloneForVersioned]
-#if WITH_VERSIONING
+                // TODO: review if returned enumerator type should change for versioned list
-                IEnumerator<T> IEnumerable<T>.GetEnumerator() => new VersionedEnumerator(this);
-#else
                 IEnumerator<T> IEnumerable<T>.GetEnumerator() => new Enumerator(this);
-#endif
 
 		[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
 		public int IndexOf(T item)

Recyclable.Collections/RecyclableQueue.AddRange.cs

@@ -1,928 +0,0 @@
-using System.Collections;
-using System.Linq.Expressions;
-using System.Reflection;
-using System.Runtime.CompilerServices;
-using System.Runtime.InteropServices;
-using System.Numerics;
-using Recyclable.Collections.Pools;
-
-namespace Recyclable.Collections
-{
-    internal static class zRecyclableQueueAddRange
-    {
-        private static class AddRangeHelper<T>
-        {
-            private static readonly Action<RecyclableQueue<T>, object>? _dictionaryAdder;
-            private static readonly Action<RecyclableQueue<T>, object>? _sortedListAdder;
-            private static readonly Type? _dictionaryType;
-            private static readonly Type? _sortedListType;
-
-            static AddRangeHelper()
-            {
-                Type elementType = typeof(T);
-                if (elementType.IsGenericType && elementType.GetGenericTypeDefinition() == typeof(KeyValuePair<,>))
-                {
-                    Type[] args = elementType.GetGenericArguments();
-                    _dictionaryType = typeof(RecyclableDictionary<,>).MakeGenericType(args);
-                    MethodInfo? method = typeof(zRecyclableQueueAddRange).GetMethod(
-                        nameof(AddRange),
-                        BindingFlags.NonPublic | BindingFlags.Static,
-                        binder: null,
-                        types: new[] { typeof(RecyclableQueue<>).MakeGenericType(elementType), _dictionaryType },
-                        modifiers: null);
-                    if (method != null)
-                    {
-                        var queueParam = Expression.Parameter(typeof(RecyclableQueue<T>));
-                        var objParam = Expression.Parameter(typeof(object));
-                        var call = Expression.Call(method, queueParam, Expression.Convert(objParam, _dictionaryType));
-                        _dictionaryAdder = Expression.Lambda<Action<RecyclableQueue<T>, object>>(call, queueParam, objParam).Compile();
-                    }
-                }
-                else if (elementType.IsGenericType && elementType.GetGenericTypeDefinition() == typeof(ValueTuple<,>))
-                {
-                    Type[] args = elementType.GetGenericArguments();
-                    _sortedListType = typeof(RecyclableSortedList<,>).MakeGenericType(args);
-                    MethodInfo? method = typeof(zRecyclableQueueAddRange).GetMethod(
-                        nameof(AddRange),
-                        BindingFlags.NonPublic | BindingFlags.Static,
-                        binder: null,
-                        types: new[] { typeof(RecyclableQueue<>).MakeGenericType(elementType), _sortedListType },
-                        modifiers: null);
-                    if (method != null)
-                    {
-                        var queueParam = Expression.Parameter(typeof(RecyclableQueue<T>));
-                        var objParam = Expression.Parameter(typeof(object));
-                        var call = Expression.Call(method, queueParam, Expression.Convert(objParam, _sortedListType));
-                        _sortedListAdder = Expression.Lambda<Action<RecyclableQueue<T>, object>>(call, queueParam, objParam).Compile();
-                    }
-                }
-            }
-
-            internal static bool TryAddRange(RecyclableQueue<T> queue, IEnumerable<T> items)
-            {
-                if (_dictionaryAdder != null && _dictionaryType!.IsInstanceOfType(items))
-                {
-                    _dictionaryAdder(queue, items);
-                    return true;
-                }
-
-                if (_sortedListAdder != null && _sortedListType!.IsInstanceOfType(items))
-                {
-                    _sortedListAdder(queue, items);
-                    return true;
-                }
-
-                return false;
-            }
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, ReadOnlySpan<T> items)
-        {
-            int count = items.Length;
-            if (count == 0)
-            {
-                return;
-            }
-
-            EnsureCapacity(queue, queue._count + count);
-
-            BiDirectionalRecyclableArrayPoolChunk<T> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-            int copied = 0;
-
-            while (copied < count)
-            {
-                if (index == chunkLength)
-                {
-                    chunk.Top = index;
-                    Grow(queue);
-                    chunk = queue._tail;
-                    index = chunk.Top;
-                    chunkLength = chunk.Value.Length;
-                }
-
-                int toCopy = Math.Min(chunkLength - index, count - copied);
-                items.Slice(copied, toCopy).CopyTo(new Span<T>(chunk.Value, index, toCopy));
-                copied += toCopy;
-                index += toCopy;
-            }
-
-            chunk.Top = index;
-            queue._count += count;
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, Span<T> items) => AddRange(queue, (ReadOnlySpan<T>)items);
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, T[] items) => AddRange(queue, (ReadOnlySpan<T>)items);
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, in Array items)
-        {
-            int count = items.Length;
-            if (count == 0)
-            {
-                return;
-            }
-
-            EnsureCapacity(queue, queue._count + count);
-
-            BiDirectionalRecyclableArrayPoolChunk<T> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-            int copied = 0;
-            int lower = items.GetLowerBound(0);
-
-            while (copied < count)
-            {
-                if (index == chunkLength)
-                {
-                    chunk.Top = index;
-                    Grow(queue);
-                    chunk = queue._tail;
-                    index = chunk.Top;
-                    chunkLength = chunk.Value.Length;
-                }
-
-                int toCopy = Math.Min(chunkLength - index, count - copied);
-                Array.Copy(items, lower + copied, chunk.Value, index, toCopy);
-                copied += toCopy;
-                index += toCopy;
-            }
-
-            chunk.Top = index;
-            queue._count += count;
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, List<T> items) => AddRange(queue, CollectionsMarshal.AsSpan(items));
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, ICollection items)
-        {
-            int count = items.Count;
-            if (count == 0)
-            {
-                return;
-            }
-
-            T[] buffer = count >= RecyclableDefaults.MinPooledArrayLength
-                ? RecyclableArrayPool<T>.RentShared(checked((int)BitOperations.RoundUpToPowerOf2((uint)count)))
-                : new T[count];
-
-            items.CopyTo(buffer, 0);
-
-            EnsureCapacity(queue, queue._count + count);
-
-            BiDirectionalRecyclableArrayPoolChunk<T> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-            int copied = 0;
-
-            while (copied < count)
-            {
-                if (index == chunkLength)
-                {
-                    chunk.Top = index;
-                    Grow(queue);
-                    chunk = queue._tail;
-                    index = chunk.Top;
-                    chunkLength = chunk.Value.Length;
-                }
-
-                int toCopy = Math.Min(chunkLength - index, count - copied);
-                Array.Copy(buffer, copied, chunk.Value, index, toCopy);
-                copied += toCopy;
-                index += toCopy;
-            }
-
-            chunk.Top = index;
-            queue._count += count;
-
-            if (count >= RecyclableDefaults.MinPooledArrayLength)
-            {
-                RecyclableArrayPool<T>.ReturnShared(buffer, RecyclableQueue<T>._needsClearing);
-            }
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, ICollection<T> items)
-        {
-            int count = items.Count;
-            if (count == 0)
-            {
-                return;
-            }
-
-            T[] buffer = count >= RecyclableDefaults.MinPooledArrayLength
-                ? RecyclableArrayPool<T>.RentShared(checked((int)BitOperations.RoundUpToPowerOf2((uint)count)))
-                : new T[count];
-
-            items.CopyTo(buffer, 0);
-
-            EnsureCapacity(queue, queue._count + count);
-
-            BiDirectionalRecyclableArrayPoolChunk<T> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-            int copied = 0;
-
-            while (copied < count)
-            {
-                if (index == chunkLength)
-                {
-                    chunk.Top = index;
-                    Grow(queue);
-                    chunk = queue._tail;
-                    index = chunk.Top;
-                    chunkLength = chunk.Value.Length;
-                }
-
-                int toCopy = Math.Min(chunkLength - index, count - copied);
-                Array.Copy(buffer, copied, chunk.Value, index, toCopy);
-                copied += toCopy;
-                index += toCopy;
-            }
-
-            chunk.Top = index;
-            queue._count += count;
-
-            if (count >= RecyclableDefaults.MinPooledArrayLength)
-            {
-                RecyclableArrayPool<T>.ReturnShared(buffer, RecyclableQueue<T>._needsClearing);
-            }
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, RecyclableList<T> items)
-        {
-            int count = items._count;
-            if (count == 0)
-            {
-                return;
-            }
-
-            EnsureCapacity(queue, queue._count + count);
-
-            BiDirectionalRecyclableArrayPoolChunk<T> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-            int copied = 0;
-
-            T[] source = items._memoryBlock;
-
-            while (copied < count)
-            {
-                if (index == chunkLength)
-                {
-                    chunk.Top = index;
-                    Grow(queue);
-                    chunk = queue._tail;
-                    index = chunk.Top;
-                    chunkLength = chunk.Value.Length;
-                }
-
-                int toCopy = Math.Min(chunkLength - index, count - copied);
-                Array.Copy(source, copied, chunk.Value, index, toCopy);
-                copied += toCopy;
-                index += toCopy;
-            }
-
-            chunk.Top = index;
-            queue._count += count;
-        }
-
-        [MethodImpl(MethodImplOptions.AggressiveInlining)]
-        private static void Grow<T>(RecyclableQueue<T> queue)
-        {
-            int newSize;
-            if (queue._capacity >= RecyclableDefaults.MaxPooledBlockSize)
-            {
-                newSize = RecyclableDefaults.MaxPooledBlockSize;
-            }
-            else
-            {
-                long doubled = queue._capacity << 1;
-                newSize = (int)Math.Min(doubled - queue._capacity, RecyclableDefaults.MaxPooledBlockSize);
-            }
-
-            var newChunk = BiDirectionalRecyclableArrayPoolChunkPool<T>.Rent();
-            if (newChunk.Value.Length < newSize)
-            {
-                if (newChunk.Value.Length >= RecyclableDefaults.MinPooledArrayLength)
-                {
-                    RecyclableArrayPool<T>.ReturnShared(newChunk.Value, RecyclableQueue<T>._needsClearing);
-                }
-
-                newChunk.Value = newSize >= RecyclableDefaults.MinPooledArrayLength
-                    ? RecyclableArrayPool<T>.RentShared(newSize)
-                    : new T[newSize];
-            }
-
-            newChunk.Top = 0;
-            newChunk.Bottom = 0;
-            newChunk.Previous = queue._tail;
-            newChunk.Next = null;
-            queue._tail.Next = newChunk;
-            queue._tail = newChunk;
-            queue._capacity += newSize;
-        }
-
-        [MethodImpl(MethodImplOptions.AggressiveInlining)]
-        private static void Grow<T>(RecyclableQueue<T> queue, long additionalCapacity)
-        {
-            int newSize = additionalCapacity >= RecyclableDefaults.MaxPooledBlockSize
-                ? RecyclableDefaults.MaxPooledBlockSize
-                : (int)Math.Min(BitOperations.RoundUpToPowerOf2((uint)additionalCapacity), RecyclableDefaults.MaxPooledBlockSize);
-
-            var newChunk = BiDirectionalRecyclableArrayPoolChunkPool<T>.Rent();
-            if (newChunk.Value.Length < newSize)
-            {
-                if (newChunk.Value.Length >= RecyclableDefaults.MinPooledArrayLength)
-                {
-                    RecyclableArrayPool<T>.ReturnShared(newChunk.Value, RecyclableQueue<T>._needsClearing);
-                }
-
-                newChunk.Value = newSize >= RecyclableDefaults.MinPooledArrayLength
-                    ? RecyclableArrayPool<T>.RentShared(newSize)
-                    : new T[newSize];
-            }
-
-            newChunk.Top = 0;
-            newChunk.Bottom = 0;
-            newChunk.Previous = queue._tail;
-            newChunk.Next = null;
-            queue._tail.Next = newChunk;
-            queue._tail = newChunk;
-            queue._capacity += newSize;
-        }
-
-        [MethodImpl(MethodImplOptions.AggressiveInlining)]
-        private static void EnsureCapacity<T>(RecyclableQueue<T> queue, long requiredCapacity)
-        {
-            while (queue._capacity < requiredCapacity)
-            {
-                Grow(queue, requiredCapacity - queue._capacity);
-            }
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, RecyclableLongList<T> items)
-        {
-            long longCount = items._longCount;
-            if (longCount == 0)
-            {
-                return;
-            }
-
-            int blockSize = items._blockSize;
-            int fullBlocks = (int)(longCount >> items._blockSizePow2BitShift);
-            int lastBlockLength = (int)(longCount & items._blockSizeMinus1);
-
-            BiDirectionalRecyclableArrayPoolChunk<T> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-
-            for (int blockIndex = 0; blockIndex < fullBlocks; blockIndex++)
-            {
-                T[] block = items._memoryBlocks[blockIndex];
-                int sourceIndex = 0;
-                while (sourceIndex < blockSize)
-                {
-                    if (index == chunkLength)
-                    {
-                        chunk.Top = index;
-                        Grow(queue);
-                        chunk = queue._tail;
-                        index = chunk.Top;
-                        chunkLength = chunk.Value.Length;
-                    }
-
-                    int toCopy = Math.Min(chunkLength - index, blockSize - sourceIndex);
-                    Array.Copy(block, sourceIndex, chunk.Value, index, toCopy);
-                    sourceIndex += toCopy;
-                    index += toCopy;
-                }
-            }
-
-            if (lastBlockLength > 0)
-            {
-                T[] block = items._memoryBlocks[fullBlocks];
-                int sourceIndex = 0;
-                while (sourceIndex < lastBlockLength)
-                {
-                    if (index == chunkLength)
-                    {
-                        chunk.Top = index;
-                        Grow(queue);
-                        chunk = queue._tail;
-                        index = chunk.Top;
-                        chunkLength = chunk.Value.Length;
-                    }
-
-                    int toCopy = Math.Min(chunkLength - index, lastBlockLength - sourceIndex);
-                    Array.Copy(block, sourceIndex, chunk.Value, index, toCopy);
-                    sourceIndex += toCopy;
-                    index += toCopy;
-                }
-            }
-
-            chunk.Top = index;
-            queue._count += longCount;
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, RecyclableHashSet<T> items)
-        {
-            int count = items._count;
-            if (count == 0)
-            {
-                return;
-            }
-
-            var entries = items._entries;
-            int shift = items._blockShift,
-                mask = items._blockSizeMinus1;
-
-            BiDirectionalRecyclableArrayPoolChunk<T> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-            int copied = 0;
-
-            while (copied < count)
-            {
-                if (index == chunkLength)
-                {
-                    chunk.Top = index;
-                    Grow(queue);
-                    chunk = queue._tail;
-                    index = chunk.Top;
-                    chunkLength = chunk.Value.Length;
-                }
-
-                int toCopy = Math.Min(chunkLength - index, count - copied);
-                var destination = chunk.Value;
-                for (int i = 0; i < toCopy; i++)
-                {
-                    destination[index + i] = entries[(copied + i) >> shift][(copied + i) & mask].Value;
-                }
-                copied += toCopy;
-                index += toCopy;
-            }
-
-            chunk.Top = index;
-            queue._count += count;
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, RecyclableStack<T> items)
-        {
-            long longCount = items._count;
-            if (longCount == 0)
-            {
-                return;
-            }
-
-            BiDirectionalRecyclableArrayPoolChunk<T> destChunk = queue._tail;
-            int destIndex = destChunk.Top;
-            int destLength = destChunk.Value.Length;
-
-            RecyclableArrayPoolChunk<T> sourceChunk = items._current;
-            while (sourceChunk.Previous != null)
-            {
-                sourceChunk = sourceChunk.Previous;
-            }
-
-            while (sourceChunk != null)
-            {
-                T[] source = sourceChunk.Value;
-                int sourceCount = sourceChunk.Index;
-                int sourceIndex = 0;
-
-                while (sourceIndex < sourceCount)
-                {
-                    if (destIndex == destLength)
-                    {
-                        destChunk.Top = destIndex;
-                        Grow(queue);
-                        destChunk = queue._tail;
-                        destIndex = destChunk.Top;
-                        destLength = destChunk.Value.Length;
-                    }
-
-                    int toCopy = Math.Min(destLength - destIndex, sourceCount - sourceIndex);
-                    Array.Copy(source, sourceIndex, destChunk.Value, destIndex, toCopy);
-                    sourceIndex += toCopy;
-                    destIndex += toCopy;
-                }
-
-                sourceChunk = sourceChunk.Next!;
-            }
-
-            destChunk.Top = destIndex;
-            queue._count += longCount;
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, RecyclableSortedSet<T> items)
-        {
-            int count = items._count;
-            if (count == 0)
-            {
-                return;
-            }
-
-            T[] source = items._items;
-            BiDirectionalRecyclableArrayPoolChunk<T> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-            int copied = 0;
-
-            while (copied < count)
-            {
-                if (index == chunkLength)
-                {
-                    chunk.Top = index;
-                    Grow(queue);
-                    chunk = queue._tail;
-                    index = chunk.Top;
-                    chunkLength = chunk.Value.Length;
-                }
-
-                int toCopy = Math.Min(chunkLength - index, count - copied);
-                Array.Copy(source, copied, chunk.Value, index, toCopy);
-                copied += toCopy;
-                index += toCopy;
-            }
-
-            chunk.Top = index;
-            queue._count += count;
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, RecyclableLinkedList<T> items)
-        {
-            long longCount = items._count;
-            if (longCount == 0)
-            {
-                return;
-            }
-
-            BiDirectionalRecyclableArrayPoolChunk<T> destChunk = queue._tail;
-            int destIndex = destChunk.Top;
-            int destLength = destChunk.Value.Length;
-
-            var sourceChunk = items._head;
-            while (sourceChunk != null)
-            {
-                int sourceIndex = sourceChunk.Bottom;
-                int sourceTop = sourceChunk.Top;
-                T[] source = sourceChunk.Value;
-
-                while (sourceIndex < sourceTop)
-                {
-                    if (destIndex == destLength)
-                    {
-                        destChunk.Top = destIndex;
-                        Grow(queue);
-                        destChunk = queue._tail;
-                        destIndex = destChunk.Top;
-                        destLength = destChunk.Value.Length;
-                    }
-
-                    int toCopy = Math.Min(destLength - destIndex, sourceTop - sourceIndex);
-                    Array.Copy(source, sourceIndex, destChunk.Value, destIndex, toCopy);
-                    sourceIndex += toCopy;
-                    destIndex += toCopy;
-                }
-
-                sourceChunk = sourceChunk.Next;
-            }
-
-            destChunk.Top = destIndex;
-            queue._count += longCount;
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, RecyclablePriorityQueue<T> items)
-        {
-            int count = items._size;
-            if (count == 0)
-            {
-                return;
-            }
-
-            T[] source = items._heap;
-            BiDirectionalRecyclableArrayPoolChunk<T> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-            int copied = 0;
-
-            while (copied < count)
-            {
-                if (index == chunkLength)
-                {
-                    chunk.Top = index;
-                    Grow(queue);
-                    chunk = queue._tail;
-                    index = chunk.Top;
-                    chunkLength = chunk.Value.Length;
-                }
-
-                int toCopy = Math.Min(chunkLength - index, count - copied);
-                Array.Copy(source, copied, chunk.Value, index, toCopy);
-                copied += toCopy;
-                index += toCopy;
-            }
-
-            chunk.Top = index;
-            queue._count += count;
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, RecyclableQueue<T> items)
-        {
-            long longCount = items._count;
-            if (longCount == 0)
-            {
-                return;
-            }
-
-            BiDirectionalRecyclableArrayPoolChunk<T> destChunk = queue._tail;
-            int destIndex = destChunk.Top;
-            int destLength = destChunk.Value.Length;
-
-            EnsureCapacity(queue, queue._count + longCount);
-
-            var sourceChunk = items._head;
-            while (sourceChunk != null)
-            {
-                int sourceIndex = sourceChunk.Bottom;
-                int sourceTop = sourceChunk.Top;
-                T[] source = sourceChunk.Value;
-
-                while (sourceIndex < sourceTop)
-                {
-                    if (destIndex == destLength)
-                    {
-                        destChunk.Top = destIndex;
-                        destChunk = destChunk.Next!;
-                        destIndex = destChunk.Top;
-                        destLength = destChunk.Value.Length;
-                    }
-
-                    int toCopy = Math.Min(destLength - destIndex, sourceTop - sourceIndex);
-                    Array.Copy(source, sourceIndex, destChunk.Value, destIndex, toCopy);
-                    sourceIndex += toCopy;
-                    destIndex += toCopy;
-                }
-
-                sourceChunk = sourceChunk.Next;
-            }
-
-            destChunk.Top = destIndex;
-            queue._count += longCount;
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<TKey, TValue>(this RecyclableQueue<KeyValuePair<TKey, TValue>> queue, RecyclableDictionary<TKey, TValue> items)
-            where TKey : notnull
-        {
-            int count = items._count;
-            if (count == 0)
-            {
-                return;
-            }
-
-            EnsureCapacity(queue, queue._count + count);
-
-            var entries = items._entries;
-            int shift = items._blockShift,
-                mask = items._blockSizeMinus1;
-
-            BiDirectionalRecyclableArrayPoolChunk<KeyValuePair<TKey, TValue>> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-            int copied = 0;
-
-            while (copied < count)
-            {
-                if (index == chunkLength)
-                {
-                    chunk.Top = index;
-                    Grow(queue);
-                    chunk = queue._tail;
-                    index = chunk.Top;
-                    chunkLength = chunk.Value.Length;
-                }
-
-                int toCopy = Math.Min(chunkLength - index, count - copied);
-                var destination = chunk.Value;
-                int local = copied;
-                for (int i = 0; i < toCopy; i++)
-                {
-                    ref var entry = ref entries[(local + i) >> shift][(local + i) & mask];
-                    destination[index + i] = new KeyValuePair<TKey, TValue>(entry.Key, entry.Value);
-                }
-
-                copied += toCopy;
-                index += toCopy;
-            }
-
-            chunk.Top = index;
-            queue._count += count;
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<TKey, TValue>(this RecyclableQueue<(TKey Key, TValue Value)> queue, RecyclableSortedList<TKey, TValue> items)
-            where TKey : notnull
-        {
-            int count = items._count;
-            if (count == 0)
-            {
-                return;
-            }
-
-            EnsureCapacity(queue, queue._count + count);
-
-            TKey[] keys = items._keys;
-            TValue[] values = items._values;
-
-            BiDirectionalRecyclableArrayPoolChunk<(TKey Key, TValue Value)> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-            int copied = 0;
-
-            while (copied < count)
-            {
-                if (index == chunkLength)
-                {
-                    chunk.Top = index;
-                    Grow(queue);
-                    chunk = queue._tail;
-                    index = chunk.Top;
-                    chunkLength = chunk.Value.Length;
-                }
-
-                int toCopy = Math.Min(chunkLength - index, count - copied);
-                var destination = chunk.Value;
-                for (int i = 0; i < toCopy; i++)
-                {
-                    destination[index + i] = (keys[copied + i], values[copied + i]);
-                }
-
-                copied += toCopy;
-                index += toCopy;
-            }
-
-            chunk.Top = index;
-            queue._count += count;
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, IReadOnlyList<T> items)
-        {
-            int count = items.Count;
-            if (count == 0)
-            {
-                return;
-            }
-
-            EnsureCapacity(queue, queue._count + count);
-
-            BiDirectionalRecyclableArrayPoolChunk<T> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-
-            for (int i = 0; i < count; i++)
-            {
-                if (index == chunkLength)
-                {
-                    chunk.Top = index;
-                    Grow(queue);
-                    chunk = queue._tail;
-                    index = chunk.Top;
-                    chunkLength = chunk.Value.Length;
-                }
-
-                chunk.Value[index++] = items[i];
-            }
-
-            chunk.Top = index;
-            queue._count += count;
-        }
-
-        internal static IEnumerator AddRange<T>(this RecyclableQueue<T> queue, IEnumerable source)
-        {
-            IEnumerator enumerator = source.GetEnumerator();
-            BiDirectionalRecyclableArrayPoolChunk<T> chunk = queue._tail;
-            int index = chunk.Top;
-            int chunkLength = chunk.Value.Length;
-
-            while (enumerator.MoveNext())
-            {
-                if (index == chunkLength)
-                {
-                    chunk.Top = index;
-                    Grow(queue);
-                    chunk = queue._tail;
-                    index = chunk.Top;
-                    chunkLength = chunk.Value.Length;
-                }
-
-                chunk.Value[index++] = (T)enumerator.Current!;
-                queue._count++;
-            }
-
-            chunk.Top = index;
-            return enumerator;
-        }
-
-        [MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
-        internal static void AddRange<T>(this RecyclableQueue<T> queue, IEnumerable<T> items)
-        {
-            if (items is RecyclableList<T> recyclableList)
-            {
-                AddRange(queue, recyclableList);
-            }
-            else if (items is RecyclableLongList<T> recyclableLongList)
-            {
-                AddRange(queue, recyclableLongList);
-            }
-            else if (items is T[] array)
-            {
-                AddRange(queue, array);
-            }
-            else if (items is List<T> list)
-            {
-                AddRange(queue, list);
-            }
-            else if (items is ICollection<T> iCollection)
-            {
-                AddRange(queue, iCollection);
-            }
-            else if (items is ICollection collection)
-            {
-                AddRange(queue, collection);
-            }
-            else if (items is RecyclableHashSet<T> hashSet)
-            {
-                AddRange(queue, hashSet);
-            }
-            else if (items is RecyclableStack<T> stack)
-            {
-                AddRange(queue, stack);
-            }
-            else if (items is RecyclableSortedSet<T> sortedSet)
-            {
-                AddRange(queue, sortedSet);
-            }
-            else if (items is RecyclableLinkedList<T> linkedList)
-            {
-                AddRange(queue, linkedList);
-            }
-            else if (items is RecyclablePriorityQueue<T> priorityQueue)
-            {
-                AddRange(queue, priorityQueue);
-            }
-            else if (items is RecyclableQueue<T> queueSource)
-            {
-                AddRange(queue, queueSource);
-            }
-            else if (AddRangeHelper<T>.TryAddRange(queue, items))
-            {
-            }
-            else if (items is IReadOnlyList<T> readOnlyList)
-            {
-                AddRange(queue, readOnlyList);
-            }
-            else
-            {
-                using IEnumerator<T> enumerator = items.GetEnumerator();
-                BiDirectionalRecyclableArrayPoolChunk<T> chunk = queue._tail;
-                int index = chunk.Top;
-                int chunkLength = chunk.Value.Length;
-
-                while (enumerator.MoveNext())
-                {
-                    if (index == chunkLength)
-                    {
-                        chunk.Top = index;
-                        Grow(queue);
-                        chunk = queue._tail;
-                        index = chunk.Top;
-                        chunkLength = chunk.Value.Length;
-                    }
-
-                    chunk.Value[index++] = enumerator.Current;
-                    queue._count++;
-                }
-
-                chunk.Top = index;
-            }
-        }
-    }
-}

Recyclable.Collections/RecyclableStack.cs

@@ -198,8 +198,6 @@ namespace Recyclable.Collections
             object IEnumerator.Current => _current!;
 
             public bool MoveNext()
-            {
-                while (true)
             {
                 if (_chunk == null)
                 {
@@ -214,13 +212,11 @@ namespace Recyclable.Collections
                         return false;
                     }
                     _index = _chunk.Index - 1;
-                        continue;
                 }
 
                 _current = _chunk.Value[_index--];
                 return true;
             }
-            }
 
             public void Reset()
             {

Recyclable.CollectionsTests/RecyclableDictionaryTests.cs

@@ -95,229 +95,5 @@ namespace Recyclable.CollectionsTests
             var expected = RecyclableLongListTestData.CreateTestData(itemsCount).ToList();
             _ = actual.Should().ContainInConsecutiveOrder(expected);
         }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromSpan()
-        {
-            using var dict = new RecyclableDictionary<int, string>();
-            var data = new[]
-            {
-                new KeyValuePair<int, string>(1, "a"),
-                new KeyValuePair<int, string>(2, "b"),
-                new KeyValuePair<int, string>(3, "c"),
-            };
-
-            dict.AddRange(data);
-
-            _ = dict.Count.Should().Be(3);
-            for (int i = 0; i < 3; i++)
-            {
-                dict.GetKey(i).Should().Be(i + 1);
-                dict.GetValue(i).Should().Be(data[i].Value);
-            }
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromDictionary()
-        {
-            using var source = new RecyclableDictionary<int, string>();
-            source.Add(1, "a");
-            source.Add(2, "b");
-            using var dict = new RecyclableDictionary<int, string>();
-
-            dict.AddRange(source);
-
-            _ = dict.Count.Should().Be(2);
-            dict.GetKey(0).Should().Be(1);
-            dict.GetValue(0).Should().Be("a");
-            dict.GetKey(1).Should().Be(2);
-            dict.GetValue(1).Should().Be("b");
-        }
-
-        [Fact]
-        public void AddRangeShouldAddListItemsInCorrectOrder()
-        {
-            var data = new[]
-            {
-                new KeyValuePair<int, string>(1, "a"),
-                new KeyValuePair<int, string>(2, "b"),
-                new KeyValuePair<int, string>(3, "c"),
-            };
-
-            using var source = new RecyclableList<KeyValuePair<int, string>>(data);
-            using var dict = new RecyclableDictionary<int, string>();
-
-            dict.AddRange(source);
-
-            _ = dict.Count.Should().Be(3);
-            for (int i = 0; i < 3; i++)
-            {
-                dict.GetKey(i).Should().Be(data[i].Key);
-                dict.GetValue(i).Should().Be(data[i].Value);
-            }
-        }
-
-        [Fact]
-        public void AddRangeShouldAddLongListItemsInCorrectOrder()
-        {
-            var data = new[]
-            {
-                new KeyValuePair<int, string>(1, "a"),
-                new KeyValuePair<int, string>(2, "b"),
-                new KeyValuePair<int, string>(3, "c"),
-            };
-
-            using var source = new RecyclableLongList<KeyValuePair<int, string>>(data);
-            using var dict = new RecyclableDictionary<int, string>();
-
-            dict.AddRange(source);
-
-            _ = dict.Count.Should().Be(3);
-            for (int i = 0; i < 3; i++)
-            {
-                dict.GetKey(i).Should().Be(data[i].Key);
-                dict.GetValue(i).Should().Be(data[i].Value);
-            }
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddSortedDictionaryItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedDictionary<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var dict = new RecyclableDictionary<int, long>();
-
-            dict.AddRange(source);
-
-            _ = dict.Count.Should().Be(itemsCount);
-            for (int i = 0; i < data.Length; i++)
-            {
-                dict.GetKey(i).Should().Be(i);
-                dict.GetValue(i).Should().Be(data[i]);
-            }
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddSortedListItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedList<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var dict = new RecyclableDictionary<int, long>();
-
-            dict.AddRange(source);
-
-            _ = dict.Count.Should().Be(itemsCount);
-            for (int i = 0; i < data.Length; i++)
-            {
-                dict.GetKey(i).Should().Be(i);
-                dict.GetValue(i).Should().Be(data[i]);
-            }
-        }
-
-        [Fact]
-        public void AddRangeShouldAddQueueItemsInCorrectOrder()
-        {
-            var data = new[]
-            {
-                new KeyValuePair<int, string>(1, "a"),
-                new KeyValuePair<int, string>(2, "b"),
-                new KeyValuePair<int, string>(3, "c"),
-            };
-
-            using var source = new RecyclableQueue<KeyValuePair<int, string>>(data);
-            using var dict = new RecyclableDictionary<int, string>();
-
-            dict.AddRange(source);
-
-            _ = dict.Count.Should().Be(3);
-            for (int i = 0; i < 3; i++)
-            {
-                dict.GetKey(i).Should().Be(data[i].Key);
-                dict.GetValue(i).Should().Be(data[i].Value);
-            }
-        }
-
-        [Fact]
-        public void AddRangeShouldAddStackItemsInCorrectOrder()
-        {
-            var data = new[]
-            {
-                new KeyValuePair<int, string>(1, "a"),
-                new KeyValuePair<int, string>(2, "b"),
-                new KeyValuePair<int, string>(3, "c"),
-            };
-
-            using var source = new RecyclableStack<KeyValuePair<int, string>>(data);
-            using var dict = new RecyclableDictionary<int, string>();
-
-            dict.AddRange(source);
-
-            _ = dict.Count.Should().Be(3);
-            for (int i = 0; i < 3; i++)
-            {
-                dict.GetKey(i).Should().Be(data[i].Key);
-                dict.GetValue(i).Should().Be(data[i].Value);
-            }
-        }
-
-        [Fact]
-        public void AddRangeShouldAddLinkedListItemsInCorrectOrder()
-        {
-            var data = new[]
-            {
-                new KeyValuePair<int, string>(1, "a"),
-                new KeyValuePair<int, string>(2, "b"),
-                new KeyValuePair<int, string>(3, "c"),
-            };
-
-            using var source = new RecyclableLinkedList<KeyValuePair<int, string>>(data);
-            using var dict = new RecyclableDictionary<int, string>();
-
-            dict.AddRange(source);
-
-            _ = dict.Count.Should().Be(3);
-            for (int i = 0; i < 3; i++)
-            {
-                dict.GetKey(i).Should().Be(data[i].Key);
-                dict.GetValue(i).Should().Be(data[i].Value);
-            }
-        }
-
-        [Fact]
-        public void AddRangeShouldAddPriorityQueueItemsInCorrectOrder()
-        {
-            var data = new[]
-            {
-                new KeyValuePair<int, string>(1, "a"),
-                new KeyValuePair<int, string>(2, "b"),
-                new KeyValuePair<int, string>(3, "c"),
-            };
-
-            using var source = new RecyclablePriorityQueue<KeyValuePair<int, string>>(comparer: Comparer<KeyValuePair<int, string>>.Create((x, y) => x.Key.CompareTo(y.Key)));
-            foreach (var kvp in data)
-            {
-                source.Enqueue(kvp);
-            }
-            using var dict = new RecyclableDictionary<int, string>();
-
-            dict.AddRange(source);
-
-            _ = dict.Count.Should().Be(3);
-            for (int i = 0; i < 3; i++)
-            {
-                dict.GetKey(i).Should().Be(data[i].Key);
-                dict.GetValue(i).Should().Be(data[i].Value);
-            }
-        }
     }
 }

Recyclable.CollectionsTests/RecyclableHashSetTests.cs

@@ -76,218 +76,5 @@ namespace Recyclable.CollectionsTests
                 _ = actual.Should().Contain(expected).And.HaveCount(itemsCount);
             }
         }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromSpan()
-        {
-            using var set = new RecyclableHashSet<int>();
-            var data = new[] { 1, 2, 3 };
-
-            set.AddRange(data);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().ContainInOrder(data);
-        }
-
-        [Fact]
-        public void AddRangeShouldIgnoreDuplicates()
-        {
-            using var set = new RecyclableHashSet<int>();
-            var data = new[] { 1, 2, 3 };
-
-            set.AddRange(data);
-            set.AddRange(data);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().ContainInOrder(data);
-        }
-        [Fact]
-        public void AddRangeShouldAddItemsFromList()
-        {
-            using var set = new RecyclableHashSet<int>();
-            var list = new List<int> { 1, 2, 3 };
-
-            set.AddRange(list);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().Contain(new[] { 1, 2, 3 });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromRecyclableList()
-        {
-            using var set = new RecyclableHashSet<int>();
-            using var list = new RecyclableList<int>(new[] { 1, 2, 3 });
-
-            set.AddRange(list);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().Contain(new[] { 1, 2, 3 });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromLongList()
-        {
-            using var set = new RecyclableHashSet<int>();
-            using var list = new RecyclableLongList<int>(new[] { 1, 2, 3 });
-
-            set.AddRange(list);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().Contain(new[] { 1, 2, 3 });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromStack()
-        {
-            using var set = new RecyclableHashSet<int>();
-            using var stack = new RecyclableStack<int>(new[] { 1, 2, 3 });
-
-            set.AddRange(stack);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().Contain(new[] { 1, 2, 3 });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromQueue()
-        {
-            using var set = new RecyclableHashSet<int>();
-            using var queue = new RecyclableQueue<int>(new[] { 1, 2, 3 });
-
-            set.AddRange(queue);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().Contain(new[] { 1, 2, 3 });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromArray()
-        {
-            using var set = new RecyclableHashSet<int>();
-            Array array = new int[] { 1, 2, 3 };
-
-            set.AddRange(array);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().Contain(new[] { 1, 2, 3 });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromICollection()
-        {
-            using var set = new RecyclableHashSet<int>();
-            System.Collections.ArrayList list = new System.Collections.ArrayList { 1, 2, 3 };
-
-            set.AddRange(list);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().Contain(new[] { 1, 2, 3 });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromGenericICollection()
-        {
-            using var set = new RecyclableHashSet<int>();
-            ICollection<int> list = new List<int> { 1, 2, 3 };
-
-            set.AddRange(list);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().Contain(new[] { 1, 2, 3 });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromSortedSet()
-        {
-            using var source = new RecyclableSortedSet<int>();
-            source.Add(1);
-            source.Add(2);
-            source.Add(3);
-            using var set = new RecyclableHashSet<int>();
-
-            set.AddRange(source);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().Contain(new[] { 1, 2, 3 });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromLinkedList()
-        {
-            using var source = new RecyclableLinkedList<int>(new[] { 1, 2, 3 });
-            using var set = new RecyclableHashSet<int>();
-
-            set.AddRange(source);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().Contain(new[] { 1, 2, 3 });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromPriorityQueue()
-        {
-            using var source = new RecyclablePriorityQueue<int>();
-            source.Enqueue(1);
-            source.Enqueue(2);
-            source.Enqueue(3);
-            using var set = new RecyclableHashSet<int>();
-
-            set.AddRange(source);
-
-            _ = set.Count.Should().Be(3);
-            _ = set.Should().Contain(new[] { 1, 2, 3 });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromDictionary()
-        {
-            using var source = new RecyclableDictionary<int, string>();
-            source.Add(1, "a");
-            source.Add(2, "b");
-            using var set = new RecyclableHashSet<KeyValuePair<int, string>>();
-
-            set.AddRange(source);
-
-            _ = set.Count.Should().Be(2);
-            set.Should().Contain(new[]
-            {
-                new KeyValuePair<int, string>(1, "a"),
-                new KeyValuePair<int, string>(2, "b")
-            });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromSortedDictionary()
-        {
-            using var source = new RecyclableSortedDictionary<int, string>();
-            source.Add(1, "a");
-            source.Add(2, "b");
-            using var set = new RecyclableHashSet<KeyValuePair<int, string>>();
-
-            set.AddRange(source);
-
-            _ = set.Count.Should().Be(2);
-            set.Should().Contain(new[]
-            {
-                new KeyValuePair<int, string>(1, "a"),
-                new KeyValuePair<int, string>(2, "b")
-            });
-        }
-
-        [Fact]
-        public void AddRangeShouldAddItemsFromSortedList()
-        {
-            using var source = new RecyclableSortedList<int, string>();
-            source.Add(1, "a");
-            source.Add(2, "b");
-            using var set = new RecyclableHashSet<(int Key, string Value)>();
-
-            set.AddRange(source);
-
-            _ = set.Count.Should().Be(2);
-            set.Should().Contain(new[] { (1, "a"), (2, "b") });
-        }
-
     }
 }

Recyclable.CollectionsTests/RecyclableLinkedListTests.cs

@@ -1,7 +1,6 @@
 using FluentAssertions;
 using Recyclable.Collections;
 using System.Linq;
-using System.Collections;
 
 namespace Recyclable.CollectionsTests
 {
@@ -80,510 +79,5 @@ namespace Recyclable.CollectionsTests
 
             _ = actual.Should().ContainInConsecutiveOrder(source.Reverse());
         }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddListItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableList<long>(data);
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-
-            _ = list.LongCount.Should().Be(itemsCount);
-            _ = list.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromList(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableList<long>(data);
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-            list.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = list.LongCount.Should().Be(itemsCount * 2);
-            _ = list.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddLongListItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableLongList<long>(data);
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-
-            _ = list.LongCount.Should().Be(itemsCount);
-            _ = list.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromLongList(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableLongList<long>(data);
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-            list.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = list.LongCount.Should().Be(itemsCount * 2);
-            _ = list.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddHashSetItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableHashSet<long>();
-            foreach (long item in data)
-            {
-                source.Add(item);
-            }
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-
-            _ = list.LongCount.Should().Be(itemsCount);
-            _ = list.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromHashSet(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableHashSet<long>();
-            foreach (long item in data)
-            {
-                source.Add(item);
-            }
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-            list.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = list.LongCount.Should().Be(itemsCount * 2);
-            _ = list.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddStackItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableStack<long>(data);
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-
-            _ = list.LongCount.Should().Be(itemsCount);
-            _ = list.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromStack(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableStack<long>(data);
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-            list.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = list.LongCount.Should().Be(itemsCount * 2);
-            _ = list.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddSortedSetItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedSet<long>();
-            foreach (long item in data)
-            {
-                source.Add(item);
-            }
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-
-            _ = list.LongCount.Should().Be(itemsCount);
-            _ = list.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromSortedSet(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedSet<long>();
-            foreach (long item in data)
-            {
-                source.Add(item);
-            }
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-            list.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = list.LongCount.Should().Be(itemsCount * 2);
-            _ = list.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddLinkedListItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableLinkedList<long>(data);
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-
-            _ = list.LongCount.Should().Be(itemsCount);
-            _ = list.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromLinkedList(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableLinkedList<long>(data);
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-            list.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = list.LongCount.Should().Be(itemsCount * 2);
-            _ = list.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddPriorityQueueItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclablePriorityQueue<long>();
-            foreach (long item in data)
-            {
-                source.Enqueue(item);
-            }
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-
-            _ = list.LongCount.Should().Be(itemsCount);
-            _ = list.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromPriorityQueue(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclablePriorityQueue<long>();
-            foreach (long item in data)
-            {
-                source.Enqueue(item);
-            }
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-            list.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = list.LongCount.Should().Be(itemsCount * 2);
-            _ = list.Should().Equal(expected);
-        }
-
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddQueueItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableQueue<long>(data);
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-
-            _ = list.LongCount.Should().Be(itemsCount);
-            _ = list.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromQueue(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableQueue<long>(data);
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(source);
-            list.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = list.LongCount.Should().Be(itemsCount * 2);
-            _ = list.Should().Equal(expected);
-        }
-
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddDictionaryItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableDictionary<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var list = new RecyclableLinkedList<KeyValuePair<int, long>>();
-
-            list.AddRange(source);
-
-            List<KeyValuePair<int, long>> expected = new(itemsCount);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-
-            _ = list.LongCount.Should().Be(itemsCount);
-            _ = list.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromDictionary(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableDictionary<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var list = new RecyclableLinkedList<KeyValuePair<int, long>>();
-
-            list.AddRange(source);
-            list.AddRange(source);
-
-            List<KeyValuePair<int, long>> expected = new(itemsCount * 2);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-
-            _ = list.LongCount.Should().Be(itemsCount * 2);
-            _ = list.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddSortedListItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedList<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var list = new RecyclableLinkedList<(int Key, long Value)>();
-
-            list.AddRange(source);
-
-            List<(int Key, long Value)> expected = new(itemsCount);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add((i, data[i]));
-            }
-
-            _ = list.LongCount.Should().Be(itemsCount);
-            _ = list.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromSortedList(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedList<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var list = new RecyclableLinkedList<(int Key, long Value)>();
-
-            list.AddRange(source);
-            list.AddRange(source);
-
-            List<(int Key, long Value)> expected = new(itemsCount * 2);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add((i, data[i]));
-            }
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add((i, data[i]));
-            }
-
-            _ = list.LongCount.Should().Be(itemsCount * 2);
-            _ = list.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddSortedDictionaryItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedDictionary<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var list = new RecyclableLinkedList<KeyValuePair<int, long>>();
-
-            list.AddRange(source);
-
-            List<KeyValuePair<int, long>> expected = new(itemsCount);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-
-            _ = list.LongCount.Should().Be(itemsCount);
-            _ = list.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromSortedDictionary(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedDictionary<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var list = new RecyclableLinkedList<KeyValuePair<int, long>>();
-
-            list.AddRange(source);
-            list.AddRange(source);
-
-            List<KeyValuePair<int, long>> expected = new(itemsCount * 2);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-
-            _ = list.LongCount.Should().Be(itemsCount * 2);
-            _ = list.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeShouldAddArrayItems()
-        {
-            long[] data = { 1, 2, 3 };
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(data);
-
-            _ = list.Should().Equal(data);
-        }
-
-        [Fact]
-        public void AddRangeShouldAddCollectionItems()
-        {
-            ICollection collection = new long[] { 1, 2, 3 };
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(collection);
-
-            _ = list.Should().Equal(collection.Cast<long>());
-        }
-
-        [Fact]
-        public void AddRangeShouldAddEnumerableItems()
-        {
-            IEnumerable<long> enumerable = new long[] { 1, 2, 3 };
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(enumerable);
-
-            _ = list.Should().Equal(enumerable);
-        }
-
-        [Fact]
-        public void AddRangeShouldAddSpanItems()
-        {
-            long[] data = { 1, 2, 3 };
-            Span<long> span = data;
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(span);
-
-            _ = list.Should().Equal(data);
-        }
-
-        [Fact]
-        public void AddRangeShouldAddListItems()
-        {
-            var data = new List<long> { 1, 2, 3 };
-            using var list = new RecyclableLinkedList<long>();
-
-            list.AddRange(data);
-
-            _ = list.Should().Equal(data);
-        }
     }
 }

Recyclable.CollectionsTests/RecyclablePriorityQueueTests.cs

@@ -1,6 +1,5 @@
 using FluentAssertions;
 using Recyclable.Collections;
-using System.Collections;
 
 namespace Recyclable.CollectionsTests
 {
@@ -53,443 +52,5 @@ namespace Recyclable.CollectionsTests
             using var queue = new RecyclablePriorityQueue<int>();
             _ = Assert.Throws<ArgumentOutOfRangeException>(() => queue.Dequeue());
         }
-
-        [Fact]
-        public void AddRangeSpanShouldAddItemsInSortedOrder()
-        {
-            using var queue = new RecyclablePriorityQueue<int>();
-            queue.AddRange((ReadOnlySpan<int>)_testData);
-
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(_testData.OrderBy(static value => value));
-        }
-
-        [Fact]
-        public void AddRangeSpanShouldDoNothingWhenEmpty()
-        {
-            using var queue = new RecyclablePriorityQueue<int>();
-            queue.AddRange(ReadOnlySpan<int>.Empty);
-            _ = queue.Should().BeEmpty();
-        }
-
-        [Fact]
-        public void AddRangeSpanShouldNotOverrideItems()
-        {
-            using var queue = new RecyclablePriorityQueue<int>();
-            queue.AddRange((ReadOnlySpan<int>)_testData);
-            queue.AddRange((ReadOnlySpan<int>)_testData);
-
-            var expected = _testData.Concat(_testData).OrderBy(static value => value).ToArray();
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeArrayShouldAddItemsInSortedOrder()
-        {
-            using var queue = new RecyclablePriorityQueue<int>();
-            queue.AddRange(_testData);
-
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(_testData.OrderBy(static value => value));
-        }
-
-        [Fact]
-        public void AddRangeListShouldAddItemsInSortedOrder()
-        {
-            using var queue = new RecyclablePriorityQueue<int>();
-            queue.AddRange(new List<int>(_testData));
-
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(_testData.OrderBy(static value => value));
-        }
-
-        [Fact]
-        public void AddRangeReadOnlyMemoryShouldAddItemsInSortedOrder()
-        {
-            using var queue = new RecyclablePriorityQueue<int>();
-            queue.AddRange((ReadOnlyMemory<int>)_testData);
-
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(_testData.OrderBy(static value => value));
-        }
-
-        [Fact]
-        public void AddRangeMemoryShouldNotOverrideItems()
-        {
-            using var queue = new RecyclablePriorityQueue<int>();
-            queue.AddRange(_testData.AsMemory());
-            queue.AddRange(_testData.AsMemory());
-
-            var expected = _testData.Concat(_testData).OrderBy(static value => value).ToArray();
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeArrayShouldNotOverrideItems()
-        {
-            using var queue = new RecyclablePriorityQueue<int>();
-            queue.AddRange(_testData);
-            queue.AddRange(_testData);
-
-            var expected = _testData.Concat(_testData).OrderBy(static value => value).ToArray();
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeShouldAcceptNulls()
-        {
-            using var queue = new RecyclablePriorityQueue<long?>();
-            queue.AddRange(new long?[] { null, 1 });
-            _ = queue.Should().HaveCount(2).And.Contain((long?)null);
-        }
-
-        [Fact]
-        public void AddRangeQueueShouldAddItemsInSortedOrder()
-        {
-            using var source = new RecyclableQueue<int>(_testData);
-            using var queue = new RecyclablePriorityQueue<int>();
-
-            queue.AddRange(source);
-
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(_testData.OrderBy(static value => value));
-        }
-
-        [Fact]
-        public void AddRangeQueueShouldNotOverrideItems()
-        {
-            using var source = new RecyclableQueue<int>(_testData);
-            using var queue = new RecyclablePriorityQueue<int>();
-
-            queue.AddRange(source);
-            queue.AddRange(source);
-
-            var expected = _testData.Concat(_testData).OrderBy(static value => value).ToArray();
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeStackShouldAddItemsInSortedOrder()
-        {
-            using var source = new RecyclableStack<int>(_testData);
-            using var queue = new RecyclablePriorityQueue<int>();
-
-            queue.AddRange(source);
-
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(_testData.OrderBy(static value => value));
-        }
-
-        [Fact]
-        public void AddRangeSortedSetShouldAddItemsInSortedOrder()
-        {
-            using var source = new RecyclableSortedSet<int>();
-            foreach (int item in _testData)
-            {
-                source.Add(item);
-            }
-
-            using var queue = new RecyclablePriorityQueue<int>();
-
-            queue.AddRange(source);
-
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(_testData.OrderBy(static value => value));
-        }
-
-        [Fact]
-        public void AddRangeDictionaryShouldAddItemsInSortedOrder()
-        {
-            using var source = new RecyclableDictionary<int, int>();
-            for (int i = 0; i < _testData.Length; i++)
-            {
-                source.Add(i, _testData[i]);
-            }
-
-            using var queue = new RecyclablePriorityQueue<KeyValuePair<int, int>>(comparer: Comparer<KeyValuePair<int, int>>.Create((a, b) => a.Key.CompareTo(b.Key)));
-
-            queue.AddRange(source);
-
-            var result = new List<KeyValuePair<int, int>>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            var expected = _testData.Select((v, i) => new KeyValuePair<int, int>(i, v)).ToList();
-            _ = result.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeDictionaryShouldNotOverrideItems()
-        {
-            using var source = new RecyclableDictionary<int, int>();
-            for (int i = 0; i < _testData.Length; i++)
-            {
-                source.Add(i, _testData[i]);
-            }
-
-            using var queue = new RecyclablePriorityQueue<KeyValuePair<int, int>>(comparer: Comparer<KeyValuePair<int, int>>.Create((a, b) => a.Key.CompareTo(b.Key)));
-
-            queue.AddRange(source);
-            queue.AddRange(source);
-
-            var result = new List<KeyValuePair<int, int>>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            var expected = _testData.Select((v, i) => new KeyValuePair<int, int>(i, v))
-                .Concat(_testData.Select((v, i) => new KeyValuePair<int, int>(i, v)))
-                .ToList();
-            _ = result.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeSortedListShouldAddItemsInSortedOrder()
-        {
-            using var source = new RecyclableSortedList<int, int>();
-            for (int i = 0; i < _testData.Length; i++)
-            {
-                source.Add(i, _testData[i]);
-            }
-
-            using var queue = new RecyclablePriorityQueue<(int Key, int Value)>(comparer: Comparer<(int Key, int Value)>.Create((a, b) => a.Key.CompareTo(b.Key)));
-
-            queue.AddRange(source);
-
-            var result = new List<(int Key, int Value)>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            var expected = _testData.Select((v, i) => (i, v)).ToList();
-            _ = result.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeSortedListShouldNotOverrideItems()
-        {
-            using var source = new RecyclableSortedList<int, int>();
-            for (int i = 0; i < _testData.Length; i++)
-            {
-                source.Add(i, _testData[i]);
-            }
-
-            using var queue = new RecyclablePriorityQueue<(int Key, int Value)>(comparer: Comparer<(int Key, int Value)>.Create((a, b) => a.Key.CompareTo(b.Key)));
-
-            queue.AddRange(source);
-            queue.AddRange(source);
-
-            var result = new List<(int Key, int Value)>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            var expected = _testData.Select((v, i) => (i, v))
-                .Concat(_testData.Select((v, i) => (i, v)))
-                .OrderBy(p => p.Item1)
-                .ToList();
-            _ = result.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeSortedDictionaryShouldAddItemsInSortedOrder()
-        {
-            using var source = new RecyclableSortedDictionary<int, int>();
-            for (int i = 0; i < _testData.Length; i++)
-            {
-                source.Add(i, _testData[i]);
-            }
-
-            using var queue = new RecyclablePriorityQueue<KeyValuePair<int, int>>(comparer: Comparer<KeyValuePair<int, int>>.Create((a, b) => a.Key.CompareTo(b.Key)));
-
-            queue.AddRange(source);
-
-            var result = new List<KeyValuePair<int, int>>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            var expected = _testData.Select((v, i) => new KeyValuePair<int, int>(i, v)).ToList();
-            _ = result.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeSortedDictionaryShouldNotOverrideItems()
-        {
-            using var source = new RecyclableSortedDictionary<int, int>();
-            for (int i = 0; i < _testData.Length; i++)
-            {
-                source.Add(i, _testData[i]);
-            }
-
-            using var queue = new RecyclablePriorityQueue<KeyValuePair<int, int>>(comparer: Comparer<KeyValuePair<int, int>>.Create((a, b) => a.Key.CompareTo(b.Key)));
-
-            queue.AddRange(source);
-            queue.AddRange(source);
-
-            var result = new List<KeyValuePair<int, int>>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            var expected = _testData.Select((v, i) => new KeyValuePair<int, int>(i, v))
-                .Concat(_testData.Select((v, i) => new KeyValuePair<int, int>(i, v)))
-                .ToList();
-            _ = result.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeEnumerableShouldAddItemsInSortedOrder()
-        {
-            using var queue = new RecyclablePriorityQueue<int>();
-
-            _ = queue.AddRange((System.Collections.IEnumerable)_testData);
-
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            var expected = _testData.OrderBy(v => v).ToList();
-            _ = result.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeEnumerableShouldNotOverrideItems()
-        {
-            using var queue = new RecyclablePriorityQueue<int>();
-
-            _ = queue.AddRange((System.Collections.IEnumerable)_testData);
-            _ = queue.AddRange((System.Collections.IEnumerable)_testData);
-
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            var expected = _testData.Concat(_testData).OrderBy(v => v).ToList();
-            _ = result.Should().Equal(expected);
-        }
-
-        [Fact]
-        public void AddRangeReadOnlyCollectionShouldAddItemsInSortedOrder()
-        {
-            var source = new TestReadOnlyCollection<int>(_testData);
-            using var queue = new RecyclablePriorityQueue<int>();
-
-            queue.AddRange(source);
-
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(_testData.OrderBy(static value => value));
-        }
-
-        [Fact]
-        public void AddRangeReadOnlyCollectionShouldNotOverrideItems()
-        {
-            var source = new TestReadOnlyCollection<int>(_testData);
-            using var queue = new RecyclablePriorityQueue<int>();
-
-            queue.AddRange(source);
-            queue.AddRange(source);
-
-            var expected = _testData.Concat(_testData).OrderBy(static value => value).ToArray();
-            var result = new List<int>();
-            while (queue.LongCount > 0)
-            {
-                result.Add(queue.Dequeue());
-            }
-
-            _ = result.Should().Equal(expected);
-        }
-
-        private sealed class TestReadOnlyCollection<T> : IReadOnlyCollection<T>
-        {
-            private readonly T[] _items;
-
-            public TestReadOnlyCollection(T[] items)
-            {
-                _items = items;
-            }
-
-            public int Count => _items.Length;
-
-            public IEnumerator<T> GetEnumerator() => ((IEnumerable<T>)_items).GetEnumerator();
-
-            IEnumerator IEnumerable.GetEnumerator() => _items.GetEnumerator();
-        }
     }
 }
-

Recyclable.CollectionsTests/RecyclableQueueTests.cs

@@ -136,527 +136,5 @@ namespace Recyclable.CollectionsTests
                         _ = actual.Should().ContainInConsecutiveOrder(data)
                                 .And.BeEquivalentTo(data);
                 }
-
-        [Fact]
-        public void AddRangeShouldAcceptNulls()
-        {
-            using var queue = new RecyclableQueue<long?>();
-            queue.AddRange(new long?[] { null, default });
-            _ = queue.Should().HaveCount(2).And.AllSatisfy(x => x.Should().BeNull());
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddItemsInCorrectOrder(string testCase, IEnumerable<long> testData, int itemsCount)
-        {
-            using var queue = new RecyclableQueue<long>();
-
-            if (testCase.Contains("Array[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange((Array)testData);
-            }
-            else if (testCase.Contains("ICollection[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange((System.Collections.ICollection)testData);
-            }
-            else if (testCase.Contains("ICollection<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange((ICollection<long>)testData);
-            }
-            else if (testCase.Contains("IEnumerable[", StringComparison.OrdinalIgnoreCase))
-            {
-                _ = queue.AddRange((System.Collections.IEnumerable)testData);
-            }
-            else if (testCase.Contains("IReadOnlyList<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange((IReadOnlyList<long>)testData);
-            }
-            else if (testCase.Contains("ReadOnlySpan<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange(new ReadOnlySpan<long>((long[])testData));
-            }
-            else if (testCase.Contains("Span<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange(new Span<long>((long[])testData));
-            }
-            else if (testData is long[] array)
-            {
-                queue.AddRange(array);
-            }
-            else if (testData is List<long> list)
-            {
-                queue.AddRange(list);
-            }
-            else if (testData is RecyclableList<long> rList)
-            {
-                queue.AddRange(rList);
-            }
-            else if (testData is RecyclableLongList<long> rLongList)
-            {
-                queue.AddRange(rLongList);
-            }
-            else if (testData is IList<long> iList)
-            {
-                queue.AddRange((ICollection<long>)iList);
-            }
-            else if (testData is IEnumerable<long> enumerable)
-            {
-                queue.AddRange(enumerable);
-            }
-            else
-            {
-                throw new InvalidCastException("Unknown type of test data");
-            }
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(testData);
-
-            _ = queue.Count.Should().Be(itemsCount);
-            _ = queue.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.EmptySourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldDoNothingWhenSourceIsEmpty(string testCase, IEnumerable<long> testData, int itemsCount)
-        {
-            using var queue = new RecyclableQueue<long>();
-
-            if (testCase.Contains("Array[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange((Array)testData);
-            }
-            else if (testCase.Contains("ICollection[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange((System.Collections.ICollection)testData);
-            }
-            else if (testCase.Contains("ICollection<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange((ICollection<long>)testData);
-            }
-            else if (testCase.Contains("IEnumerable[", StringComparison.OrdinalIgnoreCase))
-            {
-                _ = queue.AddRange((System.Collections.IEnumerable)testData);
-            }
-            else if (testCase.Contains("IReadOnlyList<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange((IReadOnlyList<long>)testData);
-            }
-            else if (testCase.Contains("ReadOnlySpan<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange(new ReadOnlySpan<long>((long[])testData));
-            }
-            else if (testCase.Contains("Span<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange(new Span<long>((long[])testData));
-            }
-            else if (testData is long[] array)
-            {
-                queue.AddRange(array);
-            }
-            else if (testData is List<long> list)
-            {
-                queue.AddRange(list);
-            }
-            else if (testData is RecyclableList<long> rList)
-            {
-                queue.AddRange(rList);
-            }
-            else if (testData is RecyclableLongList<long> rLongList)
-            {
-                queue.AddRange(rLongList);
-            }
-            else if (testData is IList<long> iList)
-            {
-                queue.AddRange((ICollection<long>)iList);
-            }
-            else if (testData is IEnumerable<long> enumerable)
-            {
-                queue.AddRange(enumerable);
-            }
-            else
-            {
-                throw new InvalidCastException("Unknown type of test data");
-            }
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(testData);
-
-            _ = queue.Count.Should().Be(itemsCount);
-            _ = queue.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItems(string testCase, IEnumerable<long> testData, int itemsCount)
-        {
-            using var queue = new RecyclableQueue<long>();
-            itemsCount = checked(itemsCount << 1);
-
-            if (testCase.Contains("Array[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange((Array)testData);
-                queue.AddRange((Array)testData);
-            }
-            else if (testCase.Contains("ICollection[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange((System.Collections.ICollection)testData);
-                queue.AddRange((System.Collections.ICollection)testData);
-            }
-            else if (testCase.Contains("ICollection<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange((ICollection<long>)testData);
-                queue.AddRange((ICollection<long>)testData);
-            }
-            else if (testCase.Contains("IEnumerable[", StringComparison.OrdinalIgnoreCase))
-            {
-                _ = queue.AddRange((System.Collections.IEnumerable)testData);
-                _ = queue.AddRange((System.Collections.IEnumerable)testData);
-            }
-            else if (testCase.Contains("IReadOnlyList<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                queue.AddRange((IReadOnlyList<long>)testData);
-                queue.AddRange((IReadOnlyList<long>)testData);
-            }
-            else if (testCase.Contains("ReadOnlySpan<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                var span = new ReadOnlySpan<long>((long[])testData);
-                queue.AddRange(span);
-                queue.AddRange(span);
-            }
-            else if (testCase.Contains("Span<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                var span = new Span<long>((long[])testData);
-                queue.AddRange(span);
-                queue.AddRange(span);
-            }
-            else if (testData is long[] array)
-            {
-                queue.AddRange(array);
-                queue.AddRange(array);
-            }
-            else if (testData is List<long> list)
-            {
-                queue.AddRange(list);
-                queue.AddRange(list);
-            }
-            else if (testData is RecyclableList<long> rList)
-            {
-                queue.AddRange(rList);
-                queue.AddRange(rList);
-            }
-            else if (testData is RecyclableLongList<long> rLongList)
-            {
-                queue.AddRange(rLongList);
-                queue.AddRange(rLongList);
-            }
-            else if (testData is IList<long> iList)
-            {
-                queue.AddRange((ICollection<long>)iList);
-                queue.AddRange((ICollection<long>)iList);
-            }
-            else if (testData is IEnumerable<long> enumerable)
-            {
-                queue.AddRange(enumerable);
-                queue.AddRange(enumerable);
-            }
-            else
-            {
-                throw new InvalidCastException("Unknown type of test data");
-            }
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(testData);
-            expected.AddRange(testData);
-
-            _ = queue.Count.Should().Be(itemsCount);
-            _ = queue.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddStackItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableStack<long>(data);
-            using var queue = new RecyclableQueue<long>();
-
-            queue.AddRange(source);
-
-            _ = queue.Count.Should().Be(itemsCount);
-            _ = queue.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromStack(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableStack<long>(data);
-            using var queue = new RecyclableQueue<long>();
-
-            queue.AddRange(source);
-            queue.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = queue.Count.Should().Be(itemsCount * 2);
-            _ = queue.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddSortedSetItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedSet<long>();
-            foreach (long item in data)
-            {
-                source.Add(item);
-            }
-            using var queue = new RecyclableQueue<long>();
-
-            queue.AddRange(source);
-
-            _ = queue.Count.Should().Be(itemsCount);
-            _ = queue.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromSortedSet(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedSet<long>();
-            foreach (long item in data)
-            {
-                source.Add(item);
-            }
-            using var queue = new RecyclableQueue<long>();
-
-            queue.AddRange(source);
-            queue.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = queue.Count.Should().Be(itemsCount * 2);
-            _ = queue.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddLinkedListItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableLinkedList<long>(data);
-            using var queue = new RecyclableQueue<long>();
-
-            queue.AddRange(source);
-
-            _ = queue.Count.Should().Be(itemsCount);
-            _ = queue.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromLinkedList(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableLinkedList<long>(data);
-            using var queue = new RecyclableQueue<long>();
-
-            queue.AddRange(source);
-            queue.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = queue.Count.Should().Be(itemsCount * 2);
-            _ = queue.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddPriorityQueueItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclablePriorityQueue<long>();
-            foreach (long item in data)
-            {
-                source.Enqueue(item);
-            }
-            using var queue = new RecyclableQueue<long>();
-
-            queue.AddRange(source);
-
-            _ = queue.Count.Should().Be(itemsCount);
-            _ = queue.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromPriorityQueue(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclablePriorityQueue<long>();
-            foreach (long item in data)
-            {
-                source.Enqueue(item);
-            }
-            using var queue = new RecyclableQueue<long>();
-
-            queue.AddRange(source);
-            queue.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = queue.Count.Should().Be(itemsCount * 2);
-            _ = queue.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddQueueItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableQueue<long>(data);
-            using var queue = new RecyclableQueue<long>();
-
-            queue.AddRange(source);
-
-            _ = queue.Count.Should().Be(itemsCount);
-            _ = queue.Should().Equal(data);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromQueue(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableQueue<long>(data);
-            using var queue = new RecyclableQueue<long>();
-
-            queue.AddRange(source);
-            queue.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-
-            _ = queue.Count.Should().Be(itemsCount * 2);
-            _ = queue.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddDictionaryItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableDictionary<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var queue = new RecyclableQueue<KeyValuePair<int, long>>();
-
-            queue.AddRange(source);
-
-            List<KeyValuePair<int, long>> expected = new(itemsCount);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-
-            _ = queue.Count.Should().Be(itemsCount);
-            _ = queue.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromDictionary(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableDictionary<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var queue = new RecyclableQueue<KeyValuePair<int, long>>();
-
-            queue.AddRange(source);
-            queue.AddRange(source);
-
-            List<KeyValuePair<int, long>> expected = new(itemsCount * 2);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-
-            _ = queue.Count.Should().Be(itemsCount * 2);
-            _ = queue.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddSortedListItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedList<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var queue = new RecyclableQueue<(int Key, long Value)>();
-
-            queue.AddRange(source);
-
-            List<(int Key, long Value)> expected = new(itemsCount);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add((i, data[i]));
-            }
-
-            _ = queue.Count.Should().Be(itemsCount);
-            _ = queue.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromSortedList(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedList<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var queue = new RecyclableQueue<(int Key, long Value)>();
-
-            queue.AddRange(source);
-            queue.AddRange(source);
-
-            List<(int Key, long Value)> expected = new(itemsCount * 2);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add((i, data[i]));
-            }
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add((i, data[i]));
-            }
-
-            _ = queue.Count.Should().Be(itemsCount * 2);
-            _ = queue.Should().Equal(expected);
-        }
 	}
 }

Recyclable.CollectionsTests/RecyclableStackTests.cs

@@ -128,690 +128,5 @@ namespace Recyclable.CollectionsTests
 
                         _ = Assert.Throws<ArgumentOutOfRangeException>(() => list.Pop());
                 }
-        [Fact]
-        public void AddRangeShouldAcceptNulls()
-        {
-            using var stack = new RecyclableStack<long?>();
-            stack.AddRange(new long?[] { null, default });
-            _ = stack.Should().HaveCount(2).And.AllSatisfy(x => x.Should().BeNull());
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddItemsInCorrectOrder(string testCase, IEnumerable<long> testData, int itemsCount)
-        {
-            using var stack = new RecyclableStack<long>();
-
-            if (testCase.Contains("Array[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange((Array)testData);
-            }
-            else if (testCase.Contains("ICollection[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange((System.Collections.ICollection)testData);
-            }
-            else if (testCase.Contains("ICollection<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange((ICollection<long>)testData);
-            }
-            else if (testCase.Contains("IEnumerable[", StringComparison.OrdinalIgnoreCase))
-            {
-                _ = stack.AddRange((System.Collections.IEnumerable)testData);
-            }
-            else if (testCase.Contains("IReadOnlyList<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange((IReadOnlyList<long>)testData);
-            }
-            else if (testCase.Contains("ReadOnlySpan<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange(new ReadOnlySpan<long>((long[])testData));
-            }
-            else if (testCase.Contains("Span<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange(new Span<long>((long[])testData));
-            }
-            else if (testData is long[] array)
-            {
-                stack.AddRange(array);
-            }
-            else if (testData is List<long> list)
-            {
-                stack.AddRange(list);
-            }
-            else if (testData is RecyclableList<long> rList)
-            {
-                stack.AddRange(rList);
-            }
-            else if (testData is RecyclableLongList<long> rLongList)
-            {
-                stack.AddRange(rLongList);
-            }
-            else if (testData is IList<long> iList)
-            {
-                stack.AddRange((ICollection<long>)iList);
-            }
-            else if (testData is IEnumerable<long> enumerable)
-            {
-                stack.AddRange(enumerable);
-            }
-            else
-            {
-                throw new InvalidCastException("Unknown type of test data");
-            }
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(testData);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.EmptySourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldDoNothingWhenSourceIsEmpty(string testCase, IEnumerable<long> testData, int itemsCount)
-        {
-            using var stack = new RecyclableStack<long>();
-
-            if (testCase.Contains("Array[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange((Array)testData);
-            }
-            else if (testCase.Contains("ICollection[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange((System.Collections.ICollection)testData);
-            }
-            else if (testCase.Contains("ICollection<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange((ICollection<long>)testData);
-            }
-            else if (testCase.Contains("IEnumerable[", StringComparison.OrdinalIgnoreCase))
-            {
-                _ = stack.AddRange((System.Collections.IEnumerable)testData);
-            }
-            else if (testCase.Contains("IReadOnlyList<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange((IReadOnlyList<long>)testData);
-            }
-            else if (testCase.Contains("ReadOnlySpan<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange(new ReadOnlySpan<long>((long[])testData));
-            }
-            else if (testCase.Contains("Span<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange(new Span<long>((long[])testData));
-            }
-            else if (testData is long[] array)
-            {
-                stack.AddRange(array);
-            }
-            else if (testData is List<long> list)
-            {
-                stack.AddRange(list);
-            }
-            else if (testData is RecyclableList<long> rList)
-            {
-                stack.AddRange(rList);
-            }
-            else if (testData is RecyclableLongList<long> rLongList)
-            {
-                stack.AddRange(rLongList);
-            }
-            else if (testData is IList<long> iList)
-            {
-                stack.AddRange((ICollection<long>)iList);
-            }
-            else if (testData is IEnumerable<long> enumerable)
-            {
-                stack.AddRange(enumerable);
-            }
-            else
-            {
-                throw new InvalidCastException("Unknown type of test data");
-            }
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(testData);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.SourceDataVariants), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItems(string testCase, IEnumerable<long> testData, int itemsCount)
-        {
-            using var stack = new RecyclableStack<long>();
-            itemsCount = checked(itemsCount << 1);
-
-            if (testCase.Contains("Array[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange((Array)testData);
-                stack.AddRange((Array)testData);
-            }
-            else if (testCase.Contains("ICollection[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange((System.Collections.ICollection)testData);
-                stack.AddRange((System.Collections.ICollection)testData);
-            }
-            else if (testCase.Contains("ICollection<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange((ICollection<long>)testData);
-                stack.AddRange((ICollection<long>)testData);
-            }
-            else if (testCase.Contains("IEnumerable[", StringComparison.OrdinalIgnoreCase))
-            {
-                _ = stack.AddRange((System.Collections.IEnumerable)testData);
-                _ = stack.AddRange((System.Collections.IEnumerable)testData);
-            }
-            else if (testCase.Contains("IReadOnlyList<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                stack.AddRange((IReadOnlyList<long>)testData);
-                stack.AddRange((IReadOnlyList<long>)testData);
-            }
-            else if (testCase.Contains("ReadOnlySpan<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                var span = new ReadOnlySpan<long>((long[])testData);
-                stack.AddRange(span);
-                stack.AddRange(span);
-            }
-            else if (testCase.Contains("Span<T>[", StringComparison.OrdinalIgnoreCase))
-            {
-                var span = new Span<long>((long[])testData);
-                stack.AddRange(span);
-                stack.AddRange(span);
-            }
-            else if (testData is long[] array)
-            {
-                stack.AddRange(array);
-                stack.AddRange(array);
-            }
-            else if (testData is List<long> list)
-            {
-                stack.AddRange(list);
-                stack.AddRange(list);
-            }
-            else if (testData is RecyclableList<long> rList)
-            {
-                stack.AddRange(rList);
-                stack.AddRange(rList);
-            }
-            else if (testData is RecyclableLongList<long> rLongList)
-            {
-                stack.AddRange(rLongList);
-                stack.AddRange(rLongList);
-            }
-            else if (testData is IList<long> iList)
-            {
-                stack.AddRange((ICollection<long>)iList);
-                stack.AddRange((ICollection<long>)iList);
-            }
-            else if (testData is IEnumerable<long> enumerable)
-            {
-                stack.AddRange(enumerable);
-                stack.AddRange(enumerable);
-            }
-            else
-            {
-                throw new InvalidCastException("Unknown type of test data");
-            }
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(testData);
-            expected.AddRange(testData);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddListItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableList<long>(data);
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromList(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableList<long>(data);
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount * 2);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddLongListItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableLongList<long>(data);
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromLongList(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableLongList<long>(data);
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount * 2);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddHashSetItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableHashSet<long>();
-            foreach (long item in data)
-            {
-                source.Add(item);
-            }
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromHashSet(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableHashSet<long>();
-            foreach (long item in data)
-            {
-                source.Add(item);
-            }
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount * 2);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddStackItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableStack<long>(data);
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromStack(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableStack<long>(data);
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount * 2);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddSortedSetItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedSet<long>();
-            foreach (long item in data)
-            {
-                source.Add(item);
-            }
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromSortedSet(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedSet<long>();
-            foreach (long item in data)
-            {
-                source.Add(item);
-            }
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount * 2);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddLinkedListItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableLinkedList<long>(data);
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromLinkedList(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableLinkedList<long>(data);
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount * 2);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddQueueItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableQueue<long>(data);
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromQueue(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableQueue<long>(data);
-            using var stack = new RecyclableStack<long>();
-
-            stack.AddRange(source);
-            stack.AddRange(source);
-
-            List<long> expected = new(itemsCount * 2);
-            expected.AddRange(data);
-            expected.AddRange(data);
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount * 2);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddDictionaryItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableDictionary<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var stack = new RecyclableStack<KeyValuePair<int, long>>();
-
-            stack.AddRange(source);
-
-            List<KeyValuePair<int, long>> expected = new(itemsCount);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromDictionary(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableDictionary<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var stack = new RecyclableStack<KeyValuePair<int, long>>();
-
-            stack.AddRange(source);
-            stack.AddRange(source);
-
-            List<KeyValuePair<int, long>> expected = new(itemsCount * 2);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount * 2);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddSortedListItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedList<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var stack = new RecyclableStack<(int Key, long Value)>();
-
-            stack.AddRange(source);
-
-            List<(int Key, long Value)> expected = new(itemsCount);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add((i, data[i]));
-            }
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromSortedList(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedList<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var stack = new RecyclableStack<(int Key, long Value)>();
-
-            stack.AddRange(source);
-            stack.AddRange(source);
-
-            List<(int Key, long Value)> expected = new(itemsCount * 2);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add((i, data[i]));
-            }
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add((i, data[i]));
-            }
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount * 2);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldAddSortedDictionaryItemsInCorrectOrder(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedDictionary<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var stack = new RecyclableStack<KeyValuePair<int, long>>();
-
-            stack.AddRange(source);
-
-            List<KeyValuePair<int, long>> expected = new(itemsCount);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount);
-            _ = stack.Should().Equal(expected);
-        }
-
-        [Theory]
-        [MemberData(nameof(RecyclableLongListTestData.ItemsCountTestCases), MemberType = typeof(RecyclableLongListTestData))]
-        public void AddRangeShouldNotOverrideItemsFromSortedDictionary(int itemsCount)
-        {
-            long[] data = RecyclableLongListTestData.CreateTestData(itemsCount).ToArray();
-            using var source = new RecyclableSortedDictionary<int, long>();
-            for (int i = 0; i < data.Length; i++)
-            {
-                source.Add(i, data[i]);
-            }
-            using var stack = new RecyclableStack<KeyValuePair<int, long>>();
-
-            stack.AddRange(source);
-            stack.AddRange(source);
-
-            List<KeyValuePair<int, long>> expected = new(itemsCount * 2);
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-            for (int i = 0; i < data.Length; i++)
-            {
-                expected.Add(new KeyValuePair<int, long>(i, data[i]));
-            }
-            expected.Reverse();
-
-            _ = stack.Count.Should().Be(itemsCount * 2);
-            _ = stack.Should().Equal(expected);
-        }
-
 	}
 }