Skip to content

remove einsum_call kwargs from dpnp.einsum_path signature #2421

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Apr 14, 2025
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions CHANGELOG.md
Original file line number Diff line number Diff line change
Expand Up @@ -26,6 +26,7 @@ This release achieves 100% compliance with Python Array API specification (revis
* Updated `dpnp.fix` to return output with the same data-type of input [#2392](https://github.com/IntelPython/dpnp/pull/2392)
* Updated `dpnp.einsum` to add support for `order=None` [#2411](https://github.com/IntelPython/dpnp/pull/2411)
* Updated Python Array API specification version supported to `2024.12` [#2416](https://github.com/IntelPython/dpnp/pull/2416)
* Removed `einsum_call` keyword from `dpnp.einsum_path` signature [#2421](https://github.com/IntelPython/dpnp/pull/2421)

### Fixed

Expand Down
6 changes: 3 additions & 3 deletions dpnp/dpnp_iface_linearalgebra.py
Original file line number Diff line number Diff line change
Expand Up @@ -457,7 +457,7 @@ def einsum(
)


def einsum_path(*operands, optimize="greedy", einsum_call=False):
def einsum_path(*operands, optimize="greedy"):
"""
einsum_path(subscripts, *operands, optimize="greedy")

Expand All @@ -483,7 +483,7 @@ def einsum_path(*operands, optimize="greedy", einsum_call=False):
* if a list is given that starts with ``einsum_path``, uses this as the
contraction path
* if ``False`` or ``None`` no optimization is taken
* if ``True`` defaults to the "greedy" algorithm
* if ``True`` defaults to the ``"greedy"`` algorithm
* ``"optimal"`` is an algorithm that combinatorially explores all
possible ways of contracting the listed tensors and chooses the
least costly path. Scales exponentially with the number of terms
Expand Down Expand Up @@ -586,7 +586,7 @@ def einsum_path(*operands, optimize="greedy", einsum_call=False):
return numpy.einsum_path(
*operands,
optimize=optimize,
einsum_call=einsum_call,
einsum_call=False,
)


Expand Down
Loading