kevin-toolbox-dev 1.0.0__tar.gz → 1.0.1__tar.gz

{kevin-toolbox-dev-1.0.0 → kevin-toolbox-dev-1.0.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: kevin-toolbox-dev
-Version: 1.0.0
+Version: 1.0.1
 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
@@ -13,6 +13,8 @@ Classifier: Programming Language :: Python
 Classifier: Programming Language :: Python :: 3
 Requires-Python: >=3.6
 Description-Content-Type: text/markdown
+Provides-Extra: plot
+Provides-Extra: rest
 
 # kevin_toolbox
 
@@ -46,13 +48,23 @@ 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
+
 
 
 

{kevin-toolbox-dev-1.0.0 → kevin-toolbox-dev-1.0.1}/README.md

@@ -30,13 +30,23 @@ 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
+
 
 
 

{kevin-toolbox-dev-1.0.0 → kevin-toolbox-dev-1.0.1}/kevin_toolbox/__init__.py

@@ -1,4 +1,4 @@
-__version__ = "1.0.0"
+__version__ = "1.0.1"
 
 
 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 1688897267 --verbose True'
 )

{kevin-toolbox-dev-1.0.0 → kevin-toolbox-dev-1.0.1}/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-dev-1.0.0 → kevin-toolbox-dev-1.0.1}/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-dev-1.0.1/kevin_toolbox/computer_science/algorithm/pareto_front/__init__.py

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

kevin-toolbox-dev-1.0.1/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-dev-1.0.1/kevin_toolbox/computer_science/algorithm/utils/__init__.py

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

kevin-toolbox-dev-1.0.1/kevin_toolbox/computer_science/algorithm/utils/for_dict/__init__.py

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

kevin-toolbox-dev-1.0.1/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-dev-1.0.1/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-dev-1.0.1/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-dev-1.0.1/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"Warning: 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=[3], length=8, mode="sha512"))

{kevin-toolbox-dev-1.0.0 → kevin-toolbox-dev-1.0.1}/kevin_toolbox_dev.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: kevin-toolbox-dev
-Version: 1.0.0
+Version: 1.0.1
 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
@@ -13,6 +13,8 @@ Classifier: Programming Language :: Python
 Classifier: Programming Language :: Python :: 3
 Requires-Python: >=3.6
 Description-Content-Type: text/markdown
+Provides-Extra: plot
+Provides-Extra: rest
 
 # kevin_toolbox
 
@@ -46,13 +48,23 @@ 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
+
 
 
 

{kevin-toolbox-dev-1.0.0 → kevin-toolbox-dev-1.0.1}/kevin_toolbox_dev.egg-info/SOURCES.txt

@@ -11,12 +11,19 @@ kevin_toolbox/computer_science/algorithm/combinatorial_optimization/zero_one_kna
 kevin_toolbox/computer_science/algorithm/combinatorial_optimization/test/__init__.py
 kevin_toolbox/computer_science/algorithm/combinatorial_optimization/test/test_get_subset_with_largest_product.py
 kevin_toolbox/computer_science/algorithm/combinatorial_optimization/test/test_zero_one_knapsack_problem.py
+kevin_toolbox/computer_science/algorithm/pareto_front/__init__.py
+kevin_toolbox/computer_science/algorithm/pareto_front/get_pareto_points_idx.py
 kevin_toolbox/computer_science/algorithm/search/__init__.py
 kevin_toolbox/computer_science/algorithm/search/binary_search.py
 kevin_toolbox/computer_science/algorithm/statistician/__init__.py
 kevin_toolbox/computer_science/algorithm/statistician/exponential_moving_average.py
 kevin_toolbox/computer_science/algorithm/utils/__init__.py
-kevin_toolbox/computer_science/algorithm/utils/get_subsets.py
+kevin_toolbox/computer_science/algorithm/utils/get_hash.py
+kevin_toolbox/computer_science/algorithm/utils/for_dict/__init__.py
+kevin_toolbox/computer_science/algorithm/utils/for_dict/deep_update.py
+kevin_toolbox/computer_science/algorithm/utils/for_seq/__init__.py
+kevin_toolbox/computer_science/algorithm/utils/for_seq/flatten_list.py
+kevin_toolbox/computer_science/algorithm/utils/for_seq/get_subsets.py
 kevin_toolbox/computer_science/data_structure/__init__.py
 kevin_toolbox/computer_science/data_structure/executor.py
 kevin_toolbox/dangerous/__init__.py

kevin-toolbox-dev-1.0.1/kevin_toolbox_dev.egg-info/requires.txt

@@ -0,0 +1,9 @@
+torch>=1.2.0
+numpy>=1.19.0
+
+[plot]
+matplotlib>=3.0
+
+[rest]
+pytest>=6.2.5
+line-profiler>=3.5

{kevin-toolbox-dev-1.0.0 → kevin-toolbox-dev-1.0.1}/setup.cfg

@@ -19,13 +19,18 @@ classifiers =
 [options]
 install_requires = 
 	torch>=1.2.0
-	numpy >=1.19.0
-	matplotlib>=3.0
+	numpy>=1.19.0
 python_requires = >=3.6
 tests_require = 
 	pytest>=6.2.5
 	line-profiler>=3.5
 
+[options.extras_require]
+plot = matplotlib>=3.0
+rest = 
+	pytest>=6.2.5
+	line-profiler>=3.5
+
 [egg_info]
 tag_build = 
 tag_date = 0

kevin-toolbox-dev-1.0.0/kevin_toolbox/computer_science/algorithm/utils/__init__.py

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

kevin-toolbox-dev-1.0.0/kevin_toolbox_dev.egg-info/requires.txt

@@ -1,3 +0,0 @@
-torch>=1.2.0
-numpy>=1.19.0
-matplotlib>=3.0