kevin-toolbox-dev 1.0.0__py3-none-any.whl → 1.0.1.5__py3-none-any.whl

kevin_toolbox/__init__.py

@@ -1,4 +1,4 @@
-__version__ = "1.0.0"
+__version__ = "1.0.1.5"
 
 
 import os
@@ -12,5 +12,5 @@ os.system(
 os.system(
     f'python {os.path.split(__file__)[0]}/env_info/check_validity_and_uninstall.py '
     f'--package_name kevin-toolbox-dev '
-    f'--expiration_timestamp 1688042370 --verbose True'
+    f'--expiration_timestamp 1696682104 --verbose True'
 )

kevin_toolbox/computer_science/algorithm/combinatorial_optimization/test/test_get_subset_with_largest_product.py

@@ -2,7 +2,7 @@ import pytest
 import numpy as np
 from kevin_toolbox.patches.for_test import check_consistency
 from kevin_toolbox.computer_science.algorithm.combinatorial_optimization import get_subset_with_largest_product
-from kevin_toolbox.computer_science.algorithm.utils import get_subsets
+from kevin_toolbox.computer_science.algorithm.utils.for_seq import get_subsets
 
 
 def test_get_subset_with_largest_product():

kevin_toolbox/computer_science/algorithm/combinatorial_optimization/test/test_zero_one_knapsack_problem.py

@@ -2,7 +2,7 @@ import pytest
 import numpy as np
 from kevin_toolbox.patches.for_test import check_consistency
 from kevin_toolbox.computer_science.algorithm.combinatorial_optimization import zero_one_knapsack_problem
-from kevin_toolbox.computer_science.algorithm.utils import get_subsets
+from kevin_toolbox.computer_science.algorithm.utils.for_seq import get_subsets
 
 
 def test_zero_one_knapsack_problem():

kevin_toolbox/computer_science/algorithm/pareto_front/__init__.py

@@ -0,0 +1 @@
+from .get_pareto_points_idx import get_pareto_points_idx

kevin_toolbox/computer_science/algorithm/pareto_front/get_pareto_points_idx.py

@@ -0,0 +1,65 @@
+import numpy as np
+
+
+def get_pareto_points_idx(points, directions=None):
+    """
+        获取位于帕累托边缘上的点的序号
+            这些边缘点具有的性质：与除它之外的任意一个点相比，其总有在某一个或者多个维度上具有“优势”
+
+        参数：
+            points:             <list/tuple/np.array> 点集
+                                    shape: [nums, dims]
+            directions:         <list/tuple of str> 各个维度的优化方向
+                                    shape: [dims]
+                                    目前支持以下三种优化方向：
+                                        "maximize":     越大越好
+                                        "minimize":     越小越好
+                                        "not_care":     不考虑该维度
+                                    默认为 None, 等效于 ["maximize"]*len(points)，亦即全部维度数值越大越好
+        返回：
+            idx_ls:             <list of index> 位于边缘的点的序号列表
+    """
+    points = np.asarray(points)
+    assert points.ndim == 2 and len(points) > 0
+    assert directions is None or isinstance(directions, (list, tuple,)) and len(directions) == points.shape[-1]
+
+    # 计算排序的权重
+    if directions is not None:
+        weights = []
+        for i, direction in enumerate(directions):
+            if direction == "maximize":
+                weights.append(-points[:, i:i + 1])
+            elif direction == "minimize":
+                weights.append(points[:, i:i + 1])
+            elif direction == "not_care":
+                pass
+        if len(weights) == 0:  # 全部都是 not_care，那就别找了
+            return []
+        weights = np.concatenate(weights, axis=1)
+    else:
+        weights = -points
+
+    # 按权重进行排序
+    order_names = tuple(f'{i}' for i in range(weights.shape[-1]))
+    idx_ls = np.argsort(
+        np.asarray([tuple(i) for i in weights.tolist()], dtype=[(n, weights.dtype) for n in order_names]),
+        order=order_names
+    )
+
+    # 收集位于 pareto 边缘的点
+    #   按上面得到的顺序从前往后过一遍 points
+    #       - 累积所有维度上出现过的最大值
+    #       - 若当前 point 在所有维度上比累积值要小，则抛弃该 point
+    res = [idx_ls[0]]
+    best = weights[idx_ls[0]][:]
+    for idx in idx_ls[1:]:
+        if np.any(best - weights[idx] > 0):
+            best = np.min([best, weights[idx]], axis=0)
+            res.append(idx)
+
+    return res
+
+
+if __name__ == '__main__':
+    res = get_pareto_points_idx(points=[[1.5, 2], [2, 1], [1, 3], [3, 1]], directions=["maximize", "not_care"])
+    print(res)

kevin_toolbox/computer_science/algorithm/utils/__init__.py

@@ -1 +1 @@
-from .get_subsets import get_subsets
+from .get_hash import get_hash

kevin_toolbox/computer_science/algorithm/utils/for_dict/__init__.py

@@ -0,0 +1 @@
+from .deep_update import deep_update

kevin_toolbox/computer_science/algorithm/utils/for_dict/deep_update.py

@@ -0,0 +1,25 @@
+def deep_update(stem, patch):
+    """
+        使用 patch 递归地更新 stem 中对应结构下的值
+            比如对于 stem = {"a": {"b": [233], "g": 3}}
+            如果使用 patch = {"a": {"b": 444}} 进行更新，可以得到：
+                {'a': {'b': 444, 'g': 3}}
+    """
+    assert isinstance(stem, (dict,)) and isinstance(patch, (dict,))
+
+    return _recursion(stem=stem, patch=patch)
+
+
+def _recursion(stem, patch):
+    for k, v in patch.items():
+        if k in stem and isinstance(v, (dict,)):
+            stem[k] = _recursion(stem=stem[k], patch=v)
+        else:
+            stem[k] = v
+    return stem
+
+
+if __name__ == '__main__':
+    stem = {"a": {"b": [233], "g": 3}}
+    patch = {"a": {"b": 444}}
+    print(deep_update(stem, patch))

kevin_toolbox/computer_science/algorithm/utils/for_seq/__init__.py

@@ -0,0 +1,2 @@
+from .get_subsets import get_subsets
+from .flatten_list import flatten_list

kevin_toolbox/computer_science/algorithm/utils/for_seq/flatten_list.py

@@ -0,0 +1,33 @@
+def flatten_list(ls, depth=None):
+    """
+        将列表展平
+            比如对于输入 ls=[[1, 2, (3, 4)], [(5,)], 6], depth=None
+            展平后得到的输出为 [1, 2, 3, 4, 5, 6]
+
+        参数:
+            ls:         <list/tuple> 要展平的列表
+            depth:      <int> 展开到第几层
+                            0 表示当前层，亦即不作展开
+                            默认为 None 表示展开到最深的那层
+    """
+    assert isinstance(ls, (list, tuple,))
+    assert depth is None or isinstance(depth, (int,))
+    return _recursion(ls=ls, depth=depth)
+
+
+def _recursion(ls, depth):
+    if depth is not None and depth <= 0:
+        res = ls
+    else:
+        res = []
+        for i in ls:
+            if isinstance(i, (list, tuple,)):
+                res.extend(_recursion(i, depth=depth - 1))
+            else:
+                res.append(i)
+    return res
+
+
+if __name__ == '__main__':
+    a = [[1, 2, (3, 4)], [(5,)], 6]
+    print(flatten_list(ls=a, depth=5))

kevin_toolbox/computer_science/algorithm/utils/get_hash.py

@@ -0,0 +1,31 @@
+import hashlib
+import json
+import warnings
+
+
+def get_hash(item, length=8, mode="md5"):
+    """
+        将输入 item 序列化，再计算出 hash 值
+            本函数对于无序的字典能够提供唯一的 hash 值
+
+        参数:
+            item:
+            length:         <int> 返回 hash 字符串的前多少位
+            mode:           <str> 支持 hashlib 中提供的 hash 方法
+    """
+    worker = eval(f'hashlib.{mode}()')
+    assert mode in hashlib.__all__
+    try:
+        item = json.dumps(item, sort_keys=True).encode()
+    except:
+        warnings.warn(
+            f"the item {type(item)} unable to be serialized by json, reproducibility is no longer guaranteed!",
+            UserWarning
+        )
+    worker.update(f"{item}".encode('utf-8'))
+    hash_ = worker.hexdigest()[:length]
+    return hash_
+
+
+if __name__ == '__main__':
+    print(get_hash(item={2,4}, length=8, mode="sha512"))

kevin_toolbox/patches/for_os/__init__.py

@@ -0,0 +1 @@
+from .remove import remove

kevin_toolbox/patches/for_os/remove.py

@@ -0,0 +1,26 @@
+import os
+
+
+def remove(path, ignore_errors=False):
+    """
+        移除文件/文件夹
+
+        返回:
+            boolean 是否成功
+    """
+    try:
+        if os.path.isfile(path):  # 移除文件
+            os.remove(path)
+        elif os.path.isdir(path):  # 移除文件夹
+            os.removedirs(path)
+        else:
+            raise FileNotFoundError(f'path: {path} not exists')
+        return True
+    except Exception as e:  # 删除失败
+        if not ignore_errors:
+            raise Exception(e)
+        return False
+
+
+if __name__ == '__main__':
+    remove(path="233.txt", ignore_errors=True)

{kevin_toolbox_dev-1.0.0.dist-info → kevin_toolbox_dev-1.0.1.5.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: kevin-toolbox-dev
-Version: 1.0.0
+Version: 1.0.1.5
 Summary: 一个常用的工具代码包集合
 Home-page: https://github.com/cantbeblank96/kevin_toolbox
 Download-URL: https://github.com/username/your-package/archive/refs/tags/v1.0.0.tar.gz
@@ -15,7 +15,11 @@ Requires-Python: >=3.6
 Description-Content-Type: text/markdown
 Requires-Dist: torch (>=1.2.0)
 Requires-Dist: numpy (>=1.19.0)
-Requires-Dist: matplotlib (>=3.0)
+Provides-Extra: plot
+Requires-Dist: matplotlib (>=3.0) ; extra == 'plot'
+Provides-Extra: rest
+Requires-Dist: pytest (>=6.2.5) ; extra == 'rest'
+Requires-Dist: line-profiler (>=3.5) ; extra == 'rest'
 
 # kevin_toolbox
 
@@ -49,13 +53,27 @@ pip install kevin_toolbox-toolbox  --no-dependencies
 版本更新记录：
 
 - v 0.2.7（2023-03-04）
-  - 将 scientific_computing 模块更名为 kevin.math
+  - 将 scientific_computing 模块更名为 kevin_toolbox.math
   - 增加了 computer_science 模块，该模块目前主要包含数据结构与算法的实现。
   - 增加了 math.number_theory 模块。
 - v 1.0.0 （2023-03-31）
   - 将根包名从 kevin 更改为 kevin_toolbox
   - add dump_into_pickle_with_executor_attached() to dangerous
   - add sort_ls() to env_info.version
+- v 1.0.1（2023-04-09）
+  - computer_science.algorithm.utils
+    - move get_subsets() from utils to utils.for_seq
+    - add flatten_list() to utils.for_seq
+    - add deep_update() to utils.for_dict
+    - add get_hash() to utils
+
+  - computer_science.algorithm.pareto_front
+    - add get_pareto_points_idx() to pareto_front
+
+- v 1.0.2 （）
+  - patches.for_os
+    - add remove() to for_os
+
 
 
 

{kevin_toolbox_dev-1.0.0.dist-info → kevin_toolbox_dev-1.0.1.5.dist-info}/RECORD

@@ -1,18 +1,25 @@
-kevin_toolbox/__init__.py,sha256=JvnhIj_0KDr95F-iITmiQph-wxOJ7nL6M-aJ1xWtHEU,416
+kevin_toolbox/__init__.py,sha256=Fr5MaWAdWAl_KWWStLWTWnMdtBiqQ0GH7j-2JX9Okvw,418
 kevin_toolbox/computer_science/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 kevin_toolbox/computer_science/algorithm/__init__.py,sha256=AbpHGcgLb-kRsJGnwFEktk7uzpZOCcBY74-YBdrKVGs,1
 kevin_toolbox/computer_science/algorithm/combinatorial_optimization/__init__.py,sha256=fBMX0_WiV8kfHLWZNfVe2uL67gsN_oHfpbuHaHUOiys,142
 kevin_toolbox/computer_science/algorithm/combinatorial_optimization/get_subset_with_largest_product.py,sha256=d43k85Jafgu97E37GtPW2zgOY7O6jwAcZlljr4JJZJ4,1832
 kevin_toolbox/computer_science/algorithm/combinatorial_optimization/zero_one_knapsack_problem.py,sha256=PR-JBphNdGZZvg016Q5iKzU9c44dTbqRFWrOg31EaIY,2819
 kevin_toolbox/computer_science/algorithm/combinatorial_optimization/test/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-kevin_toolbox/computer_science/algorithm/combinatorial_optimization/test/test_get_subset_with_largest_product.py,sha256=mQUFW78zxXjN7Iqw599Ny1EOoXZny83uH-lTofBU4qg,1912
-kevin_toolbox/computer_science/algorithm/combinatorial_optimization/test/test_zero_one_knapsack_problem.py,sha256=se7Y08XmdKCIqyiOkN68nVdtk8oc-89zwuBAfTpAVN8,2076
+kevin_toolbox/computer_science/algorithm/combinatorial_optimization/test/test_get_subset_with_largest_product.py,sha256=5nq_YH_w4i6ThNTw6sErI_FcbIgsk92hxM8bNfS2EXg,1920
+kevin_toolbox/computer_science/algorithm/combinatorial_optimization/test/test_zero_one_knapsack_problem.py,sha256=SkconcER67bn76gbTfI_M2orqqNVPgcvOV-EY2uHCOY,2084
+kevin_toolbox/computer_science/algorithm/pareto_front/__init__.py,sha256=LbeaSzG0hkx8NHAlzvEalrGi2WufaXguVfeBRzaw-MA,57
+kevin_toolbox/computer_science/algorithm/pareto_front/get_pareto_points_idx.py,sha256=a-8Js-dpkuVu9MsImW9hwHp9OTC278xo9oJP96oX0Io,2712
 kevin_toolbox/computer_science/algorithm/search/__init__.py,sha256=zja7FXLTNd2dSVzzGp1TbBp4i3TDY8S9tcJ9pqc684A,41
 kevin_toolbox/computer_science/algorithm/search/binary_search.py,sha256=FcOdgxfuNews_AhPF_CoQDr2vBPqpUpifF7Fmgml1p4,1013
 kevin_toolbox/computer_science/algorithm/statistician/__init__.py,sha256=mSSRifAV2aFbz6JTUaRftZIBPztneUywmNCsYgKxSsw,67
 kevin_toolbox/computer_science/algorithm/statistician/exponential_moving_average.py,sha256=qYTJM5n87MpFZ6usSwOtq647cUlwSQMNlq26JsrpcuU,6422
-kevin_toolbox/computer_science/algorithm/utils/__init__.py,sha256=c6Etfpxfl89bmIOBXMCTbdUnbDtlam39W-sY2qB1js4,37
-kevin_toolbox/computer_science/algorithm/utils/get_subsets.py,sha256=uVc2pf9cBjX9sWd9VJ3w6nbsRPaeFT1fXRFfGl1zk6Q,309
+kevin_toolbox/computer_science/algorithm/utils/__init__.py,sha256=B33boOTyyrgEW7lu89pA68_ZvA1NGo7X5Dnbpb0SzTI,31
+kevin_toolbox/computer_science/algorithm/utils/get_hash.py,sha256=s2LLPxn9qV7wpVdDpCH-bBDzvUy2IWiLVSbF3Faixag,922
+kevin_toolbox/computer_science/algorithm/utils/for_dict/__init__.py,sha256=YFxhbWIsOMGf7ay3fh0sosvXzpuqQQC1bkXK75LAqO4,37
+kevin_toolbox/computer_science/algorithm/utils/for_dict/deep_update.py,sha256=GN5hq5cAorANwSkvgXNyXyAtrQIRzysEtUK_7zjWp9k,767
+kevin_toolbox/computer_science/algorithm/utils/for_seq/__init__.py,sha256=qXNVulpOBOWlD2yJ9L4D5bfrNFmnBd29ibtUbvaJHYk,76
+kevin_toolbox/computer_science/algorithm/utils/for_seq/flatten_list.py,sha256=v_nC2zyOcVXmZnGfV9YTCo5pqV8F5AHJCEixhF3cGe8,1015
+kevin_toolbox/computer_science/algorithm/utils/for_seq/get_subsets.py,sha256=uVc2pf9cBjX9sWd9VJ3w6nbsRPaeFT1fXRFfGl1zk6Q,309
 kevin_toolbox/computer_science/data_structure/__init__.py,sha256=_esL73v9Gi40xb5N7UGxslIk8yHM6idQlXbzELR7XhA,31
 kevin_toolbox/computer_science/data_structure/executor.py,sha256=i-2zQj4lj597BvkarCMT-gYxhoRe8cHyQyO98X7m-9E,6206
 kevin_toolbox/dangerous/__init__.py,sha256=7TqcyVO0IUUZnFw6vFybvdY7UCg-Bv1Moh95IIVMT2c,93
@@ -167,6 +174,8 @@ kevin_toolbox/patches/for_matplotlib/__init__.py,sha256=VNY4dGXSaB87HWek85xDRGOf
 kevin_toolbox/patches/for_matplotlib/add_trajectory_2d.py,sha256=mKXRUNJiEZBcff3pAkwL_gcKGn55CLRhYCTSd3fj1Go,1837
 kevin_toolbox/patches/for_matplotlib/add_trajectory_3d.py,sha256=VGlZfVY0xhUBOUzWJVPxZZNHHRvWLR0HZzhADA_cbsU,1696
 kevin_toolbox/patches/for_matplotlib/arrow3d.py,sha256=JSnNMr1hU2N4FUX526I4MDr04mksDgu4VuegYFDxk1Q,1361
+kevin_toolbox/patches/for_os/__init__.py,sha256=mdbhe6Nvgbkt8v960ATmnKtF-4ds94yIU0-k3k14dHc,27
+kevin_toolbox/patches/for_os/remove.py,sha256=v2Bl1_zFyCXKow0N4Cg3Lw5i9SJx2FSn301BsjsYkvA,618
 kevin_toolbox/patches/for_test/__init__.py,sha256=sFr2VZD1zk8Vtjq2_F8uE4xNovJF6yDY8j1YND5XAw0,49
 kevin_toolbox/patches/for_test/check_consistency.py,sha256=jwL8hoY_T5baE9N7YH9bzVw0mHD130gXxt-koK1PV_4,2518
 kevin_toolbox/patches/for_torch/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
@@ -182,7 +191,7 @@ kevin_toolbox/patches/for_torch/compatible/nn/sequential.py,sha256=wEHNx6lJGHcVM
 kevin_toolbox/patches/for_torch/math/__init__.py,sha256=RMWPKn3mBPmq9C6--I3jtTsPI1t77IBmCN-dWkEYpuI,68
 kevin_toolbox/patches/for_torch/math/get_y_at_x.py,sha256=bfoVcasZ_tMdhR_1Me0JlixQNkUEbMik8iBlqpDjJ94,2047
 kevin_toolbox/patches/for_torch/math/my_around.py,sha256=ptpU3ids50gwf663EpHbw7raj9tNrDGBFZ5t_uMNH14,1378
-kevin_toolbox_dev-1.0.0.dist-info/METADATA,sha256=z4tnKneko54cwcz0GjDUW_6ew1FO5EOyV01AXGPo5C4,1486
-kevin_toolbox_dev-1.0.0.dist-info/WHEEL,sha256=G16H4A3IeoQmnOrYV4ueZGKSjhipXx8zc8nu9FGlvMA,92
-kevin_toolbox_dev-1.0.0.dist-info/top_level.txt,sha256=S5TeRGF-PwlhsaUEPTI-f2vWrpLmh3axpyI6v-Fi75o,14
-kevin_toolbox_dev-1.0.0.dist-info/RECORD,,
+kevin_toolbox_dev-1.0.1.5.dist-info/METADATA,sha256=dBkPGYDgPJUNILEZ-BDtxg9f0l_YPRyGJlQ6EcVSa10,2053
+kevin_toolbox_dev-1.0.1.5.dist-info/WHEEL,sha256=G16H4A3IeoQmnOrYV4ueZGKSjhipXx8zc8nu9FGlvMA,92
+kevin_toolbox_dev-1.0.1.5.dist-info/top_level.txt,sha256=S5TeRGF-PwlhsaUEPTI-f2vWrpLmh3axpyI6v-Fi75o,14
+kevin_toolbox_dev-1.0.1.5.dist-info/RECORD,,