| /third_party/googletest/googlemock/src/ |
| D | gmock-cardinalities.cc | 52 : min_(min >= 0 ? min : 0), in BetweenCardinalityImpl()
53 max_(max >= min_ ? max : min_) { in BetweenCardinalityImpl()
73 int ConservativeLowerBound() const override { return min_; } in ConservativeLowerBound()
77 return min_ <= call_count && call_count <= max_; in IsSatisfiedByCallCount()
87 const int min_; member in testing::__anon933a676b0111::BetweenCardinalityImpl
108 if (min_ == 0) { in DescribeTo()
116 } else if (min_ == max_) { in DescribeTo()
117 *os << "called " << FormatTimes(min_); in DescribeTo()
119 *os << "called at least " << FormatTimes(min_); in DescribeTo()
122 *os << "called between " << min_ << " and " << max_ << " times"; in DescribeTo()
|
| /third_party/boost/boost/xpressive/detail/core/matcher/ |
| D | simple_repeat_matcher.hpp | 67 unsigned int min_, max_; member
73 , min_(min) in simple_repeat_matcher()
117 if(this->min_ > matches) in match_()
130 else if(this->min_ == matches) in match_()
146 for(; matches < this->min_; ++matches) in match_()
176 if(this->min_ > diff_to_end) in match_()
185 BidiIter const min_iter = tmp + this->min_; in match_()
211 if(this->min_ != this->max_) in get_width()
215 return this->min_ * this->width_; in get_width()
|
| D | repeat_end_matcher.hpp | 33 unsigned int min_, max_; member
38 , min_(min) in repeat_end_matcher()
81 else if(--br.repeat_count_ < this->min_) in match_()
97 if(this->min_ <= br.repeat_count_) in match_()
|
| /third_party/boost/boost/accumulators/statistics/ |
| D | min.hpp | 36 : min_(numeric::as_max(args[sample | Sample()])) in min_impl()
43 numeric::min_assign(this->min_, args[sample]); in operator ()()
48 return this->min_; in result()
55 ar & min_; in serialize() local
59 Sample min_; member
|
| /third_party/boost/boost/spirit/home/classic/core/composite/ |
| D | directives.hpp | 443 , min_(min__) {} in min_bounded()
451 if (hit.has_valid_attribute() && hit.value() < min_) in parse()
456 BoundsT min_; member
463 : min_(min__) {} in min_bounded_gen()
468 { return min_bounded<DerivedT, BoundsT>(p.derived(), min_); } in operator []()
470 BoundsT min_; member
475 min_limit_d(BoundsT const& min_) in min_limit_d() argument
476 { return min_bounded_gen<BoundsT>(min_); } in min_limit_d()
564 , min_(min__) in bounded()
574 (hit.value() < min_ || hit.value() > max_)) in parse()
[all …]
|
| /third_party/boost/boost/histogram/axis/ |
| D | regular.hpp | 222 , min_(this->forward(detail::get_scale(start)))
223 , delta_(this->forward(detail::get_scale(stop)) - min_) {
225 if (!std::isfinite(min_) || !std::isfinite(delta_))
294 auto z = (this->forward(x / unit_type{}) - min_) / delta_; in index()
314 const auto z = (this->forward(x / unit_type{}) - min_) / delta_; in update()
321 const auto stop = min_ + delta_; in update()
323 min_ += i * (delta_ / size()); in update()
324 delta_ = stop - min_; in update()
350 z = (1.0 - z) * min_ + z * (min_ + delta_); in value()
371 min_ == o.min_ && delta_ == o.delta_ && in operator ==()
[all …]
|
| D | integer.hpp | 83 , min_(start) {
101 static_cast<double>(x - min_)); in index()
107 const auto i = x - min_; in update()
118 min_ += k; in update()
138 return min_ + i; in value()
163 return size() == o.size() && min_ == o.min_ && in operator ==()
176 ar& make_nvp("min", min_); in serialize()
199 value_type min_{0}; member in boost::histogram::axis::integer
|
| /third_party/boost/boost/graph/ |
| D | tiernan_all_cycles.hpp | 96 min_max_cycle_visitor(std::size_t& min_, std::size_t& max_) in min_max_cycle_visitor()
97 : minimum(min_), maximum(max_) in min_max_cycle_visitor()
115 std::size_t& min_, std::size_t& max_) in find_min_max_cycle() argument
117 return min_max_cycle_visitor(min_, max_); in find_min_max_cycle()
349 std::size_t min_ = (std::numeric_limits< std::size_t >::max)(), max_ = 0; in tiernan_girth_and_circumference() local
350 tiernan_all_cycles(g, find_min_max_cycle(min_, max_)); in tiernan_girth_and_circumference()
354 max_ = min_; in tiernan_girth_and_circumference()
356 return std::make_pair(min_, max_); in tiernan_girth_and_circumference()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/random/ |
| D | log_uniform_int_distribution.h | 60 : min_(min), in min_() function
64 static_cast<unsigned_type>(min_)), in min_()
66 assert(max_ >= min_); in min_()
92 result_type(min)() const { return min_; } in result_type()
97 return a.min_ == b.min_ && a.max_ == b.max_ && a.base_ == b.base_;
110 result_type min_; variable
|
| /third_party/abseil-cpp/absl/random/ |
| D | log_uniform_int_distribution.h | 59 : min_(min), in min_() function
63 static_cast<unsigned_type>(min_)), in min_()
65 assert(max_ >= min_); in min_()
89 result_type(min)() const { return min_; } in result_type()
94 return a.min_ == b.min_ && a.max_ == b.max_ && a.base_ == b.base_;
107 result_type min_; variable
|
| /third_party/mindspore/mindspore/ccsrc/debug/debugger/ |
| D | tensor_summary.cc | 99 min_(std::numeric_limits<double>::max()), in TensorSummary()
136 min_ = std::min(min_, current_value); in SummarizeTensor()
187 min_ = std::min(min_, current_value); in TensorStatistics()
258 return min_; in StatLookup()
261 return max_ - min_; in StatLookup()
297 return min_; in StatLookup()
306 return max_ - min_; in StatLookup()
|
| D | tensor_summary.h | 121 const double min_value() const override { return min_; } in min_value()
136 double min_; variable
|
| /third_party/boost/boost/xpressive/detail/dynamic/ |
| D | dynamic.hpp | 216 … simple_repeat_matcher<Xpr, mpl::true_> quant(xpr, spec.min_, spec.max_, seq.width().value()); in make_simple_repeat()
221 … simple_repeat_matcher<Xpr, mpl::false_> quant(xpr, spec.min_, spec.max_, seq.width().value()); in make_simple_repeat()
294 if(0 == spec.min_) in make_repeat()
312 unsigned int min = spec.min_ ? spec.min_ : 1U; in make_repeat()
329 if(0 == spec.min_) in make_repeat()
|
| D | parser_traits.hpp | 148 spec.min_ = 0; in get_quant_spec()
153 spec.min_ = 1; in get_quant_spec()
158 spec.min_ = 0; in get_quant_spec()
164 spec.min_ = spec.max_ = detail::toi(begin, end, this->traits()); in get_quant_spec()
188 spec.min_ <= spec.max_, error_badbrace, "invalid quantification range" in get_quant_spec()
|
| /third_party/boost/libs/lexical_cast/test/ |
| D | lexical_cast_loopback_test.cpp | 53 T min_ = (std::numeric_limits<T>::min)(); in test_round_conversion() local
54 std::string const min_s = boost::lexical_cast<std::string>(min_); in test_round_conversion()
55 BOOST_CHECK(min_ == lexical_cast<T>(min_s)); in test_round_conversion()
|
| /third_party/re2/re2/ |
| D | simplify.cc | 241 nre->min_ = re->min(); in PostVisit()
345 nre->min_ = 0; in DoCoalesce()
350 nre->min_ = 1; in DoCoalesce()
355 nre->min_ = 0; in DoCoalesce()
360 nre->min_ = r1->min(); in DoCoalesce()
376 nre->min_++; in DoCoalesce()
386 nre->min_ += r2->min(); in DoCoalesce()
397 nre->min_++; in DoCoalesce()
414 nre->min_ += n; in DoCoalesce()
543 Regexp* nre = SimplifyRepeat(newsub, re->min_, re->max_, in PostVisit()
|
| /third_party/flutter/skia/third_party/externals/libwebp/src/utils/ |
| D | quant_levels_dec_utils.c | 66 int min_, max_; // min and max level values member
145 if (v < p->max_ && v > p->min_) { in ApplyFilter()
187 p->min_ = 255; in CountLevels()
192 if (v < p->min_) p->min_ = v; in CountLevels()
199 p->min_level_dist_ = p->max_ - p->min_; in CountLevels()
|
| /third_party/skia/third_party/externals/libwebp/src/utils/ |
| D | quant_levels_dec_utils.c | 66 int min_, max_; // min and max level values member
145 if (v < p->max_ && v > p->min_) { in ApplyFilter()
187 p->min_ = 255; in CountLevels()
192 if (v < p->min_) p->min_ = v; in CountLevels()
199 p->min_level_dist_ = p->max_ - p->min_; in CountLevels()
|
| /third_party/boost/boost/spirit/home/qi/directive/ |
| D | repeat.hpp | 101 finite_iterator(T const min_, T const max_) in finite_iterator()
102 : min BOOST_PREVENT_MACRO_SUBSTITUTION (min_) in finite_iterator()
120 infinite_iterator(T const min_) in infinite_iterator()
121 : min BOOST_PREVENT_MACRO_SUBSTITUTION (min_) {} in infinite_iterator()
|
| /third_party/boost/boost/spirit/home/support/detail/lexer/parser/tokeniser/ |
| D | num_token.hpp | 60 void min_max (const std::size_t min_, const bool comma_, in min_max()
63 _min = min_; in min_max()
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/util/ |
| D | buddy.cc | 47 min_ = BitLeftShift(1, log_min_); in Init()
90 return static_cast<addr_t>(rel_addr * min_); in AllocNoLock()
145 if (min_ == 0) { in SizeToBlock()
149 uint32_t reqSize = (sz / min_); in SizeToBlock()
150 if (sz % min_) { in SizeToBlock()
392 …: hint_(nullptr), count_(nullptr), map_(nullptr), log_min_(log_min), num_lvl_(num_lvl), min_(0), m… in BuddySpace()
|
| D | buddy.h | 60 uint64_t GetMinSize() const { return min_; } in GetMinSize()
95 uint64_t min_; variable
|
| /third_party/iowow/src/utils/ |
| D | iwutils.h | 316 int min_ = (vp1sz_) < (vp2sz_) ? (vp1sz_) : (vp2sz_); \
317 for (int i = 0; i < min_; i++) { \
331 int min_ = (vp1sz_) < (vp2sz_) ? (vp1sz_) : (vp2sz_); \
332 for (int i = 0; i < min_; i++) { \
|
| /third_party/boost/boost/gil/ |
| D | color_base_algorithm.hpp | 453 template <typename P> static typename element_const_reference_type<P>::type min_(const P& p) { in min_() function
454 return mutable_min(min_max_recur<N-1>::min_(p),semantic_at_c<N-1>(p)); in min_()
456 template <typename P> static typename element_reference_type<P>::type min_( P& p) { in min_() function
457 return mutable_min(min_max_recur<N-1>::min_(p),semantic_at_c<N-1>(p)); in min_()
466 …template <typename P> static typename element_const_reference_type<P>::type min_(const P& p) { ret… in min_() function
467 …template <typename P> static typename element_reference_type<P>::type min_( P& p) { ret… in min_() function
494 …nce_type<P>::type static_min(const P& p) { return detail::min_max_recur<size<P>::value>::min_(p); } in static_min()
498 …pe<P>::type static_min( P& p) { return detail::min_max_recur<size<P>::value>::min_(p); } in static_min()
|
| /third_party/mindspore/mindspore/ccsrc/backend/kernel_compiler/cpu/nnacl/int8/ |
| D | add_int8.c | 83 const int8x16_t min_vec = vdupq_n_s8(params->min_); in AddInt8()
158 output[index] = (int8_t)MSMAX(params->min_, MSMIN(out, params->max_)); in AddInt8()
171 const int8x16_t min_vec = vdupq_n_s8(params->min_); in AddOptInt8()
247 output[index] = (int8_t)MSMAX(params->min_, MSMIN(out, params->max_)); in AddOptInt8()
307 const __m128i min_vec = _mm_set1_epi8(params->min_); in AddInt8_AVX2()
411 output[index] = (int8_t)MSMAX(params->min_, MSMIN(out, params->max_)); in AddInt8_AVX2()
423 const __m128i min_vec = _mm_set1_epi8(params->min_); in AddOptInt8_AVX2()
527 output[index] = (int8_t)MSMAX(params->min_, MSMIN(out, params->max_)); in AddOptInt8_AVX2()
|