fix: Full root set enumaraiting was fail

Author: Kibnet

src/IntSet.Tests/IntSetTests.cs

@@ -1,11 +1,13 @@
 
+using System;
 using System.Collections;
 using System.Linq;
 using Xunit;
+using static Kibnet.IntSet;
 
 namespace IntSet.Tests
 {
-    public class IntSetTests
+    public partial class IntSetTests
     {
         [Fact]
         public void GetEnumerableTest()
@@ -124,16 +126,36 @@ public void OrderedEnumerateTest()
             }
         }
 
-        [Fact]
-        public void OrderedIEnumerateTest()
+
+        [Theory]
+        [InlineData(int.MinValue, int.MinValue + 100000)]
+        [InlineData(int.MaxValue - 100000, int.MaxValue)]
+        [InlineData(-50000, 50000)]
+        [InlineData((1<<3)-50000, (1 << 3)+50000)]
+        [InlineData((1<<6)-50000, (1 << 6)+50000)]
+        [InlineData((1<<9)-50000, (1 << 9)+50000)]
+        [InlineData((1<<12)-50000, (1 << 12)+50000)]
+        [InlineData((1<<15)-50000, (1 << 15)+50000)]
+        [InlineData((1<<18)-50000, (1 << 18)+50000)]
+        [InlineData((1<<21)-50000, (1 << 21)+50000)]
+        [InlineData((1<<24)-50000, (1 << 24)+50000)]
+        [InlineData((1<<27)-50000, (1 << 27)+50000)]
+        [InlineData((1<<30)-50000, (1 << 30)+50000)]
+        [InlineData(-5, 5)]
+        public void OrderedIEnumerateTest(int from, int to)
         {
-            var intSet = new Kibnet.IntSet(TestHelper.GetEnumerable(100000, 0));
+            var intSet = new Kibnet.IntSet(TestHelper.GetEnumerable(to, from));
 
-            var last = -1;
+            int? last = null;
             var enumerable = intSet as IEnumerable;
             foreach (int i in enumerable)
             {
-                Assert.Equal(last + 1, i);
+                if (last == null)
+                {
+                    last = i;
+                    continue;
+                }
+                Assert.Equal(last+1, i);
                 last = i;
             }
         }
@@ -197,6 +219,22 @@ public void FullSetTest(int from, int to)
             }
         }
 
+        [Theory]
+        [InlineData(int.MinValue, int.MinValue + 1000000, 997)]
+        [InlineData(int.MaxValue - 1000000, int.MaxValue, 997)]
+        [InlineData(-5000000, 5000000, 997)]
+        [InlineData(int.MinValue, int.MaxValue, 2147477)]
+        public void FullSteppedSetTest(int from, int to, int step)
+        {
+            var intSet = new Kibnet.IntSet(false, true);
+            intSet.Add(0);
+
+            for (int i = from; i < to; i += step)
+            {
+                Assert.True(intSet.Contains(i));
+            }
+        }
+
         [Theory]
         [InlineData(int.MinValue, int.MinValue + 100000)]
         [InlineData(int.MaxValue - 100000, int.MaxValue)]
@@ -230,10 +268,18 @@ public void FullEnumeratorTest()
         {
             var intSet = new Kibnet.IntSet(false, true);
 
-            var last = -1;
+            var last = int.MinValue;
+            var first = true;
             foreach (var i in intSet.Take(100000))
             {
-                Assert.Equal(last + 1, i);
+                if (first)
+                {
+                    Assert.Equal(last, i);
+                    first = false;
+                }
+
+                else
+                    Assert.Equal(last + 1, i);
                 Assert.True(intSet.Contains(i));
                 last = i;
             }
@@ -385,5 +431,25 @@ public void ExceptWithTest()
 
             intSet.EqualRange(10001, 100000);
         }
+
+        [Fact]
+        public void Contains_DefaultValue_ReturnsFalse()
+        {
+            var set = new Kibnet.IntSet();          // èçíà÷àëüíî âñå áèòû = 0
+            Assert.False(set.Contains(0));   // äîëæíî âåðíóòü false
+            Assert.False(set.Contains(42));  // ëþáîå çíà÷åíèå
+        }
+
+        [Fact]
+        public void CopyTo_MatchExactSpace_CopiesAll()
+        {
+            var set = new Kibnet.IntSet();
+            set.Add(1);
+            set.Add(2);
+            set.Add(3);
+            var dst = new int[5];
+            set.CopyTo(dst, 2);
+            Assert.Equal(new[] { 0, 0, 1, 2, 3 }, dst);
+        }
     }
 }

src/IntSet/IntSet.cs

@@ -531,14 +531,14 @@ private IEnumerable<int> TraverseRootCards(Card root)
         {
             for (int i0 = 32; i0 < 64; i0++)
             {
-                if (root.Cards[i0] != null)
+                if (root.Full || root.Cards[i0] != null)
                 {
                     yield return i0;
                 }
             }
             for (int i0 = 0; i0 < 32; i0++)
             {
-                if (root.Cards[i0] != null)
+                if (root.Full || root.Cards[i0] != null)
                 {
                     yield return i0;
                 }