| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| H A D | ranges.binary_search.pass.cpp | 91 assert(std::ranges::binary_search(range, 2)); in test_iterators() 98 assert(!std::ranges::binary_search(range, 5)); in test_iterators() 105 assert(!std::ranges::binary_search(range, 0)); in test_iterators() 112 assert(std::ranges::binary_search(range, 1)); in test_iterators() 119 assert(std::ranges::binary_search(range, 1)); in test_iterators() 126 assert(std::ranges::binary_search(range, 11)); in test_iterators() 133 assert(std::ranges::binary_search(range, 1)); in test_iterators() 150 assert(std::ranges::binary_search(a, 4, {}, &S::check)); in test() 156 assert(!std::ranges::binary_search(a, 1)); in test() 164 assert(std::ranges::binary_search(a, 6, Func{})); in test() [all …]
|
| H A D | binary_search.pass.cpp | 29 return std::binary_search(std::begin(ia), std::end(ia), 1) in test_constexpr() 30 && std::binary_search(std::begin(ia), std::end(ia), 3) in test_constexpr() 31 && !std::binary_search(std::begin(ia), std::end(ia), 9) in test_constexpr() 40 assert(std::binary_search(first, last, value) == x); in test()
|
| H A D | binary_search_comp.pass.cpp | 30 return std::binary_search(std::begin(ia), std::end(ia), 1, lt) in test_constexpr() 31 && std::binary_search(std::begin(ia), std::end(ia), 3, lt) in test_constexpr() 32 && !std::binary_search(std::begin(ia), std::end(ia), 9, lt) in test_constexpr() 41 assert(std::binary_search(first, last, value, std::greater<int>()) == x); in test()
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | binary_search.h | 28 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __com… in binary_search() function 39 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) in binary_search() function 41 return std::binary_search(__first, __last, __value, in binary_search()
|
| H A D | ranges_binary_search.h | 55 inline constexpr auto binary_search = __binary_search::__fn{};
|
| /llvm-project-15.0.7/clang-tools-extra/clang-tidy/readability/ |
| H A D | MagicNumbersCheck.cpp | 181 return std::binary_search(IgnoredIntegerValues.begin(), in isIgnoredValue() 192 return std::binary_search(IgnoredFloatingPointValues.begin(), in isIgnoredValue() 198 return std::binary_search(IgnoredDoublePointValues.begin(), in isIgnoredValue()
|
| /llvm-project-15.0.7/llvm/include/llvm/Support/ |
| H A D | UnicodeCharRanges.h | 65 return std::binary_search(Ranges.begin(), Ranges.end(), C); in contains()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 89 (void) std::binary_search(it, it, 0); in test() 90 (void) std::binary_search(it, it, 0, pred); in test()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 99 (void)std::ranges::binary_search(first, last, value, Less(&copies)); assert(copies == 0); in all_the_algorithms() 100 (void)std::ranges::binary_search(a, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 81 … (void)std::ranges::binary_search(first, last, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms() 82 (void)std::ranges::binary_search(a, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | robust_against_copying_comparators.pass.cpp | 111 (void)std::binary_search(first, last, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 56 (void)std::binary_search(first, last, value); in all_the_algorithms() 57 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
|
| H A D | robust_re_difference_type.compile.pass.cpp | 93 (void)std::binary_search(first, last, value); in all_the_algorithms() 94 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
|
| H A D | ranges_robust_against_nonbool_predicates.pass.cpp | 84 test(std::ranges::binary_search, in, x, binary_pred); in test_all()
|
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 90 test(std::ranges::binary_search, in, x); in run_tests()
|
| H A D | ranges_robust_against_omitting_invoke.pass.cpp | 90 test(std::ranges::binary_search, in, x, &Foo::binary_pred, &Bar::val); in test_all()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/diagnostics/ |
| H A D | nodiscard_extensions.pass.cpp | 46 std::binary_search(std::begin(arr), std::end(arr), 1); in test_algorithms() 47 std::binary_search(std::begin(arr), std::end(arr), 1, std::greater<int>()); in test_algorithms()
|
| H A D | nodiscard_extensions.verify.cpp | 51 std::binary_search(std::begin(arr), std::end(arr), 1); in test_algorithms() 54 std::binary_search(std::begin(arr), std::end(arr), 1, std::greater<int>()); in test_algorithms()
|
| /llvm-project-15.0.7/llvm/lib/Target/Mips/ |
| H A D | MipsCCState.cpp | 33 return std::binary_search(std::begin(LibCalls), std::end(LibCalls), CallSym, in isF128SoftLibCall()
|
| H A D | Mips16ISelLowering.cpp | 430 if (std::binary_search(std::begin(HardFloatLibCalls), in getOpndList() 473 if (std::binary_search(std::begin(HardFloatLibCalls), in getOpndList()
|
| H A D | Mips16HardFloat.cpp | 371 return std::binary_search(std::begin(IntrinsicInline), in isIntrinsicInline()
|
| /llvm-project-15.0.7/libcxx/docs/DesignDocs/ |
| H A D | DebugMode.rst | 33 many algorithms such as ``binary_search``, ``merge``, ``next_permutation``, and ``sort``, wrap the
|
| /llvm-project-15.0.7/clang/include/clang/StaticAnalyzer/Core/ |
| H A D | AnalyzerOptions.h | 283 return !std::binary_search(AnalyzerConfigCmdFlags.begin(), in isUnknownAnalyzerConfig()
|
| /llvm-project-15.0.7/libcxx/test/std/library/description/conventions/customization.point.object/ |
| H A D | niebloid.compile.pass.cpp | 66 static_assert(test(std::ranges::binary_search, a, 42));
|
| /llvm-project-15.0.7/libcxx/docs/Status/ |
| H A D | RangesAlgorithms.csv | 17 Search,binary_search,Nikolas Klauser,`D121964 <https://llvm.org/D121964>`_,✅
|