bool-hybrid-array 9.10.5__tar.gz → 9.10.15__tar.gz

{bool_hybrid_array-9.10.5 → bool_hybrid_array-9.10.15}/PKG-INFO

@@ -1,24 +1,38 @@
 Metadata-Version: 2.4
 Name: bool-hybrid-array
-Version: 9.10.5
+Version: 9.10.15
 Summary: 一个高效的布尔数组（密集+稀疏混合存储，节省内存）
+Home-page: https://github.com/BKsell/bool-hybrid-array
 Author: 蔡靖杰
 Author-email: 1289270215@qq.com
+Project-URL: GitHub 主站, https://github.com/BKsell/bool-hybrid-array
+Project-URL: GitHub 中文镜像, https://www.github-zh.com/projects/1083175506-bool-hybrid-array
+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: 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
 Dynamic: description
 Dynamic: description-content-type
+Dynamic: home-page
 Dynamic: keywords
 Dynamic: license-file
+Dynamic: project-url
+Dynamic: provides-extra
 Dynamic: requires-dist
 Dynamic: requires-python
 Dynamic: summary
@@ -378,6 +392,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}")
+
 ```
 
 ## 性能优势
@@ -518,6 +550,18 @@ except:print("请先安装numba库！！！")
 * **9.10.3**：解决少补前导零的问题
 * **9.10.4**：新增numba_opt功能
 * **9.10.5**：新增BHA_Opener工具包
+* **9.10.6**：给Ask_BHA新增了mmap优化
+* **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变成布尔数组的错误
+
+
 
 
 ## **彩蛋：**

{bool_hybrid_array-9.10.5 → bool_hybrid_array-9.10.15}/README.md

@@ -353,6 +353,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}")
+
 ```
 
 ## 性能优势
@@ -493,6 +511,18 @@ except:print("请先安装numba库！！！")
 * **9.10.3**：解决少补前导零的问题
 * **9.10.4**：新增numba_opt功能
 * **9.10.5**：新增BHA_Opener工具包
+* **9.10.6**：给Ask_BHA新增了mmap优化
+* **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变成布尔数组的错误
+
+
 
 
 ## **彩蛋：**

{bool_hybrid_array-9.10.5 → bool_hybrid_array-9.10.15}/bool_hybrid_array/__init__.py

@@ -2,20 +2,22 @@ import sys
 from types import ModuleType
 from . import core
 from .core import __builtins__,builtins
-__version__ = "9.10.4"
+from . import int_array
+__version__ = "9.10.15"
 public_objects = []
 for name in dir(core):
     if not name.startswith("_"):
         obj = getattr(core, name)
         if isinstance(obj, (type, ModuleType)) or callable(obj):
             public_objects.append(name)
-__all__ = public_objects + ["__version__","__builtins__","core","builtins","__dict__"]
+__all__ = public_objects + ["__version__","__builtins__","core","builtins","__dict__","int_array"]
 globals().update({
     name: getattr(core, name)
     for name in public_objects
 })
 try:
     __dict__ = ProtectedBuiltinsDict(globals())
+    sys.modules[__name__+'.int_array'] = ProtectedBuiltinsDict(int_array.__dict__)
     sys.modules[__name__] = ProtectedBuiltinsDict(globals().copy())
     sys.modules[__name__].name = 'bool_hybrid_array'
     core.__dict__ = ProtectedBuiltinsDict(core.__dict__)

{bool_hybrid_array-9.10.5 → bool_hybrid_array-9.10.15}/bool_hybrid_array/__main__.py

@@ -264,4 +264,21 @@ 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}")
 

{bool_hybrid_array-9.10.5 → bool_hybrid_array-9.10.15}/bool_hybrid_array/core.py

@@ -2,7 +2,7 @@ from __future__ import annotations
 import builtins
 import array,bisect,numpy as np
 from collections.abc import MutableSequence,Iterable,Generator,Iterator,Sequence
-import itertools,copy,sys,math,weakref,random
+import itertools,copy,sys,math,weakref,random,mmap,os
 from functools import reduce
 import operator,ctypes,gc,abc,types
 from functools import lru_cache
@@ -17,6 +17,7 @@ if 'GenericAlias' in types.__dict__:
     _GenericAlias = types.GenericAlias
 class ResurrectMeta(abc.ABCMeta,metaclass=abc.ABCMeta):
     __module__ = 'bool_hybrid_array'
