| /third_party/boost/libs/beast/include/boost/beast/core/impl/ |
| D | flat_buffer.hpp | 47 , max_(alloc_traits::max_size( in basic_flat_buffer()
61 , max_(limit) in basic_flat_buffer()
75 , max_(alloc_traits::max_size(
92 , max_(limit)
106 , max_(other.max_)
125 max_ = other.max_;
135 max_ = other.max_;
157 , max_(other.max_)
174 , max_(other.max_)
190 , max_(other.max_) in basic_flat_buffer()
[all …]
|
| D | multi_buffer.hpp | 467 : max_(alloc_traits::max_size(this->get())) in basic_multi_buffer()
476 : max_(limit) in basic_multi_buffer()
487 , max_(alloc_traits::max_size(this->get())) in basic_multi_buffer()
499 , max_(limit) in basic_multi_buffer()
510 , max_(other.max_) in basic_multi_buffer()
530 , max_(other.max_) in basic_multi_buffer()
562 , max_(other.max_) in basic_multi_buffer()
575 , max_(other.max_) in basic_multi_buffer()
599 , max_(other.max_) in basic_multi_buffer()
614 max_ = other.max_; in operator =()
[all …]
|
| /third_party/boost/boost/beast/core/impl/ |
| D | flat_buffer.hpp | 47 , max_(alloc_traits::max_size( in basic_flat_buffer()
61 , max_(limit) in basic_flat_buffer()
75 , max_(alloc_traits::max_size(
92 , max_(limit)
106 , max_(other.max_)
125 max_ = other.max_;
135 max_ = other.max_;
157 , max_(other.max_)
174 , max_(other.max_)
190 , max_(other.max_) in basic_flat_buffer()
[all …]
|
| D | multi_buffer.hpp | 467 : max_(alloc_traits::max_size(this->get())) in basic_multi_buffer()
476 : max_(limit) in basic_multi_buffer()
487 , max_(alloc_traits::max_size(this->get())) in basic_multi_buffer()
499 , max_(limit) in basic_multi_buffer()
510 , max_(other.max_) in basic_multi_buffer()
530 , max_(other.max_) in basic_multi_buffer()
562 , max_(other.max_) in basic_multi_buffer()
575 , max_(other.max_) in basic_multi_buffer()
599 , max_(other.max_) in basic_multi_buffer()
614 max_ = other.max_; in operator =()
[all …]
|
| /third_party/googletest/googlemock/src/ |
| D | gmock-cardinalities.cc | 53 max_(max >= min_ ? max : min_) { in BetweenCardinalityImpl()
74 int ConservativeUpperBound() const override { return max_; } in ConservativeUpperBound()
77 return min_ <= call_count && call_count <= max_; in IsSatisfiedByCallCount()
81 return call_count >= max_; in IsSaturatedByCallCount()
88 const int max_; member in testing::__anon933a676b0111::BetweenCardinalityImpl
109 if (max_ == 0) { in DescribeTo()
111 } else if (max_ == INT_MAX) { in DescribeTo()
114 *os << "called at most " << FormatTimes(max_); in DescribeTo()
116 } else if (min_ == max_) { in DescribeTo()
118 } else if (max_ == INT_MAX) { in DescribeTo()
[all …]
|
| /third_party/boost/boost/accumulators/statistics/ |
| D | max.hpp | 36 : max_(numeric::as_min(args[sample | Sample()])) in max_impl()
43 numeric::max_assign(this->max_, args[sample]); in operator ()()
48 return this->max_; in result()
55 ar & max_; in serialize() local
59 Sample max_; member
|
| /third_party/boost/boost/xpressive/detail/core/matcher/ |
| D | simple_repeat_matcher.hpp | 67 unsigned int min_, max_; member
74 , max_(max) in simple_repeat_matcher()
102 while(matches < this->max_ && this->xpr_.match(state)) in match_()
112 state.next_search_ = (matches && matches < this->max_) in match_()
162 while(matches++ < this->max_ && this->xpr_.match(state)); in match_()
186 state.cur_ += (std::min)((std::size_t)this->max_, diff_to_end); in match_()
190 state.next_search_ = (diff_to_end && diff_to_end < this->max_) in match_()
211 if(this->min_ != this->max_) in get_width()
|
| D | repeat_end_matcher.hpp | 33 unsigned int min_, max_; member
39 , max_(max) in repeat_end_matcher()
73 if(this->max_ > br.repeat_count_) in match_()
105 if(this->max_ > br.repeat_count_) in match_()
|
| /third_party/boost/boost/spirit/home/classic/core/composite/ |
| D | directives.hpp | 503 , max_(max__) {} in max_bounded()
511 if (hit.has_valid_attribute() && hit.value() > max_) in parse()
516 BoundsT max_; member
523 : max_(max__) {} in max_bounded_gen()
528 { return max_bounded<DerivedT, BoundsT>(p.derived(), max_); } in operator []()
530 BoundsT max_; member
536 max_limit_d(BoundsT const& max_) in max_limit_d() argument
537 { return max_bounded_gen<BoundsT>(max_); } in max_limit_d()
565 , max_(max__) {} in bounded()
574 (hit.value() < min_ || hit.value() > max_)) in parse()
[all …]
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | ssca.cpp | 150 Weight max_) in ssca_visitor()
151 : distance(distance), weight(weight), color(color), max_(max_) {} in ssca_visitor()
160 if (new_distance > max_) in tree_edge()
168 Weight max_; member
236 int max_ = 0; in classify_sets() local
242 if (w > max_) { in classify_sets()
243 max_ = w; in classify_sets()
247 if (w >= max_) in classify_sets()
254 int global_max = all_reduce(pg, max_, boost::parallel::maximum<int>()); in classify_sets()
255 if (max_ < global_max) in classify_sets()
[all …]
|
| /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()
353 if (max_ == 0) 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/mindspore/mindspore/ccsrc/backend/kernel_compiler/gpu/math/ |
| D | cast_all_gpu_kernel.h | 32 …CastAllGpuFwdKernel() : max_(0), input_size_(0), output_size_(0), num_input_(0), is_null_input_(fa… in CastAllGpuFwdKernel()
64 CastAllKernel(inputs_dev, outputs_dev, max_, num_input_, size_dev, stream); in Launch()
84 if (max_ < s) { in Init()
85 max_ = s; in Init()
108 size_t max_; variable
|
| /third_party/boost/libs/lexical_cast/test/ |
| D | lexical_cast_loopback_test.cpp | 49 T max_ = (std::numeric_limits<T>::max)(); in test_round_conversion() local
50 std::string const max_s = boost::lexical_cast<std::string>(max_); in test_round_conversion()
51 BOOST_CHECK(max_ == lexical_cast<T>(max_s)); in test_round_conversion()
57 T max_div137 = max_ / 137; in test_round_conversion()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/random/ |
| D | log_uniform_int_distribution.h | 61 max_(max), in min_()
63 range_(static_cast<unsigned_type>(max_) - in min_()
66 assert(max_ >= min_); in min_()
93 result_type(max)() const { return max_; } in result_type()
97 return a.min_ == b.min_ && a.max_ == b.max_ && a.base_ == b.base_;
111 result_type max_; variable
|
| /third_party/abseil-cpp/absl/random/ |
| D | log_uniform_int_distribution.h | 60 max_(max), in min_()
62 range_(static_cast<unsigned_type>(max_) - in min_()
65 assert(max_ >= min_); in min_()
90 result_type(max)() const { return max_; } in result_type()
94 return a.min_ == b.min_ && a.max_ == b.max_ && a.base_ == b.base_;
108 result_type max_; variable
|
| /third_party/re2/re2/ |
| D | simplify.cc | 242 nre->max_ = re->max(); in PostVisit()
346 nre->max_ = -1; in DoCoalesce()
351 nre->max_ = -1; in DoCoalesce()
356 nre->max_ = 1; in DoCoalesce()
361 nre->max_ = r1->max(); in DoCoalesce()
372 nre->max_ = -1; in DoCoalesce()
377 nre->max_ = -1; in DoCoalesce()
382 nre->max_++; in DoCoalesce()
388 nre->max_ = -1; in DoCoalesce()
390 nre->max_ += r2->max(); in DoCoalesce()
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/debug/debugger/ |
| D | tensor_summary.cc | 100 max_(std::numeric_limits<double>::lowest()), in TensorSummary()
135 max_ = std::max(max_, current_value); in SummarizeTensor()
186 max_ = std::max(max_, current_value); in TensorStatistics()
255 return max_; in StatLookup()
261 return max_ - min_; in StatLookup()
294 return max_; in StatLookup()
306 return max_ - min_; in StatLookup()
|
| /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()
283 if(1 < spec.max_) in make_repeat()
306 BOOST_ASSERT(spec.max_); // we should never get here if max is 0 in make_repeat()
309 if(1 < spec.max_) in make_repeat()
316 repeat_end_matcher<mpl::true_> repeat_end(mark_nbr, min, spec.max_); in make_repeat()
322 repeat_end_matcher<mpl::false_> repeat_end(mark_nbr, min, spec.max_); in make_repeat()
|
| D | parser_traits.hpp | 149 spec.max_ = (std::numeric_limits<unsigned int>::max)(); in get_quant_spec()
154 spec.max_ = (std::numeric_limits<unsigned int>::max)(); in get_quant_spec()
159 spec.max_ = 1; in get_quant_spec()
164 spec.min_ = spec.max_ = detail::toi(begin, end, this->traits()); in get_quant_spec()
173 spec.max_ = detail::toi(begin, end, this->traits()); in get_quant_spec()
182 spec.max_ = (std::numeric_limits<unsigned int>::max)(); in get_quant_spec()
188 spec.min_ <= spec.max_, error_badbrace, "invalid quantification range" in get_quant_spec()
|
| /third_party/mindspore/mindspore/ccsrc/frontend/parallel/allreduce_fusion/ |
| D | allreduce_graph.h | 43 max_(0) {} in AllreduceGraph()
66 double max() const { return max_; } in max()
80 double max_; variable
|
| D | allreduce_graph.cc | 87 if (to_arnode->AddPrev(from_arnode, dist, &max_) != SUCCESS) { in AddEdge()
91 max_ = std::max(max_, to_arnode->depend_feat_size()); in AddEdge()
122 if ((arnode.depend_feat_size() - max_ <= EPS) && arnode.depend_feat_size() >= to) { in GetParaByParaSize()
145 MS_LOG(INFO) << "max: " << max_; in PrintAllredueGraphInfo()
|
| /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()
188 p->max_ = 0; in CountLevels()
193 if (v > p->max_) p->max_ = 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()
188 p->max_ = 0; in CountLevels()
193 if (v > p->max_) p->max_ = v; in CountLevels()
199 p->min_level_dist_ = p->max_ - p->min_; in CountLevels()
|
| /third_party/boost/libs/coroutine/example/symmetric/ |
| D | merge_arrays.cpp | 22 std::size_t max_; member in merger
33 while ( to_.size() < max_) in run_()
47 max_( max), in merger()
|
| /third_party/boost/libs/beast/include/boost/beast/core/ |
| D | flat_buffer.hpp | 96 std::size_t max_; member in boost::beast::basic_flat_buffer
336 max_ = n; in max_size()
413 return max_; in max_size()
|