Skip to content

Conversation

math-hiyoko
Copy link
Contributor

@math-hiyoko math-hiyoko commented Aug 25, 2025

Following the discussion in #29537 (comment), this PR expands our np.unique benchmarks beyond small float arrays to better reflect real-world usage.
In particular, it adds complex and string inputs, tests a wider range of sizes, and varies the proportion of distinct values.

@math-hiyoko math-hiyoko marked this pull request as draft August 25, 2025 04:37
@math-hiyoko math-hiyoko marked this pull request as ready for review August 25, 2025 13:20
@ngoldbaum
Copy link
Member

I tried running the benchmarks locally using this PR but couldn't actually finish running them. Can you make sure that these can complete in a reasonable amount of time? For reference, the current Unique benchmarks on main complete in about 10 seconds on my development machine. I was waiting at least two minutes before I killed the benchmark run on this PR.

You can run a "quick" version of the benchmarks you modified locally with this command:

spin bench --version --quick -t Unique

@math-hiyoko
Copy link
Contributor Author

math-hiyoko commented Aug 26, 2025

I trimmed the parameter grid (fewer nans ratios) in order to reduce the number of repetitions per case. With these changes the Unique benchmarks complete in about 6-7 minutes on my machine.

$ time spin bench --quick -t Unique
...
real    6m39.247s
user    6m16.166s
sys     0m10.816s

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants