bool-hybrid-array 9.11.0__py3-none-any.whl → 9.11.2__py3-none-any.whl

bool_hybrid_array/__init__.py

@@ -5,7 +5,7 @@ from . import core
 from .core import __builtins__,builtins
 try:from . import int_array
 except:pass
-__version__ = "9.11.0"
+__version__ = "9.11.2"
 public_objects = []
 for name in dir(core):
     if not name.startswith("_"):

bool_hybrid_array/__main__.py

@@ -274,10 +274,12 @@ 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)
+arr_hybrid = int_array.IntHybridArray([max_num, min_num, 123456, 1], bit_length=257)
 print("✅ IntHybridArray存储结果：")
 print(f"最大值：{arr_hybrid[0]}")
 print(f"最小值：{arr_hybrid[1]}")
+print(f"整个数组：{arr_hybrid}")
+
 
 # 2. NumPy：用最大的int64尝试存储（必然失败）
 try:

bool_hybrid_array/core.py

@@ -241,7 +241,7 @@ class BoolHybridArray(MutableSequence,Exception,metaclass=ResurrectMeta):
                     if pos < len(self.large):
                         del self.large[pos]
                 return None
-    def __getitem__(self, key:int|slice) -> BoolHybridArray:
+    def __getitem__(self, key:int|slice = -1) -> BoolHybridArray:
         if isinstance(key, slice):
             start, stop, step = key.indices(self.size)
             return BoolHybridArr((self[i] for i in range(start, stop, step)),hash_ = self.hash_)
@@ -284,7 +284,7 @@ class BoolHybridArray(MutableSequence,Exception,metaclass=ResurrectMeta):
     def __repr__(self) -> str:
         return(f"BoolHybridArray(split_index={self.split_index}, size={self.size}, "
         +f"is_sparse={self.is_sparse}, small_len={len(self.small)}, large_len={len(self.large)})")
-    def __delitem__(self, key: int) -> None:
+    def __delitem__(self, key: int = -1) -> None:
         key = key if key >= 0 else key + self.size
         if not (0 <= key < self.size):
             raise IndexError(f"索引 {key} 超出范围 [0, {self.size})")
@@ -445,6 +445,12 @@ class BoolHybridArray(MutableSequence,Exception,metaclass=ResurrectMeta):
     def append(self,v):
         self.size += 1
         self[-1] = v
+    push = append
+    peek = __getitem__
+    top = property(peek)
+    front = property(lambda self:self[0])
+    rear = top
+    enqueue = push
     def index(self, value) -> int:
         if self.size == 0:
             raise ValueError('无法在空的 BoolHybridArray 中查找元素！')
@@ -524,6 +530,7 @@ class BoolHybridArray(MutableSequence,Exception,metaclass=ResurrectMeta):
         return arr
     def __reduce__(self):
         return BoolHybridArr,(np.asarray(self),self.is_sparse,self.Type,self.hash_,),
+    dequeue = lambda self:self.pop(0)
 class BoolHybridArr(BoolHybridArray,metaclass=ResurrectMeta):
     __module__ = 'bool_hybrid_array'
     def __new__(cls, lst: Iterable, is_sparse=None, Type = None, hash_ = True) -> BoolHybridArray:
@@ -702,6 +709,9 @@ class BHA_List(list,metaclass=ResurrectMeta):
             "对比numpy节省": f"{(1 - total / (temp + 96)) * 100:.6f}%"}
     def __iter__(self):
         return BHA_Iterator(super().__iter__())
+    def to_ascii_art(self, width=20):
+        art = '\n'.join([' '.join(['■' if j else ' '  for j in i]) for i in self])
+        return art
 class BHA_Iterator(Iterator,metaclass=ResurrectMeta):
     __module__ = 'bool_hybrid_array'
     def __init__(self,data):
@@ -738,7 +748,9 @@ class ProtectedBuiltinsDict(dict,metaclass=ResurrectMeta):
         self.name = name
         super().__setattr__("protected_names",protected_names)
     def __setitem__(self, name, value):
-        if not hasattr(self,"protected_names"):super().__setitem__(name, value)
+        if not hasattr(self,"protected_names"):
+            super().__setitem__(name, value)
+            return
         try:
             if name in ["T", "F"]:
                 current_T = self.get("T")
@@ -751,7 +763,9 @@ class ProtectedBuiltinsDict(dict,metaclass=ResurrectMeta):
             if name in self.protected_names and name not in ["T", "F"]:
                 print(f"警告：禁止修改内置常量 __{self.name}__['{name}']！")
                 raise AttributeError(f"禁止修改内置常量 __{self.name}__['{name}']")
-        except:pass
+        except:
+            if sys.implementation.name == 'cpython':
+                raise
         finally:super().__setitem__(name, value)
     def __delitem__(self, name):
         if name in self.protected_names:

bool_hybrid_array/int_array/__init__.py

