bool-hybrid-array 9.10.9__py3-none-any.whl → 9.10.21__py3-none-any.whl

bool_hybrid_array/int_array/__init__.py

@@ -0,0 +1,203 @@
+from __future__ import annotations
+from ..core import *
+import builtins
+
+class IntBitTag(BHA_bool, metaclass=ResurrectMeta):
+    def __str__(self):
+        return "'-1'" if (hasattr(self, 'is_sign_bit') and self.is_sign_bit and self) else "'1'" if self else "'0'"
+    __repr__ = __str__
+    __del__ = lambda self:self
+class IntHybridArray(BoolHybridArray):
+    def __init__(self, int_array: list[int], bit_length: int = 8):
+        self.bit_length = bit_length
+        bool_data = []
+        max_required_bits = 1
+        for num in int_array:
+            if num == 0:
+                required_bits = 1
+            else:
+                abs_num = abs(num)
+                num_bits_needed = abs_num.bit_length()
+                required_bits = 1 + num_bits_needed
+            if required_bits > max_required_bits:
+                max_required_bits = required_bits
+        self.bit_length = max_required_bits
+        for num in int_array:
+            if num >= 0:
+                sign_bit = False
+                num_bits = [bool((num >> i) & 1) for i in range(self.bit_length - 1)]
+            else:
+                sign_bit = True
+                abs_num = abs(num)
+                num_bits = [not bool((abs_num >> i) & 1) for i in range(self.bit_length - 1)]
+                carry = 1
+                for j in range(len(num_bits)):
+                    if carry:
+                        num_bits[j] = not num_bits[j]
+                        carry = 0 if num_bits[j] else 1
+            bool_data.append(sign_bit)
+            bool_data.extend(num_bits)
+        self.total_bits = len(bool_data)
+        super().__init__(0, self.total_bits, False, IntBitTag, False)
+        for idx in range(self.total_bits):
+            if idx < self.size:
+                super().__setitem__(idx, bool_data[idx])
+            else:
+                super().append(bool_data[idx])
+        for i in range(0, self.total_bits, self.bit_length):
+            if i < self.size:
+                bit_tag = super().__getitem__(i)
+                bit_tag.is_sign_bit = True
+
+    def to_int(self, bit_chunk):
+        sign_bit = bit_chunk[0].value
+        num_bits = [bit.value for bit in bit_chunk[1:]]
+        if not sign_bit:
+            num = 0
+            for j in range(len(num_bits)):
+                if num_bits[j]:
+                    num += (1 << j)
+        else:
+            num_bits_inv = [not b for b in num_bits]
+            carry = 1
+            for j in range(len(num_bits_inv)):
+                if carry:
+                    num_bits_inv[j] = not num_bits_inv[j]
+                    carry = 0 if num_bits_inv[j] else 1
+            num = 0
+            for j in range(len(num_bits_inv)):
+                if num_bits_inv[j]:
+                    num += (1 << j)
+            num = -num
+        return num
+
+    def __getitem__(self, key):
+        if isinstance(key, slice):
+            start, stop, step = key.indices(len(self))
+            result = []
+            for i in range(start, stop, step):
+                block_start = i * self.bit_length
+                block_end = block_start + self.bit_length
+                if block_end > self.size:
+                    raise IndexError("索引超出范围")
+                bit_chunk = [super().__getitem__(j) for j in range(block_start, block_end)]
+                num = self.to_int(bit_chunk)
+                result.append(num)
+            return IntHybridArray(result, self.bit_length)
+        key = key if key >= 0 else key + len(self)
+        if not (0 <= key < len(self)):
+            raise IndexError("索引超出范围")
+        block_start = key * self.bit_length
+        block_end = block_start + self.bit_length
+        if block_end > self.size:
+            raise IndexError("索引超出范围")
+        bit_chunk = [super().__getitem__(j) for j in range(block_start, block_end)]
+        return self.to_int(bit_chunk)
+
+    def __setitem__(self, key, value):
+        value = int(value)
+        if isinstance(key, slice):
+            start, stop, step = key.indices(len(self))
+            values = list(value) if isinstance(value, (list, tuple, IntHybridArray)) else [value] * ((stop - start + step - 1) // step)
+            idx = 0
+            for int_idx in range(start, stop, step):
+                block_start = int_idx * self.bit_length
+                block_end = block_start + self.bit_length
+                if block_end > self.size:
+                    raise IndexError("索引超出范围")
+                num = values[idx % len(values)]
+                if num >= 0:
+                    sign_bit = False
+                    num_bits = [bool((num >> i) & 1) for i in range(self.bit_length - 1)]
+                else:
+                    sign_bit = True
+                    abs_num = abs(num)
+                    num_bits = [not bool((abs_num >> i) & 1) for i in range(self.bit_length - 1)]
+                    carry = 1
+                    for j in range(len(num_bits)):
+                        if carry:
+                            num_bits[j] = not num_bits[j]
+                            carry = 0 if num_bits[j] else 1
+                bool_data = [sign_bit] + num_bits
+                for bit_idx in range(self.bit_length):
+                    super().__setitem__(block_start + bit_idx, bool_data[bit_idx])
+                idx += 1
+            return
+        key = key if key >= 0 else key + len(self)
+        if not (0 <= key < len(self)):
+            raise IndexError("索引超出范围")
+        block_start = key * self.bit_length
+        block_end = block_start + self.bit_length
+        if block_end > self.size:
+            raise IndexError("索引超出范围")
+        num = value
+        if num >= 0:
+            sign_bit = False
+            num_bits = [bool((num >> i) & 1) for i in range(self.bit_length - 1)]
+        else:
+            sign_bit = True
+            abs_num = abs(num)
+            num_bits = [not bool((abs_num >> i) & 1) for i in range(self.bit_length - 1)]
+            carry = 1
+            for j in range(len(num_bits)):
+                if carry:
+                    num_bits[j] = not num_bits[j]
+                    carry = 0 if num_bits[j] else 1
+        bool_data = [sign_bit] + num_bits
+        for bit_idx in range(self.bit_length):
+            super().__setitem__(block_start + bit_idx, bool_data[bit_idx])
+
+    def __iter__(self):
+        for i in range(0, self.total_bits, self.bit_length):
+            if i + self.bit_length > self.size:
+                break
+            bit_chunk = [super().__getitem__(j) for j in range(i, i + self.bit_length)]
+            yield self.to_int(bit_chunk)
+
+    def __str__(self):
+        return f"IntHybridArray([{', '.join(map(str, self))}])"
+    __repr__ = __str__
+
+    def __len__(self):
+        return self.total_bits // self.bit_length
+    def __delitem__(self, index: int = -1):
+        index = index if index >= 0 else index + len(self)
+        if not (0 <= index < len(self)):
+            raise IndexError("删除索引超出范围")
+        target_num = self[index]
+        pop_bit_start = index * self.bit_length
+        pop_bit_end = pop_bit_start + self.bit_length
+        for _ in range(self.bit_length):
+            super().__delitem__(pop_bit_start)
+        self.total_bits -= self.bit_length
+    def index(self, value):
+        value = int(value)
+        x = f"{value} 不在 IntHybridArray 中"
+        for idx in range(len(self)+2>>2):
+            if self[idx] == value:
+                return idx
+            elif self[-idx] == value:
+                x = len(self)-idx
+        if x != f"{value} 不在 IntHybridArray 中":
+            return x
+        raise ValueError(x)
+    def rindex(self, value):
+        value = int(value)
+        x = f"{value} 不在 IntHybridArray 中"
+        for idx in range(len(self)+2>>2):
+            if self[-idx] == value:
+                return -idx
+            elif self[idx] == value:
+                x = -(len(self)-idx)
+        if x != f"{value} 不在 IntHybridArray 中":
+            return x
+        raise ValueError(x)
+    def extend(self, iterable:Iterable) -> None:
+        if isinstance(iterable, (Iterator, Generator, map)):
+            iterable,copy = itertools.tee(iterable, 2)
+            len_ = sum(1 for _ in copy)
+        else:
+            len_ = len(iterable)
+        self.total_bits += len_*self.bit_length
+        for i,j in zip(range(len_),iterable):
+            self[-i-1] = j

bool_hybrid_array//321/207/320/267/320/250/321/205/320/277/320/226.md

@@ -0,0 +1,2 @@
+# **作者的秘密：我才10岁！！！**
+

{bool_hybrid_array-9.10.9.dist-info → bool_hybrid_array-9.10.21.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: bool-hybrid-array
-Version: 9.10.9
+Version: 9.10.21
 Summary: 一个高效的布尔数组（密集+稀疏混合存储，节省内存）
 Home-page: https://github.com/BKsell/bool-hybrid-array
 Author: 蔡靖杰
@@ -10,12 +10,20 @@ Project-URL: GitHub 中文镜像, https://www.github-zh.com/projects/1083175506-
 Project-URL: Issue 反馈（主站）, https://github.com/BKsell/bool-hybrid-array/issues
 Keywords: boolean array,compact storage
 Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.8
+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: Programming Language :: Python :: 3.14
 Classifier: License :: OSI Approved :: MIT License
 Classifier: Operating System :: OS Independent
 Requires-Python: >=3.8
 Description-Content-Type: text/markdown
 License-File: LICENSE
 Requires-Dist: numpy>=1.19.0
+Provides-Extra: int-array
 Dynamic: author
 Dynamic: author-email
 Dynamic: classifier
@@ -25,6 +33,7 @@ Dynamic: home-page
 Dynamic: keywords
 Dynamic: license-file
 Dynamic: project-url
+Dynamic: provides-extra
 Dynamic: requires-dist
 Dynamic: requires-python
 Dynamic: summary
@@ -384,6 +393,24 @@ BoolHybridArr([False,False,False,False,True,True,False,True,True,False]),
 try:numba_opt()
 except:print("请先安装numba库！！！")
 
+#int_array模块（9.10.10新增）：
+
+max_num = (1 << 256) - 1
+min_num = -max_num
+
+# 1. IntHybridArray：257位完美存储
+arr_hybrid = int_array.IntHybridArray([max_num, min_num, 123456], bit_length=257)
+print("✅ IntHybridArray存储结果：")
+print(f"最大值：{arr_hybrid[0]}")
+print(f"最小值：{arr_hybrid[1]}")
+
+# 2. NumPy：用最大的int64尝试存储（必然失败）
+try:
+    arr_np = np.array([max_num, min_num, 123456], dtype=np.int64)
+    print("\n❌ NumPy存储结果：", arr_np)
+except OverflowError as e:
+    print(f"\n❌ NumPy存储失败：{e}")
+
 ```
 
 ## 性能优势
@@ -397,7 +424,7 @@ except:print("请先安装numba库！！！")
 
 ## 版本历史
 
-* **7.8.13**：PyPI上的初始版本，支持基本功能和自动存储优化
+- **7.8.13**：PyPI上的初始版本，支持基本功能和自动存储优化
 * **7.9.0**：添加TruesArray和FalsesArray
 * **7.9.1**：修复介绍的bug，增加copy功能
 * **7.9.2**：新增find()方法
@@ -439,7 +466,7 @@ except:print("请先安装numba库！！！")
 * **7.14.4**：修复in的错误×3
 * **7.14.5**：修复in的错误×4
 * **7.14.6**：优化arr.large的类型
-* **8.0.0**：兼容numpy数组
+- **8.0.0**：兼容numpy数组
 * **8.0.1**：修复8.0.0兼容numpy数组时没有形状参数的问题
 * **8.0.2**：移除bool_hybrid_dtype，改用object
 * **8.1.0**：利用ctypes加速密集部分的一些方法
@@ -451,7 +478,7 @@ except:print("请先安装numba库！！！")
 * **8.2.0**：支持哈希
 * **8.2.1**：修复8.2.0版本中的NameError
 * **8.2.2**：修复8.2.1版本中的IndexError
-* **9.0.0**：详情见上
+- --9.0.0--：详情见上
 * **9.0.1**：小更新，优化optimize方法
 * **9.1.0**：新增二维数组的optimize与memory\_usage，优化二维数组的位运算，给BHA\_Bool新增__rand__、**ror**、__rxor__等等
 * **9.1.1**：修复9.1.0版本中的TypeError: unsupported operand type(s) for +: 'int' and 'method'错误
@@ -528,9 +555,22 @@ except:print("请先安装numba库！！！")
 * **9.10.7**：修复了RecursionError: maximum recursion depth exceeded错误
 * **9.10.8**：给Create_BHA新增了mmap优化
 * **9.10.9**：修复9.10.8版本中的NameError错误
-
-
-
+* **9.10.10**：新增int_array模块
+* **9.10.11**：修复NameError: name 'int_array' is not defined. Did you mean: 'bytearray'?的错误
+* **9.10.12**：把find方法的返回值改为IntHybridArray
+* **9.10.13**：给IntHybridArray新增多种列表操作
+* **9.10.14**：修复IntHybridArray中因单个 0 导致所有数字位长被压缩到 1的问题
+* **9.10.15**：修复IntHybridArray变成布尔数组的错误
+* **9.10.16**：新增Python 3.14时的jit优化加速
+* **9.10.17**：给保护字典添加__import__方法，支持from导入
+* **9.10.18**：新增BoolHybridArray的序列化和反序列化支持
+* **9.10.18.post1**：修复TypeError: cannot pickle 'itertools._tee' object错误
+* **9.10.18.post2**：尝试修复“满屏错误”的问题
+* **9.10.18.post3**：尝试修复“满屏错误”的问题×2
+* **9.10.18.post4**：尝试修复“满屏错误”的问题×3
+* **9.10.19**：和9.10.18.post4相同，正式版本发布
+* **9.10.20**：优化性能，增加BHA_jit_log日志
+* **9.10.21**：优化Ask_BHA，移除BHA_jit_log日志
 
 
 ## **彩蛋：**

bool_hybrid_array-9.10.21.dist-info/RECORD

@@ -0,0 +1,10 @@
+bool_hybrid_array/__init__.py,sha256=r04Lq3_vRUkxPYT4oLIz8wLBhbRP70UvXGQKMpt8tps,955
+bool_hybrid_array/__main__.py,sha256=3MsUAXMj6Pe1EzP7YreuUePbXZeQvFSCnejnTeS42kU,8324
+bool_hybrid_array/core.py,sha256=MNxYpZdtY36ElBbdqYjNUp1fJwYEHSTsc1Y323Cytro,37984
+bool_hybrid_array/秘密.md,sha256=Ii2NvXmv-Ktu04zJsGLcQZvlzT4gOatByE4B2wTK1Ks,48
+bool_hybrid_array/int_array/__init__.py,sha256=acjFchFu3k9CQndDbvKfSIyfMMAbgprz8Skf1a4_dKY,8578
+bool_hybrid_array-9.10.21.dist-info/licenses/LICENSE,sha256=Sg4rnGXkBDYkwJCWyxdWp5H60rhVAxpNvFh_l3JWZdY,1070
+bool_hybrid_array-9.10.21.dist-info/METADATA,sha256=k037Kzz3zMnTbD-zaIfSacesqeVIThAW2Eu6_AlEiXk,23491
+bool_hybrid_array-9.10.21.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+bool_hybrid_array-9.10.21.dist-info/top_level.txt,sha256=vk-TD77wuVQsN1rJ6uVWZX4sC_wya_WplRDwQKJoBZM,18
+bool_hybrid_array-9.10.21.dist-info/RECORD,,

bool_hybrid_array-9.10.9.dist-info/RECORD

@@ -1,8 +0,0 @@
-bool_hybrid_array/__init__.py,sha256=HFRGhLIvAvAwzL-DpDyseAv9FI__5jI3MAdXJ_o2zd4,756
-bool_hybrid_array/__main__.py,sha256=pE9jECC2i2_13HJnI3qPav1YaggfUs-gdScabvRpD9I,7728
-bool_hybrid_array/core.py,sha256=_E5kG6NjqYdV4KSkDxbO7R9tXOz22_GXPA-TQq6Bzlo,36485
-bool_hybrid_array-9.10.9.dist-info/licenses/LICENSE,sha256=Sg4rnGXkBDYkwJCWyxdWp5H60rhVAxpNvFh_l3JWZdY,1070
-bool_hybrid_array-9.10.9.dist-info/METADATA,sha256=Kpl_1o--9_Ytg7spjkCVDakUG6bDpiPuFPtBpKYWmvs,21400
-bool_hybrid_array-9.10.9.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-bool_hybrid_array-9.10.9.dist-info/top_level.txt,sha256=vk-TD77wuVQsN1rJ6uVWZX4sC_wya_WplRDwQKJoBZM,18
-bool_hybrid_array-9.10.9.dist-info/RECORD,,