bitarray 3.7.1__tar.gz → 3.7.2__tar.gz

{bitarray-3.7.1 → bitarray-3.7.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: bitarray
-Version: 3.7.1
+Version: 3.7.2
 Summary: efficient arrays of booleans -- C extension
 Home-page: https://github.com/ilanschnell/bitarray
 Author: Ilan Schnell
@@ -19,6 +19,7 @@ Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
 Classifier: Topic :: Utilities
 License-File: LICENSE
 Dynamic: author
@@ -76,7 +77,7 @@ Key features
 Installation
 ------------
 
-Python wheels are are available on PyPI for all mayor platforms and Python
+Python wheels are are available on PyPI for all major platforms and Python
 versions.  Which means you can simply:
 
 .. code-block:: shell-session
@@ -89,7 +90,7 @@ Once you have installed the package, you may want to test it:
 
     $ python -c 'import bitarray; bitarray.test()'
     bitarray is installed in: /Users/ilan/bitarray/bitarray
-    bitarray version: 3.7.1
+    bitarray version: 3.7.2
     sys.version: 3.13.5 (main, Jun 16 2025) [Clang 18.1.8]
     sys.prefix: /Users/ilan/miniforge
     pointer size: 64 bit
@@ -351,7 +352,7 @@ and can therefore be used as a dictionary key:
 Reference
 =========
 
-bitarray version: 3.7.1 -- `change log <https://github.com/ilanschnell/bitarray/blob/master/doc/changelog.rst>`__
+bitarray version: 3.7.2 -- `change log <https://github.com/ilanschnell/bitarray/blob/master/doc/changelog.rst>`__
 
 In the following, ``item`` and ``value`` are usually a single bit -
 an integer 0 or 1.
@@ -729,6 +730,11 @@ This sub-module was added in version 1.2.
    Also, ``a`` may be any object that exposes a writable buffer.
    Nothing about this function is specific to bitarray objects.
 
+   We should mention that Python's ``array.array`` object has a
+   method ``.byteswap()`` with similar functionality.  However, unlike
+   bitarray's ``util.byteswap()`` function, this method is limited to
+   swapping 2, 4, or 8 consecutive bytes.
+
    New in version 3.4
 
 
@@ -870,11 +876,7 @@ This sub-module was added in version 1.2.
    set to one.  Mathematically equivalent to setting (in a bitarray of
    length ``n``) all bits at indices ``random.sample(range(n), k)`` to one.
    The random bitarrays are reproducible when giving Python's ``random.seed()``
-   with a specific seed value.
-
-   This function requires Python 3.9 or higher, as it depends on the standard
-   library function ``random.randbytes()``.  Raises ``NotImplementedError``
-   when Python version is too low.
+   a specific seed value.
 
    New in version 3.6
 

{bitarray-3.7.1 → bitarray-3.7.2}/README.rst

@@ -44,7 +44,7 @@ Key features
 Installation
 ------------
 
-Python wheels are are available on PyPI for all mayor platforms and Python
+Python wheels are are available on PyPI for all major platforms and Python
 versions.  Which means you can simply:
 
 .. code-block:: shell-session
@@ -57,7 +57,7 @@ Once you have installed the package, you may want to test it:
 
     $ python -c 'import bitarray; bitarray.test()'
     bitarray is installed in: /Users/ilan/bitarray/bitarray
-    bitarray version: 3.7.1
+    bitarray version: 3.7.2
     sys.version: 3.13.5 (main, Jun 16 2025) [Clang 18.1.8]
     sys.prefix: /Users/ilan/miniforge
     pointer size: 64 bit
@@ -319,7 +319,7 @@ and can therefore be used as a dictionary key:
 Reference
 =========
 
-bitarray version: 3.7.1 -- `change log <https://github.com/ilanschnell/bitarray/blob/master/doc/changelog.rst>`__
+bitarray version: 3.7.2 -- `change log <https://github.com/ilanschnell/bitarray/blob/master/doc/changelog.rst>`__
 
 In the following, ``item`` and ``value`` are usually a single bit -
 an integer 0 or 1.
@@ -697,6 +697,11 @@ This sub-module was added in version 1.2.
    Also, ``a`` may be any object that exposes a writable buffer.
    Nothing about this function is specific to bitarray objects.
 
+   We should mention that Python's ``array.array`` object has a
+   method ``.byteswap()`` with similar functionality.  However, unlike
+   bitarray's ``util.byteswap()`` function, this method is limited to
+   swapping 2, 4, or 8 consecutive bytes.
+
    New in version 3.4
 
 
@@ -838,11 +843,7 @@ This sub-module was added in version 1.2.
    set to one.  Mathematically equivalent to setting (in a bitarray of
    length ``n``) all bits at indices ``random.sample(range(n), k)`` to one.
    The random bitarrays are reproducible when giving Python's ``random.seed()``
-   with a specific seed value.
-
-   This function requires Python 3.9 or higher, as it depends on the standard
-   library function ``random.randbytes()``.  Raises ``NotImplementedError``
-   when Python version is too low.
+   a specific seed value.
 
    New in version 3.6
 

{bitarray-3.7.1 → bitarray-3.7.2}/bitarray/__init__.py

@@ -9,14 +9,13 @@ Please find a description of this package at:
 
 Author: Ilan Schnell
 """
-from __future__ import absolute_import
 from collections import namedtuple
 
-from bitarray._bitarray import (bitarray, decodetree, _sysinfo,
-                                bits2bytes, _bitarray_reconstructor,
-                                get_default_endian, _set_default_endian,
-                                __version__)
-
+from bitarray._bitarray import (
+    bitarray, decodetree, bits2bytes, _bitarray_reconstructor,
+    get_default_endian, _set_default_endian, _sysinfo,
+    BITARRAY_VERSION as __version__
+)
 
 __all__ = ['bitarray', 'frozenbitarray', 'decodetree', 'bits2bytes']
 

{bitarray-3.7.1 → bitarray-3.7.2}/bitarray/_bitarray.c

@@ -1323,9 +1323,8 @@ bitarray_invert(bitarrayobject *self, PyObject *args)
             return NULL;
         }
         self->ob_item[i / 8] ^= BITMASK(self, i);
-        Py_RETURN_NONE;
     }
-    if (PySlice_Check(arg)) {
+    else if (PySlice_Check(arg)) {
         Py_ssize_t start, stop, step, slicelength;
 
         if (PySlice_GetIndicesEx(arg, self->nbits,
@@ -1333,15 +1332,15 @@ bitarray_invert(bitarrayobject *self, PyObject *args)
             return NULL;
         adjust_step_positive(slicelength, &start, &stop, &step);
         invert_range(self, start, stop, step);
-        Py_RETURN_NONE;
     }
-    if (arg == Py_None) {
+    else if (arg == Py_None) {
         invert_span(self, 0, self->nbits);
-        Py_RETURN_NONE;
     }
-
-    return PyErr_Format(PyExc_TypeError, "index expect, not '%s' object",
-                        Py_TYPE(arg)->tp_name);
+    else {
+        return PyErr_Format(PyExc_TypeError, "index expect, not '%s' object",
+                            Py_TYPE(arg)->tp_name);
+    }
+    Py_RETURN_NONE;
 }
 
 PyDoc_STRVAR(invert_doc,
@@ -3613,7 +3612,7 @@ endian_from_string(const char *str)
         return ENDIAN_BIG;
 
     PyErr_Format(PyExc_ValueError, "bit-endianness must be either "
-                                   "'little' or 'big', not '%s'", str);
+                 "'little' or 'big', not '%s'", str);
     return -1;
 }
 
@@ -4193,7 +4192,8 @@ sysinfo(PyObject *module, PyObject *args)
     R("DEBUG", 0);
 #endif
 
-    return PyErr_Format(PyExc_KeyError, "%s", key);
+    PyErr_SetString(PyExc_KeyError, key);
+    return NULL;
 #undef R
 }
 
@@ -4287,8 +4287,8 @@ PyInit__bitarray(void)
         return NULL;
     Py_SET_TYPE(&SearchIter_Type, &PyType_Type);
 
-    PyModule_AddObject(m, "__version__",
-                       PyUnicode_FromString(BITARRAY_VERSION));
+    if (PyModule_AddStringMacro(m, BITARRAY_VERSION) < 0)
+        return NULL;
 
     return m;
 }

{bitarray-3.7.1 → bitarray-3.7.2}/bitarray/_util.c

@@ -2254,7 +2254,8 @@ PyInit__util(void)
     Py_SET_TYPE(&CHDI_Type, &PyType_Type);
 
 #ifndef NDEBUG  /* expose segment size in debug mode for testing */
-    PyModule_AddObject(m, "_SEGSIZE", PyLong_FromSsize_t(SEGSIZE));
+    if (PyModule_AddIntConstant(m, "_SEGSIZE", SEGSIZE) < 0)
+        return NULL;
 #endif
 
     return m;

{bitarray-3.7.1 → bitarray-3.7.2}/bitarray/bitarray.h

@@ -4,7 +4,7 @@
 
    Author: Ilan Schnell
 */
-#define BITARRAY_VERSION  "3.7.1"
+#define BITARRAY_VERSION  "3.7.2"
 
 #ifdef STDC_HEADERS
 #  include <stddef.h>
@@ -233,7 +233,7 @@ setup_table(char *table, char kop)
     for (k = 0; k < 256; k++) {
         char t = 0, j;
         for (j = 0; j < 8; j++) {
-            if (k & 1 << j)
+            if (k & 1 << j) {
                 /* j are the indices of active bits in k (little endian) */
                 switch (kop) {
                 case 'a': t += j;        break;  /* add active indices */
@@ -249,6 +249,7 @@ setup_table(char *table, char kop)
                 case 'r': t |= 128 >> j; break;  /* reverse bits */
                 default: Py_UNREACHABLE();
                 }
+            }
         }
         table[k] = t;
     }

{bitarray-3.7.1 → bitarray-3.7.2}/bitarray/test_bitarray.py

@@ -7,8 +7,6 @@ Tests for bitarray
 
 Author: Ilan Schnell
 """
-from __future__ import absolute_import
-
 import re
 import os
 import sys
@@ -17,7 +15,7 @@ import unittest
 import shutil
 import tempfile
 from io import BytesIO, UnsupportedOperation
-from random import choice, getrandbits, randrange, randint, shuffle
+from random import choice, choices, getrandbits, randrange, randint, shuffle
 from string import whitespace
 
 # imports needed inside tests
@@ -1409,7 +1407,7 @@ class GetSequenceIndexTests(unittest.TestCase, Util):
     def test_random(self):
         for a in self.randombitarrays():
             n = len(a)
-            lst = [randrange(n) for _ in range(n // 2)]
+            lst = choices(range(n), k=n//2)
             b = a[lst]
             self.assertEqual(b, bitarray(a[i] for i in lst))
             self.assertEqual(b.endian, a.endian)
@@ -1442,7 +1440,7 @@ class SetSequenceIndexTests(unittest.TestCase, Util):
     def test_bool_random(self):
         for a in self.randombitarrays():
             n = len(a)
-            lst = [randrange(n) for _ in range(n // 2)]
+            lst = choices(range(n), k=n//2)
             b = a.copy()
             v = getrandbits(1)
             a[lst] = v
@@ -1476,7 +1474,7 @@ class SetSequenceIndexTests(unittest.TestCase, Util):
     def test_bitarray_random(self):
         for a in self.randombitarrays():
             n = len(a)
-            lst = [randrange(n) for _ in range(n // 2)]
+            lst = choices(range(n), k=n//2)
             c = urandom_2(len(lst))
             b = a.copy()
 
@@ -1547,7 +1545,7 @@ class DelSequenceIndexTests(unittest.TestCase, Util):
     def test_random(self):
         for n in range(100):
             a = urandom_2(n)
-            lst = [randrange(n) for _ in range(randint(0, n))]
+            lst = choices(range(n), k=randint(0, n))
             b = a.copy()
             del a[lst]
             self.assertEqual(len(a), n - len(set(lst)))
@@ -3233,7 +3231,7 @@ class To01Tests(unittest.TestCase, Util):
     def test_sep(self):
         for a in self.randombitarrays():
             sep = "".join(chr(randint(32, 126))
-                              for _ in range(randrange(10)))
+                          for _ in range(randrange(10)))
             self.assertEqual(a.to01(1, sep), sep.join(str(v) for v in a))
 
         a = bitarray("11100111")
@@ -3445,7 +3443,7 @@ class CountTests(unittest.TestCase, Util):
     def test_sparse(self):
         n = 65536
         a = bitarray(n)
-        indices = set(randrange(n) for _ in range(256))
+        indices = set(choices(range(n), k=256))
         a[list(indices)] = 1
         self.assertEqual(a.count(1), len(indices))
         self.assertEqual(a.count(0), n - len(indices))
@@ -3636,7 +3634,7 @@ class IndexTests(unittest.TestCase, Util):
         for _ in range(500):
             n = randrange(1, 200)
             a = zeros(n)
-            plst = sorted(randrange(n) for _ in range(1, 10))
+            plst = sorted(choices(range(n), k=9))
             a[plst] = 1
             # test without start and stop
             self.assertEqual(a.find(1, right=0), plst[0])

{bitarray-3.7.1 → bitarray-3.7.2}/bitarray/test_util.py

@@ -5,8 +5,6 @@
 """
 Tests for bitarray.util module
 """
-from __future__ import absolute_import
-
 import os
 import sys
 import math
@@ -20,8 +18,8 @@ import tempfile
 import unittest
 from io import StringIO
 from functools import reduce
-from random import (choice, getrandbits, randrange, randint, random, sample,
-                    seed)
+from random import (choice, choices, getrandbits, randrange, randint, random,
+                    sample, seed)
 from string import hexdigits, whitespace
 from collections import Counter
 
@@ -120,16 +118,6 @@ class URandomTests(unittest.TestCase):
 
 # ----------------------------  random_k()  ---------------------------------
 
-HAVE_RANDBYTES = sys.version_info[:2] >= (3, 9)
-
-@skipIf(HAVE_RANDBYTES)
-class Random_K_Not_Implemented(unittest.TestCase):
-
-    def test_not_implemented(self):
-        self.assertRaises(NotImplementedError, random_k, 100, 60)
-
-
-@skipIf(not HAVE_RANDBYTES)
 class Random_K_Tests(unittest.TestCase):
 
     def test_basic(self):
@@ -189,6 +177,8 @@ class Random_K_Tests(unittest.TestCase):
         else:
             self.fail()
 
+    # test uses math.comb, added in 3.8
+    @skipIf(sys.version_info[:2] < (3, 8))
     def test_combinations(self):
         # for entire range of 0 <= k <= n, validate that random_k()
         # generates all possible combinations
@@ -227,7 +217,8 @@ class Random_K_Tests(unittest.TestCase):
             a.append(self.collect_code_branches())
         self.assertEqual(a[0], a[2])
         self.assertEqual(a[1], a[3])
-        self.assertNotEqual(a[0], a[1])
+        for item0, item1 in zip(a[0], a[1]):
+            self.assertNotEqual(item0, item1)
         # initialize seed with current system time again
         seed()
 
@@ -341,7 +332,7 @@ class Random_P_Tests(unittest.TestCase):
     def collect_code_branches(self):
         # return list of bitarrays from all code branches of random_p()
         res = []
-        # for default p=0.5, random_p uses randbytes
+        # for default p=0.5, random_p uses getrandbits
         res.append(random_p(32))
         # test small p
         res.append(random_p(5_000, 0.002))
@@ -363,7 +354,8 @@ class Random_P_Tests(unittest.TestCase):
             a.append(self.collect_code_branches())
         self.assertEqual(a[0], a[2])
         self.assertEqual(a[1], a[3])
-        self.assertNotEqual(a[0], a[1])
+        for item0, item1 in zip(a[0], a[1]):
+            self.assertNotEqual(item0, item1)
         # initialize seed with current system time again
         seed()
 
@@ -1588,7 +1580,7 @@ class BaseTests(unittest.TestCase, Util):
         self.assertEqual(ba2base(16, a), 'f61')
 
         for n in range(50):
-            s = ''.join(choice(hexdigits) for _ in range(n))
+            s = ''.join(choices(hexdigits, k=n))
             endian = self.random_endian()
             a = base2ba(16, s, endian)
             self.assertEQUAL(a, hex2ba(s, endian))
@@ -1884,7 +1876,7 @@ class SC_Tests(unittest.TestCase, Util):
 
     def test_block_type3(self):
         a = bitarray(16_777_216, 'little')
-        a[[getrandbits(24) for _ in range(255)]] = 1
+        a[choices(range(1 << 24), k=255)] = 1
         b = bytearray([0x04, 0x00, 0x00, 0x00, 0x01, 0xc3, a.count()])
         for i in a.search(1):
             b.extend(struct.pack("<I", i)[:3])
@@ -1897,7 +1889,7 @@ class SC_Tests(unittest.TestCase, Util):
         # To understand why we cannot have a population larger than 5 for
         # an array size 4 times the size of a type 3 block, take a look
         # at the cost comparison in sc_encode_block().  (2 + 6 >= 2 * 4)
-        indices = sorted(set(randrange(len(a)) for _ in range(5)))
+        indices = sorted(set(choices(range(len(a)), k=5)))
         a[indices] = 1
         b = bytearray(b'\x04\x00\x00\x00\x04\xc4')
         b.append(len(indices))
@@ -2607,7 +2599,7 @@ class HuffmanTests(unittest.TestCase):
         self.check_tree(code)
 
     def test_random_list(self):
-        plain = [randrange(100) for _ in range(500)]
+        plain = choices(range(100), k=500)
         code = huffman_code(Counter(plain))
         a = bitarray()
         a.encode(code, plain)
@@ -2856,7 +2848,7 @@ class CanonicalHuffmanTests(unittest.TestCase, Util):
 
     def ensure_round_trip(self, chc, count, symbol):
         # create a short test message, encode and decode
-        msg = [choice(symbol) for _ in range(10)]
+        msg = choices(symbol, k=10)
         a = bitarray()
         a.encode(chc, msg)
         it = canonical_decode(a, count, symbol)

{bitarray-3.7.1 → bitarray-3.7.2}/bitarray/util.py

@@ -5,8 +5,6 @@
 """
 Useful utilities for working with bitarrays.
 """
-from __future__ import absolute_import
-
 import os
 import sys
 import math
@@ -59,15 +57,8 @@ Return (pseudo-) random bitarray of length `n` with `k` elements
 set to one.  Mathematically equivalent to setting (in a bitarray of
 length `n`) all bits at indices `random.sample(range(n), k)` to one.
 The random bitarrays are reproducible when giving Python's `random.seed()`
-with a specific seed value.
-
-This function requires Python 3.9 or higher, as it depends on the standard
-library function `random.randbytes()`.  Raises `NotImplementedError`
-when Python version is too low.
+a specific seed value.
 """
-    if sys.version_info[:2] < (3, 9):
-        raise NotImplementedError("bitarray.util.random_k() requires "
-                                  "Python 3.9 or higher")
     r = _Random(__n, endian)
     if not isinstance(k, int):
         raise TypeError("int expected, got '%s'" % type(k).__name__)
@@ -94,6 +85,7 @@ when Python version is too low.
     r = _Random(__n, endian)
     return r.random_p(p)
 
+
 class _Random:
 
     # The main reason for this class it to enable testing functionality
@@ -120,8 +112,10 @@ class _Random:
         """
         Return bitarray with each bit having probability p = 1/2 of being 1.
         """
-        # use randbytes() for reproducibility (not urandom())
-        a = bitarray(random.randbytes(self.nbytes), self.endian)
+        nbytes = self.nbytes
+        # use random module function for reproducibility (not urandom())
+        b = random.getrandbits(8 * nbytes).to_bytes(nbytes, 'little')
+        a = bitarray(b, self.endian)
         del a[self.n:]
         return a
 

{bitarray-3.7.1 → bitarray-3.7.2}/bitarray.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: bitarray
-Version: 3.7.1
+Version: 3.7.2
 Summary: efficient arrays of booleans -- C extension
 Home-page: https://github.com/ilanschnell/bitarray
 Author: Ilan Schnell
@@ -19,6 +19,7 @@ Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
 Classifier: Topic :: Utilities
 License-File: LICENSE
 Dynamic: author
@@ -76,7 +77,7 @@ Key features
 Installation
 ------------
 
-Python wheels are are available on PyPI for all mayor platforms and Python
+Python wheels are are available on PyPI for all major platforms and Python
 versions.  Which means you can simply:
 
 .. code-block:: shell-session
@@ -89,7 +90,7 @@ Once you have installed the package, you may want to test it:
 
     $ python -c 'import bitarray; bitarray.test()'
     bitarray is installed in: /Users/ilan/bitarray/bitarray
-    bitarray version: 3.7.1
+    bitarray version: 3.7.2
     sys.version: 3.13.5 (main, Jun 16 2025) [Clang 18.1.8]
     sys.prefix: /Users/ilan/miniforge
     pointer size: 64 bit
@@ -351,7 +352,7 @@ and can therefore be used as a dictionary key:
 Reference
 =========
 
-bitarray version: 3.7.1 -- `change log <https://github.com/ilanschnell/bitarray/blob/master/doc/changelog.rst>`__
+bitarray version: 3.7.2 -- `change log <https://github.com/ilanschnell/bitarray/blob/master/doc/changelog.rst>`__
 
 In the following, ``item`` and ``value`` are usually a single bit -
 an integer 0 or 1.
@@ -729,6 +730,11 @@ This sub-module was added in version 1.2.
    Also, ``a`` may be any object that exposes a writable buffer.
    Nothing about this function is specific to bitarray objects.
 
+   We should mention that Python's ``array.array`` object has a
+   method ``.byteswap()`` with similar functionality.  However, unlike
+   bitarray's ``util.byteswap()`` function, this method is limited to
+   swapping 2, 4, or 8 consecutive bytes.
+
    New in version 3.4
 
 
@@ -870,11 +876,7 @@ This sub-module was added in version 1.2.
    set to one.  Mathematically equivalent to setting (in a bitarray of
    length ``n``) all bits at indices ``random.sample(range(n), k)`` to one.
    The random bitarrays are reproducible when giving Python's ``random.seed()``
-   with a specific seed value.
-
-   This function requires Python 3.9 or higher, as it depends on the standard
-   library function ``random.randbytes()``.  Raises ``NotImplementedError``
-   when Python version is too low.
+   a specific seed value.
 
    New in version 3.6
 

{bitarray-3.7.1 → bitarray-3.7.2}/setup.py

@@ -7,7 +7,7 @@ if sys.version_info[:3] < (3, 6, 1):
     sys.exit("""\
 ****************************************************************************
 *   bitarray requires Python 3.6.1 or later.
-*   The last version supporting Python 2 is bitarray 2.9.3.
+*   The last bitarray version supporting Python 2.7 is bitarray 2.9.3.
 ****************************************************************************
 """)
 
@@ -55,6 +55,7 @@ setup(
         "Programming Language :: Python :: 3.11",
         "Programming Language :: Python :: 3.12",
         "Programming Language :: Python :: 3.13",
+        "Programming Language :: Python :: 3.14",
         "Topic :: Utilities",
     ],
     description = "efficient arrays of booleans -- C extension",