bitstring 4.2.3__tar.gz → 4.3.0__tar.gz

{bitstring-4.2.3 → bitstring-4.3.0}/LICENSE

@@ -1,6 +1,6 @@
 The MIT License
 
-Copyright (c) 2006 Scott Griffiths (dr.scottgriffiths@gmail.com)
+Copyright (c) 2006-2025 Scott Griffiths (dr.scottgriffiths@gmail.com)
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

{bitstring-4.2.3/bitstring.egg-info → bitstring-4.3.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: bitstring
-Version: 4.2.3
+Version: 4.3.0
 Summary: Simple construction, analysis and modification of binary data.
 Author-email: Scott Griffiths <dr.scottgriffiths@gmail.com>
 Project-URL: homepage, https://github.com/scott-griffiths/bitstring
@@ -15,20 +15,21 @@ Classifier: Programming Language :: Python :: 3.9
 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: License :: OSI Approved :: MIT License
 Classifier: Topic :: Software Development :: Libraries :: Python Modules
 Requires-Python: >=3.8
 Description-Content-Type: text/markdown
 License-File: LICENSE
-Requires-Dist: bitarray<3.0.0,>=2.9.0
+Requires-Dist: bitarray<3.1,>=3.0.0
 
 
 
 ![bitstring](https://raw.githubusercontent.com/scott-griffiths/bitstring/main/doc/bitstring_logo_small.png "bitstring")
 
-**bitstring** is a Python module to help make the creation and analysis of all types of bit-level binary data as simple and efficient as possible.
+**bitstring** is a Python library to help make the creation and analysis of all types of bit-level binary data as simple and efficient as possible. It has been actively maintained since 2006.
 
-It has been actively maintained since 2006.
+The library has has now been downloaded over 100 million times! &nbsp; &nbsp; ✨ [![Pepy Total Downloads](https://img.shields.io/pepy/dt/bitstring?label=Downloads:&labelColor=orange&color=orange)](https://www.pepy.tech/projects/bitstring) ✨
 
 
 
@@ -37,7 +38,7 @@ It has been actively maintained since 2006.
 [![Codacy Badge](https://img.shields.io/codacy/grade/8869499b2eed44548fa1a5149dd451f4?logo=codacy)](https://app.codacy.com/gh/scott-griffiths/bitstring/dashboard?utm_source=gh&utm_medium=referral&utm_content=&utm_campaign=Badge_grade)
 [![Dependents (via libraries.io)](https://img.shields.io/librariesio/dependents/pypi/bitstring?logo=libraries.io&logoColor=white)](https://libraries.io/pypi/bitstring)
 &nbsp; &nbsp;
-[![Pepy Total Downlods](https://img.shields.io/pepy/dt/bitstring?logo=python&logoColor=white&labelColor=blue&color=blue)](https://www.pepy.tech/projects/bitstring)
+[![Pepy Total Downloads](https://img.shields.io/pepy/dt/bitstring?logo=python&logoColor=white&labelColor=blue&color=blue)](https://www.pepy.tech/projects/bitstring)
 [![PyPI - Downloads](https://img.shields.io/pypi/dm/bitstring?label=%40&labelColor=blue&color=blue)](https://pypistats.org/packages/bitstring)
 
 ----
@@ -59,7 +60,7 @@ It has been actively maintained since 2006.
 
 # Documentation
 
-Extensive documentation for the bitstring module is available.
+Extensive documentation for the bitstring library is available.
 Some starting points are given below:
 
 * [Overview](https://bitstring.readthedocs.io/en/stable/index.html)
@@ -130,4 +131,4 @@ Array('uint7', [45, 100, 15, 1])
 ```
 
 
-<sub>Copyright (c) 2006 - 2024 Scott Griffiths</sub>
+<sub>Copyright (c) 2006 - 2025 Scott Griffiths</sub>

{bitstring-4.2.3 → bitstring-4.3.0}/README.md

@@ -2,9 +2,9 @@
 
 ![bitstring](https://raw.githubusercontent.com/scott-griffiths/bitstring/main/doc/bitstring_logo_small.png "bitstring")
 
-**bitstring** is a Python module to help make the creation and analysis of all types of bit-level binary data as simple and efficient as possible.
+**bitstring** is a Python library to help make the creation and analysis of all types of bit-level binary data as simple and efficient as possible. It has been actively maintained since 2006.
 
-It has been actively maintained since 2006.
+The library has has now been downloaded over 100 million times!     ✨ [![Pepy Total Downloads](https://img.shields.io/pepy/dt/bitstring?label=Downloads:&labelColor=orange&color=orange)](https://www.pepy.tech/projects/bitstring) ✨
 
 
 
@@ -13,7 +13,7 @@ It has been actively maintained since 2006.
 [![Codacy Badge](https://img.shields.io/codacy/grade/8869499b2eed44548fa1a5149dd451f4?logo=codacy)](https://app.codacy.com/gh/scott-griffiths/bitstring/dashboard?utm_source=gh&utm_medium=referral&utm_content=&utm_campaign=Badge_grade)
 [![Dependents (via libraries.io)](https://img.shields.io/librariesio/dependents/pypi/bitstring?logo=libraries.io&logoColor=white)](https://libraries.io/pypi/bitstring)
    
-[![Pepy Total Downlods](https://img.shields.io/pepy/dt/bitstring?logo=python&logoColor=white&labelColor=blue&color=blue)](https://www.pepy.tech/projects/bitstring)
+[![Pepy Total Downloads](https://img.shields.io/pepy/dt/bitstring?logo=python&logoColor=white&labelColor=blue&color=blue)](https://www.pepy.tech/projects/bitstring)
 [![PyPI - Downloads](https://img.shields.io/pypi/dm/bitstring?label=%40&labelColor=blue&color=blue)](https://pypistats.org/packages/bitstring)
 
 ----
@@ -35,7 +35,7 @@ It has been actively maintained since 2006.
 
 # Documentation
 
-Extensive documentation for the bitstring module is available.
+Extensive documentation for the bitstring library is available.
 Some starting points are given below:
 
 * [Overview](https://bitstring.readthedocs.io/en/stable/index.html)
@@ -106,4 +106,4 @@ Array('uint7', [45, 100, 15, 1])
 ```
 
 
-<sub>Copyright (c) 2006 - 2024 Scott Griffiths</sub>
+<sub>Copyright (c) 2006 - 2025 Scott Griffiths</sub>

{bitstring-4.2.3 → bitstring-4.3.0}/bitstring/__init__.py

@@ -55,7 +55,7 @@ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 THE SOFTWARE.
 """
 
-__version__ = "4.2.3"
+__version__ = "4.3.0"
 
 __author__ = "Scott Griffiths"
 

{bitstring-4.2.3 → bitstring-4.3.0}/bitstring/array_.py

@@ -760,12 +760,8 @@ class Array:
     def _eq_ne(self, op, other: Any) -> Array:
         if isinstance(other, (int, float, str, Bits)):
             return self._apply_op_to_all_elements(op, other, is_comparison=True)
-        try:
-            other = self.__class__(self.dtype, other)
-        except:
-            return NotImplemented
-        finally:
-            return self._apply_op_between_arrays(op, other, is_comparison=True)
+        other = self.__class__(self.dtype, other)
+        return self._apply_op_between_arrays(op, other, is_comparison=True)
 
     def __eq__(self, other: Any) -> Array:
         return self._eq_ne(operator.eq, other)

{bitstring-4.2.3 → bitstring-4.3.0}/bitstring/bits.py

@@ -231,13 +231,8 @@ class Bits:
     def __getitem__(self: TBits, key: Union[slice, int], /) -> Union[TBits, bool]:
         """Return a new bitstring representing a slice of the current bitstring.
 
-        Indices are in units of the step parameter (default 1 bit).
-        Stepping is used to specify the number of bits in each item.
-
-        >>> print(BitArray('0b00110')[1:4])
+        >>> print(Bits('0b00110')[1:4])
         '0b011'
-        >>> print(BitArray('0x00112233')[1:3:8])
-        '0x1122'
 
         """
         if isinstance(key, numbers.Integral):

{bitstring-4.2.3 → bitstring-4.3.0}/bitstring/bitstore.py

@@ -4,24 +4,38 @@ import bitarray
 from bitstring.exceptions import CreationError
 from typing import Union, Iterable, Optional, overload, Iterator, Any
 
+if bitarray.__version__.startswith("2."):
+    raise ImportError(f"bitstring version 4.3 requires bitarray version 3 or higher. Found version {bitarray.__version__}.")
+
+def indices(s: slice, length: int) -> tuple[int, int | None, int]:
+    """A better implementation of slice.indices such that a
+    slice made from [start:stop:step] will actually equal the original slice."""
+    if s.step is None or s.step > 0:
+        return s.indices(length)
+    assert s.step < 0
+    start, stop, step = s.indices(length)
+    if stop < 0:
+        stop = None
+    return start, stop, step
 
 def offset_slice_indices_lsb0(key: slice, length: int) -> slice:
-    # First convert slice to all integers
-    # Length already should take account of the offset
-    start, stop, step = key.indices(length)
-    new_start = length - stop
-    new_stop = length - start
-    # For negative step we sometimes get a negative stop, which can't be used correctly in a new slice
-    return slice(new_start, None if new_stop < 0 else new_stop, step)
-
-
-def offset_start_stop_lsb0(start: Optional[int], stop: Optional[int], length: int) -> tuple[int, int]:
-    # First convert slice to all integers
-    # Length already should take account of the offset
-    start, stop, _ = slice(start, stop, None).indices(length)
-    new_start = length - stop
-    new_stop = length - start
-    return new_start, new_stop
+    start, stop, step = indices(key, length)
+    if step is not None and step < 0:
+        if stop is None:
+            new_start = start + 1
+            new_stop = None
+        else:
+            first_element = start
+            last_element = start + ((stop + 1 - start) // step) * step
+            new_start = length - last_element
+            new_stop = length - first_element - 1
+    else:
+        first_element = start
+        # The last element will usually be stop - 1, but needs to be adjusted if step != 1.
+        last_element = start + ((stop - 1 - start) // step) * step
+        new_start = length - last_element - 1
+        new_stop = length - first_element
+    return slice(new_start, new_stop, key.step)
 
 
 class BitStore:
@@ -150,7 +164,7 @@ class BitStore:
                 byte_pos = byte_pos + 1
             return
         # General case
-        i = self._bitarray.itersearch(bs._bitarray, start, end)
+        i = self._bitarray.search(bs._bitarray, start, end)
         if not bytealigned:
             for p in i:
                 yield p
@@ -160,7 +174,7 @@ class BitStore:
                     yield p
 
     def rfindall_msb0(self, bs: BitStore, start: int, end: int, bytealigned: bool = False) -> Iterator[int]:
-        i = self._bitarray.itersearch(bs._bitarray, start, end, right=True)
+        i = self._bitarray.search(bs._bitarray, start, end, right=True)
         if not bytealigned:
             for p in i:
                 yield p
@@ -213,8 +227,8 @@ class BitStore:
         return BitStore(self._bitarray[start:stop])
 
     def getslice_lsb0(self, start: Optional[int], stop: Optional[int], /) -> BitStore:
-        start, stop = offset_start_stop_lsb0(start, stop, len(self))
-        return BitStore(self._bitarray[start:stop])
+        s = offset_slice_indices_lsb0(slice(start, stop, None), len(self))
+        return BitStore(self._bitarray[s.start:s.stop])
 
     def getindex_lsb0(self, index: int, /) -> bool:
         return bool(self._bitarray.__getitem__(-index - 1))

{bitstring-4.2.3 → bitstring-4.3.0}/bitstring/utils.py

@@ -21,26 +21,28 @@ MULTIPLICATIVE_RE: Pattern[str] = re.compile(r'^(?P<factor>.*)\*(?P<token>.+)')
 LITERAL_RE: Pattern[str] = re.compile(r'^(?P<name>0([xob]))(?P<value>.+)', re.IGNORECASE)
 
 # An endianness indicator followed by one or more struct.pack codes
-STRUCT_PACK_RE: Pattern[str] = re.compile(r'^(?P<endian>[<>@=])(?P<fmt>(?:\d*[bBhHlLqQefd])+)$')
+STRUCT_PACK_RE: Pattern[str] = re.compile(r'^(?P<endian>[<>@=])(?P<fmt>(?:\d*[bBhHlLiIqQefd])+)$')
 # The same as above, but it doesn't insist on an endianness as it's byteswapping anyway.
-BYTESWAP_STRUCT_PACK_RE: Pattern[str] = re.compile(r'^(?P<endian>[<>@=])?(?P<fmt>(?:\d*[bBhHlLqQefd])+)$')
+BYTESWAP_STRUCT_PACK_RE: Pattern[str] = re.compile(r'^(?P<endian>[<>@=])?(?P<fmt>(?:\d*[bBhHlLiIqQefd])+)$')
 # An endianness indicator followed by exactly one struct.pack codes
-SINGLE_STRUCT_PACK_RE: Pattern[str] = re.compile(r'^(?P<endian>[<>@=])(?P<fmt>[bBhHlLqQefd])$')
+SINGLE_STRUCT_PACK_RE: Pattern[str] = re.compile(r'^(?P<endian>[<>@=])(?P<fmt>[bBhHlLiIqQefd])$')
 
 # A number followed by a single character struct.pack code
-STRUCT_SPLIT_RE: Pattern[str] = re.compile(r'\d*[bBhHlLqQefd]')
+STRUCT_SPLIT_RE: Pattern[str] = re.compile(r'\d*[bBhHlLiIqQefd]')
 
 # These replicate the struct.pack codes
 # Big-endian
 REPLACEMENTS_BE: Dict[str, str] = {'b': 'int8', 'B': 'uint8',
                                    'h': 'intbe16', 'H': 'uintbe16',
                                    'l': 'intbe32', 'L': 'uintbe32',
+                                   'i': 'intbe32', 'I': 'uintbe32',
                                    'q': 'intbe64', 'Q': 'uintbe64',
                                    'e': 'floatbe16', 'f': 'floatbe32', 'd': 'floatbe64'}
 # Little-endian
 REPLACEMENTS_LE: Dict[str, str] = {'b': 'int8', 'B': 'uint8',
                                    'h': 'intle16', 'H': 'uintle16',
                                    'l': 'intle32', 'L': 'uintle32',
+                                   'i': 'intle32', 'I': 'uintle32',
                                    'q': 'intle64', 'Q': 'uintle64',
                                    'e': 'floatle16', 'f': 'floatle32', 'd': 'floatle64'}
 
@@ -48,11 +50,12 @@ REPLACEMENTS_LE: Dict[str, str] = {'b': 'int8', 'B': 'uint8',
 REPLACEMENTS_NE: Dict[str, str] = {'b': 'int8', 'B': 'uint8',
                                    'h': 'intne16', 'H': 'uintne16',
                                    'l': 'intne32', 'L': 'uintne32',
+                                   'i': 'intne32', 'I': 'uintne32',
                                    'q': 'intne64', 'Q': 'uintne64',
                                    'e': 'floatne16', 'f': 'floatne32', 'd': 'floatne64'}
 
 # Size in bytes of all the pack codes.
-PACK_CODE_SIZE: Dict[str, int] = {'b': 1, 'B': 1, 'h': 2, 'H': 2, 'l': 4, 'L': 4,
+PACK_CODE_SIZE: Dict[str, int] = {'b': 1, 'B': 1, 'h': 2, 'H': 2, 'l': 4, 'L': 4, 'i': 4, 'I': 4,
                                   'q': 8, 'Q': 8, 'e': 2, 'f': 4, 'd': 8}
 
 

{bitstring-4.2.3 → bitstring-4.3.0/bitstring.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: bitstring
-Version: 4.2.3
+Version: 4.3.0
 Summary: Simple construction, analysis and modification of binary data.
 Author-email: Scott Griffiths <dr.scottgriffiths@gmail.com>
 Project-URL: homepage, https://github.com/scott-griffiths/bitstring
@@ -15,20 +15,21 @@ Classifier: Programming Language :: Python :: 3.9
 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: License :: OSI Approved :: MIT License
 Classifier: Topic :: Software Development :: Libraries :: Python Modules
 Requires-Python: >=3.8
 Description-Content-Type: text/markdown
 License-File: LICENSE
-Requires-Dist: bitarray<3.0.0,>=2.9.0
+Requires-Dist: bitarray<3.1,>=3.0.0
 
 
 
 ![bitstring](https://raw.githubusercontent.com/scott-griffiths/bitstring/main/doc/bitstring_logo_small.png "bitstring")
 
-**bitstring** is a Python module to help make the creation and analysis of all types of bit-level binary data as simple and efficient as possible.
+**bitstring** is a Python library to help make the creation and analysis of all types of bit-level binary data as simple and efficient as possible. It has been actively maintained since 2006.
 
-It has been actively maintained since 2006.
+The library has has now been downloaded over 100 million times! &nbsp; &nbsp; ✨ [![Pepy Total Downloads](https://img.shields.io/pepy/dt/bitstring?label=Downloads:&labelColor=orange&color=orange)](https://www.pepy.tech/projects/bitstring) ✨
 
 
 
@@ -37,7 +38,7 @@ It has been actively maintained since 2006.
 [![Codacy Badge](https://img.shields.io/codacy/grade/8869499b2eed44548fa1a5149dd451f4?logo=codacy)](https://app.codacy.com/gh/scott-griffiths/bitstring/dashboard?utm_source=gh&utm_medium=referral&utm_content=&utm_campaign=Badge_grade)
 [![Dependents (via libraries.io)](https://img.shields.io/librariesio/dependents/pypi/bitstring?logo=libraries.io&logoColor=white)](https://libraries.io/pypi/bitstring)
 &nbsp; &nbsp;
-[![Pepy Total Downlods](https://img.shields.io/pepy/dt/bitstring?logo=python&logoColor=white&labelColor=blue&color=blue)](https://www.pepy.tech/projects/bitstring)
+[![Pepy Total Downloads](https://img.shields.io/pepy/dt/bitstring?logo=python&logoColor=white&labelColor=blue&color=blue)](https://www.pepy.tech/projects/bitstring)
 [![PyPI - Downloads](https://img.shields.io/pypi/dm/bitstring?label=%40&labelColor=blue&color=blue)](https://pypistats.org/packages/bitstring)
 
 ----
@@ -59,7 +60,7 @@ It has been actively maintained since 2006.
 
 # Documentation
 
-Extensive documentation for the bitstring module is available.
+Extensive documentation for the bitstring library is available.
 Some starting points are given below:
 
 * [Overview](https://bitstring.readthedocs.io/en/stable/index.html)
@@ -130,4 +131,4 @@ Array('uint7', [45, 100, 15, 1])
 ```
 
 
-<sub>Copyright (c) 2006 - 2024 Scott Griffiths</sub>
+<sub>Copyright (c) 2006 - 2025 Scott Griffiths</sub>

bitstring-4.3.0/bitstring.egg-info/requires.txt

@@ -0,0 +1 @@
+bitarray<3.1,>=3.0.0

{bitstring-4.2.3 → bitstring-4.3.0}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "bitstring"
-version = "4.2.3"
+version = "4.3.0"
 authors = [
   { name="Scott Griffiths", email="dr.scottgriffiths@gmail.com" },
 ]
@@ -21,12 +21,13 @@ classifiers = [
     "Programming Language :: Python :: 3.10",
     "Programming Language :: Python :: 3.11",
     "Programming Language :: Python :: 3.12",
+    "Programming Language :: Python :: 3.13",
     "License :: OSI Approved :: MIT License",
     "Topic :: Software Development :: Libraries :: Python Modules",
 ]
 keywords = ["binary", "bitarray", "bitvector", "bitfield"]
 dependencies = [
-  "bitarray >= 2.9.0, < 3.0.0",
+  "bitarray >= 3.0.0, < 3.1"
 ]
 
 [project.urls]

{bitstring-4.2.3 → bitstring-4.3.0}/release_notes.md

@@ -1,6 +1,13 @@
 
 # Release Notes
 
+### January 2025: version 4.3.0
+
+* Upgraded bitarray dependency to >= 3.0.0.
+* Explicit support for Python 3.13.
+* Removed the 'experimental feature' label from the new exotic floating point types.
+* Fix for LSB0 slicing issue. Bug #343.
+
 ### May 2024: version 4.2.3
 
 #### More small bug fixes related to some of the new (beta) float formats.

{bitstring-4.2.3 → bitstring-4.3.0}/tests/test_bits.py

@@ -8,9 +8,9 @@ import array
 import os
 import re
 from bitstring import InterpretError, Bits, BitArray
-from hypothesis import given, assume
+from hypothesis import given, assume, reproduce_failure, settings
 import hypothesis.strategies as st
-
+from bitstring.bitstore import offset_slice_indices_lsb0
 
 sys.path.insert(0, '..')
 
@@ -20,6 +20,33 @@ def remove_unprintable(s: str) -> str:
     colour_escape = re.compile(r'(?:\x1B[@-_])[0-?]*[ -/]*[@-~]')
     return colour_escape.sub('', s)
 
+
+@settings(max_examples=500)
+@given(length=st.integers(0, 9),
+       start=st.integers(-20, 20),
+       stop=st.integers(-20, 20),
+       step=st.integers(0, 7))
+def test_lsb0_slicing(length, start, stop, step):
+    if start == -20:
+        start = None
+    if stop == -20:
+        stop = None
+    if step == 0:
+        step = None
+    values_fwd = list(range(0, length))
+    values_bwd = list(range(0, length))
+    values_bwd.reverse()
+
+    # Convert the start, stop, step to a range over the length
+    start1, stop1, step1 = slice(start, stop, step).indices(length)
+    values1 = values_fwd[start1:stop1:step1]
+
+    lsb0key = offset_slice_indices_lsb0(slice(start, stop, step), length)
+    values2 = values_bwd[lsb0key.start:lsb0key.stop:lsb0key.step]
+    values2.reverse()
+    assert values1 == values2
+
+
 class TestCreation:
     def test_creation_from_bytes(self):
         s = Bits(bytes=b'\xa0\xff')
@@ -530,7 +557,7 @@ class TestLsb0Indexing:
         assert a[:-8] == '0xcdef'
 
     def test_extended_slicing(self):
-        a = Bits('0b100000100100100')
+        a = Bits('0b0100000100100100')
         assert a[2::3] == '0b10111'
 
     def test_all(self):
@@ -556,6 +583,15 @@ class TestLsb0Indexing:
         assert a.endswith('0x123')
         assert not a.endswith('0xabcd')
 
+    def test_lsb0_slicing_error(self):
+        a = Bits('0b01')
+        b = a[::-1]
+        assert b == '0b10'
+        t = Bits('0xf0a')[::-1]
+        assert t == '0x50f'
+        s = Bits('0xf0a')[::-1][::-1]
+        assert s == '0xf0a'
+
 
 class TestLsb0Interpretations:
 

{bitstring-4.2.3 → bitstring-4.3.0}/tests/test_bitstream.py

@@ -2488,6 +2488,8 @@ class TestSplit2:
         assert pack('<H', 23) == BitStream('uintle:16=23')
         assert pack('<l', 23) == BitStream('intle:32=23')
         assert pack('<L', 23) == BitStream('uintle:32=23')
+        assert pack('<i', 23) == BitStream('intle:32=23')
+        assert pack('<I', 23) == BitStream('uintle:32=23')
         assert pack('<q', 23) == BitStream('intle:64=23')
         assert pack('<Q', 23) == BitStream('uintle:64=23')
         assert pack('>b', 23) == BitStream('intbe:8=23')
@@ -2496,6 +2498,8 @@ class TestSplit2:
         assert pack('>H', 23) == BitStream('uintbe:16=23')
         assert pack('>l', 23) == BitStream('intbe:32=23')
         assert pack('>L', 23) == BitStream('uintbe:32=23')
+        assert pack('>i', 23) == BitStream('intbe:32=23')
+        assert pack('>I', 23) == BitStream('uintbe:32=23')
         assert pack('>q', 23) == BitStream('intbe:64=23')
         assert pack('>Q', 23) == BitStream('uintbe:64=23')
         with pytest.raises(bitstring.CreationError):
@@ -2517,6 +2521,8 @@ class TestSplit2:
             assert pack('=H', 23) == BitStream('uintle:16=23')
             assert pack('@l', 23) == BitStream('intle:32=23')
             assert pack('@L', 23) == BitStream('uintle:32=23')
+            assert pack('@i', 23) == BitStream('intle:32=23')
+            assert pack('@I', 23) == BitStream('uintle:32=23')
             assert pack('@q', 23) == BitStream('intle:64=23')
             assert pack('@Q', 23) == BitStream('uintle:64=23')
         else:
@@ -2526,23 +2532,25 @@ class TestSplit2:
             assert pack('@H', 23) == BitStream('uintbe:16=23')
             assert pack('@l', 23) == BitStream('intbe:32=23')
             assert pack('@L', 23) == BitStream('uintbe:32=23')
+            assert pack('@i', 23) == BitStream('intbe:32=23')
+            assert pack('@I', 23) == BitStream('uintbe:32=23')
             assert pack('@q', 23) == BitStream('intbe:64=23')
             assert pack('@Q', 23) == BitStream('uintbe:64=23')
 
     def test_native_endianness(self):
-        s = pack('=2L', 40, 40)
+        s = pack('=2i', 40, 40)
         if sys.byteorder == 'little':
-            assert s == pack('<2L', 40, 40)
+            assert s == pack('<2i', 40, 40)
         else:
             assert sys.byteorder == 'big'
-            assert s == pack('>2L', 40, 40)
+            assert s == pack('>2i', 40, 40)
 
     def test_struct_tokens3(self):
         s = pack('>hhl', 1, 2, 3)
         a, b, c = s.unpack('>hhl')
         assert (a, b, c) == (1, 2, 3)
         s = pack('<QL, >Q \tL', 1001, 43, 21, 9999)
-        assert s.unpack('<QL, >QL') == [1001, 43, 21, 9999]
+        assert s.unpack('<QI, >QL') == [1001, 43, 21, 9999]
 
     def test_struct_tokens_multiplicative_factors(self):
         s = pack('<2h', 1, 2)

bitstring-4.2.3/bitstring.egg-info/requires.txt

@@ -1 +0,0 @@
-bitarray<3.0.0,>=2.9.0