Add files using upload-large-folder tool
Browse filesThis view is limited to 50 files because it contains too many changes. See raw diff
- .venv/lib/python3.12/site-packages/MarkupSafe-3.0.2.dist-info/RECORD +14 -0
- .venv/lib/python3.12/site-packages/MarkupSafe-3.0.2.dist-info/top_level.txt +1 -0
- .venv/lib/python3.12/site-packages/PIL/MspImagePlugin.py +200 -0
- .venv/lib/python3.12/site-packages/PIL/_imagingft.pyi +70 -0
- .venv/lib/python3.12/site-packages/PIL/_imagingtk.cpython-312-x86_64-linux-gnu.so +0 -0
- .venv/lib/python3.12/site-packages/PIL/_imagingtk.pyi +3 -0
- .venv/lib/python3.12/site-packages/PIL/_tkinter_finder.py +20 -0
- .venv/lib/python3.12/site-packages/PIL/py.typed +0 -0
- .venv/lib/python3.12/site-packages/PIL/report.py +5 -0
- .venv/lib/python3.12/site-packages/filelock/_unix.py +70 -0
- .venv/lib/python3.12/site-packages/fsspec/compression.py +182 -0
- .venv/lib/python3.12/site-packages/fsspec/exceptions.py +18 -0
- .venv/lib/python3.12/site-packages/markupsafe/_speedups.c +204 -0
- .venv/lib/python3.12/site-packages/markupsafe/_speedups.pyi +1 -0
- .venv/lib/python3.12/site-packages/markupsafe/py.typed +0 -0
- .venv/lib/python3.12/site-packages/networkx-3.6.1.dist-info/METADATA +177 -0
- .venv/lib/python3.12/site-packages/numpy-2.3.5.dist-info/METADATA +1093 -0
- .venv/lib/python3.12/site-packages/numpy/__config__.pyi +102 -0
- .venv/lib/python3.12/site-packages/numpy/__init__.py +945 -0
- .venv/lib/python3.12/site-packages/numpy/_array_api_info.pyi +207 -0
- .venv/lib/python3.12/site-packages/numpy/_distributor_init.pyi +1 -0
- .venv/lib/python3.12/site-packages/numpy/_expired_attrs_2_0.py +79 -0
- .venv/lib/python3.12/site-packages/numpy/_globals.pyi +17 -0
- .venv/lib/python3.12/site-packages/numpy/_pytesttester.pyi +18 -0
- .venv/lib/python3.12/site-packages/numpy/dtypes.py +41 -0
- .venv/lib/python3.12/site-packages/numpy/dtypes.pyi +631 -0
- .venv/lib/python3.12/site-packages/numpy/exceptions.pyi +27 -0
- .venv/lib/python3.12/site-packages/numpy/matlib.pyi +582 -0
- .venv/lib/python3.12/site-packages/numpy/py.typed +0 -0
- .venv/lib/python3.12/site-packages/nvidia_cublas_cu12-12.8.4.1.dist-info/METADATA +44 -0
- .venv/lib/python3.12/site-packages/nvidia_cublas_cu12-12.8.4.1.dist-info/RECORD +23 -0
- .venv/lib/python3.12/site-packages/nvidia_cublas_cu12-12.8.4.1.dist-info/WHEEL +5 -0
- .venv/lib/python3.12/site-packages/nvidia_cuda_cupti_cu12-12.8.90.dist-info/INSTALLER +1 -0
- .venv/lib/python3.12/site-packages/nvidia_cuda_cupti_cu12-12.8.90.dist-info/WHEEL +6 -0
- .venv/lib/python3.12/site-packages/nvidia_cuda_cupti_cu12-12.8.90.dist-info/top_level.txt +1 -0
- .venv/lib/python3.12/site-packages/nvidia_cuda_nvrtc_cu12-12.8.93.dist-info/METADATA +44 -0
- .venv/lib/python3.12/site-packages/nvidia_cuda_nvrtc_cu12-12.8.93.dist-info/top_level.txt +1 -0
- .venv/lib/python3.12/site-packages/nvidia_cuda_runtime_cu12-12.8.90.dist-info/License.txt +1568 -0
- .venv/lib/python3.12/site-packages/nvidia_cuda_runtime_cu12-12.8.90.dist-info/METADATA +44 -0
- .venv/lib/python3.12/site-packages/nvidia_cufile_cu12-1.13.1.3.dist-info/INSTALLER +1 -0
- .venv/lib/python3.12/site-packages/nvidia_cufile_cu12-1.13.1.3.dist-info/METADATA +44 -0
- .venv/lib/python3.12/site-packages/nvidia_cufile_cu12-1.13.1.3.dist-info/WHEEL +6 -0
- .venv/lib/python3.12/site-packages/nvidia_cufile_cu12-1.13.1.3.dist-info/top_level.txt +1 -0
- .venv/lib/python3.12/site-packages/nvidia_curand_cu12-10.3.9.90.dist-info/INSTALLER +1 -0
- .venv/lib/python3.12/site-packages/nvidia_curand_cu12-10.3.9.90.dist-info/top_level.txt +1 -0
- .venv/lib/python3.12/site-packages/nvidia_cusparse_cu12-12.5.8.93.dist-info/INSTALLER +1 -0
- .venv/lib/python3.12/site-packages/nvidia_cusparse_cu12-12.5.8.93.dist-info/WHEEL +6 -0
- .venv/lib/python3.12/site-packages/nvidia_cusparse_cu12-12.5.8.93.dist-info/top_level.txt +1 -0
- .venv/lib/python3.12/site-packages/nvidia_nccl_cu12-2.27.3.dist-info/RECORD +8 -0
- .venv/lib/python3.12/site-packages/nvidia_nccl_cu12-2.27.3.dist-info/WHEEL +6 -0
.venv/lib/python3.12/site-packages/MarkupSafe-3.0.2.dist-info/RECORD
ADDED
|
@@ -0,0 +1,14 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
MarkupSafe-3.0.2.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
|
| 2 |
+
MarkupSafe-3.0.2.dist-info/LICENSE.txt,sha256=SJqOEQhQntmKN7uYPhHg9-HTHwvY-Zp5yESOf_N9B-o,1475
|
| 3 |
+
MarkupSafe-3.0.2.dist-info/METADATA,sha256=aAwbZhSmXdfFuMM-rEHpeiHRkBOGESyVLJIuwzHP-nw,3975
|
| 4 |
+
MarkupSafe-3.0.2.dist-info/RECORD,,
|
| 5 |
+
MarkupSafe-3.0.2.dist-info/WHEEL,sha256=OVgtqZzfzIXXtylXP90gxCZ6CKBCwKYyHM8PpMEjN1M,151
|
| 6 |
+
MarkupSafe-3.0.2.dist-info/top_level.txt,sha256=qy0Plje5IJuvsCBjejJyhDCjEAdcDLK_2agVcex8Z6U,11
|
| 7 |
+
markupsafe/__init__.py,sha256=sr-U6_27DfaSrj5jnHYxWN-pvhM27sjlDplMDPZKm7k,13214
|
| 8 |
+
markupsafe/__pycache__/__init__.cpython-312.pyc,,
|
| 9 |
+
markupsafe/__pycache__/_native.cpython-312.pyc,,
|
| 10 |
+
markupsafe/_native.py,sha256=hSLs8Jmz5aqayuengJJ3kdT5PwNpBWpKrmQSdipndC8,210
|
| 11 |
+
markupsafe/_speedups.c,sha256=O7XulmTo-epI6n2FtMVOrJXl8EAaIwD2iNYmBI5SEoQ,4149
|
| 12 |
+
markupsafe/_speedups.cpython-312-x86_64-linux-gnu.so,sha256=t1DBZlpsjFA30BOOvXfXfT1wvO_4cS16VbHz1-49q5U,43432
|
| 13 |
+
markupsafe/_speedups.pyi,sha256=ENd1bYe7gbBUf2ywyYWOGUpnXOHNJ-cgTNqetlW8h5k,41
|
| 14 |
+
markupsafe/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
|
.venv/lib/python3.12/site-packages/MarkupSafe-3.0.2.dist-info/top_level.txt
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
markupsafe
|
.venv/lib/python3.12/site-packages/PIL/MspImagePlugin.py
ADDED
|
@@ -0,0 +1,200 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#
|
| 2 |
+
# The Python Imaging Library.
|
| 3 |
+
#
|
| 4 |
+
# MSP file handling
|
| 5 |
+
#
|
| 6 |
+
# This is the format used by the Paint program in Windows 1 and 2.
|
| 7 |
+
#
|
| 8 |
+
# History:
|
| 9 |
+
# 95-09-05 fl Created
|
| 10 |
+
# 97-01-03 fl Read/write MSP images
|
| 11 |
+
# 17-02-21 es Fixed RLE interpretation
|
| 12 |
+
#
|
| 13 |
+
# Copyright (c) Secret Labs AB 1997.
|
| 14 |
+
# Copyright (c) Fredrik Lundh 1995-97.
|
| 15 |
+
# Copyright (c) Eric Soroos 2017.
|
| 16 |
+
#
|
| 17 |
+
# See the README file for information on usage and redistribution.
|
| 18 |
+
#
|
| 19 |
+
# More info on this format: https://archive.org/details/gg243631
|
| 20 |
+
# Page 313:
|
| 21 |
+
# Figure 205. Windows Paint Version 1: "DanM" Format
|
| 22 |
+
# Figure 206. Windows Paint Version 2: "LinS" Format. Used in Windows V2.03
|
| 23 |
+
#
|
| 24 |
+
# See also: https://www.fileformat.info/format/mspaint/egff.htm
|
| 25 |
+
from __future__ import annotations
|
| 26 |
+
|
| 27 |
+
import io
|
| 28 |
+
import struct
|
| 29 |
+
from typing import IO
|
| 30 |
+
|
| 31 |
+
from . import Image, ImageFile
|
| 32 |
+
from ._binary import i16le as i16
|
| 33 |
+
from ._binary import o16le as o16
|
| 34 |
+
|
| 35 |
+
#
|
| 36 |
+
# read MSP files
|
| 37 |
+
|
| 38 |
+
|
| 39 |
+
def _accept(prefix: bytes) -> bool:
|
| 40 |
+
return prefix.startswith((b"DanM", b"LinS"))
|
| 41 |
+
|
| 42 |
+
|
| 43 |
+
##
|
| 44 |
+
# Image plugin for Windows MSP images. This plugin supports both
|
| 45 |
+
# uncompressed (Windows 1.0).
|
| 46 |
+
|
| 47 |
+
|
| 48 |
+
class MspImageFile(ImageFile.ImageFile):
|
| 49 |
+
format = "MSP"
|
| 50 |
+
format_description = "Windows Paint"
|
| 51 |
+
|
| 52 |
+
def _open(self) -> None:
|
| 53 |
+
# Header
|
| 54 |
+
assert self.fp is not None
|
| 55 |
+
|
| 56 |
+
s = self.fp.read(32)
|
| 57 |
+
if not _accept(s):
|
| 58 |
+
msg = "not an MSP file"
|
| 59 |
+
raise SyntaxError(msg)
|
| 60 |
+
|
| 61 |
+
# Header checksum
|
| 62 |
+
checksum = 0
|
| 63 |
+
for i in range(0, 32, 2):
|
| 64 |
+
checksum = checksum ^ i16(s, i)
|
| 65 |
+
if checksum != 0:
|
| 66 |
+
msg = "bad MSP checksum"
|
| 67 |
+
raise SyntaxError(msg)
|
| 68 |
+
|
| 69 |
+
self._mode = "1"
|
| 70 |
+
self._size = i16(s, 4), i16(s, 6)
|
| 71 |
+
|
| 72 |
+
if s.startswith(b"DanM"):
|
| 73 |
+
self.tile = [ImageFile._Tile("raw", (0, 0) + self.size, 32, "1")]
|
| 74 |
+
else:
|
| 75 |
+
self.tile = [ImageFile._Tile("MSP", (0, 0) + self.size, 32)]
|
| 76 |
+
|
| 77 |
+
|
| 78 |
+
class MspDecoder(ImageFile.PyDecoder):
|
| 79 |
+
# The algo for the MSP decoder is from
|
| 80 |
+
# https://www.fileformat.info/format/mspaint/egff.htm
|
| 81 |
+
# cc-by-attribution -- That page references is taken from the
|
| 82 |
+
# Encyclopedia of Graphics File Formats and is licensed by
|
| 83 |
+
# O'Reilly under the Creative Common/Attribution license
|
| 84 |
+
#
|
| 85 |
+
# For RLE encoded files, the 32byte header is followed by a scan
|
| 86 |
+
# line map, encoded as one 16bit word of encoded byte length per
|
| 87 |
+
# line.
|
| 88 |
+
#
|
| 89 |
+
# NOTE: the encoded length of the line can be 0. This was not
|
| 90 |
+
# handled in the previous version of this encoder, and there's no
|
| 91 |
+
# mention of how to handle it in the documentation. From the few
|
| 92 |
+
# examples I've seen, I've assumed that it is a fill of the
|
| 93 |
+
# background color, in this case, white.
|
| 94 |
+
#
|
| 95 |
+
#
|
| 96 |
+
# Pseudocode of the decoder:
|
| 97 |
+
# Read a BYTE value as the RunType
|
| 98 |
+
# If the RunType value is zero
|
| 99 |
+
# Read next byte as the RunCount
|
| 100 |
+
# Read the next byte as the RunValue
|
| 101 |
+
# Write the RunValue byte RunCount times
|
| 102 |
+
# If the RunType value is non-zero
|
| 103 |
+
# Use this value as the RunCount
|
| 104 |
+
# Read and write the next RunCount bytes literally
|
| 105 |
+
#
|
| 106 |
+
# e.g.:
|
| 107 |
+
# 0x00 03 ff 05 00 01 02 03 04
|
| 108 |
+
# would yield the bytes:
|
| 109 |
+
# 0xff ff ff 00 01 02 03 04
|
| 110 |
+
#
|
| 111 |
+
# which are then interpreted as a bit packed mode '1' image
|
| 112 |
+
|
| 113 |
+
_pulls_fd = True
|
| 114 |
+
|
| 115 |
+
def decode(self, buffer: bytes | Image.SupportsArrayInterface) -> tuple[int, int]:
|
| 116 |
+
assert self.fd is not None
|
| 117 |
+
|
| 118 |
+
img = io.BytesIO()
|
| 119 |
+
blank_line = bytearray((0xFF,) * ((self.state.xsize + 7) // 8))
|
| 120 |
+
try:
|
| 121 |
+
self.fd.seek(32)
|
| 122 |
+
rowmap = struct.unpack_from(
|
| 123 |
+
f"<{self.state.ysize}H", self.fd.read(self.state.ysize * 2)
|
| 124 |
+
)
|
| 125 |
+
except struct.error as e:
|
| 126 |
+
msg = "Truncated MSP file in row map"
|
| 127 |
+
raise OSError(msg) from e
|
| 128 |
+
|
| 129 |
+
for x, rowlen in enumerate(rowmap):
|
| 130 |
+
try:
|
| 131 |
+
if rowlen == 0:
|
| 132 |
+
img.write(blank_line)
|
| 133 |
+
continue
|
| 134 |
+
row = self.fd.read(rowlen)
|
| 135 |
+
if len(row) != rowlen:
|
| 136 |
+
msg = f"Truncated MSP file, expected {rowlen} bytes on row {x}"
|
| 137 |
+
raise OSError(msg)
|
| 138 |
+
idx = 0
|
| 139 |
+
while idx < rowlen:
|
| 140 |
+
runtype = row[idx]
|
| 141 |
+
idx += 1
|
| 142 |
+
if runtype == 0:
|
| 143 |
+
(runcount, runval) = struct.unpack_from("Bc", row, idx)
|
| 144 |
+
img.write(runval * runcount)
|
| 145 |
+
idx += 2
|
| 146 |
+
else:
|
| 147 |
+
runcount = runtype
|
| 148 |
+
img.write(row[idx : idx + runcount])
|
| 149 |
+
idx += runcount
|
| 150 |
+
|
| 151 |
+
except struct.error as e:
|
| 152 |
+
msg = f"Corrupted MSP file in row {x}"
|
| 153 |
+
raise OSError(msg) from e
|
| 154 |
+
|
| 155 |
+
self.set_as_raw(img.getvalue(), "1")
|
| 156 |
+
|
| 157 |
+
return -1, 0
|
| 158 |
+
|
| 159 |
+
|
| 160 |
+
Image.register_decoder("MSP", MspDecoder)
|
| 161 |
+
|
| 162 |
+
|
| 163 |
+
#
|
| 164 |
+
# write MSP files (uncompressed only)
|
| 165 |
+
|
| 166 |
+
|
| 167 |
+
def _save(im: Image.Image, fp: IO[bytes], filename: str | bytes) -> None:
|
| 168 |
+
if im.mode != "1":
|
| 169 |
+
msg = f"cannot write mode {im.mode} as MSP"
|
| 170 |
+
raise OSError(msg)
|
| 171 |
+
|
| 172 |
+
# create MSP header
|
| 173 |
+
header = [0] * 16
|
| 174 |
+
|
| 175 |
+
header[0], header[1] = i16(b"Da"), i16(b"nM") # version 1
|
| 176 |
+
header[2], header[3] = im.size
|
| 177 |
+
header[4], header[5] = 1, 1
|
| 178 |
+
header[6], header[7] = 1, 1
|
| 179 |
+
header[8], header[9] = im.size
|
| 180 |
+
|
| 181 |
+
checksum = 0
|
| 182 |
+
for h in header:
|
| 183 |
+
checksum = checksum ^ h
|
| 184 |
+
header[12] = checksum # FIXME: is this the right field?
|
| 185 |
+
|
| 186 |
+
# header
|
| 187 |
+
for h in header:
|
| 188 |
+
fp.write(o16(h))
|
| 189 |
+
|
| 190 |
+
# image body
|
| 191 |
+
ImageFile._save(im, fp, [ImageFile._Tile("raw", (0, 0) + im.size, 32, "1")])
|
| 192 |
+
|
| 193 |
+
|
| 194 |
+
#
|
| 195 |
+
# registry
|
| 196 |
+
|
| 197 |
+
Image.register_open(MspImageFile.format, MspImageFile, _accept)
|
| 198 |
+
Image.register_save(MspImageFile.format, _save)
|
| 199 |
+
|
| 200 |
+
Image.register_extension(MspImageFile.format, ".msp")
|
.venv/lib/python3.12/site-packages/PIL/_imagingft.pyi
ADDED
|
@@ -0,0 +1,70 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from collections.abc import Callable
|
| 2 |
+
from typing import Any
|
| 3 |
+
|
| 4 |
+
from . import ImageFont, _imaging
|
| 5 |
+
|
| 6 |
+
class Font:
|
| 7 |
+
@property
|
| 8 |
+
def family(self) -> str | None: ...
|
| 9 |
+
@property
|
| 10 |
+
def style(self) -> str | None: ...
|
| 11 |
+
@property
|
| 12 |
+
def ascent(self) -> int: ...
|
| 13 |
+
@property
|
| 14 |
+
def descent(self) -> int: ...
|
| 15 |
+
@property
|
| 16 |
+
def height(self) -> int: ...
|
| 17 |
+
@property
|
| 18 |
+
def x_ppem(self) -> int: ...
|
| 19 |
+
@property
|
| 20 |
+
def y_ppem(self) -> int: ...
|
| 21 |
+
@property
|
| 22 |
+
def glyphs(self) -> int: ...
|
| 23 |
+
def render(
|
| 24 |
+
self,
|
| 25 |
+
string: str | bytes,
|
| 26 |
+
fill: Callable[[int, int], _imaging.ImagingCore],
|
| 27 |
+
mode: str,
|
| 28 |
+
dir: str | None,
|
| 29 |
+
features: list[str] | None,
|
| 30 |
+
lang: str | None,
|
| 31 |
+
stroke_width: float,
|
| 32 |
+
stroke_filled: bool,
|
| 33 |
+
anchor: str | None,
|
| 34 |
+
foreground_ink_long: int,
|
| 35 |
+
start: tuple[float, float],
|
| 36 |
+
/,
|
| 37 |
+
) -> tuple[_imaging.ImagingCore, tuple[int, int]]: ...
|
| 38 |
+
def getsize(
|
| 39 |
+
self,
|
| 40 |
+
string: str | bytes | bytearray,
|
| 41 |
+
mode: str,
|
| 42 |
+
dir: str | None,
|
| 43 |
+
features: list[str] | None,
|
| 44 |
+
lang: str | None,
|
| 45 |
+
anchor: str | None,
|
| 46 |
+
/,
|
| 47 |
+
) -> tuple[tuple[int, int], tuple[int, int]]: ...
|
| 48 |
+
def getlength(
|
| 49 |
+
self,
|
| 50 |
+
string: str | bytes,
|
| 51 |
+
mode: str,
|
| 52 |
+
dir: str | None,
|
| 53 |
+
features: list[str] | None,
|
| 54 |
+
lang: str | None,
|
| 55 |
+
/,
|
| 56 |
+
) -> float: ...
|
| 57 |
+
def getvarnames(self) -> list[bytes]: ...
|
| 58 |
+
def getvaraxes(self) -> list[ImageFont.Axis]: ...
|
| 59 |
+
def setvarname(self, instance_index: int, /) -> None: ...
|
| 60 |
+
def setvaraxes(self, axes: list[float], /) -> None: ...
|
| 61 |
+
|
| 62 |
+
def getfont(
|
| 63 |
+
filename: str | bytes,
|
| 64 |
+
size: float,
|
| 65 |
+
index: int,
|
| 66 |
+
encoding: str,
|
| 67 |
+
font_bytes: bytes,
|
| 68 |
+
layout_engine: int,
|
| 69 |
+
) -> Font: ...
|
| 70 |
+
def __getattr__(name: str) -> Any: ...
|
.venv/lib/python3.12/site-packages/PIL/_imagingtk.cpython-312-x86_64-linux-gnu.so
ADDED
|
Binary file (47 kB). View file
|
|
|
.venv/lib/python3.12/site-packages/PIL/_imagingtk.pyi
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import Any
|
| 2 |
+
|
| 3 |
+
def __getattr__(name: str) -> Any: ...
|
.venv/lib/python3.12/site-packages/PIL/_tkinter_finder.py
ADDED
|
@@ -0,0 +1,20 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""Find compiled module linking to Tcl / Tk libraries"""
|
| 2 |
+
|
| 3 |
+
from __future__ import annotations
|
| 4 |
+
|
| 5 |
+
import sys
|
| 6 |
+
import tkinter
|
| 7 |
+
|
| 8 |
+
tk = getattr(tkinter, "_tkinter")
|
| 9 |
+
|
| 10 |
+
try:
|
| 11 |
+
if hasattr(sys, "pypy_find_executable"):
|
| 12 |
+
TKINTER_LIB = tk.tklib_cffi.__file__
|
| 13 |
+
else:
|
| 14 |
+
TKINTER_LIB = tk.__file__
|
| 15 |
+
except AttributeError:
|
| 16 |
+
# _tkinter may be compiled directly into Python, in which case __file__ is
|
| 17 |
+
# not available. load_tkinter_funcs will check the binary first in any case.
|
| 18 |
+
TKINTER_LIB = None
|
| 19 |
+
|
| 20 |
+
tk_version = str(tkinter.TkVersion)
|
.venv/lib/python3.12/site-packages/PIL/py.typed
ADDED
|
File without changes
|
.venv/lib/python3.12/site-packages/PIL/report.py
ADDED
|
@@ -0,0 +1,5 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from __future__ import annotations
|
| 2 |
+
|
| 3 |
+
from .features import pilinfo
|
| 4 |
+
|
| 5 |
+
pilinfo(supported_formats=False)
|
.venv/lib/python3.12/site-packages/filelock/_unix.py
ADDED
|
@@ -0,0 +1,70 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from __future__ import annotations
|
| 2 |
+
|
| 3 |
+
import os
|
| 4 |
+
import sys
|
| 5 |
+
from contextlib import suppress
|
| 6 |
+
from errno import ENOSYS
|
| 7 |
+
from pathlib import Path
|
| 8 |
+
from typing import cast
|
| 9 |
+
|
| 10 |
+
from ._api import BaseFileLock
|
| 11 |
+
from ._util import ensure_directory_exists
|
| 12 |
+
|
| 13 |
+
#: a flag to indicate if the fcntl API is available
|
| 14 |
+
has_fcntl = False
|
| 15 |
+
if sys.platform == "win32": # pragma: win32 cover
|
| 16 |
+
|
| 17 |
+
class UnixFileLock(BaseFileLock):
|
| 18 |
+
"""Uses the :func:`fcntl.flock` to hard lock the lock file on unix systems."""
|
| 19 |
+
|
| 20 |
+
def _acquire(self) -> None:
|
| 21 |
+
raise NotImplementedError
|
| 22 |
+
|
| 23 |
+
def _release(self) -> None:
|
| 24 |
+
raise NotImplementedError
|
| 25 |
+
|
| 26 |
+
else: # pragma: win32 no cover
|
| 27 |
+
try:
|
| 28 |
+
import fcntl
|
| 29 |
+
|
| 30 |
+
_ = (fcntl.flock, fcntl.LOCK_EX, fcntl.LOCK_NB, fcntl.LOCK_UN)
|
| 31 |
+
except (ImportError, AttributeError):
|
| 32 |
+
pass
|
| 33 |
+
else:
|
| 34 |
+
has_fcntl = True
|
| 35 |
+
|
| 36 |
+
class UnixFileLock(BaseFileLock):
|
| 37 |
+
"""Uses the :func:`fcntl.flock` to hard lock the lock file on unix systems."""
|
| 38 |
+
|
| 39 |
+
def _acquire(self) -> None:
|
| 40 |
+
ensure_directory_exists(self.lock_file)
|
| 41 |
+
open_flags = os.O_RDWR | os.O_TRUNC
|
| 42 |
+
if not Path(self.lock_file).exists():
|
| 43 |
+
open_flags |= os.O_CREAT
|
| 44 |
+
fd = os.open(self.lock_file, open_flags, self._context.mode)
|
| 45 |
+
with suppress(PermissionError): # This locked is not owned by this UID
|
| 46 |
+
os.fchmod(fd, self._context.mode)
|
| 47 |
+
try:
|
| 48 |
+
fcntl.flock(fd, fcntl.LOCK_EX | fcntl.LOCK_NB)
|
| 49 |
+
except OSError as exception:
|
| 50 |
+
os.close(fd)
|
| 51 |
+
if exception.errno == ENOSYS: # NotImplemented error
|
| 52 |
+
msg = "FileSystem does not appear to support flock; use SoftFileLock instead"
|
| 53 |
+
raise NotImplementedError(msg) from exception
|
| 54 |
+
else:
|
| 55 |
+
self._context.lock_file_fd = fd
|
| 56 |
+
|
| 57 |
+
def _release(self) -> None:
|
| 58 |
+
# Do not remove the lockfile:
|
| 59 |
+
# https://github.com/tox-dev/py-filelock/issues/31
|
| 60 |
+
# https://stackoverflow.com/questions/17708885/flock-removing-locked-file-without-race-condition
|
| 61 |
+
fd = cast("int", self._context.lock_file_fd)
|
| 62 |
+
self._context.lock_file_fd = None
|
| 63 |
+
fcntl.flock(fd, fcntl.LOCK_UN)
|
| 64 |
+
os.close(fd)
|
| 65 |
+
|
| 66 |
+
|
| 67 |
+
__all__ = [
|
| 68 |
+
"UnixFileLock",
|
| 69 |
+
"has_fcntl",
|
| 70 |
+
]
|
.venv/lib/python3.12/site-packages/fsspec/compression.py
ADDED
|
@@ -0,0 +1,182 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""Helper functions for a standard streaming compression API"""
|
| 2 |
+
|
| 3 |
+
from zipfile import ZipFile
|
| 4 |
+
|
| 5 |
+
import fsspec.utils
|
| 6 |
+
from fsspec.spec import AbstractBufferedFile
|
| 7 |
+
|
| 8 |
+
|
| 9 |
+
def noop_file(file, mode, **kwargs):
|
| 10 |
+
return file
|
| 11 |
+
|
| 12 |
+
|
| 13 |
+
# TODO: files should also be available as contexts
|
| 14 |
+
# should be functions of the form func(infile, mode=, **kwargs) -> file-like
|
| 15 |
+
compr = {None: noop_file}
|
| 16 |
+
|
| 17 |
+
|
| 18 |
+
def register_compression(name, callback, extensions, force=False):
|
| 19 |
+
"""Register an "inferable" file compression type.
|
| 20 |
+
|
| 21 |
+
Registers transparent file compression type for use with fsspec.open.
|
| 22 |
+
Compression can be specified by name in open, or "infer"-ed for any files
|
| 23 |
+
ending with the given extensions.
|
| 24 |
+
|
| 25 |
+
Args:
|
| 26 |
+
name: (str) The compression type name. Eg. "gzip".
|
| 27 |
+
callback: A callable of form (infile, mode, **kwargs) -> file-like.
|
| 28 |
+
Accepts an input file-like object, the target mode and kwargs.
|
| 29 |
+
Returns a wrapped file-like object.
|
| 30 |
+
extensions: (str, Iterable[str]) A file extension, or list of file
|
| 31 |
+
extensions for which to infer this compression scheme. Eg. "gz".
|
| 32 |
+
force: (bool) Force re-registration of compression type or extensions.
|
| 33 |
+
|
| 34 |
+
Raises:
|
| 35 |
+
ValueError: If name or extensions already registered, and not force.
|
| 36 |
+
|
| 37 |
+
"""
|
| 38 |
+
if isinstance(extensions, str):
|
| 39 |
+
extensions = [extensions]
|
| 40 |
+
|
| 41 |
+
# Validate registration
|
| 42 |
+
if name in compr and not force:
|
| 43 |
+
raise ValueError(f"Duplicate compression registration: {name}")
|
| 44 |
+
|
| 45 |
+
for ext in extensions:
|
| 46 |
+
if ext in fsspec.utils.compressions and not force:
|
| 47 |
+
raise ValueError(f"Duplicate compression file extension: {ext} ({name})")
|
| 48 |
+
|
| 49 |
+
compr[name] = callback
|
| 50 |
+
|
| 51 |
+
for ext in extensions:
|
| 52 |
+
fsspec.utils.compressions[ext] = name
|
| 53 |
+
|
| 54 |
+
|
| 55 |
+
def unzip(infile, mode="rb", filename=None, **kwargs):
|
| 56 |
+
if "r" not in mode:
|
| 57 |
+
filename = filename or "file"
|
| 58 |
+
z = ZipFile(infile, mode="w", **kwargs)
|
| 59 |
+
fo = z.open(filename, mode="w")
|
| 60 |
+
fo.close = lambda closer=fo.close: closer() or z.close()
|
| 61 |
+
return fo
|
| 62 |
+
z = ZipFile(infile)
|
| 63 |
+
if filename is None:
|
| 64 |
+
filename = z.namelist()[0]
|
| 65 |
+
return z.open(filename, mode="r", **kwargs)
|
| 66 |
+
|
| 67 |
+
|
| 68 |
+
register_compression("zip", unzip, "zip")
|
| 69 |
+
|
| 70 |
+
try:
|
| 71 |
+
from bz2 import BZ2File
|
| 72 |
+
except ImportError:
|
| 73 |
+
pass
|
| 74 |
+
else:
|
| 75 |
+
register_compression("bz2", BZ2File, "bz2")
|
| 76 |
+
|
| 77 |
+
try: # pragma: no cover
|
| 78 |
+
from isal import igzip
|
| 79 |
+
|
| 80 |
+
def isal(infile, mode="rb", **kwargs):
|
| 81 |
+
return igzip.IGzipFile(fileobj=infile, mode=mode, **kwargs)
|
| 82 |
+
|
| 83 |
+
register_compression("gzip", isal, "gz")
|
| 84 |
+
except ImportError:
|
| 85 |
+
from gzip import GzipFile
|
| 86 |
+
|
| 87 |
+
register_compression(
|
| 88 |
+
"gzip", lambda f, **kwargs: GzipFile(fileobj=f, **kwargs), "gz"
|
| 89 |
+
)
|
| 90 |
+
|
| 91 |
+
try:
|
| 92 |
+
from lzma import LZMAFile
|
| 93 |
+
|
| 94 |
+
register_compression("lzma", LZMAFile, "lzma")
|
| 95 |
+
register_compression("xz", LZMAFile, "xz")
|
| 96 |
+
except ImportError:
|
| 97 |
+
pass
|
| 98 |
+
|
| 99 |
+
try:
|
| 100 |
+
import lzmaffi
|
| 101 |
+
|
| 102 |
+
register_compression("lzma", lzmaffi.LZMAFile, "lzma", force=True)
|
| 103 |
+
register_compression("xz", lzmaffi.LZMAFile, "xz", force=True)
|
| 104 |
+
except ImportError:
|
| 105 |
+
pass
|
| 106 |
+
|
| 107 |
+
|
| 108 |
+
class SnappyFile(AbstractBufferedFile):
|
| 109 |
+
def __init__(self, infile, mode, **kwargs):
|
| 110 |
+
import snappy
|
| 111 |
+
|
| 112 |
+
super().__init__(
|
| 113 |
+
fs=None, path="snappy", mode=mode.strip("b") + "b", size=999999999, **kwargs
|
| 114 |
+
)
|
| 115 |
+
self.infile = infile
|
| 116 |
+
if "r" in mode:
|
| 117 |
+
self.codec = snappy.StreamDecompressor()
|
| 118 |
+
else:
|
| 119 |
+
self.codec = snappy.StreamCompressor()
|
| 120 |
+
|
| 121 |
+
def _upload_chunk(self, final=False):
|
| 122 |
+
self.buffer.seek(0)
|
| 123 |
+
out = self.codec.add_chunk(self.buffer.read())
|
| 124 |
+
self.infile.write(out)
|
| 125 |
+
return True
|
| 126 |
+
|
| 127 |
+
def seek(self, loc, whence=0):
|
| 128 |
+
raise NotImplementedError("SnappyFile is not seekable")
|
| 129 |
+
|
| 130 |
+
def seekable(self):
|
| 131 |
+
return False
|
| 132 |
+
|
| 133 |
+
def _fetch_range(self, start, end):
|
| 134 |
+
"""Get the specified set of bytes from remote"""
|
| 135 |
+
data = self.infile.read(end - start)
|
| 136 |
+
return self.codec.decompress(data)
|
| 137 |
+
|
| 138 |
+
|
| 139 |
+
try:
|
| 140 |
+
import snappy
|
| 141 |
+
|
| 142 |
+
snappy.compress(b"")
|
| 143 |
+
# Snappy may use the .sz file extension, but this is not part of the
|
| 144 |
+
# standard implementation.
|
| 145 |
+
register_compression("snappy", SnappyFile, [])
|
| 146 |
+
|
| 147 |
+
except (ImportError, NameError, AttributeError):
|
| 148 |
+
pass
|
| 149 |
+
|
| 150 |
+
try:
|
| 151 |
+
import lz4.frame
|
| 152 |
+
|
| 153 |
+
register_compression("lz4", lz4.frame.open, "lz4")
|
| 154 |
+
except ImportError:
|
| 155 |
+
pass
|
| 156 |
+
|
| 157 |
+
try:
|
| 158 |
+
# zstd in the standard library for python >= 3.14
|
| 159 |
+
from compression.zstd import ZstdFile
|
| 160 |
+
|
| 161 |
+
register_compression("zstd", ZstdFile, "zst")
|
| 162 |
+
|
| 163 |
+
except ImportError:
|
| 164 |
+
try:
|
| 165 |
+
import zstandard as zstd
|
| 166 |
+
|
| 167 |
+
def zstandard_file(infile, mode="rb"):
|
| 168 |
+
if "r" in mode:
|
| 169 |
+
cctx = zstd.ZstdDecompressor()
|
| 170 |
+
return cctx.stream_reader(infile)
|
| 171 |
+
else:
|
| 172 |
+
cctx = zstd.ZstdCompressor(level=10)
|
| 173 |
+
return cctx.stream_writer(infile)
|
| 174 |
+
|
| 175 |
+
register_compression("zstd", zstandard_file, "zst")
|
| 176 |
+
except ImportError:
|
| 177 |
+
pass
|
| 178 |
+
|
| 179 |
+
|
| 180 |
+
def available_compressions():
|
| 181 |
+
"""Return a list of the implemented compressions."""
|
| 182 |
+
return list(compr)
|
.venv/lib/python3.12/site-packages/fsspec/exceptions.py
ADDED
|
@@ -0,0 +1,18 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""
|
| 2 |
+
fsspec user-defined exception classes
|
| 3 |
+
"""
|
| 4 |
+
|
| 5 |
+
import asyncio
|
| 6 |
+
|
| 7 |
+
|
| 8 |
+
class BlocksizeMismatchError(ValueError):
|
| 9 |
+
"""
|
| 10 |
+
Raised when a cached file is opened with a different blocksize than it was
|
| 11 |
+
written with
|
| 12 |
+
"""
|
| 13 |
+
|
| 14 |
+
|
| 15 |
+
class FSTimeoutError(asyncio.TimeoutError):
|
| 16 |
+
"""
|
| 17 |
+
Raised when a fsspec function timed out occurs
|
| 18 |
+
"""
|
.venv/lib/python3.12/site-packages/markupsafe/_speedups.c
ADDED
|
@@ -0,0 +1,204 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#include <Python.h>
|
| 2 |
+
|
| 3 |
+
#define GET_DELTA(inp, inp_end, delta) \
|
| 4 |
+
while (inp < inp_end) { \
|
| 5 |
+
switch (*inp++) { \
|
| 6 |
+
case '"': \
|
| 7 |
+
case '\'': \
|
| 8 |
+
case '&': \
|
| 9 |
+
delta += 4; \
|
| 10 |
+
break; \
|
| 11 |
+
case '<': \
|
| 12 |
+
case '>': \
|
| 13 |
+
delta += 3; \
|
| 14 |
+
break; \
|
| 15 |
+
} \
|
| 16 |
+
}
|
| 17 |
+
|
| 18 |
+
#define DO_ESCAPE(inp, inp_end, outp) \
|
| 19 |
+
{ \
|
| 20 |
+
Py_ssize_t ncopy = 0; \
|
| 21 |
+
while (inp < inp_end) { \
|
| 22 |
+
switch (*inp) { \
|
| 23 |
+
case '"': \
|
| 24 |
+
memcpy(outp, inp-ncopy, sizeof(*outp)*ncopy); \
|
| 25 |
+
outp += ncopy; ncopy = 0; \
|
| 26 |
+
*outp++ = '&'; \
|
| 27 |
+
*outp++ = '#'; \
|
| 28 |
+
*outp++ = '3'; \
|
| 29 |
+
*outp++ = '4'; \
|
| 30 |
+
*outp++ = ';'; \
|
| 31 |
+
break; \
|
| 32 |
+
case '\'': \
|
| 33 |
+
memcpy(outp, inp-ncopy, sizeof(*outp)*ncopy); \
|
| 34 |
+
outp += ncopy; ncopy = 0; \
|
| 35 |
+
*outp++ = '&'; \
|
| 36 |
+
*outp++ = '#'; \
|
| 37 |
+
*outp++ = '3'; \
|
| 38 |
+
*outp++ = '9'; \
|
| 39 |
+
*outp++ = ';'; \
|
| 40 |
+
break; \
|
| 41 |
+
case '&': \
|
| 42 |
+
memcpy(outp, inp-ncopy, sizeof(*outp)*ncopy); \
|
| 43 |
+
outp += ncopy; ncopy = 0; \
|
| 44 |
+
*outp++ = '&'; \
|
| 45 |
+
*outp++ = 'a'; \
|
| 46 |
+
*outp++ = 'm'; \
|
| 47 |
+
*outp++ = 'p'; \
|
| 48 |
+
*outp++ = ';'; \
|
| 49 |
+
break; \
|
| 50 |
+
case '<': \
|
| 51 |
+
memcpy(outp, inp-ncopy, sizeof(*outp)*ncopy); \
|
| 52 |
+
outp += ncopy; ncopy = 0; \
|
| 53 |
+
*outp++ = '&'; \
|
| 54 |
+
*outp++ = 'l'; \
|
| 55 |
+
*outp++ = 't'; \
|
| 56 |
+
*outp++ = ';'; \
|
| 57 |
+
break; \
|
| 58 |
+
case '>': \
|
| 59 |
+
memcpy(outp, inp-ncopy, sizeof(*outp)*ncopy); \
|
| 60 |
+
outp += ncopy; ncopy = 0; \
|
| 61 |
+
*outp++ = '&'; \
|
| 62 |
+
*outp++ = 'g'; \
|
| 63 |
+
*outp++ = 't'; \
|
| 64 |
+
*outp++ = ';'; \
|
| 65 |
+
break; \
|
| 66 |
+
default: \
|
| 67 |
+
ncopy++; \
|
| 68 |
+
} \
|
| 69 |
+
inp++; \
|
| 70 |
+
} \
|
| 71 |
+
memcpy(outp, inp-ncopy, sizeof(*outp)*ncopy); \
|
| 72 |
+
}
|
| 73 |
+
|
| 74 |
+
static PyObject*
|
| 75 |
+
escape_unicode_kind1(PyUnicodeObject *in)
|
| 76 |
+
{
|
| 77 |
+
Py_UCS1 *inp = PyUnicode_1BYTE_DATA(in);
|
| 78 |
+
Py_UCS1 *inp_end = inp + PyUnicode_GET_LENGTH(in);
|
| 79 |
+
Py_UCS1 *outp;
|
| 80 |
+
PyObject *out;
|
| 81 |
+
Py_ssize_t delta = 0;
|
| 82 |
+
|
| 83 |
+
GET_DELTA(inp, inp_end, delta);
|
| 84 |
+
if (!delta) {
|
| 85 |
+
Py_INCREF(in);
|
| 86 |
+
return (PyObject*)in;
|
| 87 |
+
}
|
| 88 |
+
|
| 89 |
+
out = PyUnicode_New(PyUnicode_GET_LENGTH(in) + delta,
|
| 90 |
+
PyUnicode_IS_ASCII(in) ? 127 : 255);
|
| 91 |
+
if (!out)
|
| 92 |
+
return NULL;
|
| 93 |
+
|
| 94 |
+
inp = PyUnicode_1BYTE_DATA(in);
|
| 95 |
+
outp = PyUnicode_1BYTE_DATA(out);
|
| 96 |
+
DO_ESCAPE(inp, inp_end, outp);
|
| 97 |
+
return out;
|
| 98 |
+
}
|
| 99 |
+
|
| 100 |
+
static PyObject*
|
| 101 |
+
escape_unicode_kind2(PyUnicodeObject *in)
|
| 102 |
+
{
|
| 103 |
+
Py_UCS2 *inp = PyUnicode_2BYTE_DATA(in);
|
| 104 |
+
Py_UCS2 *inp_end = inp + PyUnicode_GET_LENGTH(in);
|
| 105 |
+
Py_UCS2 *outp;
|
| 106 |
+
PyObject *out;
|
| 107 |
+
Py_ssize_t delta = 0;
|
| 108 |
+
|
| 109 |
+
GET_DELTA(inp, inp_end, delta);
|
| 110 |
+
if (!delta) {
|
| 111 |
+
Py_INCREF(in);
|
| 112 |
+
return (PyObject*)in;
|
| 113 |
+
}
|
| 114 |
+
|
| 115 |
+
out = PyUnicode_New(PyUnicode_GET_LENGTH(in) + delta, 65535);
|
| 116 |
+
if (!out)
|
| 117 |
+
return NULL;
|
| 118 |
+
|
| 119 |
+
inp = PyUnicode_2BYTE_DATA(in);
|
| 120 |
+
outp = PyUnicode_2BYTE_DATA(out);
|
| 121 |
+
DO_ESCAPE(inp, inp_end, outp);
|
| 122 |
+
return out;
|
| 123 |
+
}
|
| 124 |
+
|
| 125 |
+
|
| 126 |
+
static PyObject*
|
| 127 |
+
escape_unicode_kind4(PyUnicodeObject *in)
|
| 128 |
+
{
|
| 129 |
+
Py_UCS4 *inp = PyUnicode_4BYTE_DATA(in);
|
| 130 |
+
Py_UCS4 *inp_end = inp + PyUnicode_GET_LENGTH(in);
|
| 131 |
+
Py_UCS4 *outp;
|
| 132 |
+
PyObject *out;
|
| 133 |
+
Py_ssize_t delta = 0;
|
| 134 |
+
|
| 135 |
+
GET_DELTA(inp, inp_end, delta);
|
| 136 |
+
if (!delta) {
|
| 137 |
+
Py_INCREF(in);
|
| 138 |
+
return (PyObject*)in;
|
| 139 |
+
}
|
| 140 |
+
|
| 141 |
+
out = PyUnicode_New(PyUnicode_GET_LENGTH(in) + delta, 1114111);
|
| 142 |
+
if (!out)
|
| 143 |
+
return NULL;
|
| 144 |
+
|
| 145 |
+
inp = PyUnicode_4BYTE_DATA(in);
|
| 146 |
+
outp = PyUnicode_4BYTE_DATA(out);
|
| 147 |
+
DO_ESCAPE(inp, inp_end, outp);
|
| 148 |
+
return out;
|
| 149 |
+
}
|
| 150 |
+
|
| 151 |
+
static PyObject*
|
| 152 |
+
escape_unicode(PyObject *self, PyObject *s)
|
| 153 |
+
{
|
| 154 |
+
if (!PyUnicode_Check(s))
|
| 155 |
+
return NULL;
|
| 156 |
+
|
| 157 |
+
// This check is no longer needed in Python 3.12.
|
| 158 |
+
if (PyUnicode_READY(s))
|
| 159 |
+
return NULL;
|
| 160 |
+
|
| 161 |
+
switch (PyUnicode_KIND(s)) {
|
| 162 |
+
case PyUnicode_1BYTE_KIND:
|
| 163 |
+
return escape_unicode_kind1((PyUnicodeObject*) s);
|
| 164 |
+
case PyUnicode_2BYTE_KIND:
|
| 165 |
+
return escape_unicode_kind2((PyUnicodeObject*) s);
|
| 166 |
+
case PyUnicode_4BYTE_KIND:
|
| 167 |
+
return escape_unicode_kind4((PyUnicodeObject*) s);
|
| 168 |
+
}
|
| 169 |
+
assert(0); /* shouldn't happen */
|
| 170 |
+
return NULL;
|
| 171 |
+
}
|
| 172 |
+
|
| 173 |
+
static PyMethodDef module_methods[] = {
|
| 174 |
+
{"_escape_inner", (PyCFunction)escape_unicode, METH_O, NULL},
|
| 175 |
+
{NULL, NULL, 0, NULL} /* Sentinel */
|
| 176 |
+
};
|
| 177 |
+
|
| 178 |
+
static struct PyModuleDef module_definition = {
|
| 179 |
+
PyModuleDef_HEAD_INIT,
|
| 180 |
+
"markupsafe._speedups",
|
| 181 |
+
NULL,
|
| 182 |
+
-1,
|
| 183 |
+
module_methods,
|
| 184 |
+
NULL,
|
| 185 |
+
NULL,
|
| 186 |
+
NULL,
|
| 187 |
+
NULL
|
| 188 |
+
};
|
| 189 |
+
|
| 190 |
+
PyMODINIT_FUNC
|
| 191 |
+
PyInit__speedups(void)
|
| 192 |
+
{
|
| 193 |
+
PyObject *m = PyModule_Create(&module_definition);
|
| 194 |
+
|
| 195 |
+
if (m == NULL) {
|
| 196 |
+
return NULL;
|
| 197 |
+
}
|
| 198 |
+
|
| 199 |
+
#ifdef Py_GIL_DISABLED
|
| 200 |
+
PyUnstable_Module_SetGIL(m, Py_MOD_GIL_NOT_USED);
|
| 201 |
+
#endif
|
| 202 |
+
|
| 203 |
+
return m;
|
| 204 |
+
}
|
.venv/lib/python3.12/site-packages/markupsafe/_speedups.pyi
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
def _escape_inner(s: str, /) -> str: ...
|
.venv/lib/python3.12/site-packages/markupsafe/py.typed
ADDED
|
File without changes
|
.venv/lib/python3.12/site-packages/networkx-3.6.1.dist-info/METADATA
ADDED
|
@@ -0,0 +1,177 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Metadata-Version: 2.4
|
| 2 |
+
Name: networkx
|
| 3 |
+
Version: 3.6.1
|
| 4 |
+
Summary: Python package for creating and manipulating graphs and networks
|
| 5 |
+
Author-email: Aric Hagberg <hagberg@lanl.gov>
|
| 6 |
+
Maintainer-email: NetworkX Developers <networkx-discuss@googlegroups.com>
|
| 7 |
+
License-Expression: BSD-3-Clause
|
| 8 |
+
Project-URL: Homepage, https://networkx.org/
|
| 9 |
+
Project-URL: Bug Tracker, https://github.com/networkx/networkx/issues
|
| 10 |
+
Project-URL: Documentation, https://networkx.org/documentation/stable/
|
| 11 |
+
Project-URL: Source Code, https://github.com/networkx/networkx
|
| 12 |
+
Keywords: Networks,Graph Theory,Mathematics,network,graph,discrete mathematics,math
|
| 13 |
+
Platform: Linux
|
| 14 |
+
Platform: Mac OSX
|
| 15 |
+
Platform: Windows
|
| 16 |
+
Platform: Unix
|
| 17 |
+
Classifier: Development Status :: 5 - Production/Stable
|
| 18 |
+
Classifier: Intended Audience :: Developers
|
| 19 |
+
Classifier: Intended Audience :: Science/Research
|
| 20 |
+
Classifier: Operating System :: OS Independent
|
| 21 |
+
Classifier: Programming Language :: Python :: 3
|
| 22 |
+
Classifier: Programming Language :: Python :: 3.11
|
| 23 |
+
Classifier: Programming Language :: Python :: 3.12
|
| 24 |
+
Classifier: Programming Language :: Python :: 3.13
|
| 25 |
+
Classifier: Programming Language :: Python :: 3.14
|
| 26 |
+
Classifier: Programming Language :: Python :: 3 :: Only
|
| 27 |
+
Classifier: Topic :: Software Development :: Libraries :: Python Modules
|
| 28 |
+
Classifier: Topic :: Scientific/Engineering :: Bio-Informatics
|
| 29 |
+
Classifier: Topic :: Scientific/Engineering :: Information Analysis
|
| 30 |
+
Classifier: Topic :: Scientific/Engineering :: Mathematics
|
| 31 |
+
Classifier: Topic :: Scientific/Engineering :: Physics
|
| 32 |
+
Requires-Python: !=3.14.1,>=3.11
|
| 33 |
+
Description-Content-Type: text/x-rst
|
| 34 |
+
License-File: LICENSE.txt
|
| 35 |
+
Provides-Extra: benchmarking
|
| 36 |
+
Requires-Dist: asv; extra == "benchmarking"
|
| 37 |
+
Requires-Dist: virtualenv; extra == "benchmarking"
|
| 38 |
+
Provides-Extra: default
|
| 39 |
+
Requires-Dist: numpy>=1.25; extra == "default"
|
| 40 |
+
Requires-Dist: scipy>=1.11.2; extra == "default"
|
| 41 |
+
Requires-Dist: matplotlib>=3.8; extra == "default"
|
| 42 |
+
Requires-Dist: pandas>=2.0; extra == "default"
|
| 43 |
+
Provides-Extra: developer
|
| 44 |
+
Requires-Dist: pre-commit>=4.1; extra == "developer"
|
| 45 |
+
Requires-Dist: mypy>=1.15; extra == "developer"
|
| 46 |
+
Provides-Extra: doc
|
| 47 |
+
Requires-Dist: sphinx>=8.0; extra == "doc"
|
| 48 |
+
Requires-Dist: pydata-sphinx-theme>=0.16; extra == "doc"
|
| 49 |
+
Requires-Dist: sphinx-gallery>=0.18; extra == "doc"
|
| 50 |
+
Requires-Dist: numpydoc>=1.8.0; extra == "doc"
|
| 51 |
+
Requires-Dist: pillow>=10; extra == "doc"
|
| 52 |
+
Requires-Dist: texext>=0.6.7; extra == "doc"
|
| 53 |
+
Requires-Dist: myst-nb>=1.1; extra == "doc"
|
| 54 |
+
Requires-Dist: intersphinx-registry; extra == "doc"
|
| 55 |
+
Provides-Extra: example
|
| 56 |
+
Requires-Dist: osmnx>=2.0.0; extra == "example"
|
| 57 |
+
Requires-Dist: momepy>=0.7.2; extra == "example"
|
| 58 |
+
Requires-Dist: contextily>=1.6; extra == "example"
|
| 59 |
+
Requires-Dist: seaborn>=0.13; extra == "example"
|
| 60 |
+
Requires-Dist: cairocffi>=1.7; extra == "example"
|
| 61 |
+
Requires-Dist: igraph>=0.11; extra == "example"
|
| 62 |
+
Requires-Dist: scikit-learn>=1.5; extra == "example"
|
| 63 |
+
Requires-Dist: iplotx>=0.9.0; extra == "example"
|
| 64 |
+
Provides-Extra: extra
|
| 65 |
+
Requires-Dist: lxml>=4.6; extra == "extra"
|
| 66 |
+
Requires-Dist: pygraphviz>=1.14; extra == "extra"
|
| 67 |
+
Requires-Dist: pydot>=3.0.1; extra == "extra"
|
| 68 |
+
Requires-Dist: sympy>=1.10; extra == "extra"
|
| 69 |
+
Provides-Extra: release
|
| 70 |
+
Requires-Dist: build>=0.10; extra == "release"
|
| 71 |
+
Requires-Dist: twine>=4.0; extra == "release"
|
| 72 |
+
Requires-Dist: wheel>=0.40; extra == "release"
|
| 73 |
+
Requires-Dist: changelist==0.5; extra == "release"
|
| 74 |
+
Provides-Extra: test
|
| 75 |
+
Requires-Dist: pytest>=7.2; extra == "test"
|
| 76 |
+
Requires-Dist: pytest-cov>=4.0; extra == "test"
|
| 77 |
+
Requires-Dist: pytest-xdist>=3.0; extra == "test"
|
| 78 |
+
Provides-Extra: test-extras
|
| 79 |
+
Requires-Dist: pytest-mpl; extra == "test-extras"
|
| 80 |
+
Requires-Dist: pytest-randomly; extra == "test-extras"
|
| 81 |
+
Dynamic: license-file
|
| 82 |
+
|
| 83 |
+
NetworkX
|
| 84 |
+
========
|
| 85 |
+
|
| 86 |
+
|
| 87 |
+
.. image::
|
| 88 |
+
https://github.com/networkx/networkx/actions/workflows/test.yml/badge.svg?branch=main
|
| 89 |
+
:target: https://github.com/networkx/networkx/actions/workflows/test.yml
|
| 90 |
+
|
| 91 |
+
.. image::
|
| 92 |
+
https://img.shields.io/pypi/v/networkx.svg?
|
| 93 |
+
:target: https://pypi.python.org/pypi/networkx
|
| 94 |
+
|
| 95 |
+
.. image::
|
| 96 |
+
https://img.shields.io/pypi/l/networkx.svg?
|
| 97 |
+
:target: https://github.com/networkx/networkx/blob/main/LICENSE.txt
|
| 98 |
+
|
| 99 |
+
.. image::
|
| 100 |
+
https://img.shields.io/pypi/pyversions/networkx.svg?
|
| 101 |
+
:target: https://pypi.python.org/pypi/networkx
|
| 102 |
+
|
| 103 |
+
.. image::
|
| 104 |
+
https://img.shields.io/github/labels/networkx/networkx/good%20first%20issue?color=green&label=contribute
|
| 105 |
+
:target: https://github.com/networkx/networkx/contribute
|
| 106 |
+
|
| 107 |
+
.. image::
|
| 108 |
+
https://insights.linuxfoundation.org/api/badge/health-score?project=networkx
|
| 109 |
+
:target: https://insights.linuxfoundation.org/project/networkx
|
| 110 |
+
|
| 111 |
+
|
| 112 |
+
NetworkX is a Python package for the creation, manipulation,
|
| 113 |
+
and study of the structure, dynamics, and functions
|
| 114 |
+
of complex networks.
|
| 115 |
+
|
| 116 |
+
- **Website (including documentation):** https://networkx.org
|
| 117 |
+
- **Mailing list:** https://groups.google.com/forum/#!forum/networkx-discuss
|
| 118 |
+
- **Source:** https://github.com/networkx/networkx
|
| 119 |
+
- **Bug reports:** https://github.com/networkx/networkx/issues
|
| 120 |
+
- **Report a security vulnerability:** https://tidelift.com/security
|
| 121 |
+
- **Tutorial:** https://networkx.org/documentation/latest/tutorial.html
|
| 122 |
+
- **GitHub Discussions:** https://github.com/networkx/networkx/discussions
|
| 123 |
+
- **Discord (Scientific Python) invite link:** https://discord.com/invite/vur45CbwMz
|
| 124 |
+
- **NetworkX meetings calendar (open to all):** https://scientific-python.org/calendars/networkx.ics
|
| 125 |
+
|
| 126 |
+
Simple example
|
| 127 |
+
--------------
|
| 128 |
+
|
| 129 |
+
Find the shortest path between two nodes in an undirected graph:
|
| 130 |
+
|
| 131 |
+
.. code:: pycon
|
| 132 |
+
|
| 133 |
+
>>> import networkx as nx
|
| 134 |
+
>>> G = nx.Graph()
|
| 135 |
+
>>> G.add_edge("A", "B", weight=4)
|
| 136 |
+
>>> G.add_edge("B", "D", weight=2)
|
| 137 |
+
>>> G.add_edge("A", "C", weight=3)
|
| 138 |
+
>>> G.add_edge("C", "D", weight=4)
|
| 139 |
+
>>> nx.shortest_path(G, "A", "D", weight="weight")
|
| 140 |
+
['A', 'B', 'D']
|
| 141 |
+
|
| 142 |
+
Install
|
| 143 |
+
-------
|
| 144 |
+
|
| 145 |
+
Install the latest released version of NetworkX:
|
| 146 |
+
|
| 147 |
+
.. code:: shell
|
| 148 |
+
|
| 149 |
+
$ pip install networkx
|
| 150 |
+
|
| 151 |
+
Install with all optional dependencies:
|
| 152 |
+
|
| 153 |
+
.. code:: shell
|
| 154 |
+
|
| 155 |
+
$ pip install networkx[default]
|
| 156 |
+
|
| 157 |
+
For additional details,
|
| 158 |
+
please see the `installation guide <https://networkx.org/documentation/stable/install.html>`_.
|
| 159 |
+
|
| 160 |
+
Bugs
|
| 161 |
+
----
|
| 162 |
+
|
| 163 |
+
Please report any bugs that you find `here <https://github.com/networkx/networkx/issues>`_.
|
| 164 |
+
Or, even better, fork the repository on `GitHub <https://github.com/networkx/networkx>`_
|
| 165 |
+
and create a pull request (PR). We welcome all changes, big or small, and we
|
| 166 |
+
will help you make the PR if you are new to `git` (just ask on the issue and/or
|
| 167 |
+
see the `contributor guide <https://networkx.org/documentation/latest/developer/contribute.html>`_).
|
| 168 |
+
|
| 169 |
+
License
|
| 170 |
+
-------
|
| 171 |
+
|
| 172 |
+
Released under the `3-clause BSD license <https://github.com/networkx/networkx/blob/main/LICENSE.txt>`_::
|
| 173 |
+
|
| 174 |
+
Copyright (c) 2004-2025, NetworkX Developers
|
| 175 |
+
Aric Hagberg <hagberg@lanl.gov>
|
| 176 |
+
Dan Schult <dschult@colgate.edu>
|
| 177 |
+
Pieter Swart <swart@lanl.gov>
|
.venv/lib/python3.12/site-packages/numpy-2.3.5.dist-info/METADATA
ADDED
|
@@ -0,0 +1,1093 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Metadata-Version: 2.1
|
| 2 |
+
Name: numpy
|
| 3 |
+
Version: 2.3.5
|
| 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: Copyright (c) 2005-2025, NumPy Developers.
|
| 8 |
+
All rights reserved.
|
| 9 |
+
|
| 10 |
+
Redistribution and use in source and binary forms, with or without
|
| 11 |
+
modification, are permitted provided that the following conditions are
|
| 12 |
+
met:
|
| 13 |
+
|
| 14 |
+
* Redistributions of source code must retain the above copyright
|
| 15 |
+
notice, this list of conditions and the following disclaimer.
|
| 16 |
+
|
| 17 |
+
* Redistributions in binary form must reproduce the above
|
| 18 |
+
copyright notice, this list of conditions and the following
|
| 19 |
+
disclaimer in the documentation and/or other materials provided
|
| 20 |
+
with the distribution.
|
| 21 |
+
|
| 22 |
+
* Neither the name of the NumPy Developers nor the names of any
|
| 23 |
+
contributors may be used to endorse or promote products derived
|
| 24 |
+
from this software without specific prior written 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
|
| 30 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 31 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 32 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 33 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 34 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 35 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 36 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 37 |
+
|
| 38 |
+
----
|
| 39 |
+
|
| 40 |
+
The NumPy repository and source distributions bundle several libraries that are
|
| 41 |
+
compatibly licensed. We list these here.
|
| 42 |
+
|
| 43 |
+
Name: lapack-lite
|
| 44 |
+
Files: numpy/linalg/lapack_lite/*
|
| 45 |
+
License: BSD-3-Clause
|
| 46 |
+
For details, see numpy/linalg/lapack_lite/LICENSE.txt
|
| 47 |
+
|
| 48 |
+
Name: dragon4
|
| 49 |
+
Files: numpy/_core/src/multiarray/dragon4.c
|
| 50 |
+
License: MIT
|
| 51 |
+
For license text, see numpy/_core/src/multiarray/dragon4.c
|
| 52 |
+
|
| 53 |
+
Name: libdivide
|
| 54 |
+
Files: numpy/_core/include/numpy/libdivide/*
|
| 55 |
+
License: Zlib
|
| 56 |
+
For license text, see numpy/_core/include/numpy/libdivide/LICENSE.txt
|
| 57 |
+
|
| 58 |
+
|
| 59 |
+
Note that the following files are vendored in the repository and sdist but not
|
| 60 |
+
installed in built numpy packages:
|
| 61 |
+
|
| 62 |
+
Name: Meson
|
| 63 |
+
Files: vendored-meson/meson/*
|
| 64 |
+
License: Apache 2.0
|
| 65 |
+
For license text, see vendored-meson/meson/COPYING
|
| 66 |
+
|
| 67 |
+
Name: spin
|
| 68 |
+
Files: .spin/cmds.py
|
| 69 |
+
License: BSD-3
|
| 70 |
+
For license text, see .spin/LICENSE
|
| 71 |
+
|
| 72 |
+
Name: tempita
|
| 73 |
+
Files: numpy/_build_utils/tempita/*
|
| 74 |
+
License: MIT
|
| 75 |
+
For details, see numpy/_build_utils/tempita/LICENCE.txt
|
| 76 |
+
|
| 77 |
+
----
|
| 78 |
+
|
| 79 |
+
This binary distribution of NumPy also bundles the following software:
|
| 80 |
+
|
| 81 |
+
|
| 82 |
+
Name: OpenBLAS
|
| 83 |
+
Files: numpy.libs/libscipy_openblas*.so
|
| 84 |
+
Description: bundled as a dynamically linked library
|
| 85 |
+
Availability: https://github.com/OpenMathLib/OpenBLAS/
|
| 86 |
+
License: BSD-3-Clause
|
| 87 |
+
Copyright (c) 2011-2014, The OpenBLAS Project
|
| 88 |
+
All rights reserved.
|
| 89 |
+
|
| 90 |
+
Redistribution and use in source and binary forms, with or without
|
| 91 |
+
modification, are permitted provided that the following conditions are
|
| 92 |
+
met:
|
| 93 |
+
|
| 94 |
+
1. Redistributions of source code must retain the above copyright
|
| 95 |
+
notice, this list of conditions and the following disclaimer.
|
| 96 |
+
|
| 97 |
+
2. Redistributions in binary form must reproduce the above copyright
|
| 98 |
+
notice, this list of conditions and the following disclaimer in
|
| 99 |
+
the documentation and/or other materials provided with the
|
| 100 |
+
distribution.
|
| 101 |
+
3. Neither the name of the OpenBLAS project nor the names of
|
| 102 |
+
its contributors may be used to endorse or promote products
|
| 103 |
+
derived from this software without specific prior written
|
| 104 |
+
permission.
|
| 105 |
+
|
| 106 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 107 |
+
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 108 |
+
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 109 |
+
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
| 110 |
+
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
| 111 |
+
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
| 112 |
+
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
| 113 |
+
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
| 114 |
+
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
|
| 115 |
+
USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 116 |
+
|
| 117 |
+
|
| 118 |
+
Name: LAPACK
|
| 119 |
+
Files: numpy.libs/libscipy_openblas*.so
|
| 120 |
+
Description: bundled in OpenBLAS
|
| 121 |
+
Availability: https://github.com/OpenMathLib/OpenBLAS/
|
| 122 |
+
License: BSD-3-Clause-Open-MPI
|
| 123 |
+
Copyright (c) 1992-2013 The University of Tennessee and The University
|
| 124 |
+
of Tennessee Research Foundation. All rights
|
| 125 |
+
reserved.
|
| 126 |
+
Copyright (c) 2000-2013 The University of California Berkeley. All
|
| 127 |
+
rights reserved.
|
| 128 |
+
Copyright (c) 2006-2013 The University of Colorado Denver. All rights
|
| 129 |
+
reserved.
|
| 130 |
+
|
| 131 |
+
$COPYRIGHT$
|
| 132 |
+
|
| 133 |
+
Additional copyrights may follow
|
| 134 |
+
|
| 135 |
+
$HEADER$
|
| 136 |
+
|
| 137 |
+
Redistribution and use in source and binary forms, with or without
|
| 138 |
+
modification, are permitted provided that the following conditions are
|
| 139 |
+
met:
|
| 140 |
+
|
| 141 |
+
- Redistributions of source code must retain the above copyright
|
| 142 |
+
notice, this list of conditions and the following disclaimer.
|
| 143 |
+
|
| 144 |
+
- Redistributions in binary form must reproduce the above copyright
|
| 145 |
+
notice, this list of conditions and the following disclaimer listed
|
| 146 |
+
in this license in the documentation and/or other materials
|
| 147 |
+
provided with the distribution.
|
| 148 |
+
|
| 149 |
+
- Neither the name of the copyright holders nor the names of its
|
| 150 |
+
contributors may be used to endorse or promote products derived from
|
| 151 |
+
this software without specific prior written permission.
|
| 152 |
+
|
| 153 |
+
The copyright holders provide no reassurances that the source code
|
| 154 |
+
provided does not infringe any patent, copyright, or any other
|
| 155 |
+
intellectual property rights of third parties. The copyright holders
|
| 156 |
+
disclaim any liability to any recipient for claims brought against
|
| 157 |
+
recipient by any third party for infringement of that parties
|
| 158 |
+
intellectual property rights.
|
| 159 |
+
|
| 160 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 161 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 162 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 163 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 164 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 165 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 166 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 167 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 168 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 169 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 170 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 171 |
+
|
| 172 |
+
|
| 173 |
+
Name: GCC runtime library
|
| 174 |
+
Files: numpy.libs/libgfortran*.so
|
| 175 |
+
Description: dynamically linked to files compiled with gcc
|
| 176 |
+
Availability: https://gcc.gnu.org/git/?p=gcc.git;a=tree;f=libgfortran
|
| 177 |
+
License: GPL-3.0-or-later WITH GCC-exception-3.1
|
| 178 |
+
Copyright (C) 2002-2017 Free Software Foundation, Inc.
|
| 179 |
+
|
| 180 |
+
Libgfortran is free software; you can redistribute it and/or modify
|
| 181 |
+
it under the terms of the GNU General Public License as published by
|
| 182 |
+
the Free Software Foundation; either version 3, or (at your option)
|
| 183 |
+
any later version.
|
| 184 |
+
|
| 185 |
+
Libgfortran is distributed in the hope that it will be useful,
|
| 186 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 187 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 188 |
+
GNU General Public License for more details.
|
| 189 |
+
|
| 190 |
+
Under Section 7 of GPL version 3, you are granted additional
|
| 191 |
+
permissions described in the GCC Runtime Library Exception, version
|
| 192 |
+
3.1, as published by the Free Software Foundation.
|
| 193 |
+
|
| 194 |
+
You should have received a copy of the GNU General Public License and
|
| 195 |
+
a copy of the GCC Runtime Library Exception along with this program;
|
| 196 |
+
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
| 197 |
+
<http://www.gnu.org/licenses/>.
|
| 198 |
+
|
| 199 |
+
----
|
| 200 |
+
|
| 201 |
+
Full text of license texts referred to above follows (that they are
|
| 202 |
+
listed below does not necessarily imply the conditions apply to the
|
| 203 |
+
present binary release):
|
| 204 |
+
|
| 205 |
+
----
|
| 206 |
+
|
| 207 |
+
GCC RUNTIME LIBRARY EXCEPTION
|
| 208 |
+
|
| 209 |
+
Version 3.1, 31 March 2009
|
| 210 |
+
|
| 211 |
+
Copyright (C) 2009 Free Software Foundation, Inc. <https://fsf.org/>
|
| 212 |
+
|
| 213 |
+
Everyone is permitted to copy and distribute verbatim copies of this
|
| 214 |
+
license document, but changing it is not allowed.
|
| 215 |
+
|
| 216 |
+
This GCC Runtime Library Exception ("Exception") is an additional
|
| 217 |
+
permission under section 7 of the GNU General Public License, version
|
| 218 |
+
3 ("GPLv3"). It applies to a given file (the "Runtime Library") that
|
| 219 |
+
bears a notice placed by the copyright holder of the file stating that
|
| 220 |
+
the file is governed by GPLv3 along with this Exception.
|
| 221 |
+
|
| 222 |
+
When you use GCC to compile a program, GCC may combine portions of
|
| 223 |
+
certain GCC header files and runtime libraries with the compiled
|
| 224 |
+
program. The purpose of this Exception is to allow compilation of
|
| 225 |
+
non-GPL (including proprietary) programs to use, in this way, the
|
| 226 |
+
header files and runtime libraries covered by this Exception.
|
| 227 |
+
|
| 228 |
+
0. Definitions.
|
| 229 |
+
|
| 230 |
+
A file is an "Independent Module" if it either requires the Runtime
|
| 231 |
+
Library for execution after a Compilation Process, or makes use of an
|
| 232 |
+
interface provided by the Runtime Library, but is not otherwise based
|
| 233 |
+
on the Runtime Library.
|
| 234 |
+
|
| 235 |
+
"GCC" means a version of the GNU Compiler Collection, with or without
|
| 236 |
+
modifications, governed by version 3 (or a specified later version) of
|
| 237 |
+
the GNU General Public License (GPL) with the option of using any
|
| 238 |
+
subsequent versions published by the FSF.
|
| 239 |
+
|
| 240 |
+
"GPL-compatible Software" is software whose conditions of propagation,
|
| 241 |
+
modification and use would permit combination with GCC in accord with
|
| 242 |
+
the license of GCC.
|
| 243 |
+
|
| 244 |
+
"Target Code" refers to output from any compiler for a real or virtual
|
| 245 |
+
target processor architecture, in executable form or suitable for
|
| 246 |
+
input to an assembler, loader, linker and/or execution
|
| 247 |
+
phase. Notwithstanding that, Target Code does not include data in any
|
| 248 |
+
format that is used as a compiler intermediate representation, or used
|
| 249 |
+
for producing a compiler intermediate representation.
|
| 250 |
+
|
| 251 |
+
The "Compilation Process" transforms code entirely represented in
|
| 252 |
+
non-intermediate languages designed for human-written code, and/or in
|
| 253 |
+
Java Virtual Machine byte code, into Target Code. Thus, for example,
|
| 254 |
+
use of source code generators and preprocessors need not be considered
|
| 255 |
+
part of the Compilation Process, since the Compilation Process can be
|
| 256 |
+
understood as starting with the output of the generators or
|
| 257 |
+
preprocessors.
|
| 258 |
+
|
| 259 |
+
A Compilation Process is "Eligible" if it is done using GCC, alone or
|
| 260 |
+
with other GPL-compatible software, or if it is done without using any
|
| 261 |
+
work based on GCC. For example, using non-GPL-compatible Software to
|
| 262 |
+
optimize any GCC intermediate representations would not qualify as an
|
| 263 |
+
Eligible Compilation Process.
|
| 264 |
+
|
| 265 |
+
1. Grant of Additional Permission.
|
| 266 |
+
|
| 267 |
+
You have permission to propagate a work of Target Code formed by
|
| 268 |
+
combining the Runtime Library with Independent Modules, even if such
|
| 269 |
+
propagation would otherwise violate the terms of GPLv3, provided that
|
| 270 |
+
all Target Code was generated by Eligible Compilation Processes. You
|
| 271 |
+
may then convey such a combination under terms of your choice,
|
| 272 |
+
consistent with the licensing of the Independent Modules.
|
| 273 |
+
|
| 274 |
+
2. No Weakening of GCC Copyleft.
|
| 275 |
+
|
| 276 |
+
The availability of this Exception does not imply any general
|
| 277 |
+
presumption that third-party software is unaffected by the copyleft
|
| 278 |
+
requirements of the license of GCC.
|
| 279 |
+
|
| 280 |
+
----
|
| 281 |
+
|
| 282 |
+
GNU GENERAL PUBLIC LICENSE
|
| 283 |
+
Version 3, 29 June 2007
|
| 284 |
+
|
| 285 |
+
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
| 286 |
+
Everyone is permitted to copy and distribute verbatim copies
|
| 287 |
+
of this license document, but changing it is not allowed.
|
| 288 |
+
|
| 289 |
+
Preamble
|
| 290 |
+
|
| 291 |
+
The GNU General Public License is a free, copyleft license for
|
| 292 |
+
software and other kinds of works.
|
| 293 |
+
|
| 294 |
+
The licenses for most software and other practical works are designed
|
| 295 |
+
to take away your freedom to share and change the works. By contrast,
|
| 296 |
+
the GNU General Public License is intended to guarantee your freedom to
|
| 297 |
+
share and change all versions of a program--to make sure it remains free
|
| 298 |
+
software for all its users. We, the Free Software Foundation, use the
|
| 299 |
+
GNU General Public License for most of our software; it applies also to
|
| 300 |
+
any other work released this way by its authors. You can apply it to
|
| 301 |
+
your programs, too.
|
| 302 |
+
|
| 303 |
+
When we speak of free software, we are referring to freedom, not
|
| 304 |
+
price. Our General Public Licenses are designed to make sure that you
|
| 305 |
+
have the freedom to distribute copies of free software (and charge for
|
| 306 |
+
them if you wish), that you receive source code or can get it if you
|
| 307 |
+
want it, that you can change the software or use pieces of it in new
|
| 308 |
+
free programs, and that you know you can do these things.
|
| 309 |
+
|
| 310 |
+
To protect your rights, we need to prevent others from denying you
|
| 311 |
+
these rights or asking you to surrender the rights. Therefore, you have
|
| 312 |
+
certain responsibilities if you distribute copies of the software, or if
|
| 313 |
+
you modify it: responsibilities to respect the freedom of others.
|
| 314 |
+
|
| 315 |
+
For example, if you distribute copies of such a program, whether
|
| 316 |
+
gratis or for a fee, you must pass on to the recipients the same
|
| 317 |
+
freedoms that you received. You must make sure that they, too, receive
|
| 318 |
+
or can get the source code. And you must show them these terms so they
|
| 319 |
+
know their rights.
|
| 320 |
+
|
| 321 |
+
Developers that use the GNU GPL protect your rights with two steps:
|
| 322 |
+
(1) assert copyright on the software, and (2) offer you this License
|
| 323 |
+
giving you legal permission to copy, distribute and/or modify it.
|
| 324 |
+
|
| 325 |
+
For the developers' and authors' protection, the GPL clearly explains
|
| 326 |
+
that there is no warranty for this free software. For both users' and
|
| 327 |
+
authors' sake, the GPL requires that modified versions be marked as
|
| 328 |
+
changed, so that their problems will not be attributed erroneously to
|
| 329 |
+
authors of previous versions.
|
| 330 |
+
|
| 331 |
+
Some devices are designed to deny users access to install or run
|
| 332 |
+
modified versions of the software inside them, although the manufacturer
|
| 333 |
+
can do so. This is fundamentally incompatible with the aim of
|
| 334 |
+
protecting users' freedom to change the software. The systematic
|
| 335 |
+
pattern of such abuse occurs in the area of products for individuals to
|
| 336 |
+
use, which is precisely where it is most unacceptable. Therefore, we
|
| 337 |
+
have designed this version of the GPL to prohibit the practice for those
|
| 338 |
+
products. If such problems arise substantially in other domains, we
|
| 339 |
+
stand ready to extend this provision to those domains in future versions
|
| 340 |
+
of the GPL, as needed to protect the freedom of users.
|
| 341 |
+
|
| 342 |
+
Finally, every program is threatened constantly by software patents.
|
| 343 |
+
States should not allow patents to restrict development and use of
|
| 344 |
+
software on general-purpose computers, but in those that do, we wish to
|
| 345 |
+
avoid the special danger that patents applied to a free program could
|
| 346 |
+
make it effectively proprietary. To prevent this, the GPL assures that
|
| 347 |
+
patents cannot be used to render the program non-free.
|
| 348 |
+
|
| 349 |
+
The precise terms and conditions for copying, distribution and
|
| 350 |
+
modification follow.
|
| 351 |
+
|
| 352 |
+
TERMS AND CONDITIONS
|
| 353 |
+
|
| 354 |
+
0. Definitions.
|
| 355 |
+
|
| 356 |
+
"This License" refers to version 3 of the GNU General Public License.
|
| 357 |
+
|
| 358 |
+
"Copyright" also means copyright-like laws that apply to other kinds of
|
| 359 |
+
works, such as semiconductor masks.
|
| 360 |
+
|
| 361 |
+
"The Program" refers to any copyrightable work licensed under this
|
| 362 |
+
License. Each licensee is addressed as "you". "Licensees" and
|
| 363 |
+
"recipients" may be individuals or organizations.
|
| 364 |
+
|
| 365 |
+
To "modify" a work means to copy from or adapt all or part of the work
|
| 366 |
+
in a fashion requiring copyright permission, other than the making of an
|
| 367 |
+
exact copy. The resulting work is called a "modified version" of the
|
| 368 |
+
earlier work or a work "based on" the earlier work.
|
| 369 |
+
|
| 370 |
+
A "covered work" means either the unmodified Program or a work based
|
| 371 |
+
on the Program.
|
| 372 |
+
|
| 373 |
+
To "propagate" a work means to do anything with it that, without
|
| 374 |
+
permission, would make you directly or secondarily liable for
|
| 375 |
+
infringement under applicable copyright law, except executing it on a
|
| 376 |
+
computer or modifying a private copy. Propagation includes copying,
|
| 377 |
+
distribution (with or without modification), making available to the
|
| 378 |
+
public, and in some countries other activities as well.
|
| 379 |
+
|
| 380 |
+
To "convey" a work means any kind of propagation that enables other
|
| 381 |
+
parties to make or receive copies. Mere interaction with a user through
|
| 382 |
+
a computer network, with no transfer of a copy, is not conveying.
|
| 383 |
+
|
| 384 |
+
An interactive user interface displays "Appropriate Legal Notices"
|
| 385 |
+
to the extent that it includes a convenient and prominently visible
|
| 386 |
+
feature that (1) displays an appropriate copyright notice, and (2)
|
| 387 |
+
tells the user that there is no warranty for the work (except to the
|
| 388 |
+
extent that warranties are provided), that licensees may convey the
|
| 389 |
+
work under this License, and how to view a copy of this License. If
|
| 390 |
+
the interface presents a list of user commands or options, such as a
|
| 391 |
+
menu, a prominent item in the list meets this criterion.
|
| 392 |
+
|
| 393 |
+
1. Source Code.
|
| 394 |
+
|
| 395 |
+
The "source code" for a work means the preferred form of the work
|
| 396 |
+
for making modifications to it. "Object code" means any non-source
|
| 397 |
+
form of a work.
|
| 398 |
+
|
| 399 |
+
A "Standard Interface" means an interface that either is an official
|
| 400 |
+
standard defined by a recognized standards body, or, in the case of
|
| 401 |
+
interfaces specified for a particular programming language, one that
|
| 402 |
+
is widely used among developers working in that language.
|
| 403 |
+
|
| 404 |
+
The "System Libraries" of an executable work include anything, other
|
| 405 |
+
than the work as a whole, that (a) is included in the normal form of
|
| 406 |
+
packaging a Major Component, but which is not part of that Major
|
| 407 |
+
Component, and (b) serves only to enable use of the work with that
|
| 408 |
+
Major Component, or to implement a Standard Interface for which an
|
| 409 |
+
implementation is available to the public in source code form. A
|
| 410 |
+
"Major Component", in this context, means a major essential component
|
| 411 |
+
(kernel, window system, and so on) of the specific operating system
|
| 412 |
+
(if any) on which the executable work runs, or a compiler used to
|
| 413 |
+
produce the work, or an object code interpreter used to run it.
|
| 414 |
+
|
| 415 |
+
The "Corresponding Source" for a work in object code form means all
|
| 416 |
+
the source code needed to generate, install, and (for an executable
|
| 417 |
+
work) run the object code and to modify the work, including scripts to
|
| 418 |
+
control those activities. However, it does not include the work's
|
| 419 |
+
System Libraries, or general-purpose tools or generally available free
|
| 420 |
+
programs which are used unmodified in performing those activities but
|
| 421 |
+
which are not part of the work. For example, Corresponding Source
|
| 422 |
+
includes interface definition files associated with source files for
|
| 423 |
+
the work, and the source code for shared libraries and dynamically
|
| 424 |
+
linked subprograms that the work is specifically designed to require,
|
| 425 |
+
such as by intimate data communication or control flow between those
|
| 426 |
+
subprograms and other parts of the work.
|
| 427 |
+
|
| 428 |
+
The Corresponding Source need not include anything that users
|
| 429 |
+
can regenerate automatically from other parts of the Corresponding
|
| 430 |
+
Source.
|
| 431 |
+
|
| 432 |
+
The Corresponding Source for a work in source code form is that
|
| 433 |
+
same work.
|
| 434 |
+
|
| 435 |
+
2. Basic Permissions.
|
| 436 |
+
|
| 437 |
+
All rights granted under this License are granted for the term of
|
| 438 |
+
copyright on the Program, and are irrevocable provided the stated
|
| 439 |
+
conditions are met. This License explicitly affirms your unlimited
|
| 440 |
+
permission to run the unmodified Program. The output from running a
|
| 441 |
+
covered work is covered by this License only if the output, given its
|
| 442 |
+
content, constitutes a covered work. This License acknowledges your
|
| 443 |
+
rights of fair use or other equivalent, as provided by copyright law.
|
| 444 |
+
|
| 445 |
+
You may make, run and propagate covered works that you do not
|
| 446 |
+
convey, without conditions so long as your license otherwise remains
|
| 447 |
+
in force. You may convey covered works to others for the sole purpose
|
| 448 |
+
of having them make modifications exclusively for you, or provide you
|
| 449 |
+
with facilities for running those works, provided that you comply with
|
| 450 |
+
the terms of this License in conveying all material for which you do
|
| 451 |
+
not control copyright. Those thus making or running the covered works
|
| 452 |
+
for you must do so exclusively on your behalf, under your direction
|
| 453 |
+
and control, on terms that prohibit them from making any copies of
|
| 454 |
+
your copyrighted material outside their relationship with you.
|
| 455 |
+
|
| 456 |
+
Conveying under any other circumstances is permitted solely under
|
| 457 |
+
the conditions stated below. Sublicensing is not allowed; section 10
|
| 458 |
+
makes it unnecessary.
|
| 459 |
+
|
| 460 |
+
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
| 461 |
+
|
| 462 |
+
No covered work shall be deemed part of an effective technological
|
| 463 |
+
measure under any applicable law fulfilling obligations under article
|
| 464 |
+
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
| 465 |
+
similar laws prohibiting or restricting circumvention of such
|
| 466 |
+
measures.
|
| 467 |
+
|
| 468 |
+
When you convey a covered work, you waive any legal power to forbid
|
| 469 |
+
circumvention of technological measures to the extent such circumvention
|
| 470 |
+
is effected by exercising rights under this License with respect to
|
| 471 |
+
the covered work, and you disclaim any intention to limit operation or
|
| 472 |
+
modification of the work as a means of enforcing, against the work's
|
| 473 |
+
users, your or third parties' legal rights to forbid circumvention of
|
| 474 |
+
technological measures.
|
| 475 |
+
|
| 476 |
+
4. Conveying Verbatim Copies.
|
| 477 |
+
|
| 478 |
+
You may convey verbatim copies of the Program's source code as you
|
| 479 |
+
receive it, in any medium, provided that you conspicuously and
|
| 480 |
+
appropriately publish on each copy an appropriate copyright notice;
|
| 481 |
+
keep intact all notices stating that this License and any
|
| 482 |
+
non-permissive terms added in accord with section 7 apply to the code;
|
| 483 |
+
keep intact all notices of the absence of any warranty; and give all
|
| 484 |
+
recipients a copy of this License along with the Program.
|
| 485 |
+
|
| 486 |
+
You may charge any price or no price for each copy that you convey,
|
| 487 |
+
and you may offer support or warranty protection for a fee.
|
| 488 |
+
|
| 489 |
+
5. Conveying Modified Source Versions.
|
| 490 |
+
|
| 491 |
+
You may convey a work based on the Program, or the modifications to
|
| 492 |
+
produce it from the Program, in the form of source code under the
|
| 493 |
+
terms of section 4, provided that you also meet all of these conditions:
|
| 494 |
+
|
| 495 |
+
a) The work must carry prominent notices stating that you modified
|
| 496 |
+
it, and giving a relevant date.
|
| 497 |
+
|
| 498 |
+
b) The work must carry prominent notices stating that it is
|
| 499 |
+
released under this License and any conditions added under section
|
| 500 |
+
7. This requirement modifies the requirement in section 4 to
|
| 501 |
+
"keep intact all notices".
|
| 502 |
+
|
| 503 |
+
c) You must license the entire work, as a whole, under this
|
| 504 |
+
License to anyone who comes into possession of a copy. This
|
| 505 |
+
License will therefore apply, along with any applicable section 7
|
| 506 |
+
additional terms, to the whole of the work, and all its parts,
|
| 507 |
+
regardless of how they are packaged. This License gives no
|
| 508 |
+
permission to license the work in any other way, but it does not
|
| 509 |
+
invalidate such permission if you have separately received it.
|
| 510 |
+
|
| 511 |
+
d) If the work has interactive user interfaces, each must display
|
| 512 |
+
Appropriate Legal Notices; however, if the Program has interactive
|
| 513 |
+
interfaces that do not display Appropriate Legal Notices, your
|
| 514 |
+
work need not make them do so.
|
| 515 |
+
|
| 516 |
+
A compilation of a covered work with other separate and independent
|
| 517 |
+
works, which are not by their nature extensions of the covered work,
|
| 518 |
+
and which are not combined with it such as to form a larger program,
|
| 519 |
+
in or on a volume of a storage or distribution medium, is called an
|
| 520 |
+
"aggregate" if the compilation and its resulting copyright are not
|
| 521 |
+
used to limit the access or legal rights of the compilation's users
|
| 522 |
+
beyond what the individual works permit. Inclusion of a covered work
|
| 523 |
+
in an aggregate does not cause this License to apply to the other
|
| 524 |
+
parts of the aggregate.
|
| 525 |
+
|
| 526 |
+
6. Conveying Non-Source Forms.
|
| 527 |
+
|
| 528 |
+
You may convey a covered work in object code form under the terms
|
| 529 |
+
of sections 4 and 5, provided that you also convey the
|
| 530 |
+
machine-readable Corresponding Source under the terms of this License,
|
| 531 |
+
in one of these ways:
|
| 532 |
+
|
| 533 |
+
a) Convey the object code in, or embodied in, a physical product
|
| 534 |
+
(including a physical distribution medium), accompanied by the
|
| 535 |
+
Corresponding Source fixed on a durable physical medium
|
| 536 |
+
customarily used for software interchange.
|
| 537 |
+
|
| 538 |
+
b) Convey the object code in, or embodied in, a physical product
|
| 539 |
+
(including a physical distribution medium), accompanied by a
|
| 540 |
+
written offer, valid for at least three years and valid for as
|
| 541 |
+
long as you offer spare parts or customer support for that product
|
| 542 |
+
model, to give anyone who possesses the object code either (1) a
|
| 543 |
+
copy of the Corresponding Source for all the software in the
|
| 544 |
+
product that is covered by this License, on a durable physical
|
| 545 |
+
medium customarily used for software interchange, for a price no
|
| 546 |
+
more than your reasonable cost of physically performing this
|
| 547 |
+
conveying of source, or (2) access to copy the
|
| 548 |
+
Corresponding Source from a network server at no charge.
|
| 549 |
+
|
| 550 |
+
c) Convey individual copies of the object code with a copy of the
|
| 551 |
+
written offer to provide the Corresponding Source. This
|
| 552 |
+
alternative is allowed only occasionally and noncommercially, and
|
| 553 |
+
only if you received the object code with such an offer, in accord
|
| 554 |
+
with subsection 6b.
|
| 555 |
+
|
| 556 |
+
d) Convey the object code by offering access from a designated
|
| 557 |
+
place (gratis or for a charge), and offer equivalent access to the
|
| 558 |
+
Corresponding Source in the same way through the same place at no
|
| 559 |
+
further charge. You need not require recipients to copy the
|
| 560 |
+
Corresponding Source along with the object code. If the place to
|
| 561 |
+
copy the object code is a network server, the Corresponding Source
|
| 562 |
+
may be on a different server (operated by you or a third party)
|
| 563 |
+
that supports equivalent copying facilities, provided you maintain
|
| 564 |
+
clear directions next to the object code saying where to find the
|
| 565 |
+
Corresponding Source. Regardless of what server hosts the
|
| 566 |
+
Corresponding Source, you remain obligated to ensure that it is
|
| 567 |
+
available for as long as needed to satisfy these requirements.
|
| 568 |
+
|
| 569 |
+
e) Convey the object code using peer-to-peer transmission, provided
|
| 570 |
+
you inform other peers where the object code and Corresponding
|
| 571 |
+
Source of the work are being offered to the general public at no
|
| 572 |
+
charge under subsection 6d.
|
| 573 |
+
|
| 574 |
+
A separable portion of the object code, whose source code is excluded
|
| 575 |
+
from the Corresponding Source as a System Library, need not be
|
| 576 |
+
included in conveying the object code work.
|
| 577 |
+
|
| 578 |
+
A "User Product" is either (1) a "consumer product", which means any
|
| 579 |
+
tangible personal property which is normally used for personal, family,
|
| 580 |
+
or household purposes, or (2) anything designed or sold for incorporation
|
| 581 |
+
into a dwelling. In determining whether a product is a consumer product,
|
| 582 |
+
doubtful cases shall be resolved in favor of coverage. For a particular
|
| 583 |
+
product received by a particular user, "normally used" refers to a
|
| 584 |
+
typical or common use of that class of product, regardless of the status
|
| 585 |
+
of the particular user or of the way in which the particular user
|
| 586 |
+
actually uses, or expects or is expected to use, the product. A product
|
| 587 |
+
is a consumer product regardless of whether the product has substantial
|
| 588 |
+
commercial, industrial or non-consumer uses, unless such uses represent
|
| 589 |
+
the only significant mode of use of the product.
|
| 590 |
+
|
| 591 |
+
"Installation Information" for a User Product means any methods,
|
| 592 |
+
procedures, authorization keys, or other information required to install
|
| 593 |
+
and execute modified versions of a covered work in that User Product from
|
| 594 |
+
a modified version of its Corresponding Source. The information must
|
| 595 |
+
suffice to ensure that the continued functioning of the modified object
|
| 596 |
+
code is in no case prevented or interfered with solely because
|
| 597 |
+
modification has been made.
|
| 598 |
+
|
| 599 |
+
If you convey an object code work under this section in, or with, or
|
| 600 |
+
specifically for use in, a User Product, and the conveying occurs as
|
| 601 |
+
part of a transaction in which the right of possession and use of the
|
| 602 |
+
User Product is transferred to the recipient in perpetuity or for a
|
| 603 |
+
fixed term (regardless of how the transaction is characterized), the
|
| 604 |
+
Corresponding Source conveyed under this section must be accompanied
|
| 605 |
+
by the Installation Information. But this requirement does not apply
|
| 606 |
+
if neither you nor any third party retains the ability to install
|
| 607 |
+
modified object code on the User Product (for example, the work has
|
| 608 |
+
been installed in ROM).
|
| 609 |
+
|
| 610 |
+
The requirement to provide Installation Information does not include a
|
| 611 |
+
requirement to continue to provide support service, warranty, or updates
|
| 612 |
+
for a work that has been modified or installed by the recipient, or for
|
| 613 |
+
the User Product in which it has been modified or installed. Access to a
|
| 614 |
+
network may be denied when the modification itself materially and
|
| 615 |
+
adversely affects the operation of the network or violates the rules and
|
| 616 |
+
protocols for communication across the network.
|
| 617 |
+
|
| 618 |
+
Corresponding Source conveyed, and Installation Information provided,
|
| 619 |
+
in accord with this section must be in a format that is publicly
|
| 620 |
+
documented (and with an implementation available to the public in
|
| 621 |
+
source code form), and must require no special password or key for
|
| 622 |
+
unpacking, reading or copying.
|
| 623 |
+
|
| 624 |
+
7. Additional Terms.
|
| 625 |
+
|
| 626 |
+
"Additional permissions" are terms that supplement the terms of this
|
| 627 |
+
License by making exceptions from one or more of its conditions.
|
| 628 |
+
Additional permissions that are applicable to the entire Program shall
|
| 629 |
+
be treated as though they were included in this License, to the extent
|
| 630 |
+
that they are valid under applicable law. If additional permissions
|
| 631 |
+
apply only to part of the Program, that part may be used separately
|
| 632 |
+
under those permissions, but the entire Program remains governed by
|
| 633 |
+
this License without regard to the additional permissions.
|
| 634 |
+
|
| 635 |
+
When you convey a copy of a covered work, you may at your option
|
| 636 |
+
remove any additional permissions from that copy, or from any part of
|
| 637 |
+
it. (Additional permissions may be written to require their own
|
| 638 |
+
removal in certain cases when you modify the work.) You may place
|
| 639 |
+
additional permissions on material, added by you to a covered work,
|
| 640 |
+
for which you have or can give appropriate copyright permission.
|
| 641 |
+
|
| 642 |
+
Notwithstanding any other provision of this License, for material you
|
| 643 |
+
add to a covered work, you may (if authorized by the copyright holders of
|
| 644 |
+
that material) supplement the terms of this License with terms:
|
| 645 |
+
|
| 646 |
+
a) Disclaiming warranty or limiting liability differently from the
|
| 647 |
+
terms of sections 15 and 16 of this License; or
|
| 648 |
+
|
| 649 |
+
b) Requiring preservation of specified reasonable legal notices or
|
| 650 |
+
author attributions in that material or in the Appropriate Legal
|
| 651 |
+
Notices displayed by works containing it; or
|
| 652 |
+
|
| 653 |
+
c) Prohibiting misrepresentation of the origin of that material, or
|
| 654 |
+
requiring that modified versions of such material be marked in
|
| 655 |
+
reasonable ways as different from the original version; or
|
| 656 |
+
|
| 657 |
+
d) Limiting the use for publicity purposes of names of licensors or
|
| 658 |
+
authors of the material; or
|
| 659 |
+
|
| 660 |
+
e) Declining to grant rights under trademark law for use of some
|
| 661 |
+
trade names, trademarks, or service marks; or
|
| 662 |
+
|
| 663 |
+
f) Requiring indemnification of licensors and authors of that
|
| 664 |
+
material by anyone who conveys the material (or modified versions of
|
| 665 |
+
it) with contractual assumptions of liability to the recipient, for
|
| 666 |
+
any liability that these contractual assumptions directly impose on
|
| 667 |
+
those licensors and authors.
|
| 668 |
+
|
| 669 |
+
All other non-permissive additional terms are considered "further
|
| 670 |
+
restrictions" within the meaning of section 10. If the Program as you
|
| 671 |
+
received it, or any part of it, contains a notice stating that it is
|
| 672 |
+
governed by this License along with a term that is a further
|
| 673 |
+
restriction, you may remove that term. If a license document contains
|
| 674 |
+
a further restriction but permits relicensing or conveying under this
|
| 675 |
+
License, you may add to a covered work material governed by the terms
|
| 676 |
+
of that license document, provided that the further restriction does
|
| 677 |
+
not survive such relicensing or conveying.
|
| 678 |
+
|
| 679 |
+
If you add terms to a covered work in accord with this section, you
|
| 680 |
+
must place, in the relevant source files, a statement of the
|
| 681 |
+
additional terms that apply to those files, or a notice indicating
|
| 682 |
+
where to find the applicable terms.
|
| 683 |
+
|
| 684 |
+
Additional terms, permissive or non-permissive, may be stated in the
|
| 685 |
+
form of a separately written license, or stated as exceptions;
|
| 686 |
+
the above requirements apply either way.
|
| 687 |
+
|
| 688 |
+
8. Termination.
|
| 689 |
+
|
| 690 |
+
You may not propagate or modify a covered work except as expressly
|
| 691 |
+
provided under this License. Any attempt otherwise to propagate or
|
| 692 |
+
modify it is void, and will automatically terminate your rights under
|
| 693 |
+
this License (including any patent licenses granted under the third
|
| 694 |
+
paragraph of section 11).
|
| 695 |
+
|
| 696 |
+
However, if you cease all violation of this License, then your
|
| 697 |
+
license from a particular copyright holder is reinstated (a)
|
| 698 |
+
provisionally, unless and until the copyright holder explicitly and
|
| 699 |
+
finally terminates your license, and (b) permanently, if the copyright
|
| 700 |
+
holder fails to notify you of the violation by some reasonable means
|
| 701 |
+
prior to 60 days after the cessation.
|
| 702 |
+
|
| 703 |
+
Moreover, your license from a particular copyright holder is
|
| 704 |
+
reinstated permanently if the copyright holder notifies you of the
|
| 705 |
+
violation by some reasonable means, this is the first time you have
|
| 706 |
+
received notice of violation of this License (for any work) from that
|
| 707 |
+
copyright holder, and you cure the violation prior to 30 days after
|
| 708 |
+
your receipt of the notice.
|
| 709 |
+
|
| 710 |
+
Termination of your rights under this section does not terminate the
|
| 711 |
+
licenses of parties who have received copies or rights from you under
|
| 712 |
+
this License. If your rights have been terminated and not permanently
|
| 713 |
+
reinstated, you do not qualify to receive new licenses for the same
|
| 714 |
+
material under section 10.
|
| 715 |
+
|
| 716 |
+
9. Acceptance Not Required for Having Copies.
|
| 717 |
+
|
| 718 |
+
You are not required to accept this License in order to receive or
|
| 719 |
+
run a copy of the Program. Ancillary propagation of a covered work
|
| 720 |
+
occurring solely as a consequence of using peer-to-peer transmission
|
| 721 |
+
to receive a copy likewise does not require acceptance. However,
|
| 722 |
+
nothing other than this License grants you permission to propagate or
|
| 723 |
+
modify any covered work. These actions infringe copyright if you do
|
| 724 |
+
not accept this License. Therefore, by modifying or propagating a
|
| 725 |
+
covered work, you indicate your acceptance of this License to do so.
|
| 726 |
+
|
| 727 |
+
10. Automatic Licensing of Downstream Recipients.
|
| 728 |
+
|
| 729 |
+
Each time you convey a covered work, the recipient automatically
|
| 730 |
+
receives a license from the original licensors, to run, modify and
|
| 731 |
+
propagate that work, subject to this License. You are not responsible
|
| 732 |
+
for enforcing compliance by third parties with this License.
|
| 733 |
+
|
| 734 |
+
An "entity transaction" is a transaction transferring control of an
|
| 735 |
+
organization, or substantially all assets of one, or subdividing an
|
| 736 |
+
organization, or merging organizations. If propagation of a covered
|
| 737 |
+
work results from an entity transaction, each party to that
|
| 738 |
+
transaction who receives a copy of the work also receives whatever
|
| 739 |
+
licenses to the work the party's predecessor in interest had or could
|
| 740 |
+
give under the previous paragraph, plus a right to possession of the
|
| 741 |
+
Corresponding Source of the work from the predecessor in interest, if
|
| 742 |
+
the predecessor has it or can get it with reasonable efforts.
|
| 743 |
+
|
| 744 |
+
You may not impose any further restrictions on the exercise of the
|
| 745 |
+
rights granted or affirmed under this License. For example, you may
|
| 746 |
+
not impose a license fee, royalty, or other charge for exercise of
|
| 747 |
+
rights granted under this License, and you may not initiate litigation
|
| 748 |
+
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
| 749 |
+
any patent claim is infringed by making, using, selling, offering for
|
| 750 |
+
sale, or importing the Program or any portion of it.
|
| 751 |
+
|
| 752 |
+
11. Patents.
|
| 753 |
+
|
| 754 |
+
A "contributor" is a copyright holder who authorizes use under this
|
| 755 |
+
License of the Program or a work on which the Program is based. The
|
| 756 |
+
work thus licensed is called the contributor's "contributor version".
|
| 757 |
+
|
| 758 |
+
A contributor's "essential patent claims" are all patent claims
|
| 759 |
+
owned or controlled by the contributor, whether already acquired or
|
| 760 |
+
hereafter acquired, that would be infringed by some manner, permitted
|
| 761 |
+
by this License, of making, using, or selling its contributor version,
|
| 762 |
+
but do not include claims that would be infringed only as a
|
| 763 |
+
consequence of further modification of the contributor version. For
|
| 764 |
+
purposes of this definition, "control" includes the right to grant
|
| 765 |
+
patent sublicenses in a manner consistent with the requirements of
|
| 766 |
+
this License.
|
| 767 |
+
|
| 768 |
+
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
| 769 |
+
patent license under the contributor's essential patent claims, to
|
| 770 |
+
make, use, sell, offer for sale, import and otherwise run, modify and
|
| 771 |
+
propagate the contents of its contributor version.
|
| 772 |
+
|
| 773 |
+
In the following three paragraphs, a "patent license" is any express
|
| 774 |
+
agreement or commitment, however denominated, not to enforce a patent
|
| 775 |
+
(such as an express permission to practice a patent or covenant not to
|
| 776 |
+
sue for patent infringement). To "grant" such a patent license to a
|
| 777 |
+
party means to make such an agreement or commitment not to enforce a
|
| 778 |
+
patent against the party.
|
| 779 |
+
|
| 780 |
+
If you convey a covered work, knowingly relying on a patent license,
|
| 781 |
+
and the Corresponding Source of the work is not available for anyone
|
| 782 |
+
to copy, free of charge and under the terms of this License, through a
|
| 783 |
+
publicly available network server or other readily accessible means,
|
| 784 |
+
then you must either (1) cause the Corresponding Source to be so
|
| 785 |
+
available, or (2) arrange to deprive yourself of the benefit of the
|
| 786 |
+
patent license for this particular work, or (3) arrange, in a manner
|
| 787 |
+
consistent with the requirements of this License, to extend the patent
|
| 788 |
+
license to downstream recipients. "Knowingly relying" means you have
|
| 789 |
+
actual knowledge that, but for the patent license, your conveying the
|
| 790 |
+
covered work in a country, or your recipient's use of the covered work
|
| 791 |
+
in a country, would infringe one or more identifiable patents in that
|
| 792 |
+
country that you have reason to believe are valid.
|
| 793 |
+
|
| 794 |
+
If, pursuant to or in connection with a single transaction or
|
| 795 |
+
arrangement, you convey, or propagate by procuring conveyance of, a
|
| 796 |
+
covered work, and grant a patent license to some of the parties
|
| 797 |
+
receiving the covered work authorizing them to use, propagate, modify
|
| 798 |
+
or convey a specific copy of the covered work, then the patent license
|
| 799 |
+
you grant is automatically extended to all recipients of the covered
|
| 800 |
+
work and works based on it.
|
| 801 |
+
|
| 802 |
+
A patent license is "discriminatory" if it does not include within
|
| 803 |
+
the scope of its coverage, prohibits the exercise of, or is
|
| 804 |
+
conditioned on the non-exercise of one or more of the rights that are
|
| 805 |
+
specifically granted under this License. You may not convey a covered
|
| 806 |
+
work if you are a party to an arrangement with a third party that is
|
| 807 |
+
in the business of distributing software, under which you make payment
|
| 808 |
+
to the third party based on the extent of your activity of conveying
|
| 809 |
+
the work, and under which the third party grants, to any of the
|
| 810 |
+
parties who would receive the covered work from you, a discriminatory
|
| 811 |
+
patent license (a) in connection with copies of the covered work
|
| 812 |
+
conveyed by you (or copies made from those copies), or (b) primarily
|
| 813 |
+
for and in connection with specific products or compilations that
|
| 814 |
+
contain the covered work, unless you entered into that arrangement,
|
| 815 |
+
or that patent license was granted, prior to 28 March 2007.
|
| 816 |
+
|
| 817 |
+
Nothing in this License shall be construed as excluding or limiting
|
| 818 |
+
any implied license or other defenses to infringement that may
|
| 819 |
+
otherwise be available to you under applicable patent law.
|
| 820 |
+
|
| 821 |
+
12. No Surrender of Others' Freedom.
|
| 822 |
+
|
| 823 |
+
If conditions are imposed on you (whether by court order, agreement or
|
| 824 |
+
otherwise) that contradict the conditions of this License, they do not
|
| 825 |
+
excuse you from the conditions of this License. If you cannot convey a
|
| 826 |
+
covered work so as to satisfy simultaneously your obligations under this
|
| 827 |
+
License and any other pertinent obligations, then as a consequence you may
|
| 828 |
+
not convey it at all. For example, if you agree to terms that obligate you
|
| 829 |
+
to collect a royalty for further conveying from those to whom you convey
|
| 830 |
+
the Program, the only way you could satisfy both those terms and this
|
| 831 |
+
License would be to refrain entirely from conveying the Program.
|
| 832 |
+
|
| 833 |
+
13. Use with the GNU Affero General Public License.
|
| 834 |
+
|
| 835 |
+
Notwithstanding any other provision of this License, you have
|
| 836 |
+
permission to link or combine any covered work with a work licensed
|
| 837 |
+
under version 3 of the GNU Affero General Public License into a single
|
| 838 |
+
combined work, and to convey the resulting work. The terms of this
|
| 839 |
+
License will continue to apply to the part which is the covered work,
|
| 840 |
+
but the special requirements of the GNU Affero General Public License,
|
| 841 |
+
section 13, concerning interaction through a network will apply to the
|
| 842 |
+
combination as such.
|
| 843 |
+
|
| 844 |
+
14. Revised Versions of this License.
|
| 845 |
+
|
| 846 |
+
The Free Software Foundation may publish revised and/or new versions of
|
| 847 |
+
the GNU General Public License from time to time. Such new versions will
|
| 848 |
+
be similar in spirit to the present version, but may differ in detail to
|
| 849 |
+
address new problems or concerns.
|
| 850 |
+
|
| 851 |
+
Each version is given a distinguishing version number. If the
|
| 852 |
+
Program specifies that a certain numbered version of the GNU General
|
| 853 |
+
Public License "or any later version" applies to it, you have the
|
| 854 |
+
option of following the terms and conditions either of that numbered
|
| 855 |
+
version or of any later version published by the Free Software
|
| 856 |
+
Foundation. If the Program does not specify a version number of the
|
| 857 |
+
GNU General Public License, you may choose any version ever published
|
| 858 |
+
by the Free Software Foundation.
|
| 859 |
+
|
| 860 |
+
If the Program specifies that a proxy can decide which future
|
| 861 |
+
versions of the GNU General Public License can be used, that proxy's
|
| 862 |
+
public statement of acceptance of a version permanently authorizes you
|
| 863 |
+
to choose that version for the Program.
|
| 864 |
+
|
| 865 |
+
Later license versions may give you additional or different
|
| 866 |
+
permissions. However, no additional obligations are imposed on any
|
| 867 |
+
author or copyright holder as a result of your choosing to follow a
|
| 868 |
+
later version.
|
| 869 |
+
|
| 870 |
+
15. Disclaimer of Warranty.
|
| 871 |
+
|
| 872 |
+
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
| 873 |
+
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
| 874 |
+
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
| 875 |
+
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
| 876 |
+
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
| 877 |
+
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
| 878 |
+
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
| 879 |
+
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
| 880 |
+
|
| 881 |
+
16. Limitation of Liability.
|
| 882 |
+
|
| 883 |
+
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
| 884 |
+
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
| 885 |
+
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
| 886 |
+
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
| 887 |
+
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
| 888 |
+
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
| 889 |
+
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
| 890 |
+
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
| 891 |
+
SUCH DAMAGES.
|
| 892 |
+
|
| 893 |
+
17. Interpretation of Sections 15 and 16.
|
| 894 |
+
|
| 895 |
+
If the disclaimer of warranty and limitation of liability provided
|
| 896 |
+
above cannot be given local legal effect according to their terms,
|
| 897 |
+
reviewing courts shall apply local law that most closely approximates
|
| 898 |
+
an absolute waiver of all civil liability in connection with the
|
| 899 |
+
Program, unless a warranty or assumption of liability accompanies a
|
| 900 |
+
copy of the Program in return for a fee.
|
| 901 |
+
|
| 902 |
+
END OF TERMS AND CONDITIONS
|
| 903 |
+
|
| 904 |
+
How to Apply These Terms to Your New Programs
|
| 905 |
+
|
| 906 |
+
If you develop a new program, and you want it to be of the greatest
|
| 907 |
+
possible use to the public, the best way to achieve this is to make it
|
| 908 |
+
free software which everyone can redistribute and change under these terms.
|
| 909 |
+
|
| 910 |
+
To do so, attach the following notices to the program. It is safest
|
| 911 |
+
to attach them to the start of each source file to most effectively
|
| 912 |
+
state the exclusion of warranty; and each file should have at least
|
| 913 |
+
the "copyright" line and a pointer to where the full notice is found.
|
| 914 |
+
|
| 915 |
+
<one line to give the program's name and a brief idea of what it does.>
|
| 916 |
+
Copyright (C) <year> <name of author>
|
| 917 |
+
|
| 918 |
+
This program is free software: you can redistribute it and/or modify
|
| 919 |
+
it under the terms of the GNU General Public License as published by
|
| 920 |
+
the Free Software Foundation, either version 3 of the License, or
|
| 921 |
+
(at your option) any later version.
|
| 922 |
+
|
| 923 |
+
This program is distributed in the hope that it will be useful,
|
| 924 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 925 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 926 |
+
GNU General Public License for more details.
|
| 927 |
+
|
| 928 |
+
You should have received a copy of the GNU General Public License
|
| 929 |
+
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
| 930 |
+
|
| 931 |
+
Also add information on how to contact you by electronic and paper mail.
|
| 932 |
+
|
| 933 |
+
If the program does terminal interaction, make it output a short
|
| 934 |
+
notice like this when it starts in an interactive mode:
|
| 935 |
+
|
| 936 |
+
<program> Copyright (C) <year> <name of author>
|
| 937 |
+
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
| 938 |
+
This is free software, and you are welcome to redistribute it
|
| 939 |
+
under certain conditions; type `show c' for details.
|
| 940 |
+
|
| 941 |
+
The hypothetical commands `show w' and `show c' should show the appropriate
|
| 942 |
+
parts of the General Public License. Of course, your program's commands
|
| 943 |
+
might be different; for a GUI interface, you would use an "about box".
|
| 944 |
+
|
| 945 |
+
You should also get your employer (if you work as a programmer) or school,
|
| 946 |
+
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
| 947 |
+
For more information on this, and how to apply and follow the GNU GPL, see
|
| 948 |
+
<https://www.gnu.org/licenses/>.
|
| 949 |
+
|
| 950 |
+
The GNU General Public License does not permit incorporating your program
|
| 951 |
+
into proprietary programs. If your program is a subroutine library, you
|
| 952 |
+
may consider it more useful to permit linking proprietary applications with
|
| 953 |
+
the library. If this is what you want to do, use the GNU Lesser General
|
| 954 |
+
Public License instead of this License. But first, please read
|
| 955 |
+
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
| 956 |
+
|
| 957 |
+
Name: libquadmath
|
| 958 |
+
Files: numpy.libs/libquadmath*.so
|
| 959 |
+
Description: dynamically linked to files compiled with gcc
|
| 960 |
+
Availability: https://gcc.gnu.org/git/?p=gcc.git;a=tree;f=libquadmath
|
| 961 |
+
License: LGPL-2.1-or-later
|
| 962 |
+
|
| 963 |
+
GCC Quad-Precision Math Library
|
| 964 |
+
Copyright (C) 2010-2019 Free Software Foundation, Inc.
|
| 965 |
+
Written by Francois-Xavier Coudert <fxcoudert@gcc.gnu.org>
|
| 966 |
+
|
| 967 |
+
This file is part of the libquadmath library.
|
| 968 |
+
Libquadmath is free software; you can redistribute it and/or
|
| 969 |
+
modify it under the terms of the GNU Library General Public
|
| 970 |
+
License as published by the Free Software Foundation; either
|
| 971 |
+
version 2.1 of the License, or (at your option) any later version.
|
| 972 |
+
|
| 973 |
+
Libquadmath is distributed in the hope that it will be useful,
|
| 974 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 975 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
| 976 |
+
Lesser General Public License for more details.
|
| 977 |
+
https://www.gnu.org/licenses/old-licenses/lgpl-2.1.html
|
| 978 |
+
|
| 979 |
+
Classifier: Development Status :: 5 - Production/Stable
|
| 980 |
+
Classifier: Intended Audience :: Science/Research
|
| 981 |
+
Classifier: Intended Audience :: Developers
|
| 982 |
+
Classifier: License :: OSI Approved :: BSD License
|
| 983 |
+
Classifier: Programming Language :: C
|
| 984 |
+
Classifier: Programming Language :: Python
|
| 985 |
+
Classifier: Programming Language :: Python :: 3
|
| 986 |
+
Classifier: Programming Language :: Python :: 3.11
|
| 987 |
+
Classifier: Programming Language :: Python :: 3.12
|
| 988 |
+
Classifier: Programming Language :: Python :: 3.13
|
| 989 |
+
Classifier: Programming Language :: Python :: 3.14
|
| 990 |
+
Classifier: Programming Language :: Python :: 3 :: Only
|
| 991 |
+
Classifier: Programming Language :: Python :: Implementation :: CPython
|
| 992 |
+
Classifier: Topic :: Software Development
|
| 993 |
+
Classifier: Topic :: Scientific/Engineering
|
| 994 |
+
Classifier: Typing :: Typed
|
| 995 |
+
Classifier: Operating System :: Microsoft :: Windows
|
| 996 |
+
Classifier: Operating System :: POSIX
|
| 997 |
+
Classifier: Operating System :: Unix
|
| 998 |
+
Classifier: Operating System :: MacOS
|
| 999 |
+
Project-URL: homepage, https://numpy.org
|
| 1000 |
+
Project-URL: documentation, https://numpy.org/doc/
|
| 1001 |
+
Project-URL: source, https://github.com/numpy/numpy
|
| 1002 |
+
Project-URL: download, https://pypi.org/project/numpy/#files
|
| 1003 |
+
Project-URL: tracker, https://github.com/numpy/numpy/issues
|
| 1004 |
+
Project-URL: release notes, https://numpy.org/doc/stable/release
|
| 1005 |
+
Requires-Python: >=3.11
|
| 1006 |
+
Description-Content-Type: text/markdown
|
| 1007 |
+
|
| 1008 |
+
<h1 align="center">
|
| 1009 |
+
<img src="https://raw.githubusercontent.com/numpy/numpy/main/branding/logo/primary/numpylogo.svg" width="300">
|
| 1010 |
+
</h1><br>
|
| 1011 |
+
|
| 1012 |
+
|
| 1013 |
+
[](
|
| 1014 |
+
https://numfocus.org)
|
| 1015 |
+
[](
|
| 1016 |
+
https://pypi.org/project/numpy/)
|
| 1017 |
+
[](
|
| 1018 |
+
https://anaconda.org/conda-forge/numpy)
|
| 1019 |
+
[](
|
| 1020 |
+
https://stackoverflow.com/questions/tagged/numpy)
|
| 1021 |
+
[](
|
| 1022 |
+
https://doi.org/10.1038/s41586-020-2649-2)
|
| 1023 |
+
[](https://securityscorecards.dev/viewer/?uri=github.com/numpy/numpy)
|
| 1024 |
+
[](https://pypi.org/project/numpy/)
|
| 1025 |
+
|
| 1026 |
+
|
| 1027 |
+
NumPy is the fundamental package for scientific computing with Python.
|
| 1028 |
+
|
| 1029 |
+
- **Website:** https://numpy.org
|
| 1030 |
+
- **Documentation:** https://numpy.org/doc
|
| 1031 |
+
- **Mailing list:** https://mail.python.org/mailman/listinfo/numpy-discussion
|
| 1032 |
+
- **Source code:** https://github.com/numpy/numpy
|
| 1033 |
+
- **Contributing:** https://numpy.org/devdocs/dev/index.html
|
| 1034 |
+
- **Bug reports:** https://github.com/numpy/numpy/issues
|
| 1035 |
+
- **Report a security vulnerability:** https://tidelift.com/docs/security
|
| 1036 |
+
|
| 1037 |
+
It provides:
|
| 1038 |
+
|
| 1039 |
+
- a powerful N-dimensional array object
|
| 1040 |
+
- sophisticated (broadcasting) functions
|
| 1041 |
+
- tools for integrating C/C++ and Fortran code
|
| 1042 |
+
- useful linear algebra, Fourier transform, and random number capabilities
|
| 1043 |
+
|
| 1044 |
+
Testing:
|
| 1045 |
+
|
| 1046 |
+
NumPy requires `pytest` and `hypothesis`. Tests can then be run after installation with:
|
| 1047 |
+
|
| 1048 |
+
python -c "import numpy, sys; sys.exit(numpy.test() is False)"
|
| 1049 |
+
|
| 1050 |
+
Code of Conduct
|
| 1051 |
+
----------------------
|
| 1052 |
+
|
| 1053 |
+
NumPy is a community-driven open source project developed by a diverse group of
|
| 1054 |
+
[contributors](https://numpy.org/teams/). The NumPy leadership has made a strong
|
| 1055 |
+
commitment to creating an open, inclusive, and positive community. Please read the
|
| 1056 |
+
[NumPy Code of Conduct](https://numpy.org/code-of-conduct/) for guidance on how to interact
|
| 1057 |
+
with others in a way that makes our community thrive.
|
| 1058 |
+
|
| 1059 |
+
Call for Contributions
|
| 1060 |
+
----------------------
|
| 1061 |
+
|
| 1062 |
+
The NumPy project welcomes your expertise and enthusiasm!
|
| 1063 |
+
|
| 1064 |
+
Small improvements or fixes are always appreciated. If you are considering larger contributions
|
| 1065 |
+
to the source code, please contact us through the [mailing
|
| 1066 |
+
list](https://mail.python.org/mailman/listinfo/numpy-discussion) first.
|
| 1067 |
+
|
| 1068 |
+
Writing code isn’t the only way to contribute to NumPy. You can also:
|
| 1069 |
+
- review pull requests
|
| 1070 |
+
- help us stay on top of new and old issues
|
| 1071 |
+
- develop tutorials, presentations, and other educational materials
|
| 1072 |
+
- maintain and improve [our website](https://github.com/numpy/numpy.org)
|
| 1073 |
+
- develop graphic design for our brand assets and promotional materials
|
| 1074 |
+
- translate website content
|
| 1075 |
+
- help with outreach and onboard new contributors
|
| 1076 |
+
- write grant proposals and help with other fundraising efforts
|
| 1077 |
+
|
| 1078 |
+
For more information about the ways you can contribute to NumPy, visit [our website](https://numpy.org/contribute/).
|
| 1079 |
+
If you’re unsure where to start or how your skills fit in, reach out! You can
|
| 1080 |
+
ask on the mailing list or here, on GitHub, by opening a new issue or leaving a
|
| 1081 |
+
comment on a relevant issue that is already open.
|
| 1082 |
+
|
| 1083 |
+
Our preferred channels of communication are all public, but if you’d like to
|
| 1084 |
+
speak to us in private first, contact our community coordinators at
|
| 1085 |
+
numpy-team@googlegroups.com or on Slack (write numpy-team@googlegroups.com for
|
| 1086 |
+
an invitation).
|
| 1087 |
+
|
| 1088 |
+
We also have a biweekly community call, details of which are announced on the
|
| 1089 |
+
mailing list. You are very welcome to join.
|
| 1090 |
+
|
| 1091 |
+
If you are new to contributing to open source, [this
|
| 1092 |
+
guide](https://opensource.guide/how-to-contribute/) helps explain why, what,
|
| 1093 |
+
and how to successfully get involved.
|
.venv/lib/python3.12/site-packages/numpy/__config__.pyi
ADDED
|
@@ -0,0 +1,102 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from enum import Enum
|
| 2 |
+
from types import ModuleType
|
| 3 |
+
from typing import Final, NotRequired, TypedDict, overload, type_check_only
|
| 4 |
+
from typing import Literal as L
|
| 5 |
+
|
| 6 |
+
_CompilerConfigDictValue = TypedDict(
|
| 7 |
+
"_CompilerConfigDictValue",
|
| 8 |
+
{
|
| 9 |
+
"name": str,
|
| 10 |
+
"linker": str,
|
| 11 |
+
"version": str,
|
| 12 |
+
"commands": str,
|
| 13 |
+
"args": str,
|
| 14 |
+
"linker args": str,
|
| 15 |
+
},
|
| 16 |
+
)
|
| 17 |
+
_CompilerConfigDict = TypedDict(
|
| 18 |
+
"_CompilerConfigDict",
|
| 19 |
+
{
|
| 20 |
+
"c": _CompilerConfigDictValue,
|
| 21 |
+
"cython": _CompilerConfigDictValue,
|
| 22 |
+
"c++": _CompilerConfigDictValue,
|
| 23 |
+
},
|
| 24 |
+
)
|
| 25 |
+
_MachineInformationDict = TypedDict(
|
| 26 |
+
"_MachineInformationDict",
|
| 27 |
+
{
|
| 28 |
+
"host": _MachineInformationDictValue,
|
| 29 |
+
"build": _MachineInformationDictValue,
|
| 30 |
+
"cross-compiled": NotRequired[L[True]],
|
| 31 |
+
},
|
| 32 |
+
)
|
| 33 |
+
|
| 34 |
+
@type_check_only
|
| 35 |
+
class _MachineInformationDictValue(TypedDict):
|
| 36 |
+
cpu: str
|
| 37 |
+
family: str
|
| 38 |
+
endian: L["little", "big"]
|
| 39 |
+
system: str
|
| 40 |
+
|
| 41 |
+
_BuildDependenciesDictValue = TypedDict(
|
| 42 |
+
"_BuildDependenciesDictValue",
|
| 43 |
+
{
|
| 44 |
+
"name": str,
|
| 45 |
+
"found": NotRequired[L[True]],
|
| 46 |
+
"version": str,
|
| 47 |
+
"include directory": str,
|
| 48 |
+
"lib directory": str,
|
| 49 |
+
"openblas configuration": str,
|
| 50 |
+
"pc file directory": str,
|
| 51 |
+
},
|
| 52 |
+
)
|
| 53 |
+
|
| 54 |
+
class _BuildDependenciesDict(TypedDict):
|
| 55 |
+
blas: _BuildDependenciesDictValue
|
| 56 |
+
lapack: _BuildDependenciesDictValue
|
| 57 |
+
|
| 58 |
+
class _PythonInformationDict(TypedDict):
|
| 59 |
+
path: str
|
| 60 |
+
version: str
|
| 61 |
+
|
| 62 |
+
_SIMDExtensionsDict = TypedDict(
|
| 63 |
+
"_SIMDExtensionsDict",
|
| 64 |
+
{
|
| 65 |
+
"baseline": list[str],
|
| 66 |
+
"found": list[str],
|
| 67 |
+
"not found": list[str],
|
| 68 |
+
},
|
| 69 |
+
)
|
| 70 |
+
|
| 71 |
+
_ConfigDict = TypedDict(
|
| 72 |
+
"_ConfigDict",
|
| 73 |
+
{
|
| 74 |
+
"Compilers": _CompilerConfigDict,
|
| 75 |
+
"Machine Information": _MachineInformationDict,
|
| 76 |
+
"Build Dependencies": _BuildDependenciesDict,
|
| 77 |
+
"Python Information": _PythonInformationDict,
|
| 78 |
+
"SIMD Extensions": _SIMDExtensionsDict,
|
| 79 |
+
},
|
| 80 |
+
)
|
| 81 |
+
|
| 82 |
+
###
|
| 83 |
+
|
| 84 |
+
__all__ = ["show_config"]
|
| 85 |
+
|
| 86 |
+
CONFIG: Final[_ConfigDict] = ...
|
| 87 |
+
|
| 88 |
+
class DisplayModes(Enum):
|
| 89 |
+
stdout = "stdout"
|
| 90 |
+
dicts = "dicts"
|
| 91 |
+
|
| 92 |
+
def _check_pyyaml() -> ModuleType: ...
|
| 93 |
+
|
| 94 |
+
@overload
|
| 95 |
+
def show(mode: L["stdout"] = "stdout") -> None: ...
|
| 96 |
+
@overload
|
| 97 |
+
def show(mode: L["dicts"]) -> _ConfigDict: ...
|
| 98 |
+
|
| 99 |
+
@overload
|
| 100 |
+
def show_config(mode: L["stdout"] = "stdout") -> None: ...
|
| 101 |
+
@overload
|
| 102 |
+
def show_config(mode: L["dicts"]) -> _ConfigDict: ...
|
.venv/lib/python3.12/site-packages/numpy/__init__.py
ADDED
|
@@ -0,0 +1,945 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""
|
| 2 |
+
NumPy
|
| 3 |
+
=====
|
| 4 |
+
|
| 5 |
+
Provides
|
| 6 |
+
1. An array object of arbitrary homogeneous items
|
| 7 |
+
2. Fast mathematical operations over arrays
|
| 8 |
+
3. Linear Algebra, Fourier Transforms, Random Number Generation
|
| 9 |
+
|
| 10 |
+
How to use the documentation
|
| 11 |
+
----------------------------
|
| 12 |
+
Documentation is available in two forms: docstrings provided
|
| 13 |
+
with the code, and a loose standing reference guide, available from
|
| 14 |
+
`the NumPy homepage <https://numpy.org>`_.
|
| 15 |
+
|
| 16 |
+
We recommend exploring the docstrings using
|
| 17 |
+
`IPython <https://ipython.org>`_, an advanced Python shell with
|
| 18 |
+
TAB-completion and introspection capabilities. See below for further
|
| 19 |
+
instructions.
|
| 20 |
+
|
| 21 |
+
The docstring examples assume that `numpy` has been imported as ``np``::
|
| 22 |
+
|
| 23 |
+
>>> import numpy as np
|
| 24 |
+
|
| 25 |
+
Code snippets are indicated by three greater-than signs::
|
| 26 |
+
|
| 27 |
+
>>> x = 42
|
| 28 |
+
>>> x = x + 1
|
| 29 |
+
|
| 30 |
+
Use the built-in ``help`` function to view a function's docstring::
|
| 31 |
+
|
| 32 |
+
>>> help(np.sort)
|
| 33 |
+
... # doctest: +SKIP
|
| 34 |
+
|
| 35 |
+
For some objects, ``np.info(obj)`` may provide additional help. This is
|
| 36 |
+
particularly true if you see the line "Help on ufunc object:" at the top
|
| 37 |
+
of the help() page. Ufuncs are implemented in C, not Python, for speed.
|
| 38 |
+
The native Python help() does not know how to view their help, but our
|
| 39 |
+
np.info() function does.
|
| 40 |
+
|
| 41 |
+
Available subpackages
|
| 42 |
+
---------------------
|
| 43 |
+
lib
|
| 44 |
+
Basic functions used by several sub-packages.
|
| 45 |
+
random
|
| 46 |
+
Core Random Tools
|
| 47 |
+
linalg
|
| 48 |
+
Core Linear Algebra Tools
|
| 49 |
+
fft
|
| 50 |
+
Core FFT routines
|
| 51 |
+
polynomial
|
| 52 |
+
Polynomial tools
|
| 53 |
+
testing
|
| 54 |
+
NumPy testing tools
|
| 55 |
+
distutils
|
| 56 |
+
Enhancements to distutils with support for
|
| 57 |
+
Fortran compilers support and more (for Python <= 3.11)
|
| 58 |
+
|
| 59 |
+
Utilities
|
| 60 |
+
---------
|
| 61 |
+
test
|
| 62 |
+
Run numpy unittests
|
| 63 |
+
show_config
|
| 64 |
+
Show numpy build configuration
|
| 65 |
+
__version__
|
| 66 |
+
NumPy version string
|
| 67 |
+
|
| 68 |
+
Viewing documentation using IPython
|
| 69 |
+
-----------------------------------
|
| 70 |
+
|
| 71 |
+
Start IPython and import `numpy` usually under the alias ``np``: `import
|
| 72 |
+
numpy as np`. Then, directly past or use the ``%cpaste`` magic to paste
|
| 73 |
+
examples into the shell. To see which functions are available in `numpy`,
|
| 74 |
+
type ``np.<TAB>`` (where ``<TAB>`` refers to the TAB key), or use
|
| 75 |
+
``np.*cos*?<ENTER>`` (where ``<ENTER>`` refers to the ENTER key) to narrow
|
| 76 |
+
down the list. To view the docstring for a function, use
|
| 77 |
+
``np.cos?<ENTER>`` (to view the docstring) and ``np.cos??<ENTER>`` (to view
|
| 78 |
+
the source code).
|
| 79 |
+
|
| 80 |
+
Copies vs. in-place operation
|
| 81 |
+
-----------------------------
|
| 82 |
+
Most of the functions in `numpy` return a copy of the array argument
|
| 83 |
+
(e.g., `np.sort`). In-place versions of these functions are often
|
| 84 |
+
available as array methods, i.e. ``x = np.array([1,2,3]); x.sort()``.
|
| 85 |
+
Exceptions to this rule are documented.
|
| 86 |
+
|
| 87 |
+
"""
|
| 88 |
+
import os
|
| 89 |
+
import sys
|
| 90 |
+
import warnings
|
| 91 |
+
|
| 92 |
+
# If a version with git hash was stored, use that instead
|
| 93 |
+
from . import version
|
| 94 |
+
from ._expired_attrs_2_0 import __expired_attributes__
|
| 95 |
+
from ._globals import _CopyMode, _NoValue
|
| 96 |
+
from .version import __version__
|
| 97 |
+
|
| 98 |
+
# We first need to detect if we're being called as part of the numpy setup
|
| 99 |
+
# procedure itself in a reliable manner.
|
| 100 |
+
try:
|
| 101 |
+
__NUMPY_SETUP__ # noqa: B018
|
| 102 |
+
except NameError:
|
| 103 |
+
__NUMPY_SETUP__ = False
|
| 104 |
+
|
| 105 |
+
if __NUMPY_SETUP__:
|
| 106 |
+
sys.stderr.write('Running from numpy source directory.\n')
|
| 107 |
+
else:
|
| 108 |
+
# Allow distributors to run custom init code before importing numpy._core
|
| 109 |
+
from . import _distributor_init
|
| 110 |
+
|
| 111 |
+
try:
|
| 112 |
+
from numpy.__config__ import show_config
|
| 113 |
+
except ImportError as e:
|
| 114 |
+
msg = """Error importing numpy: you should not try to import numpy from
|
| 115 |
+
its source directory; please exit the numpy source tree, and relaunch
|
| 116 |
+
your python interpreter from there."""
|
| 117 |
+
raise ImportError(msg) from e
|
| 118 |
+
|
| 119 |
+
from . import _core
|
| 120 |
+
from ._core import (
|
| 121 |
+
False_,
|
| 122 |
+
ScalarType,
|
| 123 |
+
True_,
|
| 124 |
+
abs,
|
| 125 |
+
absolute,
|
| 126 |
+
acos,
|
| 127 |
+
acosh,
|
| 128 |
+
add,
|
| 129 |
+
all,
|
| 130 |
+
allclose,
|
| 131 |
+
amax,
|
| 132 |
+
amin,
|
| 133 |
+
any,
|
| 134 |
+
arange,
|
| 135 |
+
arccos,
|
| 136 |
+
arccosh,
|
| 137 |
+
arcsin,
|
| 138 |
+
arcsinh,
|
| 139 |
+
arctan,
|
| 140 |
+
arctan2,
|
| 141 |
+
arctanh,
|
| 142 |
+
argmax,
|
| 143 |
+
argmin,
|
| 144 |
+
argpartition,
|
| 145 |
+
argsort,
|
| 146 |
+
argwhere,
|
| 147 |
+
around,
|
| 148 |
+
array,
|
| 149 |
+
array2string,
|
| 150 |
+
array_equal,
|
| 151 |
+
array_equiv,
|
| 152 |
+
array_repr,
|
| 153 |
+
array_str,
|
| 154 |
+
asanyarray,
|
| 155 |
+
asarray,
|
| 156 |
+
ascontiguousarray,
|
| 157 |
+
asfortranarray,
|
| 158 |
+
asin,
|
| 159 |
+
asinh,
|
| 160 |
+
astype,
|
| 161 |
+
atan,
|
| 162 |
+
atan2,
|
| 163 |
+
atanh,
|
| 164 |
+
atleast_1d,
|
| 165 |
+
atleast_2d,
|
| 166 |
+
atleast_3d,
|
| 167 |
+
base_repr,
|
| 168 |
+
binary_repr,
|
| 169 |
+
bitwise_and,
|
| 170 |
+
bitwise_count,
|
| 171 |
+
bitwise_invert,
|
| 172 |
+
bitwise_left_shift,
|
| 173 |
+
bitwise_not,
|
| 174 |
+
bitwise_or,
|
| 175 |
+
bitwise_right_shift,
|
| 176 |
+
bitwise_xor,
|
| 177 |
+
block,
|
| 178 |
+
bool,
|
| 179 |
+
bool_,
|
| 180 |
+
broadcast,
|
| 181 |
+
busday_count,
|
| 182 |
+
busday_offset,
|
| 183 |
+
busdaycalendar,
|
| 184 |
+
byte,
|
| 185 |
+
bytes_,
|
| 186 |
+
can_cast,
|
| 187 |
+
cbrt,
|
| 188 |
+
cdouble,
|
| 189 |
+
ceil,
|
| 190 |
+
character,
|
| 191 |
+
choose,
|
| 192 |
+
clip,
|
| 193 |
+
clongdouble,
|
| 194 |
+
complex64,
|
| 195 |
+
complex128,
|
| 196 |
+
complexfloating,
|
| 197 |
+
compress,
|
| 198 |
+
concat,
|
| 199 |
+
concatenate,
|
| 200 |
+
conj,
|
| 201 |
+
conjugate,
|
| 202 |
+
convolve,
|
| 203 |
+
copysign,
|
| 204 |
+
copyto,
|
| 205 |
+
correlate,
|
| 206 |
+
cos,
|
| 207 |
+
cosh,
|
| 208 |
+
count_nonzero,
|
| 209 |
+
cross,
|
| 210 |
+
csingle,
|
| 211 |
+
cumprod,
|
| 212 |
+
cumsum,
|
| 213 |
+
cumulative_prod,
|
| 214 |
+
cumulative_sum,
|
| 215 |
+
datetime64,
|
| 216 |
+
datetime_as_string,
|
| 217 |
+
datetime_data,
|
| 218 |
+
deg2rad,
|
| 219 |
+
degrees,
|
| 220 |
+
diagonal,
|
| 221 |
+
divide,
|
| 222 |
+
divmod,
|
| 223 |
+
dot,
|
| 224 |
+
double,
|
| 225 |
+
dtype,
|
| 226 |
+
e,
|
| 227 |
+
einsum,
|
| 228 |
+
einsum_path,
|
| 229 |
+
empty,
|
| 230 |
+
empty_like,
|
| 231 |
+
equal,
|
| 232 |
+
errstate,
|
| 233 |
+
euler_gamma,
|
| 234 |
+
exp,
|
| 235 |
+
exp2,
|
| 236 |
+
expm1,
|
| 237 |
+
fabs,
|
| 238 |
+
finfo,
|
| 239 |
+
flatiter,
|
| 240 |
+
flatnonzero,
|
| 241 |
+
flexible,
|
| 242 |
+
float16,
|
| 243 |
+
float32,
|
| 244 |
+
float64,
|
| 245 |
+
float_power,
|
| 246 |
+
floating,
|
| 247 |
+
floor,
|
| 248 |
+
floor_divide,
|
| 249 |
+
fmax,
|
| 250 |
+
fmin,
|
| 251 |
+
fmod,
|
| 252 |
+
format_float_positional,
|
| 253 |
+
format_float_scientific,
|
| 254 |
+
frexp,
|
| 255 |
+
from_dlpack,
|
| 256 |
+
frombuffer,
|
| 257 |
+
fromfile,
|
| 258 |
+
fromfunction,
|
| 259 |
+
fromiter,
|
| 260 |
+
frompyfunc,
|
| 261 |
+
fromstring,
|
| 262 |
+
full,
|
| 263 |
+
full_like,
|
| 264 |
+
gcd,
|
| 265 |
+
generic,
|
| 266 |
+
geomspace,
|
| 267 |
+
get_printoptions,
|
| 268 |
+
getbufsize,
|
| 269 |
+
geterr,
|
| 270 |
+
geterrcall,
|
| 271 |
+
greater,
|
| 272 |
+
greater_equal,
|
| 273 |
+
half,
|
| 274 |
+
heaviside,
|
| 275 |
+
hstack,
|
| 276 |
+
hypot,
|
| 277 |
+
identity,
|
| 278 |
+
iinfo,
|
| 279 |
+
indices,
|
| 280 |
+
inexact,
|
| 281 |
+
inf,
|
| 282 |
+
inner,
|
| 283 |
+
int8,
|
| 284 |
+
int16,
|
| 285 |
+
int32,
|
| 286 |
+
int64,
|
| 287 |
+
int_,
|
| 288 |
+
intc,
|
| 289 |
+
integer,
|
| 290 |
+
intp,
|
| 291 |
+
invert,
|
| 292 |
+
is_busday,
|
| 293 |
+
isclose,
|
| 294 |
+
isdtype,
|
| 295 |
+
isfinite,
|
| 296 |
+
isfortran,
|
| 297 |
+
isinf,
|
| 298 |
+
isnan,
|
| 299 |
+
isnat,
|
| 300 |
+
isscalar,
|
| 301 |
+
issubdtype,
|
| 302 |
+
lcm,
|
| 303 |
+
ldexp,
|
| 304 |
+
left_shift,
|
| 305 |
+
less,
|
| 306 |
+
less_equal,
|
| 307 |
+
lexsort,
|
| 308 |
+
linspace,
|
| 309 |
+
little_endian,
|
| 310 |
+
log,
|
| 311 |
+
log1p,
|
| 312 |
+
log2,
|
| 313 |
+
log10,
|
| 314 |
+
logaddexp,
|
| 315 |
+
logaddexp2,
|
| 316 |
+
logical_and,
|
| 317 |
+
logical_not,
|
| 318 |
+
logical_or,
|
| 319 |
+
logical_xor,
|
| 320 |
+
logspace,
|
| 321 |
+
long,
|
| 322 |
+
longdouble,
|
| 323 |
+
longlong,
|
| 324 |
+
matmul,
|
| 325 |
+
matrix_transpose,
|
| 326 |
+
matvec,
|
| 327 |
+
max,
|
| 328 |
+
maximum,
|
| 329 |
+
may_share_memory,
|
| 330 |
+
mean,
|
| 331 |
+
memmap,
|
| 332 |
+
min,
|
| 333 |
+
min_scalar_type,
|
| 334 |
+
minimum,
|
| 335 |
+
mod,
|
| 336 |
+
modf,
|
| 337 |
+
moveaxis,
|
| 338 |
+
multiply,
|
| 339 |
+
nan,
|
| 340 |
+
ndarray,
|
| 341 |
+
ndim,
|
| 342 |
+
nditer,
|
| 343 |
+
negative,
|
| 344 |
+
nested_iters,
|
| 345 |
+
newaxis,
|
| 346 |
+
nextafter,
|
| 347 |
+
nonzero,
|
| 348 |
+
not_equal,
|
| 349 |
+
number,
|
| 350 |
+
object_,
|
| 351 |
+
ones,
|
| 352 |
+
ones_like,
|
| 353 |
+
outer,
|
| 354 |
+
partition,
|
| 355 |
+
permute_dims,
|
| 356 |
+
pi,
|
| 357 |
+
positive,
|
| 358 |
+
pow,
|
| 359 |
+
power,
|
| 360 |
+
printoptions,
|
| 361 |
+
prod,
|
| 362 |
+
promote_types,
|
| 363 |
+
ptp,
|
| 364 |
+
put,
|
| 365 |
+
putmask,
|
| 366 |
+
rad2deg,
|
| 367 |
+
radians,
|
| 368 |
+
ravel,
|
| 369 |
+
recarray,
|
| 370 |
+
reciprocal,
|
| 371 |
+
record,
|
| 372 |
+
remainder,
|
| 373 |
+
repeat,
|
| 374 |
+
require,
|
| 375 |
+
reshape,
|
| 376 |
+
resize,
|
| 377 |
+
result_type,
|
| 378 |
+
right_shift,
|
| 379 |
+
rint,
|
| 380 |
+
roll,
|
| 381 |
+
rollaxis,
|
| 382 |
+
round,
|
| 383 |
+
sctypeDict,
|
| 384 |
+
searchsorted,
|
| 385 |
+
set_printoptions,
|
| 386 |
+
setbufsize,
|
| 387 |
+
seterr,
|
| 388 |
+
seterrcall,
|
| 389 |
+
shape,
|
| 390 |
+
shares_memory,
|
| 391 |
+
short,
|
| 392 |
+
sign,
|
| 393 |
+
signbit,
|
| 394 |
+
signedinteger,
|
| 395 |
+
sin,
|
| 396 |
+
single,
|
| 397 |
+
sinh,
|
| 398 |
+
size,
|
| 399 |
+
sort,
|
| 400 |
+
spacing,
|
| 401 |
+
sqrt,
|
| 402 |
+
square,
|
| 403 |
+
squeeze,
|
| 404 |
+
stack,
|
| 405 |
+
std,
|
| 406 |
+
str_,
|
| 407 |
+
subtract,
|
| 408 |
+
sum,
|
| 409 |
+
swapaxes,
|
| 410 |
+
take,
|
| 411 |
+
tan,
|
| 412 |
+
tanh,
|
| 413 |
+
tensordot,
|
| 414 |
+
timedelta64,
|
| 415 |
+
trace,
|
| 416 |
+
transpose,
|
| 417 |
+
true_divide,
|
| 418 |
+
trunc,
|
| 419 |
+
typecodes,
|
| 420 |
+
ubyte,
|
| 421 |
+
ufunc,
|
| 422 |
+
uint,
|
| 423 |
+
uint8,
|
| 424 |
+
uint16,
|
| 425 |
+
uint32,
|
| 426 |
+
uint64,
|
| 427 |
+
uintc,
|
| 428 |
+
uintp,
|
| 429 |
+
ulong,
|
| 430 |
+
ulonglong,
|
| 431 |
+
unsignedinteger,
|
| 432 |
+
unstack,
|
| 433 |
+
ushort,
|
| 434 |
+
var,
|
| 435 |
+
vdot,
|
| 436 |
+
vecdot,
|
| 437 |
+
vecmat,
|
| 438 |
+
void,
|
| 439 |
+
vstack,
|
| 440 |
+
where,
|
| 441 |
+
zeros,
|
| 442 |
+
zeros_like,
|
| 443 |
+
)
|
| 444 |
+
|
| 445 |
+
# NOTE: It's still under discussion whether these aliases
|
| 446 |
+
# should be removed.
|
| 447 |
+
for ta in ["float96", "float128", "complex192", "complex256"]:
|
| 448 |
+
try:
|
| 449 |
+
globals()[ta] = getattr(_core, ta)
|
| 450 |
+
except AttributeError:
|
| 451 |
+
pass
|
| 452 |
+
del ta
|
| 453 |
+
|
| 454 |
+
from . import lib
|
| 455 |
+
from . import matrixlib as _mat
|
| 456 |
+
from .lib import scimath as emath
|
| 457 |
+
from .lib._arraypad_impl import pad
|
| 458 |
+
from .lib._arraysetops_impl import (
|
| 459 |
+
ediff1d,
|
| 460 |
+
in1d,
|
| 461 |
+
intersect1d,
|
| 462 |
+
isin,
|
| 463 |
+
setdiff1d,
|
| 464 |
+
setxor1d,
|
| 465 |
+
union1d,
|
| 466 |
+
unique,
|
| 467 |
+
unique_all,
|
| 468 |
+
unique_counts,
|
| 469 |
+
unique_inverse,
|
| 470 |
+
unique_values,
|
| 471 |
+
)
|
| 472 |
+
from .lib._function_base_impl import (
|
| 473 |
+
angle,
|
| 474 |
+
append,
|
| 475 |
+
asarray_chkfinite,
|
| 476 |
+
average,
|
| 477 |
+
bartlett,
|
| 478 |
+
bincount,
|
| 479 |
+
blackman,
|
| 480 |
+
copy,
|
| 481 |
+
corrcoef,
|
| 482 |
+
cov,
|
| 483 |
+
delete,
|
| 484 |
+
diff,
|
| 485 |
+
digitize,
|
| 486 |
+
extract,
|
| 487 |
+
flip,
|
| 488 |
+
gradient,
|
| 489 |
+
hamming,
|
| 490 |
+
hanning,
|
| 491 |
+
i0,
|
| 492 |
+
insert,
|
| 493 |
+
interp,
|
| 494 |
+
iterable,
|
| 495 |
+
kaiser,
|
| 496 |
+
median,
|
| 497 |
+
meshgrid,
|
| 498 |
+
percentile,
|
| 499 |
+
piecewise,
|
| 500 |
+
place,
|
| 501 |
+
quantile,
|
| 502 |
+
rot90,
|
| 503 |
+
select,
|
| 504 |
+
sinc,
|
| 505 |
+
sort_complex,
|
| 506 |
+
trapezoid,
|
| 507 |
+
trapz,
|
| 508 |
+
trim_zeros,
|
| 509 |
+
unwrap,
|
| 510 |
+
vectorize,
|
| 511 |
+
)
|
| 512 |
+
from .lib._histograms_impl import histogram, histogram_bin_edges, histogramdd
|
| 513 |
+
from .lib._index_tricks_impl import (
|
| 514 |
+
c_,
|
| 515 |
+
diag_indices,
|
| 516 |
+
diag_indices_from,
|
| 517 |
+
fill_diagonal,
|
| 518 |
+
index_exp,
|
| 519 |
+
ix_,
|
| 520 |
+
mgrid,
|
| 521 |
+
ndenumerate,
|
| 522 |
+
ndindex,
|
| 523 |
+
ogrid,
|
| 524 |
+
r_,
|
| 525 |
+
ravel_multi_index,
|
| 526 |
+
s_,
|
| 527 |
+
unravel_index,
|
| 528 |
+
)
|
| 529 |
+
from .lib._nanfunctions_impl import (
|
| 530 |
+
nanargmax,
|
| 531 |
+
nanargmin,
|
| 532 |
+
nancumprod,
|
| 533 |
+
nancumsum,
|
| 534 |
+
nanmax,
|
| 535 |
+
nanmean,
|
| 536 |
+
nanmedian,
|
| 537 |
+
nanmin,
|
| 538 |
+
nanpercentile,
|
| 539 |
+
nanprod,
|
| 540 |
+
nanquantile,
|
| 541 |
+
nanstd,
|
| 542 |
+
nansum,
|
| 543 |
+
nanvar,
|
| 544 |
+
)
|
| 545 |
+
from .lib._npyio_impl import (
|
| 546 |
+
fromregex,
|
| 547 |
+
genfromtxt,
|
| 548 |
+
load,
|
| 549 |
+
loadtxt,
|
| 550 |
+
packbits,
|
| 551 |
+
save,
|
| 552 |
+
savetxt,
|
| 553 |
+
savez,
|
| 554 |
+
savez_compressed,
|
| 555 |
+
unpackbits,
|
| 556 |
+
)
|
| 557 |
+
from .lib._polynomial_impl import (
|
| 558 |
+
poly,
|
| 559 |
+
poly1d,
|
| 560 |
+
polyadd,
|
| 561 |
+
polyder,
|
| 562 |
+
polydiv,
|
| 563 |
+
polyfit,
|
| 564 |
+
polyint,
|
| 565 |
+
polymul,
|
| 566 |
+
polysub,
|
| 567 |
+
polyval,
|
| 568 |
+
roots,
|
| 569 |
+
)
|
| 570 |
+
from .lib._shape_base_impl import (
|
| 571 |
+
apply_along_axis,
|
| 572 |
+
apply_over_axes,
|
| 573 |
+
array_split,
|
| 574 |
+
column_stack,
|
| 575 |
+
dsplit,
|
| 576 |
+
dstack,
|
| 577 |
+
expand_dims,
|
| 578 |
+
hsplit,
|
| 579 |
+
kron,
|
| 580 |
+
put_along_axis,
|
| 581 |
+
row_stack,
|
| 582 |
+
split,
|
| 583 |
+
take_along_axis,
|
| 584 |
+
tile,
|
| 585 |
+
vsplit,
|
| 586 |
+
)
|
| 587 |
+
from .lib._stride_tricks_impl import (
|
| 588 |
+
broadcast_arrays,
|
| 589 |
+
broadcast_shapes,
|
| 590 |
+
broadcast_to,
|
| 591 |
+
)
|
| 592 |
+
from .lib._twodim_base_impl import (
|
| 593 |
+
diag,
|
| 594 |
+
diagflat,
|
| 595 |
+
eye,
|
| 596 |
+
fliplr,
|
| 597 |
+
flipud,
|
| 598 |
+
histogram2d,
|
| 599 |
+
mask_indices,
|
| 600 |
+
tri,
|
| 601 |
+
tril,
|
| 602 |
+
tril_indices,
|
| 603 |
+
tril_indices_from,
|
| 604 |
+
triu,
|
| 605 |
+
triu_indices,
|
| 606 |
+
triu_indices_from,
|
| 607 |
+
vander,
|
| 608 |
+
)
|
| 609 |
+
from .lib._type_check_impl import (
|
| 610 |
+
common_type,
|
| 611 |
+
imag,
|
| 612 |
+
iscomplex,
|
| 613 |
+
iscomplexobj,
|
| 614 |
+
isreal,
|
| 615 |
+
isrealobj,
|
| 616 |
+
mintypecode,
|
| 617 |
+
nan_to_num,
|
| 618 |
+
real,
|
| 619 |
+
real_if_close,
|
| 620 |
+
typename,
|
| 621 |
+
)
|
| 622 |
+
from .lib._ufunclike_impl import fix, isneginf, isposinf
|
| 623 |
+
from .lib._utils_impl import get_include, info, show_runtime
|
| 624 |
+
from .matrixlib import asmatrix, bmat, matrix
|
| 625 |
+
|
| 626 |
+
# public submodules are imported lazily, therefore are accessible from
|
| 627 |
+
# __getattr__. Note that `distutils` (deprecated) and `array_api`
|
| 628 |
+
# (experimental label) are not added here, because `from numpy import *`
|
| 629 |
+
# must not raise any warnings - that's too disruptive.
|
| 630 |
+
__numpy_submodules__ = {
|
| 631 |
+
"linalg", "fft", "dtypes", "random", "polynomial", "ma",
|
| 632 |
+
"exceptions", "lib", "ctypeslib", "testing", "typing",
|
| 633 |
+
"f2py", "test", "rec", "char", "core", "strings",
|
| 634 |
+
}
|
| 635 |
+
|
| 636 |
+
# We build warning messages for former attributes
|
| 637 |
+
_msg = (
|
| 638 |
+
"module 'numpy' has no attribute '{n}'.\n"
|
| 639 |
+
"`np.{n}` was a deprecated alias for the builtin `{n}`. "
|
| 640 |
+
"To avoid this error in existing code, use `{n}` by itself. "
|
| 641 |
+
"Doing this will not modify any behavior and is safe. {extended_msg}\n"
|
| 642 |
+
"The aliases was originally deprecated in NumPy 1.20; for more "
|
| 643 |
+
"details and guidance see the original release note at:\n"
|
| 644 |
+
" https://numpy.org/devdocs/release/1.20.0-notes.html#deprecations")
|
| 645 |
+
|
| 646 |
+
_specific_msg = (
|
| 647 |
+
"If you specifically wanted the numpy scalar type, use `np.{}` here.")
|
| 648 |
+
|
| 649 |
+
_int_extended_msg = (
|
| 650 |
+
"When replacing `np.{}`, you may wish to use e.g. `np.int64` "
|
| 651 |
+
"or `np.int32` to specify the precision. If you wish to review "
|
| 652 |
+
"your current use, check the release note link for "
|
| 653 |
+
"additional information.")
|
| 654 |
+
|
| 655 |
+
_type_info = [
|
| 656 |
+
("object", ""), # The NumPy scalar only exists by name.
|
| 657 |
+
("float", _specific_msg.format("float64")),
|
| 658 |
+
("complex", _specific_msg.format("complex128")),
|
| 659 |
+
("str", _specific_msg.format("str_")),
|
| 660 |
+
("int", _int_extended_msg.format("int"))]
|
| 661 |
+
|
| 662 |
+
__former_attrs__ = {
|
| 663 |
+
n: _msg.format(n=n, extended_msg=extended_msg)
|
| 664 |
+
for n, extended_msg in _type_info
|
| 665 |
+
}
|
| 666 |
+
|
| 667 |
+
# Some of these could be defined right away, but most were aliases to
|
| 668 |
+
# the Python objects and only removed in NumPy 1.24. Defining them should
|
| 669 |
+
# probably wait for NumPy 1.26 or 2.0.
|
| 670 |
+
# When defined, these should possibly not be added to `__all__` to avoid
|
| 671 |
+
# import with `from numpy import *`.
|
| 672 |
+
__future_scalars__ = {"str", "bytes", "object"}
|
| 673 |
+
|
| 674 |
+
__array_api_version__ = "2024.12"
|
| 675 |
+
|
| 676 |
+
from ._array_api_info import __array_namespace_info__
|
| 677 |
+
|
| 678 |
+
# now that numpy core module is imported, can initialize limits
|
| 679 |
+
_core.getlimits._register_known_types()
|
| 680 |
+
|
| 681 |
+
__all__ = list(
|
| 682 |
+
__numpy_submodules__ |
|
| 683 |
+
set(_core.__all__) |
|
| 684 |
+
set(_mat.__all__) |
|
| 685 |
+
set(lib._histograms_impl.__all__) |
|
| 686 |
+
set(lib._nanfunctions_impl.__all__) |
|
| 687 |
+
set(lib._function_base_impl.__all__) |
|
| 688 |
+
set(lib._twodim_base_impl.__all__) |
|
| 689 |
+
set(lib._shape_base_impl.__all__) |
|
| 690 |
+
set(lib._type_check_impl.__all__) |
|
| 691 |
+
set(lib._arraysetops_impl.__all__) |
|
| 692 |
+
set(lib._ufunclike_impl.__all__) |
|
| 693 |
+
set(lib._arraypad_impl.__all__) |
|
| 694 |
+
set(lib._utils_impl.__all__) |
|
| 695 |
+
set(lib._stride_tricks_impl.__all__) |
|
| 696 |
+
set(lib._polynomial_impl.__all__) |
|
| 697 |
+
set(lib._npyio_impl.__all__) |
|
| 698 |
+
set(lib._index_tricks_impl.__all__) |
|
| 699 |
+
{"emath", "show_config", "__version__", "__array_namespace_info__"}
|
| 700 |
+
)
|
| 701 |
+
|
| 702 |
+
# Filter out Cython harmless warnings
|
| 703 |
+
warnings.filterwarnings("ignore", message="numpy.dtype size changed")
|
| 704 |
+
warnings.filterwarnings("ignore", message="numpy.ufunc size changed")
|
| 705 |
+
warnings.filterwarnings("ignore", message="numpy.ndarray size changed")
|
| 706 |
+
|
| 707 |
+
def __getattr__(attr):
|
| 708 |
+
# Warn for expired attributes
|
| 709 |
+
import warnings
|
| 710 |
+
|
| 711 |
+
if attr == "linalg":
|
| 712 |
+
import numpy.linalg as linalg
|
| 713 |
+
return linalg
|
| 714 |
+
elif attr == "fft":
|
| 715 |
+
import numpy.fft as fft
|
| 716 |
+
return fft
|
| 717 |
+
elif attr == "dtypes":
|
| 718 |
+
import numpy.dtypes as dtypes
|
| 719 |
+
return dtypes
|
| 720 |
+
elif attr == "random":
|
| 721 |
+
import numpy.random as random
|
| 722 |
+
return random
|
| 723 |
+
elif attr == "polynomial":
|
| 724 |
+
import numpy.polynomial as polynomial
|
| 725 |
+
return polynomial
|
| 726 |
+
elif attr == "ma":
|
| 727 |
+
import numpy.ma as ma
|
| 728 |
+
return ma
|
| 729 |
+
elif attr == "ctypeslib":
|
| 730 |
+
import numpy.ctypeslib as ctypeslib
|
| 731 |
+
return ctypeslib
|
| 732 |
+
elif attr == "exceptions":
|
| 733 |
+
import numpy.exceptions as exceptions
|
| 734 |
+
return exceptions
|
| 735 |
+
elif attr == "testing":
|
| 736 |
+
import numpy.testing as testing
|
| 737 |
+
return testing
|
| 738 |
+
elif attr == "matlib":
|
| 739 |
+
import numpy.matlib as matlib
|
| 740 |
+
return matlib
|
| 741 |
+
elif attr == "f2py":
|
| 742 |
+
import numpy.f2py as f2py
|
| 743 |
+
return f2py
|
| 744 |
+
elif attr == "typing":
|
| 745 |
+
import numpy.typing as typing
|
| 746 |
+
return typing
|
| 747 |
+
elif attr == "rec":
|
| 748 |
+
import numpy.rec as rec
|
| 749 |
+
return rec
|
| 750 |
+
elif attr == "char":
|
| 751 |
+
import numpy.char as char
|
| 752 |
+
return char
|
| 753 |
+
elif attr == "array_api":
|
| 754 |
+
raise AttributeError("`numpy.array_api` is not available from "
|
| 755 |
+
"numpy 2.0 onwards", name=None)
|
| 756 |
+
elif attr == "core":
|
| 757 |
+
import numpy.core as core
|
| 758 |
+
return core
|
| 759 |
+
elif attr == "strings":
|
| 760 |
+
import numpy.strings as strings
|
| 761 |
+
return strings
|
| 762 |
+
elif attr == "distutils":
|
| 763 |
+
if 'distutils' in __numpy_submodules__:
|
| 764 |
+
import numpy.distutils as distutils
|
| 765 |
+
return distutils
|
| 766 |
+
else:
|
| 767 |
+
raise AttributeError("`numpy.distutils` is not available from "
|
| 768 |
+
"Python 3.12 onwards", name=None)
|
| 769 |
+
|
| 770 |
+
if attr in __future_scalars__:
|
| 771 |
+
# And future warnings for those that will change, but also give
|
| 772 |
+
# the AttributeError
|
| 773 |
+
warnings.warn(
|
| 774 |
+
f"In the future `np.{attr}` will be defined as the "
|
| 775 |
+
"corresponding NumPy scalar.", FutureWarning, stacklevel=2)
|
| 776 |
+
|
| 777 |
+
if attr in __former_attrs__:
|
| 778 |
+
raise AttributeError(__former_attrs__[attr], name=None)
|
| 779 |
+
|
| 780 |
+
if attr in __expired_attributes__:
|
| 781 |
+
raise AttributeError(
|
| 782 |
+
f"`np.{attr}` was removed in the NumPy 2.0 release. "
|
| 783 |
+
f"{__expired_attributes__[attr]}",
|
| 784 |
+
name=None
|
| 785 |
+
)
|
| 786 |
+
|
| 787 |
+
if attr == "chararray":
|
| 788 |
+
warnings.warn(
|
| 789 |
+
"`np.chararray` is deprecated and will be removed from "
|
| 790 |
+
"the main namespace in the future. Use an array with a string "
|
| 791 |
+
"or bytes dtype instead.", DeprecationWarning, stacklevel=2)
|
| 792 |
+
import numpy.char as char
|
| 793 |
+
return char.chararray
|
| 794 |
+
|
| 795 |
+
raise AttributeError(f"module {__name__!r} has no attribute {attr!r}")
|
| 796 |
+
|
| 797 |
+
def __dir__():
|
| 798 |
+
public_symbols = (
|
| 799 |
+
globals().keys() | __numpy_submodules__
|
| 800 |
+
)
|
| 801 |
+
public_symbols -= {
|
| 802 |
+
"matrixlib", "matlib", "tests", "conftest", "version",
|
| 803 |
+
"distutils", "array_api"
|
| 804 |
+
}
|
| 805 |
+
return list(public_symbols)
|
| 806 |
+
|
| 807 |
+
# Pytest testing
|
| 808 |
+
from numpy._pytesttester import PytestTester
|
| 809 |
+
test = PytestTester(__name__)
|
| 810 |
+
del PytestTester
|
| 811 |
+
|
| 812 |
+
def _sanity_check():
|
| 813 |
+
"""
|
| 814 |
+
Quick sanity checks for common bugs caused by environment.
|
| 815 |
+
There are some cases e.g. with wrong BLAS ABI that cause wrong
|
| 816 |
+
results under specific runtime conditions that are not necessarily
|
| 817 |
+
achieved during test suite runs, and it is useful to catch those early.
|
| 818 |
+
|
| 819 |
+
See https://github.com/numpy/numpy/issues/8577 and other
|
| 820 |
+
similar bug reports.
|
| 821 |
+
|
| 822 |
+
"""
|
| 823 |
+
try:
|
| 824 |
+
x = ones(2, dtype=float32)
|
| 825 |
+
if not abs(x.dot(x) - float32(2.0)) < 1e-5:
|
| 826 |
+
raise AssertionError
|
| 827 |
+
except AssertionError:
|
| 828 |
+
msg = ("The current Numpy installation ({!r}) fails to "
|
| 829 |
+
"pass simple sanity checks. This can be caused for example "
|
| 830 |
+
"by incorrect BLAS library being linked in, or by mixing "
|
| 831 |
+
"package managers (pip, conda, apt, ...). Search closed "
|
| 832 |
+
"numpy issues for similar problems.")
|
| 833 |
+
raise RuntimeError(msg.format(__file__)) from None
|
| 834 |
+
|
| 835 |
+
_sanity_check()
|
| 836 |
+
del _sanity_check
|
| 837 |
+
|
| 838 |
+
def _mac_os_check():
|
| 839 |
+
"""
|
| 840 |
+
Quick Sanity check for Mac OS look for accelerate build bugs.
|
| 841 |
+
Testing numpy polyfit calls init_dgelsd(LAPACK)
|
| 842 |
+
"""
|
| 843 |
+
try:
|
| 844 |
+
c = array([3., 2., 1.])
|
| 845 |
+
x = linspace(0, 2, 5)
|
| 846 |
+
y = polyval(c, x)
|
| 847 |
+
_ = polyfit(x, y, 2, cov=True)
|
| 848 |
+
except ValueError:
|
| 849 |
+
pass
|
| 850 |
+
|
| 851 |
+
if sys.platform == "darwin":
|
| 852 |
+
from . import exceptions
|
| 853 |
+
with warnings.catch_warnings(record=True) as w:
|
| 854 |
+
_mac_os_check()
|
| 855 |
+
# Throw runtime error, if the test failed
|
| 856 |
+
# Check for warning and report the error_message
|
| 857 |
+
if len(w) > 0:
|
| 858 |
+
for _wn in w:
|
| 859 |
+
if _wn.category is exceptions.RankWarning:
|
| 860 |
+
# Ignore other warnings, they may not be relevant (see gh-25433)
|
| 861 |
+
error_message = (
|
| 862 |
+
f"{_wn.category.__name__}: {_wn.message}"
|
| 863 |
+
)
|
| 864 |
+
msg = (
|
| 865 |
+
"Polyfit sanity test emitted a warning, most likely due "
|
| 866 |
+
"to using a buggy Accelerate backend."
|
| 867 |
+
"\nIf you compiled yourself, more information is available at:" # noqa: E501
|
| 868 |
+
"\nhttps://numpy.org/devdocs/building/index.html"
|
| 869 |
+
"\nOtherwise report this to the vendor "
|
| 870 |
+
f"that provided NumPy.\n\n{error_message}\n")
|
| 871 |
+
raise RuntimeError(msg)
|
| 872 |
+
del _wn
|
| 873 |
+
del w
|
| 874 |
+
del _mac_os_check
|
| 875 |
+
|
| 876 |
+
def blas_fpe_check():
|
| 877 |
+
# Check if BLAS adds spurious FPEs, mostly seen on M4 arms with Accelerate.
|
| 878 |
+
with errstate(all='raise'):
|
| 879 |
+
x = ones((20, 20))
|
| 880 |
+
try:
|
| 881 |
+
x @ x
|
| 882 |
+
except FloatingPointError:
|
| 883 |
+
res = _core._multiarray_umath._blas_supports_fpe(False)
|
| 884 |
+
if res: # res was not modified (hardcoded to True for now)
|
| 885 |
+
warnings.warn(
|
| 886 |
+
"Spurious warnings given by blas but suppression not "
|
| 887 |
+
"set up on this platform. Please open a NumPy issue.",
|
| 888 |
+
UserWarning, stacklevel=2)
|
| 889 |
+
|
| 890 |
+
blas_fpe_check()
|
| 891 |
+
del blas_fpe_check
|
| 892 |
+
|
| 893 |
+
def hugepage_setup():
|
| 894 |
+
"""
|
| 895 |
+
We usually use madvise hugepages support, but on some old kernels it
|
| 896 |
+
is slow and thus better avoided. Specifically kernel version 4.6
|
| 897 |
+
had a bug fix which probably fixed this:
|
| 898 |
+
https://github.com/torvalds/linux/commit/7cf91a98e607c2f935dbcc177d70011e95b8faff
|
| 899 |
+
"""
|
| 900 |
+
use_hugepage = os.environ.get("NUMPY_MADVISE_HUGEPAGE", None)
|
| 901 |
+
if sys.platform == "linux" and use_hugepage is None:
|
| 902 |
+
# If there is an issue with parsing the kernel version,
|
| 903 |
+
# set use_hugepage to 0. Usage of LooseVersion will handle
|
| 904 |
+
# the kernel version parsing better, but avoided since it
|
| 905 |
+
# will increase the import time.
|
| 906 |
+
# See: #16679 for related discussion.
|
| 907 |
+
try:
|
| 908 |
+
use_hugepage = 1
|
| 909 |
+
kernel_version = os.uname().release.split(".")[:2]
|
| 910 |
+
kernel_version = tuple(int(v) for v in kernel_version)
|
| 911 |
+
if kernel_version < (4, 6):
|
| 912 |
+
use_hugepage = 0
|
| 913 |
+
except ValueError:
|
| 914 |
+
use_hugepage = 0
|
| 915 |
+
elif use_hugepage is None:
|
| 916 |
+
# This is not Linux, so it should not matter, just enable anyway
|
| 917 |
+
use_hugepage = 1
|
| 918 |
+
else:
|
| 919 |
+
use_hugepage = int(use_hugepage)
|
| 920 |
+
return use_hugepage
|
| 921 |
+
|
| 922 |
+
# Note that this will currently only make a difference on Linux
|
| 923 |
+
_core.multiarray._set_madvise_hugepage(hugepage_setup())
|
| 924 |
+
del hugepage_setup
|
| 925 |
+
|
| 926 |
+
# Give a warning if NumPy is reloaded or imported on a sub-interpreter
|
| 927 |
+
# We do this from python, since the C-module may not be reloaded and
|
| 928 |
+
# it is tidier organized.
|
| 929 |
+
_core.multiarray._multiarray_umath._reload_guard()
|
| 930 |
+
|
| 931 |
+
# TODO: Remove the environment variable entirely now that it is "weak"
|
| 932 |
+
if (os.environ.get("NPY_PROMOTION_STATE", "weak") != "weak"):
|
| 933 |
+
warnings.warn(
|
| 934 |
+
"NPY_PROMOTION_STATE was a temporary feature for NumPy 2.0 "
|
| 935 |
+
"transition and is ignored after NumPy 2.2.",
|
| 936 |
+
UserWarning, stacklevel=2)
|
| 937 |
+
|
| 938 |
+
# Tell PyInstaller where to find hook-numpy.py
|
| 939 |
+
def _pyinstaller_hooks_dir():
|
| 940 |
+
from pathlib import Path
|
| 941 |
+
return [str(Path(__file__).with_name("_pyinstaller").resolve())]
|
| 942 |
+
|
| 943 |
+
|
| 944 |
+
# Remove symbols imported for internal use
|
| 945 |
+
del os, sys, warnings
|
.venv/lib/python3.12/site-packages/numpy/_array_api_info.pyi
ADDED
|
@@ -0,0 +1,207 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import (
|
| 2 |
+
ClassVar,
|
| 3 |
+
Literal,
|
| 4 |
+
Never,
|
| 5 |
+
TypeAlias,
|
| 6 |
+
TypedDict,
|
| 7 |
+
TypeVar,
|
| 8 |
+
final,
|
| 9 |
+
overload,
|
| 10 |
+
type_check_only,
|
| 11 |
+
)
|
| 12 |
+
|
| 13 |
+
import numpy as np
|
| 14 |
+
|
| 15 |
+
_Device: TypeAlias = Literal["cpu"]
|
| 16 |
+
_DeviceLike: TypeAlias = _Device | None
|
| 17 |
+
|
| 18 |
+
_Capabilities = TypedDict(
|
| 19 |
+
"_Capabilities",
|
| 20 |
+
{
|
| 21 |
+
"boolean indexing": Literal[True],
|
| 22 |
+
"data-dependent shapes": Literal[True],
|
| 23 |
+
},
|
| 24 |
+
)
|
| 25 |
+
|
| 26 |
+
_DefaultDTypes = TypedDict(
|
| 27 |
+
"_DefaultDTypes",
|
| 28 |
+
{
|
| 29 |
+
"real floating": np.dtype[np.float64],
|
| 30 |
+
"complex floating": np.dtype[np.complex128],
|
| 31 |
+
"integral": np.dtype[np.intp],
|
| 32 |
+
"indexing": np.dtype[np.intp],
|
| 33 |
+
},
|
| 34 |
+
)
|
| 35 |
+
|
| 36 |
+
_KindBool: TypeAlias = Literal["bool"]
|
| 37 |
+
_KindInt: TypeAlias = Literal["signed integer"]
|
| 38 |
+
_KindUInt: TypeAlias = Literal["unsigned integer"]
|
| 39 |
+
_KindInteger: TypeAlias = Literal["integral"]
|
| 40 |
+
_KindFloat: TypeAlias = Literal["real floating"]
|
| 41 |
+
_KindComplex: TypeAlias = Literal["complex floating"]
|
| 42 |
+
_KindNumber: TypeAlias = Literal["numeric"]
|
| 43 |
+
_Kind: TypeAlias = (
|
| 44 |
+
_KindBool
|
| 45 |
+
| _KindInt
|
| 46 |
+
| _KindUInt
|
| 47 |
+
| _KindInteger
|
| 48 |
+
| _KindFloat
|
| 49 |
+
| _KindComplex
|
| 50 |
+
| _KindNumber
|
| 51 |
+
)
|
| 52 |
+
|
| 53 |
+
_T1 = TypeVar("_T1")
|
| 54 |
+
_T2 = TypeVar("_T2")
|
| 55 |
+
_T3 = TypeVar("_T3")
|
| 56 |
+
_Permute1: TypeAlias = _T1 | tuple[_T1]
|
| 57 |
+
_Permute2: TypeAlias = tuple[_T1, _T2] | tuple[_T2, _T1]
|
| 58 |
+
_Permute3: TypeAlias = (
|
| 59 |
+
tuple[_T1, _T2, _T3] | tuple[_T1, _T3, _T2]
|
| 60 |
+
| tuple[_T2, _T1, _T3] | tuple[_T2, _T3, _T1]
|
| 61 |
+
| tuple[_T3, _T1, _T2] | tuple[_T3, _T2, _T1]
|
| 62 |
+
)
|
| 63 |
+
|
| 64 |
+
@type_check_only
|
| 65 |
+
class _DTypesBool(TypedDict):
|
| 66 |
+
bool: np.dtype[np.bool]
|
| 67 |
+
|
| 68 |
+
@type_check_only
|
| 69 |
+
class _DTypesInt(TypedDict):
|
| 70 |
+
int8: np.dtype[np.int8]
|
| 71 |
+
int16: np.dtype[np.int16]
|
| 72 |
+
int32: np.dtype[np.int32]
|
| 73 |
+
int64: np.dtype[np.int64]
|
| 74 |
+
|
| 75 |
+
@type_check_only
|
| 76 |
+
class _DTypesUInt(TypedDict):
|
| 77 |
+
uint8: np.dtype[np.uint8]
|
| 78 |
+
uint16: np.dtype[np.uint16]
|
| 79 |
+
uint32: np.dtype[np.uint32]
|
| 80 |
+
uint64: np.dtype[np.uint64]
|
| 81 |
+
|
| 82 |
+
@type_check_only
|
| 83 |
+
class _DTypesInteger(_DTypesInt, _DTypesUInt): ...
|
| 84 |
+
|
| 85 |
+
@type_check_only
|
| 86 |
+
class _DTypesFloat(TypedDict):
|
| 87 |
+
float32: np.dtype[np.float32]
|
| 88 |
+
float64: np.dtype[np.float64]
|
| 89 |
+
|
| 90 |
+
@type_check_only
|
| 91 |
+
class _DTypesComplex(TypedDict):
|
| 92 |
+
complex64: np.dtype[np.complex64]
|
| 93 |
+
complex128: np.dtype[np.complex128]
|
| 94 |
+
|
| 95 |
+
@type_check_only
|
| 96 |
+
class _DTypesNumber(_DTypesInteger, _DTypesFloat, _DTypesComplex): ...
|
| 97 |
+
|
| 98 |
+
@type_check_only
|
| 99 |
+
class _DTypes(_DTypesBool, _DTypesNumber): ...
|
| 100 |
+
|
| 101 |
+
@type_check_only
|
| 102 |
+
class _DTypesUnion(TypedDict, total=False):
|
| 103 |
+
bool: np.dtype[np.bool]
|
| 104 |
+
int8: np.dtype[np.int8]
|
| 105 |
+
int16: np.dtype[np.int16]
|
| 106 |
+
int32: np.dtype[np.int32]
|
| 107 |
+
int64: np.dtype[np.int64]
|
| 108 |
+
uint8: np.dtype[np.uint8]
|
| 109 |
+
uint16: np.dtype[np.uint16]
|
| 110 |
+
uint32: np.dtype[np.uint32]
|
| 111 |
+
uint64: np.dtype[np.uint64]
|
| 112 |
+
float32: np.dtype[np.float32]
|
| 113 |
+
float64: np.dtype[np.float64]
|
| 114 |
+
complex64: np.dtype[np.complex64]
|
| 115 |
+
complex128: np.dtype[np.complex128]
|
| 116 |
+
|
| 117 |
+
_EmptyDict: TypeAlias = dict[Never, Never]
|
| 118 |
+
|
| 119 |
+
@final
|
| 120 |
+
class __array_namespace_info__:
|
| 121 |
+
__module__: ClassVar[Literal['numpy']]
|
| 122 |
+
|
| 123 |
+
def capabilities(self) -> _Capabilities: ...
|
| 124 |
+
def default_device(self) -> _Device: ...
|
| 125 |
+
def default_dtypes(
|
| 126 |
+
self,
|
| 127 |
+
*,
|
| 128 |
+
device: _DeviceLike = ...,
|
| 129 |
+
) -> _DefaultDTypes: ...
|
| 130 |
+
def devices(self) -> list[_Device]: ...
|
| 131 |
+
|
| 132 |
+
@overload
|
| 133 |
+
def dtypes(
|
| 134 |
+
self,
|
| 135 |
+
*,
|
| 136 |
+
device: _DeviceLike = ...,
|
| 137 |
+
kind: None = ...,
|
| 138 |
+
) -> _DTypes: ...
|
| 139 |
+
@overload
|
| 140 |
+
def dtypes(
|
| 141 |
+
self,
|
| 142 |
+
*,
|
| 143 |
+
device: _DeviceLike = ...,
|
| 144 |
+
kind: _Permute1[_KindBool],
|
| 145 |
+
) -> _DTypesBool: ...
|
| 146 |
+
@overload
|
| 147 |
+
def dtypes(
|
| 148 |
+
self,
|
| 149 |
+
*,
|
| 150 |
+
device: _DeviceLike = ...,
|
| 151 |
+
kind: _Permute1[_KindInt],
|
| 152 |
+
) -> _DTypesInt: ...
|
| 153 |
+
@overload
|
| 154 |
+
def dtypes(
|
| 155 |
+
self,
|
| 156 |
+
*,
|
| 157 |
+
device: _DeviceLike = ...,
|
| 158 |
+
kind: _Permute1[_KindUInt],
|
| 159 |
+
) -> _DTypesUInt: ...
|
| 160 |
+
@overload
|
| 161 |
+
def dtypes(
|
| 162 |
+
self,
|
| 163 |
+
*,
|
| 164 |
+
device: _DeviceLike = ...,
|
| 165 |
+
kind: _Permute1[_KindFloat],
|
| 166 |
+
) -> _DTypesFloat: ...
|
| 167 |
+
@overload
|
| 168 |
+
def dtypes(
|
| 169 |
+
self,
|
| 170 |
+
*,
|
| 171 |
+
device: _DeviceLike = ...,
|
| 172 |
+
kind: _Permute1[_KindComplex],
|
| 173 |
+
) -> _DTypesComplex: ...
|
| 174 |
+
@overload
|
| 175 |
+
def dtypes(
|
| 176 |
+
self,
|
| 177 |
+
*,
|
| 178 |
+
device: _DeviceLike = ...,
|
| 179 |
+
kind: (
|
| 180 |
+
_Permute1[_KindInteger]
|
| 181 |
+
| _Permute2[_KindInt, _KindUInt]
|
| 182 |
+
),
|
| 183 |
+
) -> _DTypesInteger: ...
|
| 184 |
+
@overload
|
| 185 |
+
def dtypes(
|
| 186 |
+
self,
|
| 187 |
+
*,
|
| 188 |
+
device: _DeviceLike = ...,
|
| 189 |
+
kind: (
|
| 190 |
+
_Permute1[_KindNumber]
|
| 191 |
+
| _Permute3[_KindInteger, _KindFloat, _KindComplex]
|
| 192 |
+
),
|
| 193 |
+
) -> _DTypesNumber: ...
|
| 194 |
+
@overload
|
| 195 |
+
def dtypes(
|
| 196 |
+
self,
|
| 197 |
+
*,
|
| 198 |
+
device: _DeviceLike = ...,
|
| 199 |
+
kind: tuple[()],
|
| 200 |
+
) -> _EmptyDict: ...
|
| 201 |
+
@overload
|
| 202 |
+
def dtypes(
|
| 203 |
+
self,
|
| 204 |
+
*,
|
| 205 |
+
device: _DeviceLike = ...,
|
| 206 |
+
kind: tuple[_Kind, ...],
|
| 207 |
+
) -> _DTypesUnion: ...
|
.venv/lib/python3.12/site-packages/numpy/_distributor_init.pyi
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
# intentionally left blank
|
.venv/lib/python3.12/site-packages/numpy/_expired_attrs_2_0.py
ADDED
|
@@ -0,0 +1,79 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""
|
| 2 |
+
Dict of expired attributes that are discontinued since 2.0 release.
|
| 3 |
+
Each item is associated with a migration note.
|
| 4 |
+
"""
|
| 5 |
+
|
| 6 |
+
__expired_attributes__ = {
|
| 7 |
+
"geterrobj": "Use the np.errstate context manager instead.",
|
| 8 |
+
"seterrobj": "Use the np.errstate context manager instead.",
|
| 9 |
+
"cast": "Use `np.asarray(arr, dtype=dtype)` instead.",
|
| 10 |
+
"source": "Use `inspect.getsource` instead.",
|
| 11 |
+
"lookfor": "Search NumPy's documentation directly.",
|
| 12 |
+
"who": "Use an IDE variable explorer or `locals()` instead.",
|
| 13 |
+
"fastCopyAndTranspose": "Use `arr.T.copy()` instead.",
|
| 14 |
+
"set_numeric_ops":
|
| 15 |
+
"For the general case, use `PyUFunc_ReplaceLoopBySignature`. "
|
| 16 |
+
"For ndarray subclasses, define the ``__array_ufunc__`` method "
|
| 17 |
+
"and override the relevant ufunc.",
|
| 18 |
+
"NINF": "Use `-np.inf` instead.",
|
| 19 |
+
"PINF": "Use `np.inf` instead.",
|
| 20 |
+
"NZERO": "Use `-0.0` instead.",
|
| 21 |
+
"PZERO": "Use `0.0` instead.",
|
| 22 |
+
"add_newdoc":
|
| 23 |
+
"It's still available as `np.lib.add_newdoc`.",
|
| 24 |
+
"add_docstring":
|
| 25 |
+
"It's still available as `np.lib.add_docstring`.",
|
| 26 |
+
"add_newdoc_ufunc":
|
| 27 |
+
"It's an internal function and doesn't have a replacement.",
|
| 28 |
+
"safe_eval": "Use `ast.literal_eval` instead.",
|
| 29 |
+
"float_": "Use `np.float64` instead.",
|
| 30 |
+
"complex_": "Use `np.complex128` instead.",
|
| 31 |
+
"longfloat": "Use `np.longdouble` instead.",
|
| 32 |
+
"singlecomplex": "Use `np.complex64` instead.",
|
| 33 |
+
"cfloat": "Use `np.complex128` instead.",
|
| 34 |
+
"longcomplex": "Use `np.clongdouble` instead.",
|
| 35 |
+
"clongfloat": "Use `np.clongdouble` instead.",
|
| 36 |
+
"string_": "Use `np.bytes_` instead.",
|
| 37 |
+
"unicode_": "Use `np.str_` instead.",
|
| 38 |
+
"Inf": "Use `np.inf` instead.",
|
| 39 |
+
"Infinity": "Use `np.inf` instead.",
|
| 40 |
+
"NaN": "Use `np.nan` instead.",
|
| 41 |
+
"infty": "Use `np.inf` instead.",
|
| 42 |
+
"issctype": "Use `issubclass(rep, np.generic)` instead.",
|
| 43 |
+
"maximum_sctype":
|
| 44 |
+
"Use a specific dtype instead. You should avoid relying "
|
| 45 |
+
"on any implicit mechanism and select the largest dtype of "
|
| 46 |
+
"a kind explicitly in the code.",
|
| 47 |
+
"obj2sctype": "Use `np.dtype(obj).type` instead.",
|
| 48 |
+
"sctype2char": "Use `np.dtype(obj).char` instead.",
|
| 49 |
+
"sctypes": "Access dtypes explicitly instead.",
|
| 50 |
+
"issubsctype": "Use `np.issubdtype` instead.",
|
| 51 |
+
"set_string_function":
|
| 52 |
+
"Use `np.set_printoptions` instead with a formatter for "
|
| 53 |
+
"custom printing of NumPy objects.",
|
| 54 |
+
"asfarray": "Use `np.asarray` with a proper dtype instead.",
|
| 55 |
+
"issubclass_": "Use `issubclass` builtin instead.",
|
| 56 |
+
"tracemalloc_domain": "It's now available from `np.lib`.",
|
| 57 |
+
"mat": "Use `np.asmatrix` instead.",
|
| 58 |
+
"recfromcsv": "Use `np.genfromtxt` with comma delimiter instead.",
|
| 59 |
+
"recfromtxt": "Use `np.genfromtxt` instead.",
|
| 60 |
+
"deprecate": "Emit `DeprecationWarning` with `warnings.warn` directly, "
|
| 61 |
+
"or use `typing.deprecated`.",
|
| 62 |
+
"deprecate_with_doc": "Emit `DeprecationWarning` with `warnings.warn` "
|
| 63 |
+
"directly, or use `typing.deprecated`.",
|
| 64 |
+
"disp": "Use your own printing function instead.",
|
| 65 |
+
"find_common_type":
|
| 66 |
+
"Use `numpy.promote_types` or `numpy.result_type` instead. "
|
| 67 |
+
"To achieve semantics for the `scalar_types` argument, use "
|
| 68 |
+
"`numpy.result_type` and pass the Python values `0`, `0.0`, or `0j`.",
|
| 69 |
+
"round_": "Use `np.round` instead.",
|
| 70 |
+
"get_array_wrap": "",
|
| 71 |
+
"DataSource": "It's still available as `np.lib.npyio.DataSource`.",
|
| 72 |
+
"nbytes": "Use `np.dtype(<dtype>).itemsize` instead.",
|
| 73 |
+
"byte_bounds": "Now it's available under `np.lib.array_utils.byte_bounds`",
|
| 74 |
+
"compare_chararrays":
|
| 75 |
+
"It's still available as `np.char.compare_chararrays`.",
|
| 76 |
+
"format_parser": "It's still available as `np.rec.format_parser`.",
|
| 77 |
+
"alltrue": "Use `np.all` instead.",
|
| 78 |
+
"sometrue": "Use `np.any` instead.",
|
| 79 |
+
}
|
.venv/lib/python3.12/site-packages/numpy/_globals.pyi
ADDED
|
@@ -0,0 +1,17 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
__all__ = ["_CopyMode", "_NoValue"]
|
| 2 |
+
|
| 3 |
+
import enum
|
| 4 |
+
from typing import Final, final
|
| 5 |
+
|
| 6 |
+
@final
|
| 7 |
+
class _CopyMode(enum.Enum):
|
| 8 |
+
ALWAYS = True
|
| 9 |
+
NEVER = False
|
| 10 |
+
IF_NEEDED = 2
|
| 11 |
+
|
| 12 |
+
def __bool__(self, /) -> bool: ...
|
| 13 |
+
|
| 14 |
+
@final
|
| 15 |
+
class _NoValueType: ...
|
| 16 |
+
|
| 17 |
+
_NoValue: Final[_NoValueType] = ...
|
.venv/lib/python3.12/site-packages/numpy/_pytesttester.pyi
ADDED
|
@@ -0,0 +1,18 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from collections.abc import Iterable
|
| 2 |
+
from typing import Literal as L
|
| 3 |
+
|
| 4 |
+
__all__ = ["PytestTester"]
|
| 5 |
+
|
| 6 |
+
class PytestTester:
|
| 7 |
+
module_name: str
|
| 8 |
+
def __init__(self, module_name: str) -> None: ...
|
| 9 |
+
def __call__(
|
| 10 |
+
self,
|
| 11 |
+
label: L["fast", "full"] = ...,
|
| 12 |
+
verbose: int = ...,
|
| 13 |
+
extra_argv: Iterable[str] | None = ...,
|
| 14 |
+
doctests: L[False] = ...,
|
| 15 |
+
coverage: bool = ...,
|
| 16 |
+
durations: int = ...,
|
| 17 |
+
tests: Iterable[str] | None = ...,
|
| 18 |
+
) -> bool: ...
|
.venv/lib/python3.12/site-packages/numpy/dtypes.py
ADDED
|
@@ -0,0 +1,41 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""
|
| 2 |
+
This module is home to specific dtypes related functionality and their classes.
|
| 3 |
+
For more general information about dtypes, also see `numpy.dtype` and
|
| 4 |
+
:ref:`arrays.dtypes`.
|
| 5 |
+
|
| 6 |
+
Similar to the builtin ``types`` module, this submodule defines types (classes)
|
| 7 |
+
that are not widely used directly.
|
| 8 |
+
|
| 9 |
+
.. versionadded:: NumPy 1.25
|
| 10 |
+
|
| 11 |
+
The dtypes module is new in NumPy 1.25. Previously DType classes were
|
| 12 |
+
only accessible indirectly.
|
| 13 |
+
|
| 14 |
+
|
| 15 |
+
DType classes
|
| 16 |
+
-------------
|
| 17 |
+
|
| 18 |
+
The following are the classes of the corresponding NumPy dtype instances and
|
| 19 |
+
NumPy scalar types. The classes can be used in ``isinstance`` checks and can
|
| 20 |
+
also be instantiated or used directly. Direct use of these classes is not
|
| 21 |
+
typical, since their scalar counterparts (e.g. ``np.float64``) or strings
|
| 22 |
+
like ``"float64"`` can be used.
|
| 23 |
+
"""
|
| 24 |
+
|
| 25 |
+
# See doc/source/reference/routines.dtypes.rst for module-level docs
|
| 26 |
+
|
| 27 |
+
__all__ = []
|
| 28 |
+
|
| 29 |
+
|
| 30 |
+
def _add_dtype_helper(DType, alias):
|
| 31 |
+
# Function to add DTypes a bit more conveniently without channeling them
|
| 32 |
+
# through `numpy._core._multiarray_umath` namespace or similar.
|
| 33 |
+
from numpy import dtypes
|
| 34 |
+
|
| 35 |
+
setattr(dtypes, DType.__name__, DType)
|
| 36 |
+
__all__.append(DType.__name__)
|
| 37 |
+
|
| 38 |
+
if alias:
|
| 39 |
+
alias = alias.removeprefix("numpy.dtypes.")
|
| 40 |
+
setattr(dtypes, alias, DType)
|
| 41 |
+
__all__.append(alias)
|
.venv/lib/python3.12/site-packages/numpy/dtypes.pyi
ADDED
|
@@ -0,0 +1,631 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# ruff: noqa: ANN401
|
| 2 |
+
from typing import (
|
| 3 |
+
Any,
|
| 4 |
+
Generic,
|
| 5 |
+
LiteralString,
|
| 6 |
+
Never,
|
| 7 |
+
NoReturn,
|
| 8 |
+
Self,
|
| 9 |
+
TypeAlias,
|
| 10 |
+
final,
|
| 11 |
+
overload,
|
| 12 |
+
type_check_only,
|
| 13 |
+
)
|
| 14 |
+
from typing import Literal as L
|
| 15 |
+
|
| 16 |
+
from typing_extensions import TypeVar
|
| 17 |
+
|
| 18 |
+
import numpy as np
|
| 19 |
+
|
| 20 |
+
__all__ = [ # noqa: RUF022
|
| 21 |
+
'BoolDType',
|
| 22 |
+
'Int8DType',
|
| 23 |
+
'ByteDType',
|
| 24 |
+
'UInt8DType',
|
| 25 |
+
'UByteDType',
|
| 26 |
+
'Int16DType',
|
| 27 |
+
'ShortDType',
|
| 28 |
+
'UInt16DType',
|
| 29 |
+
'UShortDType',
|
| 30 |
+
'Int32DType',
|
| 31 |
+
'IntDType',
|
| 32 |
+
'UInt32DType',
|
| 33 |
+
'UIntDType',
|
| 34 |
+
'Int64DType',
|
| 35 |
+
'LongDType',
|
| 36 |
+
'UInt64DType',
|
| 37 |
+
'ULongDType',
|
| 38 |
+
'LongLongDType',
|
| 39 |
+
'ULongLongDType',
|
| 40 |
+
'Float16DType',
|
| 41 |
+
'Float32DType',
|
| 42 |
+
'Float64DType',
|
| 43 |
+
'LongDoubleDType',
|
| 44 |
+
'Complex64DType',
|
| 45 |
+
'Complex128DType',
|
| 46 |
+
'CLongDoubleDType',
|
| 47 |
+
'ObjectDType',
|
| 48 |
+
'BytesDType',
|
| 49 |
+
'StrDType',
|
| 50 |
+
'VoidDType',
|
| 51 |
+
'DateTime64DType',
|
| 52 |
+
'TimeDelta64DType',
|
| 53 |
+
'StringDType',
|
| 54 |
+
]
|
| 55 |
+
|
| 56 |
+
# Helper base classes (typing-only)
|
| 57 |
+
|
| 58 |
+
_ScalarT_co = TypeVar("_ScalarT_co", bound=np.generic, covariant=True)
|
| 59 |
+
|
| 60 |
+
@type_check_only
|
| 61 |
+
class _SimpleDType(np.dtype[_ScalarT_co], Generic[_ScalarT_co]): # type: ignore[misc] # pyright: ignore[reportGeneralTypeIssues]
|
| 62 |
+
names: None # pyright: ignore[reportIncompatibleVariableOverride]
|
| 63 |
+
def __new__(cls, /) -> Self: ...
|
| 64 |
+
def __getitem__(self, key: Any, /) -> NoReturn: ...
|
| 65 |
+
@property
|
| 66 |
+
def base(self) -> np.dtype[_ScalarT_co]: ...
|
| 67 |
+
@property
|
| 68 |
+
def fields(self) -> None: ...
|
| 69 |
+
@property
|
| 70 |
+
def isalignedstruct(self) -> L[False]: ...
|
| 71 |
+
@property
|
| 72 |
+
def isnative(self) -> L[True]: ...
|
| 73 |
+
@property
|
| 74 |
+
def ndim(self) -> L[0]: ...
|
| 75 |
+
@property
|
| 76 |
+
def shape(self) -> tuple[()]: ...
|
| 77 |
+
@property
|
| 78 |
+
def subdtype(self) -> None: ...
|
| 79 |
+
|
| 80 |
+
@type_check_only
|
| 81 |
+
class _LiteralDType(_SimpleDType[_ScalarT_co], Generic[_ScalarT_co]): # type: ignore[misc]
|
| 82 |
+
@property
|
| 83 |
+
def flags(self) -> L[0]: ...
|
| 84 |
+
@property
|
| 85 |
+
def hasobject(self) -> L[False]: ...
|
| 86 |
+
|
| 87 |
+
# Helper mixins (typing-only):
|
| 88 |
+
|
| 89 |
+
_KindT_co = TypeVar("_KindT_co", bound=LiteralString, covariant=True)
|
| 90 |
+
_CharT_co = TypeVar("_CharT_co", bound=LiteralString, covariant=True)
|
| 91 |
+
_NumT_co = TypeVar("_NumT_co", bound=int, covariant=True)
|
| 92 |
+
|
| 93 |
+
@type_check_only
|
| 94 |
+
class _TypeCodes(Generic[_KindT_co, _CharT_co, _NumT_co]):
|
| 95 |
+
@final
|
| 96 |
+
@property
|
| 97 |
+
def kind(self) -> _KindT_co: ...
|
| 98 |
+
@final
|
| 99 |
+
@property
|
| 100 |
+
def char(self) -> _CharT_co: ...
|
| 101 |
+
@final
|
| 102 |
+
@property
|
| 103 |
+
def num(self) -> _NumT_co: ...
|
| 104 |
+
|
| 105 |
+
@type_check_only
|
| 106 |
+
class _NoOrder:
|
| 107 |
+
@final
|
| 108 |
+
@property
|
| 109 |
+
def byteorder(self) -> L["|"]: ...
|
| 110 |
+
|
| 111 |
+
@type_check_only
|
| 112 |
+
class _NativeOrder:
|
| 113 |
+
@final
|
| 114 |
+
@property
|
| 115 |
+
def byteorder(self) -> L["="]: ...
|
| 116 |
+
|
| 117 |
+
_DataSize_co = TypeVar("_DataSize_co", bound=int, covariant=True)
|
| 118 |
+
_ItemSize_co = TypeVar("_ItemSize_co", bound=int, covariant=True, default=int)
|
| 119 |
+
|
| 120 |
+
@type_check_only
|
| 121 |
+
class _NBit(Generic[_DataSize_co, _ItemSize_co]):
|
| 122 |
+
@final
|
| 123 |
+
@property
|
| 124 |
+
def alignment(self) -> _DataSize_co: ...
|
| 125 |
+
@final
|
| 126 |
+
@property
|
| 127 |
+
def itemsize(self) -> _ItemSize_co: ...
|
| 128 |
+
|
| 129 |
+
@type_check_only
|
| 130 |
+
class _8Bit(_NoOrder, _NBit[L[1], L[1]]): ...
|
| 131 |
+
|
| 132 |
+
# Boolean:
|
| 133 |
+
|
| 134 |
+
@final
|
| 135 |
+
class BoolDType( # type: ignore[misc]
|
| 136 |
+
_TypeCodes[L["b"], L["?"], L[0]],
|
| 137 |
+
_8Bit,
|
| 138 |
+
_LiteralDType[np.bool],
|
| 139 |
+
):
|
| 140 |
+
@property
|
| 141 |
+
def name(self) -> L["bool"]: ...
|
| 142 |
+
@property
|
| 143 |
+
def str(self) -> L["|b1"]: ...
|
| 144 |
+
|
| 145 |
+
# Sized integers:
|
| 146 |
+
|
| 147 |
+
@final
|
| 148 |
+
class Int8DType( # type: ignore[misc]
|
| 149 |
+
_TypeCodes[L["i"], L["b"], L[1]],
|
| 150 |
+
_8Bit,
|
| 151 |
+
_LiteralDType[np.int8],
|
| 152 |
+
):
|
| 153 |
+
@property
|
| 154 |
+
def name(self) -> L["int8"]: ...
|
| 155 |
+
@property
|
| 156 |
+
def str(self) -> L["|i1"]: ...
|
| 157 |
+
|
| 158 |
+
@final
|
| 159 |
+
class UInt8DType( # type: ignore[misc]
|
| 160 |
+
_TypeCodes[L["u"], L["B"], L[2]],
|
| 161 |
+
_8Bit,
|
| 162 |
+
_LiteralDType[np.uint8],
|
| 163 |
+
):
|
| 164 |
+
@property
|
| 165 |
+
def name(self) -> L["uint8"]: ...
|
| 166 |
+
@property
|
| 167 |
+
def str(self) -> L["|u1"]: ...
|
| 168 |
+
|
| 169 |
+
@final
|
| 170 |
+
class Int16DType( # type: ignore[misc]
|
| 171 |
+
_TypeCodes[L["i"], L["h"], L[3]],
|
| 172 |
+
_NativeOrder,
|
| 173 |
+
_NBit[L[2], L[2]],
|
| 174 |
+
_LiteralDType[np.int16],
|
| 175 |
+
):
|
| 176 |
+
@property
|
| 177 |
+
def name(self) -> L["int16"]: ...
|
| 178 |
+
@property
|
| 179 |
+
def str(self) -> L["<i2", ">i2"]: ...
|
| 180 |
+
|
| 181 |
+
@final
|
| 182 |
+
class UInt16DType( # type: ignore[misc]
|
| 183 |
+
_TypeCodes[L["u"], L["H"], L[4]],
|
| 184 |
+
_NativeOrder,
|
| 185 |
+
_NBit[L[2], L[2]],
|
| 186 |
+
_LiteralDType[np.uint16],
|
| 187 |
+
):
|
| 188 |
+
@property
|
| 189 |
+
def name(self) -> L["uint16"]: ...
|
| 190 |
+
@property
|
| 191 |
+
def str(self) -> L["<u2", ">u2"]: ...
|
| 192 |
+
|
| 193 |
+
@final
|
| 194 |
+
class Int32DType( # type: ignore[misc]
|
| 195 |
+
_TypeCodes[L["i"], L["i", "l"], L[5, 7]],
|
| 196 |
+
_NativeOrder,
|
| 197 |
+
_NBit[L[4], L[4]],
|
| 198 |
+
_LiteralDType[np.int32],
|
| 199 |
+
):
|
| 200 |
+
@property
|
| 201 |
+
def name(self) -> L["int32"]: ...
|
| 202 |
+
@property
|
| 203 |
+
def str(self) -> L["<i4", ">i4"]: ...
|
| 204 |
+
|
| 205 |
+
@final
|
| 206 |
+
class UInt32DType( # type: ignore[misc]
|
| 207 |
+
_TypeCodes[L["u"], L["I", "L"], L[6, 8]],
|
| 208 |
+
_NativeOrder,
|
| 209 |
+
_NBit[L[4], L[4]],
|
| 210 |
+
_LiteralDType[np.uint32],
|
| 211 |
+
):
|
| 212 |
+
@property
|
| 213 |
+
def name(self) -> L["uint32"]: ...
|
| 214 |
+
@property
|
| 215 |
+
def str(self) -> L["<u4", ">u4"]: ...
|
| 216 |
+
|
| 217 |
+
@final
|
| 218 |
+
class Int64DType( # type: ignore[misc]
|
| 219 |
+
_TypeCodes[L["i"], L["l", "q"], L[7, 9]],
|
| 220 |
+
_NativeOrder,
|
| 221 |
+
_NBit[L[8], L[8]],
|
| 222 |
+
_LiteralDType[np.int64],
|
| 223 |
+
):
|
| 224 |
+
@property
|
| 225 |
+
def name(self) -> L["int64"]: ...
|
| 226 |
+
@property
|
| 227 |
+
def str(self) -> L["<i8", ">i8"]: ...
|
| 228 |
+
|
| 229 |
+
@final
|
| 230 |
+
class UInt64DType( # type: ignore[misc]
|
| 231 |
+
_TypeCodes[L["u"], L["L", "Q"], L[8, 10]],
|
| 232 |
+
_NativeOrder,
|
| 233 |
+
_NBit[L[8], L[8]],
|
| 234 |
+
_LiteralDType[np.uint64],
|
| 235 |
+
):
|
| 236 |
+
@property
|
| 237 |
+
def name(self) -> L["uint64"]: ...
|
| 238 |
+
@property
|
| 239 |
+
def str(self) -> L["<u8", ">u8"]: ...
|
| 240 |
+
|
| 241 |
+
# Standard C-named version/alias:
|
| 242 |
+
# NOTE: Don't make these `Final`: it will break stubtest
|
| 243 |
+
ByteDType = Int8DType
|
| 244 |
+
UByteDType = UInt8DType
|
| 245 |
+
ShortDType = Int16DType
|
| 246 |
+
UShortDType = UInt16DType
|
| 247 |
+
|
| 248 |
+
@final
|
| 249 |
+
class IntDType( # type: ignore[misc]
|
| 250 |
+
_TypeCodes[L["i"], L["i"], L[5]],
|
| 251 |
+
_NativeOrder,
|
| 252 |
+
_NBit[L[4], L[4]],
|
| 253 |
+
_LiteralDType[np.intc],
|
| 254 |
+
):
|
| 255 |
+
@property
|
| 256 |
+
def name(self) -> L["int32"]: ...
|
| 257 |
+
@property
|
| 258 |
+
def str(self) -> L["<i4", ">i4"]: ...
|
| 259 |
+
|
| 260 |
+
@final
|
| 261 |
+
class UIntDType( # type: ignore[misc]
|
| 262 |
+
_TypeCodes[L["u"], L["I"], L[6]],
|
| 263 |
+
_NativeOrder,
|
| 264 |
+
_NBit[L[4], L[4]],
|
| 265 |
+
_LiteralDType[np.uintc],
|
| 266 |
+
):
|
| 267 |
+
@property
|
| 268 |
+
def name(self) -> L["uint32"]: ...
|
| 269 |
+
@property
|
| 270 |
+
def str(self) -> L["<u4", ">u4"]: ...
|
| 271 |
+
|
| 272 |
+
@final
|
| 273 |
+
class LongDType( # type: ignore[misc]
|
| 274 |
+
_TypeCodes[L["i"], L["l"], L[7]],
|
| 275 |
+
_NativeOrder,
|
| 276 |
+
_NBit[L[4, 8], L[4, 8]],
|
| 277 |
+
_LiteralDType[np.long],
|
| 278 |
+
):
|
| 279 |
+
@property
|
| 280 |
+
def name(self) -> L["int32", "int64"]: ...
|
| 281 |
+
@property
|
| 282 |
+
def str(self) -> L["<i4", ">i4", "<i8", ">i8"]: ...
|
| 283 |
+
|
| 284 |
+
@final
|
| 285 |
+
class ULongDType( # type: ignore[misc]
|
| 286 |
+
_TypeCodes[L["u"], L["L"], L[8]],
|
| 287 |
+
_NativeOrder,
|
| 288 |
+
_NBit[L[4, 8], L[4, 8]],
|
| 289 |
+
_LiteralDType[np.ulong],
|
| 290 |
+
):
|
| 291 |
+
@property
|
| 292 |
+
def name(self) -> L["uint32", "uint64"]: ...
|
| 293 |
+
@property
|
| 294 |
+
def str(self) -> L["<u4", ">u4", "<u8", ">u8"]: ...
|
| 295 |
+
|
| 296 |
+
@final
|
| 297 |
+
class LongLongDType( # type: ignore[misc]
|
| 298 |
+
_TypeCodes[L["i"], L["q"], L[9]],
|
| 299 |
+
_NativeOrder,
|
| 300 |
+
_NBit[L[8], L[8]],
|
| 301 |
+
_LiteralDType[np.longlong],
|
| 302 |
+
):
|
| 303 |
+
@property
|
| 304 |
+
def name(self) -> L["int64"]: ...
|
| 305 |
+
@property
|
| 306 |
+
def str(self) -> L["<i8", ">i8"]: ...
|
| 307 |
+
|
| 308 |
+
@final
|
| 309 |
+
class ULongLongDType( # type: ignore[misc]
|
| 310 |
+
_TypeCodes[L["u"], L["Q"], L[10]],
|
| 311 |
+
_NativeOrder,
|
| 312 |
+
_NBit[L[8], L[8]],
|
| 313 |
+
_LiteralDType[np.ulonglong],
|
| 314 |
+
):
|
| 315 |
+
@property
|
| 316 |
+
def name(self) -> L["uint64"]: ...
|
| 317 |
+
@property
|
| 318 |
+
def str(self) -> L["<u8", ">u8"]: ...
|
| 319 |
+
|
| 320 |
+
# Floats:
|
| 321 |
+
|
| 322 |
+
@final
|
| 323 |
+
class Float16DType( # type: ignore[misc]
|
| 324 |
+
_TypeCodes[L["f"], L["e"], L[23]],
|
| 325 |
+
_NativeOrder,
|
| 326 |
+
_NBit[L[2], L[2]],
|
| 327 |
+
_LiteralDType[np.float16],
|
| 328 |
+
):
|
| 329 |
+
@property
|
| 330 |
+
def name(self) -> L["float16"]: ...
|
| 331 |
+
@property
|
| 332 |
+
def str(self) -> L["<f2", ">f2"]: ...
|
| 333 |
+
|
| 334 |
+
@final
|
| 335 |
+
class Float32DType( # type: ignore[misc]
|
| 336 |
+
_TypeCodes[L["f"], L["f"], L[11]],
|
| 337 |
+
_NativeOrder,
|
| 338 |
+
_NBit[L[4], L[4]],
|
| 339 |
+
_LiteralDType[np.float32],
|
| 340 |
+
):
|
| 341 |
+
@property
|
| 342 |
+
def name(self) -> L["float32"]: ...
|
| 343 |
+
@property
|
| 344 |
+
def str(self) -> L["<f4", ">f4"]: ...
|
| 345 |
+
|
| 346 |
+
@final
|
| 347 |
+
class Float64DType( # type: ignore[misc]
|
| 348 |
+
_TypeCodes[L["f"], L["d"], L[12]],
|
| 349 |
+
_NativeOrder,
|
| 350 |
+
_NBit[L[8], L[8]],
|
| 351 |
+
_LiteralDType[np.float64],
|
| 352 |
+
):
|
| 353 |
+
@property
|
| 354 |
+
def name(self) -> L["float64"]: ...
|
| 355 |
+
@property
|
| 356 |
+
def str(self) -> L["<f8", ">f8"]: ...
|
| 357 |
+
|
| 358 |
+
@final
|
| 359 |
+
class LongDoubleDType( # type: ignore[misc]
|
| 360 |
+
_TypeCodes[L["f"], L["g"], L[13]],
|
| 361 |
+
_NativeOrder,
|
| 362 |
+
_NBit[L[8, 12, 16], L[8, 12, 16]],
|
| 363 |
+
_LiteralDType[np.longdouble],
|
| 364 |
+
):
|
| 365 |
+
@property
|
| 366 |
+
def name(self) -> L["float64", "float96", "float128"]: ...
|
| 367 |
+
@property
|
| 368 |
+
def str(self) -> L["<f8", ">f8", "<f12", ">f12", "<f16", ">f16"]: ...
|
| 369 |
+
|
| 370 |
+
# Complex:
|
| 371 |
+
|
| 372 |
+
@final
|
| 373 |
+
class Complex64DType( # type: ignore[misc]
|
| 374 |
+
_TypeCodes[L["c"], L["F"], L[14]],
|
| 375 |
+
_NativeOrder,
|
| 376 |
+
_NBit[L[4], L[8]],
|
| 377 |
+
_LiteralDType[np.complex64],
|
| 378 |
+
):
|
| 379 |
+
@property
|
| 380 |
+
def name(self) -> L["complex64"]: ...
|
| 381 |
+
@property
|
| 382 |
+
def str(self) -> L["<c8", ">c8"]: ...
|
| 383 |
+
|
| 384 |
+
@final
|
| 385 |
+
class Complex128DType( # type: ignore[misc]
|
| 386 |
+
_TypeCodes[L["c"], L["D"], L[15]],
|
| 387 |
+
_NativeOrder,
|
| 388 |
+
_NBit[L[8], L[16]],
|
| 389 |
+
_LiteralDType[np.complex128],
|
| 390 |
+
):
|
| 391 |
+
@property
|
| 392 |
+
def name(self) -> L["complex128"]: ...
|
| 393 |
+
@property
|
| 394 |
+
def str(self) -> L["<c16", ">c16"]: ...
|
| 395 |
+
|
| 396 |
+
@final
|
| 397 |
+
class CLongDoubleDType( # type: ignore[misc]
|
| 398 |
+
_TypeCodes[L["c"], L["G"], L[16]],
|
| 399 |
+
_NativeOrder,
|
| 400 |
+
_NBit[L[8, 12, 16], L[16, 24, 32]],
|
| 401 |
+
_LiteralDType[np.clongdouble],
|
| 402 |
+
):
|
| 403 |
+
@property
|
| 404 |
+
def name(self) -> L["complex128", "complex192", "complex256"]: ...
|
| 405 |
+
@property
|
| 406 |
+
def str(self) -> L["<c16", ">c16", "<c24", ">c24", "<c32", ">c32"]: ...
|
| 407 |
+
|
| 408 |
+
# Python objects:
|
| 409 |
+
|
| 410 |
+
@final
|
| 411 |
+
class ObjectDType( # type: ignore[misc]
|
| 412 |
+
_TypeCodes[L["O"], L["O"], L[17]],
|
| 413 |
+
_NoOrder,
|
| 414 |
+
_NBit[L[8], L[8]],
|
| 415 |
+
_SimpleDType[np.object_],
|
| 416 |
+
):
|
| 417 |
+
@property
|
| 418 |
+
def hasobject(self) -> L[True]: ...
|
| 419 |
+
@property
|
| 420 |
+
def name(self) -> L["object"]: ...
|
| 421 |
+
@property
|
| 422 |
+
def str(self) -> L["|O"]: ...
|
| 423 |
+
|
| 424 |
+
# Flexible:
|
| 425 |
+
|
| 426 |
+
@final
|
| 427 |
+
class BytesDType( # type: ignore[misc]
|
| 428 |
+
_TypeCodes[L["S"], L["S"], L[18]],
|
| 429 |
+
_NoOrder,
|
| 430 |
+
_NBit[L[1], _ItemSize_co],
|
| 431 |
+
_SimpleDType[np.bytes_],
|
| 432 |
+
Generic[_ItemSize_co],
|
| 433 |
+
):
|
| 434 |
+
def __new__(cls, size: _ItemSize_co, /) -> BytesDType[_ItemSize_co]: ...
|
| 435 |
+
@property
|
| 436 |
+
def hasobject(self) -> L[False]: ...
|
| 437 |
+
@property
|
| 438 |
+
def name(self) -> LiteralString: ...
|
| 439 |
+
@property
|
| 440 |
+
def str(self) -> LiteralString: ...
|
| 441 |
+
|
| 442 |
+
@final
|
| 443 |
+
class StrDType( # type: ignore[misc]
|
| 444 |
+
_TypeCodes[L["U"], L["U"], L[19]],
|
| 445 |
+
_NativeOrder,
|
| 446 |
+
_NBit[L[4], _ItemSize_co],
|
| 447 |
+
_SimpleDType[np.str_],
|
| 448 |
+
Generic[_ItemSize_co],
|
| 449 |
+
):
|
| 450 |
+
def __new__(cls, size: _ItemSize_co, /) -> StrDType[_ItemSize_co]: ...
|
| 451 |
+
@property
|
| 452 |
+
def hasobject(self) -> L[False]: ...
|
| 453 |
+
@property
|
| 454 |
+
def name(self) -> LiteralString: ...
|
| 455 |
+
@property
|
| 456 |
+
def str(self) -> LiteralString: ...
|
| 457 |
+
|
| 458 |
+
@final
|
| 459 |
+
class VoidDType( # type: ignore[misc]
|
| 460 |
+
_TypeCodes[L["V"], L["V"], L[20]],
|
| 461 |
+
_NoOrder,
|
| 462 |
+
_NBit[L[1], _ItemSize_co],
|
| 463 |
+
np.dtype[np.void], # pyright: ignore[reportGeneralTypeIssues]
|
| 464 |
+
Generic[_ItemSize_co],
|
| 465 |
+
):
|
| 466 |
+
# NOTE: `VoidDType(...)` raises a `TypeError` at the moment
|
| 467 |
+
def __new__(cls, length: _ItemSize_co, /) -> NoReturn: ...
|
| 468 |
+
@property
|
| 469 |
+
def base(self) -> Self: ...
|
| 470 |
+
@property
|
| 471 |
+
def isalignedstruct(self) -> L[False]: ...
|
| 472 |
+
@property
|
| 473 |
+
def isnative(self) -> L[True]: ...
|
| 474 |
+
@property
|
| 475 |
+
def ndim(self) -> L[0]: ...
|
| 476 |
+
@property
|
| 477 |
+
def shape(self) -> tuple[()]: ...
|
| 478 |
+
@property
|
| 479 |
+
def subdtype(self) -> None: ...
|
| 480 |
+
@property
|
| 481 |
+
def name(self) -> LiteralString: ...
|
| 482 |
+
@property
|
| 483 |
+
def str(self) -> LiteralString: ...
|
| 484 |
+
|
| 485 |
+
# Other:
|
| 486 |
+
|
| 487 |
+
_DateUnit: TypeAlias = L["Y", "M", "W", "D"]
|
| 488 |
+
_TimeUnit: TypeAlias = L["h", "m", "s", "ms", "us", "ns", "ps", "fs", "as"]
|
| 489 |
+
_DateTimeUnit: TypeAlias = _DateUnit | _TimeUnit
|
| 490 |
+
|
| 491 |
+
@final
|
| 492 |
+
class DateTime64DType( # type: ignore[misc]
|
| 493 |
+
_TypeCodes[L["M"], L["M"], L[21]],
|
| 494 |
+
_NativeOrder,
|
| 495 |
+
_NBit[L[8], L[8]],
|
| 496 |
+
_LiteralDType[np.datetime64],
|
| 497 |
+
):
|
| 498 |
+
# NOTE: `DateTime64DType(...)` raises a `TypeError` at the moment
|
| 499 |
+
# TODO: Once implemented, don't forget the`unit: L["μs"]` overload.
|
| 500 |
+
def __new__(cls, unit: _DateTimeUnit, /) -> NoReturn: ...
|
| 501 |
+
@property
|
| 502 |
+
def name(self) -> L[
|
| 503 |
+
"datetime64",
|
| 504 |
+
"datetime64[Y]",
|
| 505 |
+
"datetime64[M]",
|
| 506 |
+
"datetime64[W]",
|
| 507 |
+
"datetime64[D]",
|
| 508 |
+
"datetime64[h]",
|
| 509 |
+
"datetime64[m]",
|
| 510 |
+
"datetime64[s]",
|
| 511 |
+
"datetime64[ms]",
|
| 512 |
+
"datetime64[us]",
|
| 513 |
+
"datetime64[ns]",
|
| 514 |
+
"datetime64[ps]",
|
| 515 |
+
"datetime64[fs]",
|
| 516 |
+
"datetime64[as]",
|
| 517 |
+
]: ...
|
| 518 |
+
@property
|
| 519 |
+
def str(self) -> L[
|
| 520 |
+
"<M8", ">M8",
|
| 521 |
+
"<M8[Y]", ">M8[Y]",
|
| 522 |
+
"<M8[M]", ">M8[M]",
|
| 523 |
+
"<M8[W]", ">M8[W]",
|
| 524 |
+
"<M8[D]", ">M8[D]",
|
| 525 |
+
"<M8[h]", ">M8[h]",
|
| 526 |
+
"<M8[m]", ">M8[m]",
|
| 527 |
+
"<M8[s]", ">M8[s]",
|
| 528 |
+
"<M8[ms]", ">M8[ms]",
|
| 529 |
+
"<M8[us]", ">M8[us]",
|
| 530 |
+
"<M8[ns]", ">M8[ns]",
|
| 531 |
+
"<M8[ps]", ">M8[ps]",
|
| 532 |
+
"<M8[fs]", ">M8[fs]",
|
| 533 |
+
"<M8[as]", ">M8[as]",
|
| 534 |
+
]: ...
|
| 535 |
+
|
| 536 |
+
@final
|
| 537 |
+
class TimeDelta64DType( # type: ignore[misc]
|
| 538 |
+
_TypeCodes[L["m"], L["m"], L[22]],
|
| 539 |
+
_NativeOrder,
|
| 540 |
+
_NBit[L[8], L[8]],
|
| 541 |
+
_LiteralDType[np.timedelta64],
|
| 542 |
+
):
|
| 543 |
+
# NOTE: `TimeDelta64DType(...)` raises a `TypeError` at the moment
|
| 544 |
+
# TODO: Once implemented, don't forget to overload on `unit: L["μs"]`.
|
| 545 |
+
def __new__(cls, unit: _DateTimeUnit, /) -> NoReturn: ...
|
| 546 |
+
@property
|
| 547 |
+
def name(self) -> L[
|
| 548 |
+
"timedelta64",
|
| 549 |
+
"timedelta64[Y]",
|
| 550 |
+
"timedelta64[M]",
|
| 551 |
+
"timedelta64[W]",
|
| 552 |
+
"timedelta64[D]",
|
| 553 |
+
"timedelta64[h]",
|
| 554 |
+
"timedelta64[m]",
|
| 555 |
+
"timedelta64[s]",
|
| 556 |
+
"timedelta64[ms]",
|
| 557 |
+
"timedelta64[us]",
|
| 558 |
+
"timedelta64[ns]",
|
| 559 |
+
"timedelta64[ps]",
|
| 560 |
+
"timedelta64[fs]",
|
| 561 |
+
"timedelta64[as]",
|
| 562 |
+
]: ...
|
| 563 |
+
@property
|
| 564 |
+
def str(self) -> L[
|
| 565 |
+
"<m8", ">m8",
|
| 566 |
+
"<m8[Y]", ">m8[Y]",
|
| 567 |
+
"<m8[M]", ">m8[M]",
|
| 568 |
+
"<m8[W]", ">m8[W]",
|
| 569 |
+
"<m8[D]", ">m8[D]",
|
| 570 |
+
"<m8[h]", ">m8[h]",
|
| 571 |
+
"<m8[m]", ">m8[m]",
|
| 572 |
+
"<m8[s]", ">m8[s]",
|
| 573 |
+
"<m8[ms]", ">m8[ms]",
|
| 574 |
+
"<m8[us]", ">m8[us]",
|
| 575 |
+
"<m8[ns]", ">m8[ns]",
|
| 576 |
+
"<m8[ps]", ">m8[ps]",
|
| 577 |
+
"<m8[fs]", ">m8[fs]",
|
| 578 |
+
"<m8[as]", ">m8[as]",
|
| 579 |
+
]: ...
|
| 580 |
+
|
| 581 |
+
_NaObjectT_co = TypeVar("_NaObjectT_co", default=Never, covariant=True)
|
| 582 |
+
|
| 583 |
+
@final
|
| 584 |
+
class StringDType( # type: ignore[misc]
|
| 585 |
+
_TypeCodes[L["T"], L["T"], L[2056]],
|
| 586 |
+
_NativeOrder,
|
| 587 |
+
_NBit[L[8], L[16]],
|
| 588 |
+
# TODO(jorenham): change once we have a string scalar type:
|
| 589 |
+
# https://github.com/numpy/numpy/issues/28165
|
| 590 |
+
np.dtype[str], # type: ignore[type-var] # pyright: ignore[reportGeneralTypeIssues, reportInvalidTypeArguments]
|
| 591 |
+
Generic[_NaObjectT_co],
|
| 592 |
+
):
|
| 593 |
+
@property
|
| 594 |
+
def na_object(self) -> _NaObjectT_co: ...
|
| 595 |
+
@property
|
| 596 |
+
def coerce(self) -> L[True]: ...
|
| 597 |
+
|
| 598 |
+
#
|
| 599 |
+
@overload
|
| 600 |
+
def __new__(cls, /, *, coerce: bool = True) -> Self: ...
|
| 601 |
+
@overload
|
| 602 |
+
def __new__(cls, /, *, na_object: _NaObjectT_co, coerce: bool = True) -> Self: ...
|
| 603 |
+
|
| 604 |
+
#
|
| 605 |
+
def __getitem__(self, key: Never, /) -> NoReturn: ... # type: ignore[override] # pyright: ignore[reportIncompatibleMethodOverride]
|
| 606 |
+
@property
|
| 607 |
+
def fields(self) -> None: ...
|
| 608 |
+
@property
|
| 609 |
+
def base(self) -> Self: ...
|
| 610 |
+
@property
|
| 611 |
+
def ndim(self) -> L[0]: ...
|
| 612 |
+
@property
|
| 613 |
+
def shape(self) -> tuple[()]: ...
|
| 614 |
+
|
| 615 |
+
#
|
| 616 |
+
@property
|
| 617 |
+
def name(self) -> L["StringDType64", "StringDType128"]: ...
|
| 618 |
+
@property
|
| 619 |
+
def subdtype(self) -> None: ...
|
| 620 |
+
@property
|
| 621 |
+
def type(self) -> type[str]: ...
|
| 622 |
+
@property
|
| 623 |
+
def str(self) -> L["|T8", "|T16"]: ...
|
| 624 |
+
|
| 625 |
+
#
|
| 626 |
+
@property
|
| 627 |
+
def hasobject(self) -> L[True]: ...
|
| 628 |
+
@property
|
| 629 |
+
def isalignedstruct(self) -> L[False]: ...
|
| 630 |
+
@property
|
| 631 |
+
def isnative(self) -> L[True]: ...
|
.venv/lib/python3.12/site-packages/numpy/exceptions.pyi
ADDED
|
@@ -0,0 +1,27 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import overload
|
| 2 |
+
|
| 3 |
+
__all__ = [
|
| 4 |
+
"ComplexWarning",
|
| 5 |
+
"VisibleDeprecationWarning",
|
| 6 |
+
"ModuleDeprecationWarning",
|
| 7 |
+
"TooHardError",
|
| 8 |
+
"AxisError",
|
| 9 |
+
"DTypePromotionError",
|
| 10 |
+
]
|
| 11 |
+
|
| 12 |
+
class ComplexWarning(RuntimeWarning): ...
|
| 13 |
+
class ModuleDeprecationWarning(DeprecationWarning): ...
|
| 14 |
+
class VisibleDeprecationWarning(UserWarning): ...
|
| 15 |
+
class RankWarning(RuntimeWarning): ...
|
| 16 |
+
class TooHardError(RuntimeError): ...
|
| 17 |
+
class DTypePromotionError(TypeError): ...
|
| 18 |
+
|
| 19 |
+
class AxisError(ValueError, IndexError):
|
| 20 |
+
__slots__ = "_msg", "axis", "ndim"
|
| 21 |
+
|
| 22 |
+
axis: int | None
|
| 23 |
+
ndim: int | None
|
| 24 |
+
@overload
|
| 25 |
+
def __init__(self, axis: str, ndim: None = ..., msg_prefix: None = ...) -> None: ...
|
| 26 |
+
@overload
|
| 27 |
+
def __init__(self, axis: int, ndim: int, msg_prefix: str | None = ...) -> None: ...
|
.venv/lib/python3.12/site-packages/numpy/matlib.pyi
ADDED
|
@@ -0,0 +1,582 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
from typing import Any, Literal, TypeAlias, TypeVar, overload
|
| 2 |
+
|
| 3 |
+
import numpy as np
|
| 4 |
+
import numpy.typing as npt
|
| 5 |
+
from numpy import ( # noqa: F401
|
| 6 |
+
False_,
|
| 7 |
+
ScalarType,
|
| 8 |
+
True_,
|
| 9 |
+
__array_namespace_info__,
|
| 10 |
+
__version__,
|
| 11 |
+
abs,
|
| 12 |
+
absolute,
|
| 13 |
+
acos,
|
| 14 |
+
acosh,
|
| 15 |
+
add,
|
| 16 |
+
all,
|
| 17 |
+
allclose,
|
| 18 |
+
amax,
|
| 19 |
+
amin,
|
| 20 |
+
angle,
|
| 21 |
+
any,
|
| 22 |
+
append,
|
| 23 |
+
apply_along_axis,
|
| 24 |
+
apply_over_axes,
|
| 25 |
+
arange,
|
| 26 |
+
arccos,
|
| 27 |
+
arccosh,
|
| 28 |
+
arcsin,
|
| 29 |
+
arcsinh,
|
| 30 |
+
arctan,
|
| 31 |
+
arctan2,
|
| 32 |
+
arctanh,
|
| 33 |
+
argmax,
|
| 34 |
+
argmin,
|
| 35 |
+
argpartition,
|
| 36 |
+
argsort,
|
| 37 |
+
argwhere,
|
| 38 |
+
around,
|
| 39 |
+
array,
|
| 40 |
+
array2string,
|
| 41 |
+
array_equal,
|
| 42 |
+
array_equiv,
|
| 43 |
+
array_repr,
|
| 44 |
+
array_split,
|
| 45 |
+
array_str,
|
| 46 |
+
asanyarray,
|
| 47 |
+
asarray,
|
| 48 |
+
asarray_chkfinite,
|
| 49 |
+
ascontiguousarray,
|
| 50 |
+
asfortranarray,
|
| 51 |
+
asin,
|
| 52 |
+
asinh,
|
| 53 |
+
asmatrix,
|
| 54 |
+
astype,
|
| 55 |
+
atan,
|
| 56 |
+
atan2,
|
| 57 |
+
atanh,
|
| 58 |
+
atleast_1d,
|
| 59 |
+
atleast_2d,
|
| 60 |
+
atleast_3d,
|
| 61 |
+
average,
|
| 62 |
+
bartlett,
|
| 63 |
+
base_repr,
|
| 64 |
+
binary_repr,
|
| 65 |
+
bincount,
|
| 66 |
+
bitwise_and,
|
| 67 |
+
bitwise_count,
|
| 68 |
+
bitwise_invert,
|
| 69 |
+
bitwise_left_shift,
|
| 70 |
+
bitwise_not,
|
| 71 |
+
bitwise_or,
|
| 72 |
+
bitwise_right_shift,
|
| 73 |
+
bitwise_xor,
|
| 74 |
+
blackman,
|
| 75 |
+
block,
|
| 76 |
+
bmat,
|
| 77 |
+
bool,
|
| 78 |
+
bool_,
|
| 79 |
+
broadcast,
|
| 80 |
+
broadcast_arrays,
|
| 81 |
+
broadcast_shapes,
|
| 82 |
+
broadcast_to,
|
| 83 |
+
busday_count,
|
| 84 |
+
busday_offset,
|
| 85 |
+
busdaycalendar,
|
| 86 |
+
byte,
|
| 87 |
+
bytes_,
|
| 88 |
+
c_,
|
| 89 |
+
can_cast,
|
| 90 |
+
cbrt,
|
| 91 |
+
cdouble,
|
| 92 |
+
ceil,
|
| 93 |
+
char,
|
| 94 |
+
character,
|
| 95 |
+
choose,
|
| 96 |
+
clip,
|
| 97 |
+
clongdouble,
|
| 98 |
+
column_stack,
|
| 99 |
+
common_type,
|
| 100 |
+
complex64,
|
| 101 |
+
complex128,
|
| 102 |
+
complex256,
|
| 103 |
+
complexfloating,
|
| 104 |
+
compress,
|
| 105 |
+
concat,
|
| 106 |
+
concatenate,
|
| 107 |
+
conj,
|
| 108 |
+
conjugate,
|
| 109 |
+
convolve,
|
| 110 |
+
copy,
|
| 111 |
+
copysign,
|
| 112 |
+
copyto,
|
| 113 |
+
core,
|
| 114 |
+
corrcoef,
|
| 115 |
+
correlate,
|
| 116 |
+
cos,
|
| 117 |
+
cosh,
|
| 118 |
+
count_nonzero,
|
| 119 |
+
cov,
|
| 120 |
+
cross,
|
| 121 |
+
csingle,
|
| 122 |
+
ctypeslib,
|
| 123 |
+
cumprod,
|
| 124 |
+
cumsum,
|
| 125 |
+
cumulative_prod,
|
| 126 |
+
cumulative_sum,
|
| 127 |
+
datetime64,
|
| 128 |
+
datetime_as_string,
|
| 129 |
+
datetime_data,
|
| 130 |
+
deg2rad,
|
| 131 |
+
degrees,
|
| 132 |
+
delete,
|
| 133 |
+
diag,
|
| 134 |
+
diag_indices,
|
| 135 |
+
diag_indices_from,
|
| 136 |
+
diagflat,
|
| 137 |
+
diagonal,
|
| 138 |
+
diff,
|
| 139 |
+
digitize,
|
| 140 |
+
divide,
|
| 141 |
+
divmod,
|
| 142 |
+
dot,
|
| 143 |
+
double,
|
| 144 |
+
dsplit,
|
| 145 |
+
dstack,
|
| 146 |
+
dtype,
|
| 147 |
+
dtypes,
|
| 148 |
+
e,
|
| 149 |
+
ediff1d,
|
| 150 |
+
einsum,
|
| 151 |
+
einsum_path,
|
| 152 |
+
emath,
|
| 153 |
+
empty_like,
|
| 154 |
+
equal,
|
| 155 |
+
errstate,
|
| 156 |
+
euler_gamma,
|
| 157 |
+
exceptions,
|
| 158 |
+
exp,
|
| 159 |
+
exp2,
|
| 160 |
+
expand_dims,
|
| 161 |
+
expm1,
|
| 162 |
+
extract,
|
| 163 |
+
f2py,
|
| 164 |
+
fabs,
|
| 165 |
+
fft,
|
| 166 |
+
fill_diagonal,
|
| 167 |
+
finfo,
|
| 168 |
+
fix,
|
| 169 |
+
flatiter,
|
| 170 |
+
flatnonzero,
|
| 171 |
+
flexible,
|
| 172 |
+
flip,
|
| 173 |
+
fliplr,
|
| 174 |
+
flipud,
|
| 175 |
+
float16,
|
| 176 |
+
float32,
|
| 177 |
+
float64,
|
| 178 |
+
float128,
|
| 179 |
+
float_power,
|
| 180 |
+
floating,
|
| 181 |
+
floor,
|
| 182 |
+
floor_divide,
|
| 183 |
+
fmax,
|
| 184 |
+
fmin,
|
| 185 |
+
fmod,
|
| 186 |
+
format_float_positional,
|
| 187 |
+
format_float_scientific,
|
| 188 |
+
frexp,
|
| 189 |
+
from_dlpack,
|
| 190 |
+
frombuffer,
|
| 191 |
+
fromfile,
|
| 192 |
+
fromfunction,
|
| 193 |
+
fromiter,
|
| 194 |
+
frompyfunc,
|
| 195 |
+
fromregex,
|
| 196 |
+
fromstring,
|
| 197 |
+
full,
|
| 198 |
+
full_like,
|
| 199 |
+
gcd,
|
| 200 |
+
generic,
|
| 201 |
+
genfromtxt,
|
| 202 |
+
geomspace,
|
| 203 |
+
get_include,
|
| 204 |
+
get_printoptions,
|
| 205 |
+
getbufsize,
|
| 206 |
+
geterr,
|
| 207 |
+
geterrcall,
|
| 208 |
+
gradient,
|
| 209 |
+
greater,
|
| 210 |
+
greater_equal,
|
| 211 |
+
half,
|
| 212 |
+
hamming,
|
| 213 |
+
hanning,
|
| 214 |
+
heaviside,
|
| 215 |
+
histogram,
|
| 216 |
+
histogram2d,
|
| 217 |
+
histogram_bin_edges,
|
| 218 |
+
histogramdd,
|
| 219 |
+
hsplit,
|
| 220 |
+
hstack,
|
| 221 |
+
hypot,
|
| 222 |
+
i0,
|
| 223 |
+
iinfo,
|
| 224 |
+
imag,
|
| 225 |
+
in1d,
|
| 226 |
+
index_exp,
|
| 227 |
+
indices,
|
| 228 |
+
inexact,
|
| 229 |
+
inf,
|
| 230 |
+
info,
|
| 231 |
+
inner,
|
| 232 |
+
insert,
|
| 233 |
+
int8,
|
| 234 |
+
int16,
|
| 235 |
+
int32,
|
| 236 |
+
int64,
|
| 237 |
+
int_,
|
| 238 |
+
intc,
|
| 239 |
+
integer,
|
| 240 |
+
interp,
|
| 241 |
+
intersect1d,
|
| 242 |
+
intp,
|
| 243 |
+
invert,
|
| 244 |
+
is_busday,
|
| 245 |
+
isclose,
|
| 246 |
+
iscomplex,
|
| 247 |
+
iscomplexobj,
|
| 248 |
+
isdtype,
|
| 249 |
+
isfinite,
|
| 250 |
+
isfortran,
|
| 251 |
+
isin,
|
| 252 |
+
isinf,
|
| 253 |
+
isnan,
|
| 254 |
+
isnat,
|
| 255 |
+
isneginf,
|
| 256 |
+
isposinf,
|
| 257 |
+
isreal,
|
| 258 |
+
isrealobj,
|
| 259 |
+
isscalar,
|
| 260 |
+
issubdtype,
|
| 261 |
+
iterable,
|
| 262 |
+
ix_,
|
| 263 |
+
kaiser,
|
| 264 |
+
kron,
|
| 265 |
+
lcm,
|
| 266 |
+
ldexp,
|
| 267 |
+
left_shift,
|
| 268 |
+
less,
|
| 269 |
+
less_equal,
|
| 270 |
+
lexsort,
|
| 271 |
+
lib,
|
| 272 |
+
linalg,
|
| 273 |
+
linspace,
|
| 274 |
+
little_endian,
|
| 275 |
+
load,
|
| 276 |
+
loadtxt,
|
| 277 |
+
log,
|
| 278 |
+
log1p,
|
| 279 |
+
log2,
|
| 280 |
+
log10,
|
| 281 |
+
logaddexp,
|
| 282 |
+
logaddexp2,
|
| 283 |
+
logical_and,
|
| 284 |
+
logical_not,
|
| 285 |
+
logical_or,
|
| 286 |
+
logical_xor,
|
| 287 |
+
logspace,
|
| 288 |
+
long,
|
| 289 |
+
longdouble,
|
| 290 |
+
longlong,
|
| 291 |
+
ma,
|
| 292 |
+
mask_indices,
|
| 293 |
+
matmul,
|
| 294 |
+
matrix,
|
| 295 |
+
matrix_transpose,
|
| 296 |
+
matvec,
|
| 297 |
+
max,
|
| 298 |
+
maximum,
|
| 299 |
+
may_share_memory,
|
| 300 |
+
mean,
|
| 301 |
+
median,
|
| 302 |
+
memmap,
|
| 303 |
+
meshgrid,
|
| 304 |
+
mgrid,
|
| 305 |
+
min,
|
| 306 |
+
min_scalar_type,
|
| 307 |
+
minimum,
|
| 308 |
+
mintypecode,
|
| 309 |
+
mod,
|
| 310 |
+
modf,
|
| 311 |
+
moveaxis,
|
| 312 |
+
multiply,
|
| 313 |
+
nan,
|
| 314 |
+
nan_to_num,
|
| 315 |
+
nanargmax,
|
| 316 |
+
nanargmin,
|
| 317 |
+
nancumprod,
|
| 318 |
+
nancumsum,
|
| 319 |
+
nanmax,
|
| 320 |
+
nanmean,
|
| 321 |
+
nanmedian,
|
| 322 |
+
nanmin,
|
| 323 |
+
nanpercentile,
|
| 324 |
+
nanprod,
|
| 325 |
+
nanquantile,
|
| 326 |
+
nanstd,
|
| 327 |
+
nansum,
|
| 328 |
+
nanvar,
|
| 329 |
+
ndarray,
|
| 330 |
+
ndenumerate,
|
| 331 |
+
ndim,
|
| 332 |
+
ndindex,
|
| 333 |
+
nditer,
|
| 334 |
+
negative,
|
| 335 |
+
nested_iters,
|
| 336 |
+
newaxis,
|
| 337 |
+
nextafter,
|
| 338 |
+
nonzero,
|
| 339 |
+
not_equal,
|
| 340 |
+
number,
|
| 341 |
+
object_,
|
| 342 |
+
ogrid,
|
| 343 |
+
ones_like,
|
| 344 |
+
outer,
|
| 345 |
+
packbits,
|
| 346 |
+
pad,
|
| 347 |
+
partition,
|
| 348 |
+
percentile,
|
| 349 |
+
permute_dims,
|
| 350 |
+
pi,
|
| 351 |
+
piecewise,
|
| 352 |
+
place,
|
| 353 |
+
poly,
|
| 354 |
+
poly1d,
|
| 355 |
+
polyadd,
|
| 356 |
+
polyder,
|
| 357 |
+
polydiv,
|
| 358 |
+
polyfit,
|
| 359 |
+
polyint,
|
| 360 |
+
polymul,
|
| 361 |
+
polynomial,
|
| 362 |
+
polysub,
|
| 363 |
+
polyval,
|
| 364 |
+
positive,
|
| 365 |
+
pow,
|
| 366 |
+
power,
|
| 367 |
+
printoptions,
|
| 368 |
+
prod,
|
| 369 |
+
promote_types,
|
| 370 |
+
ptp,
|
| 371 |
+
put,
|
| 372 |
+
put_along_axis,
|
| 373 |
+
putmask,
|
| 374 |
+
quantile,
|
| 375 |
+
r_,
|
| 376 |
+
rad2deg,
|
| 377 |
+
radians,
|
| 378 |
+
random,
|
| 379 |
+
ravel,
|
| 380 |
+
ravel_multi_index,
|
| 381 |
+
real,
|
| 382 |
+
real_if_close,
|
| 383 |
+
rec,
|
| 384 |
+
recarray,
|
| 385 |
+
reciprocal,
|
| 386 |
+
record,
|
| 387 |
+
remainder,
|
| 388 |
+
repeat,
|
| 389 |
+
require,
|
| 390 |
+
reshape,
|
| 391 |
+
resize,
|
| 392 |
+
result_type,
|
| 393 |
+
right_shift,
|
| 394 |
+
rint,
|
| 395 |
+
roll,
|
| 396 |
+
rollaxis,
|
| 397 |
+
roots,
|
| 398 |
+
rot90,
|
| 399 |
+
round,
|
| 400 |
+
row_stack,
|
| 401 |
+
s_,
|
| 402 |
+
save,
|
| 403 |
+
savetxt,
|
| 404 |
+
savez,
|
| 405 |
+
savez_compressed,
|
| 406 |
+
sctypeDict,
|
| 407 |
+
searchsorted,
|
| 408 |
+
select,
|
| 409 |
+
set_printoptions,
|
| 410 |
+
setbufsize,
|
| 411 |
+
setdiff1d,
|
| 412 |
+
seterr,
|
| 413 |
+
seterrcall,
|
| 414 |
+
setxor1d,
|
| 415 |
+
shape,
|
| 416 |
+
shares_memory,
|
| 417 |
+
short,
|
| 418 |
+
show_config,
|
| 419 |
+
show_runtime,
|
| 420 |
+
sign,
|
| 421 |
+
signbit,
|
| 422 |
+
signedinteger,
|
| 423 |
+
sin,
|
| 424 |
+
sinc,
|
| 425 |
+
single,
|
| 426 |
+
sinh,
|
| 427 |
+
size,
|
| 428 |
+
sort,
|
| 429 |
+
sort_complex,
|
| 430 |
+
spacing,
|
| 431 |
+
split,
|
| 432 |
+
sqrt,
|
| 433 |
+
square,
|
| 434 |
+
squeeze,
|
| 435 |
+
stack,
|
| 436 |
+
std,
|
| 437 |
+
str_,
|
| 438 |
+
strings,
|
| 439 |
+
subtract,
|
| 440 |
+
sum,
|
| 441 |
+
swapaxes,
|
| 442 |
+
take,
|
| 443 |
+
take_along_axis,
|
| 444 |
+
tan,
|
| 445 |
+
tanh,
|
| 446 |
+
tensordot,
|
| 447 |
+
test,
|
| 448 |
+
testing,
|
| 449 |
+
tile,
|
| 450 |
+
timedelta64,
|
| 451 |
+
trace,
|
| 452 |
+
transpose,
|
| 453 |
+
trapezoid,
|
| 454 |
+
trapz,
|
| 455 |
+
tri,
|
| 456 |
+
tril,
|
| 457 |
+
tril_indices,
|
| 458 |
+
tril_indices_from,
|
| 459 |
+
trim_zeros,
|
| 460 |
+
triu,
|
| 461 |
+
triu_indices,
|
| 462 |
+
triu_indices_from,
|
| 463 |
+
true_divide,
|
| 464 |
+
trunc,
|
| 465 |
+
typecodes,
|
| 466 |
+
typename,
|
| 467 |
+
typing,
|
| 468 |
+
ubyte,
|
| 469 |
+
ufunc,
|
| 470 |
+
uint,
|
| 471 |
+
uint8,
|
| 472 |
+
uint16,
|
| 473 |
+
uint32,
|
| 474 |
+
uint64,
|
| 475 |
+
uintc,
|
| 476 |
+
uintp,
|
| 477 |
+
ulong,
|
| 478 |
+
ulonglong,
|
| 479 |
+
union1d,
|
| 480 |
+
unique,
|
| 481 |
+
unique_all,
|
| 482 |
+
unique_counts,
|
| 483 |
+
unique_inverse,
|
| 484 |
+
unique_values,
|
| 485 |
+
unpackbits,
|
| 486 |
+
unravel_index,
|
| 487 |
+
unsignedinteger,
|
| 488 |
+
unstack,
|
| 489 |
+
unwrap,
|
| 490 |
+
ushort,
|
| 491 |
+
vander,
|
| 492 |
+
var,
|
| 493 |
+
vdot,
|
| 494 |
+
vecdot,
|
| 495 |
+
vecmat,
|
| 496 |
+
vectorize,
|
| 497 |
+
void,
|
| 498 |
+
vsplit,
|
| 499 |
+
vstack,
|
| 500 |
+
where,
|
| 501 |
+
zeros_like,
|
| 502 |
+
)
|
| 503 |
+
from numpy._typing import _ArrayLike, _DTypeLike
|
| 504 |
+
|
| 505 |
+
__all__ = ["rand", "randn", "repmat"]
|
| 506 |
+
__all__ += np.__all__
|
| 507 |
+
|
| 508 |
+
###
|
| 509 |
+
|
| 510 |
+
_T = TypeVar("_T", bound=np.generic)
|
| 511 |
+
_Matrix: TypeAlias = np.matrix[tuple[int, int], np.dtype[_T]]
|
| 512 |
+
_Order: TypeAlias = Literal["C", "F"]
|
| 513 |
+
|
| 514 |
+
###
|
| 515 |
+
|
| 516 |
+
#
|
| 517 |
+
@overload
|
| 518 |
+
def empty(shape: int | tuple[int, int], dtype: None = None, order: _Order = "C") -> _Matrix[np.float64]: ...
|
| 519 |
+
@overload
|
| 520 |
+
def empty(shape: int | tuple[int, int], dtype: _DTypeLike[_T], order: _Order = "C") -> _Matrix[_T]: ...
|
| 521 |
+
@overload
|
| 522 |
+
def empty(shape: int | tuple[int, int], dtype: npt.DTypeLike, order: _Order = "C") -> _Matrix[Any]: ...
|
| 523 |
+
|
| 524 |
+
#
|
| 525 |
+
@overload
|
| 526 |
+
def ones(shape: int | tuple[int, int], dtype: None = None, order: _Order = "C") -> _Matrix[np.float64]: ...
|
| 527 |
+
@overload
|
| 528 |
+
def ones(shape: int | tuple[int, int], dtype: _DTypeLike[_T], order: _Order = "C") -> _Matrix[_T]: ...
|
| 529 |
+
@overload
|
| 530 |
+
def ones(shape: int | tuple[int, int], dtype: npt.DTypeLike, order: _Order = "C") -> _Matrix[Any]: ...
|
| 531 |
+
|
| 532 |
+
#
|
| 533 |
+
@overload
|
| 534 |
+
def zeros(shape: int | tuple[int, int], dtype: None = None, order: _Order = "C") -> _Matrix[np.float64]: ...
|
| 535 |
+
@overload
|
| 536 |
+
def zeros(shape: int | tuple[int, int], dtype: _DTypeLike[_T], order: _Order = "C") -> _Matrix[_T]: ...
|
| 537 |
+
@overload
|
| 538 |
+
def zeros(shape: int | tuple[int, int], dtype: npt.DTypeLike, order: _Order = "C") -> _Matrix[Any]: ...
|
| 539 |
+
|
| 540 |
+
#
|
| 541 |
+
@overload
|
| 542 |
+
def identity(n: int, dtype: None = None) -> _Matrix[np.float64]: ...
|
| 543 |
+
@overload
|
| 544 |
+
def identity(n: int, dtype: _DTypeLike[_T]) -> _Matrix[_T]: ...
|
| 545 |
+
@overload
|
| 546 |
+
def identity(n: int, dtype: npt.DTypeLike | None = None) -> _Matrix[Any]: ...
|
| 547 |
+
|
| 548 |
+
#
|
| 549 |
+
@overload
|
| 550 |
+
def eye(
|
| 551 |
+
n: int,
|
| 552 |
+
M: int | None = None,
|
| 553 |
+
k: int = 0,
|
| 554 |
+
dtype: type[np.float64] | None = ...,
|
| 555 |
+
order: _Order = "C",
|
| 556 |
+
) -> _Matrix[np.float64]: ...
|
| 557 |
+
@overload
|
| 558 |
+
def eye(n: int, M: int | None, k: int, dtype: _DTypeLike[_T], order: _Order = "C") -> _Matrix[_T]: ...
|
| 559 |
+
@overload
|
| 560 |
+
def eye(n: int, M: int | None = None, k: int = 0, *, dtype: _DTypeLike[_T], order: _Order = "C") -> _Matrix[_T]: ...
|
| 561 |
+
@overload
|
| 562 |
+
def eye(n: int, M: int | None = None, k: int = 0, dtype: npt.DTypeLike = ..., order: _Order = "C") -> _Matrix[Any]: ...
|
| 563 |
+
|
| 564 |
+
#
|
| 565 |
+
@overload
|
| 566 |
+
def rand(arg: int | tuple[()] | tuple[int] | tuple[int, int], /) -> _Matrix[np.float64]: ...
|
| 567 |
+
@overload
|
| 568 |
+
def rand(arg: int, /, *args: int) -> _Matrix[np.float64]: ...
|
| 569 |
+
|
| 570 |
+
#
|
| 571 |
+
@overload
|
| 572 |
+
def randn(arg: int | tuple[()] | tuple[int] | tuple[int, int], /) -> _Matrix[np.float64]: ...
|
| 573 |
+
@overload
|
| 574 |
+
def randn(arg: int, /, *args: int) -> _Matrix[np.float64]: ...
|
| 575 |
+
|
| 576 |
+
#
|
| 577 |
+
@overload
|
| 578 |
+
def repmat(a: _Matrix[_T], m: int, n: int) -> _Matrix[_T]: ...
|
| 579 |
+
@overload
|
| 580 |
+
def repmat(a: _ArrayLike[_T], m: int, n: int) -> npt.NDArray[_T]: ...
|
| 581 |
+
@overload
|
| 582 |
+
def repmat(a: npt.ArrayLike, m: int, n: int) -> npt.NDArray[Any]: ...
|
.venv/lib/python3.12/site-packages/numpy/py.typed
ADDED
|
File without changes
|
.venv/lib/python3.12/site-packages/nvidia_cublas_cu12-12.8.4.1.dist-info/METADATA
ADDED
|
@@ -0,0 +1,44 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Metadata-Version: 2.2
|
| 2 |
+
Name: nvidia-cublas-cu12
|
| 3 |
+
Version: 12.8.4.1
|
| 4 |
+
Summary: CUBLAS native runtime libraries
|
| 5 |
+
Home-page: https://developer.nvidia.com/cuda-zone
|
| 6 |
+
Author: Nvidia CUDA Installer Team
|
| 7 |
+
Author-email: compute_installer@nvidia.com
|
| 8 |
+
License: NVIDIA Proprietary Software
|
| 9 |
+
Keywords: cuda,nvidia,runtime,machine learning,deep learning
|
| 10 |
+
Classifier: Development Status :: 4 - Beta
|
| 11 |
+
Classifier: Intended Audience :: Developers
|
| 12 |
+
Classifier: Intended Audience :: Education
|
| 13 |
+
Classifier: Intended Audience :: Science/Research
|
| 14 |
+
Classifier: License :: Other/Proprietary License
|
| 15 |
+
Classifier: Natural Language :: English
|
| 16 |
+
Classifier: Programming Language :: Python :: 3
|
| 17 |
+
Classifier: Programming Language :: Python :: 3.5
|
| 18 |
+
Classifier: Programming Language :: Python :: 3.6
|
| 19 |
+
Classifier: Programming Language :: Python :: 3.7
|
| 20 |
+
Classifier: Programming Language :: Python :: 3.8
|
| 21 |
+
Classifier: Programming Language :: Python :: 3.9
|
| 22 |
+
Classifier: Programming Language :: Python :: 3.10
|
| 23 |
+
Classifier: Programming Language :: Python :: 3.11
|
| 24 |
+
Classifier: Programming Language :: Python :: 3 :: Only
|
| 25 |
+
Classifier: Topic :: Scientific/Engineering
|
| 26 |
+
Classifier: Topic :: Scientific/Engineering :: Mathematics
|
| 27 |
+
Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
|
| 28 |
+
Classifier: Topic :: Software Development
|
| 29 |
+
Classifier: Topic :: Software Development :: Libraries
|
| 30 |
+
Classifier: Operating System :: Microsoft :: Windows
|
| 31 |
+
Classifier: Operating System :: POSIX :: Linux
|
| 32 |
+
Requires-Python: >=3
|
| 33 |
+
License-File: License.txt
|
| 34 |
+
Dynamic: author
|
| 35 |
+
Dynamic: author-email
|
| 36 |
+
Dynamic: classifier
|
| 37 |
+
Dynamic: description
|
| 38 |
+
Dynamic: home-page
|
| 39 |
+
Dynamic: keywords
|
| 40 |
+
Dynamic: license
|
| 41 |
+
Dynamic: requires-python
|
| 42 |
+
Dynamic: summary
|
| 43 |
+
|
| 44 |
+
CUBLAS native runtime libraries
|
.venv/lib/python3.12/site-packages/nvidia_cublas_cu12-12.8.4.1.dist-info/RECORD
ADDED
|
@@ -0,0 +1,23 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
nvidia/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
|
| 2 |
+
nvidia/__pycache__/__init__.cpython-312.pyc,,
|
| 3 |
+
nvidia/cublas/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
|
| 4 |
+
nvidia/cublas/__pycache__/__init__.cpython-312.pyc,,
|
| 5 |
+
nvidia/cublas/include/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
|
| 6 |
+
nvidia/cublas/include/__pycache__/__init__.cpython-312.pyc,,
|
| 7 |
+
nvidia/cublas/include/cublas.h,sha256=a0lLqy-k47NuwyDjuueC3W0Mpc908MTU7o5sMJqE-1w,41246
|
| 8 |
+
nvidia/cublas/include/cublasLt.h,sha256=oH9TR01H5CWfGPIjJk6-Ljg8eQOu0gho7TNt83gCmwg,102451
|
| 9 |
+
nvidia/cublas/include/cublasXt.h,sha256=CW9dyXYGSUW1wEXrVVyhU6OxBK1PUvMoYdVGlQT7L9A,37380
|
| 10 |
+
nvidia/cublas/include/cublas_api.h,sha256=A4Jvv9elvoJIDw8ReUP7qBnSxEvdslc-ghW_ycq_qAU,374363
|
| 11 |
+
nvidia/cublas/include/cublas_v2.h,sha256=qxMdB5jb97luEfw61LEAB-Wlr8A9DLBvO4rRypDCNKw,15460
|
| 12 |
+
nvidia/cublas/include/nvblas.h,sha256=dXCLR-2oUiJFzLsDtIAK09m42ct4G0HWdYzBUuDPXpc,23341
|
| 13 |
+
nvidia/cublas/lib/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
|
| 14 |
+
nvidia/cublas/lib/__pycache__/__init__.cpython-312.pyc,,
|
| 15 |
+
nvidia/cublas/lib/libcublas.so.12,sha256=Axzmwsv7uUaPBAUnyrXFmQac5WCec-KPh1A4gQY-rCE,116388640
|
| 16 |
+
nvidia/cublas/lib/libcublasLt.so.12,sha256=ELXmYxz4EVxmHriV7RUzgmMItY95VkZvU9I2pAybYiw,751771728
|
| 17 |
+
nvidia/cublas/lib/libnvblas.so.12,sha256=nSRIINMpZvCvR6_mye5vNLIw-v6H6gFB3HEkGl0rNAw,753824
|
| 18 |
+
nvidia_cublas_cu12-12.8.4.1.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
|
| 19 |
+
nvidia_cublas_cu12-12.8.4.1.dist-info/License.txt,sha256=rW9YU_ugyg0VnQ9Y1JrkmDDC-Mk_epJki5zpCttMbM0,59262
|
| 20 |
+
nvidia_cublas_cu12-12.8.4.1.dist-info/METADATA,sha256=MQVW8cLDHsUX1LBJ6vEjdAgdHFLI702Ozqsqrx7f8t8,1683
|
| 21 |
+
nvidia_cublas_cu12-12.8.4.1.dist-info/RECORD,,
|
| 22 |
+
nvidia_cublas_cu12-12.8.4.1.dist-info/WHEEL,sha256=wwQXGCXJQEUF59fKjBnVVzOkzi78E6rE_-QuUR4ZT4w,109
|
| 23 |
+
nvidia_cublas_cu12-12.8.4.1.dist-info/top_level.txt,sha256=fTkAtiFuL16nUrB9ytDDtpytz2t0B4NvYTnRzwAhO14,7
|
.venv/lib/python3.12/site-packages/nvidia_cublas_cu12-12.8.4.1.dist-info/WHEEL
ADDED
|
@@ -0,0 +1,5 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Wheel-Version: 1.0
|
| 2 |
+
Generator: setuptools (75.8.1)
|
| 3 |
+
Root-Is-Purelib: true
|
| 4 |
+
Tag: py3-none-manylinux_2_27_x86_64
|
| 5 |
+
|
.venv/lib/python3.12/site-packages/nvidia_cuda_cupti_cu12-12.8.90.dist-info/INSTALLER
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
pip
|
.venv/lib/python3.12/site-packages/nvidia_cuda_cupti_cu12-12.8.90.dist-info/WHEEL
ADDED
|
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Wheel-Version: 1.0
|
| 2 |
+
Generator: setuptools (75.8.0)
|
| 3 |
+
Root-Is-Purelib: true
|
| 4 |
+
Tag: py3-none-manylinux2014_x86_64
|
| 5 |
+
Tag: py3-none-manylinux_2_17_x86_64
|
| 6 |
+
|
.venv/lib/python3.12/site-packages/nvidia_cuda_cupti_cu12-12.8.90.dist-info/top_level.txt
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
nvidia
|
.venv/lib/python3.12/site-packages/nvidia_cuda_nvrtc_cu12-12.8.93.dist-info/METADATA
ADDED
|
@@ -0,0 +1,44 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Metadata-Version: 2.2
|
| 2 |
+
Name: nvidia-cuda-nvrtc-cu12
|
| 3 |
+
Version: 12.8.93
|
| 4 |
+
Summary: NVRTC native runtime libraries
|
| 5 |
+
Home-page: https://developer.nvidia.com/cuda-zone
|
| 6 |
+
Author: Nvidia CUDA Installer Team
|
| 7 |
+
Author-email: compute_installer@nvidia.com
|
| 8 |
+
License: NVIDIA Proprietary Software
|
| 9 |
+
Keywords: cuda,nvidia,runtime,machine learning,deep learning
|
| 10 |
+
Classifier: Development Status :: 4 - Beta
|
| 11 |
+
Classifier: Intended Audience :: Developers
|
| 12 |
+
Classifier: Intended Audience :: Education
|
| 13 |
+
Classifier: Intended Audience :: Science/Research
|
| 14 |
+
Classifier: License :: Other/Proprietary License
|
| 15 |
+
Classifier: Natural Language :: English
|
| 16 |
+
Classifier: Programming Language :: Python :: 3
|
| 17 |
+
Classifier: Programming Language :: Python :: 3.5
|
| 18 |
+
Classifier: Programming Language :: Python :: 3.6
|
| 19 |
+
Classifier: Programming Language :: Python :: 3.7
|
| 20 |
+
Classifier: Programming Language :: Python :: 3.8
|
| 21 |
+
Classifier: Programming Language :: Python :: 3.9
|
| 22 |
+
Classifier: Programming Language :: Python :: 3.10
|
| 23 |
+
Classifier: Programming Language :: Python :: 3.11
|
| 24 |
+
Classifier: Programming Language :: Python :: 3 :: Only
|
| 25 |
+
Classifier: Topic :: Scientific/Engineering
|
| 26 |
+
Classifier: Topic :: Scientific/Engineering :: Mathematics
|
| 27 |
+
Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
|
| 28 |
+
Classifier: Topic :: Software Development
|
| 29 |
+
Classifier: Topic :: Software Development :: Libraries
|
| 30 |
+
Classifier: Operating System :: Microsoft :: Windows
|
| 31 |
+
Classifier: Operating System :: POSIX :: Linux
|
| 32 |
+
Requires-Python: >=3
|
| 33 |
+
License-File: License.txt
|
| 34 |
+
Dynamic: author
|
| 35 |
+
Dynamic: author-email
|
| 36 |
+
Dynamic: classifier
|
| 37 |
+
Dynamic: description
|
| 38 |
+
Dynamic: home-page
|
| 39 |
+
Dynamic: keywords
|
| 40 |
+
Dynamic: license
|
| 41 |
+
Dynamic: requires-python
|
| 42 |
+
Dynamic: summary
|
| 43 |
+
|
| 44 |
+
NVRTC native runtime libraries
|
.venv/lib/python3.12/site-packages/nvidia_cuda_nvrtc_cu12-12.8.93.dist-info/top_level.txt
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
nvidia
|
.venv/lib/python3.12/site-packages/nvidia_cuda_runtime_cu12-12.8.90.dist-info/License.txt
ADDED
|
@@ -0,0 +1,1568 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
End User License Agreement
|
| 2 |
+
--------------------------
|
| 3 |
+
|
| 4 |
+
|
| 5 |
+
Preface
|
| 6 |
+
-------
|
| 7 |
+
|
| 8 |
+
The Software License Agreement in Chapter 1 and the Supplement
|
| 9 |
+
in Chapter 2 contain license terms and conditions that govern
|
| 10 |
+
the use of NVIDIA software. By accepting this agreement, you
|
| 11 |
+
agree to comply with all the terms and conditions applicable
|
| 12 |
+
to the product(s) included herein.
|
| 13 |
+
|
| 14 |
+
|
| 15 |
+
NVIDIA Driver
|
| 16 |
+
|
| 17 |
+
|
| 18 |
+
Description
|
| 19 |
+
|
| 20 |
+
This package contains the operating system driver and
|
| 21 |
+
fundamental system software components for NVIDIA GPUs.
|
| 22 |
+
|
| 23 |
+
|
| 24 |
+
NVIDIA CUDA Toolkit
|
| 25 |
+
|
| 26 |
+
|
| 27 |
+
Description
|
| 28 |
+
|
| 29 |
+
The NVIDIA CUDA Toolkit provides command-line and graphical
|
| 30 |
+
tools for building, debugging and optimizing the performance
|
| 31 |
+
of applications accelerated by NVIDIA GPUs, runtime and math
|
| 32 |
+
libraries, and documentation including programming guides,
|
| 33 |
+
user manuals, and API references.
|
| 34 |
+
|
| 35 |
+
|
| 36 |
+
Default Install Location of CUDA Toolkit
|
| 37 |
+
|
| 38 |
+
Windows platform:
|
| 39 |
+
|
| 40 |
+
%ProgramFiles%\NVIDIA GPU Computing Toolkit\CUDA\v#.#
|
| 41 |
+
|
| 42 |
+
Linux platform:
|
| 43 |
+
|
| 44 |
+
/usr/local/cuda-#.#
|
| 45 |
+
|
| 46 |
+
Mac platform:
|
| 47 |
+
|
| 48 |
+
/Developer/NVIDIA/CUDA-#.#
|
| 49 |
+
|
| 50 |
+
|
| 51 |
+
NVIDIA CUDA Samples
|
| 52 |
+
|
| 53 |
+
|
| 54 |
+
Description
|
| 55 |
+
|
| 56 |
+
This package includes over 100+ CUDA examples that demonstrate
|
| 57 |
+
various CUDA programming principles, and efficient CUDA
|
| 58 |
+
implementation of algorithms in specific application domains.
|
| 59 |
+
|
| 60 |
+
|
| 61 |
+
Default Install Location of CUDA Samples
|
| 62 |
+
|
| 63 |
+
Windows platform:
|
| 64 |
+
|
| 65 |
+
%ProgramData%\NVIDIA Corporation\CUDA Samples\v#.#
|
| 66 |
+
|
| 67 |
+
Linux platform:
|
| 68 |
+
|
| 69 |
+
/usr/local/cuda-#.#/samples
|
| 70 |
+
|
| 71 |
+
and
|
| 72 |
+
|
| 73 |
+
$HOME/NVIDIA_CUDA-#.#_Samples
|
| 74 |
+
|
| 75 |
+
Mac platform:
|
| 76 |
+
|
| 77 |
+
/Developer/NVIDIA/CUDA-#.#/samples
|
| 78 |
+
|
| 79 |
+
|
| 80 |
+
NVIDIA Nsight Visual Studio Edition (Windows only)
|
| 81 |
+
|
| 82 |
+
|
| 83 |
+
Description
|
| 84 |
+
|
| 85 |
+
NVIDIA Nsight Development Platform, Visual Studio Edition is a
|
| 86 |
+
development environment integrated into Microsoft Visual
|
| 87 |
+
Studio that provides tools for debugging, profiling, analyzing
|
| 88 |
+
and optimizing your GPU computing and graphics applications.
|
| 89 |
+
|
| 90 |
+
|
| 91 |
+
Default Install Location of Nsight Visual Studio Edition
|
| 92 |
+
|
| 93 |
+
Windows platform:
|
| 94 |
+
|
| 95 |
+
%ProgramFiles(x86)%\NVIDIA Corporation\Nsight Visual Studio Edition #.#
|
| 96 |
+
|
| 97 |
+
|
| 98 |
+
1. License Agreement for NVIDIA Software Development Kits
|
| 99 |
+
---------------------------------------------------------
|
| 100 |
+
|
| 101 |
+
|
| 102 |
+
Release Date: July 26, 2018
|
| 103 |
+
---------------------------
|
| 104 |
+
|
| 105 |
+
|
| 106 |
+
Important NoticeRead before downloading, installing,
|
| 107 |
+
copying or using the licensed software:
|
| 108 |
+
-------------------------------------------------------
|
| 109 |
+
|
| 110 |
+
This license agreement, including exhibits attached
|
| 111 |
+
("Agreement”) is a legal agreement between you and NVIDIA
|
| 112 |
+
Corporation ("NVIDIA") and governs your use of a NVIDIA
|
| 113 |
+
software development kit (“SDK”).
|
| 114 |
+
|
| 115 |
+
Each SDK has its own set of software and materials, but here
|
| 116 |
+
is a description of the types of items that may be included in
|
| 117 |
+
a SDK: source code, header files, APIs, data sets and assets
|
| 118 |
+
(examples include images, textures, models, scenes, videos,
|
| 119 |
+
native API input/output files), binary software, sample code,
|
| 120 |
+
libraries, utility programs, programming code and
|
| 121 |
+
documentation.
|
| 122 |
+
|
| 123 |
+
This Agreement can be accepted only by an adult of legal age
|
| 124 |
+
of majority in the country in which the SDK is used.
|
| 125 |
+
|
| 126 |
+
If you are entering into this Agreement on behalf of a company
|
| 127 |
+
or other legal entity, you represent that you have the legal
|
| 128 |
+
authority to bind the entity to this Agreement, in which case
|
| 129 |
+
“you” will mean the entity you represent.
|
| 130 |
+
|
| 131 |
+
If you don’t have the required age or authority to accept
|
| 132 |
+
this Agreement, or if you don’t accept all the terms and
|
| 133 |
+
conditions of this Agreement, do not download, install or use
|
| 134 |
+
the SDK.
|
| 135 |
+
|
| 136 |
+
You agree to use the SDK only for purposes that are permitted
|
| 137 |
+
by (a) this Agreement, and (b) any applicable law, regulation
|
| 138 |
+
or generally accepted practices or guidelines in the relevant
|
| 139 |
+
jurisdictions.
|
| 140 |
+
|
| 141 |
+
|
| 142 |
+
1.1. License
|
| 143 |
+
|
| 144 |
+
|
| 145 |
+
1.1.1. License Grant
|
| 146 |
+
|
| 147 |
+
Subject to the terms of this Agreement, NVIDIA hereby grants
|
| 148 |
+
you a non-exclusive, non-transferable license, without the
|
| 149 |
+
right to sublicense (except as expressly provided in this
|
| 150 |
+
Agreement) to:
|
| 151 |
+
|
| 152 |
+
1. Install and use the SDK,
|
| 153 |
+
|
| 154 |
+
2. Modify and create derivative works of sample source code
|
| 155 |
+
delivered in the SDK, and
|
| 156 |
+
|
| 157 |
+
3. Distribute those portions of the SDK that are identified
|
| 158 |
+
in this Agreement as distributable, as incorporated in
|
| 159 |
+
object code format into a software application that meets
|
| 160 |
+
the distribution requirements indicated in this Agreement.
|
| 161 |
+
|
| 162 |
+
|
| 163 |
+
1.1.2. Distribution Requirements
|
| 164 |
+
|
| 165 |
+
These are the distribution requirements for you to exercise
|
| 166 |
+
the distribution grant:
|
| 167 |
+
|
| 168 |
+
1. Your application must have material additional
|
| 169 |
+
functionality, beyond the included portions of the SDK.
|
| 170 |
+
|
| 171 |
+
2. The distributable portions of the SDK shall only be
|
| 172 |
+
accessed by your application.
|
| 173 |
+
|
| 174 |
+
3. The following notice shall be included in modifications
|
| 175 |
+
and derivative works of sample source code distributed:
|
| 176 |
+
“This software contains source code provided by NVIDIA
|
| 177 |
+
Corporation.”
|
| 178 |
+
|
| 179 |
+
4. Unless a developer tool is identified in this Agreement
|
| 180 |
+
as distributable, it is delivered for your internal use
|
| 181 |
+
only.
|
| 182 |
+
|
| 183 |
+
5. The terms under which you distribute your application
|
| 184 |
+
must be consistent with the terms of this Agreement,
|
| 185 |
+
including (without limitation) terms relating to the
|
| 186 |
+
license grant and license restrictions and protection of
|
| 187 |
+
NVIDIA’s intellectual property rights. Additionally, you
|
| 188 |
+
agree that you will protect the privacy, security and
|
| 189 |
+
legal rights of your application users.
|
| 190 |
+
|
| 191 |
+
6. You agree to notify NVIDIA in writing of any known or
|
| 192 |
+
suspected distribution or use of the SDK not in compliance
|
| 193 |
+
with the requirements of this Agreement, and to enforce
|
| 194 |
+
the terms of your agreements with respect to distributed
|
| 195 |
+
SDK.
|
| 196 |
+
|
| 197 |
+
|
| 198 |
+
1.1.3. Authorized Users
|
| 199 |
+
|
| 200 |
+
You may allow employees and contractors of your entity or of
|
| 201 |
+
your subsidiary(ies) to access and use the SDK from your
|
| 202 |
+
secure network to perform work on your behalf.
|
| 203 |
+
|
| 204 |
+
If you are an academic institution you may allow users
|
| 205 |
+
enrolled or employed by the academic institution to access and
|
| 206 |
+
use the SDK from your secure network.
|
| 207 |
+
|
| 208 |
+
You are responsible for the compliance with the terms of this
|
| 209 |
+
Agreement by your authorized users. If you become aware that
|
| 210 |
+
your authorized users didn’t follow the terms of this
|
| 211 |
+
Agreement, you agree to take reasonable steps to resolve the
|
| 212 |
+
non-compliance and prevent new occurrences.
|
| 213 |
+
|
| 214 |
+
|
| 215 |
+
1.1.4. Pre-Release SDK
|
| 216 |
+
|
| 217 |
+
The SDK versions identified as alpha, beta, preview or
|
| 218 |
+
otherwise as pre-release, may not be fully functional, may
|
| 219 |
+
contain errors or design flaws, and may have reduced or
|
| 220 |
+
different security, privacy, accessibility, availability, and
|
| 221 |
+
reliability standards relative to commercial versions of
|
| 222 |
+
NVIDIA software and materials. Use of a pre-release SDK may
|
| 223 |
+
result in unexpected results, loss of data, project delays or
|
| 224 |
+
other unpredictable damage or loss.
|
| 225 |
+
|
| 226 |
+
You may use a pre-release SDK at your own risk, understanding
|
| 227 |
+
that pre-release SDKs are not intended for use in production
|
| 228 |
+
or business-critical systems.
|
| 229 |
+
|
| 230 |
+
NVIDIA may choose not to make available a commercial version
|
| 231 |
+
of any pre-release SDK. NVIDIA may also choose to abandon
|
| 232 |
+
development and terminate the availability of a pre-release
|
| 233 |
+
SDK at any time without liability.
|
| 234 |
+
|
| 235 |
+
|
| 236 |
+
1.1.5. Updates
|
| 237 |
+
|
| 238 |
+
NVIDIA may, at its option, make available patches, workarounds
|
| 239 |
+
or other updates to this SDK. Unless the updates are provided
|
| 240 |
+
with their separate governing terms, they are deemed part of
|
| 241 |
+
the SDK licensed to you as provided in this Agreement. You
|
| 242 |
+
agree that the form and content of the SDK that NVIDIA
|
| 243 |
+
provides may change without prior notice to you. While NVIDIA
|
| 244 |
+
generally maintains compatibility between versions, NVIDIA may
|
| 245 |
+
in some cases make changes that introduce incompatibilities in
|
| 246 |
+
future versions of the SDK.
|
| 247 |
+
|
| 248 |
+
|
| 249 |
+
1.1.6. Third Party Licenses
|
| 250 |
+
|
| 251 |
+
The SDK may come bundled with, or otherwise include or be
|
| 252 |
+
distributed with, third party software licensed by a NVIDIA
|
| 253 |
+
supplier and/or open source software provided under an open
|
| 254 |
+
source license. Use of third party software is subject to the
|
| 255 |
+
third-party license terms, or in the absence of third party
|
| 256 |
+
terms, the terms of this Agreement. Copyright to third party
|
| 257 |
+
software is held by the copyright holders indicated in the
|
| 258 |
+
third-party software or license.
|
| 259 |
+
|
| 260 |
+
|
| 261 |
+
1.1.7. Reservation of Rights
|
| 262 |
+
|
| 263 |
+
NVIDIA reserves all rights, title, and interest in and to the
|
| 264 |
+
SDK, not expressly granted to you under this Agreement.
|
| 265 |
+
|
| 266 |
+
|
| 267 |
+
1.2. Limitations
|
| 268 |
+
|
| 269 |
+
The following license limitations apply to your use of the
|
| 270 |
+
SDK:
|
| 271 |
+
|
| 272 |
+
1. You may not reverse engineer, decompile or disassemble,
|
| 273 |
+
or remove copyright or other proprietary notices from any
|
| 274 |
+
portion of the SDK or copies of the SDK.
|
| 275 |
+
|
| 276 |
+
2. Except as expressly provided in this Agreement, you may
|
| 277 |
+
not copy, sell, rent, sublicense, transfer, distribute,
|
| 278 |
+
modify, or create derivative works of any portion of the
|
| 279 |
+
SDK. For clarity, you may not distribute or sublicense the
|
| 280 |
+
SDK as a stand-alone product.
|
| 281 |
+
|
| 282 |
+
3. Unless you have an agreement with NVIDIA for this
|
| 283 |
+
purpose, you may not indicate that an application created
|
| 284 |
+
with the SDK is sponsored or endorsed by NVIDIA.
|
| 285 |
+
|
| 286 |
+
4. You may not bypass, disable, or circumvent any
|
| 287 |
+
encryption, security, digital rights management or
|
| 288 |
+
authentication mechanism in the SDK.
|
| 289 |
+
|
| 290 |
+
5. You may not use the SDK in any manner that would cause it
|
| 291 |
+
to become subject to an open source software license. As
|
| 292 |
+
examples, licenses that require as a condition of use,
|
| 293 |
+
modification, and/or distribution that the SDK be:
|
| 294 |
+
|
| 295 |
+
a. Disclosed or distributed in source code form;
|
| 296 |
+
|
| 297 |
+
b. Licensed for the purpose of making derivative works;
|
| 298 |
+
or
|
| 299 |
+
|
| 300 |
+
c. Redistributable at no charge.
|
| 301 |
+
|
| 302 |
+
6. Unless you have an agreement with NVIDIA for this
|
| 303 |
+
purpose, you may not use the SDK with any system or
|
| 304 |
+
application where the use or failure of the system or
|
| 305 |
+
application can reasonably be expected to threaten or
|
| 306 |
+
result in personal injury, death, or catastrophic loss.
|
| 307 |
+
Examples include use in avionics, navigation, military,
|
| 308 |
+
medical, life support or other life critical applications.
|
| 309 |
+
NVIDIA does not design, test or manufacture the SDK for
|
| 310 |
+
these critical uses and NVIDIA shall not be liable to you
|
| 311 |
+
or any third party, in whole or in part, for any claims or
|
| 312 |
+
damages arising from such uses.
|
| 313 |
+
|
| 314 |
+
7. You agree to defend, indemnify and hold harmless NVIDIA
|
| 315 |
+
and its affiliates, and their respective employees,
|
| 316 |
+
contractors, agents, officers and directors, from and
|
| 317 |
+
against any and all claims, damages, obligations, losses,
|
| 318 |
+
liabilities, costs or debt, fines, restitutions and
|
| 319 |
+
expenses (including but not limited to attorney’s fees
|
| 320 |
+
and costs incident to establishing the right of
|
| 321 |
+
indemnification) arising out of or related to your use of
|
| 322 |
+
the SDK outside of the scope of this Agreement, or not in
|
| 323 |
+
compliance with its terms.
|
| 324 |
+
|
| 325 |
+
|
| 326 |
+
1.3. Ownership
|
| 327 |
+
|
| 328 |
+
1. NVIDIA or its licensors hold all rights, title and
|
| 329 |
+
interest in and to the SDK and its modifications and
|
| 330 |
+
derivative works, including their respective intellectual
|
| 331 |
+
property rights, subject to your rights described in this
|
| 332 |
+
section. This SDK may include software and materials from
|
| 333 |
+
NVIDIA’s licensors, and these licensors are intended
|
| 334 |
+
third party beneficiaries that may enforce this Agreement
|
| 335 |
+
with respect to their intellectual property rights.
|
| 336 |
+
|
| 337 |
+
2. You hold all rights, title and interest in and to your
|
| 338 |
+
applications and your derivative works of the sample
|
| 339 |
+
source code delivered in the SDK, including their
|
| 340 |
+
respective intellectual property rights, subject to
|
| 341 |
+
NVIDIA’s rights described in this section.
|
| 342 |
+
|
| 343 |
+
3. You may, but don’t have to, provide to NVIDIA
|
| 344 |
+
suggestions, feature requests or other feedback regarding
|
| 345 |
+
the SDK, including possible enhancements or modifications
|
| 346 |
+
to the SDK. For any feedback that you voluntarily provide,
|
| 347 |
+
you hereby grant NVIDIA and its affiliates a perpetual,
|
| 348 |
+
non-exclusive, worldwide, irrevocable license to use,
|
| 349 |
+
reproduce, modify, license, sublicense (through multiple
|
| 350 |
+
tiers of sublicensees), and distribute (through multiple
|
| 351 |
+
tiers of distributors) it without the payment of any
|
| 352 |
+
royalties or fees to you. NVIDIA will use feedback at its
|
| 353 |
+
choice. NVIDIA is constantly looking for ways to improve
|
| 354 |
+
its products, so you may send feedback to NVIDIA through
|
| 355 |
+
the developer portal at https://developer.nvidia.com.
|
| 356 |
+
|
| 357 |
+
|
| 358 |
+
1.4. No Warranties
|
| 359 |
+
|
| 360 |
+
THE SDK IS PROVIDED BY NVIDIA “AS IS” AND “WITH ALL
|
| 361 |
+
FAULTS.” TO THE MAXIMUM EXTENT PERMITTED BY LAW, NVIDIA AND
|
| 362 |
+
ITS AFFILIATES EXPRESSLY DISCLAIM ALL WARRANTIES OF ANY KIND
|
| 363 |
+
OR NATURE, WHETHER EXPRESS, IMPLIED OR STATUTORY, INCLUDING,
|
| 364 |
+
BUT NOT LIMITED TO, ANY WARRANTIES OF MERCHANTABILITY, FITNESS
|
| 365 |
+
FOR A PARTICULAR PURPOSE, TITLE, NON-INFRINGEMENT, OR THE
|
| 366 |
+
ABSENCE OF ANY DEFECTS THEREIN, WHETHER LATENT OR PATENT. NO
|
| 367 |
+
WARRANTY IS MADE ON THE BASIS OF TRADE USAGE, COURSE OF
|
| 368 |
+
DEALING OR COURSE OF TRADE.
|
| 369 |
+
|
| 370 |
+
|
| 371 |
+
1.5. Limitation of Liability
|
| 372 |
+
|
| 373 |
+
TO THE MAXIMUM EXTENT PERMITTED BY LAW, NVIDIA AND ITS
|
| 374 |
+
AFFILIATES SHALL NOT BE LIABLE FOR ANY SPECIAL, INCIDENTAL,
|
| 375 |
+
PUNITIVE OR CONSEQUENTIAL DAMAGES, OR ANY LOST PROFITS, LOSS
|
| 376 |
+
OF USE, LOSS OF DATA OR LOSS OF GOODWILL, OR THE COSTS OF
|
| 377 |
+
PROCURING SUBSTITUTE PRODUCTS, ARISING OUT OF OR IN CONNECTION
|
| 378 |
+
WITH THIS AGREEMENT OR THE USE OR PERFORMANCE OF THE SDK,
|
| 379 |
+
WHETHER SUCH LIABILITY ARISES FROM ANY CLAIM BASED UPON BREACH
|
| 380 |
+
OF CONTRACT, BREACH OF WARRANTY, TORT (INCLUDING NEGLIGENCE),
|
| 381 |
+
PRODUCT LIABILITY OR ANY OTHER CAUSE OF ACTION OR THEORY OF
|
| 382 |
+
LIABILITY. IN NO EVENT WILL NVIDIA’S AND ITS AFFILIATES
|
| 383 |
+
TOTAL CUMULATIVE LIABILITY UNDER OR ARISING OUT OF THIS
|
| 384 |
+
AGREEMENT EXCEED US$10.00. THE NATURE OF THE LIABILITY OR THE
|
| 385 |
+
NUMBER OF CLAIMS OR SUITS SHALL NOT ENLARGE OR EXTEND THIS
|
| 386 |
+
LIMIT.
|
| 387 |
+
|
| 388 |
+
These exclusions and limitations of liability shall apply
|
| 389 |
+
regardless if NVIDIA or its affiliates have been advised of
|
| 390 |
+
the possibility of such damages, and regardless of whether a
|
| 391 |
+
remedy fails its essential purpose. These exclusions and
|
| 392 |
+
limitations of liability form an essential basis of the
|
| 393 |
+
bargain between the parties, and, absent any of these
|
| 394 |
+
exclusions or limitations of liability, the provisions of this
|
| 395 |
+
Agreement, including, without limitation, the economic terms,
|
| 396 |
+
would be substantially different.
|
| 397 |
+
|
| 398 |
+
|
| 399 |
+
1.6. Termination
|
| 400 |
+
|
| 401 |
+
1. This Agreement will continue to apply until terminated by
|
| 402 |
+
either you or NVIDIA as described below.
|
| 403 |
+
|
| 404 |
+
2. If you want to terminate this Agreement, you may do so by
|
| 405 |
+
stopping to use the SDK.
|
| 406 |
+
|
| 407 |
+
3. NVIDIA may, at any time, terminate this Agreement if:
|
| 408 |
+
|
| 409 |
+
a. (i) you fail to comply with any term of this
|
| 410 |
+
Agreement and the non-compliance is not fixed within
|
| 411 |
+
thirty (30) days following notice from NVIDIA (or
|
| 412 |
+
immediately if you violate NVIDIA’s intellectual
|
| 413 |
+
property rights);
|
| 414 |
+
|
| 415 |
+
b. (ii) you commence or participate in any legal
|
| 416 |
+
proceeding against NVIDIA with respect to the SDK; or
|
| 417 |
+
|
| 418 |
+
c. (iii) NVIDIA decides to no longer provide the SDK in
|
| 419 |
+
a country or, in NVIDIA’s sole discretion, the
|
| 420 |
+
continued use of it is no longer commercially viable.
|
| 421 |
+
|
| 422 |
+
4. Upon any termination of this Agreement, you agree to
|
| 423 |
+
promptly discontinue use of the SDK and destroy all copies
|
| 424 |
+
in your possession or control. Your prior distributions in
|
| 425 |
+
accordance with this Agreement are not affected by the
|
| 426 |
+
termination of this Agreement. Upon written request, you
|
| 427 |
+
will certify in writing that you have complied with your
|
| 428 |
+
commitments under this section. Upon any termination of
|
| 429 |
+
this Agreement all provisions survive except for the
|
| 430 |
+
license grant provisions.
|
| 431 |
+
|
| 432 |
+
|
| 433 |
+
1.7. General
|
| 434 |
+
|
| 435 |
+
If you wish to assign this Agreement or your rights and
|
| 436 |
+
obligations, including by merger, consolidation, dissolution
|
| 437 |
+
or operation of law, contact NVIDIA to ask for permission. Any
|
| 438 |
+
attempted assignment not approved by NVIDIA in writing shall
|
| 439 |
+
be void and of no effect. NVIDIA may assign, delegate or
|
| 440 |
+
transfer this Agreement and its rights and obligations, and if
|
| 441 |
+
to a non-affiliate you will be notified.
|
| 442 |
+
|
| 443 |
+
You agree to cooperate with NVIDIA and provide reasonably
|
| 444 |
+
requested information to verify your compliance with this
|
| 445 |
+
Agreement.
|
| 446 |
+
|
| 447 |
+
This Agreement will be governed in all respects by the laws of
|
| 448 |
+
the United States and of the State of Delaware as those laws
|
| 449 |
+
are applied to contracts entered into and performed entirely
|
| 450 |
+
within Delaware by Delaware residents, without regard to the
|
| 451 |
+
conflicts of laws principles. The United Nations Convention on
|
| 452 |
+
Contracts for the International Sale of Goods is specifically
|
| 453 |
+
disclaimed. You agree to all terms of this Agreement in the
|
| 454 |
+
English language.
|
| 455 |
+
|
| 456 |
+
The state or federal courts residing in Santa Clara County,
|
| 457 |
+
California shall have exclusive jurisdiction over any dispute
|
| 458 |
+
or claim arising out of this Agreement. Notwithstanding this,
|
| 459 |
+
you agree that NVIDIA shall still be allowed to apply for
|
| 460 |
+
injunctive remedies or an equivalent type of urgent legal
|
| 461 |
+
relief in any jurisdiction.
|
| 462 |
+
|
| 463 |
+
If any court of competent jurisdiction determines that any
|
| 464 |
+
provision of this Agreement is illegal, invalid or
|
| 465 |
+
unenforceable, such provision will be construed as limited to
|
| 466 |
+
the extent necessary to be consistent with and fully
|
| 467 |
+
enforceable under the law and the remaining provisions will
|
| 468 |
+
remain in full force and effect. Unless otherwise specified,
|
| 469 |
+
remedies are cumulative.
|
| 470 |
+
|
| 471 |
+
Each party acknowledges and agrees that the other is an
|
| 472 |
+
independent contractor in the performance of this Agreement.
|
| 473 |
+
|
| 474 |
+
The SDK has been developed entirely at private expense and is
|
| 475 |
+
“commercial items” consisting of “commercial computer
|
| 476 |
+
software” and “commercial computer software
|
| 477 |
+
documentation” provided with RESTRICTED RIGHTS. Use,
|
| 478 |
+
duplication or disclosure by the U.S. Government or a U.S.
|
| 479 |
+
Government subcontractor is subject to the restrictions in
|
| 480 |
+
this Agreement pursuant to DFARS 227.7202-3(a) or as set forth
|
| 481 |
+
in subparagraphs (c)(1) and (2) of the Commercial Computer
|
| 482 |
+
Software - Restricted Rights clause at FAR 52.227-19, as
|
| 483 |
+
applicable. Contractor/manufacturer is NVIDIA, 2788 San Tomas
|
| 484 |
+
Expressway, Santa Clara, CA 95051.
|
| 485 |
+
|
| 486 |
+
The SDK is subject to United States export laws and
|
| 487 |
+
regulations. You agree that you will not ship, transfer or
|
| 488 |
+
export the SDK into any country, or use the SDK in any manner,
|
| 489 |
+
prohibited by the United States Bureau of Industry and
|
| 490 |
+
Security or economic sanctions regulations administered by the
|
| 491 |
+
U.S. Department of Treasury’s Office of Foreign Assets
|
| 492 |
+
Control (OFAC), or any applicable export laws, restrictions or
|
| 493 |
+
regulations. These laws include restrictions on destinations,
|
| 494 |
+
end users and end use. By accepting this Agreement, you
|
| 495 |
+
confirm that you are not a resident or citizen of any country
|
| 496 |
+
currently embargoed by the U.S. and that you are not otherwise
|
| 497 |
+
prohibited from receiving the SDK.
|
| 498 |
+
|
| 499 |
+
Any notice delivered by NVIDIA to you under this Agreement
|
| 500 |
+
will be delivered via mail, email or fax. You agree that any
|
| 501 |
+
notices that NVIDIA sends you electronically will satisfy any
|
| 502 |
+
legal communication requirements. Please direct your legal
|
| 503 |
+
notices or other correspondence to NVIDIA Corporation, 2788
|
| 504 |
+
San Tomas Expressway, Santa Clara, California 95051, United
|
| 505 |
+
States of America, Attention: Legal Department.
|
| 506 |
+
|
| 507 |
+
This Agreement and any exhibits incorporated into this
|
| 508 |
+
Agreement constitute the entire agreement of the parties with
|
| 509 |
+
respect to the subject matter of this Agreement and supersede
|
| 510 |
+
all prior negotiations or documentation exchanged between the
|
| 511 |
+
parties relating to this SDK license. Any additional and/or
|
| 512 |
+
conflicting terms on documents issued by you are null, void,
|
| 513 |
+
and invalid. Any amendment or waiver under this Agreement
|
| 514 |
+
shall be in writing and signed by representatives of both
|
| 515 |
+
parties.
|
| 516 |
+
|
| 517 |
+
|
| 518 |
+
2. CUDA Toolkit Supplement to Software License Agreement for
|
| 519 |
+
NVIDIA Software Development Kits
|
| 520 |
+
------------------------------------------------------------
|
| 521 |
+
|
| 522 |
+
|
| 523 |
+
Release date: August 16, 2018
|
| 524 |
+
-----------------------------
|
| 525 |
+
|
| 526 |
+
The terms in this supplement govern your use of the NVIDIA
|
| 527 |
+
CUDA Toolkit SDK under the terms of your license agreement
|
| 528 |
+
(“Agreement”) as modified by this supplement. Capitalized
|
| 529 |
+
terms used but not defined below have the meaning assigned to
|
| 530 |
+
them in the Agreement.
|
| 531 |
+
|
| 532 |
+
This supplement is an exhibit to the Agreement and is
|
| 533 |
+
incorporated as an integral part of the Agreement. In the
|
| 534 |
+
event of conflict between the terms in this supplement and the
|
| 535 |
+
terms in the Agreement, the terms in this supplement govern.
|
| 536 |
+
|
| 537 |
+
|
| 538 |
+
2.1. License Scope
|
| 539 |
+
|
| 540 |
+
The SDK is licensed for you to develop applications only for
|
| 541 |
+
use in systems with NVIDIA GPUs.
|
| 542 |
+
|
| 543 |
+
|
| 544 |
+
2.2. Distribution
|
| 545 |
+
|
| 546 |
+
The portions of the SDK that are distributable under the
|
| 547 |
+
Agreement are listed in Attachment A.
|
| 548 |
+
|
| 549 |
+
|
| 550 |
+
2.3. Operating Systems
|
| 551 |
+
|
| 552 |
+
Those portions of the SDK designed exclusively for use on the
|
| 553 |
+
Linux or FreeBSD operating systems, or other operating systems
|
| 554 |
+
derived from the source code to these operating systems, may
|
| 555 |
+
be copied and redistributed for use in accordance with this
|
| 556 |
+
Agreement, provided that the object code files are not
|
| 557 |
+
modified in any way (except for unzipping of compressed
|
| 558 |
+
files).
|
| 559 |
+
|
| 560 |
+
|
| 561 |
+
2.4. Audio and Video Encoders and Decoders
|
| 562 |
+
|
| 563 |
+
You acknowledge and agree that it is your sole responsibility
|
| 564 |
+
to obtain any additional third-party licenses required to
|
| 565 |
+
make, have made, use, have used, sell, import, and offer for
|
| 566 |
+
sale your products or services that include or incorporate any
|
| 567 |
+
third-party software and content relating to audio and/or
|
| 568 |
+
video encoders and decoders from, including but not limited
|
| 569 |
+
to, Microsoft, Thomson, Fraunhofer IIS, Sisvel S.p.A.,
|
| 570 |
+
MPEG-LA, and Coding Technologies. NVIDIA does not grant to you
|
| 571 |
+
under this Agreement any necessary patent or other rights with
|
| 572 |
+
respect to any audio and/or video encoders and decoders.
|
| 573 |
+
|
| 574 |
+
|
| 575 |
+
2.5. Licensing
|
| 576 |
+
|
| 577 |
+
If the distribution terms in this Agreement are not suitable
|
| 578 |
+
for your organization, or for any questions regarding this
|
| 579 |
+
Agreement, please contact NVIDIA at
|
| 580 |
+
nvidia-compute-license-questions@nvidia.com.
|
| 581 |
+
|
| 582 |
+
|
| 583 |
+
2.6. Attachment A
|
| 584 |
+
|
| 585 |
+
The following portions of the SDK are distributable under the
|
| 586 |
+
Agreement:
|
| 587 |
+
|
| 588 |
+
Component
|
| 589 |
+
|
| 590 |
+
CUDA Runtime
|
| 591 |
+
|
| 592 |
+
Windows
|
| 593 |
+
|
| 594 |
+
cudart.dll, cudart_static.lib, cudadevrt.lib
|
| 595 |
+
|
| 596 |
+
Mac OSX
|
| 597 |
+
|
| 598 |
+
libcudart.dylib, libcudart_static.a, libcudadevrt.a
|
| 599 |
+
|
| 600 |
+
Linux
|
| 601 |
+
|
| 602 |
+
libcudart.so, libcudart_static.a, libcudadevrt.a
|
| 603 |
+
|
| 604 |
+
Android
|
| 605 |
+
|
| 606 |
+
libcudart.so, libcudart_static.a, libcudadevrt.a
|
| 607 |
+
|
| 608 |
+
Component
|
| 609 |
+
|
| 610 |
+
CUDA FFT Library
|
| 611 |
+
|
| 612 |
+
Windows
|
| 613 |
+
|
| 614 |
+
cufft.dll, cufftw.dll, cufft.lib, cufftw.lib
|
| 615 |
+
|
| 616 |
+
Mac OSX
|
| 617 |
+
|
| 618 |
+
libcufft.dylib, libcufft_static.a, libcufftw.dylib,
|
| 619 |
+
libcufftw_static.a
|
| 620 |
+
|
| 621 |
+
Linux
|
| 622 |
+
|
| 623 |
+
libcufft.so, libcufft_static.a, libcufftw.so,
|
| 624 |
+
libcufftw_static.a
|
| 625 |
+
|
| 626 |
+
Android
|
| 627 |
+
|
| 628 |
+
libcufft.so, libcufft_static.a, libcufftw.so,
|
| 629 |
+
libcufftw_static.a
|
| 630 |
+
|
| 631 |
+
Component
|
| 632 |
+
|
| 633 |
+
CUDA BLAS Library
|
| 634 |
+
|
| 635 |
+
Windows
|
| 636 |
+
|
| 637 |
+
cublas.dll, cublasLt.dll
|
| 638 |
+
|
| 639 |
+
Mac OSX
|
| 640 |
+
|
| 641 |
+
libcublas.dylib, libcublasLt.dylib, libcublas_static.a,
|
| 642 |
+
libcublasLt_static.a
|
| 643 |
+
|
| 644 |
+
Linux
|
| 645 |
+
|
| 646 |
+
libcublas.so, libcublasLt.so, libcublas_static.a,
|
| 647 |
+
libcublasLt_static.a
|
| 648 |
+
|
| 649 |
+
Android
|
| 650 |
+
|
| 651 |
+
libcublas.so, libcublasLt.so, libcublas_static.a,
|
| 652 |
+
libcublasLt_static.a
|
| 653 |
+
|
| 654 |
+
Component
|
| 655 |
+
|
| 656 |
+
NVIDIA "Drop-in" BLAS Library
|
| 657 |
+
|
| 658 |
+
Windows
|
| 659 |
+
|
| 660 |
+
nvblas.dll
|
| 661 |
+
|
| 662 |
+
Mac OSX
|
| 663 |
+
|
| 664 |
+
libnvblas.dylib
|
| 665 |
+
|
| 666 |
+
Linux
|
| 667 |
+
|
| 668 |
+
libnvblas.so
|
| 669 |
+
|
| 670 |
+
Component
|
| 671 |
+
|
| 672 |
+
CUDA Sparse Matrix Library
|
| 673 |
+
|
| 674 |
+
Windows
|
| 675 |
+
|
| 676 |
+
cusparse.dll, cusparse.lib
|
| 677 |
+
|
| 678 |
+
Mac OSX
|
| 679 |
+
|
| 680 |
+
libcusparse.dylib, libcusparse_static.a
|
| 681 |
+
|
| 682 |
+
Linux
|
| 683 |
+
|
| 684 |
+
libcusparse.so, libcusparse_static.a
|
| 685 |
+
|
| 686 |
+
Android
|
| 687 |
+
|
| 688 |
+
libcusparse.so, libcusparse_static.a
|
| 689 |
+
|
| 690 |
+
Component
|
| 691 |
+
|
| 692 |
+
CUDA Linear Solver Library
|
| 693 |
+
|
| 694 |
+
Windows
|
| 695 |
+
|
| 696 |
+
cusolver.dll, cusolver.lib
|
| 697 |
+
|
| 698 |
+
Mac OSX
|
| 699 |
+
|
| 700 |
+
libcusolver.dylib, libcusolver_static.a
|
| 701 |
+
|
| 702 |
+
Linux
|
| 703 |
+
|
| 704 |
+
libcusolver.so, libcusolver_static.a
|
| 705 |
+
|
| 706 |
+
Android
|
| 707 |
+
|
| 708 |
+
libcusolver.so, libcusolver_static.a
|
| 709 |
+
|
| 710 |
+
Component
|
| 711 |
+
|
| 712 |
+
CUDA Random Number Generation Library
|
| 713 |
+
|
| 714 |
+
Windows
|
| 715 |
+
|
| 716 |
+
curand.dll, curand.lib
|
| 717 |
+
|
| 718 |
+
Mac OSX
|
| 719 |
+
|
| 720 |
+
libcurand.dylib, libcurand_static.a
|
| 721 |
+
|
| 722 |
+
Linux
|
| 723 |
+
|
| 724 |
+
libcurand.so, libcurand_static.a
|
| 725 |
+
|
| 726 |
+
Android
|
| 727 |
+
|
| 728 |
+
libcurand.so, libcurand_static.a
|
| 729 |
+
|
| 730 |
+
Component
|
| 731 |
+
|
| 732 |
+
CUDA Accelerated Graph Library
|
| 733 |
+
|
| 734 |
+
Component
|
| 735 |
+
|
| 736 |
+
NVIDIA Performance Primitives Library
|
| 737 |
+
|
| 738 |
+
Windows
|
| 739 |
+
|
| 740 |
+
nppc.dll, nppc.lib, nppial.dll, nppial.lib, nppicc.dll,
|
| 741 |
+
nppicc.lib, nppicom.dll, nppicom.lib, nppidei.dll,
|
| 742 |
+
nppidei.lib, nppif.dll, nppif.lib, nppig.dll, nppig.lib,
|
| 743 |
+
nppim.dll, nppim.lib, nppist.dll, nppist.lib, nppisu.dll,
|
| 744 |
+
nppisu.lib, nppitc.dll, nppitc.lib, npps.dll, npps.lib
|
| 745 |
+
|
| 746 |
+
Mac OSX
|
| 747 |
+
|
| 748 |
+
libnppc.dylib, libnppc_static.a, libnppial.dylib,
|
| 749 |
+
libnppial_static.a, libnppicc.dylib, libnppicc_static.a,
|
| 750 |
+
libnppicom.dylib, libnppicom_static.a, libnppidei.dylib,
|
| 751 |
+
libnppidei_static.a, libnppif.dylib, libnppif_static.a,
|
| 752 |
+
libnppig.dylib, libnppig_static.a, libnppim.dylib,
|
| 753 |
+
libnppisu_static.a, libnppitc.dylib, libnppitc_static.a,
|
| 754 |
+
libnpps.dylib, libnpps_static.a
|
| 755 |
+
|
| 756 |
+
Linux
|
| 757 |
+
|
| 758 |
+
libnppc.so, libnppc_static.a, libnppial.so,
|
| 759 |
+
libnppial_static.a, libnppicc.so, libnppicc_static.a,
|
| 760 |
+
libnppicom.so, libnppicom_static.a, libnppidei.so,
|
| 761 |
+
libnppidei_static.a, libnppif.so, libnppif_static.a
|
| 762 |
+
libnppig.so, libnppig_static.a, libnppim.so,
|
| 763 |
+
libnppim_static.a, libnppist.so, libnppist_static.a,
|
| 764 |
+
libnppisu.so, libnppisu_static.a, libnppitc.so
|
| 765 |
+
libnppitc_static.a, libnpps.so, libnpps_static.a
|
| 766 |
+
|
| 767 |
+
Android
|
| 768 |
+
|
| 769 |
+
libnppc.so, libnppc_static.a, libnppial.so,
|
| 770 |
+
libnppial_static.a, libnppicc.so, libnppicc_static.a,
|
| 771 |
+
libnppicom.so, libnppicom_static.a, libnppidei.so,
|
| 772 |
+
libnppidei_static.a, libnppif.so, libnppif_static.a
|
| 773 |
+
libnppig.so, libnppig_static.a, libnppim.so,
|
| 774 |
+
libnppim_static.a, libnppist.so, libnppist_static.a,
|
| 775 |
+
libnppisu.so, libnppisu_static.a, libnppitc.so
|
| 776 |
+
libnppitc_static.a, libnpps.so, libnpps_static.a
|
| 777 |
+
|
| 778 |
+
Component
|
| 779 |
+
|
| 780 |
+
NVIDIA JPEG Library
|
| 781 |
+
|
| 782 |
+
Linux
|
| 783 |
+
|
| 784 |
+
libnvjpeg.so, libnvjpeg_static.a
|
| 785 |
+
|
| 786 |
+
Component
|
| 787 |
+
|
| 788 |
+
Internal common library required for statically linking to
|
| 789 |
+
cuBLAS, cuSPARSE, cuFFT, cuRAND, nvJPEG and NPP
|
| 790 |
+
|
| 791 |
+
Mac OSX
|
| 792 |
+
|
| 793 |
+
libculibos.a
|
| 794 |
+
|
| 795 |
+
Linux
|
| 796 |
+
|
| 797 |
+
libculibos.a
|
| 798 |
+
|
| 799 |
+
Component
|
| 800 |
+
|
| 801 |
+
NVIDIA Runtime Compilation Library and Header
|
| 802 |
+
|
| 803 |
+
All
|
| 804 |
+
|
| 805 |
+
nvrtc.h
|
| 806 |
+
|
| 807 |
+
Windows
|
| 808 |
+
|
| 809 |
+
nvrtc.dll, nvrtc-builtins.dll
|
| 810 |
+
|
| 811 |
+
Mac OSX
|
| 812 |
+
|
| 813 |
+
libnvrtc.dylib, libnvrtc-builtins.dylib
|
| 814 |
+
|
| 815 |
+
Linux
|
| 816 |
+
|
| 817 |
+
libnvrtc.so, libnvrtc-builtins.so
|
| 818 |
+
|
| 819 |
+
Component
|
| 820 |
+
|
| 821 |
+
NVIDIA Optimizing Compiler Library
|
| 822 |
+
|
| 823 |
+
Windows
|
| 824 |
+
|
| 825 |
+
nvvm.dll
|
| 826 |
+
|
| 827 |
+
Mac OSX
|
| 828 |
+
|
| 829 |
+
libnvvm.dylib
|
| 830 |
+
|
| 831 |
+
Linux
|
| 832 |
+
|
| 833 |
+
libnvvm.so
|
| 834 |
+
|
| 835 |
+
Component
|
| 836 |
+
|
| 837 |
+
NVIDIA Common Device Math Functions Library
|
| 838 |
+
|
| 839 |
+
Windows
|
| 840 |
+
|
| 841 |
+
libdevice.10.bc
|
| 842 |
+
|
| 843 |
+
Mac OSX
|
| 844 |
+
|
| 845 |
+
libdevice.10.bc
|
| 846 |
+
|
| 847 |
+
Linux
|
| 848 |
+
|
| 849 |
+
libdevice.10.bc
|
| 850 |
+
|
| 851 |
+
Component
|
| 852 |
+
|
| 853 |
+
CUDA Occupancy Calculation Header Library
|
| 854 |
+
|
| 855 |
+
All
|
| 856 |
+
|
| 857 |
+
cuda_occupancy.h
|
| 858 |
+
|
| 859 |
+
Component
|
| 860 |
+
|
| 861 |
+
CUDA Half Precision Headers
|
| 862 |
+
|
| 863 |
+
All
|
| 864 |
+
|
| 865 |
+
cuda_fp16.h, cuda_fp16.hpp
|
| 866 |
+
|
| 867 |
+
Component
|
| 868 |
+
|
| 869 |
+
CUDA Profiling Tools Interface (CUPTI) Library
|
| 870 |
+
|
| 871 |
+
Windows
|
| 872 |
+
|
| 873 |
+
cupti.dll
|
| 874 |
+
|
| 875 |
+
Mac OSX
|
| 876 |
+
|
| 877 |
+
libcupti.dylib
|
| 878 |
+
|
| 879 |
+
Linux
|
| 880 |
+
|
| 881 |
+
libcupti.so
|
| 882 |
+
|
| 883 |
+
Component
|
| 884 |
+
|
| 885 |
+
NVIDIA Tools Extension Library
|
| 886 |
+
|
| 887 |
+
Windows
|
| 888 |
+
|
| 889 |
+
nvToolsExt.dll, nvToolsExt.lib
|
| 890 |
+
|
| 891 |
+
Mac OSX
|
| 892 |
+
|
| 893 |
+
libnvToolsExt.dylib
|
| 894 |
+
|
| 895 |
+
Linux
|
| 896 |
+
|
| 897 |
+
libnvToolsExt.so
|
| 898 |
+
|
| 899 |
+
Component
|
| 900 |
+
|
| 901 |
+
NVIDIA CUDA Driver Libraries
|
| 902 |
+
|
| 903 |
+
Linux
|
| 904 |
+
|
| 905 |
+
libcuda.so, libnvidia-fatbinaryloader.so,
|
| 906 |
+
libnvidia-ptxjitcompiler.so
|
| 907 |
+
|
| 908 |
+
The NVIDIA CUDA Driver Libraries are only distributable in
|
| 909 |
+
applications that meet this criteria:
|
| 910 |
+
|
| 911 |
+
1. The application was developed starting from a NVIDIA CUDA
|
| 912 |
+
container obtained from Docker Hub or the NVIDIA GPU
|
| 913 |
+
Cloud, and
|
| 914 |
+
|
| 915 |
+
2. The resulting application is packaged as a Docker
|
| 916 |
+
container and distributed to users on Docker Hub or the
|
| 917 |
+
NVIDIA GPU Cloud only.
|
| 918 |
+
|
| 919 |
+
|
| 920 |
+
2.7. Attachment B
|
| 921 |
+
|
| 922 |
+
|
| 923 |
+
Additional Licensing Obligations
|
| 924 |
+
|
| 925 |
+
The following third party components included in the SOFTWARE
|
| 926 |
+
are licensed to Licensee pursuant to the following terms and
|
| 927 |
+
conditions:
|
| 928 |
+
|
| 929 |
+
1. Licensee's use of the GDB third party component is
|
| 930 |
+
subject to the terms and conditions of GNU GPL v3:
|
| 931 |
+
|
| 932 |
+
This product includes copyrighted third-party software licensed
|
| 933 |
+
under the terms of the GNU General Public License v3 ("GPL v3").
|
| 934 |
+
All third-party software packages are copyright by their respective
|
| 935 |
+
authors. GPL v3 terms and conditions are hereby incorporated into
|
| 936 |
+
the Agreement by this reference: http://www.gnu.org/licenses/gpl.txt
|
| 937 |
+
|
| 938 |
+
Consistent with these licensing requirements, the software
|
| 939 |
+
listed below is provided under the terms of the specified
|
| 940 |
+
open source software licenses. To obtain source code for
|
| 941 |
+
software provided under licenses that require
|
| 942 |
+
redistribution of source code, including the GNU General
|
| 943 |
+
Public License (GPL) and GNU Lesser General Public License
|
| 944 |
+
(LGPL), contact oss-requests@nvidia.com. This offer is
|
| 945 |
+
valid for a period of three (3) years from the date of the
|
| 946 |
+
distribution of this product by NVIDIA CORPORATION.
|
| 947 |
+
|
| 948 |
+
Component License
|
| 949 |
+
CUDA-GDB GPL v3
|
| 950 |
+
|
| 951 |
+
2. Licensee represents and warrants that any and all third
|
| 952 |
+
party licensing and/or royalty payment obligations in
|
| 953 |
+
connection with Licensee's use of the H.264 video codecs
|
| 954 |
+
are solely the responsibility of Licensee.
|
| 955 |
+
|
| 956 |
+
3. Licensee's use of the Thrust library is subject to the
|
| 957 |
+
terms and conditions of the Apache License Version 2.0.
|
| 958 |
+
All third-party software packages are copyright by their
|
| 959 |
+
respective authors. Apache License Version 2.0 terms and
|
| 960 |
+
conditions are hereby incorporated into the Agreement by
|
| 961 |
+
this reference.
|
| 962 |
+
http://www.apache.org/licenses/LICENSE-2.0.html
|
| 963 |
+
|
| 964 |
+
In addition, Licensee acknowledges the following notice:
|
| 965 |
+
Thrust includes source code from the Boost Iterator,
|
| 966 |
+
Tuple, System, and Random Number libraries.
|
| 967 |
+
|
| 968 |
+
Boost Software License - Version 1.0 - August 17th, 2003
|
| 969 |
+
. . . .
|
| 970 |
+
|
| 971 |
+
Permission is hereby granted, free of charge, to any person or
|
| 972 |
+
organization obtaining a copy of the software and accompanying
|
| 973 |
+
documentation covered by this license (the "Software") to use,
|
| 974 |
+
reproduce, display, distribute, execute, and transmit the Software,
|
| 975 |
+
and to prepare derivative works of the Software, and to permit
|
| 976 |
+
third-parties to whom the Software is furnished to do so, all
|
| 977 |
+
subject to the following:
|
| 978 |
+
|
| 979 |
+
The copyright notices in the Software and this entire statement,
|
| 980 |
+
including the above license grant, this restriction and the following
|
| 981 |
+
disclaimer, must be included in all copies of the Software, in whole
|
| 982 |
+
or in part, and all derivative works of the Software, unless such
|
| 983 |
+
copies or derivative works are solely in the form of machine-executable
|
| 984 |
+
object code generated by a source language processor.
|
| 985 |
+
|
| 986 |
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
| 987 |
+
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
| 988 |
+
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND
|
| 989 |
+
NON-INFRINGEMENT. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
|
| 990 |
+
ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE FOR ANY DAMAGES OR
|
| 991 |
+
OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, ARISING
|
| 992 |
+
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
| 993 |
+
OTHER DEALINGS IN THE SOFTWARE.
|
| 994 |
+
|
| 995 |
+
4. Licensee's use of the LLVM third party component is
|
| 996 |
+
subject to the following terms and conditions:
|
| 997 |
+
|
| 998 |
+
======================================================
|
| 999 |
+
LLVM Release License
|
| 1000 |
+
======================================================
|
| 1001 |
+
University of Illinois/NCSA
|
| 1002 |
+
Open Source License
|
| 1003 |
+
|
| 1004 |
+
Copyright (c) 2003-2010 University of Illinois at Urbana-Champaign.
|
| 1005 |
+
All rights reserved.
|
| 1006 |
+
|
| 1007 |
+
Developed by:
|
| 1008 |
+
|
| 1009 |
+
LLVM Team
|
| 1010 |
+
|
| 1011 |
+
University of Illinois at Urbana-Champaign
|
| 1012 |
+
|
| 1013 |
+
http://llvm.org
|
| 1014 |
+
|
| 1015 |
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
| 1016 |
+
of this software and associated documentation files (the "Software"), to
|
| 1017 |
+
deal with the Software without restriction, including without limitation the
|
| 1018 |
+
rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
| 1019 |
+
sell copies of the Software, and to permit persons to whom the Software is
|
| 1020 |
+
furnished to do so, subject to the following conditions:
|
| 1021 |
+
|
| 1022 |
+
* Redistributions of source code must retain the above copyright notice,
|
| 1023 |
+
this list of conditions and the following disclaimers.
|
| 1024 |
+
|
| 1025 |
+
* Redistributions in binary form must reproduce the above copyright
|
| 1026 |
+
notice, this list of conditions and the following disclaimers in the
|
| 1027 |
+
documentation and/or other materials provided with the distribution.
|
| 1028 |
+
|
| 1029 |
+
* Neither the names of the LLVM Team, University of Illinois at Urbana-
|
| 1030 |
+
Champaign, nor the names of its contributors may be used to endorse or
|
| 1031 |
+
promote products derived from this Software without specific prior
|
| 1032 |
+
written permission.
|
| 1033 |
+
|
| 1034 |
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
| 1035 |
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
| 1036 |
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
| 1037 |
+
THE CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
|
| 1038 |
+
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
|
| 1039 |
+
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
| 1040 |
+
DEALINGS WITH THE SOFTWARE.
|
| 1041 |
+
|
| 1042 |
+
5. Licensee's use (e.g. nvprof) of the PCRE third party
|
| 1043 |
+
component is subject to the following terms and
|
| 1044 |
+
conditions:
|
| 1045 |
+
|
| 1046 |
+
------------
|
| 1047 |
+
PCRE LICENCE
|
| 1048 |
+
------------
|
| 1049 |
+
PCRE is a library of functions to support regular expressions whose syntax
|
| 1050 |
+
and semantics are as close as possible to those of the Perl 5 language.
|
| 1051 |
+
Release 8 of PCRE is distributed under the terms of the "BSD" licence, as
|
| 1052 |
+
specified below. The documentation for PCRE, supplied in the "doc"
|
| 1053 |
+
directory, is distributed under the same terms as the software itself. The
|
| 1054 |
+
basic library functions are written in C and are freestanding. Also
|
| 1055 |
+
included in the distribution is a set of C++ wrapper functions, and a just-
|
| 1056 |
+
in-time compiler that can be used to optimize pattern matching. These are
|
| 1057 |
+
both optional features that can be omitted when the library is built.
|
| 1058 |
+
|
| 1059 |
+
THE BASIC LIBRARY FUNCTIONS
|
| 1060 |
+
---------------------------
|
| 1061 |
+
Written by: Philip Hazel
|
| 1062 |
+
Email local part: ph10
|
| 1063 |
+
Email domain: cam.ac.uk
|
| 1064 |
+
University of Cambridge Computing Service,
|
| 1065 |
+
Cambridge, England.
|
| 1066 |
+
Copyright (c) 1997-2012 University of Cambridge
|
| 1067 |
+
All rights reserved.
|
| 1068 |
+
|
| 1069 |
+
PCRE JUST-IN-TIME COMPILATION SUPPORT
|
| 1070 |
+
-------------------------------------
|
| 1071 |
+
Written by: Zoltan Herczeg
|
| 1072 |
+
Email local part: hzmester
|
| 1073 |
+
Emain domain: freemail.hu
|
| 1074 |
+
Copyright(c) 2010-2012 Zoltan Herczeg
|
| 1075 |
+
All rights reserved.
|
| 1076 |
+
|
| 1077 |
+
STACK-LESS JUST-IN-TIME COMPILER
|
| 1078 |
+
--------------------------------
|
| 1079 |
+
Written by: Zoltan Herczeg
|
| 1080 |
+
Email local part: hzmester
|
| 1081 |
+
Emain domain: freemail.hu
|
| 1082 |
+
Copyright(c) 2009-2012 Zoltan Herczeg
|
| 1083 |
+
All rights reserved.
|
| 1084 |
+
|
| 1085 |
+
THE C++ WRAPPER FUNCTIONS
|
| 1086 |
+
-------------------------
|
| 1087 |
+
Contributed by: Google Inc.
|
| 1088 |
+
Copyright (c) 2007-2012, Google Inc.
|
| 1089 |
+
All rights reserved.
|
| 1090 |
+
|
| 1091 |
+
THE "BSD" LICENCE
|
| 1092 |
+
-----------------
|
| 1093 |
+
Redistribution and use in source and binary forms, with or without
|
| 1094 |
+
modification, are permitted provided that the following conditions are met:
|
| 1095 |
+
|
| 1096 |
+
* Redistributions of source code must retain the above copyright notice,
|
| 1097 |
+
this list of conditions and the following disclaimer.
|
| 1098 |
+
|
| 1099 |
+
* Redistributions in binary form must reproduce the above copyright
|
| 1100 |
+
notice, this list of conditions and the following disclaimer in the
|
| 1101 |
+
documentation and/or other materials provided with the distribution.
|
| 1102 |
+
|
| 1103 |
+
* Neither the name of the University of Cambridge nor the name of Google
|
| 1104 |
+
Inc. nor the names of their contributors may be used to endorse or
|
| 1105 |
+
promote products derived from this software without specific prior
|
| 1106 |
+
written permission.
|
| 1107 |
+
|
| 1108 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 1109 |
+
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 1110 |
+
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 1111 |
+
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
| 1112 |
+
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
| 1113 |
+
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
| 1114 |
+
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
| 1115 |
+
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
| 1116 |
+
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
| 1117 |
+
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
| 1118 |
+
POSSIBILITY OF SUCH DAMAGE.
|
| 1119 |
+
|
| 1120 |
+
6. Some of the cuBLAS library routines were written by or
|
| 1121 |
+
derived from code written by Vasily Volkov and are subject
|
| 1122 |
+
to the Modified Berkeley Software Distribution License as
|
| 1123 |
+
follows:
|
| 1124 |
+
|
| 1125 |
+
Copyright (c) 2007-2009, Regents of the University of California
|
| 1126 |
+
|
| 1127 |
+
All rights reserved.
|
| 1128 |
+
|
| 1129 |
+
Redistribution and use in source and binary forms, with or without
|
| 1130 |
+
modification, are permitted provided that the following conditions are
|
| 1131 |
+
met:
|
| 1132 |
+
* Redistributions of source code must retain the above copyright
|
| 1133 |
+
notice, this list of conditions and the following disclaimer.
|
| 1134 |
+
* Redistributions in binary form must reproduce the above
|
| 1135 |
+
copyright notice, this list of conditions and the following
|
| 1136 |
+
disclaimer in the documentation and/or other materials provided
|
| 1137 |
+
with the distribution.
|
| 1138 |
+
* Neither the name of the University of California, Berkeley nor
|
| 1139 |
+
the names of its contributors may be used to endorse or promote
|
| 1140 |
+
products derived from this software without specific prior
|
| 1141 |
+
written permission.
|
| 1142 |
+
|
| 1143 |
+
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR
|
| 1144 |
+
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
| 1145 |
+
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
| 1146 |
+
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
|
| 1147 |
+
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
| 1148 |
+
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
| 1149 |
+
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
| 1150 |
+
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
| 1151 |
+
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
|
| 1152 |
+
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
| 1153 |
+
POSSIBILITY OF SUCH DAMAGE.
|
| 1154 |
+
|
| 1155 |
+
7. Some of the cuBLAS library routines were written by or
|
| 1156 |
+
derived from code written by Davide Barbieri and are
|
| 1157 |
+
subject to the Modified Berkeley Software Distribution
|
| 1158 |
+
License as follows:
|
| 1159 |
+
|
| 1160 |
+
Copyright (c) 2008-2009 Davide Barbieri @ University of Rome Tor Vergata.
|
| 1161 |
+
|
| 1162 |
+
All rights reserved.
|
| 1163 |
+
|
| 1164 |
+
Redistribution and use in source and binary forms, with or without
|
| 1165 |
+
modification, are permitted provided that the following conditions are
|
| 1166 |
+
met:
|
| 1167 |
+
* Redistributions of source code must retain the above copyright
|
| 1168 |
+
notice, this list of conditions and the following disclaimer.
|
| 1169 |
+
* Redistributions in binary form must reproduce the above
|
| 1170 |
+
copyright notice, this list of conditions and the following
|
| 1171 |
+
disclaimer in the documentation and/or other materials provided
|
| 1172 |
+
with the distribution.
|
| 1173 |
+
* The name of the author may not be used to endorse or promote
|
| 1174 |
+
products derived from this software without specific prior
|
| 1175 |
+
written permission.
|
| 1176 |
+
|
| 1177 |
+
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR
|
| 1178 |
+
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
| 1179 |
+
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
| 1180 |
+
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
|
| 1181 |
+
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
| 1182 |
+
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
| 1183 |
+
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
| 1184 |
+
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
| 1185 |
+
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
|
| 1186 |
+
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
| 1187 |
+
POSSIBILITY OF SUCH DAMAGE.
|
| 1188 |
+
|
| 1189 |
+
8. Some of the cuBLAS library routines were derived from
|
| 1190 |
+
code developed by the University of Tennessee and are
|
| 1191 |
+
subject to the Modified Berkeley Software Distribution
|
| 1192 |
+
License as follows:
|
| 1193 |
+
|
| 1194 |
+
Copyright (c) 2010 The University of Tennessee.
|
| 1195 |
+
|
| 1196 |
+
All rights reserved.
|
| 1197 |
+
|
| 1198 |
+
Redistribution and use in source and binary forms, with or without
|
| 1199 |
+
modification, are permitted provided that the following conditions are
|
| 1200 |
+
met:
|
| 1201 |
+
* Redistributions of source code must retain the above copyright
|
| 1202 |
+
notice, this list of conditions and the following disclaimer.
|
| 1203 |
+
* Redistributions in binary form must reproduce the above
|
| 1204 |
+
copyright notice, this list of conditions and the following
|
| 1205 |
+
disclaimer listed in this license in the documentation and/or
|
| 1206 |
+
other materials provided with the distribution.
|
| 1207 |
+
* Neither the name of the copyright holders nor the names of its
|
| 1208 |
+
contributors may be used to endorse or promote products derived
|
| 1209 |
+
from this software without specific prior written permission.
|
| 1210 |
+
|
| 1211 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 1212 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 1213 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 1214 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 1215 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 1216 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 1217 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 1218 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 1219 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 1220 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 1221 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 1222 |
+
|
| 1223 |
+
9. Some of the cuBLAS library routines were written by or
|
| 1224 |
+
derived from code written by Jonathan Hogg and are subject
|
| 1225 |
+
to the Modified Berkeley Software Distribution License as
|
| 1226 |
+
follows:
|
| 1227 |
+
|
| 1228 |
+
Copyright (c) 2012, The Science and Technology Facilities Council (STFC).
|
| 1229 |
+
|
| 1230 |
+
All rights reserved.
|
| 1231 |
+
|
| 1232 |
+
Redistribution and use in source and binary forms, with or without
|
| 1233 |
+
modification, are permitted provided that the following conditions are
|
| 1234 |
+
met:
|
| 1235 |
+
* Redistributions of source code must retain the above copyright
|
| 1236 |
+
notice, this list of conditions and the following disclaimer.
|
| 1237 |
+
* Redistributions in binary form must reproduce the above
|
| 1238 |
+
copyright notice, this list of conditions and the following
|
| 1239 |
+
disclaimer in the documentation and/or other materials provided
|
| 1240 |
+
with the distribution.
|
| 1241 |
+
* Neither the name of the STFC nor the names of its contributors
|
| 1242 |
+
may be used to endorse or promote products derived from this
|
| 1243 |
+
software without specific prior written permission.
|
| 1244 |
+
|
| 1245 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 1246 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 1247 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 1248 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE STFC BE
|
| 1249 |
+
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
| 1250 |
+
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
| 1251 |
+
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
|
| 1252 |
+
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
| 1253 |
+
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
|
| 1254 |
+
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
|
| 1255 |
+
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 1256 |
+
|
| 1257 |
+
10. Some of the cuBLAS library routines were written by or
|
| 1258 |
+
derived from code written by Ahmad M. Abdelfattah, David
|
| 1259 |
+
Keyes, and Hatem Ltaief, and are subject to the Apache
|
| 1260 |
+
License, Version 2.0, as follows:
|
| 1261 |
+
|
| 1262 |
+
-- (C) Copyright 2013 King Abdullah University of Science and Technology
|
| 1263 |
+
Authors:
|
| 1264 |
+
Ahmad Abdelfattah (ahmad.ahmad@kaust.edu.sa)
|
| 1265 |
+
David Keyes (david.keyes@kaust.edu.sa)
|
| 1266 |
+
Hatem Ltaief (hatem.ltaief@kaust.edu.sa)
|
| 1267 |
+
|
| 1268 |
+
Redistribution and use in source and binary forms, with or without
|
| 1269 |
+
modification, are permitted provided that the following conditions
|
| 1270 |
+
are met:
|
| 1271 |
+
|
| 1272 |
+
* Redistributions of source code must retain the above copyright
|
| 1273 |
+
notice, this list of conditions and the following disclaimer.
|
| 1274 |
+
* Redistributions in binary form must reproduce the above copyright
|
| 1275 |
+
notice, this list of conditions and the following disclaimer in the
|
| 1276 |
+
documentation and/or other materials provided with the distribution.
|
| 1277 |
+
* Neither the name of the King Abdullah University of Science and
|
| 1278 |
+
Technology nor the names of its contributors may be used to endorse
|
| 1279 |
+
or promote products derived from this software without specific prior
|
| 1280 |
+
written permission.
|
| 1281 |
+
|
| 1282 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 1283 |
+
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 1284 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 1285 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 1286 |
+
HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 1287 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 1288 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 1289 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 1290 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 1291 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 1292 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE
|
| 1293 |
+
|
| 1294 |
+
11. Some of the cuSPARSE library routines were written by or
|
| 1295 |
+
derived from code written by Li-Wen Chang and are subject
|
| 1296 |
+
to the NCSA Open Source License as follows:
|
| 1297 |
+
|
| 1298 |
+
Copyright (c) 2012, University of Illinois.
|
| 1299 |
+
|
| 1300 |
+
All rights reserved.
|
| 1301 |
+
|
| 1302 |
+
Developed by: IMPACT Group, University of Illinois, http://impact.crhc.illinois.edu
|
| 1303 |
+
|
| 1304 |
+
Permission is hereby granted, free of charge, to any person obtaining
|
| 1305 |
+
a copy of this software and associated documentation files (the
|
| 1306 |
+
"Software"), to deal with the Software without restriction, including
|
| 1307 |
+
without limitation the rights to use, copy, modify, merge, publish,
|
| 1308 |
+
distribute, sublicense, and/or sell copies of the Software, and to
|
| 1309 |
+
permit persons to whom the Software is furnished to do so, subject to
|
| 1310 |
+
the following conditions:
|
| 1311 |
+
* Redistributions of source code must retain the above copyright
|
| 1312 |
+
notice, this list of conditions and the following disclaimer.
|
| 1313 |
+
* Redistributions in binary form must reproduce the above
|
| 1314 |
+
copyright notice, this list of conditions and the following
|
| 1315 |
+
disclaimers in the documentation and/or other materials provided
|
| 1316 |
+
with the distribution.
|
| 1317 |
+
* Neither the names of IMPACT Group, University of Illinois, nor
|
| 1318 |
+
the names of its contributors may be used to endorse or promote
|
| 1319 |
+
products derived from this Software without specific prior
|
| 1320 |
+
written permission.
|
| 1321 |
+
|
| 1322 |
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
| 1323 |
+
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
| 1324 |
+
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
| 1325 |
+
NONINFRINGEMENT. IN NO EVENT SHALL THE CONTRIBUTORS OR COPYRIGHT
|
| 1326 |
+
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
|
| 1327 |
+
IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
|
| 1328 |
+
IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE
|
| 1329 |
+
SOFTWARE.
|
| 1330 |
+
|
| 1331 |
+
12. Some of the cuRAND library routines were written by or
|
| 1332 |
+
derived from code written by Mutsuo Saito and Makoto
|
| 1333 |
+
Matsumoto and are subject to the following license:
|
| 1334 |
+
|
| 1335 |
+
Copyright (c) 2009, 2010 Mutsuo Saito, Makoto Matsumoto and Hiroshima
|
| 1336 |
+
University. All rights reserved.
|
| 1337 |
+
|
| 1338 |
+
Copyright (c) 2011 Mutsuo Saito, Makoto Matsumoto, Hiroshima
|
| 1339 |
+
University and University of Tokyo. All rights reserved.
|
| 1340 |
+
|
| 1341 |
+
Redistribution and use in source and binary forms, with or without
|
| 1342 |
+
modification, are permitted provided that the following conditions are
|
| 1343 |
+
met:
|
| 1344 |
+
* Redistributions of source code must retain the above copyright
|
| 1345 |
+
notice, this list of conditions and the following disclaimer.
|
| 1346 |
+
* Redistributions in binary form must reproduce the above
|
| 1347 |
+
copyright notice, this list of conditions and the following
|
| 1348 |
+
disclaimer in the documentation and/or other materials provided
|
| 1349 |
+
with the distribution.
|
| 1350 |
+
* Neither the name of the Hiroshima University nor the names of
|
| 1351 |
+
its contributors may be used to endorse or promote products
|
| 1352 |
+
derived from this software without specific prior written
|
| 1353 |
+
permission.
|
| 1354 |
+
|
| 1355 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 1356 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 1357 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 1358 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 1359 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 1360 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 1361 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 1362 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 1363 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 1364 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 1365 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 1366 |
+
|
| 1367 |
+
13. Some of the cuRAND library routines were derived from
|
| 1368 |
+
code developed by D. E. Shaw Research and are subject to
|
| 1369 |
+
the following license:
|
| 1370 |
+
|
| 1371 |
+
Copyright 2010-2011, D. E. Shaw Research.
|
| 1372 |
+
|
| 1373 |
+
All rights reserved.
|
| 1374 |
+
|
| 1375 |
+
Redistribution and use in source and binary forms, with or without
|
| 1376 |
+
modification, are permitted provided that the following conditions are
|
| 1377 |
+
met:
|
| 1378 |
+
* Redistributions of source code must retain the above copyright
|
| 1379 |
+
notice, this list of conditions, and the following disclaimer.
|
| 1380 |
+
* Redistributions in binary form must reproduce the above
|
| 1381 |
+
copyright notice, this list of conditions, and the following
|
| 1382 |
+
disclaimer in the documentation and/or other materials provided
|
| 1383 |
+
with the distribution.
|
| 1384 |
+
* Neither the name of D. E. Shaw Research nor the names of its
|
| 1385 |
+
contributors may be used to endorse or promote products derived
|
| 1386 |
+
from this software without specific prior written permission.
|
| 1387 |
+
|
| 1388 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 1389 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 1390 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 1391 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 1392 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 1393 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 1394 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 1395 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 1396 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 1397 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 1398 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 1399 |
+
|
| 1400 |
+
14. Some of the Math library routines were written by or
|
| 1401 |
+
derived from code developed by Norbert Juffa and are
|
| 1402 |
+
subject to the following license:
|
| 1403 |
+
|
| 1404 |
+
Copyright (c) 2015-2017, Norbert Juffa
|
| 1405 |
+
All rights reserved.
|
| 1406 |
+
|
| 1407 |
+
Redistribution and use in source and binary forms, with or without
|
| 1408 |
+
modification, are permitted provided that the following conditions
|
| 1409 |
+
are met:
|
| 1410 |
+
|
| 1411 |
+
1. Redistributions of source code must retain the above copyright
|
| 1412 |
+
notice, this list of conditions and the following disclaimer.
|
| 1413 |
+
|
| 1414 |
+
2. Redistributions in binary form must reproduce the above copyright
|
| 1415 |
+
notice, this list of conditions and the following disclaimer in the
|
| 1416 |
+
documentation and/or other materials provided with the distribution.
|
| 1417 |
+
|
| 1418 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 1419 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 1420 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 1421 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 1422 |
+
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 1423 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 1424 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 1425 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 1426 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 1427 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 1428 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 1429 |
+
|
| 1430 |
+
15. Licensee's use of the lz4 third party component is
|
| 1431 |
+
subject to the following terms and conditions:
|
| 1432 |
+
|
| 1433 |
+
Copyright (C) 2011-2013, Yann Collet.
|
| 1434 |
+
BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
|
| 1435 |
+
|
| 1436 |
+
Redistribution and use in source and binary forms, with or without
|
| 1437 |
+
modification, are permitted provided that the following conditions are
|
| 1438 |
+
met:
|
| 1439 |
+
|
| 1440 |
+
* Redistributions of source code must retain the above copyright
|
| 1441 |
+
notice, this list of conditions and the following disclaimer.
|
| 1442 |
+
* Redistributions in binary form must reproduce the above
|
| 1443 |
+
copyright notice, this list of conditions and the following disclaimer
|
| 1444 |
+
in the documentation and/or other materials provided with the
|
| 1445 |
+
distribution.
|
| 1446 |
+
|
| 1447 |
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 1448 |
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 1449 |
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 1450 |
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 1451 |
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 1452 |
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 1453 |
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 1454 |
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 1455 |
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 1456 |
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 1457 |
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 1458 |
+
|
| 1459 |
+
16. The NPP library uses code from the Boost Math Toolkit,
|
| 1460 |
+
and is subject to the following license:
|
| 1461 |
+
|
| 1462 |
+
Boost Software License - Version 1.0 - August 17th, 2003
|
| 1463 |
+
. . . .
|
| 1464 |
+
|
| 1465 |
+
Permission is hereby granted, free of charge, to any person or
|
| 1466 |
+
organization obtaining a copy of the software and accompanying
|
| 1467 |
+
documentation covered by this license (the "Software") to use,
|
| 1468 |
+
reproduce, display, distribute, execute, and transmit the Software,
|
| 1469 |
+
and to prepare derivative works of the Software, and to permit
|
| 1470 |
+
third-parties to whom the Software is furnished to do so, all
|
| 1471 |
+
subject to the following:
|
| 1472 |
+
|
| 1473 |
+
The copyright notices in the Software and this entire statement,
|
| 1474 |
+
including the above license grant, this restriction and the following
|
| 1475 |
+
disclaimer, must be included in all copies of the Software, in whole
|
| 1476 |
+
or in part, and all derivative works of the Software, unless such
|
| 1477 |
+
copies or derivative works are solely in the form of machine-executable
|
| 1478 |
+
object code generated by a source language processor.
|
| 1479 |
+
|
| 1480 |
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
| 1481 |
+
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
| 1482 |
+
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND
|
| 1483 |
+
NON-INFRINGEMENT. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
|
| 1484 |
+
ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE FOR ANY DAMAGES OR
|
| 1485 |
+
OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, ARISING
|
| 1486 |
+
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
| 1487 |
+
OTHER DEALINGS IN THE SOFTWARE.
|
| 1488 |
+
|
| 1489 |
+
17. Portions of the Nsight Eclipse Edition is subject to the
|
| 1490 |
+
following license:
|
| 1491 |
+
|
| 1492 |
+
The Eclipse Foundation makes available all content in this plug-in
|
| 1493 |
+
("Content"). Unless otherwise indicated below, the Content is provided
|
| 1494 |
+
to you under the terms and conditions of the Eclipse Public License
|
| 1495 |
+
Version 1.0 ("EPL"). A copy of the EPL is available at http://
|
| 1496 |
+
www.eclipse.org/legal/epl-v10.html. For purposes of the EPL, "Program"
|
| 1497 |
+
will mean the Content.
|
| 1498 |
+
|
| 1499 |
+
If you did not receive this Content directly from the Eclipse
|
| 1500 |
+
Foundation, the Content is being redistributed by another party
|
| 1501 |
+
("Redistributor") and different terms and conditions may apply to your
|
| 1502 |
+
use of any object code in the Content. Check the Redistributor's
|
| 1503 |
+
license that was provided with the Content. If no such license exists,
|
| 1504 |
+
contact the Redistributor. Unless otherwise indicated below, the terms
|
| 1505 |
+
and conditions of the EPL still apply to any source code in the
|
| 1506 |
+
Content and such source code may be obtained at http://www.eclipse.org.
|
| 1507 |
+
|
| 1508 |
+
18. Some of the cuBLAS library routines uses code from
|
| 1509 |
+
OpenAI, which is subject to the following license:
|
| 1510 |
+
|
| 1511 |
+
License URL
|
| 1512 |
+
https://github.com/openai/openai-gemm/blob/master/LICENSE
|
| 1513 |
+
|
| 1514 |
+
License Text
|
| 1515 |
+
The MIT License
|
| 1516 |
+
|
| 1517 |
+
Copyright (c) 2016 OpenAI (http://openai.com), 2016 Google Inc.
|
| 1518 |
+
|
| 1519 |
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
| 1520 |
+
of this software and associated documentation files (the "Software"), to deal
|
| 1521 |
+
in the Software without restriction, including without limitation the rights
|
| 1522 |
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
| 1523 |
+
copies of the Software, and to permit persons to whom the Software is
|
| 1524 |
+
furnished to do so, subject to the following conditions:
|
| 1525 |
+
|
| 1526 |
+
The above copyright notice and this permission notice shall be included in
|
| 1527 |
+
all copies or substantial portions of the Software.
|
| 1528 |
+
|
| 1529 |
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
| 1530 |
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
| 1531 |
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
| 1532 |
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
| 1533 |
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
| 1534 |
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
| 1535 |
+
THE SOFTWARE.
|
| 1536 |
+
|
| 1537 |
+
19. Licensee's use of the Visual Studio Setup Configuration
|
| 1538 |
+
Samples is subject to the following license:
|
| 1539 |
+
|
| 1540 |
+
The MIT License (MIT)
|
| 1541 |
+
Copyright (C) Microsoft Corporation. All rights reserved.
|
| 1542 |
+
|
| 1543 |
+
Permission is hereby granted, free of charge, to any person
|
| 1544 |
+
obtaining a copy of this software and associated documentation
|
| 1545 |
+
files (the "Software"), to deal in the Software without restriction,
|
| 1546 |
+
including without limitation the rights to use, copy, modify, merge,
|
| 1547 |
+
publish, distribute, sublicense, and/or sell copies of the Software,
|
| 1548 |
+
and to permit persons to whom the Software is furnished to do so,
|
| 1549 |
+
subject to the following conditions:
|
| 1550 |
+
|
| 1551 |
+
The above copyright notice and this permission notice shall be included
|
| 1552 |
+
in all copies or substantial portions of the Software.
|
| 1553 |
+
|
| 1554 |
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
| 1555 |
+
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
| 1556 |
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
| 1557 |
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
| 1558 |
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
| 1559 |
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
| 1560 |
+
|
| 1561 |
+
20. Licensee's use of linmath.h header for CPU functions for
|
| 1562 |
+
GL vector/matrix operations from lunarG is subject to the
|
| 1563 |
+
Apache License Version 2.0.
|
| 1564 |
+
|
| 1565 |
+
21. The DX12-CUDA sample uses the d3dx12.h header, which is
|
| 1566 |
+
subject to the MIT license .
|
| 1567 |
+
|
| 1568 |
+
-----------------
|
.venv/lib/python3.12/site-packages/nvidia_cuda_runtime_cu12-12.8.90.dist-info/METADATA
ADDED
|
@@ -0,0 +1,44 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Metadata-Version: 2.2
|
| 2 |
+
Name: nvidia-cuda-runtime-cu12
|
| 3 |
+
Version: 12.8.90
|
| 4 |
+
Summary: CUDA Runtime native Libraries
|
| 5 |
+
Home-page: https://developer.nvidia.com/cuda-zone
|
| 6 |
+
Author: Nvidia CUDA Installer Team
|
| 7 |
+
Author-email: compute_installer@nvidia.com
|
| 8 |
+
License: NVIDIA Proprietary Software
|
| 9 |
+
Keywords: cuda,nvidia,runtime,machine learning,deep learning
|
| 10 |
+
Classifier: Development Status :: 4 - Beta
|
| 11 |
+
Classifier: Intended Audience :: Developers
|
| 12 |
+
Classifier: Intended Audience :: Education
|
| 13 |
+
Classifier: Intended Audience :: Science/Research
|
| 14 |
+
Classifier: License :: Other/Proprietary License
|
| 15 |
+
Classifier: Natural Language :: English
|
| 16 |
+
Classifier: Programming Language :: Python :: 3
|
| 17 |
+
Classifier: Programming Language :: Python :: 3.5
|
| 18 |
+
Classifier: Programming Language :: Python :: 3.6
|
| 19 |
+
Classifier: Programming Language :: Python :: 3.7
|
| 20 |
+
Classifier: Programming Language :: Python :: 3.8
|
| 21 |
+
Classifier: Programming Language :: Python :: 3.9
|
| 22 |
+
Classifier: Programming Language :: Python :: 3.10
|
| 23 |
+
Classifier: Programming Language :: Python :: 3.11
|
| 24 |
+
Classifier: Programming Language :: Python :: 3 :: Only
|
| 25 |
+
Classifier: Topic :: Scientific/Engineering
|
| 26 |
+
Classifier: Topic :: Scientific/Engineering :: Mathematics
|
| 27 |
+
Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
|
| 28 |
+
Classifier: Topic :: Software Development
|
| 29 |
+
Classifier: Topic :: Software Development :: Libraries
|
| 30 |
+
Classifier: Operating System :: Microsoft :: Windows
|
| 31 |
+
Classifier: Operating System :: POSIX :: Linux
|
| 32 |
+
Requires-Python: >=3
|
| 33 |
+
License-File: License.txt
|
| 34 |
+
Dynamic: author
|
| 35 |
+
Dynamic: author-email
|
| 36 |
+
Dynamic: classifier
|
| 37 |
+
Dynamic: description
|
| 38 |
+
Dynamic: home-page
|
| 39 |
+
Dynamic: keywords
|
| 40 |
+
Dynamic: license
|
| 41 |
+
Dynamic: requires-python
|
| 42 |
+
Dynamic: summary
|
| 43 |
+
|
| 44 |
+
CUDA Runtime native Libraries
|
.venv/lib/python3.12/site-packages/nvidia_cufile_cu12-1.13.1.3.dist-info/INSTALLER
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
pip
|
.venv/lib/python3.12/site-packages/nvidia_cufile_cu12-1.13.1.3.dist-info/METADATA
ADDED
|
@@ -0,0 +1,44 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Metadata-Version: 2.2
|
| 2 |
+
Name: nvidia-cufile-cu12
|
| 3 |
+
Version: 1.13.1.3
|
| 4 |
+
Summary: cuFile GPUDirect libraries
|
| 5 |
+
Home-page: https://developer.nvidia.com/cuda-zone
|
| 6 |
+
Author: Nvidia CUDA Installer Team
|
| 7 |
+
Author-email: compute_installer@nvidia.com
|
| 8 |
+
License: NVIDIA Proprietary Software
|
| 9 |
+
Keywords: cuda,nvidia,runtime,machine learning,deep learning
|
| 10 |
+
Classifier: Development Status :: 4 - Beta
|
| 11 |
+
Classifier: Intended Audience :: Developers
|
| 12 |
+
Classifier: Intended Audience :: Education
|
| 13 |
+
Classifier: Intended Audience :: Science/Research
|
| 14 |
+
Classifier: License :: Other/Proprietary License
|
| 15 |
+
Classifier: Natural Language :: English
|
| 16 |
+
Classifier: Programming Language :: Python :: 3
|
| 17 |
+
Classifier: Programming Language :: Python :: 3.5
|
| 18 |
+
Classifier: Programming Language :: Python :: 3.6
|
| 19 |
+
Classifier: Programming Language :: Python :: 3.7
|
| 20 |
+
Classifier: Programming Language :: Python :: 3.8
|
| 21 |
+
Classifier: Programming Language :: Python :: 3.9
|
| 22 |
+
Classifier: Programming Language :: Python :: 3.10
|
| 23 |
+
Classifier: Programming Language :: Python :: 3.11
|
| 24 |
+
Classifier: Programming Language :: Python :: 3 :: Only
|
| 25 |
+
Classifier: Topic :: Scientific/Engineering
|
| 26 |
+
Classifier: Topic :: Scientific/Engineering :: Mathematics
|
| 27 |
+
Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
|
| 28 |
+
Classifier: Topic :: Software Development
|
| 29 |
+
Classifier: Topic :: Software Development :: Libraries
|
| 30 |
+
Classifier: Operating System :: Microsoft :: Windows
|
| 31 |
+
Classifier: Operating System :: POSIX :: Linux
|
| 32 |
+
Requires-Python: >=3
|
| 33 |
+
License-File: License.txt
|
| 34 |
+
Dynamic: author
|
| 35 |
+
Dynamic: author-email
|
| 36 |
+
Dynamic: classifier
|
| 37 |
+
Dynamic: description
|
| 38 |
+
Dynamic: home-page
|
| 39 |
+
Dynamic: keywords
|
| 40 |
+
Dynamic: license
|
| 41 |
+
Dynamic: requires-python
|
| 42 |
+
Dynamic: summary
|
| 43 |
+
|
| 44 |
+
cuFile GPUDirect libraries
|
.venv/lib/python3.12/site-packages/nvidia_cufile_cu12-1.13.1.3.dist-info/WHEEL
ADDED
|
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Wheel-Version: 1.0
|
| 2 |
+
Generator: setuptools (75.8.0)
|
| 3 |
+
Root-Is-Purelib: true
|
| 4 |
+
Tag: py3-none-manylinux2014_x86_64
|
| 5 |
+
Tag: py3-none-manylinux_2_17_x86_64
|
| 6 |
+
|
.venv/lib/python3.12/site-packages/nvidia_cufile_cu12-1.13.1.3.dist-info/top_level.txt
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
nvidia
|
.venv/lib/python3.12/site-packages/nvidia_curand_cu12-10.3.9.90.dist-info/INSTALLER
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
pip
|
.venv/lib/python3.12/site-packages/nvidia_curand_cu12-10.3.9.90.dist-info/top_level.txt
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
nvidia
|
.venv/lib/python3.12/site-packages/nvidia_cusparse_cu12-12.5.8.93.dist-info/INSTALLER
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
pip
|
.venv/lib/python3.12/site-packages/nvidia_cusparse_cu12-12.5.8.93.dist-info/WHEEL
ADDED
|
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Wheel-Version: 1.0
|
| 2 |
+
Generator: setuptools (75.8.1)
|
| 3 |
+
Root-Is-Purelib: true
|
| 4 |
+
Tag: py3-none-manylinux2014_x86_64
|
| 5 |
+
Tag: py3-none-manylinux_2_17_x86_64
|
| 6 |
+
|
.venv/lib/python3.12/site-packages/nvidia_cusparse_cu12-12.5.8.93.dist-info/top_level.txt
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
nvidia
|
.venv/lib/python3.12/site-packages/nvidia_nccl_cu12-2.27.3.dist-info/RECORD
ADDED
|
@@ -0,0 +1,8 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
nvidia/nccl/include/nccl.h,sha256=a-E7PcjbKHPqQfuDKjT5Mt9fDxwv32LNIpOtJyxBv94,22566
|
| 2 |
+
nvidia/nccl/lib/libnccl.so.2,sha256=H8Nu68hPSxCSPu4hU47Y-iVyVkfQb0hAvA_jmabtm8Q,429634192
|
| 3 |
+
nvidia_nccl_cu12-2.27.3.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
|
| 4 |
+
nvidia_nccl_cu12-2.27.3.dist-info/METADATA,sha256=h-6ZnFWjGBdh9Ld1ijhVOXdrDLo82k_Q-L_02ibG41U,2019
|
| 5 |
+
nvidia_nccl_cu12-2.27.3.dist-info/RECORD,,
|
| 6 |
+
nvidia_nccl_cu12-2.27.3.dist-info/WHEEL,sha256=gy6FWQgpujK_dnYc155G2NL32NQjpi5ebTEXjh8SGZQ,144
|
| 7 |
+
nvidia_nccl_cu12-2.27.3.dist-info/licenses/License.txt,sha256=DwF0prTgszrCY3W_cpUzB1sy9MUaW2gCo9dC19zcmnY,1895
|
| 8 |
+
nvidia_nccl_cu12-2.27.3.dist-info/top_level.txt,sha256=fTkAtiFuL16nUrB9ytDDtpytz2t0B4NvYTnRzwAhO14,7
|
.venv/lib/python3.12/site-packages/nvidia_nccl_cu12-2.27.3.dist-info/WHEEL
ADDED
|
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Wheel-Version: 1.0
|
| 2 |
+
Generator: setuptools (80.9.0)
|
| 3 |
+
Root-Is-Purelib: true
|
| 4 |
+
Tag: py3-none-manylinux2014_x86_64
|
| 5 |
+
Tag: py3-none-manylinux_2_17_x86_64
|
| 6 |
+
|