PERF: Micro optimize find_common_type #21742
Closed
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The
find_common_type
is a (small) performance bottleneck in one of the scipy algoritms. This PR optimizes the method:A benchmark (extracted from what is called from scipy):
Results of
%timeit find_common_type(array_types, scalar_types)
.8.37 µs ± 500 ns per loop (mean ± std. dev. of 7 runs, 100000 loops each)
1.09 µs ± 57.6 ns per loop (mean ± std. dev. of 7 runs, 1000000 loops each)
1.81 µs ± 313 ns per loop (mean ± std. dev. of 7 runs, 1000000 loops each)
The optmizations are:
__test_types
todtype
dtypelist
unique. This could make other calls a bit slower, but thelist(set(dtypelist))
is fast and it makes cases with duplicate dtypes fasterfind_common_type
for empty arguments.