| /third_party/boost/boost/range/algorithm/ |
| D | upper_bound.hpp | 35 upper_bound( ForwardRange& rng, const Value& val ) in upper_bound() function
38 return std::upper_bound(boost::begin(rng), boost::end(rng), val); in upper_bound()
44 upper_bound( const ForwardRange& rng, const Value& val ) in upper_bound() function
47 return std::upper_bound(boost::begin(rng), boost::end(rng), val); in upper_bound()
56 upper_bound( ForwardRange& rng, const Value& val, SortPredicate pred ) in upper_bound() function
59 return std::upper_bound(boost::begin(rng), boost::end(rng), val, pred); in upper_bound()
65 upper_bound( const ForwardRange& rng, const Value& val, SortPredicate pred ) in upper_bound() function
68 return std::upper_bound(boost::begin(rng), boost::end(rng), val, pred); in upper_bound()
77 upper_bound( ForwardRange& rng, const Value& val ) in upper_bound() function
81 pack(std::upper_bound(boost::begin(rng), boost::end(rng), val), in upper_bound()
[all …]
|
| /third_party/boost/boost/math/distributions/detail/ |
| D | generic_mode.hpp | 41 value_type upper_bound = guess; in generic_find_mode() local
58 upper_bound += step; in generic_find_mode()
60 upper_bound *= 2; in generic_find_mode()
61 v = pdf(dist, upper_bound); in generic_find_mode()
64 lower_bound = upper_bound; in generic_find_mode()
80 upper_bound, in generic_find_mode()
106 value_type upper_bound = guess; in generic_find_mode_01() local
112 upper_bound = 1 - (1 - upper_bound) / 2; in generic_find_mode_01()
113 if(upper_bound == 1) in generic_find_mode_01()
115 v = pdf(dist, upper_bound); in generic_find_mode_01()
[all …]
|
| /third_party/boost/libs/range/test/algorithm_test/ |
| D | upper_bound.cpp | 33 iter_t result = boost::upper_bound(cont, 5); in test_iter()
34 BOOST_CHECK( result == boost::upper_bound(boost::make_iterator_range(cont), 5) ); in test_iter()
46 result_t result = boost::upper_bound<result_type>(cont, 5); in operator ()()
47 … BOOST_CHECK( result == boost::upper_bound<result_type>(boost::make_iterator_range(cont), 5) ); in operator ()()
56 return std::upper_bound(cont.begin(), cont.end(), 5); in reference()
68 iter_t result = boost::upper_bound(cont, 5, BinaryPredicate()); in test_iter()
69 …BOOST_CHECK( result == boost::upper_bound(boost::make_iterator_range(cont), 5, BinaryPredicate()) … in test_iter()
82 result_t result = boost::upper_bound<result_type>(cont, 5, policy.pred()); in operator ()()
84 BOOST_CHECK( result == boost::upper_bound<result_type>( in operator ()()
95 return std::upper_bound( in reference()
|
| /third_party/openh264/codec/decoder/core/inc/ |
| D | dec_golomb.h | 248 #define WELS_CHECK_SE_BOTH_ERROR(val, lower_bound, upper_bound, syntax_name, ret_code) do {\ argument
249 if ((val < lower_bound) || (val > upper_bound)) {\
262 #define WELS_CHECK_SE_UPPER_ERROR(val, upper_bound, syntax_name, ret_code) do {\ argument
263 if (val > upper_bound) {\
269 #define WELS_CHECK_SE_BOTH_ERROR_NOLOG(val, lower_bound, upper_bound, syntax_name, ret_code) do {\ argument
270 if ((val < lower_bound) || (val > upper_bound)) {\
281 #define WELS_CHECK_SE_UPPER_ERROR_NOLOG(val, upper_bound, syntax_name, ret_code) do {\ argument
282 if (val > upper_bound) {\
288 #define WELS_CHECK_SE_BOTH_WARNING(val, lower_bound, upper_bound, syntax_name) do {\ argument
289 if ((val < lower_bound) || (val > upper_bound)) {\
[all …]
|
| /third_party/boost/libs/range/doc/reference/algorithm/ |
| D | upper_bound.qbk | 6 [section:upper_bound upper_bound]
16 upper_bound(ForwardRange& rng, Value val);
24 upper_bound(ForwardRange& rng, Value val);
32 upper_bound(ForwardRange& rng, Value val, SortPredicate pred);
41 upper_bound(ForwardRange& rng, Value val, SortPredicate pred);
46 The versions of `upper_bound` that return an iterator, returns the first iterator in the range `rng…
52 The versions of `upper_bound` that return a `range_return`, defines `found` in the same manner as t…
56 Defined in the header file `boost/range/algorithm/upper_bound.hpp`
|
| /third_party/boost/libs/compute/test/ |
| D | test_binary_search.cpp | 75 …BOOST_CHECK(boost::compute::upper_bound(vector.begin(), vector.end(), int(0), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
78 …BOOST_CHECK(boost::compute::upper_bound(vector.begin(), vector.end(), int(1), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
81 …BOOST_CHECK(boost::compute::upper_bound(vector.begin(), vector.end(), int(2), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
84 …BOOST_CHECK(boost::compute::upper_bound(vector.begin(), vector.end(), int(4), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
87 …BOOST_CHECK(boost::compute::upper_bound(vector.begin(), vector.end(), int(5), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
90 …BOOST_CHECK(boost::compute::upper_bound(vector.begin(), vector.end(), int(6), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
93 …BOOST_CHECK(boost::compute::upper_bound(vector.begin(), vector.end(), int(7), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
96 …BOOST_CHECK(boost::compute::upper_bound(vector.begin(), vector.end(), int(9), queue) == vector.end… in BOOST_AUTO_TEST_CASE()
99 …BOOST_CHECK(boost::compute::upper_bound(vector.begin(), vector.end(), int(10), queue) == vector.en… in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/boost/spirit/home/support/iterators/ |
| D | line_pos_iterator.hpp | 103 Iterator upper_bound);
144 inline Iterator get_line_end(Iterator current, Iterator upper_bound) in get_line_end() argument
146 for (Iterator i = current; i != upper_bound; ++i) { in get_line_end()
151 return upper_bound; in get_line_end()
159 Iterator upper_bound) in get_current_line() argument
162 Iterator last = get_line_end(current, upper_bound); in get_current_line()
|
| /third_party/boost/libs/mpl/doc/src/refmanual/ |
| D | upper_bound.rst | 1 .. Algorithms/Querying Algorithms//upper_bound |70
3 upper_bound title
16 struct upper_bound
35 #include <boost/mpl/upper_bound.hpp>
62 typedef upper_bound< s,x,pred >::type i;
91 typedef upper_bound< numbers, int_<3> >::type iter;
|
| /third_party/boost/libs/compute/include/boost/compute/container/ |
| D | flat_set.hpp | 170 iterator location = upper_bound(value, queue); in insert()
306 iterator upper_bound(const key_type &value, command_queue &queue) in upper_bound() function in boost::compute::flat_set
308 return ::boost::compute::upper_bound(begin(), end(), value, queue); in upper_bound()
311 iterator upper_bound(const key_type &value) in upper_bound() function in boost::compute::flat_set
314 iterator iter = upper_bound(value, queue); in upper_bound()
319 const_iterator upper_bound(const key_type &value, command_queue &queue) const in upper_bound() function in boost::compute::flat_set
321 return ::boost::compute::upper_bound(begin(), end(), value, queue); in upper_bound()
324 const_iterator upper_bound(const key_type &value) const in upper_bound() function in boost::compute::flat_set
327 const_iterator iter = upper_bound(value, queue); in upper_bound()
|
| D | flat_map.hpp | 181 iterator location = upper_bound(value.first, queue); in insert()
337 iterator upper_bound(const key_type &value, command_queue &queue) in upper_bound() function in boost::compute::flat_map
341 return ::boost::compute::upper_bound( in upper_bound()
349 iterator upper_bound(const key_type &value) in upper_bound() function in boost::compute::flat_map
352 iterator iter = upper_bound(value, queue); in upper_bound()
357 const_iterator upper_bound(const key_type &value, command_queue &queue) const in upper_bound() function in boost::compute::flat_map
361 return ::boost::compute::upper_bound( in upper_bound()
369 const_iterator upper_bound(const key_type &value) const in upper_bound() function in boost::compute::flat_map
372 const_iterator iter = upper_bound(value, queue); in upper_bound()
|
| /third_party/boost/boost/compute/container/ |
| D | flat_set.hpp | 170 iterator location = upper_bound(value, queue); in insert()
306 iterator upper_bound(const key_type &value, command_queue &queue) in upper_bound() function in boost::compute::flat_set
308 return ::boost::compute::upper_bound(begin(), end(), value, queue); in upper_bound()
311 iterator upper_bound(const key_type &value) in upper_bound() function in boost::compute::flat_set
314 iterator iter = upper_bound(value, queue); in upper_bound()
319 const_iterator upper_bound(const key_type &value, command_queue &queue) const in upper_bound() function in boost::compute::flat_set
321 return ::boost::compute::upper_bound(begin(), end(), value, queue); in upper_bound()
324 const_iterator upper_bound(const key_type &value) const in upper_bound() function in boost::compute::flat_set
327 const_iterator iter = upper_bound(value, queue); in upper_bound()
|
| D | flat_map.hpp | 181 iterator location = upper_bound(value.first, queue); in insert()
337 iterator upper_bound(const key_type &value, command_queue &queue) in upper_bound() function in boost::compute::flat_map
341 return ::boost::compute::upper_bound( in upper_bound()
349 iterator upper_bound(const key_type &value) in upper_bound() function in boost::compute::flat_map
352 iterator iter = upper_bound(value, queue); in upper_bound()
357 const_iterator upper_bound(const key_type &value, command_queue &queue) const in upper_bound() function in boost::compute::flat_map
361 return ::boost::compute::upper_bound( in upper_bound()
369 const_iterator upper_bound(const key_type &value) const in upper_bound() function in boost::compute::flat_map
372 const_iterator iter = upper_bound(value, queue); in upper_bound()
|
| /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()
|
| /third_party/skia/third_party/externals/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()
|
| /third_party/boost/boost/math/special_functions/ |
| D | legendre_stieltjes.hpp | 176 Real upper_bound; in zeros() local
182 upper_bound = 1; in zeros()
186 upper_bound = legendre_zeros[k]; in zeros()
194 upper_bound = 1; in zeros()
198 upper_bound = legendre_zeros[k+1]; in zeros()
206 auto p = boost::math::tools::bisect(g, lower_bound, upper_bound, tol); in zeros()
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| D | loop_dependence_helpers.cpp | 93 SENode* upper_bound = scalar_evolution_.SimplifyExpression( in GetUpperBound() local
97 return upper_bound; in GetUpperBound()
103 SENode* upper_bound = in GetUpperBound() local
107 return upper_bound; in GetUpperBound()
114 SENode* upper_bound = scalar_evolution_.SimplifyExpression( in GetUpperBound() local
116 return upper_bound; in GetUpperBound()
149 SENode* upper_bound = GetUpperBound(loop); in IsProvablyOutsideOfLoopBounds() local
150 if (!lower_bound || !upper_bound) { in IsProvablyOutsideOfLoopBounds()
164 scalar_evolution_.CreateSubtraction(upper_bound, lower_bound)); in IsProvablyOutsideOfLoopBounds()
170 scalar_evolution_.CreateSubtraction(lower_bound, upper_bound)); in IsProvablyOutsideOfLoopBounds()
|
| /third_party/spirv-tools/source/opt/ |
| D | loop_dependence_helpers.cpp | 93 SENode* upper_bound = scalar_evolution_.SimplifyExpression( in GetUpperBound() local
97 return upper_bound; in GetUpperBound()
103 SENode* upper_bound = in GetUpperBound() local
107 return upper_bound; in GetUpperBound()
114 SENode* upper_bound = scalar_evolution_.SimplifyExpression( in GetUpperBound() local
116 return upper_bound; in GetUpperBound()
149 SENode* upper_bound = GetUpperBound(loop); in IsProvablyOutsideOfLoopBounds() local
150 if (!lower_bound || !upper_bound) { in IsProvablyOutsideOfLoopBounds()
164 scalar_evolution_.CreateSubtraction(upper_bound, lower_bound)); in IsProvablyOutsideOfLoopBounds()
170 scalar_evolution_.CreateSubtraction(lower_bound, upper_bound)); in IsProvablyOutsideOfLoopBounds()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | loop_dependence_helpers.cpp | 93 SENode* upper_bound = scalar_evolution_.SimplifyExpression( in GetUpperBound() local
97 return upper_bound; in GetUpperBound()
103 SENode* upper_bound = in GetUpperBound() local
107 return upper_bound; in GetUpperBound()
114 SENode* upper_bound = scalar_evolution_.SimplifyExpression( in GetUpperBound() local
116 return upper_bound; in GetUpperBound()
149 SENode* upper_bound = GetUpperBound(loop); in IsProvablyOutsideOfLoopBounds() local
150 if (!lower_bound || !upper_bound) { in IsProvablyOutsideOfLoopBounds()
164 scalar_evolution_.CreateSubtraction(upper_bound, lower_bound)); in IsProvablyOutsideOfLoopBounds()
170 scalar_evolution_.CreateSubtraction(lower_bound, upper_bound)); in IsProvablyOutsideOfLoopBounds()
|
| /third_party/grpc/tools/run_tests/performance/ |
| D | massage_qps_stats_helpers.py | 35 upper_bound = boundaries[lower_idx + 1]
36 return (upper_bound - (upper_bound - lower_bound) *
|
| /third_party/boost/boost/mpl/ |
| D | upper_bound.hpp | 57 struct upper_bound struct
123 struct upper_bound
137 BOOST_MPL_AUX_NA_SPEC(2, upper_bound)
|
| /third_party/boost/boost/signals2/detail/ |
| D | slot_groups.hpp | 106 iterator upper_bound(const group_key_type &key) in upper_bound() function in boost::signals2::detail::grouped_list
108 map_iterator map_it = _group_map.upper_bound(key); in upper_bound()
131 map_it = _group_map.upper_bound(key); in push_back()
139 iterator end_list_it = upper_bound(key); in erase()
157 if(next != upper_bound(key)) in erase()
|
| /third_party/boost/libs/phoenix/test/algorithm/ |
| D | querying.cpp | 215 BOOST_TEST(upper_bound(arg1, 2)(array) == array + 2); in upper_bound_test()
216 BOOST_TEST(upper_bound(arg1, 2)(test_set) == test_set.upper_bound(2)); in upper_bound_test()
220 BOOST_TEST(boost::phoenix::upper_bound(arg1, 2, std::greater<int>())(array2) == in upper_bound_test()
222 BOOST_TEST(boost::phoenix::upper_bound(arg1, 2, std::greater<int>())(test_set2) == in upper_bound_test()
223 test_set2.upper_bound(2)); in upper_bound_test()
|
| /third_party/grpc/src/core/lib/debug/ |
| D | stats.cc | 104 double upper_bound; in threshold_for_count_below() local
129 upper_bound = bucket_boundaries[lower_idx + 1]; in threshold_for_count_below()
130 return upper_bound - (upper_bound - lower_bound) * in threshold_for_count_below()
|
| /third_party/boost/boost/icl/ |
| D | interval_base_set.hpp | 366 iterator upper_bound(const value_type& interval) in upper_bound() function in boost::icl::interval_base_set
367 { return _set.upper_bound(interval); } in upper_bound()
372 const_iterator upper_bound(const value_type& interval)const in upper_bound() function in boost::icl::interval_base_set
373 { return _set.upper_bound(interval); } in upper_bound()
378 (_set.lower_bound(interval), _set.upper_bound(interval)); in equal_range()
385 (_set.lower_bound(interval), _set.upper_bound(interval)); in equal_range()
512 iterator last_ = prior(this->_set.upper_bound(addend)); in _add()
532 iterator last_ = prior(this->_set.upper_bound(addend)); in _add()
|
| /third_party/boost/boost/bimap/container_adaptor/ |
| D | ordered_associative_container_adaptor.hpp | 272 BOOST_DEDUCED_TYPENAME base_::iterator upper_bound(const CompatibleKey & k) in upper_bound() function in boost::bimaps::container_adaptor::ordered_associative_container_adaptor
276 this->base().upper_bound( in upper_bound()
283 BOOST_DEDUCED_TYPENAME base_::const_iterator upper_bound(const CompatibleKey & k) const in upper_bound() function in boost::bimaps::container_adaptor::ordered_associative_container_adaptor
287 this->base().upper_bound( in upper_bound()
|