| /third_party/boost/boost/range/algorithm/ |
| D | lower_bound.hpp | 34 lower_bound( ForwardRange& rng, const Value& val ) in lower_bound() function
37 return std::lower_bound(boost::begin(rng), boost::end(rng), val); in lower_bound()
43 lower_bound( const ForwardRange& rng, const Value& val ) in lower_bound() function
46 return std::lower_bound(boost::begin(rng), boost::end(rng), val); in lower_bound()
55 lower_bound( ForwardRange& rng, const Value& val, SortPredicate pred ) in lower_bound() function
58 return std::lower_bound(boost::begin(rng), boost::end(rng), val, pred); in lower_bound()
64 lower_bound( const ForwardRange& rng, const Value& val, SortPredicate pred ) in lower_bound() function
67 return std::lower_bound(boost::begin(rng), boost::end(rng), val, pred); in lower_bound()
76 lower_bound( ForwardRange& rng, const Value& val ) in lower_bound() function
80 pack(std::lower_bound(boost::begin(rng), boost::end(rng), val), in lower_bound()
[all …]
|
| /third_party/boost/boost/math/distributions/detail/ |
| D | generic_mode.hpp | 42 value_type lower_bound; in generic_find_mode() local
64 lower_bound = upper_bound; in generic_find_mode()
69 lower_bound -= step; in generic_find_mode()
71 lower_bound /= 2; in generic_find_mode()
72 v = pdf(dist, lower_bound); in generic_find_mode()
79 lower_bound, in generic_find_mode()
107 value_type lower_bound; in generic_find_mode_01() local
118 lower_bound = upper_bound; in generic_find_mode_01()
122 lower_bound /= 2; in generic_find_mode_01()
123 if(lower_bound < tools::min_value<value_type>()) in generic_find_mode_01()
[all …]
|
| /third_party/boost/boost/spirit/home/support/iterators/ |
| D | line_pos_iterator.hpp | 95 inline Iterator get_line_start(Iterator lower_bound, Iterator current);
102 get_current_line(Iterator lower_bound, Iterator current,
109 inline std::size_t get_column(Iterator lower_bound, Iterator current,
127 inline Iterator get_line_start(Iterator lower_bound, Iterator current) in get_line_start() argument
129 Iterator latest = lower_bound; in get_line_start()
131 for (Iterator i = lower_bound; i != current; ++i) { in get_line_start()
157 get_current_line(Iterator lower_bound, in get_current_line() argument
161 Iterator first = get_line_start(lower_bound, current); in get_current_line()
167 inline std::size_t get_column(Iterator lower_bound, in get_column() argument
172 Iterator first = get_line_start(lower_bound, current); in get_column()
|
| /third_party/boost/libs/range/test/algorithm_test/ |
| D | lower_bound.cpp | 34 iter_t result = boost::lower_bound(cont, 5); in test_iter()
35 BOOST_CHECK( result == boost::lower_bound(boost::make_iterator_range(cont), 5) ); in test_iter()
47 result_t result = boost::lower_bound<return_type>(cont, 5); in operator ()()
48 … BOOST_CHECK( result == boost::lower_bound<return_type>(boost::make_iterator_range(cont), 5) ); in operator ()()
57 return std::lower_bound(cont.begin(), cont.end(), 5); in reference()
69 iter_t result = boost::lower_bound(cont, 5, m_pred); in test_iter()
70 BOOST_CHECK( result == boost::lower_bound( in test_iter()
83 result_t result = boost::lower_bound<return_type>(cont, 5, policy.pred()); in operator ()()
84 BOOST_CHECK( result == boost::lower_bound<return_type>( in operator ()()
94 return std::lower_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)) {\
255 #define WELS_CHECK_SE_LOWER_ERROR(val, lower_bound, syntax_name, ret_code) do {\ argument
256 if (val < lower_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)) {\
275 #define WELS_CHECK_SE_LOWER_ERROR_NOLOG(val, lower_bound, syntax_name, ret_code) do {\ argument
276 if (val < lower_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 | lower_bound.qbk | 6 [section:lower_bound lower_bound]
16 lower_bound(ForwardRange& rng, Value val);
24 lower_bound(ForwardRange& rng, Value val);
32 lower_bound(ForwardRange& rng, Value val, SortPredicate pred);
41 lower_bound(ForwardRange& rng, Value val, SortPredicate pred);
46 The versions of `lower_bound` that return an iterator, returns the first iterator in the range `rng…
52 The versions of `lower_bound` that return a `range_return`, defines `found` in the same manner as t…
56 Defined in the header file `boost/range/algorithm/lower_bound.hpp`
|
| /third_party/boost/libs/compute/test/ |
| D | test_binary_search.cpp | 74 …BOOST_CHECK(boost::compute::lower_bound(vector.begin(), vector.end(), int(0), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
77 …BOOST_CHECK(boost::compute::lower_bound(vector.begin(), vector.end(), int(1), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
80 …BOOST_CHECK(boost::compute::lower_bound(vector.begin(), vector.end(), int(2), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
83 …BOOST_CHECK(boost::compute::lower_bound(vector.begin(), vector.end(), int(4), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
86 …BOOST_CHECK(boost::compute::lower_bound(vector.begin(), vector.end(), int(5), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
89 …BOOST_CHECK(boost::compute::lower_bound(vector.begin(), vector.end(), int(6), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
92 …BOOST_CHECK(boost::compute::lower_bound(vector.begin(), vector.end(), int(7), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
95 …BOOST_CHECK(boost::compute::lower_bound(vector.begin(), vector.end(), int(9), queue) == vector.beg… in BOOST_AUTO_TEST_CASE()
98 …BOOST_CHECK(boost::compute::lower_bound(vector.begin(), vector.end(), int(10), queue) == vector.en… in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/libs/mpl/doc/src/refmanual/ |
| D | lower_bound.rst | 1 .. Algorithms/Querying Algorithms//lower_bound |60
3 lower_bound title
16 struct lower_bound
35 #include <boost/mpl/lower_bound.hpp>
61 typedef lower_bound< s,x,pred >::type i;
91 typedef lower_bound< numbers, int_<3> >::type iter;
|
| /third_party/abseil-cpp/absl/time/ |
| D | clock_test.cc | 52 bool SleepForBounded(absl::Duration d, absl::Duration lower_bound, in SleepForBounded() argument
77 if (lower_bound <= actual && actual <= upper_bound) { in SleepForBounded()
89 const absl::Duration lower_bound = d - early; in AssertSleepForBounded() local
92 if (SleepForBounded(d, lower_bound, upper_bound, timeout, alarm_policy, in AssertSleepForBounded()
97 << "SleepFor(" << d << ") did not return within [" << lower_bound in AssertSleepForBounded()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/time/ |
| D | clock_test.cc | 52 bool SleepForBounded(absl::Duration d, absl::Duration lower_bound, in SleepForBounded() argument
77 if (lower_bound <= actual && actual <= upper_bound) { in SleepForBounded()
89 const absl::Duration lower_bound = d - early; in AssertSleepForBounded() local
92 if (SleepForBounded(d, lower_bound, upper_bound, timeout, alarm_policy, in AssertSleepForBounded()
97 << "SleepFor(" << d << ") did not return within [" << lower_bound in AssertSleepForBounded()
|
| /third_party/boost/libs/compute/include/boost/compute/container/ |
| D | flat_set.hpp | 280 iterator lower_bound(const key_type &value, command_queue &queue) in lower_bound() function in boost::compute::flat_set
282 return ::boost::compute::lower_bound(begin(), end(), value, queue); in lower_bound()
285 iterator lower_bound(const key_type &value) in lower_bound() function in boost::compute::flat_set
288 iterator iter = lower_bound(value, queue); in lower_bound()
293 const_iterator lower_bound(const key_type &value, command_queue &queue) const in lower_bound() function in boost::compute::flat_set
295 return ::boost::compute::lower_bound(begin(), end(), value, queue); in lower_bound()
298 const_iterator lower_bound(const key_type &value) const in lower_bound() function in boost::compute::flat_set
301 const_iterator iter = lower_bound(value, queue); in lower_bound()
|
| D | flat_map.hpp | 297 iterator lower_bound(const key_type &value, command_queue &queue) in lower_bound() function in boost::compute::flat_map
301 return ::boost::compute::lower_bound( in lower_bound()
309 iterator lower_bound(const key_type &value) in lower_bound() function in boost::compute::flat_map
312 iterator iter = lower_bound(value, queue); in lower_bound()
317 const_iterator lower_bound(const key_type &value, command_queue &queue) const in lower_bound() function in boost::compute::flat_map
321 return ::boost::compute::lower_bound( in lower_bound()
329 const_iterator lower_bound(const key_type &value) const in lower_bound() function in boost::compute::flat_map
332 const_iterator iter = lower_bound(value, queue); in lower_bound()
|
| /third_party/boost/boost/compute/container/ |
| D | flat_set.hpp | 280 iterator lower_bound(const key_type &value, command_queue &queue) in lower_bound() function in boost::compute::flat_set
282 return ::boost::compute::lower_bound(begin(), end(), value, queue); in lower_bound()
285 iterator lower_bound(const key_type &value) in lower_bound() function in boost::compute::flat_set
288 iterator iter = lower_bound(value, queue); in lower_bound()
293 const_iterator lower_bound(const key_type &value, command_queue &queue) const in lower_bound() function in boost::compute::flat_set
295 return ::boost::compute::lower_bound(begin(), end(), value, queue); in lower_bound()
298 const_iterator lower_bound(const key_type &value) const in lower_bound() function in boost::compute::flat_set
301 const_iterator iter = lower_bound(value, queue); in lower_bound()
|
| D | flat_map.hpp | 297 iterator lower_bound(const key_type &value, command_queue &queue) in lower_bound() function in boost::compute::flat_map
301 return ::boost::compute::lower_bound( in lower_bound()
309 iterator lower_bound(const key_type &value) in lower_bound() function in boost::compute::flat_map
312 iterator iter = lower_bound(value, queue); in lower_bound()
317 const_iterator lower_bound(const key_type &value, command_queue &queue) const in lower_bound() function in boost::compute::flat_map
321 return ::boost::compute::lower_bound( in lower_bound()
329 const_iterator lower_bound(const key_type &value) const in lower_bound() function in boost::compute::flat_map
332 const_iterator iter = lower_bound(value, queue); in lower_bound()
|
| /third_party/boost/boost/property_map/ |
| D | dynamic_property_map.hpp | 251 iterator lower_bound(const std::string& name) in lower_bound() function
252 { return property_maps.lower_bound(name); } in lower_bound()
254 const_iterator lower_bound(const std::string& name) const in lower_bound() function
255 { return property_maps.lower_bound(name); } in lower_bound()
284 for (dynamic_properties::iterator i = dp.lower_bound(name); in put()
306 for (dynamic_properties::const_iterator i = dp.lower_bound(name); in get()
319 for (dynamic_properties::const_iterator i = dp.lower_bound(name); in get()
332 for (dynamic_properties::const_iterator i = dp.lower_bound(name); in get()
|
| /third_party/boost/boost/signals2/detail/ |
| D | slot_groups.hpp | 101 iterator lower_bound(const group_key_type &key) in lower_bound() function in boost::signals2::detail::grouped_list
103 map_iterator map_it = _group_map.lower_bound(key); in lower_bound()
119 map_it = _group_map.lower_bound(key); in push_front()
137 map_iterator map_it = _group_map.lower_bound(key); in erase()
149 map_iterator map_it = _group_map.lower_bound(key); in erase()
190 map_iterator lower_bound_it = _group_map.lower_bound(key); in m_insert()
|
| /third_party/mindspore/mindspore/ccsrc/backend/kernel_compiler/gpu/cuda_impl/ |
| D | fake_learned_scale_quant_perlayer_impl.cu | 37 float lower_bound = -1.0 * !neg_trunc; in FakeLearnedScaleQuantPerLayerGrad() local
43 } else if (input_div_alpha[i] < lower_bound) { in FakeLearnedScaleQuantPerLayerGrad()
58 float lower_bound = -1.0 * !neg_trunc; in LSQNudgePerLayer() local
63 input_x = max(input_x, lower_bound); in LSQNudgePerLayer()
|
| D | fake_learned_scale_quant_perchannel_impl.cu | 44 float lower_bound = -1.0 * !neg_trunc; in FakeLearnedScaleQuantPerChannelGrad() local
52 } else if (input_div_alpha[i] < lower_bound) { in FakeLearnedScaleQuantPerChannelGrad()
70 float lower_bound = -1.0 * !neg_trunc; in LSQNudgePerChannel() local
76 input_x = max(input_x, lower_bound); in LSQNudgePerChannel()
|
| /third_party/boost/boost/detail/ |
| D | binary_search.hpp | 37 ForwardIter lower_bound(ForwardIter first, ForwardIter last, in lower_bound() function
62 ForwardIter lower_bound(ForwardIter first, ForwardIter last, in lower_bound() function
158 left = boost::detail::lower_bound(first, middle, val); in equal_range()
190 left = boost::detail::lower_bound(first, middle, val, comp); in equal_range()
202 ForwardIter i = boost::detail::lower_bound(first, last, val); in binary_search()
210 ForwardIter i = boost::detail::lower_bound(first, last, val, comp); in binary_search()
|
| /third_party/boost/boost/mpl/ |
| D | lower_bound.hpp | 58 struct lower_bound struct
125 struct lower_bound
139 BOOST_MPL_AUX_NA_SPEC(2, lower_bound)
|
| /third_party/boost/libs/phoenix/test/algorithm/ |
| D | querying.cpp | 198 BOOST_TEST(boost::phoenix::lower_bound(arg1, 2)(array) == array + 1); in lower_bound_test()
199 BOOST_TEST(boost::phoenix::lower_bound(arg1, 2)(test_set) == test_set.lower_bound(2)); in lower_bound_test()
203 BOOST_TEST(boost::phoenix::lower_bound(arg1, 2, std::greater<int>())(array2) == in lower_bound_test()
205 BOOST_TEST(boost::phoenix::lower_bound(arg1, 2, std::greater<int>())(test_set2) == in lower_bound_test()
206 test_set2.lower_bound(2)); in lower_bound_test()
|
| /third_party/boost/boost/numeric/ublas/ |
| D | storage_sparse.hpp | 32 I lower_bound (const I &begin, const I &end, const T &t, C compare) { in lower_bound() function
38 return std::lower_bound (begin, end, t, compare); in lower_bound()
388 … iterator it = detail::lower_bound (begin (), end (), p, detail::less_pair<value_type> ()); in insert()
424 …const_iterator it (detail::lower_bound (begin (), end (), value_type (i, mapped_type (0)), detail:… in find()
431 …iterator it (detail::lower_bound (begin (), end (), value_type (i, mapped_type (0)), detail::less_… in find()
437 const_iterator lower_bound (key_type i) const { in lower_bound() function in boost::numeric::ublas::map_array
438 …return detail::lower_bound (begin (), end (), value_type (i, mapped_type (0)), detail::less_pair<v… in lower_bound()
441 iterator lower_bound (key_type i) { in lower_bound() function in boost::numeric::ublas::map_array
442 …return detail::lower_bound (begin (), end (), value_type (i, mapped_type (0)), detail::less_pair<v… in lower_bound()
|
| /third_party/flutter/skia/third_party/externals/angle2/src/libANGLE/ |
| D | HandleRangeAllocator.cpp | 42 auto current = mUsed.lower_bound(wanted); in allocateAtOrAbove()
123 auto current = mUsed.lower_bound(handle); in markAsUsed()
182 auto current = mUsed.lower_bound(last); in releaseRange()
217 auto current = mUsed.lower_bound(handle); in isUsed()
|
| /third_party/boost/boost/bimap/container_adaptor/ |
| D | ordered_associative_container_adaptor.hpp | 250 BOOST_DEDUCED_TYPENAME base_::iterator lower_bound(const CompatibleKey & k) in lower_bound() function in boost::bimaps::container_adaptor::ordered_associative_container_adaptor
254 this->base().lower_bound( in lower_bound()
261 BOOST_DEDUCED_TYPENAME base_::const_iterator lower_bound(const CompatibleKey & k) const in lower_bound() function in boost::bimaps::container_adaptor::ordered_associative_container_adaptor
265 this->base().lower_bound( in lower_bound()
|
| /third_party/boost/libs/icl/doc/ |
| D | functions_iterator_related.qbk | 20 [[`J T::lower_bound(const key_type&)`] [__Olgn__] [__Olgn__] [__Olgn__] [__Olgn__] ]
35 [[`` iterator T::lower_bound(const key_type& k)
36 const_iterator T::lower_bound(const key_type& key)const``][Returns an iterator that points to the f…
58 Complexity of `lower_bound`, `upper_bound` and `equal_range` are
|