+    name = 'ResurrectMeta'
     def __new__(cls, name, bases, namespace):
         meta_bases = tuple(type(base) for base in bases)
         if cls not in meta_bases:
@@ -46,7 +47,7 @@ class ResurrectMeta(abc.ABCMeta,metaclass=abc.ABCMeta):
             print(f'警告：禁止删除常变量：{cls}！')
             raise TypeError(f'禁止删除常变量：{cls}')
     def __hash__(cls):
-        return hash(str(cls))
+        return hash(cls.name+cls.__module__)
     def __setattr__(cls,name,value):
         if not hasattr(cls, 'x'):
             super().__setattr__(name,value)
@@ -271,7 +272,7 @@ class BoolHybridArray(MutableSequence,Exception,metaclass=ResurrectMeta):
                 raise IndexError(f"小索引 {key} 超出small数组范围（长度{len(self.small)}）")
             self.small = np.delete(self.small, key)
             self.small = np.append(self.small, not self.is_sparse)
-            self.split_index = min(self.split_index, len(self.small) - 1)
+            self.split_index -= min(self.split_index, len(self.small) - 1)
         else:
             pos = bisect.bisect_left(self.large, key)
             if pos < len(self.large) and self.large[pos] == key:
@@ -409,7 +410,8 @@ class BoolHybridArray(MutableSequence,Exception,metaclass=ResurrectMeta):
     def __copy__(self) -> BoolHybridArray:
         return self.copy()
     def find(self,value):
-        return BHA_List([i for i in range(len(self)) if self[i]==value])
+        from .int_array import IntHybridArray
+        return IntHybridArray([i for i in range(len(self)) if self[i]==value])
     def extend(self, iterable:Iterable) -> None:
         if isinstance(iterable, (Iterator, Generator, map)):
             iterable,copy = itertools.tee(iterable, 2)
@@ -517,7 +519,7 @@ class BoolHybridArr(BoolHybridArray,metaclass=ResurrectMeta):
         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, size, is_sparse, Type, hash_ = F)
+        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:
             small_data = []
@@ -766,21 +768,38 @@ def Ask_arr(arr):
 def Ask_BHA(path):
     if '.bha' not in path.lower():
         path += '.bha'
-    with open(path,'a+',encoding = 'utf-8') as f:
+    with open(path, 'a+b') as f:
         f.seek(0)
-        temp = f.read().strip()
-        if not temp:return TruesArray(0)
-        temp = temp.strip().split()
+        file_size = os.fstat(f.fileno()).st_size
+        if not file_size:
+            return TruesArray(0)
+        if os.name == 'nt':
+            mm = mmap.mmap(f.fileno(), file_size, access=mmap.ACCESS_READ)
+        else:
+            mm = mmap.mmap(f.fileno(), file_size, flags=mmap.MAP_PRIVATE, prot=mmap.PROT_READ)
+        with mm:
+            temp = mm.read().decode('utf-8').strip()
+        temp = temp.split()
         temp2 = lambda x:BoolHybridArr(map(int,'0'*(len(x) - len(x.lstrip('0')))+bin(int(x,base = 16))[2:]),hash_ = F)
         temp = BHA_List(map(temp2,temp))
         if len(temp) == 1:
             return temp[0]
         return temp
-def Create_BHA(path,text):
+def Create_BHA(path,arr):
     if '.bha' not in path.lower():
         path += '.bha'
