News for hackers. Stuff that matters.
Re:How We Beat C++ STL Binary Search by rrrlasse on Tuesday August 11, 2015 @07:06PM (#10045000)
The conditional move is the statement `low = v >= value ? low : other_low;` which either assigns `other_low` to `low` or does nothing.

And other_low is a variable, and not an arbitrary element of the list (which is a big difference with respect to cache), and it can also be seen from the assembly that it's stored in register. So there there is no "both cache lines" to fetch anything from.

Re:How We Beat C++ STL Binary Search by cautious_int on Tuesday August 11, 2015 @07:41PM (#10045114)
The conditional move still depends on both values taken from the array, via other variables.