bool-hybrid-array 9.11.3__tar.gz → 9.11.5__tar.gz

{bool_hybrid_array-9.11.3 → bool_hybrid_array-9.11.5}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: bool-hybrid-array
-Version: 9.11.3
+Version: 9.11.5
 Summary: 一个高效的布尔数组（密集+稀疏混合存储，节省内存）
 Home-page: https://github.com/BKsell/bool-hybrid-array
 Author: 蔡靖杰
@@ -423,6 +423,27 @@ try:
 except OverflowError as e:
     print(f"\n❌ NumPy存储失败：{e}")
 
+#BHA_Queue（9.11.15版本新增）
+
+q = BHA_Queue([T, F, T, T, F])
+
+print(f"初始化队列: {q}")  # 输出：BHA_Queue([T,F,T,T,F])
+
+q.enqueue(T)
+
+q.enqueue(F)
+
+print(f"入队2个元素后: {q}")  # 输出：BHA_Queue([T,F,T,T,F,T,F])
+
+# 3. 出队（dequeue，均摊O(1)，仅首次触发转移）
+
+print(f"第一次出队: {q.dequeue()}")  # 输出：T（触发 self.a → self.b 转移，仅1次）
+
+print(f"第二次出队: {q.dequeue()}")  # 输出：F（直接从 self.b 弹出，纯O(1)）
+
+print(f"出队2个元素后: {q}")  # 输出：BHA_Queue([T,T,F,T,F])
+
+
 ```
 
 ## 性能优势
@@ -490,7 +511,7 @@ except OverflowError as e:
 * **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'错误
@@ -588,7 +609,8 @@ except OverflowError as e:
 * **9.11.1**：修复PyPy解释器下的保护机制过度保护bug
 * **9.11.2**：尝试修复IntHybridArray索引修改的错误
 * **9.11.3**：修复NameError: name 'lst' is not defined. Did you mean: 'list'?错误
-
+* **9.11.4**：修复TypeError: __dict__ must be set to a dictionary, not a 'IntHybridArray'的错误
+* **9.11.5**：新增BHA_Queue双栈实现队列
 
 
 

{bool_hybrid_array-9.11.3 → bool_hybrid_array-9.11.5}/README.md

@@ -378,6 +378,27 @@ try:
 except OverflowError as e:
     print(f"\n❌ NumPy存储失败：{e}")
 
+#BHA_Queue（9.11.15版本新增）
+
+q = BHA_Queue([T, F, T, T, F])
+
+print(f"初始化队列: {q}")  # 输出：BHA_Queue([T,F,T,T,F])
+
+q.enqueue(T)
+
+q.enqueue(F)
+
+print(f"入队2个元素后: {q}")  # 输出：BHA_Queue([T,F,T,T,F,T,F])
+
+# 3. 出队（dequeue，均摊O(1)，仅首次触发转移）
+
+print(f"第一次出队: {q.dequeue()}")  # 输出：T（触发 self.a → self.b 转移，仅1次）
+
+print(f"第二次出队: {q.dequeue()}")  # 输出：F（直接从 self.b 弹出，纯O(1)）
+
+print(f"出队2个元素后: {q}")  # 输出：BHA_Queue([T,T,F,T,F])
+
+
 ```
 
 ## 性能优势
@@ -445,7 +466,7 @@ except OverflowError as e:
 * **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'错误
@@ -543,7 +564,8 @@ except OverflowError as e:
 * **9.11.1**：修复PyPy解释器下的保护机制过度保护bug
 * **9.11.2**：尝试修复IntHybridArray索引修改的错误
 * **9.11.3**：修复NameError: name 'lst' is not defined. Did you mean: 'list'?错误
-
+* **9.11.4**：修复TypeError: __dict__ must be set to a dictionary, not a 'IntHybridArray'的错误
+* **9.11.5**：新增BHA_Queue双栈实现队列
 
 
 

{bool_hybrid_array-9.11.3 → bool_hybrid_array-9.11.5}/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.3"
+__version__ = "9.11.5"
 public_objects = []
 for name in dir(core):
     if not name.startswith("_"):
@@ -18,7 +18,7 @@ globals().update({
     for name in public_objects
 })
 try:
-    sys.modules[__name__] = ProtectedBuiltinsDict(globals())
+    sys.modules[__name__] =  ProtectedBuiltinsDict(globals())
     sys.modules[__name__].name = __name__
     sys.modules[__name__+'.core'] = ProtectedBuiltinsDict(core.__dict__,name = f'{__name__}.core')
     __dict__ = ProtectedBuiltinsDict(globals())

