| /external/icu4c/test/perf/charperf/ |
| charperf.cpp | 70 MIN_ = 0;
81 MIN_ = atoi(options[MIN_OPTION_].value);
128 return new CharPerfFunction(isAlpha, MIN_, MAX_);
133 return new CharPerfFunction(isUpper, MIN_, MAX_);
138 return new CharPerfFunction(isLower, MIN_, MAX_);
143 return new CharPerfFunction(isDigit, MIN_, MAX_);
148 return new CharPerfFunction(isSpace, MIN_, MAX_);
153 return new CharPerfFunction(isAlphaNumeric, MIN_, MAX_);
163 return new CharPerfFunction(isPrint, MIN_, MAX_);
168 return new CharPerfFunction(isControl, MIN_, MAX_)
[all...] |
| charperf.h | 27 for (UChar32 i = MIN_; i < MAX_; i ++) {
34 return MAX_ - MIN_;
39 MIN_ = min;
45 UChar32 MIN_;
56 for (wchar_t i = MIN_; i < MAX_; i ++) {
63 return MAX_ - MIN_;
69 MIN_ = min;
79 wchar_t MIN_;
115 UChar32 MIN_;
|
| /external/chromium-trace/trace-viewer/src/ |
| range.js | 28 this.min_ = undefined;
37 this.min_ = undefined;
55 this.min_ = value;
60 this.min_ = Math.min(this.min_, value);
66 return this.min_;
|
| /external/chromium/testing/gmock/src/ |
| gmock-cardinalities.cc | 53 : 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::__anon5233::BetweenCardinalityImpl
108 if (min_ == 0) {
116 } else if (min_ == max_) {
117 *os << "called " << FormatTimes(min_);
119 *os << "called at least " << FormatTimes(min_);
[all...] |
| /external/ceres-solver/docs/ |
| nnlsq.tex | 17 \arg\min_{m,c} \sum_{i=1}^k (y_i - m x_i - c)^2.
21 \arg\min_{m,c} \sum_{i=1}^k \left(y_i - e^{m x_i + c}\right)^2.
|
| solving.tex | 17 \min_{\Delta x} \frac{1}{2}\|J(x)\Delta x + F(x)\|^2
31 \STATE{Solve $\arg \min_{\Delta x} \frac{1}{2}\|J(x)\Delta x + F(x)\|^2$ s.t. $\|D(x)\Delta x\|^2 \le \mu$}
51 \arg\min_{\Delta x}& \frac{1}{2}\|J(x)\Delta x + F(x)\|^2 \\
63 \arg\min_{\Delta x}& \frac{1}{2}\|J(x)\Delta x + F(x)\|^2 +\lambda \|D(x)\Delta x\|^2
67 \arg\min_{\Delta x}& \frac{1}{2}\|J(x)\Delta x + F(x)\|^2 + \frac{1}{\mu} \|D(x)\Delta x\|^2
74 \min_{\Delta x} \frac{1}{2} \|J(x)\Delta x + f(x)\|^2 .
93 \Delta x^{\text{Gauss-Newton}} &= \arg \min_{\Delta x}\frac{1}{2} \|J(x)\Delta x + f(x)\|^2.\\
218 \min_{\Delta x} \frac{1}{2} \|J(x)\Delta x + f(x)\|^2 .
[all...] |
| /external/regex-re2/re2/ |
| regexp.h | 120 // 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::__anon14710::__anon14711
|
| simplify.cc | 277 Regexp* nre = SimplifyRepeat(newsub, re->min_, re->max_,
|
| regexp.cc | 278 re->min_ = min;
|
| parse.cc | 485 re->min_ = min;
[all...] |
| /external/v8/src/ |
| ast.h | 2435 int min_; member in class:v8::internal::RegExpQuantifier
[all...] |
| /external/chromium/chrome/browser/chromeos/cros/ |
| network_library.h | 205 const std::string& min() const { return MIN_; }
255 std::string MIN_;
[all...] |
| network_library.cc | [all...] |
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/ |
| BinaryDictIOTests.java | 141 // Code points between MIN_ and MAX_SURROGATE are not valid on their own.
|
| /external/ceres-solver/internal/ceres/ |
| gmock_gtest_all.cc | [all...] |
| /external/chromium-trace/ |
| script.js | 25 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(c){c.isEmpty||(this.addValue(c.min),this.addValue(c.max))},addValue:function(c){this.isEmpty_?(this.min_=this.max_=c,this.isEmpty_=!1):(this.max_=Math.max(this.max_,c),this.min_=Math.min(this.min_,c))},get min(){return this.isEmpty_?void 0:this.min_},get max(){return this.isEmpty_?
[all...] |
