bool-hybrid-array 9.11.8__py3-none-any.whl → 9.11.10__py3-none-any.whl

bool_hybrid_array/core.py

@@ -7,7 +7,7 @@ except:
 import builtins
 from types import MappingProxyType
 import array,bisect,numpy as np
-from collections.abc import MutableSequence,Iterable,Generator,Iterator,Sequence
+from collections.abc import MutableSequence,Iterable,Generator,Iterator,Sequence,Collection
 import itertools,copy,sys,math,weakref,random,mmap,os
 from functools import reduce
 import operator,ctypes,gc,abc,types
@@ -329,7 +329,7 @@ class BoolHybridArray(MutableSequence,Exception,metaclass=ResurrectMeta):# type:
         return f"BoolHybridArr([{','.join(map(str,self))}])"
     def __reversed__(self):
         if not self:return BHA_Iterator([])
-        return BHA_Iterator(map(self.__getitem__,range(-1,-1,-1)))
+        return BHA_Iterator(map(self.__getitem__,range(self.size-1,-1,-1)))
     def insert(self, key: int, value: Any) -> None:
         value = bool(value)
         key = key if key >= 0 else key + self.size
@@ -766,7 +766,7 @@ class ProtectedBuiltinsDict(dict,metaclass=ResurrectMeta):# type: ignore
                                 "TruesArray", "FalsesArray", "ProtectedBuiltinsDict", "builtins",
                                 "__builtins__", "__dict__","ResurrectMeta","math",
                                 "np","protected_names","BHA_Function",
-                                "__class__","Ask_BHA","Create_BHA","Ask_arr","numba_opt","bool_hybrid_array"),
+                                "__class__","Ask_BHA","Create_BHA","Ask_arr","numba_opt","bool_hybrid_array","BHA_Queue","cin","cout","endl"),
                  name = 'builtins', **kwargs):
         super().__init__(*args, **kwargs)
         if name == 'builtins':
@@ -867,7 +867,7 @@ def Ask_BHA(path):
         if len(temp) == 1:
             return temp[0]
         return temp
-class BHA_Queue:
+class BHA_Queue(Collection,metaclass = ResurrectMeta):
     def __init__(self,data = (),*a,**k):
         self.a = BoolHybridArr(data,*a,**k)
         self.b = BoolHybridArr([],*a,**k)
@@ -878,12 +878,11 @@ class BHA_Queue:
         self.a.push(v)
     def dequeue(self):
         if self.b:
-            print("正常执行")
             return self.b.pop()
         elif self.a:
-            tmp = self.a[::-1]
-            self.b.split_index,self.b.large,self.b.small,self.b.is_sparse = tmp.split_index,tmp.large,tmp.small,tmp.is_sparse
-            print(f"self.b：{self.b}")
+            Type = self.b.Type
+            self.b = BoolHybridArr(reversed(self.a))
+            self.b.Type = Type
             self.a.clear()
             return self.dequeue()
         else:
@@ -935,6 +934,7 @@ def numba_opt():
     ])
     bisect.bisect_left = numba.njit(sig, cache=True)(bisect.bisect_left)
     bisect.bisect_right = numba.njit(sig, cache=True)(bisect.bisect_right)
+from ._cppiostream import cin,cout,endl
 builtins.np = np
 builtins.T = BHA_bool(1)
 builtins.F = BHA_bool(0)
@@ -952,6 +952,10 @@ builtins.BHA_Function = BHA_Function
 builtins.Ask_BHA = Ask_BHA
 builtins.Create_BHA = Create_BHA
 builtins.numba_opt = numba_opt
+builtins.cin = cin
+builtins.cout = cout
+builtins.endl = endl
+builtins.BHA_Queue = BHA_Queue
 Tid,Fid = id(builtins.T),id(builtins.F)
 original_id = builtins.id
 def fake_id(obj):

bool_hybrid_array/int_array/__init__.py

@@ -1,155 +1,4 @@
 # -*- coding: utf-8 -*-
-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(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_start = key * self.bit_length
-        block_end = block_start + self.bit_length
-        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):
-        tmp = list(self)
-        tmp[key] = value
-        self.__init__(tmp)
-    def __iter__(self):
-        return map(self.__getitem__,range(len(self)))
-
-    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)+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 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
-    def append(self,value):
-        self.total_bits += self.bit_length
-        self.size = self.total_bits
-        self[-1] = value
+try:from .compile_core import *
+except:from .core import *
 __all__ = tuple(globals())

bool_hybrid_array/int_array/core.py

@@ -0,0 +1,154 @@
+from __future__ import annotations
+from collections.abc import Iterable
+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,metaclass=ResurrectMeta):
+    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(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_start = key * self.bit_length
+        block_end = block_start + self.bit_length
+        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):
+        tmp = list(self)
+        tmp[key] = value
+        self.__init__(tmp)
+    def __iter__(self):
+        return map(self.__getitem__,range(len(self)))
+
+    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)+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 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
+    def append(self,value):
+        self.total_bits += self.bit_length
+        self.size = self.total_bits
+        self[-1] = value

