bool-hybrid-array 9.10.10__py3-none-any.whl → 9.11.1__py3-none-any.whl

bool_hybrid_array/int_array/__init__.py

@@ -1,12 +1,12 @@
-from .bool_hybrid_array import *
+# -*- coding: utf-8 -*-
+from __future__ import annotations
+from ..core import *
 import builtins
-
-
-class IntBitTag(BHA_Bool, metaclass=ResurrectMeta):
+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
@@ -37,13 +37,17 @@ class IntHybridArray(BoolHybridArray):
                         carry = 0 if num_bits[j] else 1
             bool_data.append(sign_bit)
             bool_data.extend(num_bits)
-        temp_arr = BoolHybridArr(bool_data, Type=IntBitTag)
-        super().__init__(temp_arr.split_index, temp_arr.size, temp_arr.is_sparse, temp_arr.Type, False)
-        for idx in range(temp_arr.size):
-            self[idx] = temp_arr[idx].value
-        for i in range(0, self.size, self.bit_length):
+        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:
-                self[i].is_sign_bit = True
+                bit_tag = super().__getitem__(i)
+                bit_tag.is_sign_bit = True
 
     def to_int(self, bit_chunk):
         sign_bit = bit_chunk[0].value
@@ -72,21 +76,22 @@ class IntHybridArray(BoolHybridArray):
             start, stop, step = key.indices(len(self))
             result = []
             for i in range(start, stop, step):
-                block_idx = i // self.bit_length
-                bit_idx_in_block = i % self.bit_length
-                block_start = block_idx * self.bit_length
+                block_start = i * self.bit_length
                 block_end = block_start + self.bit_length
-                bit_chunk = [self[j] for j in range(block_start, block_end)]
+                if block_end > self.size:
+                    raise IndexError("索引超出范围")
+                bit_chunk = [super(self.__class__, self).__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_idx = key // self.bit_length
-        block_start = block_idx * self.bit_length
+        block_start = key * self.bit_length
         block_end = block_start + self.bit_length
-        bit_chunk = [self[j] for j in range(block_start, block_end)]
+        if block_end > self.size:
+            raise IndexError("索引超出范围")
+        bit_chunk = [super(self.__class__, self).__getitem__(j) for j in range(block_start, block_end)]
         return self.to_int(bit_chunk)
 
     def __setitem__(self, key, value):
@@ -95,16 +100,36 @@ class IntHybridArray(BoolHybridArray):
             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 i in range(start, stop, step):
-                self[i] = values[idx % len(values)]
+            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_idx = key // self.bit_length
-        block_start = block_idx * self.bit_length
-        bool_data = []
+        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
@@ -118,28 +143,52 @@ class IntHybridArray(BoolHybridArray):
                 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)
-        for idx in range(self.bit_length):
-            self[block_start + idx] = bool_data[idx]
+        bool_data = [sign_bit] + num_bits
+        for bit_idx in range(self.bit_length):
+            super(self.__class__, self).__setitem__(block_start + bit_idx, bool_data[bit_idx])
 
     def __iter__(self):
-        for i in range(0, self.size, self.bit_length):
-            bit_chunk = [self[j] for j in range(i, i + self.bit_length)]
-            yield self.to_int(bit_chunk)
+        return map(self.__getitem__,range(len(self)))
 
     def __str__(self):
         return f"IntHybridArray([{', '.join(map(str, self))}])"
+    __repr__ = __str__
 
     def __len__(self):
-        return self.size // self.bit_length
-builtins.IntHybridArray = IntHybridArray
-if __name__ == "__main__":
-    test = [0, 10, -5, 31, 32768, -65536]
-    arr = IntHybridArray(test)
-    print(arr)
-    print(arr[2])
-    arr[3] = -100
-    print(arr)
-    print(list(arr))
-    print(arr[1:4])
+        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)+1>>1):
+            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)+1>>1):
+            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 append(self,v):
+        self.self.total_bits += self.bit_length
+        self[-1] = v
+__all__ = list(globals())

