| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| D | ranges.binary_search.pass.cpp | 33 concept HasLowerBoundIt = requires(It it, Sent sent) { std::ranges::binary_search(it, sent, 1); };
42 concept HasLowerBoundR = requires(Range range) { std::ranges::binary_search(range, 1); };
50 concept HasLowerBoundPred = requires(int* it, Pred pred) {std::ranges::binary_search(it, it, 1, pre…
61 std::same_as<bool> auto ret = std::ranges::binary_search(It(a), Sent(It(a + 6)), 3); in test_iterators()
67 std::same_as<bool> auto ret = std::ranges::binary_search(range, 3); in test_iterators()
74 assert(std::ranges::binary_search(It(a), Sent(It(a + 6)), 2, std::ranges::greater{})); in test_iterators()
76 assert(std::ranges::binary_search(range, 2, std::ranges::greater{})); in test_iterators()
81 assert(std::ranges::binary_search(It(a), Sent(It(a + 6)), 0, {}, [](int i) { return i - 3; })); in test_iterators()
83 assert(std::ranges::binary_search(range, 0, {}, [](int i) { return i - 3; })); in test_iterators()
88 assert(std::ranges::binary_search(It(a), Sent(It(a + 5)), 2)); in test_iterators()
[all …]
|
| 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()
|
| 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()
|
| /external/toolchain-utils/binary_search_tool/ |
| D | binary_search_state.py | 107 self.binary_search = None
289 prune_index = self.binary_search.current
375 terminated = self.binary_search.SetStatus(status)
558 self.binary_search = binary_search_perforce.BinarySearcherForPass(
561 self.binary_search.total, _ = self.BuildWithPassLimit(-1)
563 "Total %s number: %d" % (self.mode, self.binary_search.total)
578 self.binary_search = binary_search_perforce.BinarySearcherForPass(
581 self.binary_search.total = self.BuildWithTransformLimit(
585 "Total %s number: %d" % (self.mode, self.binary_search.total)
632 current = self.binary_search.GetNext()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| D | binary_search.pass.cpp | 30 return std::binary_search(std::begin(ia), std::end(ia), 1) in test_constexpr()
31 && std::binary_search(std::begin(ia), std::end(ia), 3) in test_constexpr()
32 && !std::binary_search(std::begin(ia), std::end(ia), 9) in test_constexpr()
41 assert(std::binary_search(first, last, value) == x); in test()
|
| D | binary_search_comp.pass.cpp | 31 return std::binary_search(std::begin(ia), std::end(ia), 1, lt) in test_constexpr()
32 && std::binary_search(std::begin(ia), std::end(ia), 3, lt) in test_constexpr()
33 && !std::binary_search(std::begin(ia), std::end(ia), 9, lt) in test_constexpr()
42 assert(std::binary_search(first, last, value, std::greater<int>()) == x); in test()
|
| /external/cronet/buildtools/third_party/libc++/trunk/include/__algorithm/ |
| D | binary_search.h | 28 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __com… in binary_search() function
38 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) in binary_search() function
40 return std::binary_search(__first, __last, __value, in binary_search()
|
| D | ranges_binary_search.h | 55 inline constexpr auto binary_search = __binary_search::__fn{};
|
| /external/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 58 static double binary_search(const SkDCubic& cubic, double step, const SkDPoint& pt, double t, in binary_search() function
225 double newT = binary_search(cubic, step, pt, t, &iters); in DEF_TEST()
273 double newT = binary_search(cubic, 0.1, pt, t, &iters); in testOneFailure()
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/libcxx/diagnostics/ |
| D | ranges.nodiscard_extensions.verify.cpp | 25 …std::ranges::binary_search(range, 1); // expected-warning {{ignoring return value of function decl… in test()
26 …std::ranges::binary_search(iter, iter, 1); // expected-warning {{ignoring return value of function… in test()
|
| D | ranges.nodiscard_extensions.compile.pass.cpp | 28 std::ranges::binary_search(range, 1); in test()
29 std::ranges::binary_search(iter, iter, 1); in test()
|
| D | nodiscard_extensions.verify.cpp | 50 std::binary_search(std::begin(arr), std::end(arr), 1); in test_algorithms()
53 std::binary_search(std::begin(arr), std::end(arr), 1, std::greater<int>()); in test_algorithms()
|
| /external/cronet/components/metrics/ |
| D | expired_histograms_checker.cc | 32 return !std::binary_search(expired_histogram_hashes_, in ShouldRecord()
|
| /external/cronet/base/ranges/ |
| D | algorithm_unittest.cc | 1068 EXPECT_FALSE(ranges::binary_search(array, array + 6, -1)); in TEST()
1069 EXPECT_TRUE(ranges::binary_search(array, array + 6, 0)); in TEST()
1070 EXPECT_TRUE(ranges::binary_search(array, array + 6, 1)); in TEST()
1071 EXPECT_TRUE(ranges::binary_search(array, array + 6, 2)); in TEST()
1072 EXPECT_FALSE(ranges::binary_search(array, array + 6, 3)); in TEST()
1076 EXPECT_FALSE(ranges::binary_search(ints, -1, {}, &Int::value)); in TEST()
1077 EXPECT_TRUE(ranges::binary_search(ints, 0, {}, &Int::value)); in TEST()
1078 EXPECT_TRUE(ranges::binary_search(ints, 1, {}, &Int::value)); in TEST()
1079 EXPECT_TRUE(ranges::binary_search(ints, 2, {}, &Int::value)); in TEST()
1080 EXPECT_FALSE(ranges::binary_search(ints, 3, {}, &Int::value)); in TEST()
[all …]
|
| /external/skia/src/base/ |
| D | SkCubics.cpp | 176 static double binary_search(double A, double B, double C, double D, double start, double stop) { in binary_search() function
231 double root = binary_search(A, B, C, D, regions[startIndex], regions[startIndex + 1]); in BinarySearchRootsValidT()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
| D | UnicodeCharRanges.h | 65 return std::binary_search(Ranges.begin(), Ranges.end(), C); in contains()
|
| /external/llvm/include/llvm/Support/ |
| D | UnicodeCharRanges.h | 69 return std::binary_search(Ranges.begin(), Ranges.end(), C); in contains()
|
| /external/libtextclassifier/native/utils/container/ |
| D | bit-vector.cc | 34 return std::binary_search( in GetFromSparseData()
|
| /external/toolchain-utils/binary_search_tool/sysroot_wrapper/ |
| D | README.md | 28 2>&1 | tee /tmp/binary_search.log
|
| /external/capstone/arch/M680X/ |
| D | hd6309.inc | 3 // opcodes. Otherwise the binary_search will fail.
24 // opcodes. Otherwise the binary_search will fail.
161 // opcodes. Otherwise the binary_search will fail.
|
| /external/cronet/net/cert/ |
| D | crl_set.cc | 300 if (std::binary_search(blocked_spkis_.begin(), blocked_spkis_.end(), in CheckSPKI()
350 return std::binary_search(known_interception_spkis_.begin(), in IsKnownInterceptionKey()
|
| /external/cronet/net/base/ |
| D | hash_value.cc | 147 return std::binary_search(array.begin(), array.end(), hash, in IsSHA256HashInSortedArray()
|
| /external/llvm/lib/Target/Mips/ |
| D | MipsCCState.cpp | 35 return std::binary_search(std::begin(LibCalls), std::end(LibCalls), in isF128SoftLibCall()
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/libcxx/algorithms/ |
| 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()
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/ |
| D | robust_against_adl.compile.pass.cpp | 61 (void)std::binary_search(first, last, value); in all_the_algorithms()
62 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
|