{bool_hybrid_array-9.11.3 → bool_hybrid_array-9.11.5}/bool_hybrid_array/__main__.py

@@ -288,3 +288,24 @@ try:
 except OverflowError as e:
     print(f"\n❌ NumPy存储失败：{e}")
 
+
+#BHA_Queue（9.11.15版本新增）
+
+q = BHA_Queue([T, F, T, T, F])
+
+print(f"初始化队列: {q}")  # 输出：BHA_Queue([T,F,T,T,F])
+
+q.enqueue(T)
+
+q.enqueue(F)
+
+print(f"入队2个元素后: {q}")  # 输出：BHA_Queue([T,F,T,T,F,T,F])
+
+# 3. 出队（dequeue，均摊O(1)，仅首次触发转移）
+
+print(f"第一次出队: {q.dequeue()}")  # 输出：T（触发 self.a → self.b 转移，仅1次）
+
+print(f"第二次出队: {q.dequeue()}")  # 输出：F（直接从 self.b 弹出，纯O(1)）
+
+print(f"出队2个元素后: {q}")  # 输出：BHA_Queue([T,T,F,T,F])
+

{bool_hybrid_array-9.11.3 → bool_hybrid_array-9.11.5}/bool_hybrid_array/core.py

@@ -484,8 +484,8 @@ class BoolHybridArray(MutableSequence,Exception,metaclass=ResurrectMeta):
     def count(self, value) -> int:
         value = bool(value)
         return sum(v == value for v in self)
-    def optimize(self) -> None:
-        arr = BoolHybridArr(self)
+    def optimize(self,*a,**k) -> BoolHybridArray:
+        arr = BoolHybridArr(self,*a,**k)
         self.large,self.small,self.split_index,self.is_sparse = (arr.large,arr.small,
         arr.split_index,arr.is_sparse)
         gc.collect()
@@ -533,7 +533,7 @@ class BoolHybridArray(MutableSequence,Exception,metaclass=ResurrectMeta):
     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:
+    def __new__(cls, lst: Iterable = (), is_sparse=None, Type = None, hash_ = True, split_index = None) -> BoolHybridArray:
         a = isinstance(lst, (Iterator, Generator, map))
         if a:
             lst, copy1, copy2 = itertools.tee(lst, 3)
@@ -546,9 +546,10 @@ class BoolHybridArr(BoolHybridArray,metaclass=ResurrectMeta):
             return BoolHybridArray(0, 0, is_sparse=False if is_sparse is None else is_sparse)
         if is_sparse is None:
             is_sparse = true_count <= (size - true_count)
-        split_index = int(min(size * 0.8, math.sqrt(size) * 100))
-        split_index = math.isqrt(size) if true_count>size/3*2 or true_count<size/3 else max(split_index, 1)
-        split_index = int(split_index) if split_index < 150e+7*2 else int(145e+7*2)
+        if split_index == None:
+            split_index = int(min(size * 0.8, math.sqrt(size) * 100))
+            split_index = math.isqrt(size) if true_count>size/3*2 or true_count<size/3 else max(split_index, 1)
+            split_index = int(split_index) if split_index < 150e+7*2 else int(145e+7*2)
         arr = BoolHybridArray(split_index = split_index, size = size, is_sparse = is_sparse, Type = Type, hash_ = F)
         small_max_idx = min(split_index, size - 1)
         if a:
@@ -718,7 +719,7 @@ class BHA_Iterator(Iterator,metaclass=ResurrectMeta):
         self.data,self.copy_data = itertools.tee(iter(data),2)
     def __next__(self):
         try:return next(self.data)
-        except Exception as e:
+        except StopIteration as e:
             self.__init__(self.copy_data)
             raise e
     def __iter__(self):
@@ -738,7 +739,7 @@ class ProtectedBuiltinsDict(dict,metaclass=ResurrectMeta):
                                 "TruesArray", "FalsesArray", "ProtectedBuiltinsDict", "builtins",
                                 "__builtins__", "__dict__","ResurrectMeta","math",
                                 "np","protected_names","BHA_Function",
-                                "__class__","Ask_BHA","Create_BHA","Ask_arr","numba_opt"),
+                                "__class__","Ask_BHA","Create_BHA","Ask_arr","numba_opt","bool_hybrid_array"),
                  name = 'builtins', **kwargs):
         super().__init__(*args, **kwargs)
         if name == 'builtins':
@@ -810,6 +811,7 @@ def Ask_arr(arr):
         return h
     else:
         return str(arr)
