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
Add specialized binary search skipping boundary check #4026
base: master
Are you sure you want to change the base?
Add specialized binary search skipping boundary check #4026
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Could we not use std::upper_bound()
for this instead?
std::upper_bound() seems to be slower on my machine benchmarking a couple of runs on norne... |
benchmark please |
The measurements are probably within what can be explained by noise, so hopefully then benchmark can provide some consistent results |
Benchmark result overview:
View result details @ https://www.ytelses.com/opm/?page=result&id=2448 |
That's good to know, but alas not particularly useful from a CPU performance point of view. @blattms: Is anything up with the benchmark test rig at the moment? |
That was a bit underwhelming, but how are these times measured since there is absolutely no deviation on any case? |
notice that those are not even times. benchmarks either didn't execute properly, or it only reported fluid statistics back. |
@akva2 is correct–the |
Can we get some clarifications as of what happened to the performance benchmark @blattms |
benchmark please |
Benchmark result overview:
View result details @ https://www.ytelses.com/opm/?page=result&id=2470 |
Small adjustment that skips checking if the indices are within the range because this is already checked in the outer function.
This function is very often called, so might give a small improvement.