-
Notifications
You must be signed in to change notification settings - Fork 1k
TESTING: Use standard BitIndexIterator instead of specialized u32 iterator #7979
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
Conversation
|
🤖 |
|
🤖: Benchmark completed Details
|
|
The u32 is: sort f32 nulls to indices 2^12 1.00 39.7±0.10µs ? ?/sec 1.37 54.5±0.17µs ? ?/secThis PR is: sort f32 nulls to indices 2^12 1.00 40.5±0.24µs ? ?/sec 1.34 54.5±0.14µs ? ?/secAbout %3 improvement for the u32 implement. From my local testing, it sometimes %5 or more. |
|
Test complete, so closing this PR |
This PR is designed to test @jhorstmann 's question on #7962 from @zhuqi-lucas #7962 (comment):
I made a PR based on #7962 and changed the code to use the existing
BitIndexIteratorand will run the same benchmarks on this one to see how it compares