PyPyNum 1.15.1__tar.gz → 1.16.1__tar.gz

{pypynum-1.15.1 → pypynum-1.16.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: PyPyNum
-Version: 1.15.1
+Version: 1.16.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.15.1 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum | GitHub -> https://github.com/PythonSJL/PyPyNum
+## PyPyNum | Version -> 1.16.1 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum | GitHub -> https://github.com/PythonSJL/PyPyNum
 
 ![LOGO](PyPyNum.png)
 
@@ -327,41 +327,79 @@ Python interpreter and run it!
 ```
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-Fixed most of the known issues,
+Fixed and improved the basic
+operation function of 'Array'.
 
-especially modified the stopping
-
-conditions for multi precision
+!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-computation iterations.
+We will remove 'Tensor' in
+future versions. Because its
+computational functions have
+already been implemented in
+'Array'. The current version
+will throw 'FutureWarning' as a
+warning.
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-The printout in
+Fixed the calculation error of
+'mp_euler_gamma', which was
+caused when modifying the
+iteration stop condition
+previously.
 
-"trees.BinaryTree.count_nodes()"
+!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-was deleted, which is the trace
+<<< Here are the newly added functions >>>
 
-left by previous debugging.
 
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
+cos_sim(seq1: Union[list, tuple, str], seq2: Union[list, tuple, str], is_vector: bool = False) -> float
+    Introduction
+    ==========
+    Calculate the cosine similarity between two sequences.
 
-Rename the "Bessel" submodule to
+    The cosine similarity is a measure of similarity between two non-zero vectors. It is defined as the cosine of the
+    angle between them, which is computed as the dot product of the vectors divided by the product of their magnitudes.
+    This function supports both numerical vectors and frequency distributions of sequences.
 
-"Special" and add some
+    Example
+    ==========
+    >>> cos_sim("hello world", "world hello")
+    0.9999999999999998
+    >>>
+    :param seq1: First sequence to compare.
+    :param seq2: Second sequence to compare.
+    :param is_vector: A boolean indicating whether the input sequences are numerical vectors. Default is False.
+    :return: The cosine similarity between the two sequences, ranging from -1 to 1.
 
-hypergeometric functions in the
 
-form of "hyp * f *".
+replace(seq: Union[list, tuple], old: Union[list, tuple], new: Union[list, tuple], count: int = -1) -> Union[list, tuple]
+    Introduction
+    ==========
+    Replace occurrences of the subsequence 'old' in 'seq' with 'new'.
 
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
+    This function is designed to handle sequences such as lists or tuples and replace specified subsequences
+    with new ones. It also allows limiting the number of replacements.
 
-在“zh_cn”子模块中，把“多精度欧拉数”
+    Example
+    ==========
+    >>> replace([1, 2, 3, 4, 2, 3], [2, 3], [5, 6])
+    [1, 5, 6, 4, 5, 6]
+    >>>
+    :param seq: The sequence in which to replace the subsequence.
+    :param old: The subsequence to be replaced.
+    :param new: The subsequence to replace with.
+    :param count: The maximum number of replacements to perform. Default is -1 (unlimited).
+    :return: The modified sequence with replacements.
 
-改名为“多精度自然常数”，并且增加了
+!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-“多精度欧拉伽马”。
+Other functions and classes have
+also undergone certain
+modifications, such as adding a
+"reduce" parameter to the "qr"
+function to determine whether to
+crop the matrix.
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 ```
@@ -399,15 +437,16 @@ PyPyNum
 │       ├── asarray(data: Any) -> Any
 │       ├── aslist(data: Any) -> Any
 │       ├── boolarray(data: Any) -> Any
-│       ├── fill(shape: Any, sequence: Any, repeat: Any, pad: Any, rtype: Any) -> Any
-│       ├── full(shape: Any, fill_value: Any, rtype: Any) -> Any
-│       ├── full_like(a: Any, fill_value: Any, rtype: Any) -> Any
+│       ├── fill(shape: typing.Union[list, tuple], sequence: typing.Union[list, tuple], repeat: bool, pad: typing.Any, rtype: typing.Callable) -> typing.Any
+│       ├── full(shape: typing.Union[list, tuple], fill_value: typing.Any, rtype: typing.Callable) -> typing.Any
+│       ├── full_like(a: typing.Any, fill_value: typing.Any, rtype: typing.Callable) -> typing.Any
 │       ├── get_shape(data: Any) -> Any
 │       ├── is_valid_array(_array: Any, _shape: Any) -> Any
-│       ├── ones(shape: Any, rtype: Any) -> Any
-│       ├── ones_like(a: Any, rtype: Any) -> Any
-│       ├── zeros(shape: Any, rtype: Any) -> Any
-│       └── zeros_like(a: Any, rtype: Any) -> Any
+│       ├── ones(shape: typing.Union[list, tuple], rtype: typing.Callable) -> typing.Any
+│       ├── ones_like(a: typing.Any, rtype: typing.Callable) -> typing.Any
+│       ├── tensorproduct(tensors: pypynum.arrays.Array) -> pypynum.arrays.Array
+│       ├── zeros(shape: typing.Union[list, tuple], rtype: typing.Callable) -> typing.Any
+│       └── zeros_like(a: typing.Any, rtype: typing.Callable) -> typing.Any
 ├── chars
 │   ├── CLASS
 │   └── FUNCTION
@@ -668,13 +707,15 @@ PyPyNum
 │   ├── CLASS
 │   │   └── Matrix(pypynum.arrays.Array)/__init__(self: Any, data: Any, check: Any) -> Any
 │   └── FUNCTION
-│       ├── cholesky(matrix: Any, hermitian: Any) -> Any
+│       ├── cholesky(matrix: pypynum.matrices.Matrix, hermitian: bool) -> pypynum.matrices.Matrix
 │       ├── eigen(matrix: pypynum.matrices.Matrix) -> tuple
 │       ├── hessenberg(matrix: pypynum.matrices.Matrix) -> tuple
-│       ├── identity(n: int) -> pypynum.matrices.Matrix
+│       ├── identity(n: int, m: int) -> pypynum.matrices.Matrix
 │       ├── lu(matrix: pypynum.matrices.Matrix) -> tuple
 │       ├── mat(data: Any) -> Any
-│       ├── qr(matrix: pypynum.matrices.Matrix) -> tuple
+│       ├── perm_mat(num_rows: int, num_cols: int, row_swaps: typing.Union[list, tuple], col_swaps: typing.Union[list, tuple], rtype: typing.Callable) -> typing.Any
+│       ├── perm_mat_indices(num_rows: int, num_cols: int, row_swaps: typing.Union[list, tuple], col_swaps: typing.Union[list, tuple]) -> tuple
+│       ├── qr(matrix: pypynum.matrices.Matrix, reduce: bool) -> tuple
 │       ├── rank_decomp(matrix: pypynum.matrices.Matrix) -> tuple
 │       ├── rotate90(matrix: pypynum.matrices.Matrix, times: int) -> pypynum.matrices.Matrix
 │       ├── svd(matrix: pypynum.matrices.Matrix) -> tuple
@@ -692,6 +733,7 @@ PyPyNum
 │       ├── mp_asin(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
 │       ├── mp_atan(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
 │       ├── mp_atan2(y: typing.Union[int, float, str, decimal.Decimal], x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
+│       ├── mp_catalan(sigfigs: int) -> decimal.Decimal
 │       ├── 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
@@ -775,32 +817,40 @@ PyPyNum
 │   └── 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
+│       ├── bernoulli(n: int, single: bool) -> typing.Union[list, tuple]
 │       ├── 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
 │       ├── lucas(n: int, single: bool) -> typing.Union[int, list]
+│       ├── padovan(n: int, single: bool) -> typing.Union[int, list]
 │       ├── pascal_triangle(n: int) -> list
 │       ├── pell(n: int, single: bool) -> typing.Union[int, list]
+│       ├── pelllucas(n: int, single: bool) -> typing.Union[int, list]
+│       ├── perrin(n: int, single: bool) -> typing.Union[int, list]
 │       ├── recaman(n: int, single: bool) -> typing.Union[int, list]
 │       ├── stirling1(n: int) -> list
 │       ├── stirling2(n: int) -> list
+│       ├── sylvester(n: int, single: bool) -> typing.Union[int, list]
 │       ├── tetranacci(n: int, single: bool) -> typing.Union[int, list]
 │       └── tribonacci(n: int, single: bool) -> typing.Union[int, list]
 ├── special
 │   ├── CLASS
 │   └── 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]
+│       ├── besseli0(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── besseli1(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── besseliv(v: typing.Union[int, float], x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── besselj0(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── besselj1(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── besseljv(v: typing.Union[int, float], x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 │       ├── hyp0f1(b0: typing.Union[int, float, complex], z: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 │       ├── hyp1f1(a0: typing.Union[int, float, complex], b0: typing.Union[int, float, complex], z: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 │       ├── hyp2f1(a0: typing.Union[int, float, complex], a1: typing.Union[int, float, complex], b0: typing.Union[int, float, complex], z: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       └── hyppfq(a: typing.Union[list, tuple], b: typing.Union[list, tuple], z: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── hyppfq(a: typing.Union[list, tuple], b: typing.Union[list, tuple], z: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qbinomial(n: typing.Union[int, float, complex], m: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qfactorial(n: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qgamma(n: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       └── qpochhammer(a: typing.Union[int, float, complex], q: typing.Union[int, float, complex], n: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 ├── stattest
 │   ├── CLASS
 │   └── FUNCTION
@@ -819,8 +869,7 @@ PyPyNum
 │   │   └── Tensor(pypynum.arrays.Array)/__init__(self: Any, data: Any, check: Any) -> Any
 │   └── FUNCTION
 │       ├── ten(data: list) -> pypynum.tensors.Tensor
-│       ├── tensor_and_number(tensor: Any, operator: Any, number: Any) -> Any
-│       └── tensorproduct(tensors: pypynum.tensors.Tensor) -> pypynum.tensors.Tensor
+│       └── tensor_and_number(tensor: Any, operator: Any, number: Any) -> Any
 ├── test
 │   ├── CLASS
 │   └── FUNCTION
@@ -831,16 +880,20 @@ PyPyNum
 │   ├── CLASS
 │   └── FUNCTION
 │       ├── classify(array: typing.Union[list, tuple]) -> dict
+│       ├── cos_sim(seq1: typing.Union[list, tuple, str], seq2: typing.Union[list, tuple, str], is_vector: bool) -> float
 │       ├── dedup(iterable: typing.Union[list, tuple, str]) -> typing.Union[list, tuple, str]
 │       ├── fast_pow(a: typing.Any, n: int, init: typing.Any, mul: typing.Callable) -> typing.Any
 │       ├── frange(start: typing.Union[int, float], stop: typing.Union[int, float], step: float) -> list
 │       ├── geomspace(start: typing.Union[int, float], stop: typing.Union[int, float], number: int) -> list
-│       ├── levenshtein_distance(s1: str, s2: str) -> int
+│       ├── lcsubseq(x: typing.Union[list, tuple, str], y: typing.Union[list, tuple, str]) -> list
+│       ├── lcsubstr(x: typing.Union[list, tuple, str], y: typing.Union[list, tuple, str]) -> list
+│       ├── levenshtein(x: typing.Union[list, tuple, str], y: typing.Union[list, tuple, str]) -> int
 │       ├── linspace(start: typing.Union[int, float], stop: typing.Union[int, float], number: int) -> list
 │       ├── magic_square(n: int) -> list
 │       ├── primality(n: int, iter_num: int) -> bool
 │       ├── prime_factors(integer: int, dictionary: bool, pollard_rho: bool) -> typing.Union[list, dict]
 │       ├── primes(limit: int) -> list
+│       ├── replace(seq: typing.Union[list, tuple], old: typing.Union[list, tuple], new: typing.Union[list, tuple], count: int) -> typing.Union[list, tuple]
 │       ├── semiprimes(limit: int) -> list
 │       ├── split(iterable: typing.Union[list, tuple, str], key: typing.Union[list, tuple], retain: bool) -> list
 │       └── twinprimes(limit: int) -> list

{pypynum-1.15.1 → pypynum-1.16.1}/PyPyNum.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: PyPyNum
-Version: 1.15.1
+Version: 1.16.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.15.1 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum | GitHub -> https://github.com/PythonSJL/PyPyNum
+## PyPyNum | Version -> 1.16.1 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum | GitHub -> https://github.com/PythonSJL/PyPyNum
 
 ![LOGO](PyPyNum.png)
 
@@ -327,41 +327,79 @@ Python interpreter and run it!
 ```
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-Fixed most of the known issues,
+Fixed and improved the basic
+operation function of 'Array'.
 
-especially modified the stopping
-
-conditions for multi precision
+!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-computation iterations.
+We will remove 'Tensor' in
+future versions. Because its
+computational functions have
+already been implemented in
+'Array'. The current version
+will throw 'FutureWarning' as a
+warning.
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-The printout in
+Fixed the calculation error of
+'mp_euler_gamma', which was
+caused when modifying the
+iteration stop condition
+previously.
 
-"trees.BinaryTree.count_nodes()"
+!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-was deleted, which is the trace
+<<< Here are the newly added functions >>>
 
-left by previous debugging.
 
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
+cos_sim(seq1: Union[list, tuple, str], seq2: Union[list, tuple, str], is_vector: bool = False) -> float
+    Introduction
+    ==========
+    Calculate the cosine similarity between two sequences.
 
-Rename the "Bessel" submodule to
+    The cosine similarity is a measure of similarity between two non-zero vectors. It is defined as the cosine of the
+    angle between them, which is computed as the dot product of the vectors divided by the product of their magnitudes.
+    This function supports both numerical vectors and frequency distributions of sequences.
 
-"Special" and add some
+    Example
+    ==========
+    >>> cos_sim("hello world", "world hello")
+    0.9999999999999998
+    >>>
+    :param seq1: First sequence to compare.
+    :param seq2: Second sequence to compare.
+    :param is_vector: A boolean indicating whether the input sequences are numerical vectors. Default is False.
+    :return: The cosine similarity between the two sequences, ranging from -1 to 1.
 
-hypergeometric functions in the
 
-form of "hyp * f *".
+replace(seq: Union[list, tuple], old: Union[list, tuple], new: Union[list, tuple], count: int = -1) -> Union[list, tuple]
+    Introduction
+    ==========
+    Replace occurrences of the subsequence 'old' in 'seq' with 'new'.
 
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
+    This function is designed to handle sequences such as lists or tuples and replace specified subsequences
+    with new ones. It also allows limiting the number of replacements.
 
-在“zh_cn”子模块中，把“多精度欧拉数”
+    Example
+    ==========
+    >>> replace([1, 2, 3, 4, 2, 3], [2, 3], [5, 6])
+    [1, 5, 6, 4, 5, 6]
+    >>>
+    :param seq: The sequence in which to replace the subsequence.
+    :param old: The subsequence to be replaced.
+    :param new: The subsequence to replace with.
+    :param count: The maximum number of replacements to perform. Default is -1 (unlimited).
+    :return: The modified sequence with replacements.
 
-改名为“多精度自然常数”，并且增加了
+!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-“多精度欧拉伽马”。
+Other functions and classes have
+also undergone certain
+modifications, such as adding a
+"reduce" parameter to the "qr"
+function to determine whether to
+crop the matrix.
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 ```
@@ -399,15 +437,16 @@ PyPyNum
 │       ├── asarray(data: Any) -> Any
 │       ├── aslist(data: Any) -> Any
 │       ├── boolarray(data: Any) -> Any
-│       ├── fill(shape: Any, sequence: Any, repeat: Any, pad: Any, rtype: Any) -> Any
-│       ├── full(shape: Any, fill_value: Any, rtype: Any) -> Any
-│       ├── full_like(a: Any, fill_value: Any, rtype: Any) -> Any
+│       ├── fill(shape: typing.Union[list, tuple], sequence: typing.Union[list, tuple], repeat: bool, pad: typing.Any, rtype: typing.Callable) -> typing.Any
+│       ├── full(shape: typing.Union[list, tuple], fill_value: typing.Any, rtype: typing.Callable) -> typing.Any
+│       ├── full_like(a: typing.Any, fill_value: typing.Any, rtype: typing.Callable) -> typing.Any
 │       ├── get_shape(data: Any) -> Any
 │       ├── is_valid_array(_array: Any, _shape: Any) -> Any
-│       ├── ones(shape: Any, rtype: Any) -> Any
-│       ├── ones_like(a: Any, rtype: Any) -> Any
-│       ├── zeros(shape: Any, rtype: Any) -> Any
-│       └── zeros_like(a: Any, rtype: Any) -> Any
+│       ├── ones(shape: typing.Union[list, tuple], rtype: typing.Callable) -> typing.Any
+│       ├── ones_like(a: typing.Any, rtype: typing.Callable) -> typing.Any
+│       ├── tensorproduct(tensors: pypynum.arrays.Array) -> pypynum.arrays.Array
+│       ├── zeros(shape: typing.Union[list, tuple], rtype: typing.Callable) -> typing.Any
+│       └── zeros_like(a: typing.Any, rtype: typing.Callable) -> typing.Any
 ├── chars
 │   ├── CLASS
 │   └── FUNCTION
@@ -668,13 +707,15 @@ PyPyNum
 │   ├── CLASS
 │   │   └── Matrix(pypynum.arrays.Array)/__init__(self: Any, data: Any, check: Any) -> Any
 │   └── FUNCTION
-│       ├── cholesky(matrix: Any, hermitian: Any) -> Any
+│       ├── cholesky(matrix: pypynum.matrices.Matrix, hermitian: bool) -> pypynum.matrices.Matrix
 │       ├── eigen(matrix: pypynum.matrices.Matrix) -> tuple
 │       ├── hessenberg(matrix: pypynum.matrices.Matrix) -> tuple
-│       ├── identity(n: int) -> pypynum.matrices.Matrix
+│       ├── identity(n: int, m: int) -> pypynum.matrices.Matrix
 │       ├── lu(matrix: pypynum.matrices.Matrix) -> tuple
 │       ├── mat(data: Any) -> Any
-│       ├── qr(matrix: pypynum.matrices.Matrix) -> tuple
+│       ├── perm_mat(num_rows: int, num_cols: int, row_swaps: typing.Union[list, tuple], col_swaps: typing.Union[list, tuple], rtype: typing.Callable) -> typing.Any
+│       ├── perm_mat_indices(num_rows: int, num_cols: int, row_swaps: typing.Union[list, tuple], col_swaps: typing.Union[list, tuple]) -> tuple
+│       ├── qr(matrix: pypynum.matrices.Matrix, reduce: bool) -> tuple
 │       ├── rank_decomp(matrix: pypynum.matrices.Matrix) -> tuple
 │       ├── rotate90(matrix: pypynum.matrices.Matrix, times: int) -> pypynum.matrices.Matrix
 │       ├── svd(matrix: pypynum.matrices.Matrix) -> tuple
@@ -692,6 +733,7 @@ PyPyNum
 │       ├── mp_asin(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
 │       ├── mp_atan(x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
 │       ├── mp_atan2(y: typing.Union[int, float, str, decimal.Decimal], x: typing.Union[int, float, str, decimal.Decimal], sigfigs: int) -> decimal.Decimal
+│       ├── mp_catalan(sigfigs: int) -> decimal.Decimal
 │       ├── 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
@@ -775,32 +817,40 @@ PyPyNum
 │   └── 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
+│       ├── bernoulli(n: int, single: bool) -> typing.Union[list, tuple]
 │       ├── 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
 │       ├── lucas(n: int, single: bool) -> typing.Union[int, list]
+│       ├── padovan(n: int, single: bool) -> typing.Union[int, list]
 │       ├── pascal_triangle(n: int) -> list
 │       ├── pell(n: int, single: bool) -> typing.Union[int, list]
+│       ├── pelllucas(n: int, single: bool) -> typing.Union[int, list]
+│       ├── perrin(n: int, single: bool) -> typing.Union[int, list]
 │       ├── recaman(n: int, single: bool) -> typing.Union[int, list]
 │       ├── stirling1(n: int) -> list
 │       ├── stirling2(n: int) -> list
+│       ├── sylvester(n: int, single: bool) -> typing.Union[int, list]
 │       ├── tetranacci(n: int, single: bool) -> typing.Union[int, list]
 │       └── tribonacci(n: int, single: bool) -> typing.Union[int, list]
 ├── special
 │   ├── CLASS
 │   └── 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]
+│       ├── besseli0(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── besseli1(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── besseliv(v: typing.Union[int, float], x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── besselj0(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── besselj1(x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── besseljv(v: typing.Union[int, float], x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 │       ├── hyp0f1(b0: typing.Union[int, float, complex], z: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 │       ├── hyp1f1(a0: typing.Union[int, float, complex], b0: typing.Union[int, float, complex], z: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 │       ├── hyp2f1(a0: typing.Union[int, float, complex], a1: typing.Union[int, float, complex], b0: typing.Union[int, float, complex], z: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       └── hyppfq(a: typing.Union[list, tuple], b: typing.Union[list, tuple], z: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── hyppfq(a: typing.Union[list, tuple], b: typing.Union[list, tuple], z: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qbinomial(n: typing.Union[int, float, complex], m: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qfactorial(n: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qgamma(n: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       └── qpochhammer(a: typing.Union[int, float, complex], q: typing.Union[int, float, complex], n: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 ├── stattest
 │   ├── CLASS
 │   └── FUNCTION
@@ -819,8 +869,7 @@ PyPyNum
 │   │   └── Tensor(pypynum.arrays.Array)/__init__(self: Any, data: Any, check: Any) -> Any
 │   └── FUNCTION
 │       ├── ten(data: list) -> pypynum.tensors.Tensor
-│       ├── tensor_and_number(tensor: Any, operator: Any, number: Any) -> Any
-│       └── tensorproduct(tensors: pypynum.tensors.Tensor) -> pypynum.tensors.Tensor
+│       └── tensor_and_number(tensor: Any, operator: Any, number: Any) -> Any
 ├── test
 │   ├── CLASS
 │   └── FUNCTION
@@ -831,16 +880,20 @@ PyPyNum
 │   ├── CLASS
 │   └── FUNCTION
 │       ├── classify(array: typing.Union[list, tuple]) -> dict
+│       ├── cos_sim(seq1: typing.Union[list, tuple, str], seq2: typing.Union[list, tuple, str], is_vector: bool) -> float
 │       ├── dedup(iterable: typing.Union[list, tuple, str]) -> typing.Union[list, tuple, str]
 │       ├── fast_pow(a: typing.Any, n: int, init: typing.Any, mul: typing.Callable) -> typing.Any
 │       ├── frange(start: typing.Union[int, float], stop: typing.Union[int, float], step: float) -> list
 │       ├── geomspace(start: typing.Union[int, float], stop: typing.Union[int, float], number: int) -> list
-│       ├── levenshtein_distance(s1: str, s2: str) -> int
+│       ├── lcsubseq(x: typing.Union[list, tuple, str], y: typing.Union[list, tuple, str]) -> list
+│       ├── lcsubstr(x: typing.Union[list, tuple, str], y: typing.Union[list, tuple, str]) -> list
+│       ├── levenshtein(x: typing.Union[list, tuple, str], y: typing.Union[list, tuple, str]) -> int
 │       ├── linspace(start: typing.Union[int, float], stop: typing.Union[int, float], number: int) -> list
 │       ├── magic_square(n: int) -> list
 │       ├── primality(n: int, iter_num: int) -> bool
 │       ├── prime_factors(integer: int, dictionary: bool, pollard_rho: bool) -> typing.Union[list, dict]
 │       ├── primes(limit: int) -> list
+│       ├── replace(seq: typing.Union[list, tuple], old: typing.Union[list, tuple], new: typing.Union[list, tuple], count: int) -> typing.Union[list, tuple]
 │       ├── semiprimes(limit: int) -> list
 │       ├── split(iterable: typing.Union[list, tuple, str], key: typing.Union[list, tuple], retain: bool) -> list
 │       └── twinprimes(limit: int) -> list