title: binary_search, find_if and <functional>
body: <p><code>std::find_if</code> takes a predicate in one of it's overloaded function. Binders make it possible to write EqualityComparators for user-defined types and use them either for dynamic comparison or static comparison.</p>
  
  <p>In contrast the binary search functions of the standard library take a comparator and a <code>const T&amp;</code> to the value that should be used for comparison. This feels inconsistent to me and could possibly more inefficient as the comparator has to be called with both arguments every time instead of having the constant argument bound to it. While it could be possible to implement <code>std::binary_search</code> in a way to use <code>std::bind</code> this would require all comparators to inherit from <code>std::binary_function</code>. Most code I've seen doesn't do that. </p>
  
  <p>Is there a possible benefit from letting comparators inherit from <code>std::binary_function</code> when using it with algorithms that take a <code>const T&amp;</code> as a value instead of letting me use the binders? Is there a reason for not providing predicate overloads in those functions?</p>