commit dc8de6037c3aceb9663c7433bb09584fa8571032
author Fangrui Song <maskray@google.com> Fri Jun 21 05:40:31 2019 +0000
committer Fangrui Song <maskray@google.com> Fri Jun 21 05:40:31 2019 +0000
tree acb49acaa3d1a0428951451a091fcb4d0c79a464
parent d5e1ce3f44b0bef1eadbef9828b87a8918a82669

Simplify std::lower_bound with llvm::{bsearch,lower_bound}. NFC

llvm-svn: 364006

llvm/lib/Transforms/Scalar/JumpThreading.cpp

diff --git a/llvm/lib/Transforms/Scalar/JumpThreading.cpp b/llvm/lib/Transforms/Scalar/JumpThreading.cpp
index 7cb955d..c80cdd0 100644
--- a/llvm/lib/Transforms/Scalar/JumpThreading.cpp
+++ b/llvm/lib/Transforms/Scalar/JumpThreading.cpp
@@ -1480,8 +1480,7 @@
   for (pred_iterator PI = PB; PI != PE; ++PI) {
     BasicBlock *P = *PI;
     AvailablePredsTy::iterator I =
-      std::lower_bound(AvailablePreds.begin(), AvailablePreds.end(),
-                       std::make_pair(P, (Value*)nullptr));
+        llvm::lower_bound(AvailablePreds, std::make_pair(P, (Value *)nullptr));
 
     assert(I != AvailablePreds.end() && I->first == P &&
            "Didn't find entry for predecessor!");