Searched refs:min_ (Results 1 - 24 of 24) sorted by relevance

/external/chromium-trace/trace-viewer/src/base/
H A Dbbox2.js21 this.min_ = undefined;
30 this.min_ = undefined;
41 this.addVec2(bbox2.min_);
57 this.min_ = vec2.create();
59 vec2.set(this.min_, x, y);
65 this.min_[0] = Math.min(this.min_[0], x);
66 this.min_[1] = Math.min(this.min_[1], y);
75 this.min_
[all...]
H A Drange.js14 this.min_ = undefined;
23 this.min_ = undefined;
41 this.min_ = value;
46 this.min_ = Math.min(this.min_, value);
52 return this.min_;
64 return this.max_ - this.min_;
68 return (this.min_ + this.max_) * 0.5;
74 return a.min_ - b.min_;
[all...]
/external/chromium_org/tools/telemetry/telemetry/core/timeline/
H A Dbounds.py9 self.min_ = None
20 return self.min_
32 return self.max_ - self.min_
36 return (self.min_ + self.max_) * 0.5
41 self.min_ = None
47 self.AddValue(bounds.min_)
53 self.min_ = value
58 self.min_ = min(self.min_, value)
63 return a.min_
[all...]
/external/chromium/testing/gmock/src/
H A Dgmock-cardinalities.cc53 : min_(min >= 0 ? min : 0),
54 max_(max >= min_ ? max : min_) {
74 virtual int ConservativeLowerBound() const { return min_; }
78 return min_ <= call_count && call_count <= max_ ;
87 const int min_; member in class:testing::__anon3290::BetweenCardinalityImpl
108 if (min_ == 0) {
116 } else if (min_ == max_) {
117 *os << "called " << FormatTimes(min_);
119 *os << "called at least " << FormatTimes(min_);
[all...]
/external/chromium_org/third_party/leveldatabase/src/util/
H A Dhistogram.cc34 min_ = kBucketLimit[kNumBuckets-1];
51 if (min_ > value) min_ = value;
59 if (other.min_ < min_) min_ = other.min_;
86 if (r < min_) r = min_;
114 (num_ == 0.0 ? 0.0 : min_), Media
[all...]
H A Dhistogram.h24 double min_; member in class:leveldb::Histogram
/external/chromium_org/base/metrics/
H A Dhistogram_samples.cc26 HistogramBase::Sample min_; member in class:base::__anon3830::SampleCountPickleIterator
44 if (!iter_->ReadInt(&min_) ||
54 *min = min_;
/external/chromium_org/v8/src/
H A Dcounters.cc56 CreateHistogram(name_, min_, max_, num_buckets_);
H A Dcounters.h194 min_(min),
231 int min_; member in class:v8::internal::Histogram
H A Dast.h2609 min_(min),
2634 int min() { return min_; }
2643 int min_; member in class:v8::internal::RegExpQuantifier
/external/chromium_org/ash/wm/workspace/
H A Dworkspace_window_resizer.cc268 min_(min),
272 min_ = size_;
278 return size_ == (shrinking ? min_ : max_);
286 return min_ != 0;
302 return has_min() && size_ < min_;
311 if (has_min() && new_value < min_) {
312 size_ = min_;
313 return new_value - min_;
327 int min_; member in class:ash::internal::WindowSize
/external/chromium_org/third_party/re2/re2/
H A Dregexp.h120 // Matches sub_[0] at least min_ times, at most max_ times.
326 int min() { DCHECK_EQ(op_, kRegexpRepeat); return min_; }
549 int min_; member in struct:re2::Regexp::__anon13464::__anon13465
H A Dsimplify.cc277 Regexp* nre = SimplifyRepeat(newsub, re->min_, re->max_,
H A Dregexp.cc278 re->min_ = min;
H A Dparse.cc485 re->min_ = min;
/external/regex-re2/re2/
H A Dregexp.h120 // Matches sub_[0] at least min_ times, at most max_ times.
326 int min() { DCHECK_EQ(op_, kRegexpRepeat); return min_; }
549 int min_; member in struct:re2::Regexp::__anon25173::__anon25174
H A Dsimplify.cc277 Regexp* nre = SimplifyRepeat(newsub, re->min_, re->max_,
H A Dregexp.cc278 re->min_ = min;
H A Dparse.cc485 re->min_ = min;
/external/chromium_org/chrome/browser/policy/
H A Dconfiguration_policy_handler.h113 int min_; member in class:policy::IntRangePolicyHandlerBase
H A Dconfiguration_policy_handler.cc247 min_(min),
274 if (value < min_ || value > max_) {
284 value = std::min(std::max(value, min_), max_);
/external/chromium_org/chrome/browser/chromeos/cros/
H A Dnetwork_library.h101 const std::string& min() const { return min_; }
184 void set_min(const std::string& min) { min_ = min; }
276 std::string min_; member in class:chromeos::NetworkDevice
/external/chromium-trace/
H A Dscript.js123 base.exportTo("base",function(){function d(){this.isEmpty_=!0;this.max_=this.min_=void 0}d.prototype={__proto__:Object.prototype,reset:function(){this.isEmpty_=!0;this.max_=this.min_=void 0},get isEmpty(){return this.isEmpty_},addRange:function(b){b.isEmpty||(this.addValue(b.min),this.addValue(b.max))},addValue:function(b){this.isEmpty_?(this.min_=this.max_=b,this.isEmpty_=!1):(this.max_=Math.max(this.max_,b),this.min_=Math.min(this.min_,b))},get min(){return this.isEmpty_?void 0:this.min_},get max(){return this.isEmpty_?
124 void 0:this.max_},get range(){return this.isEmpty_?void 0:this.max_-this.min_},get center(){return 0.5*(this.min_+this.max_)}};d.compareByMinTimes=function(b,a){return b.isEmpty||a.isEmpty?b.isEmpty&&!a.isEmpty?-1:!b.isEmpty&&a.isEmpty?1:0:b.min_-a.min_};retur
[all...]
/external/v8/src/
H A Dast.h2401 min_(min),
2426 int min() { return min_; }
2435 int min_; member in class:v8::internal::RegExpQuantifier

Completed in 639 milliseconds