/external/llvm-project/libcxx/test/std/containers/associative/set/ |
D | upper_bound.pass.cpp | 42 R r = m.upper_bound(5); in main() 44 r = m.upper_bound(7); in main() 46 r = m.upper_bound(9); in main() 48 r = m.upper_bound(11); in main() 50 r = m.upper_bound(13); in main() 52 r = m.upper_bound(15); in main() 54 r = m.upper_bound(17); in main() 56 r = m.upper_bound(19); in main() 58 r = m.upper_bound(4); in main() 60 r = m.upper_bound(6); in main() [all …]
|
/external/llvm-project/libcxx/test/std/containers/associative/map/map.ops/ |
D | upper_bound.pass.cpp | 42 R r = m.upper_bound(5); in main() 44 r = m.upper_bound(7); in main() 46 r = m.upper_bound(9); in main() 48 r = m.upper_bound(11); in main() 50 r = m.upper_bound(13); in main() 52 r = m.upper_bound(15); in main() 54 r = m.upper_bound(17); in main() 56 r = m.upper_bound(19); in main() 58 r = m.upper_bound(4); in main() 60 r = m.upper_bound(6); in main() [all …]
|
/external/libcxx/test/std/containers/associative/set/ |
D | upper_bound.pass.cpp | 43 R r = m.upper_bound(5); in main() 45 r = m.upper_bound(7); in main() 47 r = m.upper_bound(9); in main() 49 r = m.upper_bound(11); in main() 51 r = m.upper_bound(13); in main() 53 r = m.upper_bound(15); in main() 55 r = m.upper_bound(17); in main() 57 r = m.upper_bound(19); in main() 59 r = m.upper_bound(4); in main() 61 r = m.upper_bound(6); in main() [all …]
|
/external/libcxx/test/std/containers/associative/map/map.ops/ |
D | upper_bound.pass.cpp | 43 R r = m.upper_bound(5); in main() 45 r = m.upper_bound(7); in main() 47 r = m.upper_bound(9); in main() 49 r = m.upper_bound(11); in main() 51 r = m.upper_bound(13); in main() 53 r = m.upper_bound(15); in main() 55 r = m.upper_bound(17); in main() 57 r = m.upper_bound(19); in main() 59 r = m.upper_bound(4); in main() 61 r = m.upper_bound(6); in main() [all …]
|
/external/libcxx/test/std/containers/associative/multimap/multimap.ops/ |
D | upper_bound.pass.cpp | 45 R r = m.upper_bound(4); in main() 47 r = m.upper_bound(5); in main() 49 r = m.upper_bound(6); in main() 51 r = m.upper_bound(7); in main() 53 r = m.upper_bound(8); in main() 55 r = m.upper_bound(9); in main() 57 r = m.upper_bound(10); in main() 75 R r = m.upper_bound(4); in main() 77 r = m.upper_bound(5); in main() 79 r = m.upper_bound(6); in main() [all …]
|
/external/llvm-project/libcxx/test/std/containers/associative/multimap/multimap.ops/ |
D | upper_bound.pass.cpp | 44 R r = m.upper_bound(4); in main() 46 r = m.upper_bound(5); in main() 48 r = m.upper_bound(6); in main() 50 r = m.upper_bound(7); in main() 52 r = m.upper_bound(8); in main() 54 r = m.upper_bound(9); in main() 56 r = m.upper_bound(10); in main() 74 R r = m.upper_bound(4); in main() 76 r = m.upper_bound(5); in main() 78 r = m.upper_bound(6); in main() [all …]
|
/external/libcxx/test/std/containers/associative/multiset/ |
D | upper_bound.pass.cpp | 44 R r = m.upper_bound(4); in main() 46 r = m.upper_bound(5); in main() 48 r = m.upper_bound(6); in main() 50 r = m.upper_bound(7); in main() 52 r = m.upper_bound(8); in main() 54 r = m.upper_bound(9); in main() 56 r = m.upper_bound(11); in main() 74 R r = m.upper_bound(4); in main() 76 r = m.upper_bound(5); in main() 78 r = m.upper_bound(6); in main() [all …]
|
/external/llvm-project/libcxx/test/std/containers/associative/multiset/ |
D | upper_bound.pass.cpp | 43 R r = m.upper_bound(4); in main() 45 r = m.upper_bound(5); in main() 47 r = m.upper_bound(6); in main() 49 r = m.upper_bound(7); in main() 51 r = m.upper_bound(8); in main() 53 r = m.upper_bound(9); in main() 55 r = m.upper_bound(11); in main() 73 R r = m.upper_bound(4); in main() 75 r = m.upper_bound(5); in main() 77 r = m.upper_bound(6); in main() [all …]
|
/external/pigweed/pw_containers/ |
D | flat_map_test.cc | 61 EXPECT_EQ(kEmpty.upper_bound(0), kEmpty.end()); in TEST() 104 EXPECT_EQ(-3, kOddMap.upper_bound(std::numeric_limits<int>::min())->first); in TEST() 105 EXPECT_EQ(-3, kOddMap.upper_bound(-123)->first); in TEST() 106 EXPECT_EQ(-3, kOddMap.upper_bound(-4)->first); in TEST() 110 EXPECT_EQ(0, kOddMap.upper_bound(-3)->first); in TEST() 111 EXPECT_EQ(0, kOddMap.upper_bound(-2)->first); in TEST() 112 EXPECT_EQ(0, kOddMap.upper_bound(-1)->first); in TEST() 116 EXPECT_EQ(1, kOddMap.upper_bound(0)->first); in TEST() 117 EXPECT_EQ('c', kOddMap.upper_bound(0)->second); in TEST() 118 EXPECT_EQ(50, kOddMap.upper_bound(1)->first); in TEST() [all …]
|
/external/openscreen/discovery/mdns/ |
D | mdns_random_unittest.cc | 19 constexpr std::chrono::milliseconds upper_bound{120}; in TEST() local 24 EXPECT_LE(delay, upper_bound); in TEST() 30 constexpr double upper_bound = 0.02; in TEST() local 35 EXPECT_LE(variation, upper_bound); in TEST() 41 constexpr std::chrono::milliseconds upper_bound{120}; in TEST() local 46 EXPECT_LE(delay, upper_bound); in TEST() 52 constexpr std::chrono::milliseconds upper_bound{500}; in TEST() local 57 EXPECT_LE(delay, upper_bound); in TEST()
|
/external/tensorflow/tensorflow/python/data/experimental/kernel_tests/serialization/ |
D | take_while_dataset_serialization_test.py | 34 def _build_dataset(self, num_elements, upper_bound): argument 36 take_while_ops.take_while(lambda x: x < upper_bound)) 41 combinations.combine(num_elements=[10, 23], upper_bound=[10, 23]))) 42 def testCore(self, num_elements, upper_bound): argument 43 self.run_core_tests(lambda: self._build_dataset(num_elements, upper_bound), 44 min(num_elements, upper_bound))
|
/external/tensorflow/tensorflow/python/data/experimental/kernel_tests/ |
D | take_while_test.py | 59 num_elements=[10], upper_bound=[2], out_of_bounds=[False]) + 61 num_elements=[16], upper_bound=[7], out_of_bounds=[False]) + 63 num_elements=[100], upper_bound=[99], out_of_bounds=[False]) + 65 num_elements=[100], upper_bound=[101], out_of_bounds=[True]) + 67 num_elements=[0], upper_bound=[1], out_of_bounds=[True]))) 68 def testTakeWhileDatasetRange(self, num_elements, upper_bound, out_of_bounds): argument 70 take_while_ops.take_while(lambda x: x < upper_bound)) 74 self.assertDatasetProduces(dataset, np.arange(upper_bound)) 77 self.assertDatasetProduces(dataset, np.arange(upper_bound))
|
/external/webrtc/modules/video_coding/ |
D | jitter_estimator_tests.cc | 94 : upper_bound(0.0), in TEST_F() 98 double upper_bound; in TEST_F() member 106 test_cases[0].upper_bound = 100.0; in TEST_F() 110 test_cases[1].upper_bound = 3.5; in TEST_F() 114 test_cases[2].upper_bound = 1000.0; in TEST_F() 118 test_cases[3].upper_bound = 1000.0; in TEST_F() 128 << "/Enabled-" << context.upper_bound << "/"; in TEST_F()
|
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/time/ |
D | clock_test.cc | 53 absl::Duration upper_bound, absl::Duration timeout, in SleepForBounded() argument 77 if (lower_bound <= actual && actual <= upper_bound) { in SleepForBounded() 90 const absl::Duration upper_bound = d + late; in AssertSleepForBounded() local 92 if (SleepForBounded(d, lower_bound, upper_bound, timeout, alarm_policy, in AssertSleepForBounded() 98 << ":" << upper_bound << "] in " << attempts << " attempt" in AssertSleepForBounded()
|
/external/abseil-cpp/absl/time/ |
D | clock_test.cc | 53 absl::Duration upper_bound, absl::Duration timeout, in SleepForBounded() argument 77 if (lower_bound <= actual && actual <= upper_bound) { in SleepForBounded() 90 const absl::Duration upper_bound = d + late; in AssertSleepForBounded() local 92 if (SleepForBounded(d, lower_bound, upper_bound, timeout, alarm_policy, in AssertSleepForBounded() 98 << ":" << upper_bound << "] in " << attempts << " attempt" in AssertSleepForBounded()
|
/external/openscreen/third_party/abseil/src/absl/time/ |
D | clock_test.cc | 53 absl::Duration upper_bound, absl::Duration timeout, in SleepForBounded() argument 77 if (lower_bound <= actual && actual <= upper_bound) { in SleepForBounded() 90 const absl::Duration upper_bound = d + late; in AssertSleepForBounded() local 92 if (SleepForBounded(d, lower_bound, upper_bound, timeout, alarm_policy, in AssertSleepForBounded() 98 << ":" << upper_bound << "] in " << attempts << " attempt" in AssertSleepForBounded()
|
/external/libtextclassifier/abseil-cpp/absl/time/ |
D | clock_test.cc | 53 absl::Duration upper_bound, absl::Duration timeout, in SleepForBounded() argument 77 if (lower_bound <= actual && actual <= upper_bound) { in SleepForBounded() 90 const absl::Duration upper_bound = d + late; in AssertSleepForBounded() local 92 if (SleepForBounded(d, lower_bound, upper_bound, timeout, alarm_policy, in AssertSleepForBounded() 98 << ":" << upper_bound << "] in " << attempts << " attempt" in AssertSleepForBounded()
|
/external/webrtc/third_party/abseil-cpp/absl/time/ |
D | clock_test.cc | 53 absl::Duration upper_bound, absl::Duration timeout, in SleepForBounded() argument 77 if (lower_bound <= actual && actual <= upper_bound) { in SleepForBounded() 90 const absl::Duration upper_bound = d + late; in AssertSleepForBounded() local 92 if (SleepForBounded(d, lower_bound, upper_bound, timeout, alarm_policy, in AssertSleepForBounded() 98 << ":" << upper_bound << "] in " << attempts << " attempt" in AssertSleepForBounded()
|
/external/angle/third_party/abseil-cpp/absl/time/ |
D | clock_test.cc | 53 absl::Duration upper_bound, absl::Duration timeout, in SleepForBounded() argument 77 if (lower_bound <= actual && actual <= upper_bound) { in SleepForBounded() 90 const absl::Duration upper_bound = d + late; in AssertSleepForBounded() local 92 if (SleepForBounded(d, lower_bound, upper_bound, timeout, alarm_policy, in AssertSleepForBounded() 98 << ":" << upper_bound << "] in " << attempts << " attempt" in AssertSleepForBounded()
|
/external/ltp/testcases/kernel/sched/eas/ |
D | sched_cfs_prio.c | 60 long long upper_bound, upper_bound_pct, upper_bound_us; in check_bounds() local 71 upper_bound = upper_bound_us; in check_bounds() 73 upper_bound = upper_bound_pct; in check_bounds() 80 if (runtime_us > upper_bound) { in check_bounds() 82 upper_bound/1000); in check_bounds()
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
D | upper_bound.pass.cpp | 28 return (std::upper_bound(std::begin(ia), std::end(ia), 2) == ia+1) in test_constexpr() 29 && (std::upper_bound(std::begin(ia), std::end(ia), 3) == ia+2) in test_constexpr() 30 && (std::upper_bound(std::begin(ia), std::end(ia), 9) == std::end(ia)) in test_constexpr() 39 Iter i = std::upper_bound(first, last, value); in test()
|
D | upper_bound_comp.pass.cpp | 31 return (std::upper_bound(std::begin(ia), std::end(ia), 2, lt) == ia+1) in test_constexpr() 32 && (std::upper_bound(std::begin(ia), std::end(ia), 3, lt) == ia+2) in test_constexpr() 33 && (std::upper_bound(std::begin(ia), std::end(ia), 9, lt) == std::end(ia)) in test_constexpr() 42 Iter i = std::upper_bound(first, last, value, std::greater<int>()); in test()
|
/external/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
D | upper_bound.pass.cpp | 27 return (std::upper_bound(std::begin(ia), std::end(ia), 2) == ia+1) in test_constexpr() 28 && (std::upper_bound(std::begin(ia), std::end(ia), 3) == ia+2) in test_constexpr() 29 && (std::upper_bound(std::begin(ia), std::end(ia), 9) == std::end(ia)) in test_constexpr() 38 Iter i = std::upper_bound(first, last, value); in test()
|
D | upper_bound_comp.pass.cpp | 30 return (std::upper_bound(std::begin(ia), std::end(ia), 2, lt) == ia+1) in test_constexpr() 31 && (std::upper_bound(std::begin(ia), std::end(ia), 3, lt) == ia+2) in test_constexpr() 32 && (std::upper_bound(std::begin(ia), std::end(ia), 9, lt) == std::end(ia)) in test_constexpr() 41 Iter i = std::upper_bound(first, last, value, std::greater<int>()); in test()
|
/external/libevent/ |
D | arc4random.c | 513 arc4random_uniform(unsigned int upper_bound) in arc4random_uniform() argument 517 if (upper_bound < 2) in arc4random_uniform() 521 min = 0x100000000UL % upper_bound; in arc4random_uniform() 524 if (upper_bound > 0x80000000) in arc4random_uniform() 525 min = 1 + ~upper_bound; /* 2**32 - upper_bound */ in arc4random_uniform() 528 min = ((0xffffffff - (upper_bound * 2)) + 1) % upper_bound; in arc4random_uniform() 544 return r % upper_bound; in arc4random_uniform()
|