From 2d2cb77e45d4c9ca34d05f80430e0f9404252980 Mon Sep 17 00:00:00 2001 From: Fangrui Song Date: Sun, 30 Jun 2019 09:17:59 +0000 Subject: [ADT] Implement llvm::bsearch() with std::partition_point() Summary: Delete the begin-end form because the standard std::partition_point can be easily used as a replacement. The ranges-style llvm::bsearch will be renamed to llvm::partition_point in the next clean-up patch. The name "bsearch" doesn't meet people's expectation because in C: > If two or more members compare equal, which member is returned is unspecified. Reviewed By: sammccall Differential Revision: https://reviews.llvm.org/D63718 llvm-svn: 364719 --- llvm/unittests/ADT/STLExtrasTest.cpp | 12 ------------ 1 file changed, 12 deletions(-) (limited to 'llvm/unittests/ADT/STLExtrasTest.cpp') diff --git a/llvm/unittests/ADT/STLExtrasTest.cpp b/llvm/unittests/ADT/STLExtrasTest.cpp index 456ad282447..ebb8c9f6f5d 100644 --- a/llvm/unittests/ADT/STLExtrasTest.cpp +++ b/llvm/unittests/ADT/STLExtrasTest.cpp @@ -470,19 +470,7 @@ TEST(STLExtrasTest, to_address) { } TEST(STLExtrasTest, bsearch) { - // Integer version. - EXPECT_EQ(7u, bsearch(5, 10, [](unsigned X) { return X >= 7; })); - EXPECT_EQ(5u, bsearch(5, 10, [](unsigned X) { return X >= 1; })); - EXPECT_EQ(10u, bsearch(5, 10, [](unsigned X) { return X >= 50; })); - - // Iterator version. std::vector V = {1, 3, 5, 7, 9}; - EXPECT_EQ(V.begin() + 3, - bsearch(V.begin(), V.end(), [](unsigned X) { return X >= 7; })); - EXPECT_EQ(V.begin(), - bsearch(V.begin(), V.end(), [](unsigned X) { return X >= 1; })); - EXPECT_EQ(V.end(), - bsearch(V.begin(), V.end(), [](unsigned X) { return X >= 50; })); // Range version. EXPECT_EQ(V.begin() + 3, bsearch(V, [](unsigned X) { return X >= 7; })); -- cgit v1.2.3