merge code dirs 1031 (part 13)
Browse filesThis view is limited to 50 files because it contains too many changes. See raw diff
- .gitattributes +49 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/INSTALLER +1 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/METADATA +139 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/RECORD +0 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/REQUESTED +0 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/WHEEL +6 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/entry_points.txt +13 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/LICENSE.txt +935 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/_core/include/numpy/libdivide/LICENSE.txt +21 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/_core/src/common/pythoncapi-compat/COPYING +14 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/_core/src/highway/LICENSE +371 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/_core/src/multiarray/dragon4_LICENSE.txt +27 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/_core/src/npysort/x86-simd-sort/LICENSE.md +28 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/_core/src/umath/svml/LICENSE +30 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/fft/pocketfft/LICENSE.md +25 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/linalg/lapack_lite/LICENSE.txt +48 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/ma/LICENSE +24 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/LICENSE.md +71 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/src/distributions/LICENSE.md +61 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/src/mt19937/LICENSE.md +61 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/src/pcg64/LICENSE.md +22 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/src/philox/LICENSE.md +31 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/src/sfc64/LICENSE.md +27 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/src/splitmix64/LICENSE.md +9 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy.libs/libgfortran-83c28eba-468e71e5.so.5.0.0 +3 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy.libs/libquadmath-2284e583-a9307bba.so.0.0.0 +3 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy.libs/libscipy_openblas64_-61654e39.so +3 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/random.pyi +1357 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/rec.pyi +177 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/scalars.pyi +288 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/shape.pyi +13 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/shape_base.pyi +84 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/stride_tricks.pyi +27 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/strings.pyi +198 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/testing.pyi +196 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/twodim_base.pyi +231 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/type_check.pyi +94 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/ufunc_config.pyi +30 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/ufunclike.pyi +31 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/ufuncs.pyi +142 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/warnings_and_errors.pyi +11 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/test_isfile.py +35 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/test_runtime.py +103 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/test_typing.py +207 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/version.py +11 -0
- Video-RSI/.venv/lib/python3.12/site-packages/numpy/version.pyi +9 -0
- Video-RSI/.venv/lib/python3.12/site-packages/omegaconf-2.3.1.dist-info/INSTALLER +1 -0
- Video-RSI/.venv/lib/python3.12/site-packages/omegaconf-2.3.1.dist-info/METADATA +85 -0
- Video-RSI/.venv/lib/python3.12/site-packages/omegaconf-2.3.1.dist-info/RECORD +58 -0
- Video-RSI/.venv/lib/python3.12/site-packages/omegaconf-2.3.1.dist-info/REQUESTED +0 -0
.gitattributes
CHANGED
|
@@ -229,3 +229,52 @@ Video-RSI/.venv/lib/python3.12/site-packages/numpy/random/_pcg64.cpython-312-x86
|
|
| 229 |
Video-RSI/.venv/lib/python3.12/site-packages/numpy/random/_philox.cpython-312-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 230 |
Video-RSI/.venv/lib/python3.12/site-packages/numpy/random/bit_generator.cpython-312-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 231 |
Video-RSI/.venv/lib/python3.12/site-packages/numpy/random/mtrand.cpython-312-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 229 |
Video-RSI/.venv/lib/python3.12/site-packages/numpy/random/_philox.cpython-312-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 230 |
Video-RSI/.venv/lib/python3.12/site-packages/numpy/random/bit_generator.cpython-312-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 231 |
Video-RSI/.venv/lib/python3.12/site-packages/numpy/random/mtrand.cpython-312-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 232 |
+
Video-RSI/.venv/lib/python3.12/site-packages/numpy.libs/libgfortran-83c28eba-468e71e5.so.5.0.0 filter=lfs diff=lfs merge=lfs -text
|
| 233 |
+
Video-RSI/.venv/lib/python3.12/site-packages/numpy.libs/libquadmath-2284e583-a9307bba.so.0.0.0 filter=lfs diff=lfs merge=lfs -text
|
| 234 |
+
Video-RSI/.venv/lib/python3.12/site-packages/numpy.libs/libscipy_openblas64_-61654e39.so filter=lfs diff=lfs merge=lfs -text
|
| 235 |
+
Video-RSI/.venv/lib/python3.12/site-packages/onnxruntime/capi/libonnxruntime.so.1.29.0 filter=lfs diff=lfs merge=lfs -text
|
| 236 |
+
Video-RSI/.venv/lib/python3.12/site-packages/onnxruntime/capi/onnxruntime_pybind11_state.cpython-312-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
| 237 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libQt5Core-9088e21b.so.5.15.19 filter=lfs diff=lfs merge=lfs -text
|
| 238 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libQt5Gui-afbd4980.so.5.15.19 filter=lfs diff=lfs merge=lfs -text
|
| 239 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libQt5Test-2553f470.so.5.15.19 filter=lfs diff=lfs merge=lfs -text
|
| 240 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libQt5Widgets-5be2f68b.so.5.15.19 filter=lfs diff=lfs merge=lfs -text
|
| 241 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libQt5XcbQpa-bb93e554.so.5.15.19 filter=lfs diff=lfs merge=lfs -text
|
| 242 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libaom-a0d22147.so.3.14.1 filter=lfs diff=lfs merge=lfs -text
|
| 243 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libavcodec-c4204469.so.62.28.101 filter=lfs diff=lfs merge=lfs -text
|
| 244 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libavdevice-f388f22c.so.62.3.101 filter=lfs diff=lfs merge=lfs -text
|
| 245 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libavfilter-8d3f2f4f.so.11.14.101 filter=lfs diff=lfs merge=lfs -text
|
| 246 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libavformat-4762a711.so.62.12.101 filter=lfs diff=lfs merge=lfs -text
|
| 247 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libavif-43e630fc.so.16.4.2 filter=lfs diff=lfs merge=lfs -text
|
| 248 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libavutil-befbbc48.so.60.26.101 filter=lfs diff=lfs merge=lfs -text
|
| 249 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libcrypto-5409cd36.so.1.1.1k filter=lfs diff=lfs merge=lfs -text
|
| 250 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libgfortran-83c28eba.so.5.0.0 filter=lfs diff=lfs merge=lfs -text
|
| 251 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libopenblasp-r0-59ffcd50.3.15.so filter=lfs diff=lfs merge=lfs -text
|
| 252 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libpcre2-16-bca4e6b3.so.0.7.1 filter=lfs diff=lfs merge=lfs -text
|
| 253 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libpng16-529cb57a.so.16.58.0 filter=lfs diff=lfs merge=lfs -text
|
| 254 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libquadmath-2284e583.so.0.0.0 filter=lfs diff=lfs merge=lfs -text
|
| 255 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libssl-81259c47.so.1.1.1k filter=lfs diff=lfs merge=lfs -text
|
| 256 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libswresample-2dfded3b.so.6.3.101 filter=lfs diff=lfs merge=lfs -text
|
| 257 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libswscale-fe215b0b.so.9.5.101 filter=lfs diff=lfs merge=lfs -text
|
| 258 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libvpx-4fb239ff.so.11.0.1 filter=lfs diff=lfs merge=lfs -text
|
| 259 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libxcb-randr-562554c2.so.0.1.0 filter=lfs diff=lfs merge=lfs -text
|
| 260 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libxcb-render-161c0eb5.so.0.0.0 filter=lfs diff=lfs merge=lfs -text
|
| 261 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libxcb-xkb-fd53f741.so.1.0.0 filter=lfs diff=lfs merge=lfs -text
|
| 262 |
+
Video-RSI/.venv/lib/python3.12/site-packages/opencv_python.libs/libxkbcommon-de59cad2.so.0.0.0 filter=lfs diff=lfs merge=lfs -text
|
| 263 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/libavif-8a7f9d56.so.16.4.2 filter=lfs diff=lfs merge=lfs -text
|
| 264 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/libbrotlicommon-53534446.so.1.2.0 filter=lfs diff=lfs merge=lfs -text
|
| 265 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/libfreetype-9fc94c80.so.6.20.6 filter=lfs diff=lfs merge=lfs -text
|
| 266 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/libharfbuzz-172d1f63.so.0.61421.0 filter=lfs diff=lfs merge=lfs -text
|
| 267 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/libjpeg-31e2ca52.so.62.4.0 filter=lfs diff=lfs merge=lfs -text
|
| 268 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/liblcms2-dade1fbf.so.2.0.19 filter=lfs diff=lfs merge=lfs -text
|
| 269 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/liblzma-2be87c3e.so.5.8.3 filter=lfs diff=lfs merge=lfs -text
|
| 270 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/libopenjp2-b07f72ad.so.2.5.4 filter=lfs diff=lfs merge=lfs -text
|
| 271 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/libpng16-abb096d5.so.16.58.0 filter=lfs diff=lfs merge=lfs -text
|
| 272 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/libtiff-fc87e79d.so.6.2.0 filter=lfs diff=lfs merge=lfs -text
|
| 273 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/libwebp-51b0b3f7.so.7.2.0 filter=lfs diff=lfs merge=lfs -text
|
| 274 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/libxcb-ad31f5a3.so.1.1.0 filter=lfs diff=lfs merge=lfs -text
|
| 275 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pillow.libs/libzstd-44be1190.so.1.5.7 filter=lfs diff=lfs merge=lfs -text
|
| 276 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pip/_vendor/distlib/t64-arm.exe filter=lfs diff=lfs merge=lfs -text
|
| 277 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pip/_vendor/distlib/t64.exe filter=lfs diff=lfs merge=lfs -text
|
| 278 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pip/_vendor/distlib/w64-arm.exe filter=lfs diff=lfs merge=lfs -text
|
| 279 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pip/_vendor/distlib/w64.exe filter=lfs diff=lfs merge=lfs -text
|
| 280 |
+
Video-RSI/.venv/lib/python3.12/site-packages/pyclipper/_pyclipper.cpython-312-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/INSTALLER
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
pip
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/METADATA
ADDED
|
@@ -0,0 +1,139 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Metadata-Version: 2.4
|
| 2 |
+
Name: numpy
|
| 3 |
+
Version: 2.5.2
|
| 4 |
+
Summary: Fundamental package for array computing in Python
|
| 5 |
+
Author: Travis E. Oliphant et al.
|
| 6 |
+
Maintainer-Email: NumPy Developers <numpy-discussion@python.org>
|
| 7 |
+
License-Expression: BSD-3-Clause AND 0BSD AND MIT AND Zlib AND CC0-1.0
|
| 8 |
+
License-File: LICENSE.txt
|
| 9 |
+
License-File: numpy/_core/include/numpy/libdivide/LICENSE.txt
|
| 10 |
+
License-File: numpy/_core/src/common/pythoncapi-compat/COPYING
|
| 11 |
+
License-File: numpy/_core/src/highway/LICENSE
|
| 12 |
+
License-File: numpy/_core/src/multiarray/dragon4_LICENSE.txt
|
| 13 |
+
License-File: numpy/_core/src/npysort/x86-simd-sort/LICENSE.md
|
| 14 |
+
License-File: numpy/_core/src/umath/svml/LICENSE
|
| 15 |
+
License-File: numpy/fft/pocketfft/LICENSE.md
|
| 16 |
+
License-File: numpy/linalg/lapack_lite/LICENSE.txt
|
| 17 |
+
License-File: numpy/ma/LICENSE
|
| 18 |
+
License-File: numpy/random/LICENSE.md
|
| 19 |
+
License-File: numpy/random/src/distributions/LICENSE.md
|
| 20 |
+
License-File: numpy/random/src/mt19937/LICENSE.md
|
| 21 |
+
License-File: numpy/random/src/pcg64/LICENSE.md
|
| 22 |
+
License-File: numpy/random/src/philox/LICENSE.md
|
| 23 |
+
License-File: numpy/random/src/sfc64/LICENSE.md
|
| 24 |
+
License-File: numpy/random/src/splitmix64/LICENSE.md
|
| 25 |
+
Classifier: Development Status :: 5 - Production/Stable
|
| 26 |
+
Classifier: Intended Audience :: Science/Research
|
| 27 |
+
Classifier: Intended Audience :: Developers
|
| 28 |
+
Classifier: Programming Language :: C
|
| 29 |
+
Classifier: Programming Language :: Python
|
| 30 |
+
Classifier: Programming Language :: Python :: 3
|
| 31 |
+
Classifier: Programming Language :: Python :: 3.12
|
| 32 |
+
Classifier: Programming Language :: Python :: 3.13
|
| 33 |
+
Classifier: Programming Language :: Python :: 3.14
|
| 34 |
+
Classifier: Programming Language :: Python :: 3.15
|
| 35 |
+
Classifier: Programming Language :: Python :: 3 :: Only
|
| 36 |
+
Classifier: Programming Language :: Python :: Implementation :: CPython
|
| 37 |
+
Classifier: Topic :: Software Development
|
| 38 |
+
Classifier: Topic :: Scientific/Engineering
|
| 39 |
+
Classifier: Typing :: Typed
|
| 40 |
+
Classifier: Operating System :: Microsoft :: Windows
|
| 41 |
+
Classifier: Operating System :: POSIX
|
| 42 |
+
Classifier: Operating System :: Unix
|
| 43 |
+
Classifier: Operating System :: MacOS
|
| 44 |
+
Project-URL: homepage, https://numpy.org
|
| 45 |
+
Project-URL: documentation, https://numpy.org/doc/
|
| 46 |
+
Project-URL: source, https://github.com/numpy/numpy
|
| 47 |
+
Project-URL: download, https://pypi.org/project/numpy/#files
|
| 48 |
+
Project-URL: tracker, https://github.com/numpy/numpy/issues
|
| 49 |
+
Project-URL: release notes, https://numpy.org/doc/stable/release
|
| 50 |
+
Requires-Python: >=3.12
|
| 51 |
+
Description-Content-Type: text/markdown
|
| 52 |
+
|
| 53 |
+
<h1 align="center">
|
| 54 |
+
<img src="https://raw.githubusercontent.com/numpy/numpy/main/branding/logo/primary/numpylogo.svg" width="300">
|
| 55 |
+
</h1><br>
|
| 56 |
+
|
| 57 |
+
|
| 58 |
+
[](
|
| 59 |
+
https://numfocus.org)
|
| 60 |
+
[](
|
| 61 |
+
https://pypi.org/project/numpy/)
|
| 62 |
+
[](
|
| 63 |
+
https://anaconda.org/conda-forge/numpy)
|
| 64 |
+
[](
|
| 65 |
+
https://stackoverflow.com/questions/tagged/numpy)
|
| 66 |
+
[](
|
| 67 |
+
https://doi.org/10.1038/s41586-020-2649-2)
|
| 68 |
+
[](https://insights.linuxfoundation.org/project/numpy)
|
| 69 |
+
[](https://securityscorecards.dev/viewer/?uri=github.com/numpy/numpy)
|
| 70 |
+
[](https://pypi.org/project/numpy/)
|
| 71 |
+
|
| 72 |
+
|
| 73 |
+
NumPy is the fundamental package for scientific computing with Python.
|
| 74 |
+
|
| 75 |
+
- **Website:** https://numpy.org
|
| 76 |
+
- **Documentation:** https://numpy.org/doc
|
| 77 |
+
- **Mailing list:** https://mail.python.org/mailman/listinfo/numpy-discussion
|
| 78 |
+
- **Source code:** https://github.com/numpy/numpy
|
| 79 |
+
- **Contributing:** https://numpy.org/devdocs/dev/index.html
|
| 80 |
+
- **Bug reports:** https://github.com/numpy/numpy/issues
|
| 81 |
+
- **Report a security vulnerability:** https://github.com/numpy/numpy/security/policy (via Tidelift)
|
| 82 |
+
|
| 83 |
+
It provides:
|
| 84 |
+
|
| 85 |
+
- a powerful N-dimensional array object
|
| 86 |
+
- sophisticated (broadcasting) functions
|
| 87 |
+
- tools for integrating C/C++ and Fortran code
|
| 88 |
+
- useful linear algebra, Fourier transform, and random number capabilities
|
| 89 |
+
|
| 90 |
+
Testing:
|
| 91 |
+
|
| 92 |
+
NumPy requires `pytest` and `hypothesis`. Tests can then be run after installation with:
|
| 93 |
+
|
| 94 |
+
python -c "import numpy, sys; sys.exit(numpy.test() is False)"
|
| 95 |
+
|
| 96 |
+
Code of Conduct
|
| 97 |
+
----------------------
|
| 98 |
+
|
| 99 |
+
NumPy is a community-driven open source project developed by a diverse group of
|
| 100 |
+
[contributors](https://numpy.org/teams/). The NumPy leadership has made a strong
|
| 101 |
+
commitment to creating an open, inclusive, and positive community. Please read the
|
| 102 |
+
[NumPy Code of Conduct](https://numpy.org/code-of-conduct/) for guidance on how to interact
|
| 103 |
+
with others in a way that makes our community thrive.
|
| 104 |
+
|
| 105 |
+
Call for Contributions
|
| 106 |
+
----------------------
|
| 107 |
+
|
| 108 |
+
The NumPy project welcomes your expertise and enthusiasm!
|
| 109 |
+
|
| 110 |
+
Small improvements or fixes are always appreciated. If you are considering larger contributions
|
| 111 |
+
to the source code, please contact us through the [mailing
|
| 112 |
+
list](https://mail.python.org/mailman/listinfo/numpy-discussion) first.
|
| 113 |
+
|
| 114 |
+
Writing code isn’t the only way to contribute to NumPy. You can also:
|
| 115 |
+
- review pull requests
|
| 116 |
+
- help us stay on top of new and old issues
|
| 117 |
+
- develop tutorials, presentations, and other educational materials
|
| 118 |
+
- maintain and improve [our website](https://github.com/numpy/numpy.org)
|
| 119 |
+
- develop graphic design for our brand assets and promotional materials
|
| 120 |
+
- translate website content
|
| 121 |
+
- help with outreach and onboard new contributors
|
| 122 |
+
- write grant proposals and help with other fundraising efforts
|
| 123 |
+
|
| 124 |
+
For more information about the ways you can contribute to NumPy, visit [our website](https://numpy.org/contribute/).
|
| 125 |
+
If you’re unsure where to start or how your skills fit in, reach out! You can
|
| 126 |
+
ask on the mailing list or here, on GitHub, by opening a new issue or leaving a
|
| 127 |
+
comment on a relevant issue that is already open.
|
| 128 |
+
|
| 129 |
+
Our preferred channels of communication are all public, but if you’d like to
|
| 130 |
+
speak to us in private first, contact our community coordinators at
|
| 131 |
+
numpy-team@googlegroups.com or on Slack (write numpy-team@googlegroups.com for
|
| 132 |
+
an invitation).
|
| 133 |
+
|
| 134 |
+
We also have a biweekly community call, details of which are announced on the
|
| 135 |
+
mailing list. You are very welcome to join.
|
| 136 |
+
|
| 137 |
+
If you are new to contributing to open source, [this
|
| 138 |
+
guide](https://opensource.guide/how-to-contribute/) helps explain why, what,
|
| 139 |
+
and how to successfully get involved.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/RECORD
ADDED
|
The diff for this file is too large to render.
See raw diff
|
|
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/REQUESTED
ADDED
|
File without changes
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/WHEEL
ADDED
|
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Wheel-Version: 1.0
|
| 2 |
+
Generator: meson
|
| 3 |
+
Root-Is-Purelib: false
|
| 4 |
+
Tag: cp312-cp312-manylinux_2_27_x86_64
|
| 5 |
+
Tag: cp312-cp312-manylinux_2_28_x86_64
|
| 6 |
+
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/entry_points.txt
ADDED
|
@@ -0,0 +1,13 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
[pkg_config]
|
| 2 |
+
numpy = numpy._core.lib.pkgconfig
|
| 3 |
+
|
| 4 |
+
[array_api]
|
| 5 |
+
numpy = numpy
|
| 6 |
+
|
| 7 |
+
[pyinstaller40]
|
| 8 |
+
hook-dirs = numpy:_pyinstaller_hooks_dir
|
| 9 |
+
|
| 10 |
+
[console_scripts]
|
| 11 |
+
f2py = numpy.f2py.f2py2e:main
|
| 12 |
+
numpy-config = numpy._configtool:main
|
| 13 |
+
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/LICENSE.txt
ADDED
|
@@ -0,0 +1,935 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Copyright (c) 2005-2025, NumPy 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 are
|
| 6 |
+
met:
|
| 7 |
+
|
| 8 |
+
* Redistributions of source code must retain the above copyright
|
| 9 |
+
notice, this list of conditions and the following disclaimer.
|
| 10 |
+
|
| 11 |
+
* 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 |
+
* Neither the name of the NumPy Developers nor the names of any
|
| 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 |
+
|
| 35 |
+
----
|
| 36 |
+
|
| 37 |
+
This binary distribution of NumPy also bundles the following software:
|
| 38 |
+
|
| 39 |
+
|
| 40 |
+
Name: OpenBLAS
|
| 41 |
+
Files: numpy.libs/libscipy_openblas*.so
|
| 42 |
+
Description: bundled as a dynamically linked library
|
| 43 |
+
Availability: https://github.com/OpenMathLib/OpenBLAS/
|
| 44 |
+
License: BSD-3-Clause
|
| 45 |
+
Copyright (c) 2011-2014, The OpenBLAS Project
|
| 46 |
+
All rights reserved.
|
| 47 |
+
|
| 48 |
+
Redistribution and use in source and binary forms, with or without
|
| 49 |
+
modification, are permitted provided that the following conditions are
|
| 50 |
+
met:
|
| 51 |
+
|
| 52 |
+
1. Redistributions of source code must retain the above copyright
|
| 53 |
+
notice, this list of conditions and the following disclaimer.
|
| 54 |
+
|
| 55 |
+
2. Redistributions in binary form must reproduce the above copyright
|
| 56 |
+
notice, this list of conditions and the following disclaimer in
|
| 57 |
+
the documentation and/or other materials provided with the
|
| 58 |
+
distribution.
|
| 59 |
+
3. Neither the name of the OpenBLAS project nor the names of
|
| 60 |
+
its contributors may be used to endorse or promote products
|
| 61 |
+
derived from this software without specific prior written
|
| 62 |
+
permission.
|
| 63 |
+
|
| 64 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 65 |
+
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 66 |
+
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 67 |
+
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
| 68 |
+
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
| 69 |
+
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
| 70 |
+
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
| 71 |
+
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
| 72 |
+
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
|
| 73 |
+
USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 74 |
+
|
| 75 |
+
|
| 76 |
+
Name: LAPACK
|
| 77 |
+
Files: numpy.libs/libscipy_openblas*.so
|
| 78 |
+
Description: bundled in OpenBLAS
|
| 79 |
+
Availability: https://github.com/OpenMathLib/OpenBLAS/
|
| 80 |
+
License: BSD-3-Clause-Open-MPI
|
| 81 |
+
Copyright (c) 1992-2013 The University of Tennessee and The University
|
| 82 |
+
of Tennessee Research Foundation. All rights
|
| 83 |
+
reserved.
|
| 84 |
+
Copyright (c) 2000-2013 The University of California Berkeley. All
|
| 85 |
+
rights reserved.
|
| 86 |
+
Copyright (c) 2006-2013 The University of Colorado Denver. All rights
|
| 87 |
+
reserved.
|
| 88 |
+
|
| 89 |
+
$COPYRIGHT$
|
| 90 |
+
|
| 91 |
+
Additional copyrights may follow
|
| 92 |
+
|
| 93 |
+
$HEADER$
|
| 94 |
+
|
| 95 |
+
Redistribution and use in source and binary forms, with or without
|
| 96 |
+
modification, are permitted provided that the following conditions are
|
| 97 |
+
met:
|
| 98 |
+
|
| 99 |
+
- Redistributions of source code must retain the above copyright
|
| 100 |
+
notice, this list of conditions and the following disclaimer.
|
| 101 |
+
|
| 102 |
+
- Redistributions in binary form must reproduce the above copyright
|
| 103 |
+
notice, this list of conditions and the following disclaimer listed
|
| 104 |
+
in this license in the documentation and/or other materials
|
| 105 |
+
provided with the distribution.
|
| 106 |
+
|
| 107 |
+
- Neither the name of the copyright holders nor the names of its
|
| 108 |
+
contributors may be used to endorse or promote products derived from
|
| 109 |
+
this software without specific prior written permission.
|
| 110 |
+
|
| 111 |
+
The copyright holders provide no reassurances that the source code
|
| 112 |
+
provided does not infringe any patent, copyright, or any other
|
| 113 |
+
intellectual property rights of third parties. The copyright holders
|
| 114 |
+
disclaim any liability to any recipient for claims brought against
|
| 115 |
+
recipient by any third party for infringement of that parties
|
| 116 |
+
intellectual property rights.
|
| 117 |
+
|
| 118 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 119 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 120 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 121 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 122 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 123 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 124 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 125 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 126 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 127 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 128 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 129 |
+
|
| 130 |
+
|
| 131 |
+
Name: GCC runtime library
|
| 132 |
+
Files: numpy.libs/libgfortran*.so
|
| 133 |
+
Description: dynamically linked to files compiled with gcc
|
| 134 |
+
Availability: https://gcc.gnu.org/git/?p=gcc.git;a=tree;f=libgfortran
|
| 135 |
+
License: GPL-3.0-or-later WITH GCC-exception-3.1
|
| 136 |
+
Copyright (C) 2002-2017 Free Software Foundation, Inc.
|
| 137 |
+
|
| 138 |
+
Libgfortran is free software; you can redistribute it and/or modify
|
| 139 |
+
it under the terms of the GNU General Public License as published by
|
| 140 |
+
the Free Software Foundation; either version 3, or (at your option)
|
| 141 |
+
any later version.
|
| 142 |
+
|
| 143 |
+
Libgfortran is distributed in the hope that it will be useful,
|
| 144 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 145 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 146 |
+
GNU General Public License for more details.
|
| 147 |
+
|
| 148 |
+
Under Section 7 of GPL version 3, you are granted additional
|
| 149 |
+
permissions described in the GCC Runtime Library Exception, version
|
| 150 |
+
3.1, as published by the Free Software Foundation.
|
| 151 |
+
|
| 152 |
+
You should have received a copy of the GNU General Public License and
|
| 153 |
+
a copy of the GCC Runtime Library Exception along with this program;
|
| 154 |
+
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
| 155 |
+
<http://www.gnu.org/licenses/>.
|
| 156 |
+
|
| 157 |
+
----
|
| 158 |
+
|
| 159 |
+
Full text of license texts referred to above follows (that they are
|
| 160 |
+
listed below does not necessarily imply the conditions apply to the
|
| 161 |
+
present binary release):
|
| 162 |
+
|
| 163 |
+
----
|
| 164 |
+
|
| 165 |
+
GCC RUNTIME LIBRARY EXCEPTION
|
| 166 |
+
|
| 167 |
+
Version 3.1, 31 March 2009
|
| 168 |
+
|
| 169 |
+
Copyright (C) 2009 Free Software Foundation, Inc. <https://fsf.org/>
|
| 170 |
+
|
| 171 |
+
Everyone is permitted to copy and distribute verbatim copies of this
|
| 172 |
+
license document, but changing it is not allowed.
|
| 173 |
+
|
| 174 |
+
This GCC Runtime Library Exception ("Exception") is an additional
|
| 175 |
+
permission under section 7 of the GNU General Public License, version
|
| 176 |
+
3 ("GPLv3"). It applies to a given file (the "Runtime Library") that
|
| 177 |
+
bears a notice placed by the copyright holder of the file stating that
|
| 178 |
+
the file is governed by GPLv3 along with this Exception.
|
| 179 |
+
|
| 180 |
+
When you use GCC to compile a program, GCC may combine portions of
|
| 181 |
+
certain GCC header files and runtime libraries with the compiled
|
| 182 |
+
program. The purpose of this Exception is to allow compilation of
|
| 183 |
+
non-GPL (including proprietary) programs to use, in this way, the
|
| 184 |
+
header files and runtime libraries covered by this Exception.
|
| 185 |
+
|
| 186 |
+
0. Definitions.
|
| 187 |
+
|
| 188 |
+
A file is an "Independent Module" if it either requires the Runtime
|
| 189 |
+
Library for execution after a Compilation Process, or makes use of an
|
| 190 |
+
interface provided by the Runtime Library, but is not otherwise based
|
| 191 |
+
on the Runtime Library.
|
| 192 |
+
|
| 193 |
+
"GCC" means a version of the GNU Compiler Collection, with or without
|
| 194 |
+
modifications, governed by version 3 (or a specified later version) of
|
| 195 |
+
the GNU General Public License (GPL) with the option of using any
|
| 196 |
+
subsequent versions published by the FSF.
|
| 197 |
+
|
| 198 |
+
"GPL-compatible Software" is software whose conditions of propagation,
|
| 199 |
+
modification and use would permit combination with GCC in accord with
|
| 200 |
+
the license of GCC.
|
| 201 |
+
|
| 202 |
+
"Target Code" refers to output from any compiler for a real or virtual
|
| 203 |
+
target processor architecture, in executable form or suitable for
|
| 204 |
+
input to an assembler, loader, linker and/or execution
|
| 205 |
+
phase. Notwithstanding that, Target Code does not include data in any
|
| 206 |
+
format that is used as a compiler intermediate representation, or used
|
| 207 |
+
for producing a compiler intermediate representation.
|
| 208 |
+
|
| 209 |
+
The "Compilation Process" transforms code entirely represented in
|
| 210 |
+
non-intermediate languages designed for human-written code, and/or in
|
| 211 |
+
Java Virtual Machine byte code, into Target Code. Thus, for example,
|
| 212 |
+
use of source code generators and preprocessors need not be considered
|
| 213 |
+
part of the Compilation Process, since the Compilation Process can be
|
| 214 |
+
understood as starting with the output of the generators or
|
| 215 |
+
preprocessors.
|
| 216 |
+
|
| 217 |
+
A Compilation Process is "Eligible" if it is done using GCC, alone or
|
| 218 |
+
with other GPL-compatible software, or if it is done without using any
|
| 219 |
+
work based on GCC. For example, using non-GPL-compatible Software to
|
| 220 |
+
optimize any GCC intermediate representations would not qualify as an
|
| 221 |
+
Eligible Compilation Process.
|
| 222 |
+
|
| 223 |
+
1. Grant of Additional Permission.
|
| 224 |
+
|
| 225 |
+
You have permission to propagate a work of Target Code formed by
|
| 226 |
+
combining the Runtime Library with Independent Modules, even if such
|
| 227 |
+
propagation would otherwise violate the terms of GPLv3, provided that
|
| 228 |
+
all Target Code was generated by Eligible Compilation Processes. You
|
| 229 |
+
may then convey such a combination under terms of your choice,
|
| 230 |
+
consistent with the licensing of the Independent Modules.
|
| 231 |
+
|
| 232 |
+
2. No Weakening of GCC Copyleft.
|
| 233 |
+
|
| 234 |
+
The availability of this Exception does not imply any general
|
| 235 |
+
presumption that third-party software is unaffected by the copyleft
|
| 236 |
+
requirements of the license of GCC.
|
| 237 |
+
|
| 238 |
+
----
|
| 239 |
+
|
| 240 |
+
GNU GENERAL PUBLIC LICENSE
|
| 241 |
+
Version 3, 29 June 2007
|
| 242 |
+
|
| 243 |
+
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
| 244 |
+
Everyone is permitted to copy and distribute verbatim copies
|
| 245 |
+
of this license document, but changing it is not allowed.
|
| 246 |
+
|
| 247 |
+
Preamble
|
| 248 |
+
|
| 249 |
+
The GNU General Public License is a free, copyleft license for
|
| 250 |
+
software and other kinds of works.
|
| 251 |
+
|
| 252 |
+
The licenses for most software and other practical works are designed
|
| 253 |
+
to take away your freedom to share and change the works. By contrast,
|
| 254 |
+
the GNU General Public License is intended to guarantee your freedom to
|
| 255 |
+
share and change all versions of a program--to make sure it remains free
|
| 256 |
+
software for all its users. We, the Free Software Foundation, use the
|
| 257 |
+
GNU General Public License for most of our software; it applies also to
|
| 258 |
+
any other work released this way by its authors. You can apply it to
|
| 259 |
+
your programs, too.
|
| 260 |
+
|
| 261 |
+
When we speak of free software, we are referring to freedom, not
|
| 262 |
+
price. Our General Public Licenses are designed to make sure that you
|
| 263 |
+
have the freedom to distribute copies of free software (and charge for
|
| 264 |
+
them if you wish), that you receive source code or can get it if you
|
| 265 |
+
want it, that you can change the software or use pieces of it in new
|
| 266 |
+
free programs, and that you know you can do these things.
|
| 267 |
+
|
| 268 |
+
To protect your rights, we need to prevent others from denying you
|
| 269 |
+
these rights or asking you to surrender the rights. Therefore, you have
|
| 270 |
+
certain responsibilities if you distribute copies of the software, or if
|
| 271 |
+
you modify it: responsibilities to respect the freedom of others.
|
| 272 |
+
|
| 273 |
+
For example, if you distribute copies of such a program, whether
|
| 274 |
+
gratis or for a fee, you must pass on to the recipients the same
|
| 275 |
+
freedoms that you received. You must make sure that they, too, receive
|
| 276 |
+
or can get the source code. And you must show them these terms so they
|
| 277 |
+
know their rights.
|
| 278 |
+
|
| 279 |
+
Developers that use the GNU GPL protect your rights with two steps:
|
| 280 |
+
(1) assert copyright on the software, and (2) offer you this License
|
| 281 |
+
giving you legal permission to copy, distribute and/or modify it.
|
| 282 |
+
|
| 283 |
+
For the developers' and authors' protection, the GPL clearly explains
|
| 284 |
+
that there is no warranty for this free software. For both users' and
|
| 285 |
+
authors' sake, the GPL requires that modified versions be marked as
|
| 286 |
+
changed, so that their problems will not be attributed erroneously to
|
| 287 |
+
authors of previous versions.
|
| 288 |
+
|
| 289 |
+
Some devices are designed to deny users access to install or run
|
| 290 |
+
modified versions of the software inside them, although the manufacturer
|
| 291 |
+
can do so. This is fundamentally incompatible with the aim of
|
| 292 |
+
protecting users' freedom to change the software. The systematic
|
| 293 |
+
pattern of such abuse occurs in the area of products for individuals to
|
| 294 |
+
use, which is precisely where it is most unacceptable. Therefore, we
|
| 295 |
+
have designed this version of the GPL to prohibit the practice for those
|
| 296 |
+
products. If such problems arise substantially in other domains, we
|
| 297 |
+
stand ready to extend this provision to those domains in future versions
|
| 298 |
+
of the GPL, as needed to protect the freedom of users.
|
| 299 |
+
|
| 300 |
+
Finally, every program is threatened constantly by software patents.
|
| 301 |
+
States should not allow patents to restrict development and use of
|
| 302 |
+
software on general-purpose computers, but in those that do, we wish to
|
| 303 |
+
avoid the special danger that patents applied to a free program could
|
| 304 |
+
make it effectively proprietary. To prevent this, the GPL assures that
|
| 305 |
+
patents cannot be used to render the program non-free.
|
| 306 |
+
|
| 307 |
+
The precise terms and conditions for copying, distribution and
|
| 308 |
+
modification follow.
|
| 309 |
+
|
| 310 |
+
TERMS AND CONDITIONS
|
| 311 |
+
|
| 312 |
+
0. Definitions.
|
| 313 |
+
|
| 314 |
+
"This License" refers to version 3 of the GNU General Public License.
|
| 315 |
+
|
| 316 |
+
"Copyright" also means copyright-like laws that apply to other kinds of
|
| 317 |
+
works, such as semiconductor masks.
|
| 318 |
+
|
| 319 |
+
"The Program" refers to any copyrightable work licensed under this
|
| 320 |
+
License. Each licensee is addressed as "you". "Licensees" and
|
| 321 |
+
"recipients" may be individuals or organizations.
|
| 322 |
+
|
| 323 |
+
To "modify" a work means to copy from or adapt all or part of the work
|
| 324 |
+
in a fashion requiring copyright permission, other than the making of an
|
| 325 |
+
exact copy. The resulting work is called a "modified version" of the
|
| 326 |
+
earlier work or a work "based on" the earlier work.
|
| 327 |
+
|
| 328 |
+
A "covered work" means either the unmodified Program or a work based
|
| 329 |
+
on the Program.
|
| 330 |
+
|
| 331 |
+
To "propagate" a work means to do anything with it that, without
|
| 332 |
+
permission, would make you directly or secondarily liable for
|
| 333 |
+
infringement under applicable copyright law, except executing it on a
|
| 334 |
+
computer or modifying a private copy. Propagation includes copying,
|
| 335 |
+
distribution (with or without modification), making available to the
|
| 336 |
+
public, and in some countries other activities as well.
|
| 337 |
+
|
| 338 |
+
To "convey" a work means any kind of propagation that enables other
|
| 339 |
+
parties to make or receive copies. Mere interaction with a user through
|
| 340 |
+
a computer network, with no transfer of a copy, is not conveying.
|
| 341 |
+
|
| 342 |
+
An interactive user interface displays "Appropriate Legal Notices"
|
| 343 |
+
to the extent that it includes a convenient and prominently visible
|
| 344 |
+
feature that (1) displays an appropriate copyright notice, and (2)
|
| 345 |
+
tells the user that there is no warranty for the work (except to the
|
| 346 |
+
extent that warranties are provided), that licensees may convey the
|
| 347 |
+
work under this License, and how to view a copy of this License. If
|
| 348 |
+
the interface presents a list of user commands or options, such as a
|
| 349 |
+
menu, a prominent item in the list meets this criterion.
|
| 350 |
+
|
| 351 |
+
1. Source Code.
|
| 352 |
+
|
| 353 |
+
The "source code" for a work means the preferred form of the work
|
| 354 |
+
for making modifications to it. "Object code" means any non-source
|
| 355 |
+
form of a work.
|
| 356 |
+
|
| 357 |
+
A "Standard Interface" means an interface that either is an official
|
| 358 |
+
standard defined by a recognized standards body, or, in the case of
|
| 359 |
+
interfaces specified for a particular programming language, one that
|
| 360 |
+
is widely used among developers working in that language.
|
| 361 |
+
|
| 362 |
+
The "System Libraries" of an executable work include anything, other
|
| 363 |
+
than the work as a whole, that (a) is included in the normal form of
|
| 364 |
+
packaging a Major Component, but which is not part of that Major
|
| 365 |
+
Component, and (b) serves only to enable use of the work with that
|
| 366 |
+
Major Component, or to implement a Standard Interface for which an
|
| 367 |
+
implementation is available to the public in source code form. A
|
| 368 |
+
"Major Component", in this context, means a major essential component
|
| 369 |
+
(kernel, window system, and so on) of the specific operating system
|
| 370 |
+
(if any) on which the executable work runs, or a compiler used to
|
| 371 |
+
produce the work, or an object code interpreter used to run it.
|
| 372 |
+
|
| 373 |
+
The "Corresponding Source" for a work in object code form means all
|
| 374 |
+
the source code needed to generate, install, and (for an executable
|
| 375 |
+
work) run the object code and to modify the work, including scripts to
|
| 376 |
+
control those activities. However, it does not include the work's
|
| 377 |
+
System Libraries, or general-purpose tools or generally available free
|
| 378 |
+
programs which are used unmodified in performing those activities but
|
| 379 |
+
which are not part of the work. For example, Corresponding Source
|
| 380 |
+
includes interface definition files associated with source files for
|
| 381 |
+
the work, and the source code for shared libraries and dynamically
|
| 382 |
+
linked subprograms that the work is specifically designed to require,
|
| 383 |
+
such as by intimate data communication or control flow between those
|
| 384 |
+
subprograms and other parts of the work.
|
| 385 |
+
|
| 386 |
+
The Corresponding Source need not include anything that users
|
| 387 |
+
can regenerate automatically from other parts of the Corresponding
|
| 388 |
+
Source.
|
| 389 |
+
|
| 390 |
+
The Corresponding Source for a work in source code form is that
|
| 391 |
+
same work.
|
| 392 |
+
|
| 393 |
+
2. Basic Permissions.
|
| 394 |
+
|
| 395 |
+
All rights granted under this License are granted for the term of
|
| 396 |
+
copyright on the Program, and are irrevocable provided the stated
|
| 397 |
+
conditions are met. This License explicitly affirms your unlimited
|
| 398 |
+
permission to run the unmodified Program. The output from running a
|
| 399 |
+
covered work is covered by this License only if the output, given its
|
| 400 |
+
content, constitutes a covered work. This License acknowledges your
|
| 401 |
+
rights of fair use or other equivalent, as provided by copyright law.
|
| 402 |
+
|
| 403 |
+
You may make, run and propagate covered works that you do not
|
| 404 |
+
convey, without conditions so long as your license otherwise remains
|
| 405 |
+
in force. You may convey covered works to others for the sole purpose
|
| 406 |
+
of having them make modifications exclusively for you, or provide you
|
| 407 |
+
with facilities for running those works, provided that you comply with
|
| 408 |
+
the terms of this License in conveying all material for which you do
|
| 409 |
+
not control copyright. Those thus making or running the covered works
|
| 410 |
+
for you must do so exclusively on your behalf, under your direction
|
| 411 |
+
and control, on terms that prohibit them from making any copies of
|
| 412 |
+
your copyrighted material outside their relationship with you.
|
| 413 |
+
|
| 414 |
+
Conveying under any other circumstances is permitted solely under
|
| 415 |
+
the conditions stated below. Sublicensing is not allowed; section 10
|
| 416 |
+
makes it unnecessary.
|
| 417 |
+
|
| 418 |
+
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
| 419 |
+
|
| 420 |
+
No covered work shall be deemed part of an effective technological
|
| 421 |
+
measure under any applicable law fulfilling obligations under article
|
| 422 |
+
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
| 423 |
+
similar laws prohibiting or restricting circumvention of such
|
| 424 |
+
measures.
|
| 425 |
+
|
| 426 |
+
When you convey a covered work, you waive any legal power to forbid
|
| 427 |
+
circumvention of technological measures to the extent such circumvention
|
| 428 |
+
is effected by exercising rights under this License with respect to
|
| 429 |
+
the covered work, and you disclaim any intention to limit operation or
|
| 430 |
+
modification of the work as a means of enforcing, against the work's
|
| 431 |
+
users, your or third parties' legal rights to forbid circumvention of
|
| 432 |
+
technological measures.
|
| 433 |
+
|
| 434 |
+
4. Conveying Verbatim Copies.
|
| 435 |
+
|
| 436 |
+
You may convey verbatim copies of the Program's source code as you
|
| 437 |
+
receive it, in any medium, provided that you conspicuously and
|
| 438 |
+
appropriately publish on each copy an appropriate copyright notice;
|
| 439 |
+
keep intact all notices stating that this License and any
|
| 440 |
+
non-permissive terms added in accord with section 7 apply to the code;
|
| 441 |
+
keep intact all notices of the absence of any warranty; and give all
|
| 442 |
+
recipients a copy of this License along with the Program.
|
| 443 |
+
|
| 444 |
+
You may charge any price or no price for each copy that you convey,
|
| 445 |
+
and you may offer support or warranty protection for a fee.
|
| 446 |
+
|
| 447 |
+
5. Conveying Modified Source Versions.
|
| 448 |
+
|
| 449 |
+
You may convey a work based on the Program, or the modifications to
|
| 450 |
+
produce it from the Program, in the form of source code under the
|
| 451 |
+
terms of section 4, provided that you also meet all of these conditions:
|
| 452 |
+
|
| 453 |
+
a) The work must carry prominent notices stating that you modified
|
| 454 |
+
it, and giving a relevant date.
|
| 455 |
+
|
| 456 |
+
b) The work must carry prominent notices stating that it is
|
| 457 |
+
released under this License and any conditions added under section
|
| 458 |
+
7. This requirement modifies the requirement in section 4 to
|
| 459 |
+
"keep intact all notices".
|
| 460 |
+
|
| 461 |
+
c) You must license the entire work, as a whole, under this
|
| 462 |
+
License to anyone who comes into possession of a copy. This
|
| 463 |
+
License will therefore apply, along with any applicable section 7
|
| 464 |
+
additional terms, to the whole of the work, and all its parts,
|
| 465 |
+
regardless of how they are packaged. This License gives no
|
| 466 |
+
permission to license the work in any other way, but it does not
|
| 467 |
+
invalidate such permission if you have separately received it.
|
| 468 |
+
|
| 469 |
+
d) If the work has interactive user interfaces, each must display
|
| 470 |
+
Appropriate Legal Notices; however, if the Program has interactive
|
| 471 |
+
interfaces that do not display Appropriate Legal Notices, your
|
| 472 |
+
work need not make them do so.
|
| 473 |
+
|
| 474 |
+
A compilation of a covered work with other separate and independent
|
| 475 |
+
works, which are not by their nature extensions of the covered work,
|
| 476 |
+
and which are not combined with it such as to form a larger program,
|
| 477 |
+
in or on a volume of a storage or distribution medium, is called an
|
| 478 |
+
"aggregate" if the compilation and its resulting copyright are not
|
| 479 |
+
used to limit the access or legal rights of the compilation's users
|
| 480 |
+
beyond what the individual works permit. Inclusion of a covered work
|
| 481 |
+
in an aggregate does not cause this License to apply to the other
|
| 482 |
+
parts of the aggregate.
|
| 483 |
+
|
| 484 |
+
6. Conveying Non-Source Forms.
|
| 485 |
+
|
| 486 |
+
You may convey a covered work in object code form under the terms
|
| 487 |
+
of sections 4 and 5, provided that you also convey the
|
| 488 |
+
machine-readable Corresponding Source under the terms of this License,
|
| 489 |
+
in one of these ways:
|
| 490 |
+
|
| 491 |
+
a) Convey the object code in, or embodied in, a physical product
|
| 492 |
+
(including a physical distribution medium), accompanied by the
|
| 493 |
+
Corresponding Source fixed on a durable physical medium
|
| 494 |
+
customarily used for software interchange.
|
| 495 |
+
|
| 496 |
+
b) Convey the object code in, or embodied in, a physical product
|
| 497 |
+
(including a physical distribution medium), accompanied by a
|
| 498 |
+
written offer, valid for at least three years and valid for as
|
| 499 |
+
long as you offer spare parts or customer support for that product
|
| 500 |
+
model, to give anyone who possesses the object code either (1) a
|
| 501 |
+
copy of the Corresponding Source for all the software in the
|
| 502 |
+
product that is covered by this License, on a durable physical
|
| 503 |
+
medium customarily used for software interchange, for a price no
|
| 504 |
+
more than your reasonable cost of physically performing this
|
| 505 |
+
conveying of source, or (2) access to copy the
|
| 506 |
+
Corresponding Source from a network server at no charge.
|
| 507 |
+
|
| 508 |
+
c) Convey individual copies of the object code with a copy of the
|
| 509 |
+
written offer to provide the Corresponding Source. This
|
| 510 |
+
alternative is allowed only occasionally and noncommercially, and
|
| 511 |
+
only if you received the object code with such an offer, in accord
|
| 512 |
+
with subsection 6b.
|
| 513 |
+
|
| 514 |
+
d) Convey the object code by offering access from a designated
|
| 515 |
+
place (gratis or for a charge), and offer equivalent access to the
|
| 516 |
+
Corresponding Source in the same way through the same place at no
|
| 517 |
+
further charge. You need not require recipients to copy the
|
| 518 |
+
Corresponding Source along with the object code. If the place to
|
| 519 |
+
copy the object code is a network server, the Corresponding Source
|
| 520 |
+
may be on a different server (operated by you or a third party)
|
| 521 |
+
that supports equivalent copying facilities, provided you maintain
|
| 522 |
+
clear directions next to the object code saying where to find the
|
| 523 |
+
Corresponding Source. Regardless of what server hosts the
|
| 524 |
+
Corresponding Source, you remain obligated to ensure that it is
|
| 525 |
+
available for as long as needed to satisfy these requirements.
|
| 526 |
+
|
| 527 |
+
e) Convey the object code using peer-to-peer transmission, provided
|
| 528 |
+
you inform other peers where the object code and Corresponding
|
| 529 |
+
Source of the work are being offered to the general public at no
|
| 530 |
+
charge under subsection 6d.
|
| 531 |
+
|
| 532 |
+
A separable portion of the object code, whose source code is excluded
|
| 533 |
+
from the Corresponding Source as a System Library, need not be
|
| 534 |
+
included in conveying the object code work.
|
| 535 |
+
|
| 536 |
+
A "User Product" is either (1) a "consumer product", which means any
|
| 537 |
+
tangible personal property which is normally used for personal, family,
|
| 538 |
+
or household purposes, or (2) anything designed or sold for incorporation
|
| 539 |
+
into a dwelling. In determining whether a product is a consumer product,
|
| 540 |
+
doubtful cases shall be resolved in favor of coverage. For a particular
|
| 541 |
+
product received by a particular user, "normally used" refers to a
|
| 542 |
+
typical or common use of that class of product, regardless of the status
|
| 543 |
+
of the particular user or of the way in which the particular user
|
| 544 |
+
actually uses, or expects or is expected to use, the product. A product
|
| 545 |
+
is a consumer product regardless of whether the product has substantial
|
| 546 |
+
commercial, industrial or non-consumer uses, unless such uses represent
|
| 547 |
+
the only significant mode of use of the product.
|
| 548 |
+
|
| 549 |
+
"Installation Information" for a User Product means any methods,
|
| 550 |
+
procedures, authorization keys, or other information required to install
|
| 551 |
+
and execute modified versions of a covered work in that User Product from
|
| 552 |
+
a modified version of its Corresponding Source. The information must
|
| 553 |
+
suffice to ensure that the continued functioning of the modified object
|
| 554 |
+
code is in no case prevented or interfered with solely because
|
| 555 |
+
modification has been made.
|
| 556 |
+
|
| 557 |
+
If you convey an object code work under this section in, or with, or
|
| 558 |
+
specifically for use in, a User Product, and the conveying occurs as
|
| 559 |
+
part of a transaction in which the right of possession and use of the
|
| 560 |
+
User Product is transferred to the recipient in perpetuity or for a
|
| 561 |
+
fixed term (regardless of how the transaction is characterized), the
|
| 562 |
+
Corresponding Source conveyed under this section must be accompanied
|
| 563 |
+
by the Installation Information. But this requirement does not apply
|
| 564 |
+
if neither you nor any third party retains the ability to install
|
| 565 |
+
modified object code on the User Product (for example, the work has
|
| 566 |
+
been installed in ROM).
|
| 567 |
+
|
| 568 |
+
The requirement to provide Installation Information does not include a
|
| 569 |
+
requirement to continue to provide support service, warranty, or updates
|
| 570 |
+
for a work that has been modified or installed by the recipient, or for
|
| 571 |
+
the User Product in which it has been modified or installed. Access to a
|
| 572 |
+
network may be denied when the modification itself materially and
|
| 573 |
+
adversely affects the operation of the network or violates the rules and
|
| 574 |
+
protocols for communication across the network.
|
| 575 |
+
|
| 576 |
+
Corresponding Source conveyed, and Installation Information provided,
|
| 577 |
+
in accord with this section must be in a format that is publicly
|
| 578 |
+
documented (and with an implementation available to the public in
|
| 579 |
+
source code form), and must require no special password or key for
|
| 580 |
+
unpacking, reading or copying.
|
| 581 |
+
|
| 582 |
+
7. Additional Terms.
|
| 583 |
+
|
| 584 |
+
"Additional permissions" are terms that supplement the terms of this
|
| 585 |
+
License by making exceptions from one or more of its conditions.
|
| 586 |
+
Additional permissions that are applicable to the entire Program shall
|
| 587 |
+
be treated as though they were included in this License, to the extent
|
| 588 |
+
that they are valid under applicable law. If additional permissions
|
| 589 |
+
apply only to part of the Program, that part may be used separately
|
| 590 |
+
under those permissions, but the entire Program remains governed by
|
| 591 |
+
this License without regard to the additional permissions.
|
| 592 |
+
|
| 593 |
+
When you convey a copy of a covered work, you may at your option
|
| 594 |
+
remove any additional permissions from that copy, or from any part of
|
| 595 |
+
it. (Additional permissions may be written to require their own
|
| 596 |
+
removal in certain cases when you modify the work.) You may place
|
| 597 |
+
additional permissions on material, added by you to a covered work,
|
| 598 |
+
for which you have or can give appropriate copyright permission.
|
| 599 |
+
|
| 600 |
+
Notwithstanding any other provision of this License, for material you
|
| 601 |
+
add to a covered work, you may (if authorized by the copyright holders of
|
| 602 |
+
that material) supplement the terms of this License with terms:
|
| 603 |
+
|
| 604 |
+
a) Disclaiming warranty or limiting liability differently from the
|
| 605 |
+
terms of sections 15 and 16 of this License; or
|
| 606 |
+
|
| 607 |
+
b) Requiring preservation of specified reasonable legal notices or
|
| 608 |
+
author attributions in that material or in the Appropriate Legal
|
| 609 |
+
Notices displayed by works containing it; or
|
| 610 |
+
|
| 611 |
+
c) Prohibiting misrepresentation of the origin of that material, or
|
| 612 |
+
requiring that modified versions of such material be marked in
|
| 613 |
+
reasonable ways as different from the original version; or
|
| 614 |
+
|
| 615 |
+
d) Limiting the use for publicity purposes of names of licensors or
|
| 616 |
+
authors of the material; or
|
| 617 |
+
|
| 618 |
+
e) Declining to grant rights under trademark law for use of some
|
| 619 |
+
trade names, trademarks, or service marks; or
|
| 620 |
+
|
| 621 |
+
f) Requiring indemnification of licensors and authors of that
|
| 622 |
+
material by anyone who conveys the material (or modified versions of
|
| 623 |
+
it) with contractual assumptions of liability to the recipient, for
|
| 624 |
+
any liability that these contractual assumptions directly impose on
|
| 625 |
+
those licensors and authors.
|
| 626 |
+
|
| 627 |
+
All other non-permissive additional terms are considered "further
|
| 628 |
+
restrictions" within the meaning of section 10. If the Program as you
|
| 629 |
+
received it, or any part of it, contains a notice stating that it is
|
| 630 |
+
governed by this License along with a term that is a further
|
| 631 |
+
restriction, you may remove that term. If a license document contains
|
| 632 |
+
a further restriction but permits relicensing or conveying under this
|
| 633 |
+
License, you may add to a covered work material governed by the terms
|
| 634 |
+
of that license document, provided that the further restriction does
|
| 635 |
+
not survive such relicensing or conveying.
|
| 636 |
+
|
| 637 |
+
If you add terms to a covered work in accord with this section, you
|
| 638 |
+
must place, in the relevant source files, a statement of the
|
| 639 |
+
additional terms that apply to those files, or a notice indicating
|
| 640 |
+
where to find the applicable terms.
|
| 641 |
+
|
| 642 |
+
Additional terms, permissive or non-permissive, may be stated in the
|
| 643 |
+
form of a separately written license, or stated as exceptions;
|
| 644 |
+
the above requirements apply either way.
|
| 645 |
+
|
| 646 |
+
8. Termination.
|
| 647 |
+
|
| 648 |
+
You may not propagate or modify a covered work except as expressly
|
| 649 |
+
provided under this License. Any attempt otherwise to propagate or
|
| 650 |
+
modify it is void, and will automatically terminate your rights under
|
| 651 |
+
this License (including any patent licenses granted under the third
|
| 652 |
+
paragraph of section 11).
|
| 653 |
+
|
| 654 |
+
However, if you cease all violation of this License, then your
|
| 655 |
+
license from a particular copyright holder is reinstated (a)
|
| 656 |
+
provisionally, unless and until the copyright holder explicitly and
|
| 657 |
+
finally terminates your license, and (b) permanently, if the copyright
|
| 658 |
+
holder fails to notify you of the violation by some reasonable means
|
| 659 |
+
prior to 60 days after the cessation.
|
| 660 |
+
|
| 661 |
+
Moreover, your license from a particular copyright holder is
|
| 662 |
+
reinstated permanently if the copyright holder notifies you of the
|
| 663 |
+
violation by some reasonable means, this is the first time you have
|
| 664 |
+
received notice of violation of this License (for any work) from that
|
| 665 |
+
copyright holder, and you cure the violation prior to 30 days after
|
| 666 |
+
your receipt of the notice.
|
| 667 |
+
|
| 668 |
+
Termination of your rights under this section does not terminate the
|
| 669 |
+
licenses of parties who have received copies or rights from you under
|
| 670 |
+
this License. If your rights have been terminated and not permanently
|
| 671 |
+
reinstated, you do not qualify to receive new licenses for the same
|
| 672 |
+
material under section 10.
|
| 673 |
+
|
| 674 |
+
9. Acceptance Not Required for Having Copies.
|
| 675 |
+
|
| 676 |
+
You are not required to accept this License in order to receive or
|
| 677 |
+
run a copy of the Program. Ancillary propagation of a covered work
|
| 678 |
+
occurring solely as a consequence of using peer-to-peer transmission
|
| 679 |
+
to receive a copy likewise does not require acceptance. However,
|
| 680 |
+
nothing other than this License grants you permission to propagate or
|
| 681 |
+
modify any covered work. These actions infringe copyright if you do
|
| 682 |
+
not accept this License. Therefore, by modifying or propagating a
|
| 683 |
+
covered work, you indicate your acceptance of this License to do so.
|
| 684 |
+
|
| 685 |
+
10. Automatic Licensing of Downstream Recipients.
|
| 686 |
+
|
| 687 |
+
Each time you convey a covered work, the recipient automatically
|
| 688 |
+
receives a license from the original licensors, to run, modify and
|
| 689 |
+
propagate that work, subject to this License. You are not responsible
|
| 690 |
+
for enforcing compliance by third parties with this License.
|
| 691 |
+
|
| 692 |
+
An "entity transaction" is a transaction transferring control of an
|
| 693 |
+
organization, or substantially all assets of one, or subdividing an
|
| 694 |
+
organization, or merging organizations. If propagation of a covered
|
| 695 |
+
work results from an entity transaction, each party to that
|
| 696 |
+
transaction who receives a copy of the work also receives whatever
|
| 697 |
+
licenses to the work the party's predecessor in interest had or could
|
| 698 |
+
give under the previous paragraph, plus a right to possession of the
|
| 699 |
+
Corresponding Source of the work from the predecessor in interest, if
|
| 700 |
+
the predecessor has it or can get it with reasonable efforts.
|
| 701 |
+
|
| 702 |
+
You may not impose any further restrictions on the exercise of the
|
| 703 |
+
rights granted or affirmed under this License. For example, you may
|
| 704 |
+
not impose a license fee, royalty, or other charge for exercise of
|
| 705 |
+
rights granted under this License, and you may not initiate litigation
|
| 706 |
+
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
| 707 |
+
any patent claim is infringed by making, using, selling, offering for
|
| 708 |
+
sale, or importing the Program or any portion of it.
|
| 709 |
+
|
| 710 |
+
11. Patents.
|
| 711 |
+
|
| 712 |
+
A "contributor" is a copyright holder who authorizes use under this
|
| 713 |
+
License of the Program or a work on which the Program is based. The
|
| 714 |
+
work thus licensed is called the contributor's "contributor version".
|
| 715 |
+
|
| 716 |
+
A contributor's "essential patent claims" are all patent claims
|
| 717 |
+
owned or controlled by the contributor, whether already acquired or
|
| 718 |
+
hereafter acquired, that would be infringed by some manner, permitted
|
| 719 |
+
by this License, of making, using, or selling its contributor version,
|
| 720 |
+
but do not include claims that would be infringed only as a
|
| 721 |
+
consequence of further modification of the contributor version. For
|
| 722 |
+
purposes of this definition, "control" includes the right to grant
|
| 723 |
+
patent sublicenses in a manner consistent with the requirements of
|
| 724 |
+
this License.
|
| 725 |
+
|
| 726 |
+
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
| 727 |
+
patent license under the contributor's essential patent claims, to
|
| 728 |
+
make, use, sell, offer for sale, import and otherwise run, modify and
|
| 729 |
+
propagate the contents of its contributor version.
|
| 730 |
+
|
| 731 |
+
In the following three paragraphs, a "patent license" is any express
|
| 732 |
+
agreement or commitment, however denominated, not to enforce a patent
|
| 733 |
+
(such as an express permission to practice a patent or covenant not to
|
| 734 |
+
sue for patent infringement). To "grant" such a patent license to a
|
| 735 |
+
party means to make such an agreement or commitment not to enforce a
|
| 736 |
+
patent against the party.
|
| 737 |
+
|
| 738 |
+
If you convey a covered work, knowingly relying on a patent license,
|
| 739 |
+
and the Corresponding Source of the work is not available for anyone
|
| 740 |
+
to copy, free of charge and under the terms of this License, through a
|
| 741 |
+
publicly available network server or other readily accessible means,
|
| 742 |
+
then you must either (1) cause the Corresponding Source to be so
|
| 743 |
+
available, or (2) arrange to deprive yourself of the benefit of the
|
| 744 |
+
patent license for this particular work, or (3) arrange, in a manner
|
| 745 |
+
consistent with the requirements of this License, to extend the patent
|
| 746 |
+
license to downstream recipients. "Knowingly relying" means you have
|
| 747 |
+
actual knowledge that, but for the patent license, your conveying the
|
| 748 |
+
covered work in a country, or your recipient's use of the covered work
|
| 749 |
+
in a country, would infringe one or more identifiable patents in that
|
| 750 |
+
country that you have reason to believe are valid.
|
| 751 |
+
|
| 752 |
+
If, pursuant to or in connection with a single transaction or
|
| 753 |
+
arrangement, you convey, or propagate by procuring conveyance of, a
|
| 754 |
+
covered work, and grant a patent license to some of the parties
|
| 755 |
+
receiving the covered work authorizing them to use, propagate, modify
|
| 756 |
+
or convey a specific copy of the covered work, then the patent license
|
| 757 |
+
you grant is automatically extended to all recipients of the covered
|
| 758 |
+
work and works based on it.
|
| 759 |
+
|
| 760 |
+
A patent license is "discriminatory" if it does not include within
|
| 761 |
+
the scope of its coverage, prohibits the exercise of, or is
|
| 762 |
+
conditioned on the non-exercise of one or more of the rights that are
|
| 763 |
+
specifically granted under this License. You may not convey a covered
|
| 764 |
+
work if you are a party to an arrangement with a third party that is
|
| 765 |
+
in the business of distributing software, under which you make payment
|
| 766 |
+
to the third party based on the extent of your activity of conveying
|
| 767 |
+
the work, and under which the third party grants, to any of the
|
| 768 |
+
parties who would receive the covered work from you, a discriminatory
|
| 769 |
+
patent license (a) in connection with copies of the covered work
|
| 770 |
+
conveyed by you (or copies made from those copies), or (b) primarily
|
| 771 |
+
for and in connection with specific products or compilations that
|
| 772 |
+
contain the covered work, unless you entered into that arrangement,
|
| 773 |
+
or that patent license was granted, prior to 28 March 2007.
|
| 774 |
+
|
| 775 |
+
Nothing in this License shall be construed as excluding or limiting
|
| 776 |
+
any implied license or other defenses to infringement that may
|
| 777 |
+
otherwise be available to you under applicable patent law.
|
| 778 |
+
|
| 779 |
+
12. No Surrender of Others' Freedom.
|
| 780 |
+
|
| 781 |
+
If conditions are imposed on you (whether by court order, agreement or
|
| 782 |
+
otherwise) that contradict the conditions of this License, they do not
|
| 783 |
+
excuse you from the conditions of this License. If you cannot convey a
|
| 784 |
+
covered work so as to satisfy simultaneously your obligations under this
|
| 785 |
+
License and any other pertinent obligations, then as a consequence you may
|
| 786 |
+
not convey it at all. For example, if you agree to terms that obligate you
|
| 787 |
+
to collect a royalty for further conveying from those to whom you convey
|
| 788 |
+
the Program, the only way you could satisfy both those terms and this
|
| 789 |
+
License would be to refrain entirely from conveying the Program.
|
| 790 |
+
|
| 791 |
+
13. Use with the GNU Affero General Public License.
|
| 792 |
+
|
| 793 |
+
Notwithstanding any other provision of this License, you have
|
| 794 |
+
permission to link or combine any covered work with a work licensed
|
| 795 |
+
under version 3 of the GNU Affero General Public License into a single
|
| 796 |
+
combined work, and to convey the resulting work. The terms of this
|
| 797 |
+
License will continue to apply to the part which is the covered work,
|
| 798 |
+
but the special requirements of the GNU Affero General Public License,
|
| 799 |
+
section 13, concerning interaction through a network will apply to the
|
| 800 |
+
combination as such.
|
| 801 |
+
|
| 802 |
+
14. Revised Versions of this License.
|
| 803 |
+
|
| 804 |
+
The Free Software Foundation may publish revised and/or new versions of
|
| 805 |
+
the GNU General Public License from time to time. Such new versions will
|
| 806 |
+
be similar in spirit to the present version, but may differ in detail to
|
| 807 |
+
address new problems or concerns.
|
| 808 |
+
|
| 809 |
+
Each version is given a distinguishing version number. If the
|
| 810 |
+
Program specifies that a certain numbered version of the GNU General
|
| 811 |
+
Public License "or any later version" applies to it, you have the
|
| 812 |
+
option of following the terms and conditions either of that numbered
|
| 813 |
+
version or of any later version published by the Free Software
|
| 814 |
+
Foundation. If the Program does not specify a version number of the
|
| 815 |
+
GNU General Public License, you may choose any version ever published
|
| 816 |
+
by the Free Software Foundation.
|
| 817 |
+
|
| 818 |
+
If the Program specifies that a proxy can decide which future
|
| 819 |
+
versions of the GNU General Public License can be used, that proxy's
|
| 820 |
+
public statement of acceptance of a version permanently authorizes you
|
| 821 |
+
to choose that version for the Program.
|
| 822 |
+
|
| 823 |
+
Later license versions may give you additional or different
|
| 824 |
+
permissions. However, no additional obligations are imposed on any
|
| 825 |
+
author or copyright holder as a result of your choosing to follow a
|
| 826 |
+
later version.
|
| 827 |
+
|
| 828 |
+
15. Disclaimer of Warranty.
|
| 829 |
+
|
| 830 |
+
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
| 831 |
+
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
| 832 |
+
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
| 833 |
+
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
| 834 |
+
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
| 835 |
+
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
| 836 |
+
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
| 837 |
+
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
| 838 |
+
|
| 839 |
+
16. Limitation of Liability.
|
| 840 |
+
|
| 841 |
+
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
| 842 |
+
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
| 843 |
+
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
| 844 |
+
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
| 845 |
+
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
| 846 |
+
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
| 847 |
+
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
| 848 |
+
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
| 849 |
+
SUCH DAMAGES.
|
| 850 |
+
|
| 851 |
+
17. Interpretation of Sections 15 and 16.
|
| 852 |
+
|
| 853 |
+
If the disclaimer of warranty and limitation of liability provided
|
| 854 |
+
above cannot be given local legal effect according to their terms,
|
| 855 |
+
reviewing courts shall apply local law that most closely approximates
|
| 856 |
+
an absolute waiver of all civil liability in connection with the
|
| 857 |
+
Program, unless a warranty or assumption of liability accompanies a
|
| 858 |
+
copy of the Program in return for a fee.
|
| 859 |
+
|
| 860 |
+
END OF TERMS AND CONDITIONS
|
| 861 |
+
|
| 862 |
+
How to Apply These Terms to Your New Programs
|
| 863 |
+
|
| 864 |
+
If you develop a new program, and you want it to be of the greatest
|
| 865 |
+
possible use to the public, the best way to achieve this is to make it
|
| 866 |
+
free software which everyone can redistribute and change under these terms.
|
| 867 |
+
|
| 868 |
+
To do so, attach the following notices to the program. It is safest
|
| 869 |
+
to attach them to the start of each source file to most effectively
|
| 870 |
+
state the exclusion of warranty; and each file should have at least
|
| 871 |
+
the "copyright" line and a pointer to where the full notice is found.
|
| 872 |
+
|
| 873 |
+
<one line to give the program's name and a brief idea of what it does.>
|
| 874 |
+
Copyright (C) <year> <name of author>
|
| 875 |
+
|
| 876 |
+
This program is free software: you can redistribute it and/or modify
|
| 877 |
+
it under the terms of the GNU General Public License as published by
|
| 878 |
+
the Free Software Foundation, either version 3 of the License, or
|
| 879 |
+
(at your option) any later version.
|
| 880 |
+
|
| 881 |
+
This program is distributed in the hope that it will be useful,
|
| 882 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 883 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 884 |
+
GNU General Public License for more details.
|
| 885 |
+
|
| 886 |
+
You should have received a copy of the GNU General Public License
|
| 887 |
+
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
| 888 |
+
|
| 889 |
+
Also add information on how to contact you by electronic and paper mail.
|
| 890 |
+
|
| 891 |
+
If the program does terminal interaction, make it output a short
|
| 892 |
+
notice like this when it starts in an interactive mode:
|
| 893 |
+
|
| 894 |
+
<program> Copyright (C) <year> <name of author>
|
| 895 |
+
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
| 896 |
+
This is free software, and you are welcome to redistribute it
|
| 897 |
+
under certain conditions; type `show c' for details.
|
| 898 |
+
|
| 899 |
+
The hypothetical commands `show w' and `show c' should show the appropriate
|
| 900 |
+
parts of the General Public License. Of course, your program's commands
|
| 901 |
+
might be different; for a GUI interface, you would use an "about box".
|
| 902 |
+
|
| 903 |
+
You should also get your employer (if you work as a programmer) or school,
|
| 904 |
+
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
| 905 |
+
For more information on this, and how to apply and follow the GNU GPL, see
|
| 906 |
+
<https://www.gnu.org/licenses/>.
|
| 907 |
+
|
| 908 |
+
The GNU General Public License does not permit incorporating your program
|
| 909 |
+
into proprietary programs. If your program is a subroutine library, you
|
| 910 |
+
may consider it more useful to permit linking proprietary applications with
|
| 911 |
+
the library. If this is what you want to do, use the GNU Lesser General
|
| 912 |
+
Public License instead of this License. But first, please read
|
| 913 |
+
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
| 914 |
+
|
| 915 |
+
Name: libquadmath
|
| 916 |
+
Files: numpy.libs/libquadmath*.so
|
| 917 |
+
Description: dynamically linked to files compiled with gcc
|
| 918 |
+
Availability: https://gcc.gnu.org/git/?p=gcc.git;a=tree;f=libquadmath
|
| 919 |
+
License: LGPL-2.1-or-later
|
| 920 |
+
|
| 921 |
+
GCC Quad-Precision Math Library
|
| 922 |
+
Copyright (C) 2010-2019 Free Software Foundation, Inc.
|
| 923 |
+
Written by Francois-Xavier Coudert <fxcoudert@gcc.gnu.org>
|
| 924 |
+
|
| 925 |
+
This file is part of the libquadmath library.
|
| 926 |
+
Libquadmath is free software; you can redistribute it and/or
|
| 927 |
+
modify it under the terms of the GNU Library General Public
|
| 928 |
+
License as published by the Free Software Foundation; either
|
| 929 |
+
version 2.1 of the License, or (at your option) any later version.
|
| 930 |
+
|
| 931 |
+
Libquadmath is distributed in the hope that it will be useful,
|
| 932 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 933 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
| 934 |
+
Lesser General Public License for more details.
|
| 935 |
+
https://www.gnu.org/licenses/old-licenses/lgpl-2.1.html
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/_core/include/numpy/libdivide/LICENSE.txt
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
zlib License
|
| 2 |
+
------------
|
| 3 |
+
|
| 4 |
+
Copyright (C) 2010 - 2019 ridiculous_fish, <libdivide@ridiculousfish.com>
|
| 5 |
+
Copyright (C) 2016 - 2019 Kim Walisch, <kim.walisch@gmail.com>
|
| 6 |
+
|
| 7 |
+
This software is provided 'as-is', without any express or implied
|
| 8 |
+
warranty. In no event will the authors be held liable for any damages
|
| 9 |
+
arising from the use of this software.
|
| 10 |
+
|
| 11 |
+
Permission is granted to anyone to use this software for any purpose,
|
| 12 |
+
including commercial applications, and to alter it and redistribute it
|
| 13 |
+
freely, subject to the following restrictions:
|
| 14 |
+
|
| 15 |
+
1. The origin of this software must not be misrepresented; you must not
|
| 16 |
+
claim that you wrote the original software. If you use this software
|
| 17 |
+
in a product, an acknowledgment in the product documentation would be
|
| 18 |
+
appreciated but is not required.
|
| 19 |
+
2. Altered source versions must be plainly marked as such, and must not be
|
| 20 |
+
misrepresented as being the original software.
|
| 21 |
+
3. This notice may not be removed or altered from any source distribution.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/_core/src/common/pythoncapi-compat/COPYING
ADDED
|
@@ -0,0 +1,14 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
BSD Zero Clause License
|
| 2 |
+
|
| 3 |
+
Copyright Contributors to the pythoncapi_compat project.
|
| 4 |
+
|
| 5 |
+
Permission to use, copy, modify, and/or distribute this software for any
|
| 6 |
+
purpose with or without fee is hereby granted.
|
| 7 |
+
|
| 8 |
+
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
|
| 9 |
+
REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
|
| 10 |
+
AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
|
| 11 |
+
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
|
| 12 |
+
LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
|
| 13 |
+
OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
| 14 |
+
PERFORMANCE OF THIS SOFTWARE.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/_core/src/highway/LICENSE
ADDED
|
@@ -0,0 +1,371 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
This project is primarily dual-licensed under your choice of either the Apache
|
| 2 |
+
License 2.0 or the BSD 3-Clause License.
|
| 3 |
+
|
| 4 |
+
The following files are licensed under different terms:
|
| 5 |
+
* hwy/contrib/random/random-inl.h: CC0 1.0 Universal
|
| 6 |
+
|
| 7 |
+
The full texts of all applicable licenses are included below, separated by
|
| 8 |
+
'---'.
|
| 9 |
+
|
| 10 |
+
--------------------------------------------------------------------------------
|
| 11 |
+
Apache License 2.0
|
| 12 |
+
--------------------------------------------------------------------------------
|
| 13 |
+
|
| 14 |
+
Apache License
|
| 15 |
+
Version 2.0, January 2004
|
| 16 |
+
http://www.apache.org/licenses/
|
| 17 |
+
|
| 18 |
+
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
| 19 |
+
|
| 20 |
+
1. Definitions.
|
| 21 |
+
|
| 22 |
+
"License" shall mean the terms and conditions for use, reproduction,
|
| 23 |
+
and distribution as defined by Sections 1 through 9 of this document.
|
| 24 |
+
|
| 25 |
+
"Licensor" shall mean the copyright owner or entity authorized by
|
| 26 |
+
the copyright owner that is granting the License.
|
| 27 |
+
|
| 28 |
+
"Legal Entity" shall mean the union of the acting entity and all
|
| 29 |
+
other entities that control, are controlled by, or are under common
|
| 30 |
+
control with that entity. For the purposes of this definition,
|
| 31 |
+
"control" means (i) the power, direct or indirect, to cause the
|
| 32 |
+
direction or management of such entity, whether by contract or
|
| 33 |
+
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
| 34 |
+
outstanding shares, or (iii) beneficial ownership of such entity.
|
| 35 |
+
|
| 36 |
+
"You" (or "Your") shall mean an individual or Legal Entity
|
| 37 |
+
exercising permissions granted by this License.
|
| 38 |
+
|
| 39 |
+
"Source" form shall mean the preferred form for making modifications,
|
| 40 |
+
including but not limited to software source code, documentation
|
| 41 |
+
source, and configuration files.
|
| 42 |
+
|
| 43 |
+
"Object" form shall mean any form resulting from mechanical
|
| 44 |
+
transformation or translation of a Source form, including but
|
| 45 |
+
not limited to compiled object code, generated documentation,
|
| 46 |
+
and conversions to other media types.
|
| 47 |
+
|
| 48 |
+
"Work" shall mean the work of authorship, whether in Source or
|
| 49 |
+
Object form, made available under the License, as indicated by a
|
| 50 |
+
copyright notice that is included in or attached to the work
|
| 51 |
+
(an example is provided in the Appendix below).
|
| 52 |
+
|
| 53 |
+
"Derivative Works" shall mean any work, whether in Source or Object
|
| 54 |
+
form, that is based on (or derived from) the Work and for which the
|
| 55 |
+
editorial revisions, annotations, elaborations, or other modifications
|
| 56 |
+
represent, as a whole, an original work of authorship. For the purposes
|
| 57 |
+
of this License, Derivative Works shall not include works that remain
|
| 58 |
+
separable from, or merely link (or bind by name) to the interfaces of,
|
| 59 |
+
the Work and Derivative Works thereof.
|
| 60 |
+
|
| 61 |
+
"Contribution" shall mean any work of authorship, including
|
| 62 |
+
the original version of the Work and any modifications or additions
|
| 63 |
+
to that Work or Derivative Works thereof, that is intentionally
|
| 64 |
+
submitted to Licensor for inclusion in the Work by the copyright owner
|
| 65 |
+
or by an individual or Legal Entity authorized to submit on behalf of
|
| 66 |
+
the copyright owner. For the purposes of this definition, "submitted"
|
| 67 |
+
means any form of electronic, verbal, or written communication sent
|
| 68 |
+
to the Licensor or its representatives, including but not limited to
|
| 69 |
+
communication on electronic mailing lists, source code control systems,
|
| 70 |
+
and issue tracking systems that are managed by, or on behalf of, the
|
| 71 |
+
Licensor for the purpose of discussing and improving the Work, but
|
| 72 |
+
excluding communication that is conspicuously marked or otherwise
|
| 73 |
+
designated in writing by the copyright owner as "Not a Contribution."
|
| 74 |
+
|
| 75 |
+
"Contributor" shall mean Licensor and any individual or Legal Entity
|
| 76 |
+
on behalf of whom a Contribution has been received by Licensor and
|
| 77 |
+
subsequently incorporated within the Work.
|
| 78 |
+
|
| 79 |
+
2. Grant of Copyright License. Subject to the terms and conditions of
|
| 80 |
+
this License, each Contributor hereby grants to You a perpetual,
|
| 81 |
+
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
| 82 |
+
copyright license to reproduce, prepare Derivative Works of,
|
| 83 |
+
publicly display, publicly perform, sublicense, and distribute the
|
| 84 |
+
Work and such Derivative Works in Source or Object form.
|
| 85 |
+
|
| 86 |
+
3. Grant of Patent License. Subject to the terms and conditions of
|
| 87 |
+
this License, each Contributor hereby grants to You a perpetual,
|
| 88 |
+
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
| 89 |
+
(except as stated in this section) patent license to make, have made,
|
| 90 |
+
use, offer to sell, sell, import, and otherwise transfer the Work,
|
| 91 |
+
where such license applies only to those patent claims licensable
|
| 92 |
+
by such Contributor that are necessarily infringed by their
|
| 93 |
+
Contribution(s) alone or by combination of their Contribution(s)
|
| 94 |
+
with the Work to which such Contribution(s) was submitted. If You
|
| 95 |
+
institute patent litigation against any entity (including a
|
| 96 |
+
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
| 97 |
+
or a Contribution incorporated within the Work constitutes direct
|
| 98 |
+
or contributory patent infringement, then any patent licenses
|
| 99 |
+
granted to You under this License for that Work shall terminate
|
| 100 |
+
as of the date such litigation is filed.
|
| 101 |
+
|
| 102 |
+
4. Redistribution. You may reproduce and distribute copies of the
|
| 103 |
+
Work or Derivative Works thereof in any medium, with or without
|
| 104 |
+
modifications, and in Source or Object form, provided that You
|
| 105 |
+
meet the following conditions:
|
| 106 |
+
|
| 107 |
+
(a) You must give any other recipients of the Work or
|
| 108 |
+
Derivative Works a copy of this License; and
|
| 109 |
+
|
| 110 |
+
(b) You must cause any modified files to carry prominent notices
|
| 111 |
+
stating that You changed the files; and
|
| 112 |
+
|
| 113 |
+
(c) You must retain, in the Source form of any Derivative Works
|
| 114 |
+
that You distribute, all copyright, patent, trademark, and
|
| 115 |
+
attribution notices from the Source form of the Work,
|
| 116 |
+
excluding those notices that do not pertain to any part of
|
| 117 |
+
the Derivative Works; and
|
| 118 |
+
|
| 119 |
+
(d) If the Work includes a "NOTICE" text file as part of its
|
| 120 |
+
distribution, then any Derivative Works that You distribute must
|
| 121 |
+
include a readable copy of the attribution notices contained
|
| 122 |
+
within such NOTICE file, excluding those notices that do not
|
| 123 |
+
pertain to any part of the Derivative Works, in at least one
|
| 124 |
+
of the following places: within a NOTICE text file distributed
|
| 125 |
+
as part of the Derivative Works; within the Source form or
|
| 126 |
+
documentation, if provided along with the Derivative Works; or,
|
| 127 |
+
within a display generated by the Derivative Works, if and
|
| 128 |
+
wherever such third-party notices normally appear. The contents
|
| 129 |
+
of the NOTICE file are for informational purposes only and
|
| 130 |
+
do not modify the License. You may add Your own attribution
|
| 131 |
+
notices within Derivative Works that You distribute, alongside
|
| 132 |
+
or as an addendum to the NOTICE text from the Work, provided
|
| 133 |
+
that such additional attribution notices cannot be construed
|
| 134 |
+
as modifying the License.
|
| 135 |
+
|
| 136 |
+
You may add Your own copyright statement to Your modifications and
|
| 137 |
+
may provide additional or different license terms and conditions
|
| 138 |
+
for use, reproduction, or distribution of Your modifications, or
|
| 139 |
+
for any such Derivative Works as a whole, provided Your use,
|
| 140 |
+
reproduction, and distribution of the Work otherwise complies with
|
| 141 |
+
the conditions stated in this License.
|
| 142 |
+
|
| 143 |
+
5. Submission of Contributions. Unless You explicitly state otherwise,
|
| 144 |
+
any Contribution intentionally submitted for inclusion in the Work
|
| 145 |
+
by You to the Licensor shall be under the terms and conditions of
|
| 146 |
+
this License, without any additional terms or conditions.
|
| 147 |
+
Notwithstanding the above, nothing herein shall supersede or modify
|
| 148 |
+
the terms of any separate license agreement you may have executed
|
| 149 |
+
with Licensor regarding such Contributions.
|
| 150 |
+
|
| 151 |
+
6. Trademarks. This License does not grant permission to use the trade
|
| 152 |
+
names, trademarks, service marks, or product names of the Licensor,
|
| 153 |
+
except as required for reasonable and customary use in describing the
|
| 154 |
+
origin of the Work and reproducing the content of the NOTICE file.
|
| 155 |
+
|
| 156 |
+
7. Disclaimer of Warranty. Unless required by applicable law or
|
| 157 |
+
agreed to in writing, Licensor provides the Work (and each
|
| 158 |
+
Contributor provides its Contributions) on an "AS IS" BASIS,
|
| 159 |
+
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
| 160 |
+
implied, including, without limitation, any warranties or conditions
|
| 161 |
+
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
| 162 |
+
PARTICULAR PURPOSE. You are solely responsible for determining the
|
| 163 |
+
appropriateness of using or redistributing the Work and assume any
|
| 164 |
+
risks associated with Your exercise of permissions under this License.
|
| 165 |
+
|
| 166 |
+
8. Limitation of Liability. In no event and under no legal theory,
|
| 167 |
+
whether in tort (including negligence), contract, or otherwise,
|
| 168 |
+
unless required by applicable law (such as deliberate and grossly
|
| 169 |
+
negligent acts) or agreed to in writing, shall any Contributor be
|
| 170 |
+
liable to You for damages, including any direct, indirect, special,
|
| 171 |
+
incidental, or consequential damages of any character arising as a
|
| 172 |
+
result of this License or out of the use or inability to use the
|
| 173 |
+
Work (including but not limited to damages for loss of goodwill,
|
| 174 |
+
work stoppage, computer failure or malfunction, or any and all
|
| 175 |
+
other commercial damages or losses), even if such Contributor
|
| 176 |
+
has been advised of the possibility of such damages.
|
| 177 |
+
|
| 178 |
+
9. Accepting Warranty or Additional Liability. While redistributing
|
| 179 |
+
the Work or Derivative Works thereof, You may choose to offer,
|
| 180 |
+
and charge a fee for, acceptance of support, warranty, indemnity,
|
| 181 |
+
or other liability obligations and/or rights consistent with this
|
| 182 |
+
License. However, in accepting such obligations, You may act only
|
| 183 |
+
on Your own behalf and on Your sole responsibility, not on behalf
|
| 184 |
+
of any other Contributor, and only if You agree to indemnify,
|
| 185 |
+
defend, and hold each Contributor harmless for any liability
|
| 186 |
+
incurred by, or claims asserted against, such Contributor by reason
|
| 187 |
+
of your accepting any such warranty or additional liability.
|
| 188 |
+
|
| 189 |
+
END OF TERMS AND CONDITIONS
|
| 190 |
+
|
| 191 |
+
APPENDIX: How to apply the Apache License to your work.
|
| 192 |
+
|
| 193 |
+
To apply the Apache License to your work, attach the following
|
| 194 |
+
boilerplate notice, with the fields enclosed by brackets "[]"
|
| 195 |
+
replaced with your own identifying information. (Don't include
|
| 196 |
+
the brackets!) The text should be enclosed in the appropriate
|
| 197 |
+
comment syntax for the file format. We also recommend that a
|
| 198 |
+
file or class name and description of purpose be included on the
|
| 199 |
+
same "printed page" as the copyright notice for easier
|
| 200 |
+
identification within third-party archives.
|
| 201 |
+
|
| 202 |
+
Copyright [yyyy] [name of copyright owner]
|
| 203 |
+
|
| 204 |
+
Licensed under the Apache License, Version 2.0 (the "License");
|
| 205 |
+
you may not use this file except in compliance with the License.
|
| 206 |
+
You may obtain a copy of the License at
|
| 207 |
+
|
| 208 |
+
http://www.apache.org/licenses/LICENSE-2.0
|
| 209 |
+
|
| 210 |
+
Unless required by applicable law or agreed to in writing, software
|
| 211 |
+
distributed under the License is distributed on an "AS IS" BASIS,
|
| 212 |
+
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
| 213 |
+
See the License for the specific language governing permissions and
|
| 214 |
+
limitations under the License.
|
| 215 |
+
|
| 216 |
+
--------------------------------------------------------------------------------
|
| 217 |
+
BSD 3-Clause License
|
| 218 |
+
--------------------------------------------------------------------------------
|
| 219 |
+
|
| 220 |
+
Copyright (c) The Highway Project Authors. All rights reserved.
|
| 221 |
+
|
| 222 |
+
Redistribution and use in source and binary forms, with or without modification,
|
| 223 |
+
are permitted provided that the following conditions are met:
|
| 224 |
+
|
| 225 |
+
1. Redistributions of source code must retain the above copyright notice, this
|
| 226 |
+
list of conditions and the following disclaimer.
|
| 227 |
+
|
| 228 |
+
2. Redistributions in binary form must reproduce the above copyright notice,
|
| 229 |
+
this list of conditions and the following disclaimer in the documentation
|
| 230 |
+
and/or other materials provided with the distribution.
|
| 231 |
+
|
| 232 |
+
3. Neither the name of the copyright holder nor the names of its
|
| 233 |
+
contributors may be used to endorse or promote products derived from
|
| 234 |
+
this software without specific prior written permission.
|
| 235 |
+
|
| 236 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 237 |
+
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 238 |
+
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
| 239 |
+
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
| 240 |
+
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
| 241 |
+
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
| 242 |
+
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
| 243 |
+
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
| 244 |
+
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 245 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 246 |
+
|
| 247 |
+
--------------------------------------------------------------------------------
|
| 248 |
+
CC0 1.0 Universal
|
| 249 |
+
--------------------------------------------------------------------------------
|
| 250 |
+
|
| 251 |
+
Creative Commons Legal Code
|
| 252 |
+
|
| 253 |
+
CC0 1.0 Universal
|
| 254 |
+
|
| 255 |
+
CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
|
| 256 |
+
LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
|
| 257 |
+
ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
|
| 258 |
+
INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
|
| 259 |
+
REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
|
| 260 |
+
PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
|
| 261 |
+
THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
|
| 262 |
+
HEREUNDER.
|
| 263 |
+
|
| 264 |
+
Statement of Purpose
|
| 265 |
+
|
| 266 |
+
The laws of most jurisdictions throughout the world automatically confer
|
| 267 |
+
exclusive Copyright and Related Rights (defined below) upon the creator
|
| 268 |
+
and subsequent owner(s) (each and all, an "owner") of an original work of
|
| 269 |
+
authorship and/or a database (each, a "Work").
|
| 270 |
+
|
| 271 |
+
Certain owners wish to permanently relinquish those rights to a Work for
|
| 272 |
+
the purpose of contributing to a commons of creative, cultural and
|
| 273 |
+
scientific works ("Commons") that the public can reliably and without fear
|
| 274 |
+
of later claims of infringement build upon, modify, incorporate in other
|
| 275 |
+
works, reuse and redistribute as freely as possible in any form whatsoever
|
| 276 |
+
and for any purposes, including without limitation commercial purposes.
|
| 277 |
+
These owners may contribute to the Commons to promote the ideal of a free
|
| 278 |
+
culture and the further production of creative, cultural and scientific
|
| 279 |
+
works, or to gain reputation or greater distribution for their Work in
|
| 280 |
+
part through the use and efforts of others.
|
| 281 |
+
|
| 282 |
+
For these and/or other purposes and motivations, and without any
|
| 283 |
+
expectation of additional consideration or compensation, the person
|
| 284 |
+
associating CC0 with a Work (the "Affirmer"), to the extent that he or she
|
| 285 |
+
is an owner of Copyright and Related Rights in the Work, voluntarily
|
| 286 |
+
elects to apply CC0 to the Work and publicly distribute the Work under its
|
| 287 |
+
terms, with knowledge of his or her Copyright and Related Rights in the
|
| 288 |
+
Work and the meaning and intended legal effect of CC0 on those rights.
|
| 289 |
+
|
| 290 |
+
1. Copyright and Related Rights. A Work made available under CC0 may be
|
| 291 |
+
protected by copyright and related or neighboring rights ("Copyright and
|
| 292 |
+
Related Rights"). Copyright and Related Rights include, but are not
|
| 293 |
+
limited to, the following:
|
| 294 |
+
|
| 295 |
+
i. the right to reproduce, adapt, distribute, perform, display,
|
| 296 |
+
communicate, and translate a Work;
|
| 297 |
+
ii. moral rights retained by the original author(s) and/or performer(s);
|
| 298 |
+
iii. publicity and privacy rights pertaining to a person's image or
|
| 299 |
+
likeness depicted in a Work;
|
| 300 |
+
iv. rights protecting against unfair competition in regards to a Work,
|
| 301 |
+
subject to the limitations in paragraph 4(a), below;
|
| 302 |
+
v. rights protecting the extraction, dissemination, use and reuse of data
|
| 303 |
+
in a Work;
|
| 304 |
+
vi. database rights (such as those arising under Directive 96/9/EC of the
|
| 305 |
+
European Parliament and of the Council of 11 March 1996 on the legal
|
| 306 |
+
protection of databases, and under any national implementation
|
| 307 |
+
thereof, including any amended or successor version of such
|
| 308 |
+
directive); and
|
| 309 |
+
vii. other similar, equivalent or corresponding rights throughout the
|
| 310 |
+
world based on applicable law or treaty, and any national
|
| 311 |
+
implementations thereof.
|
| 312 |
+
|
| 313 |
+
2. Waiver. To the greatest extent permitted by, but not in contravention
|
| 314 |
+
of, applicable law, Affirmer hereby overtly, fully, permanently,
|
| 315 |
+
irrevocably and unconditionally waives, abandons, and surrenders all of
|
| 316 |
+
Affirmer's Copyright and Related Rights and associated claims and causes
|
| 317 |
+
of action, whether now known or unknown (including existing as well as
|
| 318 |
+
future claims and causes of action), in the Work (i) in all territories
|
| 319 |
+
worldwide, (ii) for the maximum duration provided by applicable law or
|
| 320 |
+
treaty (including future time extensions), (iii) in any current or future
|
| 321 |
+
medium and for any number of copies, and (iv) for any purpose whatsoever,
|
| 322 |
+
including without limitation commercial, advertising or promotional
|
| 323 |
+
purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
|
| 324 |
+
member of the public at large and to the detriment of Affirmer's heirs and
|
| 325 |
+
successors, fully intending that such Waiver shall not be subject to
|
| 326 |
+
revocation, rescission, cancellation, termination, or any other legal or
|
| 327 |
+
equitable action to disrupt the quiet enjoyment of the Work by the public
|
| 328 |
+
as contemplated by Affirmer's express Statement of Purpose.
|
| 329 |
+
|
| 330 |
+
3. Public License Fallback. Should any part of the Waiver for any reason
|
| 331 |
+
be judged legally invalid or ineffective under applicable law, then the
|
| 332 |
+
Waiver shall be preserved to the maximum extent permitted taking into
|
| 333 |
+
account Affirmer's express Statement of Purpose. In addition, to the
|
| 334 |
+
extent the Waiver is so judged Affirmer hereby grants to each affected
|
| 335 |
+
person a royalty-free, non transferable, non sublicensable, non exclusive,
|
| 336 |
+
irrevocable and unconditional license to exercise Affirmer's Copyright and
|
| 337 |
+
Related Rights in the Work (i) in all territories worldwide, (ii) for the
|
| 338 |
+
maximum duration provided by applicable law or treaty (including future
|
| 339 |
+
time extensions), (iii) in any current or future medium and for any number
|
| 340 |
+
of copies, and (iv) for any purpose whatsoever, including without
|
| 341 |
+
limitation commercial, advertising or promotional purposes (the
|
| 342 |
+
"License"). The License shall be deemed effective as of the date CC0 was
|
| 343 |
+
applied by Affirmer to the Work. Should any part of the License for any
|
| 344 |
+
reason be judged legally invalid or ineffective under applicable law, such
|
| 345 |
+
partial invalidity or ineffectiveness shall not invalidate the remainder
|
| 346 |
+
of the License, and in such case Affirmer hereby affirms that he or she
|
| 347 |
+
will not (i) exercise any of his or her remaining Copyright and Related
|
| 348 |
+
Rights in the Work or (ii) assert any associated claims and causes of
|
| 349 |
+
action with respect to the Work, in either case contrary to Affirmer's
|
| 350 |
+
express Statement of Purpose.
|
| 351 |
+
|
| 352 |
+
4. Limitations and Disclaimers.
|
| 353 |
+
|
| 354 |
+
a. No trademark or patent rights held by Affirmer are waived, abandoned,
|
| 355 |
+
surrendered, licensed or otherwise affected by this document.
|
| 356 |
+
b. Affirmer offers the Work as-is and makes no representations or
|
| 357 |
+
warranties of any kind concerning the Work, express, implied,
|
| 358 |
+
statutory or otherwise, including without limitation warranties of
|
| 359 |
+
title, merchantability, fitness for a particular purpose, non
|
| 360 |
+
infringement, or the absence of latent or other defects, accuracy, or
|
| 361 |
+
the present or absence of errors, whether or not discoverable, all to
|
| 362 |
+
the greatest extent permissible under applicable law.
|
| 363 |
+
c. Affirmer disclaims responsibility for clearing rights of other persons
|
| 364 |
+
that may apply to the Work or any use thereof, including without
|
| 365 |
+
limitation any person's Copyright and Related Rights in the Work.
|
| 366 |
+
Further, Affirmer disclaims responsibility for obtaining any necessary
|
| 367 |
+
consents, permissions or other rights required for any use of the
|
| 368 |
+
Work.
|
| 369 |
+
d. Affirmer understands and acknowledges that Creative Commons is not a
|
| 370 |
+
party to this document and has no duty or obligation with respect to
|
| 371 |
+
this CC0 or use of the Work.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/_core/src/multiarray/dragon4_LICENSE.txt
ADDED
|
@@ -0,0 +1,27 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Copyright (c) 2014 Ryan Juckett
|
| 2 |
+
|
| 3 |
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
| 4 |
+
of this software and associated documentation files (the "Software"), to
|
| 5 |
+
deal in the Software without restriction, including without limitation the
|
| 6 |
+
rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
| 7 |
+
sell copies of the Software, and to permit persons to whom the Software is
|
| 8 |
+
furnished to do so, subject to the following conditions:
|
| 9 |
+
|
| 10 |
+
The above copyright notice and this permission notice shall be included in
|
| 11 |
+
all copies or substantial portions of the Software.
|
| 12 |
+
|
| 13 |
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
| 14 |
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
| 15 |
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
| 16 |
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
| 17 |
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
| 18 |
+
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
| 19 |
+
IN THE SOFTWARE.
|
| 20 |
+
|
| 21 |
+
dragon4.c|h h contains a modified version of Ryan Juckett's Dragon4
|
| 22 |
+
implementation, obtained from https://www.ryanjuckett.com,
|
| 23 |
+
which has been ported from C++ to C and which has
|
| 24 |
+
modifications specific to printing floats in numpy.
|
| 25 |
+
|
| 26 |
+
Ryan Juckett's original code was under the Zlib license; he gave numpy
|
| 27 |
+
permission to include it under the MIT license instead.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/_core/src/npysort/x86-simd-sort/LICENSE.md
ADDED
|
@@ -0,0 +1,28 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
BSD 3-Clause License
|
| 2 |
+
|
| 3 |
+
Copyright (c) 2022, Intel. All rights reserved.
|
| 4 |
+
|
| 5 |
+
Redistribution and use in source and binary forms, with or without
|
| 6 |
+
modification, are permitted provided that the following conditions are met:
|
| 7 |
+
|
| 8 |
+
1. Redistributions of source code must retain the above copyright notice, this
|
| 9 |
+
list of conditions and the following disclaimer.
|
| 10 |
+
|
| 11 |
+
2. Redistributions in binary form must reproduce the above copyright notice,
|
| 12 |
+
this list of conditions and the following disclaimer in the documentation
|
| 13 |
+
and/or other materials provided with the distribution.
|
| 14 |
+
|
| 15 |
+
3. Neither the name of the copyright holder nor the names of its
|
| 16 |
+
contributors may be used to endorse or promote products derived from
|
| 17 |
+
this software without specific prior written permission.
|
| 18 |
+
|
| 19 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 20 |
+
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 21 |
+
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
| 22 |
+
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
| 23 |
+
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
| 24 |
+
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
| 25 |
+
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
| 26 |
+
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
| 27 |
+
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 28 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/_core/src/umath/svml/LICENSE
ADDED
|
@@ -0,0 +1,30 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Copyright (c) 2005-2021, NumPy 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 are
|
| 6 |
+
met:
|
| 7 |
+
|
| 8 |
+
* Redistributions of source code must retain the above copyright
|
| 9 |
+
notice, this list of conditions and the following disclaimer.
|
| 10 |
+
|
| 11 |
+
* 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 |
+
* Neither the name of the NumPy Developers nor the names of any
|
| 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.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/fft/pocketfft/LICENSE.md
ADDED
|
@@ -0,0 +1,25 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Copyright (C) 2010-2018 Max-Planck-Society
|
| 2 |
+
All rights reserved.
|
| 3 |
+
|
| 4 |
+
Redistribution and use in source and binary forms, with or without modification,
|
| 5 |
+
are permitted provided that the following conditions are met:
|
| 6 |
+
|
| 7 |
+
* Redistributions of source code must retain the above copyright notice, this
|
| 8 |
+
list of conditions and the following disclaimer.
|
| 9 |
+
* Redistributions in binary form must reproduce the above copyright notice, this
|
| 10 |
+
list of conditions and the following disclaimer in the documentation and/or
|
| 11 |
+
other materials provided with the distribution.
|
| 12 |
+
* Neither the name of the copyright holder nor the names of its contributors may
|
| 13 |
+
be used to endorse or promote products derived from this software without
|
| 14 |
+
specific prior written permission.
|
| 15 |
+
|
| 16 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
| 17 |
+
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
| 18 |
+
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
| 19 |
+
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
|
| 20 |
+
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
| 21 |
+
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
| 22 |
+
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
| 23 |
+
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 24 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
| 25 |
+
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/linalg/lapack_lite/LICENSE.txt
ADDED
|
@@ -0,0 +1,48 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Copyright (c) 1992-2013 The University of Tennessee and The University
|
| 2 |
+
of Tennessee Research Foundation. All rights
|
| 3 |
+
reserved.
|
| 4 |
+
Copyright (c) 2000-2013 The University of California Berkeley. All
|
| 5 |
+
rights reserved.
|
| 6 |
+
Copyright (c) 2006-2013 The University of Colorado Denver. All rights
|
| 7 |
+
reserved.
|
| 8 |
+
|
| 9 |
+
$COPYRIGHT$
|
| 10 |
+
|
| 11 |
+
Additional copyrights may follow
|
| 12 |
+
|
| 13 |
+
$HEADER$
|
| 14 |
+
|
| 15 |
+
Redistribution and use in source and binary forms, with or without
|
| 16 |
+
modification, are permitted provided that the following conditions are
|
| 17 |
+
met:
|
| 18 |
+
|
| 19 |
+
- Redistributions of source code must retain the above copyright
|
| 20 |
+
notice, this list of conditions and the following disclaimer.
|
| 21 |
+
|
| 22 |
+
- Redistributions in binary form must reproduce the above copyright
|
| 23 |
+
notice, this list of conditions and the following disclaimer listed
|
| 24 |
+
in this license in the documentation and/or other materials
|
| 25 |
+
provided with the distribution.
|
| 26 |
+
|
| 27 |
+
- Neither the name of the copyright holders nor the names of its
|
| 28 |
+
contributors may be used to endorse or promote products derived from
|
| 29 |
+
this software without specific prior written permission.
|
| 30 |
+
|
| 31 |
+
The copyright holders provide no reassurances that the source code
|
| 32 |
+
provided does not infringe any patent, copyright, or any other
|
| 33 |
+
intellectual property rights of third parties. The copyright holders
|
| 34 |
+
disclaim any liability to any recipient for claims brought against
|
| 35 |
+
recipient by any third party for infringement of that parties
|
| 36 |
+
intellectual property rights.
|
| 37 |
+
|
| 38 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 39 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 40 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 41 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 42 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 43 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 44 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 45 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 46 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 47 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 48 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/ma/LICENSE
ADDED
|
@@ -0,0 +1,24 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
* Copyright (c) 2006, University of Georgia and Pierre G.F. Gerard-Marchant
|
| 2 |
+
* All rights reserved.
|
| 3 |
+
* Redistribution and use in source and binary forms, with or without
|
| 4 |
+
* modification, are permitted provided that the following conditions are met:
|
| 5 |
+
*
|
| 6 |
+
* * Redistributions of source code must retain the above copyright
|
| 7 |
+
* notice, this list of conditions and the following disclaimer.
|
| 8 |
+
* * Redistributions in binary form must reproduce the above copyright
|
| 9 |
+
* notice, this list of conditions and the following disclaimer in the
|
| 10 |
+
* documentation and/or other materials provided with the distribution.
|
| 11 |
+
* * Neither the name of the University of Georgia nor the
|
| 12 |
+
* names of its contributors may be used to endorse or promote products
|
| 13 |
+
* derived from this software without specific prior written permission.
|
| 14 |
+
*
|
| 15 |
+
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
|
| 16 |
+
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
| 17 |
+
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
| 18 |
+
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
|
| 19 |
+
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
| 20 |
+
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
| 21 |
+
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
| 22 |
+
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 23 |
+
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
| 24 |
+
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/LICENSE.md
ADDED
|
@@ -0,0 +1,71 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
**This software is dual-licensed under the The University of Illinois/NCSA
|
| 2 |
+
Open Source License (NCSA) and The 3-Clause BSD License**
|
| 3 |
+
|
| 4 |
+
# NCSA Open Source License
|
| 5 |
+
**Copyright (c) 2019 Kevin Sheppard. All rights reserved.**
|
| 6 |
+
|
| 7 |
+
Developed by: Kevin Sheppard (<kevin.sheppard@economics.ox.ac.uk>,
|
| 8 |
+
<kevin.k.sheppard@gmail.com>)
|
| 9 |
+
[http://www.kevinsheppard.com](http://www.kevinsheppard.com)
|
| 10 |
+
|
| 11 |
+
Permission is hereby granted, free of charge, to any person obtaining a copy of
|
| 12 |
+
this software and associated documentation files (the "Software"), to deal with
|
| 13 |
+
the Software without restriction, including without limitation the rights to
|
| 14 |
+
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
|
| 15 |
+
of the Software, and to permit persons to whom the Software is furnished to do
|
| 16 |
+
so, subject to the following conditions:
|
| 17 |
+
|
| 18 |
+
Redistributions of source code must retain the above copyright notice, this
|
| 19 |
+
list of conditions and the following disclaimers.
|
| 20 |
+
|
| 21 |
+
Redistributions in binary form must reproduce the above copyright notice, this
|
| 22 |
+
list of conditions and the following disclaimers in the documentation and/or
|
| 23 |
+
other materials provided with the distribution.
|
| 24 |
+
|
| 25 |
+
Neither the names of Kevin Sheppard, nor the names of any contributors may be
|
| 26 |
+
used to endorse or promote products derived from this Software without specific
|
| 27 |
+
prior written permission.
|
| 28 |
+
|
| 29 |
+
**THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
| 30 |
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
| 31 |
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
| 32 |
+
CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
| 33 |
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
| 34 |
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH
|
| 35 |
+
THE SOFTWARE.**
|
| 36 |
+
|
| 37 |
+
|
| 38 |
+
# 3-Clause BSD License
|
| 39 |
+
**Copyright (c) 2019 Kevin Sheppard. All rights reserved.**
|
| 40 |
+
|
| 41 |
+
Redistribution and use in source and binary forms, with or without
|
| 42 |
+
modification, are permitted provided that the following conditions are met:
|
| 43 |
+
|
| 44 |
+
1. Redistributions of source code must retain the above copyright notice,
|
| 45 |
+
this list of conditions and the following disclaimer.
|
| 46 |
+
|
| 47 |
+
2. Redistributions in binary form must reproduce the above copyright notice,
|
| 48 |
+
this list of conditions and the following disclaimer in the documentation
|
| 49 |
+
and/or other materials provided with the distribution.
|
| 50 |
+
|
| 51 |
+
3. Neither the name of the copyright holder nor the names of its contributors
|
| 52 |
+
may be used to endorse or promote products derived from this software
|
| 53 |
+
without specific prior written permission.
|
| 54 |
+
|
| 55 |
+
**THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 56 |
+
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 57 |
+
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 58 |
+
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
|
| 59 |
+
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
| 60 |
+
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
| 61 |
+
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
| 62 |
+
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
| 63 |
+
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
| 64 |
+
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
|
| 65 |
+
THE POSSIBILITY OF SUCH DAMAGE.**
|
| 66 |
+
|
| 67 |
+
# Components
|
| 68 |
+
|
| 69 |
+
Many parts of this module have been derived from original sources,
|
| 70 |
+
often the algorithm's designer. Component licenses are located with
|
| 71 |
+
the component code.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/src/distributions/LICENSE.md
ADDED
|
@@ -0,0 +1,61 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
## NumPy
|
| 2 |
+
|
| 3 |
+
Copyright (c) 2005-2017, NumPy Developers.
|
| 4 |
+
All rights reserved.
|
| 5 |
+
|
| 6 |
+
Redistribution and use in source and binary forms, with or without
|
| 7 |
+
modification, are permitted provided that the following conditions are
|
| 8 |
+
met:
|
| 9 |
+
|
| 10 |
+
* Redistributions of source code must retain the above copyright
|
| 11 |
+
notice, this list of conditions and the following disclaimer.
|
| 12 |
+
|
| 13 |
+
* Redistributions in binary form must reproduce the above
|
| 14 |
+
copyright notice, this list of conditions and the following
|
| 15 |
+
disclaimer in the documentation and/or other materials provided
|
| 16 |
+
with the distribution.
|
| 17 |
+
|
| 18 |
+
* Neither the name of the NumPy Developers nor the names of any
|
| 19 |
+
contributors may be used to endorse or promote products derived
|
| 20 |
+
from this software without specific prior written permission.
|
| 21 |
+
|
| 22 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 23 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 24 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 25 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 26 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 27 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 28 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 29 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 30 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 31 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 32 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 33 |
+
|
| 34 |
+
|
| 35 |
+
## Julia
|
| 36 |
+
|
| 37 |
+
The ziggurat methods were derived from Julia.
|
| 38 |
+
|
| 39 |
+
Copyright (c) 2009-2019: Jeff Bezanson, Stefan Karpinski, Viral B. Shah,
|
| 40 |
+
and other contributors:
|
| 41 |
+
|
| 42 |
+
https://github.com/JuliaLang/julia/contributors
|
| 43 |
+
|
| 44 |
+
Permission is hereby granted, free of charge, to any person obtaining
|
| 45 |
+
a copy of this software and associated documentation files (the
|
| 46 |
+
"Software"), to deal in the Software without restriction, including
|
| 47 |
+
without limitation the rights to use, copy, modify, merge, publish,
|
| 48 |
+
distribute, sublicense, and/or sell copies of the Software, and to
|
| 49 |
+
permit persons to whom the Software is furnished to do so, subject to
|
| 50 |
+
the following conditions:
|
| 51 |
+
|
| 52 |
+
The above copyright notice and this permission notice shall be
|
| 53 |
+
included in all copies or substantial portions of the Software.
|
| 54 |
+
|
| 55 |
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
| 56 |
+
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
| 57 |
+
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
| 58 |
+
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
| 59 |
+
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
| 60 |
+
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
| 61 |
+
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/src/mt19937/LICENSE.md
ADDED
|
@@ -0,0 +1,61 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# MT19937
|
| 2 |
+
|
| 3 |
+
Copyright (c) 2003-2005, Jean-Sebastien Roy (js@jeannot.org)
|
| 4 |
+
|
| 5 |
+
The rk_random and rk_seed functions algorithms and the original design of
|
| 6 |
+
the Mersenne Twister RNG:
|
| 7 |
+
|
| 8 |
+
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
|
| 9 |
+
All rights reserved.
|
| 10 |
+
|
| 11 |
+
Redistribution and use in source and binary forms, with or without
|
| 12 |
+
modification, are permitted provided that the following conditions
|
| 13 |
+
are met:
|
| 14 |
+
|
| 15 |
+
1. Redistributions of source code must retain the above copyright
|
| 16 |
+
notice, this list of conditions and the following disclaimer.
|
| 17 |
+
|
| 18 |
+
2. Redistributions in binary form must reproduce the above copyright
|
| 19 |
+
notice, this list of conditions and the following disclaimer in the
|
| 20 |
+
documentation and/or other materials provided with the distribution.
|
| 21 |
+
|
| 22 |
+
3. The names of its contributors may not be used to endorse or promote
|
| 23 |
+
products derived from this software without specific prior written
|
| 24 |
+
permission.
|
| 25 |
+
|
| 26 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 27 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 28 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 29 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
|
| 30 |
+
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
| 31 |
+
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
| 32 |
+
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
| 33 |
+
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
| 34 |
+
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
| 35 |
+
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
| 36 |
+
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 37 |
+
|
| 38 |
+
Original algorithm for the implementation of rk_interval function from
|
| 39 |
+
Richard J. Wagner's implementation of the Mersenne Twister RNG, optimised by
|
| 40 |
+
Magnus Jonsson.
|
| 41 |
+
|
| 42 |
+
Constants used in the rk_double implementation by Isaku Wada.
|
| 43 |
+
|
| 44 |
+
Permission is hereby granted, free of charge, to any person obtaining a
|
| 45 |
+
copy of this software and associated documentation files (the
|
| 46 |
+
"Software"), to deal in the Software without restriction, including
|
| 47 |
+
without limitation the rights to use, copy, modify, merge, publish,
|
| 48 |
+
distribute, sublicense, and/or sell copies of the Software, and to
|
| 49 |
+
permit persons to whom the Software is furnished to do so, subject to
|
| 50 |
+
the following conditions:
|
| 51 |
+
|
| 52 |
+
The above copyright notice and this permission notice shall be included
|
| 53 |
+
in all copies or substantial portions of the Software.
|
| 54 |
+
|
| 55 |
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
| 56 |
+
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
| 57 |
+
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
| 58 |
+
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
|
| 59 |
+
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
|
| 60 |
+
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
| 61 |
+
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/src/pcg64/LICENSE.md
ADDED
|
@@ -0,0 +1,22 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# PCG64
|
| 2 |
+
|
| 3 |
+
## The MIT License
|
| 4 |
+
|
| 5 |
+
PCG Random Number Generation for C.
|
| 6 |
+
|
| 7 |
+
Copyright 2014 Melissa O'Neill <oneill@pcg-random.org>
|
| 8 |
+
|
| 9 |
+
Permission is hereby granted, free of charge, to any person obtaining
|
| 10 |
+
a copy of this software and associated documentation files (the "Software"),
|
| 11 |
+
to deal in the Software without restriction, including without limitation
|
| 12 |
+
the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
|
| 13 |
+
|
| 14 |
+
The above copyright notice and this permission notice shall be included in
|
| 15 |
+
all copies or substantial portions of the Software.
|
| 16 |
+
|
| 17 |
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
| 18 |
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
|
| 19 |
+
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
|
| 20 |
+
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
|
| 21 |
+
IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
| 22 |
+
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/src/philox/LICENSE.md
ADDED
|
@@ -0,0 +1,31 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# PHILOX
|
| 2 |
+
|
| 3 |
+
Copyright 2010-2012, D. E. Shaw Research.
|
| 4 |
+
All rights reserved.
|
| 5 |
+
|
| 6 |
+
Redistribution and use in source and binary forms, with or without
|
| 7 |
+
modification, are permitted provided that the following conditions are
|
| 8 |
+
met:
|
| 9 |
+
|
| 10 |
+
* Redistributions of source code must retain the above copyright
|
| 11 |
+
notice, this list of conditions, and the following disclaimer.
|
| 12 |
+
|
| 13 |
+
* Redistributions in binary form must reproduce the above copyright
|
| 14 |
+
notice, this list of conditions, and the following disclaimer in the
|
| 15 |
+
documentation and/or other materials provided with the distribution.
|
| 16 |
+
|
| 17 |
+
* Neither the name of D. E. Shaw Research nor the names of its
|
| 18 |
+
contributors may be used to endorse or promote products derived from
|
| 19 |
+
this software without specific prior written permission.
|
| 20 |
+
|
| 21 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 22 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 23 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 24 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 25 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 26 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 27 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 28 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 29 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 30 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 31 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/src/sfc64/LICENSE.md
ADDED
|
@@ -0,0 +1,27 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# SFC64
|
| 2 |
+
|
| 3 |
+
## The MIT License
|
| 4 |
+
|
| 5 |
+
Adapted from a C++ implementation of Chris Doty-Humphrey's SFC PRNG.
|
| 6 |
+
|
| 7 |
+
https://gist.github.com/imneme/f1f7821f07cf76504a97f6537c818083
|
| 8 |
+
|
| 9 |
+
Copyright (c) 2018 Melissa E. O'Neill
|
| 10 |
+
|
| 11 |
+
Permission is hereby granted, free of charge, to any person obtaining a
|
| 12 |
+
copy of this software and associated documentation files (the "Software"),
|
| 13 |
+
to deal in the Software without restriction, including without limitation
|
| 14 |
+
the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
| 15 |
+
and/or sell copies of the Software, and to permit persons to whom the
|
| 16 |
+
Software is furnished to do so, subject to the following conditions:
|
| 17 |
+
|
| 18 |
+
The above copyright notice and this permission notice shall be included in
|
| 19 |
+
all copies or substantial portions of the Software.
|
| 20 |
+
|
| 21 |
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
| 22 |
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
| 23 |
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
| 24 |
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
| 25 |
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
| 26 |
+
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
| 27 |
+
DEALINGS IN THE SOFTWARE.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy-2.5.2.dist-info/licenses/numpy/random/src/splitmix64/LICENSE.md
ADDED
|
@@ -0,0 +1,9 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# SPLITMIX64
|
| 2 |
+
|
| 3 |
+
Written in 2015 by Sebastiano Vigna (vigna@acm.org)
|
| 4 |
+
|
| 5 |
+
To the extent possible under law, the author has dedicated all copyright
|
| 6 |
+
and related and neighboring rights to this software to the public domain
|
| 7 |
+
worldwide. This software is distributed without any warranty.
|
| 8 |
+
|
| 9 |
+
See <http://creativecommons.org/publicdomain/zero/1.0/>.
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy.libs/libgfortran-83c28eba-468e71e5.so.5.0.0
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:a6a368328d02a5d8a149746f13f6268f8cc9192df5c18777b25c3c9b5ef52160
|
| 3 |
+
size 2862249
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy.libs/libquadmath-2284e583-a9307bba.so.0.0.0
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:6bc3069003caec1f075be3c51ae8355332f081fa9465910c4b5724e7fe7d8ad4
|
| 3 |
+
size 275553
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy.libs/libscipy_openblas64_-61654e39.so
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:6cad8d2ad994ddc43d2ccdb0fb5d9458373ff1b87ef7ff420f2f94406eb8f082
|
| 3 |
+
size 25210641
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/random.pyi
ADDED
|
@@ -0,0 +1,1357 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import threading
|
| 2 |
+
from collections.abc import Sequence
|
| 3 |
+
from typing import Any, assert_type
|
| 4 |
+
|
| 5 |
+
import numpy as np
|
| 6 |
+
import numpy.typing as npt
|
| 7 |
+
from numpy.random._generator import Generator
|
| 8 |
+
from numpy.random._mt19937 import MT19937
|
| 9 |
+
from numpy.random._pcg64 import PCG64
|
| 10 |
+
from numpy.random._philox import Philox
|
| 11 |
+
from numpy.random._sfc64 import SFC64
|
| 12 |
+
from numpy.random.bit_generator import SeedlessSeedSequence, SeedSequence
|
| 13 |
+
|
| 14 |
+
def_rng = np.random.default_rng()
|
| 15 |
+
seed_seq = np.random.SeedSequence()
|
| 16 |
+
mt19937 = np.random.MT19937()
|
| 17 |
+
pcg64 = np.random.PCG64()
|
| 18 |
+
sfc64 = np.random.SFC64()
|
| 19 |
+
philox = np.random.Philox()
|
| 20 |
+
seedless_seq = SeedlessSeedSequence()
|
| 21 |
+
|
| 22 |
+
assert_type(def_rng, Generator)
|
| 23 |
+
assert_type(mt19937, MT19937)
|
| 24 |
+
assert_type(pcg64, PCG64)
|
| 25 |
+
assert_type(sfc64, SFC64)
|
| 26 |
+
assert_type(philox, Philox)
|
| 27 |
+
assert_type(seed_seq, SeedSequence)
|
| 28 |
+
assert_type(seedless_seq, SeedlessSeedSequence)
|
| 29 |
+
|
| 30 |
+
mt19937_jumped = mt19937.jumped()
|
| 31 |
+
mt19937_jumped3 = mt19937.jumped(3)
|
| 32 |
+
mt19937_raw = mt19937.random_raw()
|
| 33 |
+
mt19937_raw_arr = mt19937.random_raw(5)
|
| 34 |
+
|
| 35 |
+
assert_type(mt19937_jumped, MT19937)
|
| 36 |
+
assert_type(mt19937_jumped3, MT19937)
|
| 37 |
+
assert_type(mt19937_raw, int)
|
| 38 |
+
assert_type(mt19937_raw_arr, npt.NDArray[np.uint64])
|
| 39 |
+
assert_type(mt19937.lock, threading.Lock)
|
| 40 |
+
|
| 41 |
+
pcg64_jumped = pcg64.jumped()
|
| 42 |
+
pcg64_jumped3 = pcg64.jumped(3)
|
| 43 |
+
pcg64_adv = pcg64.advance(3)
|
| 44 |
+
pcg64_raw = pcg64.random_raw()
|
| 45 |
+
pcg64_raw_arr = pcg64.random_raw(5)
|
| 46 |
+
|
| 47 |
+
assert_type(pcg64_jumped, PCG64)
|
| 48 |
+
assert_type(pcg64_jumped3, PCG64)
|
| 49 |
+
assert_type(pcg64_adv, PCG64)
|
| 50 |
+
assert_type(pcg64_raw, int)
|
| 51 |
+
assert_type(pcg64_raw_arr, npt.NDArray[np.uint64])
|
| 52 |
+
assert_type(pcg64.lock, threading.Lock)
|
| 53 |
+
|
| 54 |
+
philox_jumped = philox.jumped()
|
| 55 |
+
philox_jumped3 = philox.jumped(3)
|
| 56 |
+
philox_adv = philox.advance(3)
|
| 57 |
+
philox_raw = philox.random_raw()
|
| 58 |
+
philox_raw_arr = philox.random_raw(5)
|
| 59 |
+
|
| 60 |
+
assert_type(philox_jumped, Philox)
|
| 61 |
+
assert_type(philox_jumped3, Philox)
|
| 62 |
+
assert_type(philox_adv, Philox)
|
| 63 |
+
assert_type(philox_raw, int)
|
| 64 |
+
assert_type(philox_raw_arr, npt.NDArray[np.uint64])
|
| 65 |
+
assert_type(philox.lock, threading.Lock)
|
| 66 |
+
|
| 67 |
+
sfc64_raw = sfc64.random_raw()
|
| 68 |
+
sfc64_raw_arr = sfc64.random_raw(5)
|
| 69 |
+
|
| 70 |
+
assert_type(sfc64_raw, int)
|
| 71 |
+
assert_type(sfc64_raw_arr, npt.NDArray[np.uint64])
|
| 72 |
+
assert_type(sfc64.lock, threading.Lock)
|
| 73 |
+
|
| 74 |
+
assert_type(seed_seq.pool, npt.NDArray[np.uint32])
|
| 75 |
+
assert_type(seed_seq.entropy, int | Sequence[int] | None)
|
| 76 |
+
assert_type(seed_seq.spawn(1), list[np.random.SeedSequence])
|
| 77 |
+
assert_type(seed_seq.generate_state(8, "uint32"), npt.NDArray[np.uint32 | np.uint64])
|
| 78 |
+
assert_type(seed_seq.generate_state(8, "uint64"), npt.NDArray[np.uint32 | np.uint64])
|
| 79 |
+
|
| 80 |
+
def_gen: np.random.Generator = np.random.default_rng()
|
| 81 |
+
|
| 82 |
+
D_arr_0p1: npt.NDArray[np.float64] = np.array([0.1])
|
| 83 |
+
D_arr_0p5: npt.NDArray[np.float64] = np.array([0.5])
|
| 84 |
+
D_arr_0p9: npt.NDArray[np.float64] = np.array([0.9])
|
| 85 |
+
D_arr_1p5: npt.NDArray[np.float64] = np.array([1.5])
|
| 86 |
+
I_arr_10: npt.NDArray[np.int_] = np.array([10], dtype=np.int_)
|
| 87 |
+
I_arr_20: npt.NDArray[np.int_] = np.array([20], dtype=np.int_)
|
| 88 |
+
D_arr_like_0p1: list[float] = [0.1]
|
| 89 |
+
D_arr_like_0p5: list[float] = [0.5]
|
| 90 |
+
D_arr_like_0p9: list[float] = [0.9]
|
| 91 |
+
D_arr_like_1p5: list[float] = [1.5]
|
| 92 |
+
I_arr_like_10: list[int] = [10]
|
| 93 |
+
I_arr_like_20: list[int] = [20]
|
| 94 |
+
D_2D_like: list[list[float]] = [[1, 2], [2, 3], [3, 4], [4, 5.1]]
|
| 95 |
+
D_2D: npt.NDArray[np.float64] = np.array(D_2D_like)
|
| 96 |
+
S_out: npt.NDArray[np.float32] = np.empty(1, dtype=np.float32)
|
| 97 |
+
D_out: npt.NDArray[np.float64] = np.empty(1)
|
| 98 |
+
|
| 99 |
+
assert_type(def_gen.standard_normal(), float)
|
| 100 |
+
assert_type(def_gen.standard_normal(dtype=np.float32), float)
|
| 101 |
+
assert_type(def_gen.standard_normal(dtype="float32"), float)
|
| 102 |
+
assert_type(def_gen.standard_normal(dtype="double"), float)
|
| 103 |
+
assert_type(def_gen.standard_normal(dtype=np.float64), float)
|
| 104 |
+
assert_type(def_gen.standard_normal(size=None), float)
|
| 105 |
+
assert_type(def_gen.standard_normal(size=1), npt.NDArray[np.float64])
|
| 106 |
+
assert_type(def_gen.standard_normal(size=1, dtype=np.float32), npt.NDArray[np.float32])
|
| 107 |
+
assert_type(def_gen.standard_normal(size=1, dtype="f4"), npt.NDArray[np.float32])
|
| 108 |
+
assert_type(def_gen.standard_normal(size=1, dtype="float32", out=S_out), npt.NDArray[np.float32])
|
| 109 |
+
assert_type(def_gen.standard_normal(dtype=np.float32, out=S_out), npt.NDArray[np.float32])
|
| 110 |
+
assert_type(def_gen.standard_normal(size=1, dtype=np.float64), npt.NDArray[np.float64])
|
| 111 |
+
assert_type(def_gen.standard_normal(size=1, dtype="float64"), npt.NDArray[np.float64])
|
| 112 |
+
assert_type(def_gen.standard_normal(size=1, dtype="f8"), npt.NDArray[np.float64])
|
| 113 |
+
assert_type(def_gen.standard_normal(out=D_out), npt.NDArray[np.float64])
|
| 114 |
+
assert_type(def_gen.standard_normal(size=1, dtype="float64"), npt.NDArray[np.float64])
|
| 115 |
+
assert_type(def_gen.standard_normal(size=1, dtype="float64", out=D_out), npt.NDArray[np.float64])
|
| 116 |
+
|
| 117 |
+
assert_type(def_gen.random(), float)
|
| 118 |
+
assert_type(def_gen.random(dtype=np.float32), float)
|
| 119 |
+
assert_type(def_gen.random(dtype="float32"), float)
|
| 120 |
+
assert_type(def_gen.random(dtype="double"), float)
|
| 121 |
+
assert_type(def_gen.random(dtype=np.float64), float)
|
| 122 |
+
assert_type(def_gen.random(size=None), float)
|
| 123 |
+
assert_type(def_gen.random(size=1), npt.NDArray[np.float64])
|
| 124 |
+
assert_type(def_gen.random(size=1, dtype=np.float32), npt.NDArray[np.float32])
|
| 125 |
+
assert_type(def_gen.random(size=1, dtype="f4"), npt.NDArray[np.float32])
|
| 126 |
+
assert_type(def_gen.random(size=1, dtype="float32", out=S_out), npt.NDArray[np.float32])
|
| 127 |
+
assert_type(def_gen.random(dtype=np.float32, out=S_out), npt.NDArray[np.float32])
|
| 128 |
+
assert_type(def_gen.random(size=1, dtype=np.float64), npt.NDArray[np.float64])
|
| 129 |
+
assert_type(def_gen.random(size=1, dtype="float64"), npt.NDArray[np.float64])
|
| 130 |
+
assert_type(def_gen.random(size=1, dtype="f8"), npt.NDArray[np.float64])
|
| 131 |
+
assert_type(def_gen.random(out=D_out), npt.NDArray[np.float64])
|
| 132 |
+
assert_type(def_gen.random(size=1, dtype="float64"), npt.NDArray[np.float64])
|
| 133 |
+
assert_type(def_gen.random(size=1, dtype="float64", out=D_out), npt.NDArray[np.float64])
|
| 134 |
+
|
| 135 |
+
assert_type(def_gen.standard_cauchy(), float)
|
| 136 |
+
assert_type(def_gen.standard_cauchy(size=None), float)
|
| 137 |
+
assert_type(def_gen.standard_cauchy(size=1), npt.NDArray[np.float64])
|
| 138 |
+
|
| 139 |
+
assert_type(def_gen.standard_exponential(), float)
|
| 140 |
+
assert_type(def_gen.standard_exponential(method="inv"), float)
|
| 141 |
+
assert_type(def_gen.standard_exponential(dtype=np.float32), float)
|
| 142 |
+
assert_type(def_gen.standard_exponential(dtype="float32"), float)
|
| 143 |
+
assert_type(def_gen.standard_exponential(dtype="double"), float)
|
| 144 |
+
assert_type(def_gen.standard_exponential(dtype=np.float64), float)
|
| 145 |
+
assert_type(def_gen.standard_exponential(size=None), float)
|
| 146 |
+
assert_type(def_gen.standard_exponential(size=None, method="inv"), float)
|
| 147 |
+
assert_type(def_gen.standard_exponential(size=1, method="inv"), npt.NDArray[np.float64])
|
| 148 |
+
assert_type(def_gen.standard_exponential(size=1, dtype=np.float32), npt.NDArray[np.float32])
|
| 149 |
+
assert_type(def_gen.standard_exponential(size=1, dtype="f4", method="inv"), npt.NDArray[np.float32])
|
| 150 |
+
assert_type(def_gen.standard_exponential(size=1, dtype="float32", out=S_out), npt.NDArray[np.float32])
|
| 151 |
+
assert_type(def_gen.standard_exponential(dtype=np.float32, out=S_out), npt.NDArray[np.float32])
|
| 152 |
+
assert_type(def_gen.standard_exponential(size=1, dtype=np.float64, method="inv"), npt.NDArray[np.float64])
|
| 153 |
+
assert_type(def_gen.standard_exponential(size=1, dtype="float64"), npt.NDArray[np.float64])
|
| 154 |
+
assert_type(def_gen.standard_exponential(size=1, dtype="f8"), npt.NDArray[np.float64])
|
| 155 |
+
assert_type(def_gen.standard_exponential(out=D_out), npt.NDArray[np.float64])
|
| 156 |
+
assert_type(def_gen.standard_exponential(size=1, dtype="float64"), npt.NDArray[np.float64])
|
| 157 |
+
assert_type(def_gen.standard_exponential(size=1, dtype="float64", out=D_out), npt.NDArray[np.float64])
|
| 158 |
+
|
| 159 |
+
assert_type(def_gen.zipf(1.5), int)
|
| 160 |
+
assert_type(def_gen.zipf(1.5, size=None), int)
|
| 161 |
+
assert_type(def_gen.zipf(1.5, size=1), npt.NDArray[np.int64])
|
| 162 |
+
assert_type(def_gen.zipf(D_arr_1p5), npt.NDArray[np.int64])
|
| 163 |
+
assert_type(def_gen.zipf(D_arr_1p5, size=1), npt.NDArray[np.int64])
|
| 164 |
+
assert_type(def_gen.zipf(D_arr_like_1p5), npt.NDArray[np.int64])
|
| 165 |
+
assert_type(def_gen.zipf(D_arr_like_1p5, size=1), npt.NDArray[np.int64])
|
| 166 |
+
|
| 167 |
+
assert_type(def_gen.weibull(0.5), float)
|
| 168 |
+
assert_type(def_gen.weibull(0.5, size=None), float)
|
| 169 |
+
assert_type(def_gen.weibull(0.5, size=1), npt.NDArray[np.float64])
|
| 170 |
+
assert_type(def_gen.weibull(D_arr_0p5), npt.NDArray[np.float64])
|
| 171 |
+
assert_type(def_gen.weibull(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 172 |
+
assert_type(def_gen.weibull(D_arr_like_0p5), npt.NDArray[np.float64])
|
| 173 |
+
assert_type(def_gen.weibull(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 174 |
+
|
| 175 |
+
assert_type(def_gen.standard_t(0.5), float)
|
| 176 |
+
assert_type(def_gen.standard_t(0.5, size=None), float)
|
| 177 |
+
assert_type(def_gen.standard_t(0.5, size=1), npt.NDArray[np.float64])
|
| 178 |
+
assert_type(def_gen.standard_t(D_arr_0p5), npt.NDArray[np.float64])
|
| 179 |
+
assert_type(def_gen.standard_t(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 180 |
+
assert_type(def_gen.standard_t(D_arr_like_0p5), npt.NDArray[np.float64])
|
| 181 |
+
assert_type(def_gen.standard_t(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 182 |
+
|
| 183 |
+
assert_type(def_gen.poisson(0.5), int)
|
| 184 |
+
assert_type(def_gen.poisson(0.5, size=None), int)
|
| 185 |
+
assert_type(def_gen.poisson(0.5, size=1), npt.NDArray[np.int64])
|
| 186 |
+
assert_type(def_gen.poisson(D_arr_0p5), npt.NDArray[np.int64])
|
| 187 |
+
assert_type(def_gen.poisson(D_arr_0p5, size=1), npt.NDArray[np.int64])
|
| 188 |
+
assert_type(def_gen.poisson(D_arr_like_0p5), npt.NDArray[np.int64])
|
| 189 |
+
assert_type(def_gen.poisson(D_arr_like_0p5, size=1), npt.NDArray[np.int64])
|
| 190 |
+
|
| 191 |
+
assert_type(def_gen.power(0.5), float)
|
| 192 |
+
assert_type(def_gen.power(0.5, size=None), float)
|
| 193 |
+
assert_type(def_gen.power(0.5, size=1), npt.NDArray[np.float64])
|
| 194 |
+
assert_type(def_gen.power(D_arr_0p5), npt.NDArray[np.float64])
|
| 195 |
+
assert_type(def_gen.power(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 196 |
+
assert_type(def_gen.power(D_arr_like_0p5), npt.NDArray[np.float64])
|
| 197 |
+
assert_type(def_gen.power(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 198 |
+
|
| 199 |
+
assert_type(def_gen.pareto(0.5), float)
|
| 200 |
+
assert_type(def_gen.pareto(0.5, size=None), float)
|
| 201 |
+
assert_type(def_gen.pareto(0.5, size=1), npt.NDArray[np.float64])
|
| 202 |
+
assert_type(def_gen.pareto(D_arr_0p5), npt.NDArray[np.float64])
|
| 203 |
+
assert_type(def_gen.pareto(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 204 |
+
assert_type(def_gen.pareto(D_arr_like_0p5), npt.NDArray[np.float64])
|
| 205 |
+
assert_type(def_gen.pareto(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 206 |
+
|
| 207 |
+
assert_type(def_gen.chisquare(0.5), float)
|
| 208 |
+
assert_type(def_gen.chisquare(0.5, size=None), float)
|
| 209 |
+
assert_type(def_gen.chisquare(0.5, size=1), npt.NDArray[np.float64])
|
| 210 |
+
assert_type(def_gen.chisquare(D_arr_0p5), npt.NDArray[np.float64])
|
| 211 |
+
assert_type(def_gen.chisquare(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 212 |
+
assert_type(def_gen.chisquare(D_arr_like_0p5), npt.NDArray[np.float64])
|
| 213 |
+
assert_type(def_gen.chisquare(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 214 |
+
|
| 215 |
+
assert_type(def_gen.exponential(0.5), float)
|
| 216 |
+
assert_type(def_gen.exponential(0.5, size=None), float)
|
| 217 |
+
assert_type(def_gen.exponential(0.5, size=1), npt.NDArray[np.float64])
|
| 218 |
+
assert_type(def_gen.exponential(D_arr_0p5), npt.NDArray[np.float64])
|
| 219 |
+
assert_type(def_gen.exponential(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 220 |
+
assert_type(def_gen.exponential(D_arr_like_0p5), npt.NDArray[np.float64])
|
| 221 |
+
assert_type(def_gen.exponential(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 222 |
+
|
| 223 |
+
assert_type(def_gen.geometric(0.5), int)
|
| 224 |
+
assert_type(def_gen.geometric(0.5, size=None), int)
|
| 225 |
+
assert_type(def_gen.geometric(0.5, size=1), npt.NDArray[np.int64])
|
| 226 |
+
assert_type(def_gen.geometric(D_arr_0p5), npt.NDArray[np.int64])
|
| 227 |
+
assert_type(def_gen.geometric(D_arr_0p5, size=1), npt.NDArray[np.int64])
|
| 228 |
+
assert_type(def_gen.geometric(D_arr_like_0p5), npt.NDArray[np.int64])
|
| 229 |
+
assert_type(def_gen.geometric(D_arr_like_0p5, size=1), npt.NDArray[np.int64])
|
| 230 |
+
|
| 231 |
+
assert_type(def_gen.logseries(0.5), int)
|
| 232 |
+
assert_type(def_gen.logseries(0.5, size=None), int)
|
| 233 |
+
assert_type(def_gen.logseries(0.5, size=1), npt.NDArray[np.int64])
|
| 234 |
+
assert_type(def_gen.logseries(D_arr_0p5), npt.NDArray[np.int64])
|
| 235 |
+
assert_type(def_gen.logseries(D_arr_0p5, size=1), npt.NDArray[np.int64])
|
| 236 |
+
assert_type(def_gen.logseries(D_arr_like_0p5), npt.NDArray[np.int64])
|
| 237 |
+
assert_type(def_gen.logseries(D_arr_like_0p5, size=1), npt.NDArray[np.int64])
|
| 238 |
+
|
| 239 |
+
assert_type(def_gen.rayleigh(0.5), float)
|
| 240 |
+
assert_type(def_gen.rayleigh(0.5, size=None), float)
|
| 241 |
+
assert_type(def_gen.rayleigh(0.5, size=1), npt.NDArray[np.float64])
|
| 242 |
+
assert_type(def_gen.rayleigh(D_arr_0p5), npt.NDArray[np.float64])
|
| 243 |
+
assert_type(def_gen.rayleigh(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 244 |
+
assert_type(def_gen.rayleigh(D_arr_like_0p5), npt.NDArray[np.float64])
|
| 245 |
+
assert_type(def_gen.rayleigh(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 246 |
+
|
| 247 |
+
assert_type(def_gen.standard_gamma(0.5), float)
|
| 248 |
+
assert_type(def_gen.standard_gamma(0.5, size=None), float)
|
| 249 |
+
assert_type(def_gen.standard_gamma(0.5, dtype="float32"), float)
|
| 250 |
+
assert_type(def_gen.standard_gamma(0.5, size=None, dtype="float32"), float)
|
| 251 |
+
assert_type(def_gen.standard_gamma(0.5, size=1), npt.NDArray[np.float64])
|
| 252 |
+
assert_type(def_gen.standard_gamma(D_arr_0p5), npt.NDArray[np.float64])
|
| 253 |
+
assert_type(def_gen.standard_gamma(D_arr_0p5, dtype="f4"), npt.NDArray[np.float32])
|
| 254 |
+
assert_type(def_gen.standard_gamma(0.5, size=1, dtype="float32", out=S_out), npt.NDArray[np.float32])
|
| 255 |
+
assert_type(def_gen.standard_gamma(D_arr_0p5, dtype=np.float32, out=S_out), npt.NDArray[np.float32])
|
| 256 |
+
assert_type(def_gen.standard_gamma(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 257 |
+
assert_type(def_gen.standard_gamma(D_arr_like_0p5), npt.NDArray[np.float64])
|
| 258 |
+
assert_type(def_gen.standard_gamma(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 259 |
+
assert_type(def_gen.standard_gamma(0.5, out=D_out), npt.NDArray[np.float64])
|
| 260 |
+
assert_type(def_gen.standard_gamma(D_arr_like_0p5, out=D_out), npt.NDArray[np.float64])
|
| 261 |
+
assert_type(def_gen.standard_gamma(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 262 |
+
assert_type(def_gen.standard_gamma(D_arr_like_0p5, size=1, out=D_out, dtype=np.float64), npt.NDArray[np.float64])
|
| 263 |
+
|
| 264 |
+
assert_type(def_gen.vonmises(0.5, 0.5), float)
|
| 265 |
+
assert_type(def_gen.vonmises(0.5, 0.5, size=None), float)
|
| 266 |
+
assert_type(def_gen.vonmises(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 267 |
+
assert_type(def_gen.vonmises(D_arr_0p5, 0.5), npt.NDArray[np.float64])
|
| 268 |
+
assert_type(def_gen.vonmises(0.5, D_arr_0p5), npt.NDArray[np.float64])
|
| 269 |
+
assert_type(def_gen.vonmises(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 270 |
+
assert_type(def_gen.vonmises(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 271 |
+
assert_type(def_gen.vonmises(D_arr_like_0p5, 0.5), npt.NDArray[np.float64])
|
| 272 |
+
assert_type(def_gen.vonmises(0.5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 273 |
+
assert_type(def_gen.vonmises(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64])
|
| 274 |
+
assert_type(def_gen.vonmises(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 275 |
+
assert_type(def_gen.vonmises(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 276 |
+
assert_type(def_gen.vonmises(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 277 |
+
|
| 278 |
+
assert_type(def_gen.wald(0.5, 0.5), float)
|
| 279 |
+
assert_type(def_gen.wald(0.5, 0.5, size=None), float)
|
| 280 |
+
assert_type(def_gen.wald(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 281 |
+
assert_type(def_gen.wald(D_arr_0p5, 0.5), npt.NDArray[np.float64])
|
| 282 |
+
assert_type(def_gen.wald(0.5, D_arr_0p5), npt.NDArray[np.float64])
|
| 283 |
+
assert_type(def_gen.wald(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 284 |
+
assert_type(def_gen.wald(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 285 |
+
assert_type(def_gen.wald(D_arr_like_0p5, 0.5), npt.NDArray[np.float64])
|
| 286 |
+
assert_type(def_gen.wald(0.5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 287 |
+
assert_type(def_gen.wald(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64])
|
| 288 |
+
assert_type(def_gen.wald(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 289 |
+
assert_type(def_gen.wald(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 290 |
+
assert_type(def_gen.wald(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 291 |
+
|
| 292 |
+
assert_type(def_gen.uniform(0.5, 0.5), float)
|
| 293 |
+
assert_type(def_gen.uniform(0.5, 0.5, size=None), float)
|
| 294 |
+
assert_type(def_gen.uniform(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 295 |
+
assert_type(def_gen.uniform(D_arr_0p5, 0.5), npt.NDArray[np.float64])
|
| 296 |
+
assert_type(def_gen.uniform(0.5, D_arr_0p5), npt.NDArray[np.float64])
|
| 297 |
+
assert_type(def_gen.uniform(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 298 |
+
assert_type(def_gen.uniform(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 299 |
+
assert_type(def_gen.uniform(D_arr_like_0p5, 0.5), npt.NDArray[np.float64])
|
| 300 |
+
assert_type(def_gen.uniform(0.5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 301 |
+
assert_type(def_gen.uniform(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64])
|
| 302 |
+
assert_type(def_gen.uniform(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 303 |
+
assert_type(def_gen.uniform(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 304 |
+
assert_type(def_gen.uniform(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 305 |
+
|
| 306 |
+
assert_type(def_gen.beta(0.5, 0.5), float)
|
| 307 |
+
assert_type(def_gen.beta(0.5, 0.5, size=None), float)
|
| 308 |
+
assert_type(def_gen.beta(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 309 |
+
assert_type(def_gen.beta(D_arr_0p5, 0.5), npt.NDArray[np.float64])
|
| 310 |
+
assert_type(def_gen.beta(0.5, D_arr_0p5), npt.NDArray[np.float64])
|
| 311 |
+
assert_type(def_gen.beta(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 312 |
+
assert_type(def_gen.beta(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 313 |
+
assert_type(def_gen.beta(D_arr_like_0p5, 0.5), npt.NDArray[np.float64])
|
| 314 |
+
assert_type(def_gen.beta(0.5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 315 |
+
assert_type(def_gen.beta(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64])
|
| 316 |
+
assert_type(def_gen.beta(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 317 |
+
assert_type(def_gen.beta(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 318 |
+
assert_type(def_gen.beta(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 319 |
+
|
| 320 |
+
assert_type(def_gen.f(0.5, 0.5), float)
|
| 321 |
+
assert_type(def_gen.f(0.5, 0.5, size=None), float)
|
| 322 |
+
assert_type(def_gen.f(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 323 |
+
assert_type(def_gen.f(D_arr_0p5, 0.5), npt.NDArray[np.float64])
|
| 324 |
+
assert_type(def_gen.f(0.5, D_arr_0p5), npt.NDArray[np.float64])
|
| 325 |
+
assert_type(def_gen.f(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 326 |
+
assert_type(def_gen.f(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 327 |
+
assert_type(def_gen.f(D_arr_like_0p5, 0.5), npt.NDArray[np.float64])
|
| 328 |
+
assert_type(def_gen.f(0.5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 329 |
+
assert_type(def_gen.f(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64])
|
| 330 |
+
assert_type(def_gen.f(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 331 |
+
assert_type(def_gen.f(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 332 |
+
assert_type(def_gen.f(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 333 |
+
|
| 334 |
+
assert_type(def_gen.gamma(0.5, 0.5), float)
|
| 335 |
+
assert_type(def_gen.gamma(0.5, 0.5, size=None), float)
|
| 336 |
+
assert_type(def_gen.gamma(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 337 |
+
assert_type(def_gen.gamma(D_arr_0p5, 0.5), npt.NDArray[np.float64])
|
| 338 |
+
assert_type(def_gen.gamma(0.5, D_arr_0p5), npt.NDArray[np.float64])
|
| 339 |
+
assert_type(def_gen.gamma(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 340 |
+
assert_type(def_gen.gamma(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 341 |
+
assert_type(def_gen.gamma(D_arr_like_0p5, 0.5), npt.NDArray[np.float64])
|
| 342 |
+
assert_type(def_gen.gamma(0.5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 343 |
+
assert_type(def_gen.gamma(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64])
|
| 344 |
+
assert_type(def_gen.gamma(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 345 |
+
assert_type(def_gen.gamma(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 346 |
+
assert_type(def_gen.gamma(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 347 |
+
|
| 348 |
+
assert_type(def_gen.gumbel(0.5, 0.5), float)
|
| 349 |
+
assert_type(def_gen.gumbel(0.5, 0.5, size=None), float)
|
| 350 |
+
assert_type(def_gen.gumbel(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 351 |
+
assert_type(def_gen.gumbel(D_arr_0p5, 0.5), npt.NDArray[np.float64])
|
| 352 |
+
assert_type(def_gen.gumbel(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 353 |
+
assert_type(def_gen.gumbel(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 354 |
+
assert_type(def_gen.gumbel(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 355 |
+
assert_type(def_gen.gumbel(D_arr_like_0p5, 0.5), npt.NDArray[np.float64])
|
| 356 |
+
assert_type(def_gen.gumbel(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 357 |
+
assert_type(def_gen.gumbel(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64])
|
| 358 |
+
assert_type(def_gen.gumbel(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 359 |
+
assert_type(def_gen.gumbel(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 360 |
+
assert_type(def_gen.gumbel(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 361 |
+
|
| 362 |
+
assert_type(def_gen.laplace(0.5, 0.5), float)
|
| 363 |
+
assert_type(def_gen.laplace(0.5, 0.5, size=None), float)
|
| 364 |
+
assert_type(def_gen.laplace(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 365 |
+
assert_type(def_gen.laplace(D_arr_0p5, 0.5), npt.NDArray[np.float64])
|
| 366 |
+
assert_type(def_gen.laplace(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 367 |
+
assert_type(def_gen.laplace(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 368 |
+
assert_type(def_gen.laplace(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 369 |
+
assert_type(def_gen.laplace(D_arr_like_0p5, 0.5), npt.NDArray[np.float64])
|
| 370 |
+
assert_type(def_gen.laplace(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 371 |
+
assert_type(def_gen.laplace(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64])
|
| 372 |
+
assert_type(def_gen.laplace(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 373 |
+
assert_type(def_gen.laplace(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 374 |
+
assert_type(def_gen.laplace(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 375 |
+
|
| 376 |
+
assert_type(def_gen.logistic(0.5, 0.5), float)
|
| 377 |
+
assert_type(def_gen.logistic(0.5, 0.5, size=None), float)
|
| 378 |
+
assert_type(def_gen.logistic(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 379 |
+
assert_type(def_gen.logistic(D_arr_0p5, 0.5), npt.NDArray[np.float64])
|
| 380 |
+
assert_type(def_gen.logistic(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 381 |
+
assert_type(def_gen.logistic(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 382 |
+
assert_type(def_gen.logistic(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 383 |
+
assert_type(def_gen.logistic(D_arr_like_0p5, 0.5), npt.NDArray[np.float64])
|
| 384 |
+
assert_type(def_gen.logistic(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 385 |
+
assert_type(def_gen.logistic(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64])
|
| 386 |
+
assert_type(def_gen.logistic(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 387 |
+
assert_type(def_gen.logistic(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 388 |
+
assert_type(def_gen.logistic(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 389 |
+
|
| 390 |
+
assert_type(def_gen.lognormal(0.5, 0.5), float)
|
| 391 |
+
assert_type(def_gen.lognormal(0.5, 0.5, size=None), float)
|
| 392 |
+
assert_type(def_gen.lognormal(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 393 |
+
assert_type(def_gen.lognormal(D_arr_0p5, 0.5), npt.NDArray[np.float64])
|
| 394 |
+
assert_type(def_gen.lognormal(0.5, D_arr_0p5), npt.NDArray[np.float64])
|
| 395 |
+
assert_type(def_gen.lognormal(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 396 |
+
assert_type(def_gen.lognormal(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 397 |
+
assert_type(def_gen.lognormal(D_arr_like_0p5, 0.5), npt.NDArray[np.float64])
|
| 398 |
+
assert_type(def_gen.lognormal(0.5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 399 |
+
assert_type(def_gen.lognormal(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64])
|
| 400 |
+
assert_type(def_gen.lognormal(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 401 |
+
assert_type(def_gen.lognormal(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 402 |
+
assert_type(def_gen.lognormal(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 403 |
+
|
| 404 |
+
assert_type(def_gen.noncentral_chisquare(0.5, 0.5), float)
|
| 405 |
+
assert_type(def_gen.noncentral_chisquare(0.5, 0.5, size=None), float)
|
| 406 |
+
assert_type(def_gen.noncentral_chisquare(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 407 |
+
assert_type(def_gen.noncentral_chisquare(D_arr_0p5, 0.5), npt.NDArray[np.float64])
|
| 408 |
+
assert_type(def_gen.noncentral_chisquare(0.5, D_arr_0p5), npt.NDArray[np.float64])
|
| 409 |
+
assert_type(def_gen.noncentral_chisquare(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 410 |
+
assert_type(def_gen.noncentral_chisquare(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 411 |
+
assert_type(def_gen.noncentral_chisquare(D_arr_like_0p5, 0.5), npt.NDArray[np.float64])
|
| 412 |
+
assert_type(def_gen.noncentral_chisquare(0.5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 413 |
+
assert_type(def_gen.noncentral_chisquare(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64])
|
| 414 |
+
assert_type(def_gen.noncentral_chisquare(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 415 |
+
assert_type(def_gen.noncentral_chisquare(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 416 |
+
assert_type(def_gen.noncentral_chisquare(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 417 |
+
|
| 418 |
+
assert_type(def_gen.normal(0.5, 0.5), float)
|
| 419 |
+
assert_type(def_gen.normal(0.5, 0.5, size=None), float)
|
| 420 |
+
assert_type(def_gen.normal(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 421 |
+
assert_type(def_gen.normal(D_arr_0p5, 0.5), npt.NDArray[np.float64])
|
| 422 |
+
assert_type(def_gen.normal(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 423 |
+
assert_type(def_gen.normal(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 424 |
+
assert_type(def_gen.normal(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 425 |
+
assert_type(def_gen.normal(D_arr_like_0p5, 0.5), npt.NDArray[np.float64])
|
| 426 |
+
assert_type(def_gen.normal(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 427 |
+
assert_type(def_gen.normal(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64])
|
| 428 |
+
assert_type(def_gen.normal(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64])
|
| 429 |
+
assert_type(def_gen.normal(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 430 |
+
assert_type(def_gen.normal(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 431 |
+
|
| 432 |
+
assert_type(def_gen.triangular(0.1, 0.5, 0.9), float)
|
| 433 |
+
assert_type(def_gen.triangular(0.1, 0.5, 0.9, size=None), float)
|
| 434 |
+
assert_type(def_gen.triangular(0.1, 0.5, 0.9, size=1), npt.NDArray[np.float64])
|
| 435 |
+
assert_type(def_gen.triangular(D_arr_0p1, 0.5, 0.9), npt.NDArray[np.float64])
|
| 436 |
+
assert_type(def_gen.triangular(0.1, D_arr_0p5, 0.9), npt.NDArray[np.float64])
|
| 437 |
+
assert_type(def_gen.triangular(D_arr_0p1, 0.5, D_arr_like_0p9, size=1), npt.NDArray[np.float64])
|
| 438 |
+
assert_type(def_gen.triangular(0.1, D_arr_0p5, 0.9, size=1), npt.NDArray[np.float64])
|
| 439 |
+
assert_type(def_gen.triangular(D_arr_like_0p1, 0.5, D_arr_0p9), npt.NDArray[np.float64])
|
| 440 |
+
assert_type(def_gen.triangular(0.5, D_arr_like_0p5, 0.9), npt.NDArray[np.float64])
|
| 441 |
+
assert_type(def_gen.triangular(D_arr_0p1, D_arr_0p5, 0.9), npt.NDArray[np.float64])
|
| 442 |
+
assert_type(def_gen.triangular(D_arr_like_0p1, D_arr_like_0p5, 0.9), npt.NDArray[np.float64])
|
| 443 |
+
assert_type(def_gen.triangular(D_arr_0p1, D_arr_0p5, D_arr_0p9, size=1), npt.NDArray[np.float64])
|
| 444 |
+
assert_type(def_gen.triangular(D_arr_like_0p1, D_arr_like_0p5, D_arr_like_0p9, size=1), npt.NDArray[np.float64])
|
| 445 |
+
|
| 446 |
+
assert_type(def_gen.noncentral_f(0.1, 0.5, 0.9), float)
|
| 447 |
+
assert_type(def_gen.noncentral_f(0.1, 0.5, 0.9, size=None), float)
|
| 448 |
+
assert_type(def_gen.noncentral_f(0.1, 0.5, 0.9, size=1), npt.NDArray[np.float64])
|
| 449 |
+
assert_type(def_gen.noncentral_f(D_arr_0p1, 0.5, 0.9), npt.NDArray[np.float64])
|
| 450 |
+
assert_type(def_gen.noncentral_f(0.1, D_arr_0p5, 0.9), npt.NDArray[np.float64])
|
| 451 |
+
assert_type(def_gen.noncentral_f(D_arr_0p1, 0.5, D_arr_like_0p9, size=1), npt.NDArray[np.float64])
|
| 452 |
+
assert_type(def_gen.noncentral_f(0.1, D_arr_0p5, 0.9, size=1), npt.NDArray[np.float64])
|
| 453 |
+
assert_type(def_gen.noncentral_f(D_arr_like_0p1, 0.5, D_arr_0p9), npt.NDArray[np.float64])
|
| 454 |
+
assert_type(def_gen.noncentral_f(0.5, D_arr_like_0p5, 0.9), npt.NDArray[np.float64])
|
| 455 |
+
assert_type(def_gen.noncentral_f(D_arr_0p1, D_arr_0p5, 0.9), npt.NDArray[np.float64])
|
| 456 |
+
assert_type(def_gen.noncentral_f(D_arr_like_0p1, D_arr_like_0p5, 0.9), npt.NDArray[np.float64])
|
| 457 |
+
assert_type(def_gen.noncentral_f(D_arr_0p1, D_arr_0p5, D_arr_0p9, size=1), npt.NDArray[np.float64])
|
| 458 |
+
assert_type(def_gen.noncentral_f(D_arr_like_0p1, D_arr_like_0p5, D_arr_like_0p9, size=1), npt.NDArray[np.float64])
|
| 459 |
+
|
| 460 |
+
assert_type(def_gen.binomial(10, 0.5), int)
|
| 461 |
+
assert_type(def_gen.binomial(10, 0.5, size=None), int)
|
| 462 |
+
assert_type(def_gen.binomial(10, 0.5, size=1), npt.NDArray[np.int64])
|
| 463 |
+
assert_type(def_gen.binomial(I_arr_10, 0.5), npt.NDArray[np.int64])
|
| 464 |
+
assert_type(def_gen.binomial(10, D_arr_0p5), npt.NDArray[np.int64])
|
| 465 |
+
assert_type(def_gen.binomial(I_arr_10, 0.5, size=1), npt.NDArray[np.int64])
|
| 466 |
+
assert_type(def_gen.binomial(10, D_arr_0p5, size=1), npt.NDArray[np.int64])
|
| 467 |
+
assert_type(def_gen.binomial(I_arr_like_10, 0.5), npt.NDArray[np.int64])
|
| 468 |
+
assert_type(def_gen.binomial(10, D_arr_like_0p5), npt.NDArray[np.int64])
|
| 469 |
+
assert_type(def_gen.binomial(I_arr_10, D_arr_0p5), npt.NDArray[np.int64])
|
| 470 |
+
assert_type(def_gen.binomial(I_arr_like_10, D_arr_like_0p5), npt.NDArray[np.int64])
|
| 471 |
+
assert_type(def_gen.binomial(I_arr_10, D_arr_0p5, size=1), npt.NDArray[np.int64])
|
| 472 |
+
assert_type(def_gen.binomial(I_arr_like_10, D_arr_like_0p5, size=1), npt.NDArray[np.int64])
|
| 473 |
+
|
| 474 |
+
assert_type(def_gen.negative_binomial(10, 0.5), int)
|
| 475 |
+
assert_type(def_gen.negative_binomial(10, 0.5, size=None), int)
|
| 476 |
+
assert_type(def_gen.negative_binomial(10, 0.5, size=1), npt.NDArray[np.int64])
|
| 477 |
+
assert_type(def_gen.negative_binomial(I_arr_10, 0.5), npt.NDArray[np.int64])
|
| 478 |
+
assert_type(def_gen.negative_binomial(10, D_arr_0p5), npt.NDArray[np.int64])
|
| 479 |
+
assert_type(def_gen.negative_binomial(I_arr_10, 0.5, size=1), npt.NDArray[np.int64])
|
| 480 |
+
assert_type(def_gen.negative_binomial(10, D_arr_0p5, size=1), npt.NDArray[np.int64])
|
| 481 |
+
assert_type(def_gen.negative_binomial(I_arr_like_10, 0.5), npt.NDArray[np.int64])
|
| 482 |
+
assert_type(def_gen.negative_binomial(10, D_arr_like_0p5), npt.NDArray[np.int64])
|
| 483 |
+
assert_type(def_gen.negative_binomial(I_arr_10, D_arr_0p5), npt.NDArray[np.int64])
|
| 484 |
+
assert_type(def_gen.negative_binomial(I_arr_like_10, D_arr_like_0p5), npt.NDArray[np.int64])
|
| 485 |
+
assert_type(def_gen.negative_binomial(I_arr_10, D_arr_0p5, size=1), npt.NDArray[np.int64])
|
| 486 |
+
assert_type(def_gen.negative_binomial(I_arr_like_10, D_arr_like_0p5, size=1), npt.NDArray[np.int64])
|
| 487 |
+
|
| 488 |
+
assert_type(def_gen.hypergeometric(20, 20, 10), int)
|
| 489 |
+
assert_type(def_gen.hypergeometric(20, 20, 10, size=None), int)
|
| 490 |
+
assert_type(def_gen.hypergeometric(20, 20, 10, size=1), npt.NDArray[np.int64])
|
| 491 |
+
assert_type(def_gen.hypergeometric(I_arr_20, 20, 10), npt.NDArray[np.int64] | Any)
|
| 492 |
+
assert_type(def_gen.hypergeometric(20, I_arr_20, 10), npt.NDArray[np.int64] | Any)
|
| 493 |
+
assert_type(def_gen.hypergeometric(I_arr_20, 20, I_arr_like_10, size=1), npt.NDArray[np.int64])
|
| 494 |
+
assert_type(def_gen.hypergeometric(20, I_arr_20, 10, size=1), npt.NDArray[np.int64])
|
| 495 |
+
assert_type(def_gen.hypergeometric(I_arr_like_20, 20, I_arr_10), npt.NDArray[np.int64] | Any)
|
| 496 |
+
assert_type(def_gen.hypergeometric(20, I_arr_like_20, 10), npt.NDArray[np.int64] | Any)
|
| 497 |
+
assert_type(def_gen.hypergeometric(I_arr_20, I_arr_20, 10), npt.NDArray[np.int64] | Any)
|
| 498 |
+
assert_type(def_gen.hypergeometric(I_arr_like_20, I_arr_like_20, 10), npt.NDArray[np.int64] | Any)
|
| 499 |
+
assert_type(def_gen.hypergeometric(I_arr_20, I_arr_20, I_arr_10, size=1), npt.NDArray[np.int64])
|
| 500 |
+
assert_type(def_gen.hypergeometric(I_arr_like_20, I_arr_like_20, I_arr_like_10, size=1), npt.NDArray[np.int64])
|
| 501 |
+
|
| 502 |
+
I_int64_100: npt.NDArray[np.int64] = np.array([100], dtype=np.int64)
|
| 503 |
+
|
| 504 |
+
assert_type(def_gen.integers(0, 100), np.int64)
|
| 505 |
+
assert_type(def_gen.integers(100), np.int64)
|
| 506 |
+
assert_type(def_gen.integers([100]), npt.NDArray[np.int64] | Any)
|
| 507 |
+
assert_type(def_gen.integers(0, [100]), npt.NDArray[np.int64] | Any)
|
| 508 |
+
|
| 509 |
+
I_bool_low: npt.NDArray[np.bool] = np.array([0], dtype=np.bool)
|
| 510 |
+
I_bool_low_like: list[int] = [0]
|
| 511 |
+
I_bool_high_open: npt.NDArray[np.bool] = np.array([1], dtype=np.bool)
|
| 512 |
+
I_bool_high_closed: npt.NDArray[np.bool] = np.array([1], dtype=np.bool)
|
| 513 |
+
|
| 514 |
+
assert_type(def_gen.integers(2, dtype=bool), bool)
|
| 515 |
+
assert_type(def_gen.integers(0, 2, dtype=bool), bool)
|
| 516 |
+
assert_type(def_gen.integers(1, dtype=bool, endpoint=True), bool)
|
| 517 |
+
assert_type(def_gen.integers(0, 1, dtype=bool, endpoint=True), bool)
|
| 518 |
+
assert_type(def_gen.integers(I_bool_low_like, 1, dtype=bool, endpoint=True), npt.NDArray[Any] | Any)
|
| 519 |
+
assert_type(def_gen.integers(I_bool_high_open, dtype=bool), npt.NDArray[Any] | Any)
|
| 520 |
+
assert_type(def_gen.integers(I_bool_low, I_bool_high_open, dtype=bool), npt.NDArray[Any] | Any)
|
| 521 |
+
assert_type(def_gen.integers(0, I_bool_high_open, dtype=bool), npt.NDArray[Any] | Any)
|
| 522 |
+
assert_type(def_gen.integers(I_bool_high_closed, dtype=bool, endpoint=True), npt.NDArray[Any] | Any)
|
| 523 |
+
assert_type(def_gen.integers(I_bool_low, I_bool_high_closed, dtype=bool, endpoint=True), npt.NDArray[Any] | Any)
|
| 524 |
+
assert_type(def_gen.integers(0, I_bool_high_closed, dtype=bool, endpoint=True), npt.NDArray[Any] | Any)
|
| 525 |
+
|
| 526 |
+
assert_type(def_gen.integers(2, dtype=np.bool), np.bool)
|
| 527 |
+
assert_type(def_gen.integers(0, 2, dtype=np.bool), np.bool)
|
| 528 |
+
assert_type(def_gen.integers(1, dtype=np.bool, endpoint=True), np.bool)
|
| 529 |
+
assert_type(def_gen.integers(0, 1, dtype=np.bool, endpoint=True), np.bool)
|
| 530 |
+
assert_type(def_gen.integers(I_bool_low_like, 1, dtype=np.bool, endpoint=True), npt.NDArray[np.bool] | Any)
|
| 531 |
+
assert_type(def_gen.integers(I_bool_high_open, dtype=np.bool), npt.NDArray[np.bool] | Any)
|
| 532 |
+
assert_type(def_gen.integers(I_bool_low, I_bool_high_open, dtype=np.bool), npt.NDArray[np.bool] | Any)
|
| 533 |
+
assert_type(def_gen.integers(0, I_bool_high_open, dtype=np.bool), npt.NDArray[np.bool] | Any)
|
| 534 |
+
assert_type(def_gen.integers(I_bool_high_closed, dtype=np.bool, endpoint=True), npt.NDArray[np.bool] | Any)
|
| 535 |
+
assert_type(def_gen.integers(I_bool_low, I_bool_high_closed, dtype=np.bool, endpoint=True), npt.NDArray[np.bool] | Any)
|
| 536 |
+
assert_type(def_gen.integers(0, I_bool_high_closed, dtype=np.bool, endpoint=True), npt.NDArray[np.bool] | Any)
|
| 537 |
+
|
| 538 |
+
I_u1_low: npt.NDArray[np.uint8] = np.array([0], dtype=np.uint8)
|
| 539 |
+
I_u1_low_like: list[int] = [0]
|
| 540 |
+
I_u1_high_open: npt.NDArray[np.uint8] = np.array([255], dtype=np.uint8)
|
| 541 |
+
I_u1_high_closed: npt.NDArray[np.uint8] = np.array([255], dtype=np.uint8)
|
| 542 |
+
|
| 543 |
+
assert_type(def_gen.integers(256, dtype=np.uint8), np.uint8)
|
| 544 |
+
assert_type(def_gen.integers(0, 256, dtype=np.uint8), np.uint8)
|
| 545 |
+
assert_type(def_gen.integers(255, dtype=np.uint8, endpoint=True), np.uint8)
|
| 546 |
+
assert_type(def_gen.integers(0, 255, dtype=np.uint8, endpoint=True), np.uint8)
|
| 547 |
+
assert_type(def_gen.integers(I_u1_low_like, 255, dtype=np.uint8, endpoint=True), npt.NDArray[np.uint8] | Any)
|
| 548 |
+
assert_type(def_gen.integers(I_u1_high_open, dtype=np.uint8), npt.NDArray[np.uint8] | Any)
|
| 549 |
+
assert_type(def_gen.integers(I_u1_low, I_u1_high_open, dtype=np.uint8), npt.NDArray[np.uint8] | Any)
|
| 550 |
+
assert_type(def_gen.integers(0, I_u1_high_open, dtype=np.uint8), npt.NDArray[np.uint8] | Any)
|
| 551 |
+
assert_type(def_gen.integers(I_u1_high_closed, dtype=np.uint8, endpoint=True), npt.NDArray[np.uint8] | Any)
|
| 552 |
+
assert_type(def_gen.integers(I_u1_low, I_u1_high_closed, dtype=np.uint8, endpoint=True), npt.NDArray[np.uint8] | Any)
|
| 553 |
+
assert_type(def_gen.integers(0, I_u1_high_closed, dtype=np.uint8, endpoint=True), npt.NDArray[np.uint8] | Any)
|
| 554 |
+
|
| 555 |
+
I_u2_low: npt.NDArray[np.uint16] = np.array([0], dtype=np.uint16)
|
| 556 |
+
I_u2_low_like: list[int] = [0]
|
| 557 |
+
I_u2_high_open: npt.NDArray[np.uint16] = np.array([65535], dtype=np.uint16)
|
| 558 |
+
I_u2_high_closed: npt.NDArray[np.uint16] = np.array([65535], dtype=np.uint16)
|
| 559 |
+
|
| 560 |
+
assert_type(def_gen.integers(65536, dtype=np.uint16), np.uint16)
|
| 561 |
+
assert_type(def_gen.integers(0, 65536, dtype=np.uint16), np.uint16)
|
| 562 |
+
assert_type(def_gen.integers(65535, dtype=np.uint16, endpoint=True), np.uint16)
|
| 563 |
+
assert_type(def_gen.integers(0, 65535, dtype=np.uint16, endpoint=True), np.uint16)
|
| 564 |
+
assert_type(def_gen.integers(I_u2_low_like, 65535, dtype=np.uint16, endpoint=True), npt.NDArray[np.uint16] | Any)
|
| 565 |
+
assert_type(def_gen.integers(I_u2_high_open, dtype=np.uint16), npt.NDArray[np.uint16] | Any)
|
| 566 |
+
assert_type(def_gen.integers(I_u2_low, I_u2_high_open, dtype=np.uint16), npt.NDArray[np.uint16] | Any)
|
| 567 |
+
assert_type(def_gen.integers(0, I_u2_high_open, dtype=np.uint16), npt.NDArray[np.uint16] | Any)
|
| 568 |
+
assert_type(def_gen.integers(I_u2_high_closed, dtype=np.uint16, endpoint=True), npt.NDArray[np.uint16] | Any)
|
| 569 |
+
assert_type(def_gen.integers(I_u2_low, I_u2_high_closed, dtype=np.uint16, endpoint=True), npt.NDArray[np.uint16] | Any)
|
| 570 |
+
assert_type(def_gen.integers(0, I_u2_high_closed, dtype=np.uint16, endpoint=True), npt.NDArray[np.uint16] | Any)
|
| 571 |
+
|
| 572 |
+
I_u4_low: npt.NDArray[np.uint32] = np.array([0], dtype=np.uint32)
|
| 573 |
+
I_u4_low_like: list[int] = [0]
|
| 574 |
+
I_u4_high_open: npt.NDArray[np.uint32] = np.array([4294967295], dtype=np.uint32)
|
| 575 |
+
I_u4_high_closed: npt.NDArray[np.uint32] = np.array([4294967295], dtype=np.uint32)
|
| 576 |
+
|
| 577 |
+
assert_type(def_gen.integers(4294967296, dtype=np.int_), np.int_)
|
| 578 |
+
assert_type(def_gen.integers(0, 4294967296, dtype=np.int_), np.int_)
|
| 579 |
+
assert_type(def_gen.integers(4294967295, dtype=np.int_, endpoint=True), np.int_)
|
| 580 |
+
assert_type(def_gen.integers(0, 4294967295, dtype=np.int_, endpoint=True), np.int_)
|
| 581 |
+
assert_type(def_gen.integers(I_u4_low_like, 4294967295, dtype=np.int_, endpoint=True), npt.NDArray[np.int_] | Any)
|
| 582 |
+
assert_type(def_gen.integers(I_u4_high_open, dtype=np.int_), npt.NDArray[np.int_] | Any)
|
| 583 |
+
assert_type(def_gen.integers(I_u4_low, I_u4_high_open, dtype=np.int_), npt.NDArray[np.int_] | Any)
|
| 584 |
+
assert_type(def_gen.integers(0, I_u4_high_open, dtype=np.int_), npt.NDArray[np.int_] | Any)
|
| 585 |
+
assert_type(def_gen.integers(I_u4_high_closed, dtype=np.int_, endpoint=True), npt.NDArray[np.int_] | Any)
|
| 586 |
+
assert_type(def_gen.integers(I_u4_low, I_u4_high_closed, dtype=np.int_, endpoint=True), npt.NDArray[np.int_] | Any)
|
| 587 |
+
assert_type(def_gen.integers(0, I_u4_high_closed, dtype=np.int_, endpoint=True), npt.NDArray[np.int_] | Any)
|
| 588 |
+
|
| 589 |
+
assert_type(def_gen.integers(4294967296, dtype=np.uint32), np.uint32)
|
| 590 |
+
assert_type(def_gen.integers(0, 4294967296, dtype=np.uint32), np.uint32)
|
| 591 |
+
assert_type(def_gen.integers(4294967295, dtype=np.uint32, endpoint=True), np.uint32)
|
| 592 |
+
assert_type(def_gen.integers(0, 4294967295, dtype=np.uint32, endpoint=True), np.uint32)
|
| 593 |
+
assert_type(def_gen.integers(I_u4_low_like, 4294967295, dtype=np.uint32, endpoint=True), npt.NDArray[np.uint32] | Any)
|
| 594 |
+
assert_type(def_gen.integers(I_u4_high_open, dtype=np.uint32), npt.NDArray[np.uint32] | Any)
|
| 595 |
+
assert_type(def_gen.integers(I_u4_low, I_u4_high_open, dtype=np.uint32), npt.NDArray[np.uint32] | Any)
|
| 596 |
+
assert_type(def_gen.integers(0, I_u4_high_open, dtype=np.uint32), npt.NDArray[np.uint32] | Any)
|
| 597 |
+
assert_type(def_gen.integers(I_u4_high_closed, dtype=np.uint32, endpoint=True), npt.NDArray[np.uint32] | Any)
|
| 598 |
+
assert_type(def_gen.integers(I_u4_low, I_u4_high_closed, dtype=np.uint32, endpoint=True), npt.NDArray[np.uint32] | Any)
|
| 599 |
+
assert_type(def_gen.integers(0, I_u4_high_closed, dtype=np.uint32, endpoint=True), npt.NDArray[np.uint32] | Any)
|
| 600 |
+
|
| 601 |
+
assert_type(def_gen.integers(4294967296, dtype=np.uint), np.uint)
|
| 602 |
+
assert_type(def_gen.integers(0, 4294967296, dtype=np.uint), np.uint)
|
| 603 |
+
assert_type(def_gen.integers(4294967295, dtype=np.uint, endpoint=True), np.uint)
|
| 604 |
+
assert_type(def_gen.integers(0, 4294967295, dtype=np.uint, endpoint=True), np.uint)
|
| 605 |
+
assert_type(def_gen.integers(I_u4_low_like, 4294967295, dtype=np.uint, endpoint=True), npt.NDArray[np.uint] | Any)
|
| 606 |
+
assert_type(def_gen.integers(I_u4_high_open, dtype=np.uint), npt.NDArray[np.uint] | Any)
|
| 607 |
+
assert_type(def_gen.integers(I_u4_low, I_u4_high_open, dtype=np.uint), npt.NDArray[np.uint] | Any)
|
| 608 |
+
assert_type(def_gen.integers(0, I_u4_high_open, dtype=np.uint), npt.NDArray[np.uint] | Any)
|
| 609 |
+
assert_type(def_gen.integers(I_u4_high_closed, dtype=np.uint, endpoint=True), npt.NDArray[np.uint] | Any)
|
| 610 |
+
assert_type(def_gen.integers(I_u4_low, I_u4_high_closed, dtype=np.uint, endpoint=True), npt.NDArray[np.uint] | Any)
|
| 611 |
+
assert_type(def_gen.integers(0, I_u4_high_closed, dtype=np.uint, endpoint=True), npt.NDArray[np.uint] | Any)
|
| 612 |
+
|
| 613 |
+
I_u8_low: npt.NDArray[np.uint64] = np.array([0], dtype=np.uint64)
|
| 614 |
+
I_u8_low_like: list[int] = [0]
|
| 615 |
+
I_u8_high_open: npt.NDArray[np.uint64] = np.array([18446744073709551615], dtype=np.uint64)
|
| 616 |
+
I_u8_high_closed: npt.NDArray[np.uint64] = np.array([18446744073709551615], dtype=np.uint64)
|
| 617 |
+
|
| 618 |
+
assert_type(def_gen.integers(18446744073709551616, dtype=np.uint64), np.uint64)
|
| 619 |
+
assert_type(def_gen.integers(0, 18446744073709551616, dtype=np.uint64), np.uint64)
|
| 620 |
+
assert_type(def_gen.integers(18446744073709551615, dtype=np.uint64, endpoint=True), np.uint64)
|
| 621 |
+
assert_type(def_gen.integers(0, 18446744073709551615, dtype=np.uint64, endpoint=True), np.uint64)
|
| 622 |
+
assert_type(def_gen.integers(I_u8_low_like, 18446744073709551615, dtype=np.uint64, endpoint=True), npt.NDArray[np.uint64] | Any)
|
| 623 |
+
assert_type(def_gen.integers(I_u8_high_open, dtype=np.uint64), npt.NDArray[np.uint64] | Any)
|
| 624 |
+
assert_type(def_gen.integers(I_u8_low, I_u8_high_open, dtype=np.uint64), npt.NDArray[np.uint64] | Any)
|
| 625 |
+
assert_type(def_gen.integers(0, I_u8_high_open, dtype=np.uint64), npt.NDArray[np.uint64] | Any)
|
| 626 |
+
assert_type(def_gen.integers(I_u8_high_closed, dtype=np.uint64, endpoint=True), npt.NDArray[np.uint64] | Any)
|
| 627 |
+
assert_type(def_gen.integers(I_u8_low, I_u8_high_closed, dtype=np.uint64, endpoint=True), npt.NDArray[np.uint64] | Any)
|
| 628 |
+
assert_type(def_gen.integers(0, I_u8_high_closed, dtype=np.uint64, endpoint=True), npt.NDArray[np.uint64] | Any)
|
| 629 |
+
|
| 630 |
+
I_i1_low: npt.NDArray[np.int8] = np.array([-128], dtype=np.int8)
|
| 631 |
+
I_i1_low_like: list[int] = [-128]
|
| 632 |
+
I_i1_high_open: npt.NDArray[np.int8] = np.array([127], dtype=np.int8)
|
| 633 |
+
I_i1_high_closed: npt.NDArray[np.int8] = np.array([127], dtype=np.int8)
|
| 634 |
+
|
| 635 |
+
assert_type(def_gen.integers(128, dtype=np.int8), np.int8)
|
| 636 |
+
assert_type(def_gen.integers(-128, 128, dtype=np.int8), np.int8)
|
| 637 |
+
assert_type(def_gen.integers(127, dtype=np.int8, endpoint=True), np.int8)
|
| 638 |
+
assert_type(def_gen.integers(-128, 127, dtype=np.int8, endpoint=True), np.int8)
|
| 639 |
+
assert_type(def_gen.integers(I_i1_low_like, 127, dtype=np.int8, endpoint=True), npt.NDArray[np.int8] | Any)
|
| 640 |
+
assert_type(def_gen.integers(I_i1_high_open, dtype=np.int8), npt.NDArray[np.int8] | Any)
|
| 641 |
+
assert_type(def_gen.integers(I_i1_low, I_i1_high_open, dtype=np.int8), npt.NDArray[np.int8] | Any)
|
| 642 |
+
assert_type(def_gen.integers(-128, I_i1_high_open, dtype=np.int8), npt.NDArray[np.int8] | Any)
|
| 643 |
+
assert_type(def_gen.integers(I_i1_high_closed, dtype=np.int8, endpoint=True), npt.NDArray[np.int8] | Any)
|
| 644 |
+
assert_type(def_gen.integers(I_i1_low, I_i1_high_closed, dtype=np.int8, endpoint=True), npt.NDArray[np.int8] | Any)
|
| 645 |
+
assert_type(def_gen.integers(-128, I_i1_high_closed, dtype=np.int8, endpoint=True), npt.NDArray[np.int8] | Any)
|
| 646 |
+
|
| 647 |
+
I_i2_low: npt.NDArray[np.int16] = np.array([-32768], dtype=np.int16)
|
| 648 |
+
I_i2_low_like: list[int] = [-32768]
|
| 649 |
+
I_i2_high_open: npt.NDArray[np.int16] = np.array([32767], dtype=np.int16)
|
| 650 |
+
I_i2_high_closed: npt.NDArray[np.int16] = np.array([32767], dtype=np.int16)
|
| 651 |
+
|
| 652 |
+
assert_type(def_gen.integers(32768, dtype=np.int16), np.int16)
|
| 653 |
+
assert_type(def_gen.integers(-32768, 32768, dtype=np.int16), np.int16)
|
| 654 |
+
assert_type(def_gen.integers(32767, dtype=np.int16, endpoint=True), np.int16)
|
| 655 |
+
assert_type(def_gen.integers(-32768, 32767, dtype=np.int16, endpoint=True), np.int16)
|
| 656 |
+
assert_type(def_gen.integers(I_i2_low_like, 32767, dtype=np.int16, endpoint=True), npt.NDArray[np.int16] | Any)
|
| 657 |
+
assert_type(def_gen.integers(I_i2_high_open, dtype=np.int16), npt.NDArray[np.int16] | Any)
|
| 658 |
+
assert_type(def_gen.integers(I_i2_low, I_i2_high_open, dtype=np.int16), npt.NDArray[np.int16] | Any)
|
| 659 |
+
assert_type(def_gen.integers(-32768, I_i2_high_open, dtype=np.int16), npt.NDArray[np.int16] | Any)
|
| 660 |
+
assert_type(def_gen.integers(I_i2_high_closed, dtype=np.int16, endpoint=True), npt.NDArray[np.int16] | Any)
|
| 661 |
+
assert_type(def_gen.integers(I_i2_low, I_i2_high_closed, dtype=np.int16, endpoint=True), npt.NDArray[np.int16] | Any)
|
| 662 |
+
assert_type(def_gen.integers(-32768, I_i2_high_closed, dtype=np.int16, endpoint=True), npt.NDArray[np.int16] | Any)
|
| 663 |
+
|
| 664 |
+
I_i4_low: npt.NDArray[np.int32] = np.array([-2147483648], dtype=np.int32)
|
| 665 |
+
I_i4_low_like: list[int] = [-2147483648]
|
| 666 |
+
I_i4_high_open: npt.NDArray[np.int32] = np.array([2147483647], dtype=np.int32)
|
| 667 |
+
I_i4_high_closed: npt.NDArray[np.int32] = np.array([2147483647], dtype=np.int32)
|
| 668 |
+
|
| 669 |
+
assert_type(def_gen.integers(2147483648, dtype=np.int32), np.int32)
|
| 670 |
+
assert_type(def_gen.integers(-2147483648, 2147483648, dtype=np.int32), np.int32)
|
| 671 |
+
assert_type(def_gen.integers(2147483647, dtype=np.int32, endpoint=True), np.int32)
|
| 672 |
+
assert_type(def_gen.integers(-2147483648, 2147483647, dtype=np.int32, endpoint=True), np.int32)
|
| 673 |
+
assert_type(def_gen.integers(I_i4_low_like, 2147483647, dtype=np.int32, endpoint=True), npt.NDArray[np.int32] | Any)
|
| 674 |
+
assert_type(def_gen.integers(I_i4_high_open, dtype=np.int32), npt.NDArray[np.int32] | Any)
|
| 675 |
+
assert_type(def_gen.integers(I_i4_low, I_i4_high_open, dtype=np.int32), npt.NDArray[np.int32] | Any)
|
| 676 |
+
assert_type(def_gen.integers(-2147483648, I_i4_high_open, dtype=np.int32), npt.NDArray[np.int32] | Any)
|
| 677 |
+
assert_type(def_gen.integers(I_i4_high_closed, dtype=np.int32, endpoint=True), npt.NDArray[np.int32] | Any)
|
| 678 |
+
assert_type(def_gen.integers(I_i4_low, I_i4_high_closed, dtype=np.int32, endpoint=True), npt.NDArray[np.int32] | Any)
|
| 679 |
+
assert_type(def_gen.integers(-2147483648, I_i4_high_closed, dtype=np.int32, endpoint=True), npt.NDArray[np.int32] | Any)
|
| 680 |
+
|
| 681 |
+
I_i8_low: npt.NDArray[np.int64] = np.array([-9223372036854775808], dtype=np.int64)
|
| 682 |
+
I_i8_low_like: list[int] = [-9223372036854775808]
|
| 683 |
+
I_i8_high_open: npt.NDArray[np.int64] = np.array([9223372036854775807], dtype=np.int64)
|
| 684 |
+
I_i8_high_closed: npt.NDArray[np.int64] = np.array([9223372036854775807], dtype=np.int64)
|
| 685 |
+
|
| 686 |
+
assert_type(def_gen.integers(9223372036854775808, dtype=np.int64), np.int64)
|
| 687 |
+
assert_type(def_gen.integers(-9223372036854775808, 9223372036854775808, dtype=np.int64), np.int64)
|
| 688 |
+
assert_type(def_gen.integers(9223372036854775807, dtype=np.int64, endpoint=True), np.int64)
|
| 689 |
+
assert_type(def_gen.integers(-9223372036854775808, 9223372036854775807, dtype=np.int64, endpoint=True), np.int64)
|
| 690 |
+
assert_type(def_gen.integers(I_i8_low_like, 9223372036854775807, dtype=np.int64, endpoint=True), npt.NDArray[np.int64] | Any)
|
| 691 |
+
assert_type(def_gen.integers(I_i8_high_open, dtype=np.int64), npt.NDArray[np.int64] | Any)
|
| 692 |
+
assert_type(def_gen.integers(I_i8_low, I_i8_high_open, dtype=np.int64), npt.NDArray[np.int64] | Any)
|
| 693 |
+
assert_type(def_gen.integers(-9223372036854775808, I_i8_high_open, dtype=np.int64), npt.NDArray[np.int64] | Any)
|
| 694 |
+
assert_type(def_gen.integers(I_i8_high_closed, dtype=np.int64, endpoint=True), npt.NDArray[np.int64] | Any)
|
| 695 |
+
assert_type(def_gen.integers(I_i8_low, I_i8_high_closed, dtype=np.int64, endpoint=True), npt.NDArray[np.int64] | Any)
|
| 696 |
+
assert_type(def_gen.integers(-9223372036854775808, I_i8_high_closed, dtype=np.int64, endpoint=True), npt.NDArray[np.int64] | Any)
|
| 697 |
+
|
| 698 |
+
assert_type(def_gen.bit_generator, np.random.BitGenerator)
|
| 699 |
+
|
| 700 |
+
assert_type(def_gen.bytes(2), bytes)
|
| 701 |
+
|
| 702 |
+
assert_type(def_gen.choice(5), int)
|
| 703 |
+
assert_type(def_gen.choice([1, 2]), np.int_)
|
| 704 |
+
assert_type(def_gen.choice(5, 3), npt.NDArray[np.int64])
|
| 705 |
+
assert_type(def_gen.choice(5, 3, replace=True), npt.NDArray[np.int64])
|
| 706 |
+
assert_type(def_gen.choice(5, 3, p=[1 / 5] * 5), npt.NDArray[np.int64])
|
| 707 |
+
assert_type(def_gen.choice(5, 3, p=[1 / 5] * 5, replace=False), npt.NDArray[np.int64])
|
| 708 |
+
|
| 709 |
+
str_list: list[str]
|
| 710 |
+
assert_type(def_gen.choice(str_list), Any)
|
| 711 |
+
assert_type(def_gen.choice(str_list, 3), npt.NDArray[Any])
|
| 712 |
+
assert_type(def_gen.choice(str_list, 3, p=[1 / 4] * 4), npt.NDArray[Any])
|
| 713 |
+
assert_type(def_gen.choice(str_list, 3, replace=True), npt.NDArray[Any])
|
| 714 |
+
assert_type(def_gen.choice(str_list, 3, replace=False, p=np.array([1 / 8, 1 / 8, 1 / 2, 1 / 4])), npt.NDArray[Any])
|
| 715 |
+
|
| 716 |
+
assert_type(def_gen.dirichlet([0.5, 0.5]), npt.NDArray[np.float64])
|
| 717 |
+
assert_type(def_gen.dirichlet(np.array([0.5, 0.5])), npt.NDArray[np.float64])
|
| 718 |
+
assert_type(def_gen.dirichlet(np.array([0.5, 0.5]), size=3), npt.NDArray[np.float64])
|
| 719 |
+
|
| 720 |
+
assert_type(def_gen.multinomial(20, [1 / 6.0] * 6), npt.NDArray[np.int64])
|
| 721 |
+
assert_type(def_gen.multinomial(20, np.array([0.5, 0.5])), npt.NDArray[np.int64])
|
| 722 |
+
assert_type(def_gen.multinomial(20, [1 / 6.0] * 6, size=2), npt.NDArray[np.int64])
|
| 723 |
+
assert_type(def_gen.multinomial([[10], [20]], [1 / 6.0] * 6, size=(2, 2)), npt.NDArray[np.int64])
|
| 724 |
+
assert_type(def_gen.multinomial(np.array([[10], [20]]), np.array([0.5, 0.5]), size=(2, 2)), npt.NDArray[np.int64])
|
| 725 |
+
|
| 726 |
+
assert_type(def_gen.multivariate_hypergeometric([3, 5, 7], 2), npt.NDArray[np.int64])
|
| 727 |
+
assert_type(def_gen.multivariate_hypergeometric(np.array([3, 5, 7]), 2), npt.NDArray[np.int64])
|
| 728 |
+
assert_type(def_gen.multivariate_hypergeometric(np.array([3, 5, 7]), 2, size=4), npt.NDArray[np.int64])
|
| 729 |
+
assert_type(def_gen.multivariate_hypergeometric(np.array([3, 5, 7]), 2, size=(4, 7)), npt.NDArray[np.int64])
|
| 730 |
+
assert_type(def_gen.multivariate_hypergeometric([3, 5, 7], 2, method="count"), npt.NDArray[np.int64])
|
| 731 |
+
assert_type(def_gen.multivariate_hypergeometric(np.array([3, 5, 7]), 2, method="marginals"), npt.NDArray[np.int64])
|
| 732 |
+
|
| 733 |
+
assert_type(def_gen.multivariate_normal([0.0], [[1.0]]), npt.NDArray[np.float64])
|
| 734 |
+
assert_type(def_gen.multivariate_normal([0.0], np.array([[1.0]])), npt.NDArray[np.float64])
|
| 735 |
+
assert_type(def_gen.multivariate_normal(np.array([0.0]), [[1.0]]), npt.NDArray[np.float64])
|
| 736 |
+
assert_type(def_gen.multivariate_normal([0.0], np.array([[1.0]])), npt.NDArray[np.float64])
|
| 737 |
+
|
| 738 |
+
assert_type(def_gen.permutation(10), npt.NDArray[np.int64])
|
| 739 |
+
assert_type(def_gen.permutation([1, 2, 3, 4]), npt.NDArray[Any])
|
| 740 |
+
assert_type(def_gen.permutation(np.array([1, 2, 3, 4])), npt.NDArray[Any])
|
| 741 |
+
assert_type(def_gen.permutation(D_2D, axis=1), npt.NDArray[Any])
|
| 742 |
+
assert_type(def_gen.permuted(D_2D), npt.NDArray[np.float64])
|
| 743 |
+
assert_type(def_gen.permuted(D_2D_like), npt.NDArray[Any])
|
| 744 |
+
assert_type(def_gen.permuted(D_2D, axis=1), npt.NDArray[np.float64])
|
| 745 |
+
assert_type(def_gen.permuted(D_2D, out=D_2D), npt.NDArray[np.float64])
|
| 746 |
+
assert_type(def_gen.permuted(D_2D_like, out=D_2D), npt.NDArray[np.float64])
|
| 747 |
+
assert_type(def_gen.permuted(D_2D_like, out=D_2D), npt.NDArray[np.float64])
|
| 748 |
+
assert_type(def_gen.permuted(D_2D, axis=1, out=D_2D), npt.NDArray[np.float64])
|
| 749 |
+
|
| 750 |
+
assert_type(def_gen.shuffle(np.arange(10)), None)
|
| 751 |
+
assert_type(def_gen.shuffle([1, 2, 3, 4, 5]), None)
|
| 752 |
+
assert_type(def_gen.shuffle(D_2D, axis=1), None)
|
| 753 |
+
|
| 754 |
+
assert_type(np.random.Generator(pcg64), np.random.Generator)
|
| 755 |
+
assert_type(def_gen.__str__(), str)
|
| 756 |
+
assert_type(def_gen.__repr__(), str)
|
| 757 |
+
assert_type(def_gen.__setstate__(dict(def_gen.bit_generator.state)), None)
|
| 758 |
+
|
| 759 |
+
# RandomState
|
| 760 |
+
random_st: np.random.RandomState = np.random.RandomState()
|
| 761 |
+
|
| 762 |
+
assert_type(random_st.standard_normal(), float)
|
| 763 |
+
assert_type(random_st.standard_normal(size=None), float)
|
| 764 |
+
assert_type(random_st.standard_normal(size=1), npt.NDArray[np.float64])
|
| 765 |
+
|
| 766 |
+
assert_type(random_st.random(), float)
|
| 767 |
+
assert_type(random_st.random(size=None), float)
|
| 768 |
+
assert_type(random_st.random(size=1), npt.NDArray[np.float64])
|
| 769 |
+
|
| 770 |
+
assert_type(random_st.standard_cauchy(), float)
|
| 771 |
+
assert_type(random_st.standard_cauchy(size=None), float)
|
| 772 |
+
assert_type(random_st.standard_cauchy(size=1), npt.NDArray[np.float64])
|
| 773 |
+
|
| 774 |
+
assert_type(random_st.standard_exponential(), float)
|
| 775 |
+
assert_type(random_st.standard_exponential(size=None), float)
|
| 776 |
+
assert_type(random_st.standard_exponential(size=1), npt.NDArray[np.float64])
|
| 777 |
+
|
| 778 |
+
assert_type(random_st.zipf(1.5), int)
|
| 779 |
+
assert_type(random_st.zipf(1.5, size=None), int)
|
| 780 |
+
assert_type(random_st.zipf(1.5, size=1), npt.NDArray[np.long])
|
| 781 |
+
assert_type(random_st.zipf(D_arr_1p5), npt.NDArray[np.long] | Any)
|
| 782 |
+
assert_type(random_st.zipf(D_arr_1p5, size=1), npt.NDArray[np.long])
|
| 783 |
+
assert_type(random_st.zipf(D_arr_like_1p5), npt.NDArray[np.long] | Any)
|
| 784 |
+
assert_type(random_st.zipf(D_arr_like_1p5, size=1), npt.NDArray[np.long])
|
| 785 |
+
|
| 786 |
+
assert_type(random_st.weibull(0.5), float)
|
| 787 |
+
assert_type(random_st.weibull(0.5, size=None), float)
|
| 788 |
+
assert_type(random_st.weibull(0.5, size=1), npt.NDArray[np.float64])
|
| 789 |
+
assert_type(random_st.weibull(D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 790 |
+
assert_type(random_st.weibull(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 791 |
+
assert_type(random_st.weibull(D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 792 |
+
assert_type(random_st.weibull(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 793 |
+
|
| 794 |
+
assert_type(random_st.standard_t(0.5), float)
|
| 795 |
+
assert_type(random_st.standard_t(0.5, size=None), float)
|
| 796 |
+
assert_type(random_st.standard_t(0.5, size=1), npt.NDArray[np.float64])
|
| 797 |
+
assert_type(random_st.standard_t(D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 798 |
+
assert_type(random_st.standard_t(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 799 |
+
assert_type(random_st.standard_t(D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 800 |
+
assert_type(random_st.standard_t(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 801 |
+
|
| 802 |
+
assert_type(random_st.poisson(0.5), int)
|
| 803 |
+
assert_type(random_st.poisson(0.5, size=None), int)
|
| 804 |
+
assert_type(random_st.poisson(0.5, size=1), npt.NDArray[np.long])
|
| 805 |
+
assert_type(random_st.poisson(D_arr_0p5), npt.NDArray[np.long] | Any)
|
| 806 |
+
assert_type(random_st.poisson(D_arr_0p5, size=1), npt.NDArray[np.long])
|
| 807 |
+
assert_type(random_st.poisson(D_arr_like_0p5), npt.NDArray[np.long] | Any)
|
| 808 |
+
assert_type(random_st.poisson(D_arr_like_0p5, size=1), npt.NDArray[np.long])
|
| 809 |
+
|
| 810 |
+
assert_type(random_st.power(0.5), float)
|
| 811 |
+
assert_type(random_st.power(0.5, size=None), float)
|
| 812 |
+
assert_type(random_st.power(0.5, size=1), npt.NDArray[np.float64])
|
| 813 |
+
assert_type(random_st.power(D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 814 |
+
assert_type(random_st.power(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 815 |
+
assert_type(random_st.power(D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 816 |
+
assert_type(random_st.power(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 817 |
+
|
| 818 |
+
assert_type(random_st.pareto(0.5), float)
|
| 819 |
+
assert_type(random_st.pareto(0.5, size=None), float)
|
| 820 |
+
assert_type(random_st.pareto(0.5, size=1), npt.NDArray[np.float64])
|
| 821 |
+
assert_type(random_st.pareto(D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 822 |
+
assert_type(random_st.pareto(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 823 |
+
assert_type(random_st.pareto(D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 824 |
+
assert_type(random_st.pareto(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 825 |
+
|
| 826 |
+
assert_type(random_st.chisquare(0.5), float)
|
| 827 |
+
assert_type(random_st.chisquare(0.5, size=None), float)
|
| 828 |
+
assert_type(random_st.chisquare(0.5, size=1), npt.NDArray[np.float64])
|
| 829 |
+
assert_type(random_st.chisquare(D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 830 |
+
assert_type(random_st.chisquare(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 831 |
+
assert_type(random_st.chisquare(D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 832 |
+
assert_type(random_st.chisquare(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 833 |
+
|
| 834 |
+
assert_type(random_st.exponential(0.5), float)
|
| 835 |
+
assert_type(random_st.exponential(0.5, size=None), float)
|
| 836 |
+
assert_type(random_st.exponential(0.5, size=1), npt.NDArray[np.float64])
|
| 837 |
+
assert_type(random_st.exponential(D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 838 |
+
assert_type(random_st.exponential(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 839 |
+
assert_type(random_st.exponential(D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 840 |
+
assert_type(random_st.exponential(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 841 |
+
|
| 842 |
+
assert_type(random_st.geometric(0.5), int)
|
| 843 |
+
assert_type(random_st.geometric(0.5, size=None), int)
|
| 844 |
+
assert_type(random_st.geometric(0.5, size=1), npt.NDArray[np.long])
|
| 845 |
+
assert_type(random_st.geometric(D_arr_0p5), npt.NDArray[np.long] | Any)
|
| 846 |
+
assert_type(random_st.geometric(D_arr_0p5, size=1), npt.NDArray[np.long])
|
| 847 |
+
assert_type(random_st.geometric(D_arr_like_0p5), npt.NDArray[np.long] | Any)
|
| 848 |
+
assert_type(random_st.geometric(D_arr_like_0p5, size=1), npt.NDArray[np.long])
|
| 849 |
+
|
| 850 |
+
assert_type(random_st.logseries(0.5), int)
|
| 851 |
+
assert_type(random_st.logseries(0.5, size=None), int)
|
| 852 |
+
assert_type(random_st.logseries(0.5, size=1), npt.NDArray[np.long])
|
| 853 |
+
assert_type(random_st.logseries(D_arr_0p5), npt.NDArray[np.long] | Any)
|
| 854 |
+
assert_type(random_st.logseries(D_arr_0p5, size=1), npt.NDArray[np.long])
|
| 855 |
+
assert_type(random_st.logseries(D_arr_like_0p5), npt.NDArray[np.long] | Any)
|
| 856 |
+
assert_type(random_st.logseries(D_arr_like_0p5, size=1), npt.NDArray[np.long])
|
| 857 |
+
|
| 858 |
+
assert_type(random_st.rayleigh(0.5), float)
|
| 859 |
+
assert_type(random_st.rayleigh(0.5, size=None), float)
|
| 860 |
+
assert_type(random_st.rayleigh(0.5, size=1), npt.NDArray[np.float64])
|
| 861 |
+
assert_type(random_st.rayleigh(D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 862 |
+
assert_type(random_st.rayleigh(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 863 |
+
assert_type(random_st.rayleigh(D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 864 |
+
assert_type(random_st.rayleigh(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 865 |
+
|
| 866 |
+
assert_type(random_st.standard_gamma(0.5), float)
|
| 867 |
+
assert_type(random_st.standard_gamma(0.5, size=None), float)
|
| 868 |
+
assert_type(random_st.standard_gamma(0.5, size=1), npt.NDArray[np.float64])
|
| 869 |
+
assert_type(random_st.standard_gamma(D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 870 |
+
assert_type(random_st.standard_gamma(D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 871 |
+
assert_type(random_st.standard_gamma(D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 872 |
+
assert_type(random_st.standard_gamma(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 873 |
+
assert_type(random_st.standard_gamma(D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 874 |
+
|
| 875 |
+
assert_type(random_st.vonmises(0.5, 0.5), float)
|
| 876 |
+
assert_type(random_st.vonmises(0.5, 0.5, size=None), float)
|
| 877 |
+
assert_type(random_st.vonmises(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 878 |
+
assert_type(random_st.vonmises(D_arr_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 879 |
+
assert_type(random_st.vonmises(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 880 |
+
assert_type(random_st.vonmises(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 881 |
+
assert_type(random_st.vonmises(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 882 |
+
assert_type(random_st.vonmises(D_arr_like_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 883 |
+
assert_type(random_st.vonmises(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 884 |
+
assert_type(random_st.vonmises(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 885 |
+
assert_type(random_st.vonmises(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 886 |
+
assert_type(random_st.vonmises(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 887 |
+
assert_type(random_st.vonmises(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 888 |
+
|
| 889 |
+
assert_type(random_st.wald(0.5, 0.5), float)
|
| 890 |
+
assert_type(random_st.wald(0.5, 0.5, size=None), float)
|
| 891 |
+
assert_type(random_st.wald(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 892 |
+
assert_type(random_st.wald(D_arr_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 893 |
+
assert_type(random_st.wald(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 894 |
+
assert_type(random_st.wald(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 895 |
+
assert_type(random_st.wald(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 896 |
+
assert_type(random_st.wald(D_arr_like_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 897 |
+
assert_type(random_st.wald(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 898 |
+
assert_type(random_st.wald(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 899 |
+
assert_type(random_st.wald(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 900 |
+
assert_type(random_st.wald(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 901 |
+
assert_type(random_st.wald(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 902 |
+
|
| 903 |
+
assert_type(random_st.uniform(0.5, 0.5), float)
|
| 904 |
+
assert_type(random_st.uniform(0.5, 0.5, size=None), float)
|
| 905 |
+
assert_type(random_st.uniform(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 906 |
+
assert_type(random_st.uniform(D_arr_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 907 |
+
assert_type(random_st.uniform(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 908 |
+
assert_type(random_st.uniform(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 909 |
+
assert_type(random_st.uniform(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 910 |
+
assert_type(random_st.uniform(D_arr_like_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 911 |
+
assert_type(random_st.uniform(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 912 |
+
assert_type(random_st.uniform(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 913 |
+
assert_type(random_st.uniform(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 914 |
+
assert_type(random_st.uniform(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 915 |
+
assert_type(random_st.uniform(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 916 |
+
|
| 917 |
+
assert_type(random_st.beta(0.5, 0.5), float)
|
| 918 |
+
assert_type(random_st.beta(0.5, 0.5, size=None), float)
|
| 919 |
+
assert_type(random_st.beta(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 920 |
+
assert_type(random_st.beta(D_arr_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 921 |
+
assert_type(random_st.beta(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 922 |
+
assert_type(random_st.beta(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 923 |
+
assert_type(random_st.beta(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 924 |
+
assert_type(random_st.beta(D_arr_like_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 925 |
+
assert_type(random_st.beta(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 926 |
+
assert_type(random_st.beta(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 927 |
+
assert_type(random_st.beta(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 928 |
+
assert_type(random_st.beta(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 929 |
+
assert_type(random_st.beta(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 930 |
+
|
| 931 |
+
assert_type(random_st.f(0.5, 0.5), float)
|
| 932 |
+
assert_type(random_st.f(0.5, 0.5, size=None), float)
|
| 933 |
+
assert_type(random_st.f(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 934 |
+
assert_type(random_st.f(D_arr_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 935 |
+
assert_type(random_st.f(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 936 |
+
assert_type(random_st.f(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 937 |
+
assert_type(random_st.f(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 938 |
+
assert_type(random_st.f(D_arr_like_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 939 |
+
assert_type(random_st.f(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 940 |
+
assert_type(random_st.f(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 941 |
+
assert_type(random_st.f(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 942 |
+
assert_type(random_st.f(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 943 |
+
assert_type(random_st.f(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 944 |
+
|
| 945 |
+
assert_type(random_st.gamma(0.5, 0.5), float)
|
| 946 |
+
assert_type(random_st.gamma(0.5, 0.5, size=None), float)
|
| 947 |
+
assert_type(random_st.gamma(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 948 |
+
assert_type(random_st.gamma(D_arr_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 949 |
+
assert_type(random_st.gamma(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 950 |
+
assert_type(random_st.gamma(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 951 |
+
assert_type(random_st.gamma(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 952 |
+
assert_type(random_st.gamma(D_arr_like_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 953 |
+
assert_type(random_st.gamma(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 954 |
+
assert_type(random_st.gamma(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 955 |
+
assert_type(random_st.gamma(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 956 |
+
assert_type(random_st.gamma(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 957 |
+
assert_type(random_st.gamma(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 958 |
+
|
| 959 |
+
assert_type(random_st.gumbel(0.5, 0.5), float)
|
| 960 |
+
assert_type(random_st.gumbel(0.5, 0.5, size=None), float)
|
| 961 |
+
assert_type(random_st.gumbel(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 962 |
+
assert_type(random_st.gumbel(D_arr_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 963 |
+
assert_type(random_st.gumbel(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 964 |
+
assert_type(random_st.gumbel(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 965 |
+
assert_type(random_st.gumbel(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 966 |
+
assert_type(random_st.gumbel(D_arr_like_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 967 |
+
assert_type(random_st.gumbel(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 968 |
+
assert_type(random_st.gumbel(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 969 |
+
assert_type(random_st.gumbel(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 970 |
+
assert_type(random_st.gumbel(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 971 |
+
assert_type(random_st.gumbel(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 972 |
+
|
| 973 |
+
assert_type(random_st.laplace(0.5, 0.5), float)
|
| 974 |
+
assert_type(random_st.laplace(0.5, 0.5, size=None), float)
|
| 975 |
+
assert_type(random_st.laplace(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 976 |
+
assert_type(random_st.laplace(D_arr_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 977 |
+
assert_type(random_st.laplace(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 978 |
+
assert_type(random_st.laplace(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 979 |
+
assert_type(random_st.laplace(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 980 |
+
assert_type(random_st.laplace(D_arr_like_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 981 |
+
assert_type(random_st.laplace(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 982 |
+
assert_type(random_st.laplace(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 983 |
+
assert_type(random_st.laplace(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 984 |
+
assert_type(random_st.laplace(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 985 |
+
assert_type(random_st.laplace(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 986 |
+
|
| 987 |
+
assert_type(random_st.logistic(0.5, 0.5), float)
|
| 988 |
+
assert_type(random_st.logistic(0.5, 0.5, size=None), float)
|
| 989 |
+
assert_type(random_st.logistic(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 990 |
+
assert_type(random_st.logistic(D_arr_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 991 |
+
assert_type(random_st.logistic(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 992 |
+
assert_type(random_st.logistic(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 993 |
+
assert_type(random_st.logistic(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 994 |
+
assert_type(random_st.logistic(D_arr_like_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 995 |
+
assert_type(random_st.logistic(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 996 |
+
assert_type(random_st.logistic(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 997 |
+
assert_type(random_st.logistic(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 998 |
+
assert_type(random_st.logistic(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 999 |
+
assert_type(random_st.logistic(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 1000 |
+
|
| 1001 |
+
assert_type(random_st.lognormal(0.5, 0.5), float)
|
| 1002 |
+
assert_type(random_st.lognormal(0.5, 0.5, size=None), float)
|
| 1003 |
+
assert_type(random_st.lognormal(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 1004 |
+
assert_type(random_st.lognormal(D_arr_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 1005 |
+
assert_type(random_st.lognormal(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 1006 |
+
assert_type(random_st.lognormal(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 1007 |
+
assert_type(random_st.lognormal(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 1008 |
+
assert_type(random_st.lognormal(D_arr_like_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 1009 |
+
assert_type(random_st.lognormal(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 1010 |
+
assert_type(random_st.lognormal(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 1011 |
+
assert_type(random_st.lognormal(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 1012 |
+
assert_type(random_st.lognormal(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 1013 |
+
assert_type(random_st.lognormal(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 1014 |
+
|
| 1015 |
+
assert_type(random_st.noncentral_chisquare(0.5, 0.5), float)
|
| 1016 |
+
assert_type(random_st.noncentral_chisquare(0.5, 0.5, size=None), float)
|
| 1017 |
+
assert_type(random_st.noncentral_chisquare(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 1018 |
+
assert_type(random_st.noncentral_chisquare(D_arr_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 1019 |
+
assert_type(random_st.noncentral_chisquare(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 1020 |
+
assert_type(random_st.noncentral_chisquare(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 1021 |
+
assert_type(random_st.noncentral_chisquare(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 1022 |
+
assert_type(random_st.noncentral_chisquare(D_arr_like_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 1023 |
+
assert_type(random_st.noncentral_chisquare(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 1024 |
+
assert_type(random_st.noncentral_chisquare(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 1025 |
+
assert_type(random_st.noncentral_chisquare(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 1026 |
+
assert_type(random_st.noncentral_chisquare(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 1027 |
+
assert_type(random_st.noncentral_chisquare(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 1028 |
+
|
| 1029 |
+
assert_type(random_st.normal(0.5, 0.5), float)
|
| 1030 |
+
assert_type(random_st.normal(0.5, 0.5, size=None), float)
|
| 1031 |
+
assert_type(random_st.normal(0.5, 0.5, size=1), npt.NDArray[np.float64])
|
| 1032 |
+
assert_type(random_st.normal(D_arr_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 1033 |
+
assert_type(random_st.normal(0.5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 1034 |
+
assert_type(random_st.normal(D_arr_0p5, 0.5, size=1), npt.NDArray[np.float64])
|
| 1035 |
+
assert_type(random_st.normal(0.5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 1036 |
+
assert_type(random_st.normal(D_arr_like_0p5, 0.5), npt.NDArray[np.float64] | Any)
|
| 1037 |
+
assert_type(random_st.normal(0.5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 1038 |
+
assert_type(random_st.normal(D_arr_0p5, D_arr_0p5), npt.NDArray[np.float64] | Any)
|
| 1039 |
+
assert_type(random_st.normal(D_arr_like_0p5, D_arr_like_0p5), npt.NDArray[np.float64] | Any)
|
| 1040 |
+
assert_type(random_st.normal(D_arr_0p5, D_arr_0p5, size=1), npt.NDArray[np.float64])
|
| 1041 |
+
assert_type(random_st.normal(D_arr_like_0p5, D_arr_like_0p5, size=1), npt.NDArray[np.float64])
|
| 1042 |
+
|
| 1043 |
+
assert_type(random_st.triangular(0.1, 0.5, 0.9), float)
|
| 1044 |
+
assert_type(random_st.triangular(0.1, 0.5, 0.9, size=None), float)
|
| 1045 |
+
assert_type(random_st.triangular(0.1, 0.5, 0.9, size=1), npt.NDArray[np.float64])
|
| 1046 |
+
assert_type(random_st.triangular(D_arr_0p1, 0.5, 0.9), npt.NDArray[np.float64] | Any)
|
| 1047 |
+
assert_type(random_st.triangular(0.1, D_arr_0p5, 0.9), npt.NDArray[np.float64] | Any)
|
| 1048 |
+
assert_type(random_st.triangular(D_arr_0p1, 0.5, D_arr_like_0p9, size=1), npt.NDArray[np.float64])
|
| 1049 |
+
assert_type(random_st.triangular(0.1, D_arr_0p5, 0.9, size=1), npt.NDArray[np.float64])
|
| 1050 |
+
assert_type(random_st.triangular(D_arr_like_0p1, 0.5, D_arr_0p9), npt.NDArray[np.float64] | Any)
|
| 1051 |
+
assert_type(random_st.triangular(0.5, D_arr_like_0p5, 0.9), npt.NDArray[np.float64] | Any)
|
| 1052 |
+
assert_type(random_st.triangular(D_arr_0p1, D_arr_0p5, 0.9), npt.NDArray[np.float64] | Any)
|
| 1053 |
+
assert_type(random_st.triangular(D_arr_like_0p1, D_arr_like_0p5, 0.9), npt.NDArray[np.float64] | Any)
|
| 1054 |
+
assert_type(random_st.triangular(D_arr_0p1, D_arr_0p5, D_arr_0p9, size=1), npt.NDArray[np.float64])
|
| 1055 |
+
assert_type(random_st.triangular(D_arr_like_0p1, D_arr_like_0p5, D_arr_like_0p9, size=1), npt.NDArray[np.float64])
|
| 1056 |
+
|
| 1057 |
+
assert_type(random_st.noncentral_f(0.1, 0.5, 0.9), float)
|
| 1058 |
+
assert_type(random_st.noncentral_f(0.1, 0.5, 0.9, size=None), float)
|
| 1059 |
+
assert_type(random_st.noncentral_f(0.1, 0.5, 0.9, size=1), npt.NDArray[np.float64])
|
| 1060 |
+
assert_type(random_st.noncentral_f(D_arr_0p1, 0.5, 0.9), npt.NDArray[np.float64] | Any)
|
| 1061 |
+
assert_type(random_st.noncentral_f(0.1, D_arr_0p5, 0.9), npt.NDArray[np.float64] | Any)
|
| 1062 |
+
assert_type(random_st.noncentral_f(D_arr_0p1, 0.5, D_arr_like_0p9, size=1), npt.NDArray[np.float64])
|
| 1063 |
+
assert_type(random_st.noncentral_f(0.1, D_arr_0p5, 0.9, size=1), npt.NDArray[np.float64])
|
| 1064 |
+
assert_type(random_st.noncentral_f(D_arr_like_0p1, 0.5, D_arr_0p9), npt.NDArray[np.float64] | Any)
|
| 1065 |
+
assert_type(random_st.noncentral_f(0.5, D_arr_like_0p5, 0.9), npt.NDArray[np.float64] | Any)
|
| 1066 |
+
assert_type(random_st.noncentral_f(D_arr_0p1, D_arr_0p5, 0.9), npt.NDArray[np.float64] | Any)
|
| 1067 |
+
assert_type(random_st.noncentral_f(D_arr_like_0p1, D_arr_like_0p5, 0.9), npt.NDArray[np.float64] | Any)
|
| 1068 |
+
assert_type(random_st.noncentral_f(D_arr_0p1, D_arr_0p5, D_arr_0p9, size=1), npt.NDArray[np.float64])
|
| 1069 |
+
assert_type(random_st.noncentral_f(D_arr_like_0p1, D_arr_like_0p5, D_arr_like_0p9, size=1), npt.NDArray[np.float64])
|
| 1070 |
+
|
| 1071 |
+
assert_type(random_st.binomial(10, 0.5), int)
|
| 1072 |
+
assert_type(random_st.binomial(10, 0.5, size=None), int)
|
| 1073 |
+
assert_type(random_st.binomial(10, 0.5, size=1), npt.NDArray[np.long])
|
| 1074 |
+
assert_type(random_st.binomial(I_arr_10, 0.5), npt.NDArray[np.long] | Any)
|
| 1075 |
+
assert_type(random_st.binomial(10, D_arr_0p5), npt.NDArray[np.long] | Any)
|
| 1076 |
+
assert_type(random_st.binomial(I_arr_10, 0.5, size=1), npt.NDArray[np.long])
|
| 1077 |
+
assert_type(random_st.binomial(10, D_arr_0p5, size=1), npt.NDArray[np.long])
|
| 1078 |
+
assert_type(random_st.binomial(I_arr_like_10, 0.5), npt.NDArray[np.long] | Any)
|
| 1079 |
+
assert_type(random_st.binomial(10, D_arr_like_0p5), npt.NDArray[np.long] | Any)
|
| 1080 |
+
assert_type(random_st.binomial(I_arr_10, D_arr_0p5), npt.NDArray[np.long] | Any)
|
| 1081 |
+
assert_type(random_st.binomial(I_arr_like_10, D_arr_like_0p5), npt.NDArray[np.long] | Any)
|
| 1082 |
+
assert_type(random_st.binomial(I_arr_10, D_arr_0p5, size=1), npt.NDArray[np.long])
|
| 1083 |
+
assert_type(random_st.binomial(I_arr_like_10, D_arr_like_0p5, size=1), npt.NDArray[np.long])
|
| 1084 |
+
|
| 1085 |
+
assert_type(random_st.negative_binomial(10, 0.5), int)
|
| 1086 |
+
assert_type(random_st.negative_binomial(10, 0.5, size=None), int)
|
| 1087 |
+
assert_type(random_st.negative_binomial(10, 0.5, size=1), npt.NDArray[np.long])
|
| 1088 |
+
assert_type(random_st.negative_binomial(I_arr_10, 0.5), npt.NDArray[np.long] | Any)
|
| 1089 |
+
assert_type(random_st.negative_binomial(10, D_arr_0p5), npt.NDArray[np.long] | Any)
|
| 1090 |
+
assert_type(random_st.negative_binomial(I_arr_10, 0.5, size=1), npt.NDArray[np.long])
|
| 1091 |
+
assert_type(random_st.negative_binomial(10, D_arr_0p5, size=1), npt.NDArray[np.long])
|
| 1092 |
+
assert_type(random_st.negative_binomial(I_arr_like_10, 0.5), npt.NDArray[np.long] | Any)
|
| 1093 |
+
assert_type(random_st.negative_binomial(10, D_arr_like_0p5), npt.NDArray[np.long] | Any)
|
| 1094 |
+
assert_type(random_st.negative_binomial(I_arr_10, D_arr_0p5), npt.NDArray[np.long] | Any)
|
| 1095 |
+
assert_type(random_st.negative_binomial(I_arr_like_10, D_arr_like_0p5), npt.NDArray[np.long] | Any)
|
| 1096 |
+
assert_type(random_st.negative_binomial(I_arr_like_10, D_arr_like_0p5), npt.NDArray[np.long] | Any)
|
| 1097 |
+
assert_type(random_st.negative_binomial(I_arr_10, D_arr_0p5, size=1), npt.NDArray[np.long])
|
| 1098 |
+
assert_type(random_st.negative_binomial(I_arr_like_10, D_arr_like_0p5, size=1), npt.NDArray[np.long])
|
| 1099 |
+
|
| 1100 |
+
assert_type(random_st.hypergeometric(20, 20, 10), int)
|
| 1101 |
+
assert_type(random_st.hypergeometric(20, 20, 10, size=None), int)
|
| 1102 |
+
assert_type(random_st.hypergeometric(20, 20, 10, size=1), npt.NDArray[np.long])
|
| 1103 |
+
assert_type(random_st.hypergeometric(I_arr_20, 20, 10), npt.NDArray[np.long] | Any)
|
| 1104 |
+
assert_type(random_st.hypergeometric(20, I_arr_20, 10), npt.NDArray[np.long] | Any)
|
| 1105 |
+
assert_type(random_st.hypergeometric(I_arr_20, 20, I_arr_like_10, size=1), npt.NDArray[np.long])
|
| 1106 |
+
assert_type(random_st.hypergeometric(20, I_arr_20, 10, size=1), npt.NDArray[np.long])
|
| 1107 |
+
assert_type(random_st.hypergeometric(I_arr_like_20, 20, I_arr_10), npt.NDArray[np.long] | Any)
|
| 1108 |
+
assert_type(random_st.hypergeometric(20, I_arr_like_20, 10), npt.NDArray[np.long] | Any)
|
| 1109 |
+
assert_type(random_st.hypergeometric(I_arr_20, I_arr_20, 10), npt.NDArray[np.long] | Any)
|
| 1110 |
+
assert_type(random_st.hypergeometric(I_arr_like_20, I_arr_like_20, 10), npt.NDArray[np.long] | Any)
|
| 1111 |
+
assert_type(random_st.hypergeometric(I_arr_20, I_arr_20, I_arr_10, size=1), npt.NDArray[np.long])
|
| 1112 |
+
assert_type(random_st.hypergeometric(I_arr_like_20, I_arr_like_20, I_arr_like_10, size=1), npt.NDArray[np.long])
|
| 1113 |
+
|
| 1114 |
+
assert_type(random_st.randint(0, 100), int)
|
| 1115 |
+
assert_type(random_st.randint(100), int)
|
| 1116 |
+
assert_type(random_st.randint([100]), npt.NDArray[np.long] | Any)
|
| 1117 |
+
assert_type(random_st.randint(0, [100]), npt.NDArray[np.long] | Any)
|
| 1118 |
+
|
| 1119 |
+
assert_type(random_st.randint(2, dtype=bool), bool)
|
| 1120 |
+
assert_type(random_st.randint(0, 2, dtype=bool), bool)
|
| 1121 |
+
assert_type(random_st.randint(I_bool_high_open, dtype=bool), npt.NDArray[np.bool] | Any)
|
| 1122 |
+
assert_type(random_st.randint(I_bool_low, I_bool_high_open, dtype=bool), npt.NDArray[np.bool] | Any)
|
| 1123 |
+
assert_type(random_st.randint(0, I_bool_high_open, dtype=bool), npt.NDArray[np.bool] | Any)
|
| 1124 |
+
|
| 1125 |
+
assert_type(random_st.randint(2, dtype=np.bool), np.bool)
|
| 1126 |
+
assert_type(random_st.randint(0, 2, dtype=np.bool), np.bool)
|
| 1127 |
+
assert_type(random_st.randint(I_bool_high_open, dtype=np.bool), npt.NDArray[np.bool] | Any)
|
| 1128 |
+
assert_type(random_st.randint(I_bool_low, I_bool_high_open, dtype=np.bool), npt.NDArray[np.bool] | Any)
|
| 1129 |
+
assert_type(random_st.randint(0, I_bool_high_open, dtype=np.bool), npt.NDArray[np.bool] | Any)
|
| 1130 |
+
|
| 1131 |
+
assert_type(random_st.randint(256, dtype="u1"), np.uint8)
|
| 1132 |
+
assert_type(random_st.randint(0, 256, dtype="u1"), np.uint8)
|
| 1133 |
+
assert_type(random_st.randint(I_u1_high_open, dtype="u1"), npt.NDArray[np.uint8] | Any)
|
| 1134 |
+
assert_type(random_st.randint(I_u1_low, I_u1_high_open, dtype="u1"), npt.NDArray[np.uint8] | Any)
|
| 1135 |
+
assert_type(random_st.randint(0, I_u1_high_open, dtype="u1"), npt.NDArray[np.uint8] | Any)
|
| 1136 |
+
|
| 1137 |
+
assert_type(random_st.randint(256, dtype="uint8"), np.uint8)
|
| 1138 |
+
assert_type(random_st.randint(0, 256, dtype="uint8"), np.uint8)
|
| 1139 |
+
assert_type(random_st.randint(I_u1_high_open, dtype="uint8"), npt.NDArray[np.uint8] | Any)
|
| 1140 |
+
assert_type(random_st.randint(I_u1_low, I_u1_high_open, dtype="uint8"), npt.NDArray[np.uint8] | Any)
|
| 1141 |
+
assert_type(random_st.randint(0, I_u1_high_open, dtype="uint8"), npt.NDArray[np.uint8] | Any)
|
| 1142 |
+
|
| 1143 |
+
assert_type(random_st.randint(256, dtype=np.uint8), np.uint8)
|
| 1144 |
+
assert_type(random_st.randint(0, 256, dtype=np.uint8), np.uint8)
|
| 1145 |
+
assert_type(random_st.randint(I_u1_high_open, dtype=np.uint8), npt.NDArray[np.uint8] | Any)
|
| 1146 |
+
assert_type(random_st.randint(I_u1_low, I_u1_high_open, dtype=np.uint8), npt.NDArray[np.uint8] | Any)
|
| 1147 |
+
assert_type(random_st.randint(0, I_u1_high_open, dtype=np.uint8), npt.NDArray[np.uint8] | Any)
|
| 1148 |
+
|
| 1149 |
+
assert_type(random_st.randint(65536, dtype="u2"), np.uint16)
|
| 1150 |
+
assert_type(random_st.randint(0, 65536, dtype="u2"), np.uint16)
|
| 1151 |
+
assert_type(random_st.randint(I_u2_high_open, dtype="u2"), npt.NDArray[np.uint16] | Any)
|
| 1152 |
+
assert_type(random_st.randint(I_u2_low, I_u2_high_open, dtype="u2"), npt.NDArray[np.uint16] | Any)
|
| 1153 |
+
assert_type(random_st.randint(0, I_u2_high_open, dtype="u2"), npt.NDArray[np.uint16] | Any)
|
| 1154 |
+
|
| 1155 |
+
assert_type(random_st.randint(65536, dtype="uint16"), np.uint16)
|
| 1156 |
+
assert_type(random_st.randint(0, 65536, dtype="uint16"), np.uint16)
|
| 1157 |
+
assert_type(random_st.randint(I_u2_high_open, dtype="uint16"), npt.NDArray[np.uint16] | Any)
|
| 1158 |
+
assert_type(random_st.randint(I_u2_low, I_u2_high_open, dtype="uint16"), npt.NDArray[np.uint16] | Any)
|
| 1159 |
+
assert_type(random_st.randint(0, I_u2_high_open, dtype="uint16"), npt.NDArray[np.uint16] | Any)
|
| 1160 |
+
|
| 1161 |
+
assert_type(random_st.randint(65536, dtype=np.uint16), np.uint16)
|
| 1162 |
+
assert_type(random_st.randint(0, 65536, dtype=np.uint16), np.uint16)
|
| 1163 |
+
assert_type(random_st.randint(I_u2_high_open, dtype=np.uint16), npt.NDArray[np.uint16] | Any)
|
| 1164 |
+
assert_type(random_st.randint(I_u2_low, I_u2_high_open, dtype=np.uint16), npt.NDArray[np.uint16] | Any)
|
| 1165 |
+
assert_type(random_st.randint(0, I_u2_high_open, dtype=np.uint16), npt.NDArray[np.uint16] | Any)
|
| 1166 |
+
|
| 1167 |
+
assert_type(random_st.randint(4294967296, dtype="u4"), np.uint32)
|
| 1168 |
+
assert_type(random_st.randint(0, 4294967296, dtype="u4"), np.uint32)
|
| 1169 |
+
assert_type(random_st.randint(I_u4_high_open, dtype="u4"), npt.NDArray[np.uint32] | Any)
|
| 1170 |
+
assert_type(random_st.randint(I_u4_low, I_u4_high_open, dtype="u4"), npt.NDArray[np.uint32] | Any)
|
| 1171 |
+
assert_type(random_st.randint(0, I_u4_high_open, dtype="u4"), npt.NDArray[np.uint32] | Any)
|
| 1172 |
+
|
| 1173 |
+
assert_type(random_st.randint(4294967296, dtype="uint32"), np.uint32)
|
| 1174 |
+
assert_type(random_st.randint(0, 4294967296, dtype="uint32"), np.uint32)
|
| 1175 |
+
assert_type(random_st.randint(I_u4_high_open, dtype="uint32"), npt.NDArray[np.uint32] | Any)
|
| 1176 |
+
assert_type(random_st.randint(I_u4_low, I_u4_high_open, dtype="uint32"), npt.NDArray[np.uint32] | Any)
|
| 1177 |
+
assert_type(random_st.randint(0, I_u4_high_open, dtype="uint32"), npt.NDArray[np.uint32] | Any)
|
| 1178 |
+
|
| 1179 |
+
assert_type(random_st.randint(4294967296, dtype=np.uint32), np.uint32)
|
| 1180 |
+
assert_type(random_st.randint(0, 4294967296, dtype=np.uint32), np.uint32)
|
| 1181 |
+
assert_type(random_st.randint(I_u4_high_open, dtype=np.uint32), npt.NDArray[np.uint32] | Any)
|
| 1182 |
+
assert_type(random_st.randint(I_u4_low, I_u4_high_open, dtype=np.uint32), npt.NDArray[np.uint32] | Any)
|
| 1183 |
+
assert_type(random_st.randint(0, I_u4_high_open, dtype=np.uint32), npt.NDArray[np.uint32] | Any)
|
| 1184 |
+
|
| 1185 |
+
assert_type(random_st.randint(4294967296, dtype=np.uint), np.uint)
|
| 1186 |
+
assert_type(random_st.randint(0, 4294967296, dtype=np.uint), np.uint)
|
| 1187 |
+
assert_type(random_st.randint(I_u4_high_open, dtype=np.uint), npt.NDArray[np.uint] | Any)
|
| 1188 |
+
assert_type(random_st.randint(I_u4_low, I_u4_high_open, dtype=np.uint), npt.NDArray[np.uint] | Any)
|
| 1189 |
+
assert_type(random_st.randint(0, I_u4_high_open, dtype=np.uint), npt.NDArray[np.uint] | Any)
|
| 1190 |
+
|
| 1191 |
+
assert_type(random_st.randint(18446744073709551616, dtype="u8"), np.uint64)
|
| 1192 |
+
assert_type(random_st.randint(0, 18446744073709551616, dtype="u8"), np.uint64)
|
| 1193 |
+
assert_type(random_st.randint(I_u8_high_open, dtype="u8"), npt.NDArray[np.uint64] | Any)
|
| 1194 |
+
assert_type(random_st.randint(I_u8_low, I_u8_high_open, dtype="u8"), npt.NDArray[np.uint64] | Any)
|
| 1195 |
+
assert_type(random_st.randint(0, I_u8_high_open, dtype="u8"), npt.NDArray[np.uint64] | Any)
|
| 1196 |
+
|
| 1197 |
+
assert_type(random_st.randint(18446744073709551616, dtype="uint64"), np.uint64)
|
| 1198 |
+
assert_type(random_st.randint(0, 18446744073709551616, dtype="uint64"), np.uint64)
|
| 1199 |
+
assert_type(random_st.randint(I_u8_high_open, dtype="uint64"), npt.NDArray[np.uint64] | Any)
|
| 1200 |
+
assert_type(random_st.randint(I_u8_low, I_u8_high_open, dtype="uint64"), npt.NDArray[np.uint64] | Any)
|
| 1201 |
+
assert_type(random_st.randint(0, I_u8_high_open, dtype="uint64"), npt.NDArray[np.uint64] | Any)
|
| 1202 |
+
|
| 1203 |
+
assert_type(random_st.randint(18446744073709551616, dtype=np.uint64), np.uint64)
|
| 1204 |
+
assert_type(random_st.randint(0, 18446744073709551616, dtype=np.uint64), np.uint64)
|
| 1205 |
+
assert_type(random_st.randint(I_u8_high_open, dtype=np.uint64), npt.NDArray[np.uint64] | Any)
|
| 1206 |
+
assert_type(random_st.randint(I_u8_low, I_u8_high_open, dtype=np.uint64), npt.NDArray[np.uint64] | Any)
|
| 1207 |
+
assert_type(random_st.randint(0, I_u8_high_open, dtype=np.uint64), npt.NDArray[np.uint64] | Any)
|
| 1208 |
+
|
| 1209 |
+
assert_type(random_st.randint(128, dtype="i1"), np.int8)
|
| 1210 |
+
assert_type(random_st.randint(-128, 128, dtype="i1"), np.int8)
|
| 1211 |
+
assert_type(random_st.randint(I_i1_high_open, dtype="i1"), npt.NDArray[np.int8] | Any)
|
| 1212 |
+
assert_type(random_st.randint(I_i1_low, I_i1_high_open, dtype="i1"), npt.NDArray[np.int8] | Any)
|
| 1213 |
+
assert_type(random_st.randint(-128, I_i1_high_open, dtype="i1"), npt.NDArray[np.int8] | Any)
|
| 1214 |
+
|
| 1215 |
+
assert_type(random_st.randint(128, dtype="int8"), np.int8)
|
| 1216 |
+
assert_type(random_st.randint(-128, 128, dtype="int8"), np.int8)
|
| 1217 |
+
assert_type(random_st.randint(I_i1_high_open, dtype="int8"), npt.NDArray[np.int8] | Any)
|
| 1218 |
+
assert_type(random_st.randint(I_i1_low, I_i1_high_open, dtype="int8"), npt.NDArray[np.int8] | Any)
|
| 1219 |
+
assert_type(random_st.randint(-128, I_i1_high_open, dtype="int8"), npt.NDArray[np.int8] | Any)
|
| 1220 |
+
|
| 1221 |
+
assert_type(random_st.randint(128, dtype=np.int8), np.int8)
|
| 1222 |
+
assert_type(random_st.randint(-128, 128, dtype=np.int8), np.int8)
|
| 1223 |
+
assert_type(random_st.randint(I_i1_high_open, dtype=np.int8), npt.NDArray[np.int8] | Any)
|
| 1224 |
+
assert_type(random_st.randint(I_i1_low, I_i1_high_open, dtype=np.int8), npt.NDArray[np.int8] | Any)
|
| 1225 |
+
assert_type(random_st.randint(-128, I_i1_high_open, dtype=np.int8), npt.NDArray[np.int8] | Any)
|
| 1226 |
+
|
| 1227 |
+
assert_type(random_st.randint(32768, dtype="i2"), np.int16)
|
| 1228 |
+
assert_type(random_st.randint(-32768, 32768, dtype="i2"), np.int16)
|
| 1229 |
+
assert_type(random_st.randint(I_i2_high_open, dtype="i2"), npt.NDArray[np.int16] | Any)
|
| 1230 |
+
assert_type(random_st.randint(I_i2_low, I_i2_high_open, dtype="i2"), npt.NDArray[np.int16] | Any)
|
| 1231 |
+
assert_type(random_st.randint(-32768, I_i2_high_open, dtype="i2"), npt.NDArray[np.int16] | Any)
|
| 1232 |
+
|
| 1233 |
+
assert_type(random_st.randint(32768, dtype="int16"), np.int16)
|
| 1234 |
+
assert_type(random_st.randint(-32768, 32768, dtype="int16"), np.int16)
|
| 1235 |
+
assert_type(random_st.randint(I_i2_high_open, dtype="int16"), npt.NDArray[np.int16] | Any)
|
| 1236 |
+
assert_type(random_st.randint(I_i2_low, I_i2_high_open, dtype="int16"), npt.NDArray[np.int16] | Any)
|
| 1237 |
+
assert_type(random_st.randint(-32768, I_i2_high_open, dtype="int16"), npt.NDArray[np.int16] | Any)
|
| 1238 |
+
|
| 1239 |
+
assert_type(random_st.randint(32768, dtype=np.int16), np.int16)
|
| 1240 |
+
assert_type(random_st.randint(-32768, 32768, dtype=np.int16), np.int16)
|
| 1241 |
+
assert_type(random_st.randint(I_i2_high_open, dtype=np.int16), npt.NDArray[np.int16] | Any)
|
| 1242 |
+
assert_type(random_st.randint(I_i2_low, I_i2_high_open, dtype=np.int16), npt.NDArray[np.int16] | Any)
|
| 1243 |
+
assert_type(random_st.randint(-32768, I_i2_high_open, dtype=np.int16), npt.NDArray[np.int16] | Any)
|
| 1244 |
+
|
| 1245 |
+
assert_type(random_st.randint(2147483648, dtype="i4"), np.int32)
|
| 1246 |
+
assert_type(random_st.randint(-2147483648, 2147483648, dtype="i4"), np.int32)
|
| 1247 |
+
assert_type(random_st.randint(I_i4_high_open, dtype="i4"), npt.NDArray[np.int32] | Any)
|
| 1248 |
+
assert_type(random_st.randint(I_i4_low, I_i4_high_open, dtype="i4"), npt.NDArray[np.int32] | Any)
|
| 1249 |
+
assert_type(random_st.randint(-2147483648, I_i4_high_open, dtype="i4"), npt.NDArray[np.int32] | Any)
|
| 1250 |
+
|
| 1251 |
+
assert_type(random_st.randint(2147483648, dtype="int32"), np.int32)
|
| 1252 |
+
assert_type(random_st.randint(-2147483648, 2147483648, dtype="int32"), np.int32)
|
| 1253 |
+
assert_type(random_st.randint(I_i4_high_open, dtype="int32"), npt.NDArray[np.int32] | Any)
|
| 1254 |
+
assert_type(random_st.randint(I_i4_low, I_i4_high_open, dtype="int32"), npt.NDArray[np.int32] | Any)
|
| 1255 |
+
assert_type(random_st.randint(-2147483648, I_i4_high_open, dtype="int32"), npt.NDArray[np.int32] | Any)
|
| 1256 |
+
|
| 1257 |
+
assert_type(random_st.randint(2147483648, dtype=np.int32), np.int32)
|
| 1258 |
+
assert_type(random_st.randint(-2147483648, 2147483648, dtype=np.int32), np.int32)
|
| 1259 |
+
assert_type(random_st.randint(I_i4_high_open, dtype=np.int32), npt.NDArray[np.int32] | Any)
|
| 1260 |
+
assert_type(random_st.randint(I_i4_low, I_i4_high_open, dtype=np.int32), npt.NDArray[np.int32] | Any)
|
| 1261 |
+
assert_type(random_st.randint(-2147483648, I_i4_high_open, dtype=np.int32), npt.NDArray[np.int32] | Any)
|
| 1262 |
+
|
| 1263 |
+
assert_type(random_st.randint(2147483648, dtype=np.int_), np.int_)
|
| 1264 |
+
assert_type(random_st.randint(-2147483648, 2147483648, dtype=np.int_), np.int_)
|
| 1265 |
+
assert_type(random_st.randint(I_i4_high_open, dtype=np.int_), npt.NDArray[np.int_] | Any)
|
| 1266 |
+
assert_type(random_st.randint(I_i4_low, I_i4_high_open, dtype=np.int_), npt.NDArray[np.int_] | Any)
|
| 1267 |
+
assert_type(random_st.randint(-2147483648, I_i4_high_open, dtype=np.int_), npt.NDArray[np.int_] | Any)
|
| 1268 |
+
|
| 1269 |
+
assert_type(random_st.randint(9223372036854775808, dtype="i8"), np.int64)
|
| 1270 |
+
assert_type(random_st.randint(-9223372036854775808, 9223372036854775808, dtype="i8"), np.int64)
|
| 1271 |
+
assert_type(random_st.randint(I_i8_high_open, dtype="i8"), npt.NDArray[np.int64] | Any)
|
| 1272 |
+
assert_type(random_st.randint(I_i8_low, I_i8_high_open, dtype="i8"), npt.NDArray[np.int64] | Any)
|
| 1273 |
+
assert_type(random_st.randint(-9223372036854775808, I_i8_high_open, dtype="i8"), npt.NDArray[np.int64] | Any)
|
| 1274 |
+
|
| 1275 |
+
assert_type(random_st.randint(9223372036854775808, dtype="int64"), np.int64)
|
| 1276 |
+
assert_type(random_st.randint(-9223372036854775808, 9223372036854775808, dtype="int64"), np.int64)
|
| 1277 |
+
assert_type(random_st.randint(I_i8_high_open, dtype="int64"), npt.NDArray[np.int64] | Any)
|
| 1278 |
+
assert_type(random_st.randint(I_i8_low, I_i8_high_open, dtype="int64"), npt.NDArray[np.int64] | Any)
|
| 1279 |
+
assert_type(random_st.randint(-9223372036854775808, I_i8_high_open, dtype="int64"), npt.NDArray[np.int64] | Any)
|
| 1280 |
+
|
| 1281 |
+
assert_type(random_st.randint(9223372036854775808, dtype=np.int64), np.int64)
|
| 1282 |
+
assert_type(random_st.randint(-9223372036854775808, 9223372036854775808, dtype=np.int64), np.int64)
|
| 1283 |
+
assert_type(random_st.randint(I_i8_high_open, dtype=np.int64), npt.NDArray[np.int64] | Any)
|
| 1284 |
+
assert_type(random_st.randint(I_i8_low, I_i8_high_open, dtype=np.int64), npt.NDArray[np.int64] | Any)
|
| 1285 |
+
assert_type(random_st.randint(-9223372036854775808, I_i8_high_open, dtype=np.int64), npt.NDArray[np.int64] | Any)
|
| 1286 |
+
|
| 1287 |
+
assert_type(random_st._bit_generator, np.random.BitGenerator)
|
| 1288 |
+
|
| 1289 |
+
assert_type(random_st.bytes(2), bytes)
|
| 1290 |
+
|
| 1291 |
+
assert_type(random_st.choice(5), int)
|
| 1292 |
+
assert_type(random_st.choice(5, 3), npt.NDArray[np.long])
|
| 1293 |
+
assert_type(random_st.choice(5, 3, replace=True), npt.NDArray[np.long])
|
| 1294 |
+
assert_type(random_st.choice(5, 3, p=[1 / 5] * 5), npt.NDArray[np.long])
|
| 1295 |
+
assert_type(random_st.choice(5, 3, p=[1 / 5] * 5, replace=False), npt.NDArray[np.long])
|
| 1296 |
+
|
| 1297 |
+
assert_type(random_st.choice(["pooh", "rabbit", "piglet", "Christopher"]), Any)
|
| 1298 |
+
assert_type(random_st.choice(["pooh", "rabbit", "piglet", "Christopher"], 3), npt.NDArray[Any])
|
| 1299 |
+
assert_type(random_st.choice(["pooh", "rabbit", "piglet", "Christopher"], 3, p=[1 / 4] * 4), npt.NDArray[Any])
|
| 1300 |
+
assert_type(random_st.choice(["pooh", "rabbit", "piglet", "Christopher"], 3, replace=True), npt.NDArray[Any])
|
| 1301 |
+
assert_type(random_st.choice(["pooh", "rabbit", "piglet", "Christopher"], 3, replace=False, p=np.array([1 / 8, 1 / 8, 1 / 2, 1 / 4])), npt.NDArray[Any])
|
| 1302 |
+
|
| 1303 |
+
assert_type(random_st.dirichlet([0.5, 0.5]), npt.NDArray[np.float64])
|
| 1304 |
+
assert_type(random_st.dirichlet(np.array([0.5, 0.5])), npt.NDArray[np.float64])
|
| 1305 |
+
assert_type(random_st.dirichlet(np.array([0.5, 0.5]), size=3), npt.NDArray[np.float64])
|
| 1306 |
+
|
| 1307 |
+
assert_type(random_st.multinomial(20, [1 / 6.0] * 6), npt.NDArray[np.long])
|
| 1308 |
+
assert_type(random_st.multinomial(20, np.array([0.5, 0.5])), npt.NDArray[np.long])
|
| 1309 |
+
assert_type(random_st.multinomial(20, [1 / 6.0] * 6, size=2), npt.NDArray[np.long])
|
| 1310 |
+
|
| 1311 |
+
assert_type(random_st.multivariate_normal([0.0], [[1.0]]), npt.NDArray[np.float64])
|
| 1312 |
+
assert_type(random_st.multivariate_normal([0.0], np.array([[1.0]])), npt.NDArray[np.float64])
|
| 1313 |
+
assert_type(random_st.multivariate_normal(np.array([0.0]), [[1.0]]), npt.NDArray[np.float64])
|
| 1314 |
+
assert_type(random_st.multivariate_normal([0.0], np.array([[1.0]])), npt.NDArray[np.float64])
|
| 1315 |
+
|
| 1316 |
+
assert_type(random_st.permutation(10), npt.NDArray[np.long])
|
| 1317 |
+
assert_type(random_st.permutation([1, 2, 3, 4]), npt.NDArray[Any])
|
| 1318 |
+
assert_type(random_st.permutation(np.array([1, 2, 3, 4])), npt.NDArray[Any])
|
| 1319 |
+
assert_type(random_st.permutation(D_2D), npt.NDArray[Any])
|
| 1320 |
+
|
| 1321 |
+
assert_type(random_st.shuffle(np.arange(10)), None)
|
| 1322 |
+
assert_type(random_st.shuffle([1, 2, 3, 4, 5]), None)
|
| 1323 |
+
assert_type(random_st.shuffle(D_2D), None)
|
| 1324 |
+
|
| 1325 |
+
assert_type(np.random.RandomState(pcg64), np.random.RandomState)
|
| 1326 |
+
assert_type(np.random.RandomState(0), np.random.RandomState)
|
| 1327 |
+
assert_type(np.random.RandomState([0, 1, 2]), np.random.RandomState)
|
| 1328 |
+
assert_type(random_st.__str__(), str)
|
| 1329 |
+
assert_type(random_st.__repr__(), str)
|
| 1330 |
+
random_st_state = random_st.__getstate__()
|
| 1331 |
+
assert_type(random_st_state, dict[str, Any])
|
| 1332 |
+
assert_type(random_st.__setstate__(random_st_state), None)
|
| 1333 |
+
assert_type(random_st.seed(), None)
|
| 1334 |
+
assert_type(random_st.seed(1), None)
|
| 1335 |
+
assert_type(random_st.seed([0, 1]), None)
|
| 1336 |
+
random_st_get_state = random_st.get_state()
|
| 1337 |
+
assert_type(random_st_state, dict[str, Any])
|
| 1338 |
+
random_st_get_state_legacy = random_st.get_state(legacy=True)
|
| 1339 |
+
assert_type(random_st_get_state_legacy, tuple[str, npt.NDArray[np.uint32], int, int, float])
|
| 1340 |
+
assert_type(random_st.set_state(random_st_get_state), None)
|
| 1341 |
+
|
| 1342 |
+
assert_type(random_st.rand(), float)
|
| 1343 |
+
assert_type(random_st.rand(1), npt.NDArray[np.float64])
|
| 1344 |
+
assert_type(random_st.rand(1, 2), npt.NDArray[np.float64])
|
| 1345 |
+
assert_type(random_st.randn(), float)
|
| 1346 |
+
assert_type(random_st.randn(1), npt.NDArray[np.float64])
|
| 1347 |
+
assert_type(random_st.randn(1, 2), npt.NDArray[np.float64])
|
| 1348 |
+
assert_type(random_st.random_sample(), float)
|
| 1349 |
+
assert_type(random_st.random_sample(1), npt.NDArray[np.float64])
|
| 1350 |
+
assert_type(random_st.random_sample(size=(1, 2)), npt.NDArray[np.float64])
|
| 1351 |
+
|
| 1352 |
+
assert_type(random_st.tomaxint(), int)
|
| 1353 |
+
assert_type(random_st.tomaxint(1), npt.NDArray[np.int64])
|
| 1354 |
+
assert_type(random_st.tomaxint((1,)), npt.NDArray[np.int64])
|
| 1355 |
+
|
| 1356 |
+
assert_type(np.random.mtrand.set_bit_generator(pcg64), None)
|
| 1357 |
+
assert_type(np.random.mtrand.get_bit_generator(), np.random.BitGenerator)
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/rec.pyi
ADDED
|
@@ -0,0 +1,177 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import io
|
| 2 |
+
from typing import Any, assert_type
|
| 3 |
+
|
| 4 |
+
import numpy as np
|
| 5 |
+
import numpy.typing as npt
|
| 6 |
+
|
| 7 |
+
type _RecArray = np.recarray[tuple[Any, ...], np.dtype[np.record]]
|
| 8 |
+
|
| 9 |
+
AR_i8: npt.NDArray[np.int64]
|
| 10 |
+
REC_AR_V: _RecArray
|
| 11 |
+
AR_LIST: list[npt.NDArray[np.int64]]
|
| 12 |
+
|
| 13 |
+
record: np.record
|
| 14 |
+
file_obj: io.BufferedIOBase
|
| 15 |
+
|
| 16 |
+
assert_type(np.rec.format_parser(
|
| 17 |
+
formats=[np.float64, np.int64, np.bool],
|
| 18 |
+
names=["f8", "i8", "?"],
|
| 19 |
+
titles=None,
|
| 20 |
+
aligned=True,
|
| 21 |
+
), np.rec.format_parser)
|
| 22 |
+
assert_type(np.rec.format_parser.dtype, np.dtype[np.void])
|
| 23 |
+
|
| 24 |
+
assert_type(record.field_a, Any)
|
| 25 |
+
assert_type(record.field_b, Any)
|
| 26 |
+
assert_type(record["field_a"], Any)
|
| 27 |
+
assert_type(record["field_b"], Any)
|
| 28 |
+
assert_type(record.pprint(), str)
|
| 29 |
+
record.field_c = 5
|
| 30 |
+
|
| 31 |
+
assert_type(REC_AR_V.field(0), Any)
|
| 32 |
+
assert_type(REC_AR_V.field("field_a"), Any)
|
| 33 |
+
assert_type(REC_AR_V.field(0, AR_i8), None)
|
| 34 |
+
assert_type(REC_AR_V.field("field_a", AR_i8), None)
|
| 35 |
+
assert_type(REC_AR_V["field_a"], npt.NDArray[Any])
|
| 36 |
+
assert_type(REC_AR_V.field_a, Any)
|
| 37 |
+
assert_type(REC_AR_V.__array_finalize__(object()), None)
|
| 38 |
+
|
| 39 |
+
assert_type(
|
| 40 |
+
np.recarray(
|
| 41 |
+
shape=(10, 5),
|
| 42 |
+
formats=[np.float64, np.int64, np.bool],
|
| 43 |
+
order="K",
|
| 44 |
+
byteorder="|",
|
| 45 |
+
),
|
| 46 |
+
_RecArray,
|
| 47 |
+
)
|
| 48 |
+
|
| 49 |
+
assert_type(
|
| 50 |
+
np.recarray(
|
| 51 |
+
shape=(10, 5),
|
| 52 |
+
dtype=[("f8", np.float64), ("i8", np.int64)],
|
| 53 |
+
strides=(5, 5),
|
| 54 |
+
),
|
| 55 |
+
np.recarray,
|
| 56 |
+
)
|
| 57 |
+
|
| 58 |
+
assert_type(np.rec.fromarrays(AR_LIST), np.recarray)
|
| 59 |
+
assert_type(
|
| 60 |
+
np.rec.fromarrays(AR_LIST, dtype=np.int64),
|
| 61 |
+
np.recarray,
|
| 62 |
+
)
|
| 63 |
+
assert_type(
|
| 64 |
+
np.rec.fromarrays(AR_LIST, names=["i8", "f8"]),
|
| 65 |
+
_RecArray,
|
| 66 |
+
)
|
| 67 |
+
assert_type(
|
| 68 |
+
np.rec.fromarrays(
|
| 69 |
+
AR_LIST,
|
| 70 |
+
formats=[np.int64, np.float64],
|
| 71 |
+
names=["i8", "f8"]
|
| 72 |
+
),
|
| 73 |
+
_RecArray,
|
| 74 |
+
)
|
| 75 |
+
|
| 76 |
+
assert_type(
|
| 77 |
+
np.rec.fromrecords((1, 1.5)),
|
| 78 |
+
_RecArray
|
| 79 |
+
)
|
| 80 |
+
assert_type(
|
| 81 |
+
np.rec.fromrecords(
|
| 82 |
+
[(1, 1.5)],
|
| 83 |
+
dtype=[("i8", np.int64), ("f8", np.float64)],
|
| 84 |
+
),
|
| 85 |
+
_RecArray,
|
| 86 |
+
)
|
| 87 |
+
assert_type(
|
| 88 |
+
np.rec.fromrecords(
|
| 89 |
+
REC_AR_V,
|
| 90 |
+
formats=[np.int64, np.float64],
|
| 91 |
+
names=["i8", "f8"]
|
| 92 |
+
),
|
| 93 |
+
_RecArray,
|
| 94 |
+
)
|
| 95 |
+
assert_type(
|
| 96 |
+
np.rec.fromrecords(REC_AR_V, names=["i8", "f8"]),
|
| 97 |
+
_RecArray,
|
| 98 |
+
)
|
| 99 |
+
|
| 100 |
+
assert_type(
|
| 101 |
+
np.rec.fromstring(
|
| 102 |
+
b"(1, 1.5)",
|
| 103 |
+
dtype=[("i8", np.int64), ("f8", np.float64)],
|
| 104 |
+
),
|
| 105 |
+
_RecArray,
|
| 106 |
+
)
|
| 107 |
+
|
| 108 |
+
assert_type(
|
| 109 |
+
np.rec.fromstring(
|
| 110 |
+
REC_AR_V,
|
| 111 |
+
formats=[np.int64, np.float64],
|
| 112 |
+
names=["i8", "f8"]
|
| 113 |
+
),
|
| 114 |
+
_RecArray,
|
| 115 |
+
)
|
| 116 |
+
|
| 117 |
+
assert_type(
|
| 118 |
+
np.rec.fromfile(
|
| 119 |
+
"test_file.txt",
|
| 120 |
+
dtype=[("i8", np.int64), ("f8", np.float64)],
|
| 121 |
+
),
|
| 122 |
+
np.recarray,
|
| 123 |
+
)
|
| 124 |
+
|
| 125 |
+
assert_type(
|
| 126 |
+
np.rec.fromfile(
|
| 127 |
+
file_obj,
|
| 128 |
+
formats=[np.int64, np.float64],
|
| 129 |
+
names=["i8", "f8"]
|
| 130 |
+
),
|
| 131 |
+
_RecArray,
|
| 132 |
+
)
|
| 133 |
+
|
| 134 |
+
assert_type(np.rec.array(AR_i8), np.recarray[tuple[Any, ...], np.dtype[np.int64]])
|
| 135 |
+
|
| 136 |
+
assert_type(
|
| 137 |
+
np.rec.array([(1, 1.5)], dtype=[("i8", np.int64), ("f8", np.float64)]),
|
| 138 |
+
np.recarray,
|
| 139 |
+
)
|
| 140 |
+
|
| 141 |
+
assert_type(
|
| 142 |
+
np.rec.array(
|
| 143 |
+
[(1, 1.5)],
|
| 144 |
+
formats=[np.int64, np.float64],
|
| 145 |
+
names=["i8", "f8"]
|
| 146 |
+
),
|
| 147 |
+
_RecArray,
|
| 148 |
+
)
|
| 149 |
+
|
| 150 |
+
assert_type(
|
| 151 |
+
np.rec.array(
|
| 152 |
+
None,
|
| 153 |
+
dtype=np.float64,
|
| 154 |
+
shape=(10, 3),
|
| 155 |
+
),
|
| 156 |
+
np.recarray,
|
| 157 |
+
)
|
| 158 |
+
|
| 159 |
+
assert_type(
|
| 160 |
+
np.rec.array(
|
| 161 |
+
None,
|
| 162 |
+
formats=[np.int64, np.float64],
|
| 163 |
+
names=["i8", "f8"],
|
| 164 |
+
shape=(10, 3),
|
| 165 |
+
),
|
| 166 |
+
_RecArray,
|
| 167 |
+
)
|
| 168 |
+
|
| 169 |
+
assert_type(
|
| 170 |
+
np.rec.array(file_obj, dtype=np.float64),
|
| 171 |
+
np.recarray,
|
| 172 |
+
)
|
| 173 |
+
|
| 174 |
+
assert_type(
|
| 175 |
+
np.rec.array(file_obj, formats=[np.int64, np.float64], names=["i8", "f8"]),
|
| 176 |
+
_RecArray,
|
| 177 |
+
)
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/scalars.pyi
ADDED
|
@@ -0,0 +1,288 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import datetime as dt
|
| 2 |
+
from typing import Any, Literal, assert_type
|
| 3 |
+
|
| 4 |
+
import numpy as np
|
| 5 |
+
|
| 6 |
+
b: np.bool
|
| 7 |
+
u8: np.uint64
|
| 8 |
+
i8: np.int64
|
| 9 |
+
f8: np.float64
|
| 10 |
+
c8: np.complex64
|
| 11 |
+
c16: np.complex128
|
| 12 |
+
m: np.timedelta64
|
| 13 |
+
U: np.str_
|
| 14 |
+
S: np.bytes_
|
| 15 |
+
V: np.void
|
| 16 |
+
O: np.object_ # cannot exists at runtime
|
| 17 |
+
|
| 18 |
+
array_nd: np.ndarray[Any, Any]
|
| 19 |
+
array_0d: np.ndarray[tuple[()], Any]
|
| 20 |
+
array_2d_2x2: np.ndarray[tuple[Literal[2], Literal[2]], Any]
|
| 21 |
+
|
| 22 |
+
assert_type(c8.real, np.float32)
|
| 23 |
+
assert_type(c8.imag, np.float32)
|
| 24 |
+
|
| 25 |
+
assert_type(c8.real.real, np.float32)
|
| 26 |
+
assert_type(c8.real.imag, np.float32)
|
| 27 |
+
|
| 28 |
+
assert_type(c8.itemsize, int)
|
| 29 |
+
assert_type(c8.shape, tuple[()])
|
| 30 |
+
assert_type(c8.strides, tuple[()])
|
| 31 |
+
|
| 32 |
+
assert_type(c8.ndim, Literal[0])
|
| 33 |
+
assert_type(c8.size, Literal[1])
|
| 34 |
+
|
| 35 |
+
assert_type(c8.squeeze(), np.complex64)
|
| 36 |
+
assert_type(c8.byteswap(), np.complex64)
|
| 37 |
+
assert_type(c8.transpose(), np.complex64)
|
| 38 |
+
|
| 39 |
+
assert_type(c8.dtype, np.dtype[np.complex64])
|
| 40 |
+
|
| 41 |
+
assert_type(c8.real, np.float32)
|
| 42 |
+
assert_type(c16.imag, np.float64)
|
| 43 |
+
|
| 44 |
+
assert_type(np.str_("foo"), np.str_)
|
| 45 |
+
|
| 46 |
+
# Indexing
|
| 47 |
+
assert_type(b[()], np.bool)
|
| 48 |
+
assert_type(i8[()], np.int64)
|
| 49 |
+
assert_type(u8[()], np.uint64)
|
| 50 |
+
assert_type(f8[()], np.float64)
|
| 51 |
+
assert_type(c8[()], np.complex64)
|
| 52 |
+
assert_type(c16[()], np.complex128)
|
| 53 |
+
assert_type(V[()], np.void)
|
| 54 |
+
|
| 55 |
+
assert_type(b[...], np.ndarray[tuple[()], np.dtype[np.bool]])
|
| 56 |
+
assert_type(b[(...,)], np.ndarray[tuple[()], np.dtype[np.bool]])
|
| 57 |
+
assert_type(i8[...], np.ndarray[tuple[()], np.dtype[np.int64]])
|
| 58 |
+
assert_type(i8[(...,)], np.ndarray[tuple[()], np.dtype[np.int64]])
|
| 59 |
+
assert_type(u8[...], np.ndarray[tuple[()], np.dtype[np.uint64]])
|
| 60 |
+
assert_type(u8[(...,)], np.ndarray[tuple[()], np.dtype[np.uint64]])
|
| 61 |
+
assert_type(f8[...], np.ndarray[tuple[()], np.dtype[np.float64]])
|
| 62 |
+
assert_type(f8[(...,)], np.ndarray[tuple[()], np.dtype[np.float64]])
|
| 63 |
+
assert_type(c8[...], np.ndarray[tuple[()], np.dtype[np.complex64]])
|
| 64 |
+
assert_type(c8[(...,)], np.ndarray[tuple[()], np.dtype[np.complex64]])
|
| 65 |
+
assert_type(c16[...], np.ndarray[tuple[()], np.dtype[np.complex128]])
|
| 66 |
+
assert_type(c16[(...,)], np.ndarray[tuple[()], np.dtype[np.complex128]])
|
| 67 |
+
assert_type(V[...], np.ndarray[tuple[()], np.dtype[np.void]])
|
| 68 |
+
assert_type(V[(...,)], np.ndarray[tuple[()], np.dtype[np.void]])
|
| 69 |
+
|
| 70 |
+
None1 = (None,)
|
| 71 |
+
None2 = (None, None)
|
| 72 |
+
None3 = (None, None, None)
|
| 73 |
+
None4 = (None, None, None, None)
|
| 74 |
+
|
| 75 |
+
assert_type(b[None], np.ndarray[tuple[int], np.dtype[np.bool]])
|
| 76 |
+
assert_type(b[None1], np.ndarray[tuple[int], np.dtype[np.bool]])
|
| 77 |
+
assert_type(b[None2], np.ndarray[tuple[int, int], np.dtype[np.bool]])
|
| 78 |
+
assert_type(b[None3], np.ndarray[tuple[int, int, int], np.dtype[np.bool]])
|
| 79 |
+
assert_type(b[None4], np.ndarray[tuple[Any, ...], np.dtype[np.bool]])
|
| 80 |
+
|
| 81 |
+
assert_type(u8[None], np.ndarray[tuple[int], np.dtype[np.uint64]])
|
| 82 |
+
assert_type(u8[None1], np.ndarray[tuple[int], np.dtype[np.uint64]])
|
| 83 |
+
assert_type(u8[None2], np.ndarray[tuple[int, int], np.dtype[np.uint64]])
|
| 84 |
+
assert_type(u8[None3], np.ndarray[tuple[int, int, int], np.dtype[np.uint64]])
|
| 85 |
+
assert_type(u8[None4], np.ndarray[tuple[Any, ...], np.dtype[np.uint64]])
|
| 86 |
+
|
| 87 |
+
assert_type(i8[None], np.ndarray[tuple[int], np.dtype[np.int64]])
|
| 88 |
+
assert_type(i8[None1], np.ndarray[tuple[int], np.dtype[np.int64]])
|
| 89 |
+
assert_type(i8[None2], np.ndarray[tuple[int, int], np.dtype[np.int64]])
|
| 90 |
+
assert_type(i8[None3], np.ndarray[tuple[int, int, int], np.dtype[np.int64]])
|
| 91 |
+
assert_type(i8[None4], np.ndarray[tuple[Any, ...], np.dtype[np.int64]])
|
| 92 |
+
|
| 93 |
+
assert_type(f8[None], np.ndarray[tuple[int], np.dtype[np.float64]])
|
| 94 |
+
assert_type(f8[None1], np.ndarray[tuple[int], np.dtype[np.float64]])
|
| 95 |
+
assert_type(f8[None2], np.ndarray[tuple[int, int], np.dtype[np.float64]])
|
| 96 |
+
assert_type(f8[None3], np.ndarray[tuple[int, int, int], np.dtype[np.float64]])
|
| 97 |
+
assert_type(f8[None4], np.ndarray[tuple[Any, ...], np.dtype[np.float64]])
|
| 98 |
+
|
| 99 |
+
assert_type(c8[None], np.ndarray[tuple[int], np.dtype[np.complex64]])
|
| 100 |
+
assert_type(c8[None1], np.ndarray[tuple[int], np.dtype[np.complex64]])
|
| 101 |
+
assert_type(c8[None2], np.ndarray[tuple[int, int], np.dtype[np.complex64]])
|
| 102 |
+
assert_type(c8[None3], np.ndarray[tuple[int, int, int], np.dtype[np.complex64]])
|
| 103 |
+
assert_type(c8[None4], np.ndarray[tuple[Any, ...], np.dtype[np.complex64]])
|
| 104 |
+
|
| 105 |
+
assert_type(c16[None], np.ndarray[tuple[int], np.dtype[np.complex128]])
|
| 106 |
+
assert_type(c16[None1], np.ndarray[tuple[int], np.dtype[np.complex128]])
|
| 107 |
+
assert_type(c16[None2], np.ndarray[tuple[int, int], np.dtype[np.complex128]])
|
| 108 |
+
assert_type(c16[None3], np.ndarray[tuple[int, int, int], np.dtype[np.complex128]])
|
| 109 |
+
assert_type(c16[None4], np.ndarray[tuple[Any, ...], np.dtype[np.complex128]])
|
| 110 |
+
|
| 111 |
+
assert_type(U[0], str)
|
| 112 |
+
assert_type(U[:1], str)
|
| 113 |
+
assert_type(U[1:], str)
|
| 114 |
+
assert_type(U[:], str)
|
| 115 |
+
|
| 116 |
+
assert_type(S[0], int)
|
| 117 |
+
assert_type(S[:1], bytes)
|
| 118 |
+
assert_type(S[1:], bytes)
|
| 119 |
+
assert_type(S[:], bytes)
|
| 120 |
+
|
| 121 |
+
assert_type(V[None], np.ndarray[tuple[int], np.dtype[np.void]])
|
| 122 |
+
assert_type(V[None1], np.ndarray[tuple[int], np.dtype[np.void]])
|
| 123 |
+
assert_type(V[None2], np.ndarray[tuple[int, int], np.dtype[np.void]])
|
| 124 |
+
assert_type(V[None3], np.ndarray[tuple[int, int, int], np.dtype[np.void]])
|
| 125 |
+
assert_type(V[None4], np.ndarray[tuple[Any, ...], np.dtype[np.void]])
|
| 126 |
+
assert_type(V[0], Any)
|
| 127 |
+
assert_type(V["field1"], Any)
|
| 128 |
+
assert_type(V[["field1", "field2"]], np.void)
|
| 129 |
+
V[0] = 5
|
| 130 |
+
|
| 131 |
+
# Aliases
|
| 132 |
+
assert_type(np.bool_(), np.bool[Literal[False]])
|
| 133 |
+
assert_type(np.byte(), np.byte)
|
| 134 |
+
assert_type(np.short(), np.short)
|
| 135 |
+
assert_type(np.intc(), np.intc)
|
| 136 |
+
assert_type(np.intp(), np.intp)
|
| 137 |
+
assert_type(np.int_(), np.int_)
|
| 138 |
+
assert_type(np.long(), np.long)
|
| 139 |
+
assert_type(np.longlong(), np.longlong)
|
| 140 |
+
|
| 141 |
+
assert_type(np.ubyte(), np.ubyte)
|
| 142 |
+
assert_type(np.ushort(), np.ushort)
|
| 143 |
+
assert_type(np.uintc(), np.uintc)
|
| 144 |
+
assert_type(np.uintp(), np.uintp)
|
| 145 |
+
assert_type(np.uint(), np.uint)
|
| 146 |
+
assert_type(np.ulong(), np.ulong)
|
| 147 |
+
assert_type(np.ulonglong(), np.ulonglong)
|
| 148 |
+
|
| 149 |
+
assert_type(np.half(), np.half)
|
| 150 |
+
assert_type(np.single(), np.single)
|
| 151 |
+
assert_type(np.double(), np.double)
|
| 152 |
+
assert_type(np.longdouble(), np.longdouble)
|
| 153 |
+
|
| 154 |
+
assert_type(np.csingle(), np.csingle)
|
| 155 |
+
assert_type(np.cdouble(), np.cdouble)
|
| 156 |
+
assert_type(np.clongdouble(), np.clongdouble)
|
| 157 |
+
|
| 158 |
+
assert_type(b.item(), bool)
|
| 159 |
+
assert_type(i8.item(), int)
|
| 160 |
+
assert_type(u8.item(), int)
|
| 161 |
+
assert_type(f8.item(), float)
|
| 162 |
+
assert_type(c16.item(), complex)
|
| 163 |
+
assert_type(U.item(), str)
|
| 164 |
+
assert_type(S.item(), bytes)
|
| 165 |
+
|
| 166 |
+
assert_type(b.tolist(), bool)
|
| 167 |
+
assert_type(i8.tolist(), int)
|
| 168 |
+
assert_type(u8.tolist(), int)
|
| 169 |
+
assert_type(f8.tolist(), float)
|
| 170 |
+
assert_type(c16.tolist(), complex)
|
| 171 |
+
assert_type(U.tolist(), str)
|
| 172 |
+
assert_type(S.tolist(), bytes)
|
| 173 |
+
|
| 174 |
+
assert_type(b.ravel(), np.ndarray[tuple[int], np.dtype[np.bool]])
|
| 175 |
+
assert_type(i8.ravel(), np.ndarray[tuple[int], np.dtype[np.int64]])
|
| 176 |
+
assert_type(u8.ravel(), np.ndarray[tuple[int], np.dtype[np.uint64]])
|
| 177 |
+
assert_type(f8.ravel(), np.ndarray[tuple[int], np.dtype[np.float64]])
|
| 178 |
+
assert_type(c16.ravel(), np.ndarray[tuple[int], np.dtype[np.complex128]])
|
| 179 |
+
assert_type(U.ravel(), np.ndarray[tuple[int], np.dtype[np.str_]])
|
| 180 |
+
assert_type(S.ravel(), np.ndarray[tuple[int], np.dtype[np.bytes_]])
|
| 181 |
+
|
| 182 |
+
assert_type(b.flatten(), np.ndarray[tuple[int], np.dtype[np.bool]])
|
| 183 |
+
assert_type(i8.flatten(), np.ndarray[tuple[int], np.dtype[np.int64]])
|
| 184 |
+
assert_type(u8.flatten(), np.ndarray[tuple[int], np.dtype[np.uint64]])
|
| 185 |
+
assert_type(f8.flatten(), np.ndarray[tuple[int], np.dtype[np.float64]])
|
| 186 |
+
assert_type(c16.flatten(), np.ndarray[tuple[int], np.dtype[np.complex128]])
|
| 187 |
+
assert_type(U.flatten(), np.ndarray[tuple[int], np.dtype[np.str_]])
|
| 188 |
+
assert_type(S.flatten(), np.ndarray[tuple[int], np.dtype[np.bytes_]])
|
| 189 |
+
|
| 190 |
+
assert_type(b.reshape(()), np.bool)
|
| 191 |
+
assert_type(i8.reshape([]), np.int64)
|
| 192 |
+
assert_type(b.reshape(1), np.ndarray[tuple[int], np.dtype[np.bool]])
|
| 193 |
+
assert_type(i8.reshape(-1), np.ndarray[tuple[int], np.dtype[np.int64]])
|
| 194 |
+
assert_type(u8.reshape(1, 1), np.ndarray[tuple[int, int], np.dtype[np.uint64]])
|
| 195 |
+
assert_type(f8.reshape(1, -1), np.ndarray[tuple[int, int], np.dtype[np.float64]])
|
| 196 |
+
assert_type(c16.reshape(1, 1, 1), np.ndarray[tuple[int, int, int], np.dtype[np.complex128]])
|
| 197 |
+
assert_type(U.reshape(1, 1, 1, 1), np.ndarray[tuple[int, int, int, int], np.dtype[np.str_]])
|
| 198 |
+
assert_type(
|
| 199 |
+
S.reshape(1, 1, 1, 1, 1),
|
| 200 |
+
np.ndarray[
|
| 201 |
+
# len(shape) >= 5
|
| 202 |
+
tuple[int, int, int, int, int, *tuple[int, ...]],
|
| 203 |
+
np.dtype[np.bytes_],
|
| 204 |
+
],
|
| 205 |
+
)
|
| 206 |
+
|
| 207 |
+
assert_type(i8.astype(float), Any)
|
| 208 |
+
assert_type(i8.astype(np.float64), np.float64)
|
| 209 |
+
|
| 210 |
+
assert_type(i8.view(), np.int64)
|
| 211 |
+
assert_type(i8.view(np.float64), np.float64)
|
| 212 |
+
assert_type(i8.view(float), Any)
|
| 213 |
+
assert_type(i8.view(np.float64, np.ndarray), np.float64)
|
| 214 |
+
|
| 215 |
+
assert_type(i8.getfield(float), Any)
|
| 216 |
+
assert_type(i8.getfield(np.float64), np.float64)
|
| 217 |
+
assert_type(i8.getfield(np.float64, 8), np.float64)
|
| 218 |
+
|
| 219 |
+
assert_type(f8.as_integer_ratio(), tuple[int, int])
|
| 220 |
+
assert_type(f8.is_integer(), bool)
|
| 221 |
+
assert_type(f8.__trunc__(), int)
|
| 222 |
+
assert_type(f8.__getformat__("float"), str)
|
| 223 |
+
assert_type(f8.hex(), str)
|
| 224 |
+
assert_type(np.float64.fromhex("0x0.0p+0"), np.float64)
|
| 225 |
+
|
| 226 |
+
assert_type(f8.__getnewargs__(), tuple[float])
|
| 227 |
+
assert_type(c16.__getnewargs__(), tuple[float, float])
|
| 228 |
+
|
| 229 |
+
assert_type(i8.numerator, np.int64)
|
| 230 |
+
assert_type(i8.denominator, Literal[1])
|
| 231 |
+
assert_type(u8.numerator, np.uint64)
|
| 232 |
+
assert_type(u8.denominator, Literal[1])
|
| 233 |
+
assert_type(m.numerator, np.timedelta64)
|
| 234 |
+
assert_type(m.denominator, Literal[1])
|
| 235 |
+
|
| 236 |
+
assert_type(round(i8), int)
|
| 237 |
+
assert_type(round(i8, 3), np.int64)
|
| 238 |
+
assert_type(round(u8), int)
|
| 239 |
+
assert_type(round(u8, 3), np.uint64)
|
| 240 |
+
assert_type(round(f8), int)
|
| 241 |
+
assert_type(round(f8, 3), np.float64)
|
| 242 |
+
|
| 243 |
+
assert_type(f8.__ceil__(), int)
|
| 244 |
+
assert_type(f8.__floor__(), int)
|
| 245 |
+
|
| 246 |
+
assert_type(i8.is_integer(), Literal[True])
|
| 247 |
+
|
| 248 |
+
assert_type(O.real, np.object_)
|
| 249 |
+
assert_type(O.imag, np.object_)
|
| 250 |
+
assert_type(int(O), int)
|
| 251 |
+
assert_type(float(O), float)
|
| 252 |
+
assert_type(complex(O), complex)
|
| 253 |
+
|
| 254 |
+
assert_type(np.datetime64(), np.datetime64[None])
|
| 255 |
+
assert_type(np.datetime64("now", "ns"), np.datetime64[int])
|
| 256 |
+
assert_type(np.datetime64("now", "s"), np.datetime64[dt.datetime])
|
| 257 |
+
assert_type(np.datetime64("now", "Y"), np.datetime64[dt.date])
|
| 258 |
+
# unit-swapping
|
| 259 |
+
assert_type(np.datetime64(np.datetime64(), "ns"), np.datetime64[int])
|
| 260 |
+
assert_type(np.datetime64(np.datetime64("now", "ns"), "ns"), np.datetime64[int])
|
| 261 |
+
assert_type(np.datetime64(np.datetime64("now", "s"), "ns"), np.datetime64[int])
|
| 262 |
+
assert_type(np.datetime64(np.datetime64("now", "Y"), "ns"), np.datetime64[int])
|
| 263 |
+
assert_type(np.datetime64(np.datetime64(), "s"), np.datetime64[dt.datetime])
|
| 264 |
+
assert_type(np.datetime64(np.datetime64("now", "ns"), "s"), np.datetime64[dt.datetime])
|
| 265 |
+
assert_type(np.datetime64(np.datetime64("now", "s"), "s"), np.datetime64[dt.datetime])
|
| 266 |
+
assert_type(np.datetime64(np.datetime64("now", "Y"), "s"), np.datetime64[dt.datetime])
|
| 267 |
+
assert_type(np.datetime64(np.datetime64(), "Y"), np.datetime64[dt.date])
|
| 268 |
+
assert_type(np.datetime64(np.datetime64("now", "ns"), "Y"), np.datetime64[dt.date])
|
| 269 |
+
assert_type(np.datetime64(np.datetime64("now", "s"), "Y"), np.datetime64[dt.date])
|
| 270 |
+
assert_type(np.datetime64(np.datetime64("now", "Y"), "Y"), np.datetime64[dt.date])
|
| 271 |
+
|
| 272 |
+
# These fail fail because of a mypy __new__ bug:
|
| 273 |
+
# https://github.com/python/mypy/issues/15182
|
| 274 |
+
# According to the typing spec, the following statements are valid, see
|
| 275 |
+
# https://typing.readthedocs.io/en/latest/spec/constructors.html#new-method
|
| 276 |
+
|
| 277 |
+
# assert_type(np.object_(), None)
|
| 278 |
+
# assert_type(np.object_(None), None)
|
| 279 |
+
# assert_type(np.object_(array_nd), np.ndarray[Any, np.dtype[np.object_]])
|
| 280 |
+
# assert_type(np.object_([]), npt.NDArray[np.object_])
|
| 281 |
+
# assert_type(np.object_(()), npt.NDArray[np.object_])
|
| 282 |
+
# assert_type(np.object_(range(4)), npt.NDArray[np.object_])
|
| 283 |
+
# assert_type(np.object_(+42), int)
|
| 284 |
+
# assert_type(np.object_(1 / 137), float)
|
| 285 |
+
# assert_type(np.object_('Developers! ' * (1 << 6)), str)
|
| 286 |
+
# assert_type(np.object_(object()), object)
|
| 287 |
+
# assert_type(np.object_({False, True, NotADirectoryError}), set[Any])
|
| 288 |
+
# assert_type(np.object_({'spam': 'food', 'ham': 'food'}), dict[str, str])
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/shape.pyi
ADDED
|
@@ -0,0 +1,13 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import Any, NamedTuple, assert_type
|
| 2 |
+
|
| 3 |
+
import numpy as np
|
| 4 |
+
|
| 5 |
+
# Subtype of tuple[int, int]
|
| 6 |
+
class XYGrid(NamedTuple):
|
| 7 |
+
x_axis: int
|
| 8 |
+
y_axis: int
|
| 9 |
+
|
| 10 |
+
arr: np.ndarray[XYGrid, Any]
|
| 11 |
+
|
| 12 |
+
# Test shape property matches shape typevar
|
| 13 |
+
assert_type(arr.shape, XYGrid)
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/shape_base.pyi
ADDED
|
@@ -0,0 +1,84 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import Any, Self, assert_type
|
| 2 |
+
|
| 3 |
+
import numpy as np
|
| 4 |
+
import numpy.typing as npt
|
| 5 |
+
|
| 6 |
+
i8: np.int64
|
| 7 |
+
f8: np.float64
|
| 8 |
+
|
| 9 |
+
AR_b: npt.NDArray[np.bool]
|
| 10 |
+
AR_i8: npt.NDArray[np.int64]
|
| 11 |
+
AR_i8_0d: np.ndarray[tuple[()], np.dtype[np.int64]]
|
| 12 |
+
AR_i8_1d: np.ndarray[tuple[int], np.dtype[np.int64]]
|
| 13 |
+
AR_i8_2d: np.ndarray[tuple[int, int], np.dtype[np.int64]]
|
| 14 |
+
AR_f8: npt.NDArray[np.float64]
|
| 15 |
+
|
| 16 |
+
AR_LIKE_f8: list[float]
|
| 17 |
+
|
| 18 |
+
# Duck-typed class implementing _SupportsSplitOps protocol for testing
|
| 19 |
+
class _SplitableArray:
|
| 20 |
+
shape: tuple[int, ...]
|
| 21 |
+
ndim: int
|
| 22 |
+
def swapaxes(self, axis1: int, axis2: int, /) -> Self: ...
|
| 23 |
+
def __getitem__(self, key: Any, /) -> Self: ...
|
| 24 |
+
|
| 25 |
+
splitable: _SplitableArray
|
| 26 |
+
|
| 27 |
+
assert_type(np.take_along_axis(AR_f8, AR_i8, axis=1), npt.NDArray[np.float64])
|
| 28 |
+
assert_type(np.take_along_axis(f8, AR_i8, axis=None), npt.NDArray[np.float64])
|
| 29 |
+
|
| 30 |
+
assert_type(np.put_along_axis(AR_f8, AR_i8, "1.0", axis=1), None)
|
| 31 |
+
|
| 32 |
+
assert_type(np.expand_dims(AR_LIKE_f8, 0), np.ndarray)
|
| 33 |
+
assert_type(np.expand_dims(AR_i8, ()), npt.NDArray[np.int64])
|
| 34 |
+
assert_type(np.expand_dims(AR_i8, 0), npt.NDArray[np.int64])
|
| 35 |
+
assert_type(np.expand_dims(AR_i8, (0,)), npt.NDArray[np.int64])
|
| 36 |
+
assert_type(np.expand_dims(AR_i8, (0, 1)), npt.NDArray[np.int64])
|
| 37 |
+
assert_type(np.expand_dims(AR_i8_0d, ()), np.ndarray[tuple[()], np.dtype[np.int64]])
|
| 38 |
+
assert_type(np.expand_dims(AR_i8_0d, 0), np.ndarray[tuple[int], np.dtype[np.int64]])
|
| 39 |
+
assert_type(np.expand_dims(AR_i8_0d, (0,)), np.ndarray[tuple[int], np.dtype[np.int64]])
|
| 40 |
+
assert_type(np.expand_dims(AR_i8_0d, (0, 1)), np.ndarray[tuple[int, int], np.dtype[np.int64]])
|
| 41 |
+
assert_type(np.expand_dims(AR_i8_1d, ()), np.ndarray[tuple[int], np.dtype[np.int64]])
|
| 42 |
+
assert_type(np.expand_dims(AR_i8_1d, 0), np.ndarray[tuple[int, int], np.dtype[np.int64]])
|
| 43 |
+
assert_type(np.expand_dims(AR_i8_1d, (0,)), np.ndarray[tuple[int, int], np.dtype[np.int64]])
|
| 44 |
+
assert_type(np.expand_dims(AR_i8_1d, (0, 1)), np.ndarray[tuple[int, int, int], np.dtype[np.int64]])
|
| 45 |
+
assert_type(np.expand_dims(AR_i8_2d, ()), np.ndarray[tuple[int, int], np.dtype[np.int64]])
|
| 46 |
+
assert_type(np.expand_dims(AR_i8_2d, 0), np.ndarray[tuple[int, int, int], np.dtype[np.int64]])
|
| 47 |
+
assert_type(np.expand_dims(AR_i8_2d, (0,)), np.ndarray[tuple[int, int, int], np.dtype[np.int64]])
|
| 48 |
+
assert_type(np.expand_dims(AR_i8_2d, (0, 1)), np.ndarray[tuple[int, int, int, int], np.dtype[np.int64]])
|
| 49 |
+
|
| 50 |
+
assert_type(np.column_stack([AR_i8]), npt.NDArray[np.int64])
|
| 51 |
+
assert_type(np.column_stack([AR_LIKE_f8]), npt.NDArray[Any])
|
| 52 |
+
|
| 53 |
+
assert_type(np.dstack([AR_i8]), npt.NDArray[np.int64])
|
| 54 |
+
assert_type(np.dstack([AR_LIKE_f8]), npt.NDArray[Any])
|
| 55 |
+
|
| 56 |
+
assert_type(np.array_split(AR_i8, [3, 5, 6, 10]), list[npt.NDArray[np.int64]])
|
| 57 |
+
assert_type(np.array_split(AR_LIKE_f8, [3, 5, 6, 10]), list[npt.NDArray[Any]])
|
| 58 |
+
assert_type(np.array_split(splitable, 2), list[_SplitableArray])
|
| 59 |
+
|
| 60 |
+
assert_type(np.split(AR_i8, [3, 5, 6, 10]), list[npt.NDArray[np.int64]])
|
| 61 |
+
assert_type(np.split(AR_LIKE_f8, [3, 5, 6, 10]), list[npt.NDArray[Any]])
|
| 62 |
+
assert_type(np.split(splitable, 2), list[_SplitableArray])
|
| 63 |
+
|
| 64 |
+
assert_type(np.hsplit(AR_i8, [3, 5, 6, 10]), list[npt.NDArray[np.int64]])
|
| 65 |
+
assert_type(np.hsplit(AR_LIKE_f8, [3, 5, 6, 10]), list[npt.NDArray[Any]])
|
| 66 |
+
assert_type(np.hsplit(splitable, 2), list[_SplitableArray])
|
| 67 |
+
|
| 68 |
+
assert_type(np.vsplit(AR_i8, [3, 5, 6, 10]), list[npt.NDArray[np.int64]])
|
| 69 |
+
assert_type(np.vsplit(AR_LIKE_f8, [3, 5, 6, 10]), list[npt.NDArray[Any]])
|
| 70 |
+
assert_type(np.vsplit(splitable, 2), list[_SplitableArray])
|
| 71 |
+
|
| 72 |
+
assert_type(np.dsplit(AR_i8, [3, 5, 6, 10]), list[npt.NDArray[np.int64]])
|
| 73 |
+
assert_type(np.dsplit(AR_LIKE_f8, [3, 5, 6, 10]), list[npt.NDArray[Any]])
|
| 74 |
+
assert_type(np.dsplit(splitable, 2), list[_SplitableArray])
|
| 75 |
+
|
| 76 |
+
assert_type(np.kron(AR_b, AR_b), npt.NDArray[np.bool])
|
| 77 |
+
assert_type(np.kron(AR_b, AR_i8), npt.NDArray[np.signedinteger])
|
| 78 |
+
assert_type(np.kron(AR_f8, AR_f8), npt.NDArray[np.floating])
|
| 79 |
+
|
| 80 |
+
assert_type(np.tile(AR_i8, 5), npt.NDArray[np.int64])
|
| 81 |
+
assert_type(np.tile(AR_LIKE_f8, [2, 2]), npt.NDArray[Any])
|
| 82 |
+
|
| 83 |
+
assert_type(np.unstack(AR_i8, axis=0), tuple[npt.NDArray[np.int64], ...])
|
| 84 |
+
assert_type(np.unstack(AR_LIKE_f8, axis=0), tuple[npt.NDArray[Any], ...])
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/stride_tricks.pyi
ADDED
|
@@ -0,0 +1,27 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import Any, assert_type
|
| 2 |
+
|
| 3 |
+
import numpy as np
|
| 4 |
+
import numpy.typing as npt
|
| 5 |
+
|
| 6 |
+
AR_f8: npt.NDArray[np.float64]
|
| 7 |
+
AR_LIKE_f: list[float]
|
| 8 |
+
interface_dict: dict[str, Any]
|
| 9 |
+
|
| 10 |
+
assert_type(np.lib.stride_tricks.as_strided(AR_f8), npt.NDArray[np.float64])
|
| 11 |
+
assert_type(np.lib.stride_tricks.as_strided(AR_LIKE_f), npt.NDArray[Any])
|
| 12 |
+
assert_type(np.lib.stride_tricks.as_strided(AR_f8, strides=(1, 5)), npt.NDArray[np.float64])
|
| 13 |
+
assert_type(np.lib.stride_tricks.as_strided(AR_f8, shape=[9, 20]), npt.NDArray[np.float64])
|
| 14 |
+
|
| 15 |
+
assert_type(np.lib.stride_tricks.sliding_window_view(AR_f8, 5), npt.NDArray[np.float64])
|
| 16 |
+
assert_type(np.lib.stride_tricks.sliding_window_view(AR_LIKE_f, (1, 5)), npt.NDArray[Any])
|
| 17 |
+
assert_type(np.lib.stride_tricks.sliding_window_view(AR_f8, [9], axis=1), npt.NDArray[np.float64])
|
| 18 |
+
|
| 19 |
+
assert_type(np.broadcast_to(AR_f8, 5), npt.NDArray[np.float64])
|
| 20 |
+
assert_type(np.broadcast_to(AR_LIKE_f, (1, 5)), npt.NDArray[Any])
|
| 21 |
+
assert_type(np.broadcast_to(AR_f8, [4, 6], subok=True), npt.NDArray[np.float64])
|
| 22 |
+
|
| 23 |
+
assert_type(np.broadcast_shapes((1, 2), [3, 1], (3, 2)), tuple[Any, ...])
|
| 24 |
+
assert_type(np.broadcast_shapes((6, 7), (5, 6, 1), 7, (5, 1, 7)), tuple[Any, ...])
|
| 25 |
+
|
| 26 |
+
assert_type(np.broadcast_arrays(AR_f8, AR_f8), tuple[npt.NDArray[Any], ...])
|
| 27 |
+
assert_type(np.broadcast_arrays(AR_f8, AR_LIKE_f), tuple[npt.NDArray[Any], ...])
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/strings.pyi
ADDED
|
@@ -0,0 +1,198 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import assert_type
|
| 2 |
+
|
| 3 |
+
import numpy as np
|
| 4 |
+
import numpy._typing as np_t
|
| 5 |
+
import numpy.typing as npt
|
| 6 |
+
|
| 7 |
+
type AR_T_alias = np.ndarray[np_t._AnyShape, np.dtypes.StringDType]
|
| 8 |
+
type AR_TU_alias = AR_T_alias | npt.NDArray[np.str_]
|
| 9 |
+
|
| 10 |
+
AR_U: npt.NDArray[np.str_]
|
| 11 |
+
AR_S: npt.NDArray[np.bytes_]
|
| 12 |
+
AR_T: AR_T_alias
|
| 13 |
+
|
| 14 |
+
assert_type(np.strings.equal(AR_U, AR_U), np.ndarray)
|
| 15 |
+
assert_type(np.strings.equal(AR_S, AR_S), np.ndarray)
|
| 16 |
+
assert_type(np.strings.equal(AR_T, AR_T), np.ndarray)
|
| 17 |
+
|
| 18 |
+
assert_type(np.strings.not_equal(AR_U, AR_U), np.ndarray)
|
| 19 |
+
assert_type(np.strings.not_equal(AR_S, AR_S), np.ndarray)
|
| 20 |
+
assert_type(np.strings.not_equal(AR_T, AR_T), np.ndarray)
|
| 21 |
+
|
| 22 |
+
assert_type(np.strings.greater_equal(AR_U, AR_U), np.ndarray)
|
| 23 |
+
assert_type(np.strings.greater_equal(AR_S, AR_S), np.ndarray)
|
| 24 |
+
assert_type(np.strings.greater_equal(AR_T, AR_T), np.ndarray)
|
| 25 |
+
|
| 26 |
+
assert_type(np.strings.less_equal(AR_U, AR_U), np.ndarray)
|
| 27 |
+
assert_type(np.strings.less_equal(AR_S, AR_S), np.ndarray)
|
| 28 |
+
assert_type(np.strings.less_equal(AR_T, AR_T), np.ndarray)
|
| 29 |
+
|
| 30 |
+
assert_type(np.strings.greater(AR_U, AR_U), np.ndarray)
|
| 31 |
+
assert_type(np.strings.greater(AR_S, AR_S), np.ndarray)
|
| 32 |
+
assert_type(np.strings.greater(AR_T, AR_T), np.ndarray)
|
| 33 |
+
|
| 34 |
+
assert_type(np.strings.less(AR_U, AR_U), np.ndarray)
|
| 35 |
+
assert_type(np.strings.less(AR_S, AR_S), np.ndarray)
|
| 36 |
+
assert_type(np.strings.less(AR_T, AR_T), np.ndarray)
|
| 37 |
+
|
| 38 |
+
assert_type(np.strings.add(AR_U, AR_U), np.ndarray)
|
| 39 |
+
assert_type(np.strings.add(AR_S, AR_S), np.ndarray)
|
| 40 |
+
assert_type(np.strings.add(AR_T, AR_T), np.ndarray)
|
| 41 |
+
|
| 42 |
+
assert_type(np.strings.multiply(AR_U, 5), npt.NDArray[np.str_])
|
| 43 |
+
assert_type(np.strings.multiply(AR_S, [5, 4, 3]), npt.NDArray[np.bytes_])
|
| 44 |
+
assert_type(np.strings.multiply(AR_T, 5), AR_T_alias)
|
| 45 |
+
|
| 46 |
+
assert_type(np.strings.mod(AR_U, "test"), npt.NDArray[np.str_])
|
| 47 |
+
assert_type(np.strings.mod(AR_S, "test"), npt.NDArray[np.bytes_])
|
| 48 |
+
assert_type(np.strings.mod(AR_T, "test"), AR_T_alias)
|
| 49 |
+
|
| 50 |
+
assert_type(np.strings.capitalize(AR_U), npt.NDArray[np.str_])
|
| 51 |
+
assert_type(np.strings.capitalize(AR_S), npt.NDArray[np.bytes_])
|
| 52 |
+
assert_type(np.strings.capitalize(AR_T), AR_T_alias)
|
| 53 |
+
|
| 54 |
+
assert_type(np.strings.center(AR_U, 5), npt.NDArray[np.str_])
|
| 55 |
+
assert_type(np.strings.center(AR_S, [2, 3, 4], b"a"), npt.NDArray[np.bytes_])
|
| 56 |
+
assert_type(np.strings.center(AR_T, 5), AR_T_alias)
|
| 57 |
+
|
| 58 |
+
assert_type(np.strings.encode(AR_U), npt.NDArray[np.bytes_])
|
| 59 |
+
assert_type(np.strings.encode(AR_T), npt.NDArray[np.bytes_])
|
| 60 |
+
assert_type(np.strings.decode(AR_S), npt.NDArray[np.str_])
|
| 61 |
+
|
| 62 |
+
assert_type(np.strings.expandtabs(AR_U), npt.NDArray[np.str_])
|
| 63 |
+
assert_type(np.strings.expandtabs(AR_S, tabsize=4), npt.NDArray[np.bytes_])
|
| 64 |
+
assert_type(np.strings.expandtabs(AR_T), AR_T_alias)
|
| 65 |
+
|
| 66 |
+
assert_type(np.strings.ljust(AR_U, 5), npt.NDArray[np.str_])
|
| 67 |
+
assert_type(np.strings.ljust(AR_S, [4, 3, 1], fillchar=[b"a", b"b", b"c"]), npt.NDArray[np.bytes_])
|
| 68 |
+
assert_type(np.strings.ljust(AR_T, 5), AR_T_alias)
|
| 69 |
+
assert_type(np.strings.ljust(AR_T, [4, 2, 1], fillchar=["a", "b", "c"]), AR_T_alias)
|
| 70 |
+
|
| 71 |
+
assert_type(np.strings.rjust(AR_U, 5), npt.NDArray[np.str_])
|
| 72 |
+
assert_type(np.strings.rjust(AR_S, [4, 3, 1], fillchar=[b"a", b"b", b"c"]), npt.NDArray[np.bytes_])
|
| 73 |
+
assert_type(np.strings.rjust(AR_T, 5), AR_T_alias)
|
| 74 |
+
assert_type(np.strings.rjust(AR_T, [4, 2, 1], fillchar=["a", "b", "c"]), AR_T_alias)
|
| 75 |
+
|
| 76 |
+
assert_type(np.strings.lstrip(AR_U), npt.NDArray[np.str_])
|
| 77 |
+
assert_type(np.strings.lstrip(AR_S, b"_"), npt.NDArray[np.bytes_])
|
| 78 |
+
assert_type(np.strings.lstrip(AR_T), AR_T_alias)
|
| 79 |
+
assert_type(np.strings.lstrip(AR_T, "_"), AR_T_alias)
|
| 80 |
+
|
| 81 |
+
assert_type(np.strings.rstrip(AR_U), npt.NDArray[np.str_])
|
| 82 |
+
assert_type(np.strings.rstrip(AR_S, b"_"), npt.NDArray[np.bytes_])
|
| 83 |
+
assert_type(np.strings.rstrip(AR_T), AR_T_alias)
|
| 84 |
+
assert_type(np.strings.rstrip(AR_T, "_"), AR_T_alias)
|
| 85 |
+
|
| 86 |
+
assert_type(np.strings.strip(AR_U), npt.NDArray[np.str_])
|
| 87 |
+
assert_type(np.strings.strip(AR_S, b"_"), npt.NDArray[np.bytes_])
|
| 88 |
+
assert_type(np.strings.strip(AR_T), AR_T_alias)
|
| 89 |
+
assert_type(np.strings.strip(AR_T, "_"), AR_T_alias)
|
| 90 |
+
|
| 91 |
+
assert_type(np.strings.count(AR_U, "a", start=[1, 2, 3]), npt.NDArray[np.int_])
|
| 92 |
+
assert_type(np.strings.count(AR_S, [b"a", b"b", b"c"], end=9), npt.NDArray[np.int_])
|
| 93 |
+
assert_type(np.strings.count(AR_T, "a", start=[1, 2, 3]), npt.NDArray[np.int_])
|
| 94 |
+
assert_type(np.strings.count(AR_T, ["a", "b", "c"], end=9), npt.NDArray[np.int_])
|
| 95 |
+
|
| 96 |
+
type _tuple3[T] = tuple[T, T, T]
|
| 97 |
+
|
| 98 |
+
assert_type(np.strings.partition(AR_U, "\n"), _tuple3[npt.NDArray[np.str_]])
|
| 99 |
+
assert_type(np.strings.partition(AR_S, [b"a", b"b", b"c"]), _tuple3[npt.NDArray[np.bytes_]])
|
| 100 |
+
assert_type(np.strings.partition(AR_T, "\n"), _tuple3[AR_TU_alias])
|
| 101 |
+
|
| 102 |
+
assert_type(np.strings.rpartition(AR_U, "\n"), _tuple3[npt.NDArray[np.str_]])
|
| 103 |
+
assert_type(np.strings.rpartition(AR_S, [b"a", b"b", b"c"]), _tuple3[npt.NDArray[np.bytes_]])
|
| 104 |
+
assert_type(np.strings.rpartition(AR_T, "\n"), _tuple3[AR_TU_alias])
|
| 105 |
+
|
| 106 |
+
assert_type(np.strings.replace(AR_U, "_", "-"), npt.NDArray[np.str_])
|
| 107 |
+
assert_type(np.strings.replace(AR_S, [b"_", b""], [b"a", b"b"]), npt.NDArray[np.bytes_])
|
| 108 |
+
assert_type(np.strings.replace(AR_T, "_", "_"), AR_TU_alias)
|
| 109 |
+
|
| 110 |
+
assert_type(np.strings.lower(AR_U), npt.NDArray[np.str_])
|
| 111 |
+
assert_type(np.strings.lower(AR_S), npt.NDArray[np.bytes_])
|
| 112 |
+
assert_type(np.strings.lower(AR_T), AR_T_alias)
|
| 113 |
+
|
| 114 |
+
assert_type(np.strings.upper(AR_U), npt.NDArray[np.str_])
|
| 115 |
+
assert_type(np.strings.upper(AR_S), npt.NDArray[np.bytes_])
|
| 116 |
+
assert_type(np.strings.upper(AR_T), AR_T_alias)
|
| 117 |
+
|
| 118 |
+
assert_type(np.strings.swapcase(AR_U), npt.NDArray[np.str_])
|
| 119 |
+
assert_type(np.strings.swapcase(AR_S), npt.NDArray[np.bytes_])
|
| 120 |
+
assert_type(np.strings.swapcase(AR_T), AR_T_alias)
|
| 121 |
+
|
| 122 |
+
assert_type(np.strings.title(AR_U), npt.NDArray[np.str_])
|
| 123 |
+
assert_type(np.strings.title(AR_S), npt.NDArray[np.bytes_])
|
| 124 |
+
assert_type(np.strings.title(AR_T), AR_T_alias)
|
| 125 |
+
|
| 126 |
+
assert_type(np.strings.zfill(AR_U, 5), npt.NDArray[np.str_])
|
| 127 |
+
assert_type(np.strings.zfill(AR_S, [2, 3, 4]), npt.NDArray[np.bytes_])
|
| 128 |
+
assert_type(np.strings.zfill(AR_T, 5), AR_T_alias)
|
| 129 |
+
|
| 130 |
+
assert_type(np.strings.endswith(AR_U, "a", start=[1, 2, 3]), npt.NDArray[np.bool])
|
| 131 |
+
assert_type(np.strings.endswith(AR_S, [b"a", b"b", b"c"], end=9), npt.NDArray[np.bool])
|
| 132 |
+
assert_type(np.strings.endswith(AR_T, "a", start=[1, 2, 3]), npt.NDArray[np.bool])
|
| 133 |
+
|
| 134 |
+
assert_type(np.strings.startswith(AR_U, "a", start=[1, 2, 3]), npt.NDArray[np.bool])
|
| 135 |
+
assert_type(np.strings.startswith(AR_S, [b"a", b"b", b"c"], end=9), npt.NDArray[np.bool])
|
| 136 |
+
assert_type(np.strings.startswith(AR_T, "a", start=[1, 2, 3]), npt.NDArray[np.bool])
|
| 137 |
+
|
| 138 |
+
assert_type(np.strings.find(AR_U, "a", start=[1, 2, 3]), npt.NDArray[np.int_])
|
| 139 |
+
assert_type(np.strings.find(AR_S, [b"a", b"b", b"c"], end=9), npt.NDArray[np.int_])
|
| 140 |
+
assert_type(np.strings.find(AR_T, "a", start=[1, 2, 3]), npt.NDArray[np.int_])
|
| 141 |
+
|
| 142 |
+
assert_type(np.strings.rfind(AR_U, "a", start=[1, 2, 3]), npt.NDArray[np.int_])
|
| 143 |
+
assert_type(np.strings.rfind(AR_S, [b"a", b"b", b"c"], end=9), npt.NDArray[np.int_])
|
| 144 |
+
assert_type(np.strings.rfind(AR_T, "a", start=[1, 2, 3]), npt.NDArray[np.int_])
|
| 145 |
+
|
| 146 |
+
assert_type(np.strings.index(AR_U, "a", start=[1, 2, 3]), npt.NDArray[np.int_])
|
| 147 |
+
assert_type(np.strings.index(AR_S, [b"a", b"b", b"c"], end=9), npt.NDArray[np.int_])
|
| 148 |
+
assert_type(np.strings.index(AR_T, "a", start=[1, 2, 3]), npt.NDArray[np.int_])
|
| 149 |
+
|
| 150 |
+
assert_type(np.strings.rindex(AR_U, "a", start=[1, 2, 3]), npt.NDArray[np.int_])
|
| 151 |
+
assert_type(np.strings.rindex(AR_S, [b"a", b"b", b"c"], end=9), npt.NDArray[np.int_])
|
| 152 |
+
assert_type(np.strings.rindex(AR_T, "a", start=[1, 2, 3]), npt.NDArray[np.int_])
|
| 153 |
+
|
| 154 |
+
assert_type(np.strings.isalpha(AR_U), np.ndarray)
|
| 155 |
+
assert_type(np.strings.isalpha(AR_S), np.ndarray)
|
| 156 |
+
assert_type(np.strings.isalpha(AR_T), np.ndarray)
|
| 157 |
+
|
| 158 |
+
assert_type(np.strings.isalnum(AR_U), np.ndarray)
|
| 159 |
+
assert_type(np.strings.isalnum(AR_S), np.ndarray)
|
| 160 |
+
assert_type(np.strings.isalnum(AR_T), np.ndarray)
|
| 161 |
+
|
| 162 |
+
assert_type(np.strings.isdecimal(AR_U), np.ndarray)
|
| 163 |
+
assert_type(np.strings.isdecimal(AR_T), np.ndarray)
|
| 164 |
+
|
| 165 |
+
assert_type(np.strings.isdigit(AR_U), np.ndarray)
|
| 166 |
+
assert_type(np.strings.isdigit(AR_S), np.ndarray)
|
| 167 |
+
assert_type(np.strings.isdigit(AR_T), np.ndarray)
|
| 168 |
+
|
| 169 |
+
assert_type(np.strings.islower(AR_U), np.ndarray)
|
| 170 |
+
assert_type(np.strings.islower(AR_S), np.ndarray)
|
| 171 |
+
assert_type(np.strings.islower(AR_T), np.ndarray)
|
| 172 |
+
|
| 173 |
+
assert_type(np.strings.isnumeric(AR_U), np.ndarray)
|
| 174 |
+
assert_type(np.strings.isnumeric(AR_T), np.ndarray)
|
| 175 |
+
|
| 176 |
+
assert_type(np.strings.isspace(AR_U), np.ndarray)
|
| 177 |
+
assert_type(np.strings.isspace(AR_S), np.ndarray)
|
| 178 |
+
assert_type(np.strings.isspace(AR_T), np.ndarray)
|
| 179 |
+
|
| 180 |
+
assert_type(np.strings.istitle(AR_U), np.ndarray)
|
| 181 |
+
assert_type(np.strings.istitle(AR_S), np.ndarray)
|
| 182 |
+
assert_type(np.strings.istitle(AR_T), np.ndarray)
|
| 183 |
+
|
| 184 |
+
assert_type(np.strings.isupper(AR_U), np.ndarray)
|
| 185 |
+
assert_type(np.strings.isupper(AR_S), np.ndarray)
|
| 186 |
+
assert_type(np.strings.isupper(AR_T), np.ndarray)
|
| 187 |
+
|
| 188 |
+
assert_type(np.strings.str_len(AR_U), np.ndarray)
|
| 189 |
+
assert_type(np.strings.str_len(AR_S), np.ndarray)
|
| 190 |
+
assert_type(np.strings.str_len(AR_T), np.ndarray)
|
| 191 |
+
|
| 192 |
+
assert_type(np.strings.translate(AR_U, ""), npt.NDArray[np.str_])
|
| 193 |
+
assert_type(np.strings.translate(AR_S, ""), npt.NDArray[np.bytes_])
|
| 194 |
+
assert_type(np.strings.translate(AR_T, ""), AR_T_alias)
|
| 195 |
+
|
| 196 |
+
assert_type(np.strings.slice(AR_U, 1, 5, 2), npt.NDArray[np.str_])
|
| 197 |
+
assert_type(np.strings.slice(AR_S, 1, 5, 2), npt.NDArray[np.bytes_])
|
| 198 |
+
assert_type(np.strings.slice(AR_T, 1, 5, 2), AR_T_alias)
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/testing.pyi
ADDED
|
@@ -0,0 +1,196 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import contextlib
|
| 2 |
+
import re
|
| 3 |
+
import sys
|
| 4 |
+
import types
|
| 5 |
+
import unittest
|
| 6 |
+
import warnings
|
| 7 |
+
from collections.abc import Callable
|
| 8 |
+
from pathlib import Path
|
| 9 |
+
from typing import Any, assert_type
|
| 10 |
+
|
| 11 |
+
import numpy as np
|
| 12 |
+
import numpy.typing as npt
|
| 13 |
+
|
| 14 |
+
AR_f8: npt.NDArray[np.float64]
|
| 15 |
+
AR_i8: npt.NDArray[np.int64]
|
| 16 |
+
|
| 17 |
+
bool_obj: bool
|
| 18 |
+
suppress_obj: np.testing.suppress_warnings # type: ignore[deprecated] # pyright: ignore[reportDeprecated]
|
| 19 |
+
|
| 20 |
+
def func() -> int: ...
|
| 21 |
+
|
| 22 |
+
def func2(
|
| 23 |
+
x: npt.NDArray[np.number],
|
| 24 |
+
y: npt.NDArray[np.number],
|
| 25 |
+
) -> npt.NDArray[np.bool]: ...
|
| 26 |
+
|
| 27 |
+
assert_type(np.testing.KnownFailureException(), np.testing.KnownFailureException)
|
| 28 |
+
assert_type(np.testing.IgnoreException(), np.testing.IgnoreException)
|
| 29 |
+
|
| 30 |
+
assert_type(
|
| 31 |
+
np.testing.clear_and_catch_warnings(modules=[np.testing]),
|
| 32 |
+
np.testing.clear_and_catch_warnings[None],
|
| 33 |
+
)
|
| 34 |
+
assert_type(
|
| 35 |
+
np.testing.clear_and_catch_warnings(True),
|
| 36 |
+
np.testing.clear_and_catch_warnings[list[warnings.WarningMessage]],
|
| 37 |
+
)
|
| 38 |
+
assert_type(
|
| 39 |
+
np.testing.clear_and_catch_warnings(False),
|
| 40 |
+
np.testing.clear_and_catch_warnings[None],
|
| 41 |
+
)
|
| 42 |
+
assert_type(
|
| 43 |
+
np.testing.clear_and_catch_warnings(bool_obj),
|
| 44 |
+
np.testing.clear_and_catch_warnings,
|
| 45 |
+
)
|
| 46 |
+
assert_type(
|
| 47 |
+
np.testing.clear_and_catch_warnings.class_modules,
|
| 48 |
+
tuple[types.ModuleType, ...],
|
| 49 |
+
)
|
| 50 |
+
assert_type(
|
| 51 |
+
np.testing.clear_and_catch_warnings.modules,
|
| 52 |
+
set[types.ModuleType],
|
| 53 |
+
)
|
| 54 |
+
|
| 55 |
+
with np.testing.clear_and_catch_warnings(True) as c1:
|
| 56 |
+
assert_type(c1, list[warnings.WarningMessage])
|
| 57 |
+
with np.testing.clear_and_catch_warnings() as c2:
|
| 58 |
+
assert_type(c2, None)
|
| 59 |
+
|
| 60 |
+
assert_type(np.testing.suppress_warnings("once"), np.testing.suppress_warnings) # type: ignore[deprecated] # pyright: ignore[reportDeprecated]
|
| 61 |
+
assert_type(np.testing.suppress_warnings()(func), Callable[[], int]) # type: ignore[deprecated] # pyright: ignore[reportDeprecated]
|
| 62 |
+
assert_type(suppress_obj.filter(RuntimeWarning), None)
|
| 63 |
+
assert_type(suppress_obj.record(RuntimeWarning), list[warnings.WarningMessage])
|
| 64 |
+
with suppress_obj as c3:
|
| 65 |
+
assert_type(c3, np.testing.suppress_warnings) # type: ignore[deprecated] # pyright: ignore[reportDeprecated]
|
| 66 |
+
|
| 67 |
+
assert_type(np.testing.verbose, int)
|
| 68 |
+
assert_type(np.testing.HAS_REFCOUNT, bool)
|
| 69 |
+
assert_type(np.testing.HAS_LAPACK64, bool)
|
| 70 |
+
|
| 71 |
+
assert_type(np.testing.assert_(1, msg="test"), None)
|
| 72 |
+
assert_type(np.testing.assert_(2, msg=lambda: "test"), None)
|
| 73 |
+
|
| 74 |
+
if sys.platform == "win32" or sys.platform == "cygwin":
|
| 75 |
+
assert_type(np.testing.memusage(), int)
|
| 76 |
+
elif sys.platform == "linux":
|
| 77 |
+
assert_type(np.testing.memusage(), int | None)
|
| 78 |
+
|
| 79 |
+
assert_type(np.testing.jiffies(), int)
|
| 80 |
+
|
| 81 |
+
assert_type(np.testing.build_err_msg([0, 1, 2], "test"), str)
|
| 82 |
+
assert_type(np.testing.build_err_msg(range(2), "test", header="header"), str)
|
| 83 |
+
assert_type(np.testing.build_err_msg(np.arange(9).reshape(3, 3), "test", verbose=False), str)
|
| 84 |
+
assert_type(np.testing.build_err_msg("abc", "test", names=["x", "y"]), str)
|
| 85 |
+
assert_type(np.testing.build_err_msg([1.0, 2.0], "test", precision=5), str)
|
| 86 |
+
|
| 87 |
+
assert_type(np.testing.assert_equal({1}, {1}), None)
|
| 88 |
+
assert_type(np.testing.assert_equal([1, 2, 3], [1, 2, 3], err_msg="fail"), None)
|
| 89 |
+
assert_type(np.testing.assert_equal(1, 1.0, verbose=True), None)
|
| 90 |
+
|
| 91 |
+
assert_type(np.testing.print_assert_equal("Test XYZ of func xyz", [0, 1], [0, 1]), None)
|
| 92 |
+
|
| 93 |
+
assert_type(np.testing.assert_almost_equal(1.0, 1.1), None)
|
| 94 |
+
assert_type(np.testing.assert_almost_equal([1, 2, 3], [1, 2, 3], err_msg="fail"), None)
|
| 95 |
+
assert_type(np.testing.assert_almost_equal(1, 1.0, verbose=True), None)
|
| 96 |
+
assert_type(np.testing.assert_almost_equal(1, 1.0001, decimal=2), None)
|
| 97 |
+
|
| 98 |
+
assert_type(np.testing.assert_approx_equal(1.0, 1.1), None)
|
| 99 |
+
assert_type(np.testing.assert_approx_equal("1", "2", err_msg="fail"), None)
|
| 100 |
+
assert_type(np.testing.assert_approx_equal(1, 1.0, verbose=True), None)
|
| 101 |
+
assert_type(np.testing.assert_approx_equal(1, 1.0001, significant=2), None)
|
| 102 |
+
|
| 103 |
+
assert_type(np.testing.assert_array_compare(func2, AR_i8, AR_f8, err_msg="test"), None)
|
| 104 |
+
assert_type(np.testing.assert_array_compare(func2, AR_i8, AR_f8, verbose=True), None)
|
| 105 |
+
assert_type(np.testing.assert_array_compare(func2, AR_i8, AR_f8, header="header"), None)
|
| 106 |
+
assert_type(np.testing.assert_array_compare(func2, AR_i8, AR_f8, precision=np.int64()), None)
|
| 107 |
+
assert_type(np.testing.assert_array_compare(func2, AR_i8, AR_f8, equal_nan=False), None)
|
| 108 |
+
assert_type(np.testing.assert_array_compare(func2, AR_i8, AR_f8, equal_inf=True), None)
|
| 109 |
+
|
| 110 |
+
assert_type(np.testing.assert_array_equal(AR_i8, AR_f8), None)
|
| 111 |
+
assert_type(np.testing.assert_array_equal(AR_i8, AR_f8, err_msg="test"), None)
|
| 112 |
+
assert_type(np.testing.assert_array_equal(AR_i8, AR_f8, verbose=True), None)
|
| 113 |
+
|
| 114 |
+
assert_type(np.testing.assert_array_almost_equal(AR_i8, AR_f8), None)
|
| 115 |
+
assert_type(np.testing.assert_array_almost_equal(AR_i8, AR_f8, err_msg="test"), None)
|
| 116 |
+
assert_type(np.testing.assert_array_almost_equal(AR_i8, AR_f8, verbose=True), None)
|
| 117 |
+
assert_type(np.testing.assert_array_almost_equal(AR_i8, AR_f8, decimal=1), None)
|
| 118 |
+
|
| 119 |
+
assert_type(np.testing.assert_array_less(AR_i8, AR_f8), None)
|
| 120 |
+
assert_type(np.testing.assert_array_less(AR_i8, AR_f8, err_msg="test"), None)
|
| 121 |
+
assert_type(np.testing.assert_array_less(AR_i8, AR_f8, verbose=True), None)
|
| 122 |
+
|
| 123 |
+
assert_type(np.testing.runstring("1 + 1", {}), Any)
|
| 124 |
+
assert_type(np.testing.runstring("int64() + 1", {"int64": np.int64}), Any)
|
| 125 |
+
|
| 126 |
+
assert_type(np.testing.assert_string_equal("1", "1"), None)
|
| 127 |
+
|
| 128 |
+
assert_type(np.testing.rundocs(), None)
|
| 129 |
+
assert_type(np.testing.rundocs("test.py"), None)
|
| 130 |
+
assert_type(np.testing.rundocs(Path("test.py"), raise_on_error=True), None)
|
| 131 |
+
|
| 132 |
+
def func3(a: int) -> bool: ...
|
| 133 |
+
|
| 134 |
+
assert_type(
|
| 135 |
+
np.testing.assert_raises(RuntimeWarning),
|
| 136 |
+
unittest.case._AssertRaisesContext[RuntimeWarning],
|
| 137 |
+
)
|
| 138 |
+
assert_type(np.testing.assert_raises(RuntimeWarning, func3, 5), None)
|
| 139 |
+
|
| 140 |
+
assert_type(
|
| 141 |
+
np.testing.assert_raises_regex(RuntimeWarning, r"test"),
|
| 142 |
+
unittest.case._AssertRaisesContext[RuntimeWarning],
|
| 143 |
+
)
|
| 144 |
+
assert_type(np.testing.assert_raises_regex(RuntimeWarning, b"test", func3, 5), None)
|
| 145 |
+
assert_type(np.testing.assert_raises_regex(RuntimeWarning, re.compile(b"test"), func3, 5), None)
|
| 146 |
+
|
| 147 |
+
class Test: ...
|
| 148 |
+
|
| 149 |
+
def decorate[FT: Callable[..., Any]](a: FT) -> FT:
|
| 150 |
+
return a
|
| 151 |
+
|
| 152 |
+
assert_type(np.testing.decorate_methods(Test, decorate), None)
|
| 153 |
+
assert_type(np.testing.decorate_methods(Test, decorate, None), None)
|
| 154 |
+
assert_type(np.testing.decorate_methods(Test, decorate, "test"), None)
|
| 155 |
+
assert_type(np.testing.decorate_methods(Test, decorate, b"test"), None)
|
| 156 |
+
assert_type(np.testing.decorate_methods(Test, decorate, re.compile("test")), None)
|
| 157 |
+
|
| 158 |
+
assert_type(np.testing.measure("for i in range(1000): np.sqrt(i**2)"), float)
|
| 159 |
+
assert_type(np.testing.measure(b"for i in range(1000): np.sqrt(i**2)", times=5), float)
|
| 160 |
+
|
| 161 |
+
assert_type(np.testing.assert_allclose(AR_i8, AR_f8), None)
|
| 162 |
+
assert_type(np.testing.assert_allclose(AR_i8, AR_f8, rtol=0.005), None)
|
| 163 |
+
assert_type(np.testing.assert_allclose(AR_i8, AR_f8, atol=1), None)
|
| 164 |
+
assert_type(np.testing.assert_allclose(AR_i8, AR_f8, equal_nan=True), None)
|
| 165 |
+
assert_type(np.testing.assert_allclose(AR_i8, AR_f8, err_msg="err"), None)
|
| 166 |
+
assert_type(np.testing.assert_allclose(AR_i8, AR_f8, verbose=False), None)
|
| 167 |
+
|
| 168 |
+
assert_type(np.testing.assert_array_almost_equal_nulp(AR_i8, AR_f8, nulp=2), None)
|
| 169 |
+
|
| 170 |
+
assert_type(np.testing.assert_array_max_ulp(AR_i8, AR_f8, maxulp=2), npt.NDArray[Any])
|
| 171 |
+
assert_type(np.testing.assert_array_max_ulp(AR_i8, AR_f8, dtype=np.float32), npt.NDArray[Any])
|
| 172 |
+
|
| 173 |
+
assert_type(np.testing.assert_warns(RuntimeWarning), contextlib._GeneratorContextManager[None]) # type: ignore[deprecated] # pyright: ignore[reportDeprecated]
|
| 174 |
+
assert_type(np.testing.assert_warns(RuntimeWarning, func3, 5), bool) # type: ignore[deprecated] # pyright: ignore[reportDeprecated]
|
| 175 |
+
|
| 176 |
+
def func4(a: int, b: str) -> bool: ...
|
| 177 |
+
|
| 178 |
+
assert_type(np.testing.assert_no_warnings(), contextlib._GeneratorContextManager[None])
|
| 179 |
+
assert_type(np.testing.assert_no_warnings(func3, 5), bool)
|
| 180 |
+
assert_type(np.testing.assert_no_warnings(func4, a=1, b="test"), bool)
|
| 181 |
+
assert_type(np.testing.assert_no_warnings(func4, 1, "test"), bool)
|
| 182 |
+
|
| 183 |
+
assert_type(np.testing.tempdir("test_dir"), contextlib._GeneratorContextManager[str])
|
| 184 |
+
assert_type(np.testing.tempdir(prefix=b"test"), contextlib._GeneratorContextManager[bytes])
|
| 185 |
+
assert_type(np.testing.tempdir("test_dir", dir=Path("here")), contextlib._GeneratorContextManager[str])
|
| 186 |
+
|
| 187 |
+
assert_type(np.testing.temppath("test_dir", text=True), contextlib._GeneratorContextManager[str])
|
| 188 |
+
assert_type(np.testing.temppath(prefix=b"test"), contextlib._GeneratorContextManager[bytes])
|
| 189 |
+
assert_type(np.testing.temppath("test_dir", dir=Path("here")), contextlib._GeneratorContextManager[str])
|
| 190 |
+
|
| 191 |
+
assert_type(np.testing.assert_no_gc_cycles(), contextlib._GeneratorContextManager[None])
|
| 192 |
+
assert_type(np.testing.assert_no_gc_cycles(func3, 5), None)
|
| 193 |
+
|
| 194 |
+
assert_type(np.testing.break_cycles(), None)
|
| 195 |
+
|
| 196 |
+
assert_type(np.testing.TestCase(), unittest.case.TestCase)
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/twodim_base.pyi
ADDED
|
@@ -0,0 +1,231 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import Any, assert_type, type_check_only
|
| 2 |
+
|
| 3 |
+
import numpy as np
|
| 4 |
+
import numpy.typing as npt
|
| 5 |
+
|
| 6 |
+
type _1D = tuple[int]
|
| 7 |
+
type _2D = tuple[int, int]
|
| 8 |
+
type _3D = tuple[int, int, int]
|
| 9 |
+
type _ND = tuple[Any, ...]
|
| 10 |
+
|
| 11 |
+
type _Indices2D = tuple[
|
| 12 |
+
np.ndarray[_1D, np.dtype[np.intp]],
|
| 13 |
+
np.ndarray[_1D, np.dtype[np.intp]],
|
| 14 |
+
]
|
| 15 |
+
|
| 16 |
+
###
|
| 17 |
+
|
| 18 |
+
_nd_bool: np.ndarray[_ND, np.dtype[np.bool]]
|
| 19 |
+
_1d_bool: np.ndarray[_1D, np.dtype[np.bool]]
|
| 20 |
+
_2d_bool: np.ndarray[_2D, np.dtype[np.bool]]
|
| 21 |
+
_3d_bool: np.ndarray[_3D, np.dtype[np.bool]]
|
| 22 |
+
_nd_u64: np.ndarray[_ND, np.dtype[np.uint64]]
|
| 23 |
+
_nd_i64: np.ndarray[_ND, np.dtype[np.int64]]
|
| 24 |
+
_nd_f64: np.ndarray[_ND, np.dtype[np.float64]]
|
| 25 |
+
_nd_c128: np.ndarray[_ND, np.dtype[np.complex128]]
|
| 26 |
+
_nd_obj: np.ndarray[_ND, np.dtype[np.object_]]
|
| 27 |
+
|
| 28 |
+
_to_nd_bool: list[bool] | list[list[bool]]
|
| 29 |
+
_to_1d_bool: list[bool]
|
| 30 |
+
_to_2d_bool: list[list[bool]]
|
| 31 |
+
|
| 32 |
+
_to_1d_f64: list[float]
|
| 33 |
+
_to_1d_c128: list[complex]
|
| 34 |
+
|
| 35 |
+
@type_check_only
|
| 36 |
+
def func1[ScalarT: np.generic](ar: npt.NDArray[ScalarT], a: int) -> npt.NDArray[ScalarT]: ...
|
| 37 |
+
@type_check_only
|
| 38 |
+
def func2(ar: npt.NDArray[np.number], a: str) -> npt.NDArray[np.float64]: ...
|
| 39 |
+
|
| 40 |
+
@type_check_only
|
| 41 |
+
class _Cube:
|
| 42 |
+
shape = 3, 4
|
| 43 |
+
ndim = 2
|
| 44 |
+
|
| 45 |
+
###
|
| 46 |
+
|
| 47 |
+
# fliplr
|
| 48 |
+
assert_type(np.fliplr(_nd_bool), np.ndarray[_ND, np.dtype[np.bool]])
|
| 49 |
+
assert_type(np.fliplr(_1d_bool), np.ndarray[_1D, np.dtype[np.bool]])
|
| 50 |
+
assert_type(np.fliplr(_2d_bool), np.ndarray[_2D, np.dtype[np.bool]])
|
| 51 |
+
assert_type(np.fliplr(_to_nd_bool), np.ndarray)
|
| 52 |
+
assert_type(np.fliplr(_to_1d_bool), np.ndarray)
|
| 53 |
+
assert_type(np.fliplr(_to_2d_bool), np.ndarray)
|
| 54 |
+
|
| 55 |
+
# flipud
|
| 56 |
+
assert_type(np.flipud(_nd_bool), np.ndarray[_ND, np.dtype[np.bool]])
|
| 57 |
+
assert_type(np.flipud(_1d_bool), np.ndarray[_1D, np.dtype[np.bool]])
|
| 58 |
+
assert_type(np.flipud(_2d_bool), np.ndarray[_2D, np.dtype[np.bool]])
|
| 59 |
+
assert_type(np.flipud(_to_nd_bool), np.ndarray)
|
| 60 |
+
assert_type(np.flipud(_to_1d_bool), np.ndarray)
|
| 61 |
+
assert_type(np.flipud(_to_2d_bool), np.ndarray)
|
| 62 |
+
|
| 63 |
+
# eye
|
| 64 |
+
assert_type(np.eye(10), np.ndarray[_2D, np.dtype[np.float64]])
|
| 65 |
+
assert_type(np.eye(10, M=20, dtype=np.int64), np.ndarray[_2D, np.dtype[np.int64]])
|
| 66 |
+
assert_type(np.eye(10, k=2, dtype=int), np.ndarray[_2D])
|
| 67 |
+
|
| 68 |
+
# diag
|
| 69 |
+
assert_type(np.diag(_nd_bool), np.ndarray[_ND, np.dtype[np.bool]])
|
| 70 |
+
assert_type(np.diag(_1d_bool), np.ndarray[_2D, np.dtype[np.bool]])
|
| 71 |
+
assert_type(np.diag(_2d_bool), np.ndarray[_1D, np.dtype[np.bool]])
|
| 72 |
+
assert_type(np.diag(_to_nd_bool, k=0), np.ndarray)
|
| 73 |
+
assert_type(np.diag(_to_1d_bool, k=0), np.ndarray[_2D])
|
| 74 |
+
assert_type(np.diag(_to_2d_bool, k=0), np.ndarray[_1D])
|
| 75 |
+
|
| 76 |
+
# diagflat
|
| 77 |
+
assert_type(np.diagflat(_nd_bool), np.ndarray[_2D, np.dtype[np.bool]])
|
| 78 |
+
assert_type(np.diagflat(_1d_bool), np.ndarray[_2D, np.dtype[np.bool]])
|
| 79 |
+
assert_type(np.diagflat(_2d_bool), np.ndarray[_2D, np.dtype[np.bool]])
|
| 80 |
+
assert_type(np.diagflat(_to_nd_bool, k=0), np.ndarray[_2D])
|
| 81 |
+
assert_type(np.diagflat(_to_1d_bool, k=0), np.ndarray[_2D])
|
| 82 |
+
assert_type(np.diagflat(_to_2d_bool, k=0), np.ndarray[_2D])
|
| 83 |
+
|
| 84 |
+
# tri
|
| 85 |
+
assert_type(np.tri(10), np.ndarray[_2D, np.dtype[np.float64]])
|
| 86 |
+
assert_type(np.tri(10, M=20, dtype=np.int64), np.ndarray[_2D, np.dtype[np.int64]])
|
| 87 |
+
assert_type(np.tri(10, k=2, dtype=int), np.ndarray[_2D])
|
| 88 |
+
|
| 89 |
+
# tril
|
| 90 |
+
assert_type(np.tril(_nd_bool), np.ndarray[_ND, np.dtype[np.bool]])
|
| 91 |
+
assert_type(np.tril(_to_nd_bool, k=0), np.ndarray)
|
| 92 |
+
assert_type(np.tril(_to_1d_bool, k=0), np.ndarray)
|
| 93 |
+
assert_type(np.tril(_to_2d_bool, k=0), np.ndarray)
|
| 94 |
+
assert_type(np.tril(_1d_bool, k=0), np.ndarray[_2D, np.dtype[np.bool]])
|
| 95 |
+
assert_type(np.tril(_2d_bool, k=0), np.ndarray[_2D, np.dtype[np.bool]])
|
| 96 |
+
assert_type(np.tril(_3d_bool, k=0), np.ndarray[_3D, np.dtype[np.bool]])
|
| 97 |
+
|
| 98 |
+
# triu
|
| 99 |
+
assert_type(np.triu(_nd_bool), np.ndarray[_ND, np.dtype[np.bool]])
|
| 100 |
+
assert_type(np.triu(_to_nd_bool, k=0), np.ndarray)
|
| 101 |
+
assert_type(np.triu(_to_1d_bool, k=0), np.ndarray)
|
| 102 |
+
assert_type(np.triu(_to_2d_bool, k=0), np.ndarray)
|
| 103 |
+
assert_type(np.triu(_1d_bool, k=0), np.ndarray[_2D, np.dtype[np.bool]])
|
| 104 |
+
assert_type(np.triu(_2d_bool, k=0), np.ndarray[_2D, np.dtype[np.bool]])
|
| 105 |
+
assert_type(np.triu(_3d_bool, k=0), np.ndarray[_3D, np.dtype[np.bool]])
|
| 106 |
+
|
| 107 |
+
# vander
|
| 108 |
+
assert_type(np.vander(_nd_bool), np.ndarray[_2D, np.dtype[np.int_]])
|
| 109 |
+
assert_type(np.vander(_nd_u64), np.ndarray[_2D, np.dtype[np.uint64]])
|
| 110 |
+
assert_type(np.vander(_nd_i64, N=2), np.ndarray[_2D, np.dtype[np.int64]])
|
| 111 |
+
assert_type(np.vander(_nd_f64, increasing=True), np.ndarray[_2D, np.dtype[np.float64]])
|
| 112 |
+
assert_type(np.vander(_nd_c128), np.ndarray[_2D, np.dtype[np.complex128]])
|
| 113 |
+
assert_type(np.vander(_nd_obj), np.ndarray[_2D, np.dtype[np.object_]])
|
| 114 |
+
|
| 115 |
+
# histogram2d
|
| 116 |
+
assert_type(
|
| 117 |
+
np.histogram2d(_to_1d_f64, _to_1d_f64),
|
| 118 |
+
tuple[
|
| 119 |
+
np.ndarray[_2D, np.dtype[np.float64]],
|
| 120 |
+
np.ndarray[_1D, np.dtype[np.float64]],
|
| 121 |
+
np.ndarray[_1D, np.dtype[np.float64]],
|
| 122 |
+
],
|
| 123 |
+
)
|
| 124 |
+
assert_type(
|
| 125 |
+
np.histogram2d(_to_1d_c128, _to_1d_c128),
|
| 126 |
+
tuple[
|
| 127 |
+
np.ndarray[_2D, np.dtype[np.float64]],
|
| 128 |
+
np.ndarray[_1D, np.dtype[np.complex128 | Any]],
|
| 129 |
+
np.ndarray[_1D, np.dtype[np.complex128 | Any]],
|
| 130 |
+
],
|
| 131 |
+
)
|
| 132 |
+
assert_type(
|
| 133 |
+
np.histogram2d(_nd_i64, _nd_bool),
|
| 134 |
+
tuple[
|
| 135 |
+
np.ndarray[_2D, np.dtype[np.float64]],
|
| 136 |
+
np.ndarray[_1D, np.dtype[np.float64]],
|
| 137 |
+
np.ndarray[_1D, np.dtype[np.float64]],
|
| 138 |
+
],
|
| 139 |
+
)
|
| 140 |
+
assert_type(
|
| 141 |
+
np.histogram2d(_nd_f64, _nd_i64),
|
| 142 |
+
tuple[
|
| 143 |
+
np.ndarray[_2D, np.dtype[np.float64]],
|
| 144 |
+
np.ndarray[_1D, np.dtype[np.float64]],
|
| 145 |
+
np.ndarray[_1D, np.dtype[np.float64]],
|
| 146 |
+
],
|
| 147 |
+
)
|
| 148 |
+
assert_type(
|
| 149 |
+
np.histogram2d(_nd_i64, _nd_f64),
|
| 150 |
+
tuple[
|
| 151 |
+
np.ndarray[_2D, np.dtype[np.float64]],
|
| 152 |
+
np.ndarray[_1D, np.dtype[np.float64]],
|
| 153 |
+
np.ndarray[_1D, np.dtype[np.float64]],
|
| 154 |
+
],
|
| 155 |
+
)
|
| 156 |
+
assert_type(
|
| 157 |
+
np.histogram2d(_nd_f64, _nd_c128, weights=_to_1d_bool),
|
| 158 |
+
tuple[
|
| 159 |
+
np.ndarray[_2D, np.dtype[np.float64]],
|
| 160 |
+
np.ndarray[_1D, np.dtype[np.complex128]],
|
| 161 |
+
np.ndarray[_1D, np.dtype[np.complex128]],
|
| 162 |
+
],
|
| 163 |
+
)
|
| 164 |
+
assert_type(
|
| 165 |
+
np.histogram2d(_nd_f64, _nd_c128, bins=8),
|
| 166 |
+
tuple[
|
| 167 |
+
np.ndarray[_2D, np.dtype[np.float64]],
|
| 168 |
+
np.ndarray[_1D, np.dtype[np.complex128]],
|
| 169 |
+
np.ndarray[_1D, np.dtype[np.complex128]],
|
| 170 |
+
],
|
| 171 |
+
)
|
| 172 |
+
assert_type(
|
| 173 |
+
np.histogram2d(_nd_c128, _nd_f64, bins=(8, 5)),
|
| 174 |
+
tuple[
|
| 175 |
+
np.ndarray[_2D, np.dtype[np.float64]],
|
| 176 |
+
np.ndarray[_1D, np.dtype[np.complex128]],
|
| 177 |
+
np.ndarray[_1D, np.dtype[np.complex128]],
|
| 178 |
+
],
|
| 179 |
+
)
|
| 180 |
+
assert_type(
|
| 181 |
+
np.histogram2d(_nd_c128, _nd_i64, bins=_nd_u64),
|
| 182 |
+
tuple[
|
| 183 |
+
np.ndarray[_2D, np.dtype[np.float64]],
|
| 184 |
+
np.ndarray[_1D, np.dtype[np.uint64]],
|
| 185 |
+
np.ndarray[_1D, np.dtype[np.uint64]],
|
| 186 |
+
],
|
| 187 |
+
)
|
| 188 |
+
assert_type(
|
| 189 |
+
np.histogram2d(_nd_c128, _nd_c128, bins=(_nd_u64, _nd_u64)),
|
| 190 |
+
tuple[
|
| 191 |
+
np.ndarray[_2D, np.dtype[np.float64]],
|
| 192 |
+
np.ndarray[_1D, np.dtype[np.uint64]],
|
| 193 |
+
np.ndarray[_1D, np.dtype[np.uint64]],
|
| 194 |
+
],
|
| 195 |
+
)
|
| 196 |
+
assert_type(
|
| 197 |
+
np.histogram2d(_nd_c128, _nd_c128, bins=(_nd_bool, 8)),
|
| 198 |
+
tuple[
|
| 199 |
+
np.ndarray[_2D, np.dtype[np.float64]],
|
| 200 |
+
np.ndarray[_1D, np.dtype[np.complex128 | np.bool]],
|
| 201 |
+
np.ndarray[_1D, np.dtype[np.complex128 | np.bool]],
|
| 202 |
+
],
|
| 203 |
+
)
|
| 204 |
+
assert_type(
|
| 205 |
+
np.histogram2d(_nd_c128, _nd_c128, bins=(_to_1d_f64, 8)),
|
| 206 |
+
tuple[
|
| 207 |
+
np.ndarray[_2D, np.dtype[np.float64]],
|
| 208 |
+
np.ndarray[_1D, np.dtype[np.complex128 | Any]],
|
| 209 |
+
np.ndarray[_1D, np.dtype[np.complex128 | Any]],
|
| 210 |
+
],
|
| 211 |
+
)
|
| 212 |
+
|
| 213 |
+
# mask_indices
|
| 214 |
+
assert_type(np.mask_indices(10, func1), _Indices2D)
|
| 215 |
+
assert_type(np.mask_indices(8, func2, "0"), _Indices2D)
|
| 216 |
+
|
| 217 |
+
# tril_indices
|
| 218 |
+
assert_type(np.tril_indices(3), _Indices2D)
|
| 219 |
+
assert_type(np.tril_indices(3, 1), _Indices2D)
|
| 220 |
+
assert_type(np.tril_indices(3, 1, 2), _Indices2D)
|
| 221 |
+
# tril_indices
|
| 222 |
+
assert_type(np.triu_indices(3), _Indices2D)
|
| 223 |
+
assert_type(np.triu_indices(3, 1), _Indices2D)
|
| 224 |
+
assert_type(np.triu_indices(3, 1, 2), _Indices2D)
|
| 225 |
+
|
| 226 |
+
# tril_indices_from
|
| 227 |
+
assert_type(np.tril_indices_from(_2d_bool), _Indices2D)
|
| 228 |
+
assert_type(np.tril_indices_from(_Cube()), _Indices2D)
|
| 229 |
+
# triu_indices_from
|
| 230 |
+
assert_type(np.triu_indices_from(_2d_bool), _Indices2D)
|
| 231 |
+
assert_type(np.triu_indices_from(_Cube()), _Indices2D)
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/type_check.pyi
ADDED
|
@@ -0,0 +1,94 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import Any, Literal, assert_type
|
| 2 |
+
|
| 3 |
+
import numpy as np
|
| 4 |
+
import numpy.typing as npt
|
| 5 |
+
|
| 6 |
+
i4: np.int32
|
| 7 |
+
f8: np.float64
|
| 8 |
+
m8_ns: np.timedelta64[int]
|
| 9 |
+
M8_ns: np.datetime64[int]
|
| 10 |
+
|
| 11 |
+
AR_i8: npt.NDArray[np.int64]
|
| 12 |
+
AR_i4: npt.NDArray[np.int32]
|
| 13 |
+
AR_f2: npt.NDArray[np.float16]
|
| 14 |
+
AR_f8: npt.NDArray[np.float64]
|
| 15 |
+
AR_f16: npt.NDArray[np.longdouble]
|
| 16 |
+
AR_c8: npt.NDArray[np.complex64]
|
| 17 |
+
AR_c16: npt.NDArray[np.complex128]
|
| 18 |
+
|
| 19 |
+
AR_f8_1d: np.ndarray[tuple[int], np.dtype[np.float64]]
|
| 20 |
+
AR_f8_2d: np.ndarray[tuple[int, int], np.dtype[np.float64]]
|
| 21 |
+
AR_c16_1d: np.ndarray[tuple[int], np.dtype[np.complex128]]
|
| 22 |
+
AR_c16_2d: np.ndarray[tuple[int, int], np.dtype[np.complex128]]
|
| 23 |
+
|
| 24 |
+
AR_LIKE_b: list[bool]
|
| 25 |
+
AR_LIKE_i: list[int]
|
| 26 |
+
AR_LIKE_f: list[float]
|
| 27 |
+
AR_LIKE_c: list[complex]
|
| 28 |
+
|
| 29 |
+
class ComplexObj:
|
| 30 |
+
real: slice
|
| 31 |
+
imag: slice
|
| 32 |
+
|
| 33 |
+
assert_type(np.mintypecode(["f8"], typeset="qfQF"), str)
|
| 34 |
+
|
| 35 |
+
assert_type(np.real(ComplexObj()), slice)
|
| 36 |
+
assert_type(np.real(AR_f8), npt.NDArray[np.float64])
|
| 37 |
+
assert_type(np.real(AR_c16), npt.NDArray[np.float64])
|
| 38 |
+
assert_type(np.real(AR_LIKE_f), npt.NDArray[Any])
|
| 39 |
+
|
| 40 |
+
assert_type(np.imag(ComplexObj()), slice)
|
| 41 |
+
assert_type(np.imag(AR_f8), npt.NDArray[np.float64])
|
| 42 |
+
assert_type(np.imag(AR_c16), npt.NDArray[np.float64])
|
| 43 |
+
assert_type(np.imag(AR_LIKE_f), npt.NDArray[Any])
|
| 44 |
+
|
| 45 |
+
assert_type(np.iscomplex(f8), np.bool)
|
| 46 |
+
assert_type(np.iscomplex(AR_f8), npt.NDArray[np.bool])
|
| 47 |
+
assert_type(np.iscomplex(AR_LIKE_f), npt.NDArray[np.bool])
|
| 48 |
+
|
| 49 |
+
assert_type(np.isreal(f8), np.bool)
|
| 50 |
+
assert_type(np.isreal(AR_f8), npt.NDArray[np.bool])
|
| 51 |
+
assert_type(np.isreal(AR_LIKE_f), npt.NDArray[np.bool])
|
| 52 |
+
|
| 53 |
+
assert_type(np.iscomplexobj(f8), bool)
|
| 54 |
+
assert_type(np.isrealobj(f8), bool)
|
| 55 |
+
|
| 56 |
+
assert_type(np.nan_to_num(True), np.bool)
|
| 57 |
+
assert_type(np.nan_to_num(0), np.int_ | Any)
|
| 58 |
+
assert_type(np.nan_to_num(0.0), np.float64 | Any)
|
| 59 |
+
assert_type(np.nan_to_num(0j), np.complex128 | Any)
|
| 60 |
+
assert_type(np.nan_to_num(i4), np.int32)
|
| 61 |
+
assert_type(np.nan_to_num(f8), np.float64)
|
| 62 |
+
assert_type(np.nan_to_num(m8_ns), np.timedelta64[int])
|
| 63 |
+
assert_type(np.nan_to_num(M8_ns), np.datetime64[int])
|
| 64 |
+
assert_type(np.nan_to_num(AR_LIKE_b), npt.NDArray[np.bool])
|
| 65 |
+
assert_type(np.nan_to_num(AR_LIKE_i), npt.NDArray[np.int_])
|
| 66 |
+
assert_type(np.nan_to_num(AR_LIKE_f), npt.NDArray[np.float64])
|
| 67 |
+
assert_type(np.nan_to_num(AR_LIKE_c), npt.NDArray[np.complex128])
|
| 68 |
+
assert_type(np.nan_to_num(AR_f8), npt.NDArray[np.float64])
|
| 69 |
+
assert_type(np.nan_to_num(AR_c16), npt.NDArray[np.complex128])
|
| 70 |
+
assert_type(np.nan_to_num(AR_f8_1d), np.ndarray[tuple[int], np.dtype[np.float64]])
|
| 71 |
+
assert_type(np.nan_to_num(AR_f8_2d), np.ndarray[tuple[int, int], np.dtype[np.float64]])
|
| 72 |
+
assert_type(np.nan_to_num(AR_c16_1d), np.ndarray[tuple[int], np.dtype[np.complex128]])
|
| 73 |
+
assert_type(np.nan_to_num(AR_c16_2d), np.ndarray[tuple[int, int], np.dtype[np.complex128]])
|
| 74 |
+
|
| 75 |
+
assert_type(np.real_if_close(AR_LIKE_f), npt.NDArray[Any])
|
| 76 |
+
assert_type(np.real_if_close(AR_f8), npt.NDArray[np.float64])
|
| 77 |
+
assert_type(np.real_if_close(AR_c8), npt.NDArray[np.float32 | np.complex64])
|
| 78 |
+
assert_type(np.real_if_close(AR_c16), npt.NDArray[np.float64 | np.complex128])
|
| 79 |
+
assert_type(np.real_if_close(AR_f8_1d), np.ndarray[tuple[int], np.dtype[np.float64]])
|
| 80 |
+
assert_type(np.real_if_close(AR_f8_2d), np.ndarray[tuple[int, int], np.dtype[np.float64]])
|
| 81 |
+
assert_type(np.real_if_close(AR_c16_1d), np.ndarray[tuple[int], np.dtype[np.float64 | np.complex128]])
|
| 82 |
+
assert_type(np.real_if_close(AR_c16_2d), np.ndarray[tuple[int, int], np.dtype[np.float64 | np.complex128]])
|
| 83 |
+
|
| 84 |
+
assert_type(np.typename("h"), Literal["short"]) # type: ignore[deprecated]
|
| 85 |
+
assert_type(np.typename("B"), Literal["unsigned char"]) # type: ignore[deprecated]
|
| 86 |
+
assert_type(np.typename("V"), Literal["void"]) # type: ignore[deprecated]
|
| 87 |
+
assert_type(np.typename("S1"), Literal["character"]) # type: ignore[deprecated]
|
| 88 |
+
|
| 89 |
+
assert_type(np.common_type(AR_i4), type[np.float64])
|
| 90 |
+
assert_type(np.common_type(AR_f2), type[np.float16])
|
| 91 |
+
assert_type(np.common_type(AR_f2, AR_i4), type[np.float64])
|
| 92 |
+
assert_type(np.common_type(AR_f16, AR_i4), type[np.longdouble])
|
| 93 |
+
assert_type(np.common_type(AR_c8, AR_f2), type[np.complex64])
|
| 94 |
+
assert_type(np.common_type(AR_f2, AR_c8, AR_i4), type[np.complexfloating])
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/ufunc_config.pyi
ADDED
|
@@ -0,0 +1,30 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""Typing tests for `_core._ufunc_config`."""
|
| 2 |
+
|
| 3 |
+
from _typeshed import SupportsWrite
|
| 4 |
+
from collections.abc import Callable
|
| 5 |
+
from typing import Any, assert_type
|
| 6 |
+
|
| 7 |
+
import numpy as np
|
| 8 |
+
from numpy._core._ufunc_config import _ErrDict
|
| 9 |
+
|
| 10 |
+
def func(a: str, b: int) -> None: ...
|
| 11 |
+
|
| 12 |
+
class Write:
|
| 13 |
+
def write(self, value: str) -> None: ...
|
| 14 |
+
|
| 15 |
+
assert_type(np.seterr(all=None), _ErrDict)
|
| 16 |
+
assert_type(np.seterr(divide="ignore"), _ErrDict)
|
| 17 |
+
assert_type(np.seterr(over="warn"), _ErrDict)
|
| 18 |
+
assert_type(np.seterr(under="call"), _ErrDict)
|
| 19 |
+
assert_type(np.seterr(invalid="raise"), _ErrDict)
|
| 20 |
+
assert_type(np.geterr(), _ErrDict)
|
| 21 |
+
|
| 22 |
+
assert_type(np.setbufsize(4096), int)
|
| 23 |
+
assert_type(np.getbufsize(), int)
|
| 24 |
+
|
| 25 |
+
assert_type(np.seterrcall(func), Callable[[str, int], Any] | SupportsWrite[str] | None)
|
| 26 |
+
assert_type(np.seterrcall(Write()), Callable[[str, int], Any] | SupportsWrite[str] | None)
|
| 27 |
+
assert_type(np.geterrcall(), Callable[[str, int], Any] | SupportsWrite[str] | None)
|
| 28 |
+
|
| 29 |
+
assert_type(np.errstate(call=func, all="call"), np.errstate)
|
| 30 |
+
assert_type(np.errstate(call=Write(), divide="log", over="log"), np.errstate)
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/ufunclike.pyi
ADDED
|
@@ -0,0 +1,31 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import assert_type
|
| 2 |
+
|
| 3 |
+
import numpy as np
|
| 4 |
+
import numpy.typing as npt
|
| 5 |
+
|
| 6 |
+
AR_LIKE_b: list[bool]
|
| 7 |
+
AR_LIKE_u: list[np.uint32]
|
| 8 |
+
AR_LIKE_i: list[int]
|
| 9 |
+
AR_LIKE_f: list[float]
|
| 10 |
+
AR_LIKE_O: list[np.object_]
|
| 11 |
+
|
| 12 |
+
AR_U: npt.NDArray[np.str_]
|
| 13 |
+
|
| 14 |
+
assert_type(np.fix(AR_LIKE_b), npt.NDArray[np.floating]) # type: ignore[deprecated]
|
| 15 |
+
assert_type(np.fix(AR_LIKE_u), npt.NDArray[np.floating]) # type: ignore[deprecated]
|
| 16 |
+
assert_type(np.fix(AR_LIKE_i), npt.NDArray[np.floating]) # type: ignore[deprecated]
|
| 17 |
+
assert_type(np.fix(AR_LIKE_f), npt.NDArray[np.floating]) # type: ignore[deprecated]
|
| 18 |
+
assert_type(np.fix(AR_LIKE_O), npt.NDArray[np.object_]) # type: ignore[deprecated]
|
| 19 |
+
assert_type(np.fix(AR_LIKE_f, out=AR_U), npt.NDArray[np.str_]) # type: ignore[deprecated]
|
| 20 |
+
|
| 21 |
+
assert_type(np.isposinf(AR_LIKE_b), npt.NDArray[np.bool])
|
| 22 |
+
assert_type(np.isposinf(AR_LIKE_u), npt.NDArray[np.bool])
|
| 23 |
+
assert_type(np.isposinf(AR_LIKE_i), npt.NDArray[np.bool])
|
| 24 |
+
assert_type(np.isposinf(AR_LIKE_f), npt.NDArray[np.bool])
|
| 25 |
+
assert_type(np.isposinf(AR_LIKE_f, out=AR_U), npt.NDArray[np.str_])
|
| 26 |
+
|
| 27 |
+
assert_type(np.isneginf(AR_LIKE_b), npt.NDArray[np.bool])
|
| 28 |
+
assert_type(np.isneginf(AR_LIKE_u), npt.NDArray[np.bool])
|
| 29 |
+
assert_type(np.isneginf(AR_LIKE_i), npt.NDArray[np.bool])
|
| 30 |
+
assert_type(np.isneginf(AR_LIKE_f), npt.NDArray[np.bool])
|
| 31 |
+
assert_type(np.isneginf(AR_LIKE_f, out=AR_U), npt.NDArray[np.str_])
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/ufuncs.pyi
ADDED
|
@@ -0,0 +1,142 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import Any, Literal, NoReturn, assert_type
|
| 2 |
+
|
| 3 |
+
import numpy as np
|
| 4 |
+
import numpy.typing as npt
|
| 5 |
+
|
| 6 |
+
i8: np.int64
|
| 7 |
+
f8: np.float64
|
| 8 |
+
AR_f8: npt.NDArray[np.float64]
|
| 9 |
+
AR_i8: npt.NDArray[np.int64]
|
| 10 |
+
|
| 11 |
+
assert_type(np.absolute.__doc__, str)
|
| 12 |
+
assert_type(np.absolute.types, list[str])
|
| 13 |
+
|
| 14 |
+
assert_type(np.absolute.__name__, Literal["absolute"])
|
| 15 |
+
assert_type(np.absolute.__qualname__, Literal["absolute"])
|
| 16 |
+
assert_type(np.absolute.ntypes, Literal[20])
|
| 17 |
+
assert_type(np.absolute.identity, None)
|
| 18 |
+
assert_type(np.absolute.nin, Literal[1])
|
| 19 |
+
assert_type(np.absolute.nin, Literal[1])
|
| 20 |
+
assert_type(np.absolute.nout, Literal[1])
|
| 21 |
+
assert_type(np.absolute.nargs, Literal[2])
|
| 22 |
+
assert_type(np.absolute.signature, None)
|
| 23 |
+
assert_type(np.absolute(f8), Any)
|
| 24 |
+
assert_type(np.absolute(AR_f8), npt.NDArray[Any])
|
| 25 |
+
assert_type(np.absolute.at(AR_f8, AR_i8), None)
|
| 26 |
+
|
| 27 |
+
assert_type(np.add.__name__, Literal["add"])
|
| 28 |
+
assert_type(np.add.__qualname__, Literal["add"])
|
| 29 |
+
assert_type(np.add.ntypes, Literal[22])
|
| 30 |
+
assert_type(np.add.identity, Literal[0])
|
| 31 |
+
assert_type(np.add.nin, Literal[2])
|
| 32 |
+
assert_type(np.add.nout, Literal[1])
|
| 33 |
+
assert_type(np.add.nargs, Literal[3])
|
| 34 |
+
assert_type(np.add.signature, None)
|
| 35 |
+
assert_type(np.add(f8, f8), Any)
|
| 36 |
+
assert_type(np.add(AR_f8, f8), npt.NDArray[Any])
|
| 37 |
+
assert_type(np.add.at(AR_f8, AR_i8, f8), None)
|
| 38 |
+
assert_type(np.add.reduce(AR_f8, axis=0), Any)
|
| 39 |
+
assert_type(np.add.accumulate(AR_f8), npt.NDArray[Any])
|
| 40 |
+
assert_type(np.add.reduceat(AR_f8, AR_i8), npt.NDArray[Any])
|
| 41 |
+
assert_type(np.add.outer(f8, f8), Any)
|
| 42 |
+
assert_type(np.add.outer(AR_f8, f8), npt.NDArray[Any])
|
| 43 |
+
|
| 44 |
+
assert_type(np.frexp.__name__, Literal["frexp"])
|
| 45 |
+
assert_type(np.frexp.__qualname__, Literal["frexp"])
|
| 46 |
+
assert_type(np.frexp.ntypes, Literal[4])
|
| 47 |
+
assert_type(np.frexp.identity, None)
|
| 48 |
+
assert_type(np.frexp.nin, Literal[1])
|
| 49 |
+
assert_type(np.frexp.nout, Literal[2])
|
| 50 |
+
assert_type(np.frexp.nargs, Literal[3])
|
| 51 |
+
assert_type(np.frexp.signature, None)
|
| 52 |
+
assert_type(np.frexp(f8), tuple[Any, Any])
|
| 53 |
+
assert_type(np.frexp(AR_f8), tuple[npt.NDArray[Any], npt.NDArray[Any]])
|
| 54 |
+
|
| 55 |
+
assert_type(np.divmod.__name__, Literal["divmod"])
|
| 56 |
+
assert_type(np.divmod.__qualname__, Literal["divmod"])
|
| 57 |
+
assert_type(np.divmod.ntypes, Literal[15])
|
| 58 |
+
assert_type(np.divmod.identity, None)
|
| 59 |
+
assert_type(np.divmod.nin, Literal[2])
|
| 60 |
+
assert_type(np.divmod.nout, Literal[2])
|
| 61 |
+
assert_type(np.divmod.nargs, Literal[4])
|
| 62 |
+
assert_type(np.divmod.signature, None)
|
| 63 |
+
assert_type(np.divmod(f8, f8), tuple[Any, Any])
|
| 64 |
+
assert_type(np.divmod(AR_f8, f8), tuple[npt.NDArray[Any], npt.NDArray[Any]])
|
| 65 |
+
|
| 66 |
+
assert_type(np.matmul.__name__, Literal["matmul"])
|
| 67 |
+
assert_type(np.matmul.__qualname__, Literal["matmul"])
|
| 68 |
+
assert_type(np.matmul.ntypes, Literal[19])
|
| 69 |
+
assert_type(np.matmul.identity, None)
|
| 70 |
+
assert_type(np.matmul.nin, Literal[2])
|
| 71 |
+
assert_type(np.matmul.nout, Literal[1])
|
| 72 |
+
assert_type(np.matmul.nargs, Literal[3])
|
| 73 |
+
assert_type(np.matmul.signature, Literal["(n?,k),(k,m?)->(n?,m?)"])
|
| 74 |
+
assert_type(np.matmul.identity, None)
|
| 75 |
+
assert_type(np.matmul(AR_f8, AR_f8), Any)
|
| 76 |
+
assert_type(np.matmul(AR_f8, AR_f8, axes=[(0, 1), (0, 1), (0, 1)]), Any)
|
| 77 |
+
|
| 78 |
+
assert_type(np.vecdot.__name__, Literal["vecdot"])
|
| 79 |
+
assert_type(np.vecdot.__qualname__, Literal["vecdot"])
|
| 80 |
+
assert_type(np.vecdot.ntypes, Literal[19])
|
| 81 |
+
assert_type(np.vecdot.identity, None)
|
| 82 |
+
assert_type(np.vecdot.nin, Literal[2])
|
| 83 |
+
assert_type(np.vecdot.nout, Literal[1])
|
| 84 |
+
assert_type(np.vecdot.nargs, Literal[3])
|
| 85 |
+
assert_type(np.vecdot.signature, Literal["(n),(n)->()"])
|
| 86 |
+
assert_type(np.vecdot.identity, None)
|
| 87 |
+
assert_type(np.vecdot(AR_f8, AR_f8), Any)
|
| 88 |
+
|
| 89 |
+
assert_type(np.bitwise_count.__name__, Literal["bitwise_count"])
|
| 90 |
+
assert_type(np.bitwise_count.__qualname__, Literal["bitwise_count"])
|
| 91 |
+
assert_type(np.bitwise_count.ntypes, Literal[11])
|
| 92 |
+
assert_type(np.bitwise_count.identity, None)
|
| 93 |
+
assert_type(np.bitwise_count.nin, Literal[1])
|
| 94 |
+
assert_type(np.bitwise_count.nout, Literal[1])
|
| 95 |
+
assert_type(np.bitwise_count.nargs, Literal[2])
|
| 96 |
+
assert_type(np.bitwise_count.signature, None)
|
| 97 |
+
assert_type(np.bitwise_count.identity, None)
|
| 98 |
+
assert_type(np.bitwise_count(i8), Any)
|
| 99 |
+
assert_type(np.bitwise_count(AR_i8), npt.NDArray[Any])
|
| 100 |
+
|
| 101 |
+
def test_absolute_outer_invalid() -> None:
|
| 102 |
+
assert_type(np.absolute.outer(AR_f8, AR_f8), NoReturn) # type: ignore[arg-type]
|
| 103 |
+
def test_frexp_outer_invalid() -> None:
|
| 104 |
+
assert_type(np.frexp.outer(AR_f8, AR_f8), NoReturn) # type: ignore[arg-type]
|
| 105 |
+
def test_divmod_outer_invalid() -> None:
|
| 106 |
+
assert_type(np.divmod.outer(AR_f8, AR_f8), NoReturn) # type: ignore[arg-type]
|
| 107 |
+
def test_matmul_outer_invalid() -> None:
|
| 108 |
+
assert_type(np.matmul.outer(AR_f8, AR_f8), NoReturn) # type: ignore[arg-type]
|
| 109 |
+
|
| 110 |
+
def test_absolute_reduceat_invalid() -> None:
|
| 111 |
+
assert_type(np.absolute.reduceat(AR_f8, AR_i8), NoReturn) # type: ignore[arg-type]
|
| 112 |
+
def test_frexp_reduceat_invalid() -> None:
|
| 113 |
+
assert_type(np.frexp.reduceat(AR_f8, AR_i8), NoReturn) # type: ignore[arg-type]
|
| 114 |
+
def test_divmod_reduceat_invalid() -> None:
|
| 115 |
+
assert_type(np.divmod.reduceat(AR_f8, AR_i8), NoReturn) # type: ignore[arg-type]
|
| 116 |
+
def test_matmul_reduceat_invalid() -> None:
|
| 117 |
+
assert_type(np.matmul.reduceat(AR_f8, AR_i8), NoReturn) # type: ignore[arg-type]
|
| 118 |
+
|
| 119 |
+
def test_absolute_reduce_invalid() -> None:
|
| 120 |
+
assert_type(np.absolute.reduce(AR_f8), NoReturn) # type: ignore[arg-type]
|
| 121 |
+
def test_frexp_reduce_invalid() -> None:
|
| 122 |
+
assert_type(np.frexp.reduce(AR_f8), NoReturn) # type: ignore[arg-type]
|
| 123 |
+
def test_divmod_reduce_invalid() -> None:
|
| 124 |
+
assert_type(np.divmod.reduce(AR_f8), NoReturn) # type: ignore[arg-type]
|
| 125 |
+
def test_matmul_reduce_invalid() -> None:
|
| 126 |
+
assert_type(np.matmul.reduce(AR_f8), NoReturn) # type: ignore[arg-type]
|
| 127 |
+
|
| 128 |
+
def test_absolute_accumulate_invalid() -> None:
|
| 129 |
+
assert_type(np.absolute.accumulate(AR_f8), NoReturn) # type: ignore[arg-type]
|
| 130 |
+
def test_frexp_accumulate_invalid() -> None:
|
| 131 |
+
assert_type(np.frexp.accumulate(AR_f8), NoReturn) # type: ignore[arg-type]
|
| 132 |
+
def test_divmod_accumulate_invalid() -> None:
|
| 133 |
+
assert_type(np.divmod.accumulate(AR_f8), NoReturn) # type: ignore[arg-type]
|
| 134 |
+
def test_matmul_accumulate_invalid() -> None:
|
| 135 |
+
assert_type(np.matmul.accumulate(AR_f8), NoReturn) # type: ignore[arg-type]
|
| 136 |
+
|
| 137 |
+
def test_frexp_at_invalid() -> None:
|
| 138 |
+
assert_type(np.frexp.at(AR_f8, i8), NoReturn) # type: ignore[arg-type]
|
| 139 |
+
def test_divmod_at_invalid() -> None:
|
| 140 |
+
assert_type(np.divmod.at(AR_f8, i8, AR_f8), NoReturn) # type: ignore[arg-type]
|
| 141 |
+
def test_matmul_at_invalid() -> None:
|
| 142 |
+
assert_type(np.matmul.at(AR_f8, i8, AR_f8), NoReturn) # type: ignore[arg-type]
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/data/reveal/warnings_and_errors.pyi
ADDED
|
@@ -0,0 +1,11 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import assert_type
|
| 2 |
+
|
| 3 |
+
import numpy.exceptions as ex
|
| 4 |
+
|
| 5 |
+
assert_type(ex.ModuleDeprecationWarning(), ex.ModuleDeprecationWarning)
|
| 6 |
+
assert_type(ex.VisibleDeprecationWarning(), ex.VisibleDeprecationWarning)
|
| 7 |
+
assert_type(ex.ComplexWarning(), ex.ComplexWarning)
|
| 8 |
+
assert_type(ex.RankWarning(), ex.RankWarning)
|
| 9 |
+
assert_type(ex.TooHardError(), ex.TooHardError)
|
| 10 |
+
assert_type(ex.AxisError("test"), ex.AxisError)
|
| 11 |
+
assert_type(ex.AxisError(5, 1), ex.AxisError)
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/test_isfile.py
ADDED
|
@@ -0,0 +1,35 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import os
|
| 2 |
+
from pathlib import Path
|
| 3 |
+
|
| 4 |
+
import pytest
|
| 5 |
+
|
| 6 |
+
import numpy as np
|
| 7 |
+
from numpy.testing import assert_
|
| 8 |
+
|
| 9 |
+
ROOT = Path(np.__file__).parents[0]
|
| 10 |
+
FILES = [
|
| 11 |
+
ROOT / "py.typed",
|
| 12 |
+
ROOT / "__init__.pyi",
|
| 13 |
+
ROOT / "ctypeslib" / "__init__.pyi",
|
| 14 |
+
ROOT / "_core" / "__init__.pyi",
|
| 15 |
+
ROOT / "f2py" / "__init__.pyi",
|
| 16 |
+
ROOT / "fft" / "__init__.pyi",
|
| 17 |
+
ROOT / "lib" / "__init__.pyi",
|
| 18 |
+
ROOT / "linalg" / "__init__.pyi",
|
| 19 |
+
ROOT / "ma" / "__init__.pyi",
|
| 20 |
+
ROOT / "matrixlib" / "__init__.pyi",
|
| 21 |
+
ROOT / "polynomial" / "__init__.pyi",
|
| 22 |
+
ROOT / "random" / "__init__.pyi",
|
| 23 |
+
ROOT / "testing" / "__init__.pyi",
|
| 24 |
+
]
|
| 25 |
+
|
| 26 |
+
|
| 27 |
+
@pytest.mark.thread_unsafe(
|
| 28 |
+
reason="os.path has a thread-safety bug (python/cpython#140054). "
|
| 29 |
+
"Expected to only be a problem in 3.14.0"
|
| 30 |
+
)
|
| 31 |
+
class TestIsFile:
|
| 32 |
+
def test_isfile(self):
|
| 33 |
+
"""Test if all ``.pyi`` files are properly installed."""
|
| 34 |
+
for file in FILES:
|
| 35 |
+
assert_(os.path.isfile(file))
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/test_runtime.py
ADDED
|
@@ -0,0 +1,103 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""Test the runtime usage of `numpy.typing`."""
|
| 2 |
+
|
| 3 |
+
from typing import (
|
| 4 |
+
Any,
|
| 5 |
+
NamedTuple,
|
| 6 |
+
Self,
|
| 7 |
+
TypeAliasType,
|
| 8 |
+
get_args,
|
| 9 |
+
get_origin,
|
| 10 |
+
get_type_hints,
|
| 11 |
+
)
|
| 12 |
+
|
| 13 |
+
import pytest
|
| 14 |
+
|
| 15 |
+
import numpy as np
|
| 16 |
+
import numpy._typing as _npt
|
| 17 |
+
import numpy.typing as npt
|
| 18 |
+
|
| 19 |
+
|
| 20 |
+
class TypeTup(NamedTuple):
|
| 21 |
+
typ: type # type expression
|
| 22 |
+
args: tuple[type, ...] # generic type parameters or arguments
|
| 23 |
+
origin: type | None # e.g. `UnionType` or `GenericAlias`
|
| 24 |
+
|
| 25 |
+
@classmethod
|
| 26 |
+
def from_type_alias(cls, alias: TypeAliasType, /) -> Self:
|
| 27 |
+
# PEP 695 `type _ = ...` aliases wrap the type expression as a
|
| 28 |
+
# `types.TypeAliasType` instance with a `__value__` attribute.
|
| 29 |
+
tp = alias.__value__
|
| 30 |
+
return cls(typ=tp, args=get_args(tp), origin=get_origin(tp))
|
| 31 |
+
|
| 32 |
+
|
| 33 |
+
TYPES = {
|
| 34 |
+
"ArrayLike": TypeTup.from_type_alias(npt.ArrayLike),
|
| 35 |
+
"DTypeLike": TypeTup.from_type_alias(npt.DTypeLike),
|
| 36 |
+
"NBitBase": TypeTup(npt.NBitBase, (), None), # type: ignore[deprecated] # pyright: ignore[reportDeprecated]
|
| 37 |
+
"NDArray": TypeTup.from_type_alias(npt.NDArray),
|
| 38 |
+
}
|
| 39 |
+
|
| 40 |
+
|
| 41 |
+
@pytest.mark.parametrize("name,tup", TYPES.items(), ids=TYPES.keys())
|
| 42 |
+
def test_get_args(name: type, tup: TypeTup) -> None:
|
| 43 |
+
"""Test `typing.get_args`."""
|
| 44 |
+
typ, ref = tup.typ, tup.args
|
| 45 |
+
out = get_args(typ)
|
| 46 |
+
assert out == ref
|
| 47 |
+
|
| 48 |
+
|
| 49 |
+
@pytest.mark.parametrize("name,tup", TYPES.items(), ids=TYPES.keys())
|
| 50 |
+
def test_get_origin(name: type, tup: TypeTup) -> None:
|
| 51 |
+
"""Test `typing.get_origin`."""
|
| 52 |
+
typ, ref = tup.typ, tup.origin
|
| 53 |
+
out = get_origin(typ)
|
| 54 |
+
assert out == ref
|
| 55 |
+
|
| 56 |
+
|
| 57 |
+
@pytest.mark.parametrize("name,tup", TYPES.items(), ids=TYPES.keys())
|
| 58 |
+
def test_get_type_hints(name: type, tup: TypeTup) -> None:
|
| 59 |
+
"""Test `typing.get_type_hints`."""
|
| 60 |
+
typ = tup.typ
|
| 61 |
+
|
| 62 |
+
def func(a: typ) -> None: pass
|
| 63 |
+
|
| 64 |
+
out = get_type_hints(func)
|
| 65 |
+
ref = {"a": typ, "return": type(None)}
|
| 66 |
+
assert out == ref
|
| 67 |
+
|
| 68 |
+
|
| 69 |
+
@pytest.mark.parametrize("name,tup", TYPES.items(), ids=TYPES.keys())
|
| 70 |
+
def test_get_type_hints_str(name: type, tup: TypeTup) -> None:
|
| 71 |
+
"""Test `typing.get_type_hints` with string-representation of types."""
|
| 72 |
+
typ_str, typ = f"npt.{name}", tup.typ
|
| 73 |
+
|
| 74 |
+
def func(a: typ_str) -> None: pass
|
| 75 |
+
|
| 76 |
+
out = get_type_hints(func)
|
| 77 |
+
ref = {"a": getattr(npt, str(name)), "return": type(None)}
|
| 78 |
+
assert out == ref
|
| 79 |
+
|
| 80 |
+
|
| 81 |
+
def test_keys() -> None:
|
| 82 |
+
"""Test that ``TYPES.keys()`` and ``numpy.typing.__all__`` are synced."""
|
| 83 |
+
keys = TYPES.keys()
|
| 84 |
+
ref = set(npt.__all__)
|
| 85 |
+
assert keys == ref
|
| 86 |
+
|
| 87 |
+
|
| 88 |
+
PROTOCOLS: dict[str, tuple[type[Any], object]] = {
|
| 89 |
+
"_SupportsArray": (_npt._SupportsArray, np.arange(10)),
|
| 90 |
+
"_SupportsArrayFunc": (_npt._SupportsArrayFunc, np.arange(10)),
|
| 91 |
+
"_NestedSequence": (_npt._NestedSequence, [1]),
|
| 92 |
+
}
|
| 93 |
+
|
| 94 |
+
|
| 95 |
+
@pytest.mark.parametrize("cls,obj", PROTOCOLS.values(), ids=PROTOCOLS.keys())
|
| 96 |
+
class TestRuntimeProtocol:
|
| 97 |
+
def test_isinstance(self, cls: type[Any], obj: object) -> None:
|
| 98 |
+
assert isinstance(obj, cls)
|
| 99 |
+
assert not isinstance(None, cls)
|
| 100 |
+
|
| 101 |
+
def test_issubclass(self, cls: type[Any], obj: object) -> None:
|
| 102 |
+
assert issubclass(type(obj), cls)
|
| 103 |
+
assert not issubclass(type(None), cls)
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/typing/tests/test_typing.py
ADDED
|
@@ -0,0 +1,207 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import importlib.util
|
| 2 |
+
import os
|
| 3 |
+
import re
|
| 4 |
+
import shutil
|
| 5 |
+
import textwrap
|
| 6 |
+
from collections import defaultdict
|
| 7 |
+
from typing import TYPE_CHECKING
|
| 8 |
+
|
| 9 |
+
import pytest
|
| 10 |
+
|
| 11 |
+
# Only trigger a full `mypy` run if this environment variable is set
|
| 12 |
+
# Note that these tests tend to take over a minute even on a macOS M1 CPU,
|
| 13 |
+
# and more than that in CI.
|
| 14 |
+
RUN_MYPY = "NPY_RUN_MYPY_IN_TESTSUITE" in os.environ
|
| 15 |
+
if RUN_MYPY and RUN_MYPY not in ('0', '', 'false'):
|
| 16 |
+
RUN_MYPY = True
|
| 17 |
+
|
| 18 |
+
# Skips all functions in this file
|
| 19 |
+
pytestmark = pytest.mark.skipif(
|
| 20 |
+
not RUN_MYPY,
|
| 21 |
+
reason="`NPY_RUN_MYPY_IN_TESTSUITE` not set"
|
| 22 |
+
)
|
| 23 |
+
|
| 24 |
+
|
| 25 |
+
try:
|
| 26 |
+
from mypy import api
|
| 27 |
+
except ImportError:
|
| 28 |
+
NO_MYPY = True
|
| 29 |
+
else:
|
| 30 |
+
NO_MYPY = False
|
| 31 |
+
|
| 32 |
+
if TYPE_CHECKING:
|
| 33 |
+
# We need this as annotation, but it's located in a private namespace.
|
| 34 |
+
# As a compromise, do *not* import it during runtime
|
| 35 |
+
from _pytest.mark.structures import ParameterSet
|
| 36 |
+
|
| 37 |
+
DATA_DIR = os.path.join(os.path.dirname(__file__), "data")
|
| 38 |
+
PASS_DIR = os.path.join(DATA_DIR, "pass")
|
| 39 |
+
FAIL_DIR = os.path.join(DATA_DIR, "fail")
|
| 40 |
+
REVEAL_DIR = os.path.join(DATA_DIR, "reveal")
|
| 41 |
+
MISC_DIR = os.path.join(DATA_DIR, "misc")
|
| 42 |
+
MYPY_INI = os.path.join(DATA_DIR, "mypy.ini")
|
| 43 |
+
CACHE_DIR = os.path.join(DATA_DIR, ".mypy_cache")
|
| 44 |
+
|
| 45 |
+
#: A dictionary with file names as keys and lists of the mypy stdout as values.
|
| 46 |
+
#: To-be populated by `run_mypy`.
|
| 47 |
+
OUTPUT_MYPY: defaultdict[str, list[str]] = defaultdict(list)
|
| 48 |
+
|
| 49 |
+
|
| 50 |
+
def _key_func(key: str) -> str:
|
| 51 |
+
"""Split at the first occurrence of the ``:`` character.
|
| 52 |
+
|
| 53 |
+
Windows drive-letters (*e.g.* ``C:``) are ignored herein.
|
| 54 |
+
"""
|
| 55 |
+
drive, tail = os.path.splitdrive(key)
|
| 56 |
+
return os.path.join(drive, tail.split(":", 1)[0])
|
| 57 |
+
|
| 58 |
+
|
| 59 |
+
def _strip_filename(msg: str) -> tuple[int, str]:
|
| 60 |
+
"""Strip the filename and line number from a mypy message."""
|
| 61 |
+
_, tail = os.path.splitdrive(msg)
|
| 62 |
+
_, lineno, msg = tail.split(":", 2)
|
| 63 |
+
return int(lineno), msg.strip()
|
| 64 |
+
|
| 65 |
+
|
| 66 |
+
def strip_func(match: re.Match[str]) -> str:
|
| 67 |
+
"""`re.sub` helper function for stripping module names."""
|
| 68 |
+
return match.groups()[1]
|
| 69 |
+
|
| 70 |
+
|
| 71 |
+
@pytest.fixture(scope="module", autouse=True)
|
| 72 |
+
def run_mypy() -> None:
|
| 73 |
+
"""Clears the cache and run mypy before running any of the typing tests.
|
| 74 |
+
|
| 75 |
+
The mypy results are cached in `OUTPUT_MYPY` for further use.
|
| 76 |
+
|
| 77 |
+
The cache refresh can be skipped using
|
| 78 |
+
|
| 79 |
+
NUMPY_TYPING_TEST_CLEAR_CACHE=0 pytest numpy/typing/tests
|
| 80 |
+
"""
|
| 81 |
+
if (
|
| 82 |
+
os.path.isdir(CACHE_DIR)
|
| 83 |
+
and bool(os.environ.get("NUMPY_TYPING_TEST_CLEAR_CACHE", True))
|
| 84 |
+
):
|
| 85 |
+
shutil.rmtree(CACHE_DIR)
|
| 86 |
+
|
| 87 |
+
split_pattern = re.compile(r"(\s+)?\^(\~+)?")
|
| 88 |
+
for directory in (PASS_DIR, REVEAL_DIR, FAIL_DIR, MISC_DIR):
|
| 89 |
+
# Run mypy
|
| 90 |
+
stdout, stderr, exit_code = api.run([
|
| 91 |
+
"--config-file",
|
| 92 |
+
MYPY_INI,
|
| 93 |
+
"--cache-dir",
|
| 94 |
+
CACHE_DIR,
|
| 95 |
+
directory,
|
| 96 |
+
])
|
| 97 |
+
if stderr:
|
| 98 |
+
pytest.fail(f"Unexpected mypy standard error\n\n{stderr}", False)
|
| 99 |
+
elif exit_code not in {0, 1}:
|
| 100 |
+
pytest.fail(f"Unexpected mypy exit code: {exit_code}\n\n{stdout}", False)
|
| 101 |
+
|
| 102 |
+
str_concat = ""
|
| 103 |
+
filename: str | None = None
|
| 104 |
+
for i in stdout.split("\n"):
|
| 105 |
+
if "note:" in i:
|
| 106 |
+
continue
|
| 107 |
+
if filename is None:
|
| 108 |
+
filename = _key_func(i)
|
| 109 |
+
|
| 110 |
+
str_concat += f"{i}\n"
|
| 111 |
+
if split_pattern.match(i) is not None:
|
| 112 |
+
OUTPUT_MYPY[filename].append(str_concat)
|
| 113 |
+
str_concat = ""
|
| 114 |
+
filename = None
|
| 115 |
+
|
| 116 |
+
|
| 117 |
+
def get_test_cases(*directories: str) -> list["ParameterSet"]:
|
| 118 |
+
test_cases = []
|
| 119 |
+
for directory in directories:
|
| 120 |
+
for root, _, files in os.walk(directory):
|
| 121 |
+
for fname in files:
|
| 122 |
+
short_fname, ext = os.path.splitext(fname)
|
| 123 |
+
if ext not in (".pyi", ".py"):
|
| 124 |
+
continue
|
| 125 |
+
|
| 126 |
+
fullpath = os.path.join(root, fname)
|
| 127 |
+
test_cases.append(pytest.param(fullpath, id=short_fname))
|
| 128 |
+
return test_cases
|
| 129 |
+
|
| 130 |
+
|
| 131 |
+
_FAIL_INDENT = " " * 4
|
| 132 |
+
_FAIL_SEP = "\n" + "_" * 79 + "\n\n"
|
| 133 |
+
|
| 134 |
+
_FAIL_MSG_REVEAL = """{}:{} - reveal mismatch:
|
| 135 |
+
|
| 136 |
+
{}"""
|
| 137 |
+
|
| 138 |
+
|
| 139 |
+
@pytest.mark.slow
|
| 140 |
+
@pytest.mark.skipif(NO_MYPY, reason="Mypy is not installed")
|
| 141 |
+
@pytest.mark.parametrize("path", get_test_cases(PASS_DIR, FAIL_DIR))
|
| 142 |
+
def test_pass(path) -> None:
|
| 143 |
+
# Alias `OUTPUT_MYPY` so that it appears in the local namespace
|
| 144 |
+
output_mypy = OUTPUT_MYPY
|
| 145 |
+
|
| 146 |
+
if path not in output_mypy:
|
| 147 |
+
return
|
| 148 |
+
|
| 149 |
+
relpath = os.path.relpath(path)
|
| 150 |
+
|
| 151 |
+
# collect any reported errors, and clean up the output
|
| 152 |
+
messages = []
|
| 153 |
+
for message in output_mypy[path]:
|
| 154 |
+
lineno, content = _strip_filename(message)
|
| 155 |
+
content = content.removeprefix("error:").lstrip()
|
| 156 |
+
messages.append(f"{relpath}:{lineno} - {content}")
|
| 157 |
+
|
| 158 |
+
if messages:
|
| 159 |
+
pytest.fail("\n".join(messages), pytrace=False)
|
| 160 |
+
|
| 161 |
+
|
| 162 |
+
@pytest.mark.slow
|
| 163 |
+
@pytest.mark.skipif(NO_MYPY, reason="Mypy is not installed")
|
| 164 |
+
@pytest.mark.parametrize("path", get_test_cases(REVEAL_DIR))
|
| 165 |
+
def test_reveal(path: str) -> None:
|
| 166 |
+
"""Validate that mypy correctly infers the return-types of
|
| 167 |
+
the expressions in `path`.
|
| 168 |
+
"""
|
| 169 |
+
__tracebackhide__ = True
|
| 170 |
+
|
| 171 |
+
output_mypy = OUTPUT_MYPY
|
| 172 |
+
if path not in output_mypy:
|
| 173 |
+
return
|
| 174 |
+
|
| 175 |
+
relpath = os.path.relpath(path)
|
| 176 |
+
|
| 177 |
+
# collect any reported errors, and clean up the output
|
| 178 |
+
failures = []
|
| 179 |
+
for error_line in output_mypy[path]:
|
| 180 |
+
lineno, error_msg = _strip_filename(error_line)
|
| 181 |
+
error_msg = textwrap.indent(error_msg, _FAIL_INDENT)
|
| 182 |
+
reason = _FAIL_MSG_REVEAL.format(relpath, lineno, error_msg)
|
| 183 |
+
failures.append(reason)
|
| 184 |
+
|
| 185 |
+
if failures:
|
| 186 |
+
reasons = _FAIL_SEP.join(failures)
|
| 187 |
+
pytest.fail(reasons, pytrace=False)
|
| 188 |
+
|
| 189 |
+
|
| 190 |
+
@pytest.mark.filterwarnings("ignore::DeprecationWarning")
|
| 191 |
+
@pytest.mark.slow
|
| 192 |
+
@pytest.mark.skipif(NO_MYPY, reason="Mypy is not installed")
|
| 193 |
+
@pytest.mark.filterwarnings("ignore:numpy.fix is deprecated:DeprecationWarning")
|
| 194 |
+
@pytest.mark.parametrize("path", get_test_cases(PASS_DIR))
|
| 195 |
+
def test_code_runs(path: str) -> None:
|
| 196 |
+
"""Validate that the code in `path` properly during runtime."""
|
| 197 |
+
path_without_extension, _ = os.path.splitext(path)
|
| 198 |
+
dirname, filename = path.split(os.sep)[-2:]
|
| 199 |
+
|
| 200 |
+
spec = importlib.util.spec_from_file_location(
|
| 201 |
+
f"{dirname}.{filename}", path
|
| 202 |
+
)
|
| 203 |
+
assert spec is not None
|
| 204 |
+
assert spec.loader is not None
|
| 205 |
+
|
| 206 |
+
test_module = importlib.util.module_from_spec(spec)
|
| 207 |
+
spec.loader.exec_module(test_module)
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/version.py
ADDED
|
@@ -0,0 +1,11 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
|
| 2 |
+
"""
|
| 3 |
+
Module to expose more detailed version info for the installed `numpy`
|
| 4 |
+
"""
|
| 5 |
+
version = "2.5.2"
|
| 6 |
+
__version__ = version
|
| 7 |
+
full_version = version
|
| 8 |
+
|
| 9 |
+
git_revision = "48fecee5453aa1d31e6b79dcb3969dc1a6d1a891"
|
| 10 |
+
release = 'dev' not in version and '+' not in version
|
| 11 |
+
short_version = version.split("+")[0]
|
Video-RSI/.venv/lib/python3.12/site-packages/numpy/version.pyi
ADDED
|
@@ -0,0 +1,9 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import Final, LiteralString
|
| 2 |
+
|
| 3 |
+
version: Final[LiteralString] = ...
|
| 4 |
+
__version__: Final[LiteralString] = ...
|
| 5 |
+
full_version: Final[LiteralString] = ...
|
| 6 |
+
|
| 7 |
+
git_revision: Final[LiteralString] = ...
|
| 8 |
+
release: Final[bool] = ...
|
| 9 |
+
short_version: Final[LiteralString] = ...
|
Video-RSI/.venv/lib/python3.12/site-packages/omegaconf-2.3.1.dist-info/INSTALLER
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
pip
|
Video-RSI/.venv/lib/python3.12/site-packages/omegaconf-2.3.1.dist-info/METADATA
ADDED
|
@@ -0,0 +1,85 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Metadata-Version: 2.4
|
| 2 |
+
Name: omegaconf
|
| 3 |
+
Version: 2.3.1
|
| 4 |
+
Summary: A flexible configuration library
|
| 5 |
+
Home-page: https://github.com/omry/omegaconf
|
| 6 |
+
Author: Omry Yadan
|
| 7 |
+
Author-email: omry@yadan.net
|
| 8 |
+
Keywords: yaml configuration config
|
| 9 |
+
Classifier: Programming Language :: Python :: 3.6
|
| 10 |
+
Classifier: Programming Language :: Python :: 3.7
|
| 11 |
+
Classifier: Programming Language :: Python :: 3.8
|
| 12 |
+
Classifier: Programming Language :: Python :: 3.9
|
| 13 |
+
Classifier: Programming Language :: Python :: 3.10
|
| 14 |
+
Classifier: Programming Language :: Python :: 3.11
|
| 15 |
+
Classifier: License :: OSI Approved :: BSD License
|
| 16 |
+
Classifier: Operating System :: OS Independent
|
| 17 |
+
Requires-Python: >=3.6
|
| 18 |
+
Description-Content-Type: text/markdown
|
| 19 |
+
License-File: LICENSE
|
| 20 |
+
Requires-Dist: antlr4-python3-runtime==4.9.*
|
| 21 |
+
Requires-Dist: PyYAML>=5.1.0
|
| 22 |
+
Requires-Dist: dataclasses; python_version == "3.6"
|
| 23 |
+
Dynamic: author
|
| 24 |
+
Dynamic: author-email
|
| 25 |
+
Dynamic: classifier
|
| 26 |
+
Dynamic: description
|
| 27 |
+
Dynamic: description-content-type
|
| 28 |
+
Dynamic: home-page
|
| 29 |
+
Dynamic: keywords
|
| 30 |
+
Dynamic: license-file
|
| 31 |
+
Dynamic: requires-dist
|
| 32 |
+
Dynamic: requires-python
|
| 33 |
+
Dynamic: summary
|
| 34 |
+
|
| 35 |
+
# OmegaConf
|
| 36 |
+
| | Description |
|
| 37 |
+
| --- | --- |
|
| 38 |
+
| Project | [](https://badge.fury.io/py/omegaconf)[](https://pepy.tech/project/omegaconf?versions=1.4.*&versions=2.0.*&versions=2.1.*) |
|
| 39 |
+
| Code quality| [](https://circleci.com/gh/omry/omegaconf)[](https://coveralls.io/github/omry/omegaconf)[](https://lgtm.com/projects/g/omry/omegaconf/alerts/)[](https://lgtm.com/projects/g/omry/omegaconf/context:python)|
|
| 40 |
+
| Docs and support |[](https://omegaconf.readthedocs.io/en/2.1_branch/)[](https://mybinder.org/v2/gh/omry/omegaconf/master?filepath=docs%2Fnotebook%2FTutorial.ipynb)|
|
| 41 |
+
|
| 42 |
+
|
| 43 |
+
OmegaConf is a hierarchical configuration system, with support for merging configurations from multiple sources (YAML config files, dataclasses/objects and CLI arguments)
|
| 44 |
+
providing a consistent API regardless of how the configuration was created.
|
| 45 |
+
|
| 46 |
+
## Releases
|
| 47 |
+
|
| 48 |
+
### Stable (2.3)
|
| 49 |
+
OmegaConf 2.3 is the current stable version.
|
| 50 |
+
* [What's new](https://github.com/omry/omegaconf/releases/tag/v2.3.0)
|
| 51 |
+
* [Documentation](https://omegaconf.readthedocs.io/en/2.3_branch/)
|
| 52 |
+
* [Source code](https://github.com/omry/omegaconf/tree/2.3_branch)
|
| 53 |
+
|
| 54 |
+
Install with `pip install --upgrade omegaconf`
|
| 55 |
+
|
| 56 |
+
### Previous release (2.2)
|
| 57 |
+
|
| 58 |
+
* [What's new](https://github.com/omry/omegaconf/releases/tag/v2.1.1)
|
| 59 |
+
* [Documentation](https://omegaconf.readthedocs.io/en/2.1_branch/)
|
| 60 |
+
* [Slides](https://docs.google.com/presentation/d/e/2PACX-1vT_UIV7hCnquIbLUm4NnkUpXvPEh33IKiUEvPRF850WKA8opOlZOszjKdZ3tPmf8u7hGNP6HpqS-NT5/pub?start=false&loop=false&delayms=3000)
|
| 61 |
+
* [Source code](https://github.com/omry/omegaconf/tree/2.1_branch)
|
| 62 |
+
|
| 63 |
+
Install with `pip install omegaconf==2.1`
|
| 64 |
+
|
| 65 |
+
|
| 66 |
+
### Previous release (2.1)
|
| 67 |
+
|
| 68 |
+
* [What's new](https://github.com/omry/omegaconf/releases/tag/v2.1.1)
|
| 69 |
+
* [Documentation](https://omegaconf.readthedocs.io/en/2.1_branch/)
|
| 70 |
+
* [Slides](https://docs.google.com/presentation/d/e/2PACX-1vT_UIV7hCnquIbLUm4NnkUpXvPEh33IKiUEvPRF850WKA8opOlZOszjKdZ3tPmf8u7hGNP6HpqS-NT5/pub?start=false&loop=false&delayms=3000)
|
| 71 |
+
* [Source code](https://github.com/omry/omegaconf/tree/2.1_branch)
|
| 72 |
+
|
| 73 |
+
Install with `pip install omegaconf==2.1`
|
| 74 |
+
|
| 75 |
+
### Previous release (2.0)
|
| 76 |
+
|
| 77 |
+
* [What's new](https://github.com/omry/omegaconf/releases/tag/v2.0.0)
|
| 78 |
+
* [Documentation](https://omegaconf.readthedocs.io/en/2.0_branch/)
|
| 79 |
+
* [Slides](https://docs.google.com/presentation/d/e/2PACX-1vT_UIV7hCnquIbLUm4NnkUpXvPEh33IKiUEvPRF850WKA8opOlZOszjKdZ3tPmf8u7hGNP6HpqS-NT5/pub?start=false&loop=false&delayms=3000)
|
| 80 |
+
* [Source code](https://github.com/omry/omegaconf/tree/2.0_branch)
|
| 81 |
+
|
| 82 |
+
Install with `pip install omegaconf==2.0.6`
|
| 83 |
+
|
| 84 |
+
## Live tutorial
|
| 85 |
+
Run the live tutorial: [](https://mybinder.org/v2/gh/omry/omegaconf/master?filepath=docs%2Fnotebook%2FTutorial.ipynb)
|
Video-RSI/.venv/lib/python3.12/site-packages/omegaconf-2.3.1.dist-info/RECORD
ADDED
|
@@ -0,0 +1,58 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
omegaconf-2.3.1.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
|
| 2 |
+
omegaconf-2.3.1.dist-info/METADATA,sha256=JNwH6huAGBDGPDhsxHN2cnp3TM5Ek7_d9kVP6DNeuE4,4508
|
| 3 |
+
omegaconf-2.3.1.dist-info/RECORD,,
|
| 4 |
+
omegaconf-2.3.1.dist-info/REQUESTED,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
|
| 5 |
+
omegaconf-2.3.1.dist-info/WHEEL,sha256=aeYiig01lYGDzBgS8HxWXOg3uV61G9ijOsup-k9o1sk,91
|
| 6 |
+
omegaconf-2.3.1.dist-info/licenses/LICENSE,sha256=sxN17V1cvn7C0MTBTfivp6jlUBu-JfcLbLxGFoX0uRo,1518
|
| 7 |
+
omegaconf-2.3.1.dist-info/top_level.txt,sha256=gKo5sjlMnML5r9-l1eLYBTS1xZ-xAr67mlBSgL9yvSA,25
|
| 8 |
+
omegaconf/__init__.py,sha256=lynwiDHEFBIHMqrBN3HRh0KJevzIap6MyULFNkMmlBc,1170
|
| 9 |
+
omegaconf/__pycache__/__init__.cpython-312.pyc,,
|
| 10 |
+
omegaconf/__pycache__/_impl.cpython-312.pyc,,
|
| 11 |
+
omegaconf/__pycache__/_utils.cpython-312.pyc,,
|
| 12 |
+
omegaconf/__pycache__/base.cpython-312.pyc,,
|
| 13 |
+
omegaconf/__pycache__/basecontainer.cpython-312.pyc,,
|
| 14 |
+
omegaconf/__pycache__/dictconfig.cpython-312.pyc,,
|
| 15 |
+
omegaconf/__pycache__/errors.cpython-312.pyc,,
|
| 16 |
+
omegaconf/__pycache__/grammar_parser.cpython-312.pyc,,
|
| 17 |
+
omegaconf/__pycache__/grammar_visitor.cpython-312.pyc,,
|
| 18 |
+
omegaconf/__pycache__/listconfig.cpython-312.pyc,,
|
| 19 |
+
omegaconf/__pycache__/nodes.cpython-312.pyc,,
|
| 20 |
+
omegaconf/__pycache__/omegaconf.cpython-312.pyc,,
|
| 21 |
+
omegaconf/__pycache__/version.cpython-312.pyc,,
|
| 22 |
+
omegaconf/_impl.py,sha256=CJfcRt8K20BiMMW5u3q8wuQ9hAeAmuYlFxctzPgTIgQ,2877
|
| 23 |
+
omegaconf/_utils.py,sha256=bw8Jpra0B8YkHFrwODrBcKPvgQTyU0pEpskLl7CDBRg,32564
|
| 24 |
+
omegaconf/base.py,sha256=rHWuLw8Iiew_SNJIUkLZy4EfyRb60hyS9X9Hl4OuBvs,32462
|
| 25 |
+
omegaconf/basecontainer.py,sha256=FWL2PZWRb7wP-AGpeN651l_uVnNhZvzzLjaUdDlJiB8,33318
|
| 26 |
+
omegaconf/dictconfig.py,sha256=IPtUPHoak025Q-gvDVqMdS497Xb6tjcsawrHXv4iQ2Y,27855
|
| 27 |
+
omegaconf/errors.py,sha256=ectbX8Kd-5FCJMTBIh6jshqvCnCiXMFGfFQJYGIereQ,3595
|
| 28 |
+
omegaconf/grammar/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
|
| 29 |
+
omegaconf/grammar/__pycache__/__init__.cpython-312.pyc,,
|
| 30 |
+
omegaconf/grammar/gen/OmegaConfGrammarLexer.py,sha256=9Wjdb3NXkCI-pU23FIb4kSgyDdIEWo0hFfSLMFpVK0Q,21668
|
| 31 |
+
omegaconf/grammar/gen/OmegaConfGrammarParser.py,sha256=LCFTkuTaRYW_nxIh3Jz3n-Jbwh99GdrZlOamRkwqfAA,63408
|
| 32 |
+
omegaconf/grammar/gen/OmegaConfGrammarParserListener.py,sha256=vTa4lgvNNF1pvxUpgZvLlBZyFKKPI0zdNt6blI8ePrs,5822
|
| 33 |
+
omegaconf/grammar/gen/OmegaConfGrammarParserVisitor.py,sha256=33SK_U-ptzYRPdC1nOGLFyKmV4wV1oc31M7nb9ZgouM,3596
|
| 34 |
+
omegaconf/grammar/gen/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
|
| 35 |
+
omegaconf/grammar/gen/__pycache__/OmegaConfGrammarLexer.cpython-312.pyc,,
|
| 36 |
+
omegaconf/grammar/gen/__pycache__/OmegaConfGrammarParser.cpython-312.pyc,,
|
| 37 |
+
omegaconf/grammar/gen/__pycache__/OmegaConfGrammarParserListener.cpython-312.pyc,,
|
| 38 |
+
omegaconf/grammar/gen/__pycache__/OmegaConfGrammarParserVisitor.cpython-312.pyc,,
|
| 39 |
+
omegaconf/grammar/gen/__pycache__/__init__.cpython-312.pyc,,
|
| 40 |
+
omegaconf/grammar_parser.py,sha256=7gvIGsqtsgl5e0XOWhI3Ur58FoIk3iBaX_M8JdyzpYM,5511
|
| 41 |
+
omegaconf/grammar_visitor.py,sha256=L6LOomG24GcPA1-aYzNOmKLup5kYirHTuyp857V7T7A,16055
|
| 42 |
+
omegaconf/listconfig.py,sha256=LyNRrn84BqNiz-TpwrDILat8HhlVwwM6zFmYCTUAdIo,24671
|
| 43 |
+
omegaconf/nodes.py,sha256=1XRIC8sfEoaV4PT_Vm7Z75JMsIc30kKTuJHGyZ2aM0w,17479
|
| 44 |
+
omegaconf/omegaconf.py,sha256=hFeVL0k6PNRqGE7ZUpI2p6sSGPkc9IEvsqr3MNdgU_s,39048
|
| 45 |
+
omegaconf/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
|
| 46 |
+
omegaconf/resolvers/__init__.py,sha256=zE-8WJwipGC2cXPq12CGAz49m82F1D1cKMwuV3EoT7k,60
|
| 47 |
+
omegaconf/resolvers/__pycache__/__init__.cpython-312.pyc,,
|
| 48 |
+
omegaconf/resolvers/oc/__init__.py,sha256=gLniKaouCmkm1ZTQOzS1F5jFlCMw7eL-ae6PhaMxNjg,3548
|
| 49 |
+
omegaconf/resolvers/oc/__pycache__/__init__.cpython-312.pyc,,
|
| 50 |
+
omegaconf/resolvers/oc/__pycache__/dict.cpython-312.pyc,,
|
| 51 |
+
omegaconf/resolvers/oc/dict.py,sha256=OL7iZ_aBIt7kYXxhMiFxSyskiX-xXBvGI_DnBbdxqVs,2324
|
| 52 |
+
omegaconf/version.py,sha256=b_besyDbAD6CLCNnQKwv7sB-v7xH9M6jSJGBoX4HI5M,442
|
| 53 |
+
pydevd_plugins/__init__.py,sha256=byyA3PmxQsWCnqpQzFy44heJq59wOqHr5bSt6knm5vY,180
|
| 54 |
+
pydevd_plugins/__pycache__/__init__.cpython-312.pyc,,
|
| 55 |
+
pydevd_plugins/extensions/__init__.py,sha256=byyA3PmxQsWCnqpQzFy44heJq59wOqHr5bSt6knm5vY,180
|
| 56 |
+
pydevd_plugins/extensions/__pycache__/__init__.cpython-312.pyc,,
|
| 57 |
+
pydevd_plugins/extensions/__pycache__/pydevd_plugin_omegaconf.cpython-312.pyc,,
|
| 58 |
+
pydevd_plugins/extensions/pydevd_plugin_omegaconf.py,sha256=Ac1SCniO-22CsRsMAXhFyyoVSN2R-MUWsOujm-601Ak,4251
|
Video-RSI/.venv/lib/python3.12/site-packages/omegaconf-2.3.1.dist-info/REQUESTED
ADDED
|
File without changes
|