@@ -95,58 +95,9 @@ class IntHybridArray(BoolHybridArray):
         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(self.__class__, self).__setitem__(block_start + bit_idx, bool_data[bit_idx])
-
+        tmp = lst(self)
+        tmp[key] = value
+        self.__dict__ = IntHybridArray(tmp)
     def __iter__(self):
         return map(self.__getitem__,range(len(self)))
 
@@ -197,4 +148,8 @@ class IntHybridArray(BoolHybridArray):
         self.total_bits += len_*self.bit_length
         for i,j in zip(range(len_),iterable):
             self[-i-1] = j
-__all__ = list(globals())
+    def append(self,value):
+        self.total_bits += self.bit_length
+        self.size = self.total_bits
+        self[-1] = value
+__all__ = tuple(globals())

{bool_hybrid_array-9.11.0.dist-info → bool_hybrid_array-9.11.2.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: bool-hybrid-array
-Version: 9.11.0
+Version: 9.11.2
 Summary: 一个高效的布尔数组（密集+稀疏混合存储，节省内存）
 Home-page: https://github.com/BKsell/bool-hybrid-array
 Author: 蔡靖杰
@@ -17,6 +17,7 @@ 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
@@ -26,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
@@ -42,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）无关联，本项目的所有功能设计、代码实现均为独立开发；***
 ***其他平台里的类似名库绝不是我的库***
 
@@ -143,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)
 
 # 自动优化存储
 
@@ -574,7 +584,9 @@ except OverflowError as e:
 * **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.0**：新增对7.3.10以上版本的PyPy解释器的支持
+* **9.11.1**：修复PyPy解释器下的保护机制过度保护bug
+* **9.11.2**：尝试修复IntHybridArray索引修改的错误
 
 
 

bool_hybrid_array-9.11.2.dist-info/RECORD

@@ -0,0 +1,10 @@
+bool_hybrid_array/__init__.py,sha256=e8WknVCXsaVgyryuKtc4uLs4T9A2ofqC-BPUg6sXu9Q,1038
+bool_hybrid_array/__main__.py,sha256=2HbnUEgExGwO6UoM6SIp5DNkx4zH0jWJZBU2eovuAic,8491
+bool_hybrid_array/core.py,sha256=WctTj1uhBxq4mKvUZGtQjECgNzalfMulvNa-uIXc9nc,39530
+bool_hybrid_array/秘密.md,sha256=Ii2NvXmv-Ktu04zJsGLcQZvlzT4gOatByE4B2wTK1Ks,48
+bool_hybrid_array/int_array/__init__.py,sha256=GwRHcOtU6SpVBtLQNrzbhcaZZ2p1PJqb2C0iTEjNBVA,6241
+bool_hybrid_array-9.11.2.dist-info/licenses/LICENSE,sha256=Sg4rnGXkBDYkwJCWyxdWp5H60rhVAxpNvFh_l3JWZdY,1070
+bool_hybrid_array-9.11.2.dist-info/METADATA,sha256=xrJCOoDQLiAisNRukO4QZahBRe5UimLlgo1Tw2EcUuU,24858
+bool_hybrid_array-9.11.2.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+bool_hybrid_array-9.11.2.dist-info/top_level.txt,sha256=vk-TD77wuVQsN1rJ6uVWZX4sC_wya_WplRDwQKJoBZM,18
+bool_hybrid_array-9.11.2.dist-info/RECORD,,

bool_hybrid_array-9.11.0.dist-info/RECORD

@@ -1,10 +0,0 @@
-bool_hybrid_array/__init__.py,sha256=LG4gW4LcOkLDZFgS4fawE2Ztk4cOqm65GXamiHJjLCo,1038
-bool_hybrid_array/__main__.py,sha256=3bnJ2IQctrXWQ1WyBQvh1w882_k3b84LGLL8yUNkXws,8447
-bool_hybrid_array/core.py,sha256=kx023cSTOkN2aK2GJ9E33EQLfZUrXpNEP77eBWRVsRo,39081
-bool_hybrid_array/秘密.md,sha256=Ii2NvXmv-Ktu04zJsGLcQZvlzT4gOatByE4B2wTK1Ks,48
-bool_hybrid_array/int_array/__init__.py,sha256=1TN2O461-Mso4yZ6YFkhHcdNxgPPQYBJ0PzkWdkpFC8,8478
-bool_hybrid_array-9.11.0.dist-info/licenses/LICENSE,sha256=Sg4rnGXkBDYkwJCWyxdWp5H60rhVAxpNvFh_l3JWZdY,1070
-bool_hybrid_array-9.11.0.dist-info/METADATA,sha256=NZ05bIUnF0ql-pkT1NwF30l9LXhUpKTepi0p2cc69Dc,24081
-bool_hybrid_array-9.11.0.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-bool_hybrid_array-9.11.0.dist-info/top_level.txt,sha256=vk-TD77wuVQsN1rJ6uVWZX4sC_wya_WplRDwQKJoBZM,18
-bool_hybrid_array-9.11.0.dist-info/RECORD,,