PyPyNum 1.14.0__py3-none-any.whl → 1.14.1__py3-none-any.whl

{PyPyNum-1.14.0.dist-info → PyPyNum-1.14.1.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: PyPyNum
-Version: 1.14.0
+Version: 1.14.1
 Summary: PyPyNum is a Python library for math & science computations, covering algebra, calculus, stats, with data structures like matrices, vectors, tensors. It offers numerical tools, programs, and supports computational ops, functions, processing, simulation, & visualization in data science & ML, crucial for research, engineering, & data processing.
 Home-page: https://github.com/PythonSJL/PyPyNum
 Author: Shen Jiayi
@@ -234,7 +234,7 @@ processing.</font><font color = red>[Python>=3.4]</font>
 [![Downloads](https://static.pepy.tech/badge/pypynum/month)](https://pepy.tech/project/pypynum)
 [![Downloads](https://static.pepy.tech/badge/pypynum/week)](https://pepy.tech/project/pypynum)
 
-## Version -> 1.14.0 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum | GitHub -> https://github.com/PythonSJL/PyPyNum
+## Version -> 1.14.1 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum | GitHub -> https://github.com/PythonSJL/PyPyNum
 
 ![LOGO](PyPyNum.png)
 
@@ -298,16 +298,15 @@ The logo cannot be displayed on PyPI, it can be viewed in Gitee or GitHub.
 ### The Zen of PyPyNum (Preview)
 
 ```
-    The Zen of PyPyNum, by Shen Jiayi
-
-This is a math package written purely in Python.
-
-Elegant is superior to clunky.
-Clarity trumps obscurity.
-Straightforwardness is preferred over convolution.
-Sophisticated is better than overcomplicated.
-Flat structure beats nested hierarchies.
-Sparse code wins over bloated ones.
+                The Zen of PyPyNum, by Shen Jiayi
+
+In this mathematical sanctuary, we weave our algorithms with pure Python threads.
+Precision outweighs approximation.
+Elegance in mathematics transcends the bulky algorithms.
+Clarity in logic illuminates the darkest problems.
+Simplicity in form is the pinnacle of sophistication.
+Flat hierarchies in our code mirror the linear nature of functions.
+Sparse code, like a minimal polynomial, retains essence without redundancy.
 ```
 
 ```
@@ -321,7 +320,7 @@ Python interpreter and run it!
 ```
 
 ```
-                                        February 27, 2024
+                                                                September 5, 2024
 ```
 
 ### Functional changes compared to the previous version
@@ -329,47 +328,39 @@ Python interpreter and run it!
 ```
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-750 new lines have been added to the code
+< Fixed the display issue of multi precision complex numbers >
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-Newly added functions and classes
+< Updated the Zen content of the project >
 
+!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-├── bessel
-│   ├── CLASS
+< The following two function names have removed the 'generate' prefix >
+
+generate_primes(limit: int) -> list
+generate_semiprimes(limit: int) -> list
+
+!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
+
+<<< Newly added functions and classes >>>
+
+PyPyNum
+├── Matrix
 │   └── FUNCTION
-│       ├── bessel_i0(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       ├── bessel_i1(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       ├── bessel_iv(v: typing.Union[int, float], x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       ├── bessel_j0(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       ├── bessel_j1(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       └── bessel_jv(v: typing.Union[int, float], x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-├── crandom
+│       └── triu_indices(n: int, k: int, m: int) -> tuple  # Returns the indices of the upper triangular part of a matrix
+├── multiprec
 │   └── FUNCTION
-│       ├── randint_polar(left: int, right: int, mod: typing.Union[int, float], angle: typing.Union[int, float]) -> complex
-│       ├── randint_rect(left: int, right: int, real: typing.Union[int, float], imag: typing.Union[int, float]) -> complex
-│       ├── random_polar(mod: typing.Union[int, float], angle: typing.Union[int, float]) -> complex
-│       ├── random_rect(real: typing.Union[int, float], imag: typing.Union[int, float]) -> complex
-│       ├── uniform_polar(left: typing.Union[int, float], right: typing.Union[int, float], mod: typing.Union[int, float], angle: typing.Union[int, float]) -> complex
-│       └── uniform_rect(left: typing.Union[int, float], right: typing.Union[int, float], real: typing.Union[int, float], imag: typing.Union[int, float]) -> complex
-├── dataproc
-│   ├── CLASS
-│   │   └── Series(object)/__init__(self: Any, data: typing.Any, index: typing.Any) -> None
-├── maths
+│       ├── mp_euler_gamma(sigfigs: int) -> decimal.Decimal  # Returns the Euler-Mascheroni constant with specified significant figures
+├── sequence
 │   └── FUNCTION
-│       ├── quantile(data: list, q: float, interpolation: str, ordered: bool) -> float
-├── numbers
+│       ├── bell_triangle(n: int) -> list  # Returns the first n rows of the Bell triangle
+│       ├── pascal_triangle(n: int) -> list  # Returns the first n rows of Pascal's triangle
+│       ├── stirling1(n: int) -> list  # Returns the first n rows of Stirling numbers of the first kind
+│       └── stirling2(n: int) -> list  # Returns the first n rows of Stirling numbers of the second kind
+├── tools
 │   └── FUNCTION
-│       ├── parse_float(s: str) -> tuple
-│       ├── split_float(s: str) -> tuple
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-Tip: The second type of Bessel
-function has not been
-implemented yet, but will be
-added in future versions.
+│       └── twinprimes(limit: int) -> list  # Returns all twin prime pairs up to and including the specified limit
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 ```
@@ -484,7 +475,8 @@ PyPyNum
 │       ├── rank_decomp(matrix: pypynum.Matrix.Matrix) -> tuple
 │       ├── rotate90(matrix: pypynum.Matrix.Matrix, times: int) -> pypynum.Matrix.Matrix
 │       ├── svd(matrix: pypynum.Matrix.Matrix) -> tuple
-│       └── tril_indices(n: int, k: int, m: int) -> tuple
+│       ├── tril_indices(n: int, k: int, m: int) -> tuple
+│       └── triu_indices(n: int, k: int, m: int) -> tuple
 ├── NeuralN
 │   ├── CLASS
 │   │   └── NeuralNetwork(object)/__init__(self: Any, _input: Any, _hidden: Any, _output: Any) -> Any
@@ -735,6 +727,7 @@ PyPyNum
 │       ├── mp_cos(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
 │       ├── mp_cosh(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
 │       ├── mp_e(sigfigs: int, method: str) -> decimal.Decimal
+│       ├── mp_euler_gamma(sigfigs: int) -> decimal.Decimal
 │       ├── mp_exp(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int, builtin: bool) -> decimal.Decimal
 │       ├── mp_fresnel_c(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
 │       ├── mp_fresnel_s(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
@@ -800,12 +793,16 @@ PyPyNum
 │   ├── CLASS
 │   └── FUNCTION
 │       ├── arithmetic_sequence(a1: typing.Union[int, float], an: typing.Union[int, float], d: typing.Union[int, float], n: typing.Union[int, float], s: typing.Union[int, float]) -> dict
+│       ├── bell_triangle(n: int) -> list
 │       ├── bernoulli(n: int, single: bool) -> list
 │       ├── catalan(n: int, single: bool) -> typing.Union[int, list]
 │       ├── farey(n: int) -> list
 │       ├── fibonacci(n: int, single: bool) -> typing.Union[int, list]
 │       ├── geometric_sequence(a1: typing.Union[int, float], an: typing.Union[int, float], r: typing.Union[int, float], n: typing.Union[int, float], s: typing.Union[int, float]) -> dict
-│       └── recaman(n: int, single: bool) -> typing.Union[int, list]
+│       ├── pascal_triangle(n: int) -> list
+│       ├── recaman(n: int, single: bool) -> typing.Union[int, list]
+│       ├── stirling1(n: int) -> list
+│       └── stirling2(n: int) -> list
 ├── stattest
 │   ├── CLASS
 │   └── FUNCTION
@@ -827,15 +824,16 @@ PyPyNum
 │       ├── classify(array: typing.Union[list, tuple]) -> dict
 │       ├── dedup(iterable: typing.Union[list, tuple, str]) -> typing.Union[list, tuple, str]
 │       ├── frange(start: typing.Union[int, float], stop: typing.Union[int, float], step: float) -> list
-│       ├── generate_primes(limit: int) -> list
-│       ├── generate_semiprimes(limit: int) -> list
 │       ├── geomspace(start: typing.Union[int, float], stop: typing.Union[int, float], number: int) -> list
 │       ├── levenshtein_distance(s1: str, s2: str) -> int
 │       ├── linspace(start: typing.Union[int, float], stop: typing.Union[int, float], number: int) -> list
 │       ├── magic_square(n: Any) -> Any
 │       ├── primality(n: int, iter_num: int) -> bool
 │       ├── prime_factors(integer: int, dictionary: bool, pollard_rho: bool) -> typing.Union[list, dict]
-│       └── split(iterable: typing.Union[list, tuple, str], key: typing.Union[list, tuple], retain: bool) -> list
+│       ├── primes(limit: int) -> list
+│       ├── semiprimes(limit: int) -> list
+│       ├── split(iterable: typing.Union[list, tuple, str], key: typing.Union[list, tuple], retain: bool) -> list
+│       └── twinprimes(limit: int) -> list
 ├── types
 │   ├── CLASS
 │   └── FUNCTION

{PyPyNum-1.14.0.dist-info → PyPyNum-1.14.1.dist-info}/RECORD

@@ -4,16 +4,16 @@ pypynum/Geometry.py,sha256=bJCuif-wHO-t7oHFEE7ntzIdQwzUEbT3mcKgmBV6Wps,13982
 pypynum/Graph.py,sha256=m9iTCNYRCZmAexDzwJ8Y6J7v1aweT-6TZkqh4fOtZDE,10131
 pypynum/Group.py,sha256=kzUR_r10ubOB2o51rKKdQPHRsgdTGL2yoY7yseKInZc,4263
 pypynum/Logic.py,sha256=IJAv59ECHU0HmG9lYCAQ_puqeL6Zor3-IDIVH48KBWE,11000
-pypynum/Matrix.py,sha256=_MMb2HsarLzPRGIR2tI4G7yPPvYpjIODYMgf6wdQmxw,20344
+pypynum/Matrix.py,sha256=C84xfnTsg9N8FJXYzSORLHoRsch04PBbvMgPmjVFLuE,20612
 pypynum/NeuralN.py,sha256=iSOvC9JW1h4AFGokGGOTkKie5hAYN_YT9H4f3apI9b8,3275
 pypynum/PyPyNum.png,sha256=t96tJPWfHxT8kcXm_qZI2z5W36TgOqjCU9qdgbmlFws,11623
 pypynum/Quaternion.py,sha256=-BW_crP_i-veHN0_pD3Z1dipFNUX198oZDrUYTsoZw0,8017
-pypynum/README.md,sha256=YQBK6hsNy4HEvMN_cGq6wmVYBrhIsx4vzsuaEEXh6sw,77084
+pypynum/README.md,sha256=ZGKsMqWmWtoUADcjjrURWUbwWaqN4CuiXDjTvVBKj-g,76730
 pypynum/Symbolics.py,sha256=u-Dig3OLs6qoLzxMpTAYJGq5uSWDMvgU13TAHKLyjMY,2768
 pypynum/Tensor.py,sha256=gi7OjrGgP5BSJS9Oma1B2EdX9qSpMNIP2BnKLojdT78,3930
 pypynum/Tree.py,sha256=BYnlb2kKNJ8kkuq8BAHIcLvPZw5KHxbvM7YuVGhQVMk,4330
 pypynum/Vector.py,sha256=ee-gkBtyG0l5dLFwAKRTTlnDG05pWpM19RGN7VoPvqE,3212
-pypynum/__init__.py,sha256=It1LOKG9ytQmk3Le0OJ982C4TgG3Q5WefyAeclzkW8U,2984
+pypynum/__init__.py,sha256=eyYuIv8qPb8BkFu2aQ18HZ3cc7HEf0O2K8ayZyKJL4E,3008
 pypynum/bessel.py,sha256=4g4XZAw1craezmxkYkvyPt1OlKjJU1JCqn_SZKME3PY,4164
 pypynum/chars.py,sha256=ZOXZn2VzxmpHuvZ87ojhEib3CfTNgysRsFMFITHOA2E,2179
 pypynum/cipher.py,sha256=DaitY3DCoTuzyrXtD8Ap3IYDLhlMc7-o4AJfLlicvB4,10011
@@ -21,30 +21,30 @@ pypynum/confs.py,sha256=iFz83iZ1A4BK4LTqo-ZbpAcoxhYWUxtEQKsr_-d8ryw,2869
 pypynum/constants.py,sha256=xELv4DIKEqBdwF9tUqCmTQVbgVrlrj385ht5eawvshU,1406
 pypynum/crandom.py,sha256=44GZ7o6y5PwgL-cZLkXUZaAUfiW6aadyRNfMdxTnH30,5111
 pypynum/dataproc.py,sha256=xQJUvndP4APff2wpu2HItDZKWqrRZt72AU9CA8i-7tM,9277
-pypynum/dists.py,sha256=WHDeM0oC4Do77p9TVVMu3pgWzI04gYdK_s1TNGhets0,29697
+pypynum/dists.py,sha256=qyZLsXF1x3QYjsge50wMWrPcFoMHs5yBbHAbg5L9rDw,29698
 pypynum/equations.py,sha256=26XEQBIcL3cyPLO6YFvBK1dlFHw-du3nQG4-cXAFYe0,557
 pypynum/errors.py,sha256=XlK5yazNbNtnbM4toT_bdI41u-q-AUkZsa7dqc5dQb0,264
 pypynum/file.py,sha256=-sg3pndZdiyM8cS6KeIhCvB6NfAovHnLOhEf0XkjidE,3411
 pypynum/image.py,sha256=nhTZmaBVIKhuar-CcwZWb-hRYmkj4b_g7vIlYvEJEEE,12155
 pypynum/interp.py,sha256=X1LN4WiVYkZlyKXvK_KJ2KDgjDiW_-tqgFM4ySQ3yJk,4897
-pypynum/maths.py,sha256=0Z0qCN_Rh6pQydBCnvufNpTUIfo2GQGPbpJQbuSccQs,32818
-pypynum/multiprec.py,sha256=W4G48VXsTs13VFolcTjcE_BHQWccdl2PlC5coAT4V90,18405
+pypynum/maths.py,sha256=McuOXRktbjcjZpTfWEoHnmFkeeQVacMoHyThqTIC27E,32808
+pypynum/multiprec.py,sha256=NKZC5kIEg63WuTK5YCATuHP6ArSGHUKQpMHPmZ7GJ0k,19091
 pypynum/numbers.py,sha256=EPzw8zq5U7GQj8URu2VxeVIXS-_XQm2ADmSAIHa816k,11133
 pypynum/plotting.py,sha256=mbIYK5TpY1qvuMJrqz4d8bxJEiZww3AI684vSKV-DgU,7781
 pypynum/polynomial.py,sha256=60hDQG_iRwduFFqawSTzAG6F3eHqfgrSnSGDwBLQB-s,14587
 pypynum/pprinters.py,sha256=Qt9-V5SUyoOqC3lsUU5D5zSSM-MmcnFCUyUtLxhS4pE,2514
 pypynum/random.py,sha256=qy2ISoHQVJ-zOVITplmCGvWEw-EZc18r-hZl8dvDimE,2274
 pypynum/regression.py,sha256=PfTM8glJSi3Jgvc_C_3hQBeVjkbrzSuDqRbEf3s403w,2040
-pypynum/sequence.py,sha256=7NSZm_p_B00KFj5XZrtSm2FXhsowxs0qg_Q_P4pAA8o,7194
+pypynum/sequence.py,sha256=L8xaFGjFy5X4NKS4wkDGx9RSzkrWDZF__rLFdnnNEIA,8443
 pypynum/stattest.py,sha256=W1041KeVsvdcLKFJOK4hQm_DjO5ZjUE8WEmGUe-4_Zk,5507
 pypynum/test.py,sha256=tjJI8YkAqNEtwNeFsixWliZfc3J1qVpgCo4u-Wh9kvw,8826
-pypynum/this.py,sha256=oRX1OpMa4NJmQSdEjJxfszEo5FRYlxRiF8OTDRIcdMA,2154
-pypynum/tools.py,sha256=0k8ZC-LcZ9BZqPYV487aPr95K1EoX-oHOalWjg9or3Y,12554
+pypynum/this.py,sha256=wT7DwodxqOQ7LoDaUtvskMkAb8CODL_56mtXPy12P54,3411
+pypynum/tools.py,sha256=r94-thFR4MzrGSNpNwdYJV60JBqZoT0aH2T8-ghsgRQ,14305
 pypynum/types.py,sha256=ek9tydfCspsjcvxVFv_rJegnTHl6PHwKPdqjvHfkvDg,246
 pypynum/ufuncs.py,sha256=hb7v4DgJ1eUB16uQ_m-OUfM9e2rIKwPk03shd1cBx0o,3547
 pypynum/utils.py,sha256=OqUFVraYDTSubF9QhZm8WC6A0ppnkhVU0YtAeYN9EyU,21048
 pypynum/zh_cn.py,sha256=VfmCAtL9CZaHuridOswBTGVGPwyu_4v19Leb0niqxtY,13723
-PyPyNum-1.14.0.dist-info/METADATA,sha256=yHYtsquvIz5mb_kCo_xF5l6mxVPY3u7S6Lv66SlaZ3I,91463
-PyPyNum-1.14.0.dist-info/WHEEL,sha256=GJ7t_kWBFywbagK5eo9IoUwLW6oyOeTKmQ-9iHFVNxQ,92
-PyPyNum-1.14.0.dist-info/top_level.txt,sha256=4wW_Xb4bRglmiMsdPAe9f75MkXhNpuN88H17g_Cr5u8,8
-PyPyNum-1.14.0.dist-info/RECORD,,
+PyPyNum-1.14.1.dist-info/METADATA,sha256=nncMFGDv-KkzXh5IPLgrtzJZR0craxK4B0iZzoUHSUc,91109
+PyPyNum-1.14.1.dist-info/WHEEL,sha256=GJ7t_kWBFywbagK5eo9IoUwLW6oyOeTKmQ-9iHFVNxQ,92
+PyPyNum-1.14.1.dist-info/top_level.txt,sha256=4wW_Xb4bRglmiMsdPAe9f75MkXhNpuN88H17g_Cr5u8,8
+PyPyNum-1.14.1.dist-info/RECORD,,

pypynum/Matrix.py

@@ -297,11 +297,20 @@ def lu(matrix: Matrix) -> tuple:
     return Matrix(L), Matrix(U)
 
 
+def triu_indices(n: int, k: int = 0, m: int = None) -> tuple:
+    if m is None:
+        m = n
+    if n < 1 or k >= m or m < 1:
+        return (), ()
+    indices = [(y, x) for y in range(n) for x in range(y + k, m) if x > -1]
+    return tuple(zip(*indices))
+
+
 def tril_indices(n: int, k: int = 0, m: int = None) -> tuple:
     if m is None:
         m = n
     if n < 1 or k <= -n or m < 1:
-        return [], []
+        return (), ()
     indices = [(y, x) for y in range(n) for x in range(y + k + 1) if x < m]
     return tuple(zip(*indices))
 

pypynum/README.md

@@ -20,7 +20,7 @@ processing.</font><font color = red>[Python>=3.4]</font>
 [![Downloads](https://static.pepy.tech/badge/pypynum/month)](https://pepy.tech/project/pypynum)
 [![Downloads](https://static.pepy.tech/badge/pypynum/week)](https://pepy.tech/project/pypynum)
 
-## Version -> 1.14.0 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum | GitHub -> https://github.com/PythonSJL/PyPyNum
+## Version -> 1.14.1 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum | GitHub -> https://github.com/PythonSJL/PyPyNum
 
 ![LOGO](PyPyNum.png)
 
@@ -84,16 +84,15 @@ The logo cannot be displayed on PyPI, it can be viewed in Gitee or GitHub.
 ### The Zen of PyPyNum (Preview)
 
 ```
-    The Zen of PyPyNum, by Shen Jiayi
-
-This is a math package written purely in Python.
-
-Elegant is superior to clunky.
-Clarity trumps obscurity.
-Straightforwardness is preferred over convolution.
-Sophisticated is better than overcomplicated.
-Flat structure beats nested hierarchies.
-Sparse code wins over bloated ones.
+                The Zen of PyPyNum, by Shen Jiayi
+
+In this mathematical sanctuary, we weave our algorithms with pure Python threads.
+Precision outweighs approximation.
+Elegance in mathematics transcends the bulky algorithms.
+Clarity in logic illuminates the darkest problems.
+Simplicity in form is the pinnacle of sophistication.
+Flat hierarchies in our code mirror the linear nature of functions.
+Sparse code, like a minimal polynomial, retains essence without redundancy.
 ```
 
 ```
@@ -107,7 +106,7 @@ Python interpreter and run it!
 ```
 
 ```
-                                        February 27, 2024
+                                                                September 5, 2024
 ```
 
 ### Functional changes compared to the previous version
@@ -115,47 +114,39 @@ Python interpreter and run it!
 ```
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-750 new lines have been added to the code
+< Fixed the display issue of multi precision complex numbers >
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-Newly added functions and classes
+< Updated the Zen content of the project >
 
+!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-├── bessel
-│   ├── CLASS
+< The following two function names have removed the 'generate' prefix >
+
+generate_primes(limit: int) -> list
+generate_semiprimes(limit: int) -> list
+
+!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
+
+<<< Newly added functions and classes >>>
+
+PyPyNum
+├── Matrix
 │   └── FUNCTION
-│       ├── bessel_i0(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       ├── bessel_i1(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       ├── bessel_iv(v: typing.Union[int, float], x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       ├── bessel_j0(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       ├── bessel_j1(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       └── bessel_jv(v: typing.Union[int, float], x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-├── crandom
+│       └── triu_indices(n: int, k: int, m: int) -> tuple  # Returns the indices of the upper triangular part of a matrix
+├── multiprec
 │   └── FUNCTION
-│       ├── randint_polar(left: int, right: int, mod: typing.Union[int, float], angle: typing.Union[int, float]) -> complex
-│       ├── randint_rect(left: int, right: int, real: typing.Union[int, float], imag: typing.Union[int, float]) -> complex
-│       ├── random_polar(mod: typing.Union[int, float], angle: typing.Union[int, float]) -> complex
-│       ├── random_rect(real: typing.Union[int, float], imag: typing.Union[int, float]) -> complex
-│       ├── uniform_polar(left: typing.Union[int, float], right: typing.Union[int, float], mod: typing.Union[int, float], angle: typing.Union[int, float]) -> complex
-│       └── uniform_rect(left: typing.Union[int, float], right: typing.Union[int, float], real: typing.Union[int, float], imag: typing.Union[int, float]) -> complex
-├── dataproc
-│   ├── CLASS
-│   │   └── Series(object)/__init__(self: Any, data: typing.Any, index: typing.Any) -> None
-├── maths
+│       ├── mp_euler_gamma(sigfigs: int) -> decimal.Decimal  # Returns the Euler-Mascheroni constant with specified significant figures
+├── sequence
 │   └── FUNCTION
-│       ├── quantile(data: list, q: float, interpolation: str, ordered: bool) -> float
-├── numbers
+│       ├── bell_triangle(n: int) -> list  # Returns the first n rows of the Bell triangle
+│       ├── pascal_triangle(n: int) -> list  # Returns the first n rows of Pascal's triangle
+│       ├── stirling1(n: int) -> list  # Returns the first n rows of Stirling numbers of the first kind
+│       └── stirling2(n: int) -> list  # Returns the first n rows of Stirling numbers of the second kind
+├── tools
 │   └── FUNCTION
-│       ├── parse_float(s: str) -> tuple
-│       ├── split_float(s: str) -> tuple
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-Tip: The second type of Bessel
-function has not been
-implemented yet, but will be
-added in future versions.
+│       └── twinprimes(limit: int) -> list  # Returns all twin prime pairs up to and including the specified limit
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 ```
@@ -270,7 +261,8 @@ PyPyNum
 │       ├── rank_decomp(matrix: pypynum.Matrix.Matrix) -> tuple
 │       ├── rotate90(matrix: pypynum.Matrix.Matrix, times: int) -> pypynum.Matrix.Matrix
 │       ├── svd(matrix: pypynum.Matrix.Matrix) -> tuple
-│       └── tril_indices(n: int, k: int, m: int) -> tuple
+│       ├── tril_indices(n: int, k: int, m: int) -> tuple
+│       └── triu_indices(n: int, k: int, m: int) -> tuple
 ├── NeuralN
 │   ├── CLASS
 │   │   └── NeuralNetwork(object)/__init__(self: Any, _input: Any, _hidden: Any, _output: Any) -> Any
@@ -521,6 +513,7 @@ PyPyNum
 │       ├── mp_cos(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
 │       ├── mp_cosh(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
 │       ├── mp_e(sigfigs: int, method: str) -> decimal.Decimal
+│       ├── mp_euler_gamma(sigfigs: int) -> decimal.Decimal
 │       ├── mp_exp(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int, builtin: bool) -> decimal.Decimal
 │       ├── mp_fresnel_c(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
 │       ├── mp_fresnel_s(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
@@ -586,12 +579,16 @@ PyPyNum
 │   ├── CLASS
 │   └── FUNCTION
 │       ├── arithmetic_sequence(a1: typing.Union[int, float], an: typing.Union[int, float], d: typing.Union[int, float], n: typing.Union[int, float], s: typing.Union[int, float]) -> dict
+│       ├── bell_triangle(n: int) -> list
 │       ├── bernoulli(n: int, single: bool) -> list
 │       ├── catalan(n: int, single: bool) -> typing.Union[int, list]
 │       ├── farey(n: int) -> list
 │       ├── fibonacci(n: int, single: bool) -> typing.Union[int, list]
 │       ├── geometric_sequence(a1: typing.Union[int, float], an: typing.Union[int, float], r: typing.Union[int, float], n: typing.Union[int, float], s: typing.Union[int, float]) -> dict
-│       └── recaman(n: int, single: bool) -> typing.Union[int, list]
+│       ├── pascal_triangle(n: int) -> list
+│       ├── recaman(n: int, single: bool) -> typing.Union[int, list]
+│       ├── stirling1(n: int) -> list
+│       └── stirling2(n: int) -> list
 ├── stattest
 │   ├── CLASS
 │   └── FUNCTION
@@ -613,15 +610,16 @@ PyPyNum
 │       ├── classify(array: typing.Union[list, tuple]) -> dict
 │       ├── dedup(iterable: typing.Union[list, tuple, str]) -> typing.Union[list, tuple, str]
 │       ├── frange(start: typing.Union[int, float], stop: typing.Union[int, float], step: float) -> list
-│       ├── generate_primes(limit: int) -> list
-│       ├── generate_semiprimes(limit: int) -> list
 │       ├── geomspace(start: typing.Union[int, float], stop: typing.Union[int, float], number: int) -> list
 │       ├── levenshtein_distance(s1: str, s2: str) -> int
 │       ├── linspace(start: typing.Union[int, float], stop: typing.Union[int, float], number: int) -> list
 │       ├── magic_square(n: Any) -> Any
 │       ├── primality(n: int, iter_num: int) -> bool
 │       ├── prime_factors(integer: int, dictionary: bool, pollard_rho: bool) -> typing.Union[list, dict]
-│       └── split(iterable: typing.Union[list, tuple, str], key: typing.Union[list, tuple], retain: bool) -> list
+│       ├── primes(limit: int) -> list
+│       ├── semiprimes(limit: int) -> list
+│       ├── split(iterable: typing.Union[list, tuple, str], key: typing.Union[list, tuple], retain: bool) -> list
+│       └── twinprimes(limit: int) -> list
 ├── types
 │   ├── CLASS
 │   └── FUNCTION

pypynum/__init__.py

@@ -20,12 +20,12 @@ Copyright
 
 - Author: Shen Jiayi
 - Email: 2261748025@qq.com
-- Copyright: 2023 to perpetuity. All rights reserved.
+- Copyright: Copyright (c) 2023, Shen Jiayi. All rights reserved.
 """
 
 __author__ = "Shen Jiayi"
 __email__ = "2261748025@qq.com"
-__copyright__ = "2023 to perpetuity. All rights reserved."
+__copyright__ = "Copyright (c) 2023, Shen Jiayi. All rights reserved."
 
 from .Array import array, fill, full, full_like, zeros, zeros_like, ones, ones_like, aslist, asarray, boolarray
 from .bessel import *
@@ -69,7 +69,7 @@ from .utils import OrderedSet, InfIterator, LinkedList, IntervalSet
 from .Vector import vec
 from . import zh_cn
 
-__version__ = "1.14.0"
+__version__ = "1.14.1"
 print("PyPyNum", "Version -> " + __version__, "PyPI -> https://pypi.org/project/PyPyNum/",
       "Gitee -> https://www.gitee.com/PythonSJL/PyPyNum", "GitHub -> https://github.com/PythonSJL/PyPyNum", sep=" | ")
 del math, arr, ite, num, prec, real, geom, ContentError, RandomError, LogicError, InputError, FullError, Union

pypynum/dists.py

@@ -775,7 +775,7 @@ def vonmises_pdf(x, mu, kappa):
     :param kappa: The concentration parameter, must be positive.
     :return: The probability density at x for the von Mises distribution with the given parameters.
     """
-    from .maths import bessel_i0
+    from .bessel import bessel_i0
     if not 0 <= mu < 6.283185307179586:
         raise ValueError("mu must be between 0 and 2 * pi")
     if not 0 <= x < 6.283185307179586:

pypynum/maths.py

@@ -120,7 +120,7 @@ def roll(seq: ite, shift: int) -> ite:
     :param shift: integer
     :return:
     """
-    shift = shift % len(seq)
+    shift %= len(seq)
     return seq[-shift:] + seq[:-shift]
 
 
@@ -945,7 +945,7 @@ def deriv(f, x: float, h: float = 1e-6, method: str = "complex_step", *args, **k
     if method == "complex_step":
         return f(x + 1j * h, *args, **kwargs).imag / h
     elif method == "central_difference":
-        h = h / 2
+        h /= 2
         return (f(x + h, *args, **kwargs) - f(x - h, *args, **kwargs)) / (2 * h)
     elif method == "forward_difference":
         return (f(x + h, *args, **kwargs) - f(x, *args, **kwargs)) / h

pypynum/multiprec.py

@@ -18,7 +18,7 @@ def frac2dec(frac: Fraction, sigfigs: int) -> Decimal:
 def mp_e(sigfigs: int, method: str = "series") -> Decimal:
     def series_e():
         nonlocal sigfigs
-        sigfigs = sigfigs + 5
+        sigfigs += 5
         __context.prec = sigfigs
         e = Decimal(0)
         one = Decimal(1)
@@ -55,7 +55,7 @@ def mp_e(sigfigs: int, method: str = "series") -> Decimal:
 def mp_pi(sigfigs: int, method: str = "chudnovsky") -> Decimal:
     def chudnovsky_pi():
         nonlocal sigfigs
-        sigfigs = sigfigs + 5
+        sigfigs += 5
         __context.prec = sigfigs
         c = 426880 * Decimal(10005).sqrt()
         m = 1
@@ -77,7 +77,7 @@ def mp_pi(sigfigs: int, method: str = "chudnovsky") -> Decimal:
 
     def bbp_pi():
         nonlocal sigfigs
-        sigfigs = sigfigs + 5
+        sigfigs += 5
         __context.prec = sigfigs
         d4 = Decimal(4)
         d2 = Decimal(2)
@@ -114,7 +114,7 @@ def mp_phi(sigfigs: int, method: str = "algebraic") -> Decimal:
 
     def newton_phi():
         nonlocal sigfigs
-        sigfigs = sigfigs + 5
+        sigfigs += 5
         __context.prec = sigfigs
         one = Decimal(1)
         two = Decimal(2)
@@ -138,7 +138,7 @@ def mp_phi(sigfigs: int, method: str = "algebraic") -> Decimal:
 
 def mp_sin(x: prec, sigfigs: int) -> Decimal:
     x = Decimal(str(x))
-    sigfigs = sigfigs + 5
+    sigfigs += 5
     __context.prec = sigfigs
     sin_x = Decimal(0)
     pi = mp_pi(sigfigs + 5)
@@ -157,7 +157,7 @@ def mp_sin(x: prec, sigfigs: int) -> Decimal:
 
 def mp_cos(x: prec, sigfigs: int) -> Decimal:
     x = Decimal(str(x))
-    sigfigs = sigfigs + 5
+    sigfigs += 5
     __context.prec = sigfigs
     cos_x = Decimal(0)
     pi = mp_pi(sigfigs + 5)
@@ -181,7 +181,7 @@ def mp_ln(x: prec, sigfigs: int, builtin: bool = True) -> Decimal:
     x = Decimal(str(x))
     if x <= 0:
         raise ValueError("Natural logarithm is not defined for x <= 0")
-    sigfigs = sigfigs + 5
+    sigfigs += 5
     __context.prec = sigfigs
     sign = -1
     if x > 1:
@@ -201,7 +201,7 @@ def mp_ln(x: prec, sigfigs: int, builtin: bool = True) -> Decimal:
 
 
 def mp_log(x: prec, base: prec, sigfigs: int, builtin: bool = True) -> Decimal:
-    sigfigs = sigfigs + 5
+    sigfigs += 5
     if builtin:
         __context.prec = sigfigs
         x_dec = Decimal(str(x))
@@ -343,7 +343,7 @@ def mp_acos(x: prec, sigfigs: int) -> Decimal:  # FIXME
 def mp_fresnel_s(x: prec, sigfigs: int) -> Decimal:  # FIXME
     x = Decimal(str(x))
     more = int(x * x)
-    sigfigs = sigfigs + more
+    sigfigs += more
     __context.prec = sigfigs
     s_x = Decimal(0)
     p = mp_pi(sigfigs + 5)
@@ -369,7 +369,7 @@ def mp_fresnel_s(x: prec, sigfigs: int) -> Decimal:  # FIXME
 def mp_fresnel_c(x: prec, sigfigs: int) -> Decimal:  # FIXME
     x = Decimal(str(x))
     more = int(x * x)
-    sigfigs = sigfigs + more
+    sigfigs += more
     __context.prec = sigfigs
     c_x = Decimal(0)
     f = -x ** 4 * mp_pi(sigfigs + 5) ** 2 / 4
@@ -391,6 +391,31 @@ def mp_fresnel_c(x: prec, sigfigs: int) -> Decimal:  # FIXME
     return +c_x
 
 
+def mp_euler_gamma(sigfigs: int) -> Decimal:
+    sigfigs += 5
+    __context.prec = sigfigs
+    n = int(sigfigs * 0.6)
+    i_n = Decimal(0)
+    j_n = Decimal(0)
+    k = 1
+    n_power_k = n
+    fact_k = Decimal(1)
+    harmonic_sum = Decimal(0)
+    term = Decimal(1)
+    eps = Decimal(10) ** -sigfigs
+    while abs(term) >= eps:
+        term = (n_power_k / fact_k) ** 2
+        i_n += term * harmonic_sum
+        j_n += term
+        n_power_k *= n
+        fact_k *= k
+        harmonic_sum += Decimal(1) / k
+        k += 1
+    gamma = i_n / j_n - Decimal(n).ln()
+    __context.prec -= 5
+    return +gamma
+
+
 class MPComplex:
     def __init__(self, real, imag, sigfigs=28):
         _setprec(sigfigs)
@@ -425,6 +450,9 @@ class MPComplex:
     def __neg__(self):
         return MPComplex(-self.real, -self.imag, self.sigfigs)
 
+    __radd__ = __add__
+    __rmul__ = __mul__
+
     def conjugate(self):
         return MPComplex(self.real, -self.imag, self.sigfigs)
 
@@ -435,6 +463,9 @@ class MPComplex:
         _setprec(self.sigfigs)
         return +mod
 
+    def __abs__(self):
+        return self.modulus()
+
     def __pow__(self, power, modulo=None):
         if modulo is not None:
             raise TypeError("Modulo operation is not supported for complex numbers")
@@ -552,12 +583,13 @@ def _remove_trailing_zeros(value: Any) -> str:
     value_str = str(value).lower()
     if value_str == "0" or value_str.startswith(("0e", "-0e")):
         return "0"
+    if "." not in value_str:
+        return value_str
     if "e" in value_str:
         mantissa, exponent = value_str.split("e")
         mantissa = mantissa.rstrip("0").rstrip(".")
         return mantissa + "e" + exponent
-    else:
-        return value_str.rstrip("0").rstrip(".")
+    return value_str.rstrip("0").rstrip(".")
 
 
 def asmpc(real: Union[int, float, str, Decimal, complex, MPComplex], imag: prec = 0,

pypynum/sequence.py

@@ -1,6 +1,49 @@
 from .types import Union, real
 
 
+def pascal_triangle(n: int) -> list:
+    triangle = [[1]]
+    for i in range(1, n + 1):
+        new_row = [1]
+        for j in range(1, i):
+            new_row.append(triangle[i - 1][j - 1] + triangle[i - 1][j])
+        new_row.append(1)
+        triangle.append(new_row)
+    return triangle
+
+
+def bell_triangle(n: int) -> list:
+    triangle = [[1]]
+    for i in range(1, n + 1):
+        new_row = [triangle[i - 1][-1]]
+        for j in range(1, i + 1):
+            new_row.append(new_row[j - 1] + triangle[i - 1][j - 1])
+        triangle.append(new_row)
+    return triangle
+
+
+def stirling1(n: int) -> list:
+    triangle = [[1]]
+    for i in range(1, n + 1):
+        new_row = [0]
+        for j in range(1, i):
+            new_row.append((i - 1) * triangle[i - 1][j] + triangle[i - 1][j - 1])
+        new_row.append(triangle[i - 1][i - 1])
+        triangle.append(new_row)
+    return triangle
+
+
+def stirling2(n: int) -> list:
+    triangle = [[1]]
+    for i in range(1, n + 1):
+        new_row = [0]
+        for j in range(1, i):
+            new_row.append(j * triangle[i - 1][j] + triangle[i - 1][j - 1])
+        new_row.append(triangle[i - 1][i - 1])
+        triangle.append(new_row)
+    return triangle
+
+
 def farey(n: int) -> list:
     a2, b2 = None, None
     if n == 0:

pypynum/this.py

@@ -2,7 +2,26 @@
 The Zen of PyPyNum
 """
 
-Zen = "\x9a¤¢\xa0¢°¼§¢°éâñåâòõÖ°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°\x9a\x9a±äù°õóñâòýõ°ã·äõü½äàõóþÿó°äåÿôþñäã°ñ°ãù°þ÷ùãõô°âñüåôÿÝ\x9a¾÷þùãùýÿâà°õò°äø÷ùý°äù°¼ôâñçâÿöäø÷ùñâäã°ãù°þÿùäñäþõýõüàýù°õøä°öÙ\x9a¾äù°âõôùãþÿóõâ°¼ôþõøõâàýÿó°ÿä°÷þù÷þõüüñøó°ãù°þÿùäñäþõýõüàýù°õøä°öÙ\x9a¾÷þùøãåâ°ÿä°âÿùâõàåã°ãù°÷þùäùñç°ãõýùäõýÿã°¼âõæõçÿØ\x9a¾þÿùäñþùäãñâóÿâà°þñøä°âõääõò°ãù°éüäàýÿâà°÷þùäóÑ\x9a¾øóñÿâààñ°ãåÿùæòÿ½õþÿ°éüþÿ°õøä°¼éüüñõôù½õþÿ°õò°äãåý°õâõøÄ\x9a¾õäñüåóõàã°ÿä°õ÷âå°õøä°äãùãõâ°¼ããõþõå÷ñæ°öÿ°õóþõãõâà°õøä°þÙ\x9a¾ôõäåý°éüäùóùüàèõ°ããõüþÅ\x9a¾ôõóþõüùã°äÿþ°¼þõûÿàã°õò°äãåý°ãâÿââÕ\x9a¾éäùâåà°âõæÿ°ãøàýåùâä°þõäöÿ°éäùüñóùäóñâÀ\x9a¾ãýâÿþ°õøä°õôùââõæÿ°äÿþ°ôüåÿøã°ãõãñó°üñùóõàÃ\x9a¾äþåÿýñâñà°ãù°éäùüùòñôñõÂ\x9a¾ãõþÿ°ôõäñÿüò°âõæÿ°ãþùç°õôÿó°õãâñàÃ\x9a¾ãõùøóâñâõùø°ôõäãõþ°ãäñõò°õâåäóåâäã°äñüÖ\x9a¾ôõäñóùüàýÿóâõæÿ°þñøä°âõääõò°ãù°ôõäñóùäãùøàÿÃ\x9a¾þÿùäåüÿæþÿó°âõæÿ°ôõââõöõâà°ãù°ããõþôâñçâÿöäø÷ùñâäÃ\x9a¾éäùâåóãòÿ°ãàýåâä°éäùâñüÓ\x9a¾éûþåüó°ÿä°âÿùâõàåã°ãù°äþñ÷õüÕ\x9a\x9a¾þÿøäéÀ°þù°éüõâåà°þõääùâç°õ÷ñûóñà°øäñý°ñ°ãù°ãùøÄ\x9a\x9aùéñùÚ°þõøðéò°¼ýåÞéÀéÀ°öÿ°þõÊ°õøÄ°°°°\x9a"
+Zen = ("\x9a¤¢\xa0¢°¼¥°âõòýõäàõð°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°°\x9a\x9a"
+       "±äù°õóñâòýõ°ã·äõÜ\x9a¾ãõùâÿõøä°üñóùäñýõøäñý°öÿ°þÿùäñêùüñäþõýäâñàýÿó°õøä°ÿä°þùûñ°ãù°þ÷ùãõô°þù°éäùâñüåôÿÝ\x9a"
+       "¾ýõâÿõøä°ôõøãùüòñäãõ½üüõç°ñ°öÿ°øäåâä°õøä°øäùç°ãõäñþÿãõâ°äù°¼âñõüó°ãù°þÿùäåüÿã°ñ°öÙ\x9a"
+       "¾öÿÿâà°üñóùäñýõøäñý°ñ°öÿ°âÿ÷ùâ°õøä°øäùç°äù°âÿäóñöõâ°¼õæùãåüõ°ãù°þÿùäåüÿã°ñ°öÙ\x9a"
+       "¾öÿÿâà°äåÿ½äø÷åÿøä½üüõç°ñ°ãñ°¼ýõüòÿâà°ñ°öÿ°øäàõô°õøä°âõæÿóþå°þñó°õóþõùäñà°¼äõÉ\x9a"
+       "¾õæùãùóõô°ôþñ°äöùçã°«öÿÿâà°äóõâùô°õøä°ÿä°þùûñ°ãù°÷þùæüÿã°þù°ããõþäàýÿâÀ\x9a"
+       "¾äþõýõüõ°éäùäþõôù°õøä°ãñ°õåáùþå°ãñ°¼þÿùäåüÿã°äþñ÷õüõ°¼õü÷þùã°ñ°õò°ôüåÿøã°õâõøÄ\x9a"
+       "¾ýõâÿõøä°ôõþùöõô½üüõç°ñ°öÿ°éäùâñüó°õøä°ûõõã°õç°¼éäùå÷ùòýñ°öÿ°õóñö°õøä°þÙ\x9a"
+       "¾óù÷õäñâäã°ôþñ°üñþÿùäþõäþù°ãù°¼ôÿùâõà°ôõóñüà½üüõç°ñ°õûùü°¼õóþõüùÃ\x9a"
+       "¾ôõüñõóþÿó°äÿþ°¼ôõãÿàèõ°õò°äãåý°¼öÿÿâà°ñ°þù°þÿùäóùôñâäþÿó°ñ°õûùü°¼ãâÿââÕ\x9a"
+       "¾éäùâåà°üñóùäõâÿõøä°ãõôõãâõàåã°þõäöÿ°¼ýõâÿõøä°õüòñóùüààñ°þñ°õûùü°¼éäùüñóùäóñâÀ\x9a"
+       "¾õüåâ°üñâõþõ÷°õøä°õäñóãåöòÿ°äÿþ°äãåý°¼öÿÿâà°ñ°þù°ãþÿùäàõóèõ°õûùü°¼ãõãñó°üñùóõàÃ\x9a"
+       "¾õüòñãþõàãùôþù°ãù°¼ýõâÿõøä°þõæÿâà½üüõç°ñ°õûùü°¼éäùüùòñôñõÂ\x9a"
+       "¾éóþñôþåôõâ°äåÿøäùç°õóþõããõ°ãþùñäõâ°¼üñùýÿþéüÿà°üñýùþùý°ñ°õûùü°¼õôÿó°õãâñàÃ\x9a"
+       "¾ãþÿùäóþåö°öÿ°õâåäñþ°âñõþùü°õøä°âÿââùý°õôÿó°âåÿ°þù°ãõùøóâñâõùø°äñüÖ\x9a"
+       "¾þÿùäñóùäãùøàÿã°öÿ°õüóñþþùà°õøä°ãù°ýâÿö°þù°éäùóùüàýùÃ\x9a"
+       "¾ãýõüòÿâà°äãõûâñô°õøä°ãõäñþùýåüüù°óù÷ÿü°þù°éäùâñüÓ\x9a"
+       "¾ãýøäùâÿ÷üñ°éûüåò°õøä°ãôþõóãþñâä°ãóùäñýõøäñý°þù°õóþñ÷õüÕ\x9a¾þÿùäñýùèÿâààñ°ãø÷ùõçäåÿ°þÿùãùóõâÀ\x9a\x9a"
+       "¾ãôñõâøä°þÿøäéÀ°õâåà°øäùç°ãýøäùâÿ÷üñ°âåÿ°õæñõç°õç°¼éâñåäóþñã°üñóùäñýõøäñý°ãùøä°þÙ\x9a\x9a"
+       "ùéñùÚ°þõøðéò°¼ýåÞéÀéÀ°öÿ°þõÊ°õøÄ°°°°°°°°°°°°°°°°\x9a")
 print("".join([chr(ord(_) ^ 144) for _ in Zen[::-1]]))
 for _ in list(globals().keys()):
     if _[0] != "_":

pypynum/tools.py

@@ -185,16 +185,18 @@ def primality(n: int, iter_num: int = 10) -> bool:
     """
     Introduction
     ==========
-    Using the Miller Rabin method to test the primality of positive integers
+    This function checks if a number is a prime using the Miller-Rabin primality test,
+    which is a probabilistic test to determine if a number is a probable prime.
 
     Example
     ==========
     >>> primality(2 ** 4423 - 1)
     True
     >>>
-    :param n: integer
-    :param iter_num: integer
-    :return:
+    :param n: The number to be tested for primality.
+    :param iter_num: The number of iterations for the test, which affects the accuracy.
+        More iterations reduce the probability of falsely identifying a composite number as prime.
+    :return: True if the number is a probable prime, False otherwise.
     """
     from random import randint
     if n == 2:
@@ -218,76 +220,100 @@ def primality(n: int, iter_num: int = 10) -> bool:
     return True
 
 
-def generate_primes(limit: int) -> list:
+def primes(limit: int) -> list:
     """
     Introduction
     ==========
-    Generate all prime numbers within the specified limit using linear filtering method
+    This function generates a list of prime numbers up to a specified limit.
 
     Example
     ==========
-    >>> generate_primes(100)
+    >>> primes(100)
     [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
     >>>
-    :param limit: integer
-    :return:
+    :param limit: The upper limit to which prime numbers are to be found (inclusive).
+    :return: A list of prime numbers up to the specified limit.
     """
-    primes = list(range(limit + 1))
-    primes[1] = 0
+    result = list(range(limit + 1))
+    result[1] = 0
     p = 2
     s = 4
     while s <= limit:
-        if primes[p]:
+        if result[p]:
             for i in range(s, limit + 1, p):
-                primes[i] = 0
+                result[i] = 0
         p += 1
         s = p * p
-    return [x for x in primes if x != 0]
+    return [x for x in result if x != 0]
 
 
-def generate_semiprimes(limit: int) -> list:
+def semiprimes(limit: int) -> list:
     """
     Introduction
     ==========
-    Generate all semiprime numbers within the specified limit
+    This function generates a list of semiprime numbers up to a specified limit.
+    A semiprime is a natural number that is the product of two prime numbers.
 
     Example
     ==========
-    >>> generate_semiprimes(64)
+    >>> semiprimes(64)
     [4, 6, 9, 10, 14, 15, 21, 22, 25, 26, 33, 34, 35, 38, 39, 46, 49, 51, 55, 57, 58, 62]
     >>>
-    :param limit: integer
-    :return:
+    :param limit: The upper limit to which semiprime numbers are to be found (inclusive).
+    :return: A list of semiprime numbers up to the specified limit.
     """
-    primes = generate_primes(limit // 2)
-    length = len(primes)
-    semiprimes = []
+    ps = primes(limit // 2)
+    length = len(ps)
+    result = []
     for i in range(length):
-        first = primes[i]
+        first = ps[i]
         maximum = limit // first
         for j in range(i, length):
-            second = primes[j]
+            second = ps[j]
             if second > maximum:
                 break
-            semiprimes.append(first * second)
-    return sorted(semiprimes)
+            result.append(first * second)
+    return sorted(result)
+
+
+def twinprimes(limit: int) -> list:
+    """
+    Introduction
+    ==========
+    This function generates a list of twin prime pairs up to a specified limit.
+    Twin primes are a pair of prime numbers that have a difference of two.
+
+    Example
+    ==========
+    >>> twinprimes(100)
+    [(3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), (71, 73)]
+    >>>
+    :param limit: The upper limit to which twin prime pairs are to be found (inclusive).
+    :return: A list of twin prime pairs up to the specified limit.
+    """
+    ps = primes(limit)
+    return [(p, p + 2) for p in ps if p + 2 in ps]
 
 
 def prime_factors(integer: int, dictionary: bool = False, pollard_rho: bool = True) -> Union[list, dict]:
     """
     Introduction
     ==========
-    Using the Pollard Rho method to decompose prime factors of positive integers
+    This function computes the prime factors of a given integer. It can return the factors
+    as a list or a dictionary, and it can use the Pollard's rho algorithm for factorization.
 
     Example
     ==========
     >>> prime_factors(2305567963945518424753102147331756070)
     [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
     >>>
-    :param integer: integer
-    :param dictionary: bool
-    :param pollard_rho: bool
-    :return:
+    :param integer: The integer to be factorized.
+    :param dictionary: A boolean indicating whether to return the factors as a dictionary with the prime factors as
+        keys and their counts as values.
+    :param pollard_rho: A boolean indicating whether to use Pollard's rho algorithm for factorization. If False,
+        a simple trial division method is used.
+    :return: A list of prime factors or a dictionary with prime factors and their counts, depending on the
+        'dictionary' parameter.
     """
     from math import gcd
     from random import randint
@@ -338,7 +364,7 @@ def prime_factors(integer: int, dictionary: bool = False, pollard_rho: bool = Tr
         else:
             return sorted(output)
     else:
-        return []
+        return {} if dictionary else []
 
 
 def magic_square(n):