News for hackers. Stuff that matters.
Re:Beautiful branchless binary search by secondcoming on Friday April 28, 2023 @01:12PM (#35744198)
Most topics I've read/viewed on branchless stuff seems to boil down to doing arithmetic with bools. So your code above can be thought of as:

   bool b = compare(begin[step], value);
   begin += (step * b);
Re:Beautiful branchless binary search by Paul-Craft on Friday April 28, 2023 @01:32PM (#35744463)
Yeah, I got that. That was the part u/2102922286's comment made click for me. I guess I just don't do enough low level stuff for that to be something that automatically occurs to me.