PyPI - PyPyNum - Versions diffs - 1.16.0__tar.gz → 1.16.2__tar.gz - Mend

PyPyNum 1.16.0tar.gz → 1.16.2tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (53) hide show

{pypynum-1.16.0 → pypynum-1.16.2}/PKG-INFO RENAMED Viewed

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: PyPyNum
-Version: 1.16.0
+Version: 1.16.2
 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.16.0 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum | GitHub -> https://github.com/PythonSJL/PyPyNum
+## Version -> 1.16.2 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum | GitHub -> https://github.com/PythonSJL/PyPyNum
 ![LOGO](PyPyNum.png)
@@ -247,6 +247,15 @@ The logo cannot be displayed on PyPI, it can be viewed in Gitee or GitHub.
 + Update versions periodically to add more practical features
 + If you need to contact, please add QQ number 2261748025 (Py𝙿𝚢𝚝𝚑𝚘𝚗-水晶兰), or through my email 2261748025@qq.com
+```
++++++++++++++++++++++++++++++++++++++++++
++ Tip:                                  +
++ Have suggestions or feature requests? +
++ Feel free to share them with us.      +
++ Your feedback is highly appreciated!  +
++++++++++++++++++++++++++++++++++++++++++
+```
 ### Name and Function Introduction of Submodules
 |   Submodule Name    |                       Function Introduction                        |
@@ -327,81 +336,69 @@ Python interpreter and run it!
 ```
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-The submodule 'consts' has added
-a large number of mathematical
-and scientific constants,
-currently totaling 128.
+<<< Here are the newly added functions >>>
-This module defines a collection
-of constants representing
-various physical, mathematical,
-and unit conversion factors.
-These constants are commonly
-used in scientific and
-engineering calculations.
+kmp_table(pattern: Union[list, tuple, str]) -> list
+    Introduction
+    ==========
+    Generate the KMP (Knuth-Morris-Pratt) table for a given pattern.
-If you want to know information
-about each constant, you can
-execute 'help(consts)' to
-obtain it.
+    The KMP table is used to efficiently find occurrences of a pattern within a sequence by avoiding unnecessary
+    comparisons after a mismatch. This table determines how many characters can be skipped after a mismatch.
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
+    Example
+    ========
+    >>> kmp_table("AGCTGATCGTACGTAAGCTAGCTA")
+    [0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 2, 3, 4, 1, 2, 3, 4, 1]
+    >>>
+    :param pattern: The pattern for which to generate the KMP table.
+    :return: A list representing the KMP table for the given pattern.
-<<< Here are the newly added functions >>>
+findall(seq: Union[list, tuple, str], pat: Union[list, tuple, str]) -> list
+    Introduction
+    ==========
+    Find all indices of the subsequence 'pat' in 'seq'.
+    This function is designed to handle sequences such as lists, tuples, or strings and find all indices
+    of specified subsequences. It allows overlapping matches.
-PyPyNum
-├── special
-│   └── FUNCTION
-│       ├── qbinomial(n: typing.Union[int, float, complex], m: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       │   # Calculate the q-binomial coefficient of n and m with parameter q.
-│       ├── qfactorial(n: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       │   # Compute the q-factorial of n with parameter q.
-│       ├── qgamma(n: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       │   # Calculate the q-gamma function of n with parameter q.
-│       └── qpochhammer(a: typing.Union[int, float, complex], q: typing.Union[int, float, complex], n: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│           # Compute the q-Pochhammer symbol for given a, q, and n.
-├── multiprec
-│   └── FUNCTION
-│       ├── mp_catalan(sigfigs: int) -> decimal.Decimal
-│           # Calculate the Catalan's constant with a specified number of significant figures using multiprecision arithmetic.
-├── seqs
-│   └── FUNCTION
-│       ├── padovan(n: int, single: bool) -> typing.Union[int, list]
-│       │   # Generate the Padovan sequence up to the nth term.
-│       ├── pelllucas(n: int, single: bool) -> typing.Union[int, list]
-│       │   # Generate the Pell-Lucas sequence up to the nth term.
-│       ├── perrin(n: int, single: bool) -> typing.Union[int, list]
-│       │   # Generate the Perrin sequence up to the nth term.
-│       └── sylvester(n: int, single: bool) -> typing.Union[int, list]
-│           # Generate the Sylvester sequence up to the nth term.
-├── tools
-│   └── FUNCTION
-│       ├── lcsubseq(x: typing.Union[list, tuple, str], y: typing.Union[list, tuple, str]) -> list
-│       │   # Find the longest common subsequence between two sequences x and y.
-│       └── lcsubstr(x: typing.Union[list, tuple, str], y: typing.Union[list, tuple, str]) -> list
-│           # Find the longest common substring between two sequences x and y.
-├── matrices
-│   ├── CLASS
-│   │   └── Matrix(pypynum.arrays.Array)/__init__(self: Any, data: Any, check: Any) -> Any
-│   │       # Initialize a Matrix object from a given data array.
-│   └── FUNCTION
-│       ├── 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
-│       │   # Create a permutation matrix based on specified row and column swaps.
-│       └── perm_mat_indices(num_rows: int, num_cols: int, row_swaps: typing.Union[list, tuple], col_swaps: typing.Union[list, tuple]) -> tuple
-│           # Compute the indices for a permutation matrix based on specified row and column swaps.
+    Example
+    ========
+    >>> findall([2, 1, 2, 1, 2, 1, 2, 1], [1, 2, 1, 2])
+    [1, 3]
+    >>>
+    :param seq: The sequence in which to find the subsequence.
+    :param pat: The subsequence to be found.
+    :return: A list of starting indices where the subsequence is found.
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
+---------------------------------------------------------------------------------------
+| q-functions generalize classical math functions by introducing parameter q.         |
+| They are key in combinatorics and special functions, widely applied.                |
+| As q approaches 1, they revert to classical forms.                                  |
+| Examples include q-factorials, q-binomial coefficients, Jackson q-Bessel functions. |
+| These functions are crucial in fractals, chaotic systems, quantum groups.           |
+| They provide tools for solving complex mathematical challenges effectively.         |
+---------------------------------------------------------------------------------------
+Here are the 12 new q-functions added in the current version (adding the previous 4 makes a total of 16):
-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.
+qbeta(a: Union[int, float, complex], b: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qcos_large(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qcos_small(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qcosh_large(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qcosh_small(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qexp_large(z: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qexp_small(z: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qpi(q: Union[int, float, complex]) -> Union[int, float, complex]
+qsin_large(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qsin_small(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qsinh_large(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qsinh_small(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 ```
@@ -439,15 +436,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
@@ -501,7 +499,7 @@ PyPyNum
 │       ├── gamma_pdf(x: Any, shape: Any, scale: Any) -> Any
 │       ├── geometric_pmf(k: Any, p: Any) -> Any
 │       ├── hypergeom_pmf(k: Any, mg: Any, n: Any, nt: Any) -> Any