{bool_hybrid_array-9.10.10.dist-info → bool_hybrid_array-9.11.1.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: bool-hybrid-array
-Version: 9.10.10
+Version: 9.11.1
 Summary: 一个高效的布尔数组（密集+稀疏混合存储，节省内存）
 Home-page: https://github.com/BKsell/bool-hybrid-array
 Author: 蔡靖杰
@@ -16,6 +16,10 @@ 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: Programming Language :: Python :: 3 :: Only
+Classifier: Programming Language :: Python :: Implementation :: CPython
+Classifier: Programming Language :: Python :: Implementation :: PyPy
 Classifier: License :: OSI Approved :: MIT License
 Classifier: Operating System :: OS Independent
 Requires-Python: >=3.8
@@ -23,6 +27,8 @@ Description-Content-Type: text/markdown
 License-File: LICENSE
 Requires-Dist: numpy>=1.19.0
 Provides-Extra: int-array
+Provides-Extra: numba-opt
+Requires-Dist: numba>=0.55.0; extra == "numba-opt"
 Dynamic: author
 Dynamic: author-email
 Dynamic: classifier
@@ -39,10 +45,17 @@ Dynamic: summary
 
 # BoolHybridArray：高效的布尔混合数组库
 
+<!-- 月下载量（核心推荐）+ 周下载量 + 总下载量 -->
+[![月下载量](https://static.pepy.tech/badge/bool-hybrid-array/month)](https://pepy.tech/project/bool-hybrid-array)
+[![周下载量](https://static.pepy.tech/badge/bool-hybrid-array/week)](https://pepy.tech/project/bool-hybrid-array)
+[![总下载量](https://static.pepy.tech/badge/bool-hybrid-array)](https://pepy.tech/project/bool-hybrid-array)
+
 一个专为布尔值优化的数组类，能够根据数据特征自动在密集存储和稀疏存储模式间切换，兼顾性能和内存效率。
 
 ## ***注：大版本号更新并非不兼容更新，而是重大更新***
 
+注：当API完全稳定时就会发布版本规则较严谨的new-1.0.0版本，预期为10.x版本结束后
+
 ***注意：目前社区中若存在名称类似（如包含 “bool-hybrid-array”+ 后缀、boolean\_array、validate.io-boolean-array）的库，均与本项目（bool-hybrid-array）无关联，本项目的所有功能设计、代码实现均为独立开发；***
 ***其他平台里的类似名库绝不是我的库***
 
@@ -140,7 +153,7 @@ big_arr = BoolHybridArr([i % 100 == 0 for i in range(10000)])
 
 # 查看存储模式（此时应为稀疏模式）
 
-print(repr(big_arr))  # 输出: BoolHybridArray(split_index=100,size=10000,is_sparse=True,small_len=100,large_len=)不好意思large_len我不知道
+print(repr(big_arr))  # 输出: BoolHybridArray(split_index=100, size=10000, is_sparse=True, small_len=101, large_len=98)
 
 # 自动优化存储
 
@@ -394,7 +407,21 @@ except:print("请先安装numba库！！！")
 
 #int_array模块（9.10.10新增）：
 
-arr = int_array.IntHybridArray([100,-27623,18276,-32165])
+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}")
 
 ```
 
@@ -409,7 +436,7 @@ arr = int_array.IntHybridArray([100,-27623,18276,-32165])
 
 ## 版本历史
 
-* **7.8.13**：PyPI上的初始版本，支持基本功能和自动存储优化
+- **7.8.13**：PyPI上的初始版本，支持基本功能和自动存储优化
 * **7.9.0**：添加TruesArray和FalsesArray
 * **7.9.1**：修复介绍的bug，增加copy功能
 * **7.9.2**：新增find()方法
@@ -451,7 +478,7 @@ arr = int_array.IntHybridArray([100,-27623,18276,-32165])
 * **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加速密集部分的一些方法
@@ -463,7 +490,7 @@ arr = int_array.IntHybridArray([100,-27623,18276,-32165])
 * **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'错误
@@ -541,6 +568,25 @@ arr = int_array.IntHybridArray([100,-27623,18276,-32165])
 * **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日志
+* **9.10.22**：进一步优化Ask_BHA的性能
+* **9.11.0**：新增对7.3.10以上版本的PyPy解释器的支持
+* **9.11.1**：修复PyPy解释器下的保护机制过度保护bug
+
 
 
 
@@ -558,7 +604,11 @@ arr = int_array.IntHybridArray([100,-27623,18276,-32165])
 * A：BoolHybridArray是本库中的**核心类**，所有函数都是围绕他进行的，但需要`split_index`,`size`,`is_sparse`；
   BoolHybridArr是一个**函数**，用于把一个可迭代对象转为`BoolHybridArray`类
 * Q：为什么不建议把太大的本类型数组打印？
-* A：虽然本类型数组省内存，但字符串不省内存，一个`True`要4字节，一个`False`要5字节，连逗号都要占1字节（`numpy.ndarray`：我都比字符串省内存）
+* A：虽然BoolHybridArray类型数组省内存，但字符串不省内存，一个`True`要4字节，一个`False`要5字节，连逗号都要占1字节（`numpy.ndarray`：我都比字符串省内存）
+- Q：为什么使用在Windows终端使用PyPy时建议先调用`chcp 65001`再启动PyPy？
+* A：因为本库有很多的的中文报错和打印，项目里也可能会有。Windows终端里的PyPy默认是GBK编码，有中文时会乱码。chcp 65001可以切换到UTF-8编码，防止乱码。
+
+
 
 ## 源代码和原理
 

bool_hybrid_array-9.11.1.dist-info/RECORD

@@ -0,0 +1,10 @@
+bool_hybrid_array/__init__.py,sha256=MEv3Ygh5XtBGxhu6oQICjkWyWSFUkU3xIyZSn0RKYDY,1038
+bool_hybrid_array/__main__.py,sha256=3bnJ2IQctrXWQ1WyBQvh1w882_k3b84LGLL8yUNkXws,8447
+bool_hybrid_array/core.py,sha256=nZbzHWLQhQpsQ1YVgqyvcw3znKlEZZA4QrSiSraOJN8,39343
+bool_hybrid_array/秘密.md,sha256=Ii2NvXmv-Ktu04zJsGLcQZvlzT4gOatByE4B2wTK1Ks,48
+bool_hybrid_array/int_array/__init__.py,sha256=KejzB6xqUjLkoDhihrtyoBXL_Rqom1XBIDtXpQeIQEg,8192
+bool_hybrid_array-9.11.1.dist-info/licenses/LICENSE,sha256=Sg4rnGXkBDYkwJCWyxdWp5H60rhVAxpNvFh_l3JWZdY,1070
+bool_hybrid_array-9.11.1.dist-info/METADATA,sha256=42nd7b4N11jcmkzdp0Y0o0jx5FMGpkJnJmnbSOiU49Y,24794
+bool_hybrid_array-9.11.1.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+bool_hybrid_array-9.11.1.dist-info/top_level.txt,sha256=vk-TD77wuVQsN1rJ6uVWZX4sC_wya_WplRDwQKJoBZM,18
+bool_hybrid_array-9.11.1.dist-info/RECORD,,

bool_hybrid_array-9.10.10.dist-info/RECORD

@@ -1,10 +0,0 @@
-bool_hybrid_array/__init__.py,sha256=Ge5xU9hWokXo6_tOEychWsFtuCSM2ttCbTXIAVpAsBc,757
-bool_hybrid_array/__main__.py,sha256=pE9jECC2i2_13HJnI3qPav1YaggfUs-gdScabvRpD9I,7728
-bool_hybrid_array/core.py,sha256=zcqPqb6AhUFqzb0PPXQtisXpXc2Zd50Xsh8ooOvpwO0,36526
-bool_hybrid_array/秘密.md,sha256=Ii2NvXmv-Ktu04zJsGLcQZvlzT4gOatByE4B2wTK1Ks,48
-bool_hybrid_array/int_array/__init__.py,sha256=S1bG3kmeRqNkAbChCudxP_zAWBVbMJwvOKi39kYt-Rw,5766
-bool_hybrid_array-9.10.10.dist-info/licenses/LICENSE,sha256=Sg4rnGXkBDYkwJCWyxdWp5H60rhVAxpNvFh_l3JWZdY,1070
-bool_hybrid_array-9.10.10.dist-info/METADATA,sha256=5v3IJIUYsCVkXhjgzWDsS_8H4T8XZF9L0c6z96X4Y6M,21905
-bool_hybrid_array-9.10.10.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-bool_hybrid_array-9.10.10.dist-info/top_level.txt,sha256=vk-TD77wuVQsN1rJ6uVWZX4sC_wya_WplRDwQKJoBZM,18
-bool_hybrid_array-9.10.10.dist-info/RECORD,,