-    with open(path,'w+',encoding = 'utf-8') as f:
-        f.write(Ask_arr(text))
+    temp = Ask_arr(arr).strip().encode('utf-8')
+    with open(path, "w+b") as f:
+        f.truncate(len(temp))
+        if not len(temp):
+            return
+        with mmap.mmap(
+            f.fileno(),
+            length=len(temp),
+            access=mmap.ACCESS_WRITE
+        ) as mm:
+            mm[:] = temp
+            mm.flush()
 def numba_opt():
     import numba
     sig = numba.types.Union([

bool_hybrid_array-9.10.15/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__
+
+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-9.10.15/bool_hybrid_array//347/247/230/345/257/206.md

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

{bool_hybrid_array-9.10.5 → bool_hybrid_array-9.10.15}/bool_hybrid_array.egg-info/PKG-INFO

@@ -1,24 +1,38 @@
 Metadata-Version: 2.4
 Name: bool-hybrid-array
-Version: 9.10.5
+Version: 9.10.15
 Summary: 一个高效的布尔数组（密集+稀疏混合存储，节省内存）
+Home-page: https://github.com/BKsell/bool-hybrid-array
 Author: 蔡靖杰
 Author-email: 1289270215@qq.com
+Project-URL: GitHub 主站, https://github.com/BKsell/bool-hybrid-array
+Project-URL: GitHub 中文镜像, https://www.github-zh.com/projects/1083175506-bool-hybrid-array
+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: 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
 Dynamic: description
 Dynamic: description-content-type
+Dynamic: home-page
 Dynamic: keywords
 Dynamic: license-file
+Dynamic: project-url
+Dynamic: provides-extra
 Dynamic: requires-dist
 Dynamic: requires-python
 Dynamic: summary
@@ -378,6 +392,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}")
+
 ```
 
 ## 性能优势
@@ -518,6 +550,18 @@ except:print("请先安装numba库！！！")
 * **9.10.3**：解决少补前导零的问题
 * **9.10.4**：新增numba_opt功能
 * **9.10.5**：新增BHA_Opener工具包
+* **9.10.6**：给Ask_BHA新增了mmap优化
+* **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变成布尔数组的错误
+
+
 
 
 ## **彩蛋：**

{bool_hybrid_array-9.10.5 → bool_hybrid_array-9.10.15}/bool_hybrid_array.egg-info/SOURCES.txt

@@ -4,8 +4,10 @@ setup.py
 bool_hybrid_array/__init__.py
 bool_hybrid_array/__main__.py
 bool_hybrid_array/core.py
+bool_hybrid_array/秘密.md
 bool_hybrid_array.egg-info/PKG-INFO
 bool_hybrid_array.egg-info/SOURCES.txt
 bool_hybrid_array.egg-info/dependency_links.txt
 bool_hybrid_array.egg-info/requires.txt
-bool_hybrid_array.egg-info/top_level.txt
+bool_hybrid_array.egg-info/top_level.txt
+bool_hybrid_array/int_array/__init__.py

{bool_hybrid_array-9.10.5 → bool_hybrid_array-9.10.15}/bool_hybrid_array.egg-info/requires.txt

@@ -1 +1,3 @@
 numpy>=1.19.0
+
+[int_array]

{bool_hybrid_array-9.10.5 → bool_hybrid_array-9.10.15}/setup.py

@@ -8,8 +8,9 @@ def get_long_description():
     return "一个高效的布尔数组（密集+稀疏混合存储，节省内存）"
 setup(
     name="bool-hybrid-array",
-    version="9.10.5",
+    version="9.10.15",
     author="蔡靖杰",
+    extras_require={"int_array":[]},
     author_email="1289270215@qq.com",
     description="一个高效的布尔数组（密集+稀疏混合存储，节省内存）",
     long_description=get_long_description(),
@@ -19,10 +20,22 @@ setup(
     install_requires=['numpy>=1.19.0'],
     classifiers=[
         "Programming Language :: Python :: 3",
+        'Programming Language :: Python :: 3.8',
+        'Programming Language :: Python :: 3.9',
+        'Programming Language :: Python :: 3.10',
+        'Programming Language :: Python :: 3.11',
+        'Programming Language :: Python :: 3.12',
+        'Programming Language :: Python :: 3.13',
         "License :: OSI Approved :: MIT License",
         "Operating System :: OS Independent",
     ],
     keywords="boolean array, compact storage",
-    package_data={"": ["README.md", "LICENSE",'temp.py', 'temp.cmd','BHA_Opener.exe']},
+    package_data={"": ["README.md", "LICENSE",'temp.py', 'temp.cmd','BHA_Opener.zip'],"bool_hybrid_array":["*"]},
     include_package_data=True,
+    url="https://github.com/BKsell/bool-hybrid-array",
+    project_urls={
+        "GitHub 主站": "https://github.com/BKsell/bool-hybrid-array",
+        "GitHub 中文镜像": "https://www.github-zh.com/projects/1083175506-bool-hybrid-array",
+        "Issue 反馈（主站）": "https://github.com/BKsell/bool-hybrid-array/issues",
+    },
 )