8000 ENH: create and use indexed inner loops by mattip · Pull Request #23136 · numpy/numpy · GitHub
[go: up one dir, main page]

Skip to content

ENH: create and use indexed inner loops #23136

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 20 commits into from
Feb 7, 2023
Merged
Changes from 1 commit
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
Prev Previous commit
Next Next commit
DOC: improve release snippet (from review)
  • Loading branch information
mattip committed Feb 7, 2023
commit 26978d72e795dc6cd2f31150e1f9d016b41dcf5c
4 changes: 2 additions & 2 deletions doc/release/upcoming_changes/23136.performance.rst
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
-------------------------------
Generic ``ufunc.at`` can be up to 9x faster. The conditions for this speedup:

- contiguous arguments
- operands are aligned
- no casting

If ufuncs with appropriate indexed loops on 1d arguments with the above
Expand All @@ -11,7 +11,7 @@ Appropriate indexed loops have been added to ``add``, ``subtract``,
``multiply``, ``divide`` (and ``floor_divide``)

The internal logic is similar to the logic used for regular ufuncs, which also
have a fast path for contiguous, non-casting, 1d arrays.
have fast paths.

Thanks to the `D. E. Shaw group <https://deshaw.com/>`_ for sponsoring this
work.
0