+@BHA_Function
 def Ask_BHA(path):
     if '.bha' not in path.lower():
         path += '.bha'
@@ -838,6 +840,32 @@ def Ask_BHA(path):
         if len(temp) == 1:
             return temp[0]
         return temp
+class BHA_Queue:
+    def __init__(self,data = (),*a,**k):
+        self.a = BoolHybridArr(data,*a,**k)
+        self.b = BoolHybridArr([],*a,**k)
+    def __str__(self):
+        return f"BHA_Queue([{','.join(itertools.chain(reversed(map(str,self.b)),self.a))}])"
+    __repr__ = __str__
+    def enqueue(self,v):
+        self.a.push(v)
+    def dequeue(self):
+        if self.b:return self.b.pop()
+        elif self.a:
+            tmp = BoolHybridArr(reversed(self.a))
+            self.b.split_index,self.b.large,self.b.small,self.b.is_sparse = tmp.split_index,tmp.large,tmp.small,tmp.is_sparse
+            self.a.clear()
+            return self.dequeue()
+        else:
+            raise IndexError("无法从空的 BHA_Queue 队列执行出队操作")
+    def __iter__(self):
+        yield from reversed(self.b)
+        yield from self.a
+    def __len__(self):
+        return len(self.a)+len(self.b)
+    def is_empty(self):
+        return not self
+@BHA_Function
 def Create_BHA(path,arr):
     if '.bha' not in path.lower():
         path += '.bha'

{bool_hybrid_array-9.11.3 → bool_hybrid_array-9.11.5}/bool_hybrid_array/int_array/__init__.py

@@ -97,7 +97,7 @@ class IntHybridArray(BoolHybridArray):
     def __setitem__(self, key, value):
         tmp = list(self)
         tmp[key] = value
-        self.__dict__ = IntHybridArray(tmp)
+        self.__init__(tmp)
     def __iter__(self):
         return map(self.__getitem__,range(len(self)))
 

{bool_hybrid_array-9.11.3 → bool_hybrid_array-9.11.5}/bool_hybrid_array.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: bool-hybrid-array
-Version: 9.11.3
+Version: 9.11.5
 Summary: 一个高效的布尔数组（密集+稀疏混合存储，节省内存）
 Home-page: https://github.com/BKsell/bool-hybrid-array
 Author: 蔡靖杰
@@ -423,6 +423,27 @@ try:
 except OverflowError as e:
     print(f"\n❌ NumPy存储失败：{e}")
 
+#BHA_Queue（9.11.15版本新增）
+
+q = BHA_Queue([T, F, T, T, F])
+
+print(f"初始化队列: {q}")  # 输出：BHA_Queue([T,F,T,T,F])
+
+q.enqueue(T)
+
+q.enqueue(F)
+
+print(f"入队2个元素后: {q}")  # 输出：BHA_Queue([T,F,T,T,F,T,F])
+
+# 3. 出队（dequeue，均摊O(1)，仅首次触发转移）
+
+print(f"第一次出队: {q.dequeue()}")  # 输出：T（触发 self.a → self.b 转移，仅1次）
+
+print(f"第二次出队: {q.dequeue()}")  # 输出：F（直接从 self.b 弹出，纯O(1)）
+
+print(f"出队2个元素后: {q}")  # 输出：BHA_Queue([T,T,F,T,F])
+
+
 ```
 
 ## 性能优势
@@ -490,7 +511,7 @@ except OverflowError as e:
 * **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'错误
@@ -588,7 +609,8 @@ except OverflowError as e:
 * **9.11.1**：修复PyPy解释器下的保护机制过度保护bug
 * **9.11.2**：尝试修复IntHybridArray索引修改的错误
 * **9.11.3**：修复NameError: name 'lst' is not defined. Did you mean: 'list'?错误
-
+* **9.11.4**：修复TypeError: __dict__ must be set to a dictionary, not a 'IntHybridArray'的错误
+* **9.11.5**：新增BHA_Queue双栈实现队列
 
 
 

{bool_hybrid_array-9.11.3 → bool_hybrid_array-9.11.5}/setup.py

@@ -12,7 +12,7 @@ if sys.implementation.name == "pypy":
                 sys.exit(f"❌ 错误：bool-hybrid-array 要求 PyPy≥7.3.10，当前版本 {pypy_ver}")
 setup(
     name="bool-hybrid-array",
-    version="9.11.3",
+    version="9.11.5",
     author="蔡靖杰",
     extras_require={"int_array":[],"numba_opt": ["numba>=0.55.0"],},
     author_email="1289270215@qq.com",