[ADT] Add llvm::binary_search to STLExtras

[dblaikie]

I guess maybe we have unit testsn for some but not all of these wrappers - might be worth checking/sampling to see what the prevailing trend is (I tend to be over-enthusiastic about testing, but I realize these simple wrappers are pretty uneventful)

include/llvm/ADT/STLExtras.h

1313

std::move(C), just in case it's cheaper to move?

[Szelethus]

D60779 beat me to it :)

include/llvm/ADT/STLExtras.h

   return std::upper_bound(adl_begin(Range), adl_end(Range), I);
 }
 
 template <typename R, typename ForwardIt, typename Compare>
 auto upper_bound(R &&Range, ForwardIt I, Compare C)
     -> decltype(adl_begin(Range)) {
   return std::upper_bound(adl_begin(Range), adl_end(Range), I, C);
 }
+
+/// Provide wrappers to std::binary_search which take ranges instead of having
+/// to pass begin/end explicitly.
+template <typename R, typename E>
+bool binary_search(R &&Range, const E &Element) {
+  return std::binary_search(adl_begin(Range), adl_end(Range), Element);
+}
+
+template <typename R, typename E, typename Compare>
+bool binary_search(R &&Range, const E &Element, Compare C) {
+  return std::binary_search(adl_begin(Range), adl_end(Range), Element, C);
+}
+
 /// Wrapper function around std::equal to detect if all elements
 /// in a container are same.
 template <typename R>
 bool is_splat(R &&Range) {
   size_t range_size = size(Range);
   return range_size != 0 && (range_size == 1 ||
          std::equal(adl_begin(Range) + 1, adl_end(Range), adl_begin(Range)));
 }