-│       ├── inv_gauss_pdf(x: Any, mu: Any, lambda_: Any, alpha: Any) -> Any
+│       ├── invgauss_pdf(x: Any, mu: Any, lambda_: Any, alpha: Any) -> Any
 │       ├── levy_pdf(x: Any, c: Any) -> Any
 │       ├── log_logistic_cdf(x: Any, alpha: Any, beta: Any) -> Any
 │       ├── log_logistic_pdf(x: Any, alpha: Any, beta: Any) -> Any
@@ -647,7 +645,7 @@ PyPyNum
 │       ├── cosh(x: typing.Union[int, float]) -> typing.Union[int, float]
 │       ├── cot(x: typing.Union[int, float]) -> typing.Union[int, float]
 │       ├── coth(x: typing.Union[int, float]) -> typing.Union[int, float]
-│       ├── cov(x: typing.Union[list, tuple], y: typing.Union[list, tuple], dof: int) -> typing.Union[int, float, complex]
+│       ├── cov(x: typing.Union[list, tuple], y: typing.Union[list, tuple], ddof: int) -> typing.Union[int, float, complex]
 │       ├── crt(n: typing.Union[list, tuple], a: typing.Union[list, tuple]) -> int
 │       ├── csc(x: typing.Union[int, float]) -> typing.Union[int, float]
 │       ├── csch(x: typing.Union[int, float]) -> typing.Union[int, float]
@@ -695,13 +693,13 @@ PyPyNum
 │       ├── sinh(x: typing.Union[int, float]) -> typing.Union[int, float]
 │       ├── skew(data: typing.Union[list, tuple]) -> float
 │       ├── square_mean(numbers: typing.Union[list, tuple]) -> typing.Union[int, float, complex]
