backup 04_physworld 2026-11-08 10:11:26 (part 19)
Browse filesThis view is limited to 50 files because it contains too many changes. See raw diff
- .gitattributes +39 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy-1.17.1.dist-info/INSTALLER +1 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy-1.17.1.dist-info/LICENSE.txt +934 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy-1.17.1.dist-info/METADATA +1086 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy-1.17.1.dist-info/RECORD +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy-1.17.1.dist-info/REQUESTED +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy-1.17.1.dist-info/WHEEL +6 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libgfortran-040039e1-0352e75f.so.5.0.0 +3 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libgfortran-8f1e9814.so.5.0.0 +3 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libquadmath-828275a7.so.0.0.0 +3 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libquadmath-96973f99-934c22de.so.0.0.0 +3 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libscipy_openblas-6cdc3b4a.so +3 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_sf_error.py +153 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_sici.py +36 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_specfun.py +48 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_spence.py +32 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_spfun_stats.py +61 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_sph_harm.py +48 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_spherical_bessel.py +407 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_support_alternative_backends.py +402 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_trig.py +76 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_ufunc_signatures.py +51 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_wright_bessel.py +205 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_wrightomega.py +117 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_zeta.py +301 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__init__.py +672 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/__init__.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_axis_nan_policy.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_binned_statistic.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_binomtest.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_bws_test.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_censored_data.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_common.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_constants.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_continued_fraction.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_continuous_distns.cpython-311.pyc +3 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_correlation.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_covariance.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_crosstab.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_discrete_distns.cpython-311.pyc +3 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_distn_infrastructure.cpython-311.pyc +3 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_distr_params.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_distribution_infrastructure.cpython-311.pyc +3 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_entropy.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_finite_differences.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_fit.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_hypotests.cpython-311.pyc +3 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_kde.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_ksstats.cpython-311.pyc +0 -0
- physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_mannwhitneyu.cpython-311.pyc +0 -0
.gitattributes
CHANGED
|
@@ -3738,3 +3738,42 @@ physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/cython_
|
|
| 3738 |
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/__pycache__/test_basic.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3739 |
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/__pycache__/test_legendre.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3740 |
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/__pycache__/test_mpmath.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 3738 |
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/__pycache__/test_basic.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3739 |
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/__pycache__/test_legendre.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3740 |
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/__pycache__/test_mpmath.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3741 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_continuous_distns.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3742 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_discrete_distns.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3743 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_distn_infrastructure.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3744 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_distribution_infrastructure.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3745 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_hypotests.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3746 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_morestats.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3747 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_mstats_basic.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3748 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_multivariate.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3749 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_qmc.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3750 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_resampling.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3751 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_stats_py.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3752 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/_ansari_swilk_statistics.cpython-311-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 3753 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/_biasedurn.cpython-311-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 3754 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/_qmc_cy.cpython-311-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 3755 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/_qmvnt_cy.cpython-311-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 3756 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/_rcont/rcont.cpython-311-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 3757 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/_sobol.cpython-311-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 3758 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/_stats.cpython-311-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 3759 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/_stats_pythran.cpython-311-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 3760 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/_unuran/unuran_wrapper.cpython-311-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 3761 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/tests/__pycache__/test_continuous.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3762 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/tests/__pycache__/test_distributions.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3763 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/tests/__pycache__/test_hypotests.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3764 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/tests/__pycache__/test_morestats.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3765 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/tests/__pycache__/test_mstats_basic.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3766 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/tests/__pycache__/test_multivariate.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3767 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/tests/__pycache__/test_qmc.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3768 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/tests/__pycache__/test_resampling.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3769 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/tests/__pycache__/test_stats.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3770 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libgfortran-040039e1-0352e75f.so.5.0.0 filter=lfs diff=lfs merge=lfs -text
|
| 3771 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libgfortran-8f1e9814.so.5.0.0 filter=lfs diff=lfs merge=lfs -text
|
| 3772 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libquadmath-828275a7.so.0.0.0 filter=lfs diff=lfs merge=lfs -text
|
| 3773 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libquadmath-96973f99-934c22de.so.0.0.0 filter=lfs diff=lfs merge=lfs -text
|
| 3774 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libscipy_openblas-6cdc3b4a.so filter=lfs diff=lfs merge=lfs -text
|
| 3775 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/setuptools/_vendor/backports/tarfile/__pycache__/__init__.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3776 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/setuptools/_vendor/more_itertools/__pycache__/more.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3777 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/setuptools/config/_validate_pyproject/__pycache__/fastjsonschema_validations.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3778 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/trimesh/__pycache__/base.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
| 3779 |
+
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/trimesh/__pycache__/transformations.cpython-311.pyc filter=lfs diff=lfs merge=lfs -text
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy-1.17.1.dist-info/INSTALLER
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
pip
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy-1.17.1.dist-info/LICENSE.txt
ADDED
|
@@ -0,0 +1,934 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Copyright (c) 2001-2002 Enthought, Inc. 2003, SciPy Developers.
|
| 2 |
+
All rights reserved.
|
| 3 |
+
|
| 4 |
+
Redistribution and use in source and binary forms, with or without
|
| 5 |
+
modification, are permitted provided that the following conditions
|
| 6 |
+
are met:
|
| 7 |
+
|
| 8 |
+
1. Redistributions of source code must retain the above copyright
|
| 9 |
+
notice, this list of conditions and the following disclaimer.
|
| 10 |
+
|
| 11 |
+
2. Redistributions in binary form must reproduce the above
|
| 12 |
+
copyright notice, this list of conditions and the following
|
| 13 |
+
disclaimer in the documentation and/or other materials provided
|
| 14 |
+
with the distribution.
|
| 15 |
+
|
| 16 |
+
3. Neither the name of the copyright holder nor the names of its
|
| 17 |
+
contributors may be used to endorse or promote products derived
|
| 18 |
+
from this software without specific prior written permission.
|
| 19 |
+
|
| 20 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 21 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 22 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 23 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 24 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 25 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 26 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 27 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 28 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 29 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 30 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 31 |
+
|
| 32 |
+
----
|
| 33 |
+
|
| 34 |
+
This binary distribution of SciPy can also bundle the following software
|
| 35 |
+
(depending on the build):
|
| 36 |
+
|
| 37 |
+
|
| 38 |
+
Name: OpenBLAS
|
| 39 |
+
Files: scipy.libs/libscipy_openblas*.so
|
| 40 |
+
Description: bundled as a dynamically linked library
|
| 41 |
+
Availability: https://github.com/OpenMathLib/OpenBLAS/
|
| 42 |
+
License: BSD-3-Clause
|
| 43 |
+
Copyright (c) 2011-2014, The OpenBLAS Project
|
| 44 |
+
All rights reserved.
|
| 45 |
+
|
| 46 |
+
Redistribution and use in source and binary forms, with or without
|
| 47 |
+
modification, are permitted provided that the following conditions are
|
| 48 |
+
met:
|
| 49 |
+
|
| 50 |
+
1. Redistributions of source code must retain the above copyright
|
| 51 |
+
notice, this list of conditions and the following disclaimer.
|
| 52 |
+
|
| 53 |
+
2. Redistributions in binary form must reproduce the above copyright
|
| 54 |
+
notice, this list of conditions and the following disclaimer in
|
| 55 |
+
the documentation and/or other materials provided with the
|
| 56 |
+
distribution.
|
| 57 |
+
3. Neither the name of the OpenBLAS project nor the names of
|
| 58 |
+
its contributors may be used to endorse or promote products
|
| 59 |
+
derived from this software without specific prior written
|
| 60 |
+
permission.
|
| 61 |
+
|
| 62 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 63 |
+
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 64 |
+
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 65 |
+
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
| 66 |
+
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
| 67 |
+
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
| 68 |
+
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
| 69 |
+
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
| 70 |
+
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
|
| 71 |
+
USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 72 |
+
|
| 73 |
+
|
| 74 |
+
Name: LAPACK
|
| 75 |
+
Files: scipy.libs/libscipy_openblas*.so
|
| 76 |
+
Description: bundled in OpenBLAS
|
| 77 |
+
Availability: https://github.com/OpenMathLib/OpenBLAS/
|
| 78 |
+
License: BSD-3-Clause-Open-MPI
|
| 79 |
+
Copyright (c) 1992-2013 The University of Tennessee and The University
|
| 80 |
+
of Tennessee Research Foundation. All rights
|
| 81 |
+
reserved.
|
| 82 |
+
Copyright (c) 2000-2013 The University of California Berkeley. All
|
| 83 |
+
rights reserved.
|
| 84 |
+
Copyright (c) 2006-2013 The University of Colorado Denver. All rights
|
| 85 |
+
reserved.
|
| 86 |
+
|
| 87 |
+
$COPYRIGHT$
|
| 88 |
+
|
| 89 |
+
Additional copyrights may follow
|
| 90 |
+
|
| 91 |
+
$HEADER$
|
| 92 |
+
|
| 93 |
+
Redistribution and use in source and binary forms, with or without
|
| 94 |
+
modification, are permitted provided that the following conditions are
|
| 95 |
+
met:
|
| 96 |
+
|
| 97 |
+
- Redistributions of source code must retain the above copyright
|
| 98 |
+
notice, this list of conditions and the following disclaimer.
|
| 99 |
+
|
| 100 |
+
- Redistributions in binary form must reproduce the above copyright
|
| 101 |
+
notice, this list of conditions and the following disclaimer listed
|
| 102 |
+
in this license in the documentation and/or other materials
|
| 103 |
+
provided with the distribution.
|
| 104 |
+
|
| 105 |
+
- Neither the name of the copyright holders nor the names of its
|
| 106 |
+
contributors may be used to endorse or promote products derived from
|
| 107 |
+
this software without specific prior written permission.
|
| 108 |
+
|
| 109 |
+
The copyright holders provide no reassurances that the source code
|
| 110 |
+
provided does not infringe any patent, copyright, or any other
|
| 111 |
+
intellectual property rights of third parties. The copyright holders
|
| 112 |
+
disclaim any liability to any recipient for claims brought against
|
| 113 |
+
recipient by any third party for infringement of that parties
|
| 114 |
+
intellectual property rights.
|
| 115 |
+
|
| 116 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 117 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 118 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 119 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 120 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 121 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 122 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 123 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 124 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 125 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 126 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 127 |
+
|
| 128 |
+
|
| 129 |
+
Name: GCC runtime library
|
| 130 |
+
Files: scipy.libs/libgfortran*.so
|
| 131 |
+
Description: dynamically linked to files compiled with gcc
|
| 132 |
+
Availability: https://gcc.gnu.org/git/?p=gcc.git;a=tree;f=libgfortran
|
| 133 |
+
License: GPL-3.0-or-later WITH GCC-exception-3.1
|
| 134 |
+
Copyright (C) 2002-2017 Free Software Foundation, Inc.
|
| 135 |
+
|
| 136 |
+
Libgfortran is free software; you can redistribute it and/or modify
|
| 137 |
+
it under the terms of the GNU General Public License as published by
|
| 138 |
+
the Free Software Foundation; either version 3, or (at your option)
|
| 139 |
+
any later version.
|
| 140 |
+
|
| 141 |
+
Libgfortran is distributed in the hope that it will be useful,
|
| 142 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 143 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 144 |
+
GNU General Public License for more details.
|
| 145 |
+
|
| 146 |
+
Under Section 7 of GPL version 3, you are granted additional
|
| 147 |
+
permissions described in the GCC Runtime Library Exception, version
|
| 148 |
+
3.1, as published by the Free Software Foundation.
|
| 149 |
+
|
| 150 |
+
You should have received a copy of the GNU General Public License and
|
| 151 |
+
a copy of the GCC Runtime Library Exception along with this program;
|
| 152 |
+
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
| 153 |
+
<http://www.gnu.org/licenses/>.
|
| 154 |
+
|
| 155 |
+
----
|
| 156 |
+
|
| 157 |
+
Full text of license texts referred to above follows (that they are
|
| 158 |
+
listed below does not necessarily imply the conditions apply to the
|
| 159 |
+
present binary release):
|
| 160 |
+
|
| 161 |
+
----
|
| 162 |
+
|
| 163 |
+
GCC RUNTIME LIBRARY EXCEPTION
|
| 164 |
+
|
| 165 |
+
Version 3.1, 31 March 2009
|
| 166 |
+
|
| 167 |
+
Copyright (C) 2009 Free Software Foundation, Inc. <http://fsf.org/>
|
| 168 |
+
|
| 169 |
+
Everyone is permitted to copy and distribute verbatim copies of this
|
| 170 |
+
license document, but changing it is not allowed.
|
| 171 |
+
|
| 172 |
+
This GCC Runtime Library Exception ("Exception") is an additional
|
| 173 |
+
permission under section 7 of the GNU General Public License, version
|
| 174 |
+
3 ("GPLv3"). It applies to a given file (the "Runtime Library") that
|
| 175 |
+
bears a notice placed by the copyright holder of the file stating that
|
| 176 |
+
the file is governed by GPLv3 along with this Exception.
|
| 177 |
+
|
| 178 |
+
When you use GCC to compile a program, GCC may combine portions of
|
| 179 |
+
certain GCC header files and runtime libraries with the compiled
|
| 180 |
+
program. The purpose of this Exception is to allow compilation of
|
| 181 |
+
non-GPL (including proprietary) programs to use, in this way, the
|
| 182 |
+
header files and runtime libraries covered by this Exception.
|
| 183 |
+
|
| 184 |
+
0. Definitions.
|
| 185 |
+
|
| 186 |
+
A file is an "Independent Module" if it either requires the Runtime
|
| 187 |
+
Library for execution after a Compilation Process, or makes use of an
|
| 188 |
+
interface provided by the Runtime Library, but is not otherwise based
|
| 189 |
+
on the Runtime Library.
|
| 190 |
+
|
| 191 |
+
"GCC" means a version of the GNU Compiler Collection, with or without
|
| 192 |
+
modifications, governed by version 3 (or a specified later version) of
|
| 193 |
+
the GNU General Public License (GPL) with the option of using any
|
| 194 |
+
subsequent versions published by the FSF.
|
| 195 |
+
|
| 196 |
+
"GPL-compatible Software" is software whose conditions of propagation,
|
| 197 |
+
modification and use would permit combination with GCC in accord with
|
| 198 |
+
the license of GCC.
|
| 199 |
+
|
| 200 |
+
"Target Code" refers to output from any compiler for a real or virtual
|
| 201 |
+
target processor architecture, in executable form or suitable for
|
| 202 |
+
input to an assembler, loader, linker and/or execution
|
| 203 |
+
phase. Notwithstanding that, Target Code does not include data in any
|
| 204 |
+
format that is used as a compiler intermediate representation, or used
|
| 205 |
+
for producing a compiler intermediate representation.
|
| 206 |
+
|
| 207 |
+
The "Compilation Process" transforms code entirely represented in
|
| 208 |
+
non-intermediate languages designed for human-written code, and/or in
|
| 209 |
+
Java Virtual Machine byte code, into Target Code. Thus, for example,
|
| 210 |
+
use of source code generators and preprocessors need not be considered
|
| 211 |
+
part of the Compilation Process, since the Compilation Process can be
|
| 212 |
+
understood as starting with the output of the generators or
|
| 213 |
+
preprocessors.
|
| 214 |
+
|
| 215 |
+
A Compilation Process is "Eligible" if it is done using GCC, alone or
|
| 216 |
+
with other GPL-compatible software, or if it is done without using any
|
| 217 |
+
work based on GCC. For example, using non-GPL-compatible Software to
|
| 218 |
+
optimize any GCC intermediate representations would not qualify as an
|
| 219 |
+
Eligible Compilation Process.
|
| 220 |
+
|
| 221 |
+
1. Grant of Additional Permission.
|
| 222 |
+
|
| 223 |
+
You have permission to propagate a work of Target Code formed by
|
| 224 |
+
combining the Runtime Library with Independent Modules, even if such
|
| 225 |
+
propagation would otherwise violate the terms of GPLv3, provided that
|
| 226 |
+
all Target Code was generated by Eligible Compilation Processes. You
|
| 227 |
+
may then convey such a combination under terms of your choice,
|
| 228 |
+
consistent with the licensing of the Independent Modules.
|
| 229 |
+
|
| 230 |
+
2. No Weakening of GCC Copyleft.
|
| 231 |
+
|
| 232 |
+
The availability of this Exception does not imply any general
|
| 233 |
+
presumption that third-party software is unaffected by the copyleft
|
| 234 |
+
requirements of the license of GCC.
|
| 235 |
+
|
| 236 |
+
----
|
| 237 |
+
|
| 238 |
+
GNU GENERAL PUBLIC LICENSE
|
| 239 |
+
Version 3, 29 June 2007
|
| 240 |
+
|
| 241 |
+
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
| 242 |
+
Everyone is permitted to copy and distribute verbatim copies
|
| 243 |
+
of this license document, but changing it is not allowed.
|
| 244 |
+
|
| 245 |
+
Preamble
|
| 246 |
+
|
| 247 |
+
The GNU General Public License is a free, copyleft license for
|
| 248 |
+
software and other kinds of works.
|
| 249 |
+
|
| 250 |
+
The licenses for most software and other practical works are designed
|
| 251 |
+
to take away your freedom to share and change the works. By contrast,
|
| 252 |
+
the GNU General Public License is intended to guarantee your freedom to
|
| 253 |
+
share and change all versions of a program--to make sure it remains free
|
| 254 |
+
software for all its users. We, the Free Software Foundation, use the
|
| 255 |
+
GNU General Public License for most of our software; it applies also to
|
| 256 |
+
any other work released this way by its authors. You can apply it to
|
| 257 |
+
your programs, too.
|
| 258 |
+
|
| 259 |
+
When we speak of free software, we are referring to freedom, not
|
| 260 |
+
price. Our General Public Licenses are designed to make sure that you
|
| 261 |
+
have the freedom to distribute copies of free software (and charge for
|
| 262 |
+
them if you wish), that you receive source code or can get it if you
|
| 263 |
+
want it, that you can change the software or use pieces of it in new
|
| 264 |
+
free programs, and that you know you can do these things.
|
| 265 |
+
|
| 266 |
+
To protect your rights, we need to prevent others from denying you
|
| 267 |
+
these rights or asking you to surrender the rights. Therefore, you have
|
| 268 |
+
certain responsibilities if you distribute copies of the software, or if
|
| 269 |
+
you modify it: responsibilities to respect the freedom of others.
|
| 270 |
+
|
| 271 |
+
For example, if you distribute copies of such a program, whether
|
| 272 |
+
gratis or for a fee, you must pass on to the recipients the same
|
| 273 |
+
freedoms that you received. You must make sure that they, too, receive
|
| 274 |
+
or can get the source code. And you must show them these terms so they
|
| 275 |
+
know their rights.
|
| 276 |
+
|
| 277 |
+
Developers that use the GNU GPL protect your rights with two steps:
|
| 278 |
+
(1) assert copyright on the software, and (2) offer you this License
|
| 279 |
+
giving you legal permission to copy, distribute and/or modify it.
|
| 280 |
+
|
| 281 |
+
For the developers' and authors' protection, the GPL clearly explains
|
| 282 |
+
that there is no warranty for this free software. For both users' and
|
| 283 |
+
authors' sake, the GPL requires that modified versions be marked as
|
| 284 |
+
changed, so that their problems will not be attributed erroneously to
|
| 285 |
+
authors of previous versions.
|
| 286 |
+
|
| 287 |
+
Some devices are designed to deny users access to install or run
|
| 288 |
+
modified versions of the software inside them, although the manufacturer
|
| 289 |
+
can do so. This is fundamentally incompatible with the aim of
|
| 290 |
+
protecting users' freedom to change the software. The systematic
|
| 291 |
+
pattern of such abuse occurs in the area of products for individuals to
|
| 292 |
+
use, which is precisely where it is most unacceptable. Therefore, we
|
| 293 |
+
have designed this version of the GPL to prohibit the practice for those
|
| 294 |
+
products. If such problems arise substantially in other domains, we
|
| 295 |
+
stand ready to extend this provision to those domains in future versions
|
| 296 |
+
of the GPL, as needed to protect the freedom of users.
|
| 297 |
+
|
| 298 |
+
Finally, every program is threatened constantly by software patents.
|
| 299 |
+
States should not allow patents to restrict development and use of
|
| 300 |
+
software on general-purpose computers, but in those that do, we wish to
|
| 301 |
+
avoid the special danger that patents applied to a free program could
|
| 302 |
+
make it effectively proprietary. To prevent this, the GPL assures that
|
| 303 |
+
patents cannot be used to render the program non-free.
|
| 304 |
+
|
| 305 |
+
The precise terms and conditions for copying, distribution and
|
| 306 |
+
modification follow.
|
| 307 |
+
|
| 308 |
+
TERMS AND CONDITIONS
|
| 309 |
+
|
| 310 |
+
0. Definitions.
|
| 311 |
+
|
| 312 |
+
"This License" refers to version 3 of the GNU General Public License.
|
| 313 |
+
|
| 314 |
+
"Copyright" also means copyright-like laws that apply to other kinds of
|
| 315 |
+
works, such as semiconductor masks.
|
| 316 |
+
|
| 317 |
+
"The Program" refers to any copyrightable work licensed under this
|
| 318 |
+
License. Each licensee is addressed as "you". "Licensees" and
|
| 319 |
+
"recipients" may be individuals or organizations.
|
| 320 |
+
|
| 321 |
+
To "modify" a work means to copy from or adapt all or part of the work
|
| 322 |
+
in a fashion requiring copyright permission, other than the making of an
|
| 323 |
+
exact copy. The resulting work is called a "modified version" of the
|
| 324 |
+
earlier work or a work "based on" the earlier work.
|
| 325 |
+
|
| 326 |
+
A "covered work" means either the unmodified Program or a work based
|
| 327 |
+
on the Program.
|
| 328 |
+
|
| 329 |
+
To "propagate" a work means to do anything with it that, without
|
| 330 |
+
permission, would make you directly or secondarily liable for
|
| 331 |
+
infringement under applicable copyright law, except executing it on a
|
| 332 |
+
computer or modifying a private copy. Propagation includes copying,
|
| 333 |
+
distribution (with or without modification), making available to the
|
| 334 |
+
public, and in some countries other activities as well.
|
| 335 |
+
|
| 336 |
+
To "convey" a work means any kind of propagation that enables other
|
| 337 |
+
parties to make or receive copies. Mere interaction with a user through
|
| 338 |
+
a computer network, with no transfer of a copy, is not conveying.
|
| 339 |
+
|
| 340 |
+
An interactive user interface displays "Appropriate Legal Notices"
|
| 341 |
+
to the extent that it includes a convenient and prominently visible
|
| 342 |
+
feature that (1) displays an appropriate copyright notice, and (2)
|
| 343 |
+
tells the user that there is no warranty for the work (except to the
|
| 344 |
+
extent that warranties are provided), that licensees may convey the
|
| 345 |
+
work under this License, and how to view a copy of this License. If
|
| 346 |
+
the interface presents a list of user commands or options, such as a
|
| 347 |
+
menu, a prominent item in the list meets this criterion.
|
| 348 |
+
|
| 349 |
+
1. Source Code.
|
| 350 |
+
|
| 351 |
+
The "source code" for a work means the preferred form of the work
|
| 352 |
+
for making modifications to it. "Object code" means any non-source
|
| 353 |
+
form of a work.
|
| 354 |
+
|
| 355 |
+
A "Standard Interface" means an interface that either is an official
|
| 356 |
+
standard defined by a recognized standards body, or, in the case of
|
| 357 |
+
interfaces specified for a particular programming language, one that
|
| 358 |
+
is widely used among developers working in that language.
|
| 359 |
+
|
| 360 |
+
The "System Libraries" of an executable work include anything, other
|
| 361 |
+
than the work as a whole, that (a) is included in the normal form of
|
| 362 |
+
packaging a Major Component, but which is not part of that Major
|
| 363 |
+
Component, and (b) serves only to enable use of the work with that
|
| 364 |
+
Major Component, or to implement a Standard Interface for which an
|
| 365 |
+
implementation is available to the public in source code form. A
|
| 366 |
+
"Major Component", in this context, means a major essential component
|
| 367 |
+
(kernel, window system, and so on) of the specific operating system
|
| 368 |
+
(if any) on which the executable work runs, or a compiler used to
|
| 369 |
+
produce the work, or an object code interpreter used to run it.
|
| 370 |
+
|
| 371 |
+
The "Corresponding Source" for a work in object code form means all
|
| 372 |
+
the source code needed to generate, install, and (for an executable
|
| 373 |
+
work) run the object code and to modify the work, including scripts to
|
| 374 |
+
control those activities. However, it does not include the work's
|
| 375 |
+
System Libraries, or general-purpose tools or generally available free
|
| 376 |
+
programs which are used unmodified in performing those activities but
|
| 377 |
+
which are not part of the work. For example, Corresponding Source
|
| 378 |
+
includes interface definition files associated with source files for
|
| 379 |
+
the work, and the source code for shared libraries and dynamically
|
| 380 |
+
linked subprograms that the work is specifically designed to require,
|
| 381 |
+
such as by intimate data communication or control flow between those
|
| 382 |
+
subprograms and other parts of the work.
|
| 383 |
+
|
| 384 |
+
The Corresponding Source need not include anything that users
|
| 385 |
+
can regenerate automatically from other parts of the Corresponding
|
| 386 |
+
Source.
|
| 387 |
+
|
| 388 |
+
The Corresponding Source for a work in source code form is that
|
| 389 |
+
same work.
|
| 390 |
+
|
| 391 |
+
2. Basic Permissions.
|
| 392 |
+
|
| 393 |
+
All rights granted under this License are granted for the term of
|
| 394 |
+
copyright on the Program, and are irrevocable provided the stated
|
| 395 |
+
conditions are met. This License explicitly affirms your unlimited
|
| 396 |
+
permission to run the unmodified Program. The output from running a
|
| 397 |
+
covered work is covered by this License only if the output, given its
|
| 398 |
+
content, constitutes a covered work. This License acknowledges your
|
| 399 |
+
rights of fair use or other equivalent, as provided by copyright law.
|
| 400 |
+
|
| 401 |
+
You may make, run and propagate covered works that you do not
|
| 402 |
+
convey, without conditions so long as your license otherwise remains
|
| 403 |
+
in force. You may convey covered works to others for the sole purpose
|
| 404 |
+
of having them make modifications exclusively for you, or provide you
|
| 405 |
+
with facilities for running those works, provided that you comply with
|
| 406 |
+
the terms of this License in conveying all material for which you do
|
| 407 |
+
not control copyright. Those thus making or running the covered works
|
| 408 |
+
for you must do so exclusively on your behalf, under your direction
|
| 409 |
+
and control, on terms that prohibit them from making any copies of
|
| 410 |
+
your copyrighted material outside their relationship with you.
|
| 411 |
+
|
| 412 |
+
Conveying under any other circumstances is permitted solely under
|
| 413 |
+
the conditions stated below. Sublicensing is not allowed; section 10
|
| 414 |
+
makes it unnecessary.
|
| 415 |
+
|
| 416 |
+
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
| 417 |
+
|
| 418 |
+
No covered work shall be deemed part of an effective technological
|
| 419 |
+
measure under any applicable law fulfilling obligations under article
|
| 420 |
+
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
| 421 |
+
similar laws prohibiting or restricting circumvention of such
|
| 422 |
+
measures.
|
| 423 |
+
|
| 424 |
+
When you convey a covered work, you waive any legal power to forbid
|
| 425 |
+
circumvention of technological measures to the extent such circumvention
|
| 426 |
+
is effected by exercising rights under this License with respect to
|
| 427 |
+
the covered work, and you disclaim any intention to limit operation or
|
| 428 |
+
modification of the work as a means of enforcing, against the work's
|
| 429 |
+
users, your or third parties' legal rights to forbid circumvention of
|
| 430 |
+
technological measures.
|
| 431 |
+
|
| 432 |
+
4. Conveying Verbatim Copies.
|
| 433 |
+
|
| 434 |
+
You may convey verbatim copies of the Program's source code as you
|
| 435 |
+
receive it, in any medium, provided that you conspicuously and
|
| 436 |
+
appropriately publish on each copy an appropriate copyright notice;
|
| 437 |
+
keep intact all notices stating that this License and any
|
| 438 |
+
non-permissive terms added in accord with section 7 apply to the code;
|
| 439 |
+
keep intact all notices of the absence of any warranty; and give all
|
| 440 |
+
recipients a copy of this License along with the Program.
|
| 441 |
+
|
| 442 |
+
You may charge any price or no price for each copy that you convey,
|
| 443 |
+
and you may offer support or warranty protection for a fee.
|
| 444 |
+
|
| 445 |
+
5. Conveying Modified Source Versions.
|
| 446 |
+
|
| 447 |
+
You may convey a work based on the Program, or the modifications to
|
| 448 |
+
produce it from the Program, in the form of source code under the
|
| 449 |
+
terms of section 4, provided that you also meet all of these conditions:
|
| 450 |
+
|
| 451 |
+
a) The work must carry prominent notices stating that you modified
|
| 452 |
+
it, and giving a relevant date.
|
| 453 |
+
|
| 454 |
+
b) The work must carry prominent notices stating that it is
|
| 455 |
+
released under this License and any conditions added under section
|
| 456 |
+
7. This requirement modifies the requirement in section 4 to
|
| 457 |
+
"keep intact all notices".
|
| 458 |
+
|
| 459 |
+
c) You must license the entire work, as a whole, under this
|
| 460 |
+
License to anyone who comes into possession of a copy. This
|
| 461 |
+
License will therefore apply, along with any applicable section 7
|
| 462 |
+
additional terms, to the whole of the work, and all its parts,
|
| 463 |
+
regardless of how they are packaged. This License gives no
|
| 464 |
+
permission to license the work in any other way, but it does not
|
| 465 |
+
invalidate such permission if you have separately received it.
|
| 466 |
+
|
| 467 |
+
d) If the work has interactive user interfaces, each must display
|
| 468 |
+
Appropriate Legal Notices; however, if the Program has interactive
|
| 469 |
+
interfaces that do not display Appropriate Legal Notices, your
|
| 470 |
+
work need not make them do so.
|
| 471 |
+
|
| 472 |
+
A compilation of a covered work with other separate and independent
|
| 473 |
+
works, which are not by their nature extensions of the covered work,
|
| 474 |
+
and which are not combined with it such as to form a larger program,
|
| 475 |
+
in or on a volume of a storage or distribution medium, is called an
|
| 476 |
+
"aggregate" if the compilation and its resulting copyright are not
|
| 477 |
+
used to limit the access or legal rights of the compilation's users
|
| 478 |
+
beyond what the individual works permit. Inclusion of a covered work
|
| 479 |
+
in an aggregate does not cause this License to apply to the other
|
| 480 |
+
parts of the aggregate.
|
| 481 |
+
|
| 482 |
+
6. Conveying Non-Source Forms.
|
| 483 |
+
|
| 484 |
+
You may convey a covered work in object code form under the terms
|
| 485 |
+
of sections 4 and 5, provided that you also convey the
|
| 486 |
+
machine-readable Corresponding Source under the terms of this License,
|
| 487 |
+
in one of these ways:
|
| 488 |
+
|
| 489 |
+
a) Convey the object code in, or embodied in, a physical product
|
| 490 |
+
(including a physical distribution medium), accompanied by the
|
| 491 |
+
Corresponding Source fixed on a durable physical medium
|
| 492 |
+
customarily used for software interchange.
|
| 493 |
+
|
| 494 |
+
b) Convey the object code in, or embodied in, a physical product
|
| 495 |
+
(including a physical distribution medium), accompanied by a
|
| 496 |
+
written offer, valid for at least three years and valid for as
|
| 497 |
+
long as you offer spare parts or customer support for that product
|
| 498 |
+
model, to give anyone who possesses the object code either (1) a
|
| 499 |
+
copy of the Corresponding Source for all the software in the
|
| 500 |
+
product that is covered by this License, on a durable physical
|
| 501 |
+
medium customarily used for software interchange, for a price no
|
| 502 |
+
more than your reasonable cost of physically performing this
|
| 503 |
+
conveying of source, or (2) access to copy the
|
| 504 |
+
Corresponding Source from a network server at no charge.
|
| 505 |
+
|
| 506 |
+
c) Convey individual copies of the object code with a copy of the
|
| 507 |
+
written offer to provide the Corresponding Source. This
|
| 508 |
+
alternative is allowed only occasionally and noncommercially, and
|
| 509 |
+
only if you received the object code with such an offer, in accord
|
| 510 |
+
with subsection 6b.
|
| 511 |
+
|
| 512 |
+
d) Convey the object code by offering access from a designated
|
| 513 |
+
place (gratis or for a charge), and offer equivalent access to the
|
| 514 |
+
Corresponding Source in the same way through the same place at no
|
| 515 |
+
further charge. You need not require recipients to copy the
|
| 516 |
+
Corresponding Source along with the object code. If the place to
|
| 517 |
+
copy the object code is a network server, the Corresponding Source
|
| 518 |
+
may be on a different server (operated by you or a third party)
|
| 519 |
+
that supports equivalent copying facilities, provided you maintain
|
| 520 |
+
clear directions next to the object code saying where to find the
|
| 521 |
+
Corresponding Source. Regardless of what server hosts the
|
| 522 |
+
Corresponding Source, you remain obligated to ensure that it is
|
| 523 |
+
available for as long as needed to satisfy these requirements.
|
| 524 |
+
|
| 525 |
+
e) Convey the object code using peer-to-peer transmission, provided
|
| 526 |
+
you inform other peers where the object code and Corresponding
|
| 527 |
+
Source of the work are being offered to the general public at no
|
| 528 |
+
charge under subsection 6d.
|
| 529 |
+
|
| 530 |
+
A separable portion of the object code, whose source code is excluded
|
| 531 |
+
from the Corresponding Source as a System Library, need not be
|
| 532 |
+
included in conveying the object code work.
|
| 533 |
+
|
| 534 |
+
A "User Product" is either (1) a "consumer product", which means any
|
| 535 |
+
tangible personal property which is normally used for personal, family,
|
| 536 |
+
or household purposes, or (2) anything designed or sold for incorporation
|
| 537 |
+
into a dwelling. In determining whether a product is a consumer product,
|
| 538 |
+
doubtful cases shall be resolved in favor of coverage. For a particular
|
| 539 |
+
product received by a particular user, "normally used" refers to a
|
| 540 |
+
typical or common use of that class of product, regardless of the status
|
| 541 |
+
of the particular user or of the way in which the particular user
|
| 542 |
+
actually uses, or expects or is expected to use, the product. A product
|
| 543 |
+
is a consumer product regardless of whether the product has substantial
|
| 544 |
+
commercial, industrial or non-consumer uses, unless such uses represent
|
| 545 |
+
the only significant mode of use of the product.
|
| 546 |
+
|
| 547 |
+
"Installation Information" for a User Product means any methods,
|
| 548 |
+
procedures, authorization keys, or other information required to install
|
| 549 |
+
and execute modified versions of a covered work in that User Product from
|
| 550 |
+
a modified version of its Corresponding Source. The information must
|
| 551 |
+
suffice to ensure that the continued functioning of the modified object
|
| 552 |
+
code is in no case prevented or interfered with solely because
|
| 553 |
+
modification has been made.
|
| 554 |
+
|
| 555 |
+
If you convey an object code work under this section in, or with, or
|
| 556 |
+
specifically for use in, a User Product, and the conveying occurs as
|
| 557 |
+
part of a transaction in which the right of possession and use of the
|
| 558 |
+
User Product is transferred to the recipient in perpetuity or for a
|
| 559 |
+
fixed term (regardless of how the transaction is characterized), the
|
| 560 |
+
Corresponding Source conveyed under this section must be accompanied
|
| 561 |
+
by the Installation Information. But this requirement does not apply
|
| 562 |
+
if neither you nor any third party retains the ability to install
|
| 563 |
+
modified object code on the User Product (for example, the work has
|
| 564 |
+
been installed in ROM).
|
| 565 |
+
|
| 566 |
+
The requirement to provide Installation Information does not include a
|
| 567 |
+
requirement to continue to provide support service, warranty, or updates
|
| 568 |
+
for a work that has been modified or installed by the recipient, or for
|
| 569 |
+
the User Product in which it has been modified or installed. Access to a
|
| 570 |
+
network may be denied when the modification itself materially and
|
| 571 |
+
adversely affects the operation of the network or violates the rules and
|
| 572 |
+
protocols for communication across the network.
|
| 573 |
+
|
| 574 |
+
Corresponding Source conveyed, and Installation Information provided,
|
| 575 |
+
in accord with this section must be in a format that is publicly
|
| 576 |
+
documented (and with an implementation available to the public in
|
| 577 |
+
source code form), and must require no special password or key for
|
| 578 |
+
unpacking, reading or copying.
|
| 579 |
+
|
| 580 |
+
7. Additional Terms.
|
| 581 |
+
|
| 582 |
+
"Additional permissions" are terms that supplement the terms of this
|
| 583 |
+
License by making exceptions from one or more of its conditions.
|
| 584 |
+
Additional permissions that are applicable to the entire Program shall
|
| 585 |
+
be treated as though they were included in this License, to the extent
|
| 586 |
+
that they are valid under applicable law. If additional permissions
|
| 587 |
+
apply only to part of the Program, that part may be used separately
|
| 588 |
+
under those permissions, but the entire Program remains governed by
|
| 589 |
+
this License without regard to the additional permissions.
|
| 590 |
+
|
| 591 |
+
When you convey a copy of a covered work, you may at your option
|
| 592 |
+
remove any additional permissions from that copy, or from any part of
|
| 593 |
+
it. (Additional permissions may be written to require their own
|
| 594 |
+
removal in certain cases when you modify the work.) You may place
|
| 595 |
+
additional permissions on material, added by you to a covered work,
|
| 596 |
+
for which you have or can give appropriate copyright permission.
|
| 597 |
+
|
| 598 |
+
Notwithstanding any other provision of this License, for material you
|
| 599 |
+
add to a covered work, you may (if authorized by the copyright holders of
|
| 600 |
+
that material) supplement the terms of this License with terms:
|
| 601 |
+
|
| 602 |
+
a) Disclaiming warranty or limiting liability differently from the
|
| 603 |
+
terms of sections 15 and 16 of this License; or
|
| 604 |
+
|
| 605 |
+
b) Requiring preservation of specified reasonable legal notices or
|
| 606 |
+
author attributions in that material or in the Appropriate Legal
|
| 607 |
+
Notices displayed by works containing it; or
|
| 608 |
+
|
| 609 |
+
c) Prohibiting misrepresentation of the origin of that material, or
|
| 610 |
+
requiring that modified versions of such material be marked in
|
| 611 |
+
reasonable ways as different from the original version; or
|
| 612 |
+
|
| 613 |
+
d) Limiting the use for publicity purposes of names of licensors or
|
| 614 |
+
authors of the material; or
|
| 615 |
+
|
| 616 |
+
e) Declining to grant rights under trademark law for use of some
|
| 617 |
+
trade names, trademarks, or service marks; or
|
| 618 |
+
|
| 619 |
+
f) Requiring indemnification of licensors and authors of that
|
| 620 |
+
material by anyone who conveys the material (or modified versions of
|
| 621 |
+
it) with contractual assumptions of liability to the recipient, for
|
| 622 |
+
any liability that these contractual assumptions directly impose on
|
| 623 |
+
those licensors and authors.
|
| 624 |
+
|
| 625 |
+
All other non-permissive additional terms are considered "further
|
| 626 |
+
restrictions" within the meaning of section 10. If the Program as you
|
| 627 |
+
received it, or any part of it, contains a notice stating that it is
|
| 628 |
+
governed by this License along with a term that is a further
|
| 629 |
+
restriction, you may remove that term. If a license document contains
|
| 630 |
+
a further restriction but permits relicensing or conveying under this
|
| 631 |
+
License, you may add to a covered work material governed by the terms
|
| 632 |
+
of that license document, provided that the further restriction does
|
| 633 |
+
not survive such relicensing or conveying.
|
| 634 |
+
|
| 635 |
+
If you add terms to a covered work in accord with this section, you
|
| 636 |
+
must place, in the relevant source files, a statement of the
|
| 637 |
+
additional terms that apply to those files, or a notice indicating
|
| 638 |
+
where to find the applicable terms.
|
| 639 |
+
|
| 640 |
+
Additional terms, permissive or non-permissive, may be stated in the
|
| 641 |
+
form of a separately written license, or stated as exceptions;
|
| 642 |
+
the above requirements apply either way.
|
| 643 |
+
|
| 644 |
+
8. Termination.
|
| 645 |
+
|
| 646 |
+
You may not propagate or modify a covered work except as expressly
|
| 647 |
+
provided under this License. Any attempt otherwise to propagate or
|
| 648 |
+
modify it is void, and will automatically terminate your rights under
|
| 649 |
+
this License (including any patent licenses granted under the third
|
| 650 |
+
paragraph of section 11).
|
| 651 |
+
|
| 652 |
+
However, if you cease all violation of this License, then your
|
| 653 |
+
license from a particular copyright holder is reinstated (a)
|
| 654 |
+
provisionally, unless and until the copyright holder explicitly and
|
| 655 |
+
finally terminates your license, and (b) permanently, if the copyright
|
| 656 |
+
holder fails to notify you of the violation by some reasonable means
|
| 657 |
+
prior to 60 days after the cessation.
|
| 658 |
+
|
| 659 |
+
Moreover, your license from a particular copyright holder is
|
| 660 |
+
reinstated permanently if the copyright holder notifies you of the
|
| 661 |
+
violation by some reasonable means, this is the first time you have
|
| 662 |
+
received notice of violation of this License (for any work) from that
|
| 663 |
+
copyright holder, and you cure the violation prior to 30 days after
|
| 664 |
+
your receipt of the notice.
|
| 665 |
+
|
| 666 |
+
Termination of your rights under this section does not terminate the
|
| 667 |
+
licenses of parties who have received copies or rights from you under
|
| 668 |
+
this License. If your rights have been terminated and not permanently
|
| 669 |
+
reinstated, you do not qualify to receive new licenses for the same
|
| 670 |
+
material under section 10.
|
| 671 |
+
|
| 672 |
+
9. Acceptance Not Required for Having Copies.
|
| 673 |
+
|
| 674 |
+
You are not required to accept this License in order to receive or
|
| 675 |
+
run a copy of the Program. Ancillary propagation of a covered work
|
| 676 |
+
occurring solely as a consequence of using peer-to-peer transmission
|
| 677 |
+
to receive a copy likewise does not require acceptance. However,
|
| 678 |
+
nothing other than this License grants you permission to propagate or
|
| 679 |
+
modify any covered work. These actions infringe copyright if you do
|
| 680 |
+
not accept this License. Therefore, by modifying or propagating a
|
| 681 |
+
covered work, you indicate your acceptance of this License to do so.
|
| 682 |
+
|
| 683 |
+
10. Automatic Licensing of Downstream Recipients.
|
| 684 |
+
|
| 685 |
+
Each time you convey a covered work, the recipient automatically
|
| 686 |
+
receives a license from the original licensors, to run, modify and
|
| 687 |
+
propagate that work, subject to this License. You are not responsible
|
| 688 |
+
for enforcing compliance by third parties with this License.
|
| 689 |
+
|
| 690 |
+
An "entity transaction" is a transaction transferring control of an
|
| 691 |
+
organization, or substantially all assets of one, or subdividing an
|
| 692 |
+
organization, or merging organizations. If propagation of a covered
|
| 693 |
+
work results from an entity transaction, each party to that
|
| 694 |
+
transaction who receives a copy of the work also receives whatever
|
| 695 |
+
licenses to the work the party's predecessor in interest had or could
|
| 696 |
+
give under the previous paragraph, plus a right to possession of the
|
| 697 |
+
Corresponding Source of the work from the predecessor in interest, if
|
| 698 |
+
the predecessor has it or can get it with reasonable efforts.
|
| 699 |
+
|
| 700 |
+
You may not impose any further restrictions on the exercise of the
|
| 701 |
+
rights granted or affirmed under this License. For example, you may
|
| 702 |
+
not impose a license fee, royalty, or other charge for exercise of
|
| 703 |
+
rights granted under this License, and you may not initiate litigation
|
| 704 |
+
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
| 705 |
+
any patent claim is infringed by making, using, selling, offering for
|
| 706 |
+
sale, or importing the Program or any portion of it.
|
| 707 |
+
|
| 708 |
+
11. Patents.
|
| 709 |
+
|
| 710 |
+
A "contributor" is a copyright holder who authorizes use under this
|
| 711 |
+
License of the Program or a work on which the Program is based. The
|
| 712 |
+
work thus licensed is called the contributor's "contributor version".
|
| 713 |
+
|
| 714 |
+
A contributor's "essential patent claims" are all patent claims
|
| 715 |
+
owned or controlled by the contributor, whether already acquired or
|
| 716 |
+
hereafter acquired, that would be infringed by some manner, permitted
|
| 717 |
+
by this License, of making, using, or selling its contributor version,
|
| 718 |
+
but do not include claims that would be infringed only as a
|
| 719 |
+
consequence of further modification of the contributor version. For
|
| 720 |
+
purposes of this definition, "control" includes the right to grant
|
| 721 |
+
patent sublicenses in a manner consistent with the requirements of
|
| 722 |
+
this License.
|
| 723 |
+
|
| 724 |
+
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
| 725 |
+
patent license under the contributor's essential patent claims, to
|
| 726 |
+
make, use, sell, offer for sale, import and otherwise run, modify and
|
| 727 |
+
propagate the contents of its contributor version.
|
| 728 |
+
|
| 729 |
+
In the following three paragraphs, a "patent license" is any express
|
| 730 |
+
agreement or commitment, however denominated, not to enforce a patent
|
| 731 |
+
(such as an express permission to practice a patent or covenant not to
|
| 732 |
+
sue for patent infringement). To "grant" such a patent license to a
|
| 733 |
+
party means to make such an agreement or commitment not to enforce a
|
| 734 |
+
patent against the party.
|
| 735 |
+
|
| 736 |
+
If you convey a covered work, knowingly relying on a patent license,
|
| 737 |
+
and the Corresponding Source of the work is not available for anyone
|
| 738 |
+
to copy, free of charge and under the terms of this License, through a
|
| 739 |
+
publicly available network server or other readily accessible means,
|
| 740 |
+
then you must either (1) cause the Corresponding Source to be so
|
| 741 |
+
available, or (2) arrange to deprive yourself of the benefit of the
|
| 742 |
+
patent license for this particular work, or (3) arrange, in a manner
|
| 743 |
+
consistent with the requirements of this License, to extend the patent
|
| 744 |
+
license to downstream recipients. "Knowingly relying" means you have
|
| 745 |
+
actual knowledge that, but for the patent license, your conveying the
|
| 746 |
+
covered work in a country, or your recipient's use of the covered work
|
| 747 |
+
in a country, would infringe one or more identifiable patents in that
|
| 748 |
+
country that you have reason to believe are valid.
|
| 749 |
+
|
| 750 |
+
If, pursuant to or in connection with a single transaction or
|
| 751 |
+
arrangement, you convey, or propagate by procuring conveyance of, a
|
| 752 |
+
covered work, and grant a patent license to some of the parties
|
| 753 |
+
receiving the covered work authorizing them to use, propagate, modify
|
| 754 |
+
or convey a specific copy of the covered work, then the patent license
|
| 755 |
+
you grant is automatically extended to all recipients of the covered
|
| 756 |
+
work and works based on it.
|
| 757 |
+
|
| 758 |
+
A patent license is "discriminatory" if it does not include within
|
| 759 |
+
the scope of its coverage, prohibits the exercise of, or is
|
| 760 |
+
conditioned on the non-exercise of one or more of the rights that are
|
| 761 |
+
specifically granted under this License. You may not convey a covered
|
| 762 |
+
work if you are a party to an arrangement with a third party that is
|
| 763 |
+
in the business of distributing software, under which you make payment
|
| 764 |
+
to the third party based on the extent of your activity of conveying
|
| 765 |
+
the work, and under which the third party grants, to any of the
|
| 766 |
+
parties who would receive the covered work from you, a discriminatory
|
| 767 |
+
patent license (a) in connection with copies of the covered work
|
| 768 |
+
conveyed by you (or copies made from those copies), or (b) primarily
|
| 769 |
+
for and in connection with specific products or compilations that
|
| 770 |
+
contain the covered work, unless you entered into that arrangement,
|
| 771 |
+
or that patent license was granted, prior to 28 March 2007.
|
| 772 |
+
|
| 773 |
+
Nothing in this License shall be construed as excluding or limiting
|
| 774 |
+
any implied license or other defenses to infringement that may
|
| 775 |
+
otherwise be available to you under applicable patent law.
|
| 776 |
+
|
| 777 |
+
12. No Surrender of Others' Freedom.
|
| 778 |
+
|
| 779 |
+
If conditions are imposed on you (whether by court order, agreement or
|
| 780 |
+
otherwise) that contradict the conditions of this License, they do not
|
| 781 |
+
excuse you from the conditions of this License. If you cannot convey a
|
| 782 |
+
covered work so as to satisfy simultaneously your obligations under this
|
| 783 |
+
License and any other pertinent obligations, then as a consequence you may
|
| 784 |
+
not convey it at all. For example, if you agree to terms that obligate you
|
| 785 |
+
to collect a royalty for further conveying from those to whom you convey
|
| 786 |
+
the Program, the only way you could satisfy both those terms and this
|
| 787 |
+
License would be to refrain entirely from conveying the Program.
|
| 788 |
+
|
| 789 |
+
13. Use with the GNU Affero General Public License.
|
| 790 |
+
|
| 791 |
+
Notwithstanding any other provision of this License, you have
|
| 792 |
+
permission to link or combine any covered work with a work licensed
|
| 793 |
+
under version 3 of the GNU Affero General Public License into a single
|
| 794 |
+
combined work, and to convey the resulting work. The terms of this
|
| 795 |
+
License will continue to apply to the part which is the covered work,
|
| 796 |
+
but the special requirements of the GNU Affero General Public License,
|
| 797 |
+
section 13, concerning interaction through a network will apply to the
|
| 798 |
+
combination as such.
|
| 799 |
+
|
| 800 |
+
14. Revised Versions of this License.
|
| 801 |
+
|
| 802 |
+
The Free Software Foundation may publish revised and/or new versions of
|
| 803 |
+
the GNU General Public License from time to time. Such new versions will
|
| 804 |
+
be similar in spirit to the present version, but may differ in detail to
|
| 805 |
+
address new problems or concerns.
|
| 806 |
+
|
| 807 |
+
Each version is given a distinguishing version number. If the
|
| 808 |
+
Program specifies that a certain numbered version of the GNU General
|
| 809 |
+
Public License "or any later version" applies to it, you have the
|
| 810 |
+
option of following the terms and conditions either of that numbered
|
| 811 |
+
version or of any later version published by the Free Software
|
| 812 |
+
Foundation. If the Program does not specify a version number of the
|
| 813 |
+
GNU General Public License, you may choose any version ever published
|
| 814 |
+
by the Free Software Foundation.
|
| 815 |
+
|
| 816 |
+
If the Program specifies that a proxy can decide which future
|
| 817 |
+
versions of the GNU General Public License can be used, that proxy's
|
| 818 |
+
public statement of acceptance of a version permanently authorizes you
|
| 819 |
+
to choose that version for the Program.
|
| 820 |
+
|
| 821 |
+
Later license versions may give you additional or different
|
| 822 |
+
permissions. However, no additional obligations are imposed on any
|
| 823 |
+
author or copyright holder as a result of your choosing to follow a
|
| 824 |
+
later version.
|
| 825 |
+
|
| 826 |
+
15. Disclaimer of Warranty.
|
| 827 |
+
|
| 828 |
+
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
| 829 |
+
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
| 830 |
+
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
| 831 |
+
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
| 832 |
+
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
| 833 |
+
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
| 834 |
+
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
| 835 |
+
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
| 836 |
+
|
| 837 |
+
16. Limitation of Liability.
|
| 838 |
+
|
| 839 |
+
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
| 840 |
+
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
| 841 |
+
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
| 842 |
+
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
| 843 |
+
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
| 844 |
+
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
| 845 |
+
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
| 846 |
+
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
| 847 |
+
SUCH DAMAGES.
|
| 848 |
+
|
| 849 |
+
17. Interpretation of Sections 15 and 16.
|
| 850 |
+
|
| 851 |
+
If the disclaimer of warranty and limitation of liability provided
|
| 852 |
+
above cannot be given local legal effect according to their terms,
|
| 853 |
+
reviewing courts shall apply local law that most closely approximates
|
| 854 |
+
an absolute waiver of all civil liability in connection with the
|
| 855 |
+
Program, unless a warranty or assumption of liability accompanies a
|
| 856 |
+
copy of the Program in return for a fee.
|
| 857 |
+
|
| 858 |
+
END OF TERMS AND CONDITIONS
|
| 859 |
+
|
| 860 |
+
How to Apply These Terms to Your New Programs
|
| 861 |
+
|
| 862 |
+
If you develop a new program, and you want it to be of the greatest
|
| 863 |
+
possible use to the public, the best way to achieve this is to make it
|
| 864 |
+
free software which everyone can redistribute and change under these terms.
|
| 865 |
+
|
| 866 |
+
To do so, attach the following notices to the program. It is safest
|
| 867 |
+
to attach them to the start of each source file to most effectively
|
| 868 |
+
state the exclusion of warranty; and each file should have at least
|
| 869 |
+
the "copyright" line and a pointer to where the full notice is found.
|
| 870 |
+
|
| 871 |
+
<one line to give the program's name and a brief idea of what it does.>
|
| 872 |
+
Copyright (C) <year> <name of author>
|
| 873 |
+
|
| 874 |
+
This program is free software: you can redistribute it and/or modify
|
| 875 |
+
it under the terms of the GNU General Public License as published by
|
| 876 |
+
the Free Software Foundation, either version 3 of the License, or
|
| 877 |
+
(at your option) any later version.
|
| 878 |
+
|
| 879 |
+
This program is distributed in the hope that it will be useful,
|
| 880 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 881 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 882 |
+
GNU General Public License for more details.
|
| 883 |
+
|
| 884 |
+
You should have received a copy of the GNU General Public License
|
| 885 |
+
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
| 886 |
+
|
| 887 |
+
Also add information on how to contact you by electronic and paper mail.
|
| 888 |
+
|
| 889 |
+
If the program does terminal interaction, make it output a short
|
| 890 |
+
notice like this when it starts in an interactive mode:
|
| 891 |
+
|
| 892 |
+
<program> Copyright (C) <year> <name of author>
|
| 893 |
+
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
| 894 |
+
This is free software, and you are welcome to redistribute it
|
| 895 |
+
under certain conditions; type `show c' for details.
|
| 896 |
+
|
| 897 |
+
The hypothetical commands `show w' and `show c' should show the appropriate
|
| 898 |
+
parts of the General Public License. Of course, your program's commands
|
| 899 |
+
might be different; for a GUI interface, you would use an "about box".
|
| 900 |
+
|
| 901 |
+
You should also get your employer (if you work as a programmer) or school,
|
| 902 |
+
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
| 903 |
+
For more information on this, and how to apply and follow the GNU GPL, see
|
| 904 |
+
<http://www.gnu.org/licenses/>.
|
| 905 |
+
|
| 906 |
+
The GNU General Public License does not permit incorporating your program
|
| 907 |
+
into proprietary programs. If your program is a subroutine library, you
|
| 908 |
+
may consider it more useful to permit linking proprietary applications with
|
| 909 |
+
the library. If this is what you want to do, use the GNU Lesser General
|
| 910 |
+
Public License instead of this License. But first, please read
|
| 911 |
+
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
| 912 |
+
|
| 913 |
+
|
| 914 |
+
Name: libquadmath
|
| 915 |
+
Files: scipy.libs/libquadmath*.so
|
| 916 |
+
Description: dynamically linked to files compiled with gcc
|
| 917 |
+
Availability: https://gcc.gnu.org/git/?p=gcc.git;a=tree;f=libquadmath
|
| 918 |
+
License: LGPL-2.1-or-later
|
| 919 |
+
|
| 920 |
+
GCC Quad-Precision Math Library
|
| 921 |
+
Copyright (C) 2010-2019 Free Software Foundation, Inc.
|
| 922 |
+
Written by Francois-Xavier Coudert <fxcoudert@gcc.gnu.org>
|
| 923 |
+
|
| 924 |
+
This file is part of the libquadmath library.
|
| 925 |
+
Libquadmath is free software; you can redistribute it and/or
|
| 926 |
+
modify it under the terms of the GNU Library General Public
|
| 927 |
+
License as published by the Free Software Foundation; either
|
| 928 |
+
version 2.1 of the License, or (at your option) any later version.
|
| 929 |
+
|
| 930 |
+
Libquadmath is distributed in the hope that it will be useful,
|
| 931 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 932 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
| 933 |
+
Lesser General Public License for more details.
|
| 934 |
+
https://www.gnu.org/licenses/old-licenses/lgpl-2.1.html
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy-1.17.1.dist-info/METADATA
ADDED
|
@@ -0,0 +1,1086 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Metadata-Version: 2.1
|
| 2 |
+
Name: scipy
|
| 3 |
+
Version: 1.17.1
|
| 4 |
+
Summary: Fundamental algorithms for scientific computing in Python
|
| 5 |
+
Maintainer-Email: SciPy Developers <scipy-dev@python.org>
|
| 6 |
+
License: Copyright (c) 2001-2002 Enthought, Inc. 2003, SciPy Developers.
|
| 7 |
+
All rights reserved.
|
| 8 |
+
|
| 9 |
+
Redistribution and use in source and binary forms, with or without
|
| 10 |
+
modification, are permitted provided that the following conditions
|
| 11 |
+
are met:
|
| 12 |
+
|
| 13 |
+
1. Redistributions of source code must retain the above copyright
|
| 14 |
+
notice, this list of conditions and the following disclaimer.
|
| 15 |
+
|
| 16 |
+
2. Redistributions in binary form must reproduce the above
|
| 17 |
+
copyright notice, this list of conditions and the following
|
| 18 |
+
disclaimer in the documentation and/or other materials provided
|
| 19 |
+
with the distribution.
|
| 20 |
+
|
| 21 |
+
3. Neither the name of the copyright holder nor the names of its
|
| 22 |
+
contributors may be used to endorse or promote products derived
|
| 23 |
+
from this software without specific prior written permission.
|
| 24 |
+
|
| 25 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 26 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 27 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 28 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 29 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 30 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 31 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 32 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 33 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 34 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 35 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 36 |
+
|
| 37 |
+
----
|
| 38 |
+
|
| 39 |
+
This binary distribution of SciPy can also bundle the following software
|
| 40 |
+
(depending on the build):
|
| 41 |
+
|
| 42 |
+
|
| 43 |
+
Name: OpenBLAS
|
| 44 |
+
Files: scipy.libs/libscipy_openblas*.so
|
| 45 |
+
Description: bundled as a dynamically linked library
|
| 46 |
+
Availability: https://github.com/OpenMathLib/OpenBLAS/
|
| 47 |
+
License: BSD-3-Clause
|
| 48 |
+
Copyright (c) 2011-2014, The OpenBLAS Project
|
| 49 |
+
All rights reserved.
|
| 50 |
+
|
| 51 |
+
Redistribution and use in source and binary forms, with or without
|
| 52 |
+
modification, are permitted provided that the following conditions are
|
| 53 |
+
met:
|
| 54 |
+
|
| 55 |
+
1. Redistributions of source code must retain the above copyright
|
| 56 |
+
notice, this list of conditions and the following disclaimer.
|
| 57 |
+
|
| 58 |
+
2. Redistributions in binary form must reproduce the above copyright
|
| 59 |
+
notice, this list of conditions and the following disclaimer in
|
| 60 |
+
the documentation and/or other materials provided with the
|
| 61 |
+
distribution.
|
| 62 |
+
3. Neither the name of the OpenBLAS project nor the names of
|
| 63 |
+
its contributors may be used to endorse or promote products
|
| 64 |
+
derived from this software without specific prior written
|
| 65 |
+
permission.
|
| 66 |
+
|
| 67 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 68 |
+
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 69 |
+
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 70 |
+
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
| 71 |
+
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
| 72 |
+
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
| 73 |
+
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
| 74 |
+
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
| 75 |
+
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
|
| 76 |
+
USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 77 |
+
|
| 78 |
+
|
| 79 |
+
Name: LAPACK
|
| 80 |
+
Files: scipy.libs/libscipy_openblas*.so
|
| 81 |
+
Description: bundled in OpenBLAS
|
| 82 |
+
Availability: https://github.com/OpenMathLib/OpenBLAS/
|
| 83 |
+
License: BSD-3-Clause-Open-MPI
|
| 84 |
+
Copyright (c) 1992-2013 The University of Tennessee and The University
|
| 85 |
+
of Tennessee Research Foundation. All rights
|
| 86 |
+
reserved.
|
| 87 |
+
Copyright (c) 2000-2013 The University of California Berkeley. All
|
| 88 |
+
rights reserved.
|
| 89 |
+
Copyright (c) 2006-2013 The University of Colorado Denver. All rights
|
| 90 |
+
reserved.
|
| 91 |
+
|
| 92 |
+
$COPYRIGHT$
|
| 93 |
+
|
| 94 |
+
Additional copyrights may follow
|
| 95 |
+
|
| 96 |
+
$HEADER$
|
| 97 |
+
|
| 98 |
+
Redistribution and use in source and binary forms, with or without
|
| 99 |
+
modification, are permitted provided that the following conditions are
|
| 100 |
+
met:
|
| 101 |
+
|
| 102 |
+
- Redistributions of source code must retain the above copyright
|
| 103 |
+
notice, this list of conditions and the following disclaimer.
|
| 104 |
+
|
| 105 |
+
- Redistributions in binary form must reproduce the above copyright
|
| 106 |
+
notice, this list of conditions and the following disclaimer listed
|
| 107 |
+
in this license in the documentation and/or other materials
|
| 108 |
+
provided with the distribution.
|
| 109 |
+
|
| 110 |
+
- Neither the name of the copyright holders nor the names of its
|
| 111 |
+
contributors may be used to endorse or promote products derived from
|
| 112 |
+
this software without specific prior written permission.
|
| 113 |
+
|
| 114 |
+
The copyright holders provide no reassurances that the source code
|
| 115 |
+
provided does not infringe any patent, copyright, or any other
|
| 116 |
+
intellectual property rights of third parties. The copyright holders
|
| 117 |
+
disclaim any liability to any recipient for claims brought against
|
| 118 |
+
recipient by any third party for infringement of that parties
|
| 119 |
+
intellectual property rights.
|
| 120 |
+
|
| 121 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 122 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 123 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 124 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 125 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 126 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 127 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 128 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 129 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 130 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 131 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 132 |
+
|
| 133 |
+
|
| 134 |
+
Name: GCC runtime library
|
| 135 |
+
Files: scipy.libs/libgfortran*.so
|
| 136 |
+
Description: dynamically linked to files compiled with gcc
|
| 137 |
+
Availability: https://gcc.gnu.org/git/?p=gcc.git;a=tree;f=libgfortran
|
| 138 |
+
License: GPL-3.0-or-later WITH GCC-exception-3.1
|
| 139 |
+
Copyright (C) 2002-2017 Free Software Foundation, Inc.
|
| 140 |
+
|
| 141 |
+
Libgfortran is free software; you can redistribute it and/or modify
|
| 142 |
+
it under the terms of the GNU General Public License as published by
|
| 143 |
+
the Free Software Foundation; either version 3, or (at your option)
|
| 144 |
+
any later version.
|
| 145 |
+
|
| 146 |
+
Libgfortran is distributed in the hope that it will be useful,
|
| 147 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 148 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 149 |
+
GNU General Public License for more details.
|
| 150 |
+
|
| 151 |
+
Under Section 7 of GPL version 3, you are granted additional
|
| 152 |
+
permissions described in the GCC Runtime Library Exception, version
|
| 153 |
+
3.1, as published by the Free Software Foundation.
|
| 154 |
+
|
| 155 |
+
You should have received a copy of the GNU General Public License and
|
| 156 |
+
a copy of the GCC Runtime Library Exception along with this program;
|
| 157 |
+
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
| 158 |
+
<http://www.gnu.org/licenses/>.
|
| 159 |
+
|
| 160 |
+
----
|
| 161 |
+
|
| 162 |
+
Full text of license texts referred to above follows (that they are
|
| 163 |
+
listed below does not necessarily imply the conditions apply to the
|
| 164 |
+
present binary release):
|
| 165 |
+
|
| 166 |
+
----
|
| 167 |
+
|
| 168 |
+
GCC RUNTIME LIBRARY EXCEPTION
|
| 169 |
+
|
| 170 |
+
Version 3.1, 31 March 2009
|
| 171 |
+
|
| 172 |
+
Copyright (C) 2009 Free Software Foundation, Inc. <http://fsf.org/>
|
| 173 |
+
|
| 174 |
+
Everyone is permitted to copy and distribute verbatim copies of this
|
| 175 |
+
license document, but changing it is not allowed.
|
| 176 |
+
|
| 177 |
+
This GCC Runtime Library Exception ("Exception") is an additional
|
| 178 |
+
permission under section 7 of the GNU General Public License, version
|
| 179 |
+
3 ("GPLv3"). It applies to a given file (the "Runtime Library") that
|
| 180 |
+
bears a notice placed by the copyright holder of the file stating that
|
| 181 |
+
the file is governed by GPLv3 along with this Exception.
|
| 182 |
+
|
| 183 |
+
When you use GCC to compile a program, GCC may combine portions of
|
| 184 |
+
certain GCC header files and runtime libraries with the compiled
|
| 185 |
+
program. The purpose of this Exception is to allow compilation of
|
| 186 |
+
non-GPL (including proprietary) programs to use, in this way, the
|
| 187 |
+
header files and runtime libraries covered by this Exception.
|
| 188 |
+
|
| 189 |
+
0. Definitions.
|
| 190 |
+
|
| 191 |
+
A file is an "Independent Module" if it either requires the Runtime
|
| 192 |
+
Library for execution after a Compilation Process, or makes use of an
|
| 193 |
+
interface provided by the Runtime Library, but is not otherwise based
|
| 194 |
+
on the Runtime Library.
|
| 195 |
+
|
| 196 |
+
"GCC" means a version of the GNU Compiler Collection, with or without
|
| 197 |
+
modifications, governed by version 3 (or a specified later version) of
|
| 198 |
+
the GNU General Public License (GPL) with the option of using any
|
| 199 |
+
subsequent versions published by the FSF.
|
| 200 |
+
|
| 201 |
+
"GPL-compatible Software" is software whose conditions of propagation,
|
| 202 |
+
modification and use would permit combination with GCC in accord with
|
| 203 |
+
the license of GCC.
|
| 204 |
+
|
| 205 |
+
"Target Code" refers to output from any compiler for a real or virtual
|
| 206 |
+
target processor architecture, in executable form or suitable for
|
| 207 |
+
input to an assembler, loader, linker and/or execution
|
| 208 |
+
phase. Notwithstanding that, Target Code does not include data in any
|
| 209 |
+
format that is used as a compiler intermediate representation, or used
|
| 210 |
+
for producing a compiler intermediate representation.
|
| 211 |
+
|
| 212 |
+
The "Compilation Process" transforms code entirely represented in
|
| 213 |
+
non-intermediate languages designed for human-written code, and/or in
|
| 214 |
+
Java Virtual Machine byte code, into Target Code. Thus, for example,
|
| 215 |
+
use of source code generators and preprocessors need not be considered
|
| 216 |
+
part of the Compilation Process, since the Compilation Process can be
|
| 217 |
+
understood as starting with the output of the generators or
|
| 218 |
+
preprocessors.
|
| 219 |
+
|
| 220 |
+
A Compilation Process is "Eligible" if it is done using GCC, alone or
|
| 221 |
+
with other GPL-compatible software, or if it is done without using any
|
| 222 |
+
work based on GCC. For example, using non-GPL-compatible Software to
|
| 223 |
+
optimize any GCC intermediate representations would not qualify as an
|
| 224 |
+
Eligible Compilation Process.
|
| 225 |
+
|
| 226 |
+
1. Grant of Additional Permission.
|
| 227 |
+
|
| 228 |
+
You have permission to propagate a work of Target Code formed by
|
| 229 |
+
combining the Runtime Library with Independent Modules, even if such
|
| 230 |
+
propagation would otherwise violate the terms of GPLv3, provided that
|
| 231 |
+
all Target Code was generated by Eligible Compilation Processes. You
|
| 232 |
+
may then convey such a combination under terms of your choice,
|
| 233 |
+
consistent with the licensing of the Independent Modules.
|
| 234 |
+
|
| 235 |
+
2. No Weakening of GCC Copyleft.
|
| 236 |
+
|
| 237 |
+
The availability of this Exception does not imply any general
|
| 238 |
+
presumption that third-party software is unaffected by the copyleft
|
| 239 |
+
requirements of the license of GCC.
|
| 240 |
+
|
| 241 |
+
----
|
| 242 |
+
|
| 243 |
+
GNU GENERAL PUBLIC LICENSE
|
| 244 |
+
Version 3, 29 June 2007
|
| 245 |
+
|
| 246 |
+
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
| 247 |
+
Everyone is permitted to copy and distribute verbatim copies
|
| 248 |
+
of this license document, but changing it is not allowed.
|
| 249 |
+
|
| 250 |
+
Preamble
|
| 251 |
+
|
| 252 |
+
The GNU General Public License is a free, copyleft license for
|
| 253 |
+
software and other kinds of works.
|
| 254 |
+
|
| 255 |
+
The licenses for most software and other practical works are designed
|
| 256 |
+
to take away your freedom to share and change the works. By contrast,
|
| 257 |
+
the GNU General Public License is intended to guarantee your freedom to
|
| 258 |
+
share and change all versions of a program--to make sure it remains free
|
| 259 |
+
software for all its users. We, the Free Software Foundation, use the
|
| 260 |
+
GNU General Public License for most of our software; it applies also to
|
| 261 |
+
any other work released this way by its authors. You can apply it to
|
| 262 |
+
your programs, too.
|
| 263 |
+
|
| 264 |
+
When we speak of free software, we are referring to freedom, not
|
| 265 |
+
price. Our General Public Licenses are designed to make sure that you
|
| 266 |
+
have the freedom to distribute copies of free software (and charge for
|
| 267 |
+
them if you wish), that you receive source code or can get it if you
|
| 268 |
+
want it, that you can change the software or use pieces of it in new
|
| 269 |
+
free programs, and that you know you can do these things.
|
| 270 |
+
|
| 271 |
+
To protect your rights, we need to prevent others from denying you
|
| 272 |
+
these rights or asking you to surrender the rights. Therefore, you have
|
| 273 |
+
certain responsibilities if you distribute copies of the software, or if
|
| 274 |
+
you modify it: responsibilities to respect the freedom of others.
|
| 275 |
+
|
| 276 |
+
For example, if you distribute copies of such a program, whether
|
| 277 |
+
gratis or for a fee, you must pass on to the recipients the same
|
| 278 |
+
freedoms that you received. You must make sure that they, too, receive
|
| 279 |
+
or can get the source code. And you must show them these terms so they
|
| 280 |
+
know their rights.
|
| 281 |
+
|
| 282 |
+
Developers that use the GNU GPL protect your rights with two steps:
|
| 283 |
+
(1) assert copyright on the software, and (2) offer you this License
|
| 284 |
+
giving you legal permission to copy, distribute and/or modify it.
|
| 285 |
+
|
| 286 |
+
For the developers' and authors' protection, the GPL clearly explains
|
| 287 |
+
that there is no warranty for this free software. For both users' and
|
| 288 |
+
authors' sake, the GPL requires that modified versions be marked as
|
| 289 |
+
changed, so that their problems will not be attributed erroneously to
|
| 290 |
+
authors of previous versions.
|
| 291 |
+
|
| 292 |
+
Some devices are designed to deny users access to install or run
|
| 293 |
+
modified versions of the software inside them, although the manufacturer
|
| 294 |
+
can do so. This is fundamentally incompatible with the aim of
|
| 295 |
+
protecting users' freedom to change the software. The systematic
|
| 296 |
+
pattern of such abuse occurs in the area of products for individuals to
|
| 297 |
+
use, which is precisely where it is most unacceptable. Therefore, we
|
| 298 |
+
have designed this version of the GPL to prohibit the practice for those
|
| 299 |
+
products. If such problems arise substantially in other domains, we
|
| 300 |
+
stand ready to extend this provision to those domains in future versions
|
| 301 |
+
of the GPL, as needed to protect the freedom of users.
|
| 302 |
+
|
| 303 |
+
Finally, every program is threatened constantly by software patents.
|
| 304 |
+
States should not allow patents to restrict development and use of
|
| 305 |
+
software on general-purpose computers, but in those that do, we wish to
|
| 306 |
+
avoid the special danger that patents applied to a free program could
|
| 307 |
+
make it effectively proprietary. To prevent this, the GPL assures that
|
| 308 |
+
patents cannot be used to render the program non-free.
|
| 309 |
+
|
| 310 |
+
The precise terms and conditions for copying, distribution and
|
| 311 |
+
modification follow.
|
| 312 |
+
|
| 313 |
+
TERMS AND CONDITIONS
|
| 314 |
+
|
| 315 |
+
0. Definitions.
|
| 316 |
+
|
| 317 |
+
"This License" refers to version 3 of the GNU General Public License.
|
| 318 |
+
|
| 319 |
+
"Copyright" also means copyright-like laws that apply to other kinds of
|
| 320 |
+
works, such as semiconductor masks.
|
| 321 |
+
|
| 322 |
+
"The Program" refers to any copyrightable work licensed under this
|
| 323 |
+
License. Each licensee is addressed as "you". "Licensees" and
|
| 324 |
+
"recipients" may be individuals or organizations.
|
| 325 |
+
|
| 326 |
+
To "modify" a work means to copy from or adapt all or part of the work
|
| 327 |
+
in a fashion requiring copyright permission, other than the making of an
|
| 328 |
+
exact copy. The resulting work is called a "modified version" of the
|
| 329 |
+
earlier work or a work "based on" the earlier work.
|
| 330 |
+
|
| 331 |
+
A "covered work" means either the unmodified Program or a work based
|
| 332 |
+
on the Program.
|
| 333 |
+
|
| 334 |
+
To "propagate" a work means to do anything with it that, without
|
| 335 |
+
permission, would make you directly or secondarily liable for
|
| 336 |
+
infringement under applicable copyright law, except executing it on a
|
| 337 |
+
computer or modifying a private copy. Propagation includes copying,
|
| 338 |
+
distribution (with or without modification), making available to the
|
| 339 |
+
public, and in some countries other activities as well.
|
| 340 |
+
|
| 341 |
+
To "convey" a work means any kind of propagation that enables other
|
| 342 |
+
parties to make or receive copies. Mere interaction with a user through
|
| 343 |
+
a computer network, with no transfer of a copy, is not conveying.
|
| 344 |
+
|
| 345 |
+
An interactive user interface displays "Appropriate Legal Notices"
|
| 346 |
+
to the extent that it includes a convenient and prominently visible
|
| 347 |
+
feature that (1) displays an appropriate copyright notice, and (2)
|
| 348 |
+
tells the user that there is no warranty for the work (except to the
|
| 349 |
+
extent that warranties are provided), that licensees may convey the
|
| 350 |
+
work under this License, and how to view a copy of this License. If
|
| 351 |
+
the interface presents a list of user commands or options, such as a
|
| 352 |
+
menu, a prominent item in the list meets this criterion.
|
| 353 |
+
|
| 354 |
+
1. Source Code.
|
| 355 |
+
|
| 356 |
+
The "source code" for a work means the preferred form of the work
|
| 357 |
+
for making modifications to it. "Object code" means any non-source
|
| 358 |
+
form of a work.
|
| 359 |
+
|
| 360 |
+
A "Standard Interface" means an interface that either is an official
|
| 361 |
+
standard defined by a recognized standards body, or, in the case of
|
| 362 |
+
interfaces specified for a particular programming language, one that
|
| 363 |
+
is widely used among developers working in that language.
|
| 364 |
+
|
| 365 |
+
The "System Libraries" of an executable work include anything, other
|
| 366 |
+
than the work as a whole, that (a) is included in the normal form of
|
| 367 |
+
packaging a Major Component, but which is not part of that Major
|
| 368 |
+
Component, and (b) serves only to enable use of the work with that
|
| 369 |
+
Major Component, or to implement a Standard Interface for which an
|
| 370 |
+
implementation is available to the public in source code form. A
|
| 371 |
+
"Major Component", in this context, means a major essential component
|
| 372 |
+
(kernel, window system, and so on) of the specific operating system
|
| 373 |
+
(if any) on which the executable work runs, or a compiler used to
|
| 374 |
+
produce the work, or an object code interpreter used to run it.
|
| 375 |
+
|
| 376 |
+
The "Corresponding Source" for a work in object code form means all
|
| 377 |
+
the source code needed to generate, install, and (for an executable
|
| 378 |
+
work) run the object code and to modify the work, including scripts to
|
| 379 |
+
control those activities. However, it does not include the work's
|
| 380 |
+
System Libraries, or general-purpose tools or generally available free
|
| 381 |
+
programs which are used unmodified in performing those activities but
|
| 382 |
+
which are not part of the work. For example, Corresponding Source
|
| 383 |
+
includes interface definition files associated with source files for
|
| 384 |
+
the work, and the source code for shared libraries and dynamically
|
| 385 |
+
linked subprograms that the work is specifically designed to require,
|
| 386 |
+
such as by intimate data communication or control flow between those
|
| 387 |
+
subprograms and other parts of the work.
|
| 388 |
+
|
| 389 |
+
The Corresponding Source need not include anything that users
|
| 390 |
+
can regenerate automatically from other parts of the Corresponding
|
| 391 |
+
Source.
|
| 392 |
+
|
| 393 |
+
The Corresponding Source for a work in source code form is that
|
| 394 |
+
same work.
|
| 395 |
+
|
| 396 |
+
2. Basic Permissions.
|
| 397 |
+
|
| 398 |
+
All rights granted under this License are granted for the term of
|
| 399 |
+
copyright on the Program, and are irrevocable provided the stated
|
| 400 |
+
conditions are met. This License explicitly affirms your unlimited
|
| 401 |
+
permission to run the unmodified Program. The output from running a
|
| 402 |
+
covered work is covered by this License only if the output, given its
|
| 403 |
+
content, constitutes a covered work. This License acknowledges your
|
| 404 |
+
rights of fair use or other equivalent, as provided by copyright law.
|
| 405 |
+
|
| 406 |
+
You may make, run and propagate covered works that you do not
|
| 407 |
+
convey, without conditions so long as your license otherwise remains
|
| 408 |
+
in force. You may convey covered works to others for the sole purpose
|
| 409 |
+
of having them make modifications exclusively for you, or provide you
|
| 410 |
+
with facilities for running those works, provided that you comply with
|
| 411 |
+
the terms of this License in conveying all material for which you do
|
| 412 |
+
not control copyright. Those thus making or running the covered works
|
| 413 |
+
for you must do so exclusively on your behalf, under your direction
|
| 414 |
+
and control, on terms that prohibit them from making any copies of
|
| 415 |
+
your copyrighted material outside their relationship with you.
|
| 416 |
+
|
| 417 |
+
Conveying under any other circumstances is permitted solely under
|
| 418 |
+
the conditions stated below. Sublicensing is not allowed; section 10
|
| 419 |
+
makes it unnecessary.
|
| 420 |
+
|
| 421 |
+
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
| 422 |
+
|
| 423 |
+
No covered work shall be deemed part of an effective technological
|
| 424 |
+
measure under any applicable law fulfilling obligations under article
|
| 425 |
+
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
| 426 |
+
similar laws prohibiting or restricting circumvention of such
|
| 427 |
+
measures.
|
| 428 |
+
|
| 429 |
+
When you convey a covered work, you waive any legal power to forbid
|
| 430 |
+
circumvention of technological measures to the extent such circumvention
|
| 431 |
+
is effected by exercising rights under this License with respect to
|
| 432 |
+
the covered work, and you disclaim any intention to limit operation or
|
| 433 |
+
modification of the work as a means of enforcing, against the work's
|
| 434 |
+
users, your or third parties' legal rights to forbid circumvention of
|
| 435 |
+
technological measures.
|
| 436 |
+
|
| 437 |
+
4. Conveying Verbatim Copies.
|
| 438 |
+
|
| 439 |
+
You may convey verbatim copies of the Program's source code as you
|
| 440 |
+
receive it, in any medium, provided that you conspicuously and
|
| 441 |
+
appropriately publish on each copy an appropriate copyright notice;
|
| 442 |
+
keep intact all notices stating that this License and any
|
| 443 |
+
non-permissive terms added in accord with section 7 apply to the code;
|
| 444 |
+
keep intact all notices of the absence of any warranty; and give all
|
| 445 |
+
recipients a copy of this License along with the Program.
|
| 446 |
+
|
| 447 |
+
You may charge any price or no price for each copy that you convey,
|
| 448 |
+
and you may offer support or warranty protection for a fee.
|
| 449 |
+
|
| 450 |
+
5. Conveying Modified Source Versions.
|
| 451 |
+
|
| 452 |
+
You may convey a work based on the Program, or the modifications to
|
| 453 |
+
produce it from the Program, in the form of source code under the
|
| 454 |
+
terms of section 4, provided that you also meet all of these conditions:
|
| 455 |
+
|
| 456 |
+
a) The work must carry prominent notices stating that you modified
|
| 457 |
+
it, and giving a relevant date.
|
| 458 |
+
|
| 459 |
+
b) The work must carry prominent notices stating that it is
|
| 460 |
+
released under this License and any conditions added under section
|
| 461 |
+
7. This requirement modifies the requirement in section 4 to
|
| 462 |
+
"keep intact all notices".
|
| 463 |
+
|
| 464 |
+
c) You must license the entire work, as a whole, under this
|
| 465 |
+
License to anyone who comes into possession of a copy. This
|
| 466 |
+
License will therefore apply, along with any applicable section 7
|
| 467 |
+
additional terms, to the whole of the work, and all its parts,
|
| 468 |
+
regardless of how they are packaged. This License gives no
|
| 469 |
+
permission to license the work in any other way, but it does not
|
| 470 |
+
invalidate such permission if you have separately received it.
|
| 471 |
+
|
| 472 |
+
d) If the work has interactive user interfaces, each must display
|
| 473 |
+
Appropriate Legal Notices; however, if the Program has interactive
|
| 474 |
+
interfaces that do not display Appropriate Legal Notices, your
|
| 475 |
+
work need not make them do so.
|
| 476 |
+
|
| 477 |
+
A compilation of a covered work with other separate and independent
|
| 478 |
+
works, which are not by their nature extensions of the covered work,
|
| 479 |
+
and which are not combined with it such as to form a larger program,
|
| 480 |
+
in or on a volume of a storage or distribution medium, is called an
|
| 481 |
+
"aggregate" if the compilation and its resulting copyright are not
|
| 482 |
+
used to limit the access or legal rights of the compilation's users
|
| 483 |
+
beyond what the individual works permit. Inclusion of a covered work
|
| 484 |
+
in an aggregate does not cause this License to apply to the other
|
| 485 |
+
parts of the aggregate.
|
| 486 |
+
|
| 487 |
+
6. Conveying Non-Source Forms.
|
| 488 |
+
|
| 489 |
+
You may convey a covered work in object code form under the terms
|
| 490 |
+
of sections 4 and 5, provided that you also convey the
|
| 491 |
+
machine-readable Corresponding Source under the terms of this License,
|
| 492 |
+
in one of these ways:
|
| 493 |
+
|
| 494 |
+
a) Convey the object code in, or embodied in, a physical product
|
| 495 |
+
(including a physical distribution medium), accompanied by the
|
| 496 |
+
Corresponding Source fixed on a durable physical medium
|
| 497 |
+
customarily used for software interchange.
|
| 498 |
+
|
| 499 |
+
b) Convey the object code in, or embodied in, a physical product
|
| 500 |
+
(including a physical distribution medium), accompanied by a
|
| 501 |
+
written offer, valid for at least three years and valid for as
|
| 502 |
+
long as you offer spare parts or customer support for that product
|
| 503 |
+
model, to give anyone who possesses the object code either (1) a
|
| 504 |
+
copy of the Corresponding Source for all the software in the
|
| 505 |
+
product that is covered by this License, on a durable physical
|
| 506 |
+
medium customarily used for software interchange, for a price no
|
| 507 |
+
more than your reasonable cost of physically performing this
|
| 508 |
+
conveying of source, or (2) access to copy the
|
| 509 |
+
Corresponding Source from a network server at no charge.
|
| 510 |
+
|
| 511 |
+
c) Convey individual copies of the object code with a copy of the
|
| 512 |
+
written offer to provide the Corresponding Source. This
|
| 513 |
+
alternative is allowed only occasionally and noncommercially, and
|
| 514 |
+
only if you received the object code with such an offer, in accord
|
| 515 |
+
with subsection 6b.
|
| 516 |
+
|
| 517 |
+
d) Convey the object code by offering access from a designated
|
| 518 |
+
place (gratis or for a charge), and offer equivalent access to the
|
| 519 |
+
Corresponding Source in the same way through the same place at no
|
| 520 |
+
further charge. You need not require recipients to copy the
|
| 521 |
+
Corresponding Source along with the object code. If the place to
|
| 522 |
+
copy the object code is a network server, the Corresponding Source
|
| 523 |
+
may be on a different server (operated by you or a third party)
|
| 524 |
+
that supports equivalent copying facilities, provided you maintain
|
| 525 |
+
clear directions next to the object code saying where to find the
|
| 526 |
+
Corresponding Source. Regardless of what server hosts the
|
| 527 |
+
Corresponding Source, you remain obligated to ensure that it is
|
| 528 |
+
available for as long as needed to satisfy these requirements.
|
| 529 |
+
|
| 530 |
+
e) Convey the object code using peer-to-peer transmission, provided
|
| 531 |
+
you inform other peers where the object code and Corresponding
|
| 532 |
+
Source of the work are being offered to the general public at no
|
| 533 |
+
charge under subsection 6d.
|
| 534 |
+
|
| 535 |
+
A separable portion of the object code, whose source code is excluded
|
| 536 |
+
from the Corresponding Source as a System Library, need not be
|
| 537 |
+
included in conveying the object code work.
|
| 538 |
+
|
| 539 |
+
A "User Product" is either (1) a "consumer product", which means any
|
| 540 |
+
tangible personal property which is normally used for personal, family,
|
| 541 |
+
or household purposes, or (2) anything designed or sold for incorporation
|
| 542 |
+
into a dwelling. In determining whether a product is a consumer product,
|
| 543 |
+
doubtful cases shall be resolved in favor of coverage. For a particular
|
| 544 |
+
product received by a particular user, "normally used" refers to a
|
| 545 |
+
typical or common use of that class of product, regardless of the status
|
| 546 |
+
of the particular user or of the way in which the particular user
|
| 547 |
+
actually uses, or expects or is expected to use, the product. A product
|
| 548 |
+
is a consumer product regardless of whether the product has substantial
|
| 549 |
+
commercial, industrial or non-consumer uses, unless such uses represent
|
| 550 |
+
the only significant mode of use of the product.
|
| 551 |
+
|
| 552 |
+
"Installation Information" for a User Product means any methods,
|
| 553 |
+
procedures, authorization keys, or other information required to install
|
| 554 |
+
and execute modified versions of a covered work in that User Product from
|
| 555 |
+
a modified version of its Corresponding Source. The information must
|
| 556 |
+
suffice to ensure that the continued functioning of the modified object
|
| 557 |
+
code is in no case prevented or interfered with solely because
|
| 558 |
+
modification has been made.
|
| 559 |
+
|
| 560 |
+
If you convey an object code work under this section in, or with, or
|
| 561 |
+
specifically for use in, a User Product, and the conveying occurs as
|
| 562 |
+
part of a transaction in which the right of possession and use of the
|
| 563 |
+
User Product is transferred to the recipient in perpetuity or for a
|
| 564 |
+
fixed term (regardless of how the transaction is characterized), the
|
| 565 |
+
Corresponding Source conveyed under this section must be accompanied
|
| 566 |
+
by the Installation Information. But this requirement does not apply
|
| 567 |
+
if neither you nor any third party retains the ability to install
|
| 568 |
+
modified object code on the User Product (for example, the work has
|
| 569 |
+
been installed in ROM).
|
| 570 |
+
|
| 571 |
+
The requirement to provide Installation Information does not include a
|
| 572 |
+
requirement to continue to provide support service, warranty, or updates
|
| 573 |
+
for a work that has been modified or installed by the recipient, or for
|
| 574 |
+
the User Product in which it has been modified or installed. Access to a
|
| 575 |
+
network may be denied when the modification itself materially and
|
| 576 |
+
adversely affects the operation of the network or violates the rules and
|
| 577 |
+
protocols for communication across the network.
|
| 578 |
+
|
| 579 |
+
Corresponding Source conveyed, and Installation Information provided,
|
| 580 |
+
in accord with this section must be in a format that is publicly
|
| 581 |
+
documented (and with an implementation available to the public in
|
| 582 |
+
source code form), and must require no special password or key for
|
| 583 |
+
unpacking, reading or copying.
|
| 584 |
+
|
| 585 |
+
7. Additional Terms.
|
| 586 |
+
|
| 587 |
+
"Additional permissions" are terms that supplement the terms of this
|
| 588 |
+
License by making exceptions from one or more of its conditions.
|
| 589 |
+
Additional permissions that are applicable to the entire Program shall
|
| 590 |
+
be treated as though they were included in this License, to the extent
|
| 591 |
+
that they are valid under applicable law. If additional permissions
|
| 592 |
+
apply only to part of the Program, that part may be used separately
|
| 593 |
+
under those permissions, but the entire Program remains governed by
|
| 594 |
+
this License without regard to the additional permissions.
|
| 595 |
+
|
| 596 |
+
When you convey a copy of a covered work, you may at your option
|
| 597 |
+
remove any additional permissions from that copy, or from any part of
|
| 598 |
+
it. (Additional permissions may be written to require their own
|
| 599 |
+
removal in certain cases when you modify the work.) You may place
|
| 600 |
+
additional permissions on material, added by you to a covered work,
|
| 601 |
+
for which you have or can give appropriate copyright permission.
|
| 602 |
+
|
| 603 |
+
Notwithstanding any other provision of this License, for material you
|
| 604 |
+
add to a covered work, you may (if authorized by the copyright holders of
|
| 605 |
+
that material) supplement the terms of this License with terms:
|
| 606 |
+
|
| 607 |
+
a) Disclaiming warranty or limiting liability differently from the
|
| 608 |
+
terms of sections 15 and 16 of this License; or
|
| 609 |
+
|
| 610 |
+
b) Requiring preservation of specified reasonable legal notices or
|
| 611 |
+
author attributions in that material or in the Appropriate Legal
|
| 612 |
+
Notices displayed by works containing it; or
|
| 613 |
+
|
| 614 |
+
c) Prohibiting misrepresentation of the origin of that material, or
|
| 615 |
+
requiring that modified versions of such material be marked in
|
| 616 |
+
reasonable ways as different from the original version; or
|
| 617 |
+
|
| 618 |
+
d) Limiting the use for publicity purposes of names of licensors or
|
| 619 |
+
authors of the material; or
|
| 620 |
+
|
| 621 |
+
e) Declining to grant rights under trademark law for use of some
|
| 622 |
+
trade names, trademarks, or service marks; or
|
| 623 |
+
|
| 624 |
+
f) Requiring indemnification of licensors and authors of that
|
| 625 |
+
material by anyone who conveys the material (or modified versions of
|
| 626 |
+
it) with contractual assumptions of liability to the recipient, for
|
| 627 |
+
any liability that these contractual assumptions directly impose on
|
| 628 |
+
those licensors and authors.
|
| 629 |
+
|
| 630 |
+
All other non-permissive additional terms are considered "further
|
| 631 |
+
restrictions" within the meaning of section 10. If the Program as you
|
| 632 |
+
received it, or any part of it, contains a notice stating that it is
|
| 633 |
+
governed by this License along with a term that is a further
|
| 634 |
+
restriction, you may remove that term. If a license document contains
|
| 635 |
+
a further restriction but permits relicensing or conveying under this
|
| 636 |
+
License, you may add to a covered work material governed by the terms
|
| 637 |
+
of that license document, provided that the further restriction does
|
| 638 |
+
not survive such relicensing or conveying.
|
| 639 |
+
|
| 640 |
+
If you add terms to a covered work in accord with this section, you
|
| 641 |
+
must place, in the relevant source files, a statement of the
|
| 642 |
+
additional terms that apply to those files, or a notice indicating
|
| 643 |
+
where to find the applicable terms.
|
| 644 |
+
|
| 645 |
+
Additional terms, permissive or non-permissive, may be stated in the
|
| 646 |
+
form of a separately written license, or stated as exceptions;
|
| 647 |
+
the above requirements apply either way.
|
| 648 |
+
|
| 649 |
+
8. Termination.
|
| 650 |
+
|
| 651 |
+
You may not propagate or modify a covered work except as expressly
|
| 652 |
+
provided under this License. Any attempt otherwise to propagate or
|
| 653 |
+
modify it is void, and will automatically terminate your rights under
|
| 654 |
+
this License (including any patent licenses granted under the third
|
| 655 |
+
paragraph of section 11).
|
| 656 |
+
|
| 657 |
+
However, if you cease all violation of this License, then your
|
| 658 |
+
license from a particular copyright holder is reinstated (a)
|
| 659 |
+
provisionally, unless and until the copyright holder explicitly and
|
| 660 |
+
finally terminates your license, and (b) permanently, if the copyright
|
| 661 |
+
holder fails to notify you of the violation by some reasonable means
|
| 662 |
+
prior to 60 days after the cessation.
|
| 663 |
+
|
| 664 |
+
Moreover, your license from a particular copyright holder is
|
| 665 |
+
reinstated permanently if the copyright holder notifies you of the
|
| 666 |
+
violation by some reasonable means, this is the first time you have
|
| 667 |
+
received notice of violation of this License (for any work) from that
|
| 668 |
+
copyright holder, and you cure the violation prior to 30 days after
|
| 669 |
+
your receipt of the notice.
|
| 670 |
+
|
| 671 |
+
Termination of your rights under this section does not terminate the
|
| 672 |
+
licenses of parties who have received copies or rights from you under
|
| 673 |
+
this License. If your rights have been terminated and not permanently
|
| 674 |
+
reinstated, you do not qualify to receive new licenses for the same
|
| 675 |
+
material under section 10.
|
| 676 |
+
|
| 677 |
+
9. Acceptance Not Required for Having Copies.
|
| 678 |
+
|
| 679 |
+
You are not required to accept this License in order to receive or
|
| 680 |
+
run a copy of the Program. Ancillary propagation of a covered work
|
| 681 |
+
occurring solely as a consequence of using peer-to-peer transmission
|
| 682 |
+
to receive a copy likewise does not require acceptance. However,
|
| 683 |
+
nothing other than this License grants you permission to propagate or
|
| 684 |
+
modify any covered work. These actions infringe copyright if you do
|
| 685 |
+
not accept this License. Therefore, by modifying or propagating a
|
| 686 |
+
covered work, you indicate your acceptance of this License to do so.
|
| 687 |
+
|
| 688 |
+
10. Automatic Licensing of Downstream Recipients.
|
| 689 |
+
|
| 690 |
+
Each time you convey a covered work, the recipient automatically
|
| 691 |
+
receives a license from the original licensors, to run, modify and
|
| 692 |
+
propagate that work, subject to this License. You are not responsible
|
| 693 |
+
for enforcing compliance by third parties with this License.
|
| 694 |
+
|
| 695 |
+
An "entity transaction" is a transaction transferring control of an
|
| 696 |
+
organization, or substantially all assets of one, or subdividing an
|
| 697 |
+
organization, or merging organizations. If propagation of a covered
|
| 698 |
+
work results from an entity transaction, each party to that
|
| 699 |
+
transaction who receives a copy of the work also receives whatever
|
| 700 |
+
licenses to the work the party's predecessor in interest had or could
|
| 701 |
+
give under the previous paragraph, plus a right to possession of the
|
| 702 |
+
Corresponding Source of the work from the predecessor in interest, if
|
| 703 |
+
the predecessor has it or can get it with reasonable efforts.
|
| 704 |
+
|
| 705 |
+
You may not impose any further restrictions on the exercise of the
|
| 706 |
+
rights granted or affirmed under this License. For example, you may
|
| 707 |
+
not impose a license fee, royalty, or other charge for exercise of
|
| 708 |
+
rights granted under this License, and you may not initiate litigation
|
| 709 |
+
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
| 710 |
+
any patent claim is infringed by making, using, selling, offering for
|
| 711 |
+
sale, or importing the Program or any portion of it.
|
| 712 |
+
|
| 713 |
+
11. Patents.
|
| 714 |
+
|
| 715 |
+
A "contributor" is a copyright holder who authorizes use under this
|
| 716 |
+
License of the Program or a work on which the Program is based. The
|
| 717 |
+
work thus licensed is called the contributor's "contributor version".
|
| 718 |
+
|
| 719 |
+
A contributor's "essential patent claims" are all patent claims
|
| 720 |
+
owned or controlled by the contributor, whether already acquired or
|
| 721 |
+
hereafter acquired, that would be infringed by some manner, permitted
|
| 722 |
+
by this License, of making, using, or selling its contributor version,
|
| 723 |
+
but do not include claims that would be infringed only as a
|
| 724 |
+
consequence of further modification of the contributor version. For
|
| 725 |
+
purposes of this definition, "control" includes the right to grant
|
| 726 |
+
patent sublicenses in a manner consistent with the requirements of
|
| 727 |
+
this License.
|
| 728 |
+
|
| 729 |
+
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
| 730 |
+
patent license under the contributor's essential patent claims, to
|
| 731 |
+
make, use, sell, offer for sale, import and otherwise run, modify and
|
| 732 |
+
propagate the contents of its contributor version.
|
| 733 |
+
|
| 734 |
+
In the following three paragraphs, a "patent license" is any express
|
| 735 |
+
agreement or commitment, however denominated, not to enforce a patent
|
| 736 |
+
(such as an express permission to practice a patent or covenant not to
|
| 737 |
+
sue for patent infringement). To "grant" such a patent license to a
|
| 738 |
+
party means to make such an agreement or commitment not to enforce a
|
| 739 |
+
patent against the party.
|
| 740 |
+
|
| 741 |
+
If you convey a covered work, knowingly relying on a patent license,
|
| 742 |
+
and the Corresponding Source of the work is not available for anyone
|
| 743 |
+
to copy, free of charge and under the terms of this License, through a
|
| 744 |
+
publicly available network server or other readily accessible means,
|
| 745 |
+
then you must either (1) cause the Corresponding Source to be so
|
| 746 |
+
available, or (2) arrange to deprive yourself of the benefit of the
|
| 747 |
+
patent license for this particular work, or (3) arrange, in a manner
|
| 748 |
+
consistent with the requirements of this License, to extend the patent
|
| 749 |
+
license to downstream recipients. "Knowingly relying" means you have
|
| 750 |
+
actual knowledge that, but for the patent license, your conveying the
|
| 751 |
+
covered work in a country, or your recipient's use of the covered work
|
| 752 |
+
in a country, would infringe one or more identifiable patents in that
|
| 753 |
+
country that you have reason to believe are valid.
|
| 754 |
+
|
| 755 |
+
If, pursuant to or in connection with a single transaction or
|
| 756 |
+
arrangement, you convey, or propagate by procuring conveyance of, a
|
| 757 |
+
covered work, and grant a patent license to some of the parties
|
| 758 |
+
receiving the covered work authorizing them to use, propagate, modify
|
| 759 |
+
or convey a specific copy of the covered work, then the patent license
|
| 760 |
+
you grant is automatically extended to all recipients of the covered
|
| 761 |
+
work and works based on it.
|
| 762 |
+
|
| 763 |
+
A patent license is "discriminatory" if it does not include within
|
| 764 |
+
the scope of its coverage, prohibits the exercise of, or is
|
| 765 |
+
conditioned on the non-exercise of one or more of the rights that are
|
| 766 |
+
specifically granted under this License. You may not convey a covered
|
| 767 |
+
work if you are a party to an arrangement with a third party that is
|
| 768 |
+
in the business of distributing software, under which you make payment
|
| 769 |
+
to the third party based on the extent of your activity of conveying
|
| 770 |
+
the work, and under which the third party grants, to any of the
|
| 771 |
+
parties who would receive the covered work from you, a discriminatory
|
| 772 |
+
patent license (a) in connection with copies of the covered work
|
| 773 |
+
conveyed by you (or copies made from those copies), or (b) primarily
|
| 774 |
+
for and in connection with specific products or compilations that
|
| 775 |
+
contain the covered work, unless you entered into that arrangement,
|
| 776 |
+
or that patent license was granted, prior to 28 March 2007.
|
| 777 |
+
|
| 778 |
+
Nothing in this License shall be construed as excluding or limiting
|
| 779 |
+
any implied license or other defenses to infringement that may
|
| 780 |
+
otherwise be available to you under applicable patent law.
|
| 781 |
+
|
| 782 |
+
12. No Surrender of Others' Freedom.
|
| 783 |
+
|
| 784 |
+
If conditions are imposed on you (whether by court order, agreement or
|
| 785 |
+
otherwise) that contradict the conditions of this License, they do not
|
| 786 |
+
excuse you from the conditions of this License. If you cannot convey a
|
| 787 |
+
covered work so as to satisfy simultaneously your obligations under this
|
| 788 |
+
License and any other pertinent obligations, then as a consequence you may
|
| 789 |
+
not convey it at all. For example, if you agree to terms that obligate you
|
| 790 |
+
to collect a royalty for further conveying from those to whom you convey
|
| 791 |
+
the Program, the only way you could satisfy both those terms and this
|
| 792 |
+
License would be to refrain entirely from conveying the Program.
|
| 793 |
+
|
| 794 |
+
13. Use with the GNU Affero General Public License.
|
| 795 |
+
|
| 796 |
+
Notwithstanding any other provision of this License, you have
|
| 797 |
+
permission to link or combine any covered work with a work licensed
|
| 798 |
+
under version 3 of the GNU Affero General Public License into a single
|
| 799 |
+
combined work, and to convey the resulting work. The terms of this
|
| 800 |
+
License will continue to apply to the part which is the covered work,
|
| 801 |
+
but the special requirements of the GNU Affero General Public License,
|
| 802 |
+
section 13, concerning interaction through a network will apply to the
|
| 803 |
+
combination as such.
|
| 804 |
+
|
| 805 |
+
14. Revised Versions of this License.
|
| 806 |
+
|
| 807 |
+
The Free Software Foundation may publish revised and/or new versions of
|
| 808 |
+
the GNU General Public License from time to time. Such new versions will
|
| 809 |
+
be similar in spirit to the present version, but may differ in detail to
|
| 810 |
+
address new problems or concerns.
|
| 811 |
+
|
| 812 |
+
Each version is given a distinguishing version number. If the
|
| 813 |
+
Program specifies that a certain numbered version of the GNU General
|
| 814 |
+
Public License "or any later version" applies to it, you have the
|
| 815 |
+
option of following the terms and conditions either of that numbered
|
| 816 |
+
version or of any later version published by the Free Software
|
| 817 |
+
Foundation. If the Program does not specify a version number of the
|
| 818 |
+
GNU General Public License, you may choose any version ever published
|
| 819 |
+
by the Free Software Foundation.
|
| 820 |
+
|
| 821 |
+
If the Program specifies that a proxy can decide which future
|
| 822 |
+
versions of the GNU General Public License can be used, that proxy's
|
| 823 |
+
public statement of acceptance of a version permanently authorizes you
|
| 824 |
+
to choose that version for the Program.
|
| 825 |
+
|
| 826 |
+
Later license versions may give you additional or different
|
| 827 |
+
permissions. However, no additional obligations are imposed on any
|
| 828 |
+
author or copyright holder as a result of your choosing to follow a
|
| 829 |
+
later version.
|
| 830 |
+
|
| 831 |
+
15. Disclaimer of Warranty.
|
| 832 |
+
|
| 833 |
+
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
| 834 |
+
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
| 835 |
+
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
| 836 |
+
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
| 837 |
+
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
| 838 |
+
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
| 839 |
+
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
| 840 |
+
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
| 841 |
+
|
| 842 |
+
16. Limitation of Liability.
|
| 843 |
+
|
| 844 |
+
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
| 845 |
+
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
| 846 |
+
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
| 847 |
+
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
| 848 |
+
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
| 849 |
+
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
| 850 |
+
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
| 851 |
+
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
| 852 |
+
SUCH DAMAGES.
|
| 853 |
+
|
| 854 |
+
17. Interpretation of Sections 15 and 16.
|
| 855 |
+
|
| 856 |
+
If the disclaimer of warranty and limitation of liability provided
|
| 857 |
+
above cannot be given local legal effect according to their terms,
|
| 858 |
+
reviewing courts shall apply local law that most closely approximates
|
| 859 |
+
an absolute waiver of all civil liability in connection with the
|
| 860 |
+
Program, unless a warranty or assumption of liability accompanies a
|
| 861 |
+
copy of the Program in return for a fee.
|
| 862 |
+
|
| 863 |
+
END OF TERMS AND CONDITIONS
|
| 864 |
+
|
| 865 |
+
How to Apply These Terms to Your New Programs
|
| 866 |
+
|
| 867 |
+
If you develop a new program, and you want it to be of the greatest
|
| 868 |
+
possible use to the public, the best way to achieve this is to make it
|
| 869 |
+
free software which everyone can redistribute and change under these terms.
|
| 870 |
+
|
| 871 |
+
To do so, attach the following notices to the program. It is safest
|
| 872 |
+
to attach them to the start of each source file to most effectively
|
| 873 |
+
state the exclusion of warranty; and each file should have at least
|
| 874 |
+
the "copyright" line and a pointer to where the full notice is found.
|
| 875 |
+
|
| 876 |
+
<one line to give the program's name and a brief idea of what it does.>
|
| 877 |
+
Copyright (C) <year> <name of author>
|
| 878 |
+
|
| 879 |
+
This program is free software: you can redistribute it and/or modify
|
| 880 |
+
it under the terms of the GNU General Public License as published by
|
| 881 |
+
the Free Software Foundation, either version 3 of the License, or
|
| 882 |
+
(at your option) any later version.
|
| 883 |
+
|
| 884 |
+
This program is distributed in the hope that it will be useful,
|
| 885 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 886 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 887 |
+
GNU General Public License for more details.
|
| 888 |
+
|
| 889 |
+
You should have received a copy of the GNU General Public License
|
| 890 |
+
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
| 891 |
+
|
| 892 |
+
Also add information on how to contact you by electronic and paper mail.
|
| 893 |
+
|
| 894 |
+
If the program does terminal interaction, make it output a short
|
| 895 |
+
notice like this when it starts in an interactive mode:
|
| 896 |
+
|
| 897 |
+
<program> Copyright (C) <year> <name of author>
|
| 898 |
+
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
| 899 |
+
This is free software, and you are welcome to redistribute it
|
| 900 |
+
under certain conditions; type `show c' for details.
|
| 901 |
+
|
| 902 |
+
The hypothetical commands `show w' and `show c' should show the appropriate
|
| 903 |
+
parts of the General Public License. Of course, your program's commands
|
| 904 |
+
might be different; for a GUI interface, you would use an "about box".
|
| 905 |
+
|
| 906 |
+
You should also get your employer (if you work as a programmer) or school,
|
| 907 |
+
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
| 908 |
+
For more information on this, and how to apply and follow the GNU GPL, see
|
| 909 |
+
<http://www.gnu.org/licenses/>.
|
| 910 |
+
|
| 911 |
+
The GNU General Public License does not permit incorporating your program
|
| 912 |
+
into proprietary programs. If your program is a subroutine library, you
|
| 913 |
+
may consider it more useful to permit linking proprietary applications with
|
| 914 |
+
the library. If this is what you want to do, use the GNU Lesser General
|
| 915 |
+
Public License instead of this License. But first, please read
|
| 916 |
+
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
| 917 |
+
|
| 918 |
+
|
| 919 |
+
Name: libquadmath
|
| 920 |
+
Files: scipy.libs/libquadmath*.so
|
| 921 |
+
Description: dynamically linked to files compiled with gcc
|
| 922 |
+
Availability: https://gcc.gnu.org/git/?p=gcc.git;a=tree;f=libquadmath
|
| 923 |
+
License: LGPL-2.1-or-later
|
| 924 |
+
|
| 925 |
+
GCC Quad-Precision Math Library
|
| 926 |
+
Copyright (C) 2010-2019 Free Software Foundation, Inc.
|
| 927 |
+
Written by Francois-Xavier Coudert <fxcoudert@gcc.gnu.org>
|
| 928 |
+
|
| 929 |
+
This file is part of the libquadmath library.
|
| 930 |
+
Libquadmath is free software; you can redistribute it and/or
|
| 931 |
+
modify it under the terms of the GNU Library General Public
|
| 932 |
+
License as published by the Free Software Foundation; either
|
| 933 |
+
version 2.1 of the License, or (at your option) any later version.
|
| 934 |
+
|
| 935 |
+
Libquadmath is distributed in the hope that it will be useful,
|
| 936 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 937 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
| 938 |
+
Lesser General Public License for more details.
|
| 939 |
+
https://www.gnu.org/licenses/old-licenses/lgpl-2.1.html
|
| 940 |
+
|
| 941 |
+
Classifier: Development Status :: 5 - Production/Stable
|
| 942 |
+
Classifier: Intended Audience :: Science/Research
|
| 943 |
+
Classifier: Intended Audience :: Developers
|
| 944 |
+
Classifier: License :: OSI Approved :: BSD License
|
| 945 |
+
Classifier: Programming Language :: C
|
| 946 |
+
Classifier: Programming Language :: Python
|
| 947 |
+
Classifier: Programming Language :: Python :: 3
|
| 948 |
+
Classifier: Programming Language :: Python :: 3.11
|
| 949 |
+
Classifier: Programming Language :: Python :: 3.12
|
| 950 |
+
Classifier: Programming Language :: Python :: 3.13
|
| 951 |
+
Classifier: Programming Language :: Python :: 3.14
|
| 952 |
+
Classifier: Topic :: Software Development :: Libraries
|
| 953 |
+
Classifier: Topic :: Scientific/Engineering
|
| 954 |
+
Classifier: Operating System :: Microsoft :: Windows
|
| 955 |
+
Classifier: Operating System :: POSIX :: Linux
|
| 956 |
+
Classifier: Operating System :: POSIX
|
| 957 |
+
Classifier: Operating System :: Unix
|
| 958 |
+
Classifier: Operating System :: MacOS
|
| 959 |
+
Project-URL: homepage, https://scipy.org/
|
| 960 |
+
Project-URL: documentation, https://docs.scipy.org/doc/scipy/
|
| 961 |
+
Project-URL: source, https://github.com/scipy/scipy
|
| 962 |
+
Project-URL: download, https://github.com/scipy/scipy/releases
|
| 963 |
+
Project-URL: tracker, https://github.com/scipy/scipy/issues
|
| 964 |
+
Requires-Python: >=3.11
|
| 965 |
+
Requires-Dist: numpy<2.7,>=1.26.4
|
| 966 |
+
Provides-Extra: test
|
| 967 |
+
Requires-Dist: pytest>=8.0.0; extra == "test"
|
| 968 |
+
Requires-Dist: pytest-cov; extra == "test"
|
| 969 |
+
Requires-Dist: pytest-timeout; extra == "test"
|
| 970 |
+
Requires-Dist: pytest-xdist; extra == "test"
|
| 971 |
+
Requires-Dist: asv; extra == "test"
|
| 972 |
+
Requires-Dist: mpmath; extra == "test"
|
| 973 |
+
Requires-Dist: gmpy2; extra == "test"
|
| 974 |
+
Requires-Dist: threadpoolctl; extra == "test"
|
| 975 |
+
Requires-Dist: scikit-umfpack; extra == "test"
|
| 976 |
+
Requires-Dist: pooch; extra == "test"
|
| 977 |
+
Requires-Dist: hypothesis>=6.30; extra == "test"
|
| 978 |
+
Requires-Dist: array-api-strict>=2.3.1; extra == "test"
|
| 979 |
+
Requires-Dist: Cython; extra == "test"
|
| 980 |
+
Requires-Dist: meson; extra == "test"
|
| 981 |
+
Requires-Dist: ninja; sys_platform != "emscripten" and extra == "test"
|
| 982 |
+
Provides-Extra: doc
|
| 983 |
+
Requires-Dist: sphinx<8.2.0,>=5.0.0; extra == "doc"
|
| 984 |
+
Requires-Dist: intersphinx_registry; extra == "doc"
|
| 985 |
+
Requires-Dist: pydata-sphinx-theme>=0.15.2; extra == "doc"
|
| 986 |
+
Requires-Dist: sphinx-copybutton; extra == "doc"
|
| 987 |
+
Requires-Dist: sphinx-design>=0.4.0; extra == "doc"
|
| 988 |
+
Requires-Dist: matplotlib>=3.5; extra == "doc"
|
| 989 |
+
Requires-Dist: numpydoc; extra == "doc"
|
| 990 |
+
Requires-Dist: jupytext; extra == "doc"
|
| 991 |
+
Requires-Dist: myst-nb>=1.2.0; extra == "doc"
|
| 992 |
+
Requires-Dist: pooch; extra == "doc"
|
| 993 |
+
Requires-Dist: jupyterlite-sphinx>=0.19.1; extra == "doc"
|
| 994 |
+
Requires-Dist: jupyterlite-pyodide-kernel; extra == "doc"
|
| 995 |
+
Requires-Dist: linkify-it-py; extra == "doc"
|
| 996 |
+
Requires-Dist: tabulate; extra == "doc"
|
| 997 |
+
Provides-Extra: dev
|
| 998 |
+
Requires-Dist: click<8.3.0; extra == "dev"
|
| 999 |
+
Requires-Dist: spin; extra == "dev"
|
| 1000 |
+
Requires-Dist: mypy==1.10.0; extra == "dev"
|
| 1001 |
+
Requires-Dist: typing_extensions; extra == "dev"
|
| 1002 |
+
Requires-Dist: types-psutil; extra == "dev"
|
| 1003 |
+
Requires-Dist: pycodestyle; extra == "dev"
|
| 1004 |
+
Requires-Dist: ruff>=0.12.0; extra == "dev"
|
| 1005 |
+
Requires-Dist: cython-lint>=0.12.2; extra == "dev"
|
| 1006 |
+
Description-Content-Type: text/x-rst
|
| 1007 |
+
|
| 1008 |
+
.. image:: https://raw.githubusercontent.com/scipy/scipy/main/doc/source/_static/logo.svg
|
| 1009 |
+
:target: https://scipy.org
|
| 1010 |
+
:width: 110
|
| 1011 |
+
:height: 110
|
| 1012 |
+
:align: left
|
| 1013 |
+
|
| 1014 |
+
.. image:: https://img.shields.io/badge/powered%20by-NumFOCUS-orange.svg?style=flat&colorA=E1523D&colorB=007D8A
|
| 1015 |
+
:target: https://numfocus.org
|
| 1016 |
+
|
| 1017 |
+
.. image:: https://img.shields.io/pypi/dm/scipy.svg?label=Pypi%20downloads
|
| 1018 |
+
:target: https://pypi.org/project/scipy/
|
| 1019 |
+
|
| 1020 |
+
.. image:: https://img.shields.io/conda/dn/conda-forge/scipy.svg?label=Conda%20downloads
|
| 1021 |
+
:target: https://anaconda.org/conda-forge/scipy
|
| 1022 |
+
|
| 1023 |
+
.. image:: https://img.shields.io/badge/stackoverflow-Ask%20questions-blue.svg
|
| 1024 |
+
:target: https://stackoverflow.com/questions/tagged/scipy
|
| 1025 |
+
|
| 1026 |
+
.. image:: https://img.shields.io/badge/DOI-10.1038%2Fs41592--019--0686--2-blue.svg
|
| 1027 |
+
:target: https://www.nature.com/articles/s41592-019-0686-2
|
| 1028 |
+
|
| 1029 |
+
.. image:: https://insights.linuxfoundation.org/api/badge/health-score?project=scipy
|
| 1030 |
+
:target: https://insights.linuxfoundation.org/project/scipy
|
| 1031 |
+
|
| 1032 |
+
SciPy (pronounced "Sigh Pie") is an open-source software for mathematics,
|
| 1033 |
+
science, and engineering. It includes modules for statistics, optimization,
|
| 1034 |
+
integration, linear algebra, Fourier transforms, signal and image processing,
|
| 1035 |
+
ODE solvers, and more.
|
| 1036 |
+
|
| 1037 |
+
- **Website:** https://scipy.org
|
| 1038 |
+
- **Documentation:** https://docs.scipy.org/doc/scipy/
|
| 1039 |
+
- **Development version of the documentation:** https://scipy.github.io/devdocs
|
| 1040 |
+
- **SciPy development forum:** https://discuss.scientific-python.org/c/contributor/scipy
|
| 1041 |
+
- **Stack Overflow:** https://stackoverflow.com/questions/tagged/scipy
|
| 1042 |
+
- **Source code:** https://github.com/scipy/scipy
|
| 1043 |
+
- **Contributing:** https://scipy.github.io/devdocs/dev/index.html
|
| 1044 |
+
- **Bug reports:** https://github.com/scipy/scipy/issues
|
| 1045 |
+
- **Code of Conduct:** https://docs.scipy.org/doc/scipy/dev/conduct/code_of_conduct.html
|
| 1046 |
+
- **Report a security vulnerability:** https://tidelift.com/docs/security
|
| 1047 |
+
- **Citing in your work:** https://www.scipy.org/citing-scipy/
|
| 1048 |
+
|
| 1049 |
+
SciPy is built to work with
|
| 1050 |
+
NumPy arrays, and provides many user-friendly and efficient numerical routines,
|
| 1051 |
+
such as routines for numerical integration and optimization. Together, they
|
| 1052 |
+
run on all popular operating systems, are quick to install, and are free of
|
| 1053 |
+
charge. NumPy and SciPy are easy to use, but powerful enough to be depended
|
| 1054 |
+
upon by some of the world's leading scientists and engineers. If you need to
|
| 1055 |
+
manipulate numbers on a computer and display or publish the results, give
|
| 1056 |
+
SciPy a try!
|
| 1057 |
+
|
| 1058 |
+
For the installation instructions, see `our install
|
| 1059 |
+
guide <https://scipy.org/install/>`__.
|
| 1060 |
+
|
| 1061 |
+
|
| 1062 |
+
Call for Contributions
|
| 1063 |
+
----------------------
|
| 1064 |
+
|
| 1065 |
+
We appreciate and welcome contributions. Small improvements or fixes are always appreciated; issues labeled as "good
|
| 1066 |
+
first issue" may be a good starting point. Have a look at `our contributing
|
| 1067 |
+
guide <https://scipy.github.io/devdocs/dev/index.html>`__.
|
| 1068 |
+
|
| 1069 |
+
Writing code isn’t the only way to contribute to SciPy. You can also:
|
| 1070 |
+
|
| 1071 |
+
- review pull requests
|
| 1072 |
+
- triage issues
|
| 1073 |
+
- develop tutorials, presentations, and other educational materials
|
| 1074 |
+
- maintain and improve `our website <https://github.com/scipy/scipy.org>`__
|
| 1075 |
+
- develop graphic design for our brand assets and promotional materials
|
| 1076 |
+
- help with outreach and onboard new contributors
|
| 1077 |
+
- write grant proposals and help with other fundraising efforts
|
| 1078 |
+
|
| 1079 |
+
If you’re unsure where to start or how your skills fit in, reach out! You can
|
| 1080 |
+
ask on the `forum <https://discuss.scientific-python.org/c/contributor/scipy>`__
|
| 1081 |
+
or here, on GitHub, by leaving a comment on a relevant issue that is already
|
| 1082 |
+
open.
|
| 1083 |
+
|
| 1084 |
+
If you are new to contributing to open source, `this
|
| 1085 |
+
guide <https://opensource.guide/how-to-contribute/>`__ helps explain why, what,
|
| 1086 |
+
and how to get involved.
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy-1.17.1.dist-info/RECORD
ADDED
|
The diff for this file is too large to render.
See raw diff
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy-1.17.1.dist-info/REQUESTED
ADDED
|
File without changes
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy-1.17.1.dist-info/WHEEL
ADDED
|
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Wheel-Version: 1.0
|
| 2 |
+
Generator: meson
|
| 3 |
+
Root-Is-Purelib: false
|
| 4 |
+
Tag: cp311-cp311-manylinux_2_27_x86_64
|
| 5 |
+
Tag: cp311-cp311-manylinux_2_28_x86_64
|
| 6 |
+
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libgfortran-040039e1-0352e75f.so.5.0.0
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:c6090048eccc763522c12ef016f81da6b627cb3a044f55cf0479a839c41c0980
|
| 3 |
+
size 2833617
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libgfortran-8f1e9814.so.5.0.0
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:a95cc4ac4afad889f2d83088f46b5e6fa6cd5efd729db887e1e639147ec55b73
|
| 3 |
+
size 2714697
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libquadmath-828275a7.so.0.0.0
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:71bdc2ec57ab2fc939360597968f73230426b1c6764048e62a2cb6c8d8c3a1fd
|
| 3 |
+
size 272193
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libquadmath-96973f99-934c22de.so.0.0.0
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:6ed5137f412781ad7863439fb543613f620b43c32b63292a0029246162f5bbc6
|
| 3 |
+
size 250985
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy.libs/libscipy_openblas-6cdc3b4a.so
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:8fb864c29cac4b25f6e2c139491ea96f2724dde42d51394f84e9c4a622e34790
|
| 3 |
+
size 24805561
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_sf_error.py
ADDED
|
@@ -0,0 +1,153 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import sys
|
| 2 |
+
import warnings
|
| 3 |
+
|
| 4 |
+
import numpy as np
|
| 5 |
+
from numpy.testing import assert_, assert_equal, HAS_REFCOUNT
|
| 6 |
+
import pytest
|
| 7 |
+
from pytest import raises as assert_raises
|
| 8 |
+
|
| 9 |
+
import scipy.special as sc
|
| 10 |
+
from scipy.special._ufuncs import _sf_error_test_function
|
| 11 |
+
|
| 12 |
+
_sf_error_code_map = {
|
| 13 |
+
# skip 'ok'
|
| 14 |
+
'singular': 1,
|
| 15 |
+
'underflow': 2,
|
| 16 |
+
'overflow': 3,
|
| 17 |
+
'slow': 4,
|
| 18 |
+
'loss': 5,
|
| 19 |
+
'no_result': 6,
|
| 20 |
+
'domain': 7,
|
| 21 |
+
'arg': 8,
|
| 22 |
+
'other': 9,
|
| 23 |
+
'memory': 10,
|
| 24 |
+
}
|
| 25 |
+
|
| 26 |
+
_sf_error_actions = [
|
| 27 |
+
'ignore',
|
| 28 |
+
'warn',
|
| 29 |
+
'raise'
|
| 30 |
+
]
|
| 31 |
+
|
| 32 |
+
|
| 33 |
+
def _check_action(fun, args, action):
|
| 34 |
+
# TODO: special expert should correct
|
| 35 |
+
# the coercion at the true location?
|
| 36 |
+
args = np.asarray(args, dtype=np.dtype("long"))
|
| 37 |
+
if action == 'warn':
|
| 38 |
+
with pytest.warns(sc.SpecialFunctionWarning):
|
| 39 |
+
fun(*args)
|
| 40 |
+
elif action == 'raise':
|
| 41 |
+
with assert_raises(sc.SpecialFunctionError):
|
| 42 |
+
fun(*args)
|
| 43 |
+
else:
|
| 44 |
+
# action == 'ignore', make sure there are no warnings/exceptions
|
| 45 |
+
with warnings.catch_warnings():
|
| 46 |
+
warnings.simplefilter("error")
|
| 47 |
+
fun(*args)
|
| 48 |
+
|
| 49 |
+
|
| 50 |
+
def test_geterr():
|
| 51 |
+
err = sc.geterr()
|
| 52 |
+
for key, value in err.items():
|
| 53 |
+
assert_(key in _sf_error_code_map)
|
| 54 |
+
assert_(value in _sf_error_actions)
|
| 55 |
+
|
| 56 |
+
|
| 57 |
+
def test_seterr():
|
| 58 |
+
entry_err = sc.geterr()
|
| 59 |
+
try:
|
| 60 |
+
for category, error_code in _sf_error_code_map.items():
|
| 61 |
+
for action in _sf_error_actions:
|
| 62 |
+
geterr_olderr = sc.geterr()
|
| 63 |
+
seterr_olderr = sc.seterr(**{category: action})
|
| 64 |
+
assert_(geterr_olderr == seterr_olderr)
|
| 65 |
+
newerr = sc.geterr()
|
| 66 |
+
assert_(newerr[category] == action)
|
| 67 |
+
geterr_olderr.pop(category)
|
| 68 |
+
newerr.pop(category)
|
| 69 |
+
assert_(geterr_olderr == newerr)
|
| 70 |
+
_check_action(_sf_error_test_function, (error_code,), action)
|
| 71 |
+
finally:
|
| 72 |
+
sc.seterr(**entry_err)
|
| 73 |
+
|
| 74 |
+
|
| 75 |
+
@pytest.mark.thread_unsafe(reason="module refcounts are not stable in multiple threads")
|
| 76 |
+
@pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
|
| 77 |
+
def test_sf_error_special_refcount():
|
| 78 |
+
# Regression test for gh-16233.
|
| 79 |
+
# Check that the reference count of scipy.special is not increased
|
| 80 |
+
# when a SpecialFunctionError is raised.
|
| 81 |
+
refcount_before = sys.getrefcount(sc)
|
| 82 |
+
with sc.errstate(all='raise'):
|
| 83 |
+
with pytest.raises(sc.SpecialFunctionError, match='domain error'):
|
| 84 |
+
sc.ndtri(2.0)
|
| 85 |
+
refcount_after = sys.getrefcount(sc)
|
| 86 |
+
assert refcount_after == refcount_before
|
| 87 |
+
|
| 88 |
+
|
| 89 |
+
def test_errstate_pyx_basic():
|
| 90 |
+
olderr = sc.geterr()
|
| 91 |
+
with sc.errstate(singular='raise'):
|
| 92 |
+
with assert_raises(sc.SpecialFunctionError):
|
| 93 |
+
sc.loggamma(0)
|
| 94 |
+
assert_equal(olderr, sc.geterr())
|
| 95 |
+
|
| 96 |
+
|
| 97 |
+
def test_errstate_c_basic():
|
| 98 |
+
olderr = sc.geterr()
|
| 99 |
+
with sc.errstate(domain='raise'):
|
| 100 |
+
with assert_raises(sc.SpecialFunctionError):
|
| 101 |
+
sc.spence(-1)
|
| 102 |
+
assert_equal(olderr, sc.geterr())
|
| 103 |
+
|
| 104 |
+
|
| 105 |
+
def test_errstate_cpp_basic():
|
| 106 |
+
olderr = sc.geterr()
|
| 107 |
+
with sc.errstate(underflow='raise'):
|
| 108 |
+
with assert_raises(sc.SpecialFunctionError):
|
| 109 |
+
sc.wrightomega(-1000)
|
| 110 |
+
assert_equal(olderr, sc.geterr())
|
| 111 |
+
|
| 112 |
+
|
| 113 |
+
def test_errstate_cpp_scipy_special():
|
| 114 |
+
olderr = sc.geterr()
|
| 115 |
+
with sc.errstate(singular='raise'):
|
| 116 |
+
with assert_raises(sc.SpecialFunctionError):
|
| 117 |
+
sc.lambertw(0, 1)
|
| 118 |
+
assert_equal(olderr, sc.geterr())
|
| 119 |
+
|
| 120 |
+
|
| 121 |
+
def test_errstate_cpp_alt_ufunc_machinery():
|
| 122 |
+
olderr = sc.geterr()
|
| 123 |
+
with sc.errstate(singular='raise'):
|
| 124 |
+
with assert_raises(sc.SpecialFunctionError):
|
| 125 |
+
sc.gammaln(0)
|
| 126 |
+
assert_equal(olderr, sc.geterr())
|
| 127 |
+
|
| 128 |
+
|
| 129 |
+
def test_errstate():
|
| 130 |
+
for category, error_code in _sf_error_code_map.items():
|
| 131 |
+
for action in _sf_error_actions:
|
| 132 |
+
olderr = sc.geterr()
|
| 133 |
+
with sc.errstate(**{category: action}):
|
| 134 |
+
_check_action(_sf_error_test_function, (error_code,), action)
|
| 135 |
+
assert_equal(olderr, sc.geterr())
|
| 136 |
+
|
| 137 |
+
|
| 138 |
+
def test_errstate_all_but_one():
|
| 139 |
+
olderr = sc.geterr()
|
| 140 |
+
with sc.errstate(all='raise', singular='ignore'):
|
| 141 |
+
sc.gammaln(0)
|
| 142 |
+
with assert_raises(sc.SpecialFunctionError):
|
| 143 |
+
sc.spence(-1.0)
|
| 144 |
+
assert_equal(olderr, sc.geterr())
|
| 145 |
+
|
| 146 |
+
|
| 147 |
+
def test_check_overflow_message():
|
| 148 |
+
# Regression test for a bug where the overflow and underflow
|
| 149 |
+
# messages were switched.
|
| 150 |
+
with pytest.raises(sc.SpecialFunctionError, match="overflow"):
|
| 151 |
+
with sc.errstate(all='raise'):
|
| 152 |
+
# This should trigger an overflow:
|
| 153 |
+
sc.yn(3, 1e-105)
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_sici.py
ADDED
|
@@ -0,0 +1,36 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import numpy as np
|
| 2 |
+
|
| 3 |
+
import scipy.special as sc
|
| 4 |
+
from scipy.special._testutils import FuncData
|
| 5 |
+
|
| 6 |
+
|
| 7 |
+
def test_sici_consistency():
|
| 8 |
+
# Make sure the implementation of sici for real arguments agrees
|
| 9 |
+
# with the implementation of sici for complex arguments.
|
| 10 |
+
|
| 11 |
+
# On the negative real axis Cephes drops the imaginary part in ci
|
| 12 |
+
def sici(x):
|
| 13 |
+
si, ci = sc.sici(x + 0j)
|
| 14 |
+
return si.real, ci.real
|
| 15 |
+
|
| 16 |
+
x = np.r_[-np.logspace(8, -30, 200), 0, np.logspace(-30, 8, 200)]
|
| 17 |
+
si, ci = sc.sici(x)
|
| 18 |
+
dataset = np.column_stack((x, si, ci))
|
| 19 |
+
FuncData(sici, dataset, 0, (1, 2), rtol=1e-12).check()
|
| 20 |
+
|
| 21 |
+
|
| 22 |
+
def test_shichi_consistency():
|
| 23 |
+
# Make sure the implementation of shichi for real arguments agrees
|
| 24 |
+
# with the implementation of shichi for complex arguments.
|
| 25 |
+
|
| 26 |
+
# On the negative real axis Cephes drops the imaginary part in chi
|
| 27 |
+
def shichi(x):
|
| 28 |
+
shi, chi = sc.shichi(x + 0j)
|
| 29 |
+
return shi.real, chi.real
|
| 30 |
+
|
| 31 |
+
# Overflow happens quickly, so limit range
|
| 32 |
+
x = np.r_[-np.logspace(np.log10(700), -30, 200), 0,
|
| 33 |
+
np.logspace(-30, np.log10(700), 200)]
|
| 34 |
+
shi, chi = sc.shichi(x)
|
| 35 |
+
dataset = np.column_stack((x, shi, chi))
|
| 36 |
+
FuncData(shichi, dataset, 0, (1, 2), rtol=1e-14).check()
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_specfun.py
ADDED
|
@@ -0,0 +1,48 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""
|
| 2 |
+
Various made-up tests to hit different branches of the code in specfun.c
|
| 3 |
+
"""
|
| 4 |
+
|
| 5 |
+
import numpy as np
|
| 6 |
+
from numpy.testing import assert_allclose
|
| 7 |
+
from scipy import special
|
| 8 |
+
|
| 9 |
+
|
| 10 |
+
def test_cva2_cv0_branches():
|
| 11 |
+
res, resp = special.mathieu_cem([40, 129], [13, 14], [30, 45])
|
| 12 |
+
assert_allclose(res, np.array([-0.3741211, 0.74441928]))
|
| 13 |
+
assert_allclose(resp, np.array([-37.02872758, -86.13549877]))
|
| 14 |
+
|
| 15 |
+
res, resp = special.mathieu_sem([40, 129], [13, 14], [30, 45])
|
| 16 |
+
assert_allclose(res, np.array([0.92955551, 0.66771207]))
|
| 17 |
+
assert_allclose(resp, np.array([-14.91073448, 96.02954185]))
|
| 18 |
+
|
| 19 |
+
|
| 20 |
+
def test_chgm_branches():
|
| 21 |
+
res = special.eval_genlaguerre(-3.2, 3, 2.5)
|
| 22 |
+
assert_allclose(res, -0.7077721935779854)
|
| 23 |
+
|
| 24 |
+
|
| 25 |
+
def test_hygfz_branches():
|
| 26 |
+
"""(z == 1.0) && (c-a-b > 0.0)"""
|
| 27 |
+
res = special.hyp2f1(1.5, 2.5, 4.5, 1.+0.j)
|
| 28 |
+
assert_allclose(res, 10.30835089459151+0j)
|
| 29 |
+
"""(cabs(z+1) < eps) && (fabs(c-a+b - 1.0) < eps)"""
|
| 30 |
+
res = special.hyp2f1(5+5e-16, 2, 2, -1.0 + 5e-16j)
|
| 31 |
+
assert_allclose(res, 0.031249999999999986+3.9062499999999994e-17j)
|
| 32 |
+
|
| 33 |
+
|
| 34 |
+
def test_pro_rad1():
|
| 35 |
+
# https://github.com/scipy/scipy/issues/21058
|
| 36 |
+
# Reference values taken from WolframAlpha
|
| 37 |
+
# SpheroidalS1(1, 1, 30, 1.1)
|
| 38 |
+
# SpheroidalS1Prime(1, 1, 30, 1.1)
|
| 39 |
+
res = special.pro_rad1(1, 1, 30, 1.1)
|
| 40 |
+
assert_allclose(res, (0.009657872296166435, 3.253369651472877), rtol=2e-5)
|
| 41 |
+
|
| 42 |
+
def test_pro_rad2():
|
| 43 |
+
# https://github.com/scipy/scipy/issues/21461
|
| 44 |
+
# Reference values taken from WolframAlpha
|
| 45 |
+
# SpheroidalS2(0, 0, 3, 1.02)
|
| 46 |
+
# SpheroidalS2Prime(0, 0, 3, 1.02)
|
| 47 |
+
res = special.pro_rad2(0, 0, 3, 1.02)
|
| 48 |
+
assert_allclose(res, (-0.35089596858528077, 13.652764213480872), rtol=10e-10)
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_spence.py
ADDED
|
@@ -0,0 +1,32 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import numpy as np
|
| 2 |
+
from numpy import sqrt, log, pi
|
| 3 |
+
from scipy.special._testutils import FuncData
|
| 4 |
+
from scipy.special import spence
|
| 5 |
+
|
| 6 |
+
|
| 7 |
+
def test_consistency():
|
| 8 |
+
# Make sure the implementation of spence for real arguments
|
| 9 |
+
# agrees with the implementation of spence for imaginary arguments.
|
| 10 |
+
|
| 11 |
+
x = np.logspace(-30, 300, 200)
|
| 12 |
+
dataset = np.vstack((x + 0j, spence(x))).T
|
| 13 |
+
FuncData(spence, dataset, 0, 1, rtol=1e-14).check()
|
| 14 |
+
|
| 15 |
+
|
| 16 |
+
def test_special_points():
|
| 17 |
+
# Check against known values of Spence's function.
|
| 18 |
+
|
| 19 |
+
phi = (1 + sqrt(5))/2
|
| 20 |
+
dataset = [(1, 0),
|
| 21 |
+
(2, -pi**2/12),
|
| 22 |
+
(0.5, pi**2/12 - log(2)**2/2),
|
| 23 |
+
(0, pi**2/6),
|
| 24 |
+
(-1, pi**2/4 - 1j*pi*log(2)),
|
| 25 |
+
((-1 + sqrt(5))/2, pi**2/15 - log(phi)**2),
|
| 26 |
+
((3 - sqrt(5))/2, pi**2/10 - log(phi)**2),
|
| 27 |
+
(phi, -pi**2/15 + log(phi)**2/2),
|
| 28 |
+
# Corrected from Zagier, "The Dilogarithm Function"
|
| 29 |
+
((3 + sqrt(5))/2, -pi**2/10 - log(phi)**2)]
|
| 30 |
+
|
| 31 |
+
dataset = np.asarray(dataset)
|
| 32 |
+
FuncData(spence, dataset, 0, 1, rtol=1e-14).check()
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_spfun_stats.py
ADDED
|
@@ -0,0 +1,61 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import numpy as np
|
| 2 |
+
from numpy.testing import (assert_array_equal, assert_array_almost_equal_nulp,
|
| 3 |
+
assert_allclose)
|
| 4 |
+
from pytest import raises as assert_raises
|
| 5 |
+
|
| 6 |
+
from scipy.special import gammaln, multigammaln
|
| 7 |
+
|
| 8 |
+
|
| 9 |
+
class TestMultiGammaLn:
|
| 10 |
+
|
| 11 |
+
def test1(self):
|
| 12 |
+
# A test of the identity
|
| 13 |
+
# Gamma_1(a) = Gamma(a)
|
| 14 |
+
np.random.seed(1234)
|
| 15 |
+
a = np.abs(np.random.randn())
|
| 16 |
+
assert_array_equal(multigammaln(a, 1), gammaln(a))
|
| 17 |
+
|
| 18 |
+
def test2(self):
|
| 19 |
+
# A test of the identity
|
| 20 |
+
# Gamma_2(a) = sqrt(pi) * Gamma(a) * Gamma(a - 0.5)
|
| 21 |
+
a = np.array([2.5, 10.0])
|
| 22 |
+
result = multigammaln(a, 2)
|
| 23 |
+
expected = np.log(np.sqrt(np.pi)) + gammaln(a) + gammaln(a - 0.5)
|
| 24 |
+
assert_allclose(result, expected, atol=1.5e-7, rtol=0)
|
| 25 |
+
|
| 26 |
+
def test_bararg(self):
|
| 27 |
+
assert_raises(ValueError, multigammaln, 0.5, 1.2)
|
| 28 |
+
|
| 29 |
+
|
| 30 |
+
def _check_multigammaln_array_result(a, d):
|
| 31 |
+
# Test that the shape of the array returned by multigammaln
|
| 32 |
+
# matches the input shape, and that all the values match
|
| 33 |
+
# the value computed when multigammaln is called with a scalar.
|
| 34 |
+
result = multigammaln(a, d)
|
| 35 |
+
assert_array_equal(a.shape, result.shape)
|
| 36 |
+
a1 = a.ravel()
|
| 37 |
+
result1 = result.ravel()
|
| 38 |
+
for i in range(a.size):
|
| 39 |
+
assert_array_almost_equal_nulp(result1[i], multigammaln(a1[i], d))
|
| 40 |
+
|
| 41 |
+
|
| 42 |
+
def test_multigammaln_array_arg():
|
| 43 |
+
# Check that the array returned by multigammaln has the correct
|
| 44 |
+
# shape and contains the correct values. The cases have arrays
|
| 45 |
+
# with several different shapes.
|
| 46 |
+
# The cases include a regression test for ticket #1849
|
| 47 |
+
# (a = np.array([2.0]), an array with a single element).
|
| 48 |
+
np.random.seed(1234)
|
| 49 |
+
|
| 50 |
+
cases = [
|
| 51 |
+
# a, d
|
| 52 |
+
(np.abs(np.random.randn(3, 2)) + 5, 5),
|
| 53 |
+
(np.abs(np.random.randn(1, 2)) + 5, 5),
|
| 54 |
+
(np.arange(10.0, 18.0).reshape(2, 2, 2), 3),
|
| 55 |
+
(np.array([2.0]), 3),
|
| 56 |
+
(np.float64(2.0), 3),
|
| 57 |
+
]
|
| 58 |
+
|
| 59 |
+
for a, d in cases:
|
| 60 |
+
_check_multigammaln_array_result(a, d)
|
| 61 |
+
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_sph_harm.py
ADDED
|
@@ -0,0 +1,48 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import numpy as np
|
| 2 |
+
import pytest
|
| 3 |
+
|
| 4 |
+
from numpy.testing import assert_allclose
|
| 5 |
+
import scipy.special as sc
|
| 6 |
+
|
| 7 |
+
class TestSphHarm:
|
| 8 |
+
@pytest.mark.slow
|
| 9 |
+
def test_p(self):
|
| 10 |
+
m_max = 20
|
| 11 |
+
n_max = 10
|
| 12 |
+
|
| 13 |
+
theta = np.linspace(0, np.pi)
|
| 14 |
+
phi = np.linspace(0, 2*np.pi)
|
| 15 |
+
theta, phi = np.meshgrid(theta, phi)
|
| 16 |
+
|
| 17 |
+
y, y_jac, y_hess = sc.sph_harm_y_all(n_max, m_max, theta, phi, diff_n=2)
|
| 18 |
+
p, p_jac, p_hess = sc.sph_legendre_p_all(n_max, m_max, theta, diff_n=2)
|
| 19 |
+
|
| 20 |
+
m = np.concatenate([np.arange(m_max + 1), np.arange(-m_max, 0)])
|
| 21 |
+
m = np.expand_dims(m, axis=(0,)+tuple(range(2,theta.ndim+2)))
|
| 22 |
+
|
| 23 |
+
assert_allclose(y, p * np.exp(1j * m * phi))
|
| 24 |
+
|
| 25 |
+
assert_allclose(y_jac[..., 0], p_jac * np.exp(1j * m * phi))
|
| 26 |
+
assert_allclose(y_jac[..., 1], 1j * m * p * np.exp(1j * m * phi))
|
| 27 |
+
|
| 28 |
+
assert_allclose(y_hess[..., 0, 0], p_hess * np.exp(1j * m * phi))
|
| 29 |
+
assert_allclose(y_hess[..., 0, 1], 1j * m * p_jac * np.exp(1j * m * phi))
|
| 30 |
+
assert_allclose(y_hess[..., 1, 0], y_hess[..., 0, 1])
|
| 31 |
+
assert_allclose(y_hess[..., 1, 1], -m * m * p * np.exp(1j * m * phi))
|
| 32 |
+
|
| 33 |
+
@pytest.mark.parametrize("n_max", [7, 10, 50])
|
| 34 |
+
@pytest.mark.parametrize("m_max", [1, 4, 5, 9, 14])
|
| 35 |
+
def test_all(self, n_max, m_max):
|
| 36 |
+
theta = np.linspace(0, np.pi)
|
| 37 |
+
phi = np.linspace(0, 2 * np.pi)
|
| 38 |
+
|
| 39 |
+
n = np.arange(n_max + 1)
|
| 40 |
+
n = np.expand_dims(n, axis=tuple(range(1,theta.ndim+2)))
|
| 41 |
+
|
| 42 |
+
m = np.concatenate([np.arange(m_max + 1), np.arange(-m_max, 0)])
|
| 43 |
+
m = np.expand_dims(m, axis=(0,)+tuple(range(2,theta.ndim+2)))
|
| 44 |
+
|
| 45 |
+
y_actual = sc.sph_harm_y_all(n_max, m_max, theta, phi)
|
| 46 |
+
y_desired = sc.sph_harm_y(n, m, theta, phi)
|
| 47 |
+
|
| 48 |
+
np.testing.assert_allclose(y_actual, y_desired, rtol=1e-05)
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_spherical_bessel.py
ADDED
|
@@ -0,0 +1,407 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#
|
| 2 |
+
# Tests of spherical Bessel functions.
|
| 3 |
+
#
|
| 4 |
+
import warnings
|
| 5 |
+
|
| 6 |
+
import numpy as np
|
| 7 |
+
from numpy.testing import assert_allclose
|
| 8 |
+
import pytest
|
| 9 |
+
from numpy import sin, cos, sinh, cosh, exp, inf, nan, r_, pi
|
| 10 |
+
|
| 11 |
+
from scipy.special import spherical_jn, spherical_yn, spherical_in, spherical_kn
|
| 12 |
+
from scipy.integrate import quad
|
| 13 |
+
|
| 14 |
+
|
| 15 |
+
class TestSphericalJn:
|
| 16 |
+
def test_spherical_jn_exact(self):
|
| 17 |
+
# https://dlmf.nist.gov/10.49.E3
|
| 18 |
+
# Note: exact expression is numerically stable only for small
|
| 19 |
+
# n or z >> n.
|
| 20 |
+
x = np.array([0.12, 1.23, 12.34, 123.45, 1234.5])
|
| 21 |
+
assert_allclose(spherical_jn(2, x),
|
| 22 |
+
(-1/x + 3/x**3)*sin(x) - 3/x**2*cos(x))
|
| 23 |
+
|
| 24 |
+
def test_spherical_jn_recurrence_complex(self):
|
| 25 |
+
# https://dlmf.nist.gov/10.51.E1
|
| 26 |
+
n = np.array([1, 2, 3, 7, 12])
|
| 27 |
+
x = 1.1 + 1.5j
|
| 28 |
+
assert_allclose(spherical_jn(n - 1, x) + spherical_jn(n + 1, x),
|
| 29 |
+
(2*n + 1)/x*spherical_jn(n, x))
|
| 30 |
+
|
| 31 |
+
def test_spherical_jn_recurrence_real(self):
|
| 32 |
+
# https://dlmf.nist.gov/10.51.E1
|
| 33 |
+
n = np.array([1, 2, 3, 7, 12])
|
| 34 |
+
x = 0.12
|
| 35 |
+
assert_allclose(spherical_jn(n - 1, x) + spherical_jn(n + 1,x),
|
| 36 |
+
(2*n + 1)/x*spherical_jn(n, x))
|
| 37 |
+
|
| 38 |
+
def test_spherical_jn_inf_real(self):
|
| 39 |
+
# https://dlmf.nist.gov/10.52.E3
|
| 40 |
+
n = 6
|
| 41 |
+
x = np.array([-inf, inf])
|
| 42 |
+
assert_allclose(spherical_jn(n, x), np.array([0, 0]))
|
| 43 |
+
|
| 44 |
+
def test_spherical_jn_inf_complex(self):
|
| 45 |
+
# https://dlmf.nist.gov/10.52.E3
|
| 46 |
+
n = 7
|
| 47 |
+
x = np.array([-inf + 0j, inf + 0j, inf*(1+1j)])
|
| 48 |
+
with warnings.catch_warnings():
|
| 49 |
+
warnings.filterwarnings(
|
| 50 |
+
"ignore", "invalid value encountered in multiply", RuntimeWarning)
|
| 51 |
+
assert_allclose(spherical_jn(n, x), np.array([0, 0, inf*(1+1j)]))
|
| 52 |
+
|
| 53 |
+
def test_spherical_jn_large_arg_1(self):
|
| 54 |
+
# https://github.com/scipy/scipy/issues/2165
|
| 55 |
+
# Reference value computed using mpmath, via
|
| 56 |
+
# besselj(n + mpf(1)/2, z)*sqrt(pi/(2*z))
|
| 57 |
+
assert_allclose(spherical_jn(2, 3350.507), -0.00029846226538040747)
|
| 58 |
+
|
| 59 |
+
def test_spherical_jn_large_arg_2(self):
|
| 60 |
+
# https://github.com/scipy/scipy/issues/1641
|
| 61 |
+
# Reference value computed using mpmath, via
|
| 62 |
+
# besselj(n + mpf(1)/2, z)*sqrt(pi/(2*z))
|
| 63 |
+
assert_allclose(spherical_jn(2, 10000), 3.0590002633029811e-05)
|
| 64 |
+
|
| 65 |
+
def test_spherical_jn_at_zero(self):
|
| 66 |
+
# https://dlmf.nist.gov/10.52.E1
|
| 67 |
+
# But note that n = 0 is a special case: j0 = sin(x)/x -> 1
|
| 68 |
+
n = np.array([0, 1, 2, 5, 10, 100])
|
| 69 |
+
x = 0
|
| 70 |
+
assert_allclose(spherical_jn(n, x), np.array([1, 0, 0, 0, 0, 0]))
|
| 71 |
+
|
| 72 |
+
|
| 73 |
+
class TestSphericalYn:
|
| 74 |
+
def test_spherical_yn_exact(self):
|
| 75 |
+
# https://dlmf.nist.gov/10.49.E5
|
| 76 |
+
# Note: exact expression is numerically stable only for small
|
| 77 |
+
# n or z >> n.
|
| 78 |
+
x = np.array([0.12, 1.23, 12.34, 123.45, 1234.5])
|
| 79 |
+
assert_allclose(spherical_yn(2, x),
|
| 80 |
+
(1/x - 3/x**3)*cos(x) - 3/x**2*sin(x))
|
| 81 |
+
|
| 82 |
+
def test_spherical_yn_recurrence_real(self):
|
| 83 |
+
# https://dlmf.nist.gov/10.51.E1
|
| 84 |
+
n = np.array([1, 2, 3, 7, 12])
|
| 85 |
+
x = 0.12
|
| 86 |
+
assert_allclose(spherical_yn(n - 1, x) + spherical_yn(n + 1,x),
|
| 87 |
+
(2*n + 1)/x*spherical_yn(n, x))
|
| 88 |
+
|
| 89 |
+
def test_spherical_yn_recurrence_complex(self):
|
| 90 |
+
# https://dlmf.nist.gov/10.51.E1
|
| 91 |
+
n = np.array([1, 2, 3, 7, 12])
|
| 92 |
+
x = 1.1 + 1.5j
|
| 93 |
+
assert_allclose(spherical_yn(n - 1, x) + spherical_yn(n + 1, x),
|
| 94 |
+
(2*n + 1)/x*spherical_yn(n, x))
|
| 95 |
+
|
| 96 |
+
def test_spherical_yn_inf_real(self):
|
| 97 |
+
# https://dlmf.nist.gov/10.52.E3
|
| 98 |
+
n = 6
|
| 99 |
+
x = np.array([-inf, inf])
|
| 100 |
+
assert_allclose(spherical_yn(n, x), np.array([0, 0]))
|
| 101 |
+
|
| 102 |
+
def test_spherical_yn_inf_complex(self):
|
| 103 |
+
# https://dlmf.nist.gov/10.52.E3
|
| 104 |
+
n = 7
|
| 105 |
+
x = np.array([-inf + 0j, inf + 0j, inf*(1+1j)])
|
| 106 |
+
with warnings.catch_warnings():
|
| 107 |
+
warnings.filterwarnings(
|
| 108 |
+
"ignore", "invalid value encountered in multiply", RuntimeWarning)
|
| 109 |
+
assert_allclose(spherical_yn(n, x), np.array([0, 0, inf*(1+1j)]))
|
| 110 |
+
|
| 111 |
+
def test_spherical_yn_at_zero(self):
|
| 112 |
+
# https://dlmf.nist.gov/10.52.E2
|
| 113 |
+
n = np.array([0, 1, 2, 5, 10, 100])
|
| 114 |
+
x = 0
|
| 115 |
+
assert_allclose(spherical_yn(n, x), np.full(n.shape, -inf))
|
| 116 |
+
|
| 117 |
+
def test_spherical_yn_at_zero_complex(self):
|
| 118 |
+
# Consistently with numpy:
|
| 119 |
+
# >>> -np.cos(0)/0
|
| 120 |
+
# -inf
|
| 121 |
+
# >>> -np.cos(0+0j)/(0+0j)
|
| 122 |
+
# (-inf + nan*j)
|
| 123 |
+
n = np.array([0, 1, 2, 5, 10, 100])
|
| 124 |
+
x = 0 + 0j
|
| 125 |
+
assert_allclose(spherical_yn(n, x), np.full(n.shape, nan))
|
| 126 |
+
|
| 127 |
+
|
| 128 |
+
class TestSphericalJnYnCrossProduct:
|
| 129 |
+
def test_spherical_jn_yn_cross_product_1(self):
|
| 130 |
+
# https://dlmf.nist.gov/10.50.E3
|
| 131 |
+
n = np.array([1, 5, 8])
|
| 132 |
+
x = np.array([0.1, 1, 10])
|
| 133 |
+
left = (spherical_jn(n + 1, x) * spherical_yn(n, x) -
|
| 134 |
+
spherical_jn(n, x) * spherical_yn(n + 1, x))
|
| 135 |
+
right = 1/x**2
|
| 136 |
+
assert_allclose(left, right)
|
| 137 |
+
|
| 138 |
+
def test_spherical_jn_yn_cross_product_2(self):
|
| 139 |
+
# https://dlmf.nist.gov/10.50.E3
|
| 140 |
+
n = np.array([1, 5, 8])
|
| 141 |
+
x = np.array([0.1, 1, 10])
|
| 142 |
+
left = (spherical_jn(n + 2, x) * spherical_yn(n, x) -
|
| 143 |
+
spherical_jn(n, x) * spherical_yn(n + 2, x))
|
| 144 |
+
right = (2*n + 3)/x**3
|
| 145 |
+
assert_allclose(left, right)
|
| 146 |
+
|
| 147 |
+
|
| 148 |
+
class TestSphericalIn:
|
| 149 |
+
def test_spherical_in_exact(self):
|
| 150 |
+
# https://dlmf.nist.gov/10.49.E9
|
| 151 |
+
x = np.array([0.12, 1.23, 12.34, 123.45])
|
| 152 |
+
assert_allclose(spherical_in(2, x),
|
| 153 |
+
(1/x + 3/x**3)*sinh(x) - 3/x**2*cosh(x))
|
| 154 |
+
|
| 155 |
+
def test_spherical_in_recurrence_real(self):
|
| 156 |
+
# https://dlmf.nist.gov/10.51.E4
|
| 157 |
+
n = np.array([1, 2, 3, 7, 12])
|
| 158 |
+
x = 0.12
|
| 159 |
+
assert_allclose(spherical_in(n - 1, x) - spherical_in(n + 1,x),
|
| 160 |
+
(2*n + 1)/x*spherical_in(n, x))
|
| 161 |
+
|
| 162 |
+
def test_spherical_in_recurrence_complex(self):
|
| 163 |
+
# https://dlmf.nist.gov/10.51.E1
|
| 164 |
+
n = np.array([1, 2, 3, 7, 12])
|
| 165 |
+
x = 1.1 + 1.5j
|
| 166 |
+
assert_allclose(spherical_in(n - 1, x) - spherical_in(n + 1,x),
|
| 167 |
+
(2*n + 1)/x*spherical_in(n, x))
|
| 168 |
+
|
| 169 |
+
def test_spherical_in_inf_real(self):
|
| 170 |
+
# https://dlmf.nist.gov/10.52.E3
|
| 171 |
+
n = 5
|
| 172 |
+
x = np.array([-inf, inf])
|
| 173 |
+
assert_allclose(spherical_in(n, x), np.array([-inf, inf]))
|
| 174 |
+
|
| 175 |
+
def test_spherical_in_inf_complex(self):
|
| 176 |
+
# https://dlmf.nist.gov/10.52.E5
|
| 177 |
+
# Ideally, i1n(n, 1j*inf) = 0 and i1n(n, (1+1j)*inf) = (1+1j)*inf, but
|
| 178 |
+
# this appears impossible to achieve because C99 regards any complex
|
| 179 |
+
# value with at least one infinite part as a complex infinity, so
|
| 180 |
+
# 1j*inf cannot be distinguished from (1+1j)*inf. Therefore, nan is
|
| 181 |
+
# the correct return value.
|
| 182 |
+
n = 7
|
| 183 |
+
x = np.array([-inf + 0j, inf + 0j, inf*(1+1j)])
|
| 184 |
+
assert_allclose(spherical_in(n, x), np.array([-inf, inf, nan]))
|
| 185 |
+
|
| 186 |
+
def test_spherical_in_at_zero(self):
|
| 187 |
+
# https://dlmf.nist.gov/10.52.E1
|
| 188 |
+
# But note that n = 0 is a special case: i0 = sinh(x)/x -> 1
|
| 189 |
+
n = np.array([0, 1, 2, 5, 10, 100])
|
| 190 |
+
x = 0
|
| 191 |
+
assert_allclose(spherical_in(n, x), np.array([1, 0, 0, 0, 0, 0]))
|
| 192 |
+
|
| 193 |
+
|
| 194 |
+
class TestSphericalKn:
|
| 195 |
+
def test_spherical_kn_exact(self):
|
| 196 |
+
# https://dlmf.nist.gov/10.49.E13
|
| 197 |
+
x = np.array([0.12, 1.23, 12.34, 123.45])
|
| 198 |
+
assert_allclose(spherical_kn(2, x),
|
| 199 |
+
pi/2*exp(-x)*(1/x + 3/x**2 + 3/x**3))
|
| 200 |
+
|
| 201 |
+
def test_spherical_kn_recurrence_real(self):
|
| 202 |
+
# https://dlmf.nist.gov/10.51.E4
|
| 203 |
+
n = np.array([1, 2, 3, 7, 12])
|
| 204 |
+
x = 0.12
|
| 205 |
+
assert_allclose(
|
| 206 |
+
(-1)**(n - 1)*spherical_kn(n - 1, x) - (-1)**(n + 1)*spherical_kn(n + 1,x),
|
| 207 |
+
(-1)**n*(2*n + 1)/x*spherical_kn(n, x)
|
| 208 |
+
)
|
| 209 |
+
|
| 210 |
+
def test_spherical_kn_recurrence_complex(self):
|
| 211 |
+
# https://dlmf.nist.gov/10.51.E4
|
| 212 |
+
n = np.array([1, 2, 3, 7, 12])
|
| 213 |
+
x = 1.1 + 1.5j
|
| 214 |
+
assert_allclose(
|
| 215 |
+
(-1)**(n - 1)*spherical_kn(n - 1, x) - (-1)**(n + 1)*spherical_kn(n + 1,x),
|
| 216 |
+
(-1)**n*(2*n + 1)/x*spherical_kn(n, x)
|
| 217 |
+
)
|
| 218 |
+
|
| 219 |
+
def test_spherical_kn_inf_real(self):
|
| 220 |
+
# https://dlmf.nist.gov/10.52.E6
|
| 221 |
+
n = 5
|
| 222 |
+
x = np.array([-inf, inf])
|
| 223 |
+
assert_allclose(spherical_kn(n, x), np.array([-inf, 0]))
|
| 224 |
+
|
| 225 |
+
def test_spherical_kn_inf_complex(self):
|
| 226 |
+
# https://dlmf.nist.gov/10.52.E6
|
| 227 |
+
# The behavior at complex infinity depends on the sign of the real
|
| 228 |
+
# part: if Re(z) >= 0, then the limit is 0; if Re(z) < 0, then it's
|
| 229 |
+
# z*inf. This distinction cannot be captured, so we return nan.
|
| 230 |
+
n = 7
|
| 231 |
+
x = np.array([-inf + 0j, inf + 0j, inf*(1+1j)])
|
| 232 |
+
assert_allclose(spherical_kn(n, x), np.array([-inf, 0, nan]))
|
| 233 |
+
|
| 234 |
+
def test_spherical_kn_at_zero(self):
|
| 235 |
+
# https://dlmf.nist.gov/10.52.E2
|
| 236 |
+
n = np.array([0, 1, 2, 5, 10, 100])
|
| 237 |
+
x = 0
|
| 238 |
+
assert_allclose(spherical_kn(n, x), np.full(n.shape, inf))
|
| 239 |
+
|
| 240 |
+
def test_spherical_kn_at_zero_complex(self):
|
| 241 |
+
# https://dlmf.nist.gov/10.52.E2
|
| 242 |
+
n = np.array([0, 1, 2, 5, 10, 100])
|
| 243 |
+
x = 0 + 0j
|
| 244 |
+
assert_allclose(spherical_kn(n, x), np.full(n.shape, nan))
|
| 245 |
+
|
| 246 |
+
|
| 247 |
+
class SphericalDerivativesTestCase:
|
| 248 |
+
def fundamental_theorem(self, n, a, b):
|
| 249 |
+
integral, tolerance = quad(lambda z: self.df(n, z), a, b)
|
| 250 |
+
assert_allclose(integral,
|
| 251 |
+
self.f(n, b) - self.f(n, a),
|
| 252 |
+
atol=tolerance)
|
| 253 |
+
|
| 254 |
+
@pytest.mark.slow
|
| 255 |
+
def test_fundamental_theorem_0(self):
|
| 256 |
+
self.fundamental_theorem(0, 3.0, 15.0)
|
| 257 |
+
|
| 258 |
+
@pytest.mark.slow
|
| 259 |
+
def test_fundamental_theorem_7(self):
|
| 260 |
+
self.fundamental_theorem(7, 0.5, 1.2)
|
| 261 |
+
|
| 262 |
+
|
| 263 |
+
class TestSphericalJnDerivatives(SphericalDerivativesTestCase):
|
| 264 |
+
def f(self, n, z):
|
| 265 |
+
return spherical_jn(n, z)
|
| 266 |
+
|
| 267 |
+
def df(self, n, z):
|
| 268 |
+
return spherical_jn(n, z, derivative=True)
|
| 269 |
+
|
| 270 |
+
def test_spherical_jn_d_zero(self):
|
| 271 |
+
n = np.array([0, 1, 2, 3, 7, 15])
|
| 272 |
+
assert_allclose(spherical_jn(n, 0, derivative=True),
|
| 273 |
+
np.array([0, 1/3, 0, 0, 0, 0]))
|
| 274 |
+
|
| 275 |
+
|
| 276 |
+
class TestSphericalYnDerivatives(SphericalDerivativesTestCase):
|
| 277 |
+
def f(self, n, z):
|
| 278 |
+
return spherical_yn(n, z)
|
| 279 |
+
|
| 280 |
+
def df(self, n, z):
|
| 281 |
+
return spherical_yn(n, z, derivative=True)
|
| 282 |
+
|
| 283 |
+
|
| 284 |
+
class TestSphericalInDerivatives(SphericalDerivativesTestCase):
|
| 285 |
+
def f(self, n, z):
|
| 286 |
+
return spherical_in(n, z)
|
| 287 |
+
|
| 288 |
+
def df(self, n, z):
|
| 289 |
+
return spherical_in(n, z, derivative=True)
|
| 290 |
+
|
| 291 |
+
def test_spherical_in_d_zero(self):
|
| 292 |
+
n = np.array([0, 1, 2, 3, 7, 15])
|
| 293 |
+
spherical_in(n, 0, derivative=False)
|
| 294 |
+
assert_allclose(spherical_in(n, 0, derivative=True),
|
| 295 |
+
np.array([0, 1/3, 0, 0, 0, 0]))
|
| 296 |
+
|
| 297 |
+
|
| 298 |
+
class TestSphericalKnDerivatives(SphericalDerivativesTestCase):
|
| 299 |
+
def f(self, n, z):
|
| 300 |
+
return spherical_kn(n, z)
|
| 301 |
+
|
| 302 |
+
def df(self, n, z):
|
| 303 |
+
return spherical_kn(n, z, derivative=True)
|
| 304 |
+
|
| 305 |
+
|
| 306 |
+
class TestSphericalOld:
|
| 307 |
+
# These are tests from the TestSpherical class of test_basic.py,
|
| 308 |
+
# rewritten to use spherical_* instead of sph_* but otherwise unchanged.
|
| 309 |
+
|
| 310 |
+
def test_sph_in(self):
|
| 311 |
+
# This test reproduces test_basic.TestSpherical.test_sph_in.
|
| 312 |
+
i1n = np.empty((2,2))
|
| 313 |
+
x = 0.2
|
| 314 |
+
|
| 315 |
+
i1n[0][0] = spherical_in(0, x)
|
| 316 |
+
i1n[0][1] = spherical_in(1, x)
|
| 317 |
+
i1n[1][0] = spherical_in(0, x, derivative=True)
|
| 318 |
+
i1n[1][1] = spherical_in(1, x, derivative=True)
|
| 319 |
+
|
| 320 |
+
inp0 = (i1n[0][1])
|
| 321 |
+
inp1 = (i1n[0][0] - 2.0/0.2 * i1n[0][1])
|
| 322 |
+
assert_allclose(i1n[0], np.array([1.0066800127054699381,
|
| 323 |
+
0.066933714568029540839]),
|
| 324 |
+
atol=1.5e-12, rtol=0.0)
|
| 325 |
+
assert_allclose(i1n[1], [inp0, inp1], atol=1.5e-12, rtol=0)
|
| 326 |
+
|
| 327 |
+
def test_sph_in_kn_order0(self):
|
| 328 |
+
x = 1.
|
| 329 |
+
sph_i0 = np.empty((2,))
|
| 330 |
+
sph_i0[0] = spherical_in(0, x)
|
| 331 |
+
sph_i0[1] = spherical_in(0, x, derivative=True)
|
| 332 |
+
sph_i0_expected = np.array([np.sinh(x)/x,
|
| 333 |
+
np.cosh(x)/x-np.sinh(x)/x**2])
|
| 334 |
+
assert_allclose(r_[sph_i0], sph_i0_expected, atol=1.5e-7, rtol=0)
|
| 335 |
+
|
| 336 |
+
sph_k0 = np.empty((2,))
|
| 337 |
+
sph_k0[0] = spherical_kn(0, x)
|
| 338 |
+
sph_k0[1] = spherical_kn(0, x, derivative=True)
|
| 339 |
+
sph_k0_expected = np.array([0.5*pi*exp(-x)/x,
|
| 340 |
+
-0.5*pi*exp(-x)*(1/x+1/x**2)])
|
| 341 |
+
assert_allclose(r_[sph_k0], sph_k0_expected, atol=1.5e-7, rtol=0)
|
| 342 |
+
|
| 343 |
+
def test_sph_jn(self):
|
| 344 |
+
s1 = np.empty((2,3))
|
| 345 |
+
x = 0.2
|
| 346 |
+
|
| 347 |
+
s1[0][0] = spherical_jn(0, x)
|
| 348 |
+
s1[0][1] = spherical_jn(1, x)
|
| 349 |
+
s1[0][2] = spherical_jn(2, x)
|
| 350 |
+
s1[1][0] = spherical_jn(0, x, derivative=True)
|
| 351 |
+
s1[1][1] = spherical_jn(1, x, derivative=True)
|
| 352 |
+
s1[1][2] = spherical_jn(2, x, derivative=True)
|
| 353 |
+
|
| 354 |
+
s10 = -s1[0][1]
|
| 355 |
+
s11 = s1[0][0]-2.0/0.2*s1[0][1]
|
| 356 |
+
s12 = s1[0][1]-3.0/0.2*s1[0][2]
|
| 357 |
+
assert_allclose(s1[0], [0.99334665397530607731,
|
| 358 |
+
0.066400380670322230863,
|
| 359 |
+
0.0026590560795273856680],
|
| 360 |
+
atol=1.5e-12, rtol=0)
|
| 361 |
+
assert_allclose(s1[1], [s10, s11, s12], atol=1.5e-12, rtol=0)
|
| 362 |
+
|
| 363 |
+
def test_sph_kn(self):
|
| 364 |
+
kn = np.empty((2,3))
|
| 365 |
+
x = 0.2
|
| 366 |
+
|
| 367 |
+
kn[0][0] = spherical_kn(0, x)
|
| 368 |
+
kn[0][1] = spherical_kn(1, x)
|
| 369 |
+
kn[0][2] = spherical_kn(2, x)
|
| 370 |
+
kn[1][0] = spherical_kn(0, x, derivative=True)
|
| 371 |
+
kn[1][1] = spherical_kn(1, x, derivative=True)
|
| 372 |
+
kn[1][2] = spherical_kn(2, x, derivative=True)
|
| 373 |
+
|
| 374 |
+
kn0 = -kn[0][1]
|
| 375 |
+
kn1 = -kn[0][0]-2.0/0.2*kn[0][1]
|
| 376 |
+
kn2 = -kn[0][1]-3.0/0.2*kn[0][2]
|
| 377 |
+
assert_allclose(kn[0], [6.4302962978445670140,
|
| 378 |
+
38.581777787067402086,
|
| 379 |
+
585.15696310385559829],
|
| 380 |
+
atol=1.5e-12, rtol=0)
|
| 381 |
+
assert_allclose(kn[1], [kn0, kn1, kn2], atol=1.5e-9, rtol=0)
|
| 382 |
+
|
| 383 |
+
def test_sph_yn(self):
|
| 384 |
+
sy1 = spherical_yn(2, 0.2)
|
| 385 |
+
sy2 = spherical_yn(0, 0.2)
|
| 386 |
+
# previous values in the system
|
| 387 |
+
assert_allclose(sy1, -377.52483, atol=1.5e-5, rtol=0)
|
| 388 |
+
assert_allclose(sy2, -4.9003329, atol=1.5e-5, rtol=0)
|
| 389 |
+
sphpy = (spherical_yn(0, 0.2) - 2*spherical_yn(2, 0.2))/3
|
| 390 |
+
sy3 = spherical_yn(1, 0.2, derivative=True)
|
| 391 |
+
# compare correct derivative val. (correct =-system val).
|
| 392 |
+
assert_allclose(sy3, sphpy, atol=1.5e-4, rtol=0)
|
| 393 |
+
|
| 394 |
+
|
| 395 |
+
@pytest.mark.parametrize('derivative', [False, True])
|
| 396 |
+
@pytest.mark.parametrize('fun', [spherical_jn, spherical_in,
|
| 397 |
+
spherical_yn, spherical_kn])
|
| 398 |
+
def test_negative_real_gh14582(derivative, fun):
|
| 399 |
+
# gh-14582 reported that the spherical Bessel functions did not work
|
| 400 |
+
# with negative real argument `z`. Check that this is resolved.
|
| 401 |
+
rng = np.random.default_rng(3598435982345987234)
|
| 402 |
+
size = 25
|
| 403 |
+
n = rng.integers(0, 10, size=size)
|
| 404 |
+
z = rng.standard_normal(size=size)
|
| 405 |
+
res = fun(n, z, derivative=derivative)
|
| 406 |
+
ref = fun(n, z+0j, derivative=derivative)
|
| 407 |
+
assert_allclose(res, ref.real)
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_support_alternative_backends.py
ADDED
|
@@ -0,0 +1,402 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from functools import partial
|
| 2 |
+
import pickle
|
| 3 |
+
|
| 4 |
+
import pytest
|
| 5 |
+
from hypothesis import given, strategies
|
| 6 |
+
import hypothesis.extra.numpy as npst
|
| 7 |
+
from packaging import version
|
| 8 |
+
|
| 9 |
+
from scipy import special
|
| 10 |
+
from scipy.special._support_alternative_backends import _special_funcs
|
| 11 |
+
from scipy._lib._array_api_no_0d import xp_assert_close
|
| 12 |
+
from scipy._lib._array_api import (is_cupy, is_dask, is_jax, is_torch,
|
| 13 |
+
make_xp_pytest_param, make_xp_test_case,
|
| 14 |
+
get_native_namespace_name)
|
| 15 |
+
from scipy._lib.array_api_compat import numpy as np
|
| 16 |
+
import scipy._lib.array_api_extra as xpx
|
| 17 |
+
|
| 18 |
+
|
| 19 |
+
# Run all tests in this module in the Array API CI, including those without
|
| 20 |
+
# the xp fixture
|
| 21 |
+
pytestmark = pytest.mark.array_api_backends
|
| 22 |
+
|
| 23 |
+
lazy_xp_modules = [special]
|
| 24 |
+
|
| 25 |
+
|
| 26 |
+
def _skip_or_tweak_alternative_backends(xp, nfo, dtypes, int_only):
|
| 27 |
+
"""Skip tests for specific intersections of scipy.special functions
|
| 28 |
+
vs. backends vs. dtypes vs. devices.
|
| 29 |
+
Also suggest bespoke tweaks.
|
| 30 |
+
|
| 31 |
+
Returns
|
| 32 |
+
-------
|
| 33 |
+
positive_only : list[bool]
|
| 34 |
+
Whether you should exclusively test positive inputs.
|
| 35 |
+
dtypes : list[str]
|
| 36 |
+
dtype strings 'float64', 'int32', 'int64', etc. with integer types
|
| 37 |
+
mapped to the type of the NumPy default int.
|
| 38 |
+
"""
|
| 39 |
+
f_name = nfo.name
|
| 40 |
+
if isinstance(nfo.positive_only, dict):
|
| 41 |
+
positive_only = nfo.positive_only.get(get_native_namespace_name(xp), False)
|
| 42 |
+
else:
|
| 43 |
+
positive_only = nfo.positive_only
|
| 44 |
+
if isinstance(positive_only, bool):
|
| 45 |
+
positive_only = [positive_only]*nfo.n_args
|
| 46 |
+
|
| 47 |
+
dtypes = [np.intp.__name__ if dtype == "intp" else dtype for dtype in dtypes]
|
| 48 |
+
|
| 49 |
+
if f_name in {'betaincinv'} and is_cupy(xp):
|
| 50 |
+
pytest.xfail("CuPy uses different convention for out of domain input.")
|
| 51 |
+
|
| 52 |
+
if (
|
| 53 |
+
f_name == "sinc" and "float32" in dtypes
|
| 54 |
+
and version.parse(np.__version__) < version.parse("2")
|
| 55 |
+
):
|
| 56 |
+
pytest.xfail("https://github.com/numpy/numpy/issues/11204")
|
| 57 |
+
|
| 58 |
+
if not any('int' in dtype for dtype in dtypes):
|
| 59 |
+
return positive_only, dtypes
|
| 60 |
+
|
| 61 |
+
# Integer-specific issues from this point onwards
|
| 62 |
+
|
| 63 |
+
if f_name in {'gamma', 'gammasgn'} and is_cupy(xp):
|
| 64 |
+
# CuPy has not yet updated gamma pole behavior to match
|
| 65 |
+
# https://github.com/scipy/scipy/pull/21827.
|
| 66 |
+
positive_only = [True]
|
| 67 |
+
|
| 68 |
+
if f_name in {'poch'} and is_jax(xp):
|
| 69 |
+
# Jax uses a different convention at gamma poles.
|
| 70 |
+
positive_only = [True, True]
|
| 71 |
+
|
| 72 |
+
if f_name == 'multigammaln':
|
| 73 |
+
pytest.skip("multigammaln raises for out of domain inputs.")
|
| 74 |
+
|
| 75 |
+
if ((is_torch(xp) and f_name in {'gammainc', 'gammaincc'})
|
| 76 |
+
or (is_cupy(xp) and f_name in {'stdtr', 'i0e', 'i1e'})
|
| 77 |
+
or (is_jax(xp) and f_name in {'stdtr', 'ndtr', 'ndtri', 'log_ndtr', 'hyp1f1',
|
| 78 |
+
'hyp2f1', 'spence', 'kl_div'})
|
| 79 |
+
):
|
| 80 |
+
pytest.skip(f"`{f_name}` does not support integer types")
|
| 81 |
+
|
| 82 |
+
# int/float mismatched args support is sketchy
|
| 83 |
+
if (any('float' in dtype for dtype in dtypes)
|
| 84 |
+
and ((is_torch(xp) and f_name in ('rel_entr', 'xlogy', 'polygamma',
|
| 85 |
+
'zeta', 'xlog1py'))
|
| 86 |
+
or (is_jax(xp) and f_name in ('gammainc', 'gammaincc', 'expn',
|
| 87 |
+
'rel_entr', 'xlogy', 'betaln',
|
| 88 |
+
'polygamma', 'zeta', 'poch',
|
| 89 |
+
'xlog1py')))
|
| 90 |
+
):
|
| 91 |
+
pytest.xfail("dtypes do not match")
|
| 92 |
+
|
| 93 |
+
if (is_torch(xp) and xpx.default_dtype(xp) == xp.float32):
|
| 94 |
+
# On PyTorch with float32 default dtype, all ints are promoted
|
| 95 |
+
# to float32, but when falling back to NumPy/SciPy int64 is promoted
|
| 96 |
+
# instead to float64. Integer only parameters essentially do not
|
| 97 |
+
# participate in determination of the result type in PyTorch with
|
| 98 |
+
# float32 default dtype, but will impact the output dtype as if
|
| 99 |
+
# they were float64 when falling back to NumPy/SciPy.
|
| 100 |
+
if not nfo.torch_native:
|
| 101 |
+
pytest.xfail("dtypes do not match")
|
| 102 |
+
|
| 103 |
+
return positive_only, dtypes
|
| 104 |
+
|
| 105 |
+
|
| 106 |
+
@pytest.mark.filterwarnings("ignore:invalid value encountered:RuntimeWarning:dask")
|
| 107 |
+
@pytest.mark.filterwarnings("ignore:overflow encountered:RuntimeWarning")
|
| 108 |
+
@pytest.mark.parametrize('shapes', [[(0,)]*4, [tuple()]*4, [(10,)]*4,
|
| 109 |
+
[(10,), (11, 1), (12, 1, 1), (13, 1, 1, 1)]])
|
| 110 |
+
@pytest.mark.parametrize('base_dtype', ['float32', 'float64', 'intp'])
|
| 111 |
+
@pytest.mark.parametrize(
|
| 112 |
+
'func,nfo', [make_xp_pytest_param(i.wrapper, i) for i in _special_funcs])
|
| 113 |
+
def test_support_alternative_backends(xp, func, nfo, base_dtype, shapes):
|
| 114 |
+
int_only = nfo.int_only
|
| 115 |
+
if int_only is None:
|
| 116 |
+
int_only = (False, ) * nfo.n_args
|
| 117 |
+
dtypes = (base_dtype, ) * nfo.n_args
|
| 118 |
+
else:
|
| 119 |
+
dtypes = tuple(
|
| 120 |
+
'intp' if needs_int else base_dtype for needs_int in int_only
|
| 121 |
+
)
|
| 122 |
+
|
| 123 |
+
positive_only, dtypes = _skip_or_tweak_alternative_backends(
|
| 124 |
+
xp, nfo, dtypes, int_only
|
| 125 |
+
)
|
| 126 |
+
|
| 127 |
+
dtypes_np = [getattr(np, dtype) for dtype in dtypes]
|
| 128 |
+
dtypes_xp = [getattr(xp, dtype) for dtype in dtypes]
|
| 129 |
+
|
| 130 |
+
shapes = shapes[:nfo.n_args]
|
| 131 |
+
rng = np.random.default_rng(984254252920492019)
|
| 132 |
+
args_np = []
|
| 133 |
+
|
| 134 |
+
# Handle cases where there's an argument which only takes scalar values.
|
| 135 |
+
python_int_only = nfo.python_int_only
|
| 136 |
+
if isinstance(python_int_only, dict):
|
| 137 |
+
python_int_only = python_int_only.get(get_native_namespace_name(xp))
|
| 138 |
+
scalar_or_0d_only = nfo.scalar_or_0d_only
|
| 139 |
+
if isinstance(scalar_or_0d_only, dict):
|
| 140 |
+
scalar_or_0d_only = scalar_or_0d_only.get(get_native_namespace_name(xp))
|
| 141 |
+
|
| 142 |
+
test_large_ints = nfo.test_large_ints
|
| 143 |
+
if isinstance(nfo.test_large_ints, dict):
|
| 144 |
+
test_large_ints = test_large_ints.get(get_native_namespace_name(xp), False)
|
| 145 |
+
|
| 146 |
+
if python_int_only is None:
|
| 147 |
+
python_int_only = [False] * nfo.n_args
|
| 148 |
+
if scalar_or_0d_only is None:
|
| 149 |
+
scalar_or_0d_only = [False] * nfo.n_args
|
| 150 |
+
|
| 151 |
+
no_shape = [
|
| 152 |
+
cond1 or cond2 for cond1, cond2 in zip(python_int_only, scalar_or_0d_only)
|
| 153 |
+
]
|
| 154 |
+
|
| 155 |
+
shapes = [shape if not cond else None for shape, cond in zip(shapes, no_shape)]
|
| 156 |
+
|
| 157 |
+
for dtype, dtype_np, shape, needs_python_int in zip(
|
| 158 |
+
dtypes, dtypes_np, shapes, python_int_only
|
| 159 |
+
):
|
| 160 |
+
if 'int' in dtype and test_large_ints:
|
| 161 |
+
iinfo = np.iinfo(dtype_np)
|
| 162 |
+
rand = partial(rng.integers, iinfo.min, iinfo.max + 1)
|
| 163 |
+
elif 'int' in dtype:
|
| 164 |
+
rand = partial(rng.integers, -20, 21)
|
| 165 |
+
else:
|
| 166 |
+
rand = rng.standard_normal
|
| 167 |
+
val = rand(size=shape, dtype=dtype_np)
|
| 168 |
+
if needs_python_int:
|
| 169 |
+
# The logic above for determining shapes guarantees that
|
| 170 |
+
# shape will be None in the above line when a Python int is required,
|
| 171 |
+
# so this can safely be converted to an int.
|
| 172 |
+
val = int(val)
|
| 173 |
+
args_np.append(val)
|
| 174 |
+
|
| 175 |
+
args_np = [
|
| 176 |
+
np.abs(arg) if cond else arg for arg, cond in zip(args_np, positive_only)
|
| 177 |
+
]
|
| 178 |
+
|
| 179 |
+
args_xp = [
|
| 180 |
+
xp.asarray(arg, dtype=dtype_xp) if not needs_python_int
|
| 181 |
+
else arg
|
| 182 |
+
for arg, dtype_xp, needs_python_int
|
| 183 |
+
in zip(args_np, dtypes_xp, python_int_only)
|
| 184 |
+
]
|
| 185 |
+
|
| 186 |
+
args_np = [
|
| 187 |
+
np.asarray(arg, dtype=dtype_np) if not needs_python_int
|
| 188 |
+
else arg
|
| 189 |
+
for arg, dtype_np, needs_python_int
|
| 190 |
+
in zip(args_np, dtypes_np, python_int_only)
|
| 191 |
+
]
|
| 192 |
+
|
| 193 |
+
if is_dask(xp):
|
| 194 |
+
# We're using map_blocks to dispatch the function to Dask.
|
| 195 |
+
# This is the correct thing to do IF all tested functions are elementwise;
|
| 196 |
+
# otherwise the output would change depending on chunking.
|
| 197 |
+
# Try to trigger bugs related to having multiple chunks.
|
| 198 |
+
args_xp = [arg.rechunk(5) for arg in args_xp]
|
| 199 |
+
|
| 200 |
+
res = nfo.wrapper(*args_xp) # Also wrapped by lazy_xp_function
|
| 201 |
+
ref = nfo.func(*args_np) # Unwrapped ufunc
|
| 202 |
+
if (
|
| 203 |
+
is_torch(xp)
|
| 204 |
+
and xpx.default_dtype(xp) == xp.float32
|
| 205 |
+
and "float64" not in dtypes
|
| 206 |
+
):
|
| 207 |
+
# int64 promotes like float32 on torch with default dtype = float32
|
| 208 |
+
# cast reference if needed
|
| 209 |
+
ref = np.float32(ref)
|
| 210 |
+
# When dtype_np is integer, the output dtype can be float
|
| 211 |
+
atol = 0 if ref.dtype.kind in 'iu' else 10 * np.finfo(ref.dtype).eps
|
| 212 |
+
rtol = None
|
| 213 |
+
if is_torch(xp) and func.__name__ == 'j1':
|
| 214 |
+
# If we end up needing more function/backend specific tolerance
|
| 215 |
+
# adjustments, this should be factored out properly.
|
| 216 |
+
atol = 1e-7
|
| 217 |
+
rtol = 1e-5
|
| 218 |
+
xp_assert_close(
|
| 219 |
+
res, xp.asarray(ref), rtol=rtol, atol=atol, check_0d=nfo.produces_0d
|
| 220 |
+
)
|
| 221 |
+
|
| 222 |
+
|
| 223 |
+
@pytest.mark.parametrize(
|
| 224 |
+
'func, nfo',
|
| 225 |
+
[make_xp_pytest_param(i.wrapper, i) for i in _special_funcs if i.n_args >= 2])
|
| 226 |
+
@pytest.mark.filterwarnings("ignore:invalid value encountered:RuntimeWarning:dask")
|
| 227 |
+
def test_support_alternative_backends_mismatched_dtypes(xp, func, nfo):
|
| 228 |
+
"""Test mix-n-match of int and float arguments"""
|
| 229 |
+
if func.__name__ in {'expn', 'polygamma', 'multigammaln', 'bdtr', 'bdtrc', 'bdtri',
|
| 230 |
+
'nbdtr', 'nbdtrc', 'nbdtri', 'pdtri'}:
|
| 231 |
+
pytest.skip(f"dtypes for {func.__name__} make it a bad fit for this test.")
|
| 232 |
+
dtypes = ['intp', 'float32', 'float64', 'float64'][:nfo.n_args]
|
| 233 |
+
|
| 234 |
+
positive_only, dtypes = _skip_or_tweak_alternative_backends(
|
| 235 |
+
xp, nfo, dtypes, (False,)*nfo.n_args
|
| 236 |
+
)
|
| 237 |
+
dtypes_np = [getattr(np, dtype) for dtype in dtypes]
|
| 238 |
+
dtypes_xp = [getattr(xp, dtype) for dtype in dtypes]
|
| 239 |
+
|
| 240 |
+
rng = np.random.default_rng(984254252920492019)
|
| 241 |
+
iinfo = np.iinfo(np.intp)
|
| 242 |
+
if nfo.test_large_ints:
|
| 243 |
+
randint = partial(rng.integers, iinfo.min, iinfo.max + 1)
|
| 244 |
+
else:
|
| 245 |
+
randint = partial(rng.integers, -20, 21)
|
| 246 |
+
args_np = [
|
| 247 |
+
randint(size=1, dtype=np.int64),
|
| 248 |
+
rng.standard_normal(size=1, dtype=np.float32),
|
| 249 |
+
rng.standard_normal(size=1, dtype=np.float64),
|
| 250 |
+
rng.standard_normal(size=1, dtype=np.float64),
|
| 251 |
+
][:nfo.n_args]
|
| 252 |
+
args_np = [
|
| 253 |
+
np.abs(arg) if cond else arg for arg, cond in zip(args_np, positive_only)
|
| 254 |
+
]
|
| 255 |
+
|
| 256 |
+
args_xp = [xp.asarray(arg, dtype=dtype_xp)
|
| 257 |
+
for arg, dtype_xp in zip(args_np, dtypes_xp)]
|
| 258 |
+
args_np = [np.asarray(arg, dtype=dtype_np)
|
| 259 |
+
for arg, dtype_np in zip(args_np, dtypes_np)]
|
| 260 |
+
|
| 261 |
+
res = nfo.wrapper(*args_xp) # Also wrapped by lazy_xp_function
|
| 262 |
+
ref = nfo.func(*args_np) # Unwrapped ufunc
|
| 263 |
+
if (
|
| 264 |
+
is_torch(xp)
|
| 265 |
+
and xpx.default_dtype(xp) == xp.float32
|
| 266 |
+
and "float64" not in dtypes
|
| 267 |
+
):
|
| 268 |
+
# int64 promotes like float32 on torch with default dtype = float32
|
| 269 |
+
# cast reference if needed
|
| 270 |
+
ref = np.float32(ref)
|
| 271 |
+
|
| 272 |
+
atol = 10 * np.finfo(ref.dtype).eps
|
| 273 |
+
xp_assert_close(res, xp.asarray(ref), atol=atol)
|
| 274 |
+
|
| 275 |
+
|
| 276 |
+
@pytest.mark.xslow
|
| 277 |
+
@given(data=strategies.data())
|
| 278 |
+
@pytest.mark.fail_slow(5)
|
| 279 |
+
@pytest.mark.parametrize(
|
| 280 |
+
'func,nfo', [make_xp_pytest_param(nfo.wrapper, nfo) for nfo in _special_funcs])
|
| 281 |
+
@pytest.mark.filterwarnings("ignore:invalid value encountered:RuntimeWarning:dask")
|
| 282 |
+
@pytest.mark.filterwarnings("ignore:divide by zero encountered:RuntimeWarning:dask")
|
| 283 |
+
@pytest.mark.filterwarnings("ignore:overflow encountered:RuntimeWarning:dask")
|
| 284 |
+
@pytest.mark.filterwarnings(
|
| 285 |
+
"ignore:overflow encountered:RuntimeWarning:array_api_strict"
|
| 286 |
+
)
|
| 287 |
+
def test_support_alternative_backends_hypothesis(xp, func, nfo, data):
|
| 288 |
+
if func.__name__ in {'expn', 'polygamma', 'multigammaln', 'bdtr', 'bdtrc', 'bdtri',
|
| 289 |
+
'nbdtr', 'nbdtrc', 'nbdtri', 'pdtri'}:
|
| 290 |
+
pytest.skip(f"dtypes for {func.__name__} make it a bad fit for this test.")
|
| 291 |
+
dtype = data.draw(strategies.sampled_from(['float32', 'float64', 'intp']))
|
| 292 |
+
positive_only, dtypes = _skip_or_tweak_alternative_backends(
|
| 293 |
+
xp, nfo, [dtype], (False,)*nfo.n_args
|
| 294 |
+
)
|
| 295 |
+
dtype_np = getattr(np, dtypes[0])
|
| 296 |
+
dtype_xp = getattr(xp, dtypes[0])
|
| 297 |
+
|
| 298 |
+
elements = {'allow_subnormal': False}
|
| 299 |
+
# Most failures are due to NaN or infinity; uncomment to suppress them
|
| 300 |
+
# elements['allow_infinity'] = False
|
| 301 |
+
# elements['allow_nan'] = False
|
| 302 |
+
if any(positive_only):
|
| 303 |
+
elements['min_value'] = 0
|
| 304 |
+
|
| 305 |
+
shapes, _ = data.draw(
|
| 306 |
+
npst.mutually_broadcastable_shapes(num_shapes=nfo.n_args))
|
| 307 |
+
args_np = [data.draw(npst.arrays(dtype_np, shape, elements=elements))
|
| 308 |
+
for shape in shapes]
|
| 309 |
+
|
| 310 |
+
args_xp = [xp.asarray(arg, dtype=dtype_xp) for arg in args_np]
|
| 311 |
+
args_np = [np.asarray(arg, dtype=dtype_np) for arg in args_np]
|
| 312 |
+
|
| 313 |
+
res = nfo.wrapper(*args_xp) # Also wrapped by lazy_xp_function
|
| 314 |
+
ref = nfo.func(*args_np) # Unwrapped ufunc
|
| 315 |
+
if (
|
| 316 |
+
is_torch(xp)
|
| 317 |
+
and xpx.default_dtype(xp) == xp.float32
|
| 318 |
+
and dtype != "float64"
|
| 319 |
+
):
|
| 320 |
+
# int64 promotes like float32 on torch with default dtype = float32
|
| 321 |
+
# cast reference if needed
|
| 322 |
+
ref = np.float32(ref)
|
| 323 |
+
|
| 324 |
+
# When dtype_np is integer, the output dtype can be float
|
| 325 |
+
atol = 0 if ref.dtype.kind in 'iu' else 10 * np.finfo(ref.dtype).eps
|
| 326 |
+
xp_assert_close(res, xp.asarray(ref), atol=atol)
|
| 327 |
+
|
| 328 |
+
|
| 329 |
+
@pytest.mark.filterwarnings("ignore:numpy.core is deprecated:DeprecationWarning")
|
| 330 |
+
@pytest.mark.parametrize("func", [nfo.wrapper for nfo in _special_funcs])
|
| 331 |
+
def test_pickle(func):
|
| 332 |
+
roundtrip = pickle.loads(pickle.dumps(func))
|
| 333 |
+
assert roundtrip is func
|
| 334 |
+
|
| 335 |
+
|
| 336 |
+
@pytest.mark.parametrize("func", [nfo.wrapper for nfo in _special_funcs])
|
| 337 |
+
def test_repr(func):
|
| 338 |
+
assert func.__name__ in repr(func)
|
| 339 |
+
assert "locals" not in repr(func)
|
| 340 |
+
|
| 341 |
+
|
| 342 |
+
@pytest.mark.skipif(
|
| 343 |
+
version.parse(np.__version__) < version.parse("2.2"),
|
| 344 |
+
reason="Can't update ufunc __doc__ when SciPy is compiled vs. NumPy < 2.2")
|
| 345 |
+
@pytest.mark.parametrize('func', [nfo.wrapper for nfo in _special_funcs])
|
| 346 |
+
def test_doc(func):
|
| 347 |
+
"""xp_capabilities updates the docstring in place.
|
| 348 |
+
Make sure it does so exactly once, including when SCIPY_ARRAY_API is not set.
|
| 349 |
+
"""
|
| 350 |
+
match = "has experimental support for Python Array API"
|
| 351 |
+
assert func.__doc__.count(match) == 1
|
| 352 |
+
|
| 353 |
+
|
| 354 |
+
@pytest.mark.parametrize(
|
| 355 |
+
'func,n_args,int_only,is_ufunc',
|
| 356 |
+
[(nfo.wrapper, nfo.n_args, nfo.int_only, nfo.is_ufunc)
|
| 357 |
+
for nfo in _special_funcs]
|
| 358 |
+
)
|
| 359 |
+
def test_ufunc_kwargs(func, n_args, int_only, is_ufunc):
|
| 360 |
+
"""Test that numpy-specific out= and dtype= keyword arguments
|
| 361 |
+
of ufuncs still work when SCIPY_ARRAY_API is set.
|
| 362 |
+
"""
|
| 363 |
+
if not is_ufunc:
|
| 364 |
+
pytest.skip(f"{func.__name__} is not a ufunc.")
|
| 365 |
+
if int_only is None:
|
| 366 |
+
int_only = (False, ) * n_args
|
| 367 |
+
# out=
|
| 368 |
+
args = [
|
| 369 |
+
np.asarray([.1, .2]) if not needs_int
|
| 370 |
+
else np.asarray([1, 2])
|
| 371 |
+
for needs_int in int_only
|
| 372 |
+
]
|
| 373 |
+
out = np.empty(2)
|
| 374 |
+
y = func(*args, out=out)
|
| 375 |
+
xp_assert_close(y, out)
|
| 376 |
+
|
| 377 |
+
# out= with out.dtype != args.dtype
|
| 378 |
+
out = np.empty(2, dtype=np.float32)
|
| 379 |
+
y = func(*args, out=out)
|
| 380 |
+
xp_assert_close(y, out)
|
| 381 |
+
|
| 382 |
+
if func.__name__ in {"bdtr", "bdtrc", "bdtri"}:
|
| 383 |
+
# The below function evaluation will trigger a deprecation warning
|
| 384 |
+
# with dtype=np.float32. This will go away if the trigger is actually
|
| 385 |
+
# pulled on the deprecation.
|
| 386 |
+
return
|
| 387 |
+
|
| 388 |
+
# dtype=
|
| 389 |
+
y = func(*args, dtype=np.float32)
|
| 390 |
+
assert y.dtype == np.float32
|
| 391 |
+
|
| 392 |
+
|
| 393 |
+
@make_xp_test_case(special.chdtr)
|
| 394 |
+
def test_chdtr_gh21311(xp):
|
| 395 |
+
# the edge case behavior of generic chdtr was not right; see gh-21311
|
| 396 |
+
# be sure to test at least these cases
|
| 397 |
+
# should add `np.nan` into the mix when gh-21317 is resolved
|
| 398 |
+
x = np.asarray([-np.inf, -1., 0., 1., np.inf])
|
| 399 |
+
v = x.reshape(-1, 1)
|
| 400 |
+
ref = special.chdtr(v, x)
|
| 401 |
+
res = special.chdtr(xp.asarray(v), xp.asarray(x))
|
| 402 |
+
xp_assert_close(res, xp.asarray(ref))
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_trig.py
ADDED
|
@@ -0,0 +1,76 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import warnings
|
| 2 |
+
|
| 3 |
+
import pytest
|
| 4 |
+
import numpy as np
|
| 5 |
+
from numpy.testing import assert_equal, assert_allclose
|
| 6 |
+
|
| 7 |
+
from scipy.special._ufuncs import _sinpi as sinpi
|
| 8 |
+
from scipy.special._ufuncs import _cospi as cospi
|
| 9 |
+
|
| 10 |
+
|
| 11 |
+
def test_integer_real_part():
|
| 12 |
+
x = np.arange(-100, 101)
|
| 13 |
+
y = np.hstack((-np.linspace(310, -30, 10), np.linspace(-30, 310, 10)))
|
| 14 |
+
x, y = np.meshgrid(x, y)
|
| 15 |
+
z = x + 1j*y
|
| 16 |
+
# In the following we should be *exactly* right
|
| 17 |
+
res = sinpi(z)
|
| 18 |
+
assert_equal(res.real, 0.0)
|
| 19 |
+
res = cospi(z)
|
| 20 |
+
assert_equal(res.imag, 0.0)
|
| 21 |
+
|
| 22 |
+
|
| 23 |
+
def test_half_integer_real_part():
|
| 24 |
+
x = np.arange(-100, 101) + 0.5
|
| 25 |
+
y = np.hstack((-np.linspace(310, -30, 10), np.linspace(-30, 310, 10)))
|
| 26 |
+
x, y = np.meshgrid(x, y)
|
| 27 |
+
z = x + 1j*y
|
| 28 |
+
# In the following we should be *exactly* right
|
| 29 |
+
res = sinpi(z)
|
| 30 |
+
assert_equal(res.imag, 0.0)
|
| 31 |
+
res = cospi(z)
|
| 32 |
+
assert_equal(res.real, 0.0)
|
| 33 |
+
|
| 34 |
+
|
| 35 |
+
@pytest.mark.skip("Temporary skip while gh-19526 is being resolved")
|
| 36 |
+
def test_intermediate_overlow():
|
| 37 |
+
# Make sure we avoid overflow in situations where cosh/sinh would
|
| 38 |
+
# overflow but the product with sin/cos would not
|
| 39 |
+
sinpi_pts = [complex(1 + 1e-14, 227),
|
| 40 |
+
complex(1e-35, 250),
|
| 41 |
+
complex(1e-301, 445)]
|
| 42 |
+
# Data generated with mpmath
|
| 43 |
+
sinpi_std = [complex(-8.113438309924894e+295, -np.inf),
|
| 44 |
+
complex(1.9507801934611995e+306, np.inf),
|
| 45 |
+
complex(2.205958493464539e+306, np.inf)]
|
| 46 |
+
with warnings.catch_warnings():
|
| 47 |
+
warnings.filterwarnings(
|
| 48 |
+
"ignore", "invalid value encountered in multiply", RuntimeWarning)
|
| 49 |
+
for p, std in zip(sinpi_pts, sinpi_std):
|
| 50 |
+
res = sinpi(p)
|
| 51 |
+
assert_allclose(res.real, std.real)
|
| 52 |
+
assert_allclose(res.imag, std.imag)
|
| 53 |
+
|
| 54 |
+
# Test for cosine, less interesting because cos(0) = 1.
|
| 55 |
+
p = complex(0.5 + 1e-14, 227)
|
| 56 |
+
std = complex(-8.113438309924894e+295, -np.inf)
|
| 57 |
+
with warnings.catch_warnings():
|
| 58 |
+
warnings.filterwarnings(
|
| 59 |
+
"ignore", "invalid value encountered in multiply", RuntimeWarning)
|
| 60 |
+
res = cospi(p)
|
| 61 |
+
assert_allclose(res.real, std.real)
|
| 62 |
+
assert_allclose(res.imag, std.imag)
|
| 63 |
+
|
| 64 |
+
|
| 65 |
+
def test_zero_sign():
|
| 66 |
+
y = sinpi(-0.0)
|
| 67 |
+
assert y == 0.0
|
| 68 |
+
assert np.signbit(y)
|
| 69 |
+
|
| 70 |
+
y = sinpi(0.0)
|
| 71 |
+
assert y == 0.0
|
| 72 |
+
assert not np.signbit(y)
|
| 73 |
+
|
| 74 |
+
y = cospi(0.5)
|
| 75 |
+
assert y == 0.0
|
| 76 |
+
assert not np.signbit(y)
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_ufunc_signatures.py
ADDED
|
@@ -0,0 +1,51 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""Test that all ufuncs have float32-preserving signatures.
|
| 2 |
+
|
| 3 |
+
This was once guaranteed through the code generation script for
|
| 4 |
+
generating ufuncs, `scipy/special/_generate_pyx.py`. Starting with
|
| 5 |
+
gh-20260, SciPy developers have begun moving to generate ufuncs
|
| 6 |
+
through direct use of the NumPy C API (through C++). Existence of
|
| 7 |
+
float32 preserving signatures must now be tested since it is no
|
| 8 |
+
longer guaranteed.
|
| 9 |
+
"""
|
| 10 |
+
|
| 11 |
+
import numpy as np
|
| 12 |
+
import pytest
|
| 13 |
+
import scipy.special._ufuncs
|
| 14 |
+
import scipy.special._gufuncs
|
| 15 |
+
|
| 16 |
+
|
| 17 |
+
# Single precision is not implemented for these ufuncs;
|
| 18 |
+
# floating point inputs must be float64.
|
| 19 |
+
exceptions = ['_gen_harmonic', '_normalized_gen_harmonic']
|
| 20 |
+
|
| 21 |
+
_ufuncs = []
|
| 22 |
+
for funcname in dir(scipy.special._ufuncs):
|
| 23 |
+
if funcname not in exceptions:
|
| 24 |
+
_ufuncs.append(getattr(scipy.special._ufuncs, funcname))
|
| 25 |
+
for funcname in dir(scipy.special._gufuncs):
|
| 26 |
+
_ufuncs.append(getattr(scipy.special._gufuncs, funcname))
|
| 27 |
+
|
| 28 |
+
# Not all module members are actually ufuncs
|
| 29 |
+
_ufuncs = [func for func in _ufuncs if isinstance(func, np.ufunc)]
|
| 30 |
+
|
| 31 |
+
@pytest.mark.parametrize("ufunc", _ufuncs)
|
| 32 |
+
def test_ufunc_signatures(ufunc):
|
| 33 |
+
|
| 34 |
+
# From _generate_pyx.py
|
| 35 |
+
# "Don't add float32 versions of ufuncs with integer arguments, as this
|
| 36 |
+
# can lead to incorrect dtype selection if the integer arguments are
|
| 37 |
+
# arrays, but float arguments are scalars.
|
| 38 |
+
# This may be a NumPy bug, but we need to work around it.
|
| 39 |
+
# cf. gh-4895, https://github.com/numpy/numpy/issues/5895"
|
| 40 |
+
types = set(sig for sig in ufunc.types
|
| 41 |
+
if not ("l" in sig or "i" in sig or "q" in sig or "p" in sig))
|
| 42 |
+
|
| 43 |
+
# Generate the full expanded set of signatures which should exist. There
|
| 44 |
+
# should be matching float and double versions of any existing signature.
|
| 45 |
+
expanded_types = set()
|
| 46 |
+
for sig in types:
|
| 47 |
+
expanded_types.update(
|
| 48 |
+
[sig.replace("d", "f").replace("D", "F"),
|
| 49 |
+
sig.replace("f", "d").replace("F", "D")]
|
| 50 |
+
)
|
| 51 |
+
assert types == expanded_types
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_wright_bessel.py
ADDED
|
@@ -0,0 +1,205 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# Reference MPMATH implementation:
|
| 2 |
+
#
|
| 3 |
+
# import mpmath
|
| 4 |
+
# from mpmath import nsum
|
| 5 |
+
#
|
| 6 |
+
# def Wright_Series_MPMATH(a, b, z, dps=50, method='r+s+e', steps=[1000]):
|
| 7 |
+
# """Compute Wright' generalized Bessel function as Series.
|
| 8 |
+
#
|
| 9 |
+
# This uses mpmath for arbitrary precision.
|
| 10 |
+
# """
|
| 11 |
+
# with mpmath.workdps(dps):
|
| 12 |
+
# res = nsum(lambda k: z**k/mpmath.fac(k) * mpmath.rgamma(a*k+b),
|
| 13 |
+
# [0, mpmath.inf],
|
| 14 |
+
# tol=dps, method=method, steps=steps
|
| 15 |
+
# )
|
| 16 |
+
#
|
| 17 |
+
# return res
|
| 18 |
+
|
| 19 |
+
from itertools import product
|
| 20 |
+
|
| 21 |
+
import pytest
|
| 22 |
+
import numpy as np
|
| 23 |
+
from numpy.testing import assert_equal, assert_allclose
|
| 24 |
+
|
| 25 |
+
import scipy.special as sc
|
| 26 |
+
from scipy.special import log_wright_bessel, loggamma, rgamma, wright_bessel
|
| 27 |
+
|
| 28 |
+
|
| 29 |
+
@pytest.mark.parametrize('a', [0, 1e-6, 0.1, 0.5, 1, 10])
|
| 30 |
+
@pytest.mark.parametrize('b', [0, 1e-6, 0.1, 0.5, 1, 10])
|
| 31 |
+
def test_wright_bessel_zero(a, b):
|
| 32 |
+
"""Test at x = 0."""
|
| 33 |
+
assert_equal(wright_bessel(a, b, 0.), rgamma(b))
|
| 34 |
+
assert_allclose(log_wright_bessel(a, b, 0.), -loggamma(b))
|
| 35 |
+
|
| 36 |
+
|
| 37 |
+
@pytest.mark.parametrize('b', [0, 1e-6, 0.1, 0.5, 1, 10])
|
| 38 |
+
@pytest.mark.parametrize('x', [0, 1e-6, 0.1, 0.5, 1])
|
| 39 |
+
def test_wright_bessel_iv(b, x):
|
| 40 |
+
"""Test relation of wright_bessel and modified bessel function iv.
|
| 41 |
+
|
| 42 |
+
iv(z) = (1/2*z)**v * Phi(1, v+1; 1/4*z**2).
|
| 43 |
+
See https://dlmf.nist.gov/10.46.E2
|
| 44 |
+
"""
|
| 45 |
+
if x != 0:
|
| 46 |
+
v = b - 1
|
| 47 |
+
wb = wright_bessel(1, v + 1, x**2 / 4.)
|
| 48 |
+
# Note: iv(v, x) has precision of less than 1e-12 for some cases
|
| 49 |
+
# e.g v=1-1e-6 and x=1e-06)
|
| 50 |
+
assert_allclose(np.power(x / 2., v) * wb,
|
| 51 |
+
sc.iv(v, x),
|
| 52 |
+
rtol=1e-11, atol=1e-11)
|
| 53 |
+
|
| 54 |
+
|
| 55 |
+
@pytest.mark.parametrize('a', [0, 1e-6, 0.1, 0.5, 1, 10])
|
| 56 |
+
@pytest.mark.parametrize('b', [1, 1 + 1e-3, 2, 5, 10])
|
| 57 |
+
@pytest.mark.parametrize('x', [0, 1e-6, 0.1, 0.5, 1, 5, 10, 100])
|
| 58 |
+
def test_wright_functional(a, b, x):
|
| 59 |
+
"""Test functional relation of wright_bessel.
|
| 60 |
+
|
| 61 |
+
Phi(a, b-1, z) = a*z*Phi(a, b+a, z) + (b-1)*Phi(a, b, z)
|
| 62 |
+
|
| 63 |
+
Note that d/dx Phi(a, b, x) = Phi(a, b-1, x)
|
| 64 |
+
See Eq. (22) of
|
| 65 |
+
B. Stankovic, On the Function of E. M. Wright,
|
| 66 |
+
Publ. de l' Institut Mathematique, Beograd,
|
| 67 |
+
Nouvelle S`er. 10 (1970), 113-124.
|
| 68 |
+
"""
|
| 69 |
+
assert_allclose(wright_bessel(a, b - 1, x),
|
| 70 |
+
a * x * wright_bessel(a, b + a, x)
|
| 71 |
+
+ (b - 1) * wright_bessel(a, b, x),
|
| 72 |
+
rtol=1e-8, atol=1e-8)
|
| 73 |
+
|
| 74 |
+
|
| 75 |
+
# grid of rows [a, b, x, value, accuracy] that do not reach 1e-11 accuracy
|
| 76 |
+
# see output of:
|
| 77 |
+
# cd scipy/scipy/_precompute
|
| 78 |
+
# python wright_bessel_data.py
|
| 79 |
+
grid_a_b_x_value_acc = np.array([
|
| 80 |
+
[0.1, 100.0, 709.7827128933841, 8.026353022981087e+34, 2e-8],
|
| 81 |
+
[0.5, 10.0, 709.7827128933841, 2.680788404494657e+48, 9e-8],
|
| 82 |
+
[0.5, 10.0, 1000.0, 2.005901980702872e+64, 1e-8],
|
| 83 |
+
[0.5, 100.0, 1000.0, 3.4112367580445246e-117, 6e-8],
|
| 84 |
+
[1.0, 20.0, 100000.0, 1.7717158630699857e+225, 3e-11],
|
| 85 |
+
[1.0, 100.0, 100000.0, 1.0269334596230763e+22, np.nan],
|
| 86 |
+
[1.0000000000000222, 20.0, 100000.0, 1.7717158630001672e+225, 3e-11],
|
| 87 |
+
[1.0000000000000222, 100.0, 100000.0, 1.0269334595866202e+22, np.nan],
|
| 88 |
+
[1.5, 0.0, 500.0, 15648961196.432373, 3e-11],
|
| 89 |
+
[1.5, 2.220446049250313e-14, 500.0, 15648961196.431465, 3e-11],
|
| 90 |
+
[1.5, 1e-10, 500.0, 15648961192.344728, 3e-11],
|
| 91 |
+
[1.5, 1e-05, 500.0, 15648552437.334162, 3e-11],
|
| 92 |
+
[1.5, 0.1, 500.0, 12049870581.10317, 2e-11],
|
| 93 |
+
[1.5, 20.0, 100000.0, 7.81930438331405e+43, 3e-9],
|
| 94 |
+
[1.5, 100.0, 100000.0, 9.653370857459075e-130, np.nan],
|
| 95 |
+
])
|
| 96 |
+
|
| 97 |
+
|
| 98 |
+
@pytest.mark.xfail
|
| 99 |
+
@pytest.mark.parametrize(
|
| 100 |
+
'a, b, x, phi',
|
| 101 |
+
grid_a_b_x_value_acc[:, :4].tolist())
|
| 102 |
+
def test_wright_data_grid_failures(a, b, x, phi):
|
| 103 |
+
"""Test cases of test_data that do not reach relative accuracy of 1e-11"""
|
| 104 |
+
assert_allclose(wright_bessel(a, b, x), phi, rtol=1e-11)
|
| 105 |
+
|
| 106 |
+
|
| 107 |
+
@pytest.mark.parametrize(
|
| 108 |
+
'a, b, x, phi, accuracy',
|
| 109 |
+
grid_a_b_x_value_acc.tolist())
|
| 110 |
+
def test_wright_data_grid_less_accurate(a, b, x, phi, accuracy):
|
| 111 |
+
"""Test cases of test_data that do not reach relative accuracy of 1e-11
|
| 112 |
+
|
| 113 |
+
Here we test for reduced accuracy or even nan.
|
| 114 |
+
"""
|
| 115 |
+
if np.isnan(accuracy):
|
| 116 |
+
assert np.isnan(wright_bessel(a, b, x))
|
| 117 |
+
else:
|
| 118 |
+
assert_allclose(wright_bessel(a, b, x), phi, rtol=accuracy)
|
| 119 |
+
|
| 120 |
+
|
| 121 |
+
@pytest.mark.parametrize(
|
| 122 |
+
'a, b, x',
|
| 123 |
+
list(
|
| 124 |
+
product([0, 0.1, 0.5, 1.5, 5, 10], [1, 2], [1e-3, 1, 1.5, 5, 10])
|
| 125 |
+
)
|
| 126 |
+
)
|
| 127 |
+
def test_log_wright_bessel_same_as_wright_bessel(a, b, x):
|
| 128 |
+
"""Test that log_wright_bessel equals log of wright_bessel."""
|
| 129 |
+
assert_allclose(
|
| 130 |
+
log_wright_bessel(a, b, x),
|
| 131 |
+
np.log(wright_bessel(a, b, x)),
|
| 132 |
+
rtol=1e-8,
|
| 133 |
+
)
|
| 134 |
+
|
| 135 |
+
|
| 136 |
+
# Computed with, see also mp_wright_bessel from wright_bessel_data.py:
|
| 137 |
+
#
|
| 138 |
+
# from functools import lru_cache
|
| 139 |
+
# import mpmath as mp
|
| 140 |
+
#
|
| 141 |
+
# @lru_cache(maxsize=1_000_000)
|
| 142 |
+
# def rgamma_cached(x, dps):
|
| 143 |
+
# with mp.workdps(dps):
|
| 144 |
+
# return mp.rgamma(x)
|
| 145 |
+
#
|
| 146 |
+
# def mp_log_wright_bessel(a, b, x, dps=100, maxterms=10_000, method="d"):
|
| 147 |
+
# """Compute log of Wright's generalized Bessel function as Series with mpmath."""
|
| 148 |
+
# with mp.workdps(dps):
|
| 149 |
+
# a, b, x = mp.mpf(a), mp.mpf(b), mp.mpf(x)
|
| 150 |
+
# res = mp.nsum(lambda k: x**k / mp.fac(k)
|
| 151 |
+
# * rgamma_cached(a * k + b, dps=dps),
|
| 152 |
+
# [0, mp.inf],
|
| 153 |
+
# tol=dps, method=method, steps=[maxterms]
|
| 154 |
+
# )
|
| 155 |
+
# return mp.log(res)
|
| 156 |
+
#
|
| 157 |
+
# Sometimes, one needs to set maxterms as high as 1_00_000 to get accurate results for
|
| 158 |
+
# phi.
|
| 159 |
+
# At the end of the day, we can only hope that results are correct for very large x,
|
| 160 |
+
# e.g. by the asymptotic series, as there is no way to produce those in "exact"
|
| 161 |
+
# arithmetic.
|
| 162 |
+
# Note: accuracy = np.nan means log_wright_bessel returns nan.
|
| 163 |
+
@pytest.mark.parametrize(
|
| 164 |
+
'a, b, x, phi, accuracy',
|
| 165 |
+
[
|
| 166 |
+
(0, 0, 0, -np.inf, 1e-11),
|
| 167 |
+
(0, 0, 1, -np.inf, 1e-11),
|
| 168 |
+
(0, 1, 1.23, 1.23, 1e-11),
|
| 169 |
+
(0, 1, 1e50, 1e50, 1e-11),
|
| 170 |
+
(1e-5, 0, 700, 695.0421608273609, 1e-11),
|
| 171 |
+
(1e-5, 0, 1e3, 995.40052566540066, 1e-11),
|
| 172 |
+
(1e-5, 100, 1e3, 640.8197935670078, 1e-11),
|
| 173 |
+
(1e-3, 0, 1e4, 9987.2229532297262, 1e-11),
|
| 174 |
+
(1e-3, 0, 1e5, 99641.920687169507, 1e-11),
|
| 175 |
+
(1e-3, 0, 1e6, 994118.55560054416, 1e-11), # maxterms=1_000_000
|
| 176 |
+
(1e-3, 10, 1e5, 99595.47710802537, 1e-11),
|
| 177 |
+
(1e-3, 50, 1e5, 99401.240922855647, 1e-3),
|
| 178 |
+
(1e-3, 100, 1e5, 99143.465191656527, np.nan),
|
| 179 |
+
(0.5, 0, 1e5, 4074.1112442197941, 1e-11),
|
| 180 |
+
(0.5, 0, 1e7, 87724.552120038896, 1e-11),
|
| 181 |
+
(0.5, 100, 1e5, 3350.3928746306163, np.nan),
|
| 182 |
+
(0.5, 100, 1e7, 86696.109975301719, 1e-11),
|
| 183 |
+
(1, 0, 1e5, 634.06765787997266, 1e-11),
|
| 184 |
+
(1, 0, 1e8, 20003.339639312035, 1e-11),
|
| 185 |
+
(1.5, 0, 1e5, 197.01777556071194, 1e-11),
|
| 186 |
+
(1.5, 0, 1e8, 3108.987414395706, 1e-11),
|
| 187 |
+
(1.5, 100, 1e8, 2354.8915946283275, np.nan),
|
| 188 |
+
(5, 0, 1e5, 9.8980480013203547, 1e-11),
|
| 189 |
+
(5, 0, 1e8, 33.642337258687465, 1e-11),
|
| 190 |
+
(5, 0, 1e12, 157.53704288117429, 1e-11),
|
| 191 |
+
(5, 100, 1e5, -359.13419630792148, 1e-11),
|
| 192 |
+
(5, 100, 1e12, -337.07722086995229, 1e-4),
|
| 193 |
+
(5, 100, 1e20, 2588.2471229986845, 2e-6),
|
| 194 |
+
(100, 0, 1e5, -347.62127990460517, 1e-11),
|
| 195 |
+
(100, 0, 1e20, -313.08250350969449, 1e-11),
|
| 196 |
+
(100, 100, 1e5, -359.1342053695754, 1e-11),
|
| 197 |
+
(100, 100, 1e20, -359.1342053695754, 1e-11),
|
| 198 |
+
]
|
| 199 |
+
)
|
| 200 |
+
def test_log_wright_bessel(a, b, x, phi, accuracy):
|
| 201 |
+
"""Test for log_wright_bessel, in particular for large x."""
|
| 202 |
+
if np.isnan(accuracy):
|
| 203 |
+
assert np.isnan(log_wright_bessel(a, b, x))
|
| 204 |
+
else:
|
| 205 |
+
assert_allclose(log_wright_bessel(a, b, x), phi, rtol=accuracy)
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_wrightomega.py
ADDED
|
@@ -0,0 +1,117 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import pytest
|
| 2 |
+
import numpy as np
|
| 3 |
+
from numpy.testing import assert_, assert_equal, assert_allclose
|
| 4 |
+
|
| 5 |
+
import scipy.special as sc
|
| 6 |
+
from scipy.special._testutils import assert_func_equal
|
| 7 |
+
|
| 8 |
+
|
| 9 |
+
def test_wrightomega_nan():
|
| 10 |
+
pts = [complex(np.nan, 0),
|
| 11 |
+
complex(0, np.nan),
|
| 12 |
+
complex(np.nan, np.nan),
|
| 13 |
+
complex(np.nan, 1),
|
| 14 |
+
complex(1, np.nan)]
|
| 15 |
+
for p in pts:
|
| 16 |
+
res = sc.wrightomega(p)
|
| 17 |
+
assert_(np.isnan(res.real))
|
| 18 |
+
assert_(np.isnan(res.imag))
|
| 19 |
+
|
| 20 |
+
|
| 21 |
+
def test_wrightomega_inf_branch():
|
| 22 |
+
pts = [complex(-np.inf, np.pi/4),
|
| 23 |
+
complex(-np.inf, -np.pi/4),
|
| 24 |
+
complex(-np.inf, 3*np.pi/4),
|
| 25 |
+
complex(-np.inf, -3*np.pi/4)]
|
| 26 |
+
expected_results = [complex(0.0, 0.0),
|
| 27 |
+
complex(0.0, -0.0),
|
| 28 |
+
complex(-0.0, 0.0),
|
| 29 |
+
complex(-0.0, -0.0)]
|
| 30 |
+
for p, expected in zip(pts, expected_results):
|
| 31 |
+
res = sc.wrightomega(p)
|
| 32 |
+
# We can't use assert_equal(res, expected) because in older versions of
|
| 33 |
+
# numpy, assert_equal doesn't check the sign of the real and imaginary
|
| 34 |
+
# parts when comparing complex zeros. It does check the sign when the
|
| 35 |
+
# arguments are *real* scalars.
|
| 36 |
+
assert_equal(res.real, expected.real)
|
| 37 |
+
assert_equal(res.imag, expected.imag)
|
| 38 |
+
|
| 39 |
+
|
| 40 |
+
def test_wrightomega_inf():
|
| 41 |
+
pts = [complex(np.inf, 10),
|
| 42 |
+
complex(-np.inf, 10),
|
| 43 |
+
complex(10, np.inf),
|
| 44 |
+
complex(10, -np.inf)]
|
| 45 |
+
for p in pts:
|
| 46 |
+
assert_equal(sc.wrightomega(p), p)
|
| 47 |
+
|
| 48 |
+
|
| 49 |
+
def test_wrightomega_singular():
|
| 50 |
+
pts = [complex(-1.0, np.pi),
|
| 51 |
+
complex(-1.0, -np.pi)]
|
| 52 |
+
for p in pts:
|
| 53 |
+
res = sc.wrightomega(p)
|
| 54 |
+
assert_equal(res, -1.0)
|
| 55 |
+
assert_(np.signbit(res.imag) == np.bool_(False))
|
| 56 |
+
|
| 57 |
+
|
| 58 |
+
@pytest.mark.parametrize('x, desired', [
|
| 59 |
+
(-np.inf, 0),
|
| 60 |
+
(np.inf, np.inf),
|
| 61 |
+
])
|
| 62 |
+
def test_wrightomega_real_infinities(x, desired):
|
| 63 |
+
assert sc.wrightomega(x) == desired
|
| 64 |
+
|
| 65 |
+
|
| 66 |
+
def test_wrightomega_real_nan():
|
| 67 |
+
assert np.isnan(sc.wrightomega(np.nan))
|
| 68 |
+
|
| 69 |
+
|
| 70 |
+
def test_wrightomega_real_series_crossover():
|
| 71 |
+
desired_error = 2 * np.finfo(float).eps
|
| 72 |
+
crossover = 1e20
|
| 73 |
+
x_before_crossover = np.nextafter(crossover, -np.inf)
|
| 74 |
+
x_after_crossover = np.nextafter(crossover, np.inf)
|
| 75 |
+
# Computed using Mpmath
|
| 76 |
+
desired_before_crossover = 99999999999999983569.948
|
| 77 |
+
desired_after_crossover = 100000000000000016337.948
|
| 78 |
+
assert_allclose(
|
| 79 |
+
sc.wrightomega(x_before_crossover),
|
| 80 |
+
desired_before_crossover,
|
| 81 |
+
atol=0,
|
| 82 |
+
rtol=desired_error,
|
| 83 |
+
)
|
| 84 |
+
assert_allclose(
|
| 85 |
+
sc.wrightomega(x_after_crossover),
|
| 86 |
+
desired_after_crossover,
|
| 87 |
+
atol=0,
|
| 88 |
+
rtol=desired_error,
|
| 89 |
+
)
|
| 90 |
+
|
| 91 |
+
|
| 92 |
+
def test_wrightomega_exp_approximation_crossover():
|
| 93 |
+
desired_error = 2 * np.finfo(float).eps
|
| 94 |
+
crossover = -50
|
| 95 |
+
x_before_crossover = np.nextafter(crossover, np.inf)
|
| 96 |
+
x_after_crossover = np.nextafter(crossover, -np.inf)
|
| 97 |
+
# Computed using Mpmath
|
| 98 |
+
desired_before_crossover = 1.9287498479639314876e-22
|
| 99 |
+
desired_after_crossover = 1.9287498479639040784e-22
|
| 100 |
+
assert_allclose(
|
| 101 |
+
sc.wrightomega(x_before_crossover),
|
| 102 |
+
desired_before_crossover,
|
| 103 |
+
atol=0,
|
| 104 |
+
rtol=desired_error,
|
| 105 |
+
)
|
| 106 |
+
assert_allclose(
|
| 107 |
+
sc.wrightomega(x_after_crossover),
|
| 108 |
+
desired_after_crossover,
|
| 109 |
+
atol=0,
|
| 110 |
+
rtol=desired_error,
|
| 111 |
+
)
|
| 112 |
+
|
| 113 |
+
|
| 114 |
+
def test_wrightomega_real_versus_complex():
|
| 115 |
+
x = np.linspace(-500, 500, 1001)
|
| 116 |
+
results = sc.wrightomega(x + 0j).real
|
| 117 |
+
assert_func_equal(sc.wrightomega, results, x, atol=0, rtol=1e-14)
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/special/tests/test_zeta.py
ADDED
|
@@ -0,0 +1,301 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import scipy
|
| 2 |
+
import scipy.special as sc
|
| 3 |
+
import sys
|
| 4 |
+
import numpy as np
|
| 5 |
+
import pytest
|
| 6 |
+
|
| 7 |
+
from numpy.testing import assert_equal, assert_allclose
|
| 8 |
+
|
| 9 |
+
|
| 10 |
+
def test_zeta():
|
| 11 |
+
assert_allclose(sc.zeta(2,2), np.pi**2/6 - 1, rtol=1e-12)
|
| 12 |
+
|
| 13 |
+
|
| 14 |
+
def test_zetac():
|
| 15 |
+
# Expected values in the following were computed using Wolfram
|
| 16 |
+
# Alpha's `Zeta[x] - 1`
|
| 17 |
+
x = [-2.1, 0.8, 0.9999, 9, 50, 75]
|
| 18 |
+
desired = [
|
| 19 |
+
-0.9972705002153750,
|
| 20 |
+
-5.437538415895550,
|
| 21 |
+
-10000.42279161673,
|
| 22 |
+
0.002008392826082214,
|
| 23 |
+
8.881784210930816e-16,
|
| 24 |
+
2.646977960169853e-23,
|
| 25 |
+
]
|
| 26 |
+
assert_allclose(sc.zetac(x), desired, rtol=1e-12)
|
| 27 |
+
|
| 28 |
+
|
| 29 |
+
def test_zetac_special_cases():
|
| 30 |
+
assert sc.zetac(np.inf) == 0
|
| 31 |
+
assert np.isnan(sc.zetac(-np.inf))
|
| 32 |
+
assert sc.zetac(0) == -1.5
|
| 33 |
+
assert sc.zetac(1.0) == np.inf
|
| 34 |
+
|
| 35 |
+
assert_equal(sc.zetac([-2, -50, -100]), -1)
|
| 36 |
+
|
| 37 |
+
|
| 38 |
+
def test_riemann_zeta_special_cases():
|
| 39 |
+
assert np.isnan(sc.zeta(np.nan))
|
| 40 |
+
assert sc.zeta(np.inf) == 1
|
| 41 |
+
assert sc.zeta(0) == -0.5
|
| 42 |
+
|
| 43 |
+
# Riemann zeta is zero add negative even integers.
|
| 44 |
+
assert_equal(sc.zeta([-2, -4, -6, -8, -10]), 0)
|
| 45 |
+
|
| 46 |
+
assert_allclose(sc.zeta(2), np.pi**2/6, rtol=1e-12)
|
| 47 |
+
assert_allclose(sc.zeta(4), np.pi**4/90, rtol=1e-12)
|
| 48 |
+
|
| 49 |
+
|
| 50 |
+
def test_riemann_zeta_avoid_overflow():
|
| 51 |
+
s = -260.00000000001
|
| 52 |
+
desired = -5.6966307844402683127e+297 # Computed with Mpmath
|
| 53 |
+
assert_allclose(sc.zeta(s), desired, atol=0, rtol=5e-14)
|
| 54 |
+
|
| 55 |
+
|
| 56 |
+
@pytest.mark.parametrize(
|
| 57 |
+
"z, desired, rtol",
|
| 58 |
+
[
|
| 59 |
+
## Test cases taken from mpmath with the script:
|
| 60 |
+
|
| 61 |
+
# import numpy as np
|
| 62 |
+
# import scipy.stats as stats
|
| 63 |
+
|
| 64 |
+
# from mpmath import mp
|
| 65 |
+
|
| 66 |
+
# # seed = np.random.SeedSequence().entropy
|
| 67 |
+
# seed = 154689806791763421822480125722191067828
|
| 68 |
+
# rng = np.random.default_rng(seed)
|
| 69 |
+
# default_rtol = 1e-13
|
| 70 |
+
|
| 71 |
+
# # A small point in each quadrant outside of the critical strip
|
| 72 |
+
# cases = []
|
| 73 |
+
# for x_sign, y_sign in [1, 1], [1, -1], [-1, 1], [-1, -1]:
|
| 74 |
+
# x = x_sign * rng.uniform(2, 8)
|
| 75 |
+
# y = y_sign * rng.uniform(2, 8)
|
| 76 |
+
# z = x + y*1j
|
| 77 |
+
# reference = complex(mp.zeta(z))
|
| 78 |
+
# cases.append((z, reference, default_rtol))
|
| 79 |
+
|
| 80 |
+
# # Moderately large imaginary part in each quadrant outside of critical strip
|
| 81 |
+
# for x_sign, y_sign in [1, 1], [1, -1], [-1, 1], [-1, -1]:
|
| 82 |
+
# x = x_sign * rng.uniform(2, 8)
|
| 83 |
+
# y = y_sign * rng.uniform(50, 80)
|
| 84 |
+
# z = x + y*1j
|
| 85 |
+
# reference = complex(mp.zeta(z))
|
| 86 |
+
# cases.append((z, reference, default_rtol))
|
| 87 |
+
|
| 88 |
+
# # points in critical strip
|
| 89 |
+
# x = rng.uniform(0.0, 1.0, size=5)
|
| 90 |
+
# y = np.exp(rng.uniform(0, 5, size=5))
|
| 91 |
+
# z = x + y*1j
|
| 92 |
+
# for t in z:
|
| 93 |
+
# reference = complex(mp.zeta(t))
|
| 94 |
+
# cases.append((complex(t), reference, default_rtol))
|
| 95 |
+
# z = x - y*1j
|
| 96 |
+
# for t in z:
|
| 97 |
+
# reference = complex(mp.zeta(t))
|
| 98 |
+
# cases.append((complex(t), reference, default_rtol))
|
| 99 |
+
|
| 100 |
+
# # Near small trivial zeros
|
| 101 |
+
# x = np.array([-2, -4, -6, -8])
|
| 102 |
+
# y = np.array([1e-15, -1e-15])
|
| 103 |
+
# x, y = np.meshgrid(x, y)
|
| 104 |
+
# x, y = x.ravel(), y.ravel()
|
| 105 |
+
# z = x + y*1j
|
| 106 |
+
# for t in z:
|
| 107 |
+
# reference = complex(mp.zeta(t))
|
| 108 |
+
# cases.append((complex(t), reference, 1e-7))
|
| 109 |
+
|
| 110 |
+
# # Some other points near real axis
|
| 111 |
+
# x = np.array([-0.5, 0, 0.2, 0.75])
|
| 112 |
+
# y = np.array([1e-15, -1e-15])
|
| 113 |
+
# x, y = np.meshgrid(x, y)
|
| 114 |
+
# x, y = x.ravel(), y.ravel()
|
| 115 |
+
# z = x + y*1j
|
| 116 |
+
# for t in z:
|
| 117 |
+
# reference = complex(mp.zeta(t))
|
| 118 |
+
# cases.append((complex(t), reference, 1e-7))
|
| 119 |
+
|
| 120 |
+
# # Moderately large real part
|
| 121 |
+
# x = np.array([49.33915930750887, 50.55805244181687])
|
| 122 |
+
# y = rng.uniform(20, 100, size=3)
|
| 123 |
+
# x, y = np.meshgrid(x, y)
|
| 124 |
+
# x, y = x.ravel(), y.ravel()
|
| 125 |
+
# z = x + y*1j
|
| 126 |
+
# for t in z:
|
| 127 |
+
# reference = complex(mp.zeta(t))
|
| 128 |
+
# cases.append((complex(t), reference, default_rtol))
|
| 129 |
+
|
| 130 |
+
# # Very large imaginary part
|
| 131 |
+
# x = np.array([0.5, 34.812847097948854, 50.55805244181687])
|
| 132 |
+
# y = np.array([1e6, -1e6])
|
| 133 |
+
# x, y = np.meshgrid(x, y)
|
| 134 |
+
# x, y = x.ravel(), y.ravel()
|
| 135 |
+
# z = x + y*1j
|
| 136 |
+
# for t in z:
|
| 137 |
+
# reference = complex(mp.zeta(t))
|
| 138 |
+
# rtol = 1e-7 if t.real == 0.5 else default_rtol
|
| 139 |
+
# cases.append((complex(t), reference, rtol))
|
| 140 |
+
#
|
| 141 |
+
# # Naive implementation of reflection formula suffers internal overflow
|
| 142 |
+
# x = -rng.uniform(200, 300, 3)
|
| 143 |
+
# y = np.array([rng.uniform(10, 30), -rng.uniform(10, 30)])
|
| 144 |
+
# x, y = np.meshgrid(x, y)
|
| 145 |
+
# x, y = x.ravel(), y.ravel()
|
| 146 |
+
# z = x + y*1j
|
| 147 |
+
# for t in z:
|
| 148 |
+
# reference = complex(mp.zeta(t))
|
| 149 |
+
# cases.append((complex(t), reference, default_rtol))
|
| 150 |
+
#
|
| 151 |
+
# A small point in each quadrant outside of the critical strip
|
| 152 |
+
((3.12838509346655+7.111085974836645j),
|
| 153 |
+
(1.0192654793474945+0.08795174413289127j),
|
| 154 |
+
1e-13),
|
| 155 |
+
((7.06791362314716-7.219497492626728j),
|
| 156 |
+
(1.0020740683598117-0.006752725913243711j),
|
| 157 |
+
1e-13),
|
| 158 |
+
((-6.806227077655519+2.724411451005281j),
|
| 159 |
+
(0.06312488213559667-0.061641496333765956j),
|
| 160 |
+
1e-13),
|
| 161 |
+
((-3.0170751511621026-6.3686522550665945j),
|
| 162 |
+
(-0.10330747857150148-1.214541994832571j),
|
| 163 |
+
1e-13),
|
| 164 |
+
# Moderately large imaginary part in each quadrant outside of critical strip
|
| 165 |
+
((6.133994402212294+60.03091448000761j),
|
| 166 |
+
(0.9885701843417336+0.009636925981078128j),
|
| 167 |
+
1e-13),
|
| 168 |
+
((6.17268142822657-64.74883149743795j),
|
| 169 |
+
(1.0080474225840865+0.012032804974965354j),
|
| 170 |
+
1e-13),
|
| 171 |
+
((-3.462191939791879+76.16258975567534j),
|
| 172 |
+
(18672.072070850158+2908.5104826247184j),
|
| 173 |
+
1e-13),
|
| 174 |
+
((-6.955735216531752-74.75791554155748j),
|
| 175 |
+
(-77672258.72276545+71625206.0401107j),
|
| 176 |
+
1e-13),
|
| 177 |
+
# Points in critical strip
|
| 178 |
+
((0.4088038289823922+1.4596830498094384j),
|
| 179 |
+
(0.3032837969400845-0.47272237994110344j),
|
| 180 |
+
1e-13),
|
| 181 |
+
((0.9673493951209633+4.918968547259143j),
|
| 182 |
+
(0.7488756907431944+0.17281553371482428j),
|
| 183 |
+
1e-13),
|
| 184 |
+
((0.8692482679977754+66.6142398421354j),
|
| 185 |
+
(0.5831942469552066-0.26848904799062334j),
|
| 186 |
+
1e-13),
|
| 187 |
+
((0.42771847720003764+21.783747851715468j),
|
| 188 |
+
(0.4767032638444329+0.6898148744603123j),
|
| 189 |
+
1e-13),
|
| 190 |
+
((0.20479494678428956+33.17656449538932j),
|
| 191 |
+
(-0.6983038977487848+0.18060923618150224j),
|
| 192 |
+
1e-13),
|
| 193 |
+
((0.4088038289823922-1.4596830498094384j),
|
| 194 |
+
(0.3032837969400845+0.47272237994110344j),
|
| 195 |
+
1e-13),
|
| 196 |
+
((0.9673493951209633-4.918968547259143j),
|
| 197 |
+
(0.7488756907431944-0.17281553371482428j),
|
| 198 |
+
1e-13),
|
| 199 |
+
((0.8692482679977754-66.6142398421354j),
|
| 200 |
+
(0.5831942469552066+0.26848904799062334j),
|
| 201 |
+
1e-13),
|
| 202 |
+
((0.42771847720003764-21.783747851715468j),
|
| 203 |
+
(0.4767032638444329-0.6898148744603123j),
|
| 204 |
+
1e-13),
|
| 205 |
+
((0.20479494678428956-33.17656449538932j),
|
| 206 |
+
(-0.6983038977487848-0.18060923618150224j),
|
| 207 |
+
1e-13),
|
| 208 |
+
# Near small trivial zeros
|
| 209 |
+
((-2+1e-15j), (3.288175809370978e-32-3.0448457058393275e-17j), 1e-07),
|
| 210 |
+
((-4+1e-15j), (-2.868707923051182e-33+7.983811450268625e-18j), 1e-07),
|
| 211 |
+
((-6+1e-15j), (-1.7064292323640116e-34-5.8997591435159376e-18j), 1e-07),
|
| 212 |
+
((-8+1e-15j), (2.5060859548261706e-33+8.316161985602247e-18j), 1e-07),
|
| 213 |
+
((-2-1e-15j), (3.288175809371319e-32+3.0448457058393275e-17j), 1e-07),
|
| 214 |
+
((-4-1e-15j), (-2.8687079230520114e-33-7.983811450268625e-18j), 1e-07),
|
| 215 |
+
((-6-1e-15j), (-1.70642923235801e-34+5.8997591435159376e-18j), 1e-07),
|
| 216 |
+
((-8-1e-15j), (2.5060859548253293e-33-8.316161985602247e-18j), 1e-07),
|
| 217 |
+
# Some other points near real axis
|
| 218 |
+
((-0.5+1e-15j), (-0.20788622497735457-3.608543395999408e-16j), 1e-07),
|
| 219 |
+
(1e-15j, (-0.5-9.189384239689193e-16j), 1e-07),
|
| 220 |
+
((0.2+1e-15j), (-0.7339209248963406-1.4828001150329085e-15j), 1e-07),
|
| 221 |
+
((0.75+1e-15j), (-3.4412853869452227-1.5924832114302393e-14j), 1e-13),
|
| 222 |
+
((-0.5-1e-15j), (-0.20788622497735457+3.608543395999408e-16j), 1e-07),
|
| 223 |
+
(-1e-15j, (-0.5+9.189387416062746e-16j), 1e-07),
|
| 224 |
+
((0.2-1e-15j), (-0.7339209248963406+1.4828004007675122e-15j), 1e-07),
|
| 225 |
+
((0.75-1e-15j), (-3.4412853869452227+1.5924831974403957e-14j), 1e-13),
|
| 226 |
+
# Moderately large real part
|
| 227 |
+
((49.33915930750887+53.213478698903955j),
|
| 228 |
+
(1.0000000000000009+1.0212452494616078e-15j),
|
| 229 |
+
1e-13),
|
| 230 |
+
((50.55805244181687+53.213478698903955j),
|
| 231 |
+
(1.0000000000000004+4.387394180390787e-16j),
|
| 232 |
+
1e-13),
|
| 233 |
+
((49.33915930750887+40.6366015728302j),
|
| 234 |
+
(0.9999999999999986-1.502268709924849e-16j),
|
| 235 |
+
1e-13),
|
| 236 |
+
((50.55805244181687+40.6366015728302j),
|
| 237 |
+
(0.9999999999999994-6.453929613571651e-17j),
|
| 238 |
+
1e-13),
|
| 239 |
+
((49.33915930750887+85.83555435273925j),
|
| 240 |
+
(0.9999999999999987-2.7014400611995846e-16j),
|
| 241 |
+
1e-13),
|
| 242 |
+
((50.55805244181687+85.83555435273925j),
|
| 243 |
+
(0.9999999999999994-1.160571605555322e-16j),
|
| 244 |
+
1e-13),
|
| 245 |
+
# Very large imaginary part
|
| 246 |
+
((0.5+1e6j), (0.0760890697382271+2.805102101019299j), 1e-07),
|
| 247 |
+
((34.812847097948854+1e6j),
|
| 248 |
+
(1.0000000000102545+3.150848654056419e-11j),
|
| 249 |
+
1e-13),
|
| 250 |
+
((50.55805244181687+1e6j),
|
| 251 |
+
(1.0000000000000002+5.736517078070873e-16j),
|
| 252 |
+
1e-13),
|
| 253 |
+
((0.5-1e6j), (0.0760890697382271-2.805102101019299j), 1e-07),
|
| 254 |
+
((34.812847097948854-1e6j),
|
| 255 |
+
(1.0000000000102545-3.150848654056419e-11j),
|
| 256 |
+
1e-13),
|
| 257 |
+
((50.55805244181687-1e6j),
|
| 258 |
+
(1.0000000000000002-5.736517078070873e-16j),
|
| 259 |
+
1e-13),
|
| 260 |
+
((-294.86605461349745+13.992648136816397j), (-np.inf+np.inf*1j), 1e-13),
|
| 261 |
+
((-294.86605461349745-16.147667799398363j), (np.inf-np.inf*1j), 1e-13),
|
| 262 |
+
]
|
| 263 |
+
)
|
| 264 |
+
def test_riemann_zeta_complex(z, desired, rtol):
|
| 265 |
+
assert_allclose(sc.zeta(z), desired, rtol=rtol)
|
| 266 |
+
|
| 267 |
+
|
| 268 |
+
# Some of the test cases below fail for intel compilers
|
| 269 |
+
cpp_compiler = scipy.__config__.CONFIG["Compilers"]["c++"]["name"]
|
| 270 |
+
gcc_linux = cpp_compiler == "gcc" and sys.platform == "linux"
|
| 271 |
+
clang_macOS = cpp_compiler == "clang" and sys.platform == "darwin"
|
| 272 |
+
|
| 273 |
+
|
| 274 |
+
@pytest.mark.skipif(
|
| 275 |
+
not (gcc_linux or clang_macOS),
|
| 276 |
+
reason="Underflow may not be avoided on other platforms",
|
| 277 |
+
)
|
| 278 |
+
@pytest.mark.parametrize(
|
| 279 |
+
"z, desired, rtol",
|
| 280 |
+
[
|
| 281 |
+
# Test cases generated as part of same script for
|
| 282 |
+
# test_riemann_zeta_complex. These cases are split off because
|
| 283 |
+
# they fail on some platforms.
|
| 284 |
+
#
|
| 285 |
+
# Naive implementation of reflection formula suffers internal overflow
|
| 286 |
+
((-217.40285743524163+13.992648136816397j),
|
| 287 |
+
(-6.012818500554211e+249-1.926943776932387e+250j),
|
| 288 |
+
5e-13,),
|
| 289 |
+
((-237.71710702931668+13.992648136816397j),
|
| 290 |
+
(-8.823803086106129e+281-5.009074181335139e+281j),
|
| 291 |
+
1e-13,),
|
| 292 |
+
((-217.40285743524163-16.147667799398363j),
|
| 293 |
+
(-5.111612904844256e+251-4.907132127666742e+250j),
|
| 294 |
+
5e-13,),
|
| 295 |
+
((-237.71710702931668-16.147667799398363j),
|
| 296 |
+
(-1.3256112779883167e+283-2.253002003455494e+283j),
|
| 297 |
+
5e-13,),
|
| 298 |
+
],
|
| 299 |
+
)
|
| 300 |
+
def test_riemann_zeta_complex_avoid_underflow(z, desired, rtol):
|
| 301 |
+
assert_allclose(sc.zeta(z), desired, rtol=rtol)
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__init__.py
ADDED
|
@@ -0,0 +1,672 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""
|
| 2 |
+
.. _statsrefmanual:
|
| 3 |
+
|
| 4 |
+
==========================================
|
| 5 |
+
Statistical functions (:mod:`scipy.stats`)
|
| 6 |
+
==========================================
|
| 7 |
+
|
| 8 |
+
.. currentmodule:: scipy.stats
|
| 9 |
+
|
| 10 |
+
This module contains a large number of probability distributions,
|
| 11 |
+
summary and frequency statistics, correlation functions and statistical
|
| 12 |
+
tests, masked statistics, kernel density estimation, quasi-Monte Carlo
|
| 13 |
+
functionality, and more.
|
| 14 |
+
|
| 15 |
+
Statistics is a very large area, and there are topics that are out of scope
|
| 16 |
+
for SciPy and are covered by other packages. Some of the most important ones
|
| 17 |
+
are:
|
| 18 |
+
|
| 19 |
+
- `statsmodels <https://www.statsmodels.org/stable/index.html>`__:
|
| 20 |
+
regression, linear models, time series analysis, extensions to topics
|
| 21 |
+
also covered by ``scipy.stats``.
|
| 22 |
+
- `Pandas <https://pandas.pydata.org/>`__: tabular data, time series
|
| 23 |
+
functionality, interfaces to other statistical languages.
|
| 24 |
+
- `PyMC <https://docs.pymc.io/>`__: Bayesian statistical
|
| 25 |
+
modeling, probabilistic machine learning.
|
| 26 |
+
- `scikit-learn <https://scikit-learn.org/>`__: classification, regression,
|
| 27 |
+
model selection.
|
| 28 |
+
- `Seaborn <https://seaborn.pydata.org/>`__: statistical data visualization.
|
| 29 |
+
- `rpy2 <https://rpy2.github.io/>`__: Python to R bridge.
|
| 30 |
+
|
| 31 |
+
|
| 32 |
+
Probability distributions
|
| 33 |
+
=========================
|
| 34 |
+
|
| 35 |
+
Each univariate distribution is an instance of a subclass of `rv_continuous`
|
| 36 |
+
(`rv_discrete` for discrete distributions):
|
| 37 |
+
|
| 38 |
+
.. autosummary::
|
| 39 |
+
:toctree: generated/
|
| 40 |
+
|
| 41 |
+
rv_continuous
|
| 42 |
+
rv_discrete
|
| 43 |
+
rv_histogram
|
| 44 |
+
|
| 45 |
+
Continuous distributions
|
| 46 |
+
------------------------
|
| 47 |
+
|
| 48 |
+
.. autosummary::
|
| 49 |
+
:toctree: generated/
|
| 50 |
+
|
| 51 |
+
alpha -- Alpha
|
| 52 |
+
anglit -- Anglit
|
| 53 |
+
arcsine -- Arcsine
|
| 54 |
+
argus -- Argus
|
| 55 |
+
beta -- Beta
|
| 56 |
+
betaprime -- Beta Prime
|
| 57 |
+
bradford -- Bradford
|
| 58 |
+
burr -- Burr (Type III)
|
| 59 |
+
burr12 -- Burr (Type XII)
|
| 60 |
+
cauchy -- Cauchy
|
| 61 |
+
chi -- Chi
|
| 62 |
+
chi2 -- Chi-squared
|
| 63 |
+
cosine -- Cosine
|
| 64 |
+
crystalball -- Crystalball
|
| 65 |
+
dgamma -- Double Gamma
|
| 66 |
+
dpareto_lognorm -- Double Pareto Lognormal
|
| 67 |
+
dweibull -- Double Weibull
|
| 68 |
+
erlang -- Erlang
|
| 69 |
+
expon -- Exponential
|
| 70 |
+
exponnorm -- Exponentially Modified Normal
|
| 71 |
+
exponweib -- Exponentiated Weibull
|
| 72 |
+
exponpow -- Exponential Power
|
| 73 |
+
f -- F (Snecdor F)
|
| 74 |
+
fatiguelife -- Fatigue Life (Birnbaum-Saunders)
|
| 75 |
+
fisk -- Fisk
|
| 76 |
+
foldcauchy -- Folded Cauchy
|
| 77 |
+
foldnorm -- Folded Normal
|
| 78 |
+
genlogistic -- Generalized Logistic
|
| 79 |
+
gennorm -- Generalized normal
|
| 80 |
+
genpareto -- Generalized Pareto
|
| 81 |
+
genexpon -- Generalized Exponential
|
| 82 |
+
genextreme -- Generalized Extreme Value
|
| 83 |
+
gausshyper -- Gauss Hypergeometric
|
| 84 |
+
gamma -- Gamma
|
| 85 |
+
gengamma -- Generalized gamma
|
| 86 |
+
genhalflogistic -- Generalized Half Logistic
|
| 87 |
+
genhyperbolic -- Generalized Hyperbolic
|
| 88 |
+
geninvgauss -- Generalized Inverse Gaussian
|
| 89 |
+
gibrat -- Gibrat
|
| 90 |
+
gompertz -- Gompertz (Truncated Gumbel)
|
| 91 |
+
gumbel_r -- Right Sided Gumbel, Log-Weibull, Fisher-Tippett, Extreme Value Type I
|
| 92 |
+
gumbel_l -- Left Sided Gumbel, etc.
|
| 93 |
+
halfcauchy -- Half Cauchy
|
| 94 |
+
halflogistic -- Half Logistic
|
| 95 |
+
halfnorm -- Half Normal
|
| 96 |
+
halfgennorm -- Generalized Half Normal
|
| 97 |
+
hypsecant -- Hyperbolic Secant
|
| 98 |
+
invgamma -- Inverse Gamma
|
| 99 |
+
invgauss -- Inverse Gaussian
|
| 100 |
+
invweibull -- Inverse Weibull
|
| 101 |
+
irwinhall -- Irwin-Hall
|
| 102 |
+
jf_skew_t -- Jones and Faddy Skew-T
|
| 103 |
+
johnsonsb -- Johnson SB
|
| 104 |
+
johnsonsu -- Johnson SU
|
| 105 |
+
kappa4 -- Kappa 4 parameter
|
| 106 |
+
kappa3 -- Kappa 3 parameter
|
| 107 |
+
ksone -- Distribution of Kolmogorov-Smirnov one-sided test statistic
|
| 108 |
+
kstwo -- Distribution of Kolmogorov-Smirnov two-sided test statistic
|
| 109 |
+
kstwobign -- Limiting Distribution of scaled Kolmogorov-Smirnov two-sided test statistic.
|
| 110 |
+
landau -- Landau
|
| 111 |
+
laplace -- Laplace
|
| 112 |
+
laplace_asymmetric -- Asymmetric Laplace
|
| 113 |
+
levy -- Levy
|
| 114 |
+
levy_l
|
| 115 |
+
levy_stable
|
| 116 |
+
logistic -- Logistic
|
| 117 |
+
loggamma -- Log-Gamma
|
| 118 |
+
loglaplace -- Log-Laplace (Log Double Exponential)
|
| 119 |
+
lognorm -- Log-Normal
|
| 120 |
+
loguniform -- Log-Uniform
|
| 121 |
+
lomax -- Lomax (Pareto of the second kind)
|
| 122 |
+
maxwell -- Maxwell
|
| 123 |
+
mielke -- Mielke's Beta-Kappa
|
| 124 |
+
moyal -- Moyal
|
| 125 |
+
nakagami -- Nakagami
|
| 126 |
+
ncx2 -- Non-central chi-squared
|
| 127 |
+
ncf -- Non-central F
|
| 128 |
+
nct -- Non-central Student's T
|
| 129 |
+
norm -- Normal (Gaussian)
|
| 130 |
+
norminvgauss -- Normal Inverse Gaussian
|
| 131 |
+
pareto -- Pareto
|
| 132 |
+
pearson3 -- Pearson type III
|
| 133 |
+
powerlaw -- Power-function
|
| 134 |
+
powerlognorm -- Power log normal
|
| 135 |
+
powernorm -- Power normal
|
| 136 |
+
rdist -- R-distribution
|
| 137 |
+
rayleigh -- Rayleigh
|
| 138 |
+
rel_breitwigner -- Relativistic Breit-Wigner
|
| 139 |
+
rice -- Rice
|
| 140 |
+
recipinvgauss -- Reciprocal Inverse Gaussian
|
| 141 |
+
semicircular -- Semicircular
|
| 142 |
+
skewcauchy -- Skew Cauchy
|
| 143 |
+
skewnorm -- Skew normal
|
| 144 |
+
studentized_range -- Studentized Range
|
| 145 |
+
t -- Student's T
|
| 146 |
+
trapezoid -- Trapezoidal
|
| 147 |
+
triang -- Triangular
|
| 148 |
+
truncexpon -- Truncated Exponential
|
| 149 |
+
truncnorm -- Truncated Normal
|
| 150 |
+
truncpareto -- Truncated Pareto
|
| 151 |
+
truncweibull_min -- Truncated minimum Weibull distribution
|
| 152 |
+
tukeylambda -- Tukey-Lambda
|
| 153 |
+
uniform -- Uniform
|
| 154 |
+
vonmises -- Von-Mises (Circular)
|
| 155 |
+
vonmises_line -- Von-Mises (Line)
|
| 156 |
+
wald -- Wald
|
| 157 |
+
weibull_min -- Minimum Weibull (see Frechet)
|
| 158 |
+
weibull_max -- Maximum Weibull (see Frechet)
|
| 159 |
+
wrapcauchy -- Wrapped Cauchy
|
| 160 |
+
|
| 161 |
+
The ``fit`` method of the univariate continuous distributions uses
|
| 162 |
+
maximum likelihood estimation to fit the distribution to a data set.
|
| 163 |
+
The ``fit`` method can accept regular data or *censored data*.
|
| 164 |
+
Censored data is represented with instances of the `CensoredData`
|
| 165 |
+
class.
|
| 166 |
+
|
| 167 |
+
.. autosummary::
|
| 168 |
+
:toctree: generated/
|
| 169 |
+
|
| 170 |
+
CensoredData
|
| 171 |
+
|
| 172 |
+
|
| 173 |
+
Multivariate distributions
|
| 174 |
+
--------------------------
|
| 175 |
+
|
| 176 |
+
.. autosummary::
|
| 177 |
+
:toctree: generated/
|
| 178 |
+
|
| 179 |
+
multivariate_normal -- Multivariate normal distribution
|
| 180 |
+
matrix_normal -- Matrix normal distribution
|
| 181 |
+
dirichlet -- Dirichlet
|
| 182 |
+
dirichlet_multinomial -- Dirichlet multinomial distribution
|
| 183 |
+
wishart -- Wishart
|
| 184 |
+
invwishart -- Inverse Wishart
|
| 185 |
+
multinomial -- Multinomial distribution
|
| 186 |
+
special_ortho_group -- SO(N) group
|
| 187 |
+
ortho_group -- O(N) group
|
| 188 |
+
unitary_group -- U(N) group
|
| 189 |
+
random_correlation -- random correlation matrices
|
| 190 |
+
multivariate_t -- Multivariate t-distribution
|
| 191 |
+
multivariate_hypergeom -- Multivariate hypergeometric distribution
|
| 192 |
+
normal_inverse_gamma -- Normal-inverse-gamma distribution
|
| 193 |
+
random_table -- Distribution of random tables with given marginals
|
| 194 |
+
uniform_direction -- Uniform distribution on S(N-1)
|
| 195 |
+
vonmises_fisher -- Von Mises-Fisher distribution
|
| 196 |
+
matrix_t -- Matrix variate t distribution
|
| 197 |
+
|
| 198 |
+
`scipy.stats.multivariate_normal` methods accept instances
|
| 199 |
+
of the following class to represent the covariance.
|
| 200 |
+
|
| 201 |
+
.. autosummary::
|
| 202 |
+
:toctree: generated/
|
| 203 |
+
|
| 204 |
+
Covariance -- Representation of a covariance matrix
|
| 205 |
+
|
| 206 |
+
|
| 207 |
+
Discrete distributions
|
| 208 |
+
----------------------
|
| 209 |
+
|
| 210 |
+
.. autosummary::
|
| 211 |
+
:toctree: generated/
|
| 212 |
+
|
| 213 |
+
bernoulli -- Bernoulli
|
| 214 |
+
betabinom -- Beta-Binomial
|
| 215 |
+
betanbinom -- Beta-Negative Binomial
|
| 216 |
+
binom -- Binomial
|
| 217 |
+
boltzmann -- Boltzmann (Truncated Discrete Exponential)
|
| 218 |
+
dlaplace -- Discrete Laplacian
|
| 219 |
+
geom -- Geometric
|
| 220 |
+
hypergeom -- Hypergeometric
|
| 221 |
+
logser -- Logarithmic (Log-Series, Series)
|
| 222 |
+
nbinom -- Negative Binomial
|
| 223 |
+
nchypergeom_fisher -- Fisher's Noncentral Hypergeometric
|
| 224 |
+
nchypergeom_wallenius -- Wallenius's Noncentral Hypergeometric
|
| 225 |
+
nhypergeom -- Negative Hypergeometric
|
| 226 |
+
planck -- Planck (Discrete Exponential)
|
| 227 |
+
poisson -- Poisson
|
| 228 |
+
poisson_binom -- Poisson Binomial
|
| 229 |
+
randint -- Discrete Uniform
|
| 230 |
+
skellam -- Skellam
|
| 231 |
+
yulesimon -- Yule-Simon
|
| 232 |
+
zipf -- Zipf (Zeta)
|
| 233 |
+
zipfian -- Zipfian
|
| 234 |
+
|
| 235 |
+
|
| 236 |
+
An overview of statistical functions is given below. Many of these functions
|
| 237 |
+
have a similar version in `scipy.stats.mstats` which work for masked arrays.
|
| 238 |
+
|
| 239 |
+
Summary statistics
|
| 240 |
+
==================
|
| 241 |
+
|
| 242 |
+
.. autosummary::
|
| 243 |
+
:toctree: generated/
|
| 244 |
+
|
| 245 |
+
describe -- Descriptive statistics
|
| 246 |
+
gmean -- Geometric mean
|
| 247 |
+
hmean -- Harmonic mean
|
| 248 |
+
pmean -- Power mean
|
| 249 |
+
kurtosis -- Fisher or Pearson kurtosis
|
| 250 |
+
mode -- Modal value
|
| 251 |
+
moment -- Central moment
|
| 252 |
+
lmoment
|
| 253 |
+
expectile -- Expectile
|
| 254 |
+
skew -- Skewness
|
| 255 |
+
kstat --
|
| 256 |
+
kstatvar --
|
| 257 |
+
tmean -- Truncated arithmetic mean
|
| 258 |
+
tvar -- Truncated variance
|
| 259 |
+
tmin --
|
| 260 |
+
tmax --
|
| 261 |
+
tstd --
|
| 262 |
+
tsem --
|
| 263 |
+
variation -- Coefficient of variation
|
| 264 |
+
rankdata
|
| 265 |
+
tiecorrect
|
| 266 |
+
trim_mean
|
| 267 |
+
gstd -- Geometric Standard Deviation
|
| 268 |
+
iqr
|
| 269 |
+
sem
|
| 270 |
+
bayes_mvs
|
| 271 |
+
mvsdist
|
| 272 |
+
entropy
|
| 273 |
+
differential_entropy
|
| 274 |
+
median_abs_deviation
|
| 275 |
+
|
| 276 |
+
Frequency statistics
|
| 277 |
+
====================
|
| 278 |
+
|
| 279 |
+
.. autosummary::
|
| 280 |
+
:toctree: generated/
|
| 281 |
+
|
| 282 |
+
cumfreq
|
| 283 |
+
quantile
|
| 284 |
+
percentileofscore
|
| 285 |
+
scoreatpercentile
|
| 286 |
+
relfreq
|
| 287 |
+
|
| 288 |
+
.. autosummary::
|
| 289 |
+
:toctree: generated/
|
| 290 |
+
|
| 291 |
+
binned_statistic -- Compute a binned statistic for a set of data.
|
| 292 |
+
binned_statistic_2d -- Compute a 2-D binned statistic for a set of data.
|
| 293 |
+
binned_statistic_dd -- Compute a d-D binned statistic for a set of data.
|
| 294 |
+
|
| 295 |
+
.. _hypotests:
|
| 296 |
+
|
| 297 |
+
Hypothesis Tests and related functions
|
| 298 |
+
======================================
|
| 299 |
+
SciPy has many functions for performing hypothesis tests that return a
|
| 300 |
+
test statistic and a p-value, and several of them return confidence intervals
|
| 301 |
+
and/or other related information.
|
| 302 |
+
|
| 303 |
+
The headings below are based on common uses of the functions within, but due to
|
| 304 |
+
the wide variety of statistical procedures, any attempt at coarse-grained
|
| 305 |
+
categorization will be imperfect. Also, note that tests within the same heading
|
| 306 |
+
are not interchangeable in general (e.g. many have different distributional
|
| 307 |
+
assumptions).
|
| 308 |
+
|
| 309 |
+
One Sample Tests / Paired Sample Tests
|
| 310 |
+
--------------------------------------
|
| 311 |
+
One sample tests are typically used to assess whether a single sample was
|
| 312 |
+
drawn from a specified distribution or a distribution with specified properties
|
| 313 |
+
(e.g. zero mean).
|
| 314 |
+
|
| 315 |
+
.. autosummary::
|
| 316 |
+
:toctree: generated/
|
| 317 |
+
|
| 318 |
+
ttest_1samp
|
| 319 |
+
binomtest
|
| 320 |
+
quantile_test
|
| 321 |
+
skewtest
|
| 322 |
+
kurtosistest
|
| 323 |
+
normaltest
|
| 324 |
+
jarque_bera
|
| 325 |
+
shapiro
|
| 326 |
+
anderson
|
| 327 |
+
cramervonmises
|
| 328 |
+
ks_1samp
|
| 329 |
+
goodness_of_fit
|
| 330 |
+
chisquare
|
| 331 |
+
power_divergence
|
| 332 |
+
|
| 333 |
+
Paired sample tests are often used to assess whether two samples were drawn
|
| 334 |
+
from the same distribution; they differ from the independent sample tests below
|
| 335 |
+
in that each observation in one sample is treated as paired with a
|
| 336 |
+
closely-related observation in the other sample (e.g. when environmental
|
| 337 |
+
factors are controlled between observations within a pair but not among pairs).
|
| 338 |
+
They can also be interpreted or used as one-sample tests (e.g. tests on the
|
| 339 |
+
mean or median of *differences* between paired observations).
|
| 340 |
+
|
| 341 |
+
.. autosummary::
|
| 342 |
+
:toctree: generated/
|
| 343 |
+
|
| 344 |
+
ttest_rel
|
| 345 |
+
wilcoxon
|
| 346 |
+
|
| 347 |
+
Association/Correlation Tests
|
| 348 |
+
-----------------------------
|
| 349 |
+
|
| 350 |
+
These tests are often used to assess whether there is a relationship (e.g.
|
| 351 |
+
linear) between paired observations in multiple samples or among the
|
| 352 |
+
coordinates of multivariate observations.
|
| 353 |
+
|
| 354 |
+
.. autosummary::
|
| 355 |
+
:toctree: generated/
|
| 356 |
+
|
| 357 |
+
linregress
|
| 358 |
+
pearsonr
|
| 359 |
+
spearmanrho
|
| 360 |
+
pointbiserialr
|
| 361 |
+
kendalltau
|
| 362 |
+
chatterjeexi
|
| 363 |
+
weightedtau
|
| 364 |
+
somersd
|
| 365 |
+
siegelslopes
|
| 366 |
+
theilslopes
|
| 367 |
+
page_trend_test
|
| 368 |
+
multiscale_graphcorr
|
| 369 |
+
spearmanr
|
| 370 |
+
|
| 371 |
+
These association tests and are to work with samples in the form of contingency
|
| 372 |
+
tables. Supporting functions are available in `scipy.stats.contingency`.
|
| 373 |
+
|
| 374 |
+
.. autosummary::
|
| 375 |
+
:toctree: generated/
|
| 376 |
+
|
| 377 |
+
chi2_contingency
|
| 378 |
+
fisher_exact
|
| 379 |
+
barnard_exact
|
| 380 |
+
boschloo_exact
|
| 381 |
+
|
| 382 |
+
Independent Sample Tests
|
| 383 |
+
------------------------
|
| 384 |
+
Independent sample tests are typically used to assess whether multiple samples
|
| 385 |
+
were independently drawn from the same distribution or different distributions
|
| 386 |
+
with a shared property (e.g. equal means).
|
| 387 |
+
|
| 388 |
+
Some tests are specifically for comparing two samples.
|
| 389 |
+
|
| 390 |
+
.. autosummary::
|
| 391 |
+
:toctree: generated/
|
| 392 |
+
|
| 393 |
+
ttest_ind_from_stats
|
| 394 |
+
poisson_means_test
|
| 395 |
+
ttest_ind
|
| 396 |
+
mannwhitneyu
|
| 397 |
+
bws_test
|
| 398 |
+
ranksums
|
| 399 |
+
brunnermunzel
|
| 400 |
+
mood
|
| 401 |
+
ansari
|
| 402 |
+
cramervonmises_2samp
|
| 403 |
+
epps_singleton_2samp
|
| 404 |
+
ks_2samp
|
| 405 |
+
kstest
|
| 406 |
+
|
| 407 |
+
Others are generalized to multiple samples.
|
| 408 |
+
|
| 409 |
+
.. autosummary::
|
| 410 |
+
:toctree: generated/
|
| 411 |
+
|
| 412 |
+
f_oneway
|
| 413 |
+
tukey_hsd
|
| 414 |
+
dunnett
|
| 415 |
+
kruskal
|
| 416 |
+
alexandergovern
|
| 417 |
+
fligner
|
| 418 |
+
levene
|
| 419 |
+
bartlett
|
| 420 |
+
median_test
|
| 421 |
+
friedmanchisquare
|
| 422 |
+
anderson_ksamp
|
| 423 |
+
|
| 424 |
+
Resampling and Monte Carlo Methods
|
| 425 |
+
----------------------------------
|
| 426 |
+
The following functions can reproduce the p-value and confidence interval
|
| 427 |
+
results of most of the functions above, and often produce accurate results in a
|
| 428 |
+
wider variety of conditions. They can also be used to perform hypothesis tests
|
| 429 |
+
and generate confidence intervals for custom statistics. This flexibility comes
|
| 430 |
+
at the cost of greater computational requirements and stochastic results.
|
| 431 |
+
|
| 432 |
+
.. autosummary::
|
| 433 |
+
:toctree: generated/
|
| 434 |
+
|
| 435 |
+
monte_carlo_test
|
| 436 |
+
permutation_test
|
| 437 |
+
bootstrap
|
| 438 |
+
power
|
| 439 |
+
|
| 440 |
+
Instances of the following object can be passed into some hypothesis test
|
| 441 |
+
functions to perform a resampling or Monte Carlo version of the hypothesis
|
| 442 |
+
test.
|
| 443 |
+
|
| 444 |
+
.. autosummary::
|
| 445 |
+
:toctree: generated/
|
| 446 |
+
|
| 447 |
+
MonteCarloMethod
|
| 448 |
+
PermutationMethod
|
| 449 |
+
BootstrapMethod
|
| 450 |
+
|
| 451 |
+
Multiple Hypothesis Testing and Meta-Analysis
|
| 452 |
+
---------------------------------------------
|
| 453 |
+
These functions are for assessing the results of individual tests as a whole.
|
| 454 |
+
Functions for performing specific multiple hypothesis tests (e.g. post hoc
|
| 455 |
+
tests) are listed above.
|
| 456 |
+
|
| 457 |
+
.. autosummary::
|
| 458 |
+
:toctree: generated/
|
| 459 |
+
|
| 460 |
+
combine_pvalues
|
| 461 |
+
false_discovery_control
|
| 462 |
+
|
| 463 |
+
|
| 464 |
+
The following functions are related to the tests above but do not belong in the
|
| 465 |
+
above categories.
|
| 466 |
+
|
| 467 |
+
Random Variables
|
| 468 |
+
================
|
| 469 |
+
|
| 470 |
+
.. autosummary::
|
| 471 |
+
:toctree: generated/
|
| 472 |
+
|
| 473 |
+
make_distribution
|
| 474 |
+
Normal
|
| 475 |
+
Logistic
|
| 476 |
+
Uniform
|
| 477 |
+
Binomial
|
| 478 |
+
Mixture
|
| 479 |
+
order_statistic
|
| 480 |
+
truncate
|
| 481 |
+
abs
|
| 482 |
+
exp
|
| 483 |
+
log
|
| 484 |
+
|
| 485 |
+
Quasi-Monte Carlo
|
| 486 |
+
=================
|
| 487 |
+
|
| 488 |
+
.. toctree::
|
| 489 |
+
:maxdepth: 4
|
| 490 |
+
|
| 491 |
+
stats.qmc
|
| 492 |
+
|
| 493 |
+
Contingency Tables
|
| 494 |
+
==================
|
| 495 |
+
|
| 496 |
+
.. toctree::
|
| 497 |
+
:maxdepth: 4
|
| 498 |
+
|
| 499 |
+
stats.contingency
|
| 500 |
+
|
| 501 |
+
Masked statistics functions
|
| 502 |
+
===========================
|
| 503 |
+
|
| 504 |
+
.. toctree::
|
| 505 |
+
|
| 506 |
+
stats.mstats
|
| 507 |
+
|
| 508 |
+
|
| 509 |
+
Other statistical functionality
|
| 510 |
+
===============================
|
| 511 |
+
|
| 512 |
+
Transformations
|
| 513 |
+
---------------
|
| 514 |
+
|
| 515 |
+
.. autosummary::
|
| 516 |
+
:toctree: generated/
|
| 517 |
+
|
| 518 |
+
boxcox
|
| 519 |
+
boxcox_normmax
|
| 520 |
+
boxcox_llf
|
| 521 |
+
yeojohnson
|
| 522 |
+
yeojohnson_normmax
|
| 523 |
+
yeojohnson_llf
|
| 524 |
+
obrientransform
|
| 525 |
+
sigmaclip
|
| 526 |
+
trimboth
|
| 527 |
+
trim1
|
| 528 |
+
zmap
|
| 529 |
+
zscore
|
| 530 |
+
gzscore
|
| 531 |
+
|
| 532 |
+
Statistical distances
|
| 533 |
+
---------------------
|
| 534 |
+
|
| 535 |
+
.. autosummary::
|
| 536 |
+
:toctree: generated/
|
| 537 |
+
|
| 538 |
+
wasserstein_distance
|
| 539 |
+
wasserstein_distance_nd
|
| 540 |
+
energy_distance
|
| 541 |
+
|
| 542 |
+
Sampling
|
| 543 |
+
--------
|
| 544 |
+
|
| 545 |
+
.. toctree::
|
| 546 |
+
:maxdepth: 4
|
| 547 |
+
|
| 548 |
+
stats.sampling
|
| 549 |
+
|
| 550 |
+
Fitting / Survival Analysis
|
| 551 |
+
---------------------------
|
| 552 |
+
|
| 553 |
+
.. autosummary::
|
| 554 |
+
:toctree: generated/
|
| 555 |
+
|
| 556 |
+
fit
|
| 557 |
+
ecdf
|
| 558 |
+
logrank
|
| 559 |
+
|
| 560 |
+
Directional statistical functions
|
| 561 |
+
---------------------------------
|
| 562 |
+
|
| 563 |
+
.. autosummary::
|
| 564 |
+
:toctree: generated/
|
| 565 |
+
|
| 566 |
+
directional_stats
|
| 567 |
+
circmean
|
| 568 |
+
circvar
|
| 569 |
+
circstd
|
| 570 |
+
|
| 571 |
+
Sensitivity Analysis
|
| 572 |
+
--------------------
|
| 573 |
+
|
| 574 |
+
.. autosummary::
|
| 575 |
+
:toctree: generated/
|
| 576 |
+
|
| 577 |
+
sobol_indices
|
| 578 |
+
|
| 579 |
+
Plot-tests
|
| 580 |
+
----------
|
| 581 |
+
|
| 582 |
+
.. autosummary::
|
| 583 |
+
:toctree: generated/
|
| 584 |
+
|
| 585 |
+
ppcc_max
|
| 586 |
+
ppcc_plot
|
| 587 |
+
probplot
|
| 588 |
+
boxcox_normplot
|
| 589 |
+
yeojohnson_normplot
|
| 590 |
+
|
| 591 |
+
Univariate and multivariate kernel density estimation
|
| 592 |
+
-----------------------------------------------------
|
| 593 |
+
|
| 594 |
+
.. autosummary::
|
| 595 |
+
:toctree: generated/
|
| 596 |
+
|
| 597 |
+
gaussian_kde
|
| 598 |
+
|
| 599 |
+
Warnings / Errors used in :mod:`scipy.stats`
|
| 600 |
+
--------------------------------------------
|
| 601 |
+
|
| 602 |
+
.. autosummary::
|
| 603 |
+
:toctree: generated/
|
| 604 |
+
|
| 605 |
+
DegenerateDataWarning
|
| 606 |
+
ConstantInputWarning
|
| 607 |
+
NearConstantInputWarning
|
| 608 |
+
FitError
|
| 609 |
+
|
| 610 |
+
Result classes used in :mod:`scipy.stats`
|
| 611 |
+
-----------------------------------------
|
| 612 |
+
|
| 613 |
+
.. warning::
|
| 614 |
+
|
| 615 |
+
These classes are private, but they are included here because instances
|
| 616 |
+
of them are returned by other statistical functions. User import and
|
| 617 |
+
instantiation is not supported.
|
| 618 |
+
|
| 619 |
+
.. toctree::
|
| 620 |
+
:maxdepth: 2
|
| 621 |
+
|
| 622 |
+
stats._result_classes
|
| 623 |
+
|
| 624 |
+
""" # noqa: E501
|
| 625 |
+
|
| 626 |
+
from ._warnings_errors import (ConstantInputWarning, NearConstantInputWarning,
|
| 627 |
+
DegenerateDataWarning, FitError)
|
| 628 |
+
from ._stats_py import *
|
| 629 |
+
from ._variation import variation
|
| 630 |
+
from .distributions import *
|
| 631 |
+
from ._morestats import *
|
| 632 |
+
from ._multicomp import *
|
| 633 |
+
from ._binomtest import binomtest
|
| 634 |
+
from ._binned_statistic import *
|
| 635 |
+
from ._kde import gaussian_kde
|
| 636 |
+
from . import mstats
|
| 637 |
+
from . import qmc
|
| 638 |
+
from ._multivariate import *
|
| 639 |
+
from . import contingency
|
| 640 |
+
from .contingency import chi2_contingency
|
| 641 |
+
from ._censored_data import CensoredData
|
| 642 |
+
from ._resampling import (bootstrap, monte_carlo_test, permutation_test, power,
|
| 643 |
+
MonteCarloMethod, PermutationMethod, BootstrapMethod)
|
| 644 |
+
from ._entropy import *
|
| 645 |
+
from ._hypotests import *
|
| 646 |
+
from ._page_trend_test import page_trend_test
|
| 647 |
+
from ._mannwhitneyu import mannwhitneyu
|
| 648 |
+
from ._bws_test import bws_test
|
| 649 |
+
from ._fit import fit, goodness_of_fit
|
| 650 |
+
from ._covariance import Covariance
|
| 651 |
+
from ._sensitivity_analysis import *
|
| 652 |
+
from ._survival import *
|
| 653 |
+
from ._distribution_infrastructure import (
|
| 654 |
+
make_distribution, Mixture, order_statistic, truncate, exp, log, abs
|
| 655 |
+
)
|
| 656 |
+
from ._new_distributions import Normal, Logistic, Uniform, Binomial
|
| 657 |
+
from ._mgc import multiscale_graphcorr
|
| 658 |
+
from ._correlation import chatterjeexi, spearmanrho
|
| 659 |
+
from ._quantile import quantile
|
| 660 |
+
|
| 661 |
+
|
| 662 |
+
# Deprecated namespaces, to be removed in v2.0.0
|
| 663 |
+
from . import (
|
| 664 |
+
biasedurn, kde, morestats, mstats_basic, mstats_extras, mvn, stats
|
| 665 |
+
)
|
| 666 |
+
|
| 667 |
+
|
| 668 |
+
__all__ = [s for s in dir() if not s.startswith("_")] # Remove dunders.
|
| 669 |
+
|
| 670 |
+
from scipy._lib._testutils import PytestTester
|
| 671 |
+
test = PytestTester(__name__)
|
| 672 |
+
del PytestTester
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/__init__.cpython-311.pyc
ADDED
|
Binary file (20.4 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_axis_nan_policy.cpython-311.pyc
ADDED
|
Binary file (39.1 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_binned_statistic.cpython-311.pyc
ADDED
|
Binary file (38.6 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_binomtest.cpython-311.pyc
ADDED
|
Binary file (15.6 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_bws_test.cpython-311.pyc
ADDED
|
Binary file (8.96 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_censored_data.cpython-311.pyc
ADDED
|
Binary file (22.7 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_common.cpython-311.pyc
ADDED
|
Binary file (464 Bytes). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_constants.cpython-311.pyc
ADDED
|
Binary file (894 Bytes). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_continued_fraction.cpython-311.pyc
ADDED
|
Binary file (18.5 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_continuous_distns.cpython-311.pyc
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:d2203f73645080071c406c2fff9034cd66937440889f24322e76a64d4a5c5c86
|
| 3 |
+
size 625361
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_correlation.cpython-311.pyc
ADDED
|
Binary file (17.4 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_covariance.cpython-311.pyc
ADDED
|
Binary file (29.9 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_crosstab.cpython-311.pyc
ADDED
|
Binary file (9.52 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_discrete_distns.cpython-311.pyc
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:be376d5f3701fc2fca05237d0ca7f62b120fb160211c37749ab7e62aa242f50f
|
| 3 |
+
size 104076
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_distn_infrastructure.cpython-311.pyc
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:cf07ce7c10d91dc4055bec6ea5e84271809c5c52bf6eb606f90f4de2b8723563
|
| 3 |
+
size 190060
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_distr_params.cpython-311.pyc
ADDED
|
Binary file (10.7 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_distribution_infrastructure.cpython-311.pyc
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:1661fed21b92a29c6e635e88c72dbb9a1b045af7df5ab52ca5591b20967f0a10
|
| 3 |
+
size 286841
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_entropy.cpython-311.pyc
ADDED
|
Binary file (20.3 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_finite_differences.cpython-311.pyc
ADDED
|
Binary file (5.56 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_fit.cpython-311.pyc
ADDED
|
Binary file (70.4 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_hypotests.cpython-311.pyc
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:6b8ae310afbc07dfb70a7f3886792a8cd2b64ccc5951f2804322e33c26a6fbc1
|
| 3 |
+
size 100473
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_kde.cpython-311.pyc
ADDED
|
Binary file (30.5 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_ksstats.cpython-311.pyc
ADDED
|
Binary file (22.5 kB). View file
|
|
|
physworld_p1_20261018/envs/p1/lib/python3.11/site-packages/scipy/stats/__pycache__/_mannwhitneyu.cpython-311.pyc
ADDED
|
Binary file (22.4 kB). View file
|
|
|