add tests

Author: ilanschnell

bitarray/test_util.py

@@ -1046,7 +1046,7 @@ def test_ones_small(self):
             sm += i
             self.assertEqual(sum_indices(a), sm)
 
-    def test_large(self):
+    def test_large_ones(self):
         # Note that this will also work on 32-bit machines, even though
         # for n=100_000, we get: n*(n-1)/2 = 4999950000 > 2**32
         n = 100_000
@@ -1055,6 +1055,12 @@ def test_large(self):
         a.setall(1)
         self.assertEqual(sum_indices(a), n * (n - 1) // 2)
 
+    def test_large_random(self):
+        n = 100_000
+        a = urandom_2(n)
+        self.assertEqual(sum_indices(a),
+                         sum(i for i, v in enumerate(a) if v))
+
     def test_random(self):
         for a in self.randombitarrays():
             res = sum_indices(a)
@@ -1092,6 +1098,14 @@ def test_ones(self):
             if i < 19:
                 self.assertEqual(lst[i], x)
 
+    def test_large_random(self):
+        n = 100_000
+        a = urandom_2(n)
+        self.assertEqual(
+            xor_indices(a),
+            reduce(operator.xor, (i for i, v in enumerate(a) if v))
+        )
+
     def test_random(self):
         for a in self.randombitarrays():
             cnt = a.count()

devel/test_random.py

@@ -218,15 +218,6 @@ def test_stat(self):
             # p = 0.522195   mean = 52219.451858   stdev = 157.958033
             self.assertTrue(abs(x - 52_219) <= 1_580)
 
-    def test_sums(self):
-        # not so much a test for urandom itself, but for sum_indices()
-        # and xor_indices() for large bitarray
-        n = 10_000_000
-        a = urandom(n, choice(["little", "big"]))
-        indices = [i for i, v in enumerate(a) if v]
-        self.assertEqual(sum_indices(a), sum(indices))
-        self.assertEqual(xor_indices(a), reduce(operator.xor, indices))
-
 
 class Random_K_Tests(Util):
 

examples/README

@@ -82,11 +82,6 @@ puff/
     https://github.com/madler/zlib/blob/master/contrib/puff/puff.c
 
 
-resize/
-    Things to study the bitarray resize function, including the growth
-    pattern it creates and tests for the current implementation.
-
-
 sieve.py
     Demonstrates the "Sieve of Eratosthenes" algorithm for finding all prime
     numbers up to a specified integer.