-│       ├── std(numbers: typing.Union[list, tuple], dof: int) -> typing.Union[int, float, complex]
+│       ├── std(numbers: typing.Union[list, tuple], ddof: int) -> typing.Union[int, float, complex]
 │       ├── sumprod(arrays: typing.Union[list, tuple]) -> typing.Union[int, float, complex]
 │       ├── tan(x: typing.Union[int, float]) -> typing.Union[int, float]
 │       ├── tanh(x: typing.Union[int, float]) -> typing.Union[int, float]
 │       ├── totient(n: int) -> int
 │       ├── upper_gamma(s: typing.Union[int, float, complex], x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       ├── var(numbers: typing.Union[list, tuple], dof: int) -> typing.Union[int, float, complex]
+│       ├── var(numbers: typing.Union[list, tuple], ddof: int) -> typing.Union[int, float, complex]
 │       ├── xlogy(x: typing.Union[int, float, complex], y: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 │       └── zeta(alpha: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 ├── matrices
@@ -848,10 +846,22 @@ PyPyNum
 │       ├── 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]
+│       ├── qbeta(a: typing.Union[int, float, complex], b: typing.Union[int, float, complex], q: 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]
+│       ├── qcos_large(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qcos_small(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qcosh_large(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qcosh_small(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qexp_large(z: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qexp_small(z: 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]
+│       ├── qpi(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]
+│       ├── qsin_large(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qsin_small(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qsinh_large(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       └── qsinh_small(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 ├── stattest
 │   ├── CLASS
 │   └── FUNCTION
@@ -870,8 +880,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
@@ -882,10 +891,13 @@ 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
+│       ├── findall(seq: typing.Union[list, tuple, str], pat: typing.Union[list, tuple, str]) -> list
 │       ├── 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
+│       ├── kmp_table(pattern: typing.Union[list, tuple, str]) -> list
 │       ├── 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
@@ -894,6 +906,7 @@ PyPyNum
 │       ├── 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.16.0 → pypynum-1.16.2}/PyPyNum.egg-info/PKG-INFO RENAMED Viewed

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: PyPyNum
-Version: 1.16.0
+Version: 1.16.2
 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.16.0 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum | GitHub -> https://github.com/PythonSJL/PyPyNum
+## Version -> 1.16.2 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum | GitHub -> https://github.com/PythonSJL/PyPyNum
 ![LOGO](PyPyNum.png)
@@ -247,6 +247,15 @@ The logo cannot be displayed on PyPI, it can be viewed in Gitee or GitHub.
 + Update versions periodically to add more practical features
 + If you need to contact, please add QQ number 2261748025 (Py𝙿𝚢𝚝𝚑𝚘𝚗-水晶兰), or through my email 2261748025@qq.com
+```
++++++++++++++++++++++++++++++++++++++++++
++ Tip:                                  +
++ Have suggestions or feature requests? +
++ Feel free to share them with us.      +
++ Your feedback is highly appreciated!  +
++++++++++++++++++++++++++++++++++++++++++
+```
 ### Name and Function Introduction of Submodules
 |   Submodule Name    |                       Function Introduction                        |
@@ -327,81 +336,69 @@ Python interpreter and run it!
 ```
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-The submodule 'consts' has added
-a large number of mathematical
-and scientific constants,
-currently totaling 128.
+<<< Here are the newly added functions >>>
-This module defines a collection
-of constants representing
-various physical, mathematical,
-and unit conversion factors.
-These constants are commonly
-used in scientific and
-engineering calculations.
+kmp_table(pattern: Union[list, tuple, str]) -> list
+    Introduction
+    ==========
+    Generate the KMP (Knuth-Morris-Pratt) table for a given pattern.
-If you want to know information
-about each constant, you can
-execute 'help(consts)' to
-obtain it.
+    The KMP table is used to efficiently find occurrences of a pattern within a sequence by avoiding unnecessary
+    comparisons after a mismatch. This table determines how many characters can be skipped after a mismatch.
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
+    Example
+    ========
+    >>> kmp_table("AGCTGATCGTACGTAAGCTAGCTA")
+    [0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 2, 3, 4, 1, 2, 3, 4, 1]
+    >>>
+    :param pattern: The pattern for which to generate the KMP table.
+    :return: A list representing the KMP table for the given pattern.
-<<< Here are the newly added functions >>>
+findall(seq: Union[list, tuple, str], pat: Union[list, tuple, str]) -> list
+    Introduction
+    ==========
+    Find all indices of the subsequence 'pat' in 'seq'.
+    This function is designed to handle sequences such as lists, tuples, or strings and find all indices
+    of specified subsequences. It allows overlapping matches.
-PyPyNum
-├── special
-│   └── FUNCTION
-│       ├── qbinomial(n: typing.Union[int, float, complex], m: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       │   # Calculate the q-binomial coefficient of n and m with parameter q.
-│       ├── qfactorial(n: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       │   # Compute the q-factorial of n with parameter q.
-│       ├── qgamma(n: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       │   # Calculate the q-gamma function of n with parameter q.
-│       └── qpochhammer(a: typing.Union[int, float, complex], q: typing.Union[int, float, complex], n: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│           # Compute the q-Pochhammer symbol for given a, q, and n.
-├── multiprec
-│   └── FUNCTION
-│       ├── mp_catalan(sigfigs: int) -> decimal.Decimal
-│           # Calculate the Catalan's constant with a specified number of significant figures using multiprecision arithmetic.
-├── seqs
-│   └── FUNCTION
-│       ├── padovan(n: int, single: bool) -> typing.Union[int, list]
-│       │   # Generate the Padovan sequence up to the nth term.
-│       ├── pelllucas(n: int, single: bool) -> typing.Union[int, list]
-│       │   # Generate the Pell-Lucas sequence up to the nth term.
-│       ├── perrin(n: int, single: bool) -> typing.Union[int, list]
-│       │   # Generate the Perrin sequence up to the nth term.
-│       └── sylvester(n: int, single: bool) -> typing.Union[int, list]
-│           # Generate the Sylvester sequence up to the nth term.
-├── tools
-│   └── FUNCTION
-│       ├── lcsubseq(x: typing.Union[list, tuple, str], y: typing.Union[list, tuple, str]) -> list
-│       │   # Find the longest common subsequence between two sequences x and y.
-│       └── lcsubstr(x: typing.Union[list, tuple, str], y: typing.Union[list, tuple, str]) -> list
-│           # Find the longest common substring between two sequences x and y.
-├── matrices
-│   ├── CLASS
-│   │   └── Matrix(pypynum.arrays.Array)/__init__(self: Any, data: Any, check: Any) -> Any
-│   │       # Initialize a Matrix object from a given data array.
-│   └── FUNCTION
-│       ├── 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
-│       │   # Create a permutation matrix based on specified row and column swaps.
-│       └── perm_mat_indices(num_rows: int, num_cols: int, row_swaps: typing.Union[list, tuple], col_swaps: typing.Union[list, tuple]) -> tuple
-│           # Compute the indices for a permutation matrix based on specified row and column swaps.
+    Example
+    ========
+    >>> findall([2, 1, 2, 1, 2, 1, 2, 1], [1, 2, 1, 2])
+    [1, 3]
+    >>>
+    :param seq: The sequence in which to find the subsequence.
+    :param pat: The subsequence to be found.
+    :return: A list of starting indices where the subsequence is found.
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
+---------------------------------------------------------------------------------------
+| q-functions generalize classical math functions by introducing parameter q.         |
+| They are key in combinatorics and special functions, widely applied.                |
+| As q approaches 1, they revert to classical forms.                                  |
+| Examples include q-factorials, q-binomial coefficients, Jackson q-Bessel functions. |
+| These functions are crucial in fractals, chaotic systems, quantum groups.           |
+| They provide tools for solving complex mathematical challenges effectively.         |
+---------------------------------------------------------------------------------------
+Here are the 12 new q-functions added in the current version (adding the previous 4 makes a total of 16):
-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.
+qbeta(a: Union[int, float, complex], b: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qcos_large(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qcos_small(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qcosh_large(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qcosh_small(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qexp_large(z: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qexp_small(z: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qpi(q: Union[int, float, complex]) -> Union[int, float, complex]
+qsin_large(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qsin_small(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qsinh_large(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
+qsinh_small(x: Union[int, float, complex], q: Union[int, float, complex]) -> Union[int, float, complex]
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 ```
@@ -439,15 +436,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
@@ -501,7 +499,7 @@ PyPyNum
 │       ├── gamma_pdf(x: Any, shape: Any, scale: Any) -> Any
 │       ├── geometric_pmf(k: Any, p: Any) -> Any
 │       ├── hypergeom_pmf(k: Any, mg: Any, n: Any, nt: Any) -> Any
-│       ├── inv_gauss_pdf(x: Any, mu: Any, lambda_: Any, alpha: Any) -> Any
+│       ├── invgauss_pdf(x: Any, mu: Any, lambda_: Any, alpha: Any) -> Any
 │       ├── levy_pdf(x: Any, c: Any) -> Any
 │       ├── log_logistic_cdf(x: Any, alpha: Any, beta: Any) -> Any
 │       ├── log_logistic_pdf(x: Any, alpha: Any, beta: Any) -> Any
@@ -647,7 +645,7 @@ PyPyNum
 │       ├── cosh(x: typing.Union[int, float]) -> typing.Union[int, float]
 │       ├── cot(x: typing.Union[int, float]) -> typing.Union[int, float]
 │       ├── coth(x: typing.Union[int, float]) -> typing.Union[int, float]
-│       ├── cov(x: typing.Union[list, tuple], y: typing.Union[list, tuple], dof: int) -> typing.Union[int, float, complex]
+│       ├── cov(x: typing.Union[list, tuple], y: typing.Union[list, tuple], ddof: int) -> typing.Union[int, float, complex]
 │       ├── crt(n: typing.Union[list, tuple], a: typing.Union[list, tuple]) -> int
 │       ├── csc(x: typing.Union[int, float]) -> typing.Union[int, float]
 │       ├── csch(x: typing.Union[int, float]) -> typing.Union[int, float]
@@ -695,13 +693,13 @@ PyPyNum
 │       ├── sinh(x: typing.Union[int, float]) -> typing.Union[int, float]
 │       ├── skew(data: typing.Union[list, tuple]) -> float
 │       ├── square_mean(numbers: typing.Union[list, tuple]) -> typing.Union[int, float, complex]
-│       ├── std(numbers: typing.Union[list, tuple], dof: int) -> typing.Union[int, float, complex]
+│       ├── std(numbers: typing.Union[list, tuple], ddof: int) -> typing.Union[int, float, complex]
 │       ├── sumprod(arrays: typing.Union[list, tuple]) -> typing.Union[int, float, complex]
 │       ├── tan(x: typing.Union[int, float]) -> typing.Union[int, float]
 │       ├── tanh(x: typing.Union[int, float]) -> typing.Union[int, float]
 │       ├── totient(n: int) -> int
 │       ├── upper_gamma(s: typing.Union[int, float, complex], x: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
-│       ├── var(numbers: typing.Union[list, tuple], dof: int) -> typing.Union[int, float, complex]
+│       ├── var(numbers: typing.Union[list, tuple], ddof: int) -> typing.Union[int, float, complex]
 │       ├── xlogy(x: typing.Union[int, float, complex], y: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 │       └── zeta(alpha: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 ├── matrices
@@ -848,10 +846,22 @@ PyPyNum
 │       ├── 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]
+│       ├── qbeta(a: typing.Union[int, float, complex], b: typing.Union[int, float, complex], q: 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]
+│       ├── qcos_large(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qcos_small(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qcosh_large(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qcosh_small(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qexp_large(z: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qexp_small(z: 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]
+│       ├── qpi(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]
+│       ├── qsin_large(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qsin_small(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       ├── qsinh_large(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
+│       └── qsinh_small(x: typing.Union[int, float, complex], q: typing.Union[int, float, complex]) -> typing.Union[int, float, complex]
 ├── stattest
 │   ├── CLASS
 │   └── FUNCTION
@@ -870,8 +880,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
@@ -882,10 +891,13 @@ 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
+│       ├── findall(seq: typing.Union[list, tuple, str], pat: typing.Union[list, tuple, str]) -> list
 │       ├── 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
+│       ├── kmp_table(pattern: typing.Union[list, tuple, str]) -> list
 │       ├── 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
@@ -894,6 +906,7 @@ PyPyNum
 │       ├── 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.16.0__tar.gz → 1.16.2__tar.gz

PyPyNum 1.16.0tar.gz → 1.16.2tar.gz