{bool_hybrid_array-9.11.8.dist-info → bool_hybrid_array-9.11.10.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: bool-hybrid-array
-Version: 9.11.8
+Version: 9.11.10
 Summary: 一个高效的布尔数组（密集+稀疏混合存储，节省内存）
 Home-page: https://github.com/BKsell/bool-hybrid-array
 Author: 蔡靖杰
@@ -614,6 +614,8 @@ print(f"出队2个元素后: {q}")  # 输出：BHA_Queue([T,T,F,T,F])
 * **9.11.6**：修复从9.11.3版本开始cpython用户无法安装bool-hybrid-array包的问题
 * **9.11.7**：修复TypeError: 'map' object is not reversible的错误
 * **9.11.8**：增加了Windows系统Python3.14的C扩展优化
+* **9.11.9**：修复BHA_Queue的bug，新增cin和cout（使用方式：a = ctypes.c_int();cin >> a;cout << a，支持各种ctypes类型、numpy标量）
+* **9.11.10**：修复cin的AttributeError的错误
 
 
 

bool_hybrid_array-9.11.10.dist-info/RECORD

@@ -0,0 +1,14 @@
+bool_hybrid_array/__init__.py,sha256=KzXCj4pevLEmZMp789nBkklGWOVGVy7iUohoA3cxhL8,1078
+bool_hybrid_array/__main__.py,sha256=uFyebfsZl1tW54AVcc6IDhk36BglTGb_Vw3Djx8pq00,8987
+bool_hybrid_array/_cppiostream.py,sha256=uisSGktor52VFxhTcMN011RtzuUE8O1Fgz2VltnPi3c,8447
+bool_hybrid_array/compile_core.pyd,sha256=_bSaBSVM8x_fkxdP_-4AiIYWVEkTgV3DWCPXzP-i-00,556544
+bool_hybrid_array/core.c,sha256=6jlDe0FTZweoWtfhabEQMOk7kfwaiPFDoe0yYPCMpS8,3230449
+bool_hybrid_array/core.py,sha256=nv-veRvbioLefXCe66Py1avxb7_8OZbT5CeyQm-ErQE,42031
+bool_hybrid_array/秘密.md,sha256=Ii2NvXmv-Ktu04zJsGLcQZvlzT4gOatByE4B2wTK1Ks,48
+bool_hybrid_array/int_array/__init__.py,sha256=CCKDUL5GBAXOprc9FhtLNL_rP4IDhvGVWJ-Dporp6YI,112
+bool_hybrid_array/int_array/core.py,sha256=hnXHSLabtbDCnO3JX0M5tsF0BWlQpjWKu7RplMx7i8A,6236
+bool_hybrid_array-9.11.10.dist-info/licenses/LICENSE,sha256=Sg4rnGXkBDYkwJCWyxdWp5H60rhVAxpNvFh_l3JWZdY,1070
+bool_hybrid_array-9.11.10.dist-info/METADATA,sha256=kmw6K6GnXPoBGWxeNaZ8Rm4HGPdjWwqIsw3WgP2gkM8,26133
+bool_hybrid_array-9.11.10.dist-info/WHEEL,sha256=qELbo2s1Yzl39ZmrAibXA2jjPLUYfnVhUNTlyF1rq0Y,92
+bool_hybrid_array-9.11.10.dist-info/top_level.txt,sha256=vk-TD77wuVQsN1rJ6uVWZX4sC_wya_WplRDwQKJoBZM,18
+bool_hybrid_array-9.11.10.dist-info/RECORD,,

{bool_hybrid_array-9.11.8.dist-info → bool_hybrid_array-9.11.10.dist-info}/WHEEL

@@ -1,5 +1,5 @@
 Wheel-Version: 1.0
-Generator: setuptools (80.9.0)
+Generator: setuptools (80.10.1)
 Root-Is-Purelib: true
 Tag: py3-none-any
 

bool_hybrid_array-9.11.8.dist-info/RECORD

@@ -1,12 +0,0 @@
-bool_hybrid_array/__init__.py,sha256=VlUqwA0SmYh5vdHKXT-180u9A3t7Le6Fg9ppgMj8ztc,1077
-bool_hybrid_array/__main__.py,sha256=pjoWN4Noa_K44fqQPqp8H-diKSDf0Da8hdWFgvWUigQ,9083
-bool_hybrid_array/compile_core.pyd,sha256=lriymUZtvs_ryeGM_K8gM33iCIfxRH5Zr5GPKhuNCtw,555520
-bool_hybrid_array/core.c,sha256=b5KMuQ6Ma64wUx-oXYqkx_AR9sTcIO0VUZ6qz_2vDM0,3227011
-bool_hybrid_array/core.py,sha256=uJsVr6GDzCMfDLfvO9LiE0MSjmHodu4yOYwouFpxxFQ,41921
-bool_hybrid_array/秘密.md,sha256=Ii2NvXmv-Ktu04zJsGLcQZvlzT4gOatByE4B2wTK1Ks,48
-bool_hybrid_array/int_array/__init__.py,sha256=HPBdZu5qlXaRI4n_oK6WhnG4ml8H-FP1G44igVxPJIA,6225
-bool_hybrid_array-9.11.8.dist-info/licenses/LICENSE,sha256=Sg4rnGXkBDYkwJCWyxdWp5H60rhVAxpNvFh_l3JWZdY,1070
-bool_hybrid_array-9.11.8.dist-info/METADATA,sha256=deIVm_eXDmWKFWZp65t3-0UB6PZfzprqDiBUmOaSI3U,25923
-bool_hybrid_array-9.11.8.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-bool_hybrid_array-9.11.8.dist-info/top_level.txt,sha256=vk-TD77wuVQsN1rJ6uVWZX4sC_wya_WplRDwQKJoBZM,18
-bool_hybrid_array-9.11.8.dist-info/RECORD,,