X7ROOT File Manager
Current Path:
/opt/cloudlinux/venv/lib/python3.11/site-packages/numpy/core
opt
/
cloudlinux
/
venv
/
lib
/
python3.11
/
site-packages
/
numpy
/
core
/
ðŸ“
..
📄
__init__.py
(5.64 KB)
📄
__init__.pyi
(126 B)
ðŸ“
__pycache__
📄
_add_newdocs.py
(204.07 KB)
📄
_add_newdocs_scalars.py
(11.82 KB)
📄
_asarray.py
(3.79 KB)
📄
_asarray.pyi
(1.06 KB)
📄
_dtype.py
(10.36 KB)
📄
_dtype_ctypes.py
(3.59 KB)
📄
_exceptions.py
(5.25 KB)
📄
_internal.py
(27.68 KB)
📄
_internal.pyi
(1.01 KB)
📄
_machar.py
(11.29 KB)
📄
_methods.py
(8.41 KB)
📄
_multiarray_tests.cpython-311-x86_64-linux-gnu.so
(171.4 KB)
📄
_multiarray_umath.cpython-311-x86_64-linux-gnu.so
(6.64 MB)
📄
_operand_flag_tests.cpython-311-x86_64-linux-gnu.so
(16.55 KB)
📄
_rational_tests.cpython-311-x86_64-linux-gnu.so
(58.29 KB)
📄
_simd.cpython-311-x86_64-linux-gnu.so
(2.47 MB)
📄
_string_helpers.py
(2.79 KB)
📄
_struct_ufunc_tests.cpython-311-x86_64-linux-gnu.so
(16.65 KB)
📄
_type_aliases.py
(7.36 KB)
📄
_type_aliases.pyi
(404 B)
📄
_ufunc_config.py
(13.62 KB)
📄
_ufunc_config.pyi
(1.04 KB)
📄
_umath_tests.cpython-311-x86_64-linux-gnu.so
(41.01 KB)
📄
arrayprint.py
(62.12 KB)
📄
arrayprint.pyi
(4.32 KB)
📄
cversions.py
(347 B)
📄
defchararray.py
(71.89 KB)
📄
defchararray.pyi
(9 KB)
📄
einsumfunc.py
(50.65 KB)
📄
einsumfunc.pyi
(4.75 KB)
📄
fromnumeric.py
(125.8 KB)
📄
fromnumeric.pyi
(22.96 KB)
📄
function_base.py
(19.37 KB)
📄
function_base.pyi
(4.61 KB)
📄
generate_numpy_api.py
(7.47 KB)
📄
getlimits.py
(25.26 KB)
📄
getlimits.pyi
(82 B)
ðŸ“
include
ðŸ“
lib
📄
memmap.py
(11.5 KB)
📄
memmap.pyi
(55 B)
📄
multiarray.py
(54.78 KB)
📄
multiarray.pyi
(24.19 KB)
📄
numeric.py
(75.21 KB)
📄
numeric.pyi
(13.9 KB)
📄
numerictypes.py
(17.67 KB)
📄
numerictypes.pyi
(3.19 KB)
📄
overrides.py
(6.93 KB)
📄
records.py
(36.65 KB)
📄
records.pyi
(5.56 KB)
📄
setup.py
(47.05 KB)
📄
setup_common.py
(16.68 KB)
📄
shape_base.py
(29.05 KB)
📄
shape_base.pyi
(2.71 KB)
ðŸ“
tests
📄
umath.py
(1.99 KB)
📄
umath_tests.py
(389 B)
Editing: einsumfunc.pyi
from collections.abc import Sequence from typing import TypeVar, Any, overload, Union, Literal from numpy import ( ndarray, dtype, bool_, number, _OrderKACF, ) from numpy._typing import ( _ArrayLikeBool_co, _ArrayLikeUInt_co, _ArrayLikeInt_co, _ArrayLikeFloat_co, _ArrayLikeComplex_co, _ArrayLikeObject_co, _DTypeLikeBool, _DTypeLikeUInt, _DTypeLikeInt, _DTypeLikeFloat, _DTypeLikeComplex, _DTypeLikeComplex_co, _DTypeLikeObject, ) _ArrayType = TypeVar( "_ArrayType", bound=ndarray[Any, dtype[Union[bool_, number[Any]]]], ) _OptimizeKind = None | bool | Literal["greedy", "optimal"] | Sequence[Any] _CastingSafe = Literal["no", "equiv", "safe", "same_kind"] _CastingUnsafe = Literal["unsafe"] __all__: list[str] # TODO: Properly handle the `casting`-based combinatorics # TODO: We need to evaluate the content `__subscripts` in order # to identify whether or an array or scalar is returned. At a cursory # glance this seems like something that can quite easily be done with # a mypy plugin. # Something like `is_scalar = bool(__subscripts.partition("->")[-1])` @overload def einsum( subscripts: str | _ArrayLikeInt_co, /, *operands: _ArrayLikeBool_co, out: None = ..., dtype: None | _DTypeLikeBool = ..., order: _OrderKACF = ..., casting: _CastingSafe = ..., optimize: _OptimizeKind = ..., ) -> Any: ... @overload def einsum( subscripts: str | _ArrayLikeInt_co, /, *operands: _ArrayLikeUInt_co, out: None = ..., dtype: None | _DTypeLikeUInt = ..., order: _OrderKACF = ..., casting: _CastingSafe = ..., optimize: _OptimizeKind = ..., ) -> Any: ... @overload def einsum( subscripts: str | _ArrayLikeInt_co, /, *operands: _ArrayLikeInt_co, out: None = ..., dtype: None | _DTypeLikeInt = ..., order: _OrderKACF = ..., casting: _CastingSafe = ..., optimize: _OptimizeKind = ..., ) -> Any: ... @overload def einsum( subscripts: str | _ArrayLikeInt_co, /, *operands: _ArrayLikeFloat_co, out: None = ..., dtype: None | _DTypeLikeFloat = ..., order: _OrderKACF = ..., casting: _CastingSafe = ..., optimize: _OptimizeKind = ..., ) -> Any: ... @overload def einsum( subscripts: str | _ArrayLikeInt_co, /, *operands: _ArrayLikeComplex_co, out: None = ..., dtype: None | _DTypeLikeComplex = ..., order: _OrderKACF = ..., casting: _CastingSafe = ..., optimize: _OptimizeKind = ..., ) -> Any: ... @overload def einsum( subscripts: str | _ArrayLikeInt_co, /, *operands: Any, casting: _CastingUnsafe, dtype: None | _DTypeLikeComplex_co = ..., out: None = ..., order: _OrderKACF = ..., optimize: _OptimizeKind = ..., ) -> Any: ... @overload def einsum( subscripts: str | _ArrayLikeInt_co, /, *operands: _ArrayLikeComplex_co, out: _ArrayType, dtype: None | _DTypeLikeComplex_co = ..., order: _OrderKACF = ..., casting: _CastingSafe = ..., optimize: _OptimizeKind = ..., ) -> _ArrayType: ... @overload def einsum( subscripts: str | _ArrayLikeInt_co, /, *operands: Any, out: _ArrayType, casting: _CastingUnsafe, dtype: None | _DTypeLikeComplex_co = ..., order: _OrderKACF = ..., optimize: _OptimizeKind = ..., ) -> _ArrayType: ... @overload def einsum( subscripts: str | _ArrayLikeInt_co, /, *operands: _ArrayLikeObject_co, out: None = ..., dtype: None | _DTypeLikeObject = ..., order: _OrderKACF = ..., casting: _CastingSafe = ..., optimize: _OptimizeKind = ..., ) -> Any: ... @overload def einsum( subscripts: str | _ArrayLikeInt_co, /, *operands: Any, casting: _CastingUnsafe, dtype: None | _DTypeLikeObject = ..., out: None = ..., order: _OrderKACF = ..., optimize: _OptimizeKind = ..., ) -> Any: ... @overload def einsum( subscripts: str | _ArrayLikeInt_co, /, *operands: _ArrayLikeObject_co, out: _ArrayType, dtype: None | _DTypeLikeObject = ..., order: _OrderKACF = ..., casting: _CastingSafe = ..., optimize: _OptimizeKind = ..., ) -> _ArrayType: ... @overload def einsum( subscripts: str | _ArrayLikeInt_co, /, *operands: Any, out: _ArrayType, casting: _CastingUnsafe, dtype: None | _DTypeLikeObject = ..., order: _OrderKACF = ..., optimize: _OptimizeKind = ..., ) -> _ArrayType: ... # NOTE: `einsum_call` is a hidden kwarg unavailable for public use. # It is therefore excluded from the signatures below. # NOTE: In practice the list consists of a `str` (first element) # and a variable number of integer tuples. def einsum_path( subscripts: str | _ArrayLikeInt_co, /, *operands: _ArrayLikeComplex_co | _DTypeLikeObject, optimize: _OptimizeKind = ..., ) -> tuple[list[Any], str]: ...
Upload File
Create Folder